全文获取类型
收费全文 | 69732篇 |
免费 | 10247篇 |
国内免费 | 6031篇 |
专业分类
电工技术 | 7929篇 |
技术理论 | 2篇 |
综合类 | 7003篇 |
化学工业 | 5940篇 |
金属工艺 | 3662篇 |
机械仪表 | 6970篇 |
建筑科学 | 3715篇 |
矿业工程 | 2302篇 |
能源动力 | 3240篇 |
轻工业 | 4084篇 |
水利工程 | 1765篇 |
石油天然气 | 2807篇 |
武器工业 | 939篇 |
无线电 | 5336篇 |
一般工业技术 | 7181篇 |
冶金工业 | 2608篇 |
原子能技术 | 375篇 |
自动化技术 | 20152篇 |
出版年
2024年 | 644篇 |
2023年 | 1687篇 |
2022年 | 2814篇 |
2021年 | 3029篇 |
2020年 | 3366篇 |
2019年 | 2874篇 |
2018年 | 2605篇 |
2017年 | 3129篇 |
2016年 | 3399篇 |
2015年 | 3718篇 |
2014年 | 5254篇 |
2013年 | 5150篇 |
2012年 | 5737篇 |
2011年 | 5848篇 |
2010年 | 4106篇 |
2009年 | 4358篇 |
2008年 | 3846篇 |
2007年 | 4430篇 |
2006年 | 3643篇 |
2005年 | 2959篇 |
2004年 | 2442篇 |
2003年 | 1950篇 |
2002年 | 1671篇 |
2001年 | 1356篇 |
2000年 | 1151篇 |
1999年 | 828篇 |
1998年 | 746篇 |
1997年 | 643篇 |
1996年 | 511篇 |
1995年 | 441篇 |
1994年 | 353篇 |
1993年 | 266篇 |
1992年 | 227篇 |
1991年 | 178篇 |
1990年 | 160篇 |
1989年 | 140篇 |
1988年 | 82篇 |
1987年 | 37篇 |
1986年 | 31篇 |
1985年 | 25篇 |
1984年 | 27篇 |
1983年 | 27篇 |
1982年 | 26篇 |
1981年 | 13篇 |
1980年 | 21篇 |
1979年 | 16篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1975年 | 5篇 |
1951年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
High dimensionality in real-world multi-reservoir systems greatly hinders the application and popularity of evolutionary algorithms, especially for systems with heterogeneous units. An efficient hierarchical optimization framework is presented for search space reduction, determining the best water distributions, not only between cascade reservoirs, but also among different types of hydropower units. The framework is applied to the Three Gorges Project (TGP) system and the results demonstrate that the difficulties of multi-reservoir optimization caused by high dimensionality can be effectively solved by the proposed hierarchical method. For the day studied, power output could be increased by 6.79 GWh using an optimal decision with the same amount of water actually used; while the same amount of power could be generated with 2.59 × 107 m3 less water compared to the historical policy. The methodology proposed is general in that it can be used for other reservoir systems and other types of heterogeneous unit generators. 相似文献
22.
Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm. 相似文献
23.
This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation. 相似文献
24.
The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one. 相似文献
25.
In this paper, we introduce an optimization strategy in order to comprehensively quantify the impact of availability and maintenance notions during the early stages of synthesis and design of a new natural gas combined cycle power plant. A detailed state-space approach is thoroughly discussed, where influence of maintenance funds on each component's repair rate is directly assessed.In this context, analysis of the reliability characteristics of the system is centered at two designer-adopted parameters, which largely influence the obtained results: the number of components which may fail independently at the same time, and the number of simultaneous failure/repair events.Then, optimal solutions are evaluated as the availability-related parameters and the amount of resources assigned for maintenance actions are varied across a wide range of feasible values, which enable obtaining more accurate and detailed estimations of the expected economic performance for the project when compared with traditional economic evaluation approaches. 相似文献
26.
For many-objective optimization problems, how to get a set of solutions with good convergence and diversity is a difficult and challenging work. In this paper, a new decomposition based evolutionary algorithm with uniform designs is proposed to achieve the goal. The proposed algorithm adopts the uniform design method to set the weight vectors which are uniformly distributed over the design space, and the size of the weight vectors neither increases nonlinearly with the number of objectives nor considers a formulaic setting. A crossover operator based on the uniform design method is constructed to enhance the search capacity of the proposed algorithm. Moreover, in order to improve the convergence performance of the algorithm, a sub-population strategy is used to optimize each sub-problem. Comparing with some efficient state-of-the-art algorithms, e.g., NSGAII-CE, MOEA/D and HypE, on six benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. 相似文献
27.
Non-convex of an optimal power dispatch problem makes it difficult to guarantee the global optimum. This paper presents a convex relaxation approach, called the Moment Semidefinite Programming (MSDP) method, to facilitate the search for deterministic global optimal solutions. The method employs a sequence of moments, which can linearize polynomial functions and construct positive semidefinite moment matrices, to form an SDP convex relaxation for power dispatch problems. In particular, the rank of the moment matrix is used as a sufficient condition to ensure the global optimality. The same condition can also be leveraged to estimate the number of global optimal solution(s). This method is effectively applied to {0,1}-economic dispatch (ED) problems and optimal power flow (OPF) problems. Simulation results showed that the MSDP method is capable of solving {0,1}-ED problems with integer values directly, and is able to identify if more than one global optimal solutions exist. In additional, the method can obtain rank-1 moment matrices for OPF’s counterexamples of existing SDP method, this ensures the global solution and overcomes the problem that existing SDP method cannot meet the rank-1 condition sometimes. 相似文献
28.
Adebisi A. Okeleye 《Chemical Engineering Communications》2019,206(9):1181-1198
In this work, the effects of solid/solvent ratio (0.10–0.25?g/ml), extraction time (3–8?h), and solvent type (n-hexane, ethyl acetate, and acetone) together with their shared interactions on Kariya seed oil (KSO) yield were investigated. The oil extraction process was modeled via response surface methodology (RSM), artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS) while the optimization of the three input variables essential to the oil extraction process was carried out by genetic algorithm (GA) and RSM methods. The low mean relative percent deviation (MRPD) of 0.94–4.69% and high coefficient of determination (R2) > 0.98 for the models developed demonstrate that they describe the solvent extraction process with high accuracy in this order: ANFIS, ANN, and RSM. The best operating condition (solid/solvent ratio of 0.1?g/ml, extraction time of 8?h, and acetone as solvent of extraction) that gave the highest KSO yield (32.52?wt.%) was obtained using GA-ANFIS and GA-ANN. Solvent extraction efficiency evaluation showed that ethyl acetate, n-hexane, and acetone gave maximum experimental oil yields of 19.20?±?0.28, 25.11?±?0.01, and 32.33?±?0.04?wt.%, respectively. Properties of the KSO varied based on the type of solvent used. The results of this work showed that KSO could function as raw material in both food and chemical industries. 相似文献
29.
Due to the law of reflection, a concave reflecting surface/mirror causes the incident light rays to converge and a convex surface/mirror causes the light rays to reflect away so that they all appear to be diverging. These converging and diverging behaviors cause that the curved mirrors show different image types depending on the distance between the object and the mirror. We model such optical phenomena metaphorically into the searching process of numerical optimization by a new algorithm called optics inspired optimization (OIO). OIO treats the surface of the numerical function to be optimized as a reflecting surface in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each individual is assumed to be an artificial object (or light point) that its artificially glittered ray is reflected back by the function surface, given that the surface is convex or concave, and the artificial image is formed (a candidate solution is generated within the search domain) based on the mirror equations adopted from physics of optics. Besides OIO, we introduce different variants of it, called ROIO (Rotation based OIO), and COIO (Convex combination based OIO) algorithms and conduct an extensive computational effort to find out the merit of the new algorithms. Our comparisons on benchmark test functions and a real world engineering design application (i.e., optimization of a centrifuge pump) demonstrate that the new algorithms are efficient and compete better than or similar to most of state of the art optimization algorithms with the advantage of accepting few input parameters. 相似文献
30.
We study a two-stage stochastic and nonlinear optimization model for operating a power grid exposed to a natural disaster. Although this approach can be generalized to any natural hazard of continuous (and not instantaneous) nature, our focus is on wildfires. We assume that an approaching wildfire impacts the power grid by reducing the transmission capacity of its overhead lines. At the time when proactive decisions have to be taken, the severity of the wildfire is not known. This introduces uncertainty. In this paper, we extend previous work by more realistically capturing this uncertainty and by strengthening the mathematical programming formulation through standard reformulation techniques. With these reformulation techniques, the resulting two-stage, convex mixed-integer quadratically constrained programming formulation can be efficiently solved using commercial quadratic programming solvers as demonstrated on a case study on a modified version of the IEEE 123-bus test system with 100 scenarios. We also quantify the uncertainties through a second case study using the following three standard metrics of two-stage stochastic optimization: the expected value of perfect information, the expected result of using the expected value solution and the value of the stochastic solution. 相似文献