全文获取类型
收费全文 | 147597篇 |
免费 | 13120篇 |
国内免费 | 7381篇 |
专业分类
电工技术 | 8692篇 |
技术理论 | 7篇 |
综合类 | 10113篇 |
化学工业 | 24076篇 |
金属工艺 | 8899篇 |
机械仪表 | 10035篇 |
建筑科学 | 11403篇 |
矿业工程 | 4683篇 |
能源动力 | 4029篇 |
轻工业 | 11669篇 |
水利工程 | 2778篇 |
石油天然气 | 9230篇 |
武器工业 | 1260篇 |
无线电 | 16323篇 |
一般工业技术 | 16976篇 |
冶金工业 | 6817篇 |
原子能技术 | 1582篇 |
自动化技术 | 19526篇 |
出版年
2024年 | 723篇 |
2023年 | 2544篇 |
2022年 | 4654篇 |
2021年 | 6236篇 |
2020年 | 4813篇 |
2019年 | 3984篇 |
2018年 | 4391篇 |
2017年 | 4892篇 |
2016年 | 4586篇 |
2015年 | 6223篇 |
2014年 | 7536篇 |
2013年 | 9046篇 |
2012年 | 9978篇 |
2011年 | 10812篇 |
2010年 | 9493篇 |
2009年 | 9163篇 |
2008年 | 8868篇 |
2007年 | 8388篇 |
2006年 | 8409篇 |
2005年 | 7198篇 |
2004年 | 4780篇 |
2003年 | 4214篇 |
2002年 | 3960篇 |
2001年 | 3498篇 |
2000年 | 3148篇 |
1999年 | 3248篇 |
1998年 | 2450篇 |
1997年 | 2038篇 |
1996年 | 1959篇 |
1995年 | 1612篇 |
1994年 | 1322篇 |
1993年 | 882篇 |
1992年 | 753篇 |
1991年 | 527篇 |
1990年 | 411篇 |
1989年 | 354篇 |
1988年 | 265篇 |
1987年 | 183篇 |
1986年 | 148篇 |
1985年 | 82篇 |
1984年 | 64篇 |
1983年 | 55篇 |
1982年 | 57篇 |
1981年 | 30篇 |
1980年 | 32篇 |
1979年 | 27篇 |
1978年 | 10篇 |
1977年 | 10篇 |
1976年 | 13篇 |
1975年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
181.
Fuzzy local maximal marginal embedding for feature extraction 总被引:1,自引:0,他引:1
Cairong Zhao Zhihui Lai Chuancai Liu Xingjian Gu Jianjun Qian 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(1):77-87
In graph-based linear dimensionality reduction algorithms, it is crucial to construct a neighbor graph that can correctly
reflect the relationship between samples. This paper presents an improved algorithm called fuzzy local maximal marginal embedding
(FLMME) for linear dimensionality reduction. Significantly differing from the existing graph-based algorithms is that two
novel fuzzy gradual graphs are constructed in FLMME, which help to pull the near neighbor samples in same class nearer and
nearer and repel the far neighbor samples of margin between different classes farther and farther when they are projected
to feature subspace. Through the fuzzy gradual graphs, FLMME algorithm has lower sensitivities to the sample variations caused
by varying illumination, expression, viewing conditions and shapes. The proposed FLMME algorithm is evaluated through experiments
by using the WINE database, the Yale and ORL face image databases and the USPS handwriting digital databases. The results
show that the FLMME outperforms PCA, LDA, LPP and local maximal marginal embedding. 相似文献
182.
Jianwei Zhao Dong Sun Park Joonwhoan Lee Feilong Cao 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2012,16(9):1503-1514
Functional data learning is an extension of traditional data learning, that is, learning the data chosen from the Euclidean space ${\mathbb{R}^{n}}$ to a metric space. This paper focuses on the functional data learning with generalized single-hidden layer feedforward neural networks (GSLFNs) acting on some metric spaces. In addition, three learning algorithms, named Hilbert parallel overrelaxation backpropagation (H-PORBP) algorithm, ν-generalized support vector regression (ν-GSVR) and generalized extreme learning machine (G-ELM) are proposed to train the GSLFNs acting on some metric spaces. The experimental results on some metric spaces indicate that GELM with additive/RBF hidden-nodes has a faster learning speed, a better accuracy, and a better stability than HPORBP algorithm and ν-GSVR for training the functional data. The idea of GELM can be used to extend those improved extreme learning machines (ELMs) that act on the Euclidean space ${\mathbb{R}^{n}, }$ such as online sequential ELM, incremental ELM, pruning ELM and so on, to some metric spaces. 相似文献
183.
Dihua Zhai Yu Kang Ping Zhao Yun-Bo Zhao 《International Journal of Control, Automation and Systems》2012,10(6):1182-1192
The stability of a class of switched stochastic nonlinear retarded systems with asynchronous switching controller is investigated. By constructing a virtual switching signal and using the average dwell time approach incorporated with Razumikhin-type theorem, the sufficient criteria for pth moment exponential stability and global asymptotic stability in probability are given. It is shown that the stability of the asynchronous stochastic systems can be guaranteed provided that the average dwell time is sufficiently large and the mismatched time between the controller and the systems is sufficiently small. This result is then applied to a class of switched stochastic nonlinear delay systems where the controller is designed with both state and switching delays. A numerical example illustrates the effectiveness of the obtained results. 相似文献
184.
虚拟企业要取得预期的利润,就必须成功规避运行中的风险.考虑虚拟企业的分布性以及联盟成员之间关系多样性的特点,根据非合作完全信息静态博弈理论,采用分布式决策的思想对虚拟企业风险进行管理.针对各盟员构成非团队关系,并且不存在机会主义行为的虚拟企业,探讨了其风险管理的特点,以及在风险管理问题上各盟员之间可能达成的协作;建立了协调的分布式虚拟企业风险管理模型,给出了模型的求解方法,同时设计了相应算法对模型进行求解,并对解的不同情况进行了分析;另外还比较了不同协调原则下联盟总利润以及各盟员利润的变化情况.仿真分析表明,所提出的模型和算法,能在虚拟企业各盟员风险管理中起到协调控制的作用,达到“双赢”的目的. 相似文献
185.
Zhao Z Adenwalla SD Ketterson JB Sarma BK 《IEEE transactions on ultrasonics, ferroelectrics, and frequency control》1989,36(5):481-484
A technique is proposed for measuring the group velocity of sound by a frequency-modulated (FM) continuous wave (CW) technique. Detailed calculations are presented, showing that V(g)=(deltaomega(m)/deltaphi)d , where V(g), deltaomega(m), deltaphi, and d are, respectively, the group velocity, change of modulation frequency, phase change of the received signal detected by a biphase lock-in amplifier, and the distance traveled by the sound. The approach has the advantage of high resolution compared to the conventional time-of-flight measurement technique. 相似文献
186.
187.
188.
Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt
2/2. Both algorithms useO(n
3) message bits for binary value agreement.
Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science.
Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering. 相似文献
189.
190.