全文获取类型
收费全文 | 4858篇 |
免费 | 511篇 |
国内免费 | 443篇 |
学科分类
工业技术 | 5812篇 |
出版年
2024年 | 9篇 |
2023年 | 33篇 |
2022年 | 54篇 |
2021年 | 83篇 |
2020年 | 87篇 |
2019年 | 78篇 |
2018年 | 89篇 |
2017年 | 114篇 |
2016年 | 155篇 |
2015年 | 184篇 |
2014年 | 280篇 |
2013年 | 318篇 |
2012年 | 329篇 |
2011年 | 373篇 |
2010年 | 320篇 |
2009年 | 390篇 |
2008年 | 428篇 |
2007年 | 423篇 |
2006年 | 371篇 |
2005年 | 310篇 |
2004年 | 283篇 |
2003年 | 265篇 |
2002年 | 176篇 |
2001年 | 103篇 |
2000年 | 112篇 |
1999年 | 78篇 |
1998年 | 53篇 |
1997年 | 57篇 |
1996年 | 41篇 |
1995年 | 28篇 |
1994年 | 32篇 |
1993年 | 16篇 |
1992年 | 25篇 |
1991年 | 19篇 |
1990年 | 18篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 11篇 |
1984年 | 6篇 |
1983年 | 4篇 |
1982年 | 3篇 |
1981年 | 5篇 |
1980年 | 3篇 |
1976年 | 3篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1962年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有5812条查询结果,搜索用时 17 毫秒
21.
This paper explains the manufacturing process of a composite train carbody with a sandwich composite structure for bodyshell and a stainless steel structure for the under frame. In addition, the structural behavior and safety of the composite carbody of the Korean tilting train was investigated by the static load tests. From the test results, the stiffness of the composite carbody met the specified design. In the aspect of strength, the maximum stress of the composite bodyshell was of 12.2% of strength of CF1263 carbon/epoxy. 相似文献
22.
Bernard Grabot Laurent Geneste Arnaud Dupeux 《Journal of Intelligent Manufacturing》1994,5(5):303-313
Most of the available industrial schedulers are based on a simulation approach using dispatching rules. These rules are often dedicated to the satisfaction of a single performance criterion, and are used whatever the characteristics of the workshop or of the set of jobs. An approach which allows one to bring in compromises between rules is set out in this paper. These compromises can be parametered in accordance with the objectives of the workshop and the characteristics of the jobs in order to introduce some reactivity in the decision system. Three ways to set up the parameters are compared: experimental design, fuzzy expert system and neural network. The method allowing one to define compromises can be implemented on each scheduler that uses a simulation approach. Tests have been made with an industrial scheduler called SIPAPLUS, the results of which are developed in this paper. 相似文献
23.
24.
Bonifacio Llamazares 《Information Sciences》2007,177(21):4745-4756
One of the most important issues in the theory of OWA operators is the determination of associated weights. This matter is essential in order to use the best-suited OWA operator in each aggregation process. Given that some aggregation processes can be seen as extensions of majority rules to the field of gradual preferences, it is possible to determine the OWA operator weights by taking into account the class of majority rule that we want to obtain when individuals do not grade their pairwise preferences. However, a difficulty with this approach is that the same majority rule can be obtained through a wide variety of OWA operators. For this reason, a model for selecting the best-suited OWA operators is proposed in this paper. 相似文献
25.
In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude. 相似文献
26.
本文对国内外电梯交通配置设计现状及发展趋势作了论述。指出了由统计特性描述进入到采用专家系统和模糊规则的动态特性描述这一总的发展趋势。 相似文献
27.
本文用C/C 语言研制了一个计算机辅助设计软件,可以自动设计PLC的SFC应用程序,并针对具体机型S7—200,利用其编程软件,将程序快速下载到PLC,极大地提高了效率。 相似文献
28.
Tree-based partitioning of date for association rule mining 总被引:1,自引:1,他引:0
The most computationally demanding aspect of Association Rule Mining is the identification and counting of support of the frequent sets of items that occur together sufficiently often to be the basis of potentially interesting rules. The task increases in difficulty with the scale of the data and also with its density. The greatest challenge is posed by data that is too large to be contained in primary memory, especially when high data density and/or low support thresholds give rise to very large numbers of candidates that must be counted. In this paper, we consider strategies for partitioning the data to deal effectively with such cases. We describe a partitioning approach which organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds.
Shakil Ahmed received a first class BSc (Hons) degree from Dhaka University, Bangladesh, in 1990; and an MSc (first class), also Dhaka University, in 1992. He received his PhD from The University of Liverpool, UK, in 2005. From 2000 onwards he is a member of the Data Mining Group at the Department of Computer Science of the University of Liverpool, UK. His research interests include data mining, Association Rule Mining and pattern recognition.
Frans Coenen has been working in the field of Data Mining for many years and has written widely on the subject. He received his PhD from Liverpool Polytechnic in 1989, after which he took up a post as a RA within the Department of Computer Science at the University of Liverpool. In 1997, he took up a lecturing post within the same department. His current Data Mining research interests include Association rule Mining, Classification algorithms and text mining. He is on the programme committee for ICDM'05 and was the chair for the UK KDD symposium (UKKDD'05).
Paul Leng is professor of e-Learning at the University of Liverpool and director of the e-Learning Unit, which is responsible for overseeing the University's online degree programmes, leading to degrees of MSc in IT and MBA. Along with e-Learning, his main research interests are in Data Mining, especially in methods of discovering Association Rules. In collaboration with Frans Coenen, he has developed efficient new algorithms for finding frequent sets and is exploring applications in text mining and classification. 相似文献
29.
30.