首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2329篇
  免费   30篇
  国内免费   3篇
电工技术   29篇
综合类   7篇
化学工业   632篇
金属工艺   45篇
机械仪表   45篇
建筑科学   143篇
矿业工程   5篇
能源动力   37篇
轻工业   134篇
水利工程   16篇
石油天然气   3篇
无线电   212篇
一般工业技术   417篇
冶金工业   358篇
原子能技术   7篇
自动化技术   272篇
  2024年   14篇
  2023年   33篇
  2022年   34篇
  2021年   73篇
  2020年   54篇
  2019年   46篇
  2018年   48篇
  2017年   36篇
  2016年   69篇
  2015年   53篇
  2014年   79篇
  2013年   113篇
  2012年   101篇
  2011年   123篇
  2010年   77篇
  2009年   90篇
  2008年   100篇
  2007年   102篇
  2006年   93篇
  2005年   68篇
  2004年   57篇
  2003年   44篇
  2002年   59篇
  2001年   25篇
  2000年   49篇
  1999年   48篇
  1998年   92篇
  1997年   67篇
  1996年   47篇
  1995年   32篇
  1994年   37篇
  1993年   30篇
  1992年   22篇
  1991年   28篇
  1990年   23篇
  1989年   10篇
  1988年   17篇
  1987年   16篇
  1986年   15篇
  1985年   21篇
  1984年   18篇
  1983年   25篇
  1982年   12篇
  1981年   19篇
  1979年   20篇
  1978年   10篇
  1976年   21篇
  1974年   16篇
  1973年   11篇
  1969年   9篇
排序方式: 共有2362条查询结果,搜索用时 0 毫秒
1.
A method for assessing health care technology that models the demand on the clinician's attention exerted by patients' data (diagnostic and therapeutic) can provide a means for simultaneously reducing the cost and improving the quality of health care. The attentional demand exerted by patients' data can be measured by the amount of uncertainty in the data. Uncertainty can be expressed mathematically by the concept of entropy in information theory.  相似文献   
2.
The bit-error rate (BER) performance of new iterative decoding algorithms (e,g,, turbodecoding) is achieved at the expense of a computationally burdensome decoding procedure. We present a method called early detection that can be used to reduce the computational complexity of a variety of iterative decoders. Using a confidence criterion, some information symbols, state variables, and codeword symbols are detected early on during decoding. In this way, the computational complexity of further processing is reduced with a controllable increase in the BER. We present an easily implemented instance of this algorithm, called trellis splicing, that can be used with turbodecoding. For a simulated system of this type, we obtain a reduction in the computational complexity of up to a factor of four, relative to a turbodecoder that obtains the same increase in the BER by performing fewer iterations  相似文献   
3.
4.
The variation in the behaviour of bulk solids as a result of sudden pressure changes in the surrounding gas phase is of interest in the application of lock hoppers for transfer of bulk solids into pressure vessels. By using such sluice systems, problems occur due to consolidation of the pressurized bulk solids. This paper presents the results of experimental and theoretical research, which allow to describe the influence of several parameters on pressure compensation and the degree of consolidation. With reference to the forces and mechanisms responsible for consolidation, it is possible to describe the different consolidation behaviour of incompressible (limestone) and compressible (hard coal) bulk solids.  相似文献   
5.
Significant progress has been made in recent years regarding the photooxidation of olefin copolymers, but questions still remain. This paper reviews the progress and probes the photooxidative chemistry of ethylene–propylene (EP) and ethylene/propylene/diene monomer (EPDM) copolymers. Both stabilized and unstabilized polymer plaques were irradiated in a xenon are and the surface chemistry followed using infra-red spectroscopy. Model compounds were used to help elucidate the chemistry caused by unique structural features present in the copolymers. Volatile products evolved during photooxidation were determined giving valuable insight into the degradation chemistry.  相似文献   
6.
Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92  相似文献   
7.
Transformation-invariant clustering using the EM algorithm   总被引:1,自引:0,他引:1  
Clustering is a simple, effective way to derive useful representations of data, such as images and videos. Clustering explains the input as one of several prototypes, plus noise. In situations where each input has been randomly transformed (e.g., by translation, rotation, and shearing in images and videos), clustering techniques tend to extract cluster centers that account for variations in the input due to transformations, instead of more interesting and potentially useful structure. For example, if images from a video sequence of a person walking across a cluttered background are clustered, it would be more useful for the different clusters to represent different poses and expressions, instead of different positions of the person and different configurations of the background clutter. We describe a way to add transformation invariance to mixture models, by approximating the nonlinear transformation manifold by a discrete set of points. We show how the expectation maximization algorithm can be used to jointly learn clusters, while at the same time inferring the transformation associated with each input. We compare this technique with other methods for filtering noisy images obtained from a scanning electron microscope, clustering images from videos of faces into different categories of identification and pose and removing foreground obstructions from video. We also demonstrate that the new technique is quite insensitive to initial conditions and works better than standard techniques, even when the standard techniques are provided with extra data.  相似文献   
8.
High hydrostatic pressure (HHP) becomes more and more interesting for life science research, since it can be employed to inactivate various cells. To directly monitor "cells under pressure," the development of an optical high-pressure chamber is required. Therefore, an optical pressure chamber that can be used for up to 300 MPa was constructed. This chamber has already been described as a tool for in situ observation of dynamic changes of microscopic structures in bright field as well as phase contrast. In combination with an inverted microscope, we obtained brilliant microscopic color pictures with an optical resolution more than 0.56 microm. Here, we demonstrate the capabilities of the HHP cell, in combination with epifluorescence microscopy. Using a nonadherent human B-cell line (Raji, ATCC CCL 86), stained with the fluorescent dyes propidium iodide, Hoechst 33342, or dihexyloxacarbocyanine iodide, we were able to show that the system is suitable to perform fluorescence microscopic analyses, with pressures up to 300 MPa, with viable mammalian cells.  相似文献   
9.
Abstract. A method for gravimetric determination of tannins based on binding with insoluble polyvinylpyrrolidone (PVP) is presented. The gravimetric method gives the absolute amount of tannins and avoids problems of standards associated with spectrophotometric methods. The method was applied to nine browse and tree leaves. The values obtained correlate significantly with tannins determined spectrophotometrically, protein precipitation capacities and protein precipitable phenotics. This method together with other tannin assays will be useful in nutritional studies. The present study also demonstrates the different behaviour of tannic acids from different commercial sources towards PVP suggesting the presence of different moieties in tannic acids from different commercial sources and even among batches from the same source thereby affecting the results obtained using the spectrophotometric methods. Use of well-defined tannic acid as a standard in spectrophotometric methods is suggested which will allow meaningful comparison of values obtained from different laboratories.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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