全文获取类型
收费全文 | 27915篇 |
免费 | 2922篇 |
国内免费 | 2399篇 |
专业分类
电工技术 | 1511篇 |
技术理论 | 1篇 |
综合类 | 2315篇 |
化学工业 | 1531篇 |
金属工艺 | 340篇 |
机械仪表 | 869篇 |
建筑科学 | 643篇 |
矿业工程 | 216篇 |
能源动力 | 448篇 |
轻工业 | 215篇 |
水利工程 | 225篇 |
石油天然气 | 168篇 |
武器工业 | 111篇 |
无线电 | 6370篇 |
一般工业技术 | 1565篇 |
冶金工业 | 391篇 |
原子能技术 | 53篇 |
自动化技术 | 16264篇 |
出版年
2024年 | 117篇 |
2023年 | 453篇 |
2022年 | 555篇 |
2021年 | 628篇 |
2020年 | 780篇 |
2019年 | 675篇 |
2018年 | 627篇 |
2017年 | 827篇 |
2016年 | 971篇 |
2015年 | 1152篇 |
2014年 | 1628篇 |
2013年 | 1841篇 |
2012年 | 1826篇 |
2011年 | 2140篇 |
2010年 | 1687篇 |
2009年 | 2012篇 |
2008年 | 2124篇 |
2007年 | 2066篇 |
2006年 | 1675篇 |
2005年 | 1445篇 |
2004年 | 1254篇 |
2003年 | 1090篇 |
2002年 | 965篇 |
2001年 | 828篇 |
2000年 | 743篇 |
1999年 | 592篇 |
1998年 | 511篇 |
1997年 | 450篇 |
1996年 | 361篇 |
1995年 | 273篇 |
1994年 | 211篇 |
1993年 | 175篇 |
1992年 | 126篇 |
1991年 | 73篇 |
1990年 | 53篇 |
1989年 | 40篇 |
1988年 | 31篇 |
1987年 | 24篇 |
1986年 | 19篇 |
1985年 | 46篇 |
1984年 | 41篇 |
1983年 | 37篇 |
1982年 | 41篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 8篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 125 毫秒
31.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
32.
33.
Christian Stephan Bernd 《AEUE-International Journal of Electronics and Communications》2006,60(1):20-24
Security for ad hoc network environments has received a lot of attention as of today. Previous work has mainly been focussing on secure routing, fairness issues, and malicious node detection. However, the issue of introducing and conserving trust relationships has received considerably less attention. In this article, we present a scalable method for the use of public key certificates and their revocation in mobile ad hoc networks (MANETs). With the LKN-ad hoc security framework (LKN-ASF) a certificate management protocol has been introduced, bringing PKI technology to MANETs. In addition a performance analysis of two different revocation approaches for MANETs will be presented. 相似文献
34.
35.
36.
Quality of service (QoS) support for multimedia services in the IEEE 802.11 wireless LAN is an important issue for such WLANs
to become a viable wireless access to the Internet. In this paper, we endeavor to propose a practical scheme to achieve this
goal without changing the channel access mechanism. To this end, a novel call admission and rate control (CARC) scheme is
proposed. The key idea of this scheme is to regulate the arriving traffic of the WLAN such that the network can work at an
optimal point. We first show that the channel busyness ratio is a good indicator of the network status in the sense that it
is easy to obtain and can accurately and timely represent channel utilization. Then we propose two algorithms based on the
channel busyness ratio. The call admission control algorithm is used to regulate the admission of real-time or streaming traffic
and the rate control algorithm to control the transmission rate of best effort traffic. As a result, the real-time or streaming
traffic is supported with statistical QoS guarantees and the best effort traffic can fully utilize the residual channel capacity
left by the real-time and streaming traffic. In addition, the rate control algorithm itself provides a solution that could
be used above the media access mechanism to approach the maximal theoretical channel utilization. A comprehensive simulation
study in ns-2 has verified the performance of our proposed CARC scheme, showing that the original 802.11 DCF protocol can
statically support strict QoS requirements, such as those required by voice over IP or streaming video, and at the same time,
achieve a high channel utilization.
Hongqiang Zhai received the B.E. and M.E. degrees in electrical engineering from Tsinghua University, Beijing, China, in July 1999 and January
2002 respectively. He worked as a research intern in Bell Labs Research China from June 2001 to December 2001, and in Microsoft
Research Asia from January 2002 to July 2002. Currently he is pursuing the PhD degree in the Department of Electrical and
Computer Engineering, University of Florida. He is a student member of IEEE.
Xiang Chen received the B.E. and M.E. degrees in electrical engineering from Shanghai Jiao Tong University, Shanghai, China, in 1997
and 2000, respectively, and the Ph.D. degree in electrical and computer engineering from the University of Florida, Gainesville,
in 2005. He is currently a Senior Research Engineer at Motorola Labs, Arlington Heights, IL. His research interests include
resource management, medium access control, and quality of service (QoS) in wireless networks. He is a Member of Tau Beta
Pi and a student member of IEEE.
Yuguang Fang received a Ph.D degree in Systems and Control Engineering from Case Western Reserve University in January 1994, and a Ph.D
degree in Electrical Engineering from Boston University in May 1997.
From June 1997 to July 1998, he was a Visiting Assistant Professor in Department of Electrical Engineering at the University
of Texas at Dallas. From July 1998 to May 2000, he was an Assistant Professor in the Department of Electrical and Computer
Engineering at New Jersey Institute of Technology. In May 2000, he joined the Department of Electrical and Computer Engineering
at University of Florida where he got the early promotion with tenure in August 2003 and has been an Associate Professor since
then. He has published over one hundred (100) papers in refereed professional journals and conferences. He received the National
Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002.
He is currently serving as an Editor for many journals including IEEE Transactions on Communications, IEEE Transactions on
Wireless Communications, IEEE Transactions on Mobile Computing, and ACM Wireless Networks. He is also actively participating
in conference organization such as the Program Vice-Chair for IEEE INFOCOM’2005, Program Co-Chair for the Global Internet
and Next Generation Networks Symposium in IEEE Globecom’2004 and the Program Vice Chair for 2000 IEEE Wireless Communications
and Networking Conference (WCNC’2000). 相似文献
37.
Polymer networks in which poly(propylene imine) dendrimers (Astramol?) are connected to each other by linear polytetrahydrofuran (polyTHF) segments, were prepared by two methods. The first method was a one‐step procedure in which bifunctionally living polyTHF, obtained by initiation of the THF polymerization with trifluoromethane sulfonic anhydride (triflic anhydride), was reacted with an amino‐dendrimer. This reaction was very fast but did not allow formation of the end products. The second method was a two‐step procedure. In a first step, living polyTHF, prepared with acryloyloxybutyl triflate as initiator, was grafted on an amino‐dendrimer, to form a star‐like, acrylate‐terminated polyTHF multi‐macromonomer with the dendrimer as core. In a second step, networks were obtained by Michael addition between the acrylate end‐groups and unreacted amino‐groups of the dendrimer. This cross‐linking reaction occurred spontaneously upon heating of the solution of the multi‐macromonomer with gelation times varying from a few minutes to a few hours, depending on the temperature and the composition of the prepolymers. With this method it was possible to prepare networks in the form of coatings or films. © 2003 Society of Chemical Industry 相似文献
38.
This paper addresses the problem of power control in a multihop wireless network supporting multicast traffic. We face the problem of forwarding packet traffic to multicast group members while meeting constraints on the signal-to-interference-plus-noise ratio (SINR) at the intended receivers. First, we present a distributed algorithm which, given the set of multicast senders and their corresponding receivers, provides an optimal solution when it exists, which minimizes the total transmit power. When no optimal solution can be found for the given set of multicast senders and receivers, we introduce a distributed, joint scheduling and power control algorithm which eliminates the weak connections and tries to maximize the number of successful multicast transmissions. The algorithm allows the other senders to solve the power control problem and minimize the total transmit power. We show that our distributed algorithm converges to the optimal solution when it exists, and performs close to centralized, heuristic algorithms that have been proposed to address the joint scheduling and power control problem. 相似文献
39.
40.
Resilient optical networks are predominately designed to protect against single failures of fiber links. But in larger networks, operators also see dual failures. As the capacity was planned for single failures, disconnections can occur by dual failures even if enough topological connectivity is provided. In our approach the design of the network minimizes the average loss caused by dual failures, while single failures are still fully survived. High dual failure restorability is the primary aim, capacity is optimized in a second step. For WDM networks with full wavelength conversion, we formulate mixed integer linear programming models for dedicated path protection, shared (backup) path protection, and path rerouting with and without stub-release. For larger problem instances in path rerouting, we propose two heuristics. Computational results indicate that the connectivity is of much more importance for high restorability values than the overall protection capacity. Shared protection has similar restorability levels as dedicated protection while the capacity is comparable to rerouting. Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability. Compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning. 相似文献