首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   89180篇
  免费   7944篇
  国内免费   4198篇
电工技术   5454篇
技术理论   14篇
综合类   6300篇
化学工业   14549篇
金属工艺   4691篇
机械仪表   5290篇
建筑科学   7064篇
矿业工程   2554篇
能源动力   2622篇
轻工业   6744篇
水利工程   1806篇
石油天然气   4622篇
武器工业   733篇
无线电   10827篇
一般工业技术   10853篇
冶金工业   4337篇
原子能技术   923篇
自动化技术   11939篇
  2024年   432篇
  2023年   1584篇
  2022年   2818篇
  2021年   3884篇
  2020年   3049篇
  2019年   2397篇
  2018年   2771篇
  2017年   2917篇
  2016年   2796篇
  2015年   3595篇
  2014年   4501篇
  2013年   5205篇
  2012年   5790篇
  2011年   6246篇
  2010年   5287篇
  2009年   4897篇
  2008年   4917篇
  2007年   4481篇
  2006年   4274篇
  2005年   3653篇
  2004年   2776篇
  2003年   2587篇
  2002年   2515篇
  2001年   2230篇
  2000年   2177篇
  1999年   2372篇
  1998年   1967篇
  1997年   1604篇
  1996年   1611篇
  1995年   1308篇
  1994年   1118篇
  1993年   776篇
  1992年   621篇
  1991年   452篇
  1990年   388篇
  1989年   347篇
  1988年   251篇
  1987年   171篇
  1986年   122篇
  1985年   89篇
  1984年   65篇
  1983年   44篇
  1982年   60篇
  1981年   38篇
  1980年   35篇
  1979年   14篇
  1977年   9篇
  1976年   13篇
  1974年   11篇
  1973年   9篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
291.
B-spline curve extension is an important operation in computer aided design systems. In this paper, we present a new extension algorithm for B-spline curves. The algorithm uses curve unclamping to generate a uniform B-spline curve segment from the original curve and gradually extends the segment to pass through every target point. Algorithms of uniform B-spline curves are used such that our algorithm has a low time cost and can easily handle arbitrary-order derivative constraints at the target points. Generalization for non-uniform rational B-spline curve extension is also discussed, and examples show the efficiency of our method.  相似文献   
292.
This paper considers a unicast multiuser multiple-input single-output (MISO) downlink system overheard by multiple single-antenna eavesdroppers. The objective is to jointly design the beamforming vectors and the artificial noise (AN) covariance matrix with imperfect channel state information (CSI) at the transmitter, such that the total transmit power is minimized while satisfying probabilistic quality of service (QoS) constraints at legitimate users and the eavesdroppers. Using Bernstein-type inequalities and the S-procedure, we recast the non-convex power minimization problem as two different convex semidefinite programs (SDPs) which can be solved using interior-point methods. Simulation results show that the proposed methods outperform a nonrobust method and the ones using the isotropic AN.  相似文献   
293.
The Session Initiation Protocol (SIP) as the core signaling protocol for multimedia services is receiving much attention. Authentication is becoming increasingly crucial issue when a user asks to use SIP services. Many authentication schemes for the SIP have been proposed. Very recently, Zhang et al. has presented an authentication scheme for SIP and claimed their scheme could overcome various attacks while maintaining efficiency. In this research, we illustrate that their scheme is susceptible to the insider attack and does not provide proper mutual authentication. We then propose a modified secure mutual authentication scheme to conquer the security flaws in Zhang et al.’s scheme. Through the informal and formal security analyses, we demonstrate that our scheme is resilient possible known attacks including the attacks found in Zhang et al.’s scheme. In addition, the performance analysis shows that our scheme has better efficiency in comparison with other related ECC-based authentication schemes for SIP.  相似文献   
294.
A co-location pattern is a set of spatial features whose instances frequently appear in a spatial neighborhood. This paper efficiently mines the top-k probabilistic prevalent co-locations over spatially uncertain data sets and makes the following contributions: 1) the concept of the top-k probabilistic prevalent co-locations based on a possible world model is defined; 2) a framework for discovering the top-k probabilistic prevalent co-locations is set up; 3) a matrix method is proposed to improve the computation of the prevalence probability of a top-k candidate, and two pruning rules of the matrix block are given to accelerate the search for exact solutions; 4) a polynomial matrix is developed to further speed up the top-k candidate refinement process; 5) an approximate algorithm with compensation factor is introduced so that relatively large quantity of data can be processed quickly. The efficiency of our proposed algorithms as well as the accuracy of the approximation algorithms is evaluated with an extensive set of experiments using both synthetic and real uncertain data sets.  相似文献   
295.
针对提升电-机械转换器快速响应特性的技术需求,提出了新型三线圈结构电-机械转换器。通过建立的电-机械转换器数学模型,提出采用细菌觅食算法来寻找时间最优解,并基于此方法设计了砰-砰与比例-积分双模控制器。分析与仿真结果表明,相对于传统单线圈电-机械转换器,采用双模控制器的三线圈电-机械转换器,其响应时间从8.5 ms缩短至2.5 ms,震荡和超调不超过5%,可知该技术能够实现响应特性,前景良好。  相似文献   
296.
Lin  Hongwei  Wang  Zihao  Feng  Panpan  Lu  Xingjiang  Yu  Jinhui 《计算可视媒体(英文)》2016,2(4):329-342
Computational Visual Media - Visual curve completion is a fundamental problem in understanding the principles of the human visual system. This problem is usually divided into two problems: a...  相似文献   
297.
介绍了曼维莱水电站枢纽布置设计及优化过程,在合同方案基础上,根据最新的补充勘测资料及多方案研究对比,对坝线选择、引水发电系统方案选择和厂区枢纽布置及优化设计工作做了详细的介绍,可供同类工程参考。  相似文献   
298.
299.
300.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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