首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   669篇
  免费   10篇
  国内免费   1篇
电工技术   3篇
综合类   1篇
化学工业   120篇
金属工艺   28篇
机械仪表   5篇
建筑科学   15篇
矿业工程   2篇
能源动力   8篇
轻工业   75篇
水利工程   2篇
无线电   69篇
一般工业技术   102篇
冶金工业   174篇
原子能技术   7篇
自动化技术   69篇
  2022年   6篇
  2021年   5篇
  2020年   5篇
  2019年   9篇
  2018年   5篇
  2017年   4篇
  2016年   12篇
  2015年   6篇
  2014年   15篇
  2013年   21篇
  2012年   19篇
  2011年   23篇
  2010年   16篇
  2009年   14篇
  2008年   23篇
  2007年   21篇
  2006年   23篇
  2005年   17篇
  2004年   16篇
  2003年   13篇
  2002年   11篇
  2001年   14篇
  2000年   19篇
  1999年   9篇
  1998年   55篇
  1997年   29篇
  1996年   29篇
  1995年   28篇
  1994年   14篇
  1993年   19篇
  1992年   12篇
  1991年   16篇
  1990年   7篇
  1989年   6篇
  1988年   4篇
  1987年   8篇
  1986年   13篇
  1985年   9篇
  1984年   9篇
  1983年   9篇
  1982年   9篇
  1981年   10篇
  1980年   15篇
  1979年   4篇
  1978年   7篇
  1977年   5篇
  1976年   8篇
  1972年   5篇
  1971年   5篇
  1968年   4篇
