全文获取类型
收费全文 | 48956篇 |
免费 | 1976篇 |
国内免费 | 20篇 |
专业分类
化学 | 31652篇 |
晶体学 | 239篇 |
力学 | 1571篇 |
数学 | 7592篇 |
物理学 | 9898篇 |
出版年
2023年 | 375篇 |
2022年 | 295篇 |
2021年 | 495篇 |
2020年 | 678篇 |
2019年 | 636篇 |
2018年 | 1002篇 |
2017年 | 819篇 |
2016年 | 1528篇 |
2015年 | 1410篇 |
2014年 | 1405篇 |
2013年 | 2911篇 |
2012年 | 3402篇 |
2011年 | 3464篇 |
2010年 | 2072篇 |
2009年 | 1703篇 |
2008年 | 2970篇 |
2007年 | 3002篇 |
2006年 | 2636篇 |
2005年 | 2557篇 |
2004年 | 2200篇 |
2003年 | 1789篇 |
2002年 | 1552篇 |
2001年 | 913篇 |
2000年 | 770篇 |
1999年 | 551篇 |
1998年 | 410篇 |
1997年 | 373篇 |
1996年 | 474篇 |
1995年 | 307篇 |
1994年 | 353篇 |
1993年 | 361篇 |
1992年 | 389篇 |
1991年 | 332篇 |
1990年 | 313篇 |
1989年 | 311篇 |
1988年 | 253篇 |
1987年 | 257篇 |
1986年 | 219篇 |
1985年 | 382篇 |
1984年 | 349篇 |
1983年 | 238篇 |
1982年 | 334篇 |
1981年 | 316篇 |
1980年 | 280篇 |
1979年 | 270篇 |
1978年 | 255篇 |
1976年 | 269篇 |
1975年 | 245篇 |
1974年 | 251篇 |
1973年 | 240篇 |
排序方式: 共有10000条查询结果,搜索用时 203 毫秒
131.
This Note deals with the sensitivity analysis of a newtonian incompressible fluid driven by the Navier–Stokes equations with respect to the dynamic of the fluid domain boundary. The structure of the gradient with respect to the velocity of the domain for a given cost function is established. This result is obtained using new shape derivation tools for Eulerian functionals and the Min–Max derivation principle. To cite this article: R. Dziri et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004). 相似文献
132.
Let Um be an m×m Haar unitary matrix and U[m,n] be its n×n truncation. In this paper the large deviation is proven for the empirical eigenvalue density of U[m,n] as m/n→λ and n→∞. The rate function and the limit distribution are given explicitly. U[m,n] is the random matrix model of quq, where u is a Haar unitary in a finite von Neumann algebra, q is a certain projection and they are free. The limit distribution coincides with the Brown measure of the operator quq. 相似文献
133.
The piston problem is investigated in the case where the length of the cylinder is infinite (on both sides) and the ratio m/M is a very small parameter, where m is the mass of one particle of the gaz and M is the mass of the piston. Introducing initial conditions such that the stochastic motion of the piston remains in the average at the origin (no drift), it is shown that the time evolution of the fluids, analytically derived from Liouville equation in a previous work, agrees with the Second Law of thermodynamics. We thus have a non equilibrium microscopical model whose evolution can be explicitly shown to obey the two laws of thermodynamics. 相似文献
134.
Marcel Crabbé 《Comptes Rendus Mathematique》2004,338(6):433-436
We investigate the notion of substitution in an abstract way, without defining it explicitly. We single out the essential features of the operation of performing a substitution in order to define a concept of substitutive structure, called logos. We then prove a completeness theorem making precise and justifying the intuition that formulas true for the usual substitution can be proved from the logos axioms only. To cite this article: M. Crabbé, C. R. Acad. Sci. Paris, Ser. I 338 (2004). 相似文献
135.
Christian J. Bordé Claus Lämmerzahl Ernst M. Rasel 《General Relativity and Gravitation》2004,36(10):2193-2196
136.
We solve numerically the Monge–Ampère equation with periodic boundary condition using a Newton's algorithm. We prove convergence of the algorithm, and present some numerical examples, for which a good approximation is obtained in 10 iterations. To cite this article: G. Loeper, F. Rapetti, C. R. Acad. Sci. Paris, Ser. I 340 (2005). 相似文献
137.
Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405. 相似文献
138.
A time-dependent model corresponding to an Oldroyd-B viscoelastic fluid is considered, the convective terms being disregarded.
Global existence in time is proved in Banach spaces provided the data are small enough, using the implicit function theorem
and a maximum regularity property for a three fields Stokes problem. A finite element discretization in space is then proposed.
Existence of the numerical solution is proved for small data, so as a priori error estimates, using again an implicit function
theorem.
Supported by the Swiss National Science Foundation. Fellowship PBEL2–114311. 相似文献
139.
Monique Laurent 《Mathematical Programming》2007,109(2-3):239-261
We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras.
The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located
between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with
O(n
7) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n
3), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s
bound with the same computational complexity.
Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203. 相似文献
140.
René Meziat Diego Patiño Pablo Pedregal 《Computational Optimization and Applications》2007,38(1):147-171
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control
problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control
variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex
optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on
global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking
of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also
present the numerical schemes to solve several examples arising in science and technology. 相似文献