全文获取类型
收费全文 | 63352篇 |
免费 | 4195篇 |
国内免费 | 4055篇 |
专业分类
化学 | 35030篇 |
晶体学 | 714篇 |
力学 | 3815篇 |
综合类 | 505篇 |
数学 | 10448篇 |
物理学 | 21090篇 |
出版年
2024年 | 91篇 |
2023年 | 622篇 |
2022年 | 1577篇 |
2021年 | 1496篇 |
2020年 | 1558篇 |
2019年 | 1468篇 |
2018年 | 1263篇 |
2017年 | 1379篇 |
2016年 | 1775篇 |
2015年 | 1512篇 |
2014年 | 2150篇 |
2013年 | 4062篇 |
2012年 | 2557篇 |
2011年 | 2713篇 |
2010年 | 2430篇 |
2009年 | 3472篇 |
2008年 | 3755篇 |
2007年 | 4130篇 |
2006年 | 3574篇 |
2005年 | 2915篇 |
2004年 | 2584篇 |
2003年 | 2739篇 |
2002年 | 3824篇 |
2001年 | 2243篇 |
2000年 | 2099篇 |
1999年 | 1828篇 |
1998年 | 1766篇 |
1997年 | 1071篇 |
1996年 | 1231篇 |
1995年 | 1103篇 |
1994年 | 901篇 |
1993年 | 662篇 |
1992年 | 763篇 |
1991年 | 498篇 |
1990年 | 453篇 |
1989年 | 377篇 |
1988年 | 340篇 |
1987年 | 305篇 |
1986年 | 284篇 |
1985年 | 276篇 |
1984年 | 263篇 |
1983年 | 163篇 |
1982年 | 208篇 |
1981年 | 198篇 |
1980年 | 133篇 |
1979年 | 159篇 |
1978年 | 138篇 |
1977年 | 122篇 |
1976年 | 76篇 |
1973年 | 61篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
M. Volle 《Journal of Global Optimization》1994,5(2):131-157
We provide calculus rules for global approximate minima concerning usual operations on functions. The formulas we obtain are then applied to approximate subdifferential calculus. In this way, new results are presented, for example on the approximate subdifferential of a deconvolution, or on the subdifferential of an upper envelope of convex functions. 相似文献
992.
S Ponnusamy 《Proceedings Mathematical Sciences》1994,104(2):397-411
Denote byS
* (⌕), (0≤⌕<1), the family consisting of functionsf(z)=z+a
2z2+...+anzn+... that are analytic and starlike of order ⌕, in the unit disc ⋎z⋎<1. In the present article among other things, with very
simple conditions on μ, ⌕ andh(z) we prove the f’(z) (f(z)/z)μ−1<h(z) implies f∈S*(⌕). Our results in this direction then admit new applications in the study of univalent functions. In many cases these results
considerably extend the earlier works of Miller and Mocanu [6] and others. 相似文献
993.
Riccardo Fazio 《Journal of Computational and Applied Mathematics》1994,50(1-3):299-303
Within group invariance theory we consider a constructive approach in order to define numerical transformation methods. These are initial-value methods for the solution of boundary value problems governed by ordinary differential equations. Here we consider the class of free boundary value problems governed by the most general second-order equation in normal form. For this class of problems the main theorem is concerned with the definition of an iterative transformation method. The definition of a noniterative method, applicable to a subclass of the original class of problems, follows as a corollary. Therefore, the proposed constructive approach allows us to establish a unifying framework for noniterative and iterative transformation methods. 相似文献
994.
995.
Avi BickWalter Willinger 《Stochastic Processes and their Applications》1994,50(2):349-374
The paper presents a non-probabilistic approach to continuous-time trading where, in analogy to the binomial option-pricing model, terminal payoffs resulting from a given trading strategy are meaningful ‘state-by-state’, i.e., path-by-path. In particular, we obtain results of the form: “If a certain trading strategy is applied and if the realized price trajectory satisfies a certain analytical property, then the terminal payoff is.…” This way, derivation of the Black and Scholes formula and its extension become an exercise in the analysis of a certain class of real functions. While results of the above forms are of great interest if the analytical property in question is believed to be satisfied for almost all realized price trajectories (for example, if the price is believed to follow a certain stochastic process which has this property with probability 1), they are valid regardless of the stochastic process which presumably generates the possible price trajectories or the probability assigned to the set of all paths having this analytical property. 相似文献
996.
In this paper, the problem of the robust stabilization for a class of uncertain linear dynamical systems with time-varying delay is considered. By making use of an algebraic Riccati equation, we derive some sufficient conditions for robust stability of time-varying delay dynamical systems with unstructured or structured uncertainties. In our approach, the only restriction on the delay functionh(t) is the knowledge of its upper boundh
–. Some analytical methods are employed to investigate these stability conditions. Since these conditions are independent of the delay, our results are also applicable to systems with perturbed time delay. Finally, a numerical example is given to illustrate the use of the sufficient conditions developed in this paper. 相似文献
997.
We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k1..., km) subject to a fixed total buffer capacityK=k
1 +... + km. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818. 相似文献
998.
Bounded knapsack sharing 总被引:1,自引:0,他引:1
J. Randall Brown 《Mathematical Programming》1994,67(1-3):343-382
A bounded knapsack sharing problem is a maximin or minimax mathematical programming problem with one or more linear inequality constraints, an objective function composed of single variable continuous functions called tradeoff functions, and lower and upper bounds on the variables. A single constraint problem which can have negative or positive constraint coefficients and any type of continuous tradeoff functions (including multi-modal, multiple-valued and staircase functions) is considered first. Limiting conditions where the optimal value of a variable may be plus or minus infinity are explicitly considered. A preprocessor procedure to transform any single constraint problem to a finite form problem (an optimal feasible solution exists with finite variable values) is developed. Optimality conditions and three algorithms are then developed for the finite form problem. For piecewise linear tradeoff functions, the preprocessor and algorithms are polynomially bounded. The preprocessor is then modified to handle bounded knapsack sharing problems with multiple constraints. An optimality condition and algorithm is developed for the multiple constraint finite form problem. For multiple constraints, the time needed for the multiple constraint finite form algorithm is the time needed to solve a single constraint finite form problem multiplied by the number of constraints. Some multiple constraint problems cannot be transformed to multiple constraint finite form problems. 相似文献
999.
Image space analysis of generalized fractional programs 总被引:2,自引:0,他引:2
The solution of a particular nonconvex program is usually very dependent on the structure of the problem. In this paper we identify classes of nonconvex problems involving either sums or products of ratios of linear terms which may be treated by analysis in a transformed space. In each class, the image space is defined by a mapping which associates a new variable with each original ratio of linear terms. In the image space, optimization is easy in certain directions, and the overall solution may be realized by sequentially optimizing in these directions.In addition to these ratio problems, we also show how to use image space analysis to treat the subclass of problems whose objective is to optimize a product of linear terms. For each class of nonconvex problems, we present an algorithm that locates global solutions by computing both upper and lower bounds on the solution and then solving a sequence of linear programming sub-problems. We also demonstrate the algorithms described in this paper by solving several example problems. 相似文献
1000.
Bernard Bialecki 《Numerical Algorithms》1994,8(2):167-184
Cyclic reduction and Fourier analysis-cyclic reduction (FACR) methods are presented for the solution of the linear systems which arise when orthogonal spline collocation with piecewise Hermite bicubics is applied to boundary value problems for certain separable partial differential equations on a rectangle. On anN×N uniform partition, the cyclic reduction and Fourier analysis-cyclic reduction methods requireO(N
2log2
N) andO(N
2log2log2
N) arithmetic operations, respectively. 相似文献