全文获取类型
收费全文 | 3903篇 |
免费 | 444篇 |
国内免费 | 312篇 |
专业分类
电工技术 | 64篇 |
技术理论 | 1篇 |
综合类 | 329篇 |
化学工业 | 49篇 |
金属工艺 | 10篇 |
机械仪表 | 79篇 |
建筑科学 | 135篇 |
矿业工程 | 27篇 |
能源动力 | 15篇 |
轻工业 | 19篇 |
水利工程 | 35篇 |
石油天然气 | 26篇 |
武器工业 | 20篇 |
无线电 | 674篇 |
一般工业技术 | 220篇 |
冶金工业 | 125篇 |
原子能技术 | 5篇 |
自动化技术 | 2826篇 |
出版年
2024年 | 17篇 |
2023年 | 27篇 |
2022年 | 52篇 |
2021年 | 66篇 |
2020年 | 72篇 |
2019年 | 86篇 |
2018年 | 88篇 |
2017年 | 113篇 |
2016年 | 124篇 |
2015年 | 118篇 |
2014年 | 200篇 |
2013年 | 275篇 |
2012年 | 238篇 |
2011年 | 310篇 |
2010年 | 211篇 |
2009年 | 262篇 |
2008年 | 274篇 |
2007年 | 287篇 |
2006年 | 227篇 |
2005年 | 210篇 |
2004年 | 186篇 |
2003年 | 160篇 |
2002年 | 123篇 |
2001年 | 109篇 |
2000年 | 84篇 |
1999年 | 82篇 |
1998年 | 72篇 |
1997年 | 42篇 |
1996年 | 60篇 |
1995年 | 46篇 |
1994年 | 50篇 |
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篇 |
排序方式: 共有4659条查询结果,搜索用时 0 毫秒
1.
John Watrous 《Computational Complexity》2003,12(1-2):48-84
This paper studies the space-complexity of predicting the
long-term behavior of a class of stochastic processes based on evolutions
and measurements of quantum mechanical systems. These processes
generalize a wide range of both quantum and classical space-bounded
computations, including unbounded error computations given by machines
having algebraic number transition amplitudes or probabilities.
It is proved that any space s quantum stochastic process from this class
can be simulated probabilistically with unbounded error in space O(s),
and therefore deterministically in space O(s2). 相似文献
2.
Comments on the article "A house divided? The psychology of red and blue America" by D. C. Seyle and M. L. Newman (see record 2006-11202-001). Seyle and Newman concluded that the red and blue metaphor is inaccurate and proposed a purple America strategy to better convey that the majority of people do not align themselves with political extremes. There is interdisciplinary agreement on this. Although not cited by Seyle and Newman, the findings by Professor Fiorina of Stanford University were reported by the APA Monitor on Psychology in its coverage of the 2005 APA State Leadership Conference (Murray Law, 2005). In contrast to their social psychological analysis, Seyle and Newman were incorrect in concluding that "[a]s psychologists, we are not in a position to change either the elements of the American political system that may spur this conflict or even the decisions made by pundits, politicians, and reporters about the terms they choose to use in political discussion" (p. 579). (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
3.
Sándor P. Fekete 《Information Processing Letters》2003,88(5):219-223
We prove NP-completeness of deciding the existence of an economic equilibrium in so-called house allocation markets. House allocation markets are markets with indivisible goods in which every agent holds exactly one copy of some good. 相似文献
4.
Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following
two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion
time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b . 相似文献
5.
基数排序由于其效率高而被广泛应用。通常,基数排序所用的基数是10,然而,如果求得一个基数r_(best),并且用r_(best)为基数进行基数排序使排序时间达到最小,则这将具有非常重要的意义。本文给出了求r_(best)的方法,分析了以r_(best)为基数进行基数排序的时间复杂度,提出了进一步提高效率的措施,并将以r_(best)为基数的基数排序速度与以10为基数的基数排序进行了比较。 相似文献
6.
Computational complexity of queries based on itemsets 总被引:1,自引:0,他引:1
Nikolaj Tatti 《Information Processing Letters》2006,98(5):183-187
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete. 相似文献
7.
This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width. 相似文献
8.
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the generation of strings of symbols, that have been used in the context of speech and handwriting recognition, and bioinformatics. Recent work on learning PDFAs from random examples has used the KL-divergence as the error measure; here we use the variation distance. We build on recent work by Clark and Thollard, and show that the use of the variation distance allows simplifications to be made to the algorithms, and also a strengthening of the results; in particular that using the variation distance, we obtain polynomial sample size bounds that are independent of the expected length of strings. 相似文献
9.
We consider a system defined as the product of a finite set of periodic systems on cyclic groups. It is of interest to determine if certain subgroups and unions of subgroups of the state set are reachable from a specified initial state, and in particular to determine the computational complexity of verifying such reachability. These questions are motivated by certain problems that arise in the modelling and control of discrete event systems and certain forms of periodic scheduling. Our main result is that deciding whether or not the union of a certain set of subgroups is reachable or not is NP-complete. 相似文献
10.
Andrew Klapper 《Journal of Cryptology》1994,7(1):33-51
A new method of cryptologic attack on binary sequences is given, using their linear complexities relative to odd prime numbers. We show that, relative to a particular prime number p, the linear complexity of a binary geometric sequence is low. It is also shown that the prime p can be determined with high probability by a randomized algorithm if a number of bits much smaller than the linear complexity is known. This determination is made by exploiting the imbalance in the number of zeros and ones in the sequences in question, and uses a new statistical measure, the partial imbalance.This project was sponsored by the National Security Agency under Grant No. MDA904-91-H-0012. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon. 相似文献