全文获取类型
收费全文 | 6904篇 |
免费 | 1311篇 |
国内免费 | 1342篇 |
专业分类
电工技术 | 402篇 |
综合类 | 1119篇 |
化学工业 | 101篇 |
金属工艺 | 89篇 |
机械仪表 | 504篇 |
建筑科学 | 110篇 |
矿业工程 | 108篇 |
能源动力 | 64篇 |
轻工业 | 80篇 |
水利工程 | 71篇 |
石油天然气 | 59篇 |
武器工业 | 40篇 |
无线电 | 765篇 |
一般工业技术 | 362篇 |
冶金工业 | 35篇 |
原子能技术 | 12篇 |
自动化技术 | 5636篇 |
出版年
2024年 | 122篇 |
2023年 | 334篇 |
2022年 | 485篇 |
2021年 | 441篇 |
2020年 | 287篇 |
2019年 | 216篇 |
2018年 | 217篇 |
2017年 | 252篇 |
2016年 | 257篇 |
2015年 | 322篇 |
2014年 | 382篇 |
2013年 | 402篇 |
2012年 | 530篇 |
2011年 | 525篇 |
2010年 | 416篇 |
2009年 | 463篇 |
2008年 | 486篇 |
2007年 | 459篇 |
2006年 | 434篇 |
2005年 | 365篇 |
2004年 | 290篇 |
2003年 | 262篇 |
2002年 | 194篇 |
2001年 | 193篇 |
2000年 | 162篇 |
1999年 | 164篇 |
1998年 | 123篇 |
1997年 | 131篇 |
1996年 | 94篇 |
1995年 | 94篇 |
1994年 | 75篇 |
1993年 | 61篇 |
1992年 | 53篇 |
1991年 | 44篇 |
1990年 | 42篇 |
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篇 |
排序方式: 共有9557条查询结果,搜索用时 484 毫秒
11.
A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification. 相似文献
12.
13.
This study was motivated by some difficulties encountered by the authors when trying to express temporal knowledge using Sowa's conceptual graph (CG) approach. An overview of Sowa's approach is given and the difficulties encountered when trying to model temporal knowledge are outlined: the disparity of notations allowed by CG theory for expressing temporal information; the ambiguity and incompleteness of tense sspecification; the difficulty of harmonizing tenses and intergraph temporal relations. Various approaches suggested for representing time both in artificial intelligence and linguistics are presented, and an extension to Sowa's approach is proposed in which temporal and nontemporal knowledge are differentiated. In this model points in time are represented as well as time intervals. A semantic interpretation of verbs is provided based on an extension of Reichenbach's model of temporal markers. The authors show how their approach enables the representation of tenses as well as the aspectual properties of natural language sentences. 相似文献
14.
Waveband switching (WBS) is a promising technique to reduce the switching and transmission costs in the optical domain of a wavelength-division multiplexing (WDM) network. This paper considers the problem of provisioning dynamic traffic using WBS in a WDM mesh network. The network of interest is a homogeneous WBS network, where each node has the functionality of WBS. The problem is called the dynamic WBS problem, which involves searching waveband-routes or wavelength-routes for the dynamically arriving traffic requests. The objective is to minimize the total switching and transmission costs in the optical domain. To solve the dynamic WBS problem, an auxiliary graph model capturing the network state is proposed. Based on the auxiliary graph, two heuristic on-line WBS algorithms with different waveband grouping policies are proposed, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Simulation results indicate that WBS is an attractive technique which reduces the overall switching and transmission costs by up to 30% in the network. The results also show that the WFAUG algorithm outperforms the BFAUG algorithm in terms of port savings and cost savings. 相似文献
15.
本文基于静态相关性分析和动态调整相结合的方法,提出了一种逻辑程序的执行模型,它不仅开发了“与“并行,同进也开发了一定的“或“并行,从而有效地加速了逻辑程序的执行。 相似文献
16.
GIS中矢量图形的结构分析与VC++中的实现 总被引:2,自引:0,他引:2
简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。 相似文献
17.
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. 相似文献
18.
19.
20.
ß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. 相似文献