首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5542篇
  免费   180篇
  国内免费   10篇
电工技术   74篇
综合类   31篇
化学工业   1443篇
金属工艺   118篇
机械仪表   111篇
建筑科学   301篇
矿业工程   13篇
能源动力   84篇
轻工业   523篇
水利工程   35篇
石油天然气   2篇
无线电   410篇
一般工业技术   1021篇
冶金工业   919篇
原子能技术   59篇
自动化技术   588篇
  2021年   74篇
  2020年   52篇
  2019年   71篇
  2018年   86篇
  2017年   68篇
  2016年   108篇
  2015年   96篇
  2014年   133篇
  2013年   256篇
  2012年   216篇
  2011年   283篇
  2010年   218篇
  2009年   201篇
  2008年   237篇
  2007年   210篇
  2006年   170篇
  2005年   195篇
  2004年   164篇
  2003年   124篇
  2002年   114篇
  2001年   115篇
  2000年   105篇
  1999年   126篇
  1998年   215篇
  1997年   151篇
  1996年   130篇
  1995年   98篇
  1994年   105篇
  1993年   95篇
  1992年   85篇
  1991年   58篇
  1990年   92篇
  1989年   64篇
  1988年   60篇
  1987年   64篇
  1986年   52篇
  1985年   70篇
  1984年   68篇
  1983年   59篇
  1982年   59篇
  1981年   47篇
  1980年   46篇
  1979年   51篇
  1978年   51篇
  1977年   80篇
  1976年   59篇
  1975年   47篇
  1974年   64篇
  1972年   47篇
  1970年   37篇
排序方式: 共有5732条查询结果,搜索用时 15 毫秒
101.
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two different scheduling problems: scheduling on unrelated parallel machines with costs and the job shop scheduling problem. The time complexity of the resulting approximation schemes is always linear in the number n of jobs, and the multiplicative constant hidden in the O(n) running time is reasonably small and independent of the error ε. Supported by Swiss National Science Foundation project 200020-109854, “Approximation Algorithms for Machine scheduling Through Theory and Experiments II”. A preliminary version of this paper appeared in the Proceedings of ESA’01.  相似文献   
102.
In directed model checking, the traversal of the state space is guided by an estimate of the distance from the current state to the nearest error state. This paper presents a distance-preserving abstraction for concurrent systems that allows one to compute an interesting estimate of the error distance without hitting the state explosion problem. Our experiments show a dramatic reduction both in the number of states explored by the model checker and in the total runtime.  相似文献   
103.
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  相似文献   
104.
105.
106.
Ionic self‐assembly of charged molecular building blocks relies on the interplay between long‐range electrostatic forces and short‐range, often cooperative, supramolecular interactions, yet has been seldom studied in two dimensions at the solid–liquid interface. Here, we demonstrate anion‐driven switching of two‐dimensional (2D) crystal structure at the Au(111)/octanoic acid interface. Using scanning tunneling microscopy (STM), three organic salts with identical polyaromatic cation (PQPC6+) but different anions (perchlorate, anthraquinonedisulfonate, benzenesulfonate) are shown to form distinct, highly ordered self‐assembled structures. Reversible switching of the supramolecular arrangement is demonstrated by in situ exchange of the anion on the pre‐formed adlayer, by changing the concentration ratio between the incoming and outgoing anion. Density functional theory (DFT) calculations reveal that perchlorate is highly mobile in the adlayer, and corroborate why this anion is only resolved transiently in STM. Surprisingly, the templating effect of the anion persists even where it does not become part of the adlayer 2D fabric, which we ascribe to differences in stabilization of cation conformations by the anion. Our results provide important insight into the structuring of mixed anion–cation adlayers. This is essential in the design of tectons for ionic self‐assembled superstructures and biomimetic adaptive materials and valuable also to understand adsorbate–adsorbate interactions in heterogeneous catalysis.  相似文献   
107.
108.
109.
This RILEM round robin study with nine participating laboratories investigated bitumen ageing, its effect on chemical properties and its reproducibility. The impact of temperature used for short-term (RTFOT) binder ageing on the combined short- and long-term (PAV) aged samples was investigated; thereby the effect of reduced mixing temperature such as those relevant for warm mix asphalt technologies on long term ageing was examined. Four 70/100 penetration graded bituminous binders from different sources were selected. In addition to the standard RTFOT temperature of 163 °C, two additional temperatures, 143 and 123 °C were used. The Fourier transform infrared spectroscopy (FTIR) analysis was carried out using an integration method which considers the area below the absorbance spectrum around a band maximum using baseline and tangential approaches. A statistical investigation into the reproducibility of FTIR spectra analysis based on the accumulated data was done. To assess the reproducibility, the coefficient of variation (CV) was taken as a benchmark parameter. Carbonyl and sulfoxide indices were calculated using different baseline correction methods and tangential and baseline integration, respectively. It was shown that the tangential method was not influenced by the applied baseline correction. However, in all considered cases, the tangential method led to significantly worse reproducibility (CVs ranging from 20 to 120%) compared to the baseline method. The sulfoxide indices calculated by both methods were not affected by the baseline correction method used. Impacts of changes in the short-term ageing temperature on short- or long-term aged samples could not be found whereas differences between different binder sources could be detected. RTFOT temperature and therefore mix production temperature had a stronger impact on the formation of sulfoxide structures than for carbonyl structures. The findings from this study show the most reproducible of all considered methods when more than one laboratory is providing FTIR data.  相似文献   
110.
The calibration of discrete element method (DEM) simulations is typically accomplished in a trial-and-error manner. It generally lacks objectivity and is filled with uncertainties. To deal with these issues, the sequential quasi-Monte Carlo (SQMC) filter is employed as a novel approach to calibrating the DEM models of granular materials. Within the sequential Bayesian framework, the posterior probability density functions (PDFs) of micromechanical parameters, conditioned to the experimentally obtained stress–strain behavior of granular soils, are approximated by independent model trajectories. In this work, two different contact laws are employed in DEM simulations and a granular soil specimen is modeled as polydisperse packing using various numbers of spherical grains. Knowing the evolution of physical states of the material, the proposed probabilistic calibration method can recursively update the posterior PDFs in a five-dimensional parameter space based on the Bayes’ rule. Both the identified parameters and posterior PDFs are analyzed to understand the effect of grain configuration and loading conditions. Numerical predictions using parameter sets with the highest posterior probabilities agree well with the experimental results. The advantage of the SQMC filter lies in the estimation of posterior PDFs, from which the robustness of the selected contact laws, the uncertainties of the micromechanical parameters and their interactions are all analyzed. The micro–macro correlations, which are byproducts of the probabilistic calibration, are extracted to provide insights into the multiscale mechanics of dense granular materials.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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