全文获取类型
收费全文 | 67237篇 |
免费 | 1175篇 |
国内免费 | 286篇 |
专业分类
化学 | 31792篇 |
晶体学 | 440篇 |
力学 | 2153篇 |
综合类 | 14篇 |
数学 | 15509篇 |
物理学 | 18790篇 |
出版年
2023年 | 209篇 |
2021年 | 326篇 |
2020年 | 514篇 |
2019年 | 349篇 |
2018年 | 1635篇 |
2017年 | 1868篇 |
2016年 | 1687篇 |
2015年 | 1389篇 |
2014年 | 1401篇 |
2013年 | 2714篇 |
2012年 | 4677篇 |
2011年 | 4198篇 |
2010年 | 2793篇 |
2009年 | 2337篇 |
2008年 | 2409篇 |
2007年 | 2404篇 |
2006年 | 2211篇 |
2005年 | 5854篇 |
2004年 | 5040篇 |
2003年 | 3287篇 |
2002年 | 1402篇 |
2001年 | 1051篇 |
2000年 | 783篇 |
1999年 | 636篇 |
1998年 | 546篇 |
1997年 | 479篇 |
1996年 | 574篇 |
1995年 | 519篇 |
1994年 | 540篇 |
1993年 | 586篇 |
1992年 | 641篇 |
1991年 | 517篇 |
1990年 | 537篇 |
1989年 | 442篇 |
1988年 | 436篇 |
1987年 | 408篇 |
1986年 | 345篇 |
1985年 | 531篇 |
1984年 | 506篇 |
1983年 | 468篇 |
1982年 | 475篇 |
1981年 | 474篇 |
1980年 | 435篇 |
1979年 | 402篇 |
1978年 | 447篇 |
1977年 | 418篇 |
1976年 | 422篇 |
1975年 | 368篇 |
1974年 | 354篇 |
1973年 | 376篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
J. Fülöp 《Mathematical Methods of Operations Research》1991,35(1):1-13
This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.
Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.相似文献
72.
György Gát 《Analysis Mathematica》2006,32(1):25-48
Summary It is known that the Fejér means - with respect to the character system of the Walsh, and bounded Vilenkin groups - of an
integrable function converge to the function a.e. In this work we discuss analogous problems on the complete product of finite,
not necessarily Abelian groups with respect to the character system for functions that are constant on the conjugacy classes.
We find that the nonabelian case differs from the commutative case. We prove the a.e. convergence of the (C,1) means of the Fourier series of square integrable functions. We also prove the existence of a function f∊Lq for some q >1 such that sup |σn f | = + ∞ a.e. This is a sharp contrast between the Abelian and the nonabelian cases. 相似文献
73.
74.
Jürg Fröhlich Tai-Peng Tsai Horng-Tzer Yau 《Communications in Mathematical Physics》2002,225(2):223-274
We consider the nonlinear Hartree equation describing the dynamics of weakly interacting non-relativistic Bosons. We show
that a nonlinear M?ller wave operator describing the scattering of a soliton and a wave can be defined. We also consider the dynamics of a
soliton in a slowly varying background potential W(ɛx). We prove that the soliton decomposes into a soliton plus a scattering wave (radiation) up to times of order ɛ−1. To leading order, the center of the soliton follows the trajectory of a classical particle in the potential W(ɛx).
Received: 30 June 2000 / Accepted: 25 June 2001 相似文献
75.
Jörg Zintl 《Mathematische Zeitschrift》2002,242(3):415-426
76.
A cutting plane algorithm for a clustering problem 总被引:2,自引:0,他引:2
In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. We have studied the latter problem from a polyhedral point of view and determined large classes of facets of the associated polytope. These theoretical results are utilized in this paper. We describe a cutting plane algorithm that is based on the simplex method and uses exact and heuristic separation routines for some of the classes of facets mentioned before. We discuss some details of the implementation of our code and present our computational results. We mention applications from, e.g., zoology, economics, and the political sciences. 相似文献
77.
I Cserpan M Kalman M L Tj?rnhammar A Simoncsits 《Acta chemica Scandinavica (Copenhagen, Denmark : 1989)》1991,45(3):265-272
A general method to convert single-stranded, chemically synthesized oligonucleotides into cloned duplexes is described. Oligonucleotides supplied with 3'-terminal extensions that are complementary to 3'-protruding ends obtained by certain restriction enzymes can be cloned either directly or with the help of an adapter molecule into double-stranded vectors. Two methods have also been developed for consecutive cloning applications. According to these methods, the synthetic oligonucleotides (and their enzymatically prepared complementary strands) are joined, one after the other, inside a cloning vector, each joining requiring one cloning step. Synthetic genes are thus built up from oligonucleotides corresponding to only one strand of the DNA. The sequential assembly of the cloned duplex takes place in the 5' to 3' direction. Each oligonucleotide is supplied with a four-nucleotide-long 3'-terminal extension, but this sequence is eliminated when the joining takes place, leaving no limiting sequence between the oligonucleotides. The two consecutive cloning methods, the adapter and the polycloning site methods, are illustrated by the assembly of short artificial genes. 相似文献
78.
79.
Andrzej Wi?nicki 《Journal of Mathematical Analysis and Applications》2002,267(1):158-172
We use a newly introduced concept of neocompactness to study problems from metric fixed point theory. In particular, we give a sufficient condition for a superreflexive Banach space X to have the fixed point property and obtain shorter proofs of some well-known results in that theory. 相似文献
80.
In contrast to stochastic differential equation models used for the calculation of the term structure of interest rates, we
develop an approach based on linear dynamical systems under non-stochastic uncertainty with perturbations. The uncertainty
is described in terms of known feasible sets of varying parameters. Observations are used in order to estimate these parameters
by minimizing the maximum of the absolute value of measurement errors, which leads to a linear or nonlinear semi-infinite
programming problem. A regularized logarithmic barrier method for solving (ill-posed) convex semi-infinite programming problems
is suggested. In this method a multi-step proximal regularization is coupled with an adaptive discretization strategy in the
framework of an interior point approach. A special deleting rule permits one to use only a part of the constraints of the
discretized problems. Convergence of the method and its stability with respect to data perturbations in the cone of convexC
1-functions are studied. On the basis of the solutions of the semi-infinite programming problems a technical trading system
for future contracts of the German DAX is suggested and developed.
Supported by the Stiftung Rheinland/Pfalz für Innovation, No. 8312-386261/307. 相似文献