首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   308225篇
  免费   3822篇
  国内免费   1369篇
电工技术   5141篇
综合类   553篇
化学工业   46358篇
金属工艺   11937篇
机械仪表   8982篇
建筑科学   8141篇
矿业工程   1820篇
能源动力   7892篇
轻工业   24901篇
水利工程   3324篇
石油天然气   5981篇
武器工业   45篇
无线电   35459篇
一般工业技术   61108篇
冶金工业   56837篇
原子能技术   7758篇
自动化技术   27179篇
  2021年   2495篇
  2020年   1921篇
  2019年   2409篇
  2018年   4023篇
  2017年   4138篇
  2016年   4388篇
  2015年   2903篇
  2014年   5017篇
  2013年   13953篇
  2012年   8184篇
  2011年   11119篇
  2010年   8598篇
  2009年   9879篇
  2008年   10391篇
  2007年   10445篇
  2006年   8942篇
  2005年   8302篇
  2004年   8143篇
  2003年   7913篇
  2002年   7640篇
  2001年   7418篇
  2000年   7039篇
  1999年   7276篇
  1998年   16838篇
  1997年   12034篇
  1996年   9472篇
  1995年   7342篇
  1994年   6504篇
  1993年   6534篇
  1992年   4846篇
  1991年   4472篇
  1990年   4472篇
  1989年   4442篇
  1988年   4104篇
  1987年   3773篇
  1986年   3735篇
  1985年   4221篇
  1984年   3907篇
  1983年   3622篇
  1982年   3448篇
  1981年   3442篇
  1980年   3358篇
  1979年   3167篇
  1978年   3168篇
  1977年   3426篇
  1976年   4342篇
  1975年   2701篇
  1974年   2597篇
  1973年   2640篇
  1972年   2163篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
71.
The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well.  相似文献   
72.
Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols  相似文献   
73.
We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators  相似文献   
74.
Multicast communication, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is being increasingly demanded in parallel computing. System supported multicast services can potentially offer improved performance, increased functionality, and simplified programming, and may in turn be used to support various higher-level operations for data movement and global process control. This paper presents efficient algorithms to implement multicast communication in wormhole-routed direct networks, in the absence of hardware multicast support, by exploiting the properties of the switching technology. Minimum-time multicast algorithms are presented for n-dimensional meshes and hypercubes that use deterministic, dimension-ordered routing of unicast messages. Both algorithms can deliver a multicast message to m-1 destinations in [log 2 m] message passing steps, while avoiding contention among the constituent unicast messages. Performance results of implementations on a 64-node nCUBE-2 hypercube and a 168-node Symult 2010 2-D mesh are given  相似文献   
75.
Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation.  相似文献   
76.
Silicon nitride corrugated diaphragms of 2 mm×2 mm×1 μm have been fabricated with 8 circular corrugations, having depths of 4, 10, or 14 μm. The diaphragms with 4-μm-deep corrugations show a measured mechanical sensitivity (increase in the deflection over the increase in the applied pressure) which is 25 times larger than the mechanical sensitivity of flat diaphragms of equal size and thickness. Since this gain in sensitivity is due to reduction of the initial stress, the sensitivity can only increase in the case of diaphragms with initial stress. A simple analytical model has been proposed that takes the influence of initial tensile stress into account. The model predicts that the presence of corrugations increases the sensitivity of the diaphragms, because the initial diaphragm stress is reduced. The model also predicts that for corrugations with a larger depth the sensitivity decreases, because the bending stiffness of the corrugations then becomes dominant. These predictions have been confirmed by experiments. The application of corrugated diaphragms offers the possibility to control the sensitivity of thin diaphragms by geometrical parameters, thus eliminating the effect of variations in the initial stress, due to variations in the diaphragm deposition process and/or the influence of temperature changes and packaging stress  相似文献   
77.
For users of an executive information system (EIS), the EIS interface is the system and is crucial to the EIS's success. These guidelines for designing EIS interfaces are based on studies of actual EIS interfaces that meet the unique information needs of executives.  相似文献   
78.
79.
First break picking is a pattern recognition problem in seismic signal processing, one that requires much human effort and is difficult to automate. The authors' goal is to reduce the manual effort in the picking process and accurately perform the picking. Feedforward neural network first break pickers have been developed using backpropagation training algorithms applied either to an encoded version of the raw data or to derived seismic attributes which are extracted from the raw data. The authors summarize a study in which they applied a backpropagation fuzzy logic system (BPFLS) to first break picking. The authors use derived seismic attributes as features, and take lateral variations into account by using the distance to a piecewise linear guiding function as a new feature. Experimental results indicate that the BPFLS achieves about the same picking accuracy as a feedforward neural network that is also trained using a backpropagation algorithm; however, the BPFLS is trained in a much shorter time, because there is a systematic way in which the initial parameters of the BPFLS can be chosen, versus the random way in which the weights of the neural network are chosen  相似文献   
80.
This report details procedures to measure annihilation anxiety, a concept derived from Freud's 1926 formulation of traumatic anxiety. A 25-item pencil-and-paper inventory administered to patient and to nonpatient samples is described, along with a brief summary of earlier findings. The delineation of nine interrelated experiential components of annihilation anxiety provides the background for the construction of Rorschach and TAT measures of the concept. Findings comparing the pencil-and-paper inventory and the projective test measures are presented as well as examples of responses judged to reflect annihilation anxiety from Rorschach and TAT protocols.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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