首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   16865篇
  免费   1672篇
  国内免费   1529篇
电工技术   1379篇
技术理论   3篇
综合类   2189篇
化学工业   350篇
金属工艺   382篇
机械仪表   830篇
建筑科学   1194篇
矿业工程   298篇
能源动力   166篇
轻工业   195篇
水利工程   334篇
石油天然气   278篇
武器工业   83篇
无线电   3524篇
一般工业技术   1094篇
冶金工业   595篇
原子能技术   16篇
自动化技术   7156篇
  2024年   72篇
  2023年   189篇
  2022年   357篇
  2021年   400篇
  2020年   566篇
  2019年   364篇
  2018年   442篇
  2017年   437篇
  2016年   485篇
  2015年   625篇
  2014年   1129篇
  2013年   1140篇
  2012年   1358篇
  2011年   1372篇
  2010年   1091篇
  2009年   1178篇
  2008年   1293篇
  2007年   1401篇
  2006年   1210篇
  2005年   1141篇
  2004年   926篇
  2003年   735篇
  2002年   543篇
  2001年   414篇
  2000年   354篇
  1999年   217篇
  1998年   143篇
  1997年   110篇
  1996年   92篇
  1995年   66篇
  1994年   65篇
  1993年   33篇
  1992年   17篇
  1991年   13篇
  1990年   13篇
  1989年   11篇
  1988年   7篇
  1987年   5篇
  1986年   7篇
  1985年   4篇
  1984年   4篇
  1982年   4篇
  1981年   6篇
  1980年   5篇
  1979年   2篇
  1973年   3篇
  1958年   2篇
  1957年   2篇
  1956年   2篇
  1955年   2篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
