全文获取类型
收费全文 | 59602篇 |
免费 | 9047篇 |
国内免费 | 5264篇 |
专业分类
电工技术 | 7682篇 |
技术理论 | 2篇 |
综合类 | 6039篇 |
化学工业 | 5009篇 |
金属工艺 | 2139篇 |
机械仪表 | 5974篇 |
建筑科学 | 2757篇 |
矿业工程 | 2059篇 |
能源动力 | 3039篇 |
轻工业 | 3695篇 |
水利工程 | 1591篇 |
石油天然气 | 2593篇 |
武器工业 | 816篇 |
无线电 | 4692篇 |
一般工业技术 | 5272篇 |
冶金工业 | 1842篇 |
原子能技术 | 286篇 |
自动化技术 | 18426篇 |
出版年
2024年 | 595篇 |
2023年 | 1521篇 |
2022年 | 2596篇 |
2021年 | 2719篇 |
2020年 | 3017篇 |
2019年 | 2568篇 |
2018年 | 2299篇 |
2017年 | 2793篇 |
2016年 | 3053篇 |
2015年 | 3383篇 |
2014年 | 4718篇 |
2013年 | 4539篇 |
2012年 | 5103篇 |
2011年 | 5131篇 |
2010年 | 3522篇 |
2009年 | 3728篇 |
2008年 | 3274篇 |
2007年 | 3669篇 |
2006年 | 3016篇 |
2005年 | 2408篇 |
2004年 | 1953篇 |
2003年 | 1536篇 |
2002年 | 1300篇 |
2001年 | 1046篇 |
2000年 | 875篇 |
1999年 | 584篇 |
1998年 | 561篇 |
1997年 | 473篇 |
1996年 | 373篇 |
1995年 | 324篇 |
1994年 | 262篇 |
1993年 | 197篇 |
1992年 | 168篇 |
1991年 | 139篇 |
1990年 | 120篇 |
1989年 | 99篇 |
1988年 | 62篇 |
1987年 | 25篇 |
1986年 | 25篇 |
1985年 | 14篇 |
1984年 | 16篇 |
1983年 | 18篇 |
1982年 | 18篇 |
1981年 | 8篇 |
1980年 | 15篇 |
1979年 | 13篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1959年 | 4篇 |
1951年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
高速贴片机优化软件的设计与开发 总被引:9,自引:4,他引:5
SMT生产线要达到最大的产量,必须要考虑生产线的效率。贴片机是SMT生产线中的关键设备,因此提高贴片机的生产效率具有十分重要的意义。本文以松下贴片机为例,介绍了贴片机程序优化软件的设计与开发中的思想、方法和经验,希望对从事CAM软件研究的工程人员有一定帮助。 相似文献
72.
73.
74.
75.
76.
亚麻织物无醛免烫整理工艺研究 总被引:6,自引:0,他引:6
采用多元羧酸聚合型无醛免烫整理剂处理亚麻织物,确立了整理剂、催化剂、添加剂用量等最佳工艺条件,整理后亚麻织物的免烫性能得到了明显的改善。 相似文献
77.
The objective is to have uniformly distributed tangential stresses on the transition profile of a stepped bar subjected to tensile and torsional loading using an axisymmetric boundary element formulation. The transition curve is represented by the Langragian interpolation polynomial with progressive degrees to avoid shape distortion during the optimization procedure. The calculated result is compared with that obtained by fluid dynamics given in the literature. It is seen that the transition curve obtained in this paper is reasonable. 相似文献
78.
An important feature of database technology of the nineties is the use of parallelism for speeding up the execution of complex queries. This technology is being tested in several experimental database architectures and a few commercial systems for conventional select-project-join queries. In particular, hash-based fragmentation is used to distribute data to disks under the control of different processors in order to perform selections and joins in parallel. With the development of new query languages, and in particular with the definition of transitive closure queries and of more general logic programming queries, the new dimension of recursion has been added to query processing. Recursive queries are complex; at the same time, their regular structure is particularly suited for parallel execution, and parallelism may give a high efficiency gain. We survey the approaches to parallel execution of recursive queries that have been presented in the recent literature. We observe that research on parallel execution of recursive queries is separated into two distinct subareas, one focused on the transitive closure of Relational Algebra expressions, the other one focused on optimization of more general Datalog queries. Though the subareas seem radically different because of the approach and formalism used, they have many common features. This is not surprising, because most typical Datalog queries can be solved by means of the transitive closure of simple algebraic expressions. We first analyze the relationship between the transitive closure of expressions in Relational Algebra and Datalog programs. We then review sequential methods for evaluating transitive closure, distinguishing iterative and direct methods. We address the parallelization of these methods, by discussing various forms of parallelization. Data fragmentation plays an important role in obtaining parallel execution; we describe hash-based and semantic fragmentation. Finally, we consider Datalog queries, and present general methods for parallel rule execution; we recognize the similarities between these methods and the methods reviewed previously, when the former are applied to linear Datalog queries. We also provide a quantitative analysis that shows the impact of the initial data distribution on the performance of methods.
Recommended by: Patrick Valduriez 相似文献
79.
Ying Tan 《The Journal of VLSI Signal Processing》2002,32(1-2):45-54
In this paper, we propose a new approach for signal detection in wireless digital communications based on the neural network with transient chaos and time-varying gain (NNTCTG), and give a concrete model of the signal detector after appropriate transformations and mappings. It is well known that the problem of the maximum likelihood signal detection can be described as a complex optimization problem that has so many local optima that conventional Hopfield-type neural networks fail to solve. By refraining from the serious local optima problem of Hopfield-type neural networks, the NNTCTG makes use of the time-varying parameters of the recurrent neural network to control the evolving behavior of the network so that the network undergoes the transition from chaotic behavior to gradient convergence. It has richer and more flexible dynamics rather than conventional neural networks only with point attractors, so that it can be expected to have much ability to search for globally optimal or near-optimal solutions. After going through a transiently inverse-bifurcation process, the NNTCTG can approach the global optimum or the neighborhood of global optimum of our problem. Simulation experiments have been performed to show the effectiveness and validation of the proposed neural network based method for the signal detection in digital communications. 相似文献
80.
Wen-Hua Chen 《国际强度与非线性控制杂志
》1994,4(5):713-722
》1994,4(5):713-722
The problem of design of minimax robust LQG controllers for linear systems with parameter and noise uncertainties is considered in this paper. Necessary and sufficient conditions for converting this problem to a two-person, zero-sum continuous game problem are presented. A simple procedure for design of a suboptimal minimax robust LQG controller, i.e., the LQG controller for least-favourable model, is proposed. Necessary and sufficient conditions for the existence of a saddle point are established. Under these conditions, the controller obtained is exactly the minimax LQG controller. When there does not exist a saddle point, the worst-case error between the controller obtained and the minimax robust LQG controllers under described uncertainties is bounded. 相似文献