全文获取类型
收费全文 | 3526篇 |
免费 | 383篇 |
国内免费 | 373篇 |
专业分类
电工技术 | 177篇 |
综合类 | 365篇 |
化学工业 | 342篇 |
金属工艺 | 70篇 |
机械仪表 | 139篇 |
建筑科学 | 73篇 |
矿业工程 | 34篇 |
能源动力 | 130篇 |
轻工业 | 68篇 |
水利工程 | 46篇 |
石油天然气 | 51篇 |
武器工业 | 27篇 |
无线电 | 463篇 |
一般工业技术 | 417篇 |
冶金工业 | 22篇 |
原子能技术 | 35篇 |
自动化技术 | 1823篇 |
出版年
2024年 | 16篇 |
2023年 | 40篇 |
2022年 | 58篇 |
2021年 | 87篇 |
2020年 | 125篇 |
2019年 | 115篇 |
2018年 | 99篇 |
2017年 | 157篇 |
2016年 | 145篇 |
2015年 | 156篇 |
2014年 | 198篇 |
2013年 | 304篇 |
2012年 | 277篇 |
2011年 | 266篇 |
2010年 | 204篇 |
2009年 | 255篇 |
2008年 | 233篇 |
2007年 | 206篇 |
2006年 | 188篇 |
2005年 | 162篇 |
2004年 | 117篇 |
2003年 | 115篇 |
2002年 | 95篇 |
2001年 | 89篇 |
2000年 | 72篇 |
1999年 | 68篇 |
1998年 | 61篇 |
1997年 | 71篇 |
1996年 | 42篇 |
1995年 | 49篇 |
1994年 | 35篇 |
1993年 | 30篇 |
1992年 | 17篇 |
1991年 | 12篇 |
1990年 | 13篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 6篇 |
1986年 | 10篇 |
1985年 | 12篇 |
1984年 | 5篇 |
1983年 | 9篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 8篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1976年 | 2篇 |
1975年 | 2篇 |
1973年 | 4篇 |
排序方式: 共有4282条查询结果,搜索用时 15 毫秒
101.
102.
Global exponential stability in Lagrange sense for neutral type recurrent neural networks 总被引:2,自引:0,他引:2
Qi LuoAuthor Vitae Zhigang ZengAuthor VitaeXiaoxin LiaoAuthor Vitae 《Neurocomputing》2011,74(4):638-645
In this paper, the global exponential stability in Lagrange sense for continuous neutral type recurrent neural networks (NRNNs) with multiple time delays is studied. Three different types of activation functions are considered, including general bounded and two types of sigmoid activation functions. By constructing appropriate Lyapunov functions, some easily verifiable criteria for the ultimate boundedness and global exponential attractivity of NRNNs are obtained. These results can be applied to monostable and multistable neural networks as well as chaos control and chaos synchronization. 相似文献
103.
Bo ZhouAuthor VitaeQiankun SongAuthor Vitae Huiwei WangAuthor Vitae 《Neurocomputing》2011,74(17):3142-3150
By employing time scale calculus theory, free weighting matrix method and linear matrix inequality (LMI) approach, several delay-dependent sufficient conditions are obtained to ensure the existence, uniqueness and global exponential stability of the equilibrium point for the neural networks with both infinite distributed delays and general activation functions on time scales. Both continuous-time and discrete-time neural networks are described under the same framework by the reported method. Illustrated numerical examples are given to show the effectiveness of the theoretical analysis. It is noteworthy that the activation functions are assumed to be neither bounded nor monotone. 相似文献
104.
M. Naeem D.C. Lee 《Engineering Applications of Artificial Intelligence》2011,24(6):1046-1051
In this paper, we present a low-complexity algorithm for real-time joint transmit and receive antenna selection in MIMO systems. The computational complexity of exhaustive search in this problem grows exponentially with the number of transmit and receive antennas. We apply Binary Particle Swarm Optimization (BPSO) to the joint transmit and receive antenna selection problem. In addition, applying the general BPSO to joint antenna selection, we also present a specific improvement to this population-based heuristic algorithm, namely, we feed cyclically shifted initial population so that the average convergence time (the number of iterations until reaching an acceptable solution) is reduced. The proposed BPSO for joint antenna selection problem has a low computational complexity, and its effectiveness is verified through simulation results. 相似文献
105.
基于黎曼流形的图像投影配准算法 总被引:1,自引:0,他引:1
提出了基于黎曼流形的图像投影配准优化方法, 根据投影变换的特点, 用SL(3)表征目标的图像投影变换, 研究SL(3)的几何结构, 通过变分的方法求出了SL(3)上的测地线, 给出相应的黎曼指数映射, 设计了一种新的基于SL(3)群上黎曼分析的平面投影配准算法, 分析了算法的优点, 并对其收敛性做出了证明. 模拟图像数据和真实图像序列测试的对比实验结果表明, 本文算法在效率和精度上较现有文献中基于欧氏空间的图像投影配准算法有显著提高, 优于基于李群的图像配准算法. 相似文献
106.
The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important applications, such as compressed matching. The paper shows how, by means of some pre-computed tables, one may implement the BM algorithm also for the binary case without referring to bits, and processing only entire blocks such as bytes or words, thereby significantly reducing the number of comparisons. Empirical comparisons show that the new variant performs better than regular binary BM and even than BDM. 相似文献
107.
When implementing multivalued consensus using binary consensus, previous algorithms assume the availability of uniform reliable broadcast, which is not implementable in systems with fair-lossy links. In this paper, we show that with binary consensus we can implement uniform reliable broadcast directly in systems with fair-lossy links, and thus the separate assumption of the availability of uniform reliable broadcast is not necessary. We further prove that, when binary consensus instances are available only as black boxes, any implementation of uniform reliable broadcast in the fair-lossy link model requires the invocation of an infinite number of binary consensus instances even if no process ever broadcasts any messages, and this is true even when multivalued consensus is used. 相似文献
108.
Helge Langseth Author Vitae Thomas D. Nielsen Author Vitae 《Pattern recognition》2009,42(11):2724-2736
One of the simplest, and yet most consistently well-performing set of classifiers is the naïve Bayes models (a special class of Bayesian network models). However, these models rely on the (naïve) assumption that all the attributes used to describe an instance are conditionally independent given the class of that instance. To relax this independence assumption, we have in previous work proposed a family of models, called latent classification models (LCMs). LCMs are defined for continuous domains and generalize the naïve Bayes model by using latent variables to model class-conditional dependencies between the attributes. In addition to providing good classification accuracy, the LCM has several appealing properties, including a relatively small parameter space making it less susceptible to over-fitting. In this paper we take a first step towards generalizing LCMs to hybrid domains, by proposing an LCM for domains with binary attributes. We present algorithms for learning the proposed model, and we describe a variational approximation-based inference procedure. Finally, we empirically compare the accuracy of the proposed model to the accuracy of other classifiers for a number of different domains, including the problem of recognizing symbols in black and white images. 相似文献
109.
We propose a technique for defeating signature-based malware detectors by exploiting information disclosed by antivirus interfaces. This information is leveraged to reverse engineer relevant details of the detector's underlying signature database, revealing binary obfuscations that suffice to conceal malware from the detector. Experiments with real malware and antivirus interfaces on Windows operating systems justify the effectiveness of our approach. 相似文献
110.
Adaptive binary tree for fast SVM multiclass classification 总被引:1,自引:0,他引:1
This paper presents an adaptive binary tree (ABT) to reduce the test computational complexity of multiclass support vector machine (SVM). It achieves a fast classification by: (1) reducing the number of binary SVMs for one classification by using separating planes of some binary SVMs to discriminate other binary problems; (2) selecting the binary SVMs with the fewest average number of support vectors (SVs). The average number of SVs is proposed to denote the computational complexity to exclude one class. Compared with five well-known methods, experiments on many benchmark data sets demonstrate our method can speed up the test phase while remain the high accuracy of SVMs. 相似文献