全文获取类型
收费全文 | 3721篇 |
免费 | 233篇 |
国内免费 | 398篇 |
专业分类
化学 | 83篇 |
晶体学 | 2篇 |
力学 | 184篇 |
综合类 | 77篇 |
数学 | 3748篇 |
物理学 | 258篇 |
出版年
2023年 | 22篇 |
2022年 | 27篇 |
2021年 | 40篇 |
2020年 | 49篇 |
2019年 | 72篇 |
2018年 | 71篇 |
2017年 | 103篇 |
2016年 | 107篇 |
2015年 | 87篇 |
2014年 | 146篇 |
2013年 | 232篇 |
2012年 | 211篇 |
2011年 | 159篇 |
2010年 | 151篇 |
2009年 | 208篇 |
2008年 | 223篇 |
2007年 | 254篇 |
2006年 | 248篇 |
2005年 | 192篇 |
2004年 | 179篇 |
2003年 | 182篇 |
2002年 | 169篇 |
2001年 | 148篇 |
2000年 | 165篇 |
1999年 | 128篇 |
1998年 | 134篇 |
1997年 | 134篇 |
1996年 | 74篇 |
1995年 | 56篇 |
1994年 | 49篇 |
1993年 | 42篇 |
1992年 | 35篇 |
1991年 | 30篇 |
1990年 | 30篇 |
1989年 | 14篇 |
1988年 | 20篇 |
1987年 | 12篇 |
1986年 | 11篇 |
1985年 | 18篇 |
1984年 | 15篇 |
1983年 | 6篇 |
1982年 | 18篇 |
1981年 | 17篇 |
1980年 | 10篇 |
1979年 | 13篇 |
1978年 | 13篇 |
1977年 | 10篇 |
1976年 | 4篇 |
1974年 | 6篇 |
1959年 | 2篇 |
排序方式: 共有4352条查询结果,搜索用时 15 毫秒
51.
Consider discrete storage processes that are modulated by environmental processes. Environmental processes cause interruptions in the input and/or output processes of the discrete storage processes. Due to the difficulties encountered in the exact analysis of such discrete storage systems, often Poisson flow and/or fluid flow models with the same modulating environmental processes are proposed as approximations for these systems. The analysis of Poisson flow and fluid flow models is much easier than that of the discrete storage processes. In this paper we give sufficient conditions under which the content of the discrete storage processes can be bounded by the Poisson flow and the fluid flow models. For example, we show that Poisson flow models and the fluid flow models developed by Kosten (and by Anick, Mitra and Sondhi) can be used to bound the performance of infinite (finite) source packetized voice/data communication systems. We also show that a Poisson flow model and the fluid flow model developed by Mitra can be used to bound the buffer content of a two stage automatic transfer line. The potential use of the bounding techniques presented in this paper, of course, transcends well beyond these examples.Supported in part by NSF grant DMS-9308149. 相似文献
52.
P. A. V. Ferreira M. E. S. Machado 《Journal of Optimization Theory and Applications》1996,89(3):659-680
Projection and relaxation techniques are employed to decompose a multiobjective problem into a two-level structure. The basic manipulation consists in projecting the decision variables onto the space of the implicit tradeoffs, allowing the definition of a relaxed multiobjective master problem directly in the objective space. An additional subproblem tests the feasibility of the solution encountered by the relaxed problem. Some properties of the relaxed problem (linearity, small number of variables, etc.) render its solution efficient by a number of methods. Representatives of two different classes of multiobjective methods [the Geoffrion, Dyer, Feinberg (GDF) method and the fuzzy method of Baptistella and Ollero] are implemented and applied within this context to a water resources allocation problem. The results attest the computational viability of the overall procedure and its usefulness for the solution of multiobjective problems.This work was partially sponsored by grants from CNPq and FAPESP, Brazil. The authors are indebted to the anonymous reviewers for their valuable comments. 相似文献
53.
Two main properties of the subgradient mapping of convex functions are transposed for quasiconvex ones. The continuity of the functionxf(x)–1f(x) on the domain where it is defined is deduced from some continuity properties of the normal coneN to the level sets of the quasiconvex functionf. We also prove that, under a pseudoconvexity-type condition, the normal coneN(x) to the set {x:f(x)f(x)} can be expressed as the convex hull of the limits of type {N(x
n)}, where {x
n} is a sequence converging tox and contained in a dense subsetD. In particular, whenf is pseudoconvex,D can be taken equal to the set of points wheref is differentiable.This research was completed while the second author was on a sabbatical leave at the University of Montreal and was supported by a NSERC grant. It has its origin in the doctoral thesis of the first author (Ref. 1), prepared under the direction of the second author.The authors are grateful to an anonymous referee and C. Zalinescu for their helpful remarks on a previous version of this paper. 相似文献
54.
Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r
q
, whereq depends on the properties of the norm. We specify it in the case ofL
spaces, >1. 相似文献
55.
Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG()
D
. The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably. 相似文献
56.
Muhammad Adil Khan Shahid Khan Samet Erden Muhammad Samraiz 《Mathematical Methods in the Applied Sciences》2022,45(1):36-48
There are many useful applications of Jensen's inequality in several fields of science, and due to this reason, a lot of results are devoted to this inequality in the literature. The main theme of this article is to present a new method of finding estimates of the Jensen difference for differentiable functions. By applying definition of convex function, and integral Jensen's inequality for concave function in the identity pertaining the Jensen difference, we derive bounds for the Jensen difference. We present integral version of the bounds in Riemann sense as well. The sharpness of the proposed bounds through examples are discussed, and we conclude that the proposed bounds are better than some existing bounds even with weaker conditions. Also, we present some new variants of the Hermite–Hadamard and Hölder inequalities and some new inequalities for geometric, quasi-arithmetic, and power means. Finally, we give some applications in information theory. 相似文献
57.
In this paper, we are interested in the regularity estimates of the nonnegative viscosity super solution of the $β$−biased infinity Laplacian equation $$∆^β_∞u = 0,$$ where $β ∈ \mathbb{R}$ is a fixed constant and $∆^β_∞u := ∆^N_∞u + β|Du|,$ which arises from the random game named biased tug-of-war. By studying directly the $β$−biased infinity Laplacian equation, we construct the appropriate exponential cones as barrier functions to establish a key estimate. Based on this estimate, we obtain the Harnack inequality, Hopf boundary point lemma, Lipschitz estimate and the Liouville property etc. 相似文献
58.
N. D. Botkin 《Applied Mathematics and Optimization》1995,32(2):195-210
A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia. 相似文献
59.
J. M. Borwein J. D. Vanderwerff 《Proceedings of the American Mathematical Society》1996,124(3):751-755
It is shown that the existence of a closed convex set all of whose points are properly supported in a Banach space is equivalent to the existence of a certain type of uncountable ordered one-sided biorthogonal system. Under the continuum hypothesis, we deduce that this notion is weaker than the existence of an uncountable biorthogonal system.
60.
We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research. 相似文献