全文获取类型
收费全文 | 14340篇 |
免费 | 2148篇 |
国内免费 | 1946篇 |
专业分类
电工技术 | 1126篇 |
综合类 | 1197篇 |
化学工业 | 1233篇 |
金属工艺 | 238篇 |
机械仪表 | 1120篇 |
建筑科学 | 173篇 |
矿业工程 | 153篇 |
能源动力 | 232篇 |
轻工业 | 99篇 |
水利工程 | 270篇 |
石油天然气 | 278篇 |
武器工业 | 87篇 |
无线电 | 2058篇 |
一般工业技术 | 1619篇 |
冶金工业 | 200篇 |
原子能技术 | 46篇 |
自动化技术 | 8305篇 |
出版年
2024年 | 78篇 |
2023年 | 330篇 |
2022年 | 471篇 |
2021年 | 529篇 |
2020年 | 659篇 |
2019年 | 564篇 |
2018年 | 515篇 |
2017年 | 649篇 |
2016年 | 731篇 |
2015年 | 791篇 |
2014年 | 1031篇 |
2013年 | 1482篇 |
2012年 | 1164篇 |
2011年 | 1071篇 |
2010年 | 851篇 |
2009年 | 966篇 |
2008年 | 1015篇 |
2007年 | 990篇 |
2006年 | 832篇 |
2005年 | 754篇 |
2004年 | 595篇 |
2003年 | 463篇 |
2002年 | 378篇 |
2001年 | 296篇 |
2000年 | 217篇 |
1999年 | 204篇 |
1998年 | 161篇 |
1997年 | 121篇 |
1996年 | 87篇 |
1995年 | 90篇 |
1994年 | 72篇 |
1993年 | 50篇 |
1992年 | 54篇 |
1991年 | 36篇 |
1990年 | 31篇 |
1989年 | 17篇 |
1988年 | 10篇 |
1987年 | 5篇 |
1986年 | 12篇 |
1985年 | 13篇 |
1984年 | 14篇 |
1983年 | 7篇 |
1982年 | 3篇 |
1981年 | 3篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1961年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
12.
This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method. 相似文献
13.
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. 相似文献
14.
Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm. 相似文献
15.
16.
异构分层无线网络中基于逗留时间的动态流量均衡算法研究 总被引:1,自引:1,他引:0
为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高. 相似文献
17.
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. 相似文献
18.
文章介绍了新一代IP骨干网上的IP QoS实现技术,论述了集成业务(IntServ)与差分业务(DiffServ)解决方案的特点,详细介绍了相关的队列管理与排队机制。并结合多协议标签交换(MPLS)技术的最新发展,阐述了综合多协议标签交换流量工程与DiffServ技术体系端到端IP QoS的实现。 相似文献
19.
嵌入式RTOS中任务优先级反转问题研究 总被引:1,自引:0,他引:1
针对嵌入式实时系统任务调度策略的特点,任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法,指出该调度算法存在的不同优先级的反转问题,并且针对这一问题进行研究,给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。 相似文献
20.
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. 相似文献