首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1186篇
  免费   34篇
  国内免费   70篇
电工技术   6篇
综合类   42篇
化学工业   4篇
金属工艺   1篇
机械仪表   11篇
建筑科学   5篇
矿业工程   4篇
能源动力   2篇
轻工业   1篇
石油天然气   1篇
武器工业   3篇
无线电   153篇
一般工业技术   7篇
冶金工业   4篇
自动化技术   1046篇
  2025年   4篇
  2024年   6篇
  2023年   9篇
  2022年   3篇
  2021年   9篇
  2020年   11篇
  2019年   8篇
  2018年   8篇
  2017年   28篇
  2016年   18篇
  2015年   52篇
  2014年   57篇
  2013年   31篇
  2012年   60篇
  2011年   86篇
  2010年   77篇
  2009年   85篇
  2008年   90篇
  2007年   112篇
  2006年   86篇
  2005年   67篇
  2004年   62篇
  2003年   48篇
  2002年   46篇
  2001年   50篇
  2000年   49篇
  1999年   31篇
  1998年   24篇
  1997年   11篇
  1996年   11篇
  1995年   12篇
  1994年   7篇
  1993年   4篇
  1992年   1篇
  1991年   2篇
  1990年   5篇
  1989年   5篇
  1988年   1篇
  1986年   1篇
  1985年   3篇
  1984年   1篇
  1983年   2篇
  1982年   1篇
  1981年   1篇
  1980年   1篇
  1978年   2篇
  1977年   1篇
  1973年   1篇
排序方式: 共有1290条查询结果,搜索用时 15 毫秒
111.
    
Nowadays, the web service has become the emerging communication technology where the interaction of each user is performed through the World Wide Web. However, the performance of the web service mechanism is degraded due to security flaws that occur throughout the Internet.. The user or service requester may not attain the relevant web service for their requirement. To overcome this problem, the newly developed multi-objective based Cuckoo Search (MCS) algorithm is proposed in this article. Initially, the input query model was built by the query keyword that is provided by the service requester. Then, the given query is matched with the database that hosts the web services that relates to input query. Among the various services, the user has to select the appropriate web service using the proposed algorithm. The MCS algorithm is newly designed by combining the Cuckoo Search algorithm and the QoS parameter based multiple objectives. Additionally, the new mathematical model of fitness is evaluated by the multi-objective parameters. Finally, the proposed algorithm exploits the fitness value to select the relevant web service for the user query. The experimental results are validated and performance is analyzed by the parameters of precision, recall, and F-measure. Thus, 86.6% of precision value was obtained by the proposed method, which ensured provision of the appropriate web service.  相似文献   
112.
    
Although nonuniform memory access architecture provides better scalability for multicore systems, cores accessing memory on remote nodes take longer than those accessing on local nodes. Remote memory access accompanied by contention for internode interconnection degrades performance. Properly mapping threads to cores and data accessed to their nodes can substantially improve performance and energy efficiency. However, an operating system kernel's load-balancing activity may migrate threads across nodes, which thus messes up the thread mapping. Besides, subsequent data mapping behavior pays for the cost of page migration to reduce remote memory access. Once unsuitable threads are migrated, it is detrimental to system performance. This paper focuses on improving the kernel's internode load balancing on nonuniform memory access systems. We develop a memory-aware kernel mechanism and policies to reduce remote memory access incurred by internode thread migration. The Linux kernel's load balancing mechanism is modified to incorporate selection policies in the internode thread migration, and the kernel is modified to track the amount of memory used by each thread on each node. With this information, well-designed policies can then choose suitable threads for internode migration. The purpose is to avoid migrating a thread that might incur relatively more remote memory access and page migration. The experimental results show that with our mechanism and the proposed selection policies, the system performance is substantially increased when compared with the unmodified Linux kernel that does not consider memory usage and always migrates the first-fit thread in the runqueue that can be migrated to the target central processing unit.  相似文献   
113.
    
