全文获取类型
收费全文 | 9089篇 |
免费 | 1147篇 |
国内免费 | 347篇 |
专业分类
化学 | 805篇 |
晶体学 | 14篇 |
力学 | 1036篇 |
综合类 | 327篇 |
数学 | 5560篇 |
物理学 | 2841篇 |
出版年
2024年 | 21篇 |
2023年 | 90篇 |
2022年 | 295篇 |
2021年 | 278篇 |
2020年 | 190篇 |
2019年 | 208篇 |
2018年 | 228篇 |
2017年 | 349篇 |
2016年 | 451篇 |
2015年 | 296篇 |
2014年 | 557篇 |
2013年 | 615篇 |
2012年 | 501篇 |
2011年 | 553篇 |
2010年 | 446篇 |
2009年 | 585篇 |
2008年 | 597篇 |
2007年 | 606篇 |
2006年 | 490篇 |
2005年 | 439篇 |
2004年 | 381篇 |
2003年 | 318篇 |
2002年 | 296篇 |
2001年 | 254篇 |
2000年 | 223篇 |
1999年 | 195篇 |
1998年 | 179篇 |
1997年 | 160篇 |
1996年 | 134篇 |
1995年 | 104篇 |
1994年 | 71篇 |
1993年 | 83篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 44篇 |
1989年 | 29篇 |
1988年 | 30篇 |
1987年 | 25篇 |
1986年 | 32篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
利用普通幂级数发生函数方法,通过对发生函数进行xD算子,得到和式∑k=0^nμ^kf(k)的计算公式,并计算该类和式+ 相似文献
52.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献
53.
Yukio Iida Masahiro Shibutani Katsuhiko Kobayashi Kazuhiko Ohnuma Yoichi Miyake Toru Noda 《Optical Review》2006,13(2):87-92
The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric
double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric
double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric
double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to
obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration
method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval
algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change
in value. 相似文献
54.
实时任务动态调度算法 总被引:1,自引:0,他引:1
任务调度算法是提高多任务系统效率的一种有效途径,特别是在时间紧迫环境下,实时任务调度算法更具有重要的应用价值.在研究建立实时任务调度模型方法的基础上,对模型进行理论分析,提出了实时任务调度的算法,并通过实例加以验证. 相似文献
55.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
56.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
57.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献
58.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
59.
Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks. 相似文献
60.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献