全文获取类型
收费全文 | 1416篇 |
免费 | 155篇 |
国内免费 | 76篇 |
专业分类
化学 | 165篇 |
晶体学 | 2篇 |
力学 | 210篇 |
综合类 | 34篇 |
数学 | 612篇 |
物理学 | 624篇 |
出版年
2024年 | 2篇 |
2023年 | 8篇 |
2022年 | 37篇 |
2021年 | 33篇 |
2020年 | 35篇 |
2019年 | 40篇 |
2018年 | 30篇 |
2017年 | 23篇 |
2016年 | 36篇 |
2015年 | 27篇 |
2014年 | 74篇 |
2013年 | 103篇 |
2012年 | 68篇 |
2011年 | 90篇 |
2010年 | 74篇 |
2009年 | 76篇 |
2008年 | 91篇 |
2007年 | 87篇 |
2006年 | 73篇 |
2005年 | 80篇 |
2004年 | 83篇 |
2003年 | 53篇 |
2002年 | 74篇 |
2001年 | 50篇 |
2000年 | 30篇 |
1999年 | 31篇 |
1998年 | 40篇 |
1997年 | 41篇 |
1996年 | 25篇 |
1995年 | 15篇 |
1994年 | 19篇 |
1993年 | 18篇 |
1992年 | 17篇 |
1991年 | 5篇 |
1990年 | 10篇 |
1989年 | 6篇 |
1988年 | 3篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 4篇 |
1983年 | 1篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 3篇 |
1978年 | 5篇 |
1976年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有1647条查询结果,搜索用时 15 毫秒
1.
Hyper-parallel quantum information processing is a promising and beneficial research field. Herein, a method to implement a hyper-parallel controlled-phase-flip (hyper-CPF) gate for frequency-, spatial-, and time-bin-encoded qubits by coupling flying photons to trapped nitrogen vacancy (NV) defect centers is presented. The scheme, which differs from their conventional parallel counterparts, is specifically advantageous in decreasing against the dissipate noise, increasing the quantum channel capacity, and reducing the quantum resource overhead. The gate qubits with frequency, spatial, and time-bin degrees of freedom (DOF) are immune to quantum decoherence in optical fibers, whereas the polarization photons are easily disturbed by the ambient noise. 相似文献
2.
Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when
viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms
whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential
equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration
process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using
the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order
algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions”
defined by nonvanishing Lie brackets. 相似文献
3.
P. Le Bars 《Journal of Combinatorial Theory, Series A》2006,113(8):1771-1782
The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code. 相似文献
4.
NEW WAVELET BASES FOR NON-HOMOGENEOUS SYMBOLIC SPACE OpS1,1^m AND RELATED KERNEL-DISTRIBUTION SPACES
YANG Qixiang 《数学年刊B辑(英文版)》2002,23(4):551-562
This paper constructs several classes of new wavelet bases, which are unconditional bases for related operator spaces. Using these bases, the author analyzes non-homogeneous symbolic space OpSm1,1 and two related kernel-distribution spaces, and characterizes them in two wavelet coefficients spaces. Besides, some properties for singular integral operators are studied. 相似文献
5.
6.
Bernhard Heinemann 《Mathematical Logic Quarterly》1997,43(2):203-215
Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated. 相似文献
7.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
8.
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. 相似文献
9.
In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions. 相似文献
10.
Eduardo Mizraji 《Complexity》2004,9(6):33-42
This work concerns the interaction between two classical problems: the forecasting of the dynamical behaviors of elementary cellular automata (ECA) from its intrinsic mathematical laws and the conditions that determine the emergence of complex dynamics. To approach these problems, and inspired by the theory of reversible logical gates, we decompose the ECA laws in a “spectrum” of dyadic Boolean gates. Emergent properties due to interactions are captured generating another spectrum of logical gates. The combined analysis of both spectra shows the existence of characteristic bias in the distribution of Boolean gates for ECA belonging to different dynamical classes. These results suggest the existence of signatures capable to indicate the propensity to develop complex dynamics. Logical gates “exclusive‐or” and “equivalence” are among these signatures of complexity. An important conclusion is that within ECA space, interactions are not capable to generate signatures of complexity in the case these signatures are absent in the intrinsic law of the automaton. © 2004 Wiley Periodicals, Inc. Complexity 9: 33–42, 2004 相似文献