全文获取类型
收费全文 | 3979篇 |
免费 | 487篇 |
国内免费 | 365篇 |
专业分类
电工技术 | 455篇 |
综合类 | 463篇 |
化学工业 | 66篇 |
金属工艺 | 93篇 |
机械仪表 | 272篇 |
建筑科学 | 197篇 |
矿业工程 | 99篇 |
能源动力 | 23篇 |
轻工业 | 60篇 |
水利工程 | 18篇 |
石油天然气 | 63篇 |
武器工业 | 67篇 |
无线电 | 1260篇 |
一般工业技术 | 145篇 |
冶金工业 | 50篇 |
原子能技术 | 11篇 |
自动化技术 | 1489篇 |
出版年
2024年 | 27篇 |
2023年 | 65篇 |
2022年 | 112篇 |
2021年 | 109篇 |
2020年 | 141篇 |
2019年 | 107篇 |
2018年 | 84篇 |
2017年 | 121篇 |
2016年 | 127篇 |
2015年 | 170篇 |
2014年 | 247篇 |
2013年 | 214篇 |
2012年 | 297篇 |
2011年 | 312篇 |
2010年 | 233篇 |
2009年 | 280篇 |
2008年 | 285篇 |
2007年 | 315篇 |
2006年 | 234篇 |
2005年 | 253篇 |
2004年 | 197篇 |
2003年 | 181篇 |
2002年 | 167篇 |
2001年 | 116篇 |
2000年 | 118篇 |
1999年 | 72篇 |
1998年 | 48篇 |
1997年 | 43篇 |
1996年 | 28篇 |
1995年 | 28篇 |
1994年 | 20篇 |
1993年 | 16篇 |
1992年 | 15篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1989年 | 6篇 |
1988年 | 12篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1984年 | 2篇 |
1981年 | 1篇 |
1977年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有4831条查询结果,搜索用时 15 毫秒
1.
Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search. 相似文献
2.
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. 相似文献
3.
4.
超媒体系统中的人工智能方法 总被引:3,自引:0,他引:3
一、什么是超媒体近年来迅速崛起的多媒体(multimedia)技术,是一种使计算机具有交互式地综合处理和管理文字、图形、图象、声音、视频等多种媒体能力的技术,必将使计算机技术发生一 相似文献
5.
微波中继的应用非常广泛 ,目前在二维、三维施工中跨越障碍物时 ,一般都使用微波中继站来传输命令和数据。文章就微波中继及I/OIMAGESYSTEM“蛇形排列”先进功能的实际应用进行了详细的阐述 ,同时提出了使用微波中继站应注意的问题。 相似文献
6.
就毛石砌体的拉接处理、现浇混凝土柱、墙拉结筋的留设、砖混结构中构造柱的质量预控等几个环节进行了分析,提出只有在施工中采取必要的措施,才能保证施工质量。 相似文献
7.
Sorin Manolache Petru Eles Zebo Peng 《International journal of parallel programming》2007,35(2):125-156
As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications
require guarantees on both message arrival probability and response time. We address the problem of transient link failures
by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities
are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message
to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed
in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response
time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the
proposed approach are guaranteed message arrival probability and guaranteed worst case application response time. 相似文献
8.
9.
10.