全文获取类型
收费全文 | 2489篇 |
免费 | 40篇 |
国内免费 | 9篇 |
专业分类
电工技术 | 41篇 |
综合类 | 4篇 |
化学工业 | 383篇 |
金属工艺 | 47篇 |
机械仪表 | 52篇 |
建筑科学 | 168篇 |
矿业工程 | 12篇 |
能源动力 | 80篇 |
轻工业 | 210篇 |
水利工程 | 26篇 |
石油天然气 | 12篇 |
武器工业 | 1篇 |
无线电 | 192篇 |
一般工业技术 | 344篇 |
冶金工业 | 527篇 |
原子能技术 | 14篇 |
自动化技术 | 425篇 |
出版年
2022年 | 23篇 |
2021年 | 43篇 |
2020年 | 17篇 |
2019年 | 35篇 |
2018年 | 34篇 |
2017年 | 19篇 |
2016年 | 47篇 |
2015年 | 28篇 |
2014年 | 46篇 |
2013年 | 135篇 |
2012年 | 99篇 |
2011年 | 123篇 |
2010年 | 89篇 |
2009年 | 92篇 |
2008年 | 101篇 |
2007年 | 107篇 |
2006年 | 83篇 |
2005年 | 70篇 |
2004年 | 50篇 |
2003年 | 65篇 |
2002年 | 60篇 |
2001年 | 49篇 |
2000年 | 38篇 |
1999年 | 56篇 |
1998年 | 165篇 |
1997年 | 111篇 |
1996年 | 59篇 |
1995年 | 54篇 |
1994年 | 55篇 |
1993年 | 47篇 |
1992年 | 27篇 |
1991年 | 24篇 |
1990年 | 22篇 |
1989年 | 15篇 |
1988年 | 22篇 |
1987年 | 19篇 |
1986年 | 15篇 |
1985年 | 40篇 |
1984年 | 18篇 |
1983年 | 16篇 |
1982年 | 19篇 |
1981年 | 15篇 |
1980年 | 16篇 |
1979年 | 21篇 |
1978年 | 25篇 |
1977年 | 30篇 |
1976年 | 37篇 |
1975年 | 15篇 |
1974年 | 19篇 |
1972年 | 15篇 |
排序方式: 共有2538条查询结果,搜索用时 15 毫秒
1.
2.
Phospholamban (PLN) was expressed in Escherichia coli as a protein fusion with glutathione S-transferase (GST). GST-PLN was mostly present in the insoluble protein fraction and accounted for approximately 50% of total insoluble protein. Attempts to suppress inclusion body formation or to use GST as an affinity-purification tag failed. A successful purification method is based on preparative SDS/PAGE and electrodialysis. From 1 g cells we typically purified 13.5 mg fusion protein with a PLN content of 2.8 mg. We genetically inserted an enterokinase (EK) protease site just in front of the PLN sequence and demonstrated the proteolytical liberation of PLN from the carrier protein. The approach described represents a substantial advancement in PLN expression and purification. 相似文献
3.
DJ Conway MJ Holland RL Bailey AE Campbell OS Mahdi R Jennings E Mbena DC Mabey 《Canadian Metallurgical Quarterly》1997,65(3):1003-1006
Tumor necrosis factor alpha (TNF-alpha) may play a central role in the disease pathogenesis which occurs as a consequence of chlamydial infection. To investigate the importance of TNF-alpha gene promoter polymorphisms and TNF-alpha levels in tear fluid in scarring trachoma, a large matched-pair case-control study was performed in The Gambia. The -308A allele was present in a higher proportion of patients (28.4%) than controls (18.4%), with an increasing association for homozygotes (chi2 for trend, P = 0.032; allele frequency, 0.163 in patients and 0.099 in controls; chi2, P = 0.025). For the -238A allele, the association was similar but not significant. The disease association was highly significant when the number of either -308A or -238A sites in an individual was considered (P = 0.003). TNF-alpha promoter alleles are tightly linked to some HLA class I and II alleles, but multivariate analysis confirmed that the disease associations were independent of HLA, although a class I allele, A*6802, is also associated with disease. TNF-alpha was more frequently detected in tear samples from patients (27.6%) than from controls (15.9%), increasingly so for higher levels of detectable TNF-alpha (P = 0.015). Among patients, detectable TNF-alpha in tears was highly associated with the presence of ocular chlamydial infection (P < 0.001). The results indicate that TNF-alpha plays a major role in the tissue damage and scarring which occurs as a consequence of Chlamydia trachomatis infection. 相似文献
4.
This paper addresses the existence of loop gain-phase shaping (LGPS) solutions for the design of robust digital control systems for SISO, minimum-phase, continuous-time processes with parametric uncertainty. We develop the frequency response properties of LGPS for discrete-time systems using the Δ-transform, a transform method that applies to both continuous-time and discrete-time systems. A theorem is presented which demonstrates that for reasonable specifications there always exists a sampling period such that the robust digital control problem has a solution. Finally, we offer a procedure for estimating the maximum feasible sampling period for LGPS solutions to robust digital control problems. 相似文献
5.
6.
7.
Optimal ensemble construction via meta-evolutionary ensembles 总被引:1,自引:0,他引:1
In this paper, we propose a meta-evolutionary approach to improve on the performance of individual classifiers. In the proposed system, individual classifiers evolve, competing to correctly classify test points, and are given extra rewards for getting difficult points right. Ensembles consisting of multiple classifiers also compete for member classifiers, and are rewarded based on their predictive performance. In this way we aim to build small-sized optimal ensembles rather than form large-sized ensembles of individually-optimized classifiers. Experimental results on 15 data sets suggest that our algorithms can generate ensembles that are more effective than single classifiers and traditional ensemble methods. 相似文献
8.
Four experiments investigated the effect of recent selective practice on the cost of switching between 2 tasks afforded by letter-digit pairs: alphabet arithmetic and shape comparison. Experiments 1 and 2 found a greater cost associated with switching to the more recently practiced task: evidence that task-set inertia contributes to switching costs. Experiment 3 found this effect to be limited to trials on which a recently trained stimulus followed another such stimulus: a result problematic for all current theories of task-set priming. Experiment 4 showed that the effect of recent practice was eliminated by active preparation for a task switch: It appears that endogenous task-set preparation reduces the effects of task-set inertia. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
9.
David Haussler Michael Kearns Nick LittlestoneManfred K. Warmuth 《Information and Computation》1991,95(2)
In this paper we consider several variants of Valiant's learnability model that have appeared in the literature. We give conditions under which these models are equivalent in terms of the polynomially learnable concept classes they define. These equivalences allow comparisons of most of the existing theorems in Valiant-style learnability and show that several simplifying assumptions on polynomial learning algorithms can be made without loss of generality. We also give a useful reduction of learning problems to the problem of finding consistent hypotheses, and give comparisons and equivalences between Valiant's model and the prediction learning models of Haussler, Littlestone, and Warmuth (in “29th Annual IEEE Symposium on Foundations of Computer Science,” 1988). 相似文献
10.