全文获取类型
收费全文 | 350582篇 |
免费 | 2687篇 |
国内免费 | 420篇 |
专业分类
电工技术 | 5616篇 |
综合类 | 193篇 |
化学工业 | 55765篇 |
金属工艺 | 19796篇 |
机械仪表 | 12918篇 |
建筑科学 | 6376篇 |
矿业工程 | 4489篇 |
能源动力 | 6169篇 |
轻工业 | 17210篇 |
水利工程 | 5687篇 |
石油天然气 | 16562篇 |
武器工业 | 31篇 |
无线电 | 30197篇 |
一般工业技术 | 83506篇 |
冶金工业 | 51389篇 |
原子能技术 | 13618篇 |
自动化技术 | 24167篇 |
出版年
2021年 | 3525篇 |
2019年 | 3466篇 |
2018年 | 6756篇 |
2017年 | 6982篇 |
2016年 | 7450篇 |
2015年 | 3885篇 |
2014年 | 6829篇 |
2013年 | 14276篇 |
2012年 | 9743篇 |
2011年 | 12186篇 |
2010年 | 9949篇 |
2009年 | 11032篇 |
2008年 | 11167篇 |
2007年 | 10842篇 |
2006年 | 9047篇 |
2005年 | 8049篇 |
2004年 | 7824篇 |
2003年 | 7601篇 |
2002年 | 7398篇 |
2001年 | 7275篇 |
2000年 | 7092篇 |
1999年 | 6553篇 |
1998年 | 13028篇 |
1997年 | 9984篇 |
1996年 | 7465篇 |
1995年 | 5911篇 |
1994年 | 5393篇 |
1993年 | 5592篇 |
1992年 | 4642篇 |
1991年 | 4735篇 |
1990年 | 4861篇 |
1989年 | 4672篇 |
1988年 | 4562篇 |
1987年 | 4433篇 |
1986年 | 4362篇 |
1985年 | 4563篇 |
1984年 | 4404篇 |
1983年 | 4292篇 |
1982年 | 4019篇 |
1981年 | 4210篇 |
1980年 | 4141篇 |
1979年 | 4425篇 |
1978年 | 4735篇 |
1977年 | 4798篇 |
1976年 | 5755篇 |
1975年 | 4339篇 |
1974年 | 4388篇 |
1973年 | 4464篇 |
1972年 | 4054篇 |
1971年 | 3688篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
ME Sutherlin I Nishimori T Caffrey EP Bennett H Hassan U Mandel D Mack T Iwamura H Clausen MA Hollingsworth 《Canadian Metallurgical Quarterly》1997,57(21):4744-4748
The levels of mRNA expression of three UDP-N-acetyl-alpha-D-galactosamine:polypeptide GalNAc N-acetylgalactosaminyltransferases (GalNAc-transferases) were quantified for human adenocarcinoma cell lines from pancreas, colon, stomach, and breast. Two of the GalNAc-transferases, GalNAc-T1 and GalNAc-T2, were expressed constitutively and at low levels in most or all cell lines examined. A third GalNAc-transferase, GalNAc-T3, was differentially expressed. Well-differentiated adenocarcinoma cell lines expressed high levels and moderately differentiated cell lines expressed lower levels of GalNAc-T3. Cell lines classified as poorly differentiated failed to express GalNAc-T3 mRNA at levels that could be detected by Northern blot analysis. Differential expression of the GalNAc-T3 protein was confirmed in these cell lines by Western blotting. We propose that glycosylation in tumor cell lines may be regulated in part by differential expression of GalNAc-transferases, and we suggest that GalNAc-T3 gene expression may be a molecular indicator of differentiated adenocarcinoma. 相似文献
62.
Highly degenerate primers to conserved regions of the eukaryotic phosphoinositol-specific phospholipase C (PLC) were used to amplify fragments of plant PLCs from Arabidopsis thaliana genomic DNA. Eight completely different fragment sequences that showed high homology to PLCs of both animals and plants were isolated. The variation between these putative PLCs was high and suggests that, like animals, plants have multiple isoforms of PLC. Using one of the PCR clones, we isolated a corresponding full-length Arabidopsis PLC gene (ATHATPLC1G), and sequence analysis indicated that it was most like a delta-type PLC. This gene is 2.5 kb and contains seven introns, all but one of which has intron/exon border sequences that conform to the Arabidopsis consensus. The structural complexity of the gene is relatively simple compared to mammalian beta-type PLCs that can be 15 kb long with up to 30 introns. The plant gene is a single copy and was mapped to four Arabidopsis YACs, one located on chromosome 2. The promoter region contained two TATA-like elements at -43 and -185 and other putative regulatory elements that suggest that this PLC is hormonally regulated. This is the first plant PLC gene and the first delta type-PLC gene from a higher organism to be sequenced. 相似文献
63.
V. I. Shtykov 《Power Technology and Engineering (formerly Hydrotechnical Construction)》1998,32(8):459-462
Conclusions 1. Use of dewatering systems based on voidless drainage is most effective when dewatering slightly permeable soils in regions
with a deep seasonal frost.
2. Two-story drainage with the upper and lower stories spaced 30 m apart accelerates the discharge of gravitational water
from the arable layer. Results of observations on two-story drainage in experimental-production sections indicated that it
discharges 2 – 3.8 times more water than systematic tubular drainage with an interdrain spacing of 10 m and a 0.2-m thick
three-dimensional filter of a sandy-gravelly mixture.
3. It is recommended to use crushed stone and porous-clay gravel with a fineness of 10 – 20 mm as a filler. In that case,
protection of the drain filler is, as a rule, required only from the intrusion of soil from above during construction in cohesive
soils with a plasticity indexW
p≥7.
4. seepage rate in a voidless drain should be lower than the scouring velocity for the soil in which the voidless drainage
is placed. In the opposite case, it is necessary to lower the grade of the drains or select a filler gradation such that the
seepage rate in the drain be lower than the scouring velocity.
Translated from Gidrotekhnicheskoe Stroitel’stvo, No. 8, pp. 41–43, August, 1998. 相似文献
64.
I. S. W. B. Prasetya 《Formal Aspects of Computing》1994,6(4):466-470
UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent. 相似文献
65.
Moser L.E. Melliar-Smith P.M. Agrawala V. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(5):459-473
Presents protocols for determining processor membership in asynchronous distributed systems that are subject to processor and communication faults. These protocols depend on the placement of a total order on broadcast messages. The types of systems for which each of these protocols is applicable are characterized by the properties of the communication mechanisms and by the availability of stable storage. In the absence of stable storage or of a mechanism for distinguishing promptly delivered messages, the authors show that no membership protocol can exist. They also discuss their experience in implementing these membership protocols 相似文献
66.
We present new methods for load balancing of unstructured tree computations on large-scale SIMD machines, and analyze the scalability of these and other existing schemes. An efficient formulation of tree search on an SIMD machine consists of two major components: a triggering mechanism, which determines when the search space redistribution must occur to balance the search space over processors, and a scheme to redistribute the search space. We have devised a new redistribution mechanism and a new triggering mechanism. Either of these can be used in conjunction with triggering and redistribution mechanisms developed by other researchers. We analyze the scalability of these mechanisms and verify the results experimentally. The analysis and experiments show that our new load-balancing methods are highly scalable on SIMD architectures. Their scalability is shown to he no worse than that of the best load-balancing schemes on MIMD architectures. We verify our theoretical results by implementing the 15-puzzle problem on a CM-2 SIMD parallel computer 相似文献
67.
Implementing a neural network on a digital or mixed analog and digital chip yields the quantization of the synaptic weights dynamics. This paper addresses this topic in the case of Kohonen's self-organizing maps. We first study qualitatively how the quantization affects the convergence and the properties, and deduce from this analysis the way to choose the parameters of the network (adaptation gain and neighborhood). We show that a spatially decreasing neighborhood function is far more preferable than the usually rectangular neighborhood function, because of the weight quantization. Based on these results, an analog nonlinear network, integrated in a standard CMOS technology, and implementing this spatially decreasing neighborhood function is then presented. It can be used in a mixed analog and digital circuit implementation. 相似文献
68.
The bounded disorder file organization proposed by W. Litwin and D.B. Lomet (1987) uses a combination of hashing and tree indexing. Lomet provided an approximate analysis with the mention of the difficulty involved in exact modeling of data nodes, which motivated this work. In an earlier paper (M.V. Ramakrishna and P. Mukhopadhyay, 1988) we provided an exact model and analysis of the data nodes, which is based on the solution of a classical sequential occupancy problem. After summarizing the analysis of data nodes, an alternate file growth method based on repeated trials using universal hashing is proposed and analyzed. We conclude that the alternate file growth method provides simplicity and significant improvement in storage utilization 相似文献
69.
We describe a binding environment for the AND and OR parallel execution of logic programs that is suitable for both shared and nonshared memory multiprocessors. The binding environment was designed with a view of rendering a compiler using this binding environment machine independent. The binding environment is similar to closed environments proposed by J. Conery. However, unlike Conery's scheme, it supports OR and independent AND parallelism on both types of machines. The term representation, the algorithms for unification and the join algorithms for parallel AND branches are presented in this paper. We also detail the differences between our scheme and Conery's scheme. A compiler based on this binding environment has been implemented on a platform for machine independent parallel programming called the Chare Kernel 相似文献
70.
This paper proposes a system based on a parallel genetic algorithm with enhanced encoding and operational abilities. The system, used to evolve feedforward artificial neural networks, has been applied to two widely different problem areas: Boolean function learning and robot control. It is shown that the good results obtained in both cases are due to two factors: first, the enhanced exploration abilities provided by the search-space reducing evolution of both coding granularity and network topology, and, second, the enhanced exploitational abilities due to a recently proposed cooperative local optimizing genetic operator. 相似文献