全文获取类型
收费全文 | 1558篇 |
免费 | 190篇 |
国内免费 | 73篇 |
专业分类
化学 | 82篇 |
力学 | 265篇 |
综合类 | 17篇 |
数学 | 1143篇 |
物理学 | 314篇 |
出版年
2024年 | 2篇 |
2023年 | 23篇 |
2022年 | 23篇 |
2021年 | 42篇 |
2020年 | 42篇 |
2019年 | 50篇 |
2018年 | 36篇 |
2017年 | 51篇 |
2016年 | 50篇 |
2015年 | 45篇 |
2014年 | 92篇 |
2013年 | 120篇 |
2012年 | 58篇 |
2011年 | 114篇 |
2010年 | 113篇 |
2009年 | 100篇 |
2008年 | 108篇 |
2007年 | 93篇 |
2006年 | 97篇 |
2005年 | 75篇 |
2004年 | 54篇 |
2003年 | 73篇 |
2002年 | 60篇 |
2001年 | 46篇 |
2000年 | 40篇 |
1999年 | 35篇 |
1998年 | 48篇 |
1997年 | 32篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 12篇 |
1993年 | 7篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 6篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 2篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有1821条查询结果,搜索用时 484 毫秒
1.
设f是非常数亚纯函数,g是f的线性微分多项式.a和b是f的两个不同的小函数.本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f(k)(k≥1)IM分担a和b,b-a≠Peλz,测f≡g. 相似文献
2.
Indrajit Lahiri 《Journal of Mathematical Analysis and Applications》2002,271(1):206-216
In this paper we prove a uniqueness theorem for meromorphic functions sharing three values with some weight which improves some known results. 相似文献
3.
Laurent Gosse. 《Mathematics of Computation》2002,71(238):553-582
This paper investigates the behavior of numerical schemes for nonlinear conservation laws with source terms. We concentrate on two significant examples: relaxation approximations and genuinely nonhomogeneous scalar laws. The main tool in our analysis is the extensive use of weak limits and nonconservative products which allow us to describe accurately the operations achieved in practice when using Riemann-based numerical schemes. Some illustrative and relevant computational results are provided.
4.
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. 相似文献
5.
John A. Ekaterinaris 《国际流体数值方法杂志》2004,45(11):1187-1207
A high‐order accurate, finite‐difference method for the numerical solution of incompressible flows is presented. This method is based on the artificial compressibility formulation of the incompressible Navier–Stokes equations. Fourth‐ or sixth‐order accurate discretizations of the metric terms and the convective fluxes are obtained using compact, centred schemes. The viscous terms are also discretized using fourth‐order accurate, centred finite differences. Implicit time marching is performed for both steady‐state and time‐accurate numerical solutions. High‐order, spectral‐type, low‐pass, compact filters are used to regularize the numerical solution and remove spurious modes arising from unresolved scales, non‐linearities, and inaccuracies in the application of boundary conditions. The accuracy and efficiency of the proposed method is demonstrated for test problems. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
6.
A method for computing low Mach number flows using high‐resolution interpolation and difference formulas, within the framework of the Marker and Cell (MAC) scheme, is presented. This increases the range of wavenumbers that are properly resolved on a given grid so that a sufficiently accurate solution can be obtained without extensive grid refinement. Results using this scheme are presented for three problems. The first is the two‐dimensional Taylor–Green flow which has a closed form solution. The second is the evolution of perturbations to constant‐density, plane channel flow for which linear stability solutions are known. The third is the oscillatory instability of a variable density plane jet. In this case, unless the sharp density gradients are resolved, the calculations would breakdown. Under‐resolved calculations gave solutions containing vortices which grew in place rather than being convected out. With the present scheme, regular oscillations of this instability were obtained and vortices were convected out regularly. Stable computations were possible over a wider range of sensitive parameters such as density ratio and co‐flow velocity ratio. Copyright © 2004 John Wiley Sons, Ltd. 相似文献
7.
A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
8.
9.
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where
a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The
result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed
communication networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
10.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献