首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22393篇
  免费   3284篇
  国内免费   2267篇
工业技术   27944篇
  2024年   62篇
  2023年   218篇
  2022年   557篇
  2021年   803篇
  2020年   974篇
  2019年   641篇
  2018年   638篇
  2017年   685篇
  2016年   805篇
  2015年   872篇
  2014年   1557篇
  2013年   1276篇
  2012年   1998篇
  2011年   1888篇
  2010年   1473篇
  2009年   1621篇
  2008年   1753篇
  2007年   1836篇
  2006年   1620篇
  2005年   1402篇
  2004年   1190篇
  2003年   1131篇
  2002年   720篇
  2001年   515篇
  2000年   433篇
  1999年   306篇
  1998年   229篇
  1997年   140篇
  1996年   128篇
  1995年   114篇
  1994年   102篇
  1993年   76篇
  1992年   53篇
  1991年   46篇
  1990年   15篇
  1989年   13篇
  1988年   16篇
  1987年   14篇
  1986年   5篇
  1984年   2篇
  1983年   1篇
  1981年   2篇
  1979年   1篇
  1966年   1篇
  1964年   2篇
  1963年   2篇
  1960年   3篇
  1959年   1篇
  1955年   2篇
  1954年   1篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
The users' interest can be mined from the web cache and can be used widely. The interest can be specialized by the two-tuple (term, weight) in the simple interest model, in which the association relations are not mined, and then the interest cannot be associated in expressing the users' interest. Based on analyzing the WWW cache model, this letter brings forward a two-dimensional interest model and gives the interrelated methods on how to store the two-dimensional interest model effectively.  相似文献   
2.
We compare two link analysis ranking methods of web pages in a site. The first, called Site Rank, is an adaptation of PageRank to the granularity of a web site and the second, called Popularity Rank, is based on the frequencies of user clicks on the outlinks in a page that are captured by navigation sessions of users through the web site. We ran experiments on artificially created web sites of different sizes and on two real data sets, employing the relative entropy to compare the distributions of the two ranking methods. For the real data sets we also employ a nonparametric measure, called Spearman's footrule, which we use to compare the top-ten web pages ranked by the two methods. Our main result is that the distributions of the Popularity Rank and Site Rank are surprisingly close to each other, implying that the topology of a web site is very instrumental in guiding users through the site. Thus, in practice, the Site Rank provides a reasonable first order approximation of the aggregate behaviour of users within a web site given by the Popularity Rank.  相似文献   
3.
刘虹,湘西之子,亿万富翁。在“湘酒鬼”“迷途”之际,以3.5亿元民营资本入主“湘酒鬼”,担负起“扭转乾坤”的使命,可谓“玩家”大手笔。然“醉翁”之意本在酒、在振兴湘酒、振兴湘西。上任伊始,战略目标既定:一要制订发展远景规划,二要培养高素质的营销管理队伍,三要制订有“酒鬼”发展特色的标准化管理体系。以“统一文化观念,重塑企业精神”运作“湘酒鬼”。以“尊重科学、尊重知识、培养人才、合理用人、严格管理”发展“湘酒鬼”。(小雨)  相似文献   
4.
林海清 《中国钨业》2003,18(6):28-30
简述了我国钨矿业概况、现有采选技术水平及钨矿加工利用率 ;从资源配置出发 ,阐述了钨矿业发展存在的几个主要问题 ,并且针对性地提出了可持续发展的几点建议。  相似文献   
5.
Due to the language barrier, non-English users are unable to retrieve the most updated medical information from the U.S. authoritative medical websites, such as PubMed and MedlinePlus. However, currently, there is no any cross-language medical information retrieval (CLMIR) system that can help Chinese-speaking consumers cross the language barrier in finding useful English medical information. A few CLMIR systems utilize MeSH (Medical Subject Headings) to help overcome the language barrier. Unfortunately, the traditional Chinese version of MeSH is currently unavailable.In this paper, we employ a semi-automatic term translation method to construct a Chinese–English MeSH by exploiting abundant multilingual Web resources, including Web anchor texts and search–result pages. Through this method, we have developed a Chinese–English Mesh Compilation System to assist knowledge engineers in compiling a Chinese–English medical thesaurus with more than 19,000 entries. Furthermore, this thesaurus has been used to develop a prototypical system for cross-language medical information retrieval, MMODE, which can help consumers retrieve top-quality English medical information using Chinese terms.  相似文献   
6.
分析了矿区导线网精度预计经典方法存在的问题 ,推导出严密平差法精度预计的数学模型 ,并编制机算程序。  相似文献   
7.
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.  相似文献   
8.
Computational complexity of queries based on itemsets   总被引:1,自引:0,他引:1  
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete.  相似文献   
9.
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.  相似文献   
10.
本文以铜矿开发为例 ,从 5个方面分析了矿山企业融资困难实际情况 ,并对改变矿业投资难的重要性和必要性做了详细论述 ,最后对解决矿业投资难问题提出了有效途径和办法  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号