全文获取类型
收费全文 | 1832篇 |
免费 | 54篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 1888篇 |
出版年
2023年 | 11篇 |
2022年 | 21篇 |
2021年 | 44篇 |
2020年 | 24篇 |
2019年 | 28篇 |
2018年 | 21篇 |
2017年 | 21篇 |
2016年 | 56篇 |
2015年 | 52篇 |
2014年 | 61篇 |
2013年 | 103篇 |
2012年 | 77篇 |
2011年 | 103篇 |
2010年 | 50篇 |
2009年 | 83篇 |
2008年 | 86篇 |
2007年 | 76篇 |
2006年 | 62篇 |
2005年 | 69篇 |
2004年 | 60篇 |
2003年 | 38篇 |
2002年 | 48篇 |
2001年 | 23篇 |
2000年 | 19篇 |
1999年 | 32篇 |
1998年 | 39篇 |
1997年 | 24篇 |
1996年 | 25篇 |
1995年 | 26篇 |
1994年 | 20篇 |
1993年 | 28篇 |
1992年 | 20篇 |
1991年 | 17篇 |
1990年 | 16篇 |
1988年 | 11篇 |
1987年 | 21篇 |
1986年 | 17篇 |
1985年 | 16篇 |
1984年 | 26篇 |
1983年 | 24篇 |
1982年 | 17篇 |
1981年 | 18篇 |
1980年 | 22篇 |
1978年 | 10篇 |
1976年 | 14篇 |
1975年 | 21篇 |
1973年 | 12篇 |
1971年 | 10篇 |
1970年 | 10篇 |
1937年 | 10篇 |
排序方式: 共有1888条查询结果,搜索用时 5 毫秒
41.
42.
Incremental Linear Discriminant Analysis Using Sufficient Spanning Sets and Its Applications 总被引:1,自引:0,他引:1
Tae-Kyun Kim Björn Stenger Josef Kittler Roberto Cipolla 《International Journal of Computer Vision》2011,91(2):216-232
This paper presents an incremental learning solution for Linear Discriminant Analysis (LDA) and its applications to object
recognition problems. We apply the sufficient spanning set approximation in three steps i.e. update for the total scatter matrix, between-class scatter matrix and the projected data
matrix, which leads an online solution which closely agrees with the batch solution in accuracy while significantly reducing
the computational complexity. The algorithm yields an efficient solution to incremental LDA even when the number of classes
as well as the set size is large. The incremental LDA method has been also shown useful for semi-supervised online learning.
Label propagation is done by integrating the incremental LDA into an EM framework. The method has been demonstrated in the
task of merging large datasets which were collected during MPEG standardization for face image retrieval, face authentication
using the BANCA dataset, and object categorisation using the Caltech101 dataset. 相似文献
43.
A procedure is presented to automatically assign a modified Pfafstetter code to a stream network and its associated watersheds. The first step is to build a topological network according to the object-oriented Arc Hydro framework definition in ArcGIS. These network relations are then mapped into a code that fully represents the stream hierarchy of a basin in a single attribute. Its use does not depend on ArcGIS object orientation and facilitates simple hierarchical aggregation and querying using only the attribute tables of shapefile versions of the stream network and watershed datasets. The code was implemented for the whole of Austria to support the flexible presentation and user-defined aggregation of water balance results in the digital version of the Hydrological Atlas of Austria. 相似文献
44.
45.
46.
OBJECTIVE: An evaluation study was conducted to answer the question of which system properties of night vision enhancement systems (NVESs) provide a benefit for drivers without increasing their workload. BACKGROUND: Different infrared sensor, image processing, and display technologies can be integrated into an NVES to support nighttime driving. Because each of these components has its specific strengths and weaknesses, careful testing is required to determine their best combination. METHOD: Six prototypical systems were assessed in two steps. First, a heuristic evaluation with experts from ergonomics, perception, and traffic psychology was conducted. It produced a broad overview of possible effects of system properties on driving. Based on these results, an experimental field study with 15 experienced drivers was performed. Criteria used to evaluate the development potential of the six prototypes were the usability dimensions of effectiveness, efficiency, and user satisfaction (International Organization for Standardization, 1998). RESULTS: Results showed that the intelligibility of information, the easiness with which obstacles could be located in the environment, and the position of the display presenting the output of the system were of crucial importance for the usability of the NVES and its acceptance. Conclusion: All relevant requirements are met best by NVESs that are positioned at an unobtrusive location and are equipped with functions for the automatic identification of objects and for event-based warnings. APPLICATION: These design recommendations and the presented approach to evaluate the systems can be directly incorporated into the development process of future NVESs. 相似文献
47.
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we motivate and explore this idea in the concrete setting of lists and trees. We show that the inhabitants of membership predicates are precisely the inhabitants of a generic shape type. We show that membership of x (of type T) in structure S, (xTS) can not, in general, index all parts of a structure S and we generalize to a form ρS where ρ is a predicate over S. Under this scheme, (λx.True)S is the set of all indexes into S, but we show that not all subsets of indexes are expressible by strictly local predicates. Accordingly, we extend our membership predicates to predicates that retain state “from above” as well as allow “looking below”. Predicates of this form are complete in the sense that they can express every subset of indexes in S. These ideas are motivated by experience programming in Nuprl's constructive type theory and examining the constructive content of mechanically checked formal proofs involving membership predicates. 相似文献
48.
49.
In this paper, a novel inverse random under sampling (IRUS) method is proposed for the class imbalance problem. The main idea is to severely under sample the majority class thus creating a large number of distinct training sets. For each training set we then find a decision boundary which separates the minority class from the majority class. By combining the multiple designs through fusion, we construct a composite boundary between the majority class and the minority class. The proposed methodology is applied on 22 UCI data sets and experimental results indicate a significant increase in performance when compared with many existing class-imbalance learning methods. We also present promising results for multi-label classification, a challenging research problem in many modern applications such as music, text and image categorization. 相似文献
50.
Josef Widder Martin Biely Günther Gridling Bettina Weiss Jean-Paul Blanquart 《Distributed Computing》2012,24(6):299-321
We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed
behavior before they eventually crash. We call this failure model “mortal Byzantine”. After discussing some application examples
where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required
number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand,
we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems
with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty
steps that actually lead to a crash in synchronous systems. 相似文献