全文获取类型
收费全文 | 8259篇 |
免费 | 1551篇 |
国内免费 | 1584篇 |
专业分类
电工技术 | 463篇 |
综合类 | 1239篇 |
化学工业 | 154篇 |
金属工艺 | 104篇 |
机械仪表 | 611篇 |
建筑科学 | 149篇 |
矿业工程 | 125篇 |
能源动力 | 74篇 |
轻工业 | 153篇 |
水利工程 | 90篇 |
石油天然气 | 63篇 |
武器工业 | 41篇 |
无线电 | 1036篇 |
一般工业技术 | 424篇 |
冶金工业 | 54篇 |
原子能技术 | 16篇 |
自动化技术 | 6598篇 |
出版年
2024年 | 147篇 |
2023年 | 388篇 |
2022年 | 580篇 |
2021年 | 554篇 |
2020年 | 416篇 |
2019年 | 323篇 |
2018年 | 302篇 |
2017年 | 329篇 |
2016年 | 348篇 |
2015年 | 390篇 |
2014年 | 468篇 |
2013年 | 498篇 |
2012年 | 627篇 |
2011年 | 621篇 |
2010年 | 510篇 |
2009年 | 540篇 |
2008年 | 555篇 |
2007年 | 520篇 |
2006年 | 485篇 |
2005年 | 402篇 |
2004年 | 331篇 |
2003年 | 288篇 |
2002年 | 220篇 |
2001年 | 211篇 |
2000年 | 173篇 |
1999年 | 176篇 |
1998年 | 135篇 |
1997年 | 138篇 |
1996年 | 106篇 |
1995年 | 99篇 |
1994年 | 78篇 |
1993年 | 64篇 |
1992年 | 57篇 |
1991年 | 54篇 |
1990年 | 43篇 |
1989年 | 39篇 |
1988年 | 38篇 |
1987年 | 14篇 |
1986年 | 22篇 |
1985年 | 16篇 |
1984年 | 18篇 |
1983年 | 12篇 |
1982年 | 11篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
11.
In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time. 相似文献
12.
采用封闭网络模型,按照电路元件参数,采用开路、短路和着色运算,将电路图逐层分解,得到网络展开图.给出网络展开图的概念和运算规则,指出网络展开图中从根到末稍每个路径的值就是网络行列式展开式中的一个有效项,从而由网络展开图得到符号网络函数.该方法直接对电路图进行运算,不需要建立任何形式的电路方程和行列式,适用于一般的有源电路,而且能生成各种类型的网络函数. 相似文献
13.
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. 相似文献
14.
Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented
in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear
action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations
in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for
a uniform behavioural theory for process calculi.
Received October 2000 / Accepted in revised form April 2001 相似文献
15.
16.
17.
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. 相似文献
18.
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. 相似文献
19.
本文基于静态相关性分析和动态调整相结合的方法,提出了一种逻辑程序的执行模型,它不仅开发了“与“并行,同进也开发了一定的“或“并行,从而有效地加速了逻辑程序的执行。 相似文献
20.
GIS中矢量图形的结构分析与VC++中的实现 总被引:2,自引:0,他引:2
简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。 相似文献