全文获取类型
收费全文 | 37344篇 |
免费 | 4015篇 |
国内免费 | 2161篇 |
专业分类
电工技术 | 2410篇 |
技术理论 | 3篇 |
综合类 | 3176篇 |
化学工业 | 6071篇 |
金属工艺 | 2148篇 |
机械仪表 | 2394篇 |
建筑科学 | 2771篇 |
矿业工程 | 1343篇 |
能源动力 | 1130篇 |
轻工业 | 3045篇 |
水利工程 | 743篇 |
石油天然气 | 1626篇 |
武器工业 | 296篇 |
无线电 | 4273篇 |
一般工业技术 | 4513篇 |
冶金工业 | 1802篇 |
原子能技术 | 466篇 |
自动化技术 | 5310篇 |
出版年
2024年 | 165篇 |
2023年 | 610篇 |
2022年 | 1061篇 |
2021年 | 1499篇 |
2020年 | 1170篇 |
2019年 | 1052篇 |
2018年 | 1125篇 |
2017年 | 1237篇 |
2016年 | 1160篇 |
2015年 | 1565篇 |
2014年 | 1921篇 |
2013年 | 2382篇 |
2012年 | 2481篇 |
2011年 | 2497篇 |
2010年 | 2355篇 |
2009年 | 2151篇 |
2008年 | 2110篇 |
2007年 | 1951篇 |
2006年 | 1935篇 |
2005年 | 1676篇 |
2004年 | 1282篇 |
2003年 | 1512篇 |
2002年 | 2003篇 |
2001年 | 1750篇 |
2000年 | 1090篇 |
1999年 | 859篇 |
1998年 | 560篇 |
1997年 | 456篇 |
1996年 | 374篇 |
1995年 | 344篇 |
1994年 | 271篇 |
1993年 | 176篇 |
1992年 | 165篇 |
1991年 | 143篇 |
1990年 | 91篇 |
1989年 | 77篇 |
1988年 | 62篇 |
1987年 | 35篇 |
1986年 | 29篇 |
1985年 | 22篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 15篇 |
1981年 | 9篇 |
1980年 | 23篇 |
1979年 | 9篇 |
1978年 | 5篇 |
1977年 | 6篇 |
1959年 | 6篇 |
1951年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
911.
With the increasing availability of real-time traffic information, dynamic spatial networks are pervasive nowadays and path planning in dynamic spatial networks becomes an important issue. In this light, we propose and investigate a novel problem of dynamically monitoring shortest paths in spatial networks (DSPM query). When a traveler aims to a destination, his/her shortest path to the destination may change due to two reasons: 1) the travel costs of some edges have been updated and 2) the traveler deviates from the pre-planned path. Our target is to accelerate the shortest path computing in dynamic spatial networks, and we believe that this study may be useful in many mobile applications, such as route planning and recommendation, car navigation and tracking, and location-based services in general. This problem is challenging due to two reasons: 1) how to maintain and reuse the existing computation results to accelerate the following computations, and 2) how to prune the search space effectively. To overcome these challenges, filter-and-refinement paradigm is adopted. We maintain an expansion tree and define a pair of upper and lower bounds to prune the search space. A series of optimization techniques are developed to accelerate the shortest path computing. The performance of the developed methods is studied in extensive experiments based on real spatial data. 相似文献
912.
913.
BASE: an assistant tool to precisely simulate energy consumption and reliability of energy‐efficient storage systems
下载免费PDF全文
![点击此处可从《Software》网站下载免费的PDF全文](/ch/ext_images/free.gif)
The concept of green storage in cluster computing has recently attracted enormous interest among researchers. Consequently, several energy‐efficient solutions, such as multi‐speed disks and disk spin down methods, have been proposed to conserve power in storage systems and improve disk access. Some researchers have assessed their proposed solutions via simulations, while others have used real‐world experiments. Both methods have advantages and disadvantages. Simulations can more swiftly assess the benefits of energy‐efficient solutions, but various measurement errors can arise from procedural shortcomings. For instance, many power simulation tools fail to consider how heat increases the power overhead of disk operations. Some researchers claim that their modeling methods reduce the measurement error to 5% in the single disk model. However, the demand for large‐scale storage systems is growing rapidly. Traditional power measurement using a single disk model is unsuited to such systems because of their complex storage architecture and the unpredictability of numerous disks. Consequently, a number of studies have conducted real machine experiments to assess the performance of their solutions in terms of power conservation, but such experiments are time consuming. To address this problem, this study proposes an efficient simulation tool called Benchmark Analysis Software for Energy‐efficient Solution (BASE), which can accurately estimate disks' power consumption in large‐scale storage systems. We evaluate the performance of BASE on real‐world traces of Academia Sinica (Taiwan) and Florida International University. BASE incorporates an analytical method for assessing the reliability of energy‐efficient solutions. The analytical results demonstrate that the measurement error of BASE is 2.5% lower than that achieved in real‐world experiments involving energy‐estimation experiments. Moreover, the results of simulations to assess solution reliability are identical to those obtained through real‐world experiments. Copyright © 2015 Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
914.
915.
916.
917.
918.
Since most images were built with regular textures and structures, the exemplar-based inpainting technique has become a brand-new solution for renovating degraded images by searching a match patch. This characteristic has also been named as the local self-similarity. Nevertheless, traditional exemplar-based methods try to find the best match patch in the whole image with only one direction; thus, often leading to a non-ideal repairing result. In this article, we propose a novel patch matching technique to rebuild the structure and texture of image, in which the surrounding information of the patch is fully concerned. Aside from determining a more precise filling priority by the sparsity of the image structure, we have applied the difference of fractal dimension to enhance the similarity between the source patch and the target patch. Experimental results have demonstrated the superiority of the proposed technique over related works in the renovating accuracy. 相似文献
919.
Efficiently answering reachability queries, which checks whether one vertex can reach another in a directed graph, has been studied extensively during recent years. However, the size of the graph that people are facing and generating nowadays is growing so rapidly that simple algorithms, such as BFS and DFS, are no longer feasible. Although Refined Online Search algorithms can scale to large graphs, they all suffer from the false positive problem. In this paper, we analyze the cause of false positive and propose an efficient High Dimensional coordinate generating method based on Graph Dominance Drawing (HD-GDD) to answer reachability queries in linear or even constant time. We conduct experiments on different graph structures and different graph sizes to fully evaluate the performance and behavior of our proposal. Empirical results demonstrate that our method outperforms state-of-the-art algorithms and can handle extensive graphs. 相似文献
920.
This technical note focuses on the link flow uniqueness of user equilibrium (UE) with speed limits. Under a mild assumption on the monotonicity of link travel time function, the UE link flow solutions are well recognized to be unique. However, the incorporation of speed limits in the network has undermined the strict monotonicity of link travel time functions, thus the UE flows on the links with speed limits may not be unique. This note addresses the uniqueness problem with two major contributions. First, a polyhedron defined on links is provided, and it is proven that the UE link flow is unique if and only if the polyhedron only contains one value. Second, two concise methods are proposed to mathematically check whether the polyhedron is a singleton, which can be easily solved and convenient for practical use. 相似文献