全文获取类型
收费全文 | 808篇 |
免费 | 46篇 |
专业分类
电工技术 | 5篇 |
化学工业 | 279篇 |
金属工艺 | 10篇 |
机械仪表 | 16篇 |
建筑科学 | 15篇 |
能源动力 | 36篇 |
轻工业 | 90篇 |
水利工程 | 3篇 |
石油天然气 | 4篇 |
无线电 | 75篇 |
一般工业技术 | 125篇 |
冶金工业 | 49篇 |
原子能技术 | 4篇 |
自动化技术 | 143篇 |
出版年
2023年 | 7篇 |
2022年 | 26篇 |
2021年 | 60篇 |
2020年 | 31篇 |
2019年 | 26篇 |
2018年 | 29篇 |
2017年 | 24篇 |
2016年 | 37篇 |
2015年 | 28篇 |
2014年 | 44篇 |
2013年 | 56篇 |
2012年 | 60篇 |
2011年 | 55篇 |
2010年 | 44篇 |
2009年 | 40篇 |
2008年 | 27篇 |
2007年 | 27篇 |
2006年 | 18篇 |
2005年 | 16篇 |
2004年 | 16篇 |
2003年 | 19篇 |
2002年 | 14篇 |
2001年 | 12篇 |
2000年 | 5篇 |
1999年 | 7篇 |
1998年 | 19篇 |
1997年 | 9篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 4篇 |
1991年 | 6篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 8篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 4篇 |
1976年 | 2篇 |
1971年 | 3篇 |
1933年 | 2篇 |
1916年 | 2篇 |
排序方式: 共有854条查询结果,搜索用时 15 毫秒
21.
Artur J. Lemonte Francisco Cribari-Neto 《Computational statistics & data analysis》2010,54(5):1307-718
The Birnbaum-Saunders regression model is commonly used in reliability studies. We address the issue of performing inference in this class of models when the number of observations is small. Our simulation results suggest that the likelihood ratio test tends to be liberal when the sample size is small. We obtain a correction factor which reduces the size distortion of the test. Also, we consider a parametric bootstrap scheme to obtain improved critical values and improved p-values for the likelihood ratio test. The numerical results show that the modified tests are more reliable in finite samples than the usual likelihood ratio test. We also present an empirical application. 相似文献
22.
The problem of computing the chromatic number of a P
5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show
that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P
5-free graph admits a k-coloring, and finding one, if it does. 相似文献
23.
Daniel M. Batista Luciano J. Chaves Nelson L. S. da Fonseca Artur Ziviani 《The Journal of supercomputing》2010,53(1):103-121
Modern large-scale grid computing systems for processing advanced science and engineering applications rely on geographically
distributed clusters. In such highly distributed environments, estimating the available bandwidth between clusters is a key
issue for efficient task scheduling. We analyze the performance of two well known available bandwidth estimation tools, pathload and abget, with the aim of using them in grid environments. Differently than previous investigations (Jain et al., ; Shriram et al., in Passive and active network measurement: 6th international workshop, PAM 2005. Springer, Berlin, 2005), our experiments consider a series of relevant metrics such as accuracy of the estimation, convergence time, degree of intrusion
in the grid links, and ability to handle multiple simultaneous estimations. No previous work has analyzed the use of available
bandwidth tools for the derivation of efficient grid scheduling. 相似文献
24.
25.
Fatemeh Noroozi Tomasz Sapiński Dorota Kamińska Gholamreza Anbarjafari 《International Journal of Speech Technology》2017,20(2):239-246
This paper proposes a new vocal-based emotion recognition method using random forests, where pairs of the features on the whole speech signal, namely, pitch, intensity, the first four formants, the first four formants bandwidths, mean autocorrelation, mean noise-to-harmonics ratio and standard deviation, are used in order to recognize the emotional state of a speaker. The proposed technique adopts random forests to represent the speech signals, along with the decision-trees approach, in order to classify them into different categories. The emotions are broadly categorised into the six groups, which are happiness, fear, sadness, neutral, surprise, and disgust. The Surrey Audio-Visual Expressed Emotion database is used. According to the experimental results using leave-one-out cross-validation, by means of combining the most significant prosodic features, the proposed method has an average recognition rate of \(66.28\%\), and at the highest level, the recognition rate of \(78\%\) has been obtained, which belongs to the happiness voice signals. The proposed method has \(13.78\%\) higher average recognition rate and \(28.1\%\) higher best recognition rate compared to the linear discriminant analysis as well as \(6.58\%\) higher average recognition rate than the deep neural networks results, both of which have been implemented on the same database. 相似文献
26.
Artur Starczewski 《Pattern Analysis & Applications》2017,20(3):687-700
In this paper, a new cluster validity index which can be considered as a measure of the accuracy of the partitioning of data sets is proposed. The new index, called the STR index, is defined as the product of two components which determine changes of compactness and separability of clusters during a clustering process. The maximum value of this index identifies the best clustering scheme. Three popular algorithms have been applied as underlying clustering techniques, namely complete-linkage, expectation maximization and K-means algorithms. The performance of the new index is demonstrated for several artificial and real-life data sets. Moreover, this new index has been compared with other well-known indices, i.e., Dunn, Davies-Bouldin, PBM and Silhouette indices, taking into account the number of clusters in a data set as the comparison criterion. The results prove superiority of the new index as compared to the above-mentioned indices. 相似文献
27.
The paper describes the new development programme of the Polish information infrastructure. The programme, called in Polish PIONIER: (English—PIONEER) Polish Optical Internet, Advanced Applications, Services and Technologies for the Information Society, has been proposed to the Polish State Committee for Scientific Research and has been accepted. The aim of the programme is to create an advanced infrastructure together with tools, services and applications available to the entire scientific community and eventually to government and local administrations as well as society in general. Services and applications are expected to appear as selected pilot realizations in order to verify deployed technologies. Some of the pilot realizations and testbeds are also presented in the paper. 相似文献
28.
Towards a Reference Model for Surveying Mobile Agent Systems 总被引:2,自引:1,他引:1
29.
Vitor A. Figueiredo Antonio Lobato de Faria Stephen D. Myers Artur Ascenso Pires 《国际水》2013,38(1):13-17
ABSTRACT The continuous increase in water demand for various uses underlines the importance of supply problems in the general context of water resources management. In this domain it would clearly be useful to collect and make available all the data currently stored on different paper supports and kept by several regional agencies. This would provide an immediate overview of tbe resources, and also permit forecasting the future demand for tbe various utilizations. This paper describes a project involving a database to be used for groundwater resources management, conceived not only as a support for research activity, but also as a contribution to developing new and more efficient managementprocedures. The database has been designed to be used on a personal computer, with software readily available on the market. 相似文献
30.
The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in $\mathcal{O}(n^{5})$ time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in $\mathcal{O}(n^{5})$ time and $\mathcal{O}(n^{7})$ time, respectively. We also show that we can decide in $\mathcal{O}(n^{7})$ time whether a claw-free graph has an induced cycle of given parity through a specified vertex. Finally, we show that a shortest induced path of given parity between two specified vertices of a claw-free perfect graph can be found in $\mathcal {O}(n^{7})$ time. 相似文献