首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   62043篇
  免费   6657篇
  国内免费   4073篇
电工技术   5465篇
技术理论   3篇
综合类   5263篇
化学工业   8805篇
金属工艺   3734篇
机械仪表   4222篇
建筑科学   5301篇
矿业工程   1628篇
能源动力   1810篇
轻工业   4694篇
水利工程   1492篇
石油天然气   2653篇
武器工业   699篇
无线电   7713篇
一般工业技术   6845篇
冶金工业   2082篇
原子能技术   830篇
自动化技术   9534篇
  2024年   309篇
  2023年   1014篇
  2022年   2066篇
  2021年   2957篇
  2020年   2190篇
  2019年   1691篇
  2018年   1747篇
  2017年   2006篇
  2016年   1881篇
  2015年   2657篇
  2014年   3314篇
  2013年   3902篇
  2012年   4728篇
  2011年   4905篇
  2010年   4429篇
  2009年   4352篇
  2008年   4396篇
  2007年   3931篇
  2006年   3718篇
  2005年   2979篇
  2004年   2143篇
  2003年   1854篇
  2002年   2159篇
  2001年   1910篇
  2000年   1427篇
  1999年   1014篇
  1998年   642篇
  1997年   538篇
  1996年   435篇
  1995年   349篇
  1994年   267篇
  1993年   192篇
  1992年   169篇
  1991年   121篇
  1990年   84篇
  1989年   79篇
  1988年   55篇
  1987年   43篇
  1986年   20篇
  1985年   21篇
  1984年   14篇
  1983年   7篇
  1982年   15篇
  1981年   10篇
  1980年   14篇
  1979年   6篇
  1976年   2篇
  1974年   1篇
  1959年   5篇
  1951年   5篇
排序方式: 共有10000条查询结果,搜索用时 265 毫秒
981.
This article presents a report on APNOMS2015, which was held August 19–21, 2015 in Busan, Korea. The theme of APNOMS2015 was “Managing a Very Connected World.”  相似文献   
982.
983.
Aggregate similarity search, also known as aggregate nearest-neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects, it retrieves from a database the objects most similar to Q, where the similarity is an aggregation (e.g., \({{\mathrm{sum}}}\), \(\max \)) of the distances between each retrieved object p and all the objects in Q. In this paper, we propose an added flexibility to the query definition, where the similarity is an aggregation over the distances between p and any subset of \(\phi M\) objects in Q for some support \(0< \phi \le 1\). We call this new definition flexible aggregate similarity search and accordingly refer to a query as a flexible aggregate nearest-neighbor ( Fann ) query. We present algorithms for answering Fann queries exactly and approximately. Our approximation algorithms are especially appealing, which are simple, highly efficient, and work well in both low and high dimensions. They also return near-optimal answers with guaranteed constant-factor approximations in any dimensions. Extensive experiments on large real and synthetic datasets from 2 to 74 dimensions have demonstrated their superior efficiency and high quality.  相似文献   
984.
Display technologies are used in various industries. However, few studies on color vision testing using self‐luminous displays are reported. In this study, a screen‐based color vision test, termed the digital color vision test (DCVT), is developed on a color‐calibrated monitor. A control bar is adjusted by the observer to build just noticeable chromatic difference ellipses in CIE u′v′ chromaticity diagram, which indicate the capabilities of subjects' color visions. Ten color‐normal observers and 13 deutan observers participated in the psychophysical experiments. The observers also performed the other two typical diagnostic tests (D‐15 and anomaloscope). Results from the experiment using the adjustment psychophysical method for digital quantification of deutan color vision defects are presented. It is found that the diagnosis accuracy of the DCVT is approximately equivalent to those of D‐15 and anomaloscope tests.  相似文献   
985.
986.
Multi-agent technologies have been widely employed for the development of web-based systems, including web-based e-markets, web-based grid computing, e-governments and service-oriented software systems. In these service-oriented systems, service provider agents and service consumer agents are autonomous and rational entities, which can enter and leave the environments freely. For simplicity, we use terms ‘provider’ and ‘consumer’ to represent this two types of agents. How to select the most suitable service providers according to a service request from a consumer in such an open environment is a very challenging issue. In this paper, we propose an innovative trust model, called the GTrust model, for service group selection in general service-oriented environments. In the GTrust model, the trust evaluation for a service group is based on the functionality coverage of the group, the dependency relationships among individual services in the group, the ratings of individual services on the attributes of the service request and a similarity measurement of the extent to which reference reports can reflect the service request in terms of the priority distribution of attributes. The experimental results and analysis demonstrate the good performance of the GTrust model on the service group selection in service-oriented environments.  相似文献   
987.
This paper proposes a robust adaptive dynamic surface control (DSC) scheme for a class of time‐varying delay systems with backlash‐like hysteresis input. The main features of the proposed DSC method are that 1) by using a transformation function, the prescribed transient performance of the tracking error can be guaranteed; 2) by estimating the norm of the unknown weighted vector of the neural network, the computational burden can be greatly reduced; 3) by using the DSC method, the explosion of complexity problem is eliminated. It is proved that the proposed scheme guarantees all the closed‐loop signals being uniformly ultimately bounded. The simulation results show the validity of the proposed control scheme.  相似文献   
988.
This paper investigates the consensus problem of second‐order Markovian jump multi‐agent systems with delays. Both network‐induced random delay and node‐induced state delay are considered, where the network‐induced random delay, subjected to a Markov chain, exists in the switching signal and the node‐induced state delay, related to switching topologies, is heterogeneous between any two linked agents. In order to reduce communication and control energy, an impulsive protocol is proposed, where each agent only can get delayed relative positions to neighbors and the velocity of itself at impulsive instants. By performing three steps of model transformation and introducing a mapping for two independent Markov chains, the consensus problem of the original continuous‐time system is equivalent to the stability problem of a discrete‐time expand error system with two Markovian jumping parameters and a necessary and sufficient criterion is derived. A numerical example is given to illustrate the effectiveness of the theoretical result.@@@@This work is supported by the National Natural Science Foundation of China under Grants 61374171, 61572210, and 51537003, the Fundamental Research Funds for the Central Universities (2015TS030), and the Program for Changjiang Scholars and Innovative Research Team in University (IRT1245).  相似文献   
989.
990.
随着我国工业生产行业的快速发展,人工上料越来越难以适应,为解决工业生产线生产效率不高,人工成本过大,智能化不足等问题;基于国内外现有工件定位方法的研究,采用机器视觉对工件定位进行研究,利用工业相机采集图像信息,上传到PC端中 NI Vision软件进行图像预处理、边缘检测,并基于边缘检测结果提取质心点,然后利用坐标转换算法,获得对应世界坐标系下的坐标值,通过通信单元传送给机器人控制系统,控制机器手移动;经验证,算法不仅稳定可靠,而且易于修改,所得结果精度相对较高。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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