首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   190篇
  免费   9篇
电工技术   2篇
化学工业   41篇
金属工艺   1篇
机械仪表   1篇
建筑科学   18篇
能源动力   16篇
轻工业   7篇
水利工程   2篇
石油天然气   2篇
无线电   11篇
一般工业技术   34篇
冶金工业   19篇
自动化技术   45篇
  2023年   1篇
  2022年   3篇
  2021年   2篇
  2020年   5篇
  2019年   8篇
  2018年   3篇
  2017年   4篇
  2016年   5篇
  2015年   2篇
  2014年   4篇
  2013年   12篇
  2012年   11篇
  2011年   15篇
  2010年   13篇
  2009年   20篇
  2008年   16篇
  2007年   8篇
  2006年   11篇
  2005年   7篇
  2004年   4篇
  2003年   9篇
  2002年   5篇
  2001年   1篇
  2000年   3篇
  1999年   3篇
  1998年   2篇
  1997年   3篇
  1996年   8篇
  1995年   5篇
  1994年   1篇
  1992年   2篇
  1976年   2篇
  1973年   1篇
排序方式: 共有199条查询结果,搜索用时 31 毫秒
1.
A system based on ROOT for handling the micro-DST of the BaBar experiment is described. The purpose of the Kanga system is to have micro-DST data available in a format well suited for data distribution within a world-wide collaboration with many small sites. The design requirements, implementation and experience in practice after three years of data taking by the BaBar experiment are presented.  相似文献   
2.
The study revealed that Fixed Price, Cost Plus and Purchased Labour contracts are the top three maintenance contracts adopted whilst Unit Price, Cost Plus A Percentage Fee contracts are alternatives used in the Kingdom. Some other types of maintenance contract were thought to be inappropriate by ministry departments.  相似文献   
3.
Summary We propose hot-potato (or, deflection) packet routing algorithms on the two-dimensional mesh. The algorithms are strongly greedy in the sense that they attempt to send packets in good directions whenever possible. Furthermore, the routing operations are simple and independent of the time that has elapsed. The first algorithm gives the best evacuation time known for delivering all the packets to their destinations. A batch ofk packets with maximal source-to-destination distanced max is delivered in 2(k-1)+d max. The second algorithm improves this bound tok+d max when all packets are destined to the same node. This also implies a new bound for the multitarget case, which is the first to take into account the number of in-edges of a node. The third algorithm is designed for routing permutations with source-to-destination distance at most three, in which case the algorithm terminates in at most seven steps. We also show a lower bound of five steps for this problem. Ishai Ben-Aroya received the B.A. and M.Sc. in computer science from the Technion (Israel Institute of Technology). He is currently working with Microsoft Israel R&D group. His main interests include Routing Algorithms, Cryptography and Computer Security. Tamar Eilam received the B.A. degree in Computer Science from the Technion IIL in 1995, and is currently studying towards her M.A. degree. Assaf Schuster received his B.A., M.A. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem (the last one in 1991). He is currently a lecturer at the Technion IIL. His main interests include Networks and Routing Algorithms, Parallel and Distributed Computation, Optical Computation and Communication, Dynamically Reconfiguring Networks, and Greedy Hot Potato Routing.This work was supported in part by the French-Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science. An extended abstract appeared in proc. 2nd European Symposium on Algorithms, September 1994  相似文献   
4.
Models of semantic relatedness have usually focused on language-based distributional information without taking into account “experiential data” concerning the embodied sensorial source of the represented concepts. In this paper, we present an integrative cognitive model of semantic relatedness. The model – semantic family resemblance – uses a variation of the co-product as a mathematical structure that guides the fusion of distributional and experiential information. Our algorithm provides superior results in a set expansion task and a significant correlation with two benchmarks of human rated word-pair similarity datasets.  相似文献   
5.
In order to obtain high quality data, the correction of atmospheric perturbations acting upon land surface reflectance measurements recorded by a space-based sensor is an important topic within remote sensing. For many years the Second Simulation of the Satellite Signal in the Solar Spectrum (6S) radiative transfer model and the Simplified Method for Atmospheric Correction (SMAC) codes have been used for this atmospheric correction, but previous studies have shown that in a number of situations the quality of correction provided by the SMAC is low. This paper describes a method designed to improve the quality of the SMAC atmospheric correction algorithm through a slight increase in its computational complexity. Data gathered from the SEVIRI aboard Meteosat Second Generation (MSG) is used to validate the additions to SMAC, both by comparison to simulated data corrected using the highly accurate 6S method and by comparison to in-situ and 6S corrected SEVIRI data gathered for two field sites in Africa. The additions to the SMAC are found to greatly increase the quality of atmospheric correction performed, as well as broaden the range of atmospheric conditions under which the SMAC can be applied. When examining the Normalised Difference Vegetation Index (NDVI), the relative difference between SMAC and in-situ values decreases by 1.5% with the improvements in place. Similarly, the mean relative difference between SMAC and 6S reflectance values decreases by a mean of 13, 14.5 and 8.5% for Channels 1, 2 and 3 respectively. Furthermore, the processing speed of the SMAC is found to remain largely unaffected, with only a small increase in the time taken to process a full SEVIRI scene. Whilst the method described within this paper is only applicable to SEVIRI data, a similar approach can be applied to other data sources than SEVIRI, and should result in a similar accuracy improvement no matter which instrument supplies the original data.  相似文献   
6.
We describe a heuristic control policy for a general finite‐horizon stochastic control problem, which can be used when the current process disturbance is not conditionally independent of the previous disturbances, given the current state. At each time step, we approximate the distribution of future disturbances (conditioned on what has been observed) by a product distribution with the same marginals. We then carry out dynamic programming (DP), using this modified future disturbance distribution, to find an optimal policy, and in particular, the optimal current action. We then execute only the optimal current action. At the next step, we update the conditional distribution, and repeat the process, this time with a horizon reduced by one step. (This explains the name ‘shrinking‐horizon dynamic programming’). We explain how the method can be thought of as an extension of model predictive control, and illustrate our method on two variations on a revenue management problem. Copyright © 2010 John Wiley & Sons, Ltd.  相似文献   
7.
We study a single machine scheduling and due-window assignment problem. In addition to the traditional decisions regarding sequencing the jobs and scheduling the due-window, we allow an option for performing a maintenance activity. This activity requires a fixed time interval during which the machine is turned off and no production is performed. On the other hand, after the maintenance time, the machine becomes more efficient, as reflected in the new shortened job processing times. The objective is to schedule the jobs, the due-window and the maintenance activity, so as to minimize the total cost consisting of earliness, tardiness, and due-window starting time and size. We introduce an efficient (polynomial time) solution for this problem.  相似文献   
8.
Design organizations play a major role in the construction industry: they are the media that transfer the requirements of the client to the contractor and ensure that they are met. Thus they need to provide a high quality of service to ensure that their client's project achieves the best possible standards of cost, time and quality. Seventy quality practices (QP) were identified as having a bearing on the quality of service provided by the local design organizations. These quality practices were grouped into fifteen sections termed quality sections (QS). The prevalence of these practices among the local design organizations was surveyed and determined. The results indicate a significant need for improvement in the quality sections ‘working relationship’, ‘employee training and education’, and ‘performance quality audit’. The study reveals the need for the establishment of a design code, and evaluation standards for local design organizations.  相似文献   
9.
Following several recent papers discussing various problems of scheduling a maintenance activity, we focus here on scheduling a maintenance activity on unrelated parallel machines. The objective is to minimize flow-time. In the basic setting, we assume that all the machines must be maintained simultaneously. The problem is known to be NP-hard, and we introduce and test numerically an efficient heuristic and a lower bound, both based on a solution of a matching problem. We also study the relaxed version, where the machines are not restricted to be maintained at the same time. Similar heuristic and lower bound are proposed and tested.  相似文献   
10.
Nickel catalysts with a load of 5 wt.% Ni, supported on pure ZrO2 and ZrO2 stabilized with 4 mol%, 8 mol% and 12 mol% of Y2O3, were prepared by the polymerization method. The samples were characterized by X-ray diffraction (XRD), temperature-programmed reduction with hydrogen (TPR-H2), specific surface area (BET) and electronic paramagnetic resonance (EPR) and tested as catalysts for carbon dioxide reforming of methane. The XRD patterns showed the presence of the oxide precursor (NiO) and the tetragonal phase of a Y2O3–ZrO2 solid solution. According to the TPR-H2 analysis, the reduction of various NiO species was influenced by the composition of the support. Catalytic tests were conducted at 800 °C for 6 h, and the composition of the gaseous products and the catalytic conversion rate depended on the composition of the Y2O3–ZrO2 solid solution and its influence on the supported NiO species. A direct relation was observed between the variation in the support, the nickel species supported on it and the performance in the catalytic tests.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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