全文获取类型
收费全文 | 9814篇 |
免费 | 675篇 |
国内免费 | 515篇 |
专业分类
电工技术 | 447篇 |
综合类 | 795篇 |
化学工业 | 153篇 |
金属工艺 | 106篇 |
机械仪表 | 512篇 |
建筑科学 | 179篇 |
矿业工程 | 60篇 |
能源动力 | 159篇 |
轻工业 | 50篇 |
水利工程 | 68篇 |
石油天然气 | 41篇 |
武器工业 | 48篇 |
无线电 | 854篇 |
一般工业技术 | 749篇 |
冶金工业 | 97篇 |
原子能技术 | 26篇 |
自动化技术 | 6660篇 |
出版年
2024年 | 39篇 |
2023年 | 61篇 |
2022年 | 97篇 |
2021年 | 95篇 |
2020年 | 161篇 |
2019年 | 143篇 |
2018年 | 120篇 |
2017年 | 220篇 |
2016年 | 236篇 |
2015年 | 315篇 |
2014年 | 440篇 |
2013年 | 654篇 |
2012年 | 559篇 |
2011年 | 662篇 |
2010年 | 437篇 |
2009年 | 671篇 |
2008年 | 717篇 |
2007年 | 747篇 |
2006年 | 675篇 |
2005年 | 542篇 |
2004年 | 503篇 |
2003年 | 464篇 |
2002年 | 392篇 |
2001年 | 308篇 |
2000年 | 269篇 |
1999年 | 203篇 |
1998年 | 204篇 |
1997年 | 190篇 |
1996年 | 125篇 |
1995年 | 99篇 |
1994年 | 96篇 |
1993年 | 70篇 |
1992年 | 71篇 |
1991年 | 42篇 |
1990年 | 34篇 |
1989年 | 39篇 |
1988年 | 45篇 |
1987年 | 25篇 |
1986年 | 22篇 |
1985年 | 32篇 |
1984年 | 47篇 |
1983年 | 27篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
61.
62.
无向网络K终端可靠度的分解算法中,包括多边形→链简化在内的等可靠度简化和分解定理结合,可以降低算法的复杂度。本文完善了边随机无向网络和混合随机无向网络的4#,6#,7#型多边形→链简化定理。计算机编程验证了其正确性。 相似文献
63.
This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs
are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems
on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical
information. A new type of representation for chromosome structure is presented here along with a new method for mutation.
The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion
type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the
clusters obtained is examined. 相似文献
64.
The focus of this paper is database design using automated database design tools or more general CASE tools. We present a genetic algorithm for the optimization of (internal) database structures, using a multi-criterion objective function. This function expresses conflicting objectives, reflecting the well-known time/space trade-off. This paper shows how the solution space of the algorithm can be set up in the form of tree structures (forests), and how these are encoded by a simple integer assignation. Genetic operators (database transformations) defined in terms of this encoding behave as if they manipulate tree structures. Some basic experimental results produced by a research prototype are presented. 相似文献
65.
In this paper we analyze the algebraic formulations of certain geometry statements appearing in recent literature related to mechanical geometry theorem proving and give several examples to show that one of these formulations can cause serious problems. We clarify a formulation which is essentially due to W. T. Wu and, in our opinion, is the most satisfactory.This author was supported by NSF Grants DCR-8503498 and CCR-8702108. 相似文献
66.
A genetic algorithm for the optimisation of assembly sequences 总被引:6,自引:0,他引:6
This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product. 相似文献
67.
An earlier neural network analysis of processing of steel plates through hot rolling was subjected to a further refined analysis through some flexible neural networks that evolved using a multi‐objective predator‐prey genetic algorithm. The original data set expressing the Yield Strength and Ultimate Tensile Strength of the rolled slabs in terms of a total of 108 process variables were subjected to a systematic pruning through this evolutionary approach, till the nitrogen content of the steel emerged as the most significant input variable. A theoretical explanation is provided for this slightly unexpected result. 相似文献
68.
We consider an integer-subset representation problem motivated by a medical application in radiation therapy. We prove NP-completeness, derive nontrivial bounds, and report on the performance of a greedy heuristic. 相似文献
69.
In this paper, a technique is proposed for the rendering of transparent objects interactively using the method of refractive rendering. In the proposed technique, the refractive rendering algorithm is performed in two stages, namely the pre‐computation stage and the shading stage. In the pre‐computation stage, ray‐traced information, including directions and positions of rays, are generated by a ray tracing process and are stored in a set of ray lists. In the shading stage, these data are retrieved from the ray lists for computing the shading of an object. Using the proposed technique, photorealistic image of transparent objects and gemstones with various cuttings, material properties, lighting and background can be rendered interactively. By combining the refractive rendering technique with conventional shading techniques, jewelry and crystal designs can be rendered at a much higher speed comparing with conventional ray tracing techniques. 相似文献
70.
Alon Itai 《Information Processing Letters》2007,104(6):200-204
The Sparse Table is a data structure for controlling density in an array which was first proposed in 1981 and has recently reappeared as a component of cache-oblivious data structures. All existing variants of the Sparse Table divide the array into blocks that have a calibrator tree above them. We show that the same amortized complexity can be achieved without this auxiliary structure, obtaining a canonical data structure that can be updated by conceptually simpler algorithms. 相似文献