全文获取类型
收费全文 | 49536篇 |
免费 | 1256篇 |
国内免费 | 231篇 |
专业分类
电工技术 | 657篇 |
综合类 | 656篇 |
化学工业 | 6252篇 |
金属工艺 | 696篇 |
机械仪表 | 1064篇 |
建筑科学 | 1096篇 |
矿业工程 | 396篇 |
能源动力 | 855篇 |
轻工业 | 2744篇 |
水利工程 | 680篇 |
石油天然气 | 163篇 |
武器工业 | 4篇 |
无线电 | 2460篇 |
一般工业技术 | 4465篇 |
冶金工业 | 21716篇 |
原子能技术 | 266篇 |
自动化技术 | 6853篇 |
出版年
2024年 | 79篇 |
2023年 | 338篇 |
2022年 | 427篇 |
2021年 | 505篇 |
2020年 | 306篇 |
2019年 | 379篇 |
2018年 | 857篇 |
2017年 | 1021篇 |
2016年 | 1389篇 |
2015年 | 1006篇 |
2014年 | 731篇 |
2013年 | 1038篇 |
2012年 | 2465篇 |
2011年 | 2913篇 |
2010年 | 1004篇 |
2009年 | 1068篇 |
2008年 | 875篇 |
2007年 | 832篇 |
2006年 | 754篇 |
2005年 | 3463篇 |
2004年 | 2655篇 |
2003年 | 2153篇 |
2002年 | 925篇 |
2001年 | 792篇 |
2000年 | 344篇 |
1999年 | 662篇 |
1998年 | 6215篇 |
1997年 | 3839篇 |
1996年 | 2544篇 |
1995年 | 1485篇 |
1994年 | 1100篇 |
1993年 | 1139篇 |
1992年 | 278篇 |
1991年 | 333篇 |
1990年 | 331篇 |
1989年 | 293篇 |
1988年 | 325篇 |
1987年 | 249篇 |
1986年 | 217篇 |
1985年 | 181篇 |
1984年 | 95篇 |
1983年 | 102篇 |
1982年 | 149篇 |
1981年 | 191篇 |
1980年 | 210篇 |
1979年 | 75篇 |
1978年 | 114篇 |
1977年 | 620篇 |
1976年 | 1337篇 |
1975年 | 117篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
941.
Hierarchically Distributed Peer-to-Peer Document Clustering and Cluster Summarization 总被引:1,自引:0,他引:1
Hammouda Khaled M. Kamel Mohamed S. 《Knowledge and Data Engineering, IEEE Transactions on》2009,21(5):681-698
In distributed data mining, adopting a flat node distribution model can affect scalability. To address the problem of modularity, flexibility and scalability, we propose a Hierarchically-distributed Peer-to-Peer (HP2PC) architecture and clustering algorithm. The architecture is based on a multi-layer overlay network of peer neighborhoods. Supernodes, which act as representatives of neighborhoods, are recursively grouped to form higher level neighborhoods. Within a certain level of the hierarchy, peers cooperate within their respective neighborhoods to perform P2P clustering. Using this model, we can partition the clustering problem in a modular way across neighborhoods, solve each part individually using a distributed K-means variant, then successively combine clusterings up the hierarchy where increasingly more global solutions are computed. In addition, for document clustering applications, we summarize the distributed document clusters using a distributed keyphrase extraction algorithm, thus providing interpretation of the clusters. Results show decent speedup, reaching 165 times faster than centralized clustering for a 250-node simulated network, with comparable clustering quality to the centralized approach. We also provide comparison to the P2P K-means algorithm and show that HP2PC accuracy is better for typical hierarchy heights. Results for distributed cluster summarization match those of their centralized counterparts with up to 88% accuracy. 相似文献
942.
In this paper, we provide a necessary infrastructure to define an abstract state exploration in the HOL theorem prover. Our infrastructure is based on a deep embedding of the Multiway Decision Graphs (MDGs) theory in HOL. MDGs generalize Reduced Ordered Binary Decision Diagrams (ROBDDs) to represent and manipulate a subset of first-order logic formulae. The MDGs embedding is based on the logical formulation of an MDG as Directed Formulae (DF). Then, the MDGs operations are defined and the correctness pro... 相似文献
943.
Improved Results on Passivity Analysis of Uncertain Neural Networks with Time-Varying Discrete and Distributed Delays 总被引:1,自引:1,他引:0
In this paper, the passivity analysis problem is investigated for uncertain neural networks with time-varying discrete and
distributed delays. Based on direct delay decomposition idea and free-weighting matrix approach, several new delay-dependent
passive criterions are derived in terms of linear matrix inequalities (LMIs), which can be easily checked by the Matlab LMI
toolbox. Numerical examples show that the obtained results improve some existing ones. 相似文献
944.
Namgon?Kim JongWon?KimEmail author Thomas?D.?Uram 《Multimedia Tools and Applications》2009,44(1):17-37
In multi-party collaborative environments, a group of users can share multiple media streams via IP multicasting. However,
despite of the efficiency of IP multicast, it is not widely available and alternative application-layer multicast approaches
are introduced. Application-layer multicast is advantageous, however, it incurs additional processing delays. In this paper,
we present a new hybrid-style application-layer multicast solution that satisfies both network efficiency and easy deployment.
We achieve this goal by connecting multicast islands through UDP tunnels employing UMTP (UDP multicast tunneling protocol).
We also design a MPROBE protocol to remove multicast loop among multicast island in real Internet. We verify the feasibility
of the proposed solution by implementing a prototype tool, AG Connector, that works on Access Grid multi-party collaborative
environment.
相似文献
Thomas D. UramEmail: |
945.
Sophisticated on-chip interconnects using packet and circuit switching techniques were recently proposed as a solution to non-scalable shared-bus schemes currently used in Systems-on-Chip (SoCs) implementation. Different interconnect architectures have been studied and adapted for SoCs to achieve high throughput, low latency and energy consumption, and efficient silicon area. Recently, a new on-chip interconnect architecture by adapting the WK-recursive network topology structure has been introduced for SoCs. This paper analyses and compares the energy consumption and the area requirements of Wk-recursive network with five common on-chip interconnects, 2D Mesh, Ring, Spidergon, Fat-Tree and Butterfly Fat-Tree. We investigated the effects of load and traffic models and the obtained results show that the traffic models and load that ends processing elements has a direct effect on the energy consumption and area requirements. In these results, WK-recursive interconnect generally has a higher energy consumption and silicon area requirements in heavy traffic load. 相似文献
946.
DuD Recht
DuD Recht 相似文献947.
948.
Haio R?ckle 《Datenschutz und Datensicherheit - DuD》2009,33(5):326
Ohne Zusammenfassung 相似文献
949.
We study the problem of stabilizing a distributed linear system on a subregion of its geometrical domain. We are concerned with two methods: the first approach enables us to characterize a stabilizing control via the steady state Riccati equation, and the second one is based on decomposing the state space into two suitable subspaces and studying the projections of the initial system onto such subspaces. The obtained results are performed through various examples. 相似文献
950.
Achieving stability is the essential issue in the control system design. In this paper, four approaches that can be used to calculate the stability margin of the interval plant family are summarized and compared. The μ approach gives the bounds of the stability margin, and good estimation can be obtained with the numerical method. The eigenvalue approach yields accurate value, and the MATLAB's function robuststab sometimes provides wrong results. Since the eigenvalue approach is both accurate and computationally efficient, it is recommended for the calculation of the stability margin, while utilization of the function robuststab should be avoided due to the unreliable results it gives. 相似文献