全文获取类型
收费全文 | 23798篇 |
免费 | 3798篇 |
国内免费 | 2950篇 |
学科分类
工业技术 | 30546篇 |
出版年
2024年 | 123篇 |
2023年 | 442篇 |
2022年 | 734篇 |
2021年 | 819篇 |
2020年 | 998篇 |
2019年 | 846篇 |
2018年 | 779篇 |
2017年 | 1029篇 |
2016年 | 1087篇 |
2015年 | 1264篇 |
2014年 | 1734篇 |
2013年 | 2073篇 |
2012年 | 1873篇 |
2011年 | 1736篇 |
2010年 | 1408篇 |
2009年 | 1573篇 |
2008年 | 1660篇 |
2007年 | 1770篇 |
2006年 | 1422篇 |
2005年 | 1391篇 |
2004年 | 1174篇 |
2003年 | 920篇 |
2002年 | 765篇 |
2001年 | 602篇 |
2000年 | 448篇 |
1999年 | 399篇 |
1998年 | 296篇 |
1997年 | 227篇 |
1996年 | 188篇 |
1995年 | 183篇 |
1994年 | 144篇 |
1993年 | 89篇 |
1992年 | 79篇 |
1991年 | 58篇 |
1990年 | 33篇 |
1989年 | 29篇 |
1988年 | 19篇 |
1987年 | 10篇 |
1986年 | 21篇 |
1985年 | 20篇 |
1984年 | 18篇 |
1983年 | 12篇 |
1982年 | 5篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 8篇 |
1978年 | 7篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
文章介绍了新一代IP骨干网上的IP QoS实现技术,论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点,详细介绍了相关的队列管理与排队机制。并结合多协议标签交换(MPLS)技术的最新发展,阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。 相似文献
22.
嵌入式RTOS中任务优先级反转问题研究 总被引:1,自引:0,他引:1
针对嵌入式实时系统任务调度策略的特点,任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法,指出该调度算法存在的不同优先级的反转问题,并且针对这一问题进行研究,给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。 相似文献
23.
改进型UDP组播的性能分析及其在实时电源控制系统中的应用 总被引:1,自引:0,他引:1
文章通过采用带连接的UDP、I/O复用技术、关闭UDP校验和功能、负载均衡等技术对普通的UDP组播技术进行改进,使之在每个控制周期(1ms)内满足了分布式实时控制系统的实时性和可靠性要求。在将改进型的UDP组播技术应用于实际控制系统之前,文中构建了一个模拟局域网进行测试,对比结果表明改进后的组播技术无论在数据包延迟、丢包率等方面较改进前的UDP组播性能有较大幅度的提高。 相似文献
24.
基于mobile agent的分布式网络自管理模型 总被引:2,自引:1,他引:1
为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题,提出了一种网络自管理模型,从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理;提出了管理定位服务这一关键技术,在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务;采用可伸缩的分布式体系结构,适应了大规模网络的规模可变性等特点;基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。 相似文献
25.
针对炼油企业供水系统存在问题,阐述了炼油厂分散型水源井智能化集中监控的技术方案.对监控系统的硬件结构、程序设计、功能、技术特点和可靠性设计进行了较详细的介绍. 相似文献
26.
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. 相似文献
27.
Uplink scheduling in wireless systems is gaining importance due to arising uplink intensive data services (ftp, image uploads
etc.), which could be hampered by the currently in-built asymmetry in favor of the downlink. In this work, we propose and
study algorithms for efficient uplink packet-data scheduling in a CDMA cell. The algorithms attempt to maximize system throughput
under transmit power limitations on the mobiles assuming instantaneous knowledge of user queues and channels. However no channel
statistics or traffic characterization is necessary. Apart from increasing throughput, the algorithms also improve fairness
of service among users, hence reducing chances of buffer overflows for poorly located users.
The major observation arising from our analysis is that it is advantageous on the uplink to schedule “strong” users one-at-a-time,
and “weak” users in larger groups. This contrasts with the downlink where one-at-a-time transmission for all users has shown
to be the preferred mode in much previous work. Based on the optimal schedules, we propose less complex and more practical
approximate methods, both of which offer significant performance improvement compared to one-at-a-time transmission, and the
widely acclaimed Proportional Fair (PF) algorithm, in simulations. When queue content cannot be fed back, we propose a simple modification of PF, Uplink PF (UPF), that offers similar improvement.
Hereafter, we refer to users with low recieved power at the base even when transmitting at peak transmit power as “weak” users,
and the strongly recieved users at the base as “strong” users.
Krishnan Kumaran is currently a member of the Complex Systems Modeling section in the Corporate Strategic Research of ExxonMobil Corp., Clinton,
NJ. Formerly, he was a Member of Technical Staff in the Mathematics of Networks and Systems Research Department at Bell Labs
in Murray Hill, NJ, where his research interests were in modeling, analysis and simulation of design, resource management
and scheduling issues in telecommunication networks.
Lijun Qian is an assistant professor in the Department of Electrical Engineering at Prairie View A&M University. He received his B.S.
from Tsinghua University in Beijing, M.S. from Technion-Israel Institute of Technology, and Ph.D. from WINLAB, Rutgers University,
all in electrical engineering. Before joining PVAMU, he was a researcher at Networks and Systems Research Department of Bell
Labs in Murray Hill, NJ. His major research interests are in wireless communications and networking technologies, especially
in radio resource management, protocol design, TCP/RLP optimization and MPLS traffic engineering. 相似文献
28.
简要论述了集散控制系统的发展 ,根据火力发电厂的现场环境及实际情况 ,提出了火力发电厂集散控制系统的设计原则 ,并展望了集散控制系统的发展 相似文献
29.
30.
Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology. 相似文献