全文获取类型
收费全文 | 43203篇 |
免费 | 4924篇 |
国内免费 | 4023篇 |
专业分类
电工技术 | 5161篇 |
技术理论 | 1篇 |
综合类 | 7035篇 |
化学工业 | 1277篇 |
金属工艺 | 948篇 |
机械仪表 | 3705篇 |
建筑科学 | 1690篇 |
矿业工程 | 1289篇 |
能源动力 | 1128篇 |
轻工业 | 876篇 |
水利工程 | 1299篇 |
石油天然气 | 745篇 |
武器工业 | 656篇 |
无线电 | 3052篇 |
一般工业技术 | 2816篇 |
冶金工业 | 743篇 |
原子能技术 | 110篇 |
自动化技术 | 19619篇 |
出版年
2024年 | 170篇 |
2023年 | 446篇 |
2022年 | 752篇 |
2021年 | 844篇 |
2020年 | 1113篇 |
2019年 | 1115篇 |
2018年 | 1020篇 |
2017年 | 1294篇 |
2016年 | 1479篇 |
2015年 | 1665篇 |
2014年 | 2442篇 |
2013年 | 2968篇 |
2012年 | 2947篇 |
2011年 | 3324篇 |
2010年 | 2506篇 |
2009年 | 2782篇 |
2008年 | 2921篇 |
2007年 | 3414篇 |
2006年 | 3049篇 |
2005年 | 2560篇 |
2004年 | 2070篇 |
2003年 | 1837篇 |
2002年 | 1538篇 |
2001年 | 1317篇 |
2000年 | 1168篇 |
1999年 | 959篇 |
1998年 | 772篇 |
1997年 | 644篇 |
1996年 | 529篇 |
1995年 | 455篇 |
1994年 | 409篇 |
1993年 | 289篇 |
1992年 | 260篇 |
1991年 | 199篇 |
1990年 | 148篇 |
1989年 | 157篇 |
1988年 | 120篇 |
1987年 | 69篇 |
1986年 | 56篇 |
1985年 | 42篇 |
1984年 | 56篇 |
1983年 | 40篇 |
1982年 | 40篇 |
1981年 | 26篇 |
1980年 | 26篇 |
1979年 | 31篇 |
1978年 | 11篇 |
1977年 | 25篇 |
1976年 | 16篇 |
1975年 | 12篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
Simultaneous solving of balancing and sequencing problems with station-dependent assembly times for mixed-model assembly lines 总被引:1,自引:0,他引:1
In spite of many studies, investigating balancing and sequencing problems in Mixed-Model Assembly Line (MMAL) individually, this paper solves them simultaneously aiming to minimize total utility work. A new Mixed-Integer Linear Programming (MILP) model is developed to provide the exact solution of the problem with station-dependent assembly times. Because of NP-hardness, a Simulated Annealing (SA) is applied and compared to the Co-evolutionary Genetic Algorithm (Co-GA) from the literature. To strengthen the search process, two main hypotheses, namely simultaneous search and feasible search, are developed contrasting Co-GA. Various parameters of SA are reviewed to calibrate the algorithm by means of Taguchi design of experiments. Numerical results statistically show the efficiency and effectiveness of the proposed SA in terms of both the quality of solution and the time of achieving the best solution. Finally, the contribution of each hypothesis in this superiority is analyzed. 相似文献
92.
In this paper, we present the induced generalized intuitionistic fuzzy ordered weighted averaging (I-GIFOWA) operator. It is a new aggregation operator that generalized the IFOWA operator, including all the characteristics of both the generalized IFOWA and the induced IFOWA operators. It provides a very general formulation that includes as special cases a wide range of aggregation operators for intuitionistic fuzzy information, including all the particular cases of the I-IFOWA operator, GIFOWA operator and the induced intuitionistic fuzzy ordered geometric (I-IFOWG) operator. We also present the induced generalized interval-valued intuitionistic fuzzy ordered weighted averaging (I-GIIFOWA) operator to accommodate the environment in which the given arguments are interval-valued intuitionistic fuzzy sets. Further, we develop procedures to apply them to solve group multiple attribute decision making problems with intuitionistic fuzzy or interval-valued intuitionistic fuzzy information. Finally, we present their application to show the effectiveness of the developed methods. 相似文献
93.
In this article, we consider the project critical path problem in an environment with hybrid uncertainty. In this environment, the duration of activities are considered as random fuzzy variables that have probability and fuzzy natures, simultaneously. To obtain a robust critical path with this kind of uncertainty a chance constraints programming model is used. This model is converted to a deterministic model in two stages. In the first stage, the uncertain model is converted to a model with interval parameters by alpha-cut method and distribution function concepts. In the second stage, the interval model is converted to a deterministic model by robust optimization and min-max regret criterion and ultimately a genetic algorithm with a proposed exact algorithm are applied to solve the final model. Finally, some numerical examples are given to show the efficiency of the solution procedure. 相似文献
94.
Fault detection and isolation in rotating machinery is very important from an industrial viewpoint as it can help in maintenance activities and significantly reduce the down-time of the machine, resulting in major cost savings. Traditional methods have been found to be not very accurate. Soft computing based methods are now being increasingly employed for the purpose. The proposed method is based on a genetic programming technique which is known as gene expression programming (GEP). GEP is somewhat a new member of the genetic programming family. The main objective of this paper is to compare the classification accuracy of the proposed evolutionary computing based method with other pattern classification approaches such as support vector machine (SVM), Wavelet-GEP, and proximal support vector machine (PSVM). For this purpose, six states viz., normal, bearing fault, impeller fault, seal fault, impeller and bearing fault together, cavitation are simulated on centrifugal pump. Decision tree algorithm is used to select the features. The results obtained using GEP is compared with the performance of Wavelet-GEP, support vector machine (SVM) and proximal support vector machine (PSVM) based classifiers. It is observed that both GEP and SVM equally outperform the other two classifiers (PSVM and Wavelet-GEP) considered in the present study. 相似文献
95.
陈剑 《计算机与数字工程》2012,40(4):130-132
该文引入speedup作为并行程序的性能评测指标,分析了并行程序在不同类型和不同数量的客户虚拟机中运行的性能差异,实验表明,MPI并行程序在xVM虚拟化环境中的运行性能接近非虚拟化本地主机的性能,在半虚拟化环境中的并行程序性能超过全虚拟化环境中的并行程序性能。 相似文献
96.
97.
The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP() language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.In this paper we illustrate the practical applicability of CLP() with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(). A detailed look at some of the more important programming techniques highlights the ability of CLP() to support well-known, powerful techniques from constraint programming. Our thesis is that CLP() is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia. 相似文献
98.
Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG. 相似文献
99.
介绍燃煤锅炉供热系统的自动化节能模糊控制方案,燃煤锅炉供热系统是一个大惯性的滞后系统,传统的单纯PID控制效果不理想,而基于工人熟练的经验和专家知识的模糊控制能够达到比较好的效果。系统中对控制参考量水温和炉膛负压这两个输入量模糊化处理,由控制规则推出输出模糊子集,再应用模糊推理合成规则得出PID的系数,PID控制器根据输出量来控制鼓风机、引风机、炉排电机和水泵的变频器。 相似文献
100.
研究中医冠心病医案,高效挖掘有益信息规则问题,由于中医医案数据量大、关联性强,针对传统的关联规则挖掘算法处理中医医案数据时存在效率低、收敛速度慢及漏报规则等问题,提出一种小生境技术和基因表达式编程相结合的挖掘关联规则的方法。通过惩罚函数设置支持度阈值,利用小生境技术执行小生境演化、融合算法,结合基因表达式编程算法操作简单、鲁棒性强的优势搜索强关联规则,有效避免了算法早熟,解决了规则冗余。针对治疗冠心病的中医医案进行了验证性实验,实验结果表明,改进算法在提取有效信息的效率上有较大的提高,挖掘结果对冠心病中医临床诊治具有一定的参考价值。 相似文献