首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16655篇
  免费   1310篇
  国内免费   1233篇
电工技术   754篇
技术理论   5篇
综合类   2271篇
化学工业   757篇
金属工艺   242篇
机械仪表   757篇
建筑科学   1692篇
矿业工程   371篇
能源动力   444篇
轻工业   430篇
水利工程   426篇
石油天然气   293篇
武器工业   63篇
无线电   920篇
一般工业技术   1886篇
冶金工业   888篇
原子能技术   84篇
自动化技术   6915篇
  2024年   60篇
  2023年   144篇
  2022年   243篇
  2021年   279篇
  2020年   358篇
  2019年   363篇
  2018年   361篇
  2017年   450篇
  2016年   540篇
  2015年   545篇
  2014年   1146篇
  2013年   1186篇
  2012年   1369篇
  2011年   1300篇
  2010年   1061篇
  2009年   1106篇
  2008年   1087篇
  2007年   1129篇
  2006年   993篇
  2005年   893篇
  2004年   682篇
  2003年   612篇
  2002年   486篇
  2001年   487篇
  2000年   403篇
  1999年   325篇
  1998年   246篇
  1997年   198篇
  1996年   164篇
  1995年   151篇
  1994年   129篇
  1993年   107篇
  1992年   90篇
  1991年   74篇
  1990年   73篇
  1989年   79篇
  1988年   59篇
  1987年   29篇
  1986年   19篇
  1985年   16篇
  1984年   14篇
  1983年   12篇
  1982年   11篇
  1981年   13篇
  1979年   8篇
  1964年   8篇
  1963年   9篇
  1961年   8篇
  1959年   8篇
  1955年   7篇
排序方式: 共有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.
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.
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.  相似文献   
7.
A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained, the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy of the solution of this system is ten times higher than when using three field elements. __________ Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007.  相似文献   
8.
林海清 《中国钨业》2003,18(6):28-30
简述了我国钨矿业概况、现有采选技术水平及钨矿加工利用率 ;从资源配置出发 ,阐述了钨矿业发展存在的几个主要问题 ,并且针对性地提出了可持续发展的几点建议。  相似文献   
9.
The Karhunen–Loève Galerkin procedure is employed to solve an inverse radiation problem of determining the time‐varying strength of a heat source, which mimics flames in a furnace, from temperature measurements in three‐dimensional participating media where radiation and conduction occur simultaneously. The inverse radiation problem is solved through the minimization of a performance function, which is expressed by the sum of square residuals between calculated and observed temperature, using a conjugate gradient method. Through the Karhunen–Loève Galerkin procedure, one can represent the system dynamics with a minimum degree of freedom, and consequently the amount of computation required in the solution of the inverse problem is reduced drastically when the present technique is adopted. Copyright © 2004 John Wiley & Sons, Ltd.  相似文献   
10.
A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号