首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1706篇
  免费   56篇
电工技术   21篇
综合类   2篇
化学工业   331篇
金属工艺   13篇
机械仪表   26篇
建筑科学   50篇
矿业工程   2篇
能源动力   31篇
轻工业   197篇
水利工程   34篇
石油天然气   7篇
武器工业   2篇
无线电   132篇
一般工业技术   195篇
冶金工业   563篇
原子能技术   2篇
自动化技术   154篇
  2023年   15篇
  2022年   15篇
  2021年   41篇
  2020年   25篇
  2019年   26篇
  2018年   26篇
  2017年   19篇
  2016年   28篇
  2015年   25篇
  2014年   44篇
  2013年   67篇
  2012年   54篇
  2011年   91篇
  2010年   76篇
  2009年   69篇
  2008年   67篇
  2007年   77篇
  2006年   76篇
  2005年   56篇
  2004年   54篇
  2003年   41篇
  2002年   42篇
  2001年   30篇
  2000年   40篇
  1999年   28篇
  1998年   66篇
  1997年   40篇
  1996年   37篇
  1995年   37篇
  1994年   36篇
  1993年   30篇
  1992年   30篇
  1991年   19篇
  1990年   35篇
  1989年   25篇
  1988年   22篇
  1987年   16篇
  1986年   15篇
  1985年   29篇
  1984年   16篇
  1983年   13篇
  1982年   11篇
  1981年   20篇
  1980年   12篇
  1979年   11篇
  1978年   15篇
  1977年   9篇
  1976年   20篇
  1975年   11篇
  1973年   7篇
