全文获取类型
收费全文 | 2580篇 |
免费 | 213篇 |
国内免费 | 148篇 |
专业分类
电工技术 | 53篇 |
综合类 | 109篇 |
化学工业 | 13篇 |
金属工艺 | 4篇 |
机械仪表 | 40篇 |
建筑科学 | 7篇 |
能源动力 | 10篇 |
轻工业 | 13篇 |
水利工程 | 9篇 |
石油天然气 | 5篇 |
武器工业 | 10篇 |
无线电 | 716篇 |
一般工业技术 | 47篇 |
冶金工业 | 31篇 |
原子能技术 | 1篇 |
自动化技术 | 1873篇 |
出版年
2024年 | 1篇 |
2023年 | 12篇 |
2022年 | 22篇 |
2021年 | 28篇 |
2020年 | 22篇 |
2019年 | 23篇 |
2018年 | 42篇 |
2017年 | 47篇 |
2016年 | 54篇 |
2015年 | 71篇 |
2014年 | 129篇 |
2013年 | 148篇 |
2012年 | 173篇 |
2011年 | 212篇 |
2010年 | 132篇 |
2009年 | 155篇 |
2008年 | 215篇 |
2007年 | 230篇 |
2006年 | 225篇 |
2005年 | 199篇 |
2004年 | 134篇 |
2003年 | 132篇 |
2002年 | 95篇 |
2001年 | 72篇 |
2000年 | 61篇 |
1999年 | 48篇 |
1998年 | 42篇 |
1997年 | 29篇 |
1996年 | 31篇 |
1995年 | 22篇 |
1994年 | 18篇 |
1993年 | 17篇 |
1992年 | 10篇 |
1991年 | 10篇 |
1990年 | 9篇 |
1989年 | 6篇 |
1988年 | 11篇 |
1987年 | 4篇 |
1986年 | 3篇 |
1985年 | 7篇 |
1984年 | 14篇 |
1983年 | 13篇 |
1982年 | 10篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1964年 | 1篇 |
排序方式: 共有2941条查询结果,搜索用时 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.
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. 相似文献
3.
4.
Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions
in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions.
Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such
applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we
used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their
discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless
sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show
that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for
on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to
schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes
and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results
show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared
to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput.
As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery
model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless
networks as well. 相似文献
5.
6.
Tibor Gyires 《Applied Intelligence》1991,1(2):145-155
Distributed Problem Solving Networks (DPSN) provide a means for interconnecting intelligent problem solver nodes that can solve only a part of a problem depending on their ability in the problem domain. The decomposition of a problem into subproblems, and the selection of nodes to solve them can be regarded as the generation of an AND/OR tree, and the solution of the problem as a search for a solution tree. Introducing measurements for the cost of a solution tree, we present an algorithm to find one having minimal cost under certain conditions. A Flexible Manufacturing System consisting of a network of flexible workcells is used as an example. 相似文献
7.
Due to the unique requirements of a series of projects to specify communications architectures using graphical representations (Cara and MFD), we have developed the communications-oriented rule-based language Carla (Cara Rule Language), which provides an executable specification of the architecture being developed. Carla is designed to provide the ability to specify and simulate high-level, possibly incomplete, specifications of communications architectures, and to allow the developer to refine the specification through the addition of behavior-describing rules. Carla is also well-suited to creating black-box specifications of any system whose behavior depends on input/output history. We describe the features of the language, discuss various design issues, and provide examples of various communications protocols specified in Carla. 相似文献
8.
9.
Mani Azimi Ching-Tsun Chou Akhilesh Kumar Victor W. Lee Phamndra K. Mannava Seungjoon Park 《Formal Methods in System Design》2003,22(2):109-116
In the last three years or so we at Enterprise Platforms Group at Intel Corporation have been applying formal methods to various problems that arose during the process of defining platform architectures for Intel's processor families. In this paper we give an overview of some of the problems we have worked on, the results we have obtained, and the lessons we have learned. The last topic is addressed mainly from the perspective of platform architects. 相似文献
10.
Graziosi Fabio Ruggieri Marina Santucci Fortunato 《Wireless Personal Communications》2002,21(2):141-162
In this paper the performance of a packet mobile radio network is studied inthe presence of shadow fading outage intervals.Under quite general assumptions for the medium access protocol,the probability mass function of the sequence of packets that may be lostdue to an outage interval is derived. It is seen that long sequences of lostpackets are likely to occur for typical values of the mobile speed andshadowing correlation parameters.For delay constrained sources, e.g., voice, the analysis is mainly focused atderiving the probability function of the sequence of dropped packetsand the probability of dropping. For data sources, the delay statistic isalso derived. In the latter case, the effect of finite buffer length isaddressed. Simulation is used to verify the accuracy of approximations introduced in the analysis. 相似文献