全文获取类型
收费全文 | 15226篇 |
免费 | 1178篇 |
国内免费 | 432篇 |
专业分类
电工技术 | 268篇 |
综合类 | 975篇 |
化学工业 | 1535篇 |
金属工艺 | 629篇 |
机械仪表 | 621篇 |
建筑科学 | 2413篇 |
矿业工程 | 147篇 |
能源动力 | 564篇 |
轻工业 | 287篇 |
水利工程 | 212篇 |
石油天然气 | 107篇 |
武器工业 | 86篇 |
无线电 | 1928篇 |
一般工业技术 | 3371篇 |
冶金工业 | 684篇 |
原子能技术 | 117篇 |
自动化技术 | 2892篇 |
出版年
2024年 | 53篇 |
2023年 | 408篇 |
2022年 | 245篇 |
2021年 | 370篇 |
2020年 | 390篇 |
2019年 | 365篇 |
2018年 | 373篇 |
2017年 | 379篇 |
2016年 | 495篇 |
2015年 | 537篇 |
2014年 | 791篇 |
2013年 | 895篇 |
2012年 | 912篇 |
2011年 | 1164篇 |
2010年 | 812篇 |
2009年 | 877篇 |
2008年 | 854篇 |
2007年 | 927篇 |
2006年 | 833篇 |
2005年 | 738篇 |
2004年 | 694篇 |
2003年 | 600篇 |
2002年 | 548篇 |
2001年 | 363篇 |
2000年 | 331篇 |
1999年 | 272篇 |
1998年 | 252篇 |
1997年 | 181篇 |
1996年 | 179篇 |
1995年 | 150篇 |
1994年 | 149篇 |
1993年 | 97篇 |
1992年 | 102篇 |
1991年 | 74篇 |
1990年 | 80篇 |
1989年 | 47篇 |
1988年 | 44篇 |
1987年 | 34篇 |
1986年 | 20篇 |
1985年 | 35篇 |
1984年 | 31篇 |
1983年 | 30篇 |
1982年 | 22篇 |
1981年 | 12篇 |
1980年 | 9篇 |
1979年 | 12篇 |
1978年 | 11篇 |
1977年 | 7篇 |
1975年 | 6篇 |
1974年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
Jonas Sjberg Qinghua Zhang Lennart Ljung Albert Benveniste Bernard Delyon Pierre-Yves Glorennec Hkan Hjalmarsson Anatoli Juditsky 《Automatica》1995,31(12):1691-1724
A nonlinear black-box structure for a dynamical system is a model structure that is prepared to describe virtually any nonlinear dynamics. There has been considerable recent interest in this area, with structures based on neural networks, radial basis networks, wavelet networks and hinging hyperplanes, as well as wavelet-transform-based methods and models based on fuzzy sets and fuzzy rules. This paper describes all these approaches in a common framework, from a user's perspective. It focuses on what are the common features in the different approaches, the choices that have to be made and what considerations are relevant for a successful system-identification application of these techniques. It is pointed out that the nonlinear structures can be seen as a concatenation of a mapping form observed data to a regression vector and a nonlinear mapping from the regressor space to the output space. These mappings are discussed separately. The latter mapping is usually formed as a basis function expansion. The basis functions are typically formed from one simple scalar function, which is modified in terms of scale and location. The expansion from the scalar argument to the regressor space is achieved by a radial- or a ridge-type approach. Basic techniques for estimating the parameters in the structures are criterion minimization, as well as two-step procedures, where first the relevant basis functions are determined, using data, and then a linear least-squares step to determine the coordinates of the function approximation. A particular problem is to deal with the large number of potentially necessary parameters. This is handled by making the number of ‘used’ parameters considerably less than the number of ‘offered’ parameters, by regularization, shrinking, pruning or regressor selection. 相似文献
72.
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. 相似文献
73.
简述了 GaAs 激光器、光电探测器及激光引信的基本特点。说明了激光引信在海防导弹上应用的可行性。提出了为满足掠海导弹的需求所必须解决的关键技术和实施途径。展望了激光引信在导弹控制和导引等方面的应用前景。 相似文献
74.
75.
利用Struts2、Java、JDBC等相关标准和技术,构建以Web方式提供服务的B2C通用电子商务平台,从而为商家和顾客之间提供了一个经济的、方便的、兼容的、可扩展的、安全的电子商务综合平台。以此方案为依据,建立了一个应用实例系统,实现了基于Struts2服务的包括用户管理、商品展示、购物车、订单生成过程、电子订货过程。在开发过程中,采用面向对象的分析与设计方法。 相似文献
76.
In the first section of the article, we examine some recent criticisms of the connectionist enterprise: first, that connectionist models are fundamentally behaviorist in nature (and, therefore, non-cognitive), and second that connectionist models are fundamentally associationist in nature (and, therefore, cognitively weak). We argue that, for a limited class of connectionist models (feed-forward, pattern-associator models), the first criticism is unavoidable. With respect to the second criticism, we propose that connectionist modelsare fundamentally associationist but that this is appropriate for building models of human cognition. However, we do accept the point that there are cognitive capacities for which any purely associative model cannot provide a satisfactory account. The implication that we draw from is this is not that associationist models and mechanisms should be scrapped, but rather that they should be enhanced.In the next section of the article, we identify a set of connectionist approaches which are characterized by active symbols — recurrent circuits which are the basis of knowledge representation. We claim that such approaches avoid criticisms of behaviorism and are, in principle, capable of supporting full cognition. In the final section of the article, we speculate at some length about what we believe would be the characteristics of a fully realized active symbol system. This includes both potential problems and possible solutions (for example, mechanisms needed to control activity in a complex recurrent network) as well as the promise of such systems (in particular, the emergence of knowledge structures which would constitute genuine internal models). 相似文献
77.
Fairly exchanging digital content is an everyday problem. It has been shown that fair exchange cannot be achieved without a trusted third party (called the Arbiter). Yet, even with a trusted party, it is still non-trivial to come up with an efficient solution, especially one that can be used in a p2p file sharing system with a high volume of data exchanged.We provide an efficient optimistic fair exchange mechanism for bartering digital files, where receiving a payment in return for a file (buying) is also considered fair. The exchange is optimistic, removing the need for the Arbiter’s involvement unless a dispute occurs. While the previous solutions employ costly cryptographic primitives for every file or block exchanged, our protocol employs them only once per peer, therefore achieving an O(n) efficiency improvement when n blocks are exchanged between two peers. Our protocol uses very efficient cryptography, making it perfectly suitable for a p-2-p file sharing system where tens of peers exchange thousands of blocks and they do not know beforehand which ones they will end up exchanging. Therefore, our system yields up to one-to-two orders of magnitude improvement in terms of both computation and communication (40 s vs. 42 min, 1.6 MB vs. 200 MB). Thus, for the first time, a provably secure (and privacy-respecting when payments are made using e-cash) fair exchange protocol can be used in real bartering applications (e.g., BitTorrent) [14] without sacrificing performance. 相似文献
78.
79.
随着电子商务的发展,如何实现对网络用户的身份认证成为了一个非常迫切的问题,目前广泛采用的是基于PKI的认证技术,而在PKI认证体系中,认证中心CA是核心部分。本文提出了一个基于门限ECC的PKI/CA的设计,本方案在传统的CA方案上引入了入侵容忍机制,结合椭圆曲线密码体制和门限密码方案,提高了CA系统的可靠性和安全性。 相似文献
80.