全文获取类型
收费全文 | 14532篇 |
免费 | 1815篇 |
国内免费 | 1710篇 |
专业分类
电工技术 | 1264篇 |
技术理论 | 1篇 |
综合类 | 1372篇 |
化学工业 | 1087篇 |
金属工艺 | 256篇 |
机械仪表 | 1280篇 |
建筑科学 | 569篇 |
矿业工程 | 339篇 |
能源动力 | 248篇 |
轻工业 | 318篇 |
水利工程 | 308篇 |
石油天然气 | 192篇 |
武器工业 | 95篇 |
无线电 | 1659篇 |
一般工业技术 | 1485篇 |
冶金工业 | 323篇 |
原子能技术 | 118篇 |
自动化技术 | 7143篇 |
出版年
2024年 | 108篇 |
2023年 | 252篇 |
2022年 | 438篇 |
2021年 | 472篇 |
2020年 | 606篇 |
2019年 | 469篇 |
2018年 | 464篇 |
2017年 | 586篇 |
2016年 | 645篇 |
2015年 | 700篇 |
2014年 | 1020篇 |
2013年 | 1461篇 |
2012年 | 1147篇 |
2011年 | 1128篇 |
2010年 | 868篇 |
2009年 | 1013篇 |
2008年 | 960篇 |
2007年 | 1022篇 |
2006年 | 878篇 |
2005年 | 773篇 |
2004年 | 610篇 |
2003年 | 494篇 |
2002年 | 415篇 |
2001年 | 314篇 |
2000年 | 243篇 |
1999年 | 204篇 |
1998年 | 155篇 |
1997年 | 128篇 |
1996年 | 96篇 |
1995年 | 84篇 |
1994年 | 64篇 |
1993年 | 41篇 |
1992年 | 43篇 |
1991年 | 34篇 |
1990年 | 18篇 |
1989年 | 18篇 |
1988年 | 7篇 |
1986年 | 12篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1982年 | 2篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1971年 | 2篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
In this paper, we study scheduling games under mixed coordination mechanisms on hierarchical machines. The two scheduling policies involved are ‐ and ‐, where ‐ (resp., ‐) policy sequences jobs in nondecreasing order of their hierarchies, and jobs of the same hierarchy in nonincreasing (resp., nondecreasing) order of their processing times. We first show the existence of a Nash equilibrium. Then we present the price of anarchy and the price of stability for the games with social costs of minimizing the makespan and maximizing the minimum machine load. All the bounds given in this paper are tight. 相似文献
2.
文章介绍了新一代IP骨干网上的IP QoS实现技术,论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点,详细介绍了相关的队列管理与排队机制。并结合多协议标签交换(MPLS)技术的最新发展,阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。 相似文献
3.
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. 相似文献
4.
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. 相似文献
5.
6.
ARAM·ARIES SPM-Lite便携式遥测地震数据采集系统是加拿大GEO-X公司在2002年下半年推出的全新小型便携式地震数据采集系统。该仪器运用了当今最先进的计算机制造技术、网络化技术和微电子技术,除继承了ARAM-ARIES地震数据采集系统所有功能和技术外,它还简化了硬件结构,使体积更小,重量更轻,功能性更强。更加适应地矿、煤田、丛林和山区进行地震勘探。 相似文献
7.
In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not. 相似文献
8.
介绍了现在制造业中面临的问题,通过对问题的分析,提出了发展先进制造前沿技术的见解和在我国发展先进制造技术的途径,同时展望了先进制造技术的发展前景。 相似文献
9.
The even-flow harvest scheduling problem arises when the forestry agency has evolved into a rigid non-declining even-flow policy. In this paper, we investigate model formulation and solution strategies for the even-flow harvest scheduling problem. A multiple-objective linear programming problem is formulated for even-flow harvest scheduling problems with multiple-site classes and multiple periods. The aim of this problem is to simultaneously maximize a desired harvest-volume per hectare for each period of planning horizon and the total economic return. A block diagonal constraint structure, with many sets of network sub-problems and a set of coupling constraints, is identified in this linear programming problem. A longest path method for each of network sub-problems and a primal-dual steepest-edge algorithm for the entire problem are developed. The developed algorithm has been coded in Borland C++ and implemented on a personal computer. An illustrative example is used to display the detailed procedure for the developed algorithm and a real-world case study is used to show the trade-off between desired even-flow harvest volume policy and total economic return. Results show the potential benefits of this approach. 相似文献
10.
Sidhartha R. Das Basheer M. Khumawala 《International Journal of Flexible Manufacturing Systems》1991,3(2):121-147
Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system.The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence.A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions. 相似文献