全文获取类型
收费全文 | 228篇 |
免费 | 12篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 43篇 |
金属工艺 | 3篇 |
机械仪表 | 1篇 |
建筑科学 | 9篇 |
能源动力 | 9篇 |
轻工业 | 25篇 |
水利工程 | 2篇 |
石油天然气 | 3篇 |
无线电 | 17篇 |
一般工业技术 | 25篇 |
冶金工业 | 87篇 |
原子能技术 | 2篇 |
自动化技术 | 14篇 |
出版年
2024年 | 1篇 |
2023年 | 1篇 |
2021年 | 1篇 |
2020年 | 7篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 4篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 4篇 |
2013年 | 6篇 |
2012年 | 3篇 |
2011年 | 11篇 |
2010年 | 8篇 |
2009年 | 7篇 |
2008年 | 18篇 |
2007年 | 9篇 |
2006年 | 6篇 |
2005年 | 5篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 7篇 |
2001年 | 1篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 29篇 |
1997年 | 14篇 |
1996年 | 10篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 1篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1974年 | 3篇 |
1972年 | 1篇 |
1970年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有241条查询结果,搜索用时 15 毫秒
1.
Business publications and the popular press have stressed the importance of creating conditions for meaningful employee expression in work roles, also known as engagement. Few empirical studies, however, have examined how individual or situational factors relate to engagement. Consequently, this study examines the interplay between employee age, perceived coworker age composition, and satisfaction with older (older than 55) and younger (younger than 40) coworkers on engagement using a sample of 901 individuals employed in the United Kingdom. Results indicated that satisfaction with one's coworkers related significantly to engagement. Moreover, perceived age similarity was associated with higher levels of engagement among older workers when they were highly satisfied with their coworkers over 55 and lower levels of engagement when they were not. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
2.
3.
4.
5.
6.
Jay R Hoffman Jie Kang Nicholas A Ratamess Peter F Jennings Gerald Mangine Avery D Faigenbaum 《Journal of the International Society of Sports Nutrition》2006,3(1):35-7
Background
The purpose of this study was to examine the effect of nutritionally enriched JavaFit™ (JF) coffee (450 mg of caffeine, 1200 mg of garcinia cambogia, 360 mg of citrus aurantium extract, and 225 mcg of chromium polynicotinate) on resting oxygen uptake (VO2), respiratory exchange ratio (RER), heart rate (HR), and blood pressure (BP) in healthy and physically active individuals. 相似文献7.
8.
Allen Avery 《软件》2008,(12)
在石油开采和生产过程中,流量测量的准确性比以往任何时候都更加重要了。目前全球的经济形势导致了石油需求的下降,因此石油价格最近开始了回落,不过据预测石油价格还会回升的。因为现在在非传统沉积物中开采石油是相当困难的,多相流的存在导致准确测量流量也变得更加困难。为了能够优化油井的生产并且准确计算出他们开采出的油量和天然气量,经营者开始寻求大量的方法来测量多相流。 相似文献
9.
10.
Two mobile agents, starting from different nodes of a network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds. Each agent has a distinct integer label from the set \(\{1,\ldots ,L\}\). Two main efficiency measures of rendezvous are its time (the number of rounds until the meeting) and its cost (the total number of edge traversals). We investigate tradeoffs between these two measures. A natural benchmark for both time and cost of rendezvous in a network is the number of edge traversals needed for visiting all nodes of the network, called the exploration time. Hence we express the time and cost of rendezvous as functions of an upper bound E on the time of exploration (where E and a corresponding exploration procedure are known to both agents) and of the size L of the label space. We present two natural rendezvous algorithms. Algorithm Cheap has cost O(E) (and, in fact, a version of this algorithm for the model where the agents start simultaneously has cost exactly E) and time O(EL). Algorithm Fast has both time and cost \(O(E\log L)\). Our main contributions are lower bounds showing that, perhaps surprisingly, these two algorithms capture the tradeoffs between time and cost of rendezvous almost tightly. We show that any deterministic rendezvous algorithm of cost asymptotically E (i.e., of cost \(E+o(E)\)) must have time \(\varOmega (EL)\). On the other hand, we show that any deterministic rendezvous algorithm with time complexity \(O(E\log L)\) must have cost \(\varOmega (E\log L)\). 相似文献