全文获取类型
收费全文 | 286110篇 |
免费 | 32262篇 |
国内免费 | 18679篇 |
专业分类
电工技术 | 22167篇 |
技术理论 | 31篇 |
综合类 | 31551篇 |
化学工业 | 28481篇 |
金属工艺 | 10737篇 |
机械仪表 | 16581篇 |
建筑科学 | 31859篇 |
矿业工程 | 13667篇 |
能源动力 | 9516篇 |
轻工业 | 17076篇 |
水利工程 | 11699篇 |
石油天然气 | 12695篇 |
武器工业 | 4349篇 |
无线电 | 26247篇 |
一般工业技术 | 20600篇 |
冶金工业 | 12306篇 |
原子能技术 | 1929篇 |
自动化技术 | 65560篇 |
出版年
2024年 | 1552篇 |
2023年 | 4170篇 |
2022年 | 7870篇 |
2021年 | 9785篇 |
2020年 | 9855篇 |
2019年 | 7660篇 |
2018年 | 7344篇 |
2017年 | 8933篇 |
2016年 | 10812篇 |
2015年 | 12000篇 |
2014年 | 19780篇 |
2013年 | 17778篇 |
2012年 | 21467篇 |
2011年 | 23482篇 |
2010年 | 17746篇 |
2009年 | 18141篇 |
2008年 | 17266篇 |
2007年 | 20338篇 |
2006年 | 17765篇 |
2005年 | 15267篇 |
2004年 | 12600篇 |
2003年 | 10739篇 |
2002年 | 8597篇 |
2001年 | 6999篇 |
2000年 | 6010篇 |
1999年 | 4707篇 |
1998年 | 3444篇 |
1997年 | 2955篇 |
1996年 | 2372篇 |
1995年 | 1944篇 |
1994年 | 1674篇 |
1993年 | 1196篇 |
1992年 | 1003篇 |
1991年 | 673篇 |
1990年 | 625篇 |
1989年 | 555篇 |
1988年 | 327篇 |
1987年 | 230篇 |
1986年 | 198篇 |
1985年 | 228篇 |
1984年 | 159篇 |
1983年 | 138篇 |
1982年 | 85篇 |
1981年 | 93篇 |
1980年 | 105篇 |
1979年 | 48篇 |
1978年 | 34篇 |
1977年 | 31篇 |
1975年 | 26篇 |
1959年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
在阐述客户服务意义的基础上,提出对中国石化成品油销售企业客户服务体系建设的建议,即建立以客户为尊的服务理念;建设特色企业文化;完善员工服务体系;注重细节,提高服务质量;整合现有客户体系资源,拓展服务功能。 相似文献
72.
降低成品油二次物流运输成本的思考 总被引:4,自引:0,他引:4
介绍了传统成品油进货和管理模式存在的诸如成品油物流以行政区划、中问环节多、信息化程度不高、运输路线未优化造成物流成本提高等问题。提出要降低成品油二次物流运输成本,当务之急是加强成品油物流的信息化建设;调整管理模式,打破行政区域界限,开展经济辐射半径内的库站物流配送;引进竞争机制,打破运输垄断,一、二次物流结合,大、小车型搭配,提高运营效率;做好运杂费全面预算、核算及运行费用的过程控制。 相似文献
73.
74.
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. 相似文献
75.
通过认真学习《细节决定成败》,结合井矿盐开采的实际,分别以生产过程中的三个细节为主,讨论了在采输卤生产技术控制中的细节的重要性。 相似文献
76.
论文提出利用用户提供的个性化信息来随机产生关联大素数,保证了素数选取的随机化、个性化,提高了RSA算法的安全性。 相似文献
77.
吴远根 《安徽冶金科技职业学院学报》2003,13(3):45-47
分析高职学生思想状态的多层次性,提出以正面的思想教育和启发引导为主,同时加强规章制度的制约性,以提高教育管理工作的效果. 相似文献
78.
79.
Aqueous solutions of poly(vinyl pyrrolidone)-fullerene complexes (PVP-C70) have been studied using static and dynamic light scattering methods. Two diffusive processes were detected. The slow diffusion was interpreted as dynamics of large intermolecular PVP-C70 complexes while the fast diffusion was associated with the presence of individual PVP molecules in solution. It was also shown that the molecular weights and dimensions of PVP-C70 complexes are smaller than for PVP-C60 by a factor of 2.5-3. In aqueous solutions of PVP-C70 complex the depolarization and dissymmetry of scattered light were observed in contrast to PVP-C60 solutions. It reveals the existence of anisotropic structures in PVP-C70 solutions. Intermolecular interactions within PVP-C70 complexes are weak and a hydrodynamic field can destroy complexes. 相似文献
80.