首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7436篇
  免费   102篇
  国内免费   4篇
电工技术   48篇
综合类   6篇
化学工业   470篇
金属工艺   82篇
机械仪表   95篇
建筑科学   162篇
矿业工程   6篇
能源动力   138篇
轻工业   309篇
水利工程   17篇
石油天然气   10篇
无线电   355篇
一般工业技术   653篇
冶金工业   4749篇
原子能技术   61篇
自动化技术   381篇
  2022年   28篇
  2021年   39篇
  2020年   35篇
  2019年   47篇
  2018年   34篇
  2017年   42篇
  2016年   46篇
  2015年   43篇
  2014年   55篇
  2013年   130篇
  2012年   119篇
  2011年   143篇
  2010年   116篇
  2009年   109篇
  2008年   127篇
  2007年   138篇
  2006年   108篇
  2005年   87篇
  2004年   104篇
  2003年   100篇
  2002年   95篇
  2001年   80篇
  2000年   74篇
  1999年   225篇
  1998年   1435篇
  1997年   846篇
  1996年   582篇
  1995年   321篇
  1994年   276篇
  1993年   286篇
  1992年   91篇
  1991年   111篇
  1990年   115篇
  1989年   88篇
  1988年   112篇
  1987年   99篇
  1986年   63篇
  1985年   98篇
  1984年   31篇
  1983年   43篇
  1982年   49篇
  1981年   50篇
  1980年   60篇
  1979年   34篇
  1978年   41篇
  1977年   125篇
  1976年   280篇
  1975年   19篇
  1974年   23篇
  1973年   28篇
排序方式: 共有7542条查询结果,搜索用时 15 毫秒
101.
 We look at the task of computing the time-evolution of a non-linear system for a long time, in our case under random external influences. Our specific example is the fatigue evaluation of a wind turbine. To facilitate such a computation, we look at a reduction of the computational effort by projecting everything on a low-dimensional basis. In this case we take the Karhunen-Loève basis generated from running the model a little while under the random loading. It is important that the error which is caused by this reduction process can be controlled. We estimate the error by dual or adjoint methods. This in turn allows the process of model reduction to be performed adaptively. Dedicated to the memory of Prof. Mike Crisfield, for his cheerfulness and cooperation as a colleague and friend over many years.  相似文献   
102.
103.
104.
Conducted 2 laboratory experiments with 117 undergraduates to examine (1) the effect of assigned goal difficulty on arousal (self-report and heart rate), cognition (perceived norm, self-efficacy strength, and personal goal), and behavioral (task performance) measures and (2) the role of heart rate as a mediator of the goal-difficulty–performance relation. All Ss performed a task requiring cognitive and physical responses. Results of both experiments demonstrate that assigned goal difficulty affected heart rate, cognition, and task performance and that heart rate change was positively related to the cognitive and behavioral measures. Regression analyses suggested that a cognitive–affective mechanism may mediate the goal-difficulty–performance relation. Discussion is focused on the theoretical and practical implications of integrating an arousal concept within goal-setting theory. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
105.
106.
The purpose of this study was to investigate self-disclosure, emotion-focused, and problem-focused coping styles among men with borderline hypertension and two groups of normotensive men differentiated by parental hypertension. Because blood pressure reactivity may discriminate between hypertensive and normotensive men, subjects in these three groups were categorized as high or low cardiovascular reactors based on their blood pressure response to a mental arithmetic task. Self-disclosure and coping styles were investigated in relation to status effects within the doctor-patient relationship. Men with exaggerated blood pressure reactivity were less self-disclosive and used fewer emotion-focused coping strategies than men with no blood pressure reactivity. Normotensives with a history of parental hypertension were less self-disclosive than normotensives without a history of parental hypertension.  相似文献   
107.
108.
109.
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.A preliminary version of this article appeared in MFCS 2005.  相似文献   
110.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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