首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   197篇
  免费   1篇
电工技术   1篇
化学工业   7篇
金属工艺   2篇
机械仪表   6篇
建筑科学   1篇
能源动力   23篇
轻工业   5篇
水利工程   3篇
无线电   40篇
一般工业技术   16篇
冶金工业   77篇
自动化技术   17篇
  2023年   2篇
  2015年   3篇
  2014年   6篇
  2013年   6篇
  2012年   7篇
  2011年   6篇
  2010年   7篇
  2009年   2篇
  2008年   10篇
  2007年   3篇
  2006年   2篇
  2005年   8篇
  2004年   3篇
  2003年   7篇
  2002年   3篇
  2001年   2篇
  2000年   12篇
  1999年   3篇
  1998年   15篇
  1997年   12篇
  1996年   4篇
  1995年   7篇
  1994年   3篇
  1993年   2篇
  1992年   3篇
  1991年   2篇
  1990年   2篇
  1989年   2篇
  1988年   1篇
  1987年   1篇
  1986年   2篇
  1985年   4篇
  1984年   4篇
  1983年   4篇
  1982年   4篇
  1981年   3篇
  1980年   3篇
  1979年   1篇
  1978年   3篇
  1977年   3篇
  1976年   5篇
  1975年   2篇
  1974年   2篇
  1972年   2篇
  1970年   2篇
  1967年   1篇
  1966年   1篇
  1957年   1篇
  1951年   1篇
  1947年   1篇
排序方式: 共有198条查询结果,搜索用时 46 毫秒
81.
Nondeterministic weighted finite-state automata are a key abstraction in automatic speech recognition systems. The efficiency of automatic speech recognition depends directly on the sizes of these automata and the degree of nondeterminism present, so recent research has studied ways to determinize and minimize them, using analogues of classical automata determinization and minimization. Although, as we describe here, determinization can in the worst case cause poly-exponential blowup in the number of states of a weighted finite-state automaton, in practice it is remarkably successful. In extensive experiments in automatic speech recognition systems, deterministic weighted finite-state automata tend to be smaller than the corresponding nondeterministic inputs. Our observations show that these size reductions depend critically on the interplay between weights and topology in nondeterministic weighted finite-state automata. We exploit these observations to design a new approximate determinization algorithm, which produces a deterministic weighted finite-state automaton that preserves the strings of a weighted language but not necessarily their weights. We apply our algorithm to two different types of weighted finite-state automata that occur in automatic speech recognition systems and in each case provide extensive experimental results showing that, compared with current techniques, we achieve significant size reductions without affecting performance. In particular, for a standard test bed, we can reduce automatic speech recognition memory requirements by 25—35\percent with negligible effects on recognition time and accuracy. Received March 31, 1998; revised January 29, 1999.  相似文献   
82.
Conclusions The results indicate that 9 to 10% moisture in the meats is the best level for the preparation of cottonseed into flakes for solvent extraction. At lower moisture the flakes contain more fines before and after agitation in solvent, and the percolation rate of solvent through a flake bed is lower because of reduced particle size. At higher moisture the amount of oil in the hulls from the beater is greater. Also the flakes produce more fines, and the percolation rate becomes slower because of the softness and pliability of the flaked meat. It is likely that in commercial continuous operations this packing or balling up tendency of the flaked meats may lead to periodic channeling or plugging in the extractor, dryer, conveyors, and filters. These conclusions have been applied in the continuous pilot plant solvent extraction of three lots of prime cottonseed. The results substantiate the findings herein and will be reported in a separate publication. One of the laboratories of the Bureau of Agricultural and Industrial Chemistry, Agricultural Research Administration, U. S. Department of Agriculture.  相似文献   
83.
This paper, a sequel to an earlier paper by the same authors, uses a three dimensional or penalty function approach to obtain finite element solutions for plate bending problems. The advantage in using this approach is that the finite element subspaces need only be continuous; the disadvantages are that more functions are needed.In our previous paper, we used piecewise quadratic and linear functions, in the present paper we use piecewise cubic and quadratic functions with a resultant reduction of the discretization error. We also suggest an interpolation method or an a priori choice of the thickness to length ratio which are appropriate for thin or moderately thick plates. Numerical results are given for clamped and simply supported plates with point and distributed loads.  相似文献   
84.
A three-dimensional finite element method is proposed for plate bending. The displacement function is assumed to have a particular form with respect to the thickness variable.The assumed displacement function is substituted into the three-dimensional potential energy functional and a two-dimensional variational problem emerges.The two-dimensional problem is treated by the finite element method and it is seen that for conforming solutions the only requirement is continuity of the basis functions.The method includes transverse shear and thickness effects and may be used for both thin and moderately thick shells.To illustrate the method and to compare it with other results, the problems of a square plate under point and distributed loads and with simply supported and clamped boundary are treated numerically.  相似文献   
85.
Two groups of rats were trained for 50 days on different discriminations in a magazine approach paradigm. One group was trained with a negative patterning schedule and a positive patterning schedule concurrently: they received intermixed trials of A+, B+, AB-, C-, D-, CD+ (A, B, C, and D are four distinct stimuli; the plus sign denotes reinforcement with food, and the minus sign denotes nonreinforcement). The second group of rats was trained with the same four stimuli arranged as compounds and reinforced according to the biconditional schedule AB+, CD+, AC-, and BD-. The first group learned the positive patterning schedule much more quickly than the negative patterning schedule, but they learned the negative patterning schedule more effectively than the second group learned the biconditional schedule. The authors discuss the implications of these findings for models of stimulus representation. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
86.
Abello  Buchsbaum  Westbrook 《Algorithmica》2008,32(3):437-458
Abstract. We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, minimum spanning forests, bottleneck minimum spanning forests, maximal independent sets (randomized only), and maximal matchings in undirected graphs. Our I/ O bounds compete with those of previous approaches. We also introduce a semi-external model, in which the vertex set but not the edge set of a graph fits in main memory. In this model we give an improved connected components algorithm, using new results for external grouping and sorting with duplicates. Unlike previous approaches, ours is purely functional—without side effects—and is thus amenable to standard checkpointing and programming language optimization techniques. This is an important practical consideration for applications that may take hours to run.  相似文献   
87.
88.
Abstract

