全文获取类型
收费全文 | 26292篇 |
免费 | 2690篇 |
国内免费 | 2572篇 |
专业分类
电工技术 | 1607篇 |
技术理论 | 1篇 |
综合类 | 3112篇 |
化学工业 | 931篇 |
金属工艺 | 293篇 |
机械仪表 | 1732篇 |
建筑科学 | 1562篇 |
矿业工程 | 419篇 |
能源动力 | 536篇 |
轻工业 | 434篇 |
水利工程 | 649篇 |
石油天然气 | 290篇 |
武器工业 | 136篇 |
无线电 | 2376篇 |
一般工业技术 | 2989篇 |
冶金工业 | 865篇 |
原子能技术 | 87篇 |
自动化技术 | 13535篇 |
出版年
2024年 | 107篇 |
2023年 | 286篇 |
2022年 | 494篇 |
2021年 | 554篇 |
2020年 | 750篇 |
2019年 | 692篇 |
2018年 | 673篇 |
2017年 | 851篇 |
2016年 | 989篇 |
2015年 | 1059篇 |
2014年 | 1834篇 |
2013年 | 2278篇 |
2012年 | 2074篇 |
2011年 | 1894篇 |
2010年 | 1526篇 |
2009年 | 1835篇 |
2008年 | 1868篇 |
2007年 | 1890篇 |
2006年 | 1616篇 |
2005年 | 1474篇 |
2004年 | 1137篇 |
2003年 | 954篇 |
2002年 | 779篇 |
2001年 | 708篇 |
2000年 | 564篇 |
1999年 | 471篇 |
1998年 | 366篇 |
1997年 | 295篇 |
1996年 | 226篇 |
1995年 | 217篇 |
1994年 | 182篇 |
1993年 | 144篇 |
1992年 | 128篇 |
1991年 | 101篇 |
1990年 | 91篇 |
1989年 | 95篇 |
1988年 | 66篇 |
1987年 | 31篇 |
1986年 | 29篇 |
1985年 | 28篇 |
1984年 | 25篇 |
1983年 | 18篇 |
1982年 | 11篇 |
1981年 | 17篇 |
1980年 | 12篇 |
1979年 | 9篇 |
1975年 | 11篇 |
1964年 | 8篇 |
1963年 | 9篇 |
1961年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed. 相似文献
2.
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. 相似文献
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.
Georgios Tsaparlis 《Israel journal of chemistry》2019,59(6-7):478-492
Numerous conceptual difficulties and misconceptions have been reported in the science and chemistry education literature about electrochemistry concepts such as electrolytes, redox equations, and about electrochemical (galvanic and electrolytic) cells. Other studies have considered teaching approaches aimed at improving learning and at overcoming misconceptions. This paper reviews these studies and considers strategies and approaches for the effective teaching of electrochemistry. Then, the review focuses on problem solving in equilibrium electrochemistry, especially problems involving the Nernst equation. The main findings of four studies with Greek university chemistry students, dealing with: (i) algorithmic problem‐solving ability; (ii) practice on problem solving; (iii) the effect of the format of a problem; and (iv) the construction and evaluation of a website devoted to electrochemistry problem solving, are reported. 相似文献
5.
The main purpose of this paper is to survey some recent progresses on control theory for stochastic distributed parameter systems, i.e., systems governed by stochastic differential equations in infinite dimensions, typically by stochastic partial differential equations. We will explain the new phenomenon and difficulties in the study of controllability and optimal control problems for one dimensional stochastic parabolic equations and stochastic hyperbolic equations. In particular, we shall see that both the formulation of corresponding stochastic control problems and the tools to solve them may differ considerably from their deterministic/finite-dimensional counterparts. More importantly, one has to develop new tools, say, the stochastic transposition method introduced in our previous works, to solve some problems in this field. 相似文献
6.
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. 相似文献
7.
Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed. 相似文献
8.
Fatemeh Abdi 《Optimization methods & software》2019,34(1):25-36
In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm. 相似文献
9.
Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound. 相似文献
10.
D.R. Santos‐Peñate C.M. Campos‐Rodríguez J.A. Moreno‐Pérez 《International Transactions in Operational Research》2019,26(1):340-363
The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included. 相似文献