排序方式: 共有680条查询结果,搜索用时 31 毫秒
91.
Deviation in Fat Content of Different Oil Yielding Plants To get an insight into the factors and their intensity causing deviation in the oil content of some of the oil yielding plants, the deviating components of winter rape, sunflower, linseed, soybean and mustard species were determined with the help of variance analysis, carried out in widely different experiments with cultivated material as well as in value and control tests. The greatly varying extreme values of the fat content resulted from environmental factors, yearly and local effects as well as genetically dependent family and species differences. The standard deviations show quite clearly that the effects of year, location and species are different in different oil yielding plants.  相似文献   
92.
In this paper we propose a distributed symbolic algorithm for model checking of propositional μ-calculus formulas. μ-calculus is a powerful formalism and μ-calculus model checking can solve many problems, including, for example, verification of (fair) CTL and LTL properties. Previous works on distributed symbolic model checking were restricted to reachability analysis and safety properties. This work thus significantly extends the scope of properties that can be verified distributively, enabling us to use them for very large designs.The algorithm distributively evaluates subformulas. It results in sets of states which are evenly distributed among the processes. We show that this algorithm is scalable and therefore can be implemented on huge distributed clusters of computing nodes. The memory modules of the computing nodes collaborate to create a very large memory space, thus enabling the checking of much larger designs. We formally prove the correctness of the parallel algorithm. We complement the distribution of the state sets by showing how to distribute the transition relation.This research was supported by The Israel Science Foundation (grant number 111/01-2) and by a grant from Intel Academic Relations.  相似文献   
93.
Rate-distortion optimal video summary generation.   总被引:1,自引:0,他引:1  
The need for video summarization originates primarily from a viewing time constraint. A shorter version of the original video sequence is desirable in a number of applications. Clearly, a shorter version is also necessary in applications where storage, communication bandwidth, and/or power are limited. The summarization process inevitably introduces distortion. The amount of summarization distortion is related to its "conciseness," or the number of frames available in the summary. If there are m frames in the original sequence and n frames in the summary, we define the summarization rate as m/n, to characterize this "conciseness". We also develop a new summarization distortion metric and formulate the summarization problem as a rate-distortion optimization problem. Optimal algorithms based on dynamic programming are presented and compared experimentally with heuristic algorithms. Practical constraints, like the maximum number of frames that can be skipped, are also considered in the formulation and solution of the problem.  相似文献   
94.
Properties are given for as-deposited and heat-treated carbon-felt, carbon-matrix composites infiltrated at deposition temperatures of 1100 and 1400°C, and pressures of 20 and 630 Torr. A thermal stress figure of merit was calculated for each material, with the heat-treated composite infiltrated at 1400°C and 630 Torr yielding the highest value. As with most graphitizing carbon materials, heat-treatment resulted in a decrease of the flexural strengths and moduli. The strength-to-modulus ratios, however, increased, being highest for deposition conditions of 1400°C and 630 Torr. Heat-treatment also resulted in an increase in thermal conductivity and a decrease in thermal expansion. These changes were related to the degree of crystallinity and to the formation of cracks within the matrix.  相似文献   
95.
The deformities observed in 2 Clydesdale foals are described. Both had abnormal joint positions in the forelimbs and discrepancies in the symmetry of the vertebral column. The changes were only mild in one case but extreme in the other where it was accompanied by torticollis, scoliosis and vertebral fusion. A comparison is made with deformities described in the contracted foal syndrome and some of the developmental implications discussed.  相似文献   
96.
Investigations on the Effectiveness of Preservatives in Anion Active Surfactants The preserving action of five preservatives was tested at pH values of 6, 7 and 8 in 10% solutions of the anion active surfactants sodium lauryl sulfate, protein-fatty acid condensate and sodium laurylether sulfate. It was found that the three difficultly water-soluble compounds p-chloro-m-cresol, pentachlorophenol and the combined methyl and ethyl esters of the p.H.B. esters are ineffective at usual concentrations. Both of the watersoluble preservatives polyoxymethyleneglycol and chloroacetamide were effective. Furthermore, it was observed that the preservative action of chloroacetamide is enhanced by anion active surfactants. The inactivation of the difficulty watersoluble preservatives is traced back to the solubilization of these compounds by the micelle of the anion active surfactants.  相似文献   
97.
Summary Gas chromatography has been employed to determine partial molar free energies of sorption, C1 s, as well as partial molar free energies of mixing, C1 , of atactic poly(styrene) with linear and branched alkanes (C6-C9), alkenes (C8), cyclohexane and alkylbenzenes (Ph-H to PhC6H13) within the temperature range from 403 to 463 K. The influence of nature and constitution of the solute molecule on sorption and mixing properties in poly(styrene) are discussed in terms of the competing group contributions of the components. Knowledge of this influence may be transduced to understand polymer-polymer compatibility. The cohesive energy density concept has been used to calculate the infinite dilution solubility parameter for the polymer, with the aid of G 1 . From the high temperature range the HILDEBRAND parameter 2 was extrapolated to 298 K. The value obtained, 9.14, indicates that gas chromatography is an promising alternative to the conventional methods for determination of the solubility parameter for polymers.Herrn Prof. Dr. R. C. Schulz zu seinem 65. Geburtstag herzlichst gewidmet  相似文献   
98.
Zusammenfassung Es wird eine geeignete Extraktionsmethode zur Isolierung des Pilzeiweißes sowie seine Abtrennung von den Zuckern und Mineralstoffen beschrieben. Ein kombiniertes Hydrolyseverfahren erlaubt es, die einzelnen Aminosäuren möglichst verlustfrei in Lösung zu bekommen. Der qualitative Nachweis der Aminosäuren erfolgte mit Hilfe der zweidimensionalen Papierchromatographie. Zur quantitativen Bestimmung dient die eindimensionale Chromatographie auf gepuffertem Papier, wobei zur Ermittlung der Farbintensitäten in jedem Versuch eine Aminosäuremischung bekannter Zusammensetzung mitläuft. Bei der Mehrzahl der Aminosauren wird die Intensität der Ninhydrinfärbung nach dem Ablösen vom Papier im Pulfrich-Photometer gemessen. Besondere Farbreaktionen werden zur Bestimmung des Tryptophans, Prolins, Histidins und Cystins herangezogen.Anhand des beschriebenen Extraktionsverfahrens wird das wahre Eiweiß in den untersuchten Pilzen bestimmt. Hierbei werden wesentlich niedrigere Werte gefunden, als sonst in der Literatur angegeben werden. Die Eiweißverluste beim Trocknen und Lagern bewegen sich in mäßigen Grenzen. Qualitativ werden alle wichtigen Aminosäuren im Pilzeiweiß gefunden. Die quantitative Verteilung der Aminosäuren ist innerhalb der einzelnen Pilzarten oft recht unterschiedlich. Hingegen kann bei ein und derselben Pilzsorte kein großer Unterschied in der quantitativen Zusammensetzung des Eiweilßes der jungen oiler alten Pilze gefunden werden.Das Eiweiß der eiweißreichsten Pilze (Champignon, Steinpilz) steht in seinem biologischen Wert zwischen pflanzlichem and tierischem Eiweiß. Alle Speisepilze sind im Vergleich zum Weizen- und Erbseneiweiß arm an Isoleucin und mit Ausnahme des Steinpilzes auch arm an Methionin.Auszug aus der Dissertation vonHugo Schuster: Qualitative and quantitative Aminosäurebestimmung der wiehtigsten Speisepilze . Univ. Würzburg 1956.  相似文献   
99.
Recently, Chinn et al. [10] presented lower bounds for store-and-forward permutation routing algorithms on the n \times n mesh with bounded buffer size and where a packet must take a shortest (or minimal ) path to its destination. We extend their analysis to algorithms that are nearly minimal. We also apply this technique to the domain of hot potato algorithms, where there is no storage of packets and the shortest path to a destination is not assumed (and is in general impossible). We show that ``natural' variants and ``improvements' of several algorithms in the literature perform poorly in the worst case. As a result, we identify algorithmic features that are undesirable for worst-case hot potato permutation routing. Recent works in hot potato routing have tried to define simple and greedy classes of algorithms. We show that when an algorithm is too simple and too greedy, its performance in routing permutations is poor in the worst case. Specifically, the technique of [10] is also applicable to algorithms that do not necessarily send packets in minimal or even nearly minimal paths: it may be enough that they naively attempt to do so when possible. In particular, our results show that a certain class of greedy algorithms that was suggested recently by Ben-Dor et al. [6] contains algorithms that have poor performance in routing worst-case permutations. Received August 24, 1995; revised May 27, 1997.  相似文献   
100.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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