首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   107837篇
  免费   9531篇
  国内免费   3777篇
电工技术   5880篇
技术理论   6篇
综合类   8471篇
化学工业   17133篇
金属工艺   5439篇
机械仪表   6275篇
建筑科学   6646篇
矿业工程   2399篇
能源动力   3216篇
轻工业   8761篇
水利工程   1938篇
石油天然气   3819篇
武器工业   693篇
无线电   14349篇
一般工业技术   12976篇
冶金工业   5736篇
原子能技术   1416篇
自动化技术   15992篇
  2025年   74篇
  2024年   1452篇
  2023年   1453篇
  2022年   2381篇
  2021年   3380篇
  2020年   2879篇
  2019年   2540篇
  2018年   2489篇
  2017年   2778篇
  2016年   2757篇
  2015年   3582篇
  2014年   4751篇
  2013年   6135篇
  2012年   6731篇
  2011年   7443篇
  2010年   6691篇
  2009年   6657篇
  2008年   6708篇
  2007年   6332篇
  2006年   6068篇
  2005年   5035篇
  2004年   4227篇
  2003年   3990篇
  2002年   4741篇
  2001年   4080篇
  2000年   2801篇
  1999年   2141篇
  1998年   1897篇
  1997年   1460篇
  1996年   1272篇
  1995年   1084篇
  1994年   834篇
  1993年   662篇
  1992年   507篇
  1991年   424篇
  1990年   393篇
  1989年   304篇
  1988年   274篇
  1987年   233篇
  1986年   160篇
  1985年   180篇
  1984年   150篇
  1983年   107篇
  1982年   89篇
  1981年   78篇
  1980年   101篇
  1979年   63篇
  1978年   68篇
  1977年   70篇
  1976年   91篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
本系统利用工业级摄像头及开发包的机器视觉功能与计算软件编程控制技术相结合,通过与输入控制系统中的标准膜片模板外观品质进行对比,实现高速高效、准确识别检测光学薄膜器件中滤光片的外观缺陷。可在生产线上根据外观品质标准模板中设定的类别进行自动分类装盒。  相似文献   
72.
Share price trends can be recognized by using data clustering methods. However, the accuracy of these methods may be rather low. This paper presents a novel supervised classification scheme for the recognition and prediction of share price trends. We first produce a smooth time series using zero-phase filtering and singular spectrum analysis from the original share price data. We train pattern classifiers using the classification results of both original and filtered time series and then use these classifiers to predict the future share price trends. Experiment results obtained from both synthetic data and real share prices show that the proposed method is effective and outperforms the well-known K-means clustering algorithm.  相似文献   
73.
Yeung DY  Chang H  Dai G 《Neural computation》2008,20(11):2839-2861
In recent years, metric learning in the semisupervised setting has aroused a lot of research interest. One type of semisupervised metric learning utilizes supervisory information in the form of pairwise similarity or dissimilarity constraints. However, most methods proposed so far are either limited to linear metric learning or unable to scale well with the data set size. In this letter, we propose a nonlinear metric learning method based on the kernel approach. By applying low-rank approximation to the kernel matrix, our method can handle significantly larger data sets. Moreover, our low-rank approximation scheme can naturally lead to out-of-sample generalization. Experiments performed on both artificial and real-world data show very promising results.  相似文献   
74.
This article presents a heuristic which combines the orthogonal array experiment technique and an ant direction hybrid differential evolution algorithm (ADHDEOA) for planning of a large-scale passive harmonic filters problem. The addressed problem has a multi-bus and under abundant harmonic current sources in the system. In this study, an orthogonal array is first conducted to obtain the initial solution. Next, an ant direction hybrid differential evolution (ADHDE) is applied to search for a near optimum solution. The objective is to minimize the cost of the filter, the total demand distortion of harmonic currents and the total harmonic distortion of voltages at each bus simultaneously. In order to determine a set of weights of each term in the objective function, the simplest and most efficient form of triangular membership functions has been considered. The designed heuristic ADHDEOA is applied to a practical harmonic problem in a steel plant, and three design schemes are compared to demonstrate the performance of the ADHDEOA.  相似文献   
75.
76.
提出了基于LM3S316实现与PC机通讯的方法.给出了硬件实现及软件设计思想.该方法使用微控制器仿真USB设备,降低了功耗、成本.  相似文献   
77.
The exponential expansion of the Internet and the widespread popularity of the World Wide Web give a challenge to experts on reliable and secure system design, e.g., e-economy applications. New paradigms are on demand and mobile agent technology is one of the features. In this paper, we propose a fault-tolerance execution model by using of mobile agents, for the purpose of consistent and correct performance with a required function under stated conditions for a specified period of time. Failures are classified into two classes based on their intrinsic different effects on mobile agents. For each kind of failure, a specified handling method is adopted. The introduction of exceptional handling method allows performance improvements during mobile agents’ execution. The behaviors of mobile agents are statistically analyzed through several key parameters, including the migration time from node to node, the life expectancy of mobile agents, and the population distribution of mobile agents, to evaluate the performance of our model. The analytical results give new theoretical insights to the fault-tolerant execution of mobile agents and show that our model outperforms the existing fault-tolerant models. Our model provides an effective way to improve the reliability of computer systems.  相似文献   
78.
Previous research has shown that sub-population genetic algorithm is effective in solving the multi-objective combinatorial problems. Based on these pioneering efforts, this paper extends the SPGA algorithm with a global Pareto archive technique and a two-stage approach to solve the multi-objective problems. In the first stage, the areas next to the two single objectives are searched and solutions explored around these two extreme areas are reserved in the global archive for later evolutions. Then, in the second stage, larger searching areas except the middle area are further extended to explore the solution space in finding the near-optimal frontiers. Through extensive experimental results, SPGA II does outperform SPGA, NSGA II, and SPEA 2 in the parallel scheduling problems and knapsack problems; it shows that the approach improves the sub-population genetic algorithm significantly. It may be of interests for researchers in solving multi-objective combinatorial problems.  相似文献   
79.
80.
The information resources on the Web are diversified, the amount of which is increasing rapidly. Demands for selecting useful information from the Internet, managing personal contents, and sharing contents under control have risen. In this study, we propose the Ubiquitous Personal Study, a framework of personalized virtual study to support accessing, managing, organizing, sharing and recommending information. In this paper, we focus on discussing the framework, and design and implementation issues on how to implement it with Web 2.0 mash-up technology and Open Source Software.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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