全文获取类型
收费全文 | 2290篇 |
免费 | 145篇 |
国内免费 | 39篇 |
专业分类
化学 | 113篇 |
晶体学 | 11篇 |
力学 | 1176篇 |
综合类 | 2篇 |
数学 | 628篇 |
物理学 | 544篇 |
出版年
2024年 | 1篇 |
2023年 | 22篇 |
2022年 | 20篇 |
2021年 | 25篇 |
2020年 | 48篇 |
2019年 | 52篇 |
2018年 | 57篇 |
2017年 | 58篇 |
2016年 | 65篇 |
2015年 | 67篇 |
2014年 | 69篇 |
2013年 | 190篇 |
2012年 | 87篇 |
2011年 | 115篇 |
2010年 | 114篇 |
2009年 | 140篇 |
2008年 | 121篇 |
2007年 | 137篇 |
2006年 | 110篇 |
2005年 | 120篇 |
2004年 | 96篇 |
2003年 | 99篇 |
2002年 | 74篇 |
2001年 | 54篇 |
2000年 | 64篇 |
1999年 | 59篇 |
1998年 | 59篇 |
1997年 | 45篇 |
1996年 | 41篇 |
1995年 | 30篇 |
1994年 | 33篇 |
1993年 | 43篇 |
1992年 | 31篇 |
1991年 | 33篇 |
1990年 | 13篇 |
1989年 | 20篇 |
1988年 | 18篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 5篇 |
1984年 | 8篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1977年 | 2篇 |
1975年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有2474条查询结果,搜索用时 15 毫秒
31.
This paper deals with time series of the Yellow River daily
flows at Tongguan hydrological station, from the year 2000 to
2005. Power spectrum analysis and statistical moment scaling
function on a range of scales revealed scaling qualities of the
data. The partition function, which displayed a convex
curvature, and the generalized dimension function showed that
multifractality is presented. The singularity spectrum, which is
single-humped, has shown strong multifractality degree. 相似文献
32.
33.
G. Gonnella A. Lamura D. Suppa 《The European Physical Journal B - Condensed Matter and Complex Systems》2000,13(1):169-174
The effect of shear flow on the phase-ordering dynamics of a binary mixture with field-dependent mobility is investigated.
The problem is addressed in the context of the time-dependent Ginzburg-Landau equation with an external velocity term, studied
in self-consistent approximation. Assuming a scaling ansatz for the structure factor, the asymptotic behavior of the observables
in the scaling regime can be analytically calculated. All the observables show log-time periodic oscillations which we interpret
as due to a cyclical mechanism of stretching and break-up of domains. These oscillations are damped as consequence of the
vanishing of the mobility in the bulk phase.
Received 13 April 1999 相似文献
34.
35.
36.
The generalized Riemann problem (GRP) scheme for the Euler equations and gas-kinetic scheme (GKS) for the Boltzmann equation are two high resolution shock capturing schemes for fluid simulations. The difference is that one is based on the characteristics of the inviscid Euler equations and their wave interactions, and the other is based on the particle transport and collisions. The similarity between them is that both methods can use identical MUSCL-type initial reconstructions around a cell interface, and the spatial slopes on both sides of a cell interface involve in the gas evolution process and the construction of a time-dependent flux function. Although both methods have been applied successfully to the inviscid compressible flow computations, their performances have never been compared. Since both methods use the same initial reconstruction, any difference is solely coming from different underlying mechanism in their flux evaluation. Therefore, such a comparison is important to help us to understand the correspondence between physical modeling and numerical performances. Since GRP is so faithfully solving the inviscid Euler equations, the comparison can be also used to show the validity of solving the Euler equations itself. The numerical comparison shows that the GRP exhibits a slightly better computational efficiency, and has comparable accuracy with GKS for the Euler solutions in 1D case, but the GKS is more robust than GRP. For the 2D high Mach number flow simulations, the GKS is absent from the shock instability and converges to the steady state solutions faster than the GRP. The GRP has carbuncle phenomena, likes a cloud hanging over exact Riemann solvers. The GRP and GKS use different physical processes to describe the flow motion starting from a discontinuity. One is based on the assumption of equilibrium state with infinite number of particle collisions, and the other starts from the non-equilibrium free transport process to evolve into an equilibrium one through particle collisions. The different mechanism in the flux evaluation deviates their numerical performance. Through this study, we may conclude scientifically that it may NOT be valid to use the Euler equations as governing equations to construct numerical fluxes in a discretized space with limited cell resolution. To adapt the Navier–Stokes (NS) equations is NOT valid either because the NS equations describe the flow behavior on the hydrodynamic scale and have no any corresponding physics starting from a discontinuity. This fact alludes to the consistency of the Euler and Navier–Stokes equations with the continuum assumption and the necessity of a direct modeling of the physical process in the discretized space in the construction of numerical scheme when modeling very high Mach number flows. The development of numerical algorithm is similar to the modeling process in deriving the governing equations, but the control volume here cannot be shrunk to zero. 相似文献
37.
Many natural rock systems contain small patches of different permeability which affect the flow of fluids through them. As these heterogeneities become smaller and more numerous, they become harder to model numerically. We consider how to reduce the computational effort required in simulations by incorporating their effects in the boundary conditions at the edges of each grid block. This is in contrast with current methods which involve often arbitrary changes in the fluid properties. The method is restricted to the case of widely-spaced patches, which simplifies interaction effects. The system then reduces to an array of dipoles, and two averaging methods are proposed for finite grid blocks. Several infinite systems, including vertical and horizontal bands, are also considered as further approximations. There is a great wealth of existing results from different fields which lead to identical mathematical problems and which can be used in these cases. Finally, we consider how to use these techniques when the precise configuration of the grid block is not known, but only its statistical properties. This can lead to results which are very different from the deterministic case. 相似文献
38.
Dominique de Werra 《Graphs and Combinatorics》2003,19(2):263-278
The theorem of Birkhoff – von Neumann concerns bistochastic matrices (i.e., matrices with nonnegative real entries such that
all row sums and all column sums are equal to one). We consider here real matrices with entries unrestricted in sign and we
extend the notion of permutation matrices (integral bistochastic matrices); some generalizations of the theorem are derived
by using elementary properties of graph theory.
Received: October 10, 2000 Final version received: April 11, 2002 相似文献
39.
Sérgio R. Fenley 《Geometriae Dedicata》2003,99(1):61-102
We study incompressible tori in 3-manifolds supporting pseudo-Anosov flows and more generally ZZ subgroups of the fundamental group of such a manifold. If no element in this subgroup can be represented by a closed orbit of the pseudo-Anosov flow, we prove that the flow is topologically conjugate to a suspension of an Anosov diffeomorphism of the torus. In particular it is non singular and is an Anosov flow. It follows that either a pseudo-Anosov flow is topologically conjugate to a suspension Anosov flow, or any immersed incompressible torus can be realized as a free homotopy from a closed orbit of the flow to itself. The key tool is an analysis of group actions on non-Hausdorff trees, also known as R-order trees – we produce an invariant axis in the free action case. An application of these results is the following: suppose the manifold has an R-covered foliation transverse to a pseudo-Anosov flow. If the flow is not an R-covered Anosov flow, then it follows that the manifold is atoroidal. 相似文献
40.
An incremental algorithm may yield an enormous computational time saving to solve a network flow problem. It updates the solution to an instance of a problem for a unit change in the input. In this paper we have proposed an efficient incremental implementation of maximum flow problem after inserting an edge in the network G. The algorithm has the time complexity of O((n)2
m), where n is the number of affected vertices and m is the number of edges in the network. We have also discussed the incremental algorithm for deletion of an edge in the network G. 相似文献