全文获取类型
收费全文 | 6960篇 |
免费 | 1313篇 |
国内免费 | 1336篇 |
专业分类
电工技术 | 402篇 |
综合类 | 1119篇 |
化学工业 | 100篇 |
金属工艺 | 89篇 |
机械仪表 | 507篇 |
建筑科学 | 110篇 |
矿业工程 | 108篇 |
能源动力 | 65篇 |
轻工业 | 80篇 |
水利工程 | 71篇 |
石油天然气 | 59篇 |
武器工业 | 40篇 |
无线电 | 768篇 |
一般工业技术 | 361篇 |
冶金工业 | 35篇 |
原子能技术 | 12篇 |
自动化技术 | 5683篇 |
出版年
2024年 | 112篇 |
2023年 | 334篇 |
2022年 | 484篇 |
2021年 | 442篇 |
2020年 | 289篇 |
2019年 | 217篇 |
2018年 | 220篇 |
2017年 | 253篇 |
2016年 | 263篇 |
2015年 | 325篇 |
2014年 | 387篇 |
2013年 | 405篇 |
2012年 | 532篇 |
2011年 | 531篇 |
2010年 | 419篇 |
2009年 | 465篇 |
2008年 | 492篇 |
2007年 | 461篇 |
2006年 | 438篇 |
2005年 | 367篇 |
2004年 | 293篇 |
2003年 | 263篇 |
2002年 | 198篇 |
2001年 | 193篇 |
2000年 | 163篇 |
1999年 | 164篇 |
1998年 | 123篇 |
1997年 | 131篇 |
1996年 | 94篇 |
1995年 | 94篇 |
1994年 | 75篇 |
1993年 | 61篇 |
1992年 | 53篇 |
1991年 | 45篇 |
1990年 | 43篇 |
1989年 | 33篇 |
1988年 | 35篇 |
1987年 | 9篇 |
1986年 | 11篇 |
1985年 | 11篇 |
1984年 | 16篇 |
1983年 | 7篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有9609条查询结果,搜索用时 31 毫秒
21.
GIS中矢量图形的结构分析与VC++中的实现 总被引:2,自引:0,他引:2
简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。 相似文献
22.
A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes. 相似文献
23.
24.
25.
26.
ßBarrels are widespread and well-studied featuresof a great many protein structures. In this paper an unsuper-visedmethod for the detection of P-barrels is developed based ontechniques from graph theory. The hydrogen bonded connectivityof ß-sheets is derived using standard pattern recognitiontechniques and expressed as a graph. Barrels correspond to topologicalrings in these connectivity graphs and can thus be identifiedusing ring perception algorithms. Following from this, the characteristictopological structure of a barrel can be expressed using a novelform of reduced nomenclature that counts sequence separationsbetween successive members of the ring set These techniquesare tested by applying them to the detection of barrels in anon-redundant subset of the Brookhaven database. Results indicatethat topological rings do seem to correspond uniquely to ß-barrelsand that the technique, as implemented, finds the majority ofbarrels present in the dataset. 相似文献
27.
反编译程序图设计与控制流分析 总被引:1,自引:0,他引:1
反编译是一种能将低级语言翻译到高级语言的工具。本文着重介绍反编译代码存储的程序图方法,以及在程序图基础上,对代码程序进行控制流分析、控制结构提取,给出了结构提取的算法;控制流分析过程中的程序图变换。 相似文献
28.
29.
Energy minimization and design for testability 总被引:6,自引:0,他引:6
Srimat T. Chakradhar Vishwani D. Agrawal Michael L. Bushnell 《Journal of Electronic Testing》1994,5(1):57-66
The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables. 相似文献
30.
Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates
integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via
normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where
the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences
with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any
type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning
problem to fit integer programming takes a polynomial time.
H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute
of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C. 相似文献