全文获取类型
收费全文 | 15605篇 |
免费 | 2376篇 |
国内免费 | 2129篇 |
专业分类
电工技术 | 1314篇 |
技术理论 | 2篇 |
综合类 | 1627篇 |
化学工业 | 350篇 |
金属工艺 | 151篇 |
机械仪表 | 1220篇 |
建筑科学 | 257篇 |
矿业工程 | 132篇 |
能源动力 | 184篇 |
轻工业 | 90篇 |
水利工程 | 261篇 |
石油天然气 | 39篇 |
武器工业 | 171篇 |
无线电 | 3108篇 |
一般工业技术 | 1415篇 |
冶金工业 | 197篇 |
原子能技术 | 4篇 |
自动化技术 | 9588篇 |
出版年
2024年 | 88篇 |
2023年 | 267篇 |
2022年 | 407篇 |
2021年 | 464篇 |
2020年 | 590篇 |
2019年 | 533篇 |
2018年 | 503篇 |
2017年 | 615篇 |
2016年 | 702篇 |
2015年 | 805篇 |
2014年 | 1158篇 |
2013年 | 1576篇 |
2012年 | 1297篇 |
2011年 | 1313篇 |
2010年 | 1021篇 |
2009年 | 1145篇 |
2008年 | 1159篇 |
2007年 | 1189篇 |
2006年 | 978篇 |
2005年 | 934篇 |
2004年 | 746篇 |
2003年 | 583篇 |
2002年 | 439篇 |
2001年 | 365篇 |
2000年 | 261篇 |
1999年 | 220篇 |
1998年 | 148篇 |
1997年 | 121篇 |
1996年 | 90篇 |
1995年 | 76篇 |
1994年 | 67篇 |
1993年 | 44篇 |
1992年 | 49篇 |
1991年 | 33篇 |
1990年 | 18篇 |
1989年 | 17篇 |
1988年 | 7篇 |
1987年 | 3篇 |
1986年 | 11篇 |
1985年 | 12篇 |
1984年 | 15篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 3篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1961年 | 2篇 |
1960年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
Paul Feautrier 《International journal of parallel programming》2006,34(5):459-487
Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods
for automatic parallelization. A schedule gives a blueprint for constructing a synchronous program, suitable for an ASIC or
VLIW processor. However, constructing a schedule entails solving a large linear program. Even if one accepts the (experimental)
fact that the Simplex is almost always polynomial, the scheduling time is of the order of a large power of the program size.
Hence, the method does not scale well. The present paper proposes two methods for improving the situation. First, a large
program can be divided into smaller units (processes), which can be scheduled separately. This is structured scheduling. Second, one can use projection methods for solving linear programs incrementally. This is specially efficient if the dependence
graph is sparse. 相似文献
12.
文章介绍了新一代IP骨干网上的IP QoS实现技术,论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点,详细介绍了相关的队列管理与排队机制。并结合多协议标签交换(MPLS)技术的最新发展,阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。 相似文献
13.
嵌入式RTOS中任务优先级反转问题研究 总被引:1,自引:0,他引:1
针对嵌入式实时系统任务调度策略的特点,任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法,指出该调度算法存在的不同优先级的反转问题,并且针对这一问题进行研究,给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。 相似文献
14.
改进型UDP组播的性能分析及其在实时电源控制系统中的应用 总被引:1,自引:0,他引:1
文章通过采用带连接的UDP、I/O复用技术、关闭UDP校验和功能、负载均衡等技术对普通的UDP组播技术进行改进,使之在每个控制周期(1ms)内满足了分布式实时控制系统的实时性和可靠性要求。在将改进型的UDP组播技术应用于实际控制系统之前,文中构建了一个模拟局域网进行测试,对比结果表明改进后的组播技术无论在数据包延迟、丢包率等方面较改进前的UDP组播性能有较大幅度的提高。 相似文献
15.
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. 相似文献
16.
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. 相似文献
17.
网格资源管理系统模型研究 总被引:10,自引:3,他引:7
网格资源管理系统是网格计算系统的重要组成部分。文章分析了网格资源管理系统的功能需求,具体论述了该模型的原型系统,最后介绍了相关研究工作。 相似文献
18.
Scheduling Algorithms for Packet-Oriented MAC Protocols in Wireless Multimedia Systems 总被引:1,自引:1,他引:0
Romano Fantacci Giovanni Giambene Francesco Petiti 《Wireless Personal Communications》2003,24(3):363-388
Future generation wireless multimediacommunications will require efficient Medium AccessControl (MAC) protocols able to guarantee suitable Qualityof Service (QoS) levels for different traffic classes whileachieving a high utilization of radio resources. This paperproposes a new scheduling technique to be adopted at the MAClevel in wireless access systems, named Dynamic Scheduling-Time DivisionDuplexing (DS-TDD), that efficiently managesvideo, voice, Web and background traffics. A theoretical approachis proposed in this paper to evaluate the DS-TDD performance withvoice and Web traffics. Simulation results have permitted tohighlight the following promising characteristics of the DS-TDDscheme: (i) a high capacity of real-time traffics isattained with a QoS insensitive to Web and background trafficloads; (ii) a high throughput can be guaranteed whilepreserving the QoS levels of the different traffic classes;(iii) heavier downlink traffic loads do not modify the QoSof uplink traffics. Finally, extensive comparisons with differentscheduling schemes proposed in the literature have permitted tohighlight the better performanceof DS-TDD. 相似文献
19.
提出一种视频点播系统传送数据的结构,结合单播与群播两种数据传送的方法,通过动态改变群播与单播的频道分配比例,让大部分的使用者无需等待即可开始观看影片,进而减少整体使用者的等待时间. 相似文献
20.