全文获取类型
收费全文 | 1233篇 |
免费 | 138篇 |
国内免费 | 136篇 |
专业分类
电工技术 | 13篇 |
综合类 | 54篇 |
化学工业 | 21篇 |
金属工艺 | 6篇 |
机械仪表 | 69篇 |
建筑科学 | 104篇 |
矿业工程 | 9篇 |
能源动力 | 26篇 |
轻工业 | 48篇 |
水利工程 | 4篇 |
石油天然气 | 8篇 |
武器工业 | 5篇 |
无线电 | 94篇 |
一般工业技术 | 37篇 |
冶金工业 | 4篇 |
原子能技术 | 5篇 |
自动化技术 | 1000篇 |
出版年
2024年 | 9篇 |
2023年 | 6篇 |
2022年 | 30篇 |
2021年 | 21篇 |
2020年 | 33篇 |
2019年 | 22篇 |
2018年 | 27篇 |
2017年 | 37篇 |
2016年 | 37篇 |
2015年 | 34篇 |
2014年 | 64篇 |
2013年 | 75篇 |
2012年 | 93篇 |
2011年 | 116篇 |
2010年 | 80篇 |
2009年 | 96篇 |
2008年 | 88篇 |
2007年 | 99篇 |
2006年 | 107篇 |
2005年 | 84篇 |
2004年 | 59篇 |
2003年 | 68篇 |
2002年 | 47篇 |
2001年 | 32篇 |
2000年 | 14篇 |
1999年 | 22篇 |
1998年 | 14篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 10篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 6篇 |
1991年 | 2篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 3篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 6篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1975年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有1507条查询结果,搜索用时 11 毫秒
1.
《中国计量学院学报》1996,(2)
本文简介当前集散控制中的几种常用通信方法,并就此进行分析,然后提出一种实用性强,结构较简单,通信可靠,功能完备,使用十分灵活方便的任意两机间可通信系统 相似文献
2.
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer, hybridization, homoplasy and genetic recombination. Several algorithms exist for constructing phylogenetic networks which result from events such as horizontal gene transfer, hybridization and homoplasy. Very little work has been published on the algorithmic detail of phylogenetic networks with constrained recombination. The problem of minimizing the number of recombinations in a phylogenetic network, constructed using binary DNA sequences, is NP-hard. In this paper, we propose a pattern recognition-based O(n2) time approach for constructing the phylogenetic network, where n is the number of nodes or sequences in the input data. The network is constructed with the restriction that no two cycles in the network share a common node. 相似文献
3.
Tree-shaped flow structures designed by minimizing path lengths 总被引:1,自引:0,他引:1
S. LorenteW. Wechsatol A. Bejan 《International Journal of Heat and Mass Transfer》2002,45(16):3299-3312
This paper outlines a direct route to the construction of effective tree-shaped flow structures. Dendritic flow structures dominate the design of natural and engineered flow systems, especially in thermal and fluid systems. The starting point is the optimization of the shape of each elemental area or volume, such that the length of the flow path housed by the element is minimized. Proceeding toward larger and more complex structures - from elements, to first constructs, second constructs, etc. - the paper develops tree-shaped flow structures between one point and a straight line, one point and a plane, a circle and its center, and a point and many points distributed uniformly over an area. In the latter, the construction method is applied to a fluid flow configuration with laminar fully developed flow. The constructions reveal several features that are supported by empirical observations of natural tree-shaped flows: asymmetry, flow rate imbalance, pairing or bifurcation, angles between branches, and Y-shaped constructs that lie in a plane. It is shown that these basic features are necessary because of “packing”, i.e., assembling optimized elements into a fixed space, and filling the space completely. For the flow between an area and one point, the best elemental shape is the regular hexagon. It is shown that the emergence of string-shaped links that connect two or more elements are necessary features, which are also required by packing. Strings cover some of the inner zones of the tree network, particularly the inner zones of large and complex trees. Dichotomous Y-shaped constructs dominate the tree structure, especially the peripheral zones of the tree canopy. The practical importance of the simplified design method is discussed. 相似文献
4.
Silvano Dal Zilio Denis Lugiez 《Applicable Algebra in Engineering, Communication and Computing》2006,17(5):337-377
XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we define a new class of automata for unranked trees that provides decision procedures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, including recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.This work was partially supported by the French government research grant ACI TRALALA and by IST Global Computing Profundis. 相似文献
5.
Using airborne laser scanning to monitor tree migration in the boreal-alpine transition zone 总被引:1,自引:0,他引:1
The boreal tree line is expected to advance upwards into the mountains and northwards into the tundra due to global warming. The major objective of this study was to find out if it is possible to use high-resolution airborne laser scanner data to detect very small trees — the pioneers that are pushing the tree line up into the mountains and out onto the tundra. The study was conducted in a sub-alpine/alpine environment in southeast Norway. A total of 342 small trees of Norway spruce, Scots pine, and downy birch with tree heights ranging from 0.11 to 5.20 m were precisely georeferenced and measured in field. Laser data were collected with a pulse density of 7.7 m− 2. Three different terrain models were used to process the airborne laser point cloud in order to assess the effects of different pre-processing parameters on small tree detection. Greater than 91% of all trees > 1 m tall registered positive laser height values regardless of terrain model. For smaller trees (< 1 m), positive height values were found in 5-73% of the cases, depending on the terrain model considered. For this group of trees, the highest rate of trees with positive height values was found for spruce. The more smoothed the terrain model was, the larger the portion of the trees that had positive laser height values. The accuracy of tree height derived from the laser data indicated a systematic underestimation of true tree height by 0.40 to 1.01 m. The standard deviation for the differences between laser-derived and field-measured tree heights was 0.11-0.73 m. Commission errors, i.e., the detection of terrain objects — rocks, hummocks — as trees, increased significantly as terrain smoothing increased. Thus, if no classification of objects into classes like small trees and terrain objects is possible, many non-tree objects with a positive height value cannot be separated from those actually being trees. In a monitoring context, i.e., repeated measurements over time, we argue that most other objects like terrain structures, rocks, and hummocks will remain stable over time while the trees will change as they grow and new trees are established. Thus, this study indicates that, given a high laser pulse density and a certain density of newly established trees, it would be possible to detect a sufficient portion of newly established trees over a 10 years period to claim that tree migration is taking place. 相似文献
6.
Given a planar setS ofn points,maxdominance problems consist of computing, for everyp S, some function of the maxima of the subset ofS that is dominated byp. A number of geometric and graph-theoretic problems can be formulated as maxdominance problems, including the problem of computing a minimum independent dominating set in a permutation graph, the related problem of finding the shortest maximal increasing subsequence, the problem of enumerating restricted empty rectangles, and the related problem of computing the largest empty rectangle. We give an algorithm for optimally solving a class of maxdominance problems. A straightforward application of our algorithm yields improved time bounds for the above-mentioned problems. The techniques used in the algorithm are of independent interest, and include a linear-time tree computation that is likely to arise in other contexts.The research of this author was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.This author's research was supported by the National Science Foundation under Grant DCR-8506361. 相似文献
7.
研究ZigBee网络孤岛节点的搜索和处理,快速减免孤岛节点提高网络资源利用率。针对节点间因配置或接口协议不统一而造成孤岛节点的出现,传统的基于广度搜索的处理方法需要逐一遍历所有节点从而搜索出孤岛节点,造成搜索效率不高、网络资源利用率较低的问题。为解决上述问题,提出了基于节点帧的孤岛节点处理方法。利用ZigBee网络树型结构的特点,只有父节点中可能存在孤岛节点,因此通过判断网络节点是否为父节点并将结果保存在节点帧中,根据节点帧找到网络中有限的父节点并从中监测出孤岛节点,避免了遍历所有网络节点而造成的搜索效率不高的问题。仿真结果表明,节点帧方法能够快速搜索出ZigBee网络中的孤岛节点并作减免处理,有效提高了网络资源的利用率。 相似文献
8.
袁静珍 《电脑与微电子技术》2014,(15):44-47
利用VC++开发平台,以《数据结构》课程的重要章节二叉树遍历算法为例,论述二叉树遍历算法演示软件的设计和关键技术并实现整个系统。系统使得学生加深算法的理解,取得良好的教学效果。 相似文献
9.
10.
云计算环境下数据量十分庞大,传统的基于MHT的数据完整性检验方案在快速和低开销2个优点上不能较好地兼备。提出的MHB-Tree方案增加了树中节点包含的信息量,缩小了检验大量数据时所需要构建的树的规模,结合平衡二叉树特性保证树的结构不变,有利于数据节点的增加和删除。结果证明方案可以在保证安全性能的情况下提高完整性检验的效率,并节省了较大的时间和空间开销。 相似文献