全文获取类型
收费全文 | 4913篇 |
免费 | 427篇 |
国内免费 | 384篇 |
专业分类
化学 | 487篇 |
晶体学 | 19篇 |
力学 | 749篇 |
综合类 | 76篇 |
数学 | 3479篇 |
物理学 | 914篇 |
出版年
2024年 | 9篇 |
2023年 | 43篇 |
2022年 | 76篇 |
2021年 | 67篇 |
2020年 | 101篇 |
2019年 | 110篇 |
2018年 | 141篇 |
2017年 | 130篇 |
2016年 | 160篇 |
2015年 | 122篇 |
2014年 | 210篇 |
2013年 | 357篇 |
2012年 | 193篇 |
2011年 | 234篇 |
2010年 | 172篇 |
2009年 | 241篇 |
2008年 | 319篇 |
2007年 | 309篇 |
2006年 | 284篇 |
2005年 | 253篇 |
2004年 | 191篇 |
2003年 | 213篇 |
2002年 | 204篇 |
2001年 | 188篇 |
2000年 | 194篇 |
1999年 | 186篇 |
1998年 | 153篇 |
1997年 | 105篇 |
1996年 | 111篇 |
1995年 | 88篇 |
1994年 | 85篇 |
1993年 | 59篇 |
1992年 | 47篇 |
1991年 | 56篇 |
1990年 | 37篇 |
1989年 | 32篇 |
1988年 | 29篇 |
1987年 | 17篇 |
1986年 | 15篇 |
1985年 | 36篇 |
1984年 | 23篇 |
1983年 | 9篇 |
1982年 | 17篇 |
1981年 | 20篇 |
1980年 | 21篇 |
1979年 | 17篇 |
1978年 | 14篇 |
1977年 | 7篇 |
1976年 | 10篇 |
1975年 | 3篇 |
排序方式: 共有5724条查询结果,搜索用时 58 毫秒
1.
The large deviation principle (LDP) which has been effectively used in queueing analysis is the sample path LDP, the LDP in a function space endowed with the uniform topology. Chang [5] has shown that in the discrete-time G/D/1 queueing system under the FIFO discipline, the departure process satisfies the sample path LDP if so does the arrival process. In this paper, we consider arrival processes satisfying the LDP in a space of measures endowed with the weak* topology (Lynch and Sethuraman [12]) which holds under a weaker condition. It is shown that in the queueing system mentioned above, the departure processes still satisfies the sample path LDP. Our result thus covers arrival processes which can be ruled out in the work of Chang [5]. The result is then applied to obtain the exponential decay rate of the queue length probability in an intree network as was obtained by Chang [5], who considered the arrival process satisfying the sample path LDP. 相似文献
2.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008 相似文献
3.
In this paper we introduce a generalization of stable sets: stable multi-sets. A stable multi-set is an assignment of integers
to the vertices of a graph, such that specified bounds on vertices and edges are not exceeded. In case all vertex and edge
bounds equal one, stable multi-sets are equivalent to stable sets.
For the stable multi-set problem, we derive reduction rules and study the associated polytope. We state necessary and sufficient
conditions for the extreme points of the linear relaxation to be integer. These conditions generalize the conditions for the
stable set polytope. Moreover, the classes of odd cycle and clique inequalities for stable sets are generalized to stable
multi-sets and conditions for them to be facet defining are determined.
The study of stable multi-sets is initiated by optimization problems in the field of telecommunication networks. Stable multi-sets
emerge as an important substructure in the design of optical networks.
Received: February 14, 2001/Revised version: September 7, 2001 相似文献
4.
Alexander Krasnosel'skii Dmitrii Rachinskii 《NoDEA : Nonlinear Differential Equations and Applications》2002,9(1):93-115
We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The
nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the
system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear
Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We
present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These
bifurcation points are determined by simple characteristics of the hysteresis nonlinearity. 相似文献
5.
通过分析计算,设计了一种大口径宽视场折射式红外相机光学系统。该系统设计用于超长线阵扫描红外相机的地面演示成像,它能同时对短波2μm—3μm、中波3μm—4.5μm双波段成像,且同时具有24°的大视场和150mm的宽口径,成像质量接近衍射极限。该系统在航天遥感领域应用广泛。 相似文献
6.
When an organization solves a portfolio problem with public projects evaluated by multiple criteria, in which the economic dimension is not essential or not well characterized, the classical methods are not useful. We propose a non-linear preference model developed from normative Value Theory and using fuzzy sets to model some sources of imprecision. This model can be considered as a generalization of the classical approaches. However, the optimization problem is very complex in order to be solved with non-linear programming techniques. Therefore, the model is exploited by an evolutionary algorithm, able to achieve a strong improvement of the quality of solution. 相似文献
7.
Settling of a large solid particle in bioconvection flow caused by gyrotactic microorganisms is investigated. The particle is released from the top of the bioconvection chamber; its settling pattern depends on whether it is released in the centre of the bioconvection plume or at its periphery. The Chimera method is utilized; a subgrid is generated around a moving particle. The method suggested by Liu and Wang (Comput. Fluid 2004; 33 :223–255) is further developed to account for the presence of a moving boundary in the streamfunction‐vorticity formulation using the finite‐difference method. A number of cases for different release positions of the particle are computed. It is demonstrated that bioconvection can either accelerate or decelerate settling of the particle depending on the initial position of the particle relative to the plume centre. It is also shown that the particle impacts bioconvection plume by changing its shape and location in the chamber. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
8.
Large eddy simulations of two basic configurations (decay of isotropic turbulence, and the academic plane channel flow) with heat transfer have been performed comparing several convection numerical schemes, in order to discuss their ability to evaluate temperature fluctuations properly. Results are compared with the available incompressible heat transfer direct numerical simulation data. It is shown that the use of regularizing schemes (such as high order upwind type schemes) for the temperature transport equation in combination with centered schemes for momentum transport equation gives better results than the use of centred schemes for both equations. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
9.
The exponential functional of simple, symmetric random walks with negative
drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent
and identically distributed non-negative random variables. It has moments that are
rational functions of the variables μ
k
= E(ξ
k
) < 1 with universal coefficients. It
turns out that such a coefficient is equal to the number of permutations with descent
set defined by the multiindex of the coefficient. A recursion enumerates all numbers
of permutations with given descent sets in the form of a Pascal-type triangle.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
10.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献