In safety‐critical scenarios, reliable reception of beacons transmitted by a subject vehicle is critical to avoid vehicle collision. According to the employed contention window sizes in IEEE 802.11p, beacons are transmitted with a small contention window size. As a result, multiple vehicles contend for the shared channel access by selecting the same back‐off slot. This is a perfect recipe for synchronous collisions wherein reliable beacon delivery cannot be guaranteed for any vehicle. We consider the problem of selecting the back‐off slots from the current contention window to provide reliable delivery of beacons transmitted by a subject vehicle to its neighbors. Given a safety scenario, we propose a Pseudo‐Random Number Generator (PRNG)‐inspired back‐off selection (PBS) technique. The proposed technique works on the hypothesis that synchronous collisions of beacons transmitted by a subject vehicle can be reduced if all its neighbors select different back‐off slots (ie, not the back‐off slot selected by the subject vehicle). The discrete‐event simulations demonstrate that PBS can increase the overall message reception from a subject vehicle, in comparison with the uniform random probability back‐off selection in IEEE 802.11p.  相似文献   
114.
首先对波长变换器的功能及分类进行详细的论述,然后,对波长变换器的配置进行分析,总结出两种波长变换器配置方法,即独占式配置方法和共享式配置方法.针对独占式配置方法,本文使用仿真实验的方法研究了在不同类型的波长变换器下交换节点丢包性能的差异.本文还对独占式配置方法和共享式配置方法进行对比研究.  相似文献   
115.
This paper introduces an analytical model to investigate the energy efficiency of the IEEE 802.11 distributed coordinated function (DCF). This model not only accounts for the number of contending nodes, the contention window, but also the packet size, and the channel condition. Based on this model, we identify the tradeoff in choosing optimum parameters to optimize the energy efficiency of DCF in the error-prone environment. The effects of contention window and packet size on the energy efficiency are examined and compared for both DCF basic scheme and DCF with four-way handshaking. The maximum energy efficiency can be obtained by combining both the optimal packet size and optimal contention window. To validate our analysis, we have done extensive simulations in ns-2, and simulation results seem to match well with the presented analytical results. The Ohio Board of Regents Doctoral Enhancements Funds and the National Science Foundation under Grant CCR 0113361 have supported this work. Xiaodong Wang received his B.S. degree in communication engineering from Beijing Information Technical Institute of China in 1995, and his M.S. degree in electric engineering from Beijing University of Aeronautics and Astronautics of China in 1998. He joined China Telecom in 1998 where he worked on communication protocols for telecommunication. From June 2000 to July 2002, he worked on GSM base station software development at Bell-labs China, Beijing, China. Currently he is a Ph.D. student in Computer Engineering at University of Cincinnati. His research activities include wireless MAC protocols, energy saving for wireless sensor networks. He is a student member of the IEEE. Jun Yin received the BS degree in automatic control from Dalian Railway Institute of China in 1997, and the MS degree in flight control from Beijing University of Aeronautics and Astronautics of China in 2001. Since 2001 she has been a Ph.D. student in the OBR Research Center for Distributed and Mobile Computing at the University of Cincinnati. Her research interests include performance evaluation of 802.11 MAC protocol, wireless ad hoc networks and sensor networks. She is a student member of the IEEE. Dharma P.Agrawal IEEE Fellow, 1987; ACM Fellow, 1998; AAAS Fellow, 2003 Dr. Agrawal is the Ohio Board of Regents Distinguished Professor of Computer Science and Computer Engineering in the department of Electrical and Computer Engineering and Computer Science, University of Cincinnati, OH. He has been a faculty member at Wayne State University, (1977–1982) and North Carolina State University (1982–1998). He has been a consultant to the General Dynamics Land Systems Division, Battelle, Inc., and the U. S. Army. He has held visiting appointment at AIRMICS, Atlanta, GA, and the AT&T Advanced Communications Laboratory, Whippany, NJ. He has published a number of papers in the areas of Parallel System Architecture, Multi computer Networks, Routing Techniques, Parallelism Detection and Scheduling Techniques, Reliability of Real-Time Distributed Systems, Modeling of C-MOS Circuits, and Computer Arithmetic. His recent research interest includes energy efficient routing, information retrieval, and secured communication in ad hoc and sensor networks, effective handoff handling and multicasting in integrated wireless networks, interference analysis in piconets and routing in scatternet, use of smart directional antennas (multibeam) for enhanced QoS, Scheduling of periodic real-time applications and automatic load balancing in heterogeneous workstation environment. He has four approved patents and three patent filings in the area of wireless cellular networks.  相似文献   
116.
为了及时、全面、准确地记录、统计和评估高等院校科技论文的发表情况 ,我们设计了高校科技论文统计系统 ,该系统通用性好 ,可靠性高 ,功能设计简洁适用 ,具有很好的推广价值。本文从数据库设计、系统模块及功能设计和系统运行环境三个方面概述了该系统的设计思想。  相似文献   
117.
GIS二维、三维空间信息查询功能的实现与应用   总被引:9,自引:0,他引:9  
空间信息查询是GIS中的重要功能之一,因而也是GIS软件开发人员的工作重点之一。从中国大陆岩石圈GIS这一实际应用出发,在分析相关技术的基础上,提出了一套GIS二维和三维空间-属性数据交互查询的实现方法,并将此方法用于GIS软件平台开发,实现了高效的功能。最后给出应用实例,结果证明了这种方法的可行性和实用性。  相似文献   
118.
基于用户查询意图识别的Web搜索优化模型   总被引:2,自引:1,他引:1  
杨艺  周元 《计算机科学》2012,39(1):264-267
在对用户查询意图进行分析分类的基础上,提出了一种Web搜索优化模型。该模型通过识别用户查询意图来查询意图特征词和内容主题词的双重约束,再结合用户查询行为获得查询目标,既保证了用户查询意图的准确匹配,又自动过滤和屏蔽了不相关信息。与相关工作对比,其重点在于准确获取用户查询意图,提高用户满意度。实验结果表明,该模型在实现信息搜索准确性和用户对查询结果满意度方面比传统搜索方法有明显改善。  相似文献   
119.
武彤  赵雪  赵洵 《计算机科学》2012,39(105):315-317
在数据仓库系统中,OLAP查询一般都涉及多表连接和分组聚集两部分操作,提高这些查询的性能成为提高OLAP响应速度的关键。利用实物化视图,可以准确地计算并保存表连接或聚集等耗时较多的操作的结果。研究基于查询频率的实物化视图的更新算法,可以使实物化视图得到最大效率的使用,明显地缩短查询的响应时间,从而提高OLAP的查询效率。  相似文献   
120.
王树西 《计算机科学》2012,39(7):165-169
在传统的集合运算过程中,集合内的元素一般通过自然语言表示,而不是形式化表示,这就在计算机处理时影响了集合运算的效率。为了解决这个问题,将二进制引入到集合运算过程中,提出集合特征码的概念,并定义了一系列的集合特征码运算规则,从而形成了一个较为完备的、形式化的集合特征码运算体系。在上述集合特征码的理论体系下,提出一系列的相关算法,从而在算法的层次上实现了集合特征码的理论体系。实验结果表明,通过集合特征码理论及相关算法,集合运算可以通过0、1运算快速实现,并且其成功实现了数据库中的查询操作。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号