首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   20665篇
  免费   3307篇
  国内免费   2274篇
电工技术   1378篇
技术理论   2篇
综合类   1637篇
化学工业   1839篇
金属工艺   1174篇
机械仪表   1530篇
建筑科学   834篇
矿业工程   299篇
能源动力   416篇
轻工业   404篇
水利工程   141篇
石油天然气   292篇
武器工业   165篇
无线电   2513篇
一般工业技术   2042篇
冶金工业   708篇
原子能技术   45篇
自动化技术   10827篇
  2024年   121篇
  2023年   384篇
  2022年   557篇
  2021年   777篇
  2020年   867篇
  2019年   919篇
  2018年   842篇
  2017年   1003篇
  2016年   1144篇
  2015年   1207篇
  2014年   1432篇
  2013年   1385篇
  2012年   1327篇
  2011年   1375篇
  2010年   1084篇
  2009年   1098篇
  2008年   1153篇
  2007年   1331篇
  2006年   1158篇
  2005年   1103篇
  2004年   894篇
  2003年   817篇
  2002年   817篇
  2001年   754篇
  2000年   580篇
  1999年   437篇
  1998年   321篇
  1997年   268篇
  1996年   197篇
  1995年   175篇
  1994年   136篇
  1993年   100篇
  1992年   106篇
  1991年   70篇
  1990年   55篇
  1989年   52篇
  1988年   41篇
  1987年   17篇
  1986年   25篇
  1985年   24篇
  1984年   21篇
  1983年   15篇
  1982年   10篇
  1981年   7篇
  1980年   11篇
  1978年   4篇
  1977年   3篇
  1976年   3篇
  1975年   6篇
  1974年   3篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
This paper presents an orientation-based representation for planar curves and shapes. The new representation can uniquely represent all types, of planar shapes, be it convex, nonconvex, polygonal, smoothly curved, or piecewise smooth shapes. It is based on a new parameterization, theabsolute integral orientation. This representation is invariant under translation and rotation. The absolute integral orientation is a parameter invariant under scaling. As a result, matching of similar shapes (i.e., determination of the relative orientation and the scaling factor) using the absolute integral orientation as the parameter is easier than using the arclength as the parameter. In addition, the new representation has the feature of adaptive sampling, making it more compact and efficient than arc-length-based representations.  相似文献   
42.
The State of the Art in Text Filtering   总被引:1,自引:0,他引:1  
This paper develops a conceptual framework for text filtering practice and research, and reviews present practice in the field. Text filtering is an information seeking process in which documents are selected from a dynamic text stream to satisfy a relatively stable and specific information need. A model of the information seeking process is introduced and specialized to define text filtering. The historical development of text filtering is then reviewed and case studies of recent work are used to highlight important design characteristics of modern text filtering systems. User modeling techniques drawn from information retrieval, recommender systems, machine learning and other fields are described. The paper concludes with observations on the present state of the art and implications for future research on text filtering. This revised version was published online in July 2006 with corrections to the Cover Date.  相似文献   
43.
几何设计约束的表示与满足问题研究   总被引:3,自引:1,他引:2  
对于智能CAD系统来说,具有解决几何设计约束的功能是重要的。本文提出了一种面向对象的几何设计约束表示方法,它可以通过两种方式来表达。文中给出了一个约束传播算法,用于解决约束满足问题。  相似文献   
44.
本文研究了采用锁定放大相干检测技术的等离子体光发射谱检测系统。用该系统检测了仅用CF4作为刻蚀气体刻蚀非晶硅基薄膜的等离子体光发射谱。分析了检测结果和刻蚀机理。  相似文献   
45.
Intensional negative adjectives alleged , artificial , fake , false , former , and toy are unusual adjectives that depending on context may or may not be restricting functions. A formal theory of their semantics, pragmatics, and context that uniformly accounts for their complex mathematical and computational characteristics and captures some peculiarities of individual adjectives is presented.
Such adjectives are formalized as new concept builders, negation‐like functions that operate on the values of intensional properties of the concepts denoted by their arguments and yield new concepts whose intensional properties have values consistent with the negation of the old values. Understanding these new concepts involves semantics, pragmatics and context‐dependency of natural language. It is argued that intensional negative adjectives can be viewed as a special‐purpose, weaker, conntext‐dependent negationin natural language. The theory explains and predicts many inferences licensed by expressions involving such adjectives. Implementation of sample examples demonstrates its computational feasibility. Computation of context‐dependent interpretation is discussed.
The theory allows one to enhance a knowledge representation system with similar concept building, negation‐like, context‐dependent functions, the availability of which appears to be a distinct characteristic of natural languages.  相似文献   
46.
该文研究双秘钥公开钥密码体制,它不同于一般的只有一个秘密密钥的公开钥密钥体制,而是使用两个秘密密钥。要攻破它必须同时解决两个数学难题(素因子分解和求离散对数),从而大大增加了破译难度。  相似文献   
47.
48.
Learning a sequence of target locations when the sequence is uncorrelated with a sequence of responses and target location is not the response dimension (pure perceptual-based sequence learning) was examined. Using probabilistic sequences of target locations, the author shows that such learning can be implicit, is unaffected by distance between target locations, and is mostly limited to first-order transition probabilities. Moreover, the mechanism underlying learning affords processing of information at anticipated target locations and appears to be attention based. Implications for hypotheses of implicit sequence learning are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
49.
Although the gas metal arc welding (GMAW) process is widely used for joining metals, its planning is still a cumbersome task. The planning procedure involves many complex interrelationships among the process variables and depends heavily on empirical knowledge. Therefore, a solution method that allows a convenient way to represent the domain knowledge and evaluate the process variable relationships is needed. Further, the lack of a strong domain theory to quantify these interrelationships is a deficiency in the planning of the GMAW process. This paper presents a solution method that overcomes this deficiency and introduces a convenient knowledge representation scheme. The solution method considers the planning procedure to be a constraint satisfaction problem (CSP). The AC-4 algorithm is used to obtain arc consistency among nodes in the constraint network and the PC-4 algorithm is applied to obtain path consistency in the network. A modified version of the AC-4 algorithm is developed to reduce the search space and correspondingly reduce the computation time. An example is presented to demonstrate the capability of the method and its potential to reduce lead time.  相似文献   
50.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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