首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   79712篇
  免费   9866篇
  国内免费   7524篇
工业技术   97102篇
  2024年   396篇
  2023年   1182篇
  2022年   2290篇
  2021年   2772篇
  2020年   2949篇
  2019年   2330篇
  2018年   2121篇
  2017年   2624篇
  2016年   2939篇
  2015年   3324篇
  2014年   5192篇
  2013年   4918篇
  2012年   5954篇
  2011年   6266篇
  2010年   4824篇
  2009年   4836篇
  2008年   5227篇
  2007年   5987篇
  2006年   5046篇
  2005年   4612篇
  2004年   4025篇
  2003年   3359篇
  2002年   2630篇
  2001年   2043篇
  2000年   1753篇
  1999年   1290篇
  1998年   1023篇
  1997年   896篇
  1996年   728篇
  1995年   664篇
  1994年   528篇
  1993年   395篇
  1992年   325篇
  1991年   269篇
  1990年   204篇
  1989年   175篇
  1988年   147篇
  1987年   119篇
  1986年   97篇
  1985年   125篇
  1984年   98篇
  1983年   96篇
  1982年   70篇
  1981年   43篇
  1980年   28篇
  1979年   41篇
  1978年   14篇
  1977年   24篇
  1976年   17篇
  1975年   10篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.  相似文献   
62.
A Search for Hidden Relationships: Data Mining with Genetic Algorithms   总被引:1,自引:0,他引:1  
This paper presents an algorithm that permits the search for dependencies among sets of data (univariate or multivariate time-series, or cross-sectional observations). The procedure is modeled after genetic theories and Darwinian concepts, such as natural selection and survival of the fittest. It permits the discovery of equations of the data-generating process in symbolic form. The genetic algorithm that is described here uses parts of equations as building blocks to breed ever better formulas. Apart from furnishing a deeper understanding of the dynamics of a process, the method also permits global predictions and forecasts. The algorithm is successfully tested with artificial and with economic time-series and also with cross-sectional data on the performance and salaries of NBA players during the 94–95 season.  相似文献   
63.
Effective management of construction projects depends on good access to and control of data, especially data pertaining to cost and schedule control functions. However, the proper design and development of automated mechanisms have not had the facility to acquire and store quality data in a timely manner. The purpose of this paper, then, is to discuss a prototype, automated data acquisition system that was developed to support an integrated project management system. The data acquisition system is composed of an integrated set of electronic forms used in conjunction with a bar coding data-entry tool.  相似文献   
64.
本文分析讨论了在MS-Windows操作系统下的应用程序间的数据交换的概念及方法,并给出了这些方法的选用策略。这些方法包括裁剪板,动态数据交换(DDE),对象的连接及嵌入(OLE),动态连接库(DLL)。  相似文献   
65.
The analysis of recently collected wind data at five sites in Saudi Arabia namely, Dhulum, Arar, Yanbu, Gassim and Dhahran is presented. The five sites represent different geographically and climatologically conditions. The data collected over a period spanned between 1995 and 2002 with different collection periods for each site. Daily, monthly and frequency profiles of the wind speed at the sites showed that Dhulum and Arar sites have higher wind energy potential with annual wind speed average of 5.7 and 5.4 m/s and speeds higher than 5 m/s for 60 and 47% of the time, respectively. The two sites are candidates for remote area wind energy applications. The costal site's, i.e. Yanbu and Dhahran wind speed data indicated that the two sites have lower annual wind speed averages and wind blows at speed higher than 5 m/s during afternoon hours. That makes the two sites candidates for grid connected wind systems for electrical load peak shaving. The data of Gassim site showed that the site has the lowest wind energy potential compared to the others. The annual energy produced by a Nordex N43 wind machine is estimated to be 1080, 990, 730, 454 and 833 MWh for Dhulum, Arar, Yanbu, Gassim and Dhahran, respectively. The analysis showed that the estimated annual energy produced by the machine based on 10 min averaged data is 2.5% higher than the estimated energy based on 30 min averaged data.  相似文献   
66.
工程应用中软件工具的多样性和设计活动的分散性形成了大量异构数据。本文分析了传统的异构数据管理方法的不足,提出使用数据库系统的文件系统结合的管理方法。针对此方法下所形成的异构数据源问题,给出了基于J2EE规范的数据访问对象抽象工厂解决方案。  相似文献   
67.
68.
基于中间件技术的HTML业务系统设计与实现   总被引:1,自引:0,他引:1  
介绍了欧洲的MHP标准,并在HTML技术方面提出了改进方案。在此方案的基础上设计了一个基于HTML的从前端数据封装到终端数据接收的完整业务系统,并对其应用前景提出了一些看法。  相似文献   
69.
从数据结构角度为旅游胜地设计导游系统。向游人提供景点的信息查询服务,根据指定的景点提供相关的景点信息。任意给定起点和终点,查询两点之间的最短路径。  相似文献   
70.
Non-redundant data clustering   总被引:6,自引:6,他引:0  
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel, previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and computer vision.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号