全文获取类型
收费全文 | 3646篇 |
免费 | 329篇 |
国内免费 | 154篇 |
专业分类
化学 | 320篇 |
晶体学 | 2篇 |
力学 | 849篇 |
综合类 | 46篇 |
数学 | 2139篇 |
物理学 | 773篇 |
出版年
2024年 | 3篇 |
2023年 | 46篇 |
2022年 | 69篇 |
2021年 | 74篇 |
2020年 | 128篇 |
2019年 | 102篇 |
2018年 | 94篇 |
2017年 | 115篇 |
2016年 | 113篇 |
2015年 | 107篇 |
2014年 | 156篇 |
2013年 | 273篇 |
2012年 | 153篇 |
2011年 | 208篇 |
2010年 | 173篇 |
2009年 | 223篇 |
2008年 | 211篇 |
2007年 | 214篇 |
2006年 | 202篇 |
2005年 | 184篇 |
2004年 | 167篇 |
2003年 | 164篇 |
2002年 | 111篇 |
2001年 | 118篇 |
2000年 | 100篇 |
1999年 | 92篇 |
1998年 | 106篇 |
1997年 | 67篇 |
1996年 | 68篇 |
1995年 | 31篇 |
1994年 | 54篇 |
1993年 | 35篇 |
1992年 | 32篇 |
1991年 | 31篇 |
1990年 | 16篇 |
1989年 | 18篇 |
1988年 | 5篇 |
1987年 | 11篇 |
1986年 | 6篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 3篇 |
1976年 | 2篇 |
1973年 | 1篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有4129条查询结果,搜索用时 15 毫秒
1.
Josep Maria Izquierdo 《TOP》2006,14(2):375-398
The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic
allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential
players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets. 相似文献
2.
An implicit quasi-monotone second-order accurate method is proposed for analyzing the spiral Couette flow of a rarefied gas between coaxial cylinders. The basic advantages of the method over the conventional method of stationry iterations are that the former is conservative with respect to the collision integral, has a simple software implementation for any types of boundary conditions, and applies to a wide range of Knudsen numbers. 相似文献
3.
ZHANG LUMING 《应用数学学报》2005,(1)
本文首先分析线性Schrodinger方程一种高阶差分格式的构造方法,得到方程的耗散项.在此基础上对三次非线性Schrodinger方程,提出了一种精度为O(r2 h2)的差分格式,证明了该格式保持了连续方程的两个守恒量,且是收敛的与稳定的.并通过数值例子与已有隐格式进行了比较,结果表明,本文格式在计算量类似的情况下,提高了数值精度. 相似文献
4.
A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
5.
In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the Lp norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞. 相似文献
6.
We consider a splitting finite-difference scheme for an initial-boundary value problem for a two-dimensional nonlinear evolutionary
equation. The problem is split into nonlinear and linear parts. The linear part is also split into locally one-dimensional
equations. We prove the convergence and stability of the scheme in L
2 and C norms.
Printed in Lietuvos Matematikos Rinkinys, Vol. 45, No. 3, pp. 413–434, July–September, 2005. 相似文献
7.
In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly
as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields
basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative
difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis
[3] for all n≥ t ≥ 2. 相似文献
8.
Morten Nielsen 《Advances in Computational Mathematics》2007,27(2):195-209
Given a dilation matrix A :ℤd→ℤd, and G a complete set of coset representatives of 2π(A
−Tℤd/ℤd), we consider polynomial solutions M to the equation ∑
g∈G
M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric
polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices,
we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of
arbitrary order.
Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network. 相似文献
9.
On the departure process of a leaky bucket system with long-range dependent input traffic 总被引:2,自引:0,他引:2
Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range
dependence, it is important to study the possible implications that such traffic may have for the design and performance of
these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature
after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control
in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket
system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time
is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable
with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite
variance, and a regularly varying tail, i.e., P(τ >К) ~ К-Lα
L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination.
We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it
too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and
lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range
dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
10.
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed 相似文献