全文获取类型
收费全文 | 24614篇 |
免费 | 1037篇 |
国内免费 | 33篇 |
专业分类
电工技术 | 329篇 |
综合类 | 38篇 |
化学工业 | 5655篇 |
金属工艺 | 380篇 |
机械仪表 | 476篇 |
建筑科学 | 1307篇 |
矿业工程 | 100篇 |
能源动力 | 621篇 |
轻工业 | 1888篇 |
水利工程 | 233篇 |
石油天然气 | 71篇 |
无线电 | 1817篇 |
一般工业技术 | 4503篇 |
冶金工业 | 4531篇 |
原子能技术 | 196篇 |
自动化技术 | 3539篇 |
出版年
2023年 | 214篇 |
2022年 | 359篇 |
2021年 | 566篇 |
2020年 | 338篇 |
2019年 | 431篇 |
2018年 | 535篇 |
2017年 | 463篇 |
2016年 | 632篇 |
2015年 | 558篇 |
2014年 | 749篇 |
2013年 | 1419篇 |
2012年 | 1161篇 |
2011年 | 1510篇 |
2010年 | 1075篇 |
2009年 | 1014篇 |
2008年 | 1147篇 |
2007年 | 1085篇 |
2006年 | 944篇 |
2005年 | 761篇 |
2004年 | 745篇 |
2003年 | 659篇 |
2002年 | 563篇 |
2001年 | 428篇 |
2000年 | 362篇 |
1999年 | 402篇 |
1998年 | 752篇 |
1997年 | 553篇 |
1996年 | 442篇 |
1995年 | 411篇 |
1994年 | 377篇 |
1993年 | 362篇 |
1992年 | 269篇 |
1991年 | 195篇 |
1990年 | 268篇 |
1989年 | 260篇 |
1988年 | 215篇 |
1987年 | 224篇 |
1986年 | 226篇 |
1985年 | 265篇 |
1984年 | 224篇 |
1983年 | 223篇 |
1982年 | 207篇 |
1981年 | 194篇 |
1980年 | 168篇 |
1979年 | 193篇 |
1978年 | 164篇 |
1977年 | 185篇 |
1976年 | 231篇 |
1975年 | 160篇 |
1974年 | 123篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
The expression of several markers of epithelial cell proliferation was analyzed to establish baseline data for future chemoprevention studies of oral premalignant lesions. Punch biopsies (n = 60) from three different sites of oral mucosa (bucca, lateral tongue, and the floor of the mouth) were obtained from 20 normal donors of both sexes. After formaldehyde fixation and paraffin embedding, immunohistochemistry was used to detect the proliferation markers Mib-1, cyclin D1, and centromere-associated protein CENP-F. Analysis of sections stained for the three markers showed similar patterns, i.e., a low labeling index (LI) in the basal layer and a high LI in the parabasal layer at all three intraoral sites. No proliferative activity was seen above the parabasal layer (superficial layer). All sites showed similar Mib-1 LI values for the proliferative markers. The tongue epithelium exhibited higher parabasal LIs of cyclin D1 and CENP-F than did the other two sites. No significant differences were detected between smokers and nonsmokers. The data from normal mucosa were compared with those from low (n = 30)- and high (n = 17)-grade dysplastic leukoplakias. The Mib-1 LI showed a very significant change, with a 9-fold increase in the basal layer LI in dysplastic leukoplakias. Cyclin D1 and CENP-F showed similar trends with increments of up to 7-fold in the basal layer of high-grade dysplasia. Although the proliferative activity of the parabasal layer was similar in normal and leukoplakic epithelia, the superficial layer showed a significant increment in proliferative activity mainly in high-grade leukoplakia. These studies suggest that proliferation markers in the basal and superficial cells of premalignant lesions may serve as surrogate end point biomarkers for chemoprevention trials. 相似文献
103.
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. 相似文献
104.
Neben der Gestaltung technischer Systeme zur Unterstützung des Wissensmanagements ist die Ausgestaltung organisatorischer
Ma?nahmen gleichbedeutend wichtig. 相似文献
105.
106.
107.
Enactive interfaces must incorporate intuitive activity that characterizes naturalistic perception. However, the manner in which information is presented is not more important than the contents: what information is presented. In this contribution, we address the contents of perception. We argue that people perceive affordances, that is, the possible actions that are available in any given situation. We further argue that enactive interfaces should be designed to optimize presentation of information about the possible actions that are available to a person using the enactive interface. The design of enactive interfaces might be guided by an extension of the theory of ecological interface design (Vicente in Hum Factors 44:62–78, 2002) to include multimodal information that is accessed through fast, intuitive exploratory movement. We review two empirical studies that illustrate our arguments. Careful analysis of affordances, together with our increasing understanding of the enactive perception of affordances, should influence the design of enactive interfaces. 相似文献
108.
109.
First available appraisals for 67,644 Jersey cows were used to estimate relative magnitudes of additive and selected sources of nonadditive genetic variance and covariance for 13 type traits scored linearly from 50 to 99 points. Covariances among four types of relatives were used to estimate components of genetic variance and covariance for each of the 13 traits. Direct additive, direct dominance, and additive maternal genetic variances and the direct-maternal additive genetic covariance were estimated using covariances among paternal half-sibs, full-sibs, daughters and dams, and maternal half-sibs. Estimates of additive genetic variance were 11 to 36% of variance within herd-appraiser subclasses with largest values for stature, strength, rump angle, rump width, and udder depth. Dominance components were two to four times the magnitude of additive components for dairy character, rump width, fore udder, rear udder height, rear udder width, and suspensory ligament but much smaller for other traits. Maternal effects and the direct-maternal additive genetic covariance appeared small for all linear type traits. 相似文献
110.
Our goal is to develop a robust out-of-core sorting program for a
distributed-memory cluster. The literature contains two dominant
paradigms for out-of-core sorting algorithms: merging-based and
partitioning-based. We explore a third paradigm, that of oblivious
algorithms. Unlike the two dominant paradigms, oblivious algorithms
do not depend on the input keys and therefore lead to predetermined
I/O and communication patterns in an out-of-core setting.
Predetermined I/O and communication patterns facilitate overlapping
I/O, communication, and computation for efficient implementation. We
have developed several out-of-core sorting programs using the paradigm
of oblivious algorithms. Our baseline implementation, 3-pass
columnsort, was based on Leighton's columnsort algorithm. Though
efficient in terms of I/O and communication, 3-pass columnsort has a
restriction on the maximum problem size. As our first effort toward
relaxing this restriction, we developed two implementations: subblock
columnsort and M-columnsort. Both of these implementations
incur substantial performance costs: subblock columnsort performs
additional disk I/O, and M-columnsort needs substantial
amounts of extra communication and computation. In this paper we
present slabpose columnsort, a new oblivious algorithm that we have
designed explicitly for the out-of-core setting. Slabpose columnsort
relaxes the problem-size restriction at no extra I/O or communication
cost. Experimental evidence on a Beowulf cluster shows that unlike
subblock columnsort and M-columnsort, slabpose columnsort runs
almost as fast as 3-pass columnsort. To the best of our knowledge,
our implementations are the first out-of-core multiprocessor sorting
algorithms that make no assumptions about the keys and produce output
that is perfectly load balanced and in the striped order assumed by
the Parallel Disk Model. 相似文献