全文获取类型
收费全文 | 7432篇 |
免费 | 933篇 |
国内免费 | 809篇 |
专业分类
电工技术 | 156篇 |
技术理论 | 1篇 |
综合类 | 685篇 |
化学工业 | 102篇 |
金属工艺 | 35篇 |
机械仪表 | 290篇 |
建筑科学 | 184篇 |
矿业工程 | 48篇 |
能源动力 | 26篇 |
轻工业 | 56篇 |
水利工程 | 57篇 |
石油天然气 | 45篇 |
武器工业 | 85篇 |
无线电 | 998篇 |
一般工业技术 | 396篇 |
冶金工业 | 891篇 |
原子能技术 | 16篇 |
自动化技术 | 5103篇 |
出版年
2024年 | 53篇 |
2023年 | 115篇 |
2022年 | 192篇 |
2021年 | 175篇 |
2020年 | 194篇 |
2019年 | 176篇 |
2018年 | 173篇 |
2017年 | 227篇 |
2016年 | 246篇 |
2015年 | 253篇 |
2014年 | 439篇 |
2013年 | 476篇 |
2012年 | 537篇 |
2011年 | 609篇 |
2010年 | 463篇 |
2009年 | 517篇 |
2008年 | 523篇 |
2007年 | 555篇 |
2006年 | 433篇 |
2005年 | 416篇 |
2004年 | 374篇 |
2003年 | 313篇 |
2002年 | 249篇 |
2001年 | 211篇 |
2000年 | 138篇 |
1999年 | 135篇 |
1998年 | 118篇 |
1997年 | 76篇 |
1996年 | 91篇 |
1995年 | 70篇 |
1994年 | 58篇 |
1993年 | 45篇 |
1992年 | 49篇 |
1991年 | 37篇 |
1990年 | 26篇 |
1989年 | 22篇 |
1988年 | 19篇 |
1985年 | 27篇 |
1984年 | 23篇 |
1983年 | 27篇 |
1982年 | 26篇 |
1981年 | 23篇 |
1980年 | 28篇 |
1979年 | 31篇 |
1976年 | 14篇 |
1966年 | 12篇 |
1964年 | 19篇 |
1963年 | 17篇 |
1959年 | 12篇 |
1956年 | 12篇 |
排序方式: 共有9174条查询结果,搜索用时 15 毫秒
31.
Minimizing the number of tool switches on a flexible machine 总被引:5,自引:0,他引:5
Yves Crama Antoon W. J. Kolen Alwin G. Oerlemans Frits C. R. Spieksma 《International Journal of Flexible Manufacturing Systems》1994,6(1):33-54
This article analyzes a tool switching problem arising in certain flexible manufacturing environments. A batch of jobs have to be successively processed on a single flexible machine. Each job requires a subset of tools, which have to be placed in the tool magazine of the machine before the job can be processed. The tool magazine has a limited capacity, and, in general, the number of tools needed to produce all the jobs exceeds this capacity. Hence, it is sometimes necessary to change tools between two jobs in a sequence. The problem is then to determine a job sequence and an associated sequence of loadings for the tool magazine, such that the total number of tool switches is minimized. This problem has been previously considered by several authors; it is here revisited, both from a theoretical and from a computational viewpoint. Basic results concerning the computational complexity of the problem are established. Several heuristics are proposed for its solution, and their performance is computationally assessed. 相似文献
32.
Verbruggen Frederick; Liefooghe Baptist; Vandierendonck André; Demanet Jelle 《Canadian Metallurgical Quarterly》2007,33(2):342
In the task-switching literature, it has frequently been demonstrated that although advance task preparation reduces the switch cost, it never really eliminates the switch cost. This remaining residual switch cost received much attention, and it has been argued that advance preparation is restricted in nature. In the present study, the role of task-cue presentation in the establishment of the residual switch cost was investigated. In 4 experiments, the cue was removed during the preparation interval, and it was hypothesized that this would encourage participants to complete advance task preparation. The results of all 4 experiments provided support for this hypothesis: When the cue was presented for a short time and then removed, the residual switch cost completely disappeared. This was found for different cue types. Furthermore, Experiment 3 demonstrated that it was not the presence of the cue itself but merely differences in advance task preparation that caused the effects. This suggests that advance task preparation is not as restricted in nature as previously assumed. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
33.
Ilan Gronau 《Information Processing Letters》2007,104(6):205-210
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’). 相似文献
34.
Uwe Schöning 《Information Processing Letters》2006,98(4):127-129
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. Here it is proved that such superconcentrators exist (by a random construction of certain expander graphs as building blocks) having density 28 (where the density is the number of edges divided by N). The best known density before this paper was 34.2 [U. Schöning, Construction of expanders and superconcentrators using Kolmogorov complexity, J. Random Structures Algorithms 17 (2000) 64-77] or 33 [L.A. Bassalygo, Personal communication, 2004]. 相似文献
35.
Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's
lattice test, provides another quality measure for pseudorandom sequences over a (finite) field. It turned out that the lattice
profile is closely related with the linear complexity profile. In this article we give a survey of several features of the
linear complexity profile and the lattice profile, and we utilize relationships to completely describe the lattice profile
of a sequence over a finite field in terms of the continued fraction expansion of its generating function. Finally we describe
and construct sequences with a certain lattice profile, and introduce a further complexity measure. 相似文献
36.
Deterministic chaos theory offers useful quantitative tools to characterize the non-linear dynamic behavior of a fluidized bed and the developed complexity theory presents a new approach to evaluate finite sequences. In this paper,the non-linear,hydrodynamic behavior of the pressure flutuation signals in a reactor was discussed by chaos parameters and complexity measures.Coherent results were achieved by our multi-scale analysis,which further exposed the behavior in a gas-solid two-phase system. 相似文献
37.
Evidence from 3 experiments reveals interference effects from structural relationships that are inconsistent with any grammatical parse of the perceived input. Processing disruption was observed when items occurring between a head and a dependent overlapped with either (or both) syntactic or semantic features of the dependent. Effects of syntactic interference occur in the earliest online measures in the region where the retrieval of a long-distance dependent occurs. Semantic interference effects occur in later online measures at the end of the sentence. Both effects endure in offline comprehension measures, suggesting that interfering items participate in incorrect interpretations that resist reanalysis. The data are discussed in terms of a cue-based retrieval account of parsing, which reconciles the fact that the parser must violate the grammar in order for these interference effects to occur. Broader implications of this research indicate a need for a precise specification of the interface between the parsing mechanism and the memory system that supports language comprehension. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
38.
Pressure to compress the development life cycle and reduce the duration and resources committed to testing lead to experimentation in testing at the NASA Goddard Space Flight Centerís Software Engineering Laboratory. This study investigates the trend to reduce developer testing and increasingly rely upon inspection techniques and independent functional testing to shorten the development life cycle, improve testing productivity, and improve software quality.An approach is developed to conduct this comparison. In particular, the problem faced by software researchers, having a comprehensive characterization of software projects so similar types may be identified for comparative studies, is addressed using expert opinion. 相似文献
39.
文中给出了二维网络结构的计算机上求平面上一组不相交简单物体平行视图的算法,并分析了算法的正确性和时间复杂性。 相似文献
40.
《International Journal of Parallel, Emergent and Distributed Systems》2012,27(1-3):165-184
The purpose of this paper is to examine the impact of scheduling parallel tasks onto non-uniform memory access (NUMA) shared-memory multiprocessor systems by considering non-negligible intertask communications and communication contentions. Communication contentions arise from the communication medium having insufficient capacity to serve all transmissions, thereby causing significant contention delays. Therefore, a new scheduling algorithm, herein referred to as the Extended Critical Path (ECP) algorithm is proposed. The proposed algorithm schedules parallel tasks by considering non-negligible intertask communications and the contentions among shared communication resources. Moreover, it ensures performance within a factor of two of the optimum for general directed acyclic task graphs (DATGs). Experimental results demonstrate the superiority of the ECP algorithm over the scheduling algorithms presented in previous literature. 相似文献