全文获取类型
收费全文 | 10536篇 |
免费 | 512篇 |
国内免费 | 837篇 |
专业分类
化学 | 1276篇 |
晶体学 | 9篇 |
力学 | 502篇 |
综合类 | 88篇 |
数学 | 8569篇 |
物理学 | 1441篇 |
出版年
2023年 | 107篇 |
2022年 | 112篇 |
2021年 | 114篇 |
2020年 | 209篇 |
2019年 | 233篇 |
2018年 | 255篇 |
2017年 | 265篇 |
2016年 | 290篇 |
2015年 | 208篇 |
2014年 | 421篇 |
2013年 | 825篇 |
2012年 | 412篇 |
2011年 | 483篇 |
2010年 | 441篇 |
2009年 | 682篇 |
2008年 | 764篇 |
2007年 | 684篇 |
2006年 | 623篇 |
2005年 | 554篇 |
2004年 | 415篇 |
2003年 | 460篇 |
2002年 | 418篇 |
2001年 | 313篇 |
2000年 | 321篇 |
1999年 | 326篇 |
1998年 | 279篇 |
1997年 | 284篇 |
1996年 | 161篇 |
1995年 | 149篇 |
1994年 | 117篇 |
1993年 | 91篇 |
1992年 | 67篇 |
1991年 | 66篇 |
1990年 | 73篇 |
1989年 | 57篇 |
1988年 | 57篇 |
1987年 | 46篇 |
1986年 | 43篇 |
1985年 | 58篇 |
1984年 | 65篇 |
1983年 | 20篇 |
1982年 | 38篇 |
1981年 | 36篇 |
1980年 | 39篇 |
1979年 | 31篇 |
1978年 | 35篇 |
1977年 | 41篇 |
1976年 | 26篇 |
1974年 | 16篇 |
1973年 | 16篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Hui Ping Zhang 《数学学报(英文版)》2006,22(3):945-950
In this paper, we first define a kind of pseudo–distance function and annulus domain on Riemann surfaces, then prove the Hadamard
Theorem and the Borel–Carathéodory Theorem on any Riemann surfaces.
Supported by NSFC 10501052 相似文献
52.
In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent. 相似文献
53.
L. T. Ashchepkov D. V. Davydov 《Computational Mathematics and Mathematical Physics》2006,46(11):1910-1917
Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered. 相似文献
54.
Necessary and sufficient conditions in constrained optimization 总被引:22,自引:0,他引:22
Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient
for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions
are also given for optimality of the dual problem. Duality and converse duality are treated accordingly. 相似文献
55.
Ryusuke Kon 《Proceedings of the American Mathematical Society》2006,134(10):3025-3034
We establish an exclusion principle in discrete-time Kolmogorov systems by using average Liapunov functions. The exclusion principle shows that a weakly dominant species with a convex logarithmic growth rate function eliminates species with concave logarithmic growth rate functions. A general result is applied to specific population models. This application gives an improved exclusion principle for the specific population models.
56.
Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered. 相似文献
57.
Bernardo Lafuerza-Guillén Donal O’regan Reza Saadati 《Proceedings Mathematical Sciences》2007,117(1):61-70
We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness
of a quotient. 相似文献
58.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
59.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
60.
Zuo-liang Xu 《应用数学学报(英文版)》2007,23(4):629-636
In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed. 相似文献