全文获取类型
收费全文 | 1129篇 |
免费 | 58篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 18篇 |
综合类 | 1篇 |
化学工业 | 285篇 |
金属工艺 | 31篇 |
机械仪表 | 45篇 |
建筑科学 | 30篇 |
矿业工程 | 4篇 |
能源动力 | 40篇 |
轻工业 | 22篇 |
水利工程 | 6篇 |
石油天然气 | 3篇 |
无线电 | 83篇 |
一般工业技术 | 312篇 |
冶金工业 | 54篇 |
原子能技术 | 21篇 |
自动化技术 | 234篇 |
出版年
2023年 | 16篇 |
2022年 | 50篇 |
2021年 | 52篇 |
2020年 | 29篇 |
2019年 | 31篇 |
2018年 | 26篇 |
2017年 | 37篇 |
2016年 | 39篇 |
2015年 | 37篇 |
2014年 | 46篇 |
2013年 | 70篇 |
2012年 | 67篇 |
2011年 | 88篇 |
2010年 | 45篇 |
2009年 | 60篇 |
2008年 | 66篇 |
2007年 | 62篇 |
2006年 | 49篇 |
2005年 | 44篇 |
2004年 | 43篇 |
2003年 | 37篇 |
2002年 | 28篇 |
2001年 | 17篇 |
2000年 | 11篇 |
1999年 | 16篇 |
1998年 | 23篇 |
1997年 | 11篇 |
1996年 | 12篇 |
1995年 | 13篇 |
1994年 | 11篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 6篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1983年 | 1篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1975年 | 3篇 |
1974年 | 1篇 |
1973年 | 2篇 |
1971年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1189条查询结果,搜索用时 15 毫秒
81.
The first generation of DHT designs offered a completely flat structure of the key space that is randomly partitioned among participating DHT nodes. That has certain advantages, for example, even distribution of workload among nodes. On the other hand, grouping keys under a single authority or achieving latency guarantees for queries is difficult. To address these shortcomings, various kinds of hierarchy have been proposed over recent years. The last generation is hierarchical DHTs (HDHTs) where nodes are organized onto layers; each next layer consists of supernodes for the previous layer. In this survey paper, we thoroughly go over the evolution of DHTs from pure flat to pre-hierarchical. Our focus is on hierarchical schemes in DHT routing. We argue that their application is not restricted within HDHT designs. We sequentially built a set of design principles; each provides a base for hierarchical routing schemes. In the extreme case, application these principles leads to HDHT designs. 相似文献
82.
Andrei Grebennikov 《国际射频与微波计算机辅助工程杂志》2011,21(4):446-456
In this article, a novel load‐network solution to implement the transmission‐line inverse Class F power amplifiers for base station WCDMA applications is presented. The theoretical analysis is based on an analytical derivation of the optimum load‐network parameters to control the second and third harmonics at the device output, including the device output parasitic shunt capacitance and series inductance. The transmission‐line inverse Class F LDMOSFET and GaN HEMT power amplifiers using NXP BLF6G22LS‐75 and CREE CGH27060F devices, respectively, were designed and measured. The high‐performance results with the drain efficiency of 70.2% and power gain of 18.0 dB for a 60‐W LDMOSFET power amplifier and with the drain efficiency of 82.3% and power gain of 14.3 dB for a 50‐W GaN HEMT power amplifier were achieved at an operating frequency of 2.14 GHz. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011. 相似文献
83.
In this paper, we present new pointcuts and primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. The two proposed pointcuts allow to identify particular join points in a program's control-flow graph (CFG). The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. The two proposed primitives are called ExportParameter and ImportParameter and are used to pass parameters between two pointcuts. They allow to analyze a program's call graph in order to determine how to change function signatures for passing the parameters associated with a given security hardening. We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies. 相似文献
84.
This paper presents a comparison of methods for industrial on-line sensor calibration monitoring for redundant sensors. Principal component analysis (PCA) and independent component analysis (ICA) techniques are developed and compared using both simulated data and data sets from an operating nuclear power plant. The performance is dependent on the types of noise sources; however, under most conditions ICA outperforms PCA, based on the bias and variance of their respective parameter estimates. A case study is included to demonstrate the usefulness of both techniques for the early detection of sensor drift. 相似文献
85.
Creating and Rendering Convolution Surfaces 总被引:6,自引:0,他引:6
Implicit surfaces obtained by convolution of multi-dimensional primitives with some potential function, are a generalisation of popular implicit surface models: blobs, metaballs and soft objects. These models differ in their choice of potential function but agree upon the use of underlying modelling primitives, namely, points. In this paper a method is described for modelling and rendering implicit surfaces built upon an expanded set of skeletal primitives: points, line segments, polygons, arcs and planes. An analytical solution to the convolution is described. This solution offers a more accurate and robust representation of the resultant implicit surface than previous methods. An algorithm for ray-tracing the surfaces formed through convolution of any combination of these primitives is also outlined. 相似文献
86.
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead
of the full set of results leads to efficient approximate algorithms for several applications, such as:
We present and analyze efficient algorithms for obtaining uniform random samples applicable to any search engine that is based
on posting lists and document-at-a-time evaluation. (To our knowledge, all popular Web search engines, for example, Google,
Yahoo Search, MSN Search, Ask, belong to this class.) Furthermore, our algorithm can be modified to follow the modern object-oriented
approach whereby posting lists are viewed as streams equipped with a next method, and the next method for Boolean and other complex queries is built from the next method for primitive terms. In our case we show how to construct a basic sample-next(p) method that samples term posting lists with probability p, and show how to construct sample-next(p) methods for Boolean operators (AND, OR, WAND) from primitive methods. Finally, we test the efficiency and quality of our approach on both synthetic and real-world data.
A preliminary version of this work has appeared in [3].
Work performed while A. Anagnostopoulos and A.Z. Broder were at IBM T. J. Watson Research Center. 相似文献
• | Determining the set of categories in a given taxonomy spanned by the search results; |
• | Finding the range of metadata values associated with the result set in order to enable “multi-faceted search”; |
• | Estimating the size of the result set; |
• | Data mining associations to the query terms. |
87.
Graph structure in the Web 总被引:11,自引:0,他引:11
Andrei Broder Ravi Kumar Farzin Maghoul Prabhakar Raghavan Sridhar Rajagopalan Raymie Stata Andrew Tomkins Janet Wiener 《Computer Networks》2000,33(1-6)
The study of the Web as a graph is not only fascinating in its own right, but also yields valuable insight into Web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution. We report on experiments on local and global properties of the Web graph using two AltaVista crawls each with over 200 million pages and 1.5 billion links. Our study indicates that the macroscopic structure of the Web is considerably more intricate than suggested by earlier experiments on a smaller scale. 相似文献
88.
89.
We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete. 相似文献
90.