首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   133篇
  免费   4篇
电工技术   2篇
化学工业   21篇
金属工艺   1篇
机械仪表   1篇
建筑科学   9篇
轻工业   2篇
水利工程   1篇
无线电   13篇
一般工业技术   20篇
冶金工业   8篇
自动化技术   59篇
  2022年   1篇
  2021年   6篇
  2020年   5篇
  2019年   4篇
  2018年   8篇
  2016年   2篇
  2015年   4篇
  2014年   2篇
  2013年   5篇
  2012年   9篇
  2011年   5篇
  2010年   11篇
  2009年   10篇
  2008年   13篇
  2007年   7篇
  2006年   5篇
  2005年   5篇
  2004年   4篇
  2003年   1篇
  2002年   6篇
  1999年   2篇
  1998年   2篇
  1997年   3篇
  1996年   5篇
  1995年   2篇
  1990年   1篇
  1986年   2篇
  1985年   2篇
  1981年   2篇
  1980年   2篇
  1967年   1篇
排序方式: 共有137条查询结果,搜索用时 15 毫秒
31.
Solid solutions in the Gd2(Ti1-yMoy)2O7 pyrochlore system, with y = 0.1, 0.3, 0.5, and 0.7, have been investigated as potential candidates for the anode material of solid-oxide fuel cells. The electrical conductivity, stability range, and optimal synthesis conditions of the pyrochlore phase have been explored by electrical, coulometric titration, and X-ray diffractometry techniques. As the molybdenum content increases, the maximum conductivity increases to a value of 70 S/cm for y = 0.7 at 1000°C, whereas the stability range in the oxygen partial pressure (pO2) decreases to just over two orders of magnitude in pO2 in the temperature range of 600°-1000°C. A decomposition reaction that leads to decreased conductivity in oxidizing atmospheres is proposed.  相似文献   
32.
The article addresses the problem of finding a small unsatisfiable core of an unsatisfiable CNF formula. The proposed algorithm, CoreTrimmer, iterates over each internal node d in the resolution graph that ‘consumes’ a large number of clauses M (i.e., a large number of original clauses are present in the unsat core with the sole purpose of proving d) and attempts to prove them without the M clauses. If this is possible, it transforms the resolution graph into a new graph that does not have the M clauses at its core. CoreTrimmer can be integrated into a fixpoint framework similarly to Malik and Zhang’s fix-point algorithm run_till_ fix. We call this option trim_till_fix. Experimental evaluation on a large number of industrial CNF unsatisfiable formulas shows that trim_till_fix doubles, on average, the number of reduced clauses in comparison to run_till_fix. It is also better when used as a component in a bigger system that enforces short timeouts.  相似文献   
33.
Sustainable rangeland stewardship calls for synoptic estimates of rangeland biomass quantity (kg dry matter ha− 1) and quality [carbon:nitrogen (C:N) ratio]. These data are needed to support estimates of rangeland crude protein in forage, either by percent (CPc) or by mass (CPm). Biomass derived from remote sensing data is often compromised by the presence of both photosynthetically active (PV) and non-photosynthetically active (NPV) vegetation. Here, we explicitly quantify PV and NPV biomass using HyMap hyperspectral imagery. Biomass quality, defined as plant C:N ratio, was also estimated using a previously published algorithm. These independent algorithms for forage quantity and quality (both PV and NPV) were evaluated in two northern mixed-grass prairie ecoregions, one in the Northwestern Glaciated Plains (NGGP) and one in the Northwestern Great Plains (NGP). Total biomass (kg ha− 1) and C:N ratios were mapped with 18% and 8% relative error, respectively. Outputs from both models were combined to quantify crude protein (kg ha− 1) on a pasture scale. Results suggest synoptic maps of rangeland vegetation mass (both PV and NPV) and quality may be derived from hyperspectral aerial imagery with greater than 80% accuracy.  相似文献   
34.
We consider the problem of smoothing real-time streams (such as video streams), where the goal is to reproduce a variable-bandwidth stream remotely, while minimizing bandwidth cost, space requirement, and playback delay. We focus on lossy schedules, where data may be dropped due to limited bandwidth or space. We present the following results. First, we determine the optimal tradeoff between buffer space, smoothing delay, and link bandwidth for lossy smoothing schedules. Specifically, this means that if two of these parameters are given, we can precisely calculate the value for the third which minimizes data loss while avoiding resource wastage. The tradeoff is accomplished by a simple generic algorithm, that allows one some freedom in choosing which data to discard. This algorithm is very easy to implement both at the server and at the client, and it enjoys the nice property that only the server decides which data to discard, and the client needs only to reconstruct the stream.In a second set of results we study the case where different parts of the data have different importance, modeled by assigning a real weight to each packet in the stream. For this setting we use competitive analysis, i.e., we compare the weight delivered by on-line algorithms to the weight of an optimal off-line schedule using the same resources. We prove that a natural greedy algorithm is 4-competitive. We also prove a lower bound of 1.23 on the competitive ratio of any deterministic on-line algorithm. Finally, we give a few experimental results which seem to indicate that smoothing is very effective in practice, and that the greedy algorithm performs very well in the weighted case.Received: 21 November 2001, Accepted: 6 November 2003, Published online: 6 February 2004Research supported in part by Israel Ministry of Science. An extended abstract of this paper appeared in Proc. 19th ACM Symp. on Principles of Distributed Computing, July 2000.  相似文献   
35.
A common assumption in supervised machine learning is that the training examples provided to the learning algorithm are statistically identical to the instances encountered later on, during the classification phase. This assumption is unrealistic in many real-world situations where machine learning techniques are used. We focus on the case where features of a binary classification problem, which were available during the training phase, are either deleted or become corrupted during the classification phase. We prepare for the worst by assuming that the subset of deleted and corrupted features is controlled by an adversary, and may vary from instance to instance. We design and analyze two novel learning algorithms that anticipate the actions of the adversary and account for them when training a classifier. Our first technique formulates the learning problem as a linear program. We discuss how the particular structure of this program can be exploited for computational efficiency and we prove statistical bounds on the risk of the resulting classifier. Our second technique addresses the robust learning problem by combining a modified version of the Perceptron algorithm with an online-to-batch conversion technique, and also comes with statistical generalization guarantees. We demonstrate the effectiveness of our approach with a set of experiments.  相似文献   
36.
Electrochemical deposition of ruthenium on n-type silicon from an ionic liquid is reported for the first time. The study was performed by dissolving ruthenium(III) chloride in a 1-butyl-3-methyl imidazolium hexafluorophosphate (BMIPF6) room-temperature ionic liquid (RTIL). Cyclic voltammetry (CV) studies demonstrate reduction and stripping peaks at −2.1 and 0.2 V vs. Pt quasi-reference, corresponding to the deposition and dissolution of ruthenium, respectively. Metallic Ru films of ∼100 nm thickness have been deposited and were analyzed using scanning electron microscopy (SEM) and X-ray photoelectron spectroscopy (XPS).  相似文献   
37.
Obesity and type 2 diabetes (T2D) are two prevalent chronic diseases that have become a major public health concern in industrialized countries. T2D is characterized by hyperglycemia and islet beta cell dysfunction. Glucagon-like peptide 1 (GLP-1) promotes β cell proliferation and neogenesis and has a potent insulinotropic effect. Leptin receptor deficient male rats are obese and diabetic and provide a model of T2D. We hypothesized that their treatment by sustained expression of GLP-1 using encapsulated cells may prevent or delay diabetes onset. Vascular smooth muscle cells (VSMC) retrovirally transduced to secrete GLP-1 were seeded into TheraCyte(TM) encapsulation devices, implanted subcutaneously and rats were monitored for diabetes. Rats that received cell implants showed mean plasma GLP-1 level of 119.3 ± 10.2pM that was significantly elevated over control values of 32.4 ± 2.9pM (P<0.001). GLP-1 treated rats had mean insulin levels of 45.9 ± 2.3ng/ml that were significantly increased over control levels of 7.3±1.5ng/ml (P<0.001). In rats treated before diabetes onset elevations in blood glucose were delayed and rats treated after onset became normoglycemic and showed improved glucose tolerance tests. Untreated diabetic rats possess abnormal islet structures characterized by enlarged islets with α-cell infiltration and multifocal vacuolization. GLP-1 treatment induced normalization of islet structures including a mantle of α-cells and increased islet mass. These data suggest that encapsulated transduced cells may offer a potential long term treatment of patients.  相似文献   
38.
基于语音的控制系统正在经历稳健的增长,2020年达到107亿美元,预计到2026年将达到超过270亿美元.其优点不言而喻:无手操作,界面大大简化.您可以直接说出所需的内容,而无需使用导航菜单.但是,正如我们所有人所经历的那样,声音可能有其自身的弊端.当您靠近麦克风正对着它讲话时,它在安静的房间里工作正常.但在您的手机...  相似文献   
39.
Zhitomirsky-Geffet  Maayan  Bergman  Ofer  Hilel  Shir 《Scientometrics》2020,123(3):1385-1406
Scientometrics - This paper addresses the problem of information burying in social sciences, where a large amount of experimental findings reported in multiple scientific articles may be missed by...  相似文献   
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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