全文获取类型
收费全文 | 43671篇 |
免费 | 3767篇 |
国内免费 | 2048篇 |
专业分类
电工技术 | 2723篇 |
技术理论 | 3篇 |
综合类 | 2971篇 |
化学工业 | 7346篇 |
金属工艺 | 2172篇 |
机械仪表 | 2828篇 |
建筑科学 | 3914篇 |
矿业工程 | 1190篇 |
能源动力 | 1210篇 |
轻工业 | 3407篇 |
水利工程 | 772篇 |
石油天然气 | 2020篇 |
武器工业 | 318篇 |
无线电 | 5175篇 |
一般工业技术 | 5365篇 |
冶金工业 | 1814篇 |
原子能技术 | 554篇 |
自动化技术 | 5704篇 |
出版年
2024年 | 207篇 |
2023年 | 800篇 |
2022年 | 1377篇 |
2021年 | 1945篇 |
2020年 | 1460篇 |
2019年 | 1189篇 |
2018年 | 1316篇 |
2017年 | 1471篇 |
2016年 | 1325篇 |
2015年 | 1679篇 |
2014年 | 2189篇 |
2013年 | 2594篇 |
2012年 | 2784篇 |
2011年 | 2912篇 |
2010年 | 2750篇 |
2009年 | 2548篇 |
2008年 | 2372篇 |
2007年 | 2334篇 |
2006年 | 2262篇 |
2005年 | 1908篇 |
2004年 | 1298篇 |
2003年 | 1286篇 |
2002年 | 1349篇 |
2001年 | 1165篇 |
2000年 | 1018篇 |
1999年 | 1062篇 |
1998年 | 811篇 |
1997年 | 750篇 |
1996年 | 708篇 |
1995年 | 565篇 |
1994年 | 474篇 |
1993年 | 318篇 |
1992年 | 258篇 |
1991年 | 194篇 |
1990年 | 146篇 |
1989年 | 129篇 |
1988年 | 104篇 |
1987年 | 68篇 |
1986年 | 67篇 |
1985年 | 34篇 |
1984年 | 29篇 |
1983年 | 23篇 |
1982年 | 19篇 |
1981年 | 19篇 |
1980年 | 23篇 |
1979年 | 16篇 |
1976年 | 8篇 |
1962年 | 42篇 |
1961年 | 39篇 |
1960年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Ye Wan Jun Tan Guangling Song Chuanwei Yan 《Metallurgical and Materials Transactions A》2006,37(7):2313-2316
The focused ion beam technique was employed to investigate the atmospheric corrosion morphology of AZ91D. It was found that
the α matrix of the alloy was preferentially corroded in the areas adjacent to intermetallic phases. The most interesting
finding was that the corrosion products in corrosion cavities were pelletlike, which has never been reported before. 相似文献
2.
随着计算机网络技术的发展,远程教学系统的结构发生了重大的变化,逐步由原来的客户机/服务器(C/S)结构转变为基于Internet的浏览器/服务器(B/S)结构。本文提出了基于CORBA技术的B/S结构系统模型。分析了其运行过程,并与传统的结构进行了比较,指明了其优越性。在本文的结尾。指出了使用这种技术的一个具体例子。 相似文献
3.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
4.
5.
6.
7.
Data mining extracts implicit, previously unknown, and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most important ones is finding association rules. Although a large amount of research has been devoted to this subject, none of it finds association rules from directed acyclic graph (DAG) data. Without such a mining method, the hidden knowledge, if any, cannot be discovered from the databases storing DAG data such as family genealogy profiles, product structures, XML documents, task precedence relations, and course structures. In this article, we define a new kind of association rule in DAG databases called the predecessor–successor rule, where a node x is a predecessor of another node y if we can find a path in DAG where x appears before y. The predecessor–successor rules enable us to observe how the characteristics of the predecessors influence the successors. An approach containing four stages is proposed to discover the predecessor–successor rules. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 621–637, 2006. 相似文献
8.
论文提出了一种混沌通信系统的噪音衰减算法,该算法利用混沌同步现象在接收端获得正确的噪音估计值,从而从接收信号中滤除噪音恢复出正确的信号。通过数值仿真试验表明该方法是可行的。 相似文献
9.
10.