全文获取类型
收费全文 | 59730篇 |
免费 | 6810篇 |
国内免费 | 4014篇 |
专业分类
电工技术 | 5216篇 |
技术理论 | 2篇 |
综合类 | 4592篇 |
化学工业 | 8720篇 |
金属工艺 | 3258篇 |
机械仪表 | 3891篇 |
建筑科学 | 4546篇 |
矿业工程 | 1958篇 |
能源动力 | 1841篇 |
轻工业 | 5139篇 |
水利工程 | 1522篇 |
石油天然气 | 2643篇 |
武器工业 | 775篇 |
无线电 | 7370篇 |
一般工业技术 | 6525篇 |
冶金工业 | 2066篇 |
原子能技术 | 874篇 |
自动化技术 | 9616篇 |
出版年
2024年 | 336篇 |
2023年 | 1031篇 |
2022年 | 2083篇 |
2021年 | 3038篇 |
2020年 | 2188篇 |
2019年 | 1758篇 |
2018年 | 2017篇 |
2017年 | 2283篇 |
2016年 | 2144篇 |
2015年 | 2953篇 |
2014年 | 3667篇 |
2013年 | 4553篇 |
2012年 | 4995篇 |
2011年 | 5071篇 |
2010年 | 4671篇 |
2009年 | 4359篇 |
2008年 | 4037篇 |
2007年 | 3807篇 |
2006年 | 3394篇 |
2005年 | 2615篇 |
2004年 | 1874篇 |
2003年 | 1360篇 |
2002年 | 1324篇 |
2001年 | 1043篇 |
2000年 | 798篇 |
1999年 | 552篇 |
1998年 | 350篇 |
1997年 | 285篇 |
1996年 | 267篇 |
1995年 | 244篇 |
1994年 | 176篇 |
1993年 | 116篇 |
1992年 | 112篇 |
1991年 | 80篇 |
1990年 | 65篇 |
1989年 | 56篇 |
1988年 | 43篇 |
1986年 | 38篇 |
1985年 | 53篇 |
1984年 | 59篇 |
1983年 | 47篇 |
1982年 | 51篇 |
1981年 | 64篇 |
1980年 | 52篇 |
1979年 | 45篇 |
1978年 | 42篇 |
1977年 | 43篇 |
1976年 | 62篇 |
1975年 | 40篇 |
1973年 | 38篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
101.
102.
103.
Pavel Krömer Jan Platoš Václav Snášel 《International journal of parallel programming》2014,42(5):681-709
Graphic processing units (GPUs) emerged recently as an exciting new hardware environment for a truly parallel implementation and execution of Nature and Bio-inspired Algorithms with excellent price-to-power ratio. In contrast to common multicore CPUs that contain up to tens of independent cores, the GPUs represent a massively parallel single-instruction multiple-data devices that can nowadays reach peak performance of hundreds and thousands of giga floating-point operations per second. Nature and Bio-inspired Algorithms implement parallel optimization strategies in which a single candidate solution, a group of candidate solutions (population), or multiple populations seek for optimal solution or set of solutions of given problem. Genetic algorithms (GA) constitute a family of traditional and very well-known nature-inspired populational meta-heuristic algorithms that have proved its usefulness on a plethora of tasks through the years. Differential evolution (DE) is another efficient populational meta-heuristic algorithm for real-parameter optimization. Particle swarm optimization (PSO) can be seen as nature-inspired multiagent method in which the interaction of simple independent agents yields intelligent collective behavior. Simulated annealing (SA) is global optimization algorithm which combines statistical mechanics and combinatorial optimization with inspiration in metallurgy. This survey provides a brief overview of the latest state-of-the-art research on the design, implementation, and applications of parallel GA, DE, PSO, and SA-based methods on the GPUs. 相似文献
104.
以DRC为催化剂,在无溶剂条件下,通过氢化松香与乙醇的直接酯化反应合成氢化松香乙酯。探索了反应温度、催化剂用量、反应时间、物料配比等因素对反应酯化率的影响,确定最佳反应条件为:反应温度180℃,催化剂用量为原料氢化松香质量的6%,反应时间6h,醇与酸的摩尔比为3∶1。在最佳条件下酯化率达92.2%。还探讨了用阴离子交换树脂柱层析分离纯化氢化松香乙酯粗产物的方法。此外,利用红外光谱对氢化松香乙酯精制产物进行了表征;用GC-MS分别对氢化松香乙酯粗产物及其精制产物进行了定性和定量分析,比较了柱层析前后化学组成的变化。 相似文献
105.
Trajectory planning is an essential part of systems controlling autonomous entities such as vehicles or robots. It requires not only finding spatial curves but also that dynamic properties of the vehicles (such as speed limits for certain maneuvers) must be followed. In this paper, we present an approach for augmenting existing path planning methods to support basic dynamic constraints, concretely speed limit constraints. We apply this approach to the well known A* and state-of-the-art Theta* and Lazy Theta* path planning algorithms. We use a concept of trajectory planning based on a modular architecture in which spatial and dynamic parts can be easily implemented. This concept allows dynamic aspects to be processed during planning. Existing systems based on a similar concept usually add dynamics (velocity) into spatial curves in a post-processing step which might be inappropriate when the curves do not follow the dynamics. Many existing trajectory planning approaches, especially in mobile robotics, encode dynamic aspects directly in the representation (e.g. in the form of regular lattices) which requires a precise knowledge of the environmental and dynamic properties of particular autonomous entities making designing and implementing such trajectory planning approaches quite difficult. The concept of trajectory planning we implemented might not be as precise but the modular architecture makes the design and implementation easier because we can use (modified) well known path planning methods and define models of dynamics of autonomous entities separately. This seems to be appropriate for simulations used in feasibility studies for some complex autonomous systems or in computer games etc. Our basic implementation of the augmented A*, Theta* and Lazy Theta* algorithms is also experimentally evaluated. We compare (i) the augmented and basic A*, Theta* and Lazy Theta* algorithms and (ii) optimizing of augmented Theta* and Lazy Theta* for distance (the trajectory length) and duration (time needed to move through the trajectory). 相似文献
106.
Martin Saska Tomáš Krajník Vojtěch Vonásek Zdeněk Kasl Vojtěch Spurný Libor Přeučil 《Journal of Intelligent and Robotic Systems》2014,73(1-4):603-622
A fault-tolerant method for stabilization and navigation of 3D heterogeneous formations is proposed in this paper. The presented Model Predictive Control (MPC) based approach enables to deploy compact formations of closely cooperating autonomous aerial and ground robots in surveillance scenarios without the necessity of a precise external localization. Instead, the proposed method relies on a top-view visual relative localization provided by the micro aerial vehicles flying above the ground robots and on a simple yet stable visual based navigation using images from an onboard monocular camera. The MPC based schema together with a fault detection and recovery mechanism provide a robust solution applicable in complex environments with static and dynamic obstacles. The core of the proposed leader-follower based formation driving method consists in a representation of the entire 3D formation as a convex hull projected along a desired path that has to be followed by the group. Such an approach provides non-collision solution and respects requirements of the direct visibility between the team members. The uninterrupted visibility is crucial for the employed top-view localization and therefore for the stabilization of the group. The proposed formation driving method and the fault recovery mechanisms are verified by simulations and hardware experiments presented in the paper. 相似文献
107.
Partially observable Markov decision process (POMDP) is an ideal framework for sequential decision-making under uncertainty in stochastic domains. However, it is notoriously computationally intractable to solving POMDP in real-time system. In order to address this problem, this paper proposes a point-based online value iteration (PBOVI) algorithm which involves performing value backup at specific reachable belief points, rather than over the entire belief simplex, to speed up computation processes, exploits branch-and-bound pruning approach to prune the AND/OR tree of belief states online, and proposes a novel idea to reuse the belief states that have been searched to avoid repeated computation. The experiment and simulation results show that the proposed algorithm can simultaneously satisfy the requirement of low errors and high timeliness in real-time system. 相似文献
108.
109.
针对网上交易时的用户个人隐私安全问题,依据不经意传输理论,基于ElGamal签名的不经意签名电子信封(OSBE)模型,提出了一个可保护用户隐私的网上交易数字商品方案.首先用户匿名付费给银行,然后银行将用户订购商品的数字签名发送给用户,接着用户使用数字签名与商家进行不经意信息交互,最后用户得到且只能得到自己订购的数字商品,商家并不知道用户订购何种数字商品.正确性证明和安全性分析结果表明,可以有效地保护用户在网上交易过程中的个人隐私,同时防止商家恶意欺诈行为.该方案签名相对较短,计算量较小,密钥动态变化,安全性更强. 相似文献
110.
The existing solutions to keyword search in the cloud can be divided into two categories: searching on exact keywords and searching on error-tolerant keywords. An error-tolerant keyword search scheme permits to make searches on encrypted data with only an approximation of some keyword. The scheme is suitable to the case where users' searching input might not exactly match those pre-set keywords. In this paper, we first present a general framework for searching on error-tolerant keywords. Then we propose a concrete scheme, based on a fuzzy extractor, which is proved secure against an adaptive adversary under well-defined security definition. The scheme is suitable for all similarity metrics including Hamming distance, edit distance, and set difference. It does not require the user to construct or store anything in advance, other than the key used to calculate the trapdoor of keywords and the key to encrypt data documents. Thus, our scheme tremendously eases the users' burden. What is more, our scheme is able to transform the servers' searching for error-tolerant keywords on ciphertexts to the searching for exact keywords on plaintexts. The server can use any existing approaches of exact keywords search to search plaintexts on an index table. 相似文献