全文获取类型
收费全文 | 3850篇 |
免费 | 448篇 |
国内免费 | 309篇 |
专业分类
电工技术 | 63篇 |
技术理论 | 1篇 |
综合类 | 327篇 |
化学工业 | 45篇 |
金属工艺 | 10篇 |
机械仪表 | 79篇 |
建筑科学 | 135篇 |
矿业工程 | 26篇 |
能源动力 | 15篇 |
轻工业 | 18篇 |
水利工程 | 34篇 |
石油天然气 | 26篇 |
武器工业 | 20篇 |
无线电 | 653篇 |
一般工业技术 | 218篇 |
冶金工业 | 120篇 |
原子能技术 | 5篇 |
自动化技术 | 2812篇 |
出版年
2024年 | 14篇 |
2023年 | 25篇 |
2022年 | 45篇 |
2021年 | 62篇 |
2020年 | 71篇 |
2019年 | 83篇 |
2018年 | 84篇 |
2017年 | 111篇 |
2016年 | 123篇 |
2015年 | 116篇 |
2014年 | 196篇 |
2013年 | 274篇 |
2012年 | 235篇 |
2011年 | 306篇 |
2010年 | 210篇 |
2009年 | 261篇 |
2008年 | 273篇 |
2007年 | 286篇 |
2006年 | 227篇 |
2005年 | 210篇 |
2004年 | 185篇 |
2003年 | 160篇 |
2002年 | 122篇 |
2001年 | 109篇 |
2000年 | 84篇 |
1999年 | 82篇 |
1998年 | 72篇 |
1997年 | 42篇 |
1996年 | 57篇 |
1995年 | 46篇 |
1994年 | 48篇 |
1993年 | 34篇 |
1992年 | 36篇 |
1991年 | 28篇 |
1990年 | 21篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 7篇 |
1986年 | 6篇 |
1985年 | 21篇 |
1984年 | 23篇 |
1983年 | 25篇 |
1982年 | 26篇 |
1981年 | 21篇 |
1980年 | 25篇 |
1979年 | 29篇 |
1978年 | 10篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1964年 | 5篇 |
排序方式: 共有4607条查询结果,搜索用时 500 毫秒
41.
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. 相似文献
42.
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) 相似文献
43.
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. 相似文献
44.
文中给出了二维网络结构的计算机上求平面上一组不相交简单物体平行视图的算法,并分析了算法的正确性和时间复杂性。 相似文献
45.
X3SAT最大海明距离问题是指对于一个X3SAT问题实例,寻找该问题的任意两组可满足赋值之间的最大海明距离。提出了一个基于DPLL的精确算法HMX来求解X3SAT最大海明距离问题,根据公式中某个变量在两组真值赋值中的不同取值进行分支。给出了多种化简规则,这些规则很好地提高了算法的时间效率。证明了该算法可以将X3SAT最大海明距离问题的最小上界由目前最好的O(1.7107n)缩小到O(1.6760n),其中n为公式中变量的数目。 相似文献
46.
LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:
相似文献
1. | There exists a family of cyclic nonconstant boolean functions which can be evaluated with expected complexity bits by arandomized algorithm forR. |
2. | Anynondeterministic algorithm forR which evaluates any cyclic nonconstant function has communication complexity bits. |
47.
Distributed match-making 总被引:1,自引:0,他引:1
In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands. 相似文献
48.
An improved version of Afek and Gafni's synchronous algorithm for distributed election in complete networks is given and anO(n) expected message complexity is shown.
M.Y. Chan received her Ph.D. in 1988 from the University of Hong Kong, and her M.S. and B.A. degrees in computer science from the University of California, San Diego in 1980 and 1981, respectively. She is currently an Assistant Professor at the University of Texas at Dallas.
Francis Y.L. Chin (S71-M76-SM85) received the B.Sc. degree in engineering science from the University of Toronto, Toronto, Canada, in 1972, and the M.S., M.A., and Ph.D. degrees in electrical engineering and computer science from Princeton University, New Jersey, in 1974, 1975, and 1976, respectively. Since 1975, he has taught at the University of Maryland, Baltimore Country, University of California, San Diego, University of Alberta, and Chinese University of Hong Kong. He is currently Head of the Department of Computer Science, University of Hong Kong. He has served as a program co-chairman of the 1988 International Conference on Computer Processing of Chinese and Oriental Languages (Toronto) and the International Computer Science Conference '88 (Hong Kong). His current research interests include algorithm design and analysis, parallel and distributed computing. 相似文献
49.
In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size. We prove several results which complete the work on characterizing possible inclusions between many classes defined by small depth circuits. These results are the following:
相似文献
1. | A single threshold gate with weights cannot in general be replaced by a polynomial fan-in unweighted threshold gate of parity gates. |
2. | On the other hand it can be replaced by a depth 2 unweighted threshold circuit of polynomial size. An extension of this construction is used to prove that whatever can be computed by a depthd polynomial size threshold circuit with weights can be computed by a depthd+1 polynomial size unweighted threshold circuit, whered is an arbitrary fixed integer. |
3. | A polynomial fan-in threshold gate (with weights) of parity gates cannot in general be replaced by a depth 2 unweighted threshold circuit of polynomial size. |
50.
James F. Lynch 《Computational Complexity》1992,2(1):40-66
For every nondeterministic Turing machineM of time complexityT(n), there is a second-order sentence of a very restricted form, whose set of finite models encodes the set of strings recognized byM. Specifically, has a relational symbol which is interpreted as addition restricted to finite segments of the natural numbers, and a prefix consisting of existentially quantified unary second-order variables followed by a universal-existential first-order part. Here, every input stringx is encoded by a model of sizeT(|x|). Using a closely related encoding of strings as models where the size of the model is the length of the string, a consequence is that ifT(n)=n
d, then there is a sentence with a similar prefix but whose second-order variables ared-ary and whose finite models encode the strings accepted byM. Potential applications to low-level complexity are discussed. 相似文献