全文获取类型
收费全文 | 2315篇 |
免费 | 80篇 |
国内免费 | 70篇 |
专业分类
电工技术 | 64篇 |
技术理论 | 1篇 |
综合类 | 125篇 |
化学工业 | 61篇 |
金属工艺 | 21篇 |
机械仪表 | 74篇 |
建筑科学 | 124篇 |
矿业工程 | 20篇 |
能源动力 | 60篇 |
轻工业 | 17篇 |
水利工程 | 10篇 |
石油天然气 | 13篇 |
武器工业 | 7篇 |
无线电 | 92篇 |
一般工业技术 | 182篇 |
冶金工业 | 335篇 |
原子能技术 | 5篇 |
自动化技术 | 1254篇 |
出版年
2024年 | 5篇 |
2023年 | 14篇 |
2022年 | 20篇 |
2021年 | 26篇 |
2020年 | 25篇 |
2019年 | 42篇 |
2018年 | 32篇 |
2017年 | 72篇 |
2016年 | 79篇 |
2015年 | 99篇 |
2014年 | 122篇 |
2013年 | 157篇 |
2012年 | 102篇 |
2011年 | 165篇 |
2010年 | 122篇 |
2009年 | 149篇 |
2008年 | 173篇 |
2007年 | 171篇 |
2006年 | 148篇 |
2005年 | 130篇 |
2004年 | 103篇 |
2003年 | 88篇 |
2002年 | 81篇 |
2001年 | 57篇 |
2000年 | 39篇 |
1999年 | 41篇 |
1998年 | 32篇 |
1997年 | 20篇 |
1996年 | 10篇 |
1995年 | 13篇 |
1994年 | 6篇 |
1993年 | 7篇 |
1992年 | 11篇 |
1991年 | 7篇 |
1990年 | 11篇 |
1989年 | 10篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 11篇 |
1984年 | 4篇 |
1975年 | 2篇 |
1971年 | 3篇 |
1968年 | 2篇 |
1966年 | 2篇 |
1965年 | 2篇 |
1964年 | 4篇 |
1961年 | 2篇 |
1959年 | 2篇 |
1955年 | 6篇 |
1954年 | 4篇 |
排序方式: 共有2465条查询结果,搜索用时 750 毫秒
1.
Felipe A. Perdomo Siti H. Khalit Claire S. Adjiman Amparo Galindo George Jackson 《American Institute of Chemical Engineers》2021,67(3):e17194
The SAFT-γ Mie group-contribution equation of state is used to represent the fluid-phase behavior of aqueous solutions of a variety of linear, branched, and cyclic amines. New group interactions are developed in order to model the mixtures of interest, including the like and unlike interactions between alkyl primary, secondary, and tertiary amine groups (NH2, NH, N), cyclic secondary and tertiary amine groups (cNH, cN), and cyclic methine-amine groups (cCHNH, cCHN) with water (H2O). The group-interaction parameters are estimated from appropriate experimental thermodynamic data for pure amines and selected mixtures. By taking advantage of the group-contribution nature of the method, one can describe the fluid-phase behavior of mixtures of molecules comprising those groups over broad ranges of temperature, pressure, and composition. A number of aqueous solutions of amines are studied including linear, branched aliphatic, and cyclic amines. Liquid–liquid equilibria (LLE) bounded by lower critical solution temperatures (LCSTs) have been reported experimentally and are reproduced here with the SAFT-γ Mie approach. The main feature of the approach is the ability not only to represent accurately the experimental data employed in the parameter estimation, but also to predict the vapor–liquid, liquid–liquid, and vapor–liquid–liquid equilibria, and LCSTs with the same set of parameters. Pure compound and binary phase diagrams of diverse types of amines and their aqueous solutions are assessed in order to demonstrate the main features of the thermodynamic and fluid-phase behavior. 相似文献
2.
In this paper, we investigate how adaptive operator selection techniques are able to efficiently manage the balance between exploration and exploitation in an evolutionary algorithm, when solving combinatorial optimization problems. We introduce new high level reactive search strategies based on a generic algorithm's controller that is able to schedule the basic variation operators of the evolutionary algorithm, according to the observed state of the search. Our experiments on SAT instances show that reactive search strategies improve the performance of the solving algorithm. 相似文献
3.
In this research, we propose a novel framework referred to as collective game behavior decomposition where complex collective behavior is assumed to be generated by aggregation of several groups of agents following different strategies and complexity emerges from collaboration and competition of individuals. The strategy of an agent is modeled by certain simple game theory models with limited information. Genetic algorithms are used to obtain the optimal collective behavior decomposition based on history data. The trained model can be used for collective behavior prediction. For modeling individual behavior, two simple games, the minority game and mixed game are investigated in experiments on the real-world stock prices and foreign-exchange rate. Experimental results are presented to show the effectiveness of the new proposed model. 相似文献
4.
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. 相似文献
5.
This paper proposes the application of Covariance Matrix Adaptation Evolution Strategy (CMA-ES) in fixed structure H∞ loop shaping controller design. Integral Time Absolute Error (ITAE) performance requirement is incorporated as a constraint with an objective of maximization of stability margin in the fixed structure H∞ loop shaping controller design problem. Pneumatic servo system, separating tower process and F18 fighter aircraft system are considered as test systems. The CMA-ES designed fixed structure H∞ loop-shaping controller is compared with the traditional H∞ loop shaping controller, non-smooth optimization and Heuristic Kalman Algorithm (HKA) based fixed structure H∞ loop shaping controllers in terms of stability margin. 20% perturbation in the nominal plant is used to validate the robustness of the CMA-ES designed H∞ loop shaping controller. The effect of Finite Word Length (FWL) is considered to show the implementation difficulties of controller in digital processors. Simulation results demonstrated that CMA-ES based fixed structure H∞ loop shaping controller is suitable for real time implementation with good robust stability and performance. 相似文献
6.
Combinatorial auction is a useful trade manner for transportation service procurements in e-marketplaces. To enhance the competition of combinatorial auction, a novel auction mechanism of two-round bidding with bundling optimization is proposed. As the recommended the auction mechanism, the shipper/auctioneer integrates the objects into several bundles based on the bidding results of first round auction. Then, carriers/bidders bid for the object bundles in second round. The bundling optimization is described as a multi-objective model with two criteria on price complementation and combination consistency. A Quantum Evolutionary Algorithm (QEA) with β-based rotation gate and the encoding scheme based on non-zero elements in complementary coefficient matrix is developed for the model solution. Comparing with a Contrast Genetic Algorithm, QEA can achieve better computational performances for small and middle size problems. 相似文献
7.
Désiré Lara; Veissier Isabelle; Després Gérard; Boissy Alain 《Canadian Metallurgical Quarterly》2004,118(4):363
Appraisal theories provide a framework that gives insight into emotions and could allow comparisons across species. According to these theories, events are first evaluated on their suddenness, novelty, and unpredictability. The authors examined the ability of lambs (Ovis aries) to evaluate an event according to these 3 criteria through 3 tests. The lambs responded to suddenness with a startle response coupled with an increase in heart rate and to novelty with an orientation response coupled with an increase of vagal activity. There was no clear evidence that lambs can detect the predictability of an event. Those results support the usefulness of appraisal theories to assess emotion in animals. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
8.
I. Belda X. Llorà E. Giralt 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2006,10(4):295-304
One of the goals of computational chemistry is the automated de novo design of bioactive molecules. Despite significant progress
in computational approaches to ligand design and efficient evaluation of binding energy, novel procedures for ligand design
are required. Evolutionary computation provides a new approach to this design issue. This paper presents an automated methodology
for computer-aided peptide design based on evolutionary algorithms. It provides an automatic tool for peptide de novo design,
based on protein surface patches defined by user. Regarding the restrictive constrains of this problem a special emphasis has been made on the design of the
evolutionary algorithms implemented. 相似文献
9.
Optimal ensemble construction via meta-evolutionary ensembles 总被引:1,自引:0,他引:1
In this paper, we propose a meta-evolutionary approach to improve on the performance of individual classifiers. In the proposed system, individual classifiers evolve, competing to correctly classify test points, and are given extra rewards for getting difficult points right. Ensembles consisting of multiple classifiers also compete for member classifiers, and are rewarded based on their predictive performance. In this way we aim to build small-sized optimal ensembles rather than form large-sized ensembles of individually-optimized classifiers. Experimental results on 15 data sets suggest that our algorithms can generate ensembles that are more effective than single classifiers and traditional ensemble methods. 相似文献
10.
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n2) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node. 相似文献