首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1379篇
  免费   36篇
  国内免费   1篇
电工技术   16篇
化学工业   308篇
金属工艺   43篇
机械仪表   47篇
建筑科学   27篇
矿业工程   2篇
能源动力   65篇
轻工业   68篇
水利工程   13篇
石油天然气   6篇
无线电   148篇
一般工业技术   295篇
冶金工业   191篇
原子能技术   2篇
自动化技术   185篇
  2023年   5篇
  2022年   14篇
  2021年   22篇
  2020年   17篇
  2019年   19篇
  2018年   45篇
  2017年   47篇
  2016年   42篇
  2015年   15篇
  2014年   40篇
  2013年   78篇
  2012年   46篇
  2011年   63篇
  2010年   56篇
  2009年   65篇
  2008年   71篇
  2007年   54篇
  2006年   40篇
  2005年   45篇
  2004年   28篇
  2003年   42篇
  2002年   41篇
  2001年   23篇
  2000年   16篇
  1999年   22篇
  1998年   39篇
  1997年   25篇
  1996年   35篇
  1995年   28篇
  1994年   25篇
  1993年   24篇
  1992年   24篇
  1991年   22篇
  1990年   16篇
  1989年   19篇
  1988年   13篇
  1987年   13篇
  1986年   20篇
  1985年   19篇
  1984年   18篇
  1983年   10篇
  1982年   13篇
  1981年   16篇
  1980年   13篇
  1979年   5篇
  1978年   7篇
  1977年   17篇
  1976年   14篇
  1974年   5篇
  1973年   7篇
排序方式: 共有1416条查询结果,搜索用时 15 毫秒
991.
992.
993.
The relationship of authoritarianism (as measured by the F scale) to year of college and response set were tested and discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
994.
995.
996.
997.
In the present work, an attempt has been made to apply an efficient technique, in order to solve correlated multiple response optimization problems, in the field of submerged arc welding. The traditional grey based Taguchi approach has been extended to tackle correlated multi-objective optimization problems. The Taguchi optimization technique is based on the assumption that the quality indices (i.e. responses) are independent or uncorrelated. But, in practical cases, the assumption may not be valid always. However, the common trend in the solution of multi-objective optimization problems is to initially convert these multi-objectives into an equivalent single objective function. While deriving this equivalent objective function, different priority weights are assigned to different responses, according to their relative importance. But, there is no specific guideline for assigning these response weights. In this context, the present study aims to apply the entropy measurement technique in order to calculate the relative response weights from the analysis of entropy of the entire process. Principal Component Analysis (PCA) has been adopted to eliminate correlation that exists among the responses and to convert correlated responses into uncorrelated and independent quality indices, called principal components. These have been accumulated to calculate the overall grey relational grade, using the theory of grey relational analysis. Finally, the grey based Taguchi method has been used to derive an optimal process environment capable of producing the desired weld quality. The previously mentioned method has been applied to optimize bead geometry parameters of submerged arc bead-on-plate weldment. The paper highlights a detailed methodology of the proposed technique and its effectiveness.  相似文献   
998.
Methods for analyzing clustered survival data are gaining popularity in biomedical research. Naive attempts to fitting marginal models to such data may lead to biased estimators and misleading inference when the size of a cluster is statistically correlated with some cluster specific latent factors or one or more cluster level covariates. A simple adjustment to correct for potentially informative cluster size is achieved through inverse cluster size reweighting. We give a methodology that incorporates this technique in fitting an accelerated failure time marginal model to clustered survival data. Furthermore, right censoring is handled by inverse probability of censoring reweighting through the use of a flexible model for the censoring hazard. The resulting methodology is examined through a thorough simulation study. Also an illustrative example using a real dataset is provided that examines the effects of age at enrollment and smoking on tooth survival.  相似文献   
999.
Summary Both the drag force due to slip and the transverse force due to slip-shear have been considered in boundary layer equations. The solution has been found in a power series of non-dimensionalx, x being the distance in the down-stream direction. Solutions for high slip region and small slip region characterised byx1 andx1 respectively, have been found separately. In the high slip region the effect of increase in concentration parameter of the dust particles is to increase the magnitude of the longitudinal fluid phase velocityu. Also the magnitude of the longitudinal particle slip velocityu p -u is becoming maximum on the plate and decreasing along the plate withx. The transverse particle velocityv p is independent of but it is directly proportional to , the transverse force coefficient. An interesting result is thatv p is assuming small positive value on the plate. The transverse force has taken an important role in migration of particles away from the plate. In the small slip region the flow of dust particles is mainly governed by the fluid-phase. The effect of on the flow field in this region is to decrease the boundary layer thickness. In this region the particles are having some tendency to accumulate near the plate. Lastly, it has been found that the shearing stress, skinfriction and the dimensionless drag-coefficient on the plate increase with increase of .With 5 Figures  相似文献   
1000.
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for . In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are:
•  Reachability in graphs of genus one is logspace-equivalent to reachability in grid graphs (and in particular it is logspace-equivalent to both reachability and non-reachability in planar graphs).
•  Many of the natural restrictions on grid-graph reachability (GGR) are equivalent under reductions (for instance, undirected GGR, outdegree-one GGR, and indegree-one-outdegree-one GGR are all equivalent). These problems are all equivalent to the problem of determining whether a completed game position in HEX is a winning position, as well as to the problem of reachability in mazes studied by Blum and Kozen (IEEE Symposium on Foundations of Computer Science (FOCS), pp. 132–142, [1978]). These problems provide natural examples of problems that are hard for under reductions but are not known to be hard for  ; they thus give insight into the structure of .
•  Reachability in layered planar graphs is logspace-equivalent to layered grid graph reachability (LGGR). We show that LGGR lies in (a subclass of ).
•  Series-Parallel digraphs (on which reachability was shown to be decidable in logspace by Jakoby et al.) are a special case of single-source-single-sink planar directed acyclic graphs (DAGs); reachability for such graphs logspace reduces to single-source-single-sink acyclic grid graphs. We show that reachability on such grid graphs reduces to undirected GGR.
•  We build on this to show that reachability for single-source multiple-sink planar DAGs is solvable in .
E. Allender supported in part by NSF Grant CCF-0514155. D.A. Mix Barrington supported in part by NSF Grant CCR-9988260. S. Roy supported in part by NSF Grant CCF-0514155.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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