首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22915篇
  免费   889篇
  国内免费   83篇
电工技术   294篇
综合类   44篇
化学工业   5224篇
金属工艺   478篇
机械仪表   470篇
建筑科学   1719篇
矿业工程   161篇
能源动力   686篇
轻工业   2141篇
水利工程   182篇
石油天然气   56篇
武器工业   1篇
无线电   1486篇
一般工业技术   4167篇
冶金工业   2796篇
原子能技术   140篇
自动化技术   3842篇
  2023年   152篇
  2022年   310篇
  2021年   533篇
  2020年   312篇
  2019年   329篇
  2018年   495篇
  2017年   425篇
  2016年   533篇
  2015年   482篇
  2014年   693篇
  2013年   1516篇
  2012年   1088篇
  2011年   1526篇
  2010年   1097篇
  2009年   1046篇
  2008年   1275篇
  2007年   1105篇
  2006年   945篇
  2005年   868篇
  2004年   785篇
  2003年   693篇
  2002年   666篇
  2001年   396篇
  2000年   379篇
  1999年   416篇
  1998年   422篇
  1997年   375篇
  1996年   345篇
  1995年   294篇
  1994年   301篇
  1993年   299篇
  1992年   251篇
  1991年   214篇
  1990年   201篇
  1989年   230篇
  1988年   187篇
  1987年   177篇
  1986年   174篇
  1985年   240篇
  1984年   214篇
  1983年   184篇
  1982年   168篇
  1981年   195篇
  1980年   131篇
  1979年   148篇
  1978年   143篇
  1977年   127篇
  1976年   139篇
  1975年   120篇
  1974年   105篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
102.
The constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. This paper introduces two simple methods of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious.  相似文献   
103.
104.
The Warehouse Scheduling Problem is a deterministic multi-item inventory problem with a restriction on warehouse floor space available. We formulate a mixed integer nonlinear programming problem for the objective of minimizing long run inventory holding and order costs per unit of time. We integrate algorithms for staggering orders, described in companion papers, with a heuristic to choose the order sequences. The result is called Sequenced Staggering. We describe a new algorithm to generate order frequencies, called the powers-of-two-factor-of-three technique, as a generalization of Roundy's roundoff technique for powers-of-two policies. We report on a computational study of four hybrid algorithms for solving the warehouse scheduling problem, including the competing algorithm of Gallego, Queyranne, and Simchi-Levi. Based on these results, we recommend the combination of powers-of-two frequencies with Sequenced Staggering.  相似文献   
105.
106.
107.
Pigeons partitioned time into three intervals. Responses to one key could be reinforced after a short time, to a second key after an intermediate time, and to a third key after a long time. The values of the short, intermediate, and long times and the proportion of trials ending with reinforcement were varied. Absolute and relative response rates on each key were an orderly function of time and showed approximately proportional changes with changes in the interval values, consistent with Weber's law, Gibbon's (1977) scalar expectancy theory, and Killeen and Fetterman's (1988) behavioral theory of timing (BeT). Standard deviations of the times at which subjects switched between successive keys increased more slowly within a condition than across conditions, as predicted by BeT. Increases and decreases in reinforcement probability produced both transient and longer lasting changes in timing behavior, once again, in accord with predictions of BeT. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
108.
109.
110.
Reports an error in the original article by P. M. Lewinsohn et al ( Journal of Abnormal Psychology, 1993[Feb], Vol 102[1], 133–244). On page 140, in the Total Incidence columns in Table 4, the data for the Attention Deficit row should be switched with that for the Conduct row. (The following abstract of this article originally appeared in record 1993-25780-001.) Data were collected on the point and lifetime prevalences, 1-yr incidence, and comorbidity of depression with other Diagnostic and Statistical Manual of Mental Disorders-III-Revised (DSM-III-R) disorders in a randomly selected sample (n?=?1,710) of high school students at point of entry and at 1-yr follow-up (n?=?1,508). The Schedule for Affective Disorders and Schizophrenia for School-Age Children was used to collect diagnostic information; 9.6% met criteria for a current disorder, more than 33% had experienced a disorder over their lifetimes, and 31.7% of the latter had experienced a 2nd disorder. High relapse rates were found for all disorders, especially for unipolar depression (18.4%) and substance use (15.0%). Female Ss had significantly higher rates at all age levels for unipolar depression, anxiety disorders, eating disorders, and adjustment disorders; male Ss had higher rates of disruptive behavior disorders. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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