全文获取类型
收费全文 | 43508篇 |
免费 | 5336篇 |
国内免费 | 3632篇 |
专业分类
电工技术 | 4845篇 |
技术理论 | 1篇 |
综合类 | 5395篇 |
化学工业 | 3213篇 |
金属工艺 | 1072篇 |
机械仪表 | 3438篇 |
建筑科学 | 2254篇 |
矿业工程 | 896篇 |
能源动力 | 1191篇 |
轻工业 | 1945篇 |
水利工程 | 895篇 |
石油天然气 | 1935篇 |
武器工业 | 614篇 |
无线电 | 3984篇 |
一般工业技术 | 3568篇 |
冶金工业 | 844篇 |
原子能技术 | 239篇 |
自动化技术 | 16147篇 |
出版年
2024年 | 187篇 |
2023年 | 497篇 |
2022年 | 1083篇 |
2021年 | 1234篇 |
2020年 | 1282篇 |
2019年 | 1124篇 |
2018年 | 1013篇 |
2017年 | 1302篇 |
2016年 | 1521篇 |
2015年 | 1782篇 |
2014年 | 2523篇 |
2013年 | 2829篇 |
2012年 | 3156篇 |
2011年 | 3443篇 |
2010年 | 2635篇 |
2009年 | 2984篇 |
2008年 | 3048篇 |
2007年 | 3415篇 |
2006年 | 3000篇 |
2005年 | 2469篇 |
2004年 | 2121篇 |
2003年 | 1774篇 |
2002年 | 1522篇 |
2001年 | 1193篇 |
2000年 | 1067篇 |
1999年 | 756篇 |
1998年 | 634篇 |
1997年 | 556篇 |
1996年 | 409篇 |
1995年 | 330篇 |
1994年 | 288篇 |
1993年 | 221篇 |
1992年 | 208篇 |
1991年 | 131篇 |
1990年 | 107篇 |
1989年 | 111篇 |
1988年 | 97篇 |
1987年 | 54篇 |
1986年 | 44篇 |
1985年 | 53篇 |
1984年 | 64篇 |
1983年 | 46篇 |
1982年 | 31篇 |
1981年 | 25篇 |
1980年 | 23篇 |
1979年 | 17篇 |
1978年 | 8篇 |
1977年 | 13篇 |
1976年 | 12篇 |
1975年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 78 毫秒
71.
A. Kaveh H. A. Rahimi Bondarabady 《International journal for numerical methods in engineering》2004,60(11):1803-1815
This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
72.
多测井曲线的综合处理合成 总被引:9,自引:0,他引:9
测井曲线是地质分层的基础,但在利用单一测井曲线解决复杂地质问题时也存在多解性和局限性。为克服多解性,人们采用多种测井曲线进行地质分层,提高了分层的精度。本文在此基础上提出把多条曲线分别赋予不同的加权因子,然后进行归一化处理,形成一条标准综合参数测井曲线。此综合参数曲线突出了所选的多条测井曲线的公共信息,减少或削弱了单一测井曲线中的偶然误差,提高了综合后测井资料的可信度。该方法可应用于地质分层、岩性分析、含油气预测等诸多领域。应用时要注意,并非所选择的测井曲线种类越多越好,而是要选择那些最能反映地层单元特征信息的测井曲线。 相似文献
73.
L. M. CRUZ-ORIVE 《Journal of microscopy》2005,219(1):18-28
A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples. 相似文献
74.
通过建立三维有限元模型,对土钉支护的变形和受力性能进行分析,得出土钉力的合理分布。在此基础上,考虑土钉支护的水平位移,采用遗传算法,对土钉支护的结构优化设计进行研究,建立了土钉支护结构的优化设计数学模型,并编制了相应的计算程序。通过算例分析,并与基于极限平衡分析的优化结果相比较,得出合理的土钉支护结构设计的参考结论。 相似文献
75.
天然气管网输配气量优化研究 总被引:2,自引:0,他引:2
天然气管网系统管理部门为了明确天然气管网的输气能力和提高天然气管网的利用率,需要对天然气管网系统的输配气量进行优化。为此,以天然气管网系统的最大流量为目标函数,同时考虑了管道强度、节点压力和流量限制等约束条件,建立了天然气管网输配气量优化的数学模型。在研究遗传算法和模拟退火算法的基础上,提出了一种由二者结合构成的具有全域搜索、快速收敛和鲁棒性强等特点的混合遗传算法。结合实例,采用这一新算法求解了天然气管网输配气量优化的数学模型。实例优化结果表明,所建立的数学模型和采用的混合遗传算法是可行和有效的,能够对天然气管网系统输配气量的调度运行起到指导作用。 相似文献
76.
Non-pinched, minimum energy solutions are important class of distillation designs that offer the potential advantage of a better trade-off between capital investment and operating costs. In this paper, two important tasks associated with non-pinched distillation designs are studied. Thus the novel contributions of this work to the literature are
- (1) A comprehensive methodology for finding non-pinched minimum energy designs.
- (2) Understanding of the reasons for the existence of non-pinched distillation designs.
77.
Carlos Fernandes Agostinho C. Rosa 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(10):955-979
Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA)
usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between
individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during
the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies
indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the
population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule
based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population.
We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the
CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of
the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative
AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive
set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results
confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least
as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional
GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal
population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters
need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA. 相似文献
78.
Lie‐Fern Hsu 《Quality and Reliability Engineering International》2007,23(2):269-272
He and Grigoryan (Quality and Reliability Engineering International 2002; 18 :343–355) formulated the design of a double‐sampling (DS) s control chart as an optimization problem and solved it with a genetic algorithm. They concluded that the DS s control charts can be a more economically preferable alternative in detecting small shifts than traditional s control charts. We explain that, since they only considered the average sample size when the process is in control, their conclusion is questionable. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
79.
Gabriel Nivasch 《Information Processing Letters》2004,90(3):135-140
We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix. 相似文献
80.