排序方式: 共有1762条查询结果,搜索用时 140 毫秒
41.
We give matching upper and lower bounds of \(\varTheta(\min(\frac{\log m}{\log \log m},\, n))\) for the individual step complexity of a wait-free m-valued adopt-commit object implemented using multi-writer registers for n anonymous processes. While the upper bound is deterministic, the lower bound holds for randomized adopt-commit objects as well. Our results are based on showing that adopt-commit objects are equivalent, up to small additive constants, to a simpler class of objects that we call conflict detectors. Our anonymous lower bound also applies to the individual step complexity of m-valued wait-free anonymous consensus, even for randomized algorithms with global coins against an oblivious adversary. The upper bound can be used to slightly improve the cost of randomized consensus against an oblivious adversary. For deterministic non-anonymous implementations of adopt-commit objects, we show a lower bound of \(\varOmega(\min(\frac{\log m}{\log \log m}, \frac{\sqrt{\log n}}{\log \log n}))\) and an upper bound of \(O(\min(\frac{\log m}{\log \log m},\, \log n))\) on the worst-case individual step complexity. For randomized non-anonymous implementations, we show that any execution contains at least one process whose steps exceed the deterministic lower bound.  相似文献   
42.
Two different combinatorial mutagenesis experiments on the light-harvestingII (LH2) protein of Rhodobacter capsulatus indicate that heuristicrules relating sequence directly to phenotype are dependenton which sets or groups of residues are mutated simultaneously.Previously reported combinatorial mutagenesis of this chromogenicprotein (based on both phylogenetic and structural models) showedthat substituting amino acids with large molar volumes at Glyß31caused the mutated protein to have a spectrum characteristicof light-harvesting I (LH1). The six residues that underwentcombinatorial mutagenesis were modeled to lie on one side ofa transmembrane -helix that binds bacteriochlorophyll. In asecond experiment described here, we have not used structuralmodels or phylogeny in choosing mutagenesis sites. Instead,a set of six contiguous residues was selected for combinatorialmutagenesis. In this latter experiment, the residue substitutedat Glyß31 was not a determining factor in whetherLH2 or LH1 spectra were obtained; therefore, we conclude thatthe heuristic rules for phenotype prediction are context dependent.While phenotype prediction is context dependent, the abilityto identify elements of primary structure causing phenotypediversity appears not to be. This strengthens the argument forperforming combinatorial mutagenesis with an arbitrary groupingof residues if structural models are unavailable.  相似文献   
43.
Enthusiasm for using beaver dam analogues (BDAs) to restore incised channels and riparian corridors has been increasing. BDAs are expected to create a similar channel response to natural beaver dams by causing channel bed aggradation and overbank flow, which subsequently raise water tables and support vegetation growth. However, lack of funding for monitoring projects post‐restoration has limited research on whether BDAs actually cause expected channel change in the Front Range and elsewhere. Geomorphic and hydrologic response to BDAs was monitored in two watersheds 1 year post‐restoration. BDAs were studied at Fish Creek, a steep mountainous catchment, and Campbell Creek, a lower gradient piedmont catchment from May to October 2018. At each restoration site, the upstream‐ and downstream‐most BDAs were chosen for intensive study in comparison with unrestored reference reaches. Monitoring focused on quantifying sediment volumes in BDA ponds and recording changes to stream stage and riparian groundwater. Despite differences in physical basin characteristics, BDA pools at both sites stored similar volumes of sediment and stored more sediment than reference pools. Sediment storage is positively correlated to BDA height and pool surface area. However, BDAs did not have a significant influence on shallow groundwater. The lack of groundwater response proximal to BDAs could indicate that local watershed factors have a stronger influence on groundwater response than restoration design 1 year post‐restoration. Systematic, long‐term studies of channel and floodplain response to BDAs are needed to better understand how BDAs will influence geomorphology and hydrology.  相似文献   
44.
45.
46.
47.
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide information about the real-time ordering of those events. We consider the space complexity of wait-free implementations of timestamps from shared read-write registers in a system of n processes. We prove an lower bound on the number of registers required. If the timestamps are elements of a nowhere dense set, for example the integers, we prove a stronger, and tight, lower bound of n. However, if timestamps are not from a nowhere dense set, this bound can be beaten: we give an implementation that uses n − 1 (single-writer) registers. We also consider the special case of anonymous implementations, where processes are programmed identically and do not have unique identifiers. In contrast to the general case, we prove anonymous timestamp implementations require n registers. We also give an implementation to prove that this lower bound is tight. This is the first anonymous timestamp implementation that uses a finite number of registers.  相似文献   
48.
Jaeger NA  Rahmatian F 《Applied optics》1994,33(28):6686-6691
Here we point out that in their comment Bastiaansen et al. Appl. Opt. 33, this issue (1994)] overlooked both the context of and the assumptions in Jaeger and Lai's paper [Appl. Opt. 31, 7183-7190 (1992)]. This omission appears to have resulted in their applying the Jaeger and Lai method inappropriately to a particular rib waveguide structure, yielding strange results. Therefore we present the underlying theory and ad hoc a simple and theoretically consistent method for applying it to rib waveguides. We demonstrate that good results may be obtained for a weakly guiding rib waveguide structure when field separability may be assumed, i.e., one that better meets the assumptions; this structure was chosen because numerical results were available for comparison.  相似文献   
49.
Directly linking air quality and watershed models could provide an effective method for estimating spatially-explicit inputs of atmospheric contaminants to watershed biogeochemical models. However, to adequately link air and watershed models for wet deposition estimates, each model’s temporal and spatial representation of precipitation needs to be consistent. We explore how precipitation implemented within the Community Multi-Scale Air Quality Model (CMAQ) model algorithms, and multiple spatially-explicit precipitation datasets that could be used to improve the CMAQ model deposition estimates, links with the standard precipitation sources used to calibrate watershed models (i.e., rain gage data) via modeled water fluxes. Simulations are run using a grid-based watershed mercury model (GBMM) in two watersheds. Modeled monthly runoff suggests that multiple resolution Parameter-elevations Regressions on Independent Slopes Model (PRISM) and National Multi-sensor Precipitation Analysis Stage IV (NPA) data generate similar monthly runoff estimates, with comparable or greater accuracy when evaluated against stream gage data than that produced by the base rain gage data. However, across longer time periods, simulated water balances using 36 km Pennsylvania State University/National Center for Atmospheric Research mesoscale model (MM5) data are similar to that of base data. The investigation also examines the implications our results, providing suggestions for linking air quality and watershed fate and transport models.  相似文献   
50.
This article presents an application and a simulation study of model fit criteria for selecting the optimal degree of smoothness for penalized splines in Cox models. The criteria considered were the Akaike information criterion, the corrected AIC, two formulations of the Bayesian information criterion, and a generalized cross-validation method. The estimated curves selected by the five methods were compared to each other in a study of rectal cancer mortality in autoworkers. In the stimulation study, we estimated the fit of the penalized spline models in six exposure-response scenarios, using the five model fit criteria. The methods were compared on the basis of a mean squared error score and the power and size of hypothesis tests for any effect and for detecting nonlinearity. All comparisons were made across a range in the total sample size and number of cases.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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