提出了一种基于虚拟实时服务的协议构架,可有效发掘用户提出通信请求之前的“负时间轴”上的空闲时频资源或可再生能源,将用户可能感兴趣的内容以多播的方式预先推送到终端的存储器中,从而以非实时的通信提供虚拟实时服务,在确保服务质量的前提下大幅度提升频谱和能量效率.对终端缓存内容的选择算法进行了标准化,从而允许基站在本地预测用户已缓存的内容,并判断当前是否应发起推送和推送哪条内容;提出了虚拟实时服务涉及的若干关键算法,也给出了虚拟实时服务的演进途径及主要开放问题,旨在为相关新兴产业的技术发展提供参考.  相似文献   
992.
组呼通信在指挥调度中有着重要作用,而在一些地面没有基站的地方,就无法正常使用。卫星通信具有无视地形,通信范围广,不易受陆地灾害影响,易于建设等优点。把卫星通信和组呼通信结合在一起的卫星组呼通信技术兼顾两者的优点,能更好的发挥指挥调度这一作用。当前卫星组呼通信采用固定频率方式,组呼成员在一个频率下进行通信,这种方式实用性不好。本文研究的是移动卫星组呼,在GMR-1系统的基础上研究了卫星组呼通信中MAC层的功能,提出了MAC-Ready-Gcc、MAC-Dedicated-Gcc这两个为了支持组呼的状态,并针对在MAC层发生的PTT竞争提出了一种回退策略。  相似文献   
993.
994.
Multiuser multiple‐input multiple‐output orthogonal frequency division multiple access (MIMO‐OFDMA) is considered as the practical method to attain the capacity promised by multiple antennas in the downlink direction. However, the joint calculation of precoding/beamforming and resource allocation required by the optimal algorithms is computationally prohibitive. This paper proposes computationally efficient resource allocation algorithms that can be invoked after the precoding and beamforming operations. To support stringent and diverse quality of service requirements, previous works have shown that the resource allocation algorithm must be able to guarantee a specific data rate to each user. The constraint matrix defined by the resource allocation problem with these data rate constraints provides a special structure that lends to efficient solution of the problem. On the basis of the standard graph theory and the Lagrangian relaxation, we develop an optimal resource allocation algorithm that exploits this structure to reduce the required execution time. Moreover, a lower‐complexity suboptimal algorithm is introduced. Extensive simulations are conducted to evaluate the computational and system‐level performance. It is shown that the proposed resource allocation algorithms attain the optimal solution at a much lower computational overhead compared with general‐purpose optimization algorithms used by previous MIMO‐OFDMA resource allocation approaches. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   
995.
Vehicular ad hoc networks (VANETs) are witnessing in recent years a rapid development for road transmissions and are considered as one of the most important types of next generation networks, in which drivers can have access anywhere and anytime to information. However, vehicles have to deal with many challenges such as the links failures due to their frequent mobility as well as limited degrees of freedom in their mobility patterns. In this paper, we propose a new quality of service multicast and multipath routing protocol for VANETs, based on the paradigm of bee's communication, called multicast quality of service swarm bee routing for VANETs (MQBV). The MQBV finds and maintains robust routes between the source node and all multicast group members. Therefore, the average end‐to‐end delay and the normalized overhead load should be reduced, while at the same time increasing the average bandwidth and the packet delivery ratio. Extensive simulation results were obtained using ns‐2 simulator in a realistic VANET settings and demonstrated the efficiency of the proposed protocol. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
996.
To provide stable and high data rate wireless access for passengers in the train, it is necessary to properly deploy base stations along the railway. We consider this issue from the perspective of service, which is defined as the integral of the time‐varying instantaneous channel capacity. With large‐scale fading assumption, it will be shown that the total service of each base station is inversely proportional to the velocity of the train. Besides, we find that if the ratio of the service provided by a base station in its service region to its total service is given, the base station interval (i.e., the distance between two adjacent base stations) is a constant regardless of the velocity of the train. On the other hand, if a certain amount of service is required, the interval will increase with the velocity of the train. The aforementioned results apply not only to simple curve rails, like line rail and arc rail, but also to any irregular curve rail, provided that the train is traveling at a constant velocity. Furthermore, the new developed results are applied to analyze the on–off transmission strategy of base stations. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   
997.
Small construction knowledge‐intensive professional service firms (SCKIPSFs) are becoming increasingly important agents of innovation within the construction industry. The nature and process of innovation in SCKIPSFs, however, is generally considered through the constraining prism of research results generated from significantly different contexts, such as from manufacturing sectors or non‐project based firms. A theory of innovation for SCKIPSFs is developed from a longitudinal 22‐month case study of a small architectural practice. Two forms of knowledge‐based innovation were discerned from the empirical work: exploitative innovation and explorative innovation. ‘Explorative innovation’ was found to be located in immediate ‘new’ project domains, and entailed search, variation, experimentation, activity to solve project‐specific problems; while ‘exploitative innovation’ concentrated on developing generic organisational infrastructure to ‘refine’ and ‘improve the efficiency’ of the firm operations to nurture capability for future activity. The key challenge for SCKIPSFs is to develop and manage an appropriate balance between explorative and exploitative innovation over time in order to generate sustainable competitive advantage.  相似文献   
998.
999.
为研究不同裂缝宽度对钢筋混凝土梁抗火性能的影响,以混凝土裂缝最大宽度wmax为损伤指标,制作7个钢筋混凝土梁试件,加静载使其产生最大宽度为0.05 mm、0.10 mm、0.15 mm、0.20 mm、0.25 mm、0.30 mm的裂缝,模拟其正常使用时受力状态,并对其进行火灾试验。试验结果表明:不同试件相同位置测点升温大致相同,但截面历经最高温度相差较大,最大温差达到150℃;裂缝宽度越大,试件最终破坏时历经最高温度越小,挠度增长越快。采用ANSYS有限元软件分析梁截面的温度场分布,结果表明:由于初始损伤的存在,相同截面高度处,不同截面沿跨度方向的温度曲线出现波动,裂缝处尤为明显;同一截面,沿截面高度方向的温度曲线出现平台,且裂缝越宽,平台越长,使得截面高温承载力显著退化。提出了考虑裂缝影响的高温作用下混凝土梁承载力简化计算模型,较未考虑裂缝影响的高温作用下混凝土梁承载力的计算精度提高显著。  相似文献   
1000.
《CoDesign》2013,9(4):275-292
Abstract

It is challenging to design for mutually beneficial relationships in a multi-actor service system when these actors have diverse and conflicting interests, and lack usable methods and tools that support the design process. This study introduces a novel method for co-designing value exchange (COVALENT). COVALENT integrates the value analysis model, co-design strategy and service design tools, to support the conceptualisation of reciprocal value exchanges based on the analysis of and matching between, stakeholders’ needs and resources. Its perceived effectiveness was validated through application to the development of community business models in Ulsan, South Korea. This study contributes to the knowledge of co-design by providing a method for co-designing services that aim to achieve reciprocal value exchanges in the context of community-centred design and by discussing the effectiveness of that method as perceived by users.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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