全文获取类型
收费全文 | 4917篇 |
免费 | 641篇 |
国内免费 | 362篇 |
专业分类
化学 | 761篇 |
晶体学 | 45篇 |
力学 | 977篇 |
综合类 | 87篇 |
数学 | 2734篇 |
物理学 | 1316篇 |
出版年
2024年 | 11篇 |
2023年 | 48篇 |
2022年 | 94篇 |
2021年 | 127篇 |
2020年 | 136篇 |
2019年 | 125篇 |
2018年 | 146篇 |
2017年 | 191篇 |
2016年 | 165篇 |
2015年 | 128篇 |
2014年 | 207篇 |
2013年 | 445篇 |
2012年 | 209篇 |
2011年 | 253篇 |
2010年 | 224篇 |
2009年 | 288篇 |
2008年 | 268篇 |
2007年 | 319篇 |
2006年 | 299篇 |
2005年 | 283篇 |
2004年 | 248篇 |
2003年 | 217篇 |
2002年 | 226篇 |
2001年 | 186篇 |
2000年 | 168篇 |
1999年 | 149篇 |
1998年 | 142篇 |
1997年 | 125篇 |
1996年 | 82篇 |
1995年 | 68篇 |
1994年 | 66篇 |
1993年 | 39篇 |
1992年 | 35篇 |
1991年 | 38篇 |
1990年 | 22篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 8篇 |
1986年 | 16篇 |
1985年 | 17篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1982年 | 12篇 |
1981年 | 6篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1971年 | 3篇 |
1959年 | 2篇 |
1936年 | 2篇 |
排序方式: 共有5920条查询结果,搜索用时 15 毫秒
51.
52.
V. D. Lakiza 《International Applied Mechanics》2005,41(1):85-89
The results from an experimental study into the dynamic behavior of a gas-liquid medium and solid particles in a compound shell (sphere-truncated cone) are reported on. The following processes are studied: formation of gas bubbles and their clusters, strong macroflows, and intensive chaotic motion of the medium in the truncated cone as a nonlinear vibrating liquid-gas system__________Translated from Prikladnaya Mekhanika, Vol. 41, No. 1, pp. 112–118, January 2005. 相似文献
53.
H-空间与拟向量变分不等式 总被引:2,自引:0,他引:2
本在Hausdorff locally convex H-空间上建立了一个新的不动点定理;利用局部交性质,在Hausdorff locally convex H-空间上建立了相应的拟向量变分不等式. 相似文献
54.
We study the system of nonlinear differential equations which expresses the constancy of the algebraic invariants of the Jacobian matrix for smooth vector fields in three-dimensional space. This system is equivalent to the equations of gas dynamics which describe the barochronous motions of a gas (the pressure and density depend only on the time). We present the results of computation of the admissible local Lie group and construction of the general solution of the system. We mention a few new problems that arise here. 相似文献
55.
56.
An algorithm for a time accurate incompressible Navier–Stokes solver on an unstructured grid is presented. The algorithm uses a second order, three‐point, backward difference formula for the physical time marching. For each time step, a divergence free flow field is obtained based on an artificial compressibility method. An implicit method with a local time step is used to accelerate the convergence for the pseudotime iteration. To validate the code, an unsteady laminar flow over a circular cylinder at a Reynolds number of 200 is calculated. The results are compared with available experimental and numerical data and good agreements are achieved. Using the developed unsteady code, an interaction of a Karman vortex street with an elliptical leading edge is simulated. The incident Karman vortex street is generated by a circular cylinder located upstream. A clustering to the path of the vortices is achieved easily due to flexibility of an unstructured grid. Details of the interaction mechanism are analysed by investigating evolutions of vortices. Characteristics of the interactions are compared for large‐ and small‐scale vortex streets. Different patterns of the interaction are observed for those two vortex streets and the observation is in agreement with experiment. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
57.
In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd. 相似文献
58.
Modelling a complex geometry, such as ice roughness, plays a key role for the computational flow analysis over rough surfaces. This paper presents two enhancement ideas in modelling roughness geometry for local flow analysis over an aerodynamic surface. The first enhancement is use of the leading‐edge region of an airfoil as a perturbation to the parabola surface. The reasons for using a parabola as the base geometry are: it resembles the airfoil leading edge in the vicinity of its apex and it allows the use of a lower apparent Reynolds number. The second enhancement makes use of the Fourier analysis for modelling complex ice roughness on the leading edge of airfoils. This method of modelling provides an analytical expression, which describes the roughness geometry and the corresponding derivatives. The factors affecting the performance of the Fourier analysis were also investigated. It was shown that the number of sine–cosine terms and the number of control points are of importance. Finally, these enhancements are incorporated into an automated grid generation method over the airfoil ice accretion surface. The validations for both enhancements demonstrate that they can improve the current capability of grid generation and computational flow field analysis around airfoils with ice roughness. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
59.
Brenda J. Latka 《Journal of Graph Theory》2003,42(3):165-192
A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N5 on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N5 by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T1,…,Tk} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T1,…,Tk is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003 相似文献
60.
Finding Robust Solutions Using Local Search 总被引:1,自引:0,他引:1
Kenneth Sörensen 《Journal of Mathematical Modelling and Algorithms》2004,3(1):89-103
This paper investigates how a local search metaheuristic for continuous optimisation can be adapted so that it finds broad
peaks, corresponding to robust solutions. This is relevant in problems in which uncertain or noisy data is present. When using
a genetic or evolutionary algorithm, it is standard practice to perturb solutions once before evaluating them, using noise
from a given distribution. This approach however, is not valid when using population-less techniques like local search and
other heuristics that use local search. For those algorithms to find robust solutions, each solution needs to be perturbed
and evaluated several times, and these evaluations need to be combined into a measure of robustness. In this paper, we examine
how many of these evaluations are needed to reliably find a robust solution. We also examine the effect of the parameters
of the noise distribution. Using a simple tabu search procedure, the proposed approach is tested on several functions found
in the literature.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献