全文获取类型
收费全文 | 2563篇 |
免费 | 196篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 37篇 |
综合类 | 1篇 |
化学工业 | 679篇 |
金属工艺 | 51篇 |
机械仪表 | 46篇 |
建筑科学 | 68篇 |
矿业工程 | 4篇 |
能源动力 | 90篇 |
轻工业 | 245篇 |
水利工程 | 21篇 |
石油天然气 | 2篇 |
无线电 | 230篇 |
一般工业技术 | 540篇 |
冶金工业 | 142篇 |
原子能技术 | 18篇 |
自动化技术 | 590篇 |
出版年
2024年 | 5篇 |
2023年 | 39篇 |
2022年 | 83篇 |
2021年 | 115篇 |
2020年 | 85篇 |
2019年 | 77篇 |
2018年 | 81篇 |
2017年 | 84篇 |
2016年 | 108篇 |
2015年 | 94篇 |
2014年 | 123篇 |
2013年 | 170篇 |
2012年 | 204篇 |
2011年 | 229篇 |
2010年 | 171篇 |
2009年 | 149篇 |
2008年 | 153篇 |
2007年 | 127篇 |
2006年 | 127篇 |
2005年 | 79篇 |
2004年 | 72篇 |
2003年 | 60篇 |
2002年 | 42篇 |
2001年 | 25篇 |
2000年 | 20篇 |
1999年 | 23篇 |
1998年 | 44篇 |
1997年 | 31篇 |
1996年 | 16篇 |
1995年 | 14篇 |
1994年 | 15篇 |
1993年 | 18篇 |
1992年 | 5篇 |
1991年 | 15篇 |
1990年 | 4篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 6篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1979年 | 6篇 |
1977年 | 2篇 |
1975年 | 3篇 |
1971年 | 1篇 |
1967年 | 1篇 |
1931年 | 1篇 |
排序方式: 共有2764条查询结果,搜索用时 15 毫秒
41.
42.
José Hernández-Orallo Cèsar Ferri Nicolas Lachiche Adolfo Martínez-Usó M. José Ramírez-Quintana 《Data mining and knowledge discovery》2016,30(4):848-890
Some supervised tasks are presented with a numerical output but decisions have to be made in a discrete, binarised, way, according to a particular cutoff. This binarised regression task is a very common situation that requires its own analysis, different from regression and classification—and ordinal regression. We first investigate the application cases in terms of the information about the distribution and range of the cutoffs and distinguish six possible scenarios, some of which are more common than others. Next, we study two basic approaches: the retraining approach, which discretises the training set whenever the cutoff is available and learns a new classifier from it, and the reframing approach, which learns a regression model and sets the cutoff when this is available during deployment. In order to assess the binarised regression task, we introduce context plots featuring error against cutoff. Two special cases are of interest, the \( UCE \) and \( OCE \) curves, showing that the area under the former is the mean absolute error and the latter is a new metric that is in between a ranking measure and a residual-based measure. A comprehensive evaluation of the retraining and reframing approaches is performed using a repository of binarised regression problems created on purpose, concluding that no method is clearly better than the other, except when the size of the training data is small. 相似文献
43.
Nicolas?PécheuxEmail author Alexandre?Allauzen Jan?Niehues Fran?ois?Yvon 《Language Resources and Evaluation》2016,50(2):375-410
In Statistical Machine Translation (SMT), the constraints on word reorderings have a great impact on the set of potential translations that is explored during search. Notwithstanding computational issues, the reordering space of a SMT system needs to be designed with great care: if a larger search space is likely to yield better translations, it may also lead to more decoding errors, because of the added ambiguity and the interaction with the pruning strategy. In this paper, we study the reordering search space, using a state-of-the art translation system, where all reorderings are represented in a permutation lattice prior to decoding. This allows us to directly explore and compare different reordering schemes and oracle settings. We also study in detail a rule-based preordering system, varying the length and number of rules, the tagset used, as well as contrasting with purely combinatorial subsets of permutations. We carry out experiments on three language pairs in both directions: English-French, a close language pair; English-German and English-Czech, two much more challenging pairs. We show that even though it might be desirable to design better reordering spaces, model and search errors seem to be the most important issues. Therefore, improvements of the reordering space should come along with improvements of the associated models to be really effective. 相似文献
44.
Lamia?Ben?HamoudaEmail author Mounir?Ayadi Nicolas?Langlois 《International Journal of Control, Automation and Systems》2016,14(2):443-451
This paper proposes a Fuzzy Fault Tolerant Predictive Control (FFTPC) with integral action method for a class of nonlinear systems. The Takagi-Sugeno (T-S) fuzzy approach is introduced as a modelling technique in order to consider the active control methods adapted to linear models. The proposed control strategy is based on a combination between Parallel Distributed Compensation (PDC) control law and Model Predictive Control (MPC) where the T-S fuzzy aspect uses the Unmeasurable Premise Variables (UPV). A T-S fuzzy observer provides an L2 norm estimation of system state vector and faults. The controller and observer gains are obtained by solving Linear Matrix Inequalities (LMIs) derived from the Lyapunov theory. The validity of the proposed Fault Tolerant Control (FTC) strategy is illustrated through an application to a Diesel Engine Air Path (DEAP) system. 相似文献
45.
46.
A new type of velocimeter, capable of local velocity measurements in conducting fluids, is introduced. The principle of the "magnetic-distortion probe" is based on the measurement of the induced magnetic field by the flow of a conducting fluid in the vicinity of a localized magnetic field. The new velocimeter has no moving parts, and can be enclosed in a sealed cap, easing the implementation in harsh environments, such as liquid metals. The proposed method allows one to probe both the continuous part and fluctuations of the velocity, the temporal and spatial resolution being linked to the actual geometric configuration of the probe. A prototype probe has been tested in a gallinstan pipe flow and in a fully turbulent flow of liquid gallium generated by the counter rotation of two coaxial impellers in a cylinder. The signals have been compared to a reference potential probe and show very good agreement both for time-averaged velocities and turbulent fluctuations. The prototype is shown to detect motion from a few cm s(-1) to a few m s(-1). Moreover, the use of the magnetic-distortion probe with large-scale applied magnetic field is discussed. 相似文献
47.
In this article, the authors compare offshore outsourcing and the internal offshoring of software development. Empirical evidence is presented from a case study conducted in five companies. Based on a detailed literature review, a framework was developed that guided the authors' analysis of the differences in the challenges faced by companies and the patterns of evolution in the practice of software development in each business model. 相似文献
48.
49.
Catherine Soladié Nicolas Stoiber Renaud Séguier 《Computer Vision and Image Understanding》2013,117(11):1598-1609
Facial expressions analysis plays an important part in emotion detection. However, having an automatic and non-intrusive system to detect blended facial expression is still a challenging problem, especially when the subject is unknown to the system. Here, we propose a method that adapts to the morphology of the subject and that is based on a new invariant representation of facial expressions. In our system, one expression is defined by its relative position to 8 other expressions. As the mode of representation is relative, we show that the resulting expression space is person-independent. The 8 expressions are synthesized for each unknown subject from plausible distortions. Recognition tasks are performed in this space with a basic algorithm. The experiments have been performed on 22 different blended expressions and on either known or unknown subjects. The recognition results on known subjects demonstrate that the representation is robust to the type of data (shape and/or texture information) and to the dimensionality of the expression space. The recognition results on 22 expressions of unknown subjects show that a dimensionality of the expression space of 4 is enough to outperform traditional methods based on active appearance models and accurately describe an expression. 相似文献
50.
Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables $\mathcal{M}$ , with the same constraint C defined by a finite-state automaton $\mathcal{A}$ on each row of $\mathcal{M}$ and a global cardinality constraint $\mathit{gcc}$ on each column of $\mathcal{M}$ . We give two methods for deriving, by double counting, necessary conditions on the cardinality variables of the $\mathit{gcc}$ constraints from the automaton $\mathcal{A}$ . The first method yields linear necessary conditions and simple arithmetic constraints. The second method introduces the cardinality automaton, which abstracts the overall behaviour of all the row automata and can be encoded by a set of linear constraints. We also provide a domain consistency filtering algorithm for the conjunction of lexicographic ordering constraints between adjacent rows of $\mathcal{M}$ and (possibly different) automaton constraints on the rows. We evaluate the impact of our methods in terms of runtime and search effort on a large set of nurse rostering problem instances. 相似文献