首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2087篇
  免费   95篇
  国内免费   5篇
电工技术   24篇
综合类   16篇
化学工业   593篇
金属工艺   45篇
机械仪表   33篇
建筑科学   146篇
矿业工程   3篇
能源动力   31篇
轻工业   171篇
水利工程   19篇
石油天然气   3篇
无线电   139篇
一般工业技术   402篇
冶金工业   192篇
原子能技术   16篇
自动化技术   354篇
  2023年   24篇
  2022年   50篇
  2021年   71篇
  2020年   40篇
  2019年   47篇
  2018年   44篇
  2017年   42篇
  2016年   54篇
  2015年   47篇
  2014年   76篇
  2013年   100篇
  2012年   100篇
  2011年   161篇
  2010年   105篇
  2009年   122篇
  2008年   115篇
  2007年   88篇
  2006年   90篇
  2005年   78篇
  2004年   74篇
  2003年   61篇
  2002年   58篇
  2001年   49篇
  2000年   43篇
  1999年   44篇
  1998年   44篇
  1997年   35篇
  1996年   24篇
  1995年   25篇
  1994年   35篇
  1993年   21篇
  1992年   12篇
  1991年   25篇
  1990年   17篇
  1989年   16篇
  1988年   8篇
  1987年   10篇
  1986年   6篇
  1985年   10篇
  1984年   16篇
  1983年   17篇
  1982年   6篇
  1981年   6篇
  1978年   5篇
  1977年   6篇
  1976年   7篇
  1970年   6篇
  1969年   6篇
  1968年   10篇
  1967年   5篇
排序方式: 共有2187条查询结果,搜索用时 15 毫秒
151.
We consider the problem of collectively locating a set of points within a set of disjoint polygonal regions when neither for points nor for regions preprocessing is allowed. This problem arises in geometric database systems. More specifically it is equivalent to computing theinside join of geo-relational algebra, a conceptual model for geo-data management. We describe efficient algorithms for solving this problem based on plane-sweep and divide-and-conquer, requiringO(n(logn) +t) andO(n(log2 n) +t) time, respectively, andO(n) space, wheren is the total number of points and edges, and (is the number of reported (point, region) pairs. Since the algorithms are meant to be practically useful we consider as well as the internal versions-running completely in main memory-versions that run internally but use much less than linear space and versions that run externally, that is, require only a constant amount of internal memory regardless of the amount of data to be processed. Comparing plane-sweep and divide-and-conquer, it turns out that divide-and-conquer can be expected to perform much better in the external case even though it has a higher internal asymptotic worst-case complexity. An interesting theoretical by-product is a new general technique for handling arbitrarily large sets of objects clustered on a singlex-coordinate within a planar divide-and-conquer algorithm and a proof that the resulting “unbalanced” dividing does not lead to a more than logarithmic height of the tree of recursive calls.  相似文献   
152.
153.
The thermal expansion and vibrational properties of [1 0 0] and [0 0 1] LaGaO3 single crystals have been studied by thermal mechanical analysis and micro-Raman spectroscopy. A first-order orthorhombic to rhombohedral phase transition has been confirmed by both techniques, as well as by in situ heating using optical microscopy. The appearance of a metastable intermediate phase, tentatively assigned as monoclinic, has been detected both by optical microscopy and Raman spectroscopy upon heating of the [1 0 0] and [0 0 1] LaGaO3 single crystals. Not only temperature, but the stress-induced orthorhombic to rhombohedral phase transition has also been detected by Raman mapping of the residual impression made by Vickers indentation. The position map of bands belonging to the lower-temperature/pressure orthorhombic and the higher-temperature/pressure rhombohedral phase show that the rhombohedral phase is located inside the impression, where the applied indentation stresses are the highest, whereas no rhombohedral phase is detected outside the impression, where the surface has not been altered by contact stresses.  相似文献   
154.
155.
156.
157.
Segmenting images using localized histograms and region merging   总被引:1,自引:0,他引:1  
A working system for segmenting images of complex scenes is presented. The system integrates techniques that have evolved out of many years of research in low-level image segmentation at the University of Massachusetts and elsewhere. This paper documents the result of this historical evolution. Segmentations produced by the system are used extensively in related image interpretation research.The system first produces segmentations based upon an analysis of spatially localized feature histograms. These initial segmentations are then simplified using a region merging algorithm. Parameter selection for the local histogram segmentation algorithm is facilitated by mapping the multidimensional parameter space to a one-dimensional parameter which regulates region fragmentation. An extension of this algorithm to multiple features is also presented. Experience with roughly 100 images from different domains has shown the system to be robust and effective. Samples of these results are included.  相似文献   
158.
159.
In this paper we present new work done on the bin-picking problem. The work was triggered by the advent of a new solid state range camera which enables the economic and robust use of range imagery in industrial robotic automation tasks. The application presented is that of pick-and-place of randomly oriented but known polyhedral objects in an industrial robotic work cell. The algorithms for segmentation, pose estimation, and grasp point determination are presented along with practical results from a real industrial grade work cell.  相似文献   
160.
A crucial component of the interaction between ATM's and the Internet's Quality of Service (QoS) architectures is the efficient mapping of RSVP (Resource reSerVation Protocol) as the Internet's signalling protocol onto the according ATM mechanisms. In particular, this article focuses on one of the most contrary characteristics of RSVP and ATM signalling. This is the support for heterogeneous reservations by RSVP over the ATM subnetwork, taking into account that ATM only allows for a homogeneous QoS within a single Virtual Circuit (VC). We present previous approaches to the solution of this problem and argue for more sophisticated and efficient approaches to manage ATM VCs taking into consideration ATM tariffs and resource consumption.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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