全文获取类型
收费全文 | 4003篇 |
免费 | 215篇 |
国内免费 | 139篇 |
专业分类
化学 | 87篇 |
晶体学 | 1篇 |
力学 | 12篇 |
综合类 | 33篇 |
数学 | 4021篇 |
物理学 | 203篇 |
出版年
2024年 | 14篇 |
2023年 | 62篇 |
2022年 | 88篇 |
2021年 | 74篇 |
2020年 | 119篇 |
2019年 | 116篇 |
2018年 | 126篇 |
2017年 | 115篇 |
2016年 | 82篇 |
2015年 | 69篇 |
2014年 | 140篇 |
2013年 | 302篇 |
2012年 | 174篇 |
2011年 | 199篇 |
2010年 | 199篇 |
2009年 | 363篇 |
2008年 | 344篇 |
2007年 | 250篇 |
2006年 | 236篇 |
2005年 | 156篇 |
2004年 | 134篇 |
2003年 | 126篇 |
2002年 | 108篇 |
2001年 | 98篇 |
2000年 | 81篇 |
1999年 | 86篇 |
1998年 | 76篇 |
1997年 | 71篇 |
1996年 | 50篇 |
1995年 | 33篇 |
1994年 | 32篇 |
1993年 | 27篇 |
1992年 | 24篇 |
1991年 | 19篇 |
1990年 | 19篇 |
1989年 | 15篇 |
1988年 | 14篇 |
1987年 | 4篇 |
1986年 | 7篇 |
1985年 | 22篇 |
1984年 | 16篇 |
1983年 | 10篇 |
1982年 | 14篇 |
1981年 | 8篇 |
1980年 | 15篇 |
1979年 | 4篇 |
1978年 | 9篇 |
1977年 | 4篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有4357条查询结果,搜索用时 31 毫秒
81.
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. 相似文献
82.
J. -B. Hiriart-Urruty 《Journal of Optimization Theory and Applications》1986,48(1):127-140
Given a convex functionf:
p
×
q
(–, +], the marginal function is defined on
p
by (x)=inf{f(x, y)|y
q
}. Our purpose in this paper is to express the approximate first-order and second-order directional derivatives of atx
0 in terms of those off at (x
0,y
0), wherey
0 is any element for which (x
0)=f(x
0,y
0).The author is indebted to one referee for pointing out an inaccuracy in an earlier version of Theorem 4.1. 相似文献
83.
Topological indices are graph invariants used in computational chemistry to encode molecules. A frequent problem when performing structure-activity studies is that topological indices are inter-correlated. We consider a simple topological index and show asymptotic independence for a random tree model. This continues previous work on the correlation among topological indices. These findings suggest that a size-dependence in a certain class of distance-based topological indices can be eliminated.AMS subject classification: 05C80, 60E10, 92E10 相似文献
84.
W. Grüner R. Giegerich D. Strothmann C. Reidys J. Weber I. L. Hofacker P. F. Stadler P. Schuster 《Monatshefte für Chemie / Chemical Monthly》1996,127(4):355-374
Summary Global relations between RNA sequences and secondary structures are understood as mappings from sequence space into shape space. These mappings are investigated by exhaustive folding of allGC andAU sequences with chain lengths up to 30. The computed structural data are evaluated through exhaustive enumeration and used as an exact reference for testing analytical results derived from mathematical models and sampling based on statistical methods. Several new concepts of RNA sequence to secondary structure mappings are investigated, among them that ofneutral networks (being sets of sequences folding into the same structure). Exhaustive enumeration allows to test several previously suggested relations: the number of (minimum free energy) secondary structures as a function of the chain length as well as the frequency distribution of structures at constant chain length (commonly resulting in generalized forms ofZipf's law).
Analyse der Beziehungen zwischen RNA-Sequenzen und Sekundärstrukturen durch vollständige Faltung, 1. Mitt. Faltung, Neutrale Netzwerke
Zusammenfassung Die globalen Benziehungen zwischen RNA-Sequenzen und Sekundärstrukturen werden als Abbildungen aus einem Raum aller Sequenzen in einen Raum aller Strukturen aufgefaßt. Diese Abbildungen werden durch Falten aller binären Sequenzen desGC-undAU-Alphabets mit Kettenlängen bis zun=30 untersucht. Die berechneten Strukturdaten werden durch vollständiges Abzählen ausgewertet und als eine exakte Referenz zum Überprüfen analytischer Resultate aus mathematischen Modellen sowie zum Testen statistisch erhobener Proben verwendet. Einige neuartige Konzepte zur Beschreibung der Beziehungen zwischen Sequenzen und Strukturen werden eingehend untersucht, unter ihnen der Begriff derneutralen Netzwerke. Ein neutrales Netzwerk besteht aus allen Sequenzen, die eine bestimmte Struktur ausbilden. Vollständiges Abzählen ermöglicht beispielsweise die Bestimmung aller Strukturen minimaler freier Energie in Abhängigkeit von der Kettenlänge ebenso wie die Bestimmung der Häufigkeitsverteilungen der Strukturen bei konstanten Kettenlängen. Die letzteren folgen einer verallgemeinerten FormZipfschen Gesetzes.相似文献
85.
《Operations Research Letters》2022,50(6):655-659
In finite graphs, greedy algorithms are used to find minimum spanning trees (MinST) and maximum spanning trees (MaxST). In infinite graphs, we illustrate a general class of problems where a greedy approach discovers a MaxST while a MinST may be unreachable. Our algorithm is a natural extension of Prim's to infinite graphs with summable and strictly positive edge weights, producing a sequence of finite trees that converge to a MaxST. 相似文献
86.
《Discrete Mathematics》2022,345(3):112721
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates. 相似文献
87.
88.
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. 相似文献
89.
In this paper, we introduce a potential reduction method for harmonically convex programming. We show that, if the objective function and them constraint functions are allk-harmonically convex in the feasible set, then the number of iterations needed to find an -optimal solution is bounded by a polynomial inm, k, and log(1/). The method requires either the optimal objective value of the problem or an upper bound of the harmonic constantk as a working parameter. Moreover, we discuss the relation between the harmonic convexity condition used in this paper and some other convexity and smoothness conditions used in the literature.The authors like to thank Dr. Hans Nieuwenhuis for carefully reading this paper and the anonymous referees for the worthy suggestions. 相似文献
90.
András Telcs 《Journal of Theoretical Probability》1995,8(1):77-96
This paper continues the study of exponentsd(x), d
(x), d
R
(x) andd
(x) for graphG; and the nearest neighbor random walk {X
n
}
nN
onG, if the starting pointX
0=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e
,e
R
,e
are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph. 相似文献