首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14311篇
  免费   1226篇
  国内免费   492篇
电工技术   742篇
综合类   554篇
化学工业   2620篇
金属工艺   606篇
机械仪表   788篇
建筑科学   749篇
矿业工程   236篇
能源动力   560篇
轻工业   1137篇
水利工程   241篇
石油天然气   298篇
武器工业   98篇
无线电   2100篇
一般工业技术   2382篇
冶金工业   844篇
原子能技术   162篇
自动化技术   1912篇
  2024年   51篇
  2023年   231篇
  2022年   409篇
  2021年   592篇
  2020年   488篇
  2019年   429篇
  2018年   452篇
  2017年   492篇
  2016年   532篇
  2015年   573篇
  2014年   788篇
  2013年   1058篇
  2012年   1058篇
  2011年   1074篇
  2010年   859篇
  2009年   824篇
  2008年   827篇
  2007年   722篇
  2006年   587篇
  2005年   540篇
  2004年   393篇
  2003年   358篇
  2002年   382篇
  2001年   322篇
  2000年   236篇
  1999年   227篇
  1998年   321篇
  1997年   211篇
  1996年   191篇
  1995年   125篇
  1994年   94篇
  1993年   94篇
  1992年   56篇
  1991年   52篇
  1990年   38篇
  1989年   38篇
  1988年   31篇
  1987年   30篇
  1986年   19篇
  1985年   28篇
  1984年   24篇
  1983年   23篇
  1982年   17篇
  1981年   15篇
  1980年   20篇
  1979年   13篇
  1978年   14篇
  1977年   12篇
  1976年   16篇
  1970年   7篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
241.
An efficient scheme is proposed for generating n-qubit Greenberger–Horne–Zeilinger states of n superconducting qubits separated by (\(n-1\)) coplanar waveguide resonators capacitively via adiabatic passage with the help of quantum Zeno dynamics in one step. In the scheme, it is not necessary to precisely control the time of the whole operation and the Rabi frequencies of classical fields because of the introduction of adiabatic passage. The numerical simulations for three-qubit Greenberger–Horne–Zeilinger state show that the scheme is insensitive to the dissipation of the resonators and the energy relaxation of the superconducting qubits. The three-qubit Greenberger–Horne–Zeilinger state can be deterministically generated with comparatively high fidelity in the current experimental conditions, though the scheme is somewhat sensitive to the dephasing of superconducting qubits.  相似文献   
242.
现在北京地铁1号线、5号线、13号线等已均已开始实施"人物同检",《北京市轨道交通运营安全条例(草案)》拟规定,轨道交通进站乘车人员及其携带物品均在安全检查实施之列,由安全检查单位依照规定实施。但是2014年5月25日北京市人大常委会审议(草案)时表示,"人物同检"的安全性与轨道交通的快捷性和高效性之间存在矛盾,建议进行更深入研究。CF-1型背散射人体安检仪的研发可在一定程度上避免"人物同检"的弊端,为地铁实行人物同检带来更多的可能性。  相似文献   
243.
This study examined the effects of review valence, the reviewer profile, and the receiver's familiarity with the platform (user/nonuser) on the perceived credibility of a review on Yelp.com and on the receiver's attitude toward the reviewed object. The results demonstrated a difference in cue‐taking between users and nonusers. For users, there was an interaction effect of 2 profile cues (number of friends and number of reviews) on competence. Users interpreted the cues in combination, whereas non‐users were not influenced by them. The friends × reviews × platform familiarity interaction indirectly affected attitude through competence. Further, review valence was positively associated with perceived credibility and attitude. The findings support and extend the social information processing theory and cue combination literature.  相似文献   
244.
Activiti 是用于管理业务流程的工作流引擎,它的使用降低了复杂业务流程开发与维护的难度。但在实际应用中,流程节点无法自由跳转,给管理和使用带来诸多不便。本文研究了 Activiti 中的系统框架和接口,基于现有接口设计实现了流程节点自由跳转功能,并进行了框架整合。测试结果表明,该功能满足各项既定功能需求,具有一般性,可满足实际工作中相关要求。  相似文献   
245.
剖析河流水质模型1号(RWQM1)的建模背景、设计思路、基本框架与建模方法,认为RWQM1从技术层面和建模方法上对当前水质模型进行了重大调整,提供了全新的水质模型框架,作为未来水质建模的科学标准,RWQM1的标准化设计思路包括:1较全面地划分水质组分,统一水质组分的表述方式;2基于严格的化学计量方程实现对水质转化过程及其动力学的数学描述,确保反应物、产物的物质守恒;3将各种水质过程通过化学计量矩阵的形式实现模型的结构化表达。结构化的思路使得RWQM1水质模型具有灵活、适用性广等特点,但过于复杂的状态变量、缺乏强大的软件平台等问题,在一定程度上限制了RWQM1水质模型的推广。  相似文献   
246.
247.
248.
Feasible clinical application of any automated segmenting methodology demands more than just accuracy. Amendment to the automated delineation is necessary when the algorithm fails, however, integrated solution to such a scenario is largely absent in literature. Hence in this survey we devised an architecture that does both the automated and interactive lung field localizations using a single segmenting engine—random walker algorithm—so that intuitive amendment is only necessary when the automated generated delineation is unsatisfactory. The algorithm proceeds by first extracting 18 intensity profiles running horizontally, each of them equally spacing apart, and in each intensity profile three extreme points denoting the two lungs and the esophagus are determined through profile matching. This done, the algorithm removes profiles that do not intersect with the lung, and the rest of the extreme points are plugged into random walker algorithm to perform segmentation. The achieved accuracy in localization by the above was 0.8875 in terms of overlap measure (the maximum value for this parameter is 1) over 341 images. In the case where unsatisfactory delineation prompts amendment necessary, the user can interactively segment the lung by just a shift on some of the previous-determined points to the desired locations, and random walker algorithm is run again with the amended input. By such a fusion, the benefits of both the automated and interactive segmentation are shared in a single architecture.  相似文献   
249.
We propose a measurement feedback controller for a class of feedforward nonlinear systems under sensor noise. The sensor noise has unknown magnitude, frequency, and phase. Our proposed controller is coupled with a low‐pass filter in such a way that the sensor noise is attenuated. We show that the controlled system results in bounded states whose ultimate bounds are inversely proportional to the minimum frequency of the sensor noise. Our result is further generalized to work in a case where the sensor noise is only required to have a Fourier transform with finite energy. Moreover, if the sensor noise enters only at partial states, depending on the location of the sensor noise, the ultimate bounds of the particular states can be made arbitrarily small via the gain factor of the controller. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   
250.
We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a priori information: the total processing time, the largest processing time, the combination of the previous two or the optimal makespan. We propose a new algorithm that can be applied to the problem with the known total or largest processing time and prove that it has improved competitive ratios for the cases with a small number of machines. Improved lower bounds of the competitive ratio are also provided by presenting adversary lower bound examples.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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