全文获取类型
收费全文 | 97234篇 |
免费 | 2176篇 |
国内免费 | 1248篇 |
专业分类
电工技术 | 1610篇 |
综合类 | 3311篇 |
化学工业 | 13519篇 |
金属工艺 | 5506篇 |
机械仪表 | 3841篇 |
建筑科学 | 3422篇 |
矿业工程 | 960篇 |
能源动力 | 1552篇 |
轻工业 | 4572篇 |
水利工程 | 1462篇 |
石油天然气 | 1036篇 |
武器工业 | 86篇 |
无线电 | 10760篇 |
一般工业技术 | 17700篇 |
冶金工业 | 3270篇 |
原子能技术 | 530篇 |
自动化技术 | 27521篇 |
出版年
2024年 | 89篇 |
2023年 | 267篇 |
2022年 | 414篇 |
2021年 | 559篇 |
2020年 | 453篇 |
2019年 | 363篇 |
2018年 | 14806篇 |
2017年 | 13793篇 |
2016年 | 10317篇 |
2015年 | 1170篇 |
2014年 | 934篇 |
2013年 | 960篇 |
2012年 | 3949篇 |
2011年 | 10308篇 |
2010年 | 9095篇 |
2009年 | 6330篇 |
2008年 | 7538篇 |
2007年 | 8539篇 |
2006年 | 928篇 |
2005年 | 1897篇 |
2004年 | 1603篇 |
2003年 | 1560篇 |
2002年 | 959篇 |
2001年 | 467篇 |
2000年 | 597篇 |
1999年 | 438篇 |
1998年 | 328篇 |
1997年 | 268篇 |
1996年 | 276篇 |
1995年 | 175篇 |
1994年 | 158篇 |
1993年 | 102篇 |
1992年 | 91篇 |
1991年 | 99篇 |
1990年 | 40篇 |
1989年 | 42篇 |
1988年 | 41篇 |
1986年 | 30篇 |
1968年 | 43篇 |
1967年 | 33篇 |
1966年 | 42篇 |
1965年 | 45篇 |
1963年 | 28篇 |
1960年 | 30篇 |
1959年 | 38篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
961.
Andrew Winslow 《Natural computing》2016,15(1):143-151
We introduce a new property of tile self-assembly systems that we call size-separability. A system is size-separable if every terminal assembly is a constant factor larger than any intermediate assembly. Size-separability is motivated by the practical problem of filtering completed assemblies from a variety of incomplete “garbage” assemblies using gel electrophoresis or other mass-based filtering techniques. Here we prove that any system without cooperative bonding assembling a unique mismatch-free terminal assembly can be used to construct a size-separable system uniquely assembling the same shape. The proof achieves optimal scale factor, temperature, and tile types (within a factor of 2) for the size-separable system. 相似文献
962.
An integrated co-evolution model with the consideration of land use and traffic network design is proposed in this paper. In the suggested model, two kinds of economic agents are considered. On the one hand, the government makes the investment decision for the traffic network improvement based on the current traffic condition under the limited budget. On the other hand, households and companies will choose their locations according to the attraction of each traffic zone related to the road network accessibility and the housing price. Therefore, the land use is indicated by the population and employment distributions through the evolution process. Besides, the improvement of road capacity is modeled by a general bi-level programming of traffic network design. Simulation experiments show that the city will be more efficient and will have higher average accessibility for employment and population in the evolution process. 相似文献
963.
Xin Lin Chris M. J. Tampère Francesco Viti Ben Immers 《Networks and Spatial Economics》2016,16(1):349-369
Increasing numbers of hard environmental constraints are being imposed in urban traffic networks by authorities in an attempt to mitigate pollution caused by traffic. However, it is not trivial for authorities to assess the cost of imposing such hard environmental constraints. This leads to difficulties when setting the constraining values as well as implementing effective control measures. For that reason, quantifying the cost of imposing hard environmental constraints for a certain network becomes crucial. This paper first indicates that for a given network, such cost is not only related to the attribution of environmental constraints but also related to the considered control measures. Next, we present an assessment criterion that quantifies the loss of optimality under the control measures considered by introducing the environmental constraints. The criterion can be acquired by solving a bi-level programming problem with/without environmental constraints. A simple case study shows its practicability as well as the differences between this framework and other frameworks integrating the environmental aspects. This proposed framework is widely applicable when assessing the interaction of traffic and its environmental aspects. 相似文献
964.
965.
Miguel A. Martínez-del-Amor Luis F. Macías-Ramos Luis Valencia-Cabrera Mario J. Pérez-Jiménez 《Natural computing》2016,15(4):565-573
Population Dynamics P systems are a type of multienvironment P systems that serve as a formal modeling framework for real ecosystems. The accurate simulation of these probabilistic models, e.g. with Direct distribution based on Consistent Blocks Algorithm, entails large run times. Hence, parallel platforms such as GPUs have been employed to speedup the simulation. In 2012, the first GPU simulator of PDP systems was presented. However, it was able to run only randomly generated PDP systems. In this paper, we present current updates made on this simulator, involving an input modu le for binary files and an output module for CSV files. Finally, the simulator has been experimentally validated with a real ecosystem model, and its performance has been tested with two high-end GPUs: Tesla C1060 and K40. 相似文献
966.
967.
Dandan Wang Lijun Gao Yingying Cai 《International Journal of Control, Automation and Systems》2016,14(3):673-680
This paper is concerned with the mean-square exponential stability problem for a class of impulsive stochastic systems with delayed impulses. The delays exhibit in both continuous subsystem and discrete subsystem. By constructing piecewise time-varying Lyapunov functions and Razumikhin technique, sufficient conditions are derived which guarantee the mean-square exponential stability for impulsive stochastic delay system. It is shown that the obtained stability conditions depend both on the lower bound and the upper bound of impulsive intervals, and the stability of system is robust with regard to sufficiently small impulse input delays. Finally, two examples are proposed to verify the efficiency of the proposed results. 相似文献
968.
Liang Liu Chaoying Chen Xinhua Zhao Yangmin Li 《International Journal of Control, Automation and Systems》2016,14(4):1022-1036
In order to achieve better tracking accuracy effectively, a new smooth and near time-optimal trajectory planning approach is proposed for a parallel manipulator subject to kinematic and dynamic constraints. The complete dynamic model is constructed with consideration of all joint frictions. The presented planning problem can be solved efficiently by formulating a new limitation curve for dynamic constraints and a reduced form for jerk constraints. The motion trajectory is planned with quartic and quintic polynomial splines in Cartesian space and septuple polynomial splines in joint space. Experimental results show that smaller tracking error can be obtained. The developed method can be applied to any robots with analytical inverse kinematic and dynamic solutions. 相似文献
969.
Jin-Lei Wu Chong Song Jing Xu Lin Yu Xin Ji Shou Zhang 《Quantum Information Processing》2016,15(9):3663-3675
An efficient scheme is proposed for generating n-qubit Greenberger–Horne–Zeilinger states of n superconducting qubits separated by (\(n-1\)) coplanar waveguide resonators capacitively via adiabatic passage with the help of quantum Zeno dynamics in one step. In the scheme, it is not necessary to precisely control the time of the whole operation and the Rabi frequencies of classical fields because of the introduction of adiabatic passage. The numerical simulations for three-qubit Greenberger–Horne–Zeilinger state show that the scheme is insensitive to the dissipation of the resonators and the energy relaxation of the superconducting qubits. The three-qubit Greenberger–Horne–Zeilinger state can be deterministically generated with comparatively high fidelity in the current experimental conditions, though the scheme is somewhat sensitive to the dephasing of superconducting qubits. 相似文献
970.
Erik Sjöqvist Vahid Azimi Mousolou Carlo M. Canali 《Quantum Information Processing》2016,15(10):3995-4011
Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic evolution, controlled by slowly changing parameters, this form of quantum computation can as well be realized at high speed by using nonadiabatic schemes. Recent advances in quantum gate technology have allowed for experimental demonstrations of different types of geometric gates in adiabatic and nonadiabatic evolution. Here, we address some conceptual issues that arise in the realizations of geometric gates. We examine the appearance of dynamical phases in quantum evolution and point out that not all dynamical phases need to be compensated for in geometric quantum computation. We delineate the relation between Abelian and non-Abelian geometric gates and find an explicit physical example where the two types of gates coincide. We identify differences and similarities between adiabatic and nonadiabatic realizations of quantum computation based on non-Abelian geometric phases. 相似文献