全文获取类型
收费全文 | 8574篇 |
免费 | 1526篇 |
国内免费 | 1585篇 |
专业分类
电工技术 | 522篇 |
综合类 | 1243篇 |
化学工业 | 211篇 |
金属工艺 | 114篇 |
机械仪表 | 590篇 |
建筑科学 | 186篇 |
矿业工程 | 142篇 |
能源动力 | 110篇 |
轻工业 | 113篇 |
水利工程 | 96篇 |
石油天然气 | 138篇 |
武器工业 | 52篇 |
无线电 | 904篇 |
一般工业技术 | 495篇 |
冶金工业 | 125篇 |
原子能技术 | 28篇 |
自动化技术 | 6616篇 |
出版年
2024年 | 165篇 |
2023年 | 402篇 |
2022年 | 572篇 |
2021年 | 538篇 |
2020年 | 370篇 |
2019年 | 283篇 |
2018年 | 288篇 |
2017年 | 339篇 |
2016年 | 325篇 |
2015年 | 418篇 |
2014年 | 467篇 |
2013年 | 530篇 |
2012年 | 636篇 |
2011年 | 661篇 |
2010年 | 503篇 |
2009年 | 560篇 |
2008年 | 584篇 |
2007年 | 563篇 |
2006年 | 535篇 |
2005年 | 431篇 |
2004年 | 363篇 |
2003年 | 307篇 |
2002年 | 228篇 |
2001年 | 228篇 |
2000年 | 177篇 |
1999年 | 174篇 |
1998年 | 140篇 |
1997年 | 149篇 |
1996年 | 106篇 |
1995年 | 104篇 |
1994年 | 93篇 |
1993年 | 74篇 |
1992年 | 64篇 |
1991年 | 48篇 |
1990年 | 48篇 |
1989年 | 37篇 |
1988年 | 38篇 |
1987年 | 11篇 |
1986年 | 13篇 |
1985年 | 15篇 |
1984年 | 21篇 |
1983年 | 11篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
The aim of this study is to optimize the position and the number of propellers in a non-standard tall vessel. Laser sheet flow visualization experiments were carried out for selected geometrical arrangements which produced stable flow patterns and good transport between the propellers. Four double-propeller arrangements corresponding to frequent industrial cases and a three-propeller system have been chosen. Comparison of LDA measurements in the r-z plane, dimensionless global parameters NQp, Ntm, Np, Ep and spatial distribution of local energy dissipation rate ? shows that a three-propeller system is the most efficient. 相似文献
32.
由于存储空间异常引起的系统故障,系统开发或维护人员很难从失效特征直接判断到根原因。另外,存储空间异常通常会引起整个系统崩溃,对于安全关键系统,如航空电子系统,系统的失效往往会引起坠机或人员伤亡,因此,对安全关键系统的空间分析显得尤为重要。由于系统栈空间的分析涉及系统动态运行状态,在程序的任意点都有可能被中断服务程序或实时操作系统的其它任务中断。此外系统的栈分析需要基于目标码等特性,再次增加了对于系统栈空间分析的难度。本文从栈空间分析的必要性出发,提出一种综合中断抢占图的栈分析理论和方法,并就安全关键系统如何保证栈空间使用的确定性进行论述。最后,就安全关键软件系统FCOS的栈空间分析过程进行详细的阐述。 相似文献
33.
34.
35.
Handling occlusion is a very challenging problem in object detection. This paper presents a method of learning a hierarchical model for X-to-X occlusion-free object detection (e.g., car-to-car and person-to-person occlusions in our experiments). The proposed method is motivated by an intuitive coupling-and-decoupling strategy. In the learning stage, the pair of occluding X?s (e.g., car pairs or person pairs) is represented directly and jointly by a hierarchical And–Or directed acyclic graph (AOG) which accounts for the statistically significant co-occurrence (i.e., coupling). The structure and the parameters of the AOG are learned using the latent structural SVM (LSSVM) framework. In detection, a dynamic programming (DP) algorithm is utilized to find the best parse trees for all sliding windows with detection scores being greater than the learned threshold. Then, the two single X?s are decoupled from the declared detections of X-to-X occluding pairs together with some non-maximum suppression (NMS) post-processing. In experiments, our method is tested on both a roadside-car dataset collected by ourselves (which will be released with this paper) and two public person datasets, the MPII-2Person dataset and the TUD-Crossing dataset. Our method is compared with state-of-the-art deformable part-based methods, and obtains comparable or better detection performance. 相似文献
36.
A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning the corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating the nodes of interest over the target object to form a bunch graph. Three annotation techniques, manual, semi-automatic, and automatic annotation are used to determine the position of the nodes. The scheme and the annotation approaches are applied to explore the hand gesture recognition performance. A number of filter banks are applied to hand gestures images to investigate the effect of using different feature representation approaches. Experimental results show that the hierarchical elastic graph matching (HEGM) approach classified the hand posture with a gesture recognition accuracy of 99.85% when visual features were extracted by utilizing the Histogram of Oriented Gradient (HOG) representation. The results also provide the performance measures from the aspect of recognition accuracy to matching benefits, node positions correlation and consistency on three annotation approaches, showing that the semi-automatic annotation method is more efficient and accurate than the other two methods. 相似文献
37.
S. Chaturvedi C. Dunne Z. Ashktorab R. Zachariah B. Shneiderman 《Computer Graphics Forum》2014,33(8):52-68
An important part of network analysis is understanding community structures like topological clusters and attribute‐based groups. Standard approaches for showing communities using colour, shape, rectangular bounding boxes, convex hulls or force‐directed layout algorithms remain valuable, however our Group‐in‐a‐Box meta‐layouts add a fresh strategy for presenting community membership, internal structure and inter‐cluster relationships. This paper extends the basic Group‐in‐a‐Box meta‐layout, which uses a Treemap substrate of rectangular regions whose size is proportional to community size. When there are numerous inter‐community relationships, the proposed extensions help users view them more clearly: (1) the Croissant–Doughnut meta‐layout applies empirically determined rules for box arrangement to improve space utilization while still showing inter‐community relationships, and (2) the Force‐Directed layout arranges community boxes based on their aggregate ties at the cost of additional space. Our free and open source reference implementation in NodeXL includes heuristics to choose what we have found to be the preferable Group‐in‐a‐Box meta‐layout to show networks with varying numbers or sizes of communities. Case study examples, a pilot comparative user preference study (nine participants), and a readability measure‐based evaluation of 309 Twitter networks demonstrate the utility of the proposed meta‐layouts. 相似文献
38.
Seed URLs selection for focused Web crawler intends to guide related and valuable information that meets a user's personal information requirement and provide more effective information retrieval. In this paper, we propose a seed URLs selection approach based on user-interest ontology. In order to enrich semantic query, we first intend to apply Formal Concept Analysis to construct user-interest concept lattice with user log profile. By using concept lattice merger, we construct the user-interest ontology which can describe the implicit concepts and relationships between them more appropriately for semantic representation and query match. On the other hand, we make full use of the user-interest ontology for extracting the user interest topic area and expanding user queries to receive the most related pages as seed URLs, which is an entrance of the focused crawler. In particular, we focus on how to refine the user topic area using the bipartite directed graph. The experiment proves that the user-interest ontology can be achieved effectively by merging concept lattices and that our proposed approach can select high quality seed URLs collection and improve the average precision of focused Web crawler. 相似文献
39.
当前基于迭代最近点拼接的同时定位与建图算法,存在误差积累、无法满足大范围定位精度的缺陷。为此,提出一种融合多帧迭代最近点和图优化的算法。在时域上处理点云拼接问题,将单帧迭代最近点算法推广到多帧进行最近点迭代,提取同一地点在不同时刻的数据特征,形成多个封闭循环,再运用基于最小二乘的图优化方法对点云拼接后的全网数据进行全局优化,消除累计误差,提升整体的定位精度。采用鲁巷和密歇根的数据进行测试,结果表明,该方法在一定程度上减少了匹配误差,平均误差为1.0m,最小误差为0.2m,可以满足大范围同步定位与建图的精度需求。 相似文献
40.
图被广泛用来建模在社交网络、语义网、计算生物学和软件分析中的应用.可达性查询是图数据上的一种基础查询.当前,针对图上的可达性查询已经提出了一些索引算法,但是它们不能灵活地扩展到大的图数据.因此,提出了一种索引方法RIAIL(reachability index augmented by interval labeling).RIAIL将结点的标记信息表示成四元组.前两个元素是区间标记,编码生成树的可达性信息,后两个元素编码非树边的可达性信息.RIAIL查询时只需索引且索引创建代价小.最后,通过大量真实和人工生成数据集上的实验说明,RIAIL能够高效地处理可达性查询,并且可以简单地扩展到大的图数据. 相似文献