首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   395篇
  免费   9篇
  国内免费   1篇
工业技术   405篇
  2021年   8篇
  2020年   3篇
  2019年   11篇
  2018年   3篇
  2017年   5篇
  2016年   8篇
  2015年   5篇
  2014年   9篇
  2013年   20篇
  2012年   19篇
  2011年   19篇
  2010年   12篇
  2009年   14篇
  2008年   15篇
  2007年   19篇
  2006年   13篇
  2005年   8篇
  2004年   14篇
  2003年   6篇
  2002年   3篇
  2001年   6篇
  2000年   4篇
  1999年   2篇
  1998年   20篇
  1997年   8篇
  1996年   12篇
  1995年   12篇
  1994年   15篇
  1993年   10篇
  1992年   5篇
  1991年   8篇
  1990年   5篇
  1989年   10篇
  1988年   7篇
  1987年   2篇
  1986年   4篇
  1985年   9篇
  1984年   8篇
  1983年   2篇
  1982年   2篇
  1981年   3篇
  1980年   6篇
  1979年   4篇
  1977年   7篇
  1976年   4篇
  1975年   3篇
  1974年   4篇
  1971年   2篇
  1944年   1篇
  1926年   1篇
排序方式: 共有405条查询结果,搜索用时 46 毫秒
1.
The process of electrodeposition can be described in terms of a reaction-diffusion partial differential equation (PDE) system that models the dynamics of the morphology profile and the chemical composition. Here we fit such a model to the different patterns present in a range of electrodeposited and electrochemically modified alloys using PDE constrained optimization. Experiments with simulated data show how the parameter space of the model can be divided into zones corresponding to the different physical patterns by examining the structure of an appropriate cost function. We then use real data to demonstrate how numerical optimization of the cost function can allow the model to fit the rich variety of patterns arising in experiments. The computational technique developed provides a potential tool for tuning experimental parameters to produce desired patterns.  相似文献   
2.
Tropical corn silage was compared with sorghum silage as a basal forage in the diets of high producing dairy cows. Sorghum and tropical corn silages were each included in place of ground corn at incremental concentrations in the experimental diets. Eight separate diets were fed, four diets containing each silage ranging in forage neutral detergent fiber (NDF) from approximately 25 to 31% and ranging in total NDF from approximately 41 to 45%. Diets were arranged in a 2 x 4 factorial design and were fed to lactating cows (n = 24; pretrial mean milk production = 39 kg/d; body weight = 656 kg; and days in milk = 81). As concentrations of dietary NDF increased, intake and milk production decreased linearly. The impact of dietary NDF on intake was greater for diets based on tropical corn silage than for diets based on sorghum silage. Energy intake and milk production were reduced, but cows consumed more fiber when challenged with higher dietary concentrations of fiber. The in vitro rate and extent of digestion of dietary samples were correlated with intake response. The rate of in vitro fiber digestion was slower for samples that contained tropical corn silage than for samples that contained sorghum silage. In vivo digestibility measurements were influenced by intake and dietary composition. Results of this trial indicated that sorghum silage can have equal or slightly greater nutritional value than tropical corn silage when these forages are fed at equal concentrations of dietary fiber.  相似文献   
3.
‘Shrinking government’ and ‘Empowerment” really mean something in the standards business. New US government policies will sharply curtail the use of “MIL” specifications and standards. This dramatic move offers industry a more active role by creating new ‘performance-based’ standards. This article reviews the US department of Defence (DoD) decision and its expected consequences in the context of Aerospace Fluid Power.  相似文献   
4.
The authors report results of a study into the role of components of first-language (L1; Dutch) and second-language (L2; English) reading comprehension. Differences in the contributions of components of L1 and L2 reading comprehension are analyzed, in particular processing speed in L1 and L2. Findings indicate that regression weights of the L1 and L2 components are different. Although correlations between most processing speed components and reading comprehension are substantial, there are no unique contributions to the explanation of either L1 or L2 reading comprehension when linguistic and metacognitive knowledge are accounted for. In addition, L1 reading comprehension is shown to have a large contribution to L2 reading comprehension, supporting theories of L1-L2 transfer of reading skills. Results are discussed from a developmental perspective. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
5.
This study investigated the relationship between reading comprehension development of 389 adolescents in their dominant language (Language 1 [L1], Dutch) and a foreign language (Language 2 [L2], English). In each consecutive year from Grades 8 through 10, a number of measurements were taken. Students' reading comprehension, their linguistic knowledge (vocabulary and grammar knowledge) and processing efficiency (speed of word recognition and sentence comprehension) in both languages, and their metacognitive knowledge about reading were assessed. The relative strengths of the effects of these components of reading were analyzed to distinguish among 3 hypotheses about the relationship between L1 and L2 reading comprehension: the transfer hypothesis, the threshold hypothesis, and the processing efficiency hypothesis. The transfer hypothesis predicts a strong relationship between L1 and L2 reading comprehension and a strong effect of metacognitive knowledge on L2 reading comprehension, whereas the threshold and processing efficiency hypotheses predict a more important role of language-specific knowledge and processing skills. Results support the transfer hypothesis, although language-specific knowledge and fluency also contribute to L2 reading performance. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
6.
The rapidly growing field of nature-inspired computing concerns the development and application of algorithms and methods based on biological or physical principles. This approach is particularly compelling for practitioners in high-performance computing, as natural algorithms are often inherently parallel in nature (for example, they may be based on a “swarm”-like model that uses a population of agents to optimize a function). Coupled with rising interest in nature-based algorithms is the growth in heterogenous computing; systems that use more than one kind of processor. We are therefore interested in the performance characteristics of nature-inspired algorithms on a number of different platforms. To this end, we present a new OpenCL-based implementation of the Ant Colony Optimization algorithm, and use it as the basis of extensive experimental tests. We benchmark the algorithm against existing implementations, on a wide variety of hardware platforms, and offer extensive analysis. This work provides rigorous foundations for future investigations of Ant Colony Optimization on high-performance platforms.  相似文献   
7.
This paper introduces the notion of distributed verification without preprocessing. It focuses on the Minimum-weight Spanning Tree (MST) verification problem and establishes tight upper and lower bounds for the time and message complexities of this problem. Specifically, we provide an MST verification algorithm that achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time, where m is the number of edges in the given graph G, n is the number of nodes, and D is G’s diameter. On the other hand, we show that any MST verification algorithm must send $\tilde{\varOmega}(m)$ messages and incur $\tilde{\varOmega}(\sqrt{n} + D)$ time in worst case. Our upper bound result appears to indicate that the verification of an MST may be easier than its construction, since for MST construction, both lower bounds of $\tilde{\varOmega}(m)$ messages and $\tilde{\varOmega}(\sqrt{n} + D)$ time hold, but at the moment there is no known distributed algorithm that constructs an MST and achieves simultaneously $\tilde{O}(m)$ messages and $\tilde{O}(\sqrt{n} + D)$ time. Specifically, the best known time-optimal algorithm (using ${\tilde{O}}(\sqrt {n} + D)$ time) requires O(m+n 3/2) messages, and the best known message-optimal algorithm (using ${\tilde{O}}(m)$ messages) requires O(n) time. On the other hand, our lower bound results indicate that the verification of an MST is not significantly easier than its construction.  相似文献   
8.
This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low message complexity. In particular, if the initial dynamic tree contains only the root, then the scheme incurs an O(log4 n) amortized message complexity per topology change, where n is the current number of vertices in the tree. As a separator decomposition is a fundamental decomposition of trees used extensively as a component in many static graph algorithms, our dynamic scheme for separator decomposition may be used for constructing dynamic versions to these algorithms. The paper then shows how to use our dynamic separator decomposition to construct efficient labeling schemes on dynamic trees, using the same message complexity as our dynamic separator scheme. Specifically, we construct efficient routing schemes on dynamic trees, for both the designer and the adversary port models, which maintain optimal labels, up to a multiplicative factor of O(log log n). In addition, it is shown how to use our dynamic separator decomposition scheme to construct dynamic labeling schemes supporting the ancestry and NCA relations using asymptotically optimal labels, as well as to extend a known result on dynamic distance labeling schemes. Supported in part at the Technion by an Aly Kaufman fellowship. Supported in part by a grant from the Israel Science Foundation.  相似文献   
9.
This paper presents an industrial application of simulation-based optimization (SBO) in the scheduling and real-time rescheduling of a complex machining line in an automotive manufacturer in Sweden. Apart from generating schedules that are robust and adaptive, the scheduler must be able to carry out rescheduling in real time in order to cope with the system uncertainty effectively. A real-time scheduling system is therefore needed to support not only the work of the production planner but also the operators on the shop floor by re-generating feasible schedules when required. This paper describes such a real-time scheduling system, which is in essence a SBO system integrated with the shop floor database system. The scheduling system, called OPTIMISE scheduling system (OSS), uses real-time data from the production line and sends back expert suggestions directly to the operators through Personal Digital Assistants (PDAs). The user interface helps in generating new schedules and enables the users to easily monitor the production progress through visualization of production status and allows them to forecast and display target performance measures. Initial results from this industrial application have shown that such a novel scheduling system can help both in improving the line throughput efficiently and simultaneously supporting real-time decision making.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号