首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   18849篇
  免费   440篇
  国内免费   17篇
电工技术   233篇
综合类   14篇
化学工业   2599篇
金属工艺   229篇
机械仪表   335篇
建筑科学   892篇
矿业工程   42篇
能源动力   452篇
轻工业   1944篇
水利工程   263篇
石油天然气   28篇
无线电   1719篇
一般工业技术   2382篇
冶金工业   5393篇
原子能技术   142篇
自动化技术   2639篇
  2023年   68篇
  2022年   152篇
  2021年   266篇
  2020年   138篇
  2019年   200篇
  2018年   266篇
  2017年   246篇
  2016年   271篇
  2015年   251篇
  2014年   387篇
  2013年   657篇
  2012年   676篇
  2011年   916篇
  2010年   635篇
  2009年   664篇
  2008年   699篇
  2007年   674篇
  2006年   567篇
  2005年   553篇
  2004年   506篇
  2003年   469篇
  2002年   428篇
  2001年   345篇
  2000年   320篇
  1999年   439篇
  1998年   1940篇
  1997年   1178篇
  1996年   797篇
  1995年   483篇
  1994年   467篇
  1993年   462篇
  1992年   204篇
  1991年   202篇
  1990年   195篇
  1989年   192篇
  1988年   200篇
  1987年   129篇
  1986年   134篇
  1985年   183篇
  1984年   141篇
  1983年   100篇
  1982年   107篇
  1981年   111篇
  1980年   84篇
  1979年   92篇
  1978年   79篇
  1977年   133篇
  1976年   147篇
  1975年   76篇
  1974年   71篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.  相似文献   
82.
83.
84.
85.
The objective of this study was to determine the differences in the number of paving stones laid (productivity), task demands, energetic workload, body region discomfort and preference when laying paving stones with or without use of a paver’s trolley (n = 8) in a within-subject controlled study of pavers. The number of paving stones laid and the task demands were measured by means of systematic observations at the workplace. The energetic workload was determined using the percentage of heart rate reserve (%HRR). Body region discomfort was measured using visual analog scales, and the workers’ preference was ascertained via interview. The use of a paver’s trolley had no effect on productivity, %HRR or body region discomfort compared to working without a paver’s trolley. The duration of knee-straining activities did not differ between working with (141 min) and without (146 min) the paver’s trolley. However, six of the eight pavers indicated that, given suitable circumstances, they wanted to use the paver’s trolley.

Relevance to industry

To reduce the chance of work-related low back and knee complaints among pavers, the duration, frequency and intensity of lower back and knee-straining activities should be limited by means of technical measures such as mechanical paving. The paver’s trolley does not appear to reduce knee-straining activities and therefore does not appear useful in reducing the risk of knee complaints and disorders.  相似文献   
86.
A method is described to compute three- dimensional two-phase flow, allowing large density ratios and coalescence and break-up of bubbles. The level set method is used to describe interfaces, and the volume-of-fluid method is used to ensure mass conservation. Efficiency in computing the interface dynamics is achieved by using a functional relation between the level set and volume-of-fluid functions. Difficulties and remedies in re-initialization of the level set function and inaccurate compution of surface tension are discussed. Test cases for validation are described, and demanding two-bubble computations to show the generality and the versatility of the method are presented.  相似文献   
87.
Abstract The Virtual Constructing Tool (VCT) was developed at the Nijmegen School of Management in 1998. The VCT is intended to facilitate the process of writing group papers through the use of construction and communication tools and is based completely on the Internet. The VCT allows a paper to be structured by means of hyperlinking and cooperation between students. Students are allowed to divide tasks, but they are held responsible for the quality of the arguments in the paper as a whole. They are invited to spend time in dealing with validity claims and in building a valid train of thought. Producing a group paper includes four interrelated working processes: exploring the subject, exchanging information, arguing and discussing and editing. Hyperlinking offers a contribution in each of these processes which varies from associative linking of pieces of information to strengthening linear structuring. Therefore, a different perspective has been taken to that of those authors who consider hyperlinking as a tool par excellence for the nonlinear production of information.  相似文献   
88.
This paper demonstrates how evolutionary computation can be used to acquire difficult to solve combinatorial problem instances. As a result of this technique, the corresponding algorithms used to solve these instances are stress-tested. The technique is applied in three important domains of combinatorial optimisation, binary constraint satisfaction, Boolean satisfiability, and the travelling salesman problem. The problem instances acquired through this technique are more difficult than the ones found in popular benchmarks. In this paper, these evolved instances are analysed with the aim to explain their difficulty in terms of structural properties, thereby exposing the weaknesses of corresponding algorithms.  相似文献   
89.
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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