全文获取类型
收费全文 | 5169篇 |
免费 | 339篇 |
国内免费 | 501篇 |
专业分类
化学 | 405篇 |
晶体学 | 4篇 |
力学 | 284篇 |
综合类 | 120篇 |
数学 | 4869篇 |
物理学 | 327篇 |
出版年
2024年 | 5篇 |
2023年 | 60篇 |
2022年 | 83篇 |
2021年 | 100篇 |
2020年 | 108篇 |
2019年 | 113篇 |
2018年 | 130篇 |
2017年 | 130篇 |
2016年 | 133篇 |
2015年 | 102篇 |
2014年 | 202篇 |
2013年 | 356篇 |
2012年 | 225篇 |
2011年 | 287篇 |
2010年 | 258篇 |
2009年 | 353篇 |
2008年 | 346篇 |
2007年 | 326篇 |
2006年 | 325篇 |
2005年 | 259篇 |
2004年 | 225篇 |
2003年 | 262篇 |
2002年 | 223篇 |
2001年 | 204篇 |
2000年 | 173篇 |
1999年 | 171篇 |
1998年 | 176篇 |
1997年 | 153篇 |
1996年 | 91篇 |
1995年 | 68篇 |
1994年 | 55篇 |
1993年 | 48篇 |
1992年 | 36篇 |
1991年 | 25篇 |
1990年 | 19篇 |
1989年 | 13篇 |
1988年 | 13篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 24篇 |
1984年 | 20篇 |
1983年 | 12篇 |
1982年 | 21篇 |
1981年 | 16篇 |
1980年 | 18篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有6009条查询结果,搜索用时 15 毫秒
81.
《Operations Research Letters》2022,50(5):470-474
An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently. 相似文献
82.
文中证明了有限预序集与有限偏序集的一些性质,并基于有限集上的拓扑和其上预序的一一对应关系,利用这些性质通过对极小元和极大元个数进行分类讨论,以一种有别于计算机算法而又容易理解的计算方法得出6元素集合上的T0拓扑总数为130023. 相似文献
84.
K. C. Kiwiel 《Applied Mathematics and Optimization》1995,32(3):235-254
Letf: n (–, ] be a convex polyhedral function. We show that if any standard active set method for quadratic programming (QP) findsx(t)= arg min
x
¦x¦2/2+t
f(x) for somet> 0, then its final working set defines a simple equality QP subproblem, whose Lagrange multiplier can be used both for testing ift is large enough forx(t) to coincide with the normal minimizer off, and for increasingt otherwise. The QP subproblem may easily be solved via the matrix factorizations used for findingx(t). This opens up the way for efficient implementations. We also give finite methods for computing the whole trajectory {x(t)}
t
0, minimizingf over an ellipsoid, and choosing penalty parameters inL
1QP methods for strictly convex QP.This research was supported by the State Committee for Scientific Research under Grant 8S50502206. 相似文献
85.
F. B. Shepherd 《Mathematical Programming》1994,64(1-3):295-323
A 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x0: Ax
} can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.The research has partially been done when the author visited Mathematic Centrum, CWI, Amsterdam, The Netherlands. 相似文献
86.
Shaul K. Bar-Lev Daoud Bshouty Peter Enis Gérard Letac I-Li Lu Donald Richards 《Journal of Theoretical Probability》1994,7(4):883-929
A natural exponential family (NEF)F in ? n ,n>1, is said to be diagonal if there existn functions,a 1,...,a n , on some intervals of ?, such that the covariance matrixV F (m) ofF has diagonal (a 1(m 1),...,a n (m n )), for allm=(m 1,...,m n ) in the mean domain ofF. The familyF is also said to be irreducible if it is not the product of two independent NEFs in ? k and ? n-k , for somek=1,...,n?1. This paper shows that there are only six types of irreducible diagonal NEFs in ? n , that we call normal, Poisson, multinomial, negative multinomial, gamma, and hybrid. These types, with the exception of the latter two, correspond to distributions well established in the literature. This study is motivated by the following question: IfF is an NEF in ? n , under what conditions is its projectionp(F) in ? k , underp(x 1,...,x n )∶=(x 1,...,x k ),k=1,...,n?1, still an NEF in ? k ? The answer turns out to be rather predictable. It is the case if, and only if, the principalk×k submatrix ofV F (m 1,...,m n ) does not depend on (m k+1,...,m n ). 相似文献
87.
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.
88.
Under certain conditions, we show the nonexistence ofan element in the p-th cyclotomicfield over , that satisfies
. As applications, we establish the nonexistence ofsome difference sets and affine difference sets. 相似文献
89.
D. H. Fremlin R. A. Johnson E. Wajch 《Proceedings of the American Mathematical Society》1996,124(9):2897-2903
A space Borel multiplies with a space if each Borel set of is a member of the -algebra in generated by Borel rectangles. We show that a regular space Borel multiplies with every regular space if and only if has a countable network. We give an example of a Hausdorff space with a countable network which fails to Borel multiply with any non-separable metric space. In passing, we obtain a characterization of those spaces which Borel multiply with the space of countable ordinals, and an internal necessary and sufficient condition for to Borel multiply with every metric space.
90.
Choquet expected utility which uses capacities (i.e. nonadditive probability measures) in place of-additive probability measures has been introduced to decision making under uncertainty to cope with observed effects of ambiguity aversion like the Ellsberg paradox. In this paper we present necessary and sufficient conditions for stochastic dominance between capacities (i.e. the expected utility with respect to one capacity exceeds that with respect to the other one for a given class of utility functions). One wide class of conditions refers to probability inequalities on certain families of sets. To yield another general class of conditions we present sufficient conditions for the existence of a probability measureP with f dC= f dP for all increasing functionsf whenC is a given capacity. Examples includen-th degree stochastic dominance on the reals and many cases of so-called set dominance. Finally, applications to decision making are given including anticipated utility with unknown distortion function. 相似文献