全文获取类型
收费全文 | 40586篇 |
免费 | 4298篇 |
国内免费 | 1142篇 |
专业分类
化学 | 3415篇 |
晶体学 | 68篇 |
力学 | 697篇 |
综合类 | 403篇 |
数学 | 4193篇 |
物理学 | 5006篇 |
无线电 | 32244篇 |
出版年
2024年 | 172篇 |
2023年 | 611篇 |
2022年 | 1243篇 |
2021年 | 1669篇 |
2020年 | 1584篇 |
2019年 | 851篇 |
2018年 | 752篇 |
2017年 | 1405篇 |
2016年 | 1689篇 |
2015年 | 1667篇 |
2014年 | 2995篇 |
2013年 | 2593篇 |
2012年 | 2889篇 |
2011年 | 2751篇 |
2010年 | 2101篇 |
2009年 | 2089篇 |
2008年 | 2362篇 |
2007年 | 2500篇 |
2006年 | 2274篇 |
2005年 | 1929篇 |
2004年 | 1749篇 |
2003年 | 1670篇 |
2002年 | 1232篇 |
2001年 | 1037篇 |
2000年 | 860篇 |
1999年 | 647篇 |
1998年 | 523篇 |
1997年 | 423篇 |
1996年 | 395篇 |
1995年 | 329篇 |
1994年 | 280篇 |
1993年 | 197篇 |
1992年 | 136篇 |
1991年 | 104篇 |
1990年 | 66篇 |
1989年 | 43篇 |
1988年 | 58篇 |
1987年 | 17篇 |
1986年 | 32篇 |
1985年 | 26篇 |
1984年 | 21篇 |
1983年 | 6篇 |
1982年 | 12篇 |
1981年 | 12篇 |
1980年 | 2篇 |
1979年 | 7篇 |
1977年 | 6篇 |
1975年 | 2篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Kurjenniemi Janne Hämäläinen Seppo Ristaniemi Tapani 《Wireless Personal Communications》2003,27(4):337-351
In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out. 相似文献
12.
基于SONET/SDH的存储网络容灾技术分析 总被引:1,自引:0,他引:1
吴丽征 《微电子学与计算机》2006,23(6):119-122
文章分析了存储网络(SAN)容灾技术,认为在某些企业中,数据是至关重要的资产之一,是业务系统运行的血脉.保护企业的重要数据是企业成功的关键因素。文章讨论了设计容灾技术解决方案应考虑的各种因素,并给出了基于SONET/SDH的存储网络技术的体系架构设计方案。 相似文献
13.
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. 相似文献
14.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
15.
16.
M. J. O’Sullivan C. G. Walker M. L. O’Sullivan T. D. Thompson A. B. Philpott 《Telecommunication Systems》2006,33(4):353-376
The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems.
In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a
street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide
distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in
protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each
section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective)
covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints
and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along
each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe
an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed
by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined
(less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions
grow, DP gives significantly better solution times than IP. 相似文献
17.
地理空间信息网格调度技术,要比传统的高性能计算中的调度技术复杂,原因是如果将全部网格资源作为一个应用程序的调度和执行目标,必将导致通信延迟、成本昂贵、执行低效等。为此,综合考虑应用程序特性、机器特性等,研究设计了地理空间信息网格高性能调度技术中的应用程序调度模型,包括地理空间信息网格应用程序分析;资源特性分析;应用程序分解;性能预测;资源调度;机器选择;任务映射;任务调度;任务调度器和调度器管理模块。以实现为不同的应用程序匹配不同的计算资源,提高计算资源的利用率和应用程序的执行效率。 相似文献
18.
多协议标记交换(MPLS)技术是综合利用网络第二层交换技术的有效性和第三层IP路由的灵活性等优点而产生的多层交换技术。通过在传统的IP包里加入标记,使路由转发依赖于标记,大大地提高IP包的转发速度,同时可使传统IP网络具有服务质量(QoS)能力。现主要分析MPLS体系结构,指出MPLS的一些应用。 相似文献
19.
动力环境网络监控精细管理 总被引:1,自引:0,他引:1
叙述动力环境运行质量分析管理,包括故障管理,性能管理和专题分析管理,以动力环境网络监控细致八微、言之有据的月度分析管理实例展现了其精细管理的效果。 相似文献
20.
高校网络非线性编辑系统构建 总被引:2,自引:2,他引:0
从我国高校非线性编辑教学现状出发,对单机非线性编辑与网络非线性编辑以及国内外网络非线性编辑系统作了较为全面的分析和对比,在此基础上提出了高校网络非线性编辑系统的构建模式. 相似文献