全文获取类型
收费全文 | 1608篇 |
免费 | 20篇 |
国内免费 | 50篇 |
专业分类
化学 | 13篇 |
晶体学 | 1篇 |
力学 | 17篇 |
数学 | 1578篇 |
物理学 | 69篇 |
出版年
2024年 | 3篇 |
2023年 | 21篇 |
2022年 | 16篇 |
2021年 | 19篇 |
2020年 | 20篇 |
2019年 | 22篇 |
2018年 | 34篇 |
2017年 | 27篇 |
2016年 | 18篇 |
2015年 | 19篇 |
2014年 | 57篇 |
2013年 | 107篇 |
2012年 | 151篇 |
2011年 | 72篇 |
2010年 | 71篇 |
2009年 | 106篇 |
2008年 | 151篇 |
2007年 | 100篇 |
2006年 | 74篇 |
2005年 | 65篇 |
2004年 | 40篇 |
2003年 | 36篇 |
2002年 | 35篇 |
2001年 | 33篇 |
2000年 | 25篇 |
1999年 | 36篇 |
1998年 | 37篇 |
1997年 | 38篇 |
1996年 | 28篇 |
1995年 | 25篇 |
1994年 | 21篇 |
1993年 | 16篇 |
1992年 | 15篇 |
1991年 | 12篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 2篇 |
1986年 | 8篇 |
1985年 | 18篇 |
1984年 | 13篇 |
1983年 | 9篇 |
1982年 | 13篇 |
1981年 | 8篇 |
1980年 | 16篇 |
1979年 | 7篇 |
1978年 | 13篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有1678条查询结果,搜索用时 10 毫秒
31.
J. Zhu 《Mathematical Methods of Operations Research》1992,36(4):359-377
We present a primal-dual path following interior algorithm for a class of linearly constrained convex programming problems with non-negative decision variables. We introduce the definition of a Scaled Lipschitz Condition and show that if the objective function satisfies the Scaled Lipschitz Condition then, at each iteration, our algorithm reduces the duality gap by at least a factor of (1–/n), where is positive and depends on the curvature of the objective function, by means of solving a system of linear equations which requires no more than O(n3) arithmetic operations. The class of functions having the Scaled Lipschitz Condition includes linear, convex quadratic and entropy functions. 相似文献
32.
We investigate several classes of inequalities for the symmetric travelling salesman problem with respect to their facet-defining properties for the associated polytope. A new class of inequalities called comb inequalities is derived and their number shown to grow much faster with the number of cities than the exponentially growing number of subtour-elimination constraints. The dimension of the travelling salesman polytope is calculated and several inequalities are shown to define facets of the polytope. In part II (On the travelling salesman problem II: Lifting theorems and facets) we prove that all subtour-elimination and all comb inequalities define facets of the symmetric travelling salesman polytope. 相似文献
33.
A Hjelmslev quadrilateral is a quadrilateral with two right angles at opposite vertices. Using mutual distances as coordinates, we show that any four-body central configuration forming a Hjelmslev quadrilateral must be a right kite configuration. 相似文献
34.
Martin Forde 《Stochastic Processes and their Applications》2019,129(3):799-821
We establish pathwise duality using simple predictable trading strategies for the robust hedging problem associated with a barrier option whose payoff depends on the terminal level and the infimum of a càdlàg strictly positive stock price process, given tradeable European options at all strikes at a single maturity. The result allows for a significant dimension reduction in the computation of the superhedging cost, via an alternate lower-dimensional formulation of the primal problem as a convex optimization problem, which is qualitatively similar to the duality which was formally sketched using linear programming arguments in Duembgen and Rogers [10] for the case where we only consider continuous sample paths. The proof exploits a simplification of a classical result by Rogers (1993) which characterizes the attainable joint laws for the supremum and the drawdown of a uniformly integrable martingale (not necessarily continuous), combined with classical convex duality results from Rockefellar (1974) using paired spaces with compatible locally convex topologies and the Hahn–Banach theorem. We later adapt this result to include additional tradeable One-Touch options using the Kertz and Rösler (1990) condition. We also compute the superhedging cost when in the more realistic situation where there is only finite tradeable European options; for this case we obtain the full duality in the sense of quantile hedging as in Soner (2015), where the superhedge works with probability where can be arbitrarily small), and we obtain an upper bound for the true pathwise superhedging cost. In Section 5, we extend our analysis to include time-dependent barrier options using martingale coupling arguments, where we now have tradeable European options at both maturities at all strikes and tradeable forward starting options at all strikes. This set up is designed to approximate the more realistic situation where we have a finite number of tradeable Europeans at both maturities plus a finite number of tradeable forward starting options.1 相似文献
35.
Sergio Conti Matteo Focardi Flaviana Iurlano 《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2019,36(2):455-474
We consider the Griffith fracture model in two spatial dimensions, and prove existence of strong minimizers, with closed jump set and continuously differentiable deformation fields. One key ingredient, which is the object of the present paper, is a generalization to the vectorial situation of the decay estimate by De Giorgi, Carriero, and Leaci. This is based on replacing the coarea formula by a method to approximate functions with small jump set by Sobolev functions, and is restricted to two dimensions. The other two ingredients will appear in companion papers and consist respectively in regularity results for vectorial elliptic problems of the elasticity type and in a method to approximate in energy functions by ones. 相似文献
36.
《Operations Research Letters》2022,50(5):541-547
We consider two-stage recourse models with integer restrictions in the second stage. These models are typically non-convex and hence, hard to solve. There exist convex approximations of these models with accompanying error bounds. However, it is unclear how these error bounds depend on the distributions of the second-stage cost vector q. In this paper, we derive parametric error bounds whose dependence on the distribution of q is explicit: they scale linearly in the expected value of the -norm of q. 相似文献
37.
We consider a general Euler-Korteweg-Poisson system in R 3, supplemented with the space periodic boundary conditions, where the quantum hydrodynamics equations and the classical fluid dynamics equations with capillarity are recovered as particular examples. We show that the system admits infinitely many global-in-time weak solutions for any sufficiently smooth initial data including the case of a vanishing initial density - the vacuum zones. Moreover, there is a vast family of initial data, for which the Cauchy problem possesses infinitely many dissipative weak solutions, i.e. the weak solutions satisfying the energy inequality. Finally, we establish the weak-strong uniqueness property in a class of solutions without vacuum. In this paper we show that, even in presence of a dispersive tensor, we have the same phenomena found by De Lellis and Székelyhidi. 相似文献
38.
Classical problems in integral geometry and geometric probability involve the kinematic measure of congruent segments of fixed length within a convex body in R3. We give this measure from rotational formulae; that is, from isotropic plane sections through a fixed point. From this result we also obtain a new rotational formula for the volume of a convex body; which is proved to be equivalent to the wedge formula for the volume. 相似文献
39.
Dong S. Yang David R. Fazzini Timothy I. Morrison Larc Trger Grant Bunker 《Journal of Non》1997,210(2-3)
A commonly used expression for modeling the XAFS of highly disordered systems is shown to generate substantial systematic errors in the coordination number in many cases of practical interest. This expression is corrected and generalized. Further, a simpler and more flexible model distribution is proposed, and the corresponding XAFS expression is derived. Comparison with experimental and simulated data show that the new expressions are useful in cases of high disorder for which the cumulant expansion loses its utility, and they explicitly account for the k-dependence of the mean free path. 相似文献
40.
A.R. Nazemi 《Communications in Nonlinear Science & Numerical Simulation》2012,17(4):1696-1705
This paper proposes a feedback neural network model for solving convex nonlinear programming (CNLP) problems. Under the condition that the objective function is convex and all constraint functions are strictly convex or that the objective function is strictly convex and the constraint function is convex, the proposed neural network is proved to be stable in the sense of Lyapunov and globally convergent to an exact optimal solution of the original problem. The validity and transient behavior of the neural network are demonstrated by using some examples. 相似文献