全文获取类型
收费全文 | 2837篇 |
免费 | 222篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 3061篇 |
出版年
2023年 | 46篇 |
2022年 | 28篇 |
2021年 | 120篇 |
2020年 | 88篇 |
2019年 | 73篇 |
2018年 | 98篇 |
2017年 | 94篇 |
2016年 | 121篇 |
2015年 | 114篇 |
2014年 | 147篇 |
2013年 | 168篇 |
2012年 | 164篇 |
2011年 | 183篇 |
2010年 | 108篇 |
2009年 | 129篇 |
2008年 | 129篇 |
2007年 | 115篇 |
2006年 | 79篇 |
2005年 | 92篇 |
2004年 | 71篇 |
2003年 | 73篇 |
2002年 | 55篇 |
2001年 | 32篇 |
2000年 | 42篇 |
1999年 | 37篇 |
1998年 | 104篇 |
1997年 | 60篇 |
1996年 | 39篇 |
1995年 | 51篇 |
1994年 | 27篇 |
1993年 | 27篇 |
1992年 | 23篇 |
1991年 | 13篇 |
1990年 | 17篇 |
1989年 | 21篇 |
1988年 | 14篇 |
1987年 | 15篇 |
1986年 | 14篇 |
1985年 | 10篇 |
1984年 | 11篇 |
1983年 | 17篇 |
1982年 | 10篇 |
1981年 | 14篇 |
1980年 | 17篇 |
1979年 | 10篇 |
1978年 | 11篇 |
1977年 | 15篇 |
1976年 | 12篇 |
1974年 | 15篇 |
1972年 | 9篇 |
排序方式: 共有3061条查询结果,搜索用时 187 毫秒
71.
72.
Diverse proteomic techniques based on protein MS have been introduced to systematically characterize protein perturbations associated with disease. Progress in clinical proteomics is essential for personalized medicine, wherein treatments will be tailored to individual needs based on patient stratification using noninvasive disease monitoring procedures to reveal the most appropriate therapeutic targets. However, breakthroughs await the successful development and application of a robust proteomic pipeline capable of identifying and rigorously assessing the relevance of multiple candidate proteins as informative diagnostic and prognostic indicators or suitable drug targets involved in a pathological process. While steady progress has been made toward more comprehensive proteome profiling, the emphasis must now shift from in depth screening of reference samples to stringent quantitative validation of selected lead candidates in a broader clinical context. Here, we present an overview of the emerging proteomic strategies for high-throughput protein detection focused primarily on targeted MS/MS as the basis for biomarker verification in large clinical cohorts. We discuss the conceptual promise and practical pitfalls of these methods in terms of achieving higher dynamic range, higher throughput, and more reliable quantification, highlighting research avenues that merit additional inquiry. 相似文献
73.
M. K. Vijaya Sankar E. Eisner A. Garofalo D. Gates T. H. Ivers R. Kombargi M. E. Mauel D. Maurer D. Nadle G. A. Navratil Q. Xiao 《Journal of Fusion Energy》1993,12(3):303-310
HBT-EP is a new research tokamak designed and built to investigate passive and active feedback techniques to control MHD instabilities. In particular, HBT-EP will be able to test techniques to control fast MHD instabilities occurring at high Troyon-normalized beta, N Ba/Ip [Tm/MA], since it is equipped with a thick, close-fitting, and adjustable conducting shell. The major goals of the initial operation of HBT-EP have been the achievement of high beta operation (N 3) using only ohmic heating and the observation of MHD instabilities. By using a unique fast startup technique, we have successfully achieved these goals. A variety of MHD phenomena were observed during the high beta operation of HBT-EP. At modest beta (N 2), discharges have been maintained for more than 10 msec, and these discharges exhibit saturated resistive instabilities. When N approaches 3, major disruptions occur preceded by oscillating, growing precursors. During start-up, one or more minor disruptions are usually observed. A 1-D transport code has been used to simulate the evolution of the current profile, and these early minor instabilities are predicted to be double tearing modes. The simulation also reproduces the observed high beta operation when saturated neo-Alcator energy confinement scaling is assumed. 相似文献
74.
75.
In this paper we investigate the worst-case complexity of range searching: preprocess N points in k-space such that range queries can be answered quickly. A range query asks for all points with each coordinate in some range of values, and arises in many problems in statistics and data bases. We develop three different structures for range searching in this paper. The first structure has absolutely optimal query time (which we prove), but has very high preprocessing and storage costs. The second structure we present has logarithmic query time and O(N
1+2) preprocessing and storage costs, for any fixed >0. Finally we give a structure with linear storage, O(N ln N) preprocessing and O(N
) query time.Research in this paper has been supported partially under Office of Naval Research contract N000014-76-C-0373, USA, and by the Austrian Federal Ministry for Science and Research 相似文献
76.
Summary In this paper we study the generative capacity of EOL forms from two different points of view. On the one hand, we consider the generative capacity of special EOL forms which one could call linear like and context free like, establishing the existence of a rich variety of non-regular sub-EOL language families. On the other hand, we propose the notion of a generator L of a language family We mean by this that any synchronized EOL system generating L generates — if understood as an EOL form — all languages of . We characterize the generators of the family of regular languages, and prove that other well known language families do not have generators.Partially supported under NSE Research Council of Canada, grant No. A-7700 相似文献
77.
Optic flow motion patterns can be a rich source of information about our own movement and about the structure of the environment we are moving in. We investigate the information available to the brain under real operating conditions by analyzing video sequences generated by physically moving a camera through various typical human environments. We consider to what extent the motion signal maps generated by a biologically plausible, two-dimensional array of correlation-based motion detectors (2DMD) not only depend on egomotion, but also reflect the spatial setup of such environments. We analyzed the local motion outputs by extracting the relative amounts of detected directions and comparing the spatial distribution of the motion signals to that of idealized optic flow. Using a simple template matching estimation technique, we are able to extract the focus of expansion and find relatively small errors that are distributed in characteristic patterns in different scenes. This shows that all types of scenes provide suitable motion information for extracting ego motion despite the substantial levels of noise affecting the motion signal distributions, attributed to the sparse nature of optic flow and the presence of camera jitter. However, there are large differences in the shape of the direction distributions between different types of scenes; in particular, man-made office scenes are heavily dominated by directions in the cardinal axes, which is much less apparent in outdoor forest scenes. Further examination of motion magnitudes at different scales and the location of motion information in a scene revealed different patterns across different scene categories. This suggests that self-motion patterns are not only relevant for deducing heading direction and speed but also provide a rich information source for scene structure and could be important for the rapid formation of the gist of a scene under normal human locomotion. 相似文献
78.
Johannes Blümlein Sebastian Klein Carsten Schneider Flavia Stan 《Journal of Symbolic Computation》2012
Given a Feynman parameter integral, depending on a single discrete variable N and a real parameter ε, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in ε. In a first step, the integrals are expressed by hypergeometric multi-sums by means of symbolic transformations. Given this sum format, we develop new summation tools to extract the first coefficients of its series expansion whenever they are expressible in terms of indefinite nested product–sum expressions. In particular, we enhance the known multi-sum algorithms to derive recurrences for sums with complicated boundary conditions, and we present new algorithms to find formal Laurent series solutions of a given recurrence relation. 相似文献
79.
80.
In order to reduce the computational complexity of model predictive control (MPC) a proper input signal parametrization is proposed in this paper which significantly reduces the number of decision variables. This parametrization can be based on either measured data from closed-loop operation or simulation data. The snapshots of representative time domain data for all manipulated variables are projected on an orthonormal basis by a Karhunen-Loeve transformation. These significant features (termed principal control moves, PCM) can be reduced utilizing an analytic criterion for performance degradation. Furthermore, a stability analysis of the proposed method is given. Considerations on the identification of the PCM are made and another criterion is given for a sufficient selection of PCM. It is shown by an example of an industrial drying process that a strong reduction in the order of the optimization is possible while retaining a high performance level. 相似文献