全文获取类型
收费全文 | 6087篇 |
免费 | 598篇 |
国内免费 | 629篇 |
专业分类
电工技术 | 176篇 |
综合类 | 375篇 |
化学工业 | 147篇 |
金属工艺 | 159篇 |
机械仪表 | 358篇 |
建筑科学 | 366篇 |
矿业工程 | 79篇 |
能源动力 | 76篇 |
轻工业 | 40篇 |
水利工程 | 43篇 |
石油天然气 | 70篇 |
武器工业 | 53篇 |
无线电 | 1039篇 |
一般工业技术 | 217篇 |
冶金工业 | 123篇 |
原子能技术 | 20篇 |
自动化技术 | 3973篇 |
出版年
2024年 | 3篇 |
2023年 | 30篇 |
2022年 | 60篇 |
2021年 | 87篇 |
2020年 | 90篇 |
2019年 | 65篇 |
2018年 | 91篇 |
2017年 | 121篇 |
2016年 | 152篇 |
2015年 | 209篇 |
2014年 | 378篇 |
2013年 | 357篇 |
2012年 | 493篇 |
2011年 | 534篇 |
2010年 | 471篇 |
2009年 | 480篇 |
2008年 | 525篇 |
2007年 | 562篇 |
2006年 | 531篇 |
2005年 | 471篇 |
2004年 | 345篇 |
2003年 | 329篇 |
2002年 | 219篇 |
2001年 | 140篇 |
2000年 | 165篇 |
1999年 | 102篇 |
1998年 | 63篇 |
1997年 | 60篇 |
1996年 | 41篇 |
1995年 | 32篇 |
1994年 | 22篇 |
1993年 | 17篇 |
1992年 | 8篇 |
1991年 | 6篇 |
1990年 | 6篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1973年 | 1篇 |
1963年 | 1篇 |
1962年 | 1篇 |
1958年 | 1篇 |
排序方式: 共有7314条查询结果,搜索用时 31 毫秒
1.
This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency. 相似文献
2.
This research proposes ACARDS (Augmented-Context bAsed RecommenDation Service) framework that is able to utilize knowledge over the Linked Open Data (LOD) cloud to recommend context-based services to users. To improve the level of user satisfaction with the result of the recommendation, the ACARDS framework implements a novel recommendation algorithm that can utilize the knowledge over the LOD cloud. In addition, the noble algorithm is able to use new concepts like the enriched tags and the augmented tags that originate from the hashtags on the SNSs materials. These tags are utilized to recommend the most appropriate services in the user’s context, which can change dynamically. Last but not least, the ACARDS framework implements the context-based reshaping algorithm on the augmented tag cloud. In the reshaping process, the ACARDS framework can recommend the highly receptive services in the users’ context and their preferences. To evaluate the performance of the ACARDS framework, we conduct four kinds of experiments using the Instagram materials and the LOD cloud. As a result, we proved that the ACARDS framework contributes to increasing the query efficiency by reducing the search space and improving the user satisfaction on the recommended services. 相似文献
3.
Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem. 相似文献
4.
Service composition for generic service graphs 总被引:1,自引:0,他引:1
Service composition is a promising approach to multimedia service provisioning, due to its ability to dynamically produce new multimedia content, and to customize the content for individual client devices. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for multimedia services that can be modeled as directed acyclic graphs (DAGs). We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our simulation results show that the algorithm is effective at finding low-cost composition solutions, and can trade off computation overhead for better results. When compared with a hop-by-hop approach for service composition, our algorithm can find composition solutions that aress 10% smaller in cost, even when the hop-by-hop approach uses exhaustive searches. 相似文献
5.
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. 相似文献
6.
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). 相似文献
7.
本文介绍了广东省智能网的组网方案及所能提供的业务,并论述了智能网工程建设,安装维护以及与广东省现有移动通信网联网中存在的一些问题。 相似文献
8.
目前,世界上最大的计算机网络Internet网,已成为通达150多个国家的国际互联网络。作为引导中国计算机用户进入Internet的中国公用计算机互联网CHINANET也正迅速发展。本文就Internet网的服务方式和入网方式进行了综述。 相似文献
9.
湿硫化氢环境下的球罐腐蚀状况分析 总被引:5,自引:0,他引:5
在湿硫化氢环境下 ,尤其储存介质中的硫化氢含量超标时 ,很容易对储存容器壳体 (含焊缝和母材 )造成硫化氢应力腐蚀或氢鼓包。作者较仔细分析了 1 0 0 0m3 丙烯球罐产生硫化氢应力腐蚀开裂和40 0m3 LPG球罐产生氢鼓包的原因。提出了此类设备在设计选材、设备制造、施工安装和使用维护等环节应注意的问题。 相似文献
10.
Matthias Zobel Joachim Denzler Benno Heigl Elmar Nöth Dietrich Paulus Jochen Schmidt Georg Stemmer 《Machine Vision and Applications》2003,14(1):26-34
Abstract. This contribution introduces MOBSY, a fully integrated, autonomous mobile service robot system. It acts as an automatic dialogue-based
receptionist for visitors to our institute. MOBSY incorporates many techniques from different research areas into one working
stand-alone system. The techniques involved range from computer vision over speech understanding to classical robotics.
Along with the two main aspects of vision and speech, we also focus on the integration aspect, both on the methodological
and on the technical level. We describe the task and the techniques involved. Finally, we discuss the experiences that we
gained with MOBSY during a live performance at our institute. 相似文献