全文获取类型
收费全文 | 9217篇 |
免费 | 573篇 |
国内免费 | 494篇 |
专业分类
化学 | 574篇 |
晶体学 | 10篇 |
力学 | 309篇 |
综合类 | 135篇 |
数学 | 2614篇 |
物理学 | 676篇 |
综合类 | 5966篇 |
出版年
2024年 | 33篇 |
2023年 | 74篇 |
2022年 | 169篇 |
2021年 | 180篇 |
2020年 | 168篇 |
2019年 | 158篇 |
2018年 | 154篇 |
2017年 | 160篇 |
2016年 | 233篇 |
2015年 | 227篇 |
2014年 | 346篇 |
2013年 | 374篇 |
2012年 | 423篇 |
2011年 | 496篇 |
2010年 | 410篇 |
2009年 | 535篇 |
2008年 | 586篇 |
2007年 | 795篇 |
2006年 | 726篇 |
2005年 | 594篇 |
2004年 | 546篇 |
2003年 | 447篇 |
2002年 | 426篇 |
2001年 | 336篇 |
2000年 | 298篇 |
1999年 | 257篇 |
1998年 | 220篇 |
1997年 | 169篇 |
1996年 | 132篇 |
1995年 | 102篇 |
1994年 | 80篇 |
1993年 | 67篇 |
1992年 | 55篇 |
1991年 | 42篇 |
1990年 | 38篇 |
1989年 | 27篇 |
1988年 | 46篇 |
1987年 | 22篇 |
1986年 | 21篇 |
1985年 | 21篇 |
1984年 | 21篇 |
1983年 | 4篇 |
1982年 | 12篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 6篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 6篇 |
1955年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
The presented work offers new algorithms for phase evaluation in interferometric measurements. Several phase-shifting algorithms with an arbitrary but constant phase-shift between captured intensity frames are proposed. These phase calculation algorithms need to measure five frames of the intensity of the interference field. The algorithms are similarly derived as so called Carré algorithm. The phase evaluation process then does not depend on the linear phase shift errors. Furthermore, the detailed analysis of the algorithms with respect to most important factors, which affect interferometric measurements, is carried out. It is also studied the dependency of the evaluation algorithms on the phase shift values, and the proposed phase calculation algorithms are compared with respect to the resulting phase errors. The influence of most important factors in the measurement and evaluation process was simulated as systematic and random errors using a proposed mathematical model. 相似文献
82.
Convergent Algorithm Based on Progressive Regularization for Solving Pseudomonotone Variational Inequalities 总被引:2,自引:2,他引:0
In this paper, we extend the Moreau-Yosida regularization of monotone variational inequalities to the case of weakly monotone and pseudomonotone operators. With these properties, the regularized operator satisfies the pseudo-Dunn property with respect to any solution of the variational inequality problem. As a consequence, the regularized version of the auxiliary problem algorithm converges. In this case, when the operator involved in the variational inequality problem is Lipschitz continuous (a property stronger than weak monotonicity) and pseudomonotone, we prove the convergence of the progressive regularization introduced in Refs. 1, 2. 相似文献
83.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
84.
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width 总被引:2,自引:0,他引:2
Gruia C
linescu Cristina G. Fernandes Bruce Reed 《Journal of Algorithms in Cognition, Informatics and Logic》2003,48(2):333-359
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut. 相似文献
85.
该文利用矩阵理论对具有随机数的压缩系数的微粒群优化算法进行了收敛性分析,给出了c=d=1和c=1两种收敛性结果,同时图形化给出了参数选择准则. 相似文献
86.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
87.
It is widely believed that evolutionary dynamics of artificial self‐replicators realized in cellular automata (CA) are limited in diversity and adaptation. Contrary to this view, we show that complex genetic evolution may occur within simple CA. The evolving self‐replicating loops (“evoloops”) we investigate exhibit significant diversity in macro‐scale morphologies and mutational biases, undergoing nontrivial genetic adaptation by maximizing colony density and enhancing sustainability against other species. Nonmutable subsequences enable genetic operations that alter fitness differentials and promote long‐term evolutionary exploration. These results demonstrate a unique example of genetic evolution hierarchically emerging from local interactions between elements much smaller than individual replicators. © 2004 Wiley Periodicals, Inc. Complexity 10: 33–39, 2004 相似文献
88.
蒋斌松 《山东科技大学学报(自然科学版)》1993,(3)
本文根据孔壁应力解除法获得的量测应变,提出了采用最优化方法直接确定岩体的泊松比和原始地应力。实例表明,这样获得的原始地应力更符合实际——对应最小的量测残差。 相似文献
89.
In the paper, the behaviour of interior point algorithms is analyzed by using a variable metric method approach. A class of
polynomial variable metric algorithms is given achieving O ((n/β)L) iterations for solving a canonical form linear optimization problem with respect to a wide class of Riemannian metrics,
wheren is the number of dimensions and β a fixed value. It is shown that the vector fields of several interior point algorithms
for linear optimization is the negative Riemannian gradient vector field of a linear a potential or a logarithmic barrier
function for suitable Riemannian metrics.
Research Partially supported by the Hungarian National Research Foundation, Grant Nos. OTKA-T016413 and OTKA-2116. 相似文献
90.
第二讲合成孔径声纳成像及其研究进展 总被引:1,自引:0,他引:1
文章在介绍了图像声纳的特点、合成孔径声纳(synthetic aperture sonar,SAS)产生背景和发展过程的基础上,对合成孔径声纳的原理、技术难点、成像算法等问题进行了讨论.着重分析了合成孔径声纳成像过程中高分辨率的获取方法、水声信道对成像的影响、多子阵技术及其成像算法、稳定的声纳运动平台和运动监测问题、运动补偿与自聚焦方法等.文章还给出了国内外合成孔径声纳研究的最新进展情况,进而展望了合成孔径声纳的应用前景. 相似文献