全文获取类型
收费全文 | 12550篇 |
免费 | 1467篇 |
国内免费 | 1334篇 |
专业分类
电工技术 | 557篇 |
综合类 | 1486篇 |
化学工业 | 147篇 |
金属工艺 | 139篇 |
机械仪表 | 648篇 |
建筑科学 | 278篇 |
矿业工程 | 196篇 |
能源动力 | 48篇 |
轻工业 | 85篇 |
水利工程 | 82篇 |
石油天然气 | 84篇 |
武器工业 | 101篇 |
无线电 | 4234篇 |
一般工业技术 | 396篇 |
冶金工业 | 259篇 |
原子能技术 | 26篇 |
自动化技术 | 6585篇 |
出版年
2024年 | 58篇 |
2023年 | 160篇 |
2022年 | 263篇 |
2021年 | 341篇 |
2020年 | 411篇 |
2019年 | 303篇 |
2018年 | 302篇 |
2017年 | 429篇 |
2016年 | 473篇 |
2015年 | 539篇 |
2014年 | 974篇 |
2013年 | 912篇 |
2012年 | 903篇 |
2011年 | 899篇 |
2010年 | 786篇 |
2009年 | 757篇 |
2008年 | 903篇 |
2007年 | 1017篇 |
2006年 | 815篇 |
2005年 | 813篇 |
2004年 | 695篇 |
2003年 | 644篇 |
2002年 | 482篇 |
2001年 | 470篇 |
2000年 | 259篇 |
1999年 | 188篇 |
1998年 | 137篇 |
1997年 | 104篇 |
1996年 | 83篇 |
1995年 | 89篇 |
1994年 | 43篇 |
1993年 | 15篇 |
1992年 | 17篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 6篇 |
1987年 | 2篇 |
1985年 | 2篇 |
1979年 | 3篇 |
1965年 | 2篇 |
1964年 | 6篇 |
1963年 | 3篇 |
1962年 | 1篇 |
1960年 | 1篇 |
1959年 | 2篇 |
1958年 | 1篇 |
1957年 | 2篇 |
1955年 | 2篇 |
1954年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
介绍了数字集群的技术性能和在国外的发展概况,叙述了数字集群通信在我国的使用和发展前景。 相似文献
92.
分析了现有移动通信网络存在的问题,阐述了第2代移动通信核心网向第3代移动通信核心网演进的必然性:讨论了第2代移动通信核心网向第3代移动通信核心网演进所采用的演进策略,介绍了两种可供选择的全IP核心网络的参考结构。 相似文献
93.
欺诈每年都给电信行业带来巨额损失。3G由于其自身的特点和提供的服务的特点,将会面临电信欺诈的巨大威胁。从目前看,尽管3G将会面临各种欺诈风险,但最可能最普遍的是盗窃SIM卡和终端,并采用多种欺诈入网的方式来购买和转售网上商品。运营商应当严格控制销售流程,并建立行之有效的反欺诈管理系统。 相似文献
94.
MMS手机市场的启动归根结底要靠MMS业务的推广,具体而言涉及运营商的市场促销策略、手机厂商的推广策略、内容供应商的内容提供、用户的换机需求等方面。如果将彩信再造为移动数据产业链的杀手级业务,运营商要联合终端生产厂商和内容供应商共同关注如下问题:重视价值链中良好关系的建立.内容提拱要更丰富.努力冲破互联互通壁垒,彩信手机供应更加多样化,彩信手机价格将分化。 相似文献
95.
文章描述了全IP网络各个层次上的移动性管理需求以及全IP网络目前的标准和规范,详细介绍了移动性管理中的宏移动性管理、微移动性管理、空中接口移动性管理。指出了全IP网络中移动管理的研究方向。 相似文献
96.
With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising
target application. We classify mobile information service domains based on feature characteristics of the information sources
and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic
data management problem that must be addressed for effective location based services in mobile environments. We then devise
a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture
and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing
and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns.
Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest
that different strategies are effective for different types of data in response to different patterns of movement and information
access.
Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University,
Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu,
Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively.
His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems,
and electronic commerce.
Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei,
Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University,
Hualien, Taiwan, R.O.C., in 2001.
Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science
Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security
Taskforce. His research interests include mobile computing, wireless network and information security. 相似文献
97.
This paper presents an approach to power-conserving routing of ad hoc mobile wireless networks. This approach relies on entropy-constrained routing algorithms, which were developed by utilizing the information-theoretic concept of the entropy to gradually reduce the uncertainty associated with route discovery through a deterministic annealing process. Entropy-constrained routing algorithms were tested using a single performance metric related to the distance between the nodes and to the power consumption associated with packet transmission. This paper also expands the versatility of entropy-constrained routing algorithms by making them capable of discovering routes based on multiple performance metrics. In this study, the second performance metric employed for route discovery relied on the power availability in the nodes of the network. The proposed routing approach was evaluated in terms of the power consumption associated with the routing of packets over an ad hoc mobile network in a variety of operating conditions. 相似文献
98.
在安全电子交易的前提下,分析目前流行的SET标准协议,指出SET协议在电子交易过程中的缺陷.针对手机支付自身的特点,将简化的SET协议框架应用于手机支付系统的设计,提出手机小额支付与转帐支付2种支付形式,并分析这2种支付形式的安全性与有效性.这2种支付形式满足了手机支付的安全性、实时性、便捷性等要求. 相似文献
99.
100.
Xiaolei Dong Haifeng Qian Zhenfu Cao 《Wireless Communications and Mobile Computing》2009,9(2):217-225
In electronic communication and wireless communication, message authentication should be necessary. However, traditional method message authentication code (MAC) employs a symmetric cryptographical technique and it needs to keep a shared private key between two parties. For convenience, people now begins to use public key techniques to provide message authentication. In wireless communication, we shall save more space for message itself because of the limited resources. Therefore, we believe that our proposed digital signature scheme will be more fitful for this kind of communication due to the following merits: (1) in addition to inheriting the merits of RSA signature such as high verification efficiency, the proposed scheme also shows its advantage over RSA by resisting low public key exponent attack; (2) comparing with 1024 bits RSA, our digital signature scheme can sign 2048‐bit long message once, and generate a signature with 1025 bits length which doubles the capacity of the 1024‐bit RSA signature; (3) the scheme is provably secure and its security is tightly related to the hardness of conic‐based (CB)‐RSA assumption. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献