全文获取类型
收费全文 | 392篇 |
免费 | 18篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 2篇 |
综合类 | 3篇 |
化学工业 | 45篇 |
金属工艺 | 7篇 |
机械仪表 | 6篇 |
建筑科学 | 25篇 |
矿业工程 | 2篇 |
能源动力 | 9篇 |
轻工业 | 23篇 |
水利工程 | 16篇 |
石油天然气 | 3篇 |
无线电 | 13篇 |
一般工业技术 | 69篇 |
冶金工业 | 158篇 |
自动化技术 | 33篇 |
出版年
2023年 | 3篇 |
2021年 | 4篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 11篇 |
2017年 | 10篇 |
2016年 | 9篇 |
2015年 | 11篇 |
2014年 | 12篇 |
2013年 | 13篇 |
2012年 | 15篇 |
2011年 | 30篇 |
2010年 | 17篇 |
2009年 | 14篇 |
2008年 | 19篇 |
2007年 | 9篇 |
2006年 | 10篇 |
2005年 | 7篇 |
2004年 | 8篇 |
2003年 | 9篇 |
2002年 | 3篇 |
2001年 | 3篇 |
2000年 | 4篇 |
1999年 | 7篇 |
1998年 | 41篇 |
1997年 | 13篇 |
1996年 | 24篇 |
1995年 | 11篇 |
1994年 | 6篇 |
1993年 | 13篇 |
1992年 | 8篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 4篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 13篇 |
1972年 | 1篇 |
1968年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有414条查询结果,搜索用时 296 毫秒
21.
22.
23.
24.
Utilizing a signal from transistor transistor logic (TTL) circuits, the integrated power switch (IPS) can control 40 kW. Protection against overload conditions enables the use of transistors which have ideal switching characteristics. Each half-section of the IPS is electrically isolated from the signal input using optical couplers. Discrete component assemblies, printed-circuit boards, thick-film or medium-scale integrated substrates each have been utilized. The forced-air-cooled heat sink was designed for maximum cooling. Two types of IPS's were initially constructed: 500 V/60 A, and 100 V/200 A, with additional availability of 500 V/100 A devices in small quantity. Its capability to work from continuous operation to 10 kHz makes the IPS universally applicable to most power-conversion applications with-in its current and voltage limitation. 相似文献
25.
F Tangy M Ossondo JC Vernant D Smadja O Blétry AC Baglin S Ozden 《Canadian Metallurgical Quarterly》1999,179(2):497-502
Human T cell leukemia virus type I (HTLV-I) sequences were sought in labial salivary glands of patients with HTLV-I-associated myelopathy or tropical spastic paraparesis and of seropositive neurologically healthy carriers. HTLV-I proviral DNA was found by polymerase chain reaction amplification in DNA extracted from lip biopsies of every patient. Viral RNA was found by in situ hybridization in the acini epithelium, as well as in lymphocytic infiltrates. This observation suggests that HTLV-I expression in labial salivary glands could participate in the inflammatory lesions observed in these patients. Some seronegative patients with Sj?gren's syndrome or dryness syndrome were also positive for viral transactivator tax DNA (41% in Martinique and 16% in non-HTLV-I-endemic region). Despite histologic signs of lymphocytic infiltration, no viral expression was found in the labial salivary glands of these patients. 相似文献
26.
M. Bl?ser 《Computational Complexity》2000,9(2):73-112
Let R(A) denote the bilinear complexity (also called rank) of a finite dimensional associative algebra A.?We prove that if the decomposition of into simple algebras contains only noncommutative factors, that is, the division algebra is noncommutative or . In particular, -matrix multiplication requires at least essential bilinear multiplications. We also derive lower bounds of the form essential bilinear multiplications. We also derive lower bounds of the form for the algebra of upper triangular -matrices and the algebra of truncated bivariate polynomials in the indeterminates X,Y over some field k.?A class of algebras that has received wide attention in this context con-sists of those algebras A for which the Alder—Strassen Bound is sharp, i.e., R(A) = 2dim A—t is the number of maximal twosided ideals in A. These algebras are called algebras of minimal rank. We determine all semisimple algebras of minimal rank over arbitrary
fields and all algebras of minimal rank over algebraically closed fields.
Received: January 12, 2000. 相似文献
27.
28.
29.
30.
This paper describes an applicative order graph reducer which under interactive control performs high-level program transformations
that are governed by the reduction semantics of a full-fledged untyped γ-calculus. To do so with competitive speed, high-level
functional programs are by a pre-processor reversibly converted into graph representations of γ-terms. Its subterms are closed
by the abstraction of relatively free variables only to the extent absolutely necessary to avoid the complexity of full β-reductions
at run-time. Processing these γ-terms is based on high-level interpretation which exploits the simplicity and efficiency of
naive graph pointer substitutions when reducing function calls. Partially or completely reduced graphs are by a post-processor
re-converted into high-level programs. Full β-reductions are only employed by the pre- and post-processor to maintain correct
binding levels when abstracting free variables from γ-terms and when undoing these abstractions or reducing partial applications
left over as closures, respectively. 相似文献