We present an experimental study of a four-beam optical lattice using the light scattered by the atoms in the lattice. We use both intensity correlations and observations of the transient behaviour of the scattering when the lattice is suddenly switched on. We compare results for three different configurations of the optical lattice. We create situations in which the Lamb–Dicke effect is negligible and show that, in contrast with what has been stated in some of the literature, the damping rate of the ‘coherent’ atomic oscillations can be much longer than the inelastic photon scattering rate.  相似文献   
89.
Although there have been many ignition studies of n-heptane—a primary reference fuel—few studies have provided detailed insights into the low-temperature chemistry of n-heptane through direct measurements of intermediate species formed during ignition. Such measurements provide understanding of reaction pathways that form toxic air pollutants and greenhouse gas emissions while also providing key metrics essential to the development of chemical kinetic mechanisms. This paper presents new ignition and speciation data taken at high pressure (9 atm), low temperatures (660–710 K), and a dilution of inert gases-to-molecular oxygen of 5.64 (mole basis). The detailed time-histories of 17 species, including large alkenes, aldehydes, carbon monoxide, and n-heptane were quantified using gas chromatography. A detailed chemical kinetic mechanism developed previously for oxidation of n-heptane reproduced experimentally observed ignition delay times reasonably well, but predicted levels of some important intermediate chemical species that were significantly different from measured values. Results from recent theoretical studies of low temperature hydrocarbon oxidation reaction rates were used to upgrade the chemical kinetic mechanism for n-heptane, leading to much better agreement between experimental and computed intermediate species concentrations. The implications of these results to many other hydrocarbon fuel oxidation mechanisms in the literature are discussed.  相似文献   
90.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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