全文获取类型
收费全文 | 9166篇 |
免费 | 2358篇 |
国内免费 | 2180篇 |
专业分类
电工技术 | 890篇 |
技术理论 | 2篇 |
综合类 | 1119篇 |
化学工业 | 167篇 |
金属工艺 | 84篇 |
机械仪表 | 418篇 |
建筑科学 | 137篇 |
矿业工程 | 129篇 |
能源动力 | 136篇 |
轻工业 | 177篇 |
水利工程 | 111篇 |
石油天然气 | 107篇 |
武器工业 | 69篇 |
无线电 | 1389篇 |
一般工业技术 | 414篇 |
冶金工业 | 68篇 |
原子能技术 | 16篇 |
自动化技术 | 8271篇 |
出版年
2024年 | 82篇 |
2023年 | 251篇 |
2022年 | 441篇 |
2021年 | 498篇 |
2020年 | 554篇 |
2019年 | 489篇 |
2018年 | 498篇 |
2017年 | 541篇 |
2016年 | 587篇 |
2015年 | 644篇 |
2014年 | 756篇 |
2013年 | 726篇 |
2012年 | 967篇 |
2011年 | 1031篇 |
2010年 | 844篇 |
2009年 | 795篇 |
2008年 | 849篇 |
2007年 | 864篇 |
2006年 | 565篇 |
2005年 | 438篇 |
2004年 | 331篇 |
2003年 | 232篇 |
2002年 | 181篇 |
2001年 | 121篇 |
2000年 | 90篇 |
1999年 | 74篇 |
1998年 | 43篇 |
1997年 | 34篇 |
1996年 | 33篇 |
1995年 | 25篇 |
1994年 | 17篇 |
1993年 | 12篇 |
1992年 | 6篇 |
1991年 | 8篇 |
1990年 | 10篇 |
1989年 | 10篇 |
1988年 | 5篇 |
1987年 | 5篇 |
1986年 | 2篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1974年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
11.
12.
J. L. Díez J. L. Navarro A. Sala 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(10):973-983
In this work, simple modifications on the cost index of particular local-model fuzzy clustering algorithms are proposed in
order to improve the readability of the resulting models. The final goal is simultaneously providing local linear models (reasonably
close to the plant’s Jacobian) and clustering in the input space so that desirable characteristics (regarding final model
accuracy, and convexity and smoothness of the cluster membership functions) are improved with respect to other proposals in
literature. Some examples illustrate the proposed approach. 相似文献
13.
H原子对固态合金化颗粒表面成份分布影响的研究 总被引:1,自引:0,他引:1
本文研究了氢化物TiH2对Fe+Ti机械合金化非晶储氢合金的表面成份偏聚和性能的影响。应用X射线光电子谱(XPS)和俄歇电子谱(AES)对样品表面由表及里逐层测量成份分布。同时应用热重分析方法研究了样品氧化性能和产物。研究结果表明,在机械合金化过程中,H原子不仅能使FeTi非晶化,同时促使表面产生明显的Fe原子偏聚。表面Fe/Ti原子比接近7。非晶FeTi(H)相的氧化分两个阶段进行,Ti原子首先氧化(833K),随后Fe原子氧化(890K)。 相似文献
14.
15.
The conventional way of solving the group technology (GT) problem is to start from an assignment of parts to machines and try to find a partitioning of machine cells and part families. The similarity between parts is measured based on commonality of the machines assigned to them. However, parts are assigned to machines based on their operation requirements and the operation capabilities of machines. Similarity between parts should be based on their required operations. In this paper, the authors attempt to solve or facilitate solving the GT problem at the assignment level. An algorithm for assigning parts to machines is provided which utilizes the types of operations required by parts and applies GT principles in producing the assignment. This leads to better partitioning of machine cells and part-families. Furthermore, operation sequences required by parts in determining the similarity between parts have been considered. An algorithm to form part-families based on the operation sequence similarity coefficient has been developed. The resulting families are then used by the assignment algorithm to produce machine assignments to part-families. The use of the algorithm is demonstrated by examples. 相似文献
16.
Thomas L. Landers Melinda K. Beavers Malik Sadiq Don E. Stuart 《Computers & Industrial Engineering》1994,27(1-4):245-248
This paper describes an approach, conceptual framework, and software architecture for dynamic reconfiguration of the order picking system. The research and development project was sponsored by the Material Handling Research Center (MHRC), a National Science Foundation sponsored Cooperative Industry/University Research Center. The storage configuration is assumed to be an in-the-aisle order picking system in which stockkeeping units (SKUs) can occupy variable capacity storage locations and stock-splitting is allowed among zones (clusters). The product mix may include multiple product families with different life cycles, correlated demand within families and commonality of demand across families. 相似文献
17.
18.
We address the problems of noise and huge data sizes in microarray images. First, we propose a mixture model for describing the statistical and structural properties of microarray images. Then, based on the microarray image model, we present methods for denoising and for compressing microarray images. The denoising method is based on a variant of the translation-invariant wavelet transform. The compression method introduces the notion of approximate contexts (rather than traditional exact contexts) in modeling the symbol probabilities in a microarray image. This inexact context modeling approach is important in dealing with the noisy nature of microarray images. Using the proposed denoising and compression methods, we describe a near-lossless compression scheme suitable for microarray images. Results on both denoising and compression are included, which show the performance of the proposed methods. Further experiments using the results of the proposed near-lossless compression scheme in gene clustering using cell-cycle microarray data for S. cerevisiae showed a general improvement in the clustering performance, when compared with using the original data. This provides an indirect validation of the effectiveness of the proposed denoising method. 相似文献
19.
Non-redundant data clustering 总被引:6,自引:6,他引:0
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice, this
discovery process should avoid redundancies with existing knowledge about class structures or groupings, and reveal novel,
previously unknown aspects of the data. In order to deal with this problem, we present an extension of the information bottleneck
framework, called coordinated conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score subject to
constraints. Algorithmically, one can apply an alternating optimization scheme that can be used in conjunction with different
types of numeric and non-numeric attributes. We discuss extensions of the technique to the tasks of semi-supervised classification
and enumeration of successive non-redundant clusterings. We present experimental results for applications in text mining and
computer vision. 相似文献
20.
This paper introduces and evaluates a new class of knowledge model, the recursive Bayesian multinet (RBMN), which encodes the joint probability distribution of a given database. RBMNs extend Bayesian networks (BNs) as well as partitional clustering systems. Briefly, a RBMN is a decision tree with component BNs at the leaves. A RBMN is learnt using a greedy, heuristic approach akin to that used by many supervised decision tree learners, but where BNs are learnt at leaves using constructive induction. A key idea is to treat expected data as real data. This allows us to complete the database and to take advantage of a closed form for the marginal likelihood of the expected complete data that factorizes into separate marginal likelihoods for each family (a node and its parents). Our approach is evaluated on synthetic and real-world databases. 相似文献