全文获取类型
收费全文 | 4456篇 |
免费 | 175篇 |
国内免费 | 3篇 |
专业分类
电工技术 | 19篇 |
综合类 | 2篇 |
化学工业 | 703篇 |
金属工艺 | 71篇 |
机械仪表 | 74篇 |
建筑科学 | 174篇 |
矿业工程 | 6篇 |
能源动力 | 105篇 |
轻工业 | 165篇 |
水利工程 | 43篇 |
石油天然气 | 28篇 |
无线电 | 245篇 |
一般工业技术 | 709篇 |
冶金工业 | 1778篇 |
原子能技术 | 15篇 |
自动化技术 | 497篇 |
出版年
2023年 | 40篇 |
2022年 | 64篇 |
2021年 | 104篇 |
2020年 | 77篇 |
2019年 | 87篇 |
2018年 | 89篇 |
2017年 | 79篇 |
2016年 | 90篇 |
2015年 | 80篇 |
2014年 | 116篇 |
2013年 | 211篇 |
2012年 | 176篇 |
2011年 | 240篇 |
2010年 | 158篇 |
2009年 | 143篇 |
2008年 | 168篇 |
2007年 | 152篇 |
2006年 | 125篇 |
2005年 | 93篇 |
2004年 | 81篇 |
2003年 | 91篇 |
2002年 | 64篇 |
2001年 | 47篇 |
2000年 | 48篇 |
1999年 | 69篇 |
1998年 | 359篇 |
1997年 | 239篇 |
1996年 | 187篇 |
1995年 | 121篇 |
1994年 | 107篇 |
1993年 | 104篇 |
1992年 | 43篇 |
1991年 | 47篇 |
1990年 | 56篇 |
1989年 | 55篇 |
1988年 | 54篇 |
1987年 | 54篇 |
1986年 | 24篇 |
1985年 | 32篇 |
1984年 | 23篇 |
1983年 | 29篇 |
1982年 | 32篇 |
1981年 | 23篇 |
1980年 | 28篇 |
1979年 | 24篇 |
1978年 | 31篇 |
1977年 | 57篇 |
1976年 | 96篇 |
1975年 | 20篇 |
1973年 | 14篇 |
排序方式: 共有4634条查询结果,搜索用时 15 毫秒
101.
Hierarchical classification of protein function with ensembles of rules and particle swarm optimisation 总被引:1,自引:1,他引:0
Nicholas Holden Alex A. Freitas 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(3):259-272
This paper focuses on hierarchical classification problems where the classes to be predicted are organized in the form of
a tree. The standard top-down divide and conquer approach for hierarchical classification consists of building a hierarchy
of classifiers where a classifier is built for each internal (non-leaf) node in the class tree. Each classifier discriminates
only between its child classes. After the tree of classifiers is built, the system uses them to classify test examples one
class level at a time, so that when the example is assigned a class at a given level, only the child classes need to be considered
at the next level. This approach has the drawback that, if a test example is misclassified at a certain class level, it will
be misclassified at deeper levels too. In this paper we propose hierarchical classification methods to mitigate this drawback.
More precisely, we propose a method called hierarchical ensemble of hierarchical rule sets (HEHRS), where different ensembles
are built at different levels in the class tree and each ensemble consists of different rule sets built from training examples
at different levels of the class tree. We also use a particle swarm optimisation (PSO) algorithm to optimise the rule weights
used by HEHRS to combine the predictions of different rules into a class to be assigned to a given test example. In addition,
we propose a variant of a method to mitigate the aforementioned drawback of top-down classification. These three types of
methods are compared against the standard top-down hierarchical classification method in six challenging bioinformatics datasets,
involving the prediction of protein function. Overall HEHRS with the rule weights optimised by the PSO algorithm obtains the
best predictive accuracy out of the four types of hierarchical classification method. 相似文献
102.
Wireless sensor networks are increasingly seen as a solution to the problem of performing continuous wide-area monitoring in many environmental, security, and military scenarios. The distributed nature of such networks and the autonomous behavior expected of them present many novel challenges. In this article, the authors argue that a new synthesis of electronic engineering and agent technology is required to address these challenges, and they describe three examples where this synthesis has succeeded. In more detail, they describe how these novel approaches address the need for communication and computationally efficient decentralized algorithms to coordinate the behavior of physically distributed sensors, how they enable the real-world deployment of sensor agent platforms in the field, and finally, how they facilitate the development of intelligent agents that can autonomously acquire data from these networks and perform information processing tasks such as fusion, inference, and prediction. 相似文献
103.
Prosthetic valve endocarditis: superiority of surgical valve replacement versus medical therapy only
VL Yu GD Fang TF Keys AA Harris LO Gentry PC Fuchs MM Wagener ES Wong 《Canadian Metallurgical Quarterly》1994,58(4):1073-1077
The objective of our study was to assess the long-term outcome of patients with prosthetic valve endocarditis. We used a multicenter, prospective, observational study design. Six university teaching hospitals with high volume cardiothoracic surgery participated. Seventy-four patients with prosthetic valve endocarditis as defined by explicit, objective criteria were selected for participation. All patients were followed up prospectively for 1 year. Thirty-one percent and 69% had development of endocarditis within 60 days of valve insertion ("early") and after 60 days ("late"), respectively. The most common causes were Staphylococcus epidermidis (40%), Staphylococcus aureus (20%), streptococcal species (18%), and aerobic gram-negative bacilli (11%). Physical signs of endocarditis (new or changing murmur, stigmata, emboli) were seen in 58%. At 6 months and 12 months, mortality was 46% and 47%, respectively. Surgical replacement of the infected valve led to significantly lower mortality (23%) as compared with medical therapy alone (56%), as assessed by both univariate and multivariate analyses (p < 0.05). Improved outcome was seen for the surgical group even when controlling for severity of illness at time of diagnosis. From these findings we conclude that accurate assessment of outcome in prosthetic valve endocarditis requires long-term follow-up of at least 6 months following diagnosis. Surgical therapy warrants greater scrutiny; evaluation in controlled clinical trials is appropriate. 相似文献
104.
Edge crossings in drawings of bipartite graphs 总被引:7,自引:0,他引:7
Systems engineers have recently shown interest in algorithms for drawing directed graphs so that they are easy to understand and remember. Each of the commonly used methods has a step which aims to adjust the drawing to decrease the number of arc crossings. We show that the most popular strategy involves an NP-complete problem regarding the minimization of the number of arcs in crossings in a bipartite graph. The performance of the commonly employed barycenter heuristic for this problem is analyzed. An alternative method, the median heuristic, is proposed and analyzed. The new method is shown to compare favorably with the old in terms of performance guarantees. As a bonus, we show that the median heuristic performs well with regard to the total length of the arcs in the drawing. 相似文献
105.
Nicholas F. Dudley Ward Jonathan R. Partington 《Mathematics of Control, Signals, and Systems (MCSS)》1995,8(3):257-278
The model approximation of transfer functions using rational wavelets (or molecular decompositions) is considered. By using techniques from Hardy-Sobolev spaces it is shown that Hilbert space methods such as a modified matching-pursuit algorithm and least-squares technique can be employed to obtain good approximations in bothH
2 andH
norms. Several theoretical results are given on rates of convergence when the methods are applied to delay systems and fractional filters.The research of the first author was supported by E.P.S.R.C. 相似文献
106.
Gaikwad Aniruddha Chang Tammy Giera Brian Watkins Nicholas Mukherjee Saptarshi Pascall Andrew Stobbe David Rao Prahalada 《Journal of Intelligent Manufacturing》2022,33(7):2093-2117
Journal of Intelligent Manufacturing - In droplet-on-demand liquid metal jetting (DoD-LMJ) additive manufacturing, complex physical interactions govern the droplet characteristics, such as size,... 相似文献
107.
Tissue Engineering: Effective Light Directed Assembly of Building Blocks with Microscale Control (Small 24/2017)
下载免费PDF全文
![点击此处可从《Small (Weinheim an der Bergstrasse, Germany)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
108.
109.
Nicholas A. Yaraghi Nicolás Guarín‐Zapata Lessa K. Grunenfelder Eric Hintsala Sanjit Bhowmick Jon M. Hiller Mark Betts Edward L. Principe Jae‐Young Jung Leigh Sheppard Richard Wuhrer Joanna McKittrick Pablo D. Zavattieri David Kisailus 《Advanced materials (Deerfield Beach, Fla.)》2016,28(32):6835-6844
110.
In a previous report, we found that mutations at the mitochondrial genome integrity locus, MGI1, can convert Kluyveromyces lactis into a petite-positive yeast. In this report, we describe the isolation of the MGI1 gene and show that it encodes the beta-subunit of the mitochondrial F1-ATPase. The site of mutation in four independently isolated mgi1 alleles is at Arg435, which has changed to Gly in three cases and Ile in the fourth isolate. Disruption of MGI1 does not lead to the production of mitochondrial genome deletion mutants, indicating that an assembled F1 complex is needed for the "gain-of-function" phenotype found in mgi1 point mutants. The location of Arg435 in the beta-subunit, as deduced from the three-dimensional structure of the bovine F1-ATPase, together with mutational sites in the previously identified mgi2 and mgi5 alleles, suggests that interaction of the beta- and alpha- (MGI2) subunits with the gamma-subunit (MGI5) is likely to be affected by the mutations. 相似文献