首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   440篇
  免费   2篇
电工技术   1篇
化学工业   11篇
机械仪表   9篇
建筑科学   22篇
能源动力   9篇
轻工业   16篇
水利工程   9篇
石油天然气   1篇
无线电   38篇
一般工业技术   36篇
冶金工业   144篇
原子能技术   5篇
自动化技术   141篇
  2021年   4篇
  2019年   1篇
  2016年   6篇
  2014年   3篇
  2013年   6篇
  2012年   3篇
  2011年   10篇
  2010年   3篇
  2009年   4篇
  2008年   5篇
  2007年   9篇
  2006年   14篇
  2005年   5篇
  2004年   10篇
  2003年   5篇
  2002年   19篇
  2001年   6篇
  2000年   10篇
  1999年   6篇
  1998年   45篇
  1997年   25篇
  1996年   18篇
  1995年   16篇
  1994年   3篇
  1993年   11篇
  1992年   10篇
  1991年   8篇
  1990年   8篇
  1989年   6篇
  1988年   9篇
  1987年   4篇
  1986年   5篇
  1985年   9篇
  1984年   10篇
  1983年   19篇
  1982年   24篇
  1981年   18篇
  1980年   8篇
  1979年   8篇
  1978年   4篇
  1977年   10篇
  1976年   18篇
  1974年   4篇
  1973年   1篇
  1972年   3篇
  1970年   1篇
  1966年   1篇
  1964年   2篇
  1962年   1篇
  1925年   2篇
排序方式: 共有442条查询结果,搜索用时 31 毫秒
1.
The rare case of neurilemmoma of the larynx was presented. The difficulties in histopathologic diagnosis of such tumors were emphasized. The tumor was removed by surgery from external approach.  相似文献   
2.
We recently developed a rapid loop closure algorithm in which bond lengths are scaled to constrain the ends of a segment to match a known distance and then gradually relaxed to their standard values, with boundary constraints maintained. Although the algorithm predicted the Zif286 zinc-finger loop to within approximately 2 A, it had a serious limitation that made its more general use tentative: it omitted the atomic environment of the loop. Here we report an extension of the algorithm to take into account the protein environment surrounding a given loop from the outset of the conformational search and show that it predicts structure with an efficiency and accuracy that could not be achieved without continuous environmental inclusion. The algorithm should be widely applicable to structure determination when complete experimental information is unavailable.  相似文献   
3.
4.
To determine if recombinant human Cu-Zn superoxide dismutase (rhSOD) would prevent acute lung injury caused by hyperoxia and barotrauma, 26 newborn piglets were studied. Ten piglets were hyperventilated (arterial PCO2 15-20 Torr) with 100% O2 for 48 h. A second group received identical treatment for 4 h (n = 2) or 48 h (n = 8) but was given 5 mg/kg of rhSOD intratracheally at time 0. Six piglets were normally ventilated (arterial PCO2 40-45 Torr) for 48 h with 21% O2. Pulmonary function and tracheal aspirates were examined at time 0 and at 24 and 48 h, and bronchoalveolar lavage was performed at 48 h. In piglets treated with hyperoxia and hyperventilation, lung compliance decreased 42%, and tracheal aspirates showed an increase in neutrophil chemotactic activity (32%), total cell counts (135%), elastase activity (93%), and albumin concentration (339%) over 48 h (P < 0.05). All variables were significantly lower in rhSOD-treated piglets and comparable to normoxic control values. Surfactant remained active in all groups. Immunohistochemistry demonstrated that at 48 h significant rhSOD was distributed homogeneously in terminal airways. Adding rhSOD to tracheal aspirates of hyperoxic hyperventilated piglets did not alter neutrophil chemotaxis, suggesting that rhSOD protected the lung by reducing the production of chemotactic mediators. Results indicate that acute lung injury caused by 48 h of hyperoxia and hyperventilation is significantly ameliorated by prophylactic intratracheal administration of rhSOD.  相似文献   
5.
Two-dimensional phase unwrapping using a minimum spanning treealgorithm   总被引:1,自引:0,他引:1  
Phase unwrapping refers to the determination of phase from modulo 2pi data, some of which may not be reliable. In 2D, this is equivalent to confining the support of the phase function to one or more arbitrarily shaped regions. A phase unwrapping algorithm is presented which works for 2D data known only within a set of nonconnected regions with possibly nonconvex boundaries. The algorithm includes the following steps: segmentation to identify connectivity, phase unwrapping within each segment using a Taylor series expansion, phase unwrapping between disconnected segments along an optimum path, and filling of phase information voids. The optimum path for intersegment unwrapping is determined by a minimum spanning tree algorithm. Although the algorithm is applicable to any 2D data, the main application addressed is magnetic resonance imaging (MRI) where phase maps are useful.  相似文献   
6.
Compact region extraction using weighted pixel linking in a pyramid   总被引:2,自引:0,他引:2  
This correspondence describes a method of image segmentation based on a ``pyramid' of reduced-resolution versions of the image. It defines link strengths between pixels at adjacent levels of the pyramid, based on proximity and similarity, and iteratively recomputes the pixel values and adjusts the link strengths. After a few iterations, the strengths stabilize, and the links that remain strong define subtrees of the pyramid; the leaves of each tree are the pixels belonging to a compact (piece of a) homogeneous region in the image.  相似文献   
7.
This paper introduces a generalization of cellular automata in which each celi is a tape-bounded Turing machine rather than a finite-state machine. Fast algorithms are given for performing various basic image processing tasks by such automata. It is suggested that this model of parallel computation is a very suitable one for studying the advantages of parallelism in this domain.  相似文献   
8.
Mosaic models for textures   总被引:1,自引:0,他引:1  
This paper deals with a class of image models based on random geometric processes. Theoretical and empirical results on properties of patterns generated using these models are summarized. These properties can be used as aids in fitting the models to images.  相似文献   
9.
10.
Elongated black objects in black-and-white pictures can be ``thinned' to arcs and curves, without changing their connectedness, by (repeatedly) deleting black border points whose deletion does not locally disconnect the black points in their neighborhoods. This technique generalizes to gray-scale pictures if we use a weighted definition of connectedness: two points are ``connected' if there is a path joining them on which no point is lighter than either of them. We can then ``thin' dark objects by changing each point's gray level to the minimum of its neighbors' gray levels, provided this does not disconnect any pair of points in its neighborhood. Examples illustrating the performance of this technique are given.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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