全文获取类型
收费全文 | 1651篇 |
免费 | 38篇 |
国内免费 | 13篇 |
专业分类
化学 | 1201篇 |
晶体学 | 7篇 |
力学 | 29篇 |
数学 | 269篇 |
物理学 | 196篇 |
出版年
2021年 | 15篇 |
2020年 | 24篇 |
2019年 | 8篇 |
2018年 | 16篇 |
2017年 | 23篇 |
2016年 | 29篇 |
2015年 | 35篇 |
2014年 | 33篇 |
2013年 | 59篇 |
2012年 | 96篇 |
2011年 | 118篇 |
2010年 | 47篇 |
2009年 | 39篇 |
2008年 | 102篇 |
2007年 | 80篇 |
2006年 | 97篇 |
2005年 | 105篇 |
2004年 | 84篇 |
2003年 | 73篇 |
2002年 | 71篇 |
2001年 | 16篇 |
2000年 | 17篇 |
1999年 | 25篇 |
1998年 | 26篇 |
1997年 | 18篇 |
1996年 | 24篇 |
1995年 | 20篇 |
1994年 | 27篇 |
1993年 | 21篇 |
1992年 | 14篇 |
1991年 | 12篇 |
1990年 | 13篇 |
1989年 | 11篇 |
1988年 | 12篇 |
1987年 | 12篇 |
1986年 | 10篇 |
1985年 | 24篇 |
1984年 | 24篇 |
1983年 | 15篇 |
1982年 | 19篇 |
1981年 | 28篇 |
1980年 | 21篇 |
1979年 | 24篇 |
1978年 | 12篇 |
1977年 | 14篇 |
1976年 | 19篇 |
1975年 | 13篇 |
1974年 | 8篇 |
1973年 | 7篇 |
1971年 | 6篇 |
排序方式: 共有1702条查询结果,搜索用时 15 毫秒
111.
We present a spectrally accurate numerical method for finding nontrivial time-periodic solutions of nonlinear partial differential equations. The method is based on minimizing a functional (of the initial condition and the period) that is positive unless the solution is periodic, in which case it is zero. We solve an adjoint PDE to compute the gradient of this functional with respect to the initial condition. We include additional terms in the functional to specify the free parameters, which in the case of the Benjamin–Ono equation, are the mean, a spatial phase, a temporal phase, and the real part of one of the Fourier modes at t=0. 相似文献
112.
While a number of increasingly sophisticated numerical methods have been developed for time-dependent problems in electromagnetics, the Yee scheme is still widely used in the applied fields, mainly due to its simplicity and computational efficiency. A fundamental drawback of the method is the use of staircase boundary approximations, giving inconsistent results. Usually experience of numerical experiments provides guidance of the impact of these errors on the final simulation result. In this paper, we derive exact discrete solutions to the Yee scheme close to the staircase approximated boundary, enabling a detailed theoretical study of the amplitude, phase and frequency errors created. Furthermore, we show how evanescent waves of amplitude \(O(1)\) occur along the boundary. These characterize the inconsistencies observed in electromagnetic simulations and the locality of the waves explain why, in practice, the Yee scheme works as well as it does. The analysis is supported by detailed proofs and numerical examples. 相似文献
113.
114.
This paper proves a strong convergence theorem for sequences of pseudo-holomorphic maps from a Riemann surface to a symplectic
manifoldN with tamed almost complex structure. (These are the objects used by Gromov to define his symplectic invariants.) The paper
begins by developing some analytic facts about such maps, including a simple new isoperimetric inequality and a new removable
singularity theorem.
The main technique is a general procedure for renormalizing sequences of maps to obtain “bubbles on bubbles.” This is a significant
step beyond the standard renormalization procedure of Sacks and Uhlenbeck. The renormalized maps give rise to a sequence of
maps from a “bubble tree”—a map from a wedge Σ V S2 V S2 V ... →N. The main result is that the images of these renormalized maps converge in L1,2 ∪C° to the image of a limiting pseudo-holomorphic map from the bubble tree. This implies several important properties of the
bubble tree. In particular, the images of consecutive bubbles in the bubble tree intersect, and if a sequence of maps represents
a homology class then the limiting map represents this class. 相似文献
115.
We determine precise existence and multiplicity results for radial solutions of the Liouville-Bratu-Gelfand problem associated with a class of quasilinear radial operators, which includes perturbations of k-Hessian and p-Laplace operators. 相似文献
116.
The Brownian web is a random object that occurs as the scaling limit of an infinite system of coalescing random walks. Perturbing this system of random walks by, independently at each point in space–time, resampling the random walk increments, leads to some natural dynamics. In this paper we consider the corresponding dynamics for the Brownian web. In particular, pairs of coupled Brownian webs are studied, where the second web is obtained from the first by perturbing according to these dynamics. A stochastic flow of kernels, which we call the erosion flow, is obtained via a filtering construction from such coupled Brownian webs, and the N-point motions of this flow of kernels are identified. 相似文献
117.
Mathematics experts often choose appropriate procedures to produce an efficient or elegant solution to a mathematical task. This flexible procedural knowledge distinguishes novice and expert procedural performances. This article reports on an intervention intended to aid the development of undergraduate calculus students’ flexible use of procedures. Two sections of the same course were randomly assigned to treatment and control conditions. Treatment students completed an assignment on which they resolved derivative-finding problems with alternative methods and compared the two resulting solutions. Control students were assigned a list of functions to differentiate. On the post-intervention test, treatment students were more likely to use a variety of solution methods without prompting than the control. Moreover, the set of treatment section solutions were closer to those of a group of mathematics experts. This study presents evidence that not only is flexible procedural knowledge a key skill in tertiary mathematics, it can be taught. 相似文献
118.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
119.
Jon Grantham. 《Mathematics of Computation》2001,70(234):873-891
The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime' in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas pseudoprimes, extra strong Lucas pseudoprimes and Perrin pseudoprimes. Though these tests represent a wealth of ideas, they exist as a hodge-podge of definitions rather than as examples of a more general theory. It is the goal of this paper to present a way of viewing many of these tests as special cases of a general principle, as well as to re-formulate them in the context of finite fields.
One aim of the reformulation is to enable the creation of stronger tests; another is to aid in proving results about large classes of pseudoprimes.
120.
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections, and the minimal
number of reflections needed to factor a particular element is called its reflection length. In this article we prove that
the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely, we prove that the reflection
length function on an affine Coxeter group that naturally acts faithfully and cocompactly on ℝ
n
is bounded above by 2n, and we also show that this bound is optimal. Conjecturally, spherical and affine Coxeter groups are the only Coxeter groups
with a uniform bound on reflection length. 相似文献