首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3224篇
  免费   144篇
  国内免费   17篇
电工技术   47篇
综合类   13篇
化学工业   522篇
金属工艺   64篇
机械仪表   88篇
建筑科学   135篇
矿业工程   1篇
能源动力   101篇
轻工业   190篇
水利工程   27篇
石油天然气   7篇
无线电   586篇
一般工业技术   574篇
冶金工业   496篇
原子能技术   13篇
自动化技术   521篇
  2024年   6篇
  2023年   19篇
  2022年   37篇
  2021年   65篇
  2020年   41篇
  2019年   55篇
  2018年   71篇
  2017年   65篇
  2016年   72篇
  2015年   63篇
  2014年   97篇
  2013年   202篇
  2012年   130篇
  2011年   168篇
  2010年   131篇
  2009年   154篇
  2008年   175篇
  2007年   187篇
  2006年   152篇
  2005年   122篇
  2004年   113篇
  2003年   104篇
  2002年   98篇
  2001年   71篇
  2000年   67篇
  1999年   74篇
  1998年   163篇
  1997年   120篇
  1996年   85篇
  1995年   54篇
  1994年   62篇
  1993年   47篇
  1992年   20篇
  1991年   17篇
  1990年   22篇
  1989年   37篇
  1988年   26篇
  1987年   23篇
  1986年   33篇
  1985年   25篇
  1984年   20篇
  1983年   10篇
  1982年   9篇
  1981年   11篇
  1980年   8篇
  1979年   4篇
  1978年   7篇
  1977年   11篇
  1976年   12篇
  1973年   5篇
排序方式: 共有3385条查询结果,搜索用时 15 毫秒
101.
102.
Universal Access in the Information Society - In recent years, researchers have attempted to shift patient decision aids (PDAs) from paper-based to web-based to increase its accessibility. Insulin...  相似文献   
103.
Customer Retention via Data Mining   总被引:6,自引:0,他引:6  
``Customer Retention' is an increasingly pressing issue intoday's ever-competitive commercial arena. This is especially relevantand important for sales and services related industries. Motivated by areal-world problem faced by a large company, we proposed a solution thatintegrates various techniques of data mining, such as featureselection via induction, deviation analysis, and mining multipleconcept-level association rules to form an intuitive and novel approachto gauging customer loyalty and predicting their likelihood ofdefection. Immediate action triggered by these ``early-warnings'resulting from data mining is often the key to eventual customerretention.  相似文献   
104.
Once segmentation of 3D surface data of a rock pile has been performed, the next task is to determine the visibility of the surface rocks. A region boundary-following algorithm that accommodates irregularly spaced 3D coordinate data is presented for determining this visibility. We examine 3D surface segmentations of laboratory rock piles and determine which regions in the segmentation correspond to entirely visible rocks, and which correspond to overlapped or partially visible rocks. This is a significant distinction as it allows accurate size determination of entirely visible rocks, separate handling of partially visible rocks, and prevents erroneous bias resulting from mishandling partially visible rocks as smaller entirely visible rocks. Literature review indicates that other rock pile sizing techniques fail to make this distinction. The rock visibility results are quantified by comparison to manual surface classifications of the laboratory piles and the size results are quantified by comparison to the sieve size.  相似文献   
105.
Liu F  Quek C  Ng GS 《Neural computation》2007,19(6):1656-1680
There are two important issues in neuro-fuzzy modeling: (1) interpretability--the ability to describe the behavior of the system in an interpretable way--and (2) accuracy--the ability to approximate the outcome of the system accurately. As these two objectives usually exert contradictory requirements on the neuro-fuzzy model, certain compromise has to be undertaken. This letter proposes a novel rule reduction algorithm, namely, Hebb rule reduction, and an iterative tuning process to balance interpretability and accuracy. The Hebb rule reduction algorithm uses Hebbian ordering, which represents the degree of coverage of the samples by the rule, as an importance measure of each rule to merge the membership functions and hence reduces the number of the rules. Similar membership functions (MFs) are merged by a specified similarity measure in an order of Hebbian importance, and the resultant equivalent rules are deleted from the rule base. The rule with a higher Hebbian importance will be retained among a set of rules. The MFs are tuned through the least mean square (LMS) algorithm to reduce the modeling error. The tuning of the MFs and the reduction of the rules proceed iteratively to achieve a balance between interpretability and accuracy. Three published data sets by Nakanishi (Nakanishi, Turksen, & Sugeno, 1993), the Pat synthetic data set (Pal, Mitra, & Mitra, 2003), and the traffic flow density prediction data set are used as benchmarks to demonstrate the effectiveness of the proposed method. Good interpretability, as well as high modeling accuracy, are derivable simultaneously and are suitably benchmarked against other well-established neuro-fuzzy models.  相似文献   
106.
In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an time dynamic programming algorithm and an time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of distinct release dates and P is the sum of the setup times of all the families and the processing times of all the jobs. We further give a heuristic with a performance ratio 2. We also give a polynomial-time approximation scheme (PTAS) for the problem.  相似文献   
107.
With the increasing importance of XML, LDAP directories, and text-based information sources on the Internet, there is an ever-greater need to evaluate queries involving (sub)string matching. In many cases, matches need to be on multiple attributes/dimensions, with correlations between the multiple dimensions. Effective query optimization in this context requires good selectivity estimates. In this paper, we use pruned count-suffix trees (PSTs) as the basic data structure for substring selectivity estimation. For the 1-D problem, we present a novel technique called MO (Maximal Overlap). We then develop and analyze two 1-D estimation algorithms, MOC and MOLC, based on MO and a constraint-based characterization of all possible completions of a given PST. For the k-D problem, we first generalize PSTs to multiple dimensions and develop a space- and time-efficient probabilistic algorithm to construct k-D PSTs directly. We then show how to extend MO to multiple dimensions. Finally, we demonstrate, both analytically and experimentally, that MO is both practical and substantially superior to competing algorithms. Received April 28, 2000 / Accepted July 11, 2000  相似文献   
108.
109.
A laser induced fluorescence system, in combination with a glass-frit nebulizer and a photo-voltaic cell detector, is described for single molecule detection. The glass-frit nebulizer continuously generates a large number of droplets with an average droplet size of three micrometers in diameter. Rhodamine 6G molecules were detected at the 10(-12) M level. Concentrations 10(-12)-10(-10) M would provide mostly single molecules (0, 1, 2, 3, ...) in the individual droplets, as determined by Poisson distribution.  相似文献   
110.
In recent years, there has been much debate about the concept of digital natives, in particular the differences between the digital natives' knowledge and adoption of digital technologies in informal versus formal educational contexts. This paper investigates the knowledge about educational technologies of a group of undergraduate students studying the course Introduction to eLearning at a university in Australia and how they adopt unfamiliar technologies into their learning. The study explores the 'digital nativeness' of these students by investigating their degree of digital literacy and the ease with which they learn to make use of unfamiliar technologies. The findings show that the undergraduates were generally able to use unfamiliar technologies easily in their learning to create useful artefacts. They need, however to be made aware of what constitutes educational technologies and be provided with the opportunity to use them for meaningful purposes. The self-perception measures of the study indicated that digital natives can be taught digital literacy.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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