全文获取类型
收费全文 | 60752篇 |
免费 | 8318篇 |
国内免费 | 6217篇 |
专业分类
电工技术 | 6083篇 |
技术理论 | 2篇 |
综合类 | 8303篇 |
化学工业 | 4218篇 |
金属工艺 | 2058篇 |
机械仪表 | 5432篇 |
建筑科学 | 6834篇 |
矿业工程 | 2125篇 |
能源动力 | 1852篇 |
轻工业 | 1349篇 |
水利工程 | 2320篇 |
石油天然气 | 1668篇 |
武器工业 | 1088篇 |
无线电 | 4577篇 |
一般工业技术 | 7093篇 |
冶金工业 | 1920篇 |
原子能技术 | 300篇 |
自动化技术 | 18065篇 |
出版年
2024年 | 395篇 |
2023年 | 989篇 |
2022年 | 1738篇 |
2021年 | 1907篇 |
2020年 | 2165篇 |
2019年 | 1825篇 |
2018年 | 1883篇 |
2017年 | 2277篇 |
2016年 | 2676篇 |
2015年 | 2690篇 |
2014年 | 4040篇 |
2013年 | 4115篇 |
2012年 | 5002篇 |
2011年 | 4714篇 |
2010年 | 3788篇 |
2009年 | 3940篇 |
2008年 | 3859篇 |
2007年 | 4419篇 |
2006年 | 3823篇 |
2005年 | 3227篇 |
2004年 | 2553篇 |
2003年 | 2155篇 |
2002年 | 1731篇 |
2001年 | 1639篇 |
2000年 | 1429篇 |
1999年 | 1118篇 |
1998年 | 897篇 |
1997年 | 755篇 |
1996年 | 617篇 |
1995年 | 540篇 |
1994年 | 468篇 |
1993年 | 360篇 |
1992年 | 284篇 |
1991年 | 234篇 |
1990年 | 211篇 |
1989年 | 217篇 |
1988年 | 145篇 |
1987年 | 73篇 |
1986年 | 42篇 |
1985年 | 41篇 |
1984年 | 45篇 |
1983年 | 34篇 |
1982年 | 31篇 |
1981年 | 22篇 |
1980年 | 27篇 |
1979年 | 26篇 |
1963年 | 9篇 |
1961年 | 9篇 |
1959年 | 11篇 |
1955年 | 11篇 |
排序方式: 共有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.
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.
Mingchang Lin Yufei Zhang Guosong Chen Ming Jiang 《Small (Weinheim an der Bergstrasse, Germany)》2015,11(45):6065-6070
Glyco‐mimicking nanoparticles (glyco‐NPs) with Förster resonance energy transfer (FRET) donor and acceptor groups formed via dynamic covalent bond of benzoboroxole and sugar from two complementary polymers are prepared. The glyco‐NPs are proved to be quite stable under physiological conditions but sensitive to pH. So the glyco‐NPs can be internalized by dendritic cells with integrity and nontoxicity and then dissociate within the acidic organelles. This particle dissociation is directly observed and visualized in vitro, for the first time via the FRET measurements and fluorescent microscopy. This feature makes controlled release of drug or protein by glyco‐NPs possible, i.e., when model antigen Ovalbumin is loaded in the glyco‐NPs, the released Ovalbumin in dendritic cells stimulates T cells more efficiently than the free Ovalbumin itself as a result of the enhanced antigen processing and presentation. Thus, the results enlighten a bright future of the glyco‐NPs in immunotherapy. 相似文献
6.
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. 相似文献
7.
This study addresses the problem of choosing the most suitable probabilistic model selection criterion for unsupervised learning
of visual context of a dynamic scene using mixture models. A rectified Bayesian Information Criterion (BICr) and a Completed
Likelihood Akaike’s Information Criterion (CL-AIC) are formulated to estimate the optimal model order (complexity) for a given
visual scene. Both criteria are designed to overcome poor model selection by existing popular criteria when the data sample
size varies from small to large and the true mixture distribution kernel functions differ from the assumed ones. Extensive
experiments on learning visual context for dynamic scene modelling are carried out to demonstrate the effectiveness of BICr
and CL-AIC, compared to that of existing popular model selection criteria including BIC, AIC and Integrated Completed Likelihood
(ICL). Our study suggests that for learning visual context using a mixture model, BICr is the most appropriate criterion given
sparse data, while CL-AIC should be chosen given moderate or large data sample sizes. 相似文献
8.
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. 相似文献
9.
10.
介绍北方交通大学与比利时鲁汶大学、布鲁塞尔自由大学、比利时铁路公司合作,在巴黎至布鲁塞尔之间高速铁路线上的Antoing大桥进行的二次高速铁路桥梁动力试验。试验桥梁由跨度50m的多跨预应力混凝土简支槽型梁构成,试验中列车速度达265-310km/h。通过现场试验和实验结果分析,得到了桥梁的频率、振型、阻尼等自振特性,以及桥梁在高速列车作用下的动挠度、梁和桥墩的横向和竖向加速度、橡胶支座的相对位移、梁体的动应变等动力响应特性。试验经验和测试结果对于充实高速铁路桥梁动力分析理论、改进数值分析模型、验证计算结果、提高高速铁路桥梁的动力设计水平、保证行车安全,具有重要的意义。 相似文献