全文获取类型
收费全文 | 1334篇 |
免费 | 89篇 |
国内免费 | 63篇 |
专业分类
电工技术 | 47篇 |
综合类 | 76篇 |
化学工业 | 14篇 |
金属工艺 | 2篇 |
机械仪表 | 21篇 |
建筑科学 | 5篇 |
能源动力 | 9篇 |
轻工业 | 13篇 |
水利工程 | 4篇 |
石油天然气 | 4篇 |
武器工业 | 7篇 |
无线电 | 387篇 |
一般工业技术 | 28篇 |
冶金工业 | 17篇 |
原子能技术 | 1篇 |
自动化技术 | 851篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 14篇 |
2021年 | 22篇 |
2020年 | 12篇 |
2019年 | 15篇 |
2018年 | 10篇 |
2017年 | 28篇 |
2016年 | 16篇 |
2015年 | 31篇 |
2014年 | 56篇 |
2013年 | 72篇 |
2012年 | 62篇 |
2011年 | 84篇 |
2010年 | 50篇 |
2009年 | 65篇 |
2008年 | 107篇 |
2007年 | 97篇 |
2006年 | 124篇 |
2005年 | 97篇 |
2004年 | 70篇 |
2003年 | 78篇 |
2002年 | 59篇 |
2001年 | 47篇 |
2000年 | 35篇 |
1999年 | 30篇 |
1998年 | 34篇 |
1997年 | 19篇 |
1996年 | 27篇 |
1995年 | 16篇 |
1994年 | 8篇 |
1993年 | 11篇 |
1992年 | 8篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 7篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 6篇 |
1984年 | 14篇 |
1983年 | 12篇 |
1982年 | 9篇 |
1964年 | 1篇 |
排序方式: 共有1486条查询结果,搜索用时 0 毫秒
1.
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. 相似文献
2.
3.
4.
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. 相似文献
5.
In this paper, we propose an ID-based non-interactive zero-knowledge proof system based on the 1-out-of-2 noninteractive oblivious transfer protocol. This zero-knowledge proof system is secure against a newly discovered cheating attack. 相似文献
6.
Precise timing and asynchronous I/O are appealing features for many applications. Unix kernels provide such features on a per‐process basis, using signals to communicate asynchronous events to applications. Per‐process signals and timers are grossly inadequate for complex multithreaded applications that require per‐thread signals and timers that operate at finer granularity. To respond to this need, we present a scheme that integrates asynchronous (Unix) signals with user‐level threads, using the ARIADNE system as a platform. This is done with a view towards support for portable, multithreaded, and multiprotocol distributed applications, namely the CLAM (connectionless, lightweight, and multiway) communications library. In the same context, we propose the use of continuations as an efficient mechanism for reducing thread context‐switching and busy‐wait overheads in multithreaded protocols. Our proposal for integrating timers and signal‐handling mechanisms not only solves problems related to race conditions, but also offers an efficient and flexible interface for timing and signalling threads. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
7.
A (t, n)-locally random reduction maps a problem instancex into a set of problem instancesy
1,...,y
n in such a way that it is easy to construct the answer tox from the answers toy
1,...,y
n, and yet the distribution ont-element subsets ofy
1,...,y
n depends only on |x|. In this paper we formalize such reductions and give improved methods for achieving them. Then we give a cryptographic application,
showing a new way to prove in perfect zero knowledge that committed bitsx
1,...,x
m satisfy some predicateQ. Unlike previous techniques for such perfect zero-knowledge proofs, ours uses an amount of communication that is bounded
by a fixed polynomial inm, regardless of the computational complexity ofQ.
These results were presented in preliminary form at the 10th Annual Crypto Conference, Santa Barbara, CA, August 1990. The
work of D. Beaver was done at Harvard University, supported in part by NSF Grant CCR-870-4513. The work of J. Kilian was done
at MIT and Harvard University, supported by an NSF postdoctoral fellowship. 相似文献
8.
Domenico Ferrari 《Multimedia Systems》1998,6(3):179-185
The research done by the Tenet Group in multimedia networking has reached a point where it may be useful to reflect on the
significance of its results for the current debate on how integrated-services internetworks should be designed. Such reflections
constitute the main subject of this paper. The principles of the work and the conclusions reached so far by the Tenet researchers
are discussed in the light of the conflict between the two major technologies being proposed to build future information infrastructures:
namely, the Internet and the ATM technologies. The Tenet approach suggests one feasible way for resolving the conflict to
the advantage of all the users of those infrastructures. This paper discusses various fundamental aspects of integrated-services
network design: the choice of the service model, the type of charging policy to be adopted, and the selection of a suitable
architecture. 相似文献
9.
M. MoessnerAuthor VitaeGul N. KhanAuthor Vitae 《Computer Networks》2012,56(1):273-286
Privacy and security concerns inhibit the fast adaption of RFID technology for many applications. A number of authentication protocols that address these concerns have been proposed but real-world solutions that are secure, maintain low communication cost and can be integrated into the ubiquitous EPCglobal Class 1 Generation 2 tag protocol (C1G2) are still needed and being investigated. We present a novel authentication protocol, which offers a high level of security through the combination of a random key scheme with a strong cryptography. The protocol is applicable to resource, power and computationally constraint platforms such as RFID tags. Our investigation shows that it can provide mutual authentication, untraceability, forward and backward security as well as resistance to replay, denial-ofth-service and man-in-the-middle attacks, while retaining a competitive communication cost. The protocol has been integrated into the EPCglobal C1G2 tag protocol, which assures low implementation cost. We also present a successful implementation of our protocol on real-world components such as the INTEL WISP UHF RFID tag and a C1G2 compliant reader. 相似文献
10.