全文获取类型
收费全文 | 35249篇 |
免费 | 3763篇 |
国内免费 | 2765篇 |
专业分类
电工技术 | 2470篇 |
技术理论 | 1篇 |
综合类 | 4361篇 |
化学工业 | 2678篇 |
金属工艺 | 1343篇 |
机械仪表 | 2450篇 |
建筑科学 | 2856篇 |
矿业工程 | 1020篇 |
能源动力 | 674篇 |
轻工业 | 1443篇 |
水利工程 | 726篇 |
石油天然气 | 991篇 |
武器工业 | 292篇 |
无线电 | 4188篇 |
一般工业技术 | 4241篇 |
冶金工业 | 1783篇 |
原子能技术 | 462篇 |
自动化技术 | 9798篇 |
出版年
2024年 | 117篇 |
2023年 | 457篇 |
2022年 | 715篇 |
2021年 | 870篇 |
2020年 | 1053篇 |
2019年 | 981篇 |
2018年 | 902篇 |
2017年 | 1178篇 |
2016年 | 1253篇 |
2015年 | 1346篇 |
2014年 | 2223篇 |
2013年 | 2225篇 |
2012年 | 2669篇 |
2011年 | 2459篇 |
2010年 | 1931篇 |
2009年 | 2109篇 |
2008年 | 2158篇 |
2007年 | 2468篇 |
2006年 | 2246篇 |
2005年 | 1973篇 |
2004年 | 1600篇 |
2003年 | 1450篇 |
2002年 | 1140篇 |
2001年 | 1149篇 |
2000年 | 919篇 |
1999年 | 694篇 |
1998年 | 553篇 |
1997年 | 477篇 |
1996年 | 408篇 |
1995年 | 355篇 |
1994年 | 330篇 |
1993年 | 230篇 |
1992年 | 198篇 |
1991年 | 161篇 |
1990年 | 149篇 |
1989年 | 144篇 |
1988年 | 111篇 |
1987年 | 63篇 |
1986年 | 36篇 |
1985年 | 36篇 |
1984年 | 28篇 |
1983年 | 20篇 |
1982年 | 22篇 |
1981年 | 22篇 |
1980年 | 12篇 |
1979年 | 16篇 |
1964年 | 11篇 |
1963年 | 10篇 |
1961年 | 10篇 |
1959年 | 10篇 |
排序方式: 共有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.
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. 相似文献
3.
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. 相似文献
4.
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. 相似文献
5.
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. 相似文献
6.
2.4GHz动态CMOS分频器的设计 总被引:1,自引:0,他引:1
对现阶段的主流高速CMOS分频器进行分析和比较,在此基础上设计一种采用TSPC(truesingle phase clock)和E-TSPC(extended TSPC)技术的前置双模分频器电路.该分频器大大提高了工作频率,采用0.6μm CMOS工艺参数进行仿真的结果表明,在5V电源电压下,最高频率达到3GHz,功耗仅为8mW. 相似文献
7.
8.
串行和并行接口模式是A/D转换器诸多分类中的一种,但却是应用中器件选择的一个重要指标.在同样的转换分辨率及转换速度的前提下,不同的接口方式不但影响了电路结构,更重要的是将在高速数据采集的过程中对采样周期产生较大影响.本文通过12位串行ADC ADS7822和并行ADC ADS774与AT89C51的接口电路,给出二者采样时间的差异性. 相似文献
9.
In this paper the optimal H∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration. 相似文献
10.
醇镁还原法一步制取对氯苯胺是一种新的方法 ,研究发现最佳反应温度为 80℃~ 85℃ ,反应时间为4h ,对氯硝基苯与镁粉的用量 (物质的量比 )为 1∶3,产率为 80 %。 相似文献