全文获取类型
收费全文 | 23325篇 |
免费 | 2678篇 |
国内免费 | 2245篇 |
专业分类
电工技术 | 1041篇 |
技术理论 | 1篇 |
综合类 | 3248篇 |
化学工业 | 754篇 |
金属工艺 | 253篇 |
机械仪表 | 1261篇 |
建筑科学 | 1616篇 |
矿业工程 | 404篇 |
能源动力 | 404篇 |
轻工业 | 435篇 |
水利工程 | 488篇 |
石油天然气 | 326篇 |
武器工业 | 151篇 |
无线电 | 2141篇 |
一般工业技术 | 2137篇 |
冶金工业 | 1168篇 |
原子能技术 | 112篇 |
自动化技术 | 12308篇 |
出版年
2024年 | 102篇 |
2023年 | 331篇 |
2022年 | 538篇 |
2021年 | 560篇 |
2020年 | 596篇 |
2019年 | 547篇 |
2018年 | 481篇 |
2017年 | 633篇 |
2016年 | 737篇 |
2015年 | 744篇 |
2014年 | 1413篇 |
2013年 | 1415篇 |
2012年 | 1668篇 |
2011年 | 1603篇 |
2010年 | 1352篇 |
2009年 | 1510篇 |
2008年 | 1612篇 |
2007年 | 1748篇 |
2006年 | 1538篇 |
2005年 | 1419篇 |
2004年 | 1161篇 |
2003年 | 1076篇 |
2002年 | 956篇 |
2001年 | 882篇 |
2000年 | 750篇 |
1999年 | 559篇 |
1998年 | 419篇 |
1997年 | 332篇 |
1996年 | 256篇 |
1995年 | 215篇 |
1994年 | 202篇 |
1993年 | 152篇 |
1992年 | 116篇 |
1991年 | 99篇 |
1990年 | 91篇 |
1989年 | 93篇 |
1988年 | 72篇 |
1987年 | 36篇 |
1986年 | 26篇 |
1985年 | 25篇 |
1984年 | 23篇 |
1983年 | 13篇 |
1982年 | 13篇 |
1981年 | 13篇 |
1979年 | 9篇 |
1964年 | 10篇 |
1963年 | 11篇 |
1958年 | 8篇 |
1957年 | 9篇 |
1955年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
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.
6.
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. 相似文献
7.
随着计算机网络技术的发展,远程教学系统的结构发生了重大的变化,逐步由原来的客户机/服务器(C/S)结构转变为基于Internet的浏览器/服务器(B/S)结构。本文提出了基于CORBA技术的B/S结构系统模型。分析了其运行过程,并与传统的结构进行了比较,指明了其优越性。在本文的结尾。指出了使用这种技术的一个具体例子。 相似文献
8.
高功率脉冲水中放电的应用及其发展 总被引:7,自引:0,他引:7
首先介绍了高功率脉冲水下放电的机理,然后综合论述了其应用和研究的状况,从较为成熟的脉冲水处理技术到医疗领域的ESWL应用技术,以及在脉冲电场食品杀菌和水下目标探测方面的最新发展和研究,最后指出了高功率脉冲电技术应用前景以及进行更系统和深入研究的必要性。 相似文献
9.
从"天人合一"到"物我合一"——设计艺术中我国观念的转化 总被引:1,自引:1,他引:0
通过我国设计艺术中人与自然以及人与物古今观念的对比,试图分析这种观念的转化产生的深层社会背景和对设计的影响。 相似文献
10.
Thirty patients who had undergone either a right or left unilateral temporal lobectomy (14 RTL; 16 LTL) and 16 control participants were tested on a computerized human analogue of the Morris Water Maze. The procedure was designed to compare allocentric and egocentric spatial memory. In the allocentric condition, participants searched for a target location on the screen, guided by object cues. Between trials, participants had to walk around the screen, which disrupted egocentric memory representation. In the egocentric condition, participants remained in the same position, but the object cues were shifted between searches to prevent them from using allocentric memory. Only the RTL group was impaired on the allocentric condition, and neither the LTL nor RTL group was impaired on additional tests of spatial working memory or spatial manipulation. The results support the notion that the right anterior temporal lobe stores long-term allocentric spatial memories. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献