全文获取类型
收费全文 | 50784篇 |
免费 | 6254篇 |
国内免费 | 4920篇 |
专业分类
化学 | 12653篇 |
晶体学 | 991篇 |
力学 | 12687篇 |
综合类 | 702篇 |
数学 | 19448篇 |
物理学 | 15477篇 |
出版年
2024年 | 124篇 |
2023年 | 558篇 |
2022年 | 985篇 |
2021年 | 1114篇 |
2020年 | 1423篇 |
2019年 | 1226篇 |
2018年 | 1257篇 |
2017年 | 1769篇 |
2016年 | 1952篇 |
2015年 | 1550篇 |
2014年 | 2535篇 |
2013年 | 3635篇 |
2012年 | 2891篇 |
2011年 | 3388篇 |
2010年 | 2869篇 |
2009年 | 3221篇 |
2008年 | 3156篇 |
2007年 | 3171篇 |
2006年 | 2944篇 |
2005年 | 2721篇 |
2004年 | 2367篇 |
2003年 | 2181篇 |
2002年 | 1953篇 |
2001年 | 1679篇 |
2000年 | 1581篇 |
1999年 | 1481篇 |
1998年 | 1339篇 |
1997年 | 1141篇 |
1996年 | 924篇 |
1995年 | 823篇 |
1994年 | 699篇 |
1993年 | 533篇 |
1992年 | 558篇 |
1991年 | 437篇 |
1990年 | 355篇 |
1989年 | 260篇 |
1988年 | 195篇 |
1987年 | 156篇 |
1986年 | 111篇 |
1985年 | 143篇 |
1984年 | 124篇 |
1983年 | 72篇 |
1982年 | 78篇 |
1981年 | 54篇 |
1980年 | 32篇 |
1979年 | 49篇 |
1978年 | 33篇 |
1977年 | 41篇 |
1976年 | 15篇 |
1957年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Guido Consonni Piero Veronese 《Annals of the Institute of Statistical Mathematics》1993,45(2):303-315
Given two random variables (X, Y) the condition of unbiasedness states that:E(X |Y=y)=y andE(Y |X=x)=x both almost surely (a.s.). If the prior onY is proper and has finite expectation or non-negative support, unbiasedness impliesX=Y a.s. This paper examines the implications of unbiasedness when the prior onY is improper. Since the improper case can be meaningfully analysed in a finitely additive framework, we revisit the whole issue of unbiasedness from this perspective. First we argue that a notion weaker than equality a.s., named coincidence, is more appropriate in a finitely additive setting. Next we discuss the meaning of unbiasedness from a Bayesian and fiducial perspective. We then show that unbiasedness and finite expectation ofY imply coincidence betweenX andY, while a weaker conclusion follows if the improper prior onY is only assumed to have positive support. We illustrate our approach throughout the paper by revisiting some examples discussed in the recent literature.This work was partially supported by C.N.R. grant N.80.02970.10 (G.C.) and by C.N.R. grant altri interventi (P.V.). A preliminary draft was written while the Authors were visiting the Department of Statistics at Carnegie Mellon University.The paper is the result of close cooperation between the two authors. However subsections 3.1 and 3.3 are mainly due to G.C. while subsection 3.2 and section 4 are mainly due to P.V. 相似文献
992.
In this paper we study a particular class of primal-dual path-following methods which try to follow a trajectory of interior feasible solutions in primal-dual space toward an optimal solution to the primal and dual problem. The methods investigated are so-called first-order methods: each iteration consists of a long step along the tangent of the trajectory, followed by explicit recentering steps to get close to the trajectory again. It is shown that the complexity of these methods, which can be measured by the number of points close to the trajectory which have to be computed in order to achieve a desired gain in accuracy, is bounded by an integral along the trajectory. The integrand is a suitably weighted measure of the second derivative of the trajectory with respect to a distinguished path parameter, so the integral may be loosely called a curvature integral. 相似文献
993.
We revisit the Landau-Teller heuristic approach to adiabatic invariants and, following Rapp, use it to investigate the energy exchanges between the different degrees of freedom, in simple Hamiltonian systems describing the collision of fast rotating or vibrating molecules with a fixed wall. We critically compare the theoretical results with particularly accurate numerical computations (quite small energy exchanges, namely of one part over 1030, are measured). 相似文献
994.
Jong-Shi Pang 《Mathematical Programming》1993,58(1-3):149-160
This paper is concerned with two well-known families of iterative methods for solving the linear and nonlinear complementarity problems. For the linear complementarity problem, we consider the class of matrix splitting methods and establish, under a finiteness assumption on the number of solutions, a necessary and sufficient condition for the convergence of the sequence of iterates produced. A rate of convergence result for this class of methods is also derived under a stability assumption on the limit solution. For the nonlinear complementarity problem, we establish the convergence of the Newton method under the assumption of a pseudo-regular solution which generalizes Robinson's concept of a strongly regular solution. In both instances, the convergence proofs rely on a common sensitivity result of the linear complementarity problem under perturbation.This work was based on research supported by the National Science Foundation under grant ECS-8717968. 相似文献
995.
In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy proximal term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.Research supported by the National Science Foundation under Grant DDM-8903385, and the Army Research Office under Grant DAAL03-86-K-0171. 相似文献
996.
Arie Tamir 《Mathematical Programming》1993,62(1-3):475-496
In the classicalp-center location model on a network there is a set of customers, and the primary objective is to selectp service centers that will minimize the maximum distance of a customer to a closest center. Suppose that thep centers receive their supplies from an existing central depot on the network, e.g. a warehouse. Thus, a secondary objective is to locate the centers that optimize the primary objective as close as possible to the central depot. We consider tree networks and twop-center models. We show that the set of optimal solutions to the primary objective has a semilattice structure with respect to some natural ordering. Using this property we prove that there is ap-center solution to the primary objective that simultaneously minimizes every secondary objective function which is monotone nondecreasing in the distances of thep centers from the existing central depot.Restricting the location models to a rooted path network (real line) we prove that the above results hold for the respective classicalp-median problems as well. 相似文献
997.
S. K. Zavriev 《Journal of Global Optimization》1993,3(1):67-78
The paper is devoted to the convergence properties of finite-difference local descent algorithms in global optimization problems with a special -convex structure. It is assumed that the objective function can be closely approximated by some smooth convex function. Stability properties of the perturbed gradient descent and coordinate descent methods are investigated. Basing on this results some global optimization properties of finite-difference local descent algorithms, in particular, coordinate descent method, are discovered. These properties are not inherent in methods using exact gradients.The paper was presented at the II. IIASA-Workshop on Global Optimization, Sopron (Hungary), December 9–14, 1990. 相似文献
998.
Emanuele Galligani 《Numerical Algorithms》1993,5(11):549-555
Givenn pairwise distinct and arbitrarily spaced pointsP
i in a domainD of thex–y plane andn real numbersf
i, consider the problem of computing a bivariate functionf(x, y) of classC
1 inD whose values inP
i are exactlyf
i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ
l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy. 相似文献
999.
Random walk on distant mesh points Monte Carlo methods 总被引:1,自引:0,他引:1
A new technique for obtaining Monte Carlo algorithms based on the Markov chains with a finite number of states is suggested. Instead of the classical random walk on neighboring mesh points, a general way of constructing Monte Carlo algorithms that could be called random walk on distant mesh points is considered. It is applied to solve boundary value problems. The numerical examples indicate that the new methods are less laborious and therefore more efficient.In conclusion, we mention that all Monte Carlo algorithms are parallel and could be easily realized on parallel computers. 相似文献
1000.
用新颖的干粉方法合成系列沸石的研究已从五元环沸石延伸到具有四元环和六元环的方钠石。本研究运用干粉方法在Na2O-SiO2-Al2O3混合物中分别以乙醇胺和乙二胺-氟化物为模板,合成出了方钠石。有机模板剂以吸附态模板方式进入体系。用XRD数据、扫描电镜图及红外光谱测试结果对实验产品做了表征。结果表明,干粉体系制备的方钠石的晶胞参数小于水热体系和非水体系合成的方钠石的相应值。而以乙醇胺为模板制备的方钠石与以乙二胺-氟化物为模板的样品比较,后者具有较快的晶化速度、较小的晶胞体积和晶粒 相似文献