首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1500篇
  免费   29篇
  国内免费   8篇
电工技术   20篇
化学工业   384篇
金属工艺   33篇
机械仪表   22篇
建筑科学   63篇
矿业工程   3篇
能源动力   41篇
轻工业   136篇
水利工程   11篇
无线电   121篇
一般工业技术   300篇
冶金工业   119篇
原子能技术   14篇
自动化技术   270篇
  2024年   13篇
  2023年   13篇
  2022年   17篇
  2021年   27篇
  2020年   30篇
  2019年   31篇
  2018年   33篇
  2017年   38篇
  2016年   52篇
  2015年   35篇
  2014年   61篇
  2013年   91篇
  2012年   89篇
  2011年   85篇
  2010年   83篇
  2009年   78篇
  2008年   92篇
  2007年   62篇
  2006年   49篇
  2005年   58篇
  2004年   54篇
  2003年   46篇
  2002年   44篇
  2001年   17篇
  2000年   23篇
  1999年   18篇
  1998年   48篇
  1997年   22篇
  1996年   19篇
  1995年   15篇
  1994年   21篇
  1993年   20篇
  1992年   10篇
  1991年   13篇
  1990年   11篇
  1989年   11篇
  1988年   9篇
  1987年   11篇
  1986年   10篇
  1985年   13篇
  1984年   11篇
  1983年   5篇
  1982年   13篇
  1981年   4篇
  1979年   4篇
  1978年   4篇
  1976年   3篇
  1975年   5篇
  1974年   3篇
  1971年   3篇
排序方式: 共有1537条查询结果,搜索用时 0 毫秒
131.
We describe an algorithm for optimising the mesh in the least-squares finite element discretisation of first-order systems of partial differential equations. The key feature of the method is that the optimisation process is based entirely on the solution of local PDE problems. We apply the algorithm to the Stokes equations for the flow of a viscous incompressible fluid, and to a convection diffusion equation where convection dominates.  相似文献   
132.
133.
Generating a Condensed Representation for Association Rules   总被引:1,自引:0,他引:1  
Association rule extraction from operational datasets often produces several tens of thousands, and even millions, of association rules. Moreover, many of these rules are redundant and thus useless. Using a semantic based on the closure of the Galois connection, we define a condensed representation for association rules. This representation is characterized by frequent closed itemsets and their generators. It contains the non-redundant association rules having minimal antecedent and maximal consequent, called min-max association rules. We think that these rules are the most relevant since they are the most general non-redundant association rules. Furthermore, this representation is a basis, i.e., a generating set for all association rules, their supports and their confidences, and all of them can be retrieved needless accessing the data. We introduce algorithms for extracting this basis and for reconstructing all association rules. Results of experiments carried out on real datasets show the usefulness of this approach. In order to generate this basis when an algorithm for extracting frequent itemsets—such as Apriori for instance—is used, we also present an algorithm for deriving frequent closed itemsets and their generators from frequent itemsets without using the dataset.  相似文献   
134.
135.
The aim of the study was to assess the biomechanical strains on the hand-wrist system during grapevine pruning with newly designed pruning shears. Surface electromyography of the finger flexor muscle and wrist postures were analyzed in four vineyard workers during actual work with the new and reference hand-powered pruning shears. Due to the large inter-individual differences in biomechanical data observed with both pruning shears, no systematic effect of the new pruning shears on "extreme" flexion/extension (F/E) and ulnar/radial (U/R) wrist deviations was demonstrated. However, the use of the new pruning shears was associated with a higher frequency of "neutral and moderate" U/R deviations (U/R < 20%(max)) and, to a lesser extent, of "neutral and moderate" F/E deviations (F/E < 20%(max)). Due to the small sample of workers, this result must be confirmed in a larger population of vineyard workers.  相似文献   
136.
Source code terms such as method names and variable types are often different from conceptual words mentioned in a search query. This vocabulary mismatch problem can make code search inefficient. In this paper, we present COde voCABUlary (CoCaBu), an approach to resolving the vocabulary mismatch problem when dealing with free-form code search queries. Our approach leverages common developer questions and the associated expert answers to augment user queries with the relevant, but missing, structural code entities in order to improve the performance of matching relevant code examples within large code repositories. To instantiate this approach, we build GitSearch, a code search engine, on top of GitHub and Stack Overflow Q&A data. We evaluate GitSearch in several dimensions to demonstrate that (1) its code search results are correct with respect to user-accepted answers; (2) the results are qualitatively better than those of existing Internet-scale code search engines; (3) our engine is competitive against web search engines, such as Google, in helping users solve programming tasks; and (4) GitSearch provides code examples that are acceptable or interesting to the community as answers for Stack Overflow questions.  相似文献   
137.
138.
In multipass rendering, care has to be taken to include all light transport only once in the final solution. Therefore the different methods in current multipass configurations handle a perfectly disjunct part of the light transport. In this paper a Monte Carlo variance reduction technique is presented that probabilistically weights overlapping transport between different methods. A good heuristic for the weights is derived so that strengths of the respective methods are retained. The technique is applied to a combination of radiosity and bidirectional path tracing and significant improvement is obtained over the non-weighted combination. This method promises to be a very useful extension to other multipass algorithms as well.  相似文献   
139.
140.
High molecular weight poly(tert. butyl acrylate) s have been synthesized anionically using a technique derived from that of Teyssié et al. It was established that under proper conditions the sites remained living, allowing proper control of the molecular weight and yielding samples with narrow molecular weight distributions.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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