全文获取类型
收费全文 | 34472篇 |
免费 | 3327篇 |
国内免费 | 2494篇 |
专业分类
电工技术 | 2078篇 |
技术理论 | 3篇 |
综合类 | 4018篇 |
化学工业 | 2362篇 |
金属工艺 | 1040篇 |
机械仪表 | 2459篇 |
建筑科学 | 3107篇 |
矿业工程 | 1269篇 |
能源动力 | 954篇 |
轻工业 | 1116篇 |
水利工程 | 986篇 |
石油天然气 | 923篇 |
武器工业 | 265篇 |
无线电 | 2517篇 |
一般工业技术 | 3151篇 |
冶金工业 | 2119篇 |
原子能技术 | 174篇 |
自动化技术 | 11752篇 |
出版年
2024年 | 144篇 |
2023年 | 400篇 |
2022年 | 761篇 |
2021年 | 844篇 |
2020年 | 1016篇 |
2019年 | 804篇 |
2018年 | 784篇 |
2017年 | 946篇 |
2016年 | 1131篇 |
2015年 | 1226篇 |
2014年 | 2361篇 |
2013年 | 2238篇 |
2012年 | 2808篇 |
2011年 | 2655篇 |
2010年 | 2099篇 |
2009年 | 2185篇 |
2008年 | 2131篇 |
2007年 | 2406篇 |
2006年 | 2147篇 |
2005年 | 1973篇 |
2004年 | 1530篇 |
2003年 | 1410篇 |
2002年 | 1086篇 |
2001年 | 997篇 |
2000年 | 837篇 |
1999年 | 626篇 |
1998年 | 476篇 |
1997年 | 403篇 |
1996年 | 345篇 |
1995年 | 271篇 |
1994年 | 223篇 |
1993年 | 175篇 |
1992年 | 149篇 |
1991年 | 121篇 |
1990年 | 113篇 |
1989年 | 112篇 |
1988年 | 71篇 |
1987年 | 36篇 |
1986年 | 30篇 |
1985年 | 25篇 |
1984年 | 22篇 |
1983年 | 18篇 |
1982年 | 14篇 |
1981年 | 16篇 |
1980年 | 9篇 |
1979年 | 13篇 |
1975年 | 10篇 |
1964年 | 10篇 |
1963年 | 9篇 |
1957年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP. 相似文献
2.
When five axis CNC machine tools follow series linear toolpath segments, the drives experience velocity, acceleration and jerk discontinuities at the block transition points. The discontinuities result in fluctuations on machine tool motions which lead to poor surface quality. This paper proposes to insert quintic and septic micro-splines for the tool tip and tool-orientation, respectively, at the adjacent linear toolpath segments. Optimal control points are calculated for position and orientation splines to achieve C3 continuity at the junctions while respecting user-defined tolerance limits. The geometrically smoothed corners are traveled at a smoothly varying feed with cubic acceleration trajectory profile. The proposed method is experimentally demonstrated to show improvements in motion smoothness and tracking accuracy in five-axis machining of free-form surfaces found in dies, molds and aerospace parts. 相似文献
3.
In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations. 相似文献
4.
The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time. 相似文献
5.
6.
为了减小传统的最差情况设计方法引入的电压裕量,提出了一种变化可知的自适应电压缩减(AVS)技术,通过调整电源电压来降低电路功耗.自适应电压缩减技术基于检测关键路径的延时变化,基于此设计了一款预错误原位延时检测电路,可以检测关键路径延时并输出预错误信号,进而控制单元可根据反馈回的预错误信号的个数调整系统电压.本芯片采用SMIC180 nm工艺设计验证,仿真分析表明,采用自适应电压缩减技术后,4个目标验证电路分别节省功耗12.4%,11.3%,10.4%和11.6%. 相似文献
7.
Optimization of tool path planning using metaheuristic algorithms such as ant colony systems (ACS) and particle swarm optimization (PSO) provides a feasible approach to reduce geometrical machining errors in 5-axis flank machining of ruled surfaces. The optimal solutions of these algorithms exhibit an unsatisfactory quality in a high-dimensional search space. In this study, various algorithms derived from the electromagnetism-like mechanism (EM) were applied. The test results of representative surfaces showed that all EM-based methods yield more effective optimal solutions than does PSO, despite a longer search time. A new EM-MSS (electromagnetism-like mechanism with move solution screening) algorithm produces the most favorable results by ensuring the continuous improvement of new searches. Incorporating an SPSA (simultaneous perturbation stochastic approximation) technique further improves the search results with effective initial solutions. This work enhances the practical values of tool path planning by providing a satisfactory machining quality. 相似文献
8.
We consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights.The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim.Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse. 相似文献
9.
Based on the current spin density functional theory, a theoretical model of three vertically aligned semiconductor quantum dots is proposed and numerically studied. This quantum dot molecule (QDM) model is treated with realistic hard-wall confinement potential and external magnetic field in three-dimensional setting. Using the effective-mass approximation with band nonparabolicity, the many-body Hamiltonian results in a cubic eigenvalue problem from a finite difference discretization. A self-consistent algorithm for solving the Schrödinger-Poisson system by using the Jacobi-Davidson method and GMRES is given to illustrate the Kohn-Sham orbitals and energies of six electrons in the molecule with some magnetic fields. It is shown that the six electrons residing in the central dot at zero magnetic field can be changed to such that each dot contains two electrons with some feasible magnetic field. The Förster-Dexter resonant energy transfer may therefore be generated by two individual QDMs. This may motivate a new paradigm of Fermionic qubits for quantum computing in solid-state systems. 相似文献
10.
移动机器人路径规划方法研究 总被引:3,自引:0,他引:3
移动机器人技术研究中的一个重要领域是路径规划技术,它分为基于模型的环境已知的全局路径规划和基于传感器的环境未知的局部路径规划。综述了移动机器人路径规划技术的发展现状指出了各种方法的优点与不足,最后对移动机器人路径规划技术的发展趋势进行了展望。 相似文献