全文获取类型
收费全文 | 3267篇 |
免费 | 313篇 |
国内免费 | 136篇 |
专业分类
化学 | 162篇 |
晶体学 | 1篇 |
力学 | 824篇 |
综合类 | 42篇 |
数学 | 1983篇 |
物理学 | 704篇 |
出版年
2024年 | 2篇 |
2023年 | 44篇 |
2022年 | 56篇 |
2021年 | 72篇 |
2020年 | 121篇 |
2019年 | 92篇 |
2018年 | 85篇 |
2017年 | 103篇 |
2016年 | 103篇 |
2015年 | 94篇 |
2014年 | 137篇 |
2013年 | 240篇 |
2012年 | 141篇 |
2011年 | 194篇 |
2010年 | 157篇 |
2009年 | 212篇 |
2008年 | 191篇 |
2007年 | 196篇 |
2006年 | 181篇 |
2005年 | 171篇 |
2004年 | 149篇 |
2003年 | 149篇 |
2002年 | 96篇 |
2001年 | 104篇 |
2000年 | 96篇 |
1999年 | 86篇 |
1998年 | 95篇 |
1997年 | 59篇 |
1996年 | 55篇 |
1995年 | 25篇 |
1994年 | 45篇 |
1993年 | 25篇 |
1992年 | 30篇 |
1991年 | 29篇 |
1990年 | 15篇 |
1989年 | 15篇 |
1988年 | 4篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 8篇 |
1984年 | 9篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1976年 | 2篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有3716条查询结果,搜索用时 15 毫秒
11.
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. 相似文献
12.
Viviane Van Hoof Hugo Cluckers Vera Verhaeghe An Hennebel Marleen Truyens Edith Van Loock Pierre Rombouts Dirk Maes Jan Van Elven Katrien Lesage Mark Flothmann Lieve Nijs Filip Colpaert Werner Vercammen Dominique Bolain 《Accreditation and quality assurance》2004,10(1-2):55-59
In response to a change of the Belgian National Directives whereby hospital laboratories became responsible for all point-of-care testing (POCT) performed within hospital walls a standardized and automated POC glucose-testing system was implemented in our hospital. The system consists of 50 AccuCheck Inform instruments (Roche Diagnostics, Vilvoorde, Belgium), 50 docking stations, a DataCare Server, and connections to the medical laboratory information system (MOLIS, Sysmex, Barchon, Belgium) and to the hospital information system. Implementation involved many parties and extensive preparation and communication. Key issues were bar-coded patient and user identification, training, and responsibilities. One year after the hospital wide implementation of this system the quality of POC glucose testing has significantly increased, thereby improving patient safety. This study describes a stepwise change over involving the medical laboratory and with a focus on hands-on quality.Presented at the ninth conference on Quality in the Spotlight, 18–19 March 2004, Antwerp, Belgium. 相似文献
13.
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 = ∞. 相似文献
14.
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. 相似文献
15.
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. 相似文献
16.
基于移动Agent技术的医学图像检索方法 总被引:1,自引:0,他引:1
针对现有医学图像检索方法中,检索算法速度较慢、准确性较低以及远程检索时占用大量带宽等问题,设计并实现了一种基于移动Agent技术的医学图像检索方法,重点讨论了该方法实现的关键技术,包括提升框架下的M带整数小波变换和提取多通道纹理特征的检索算法.模拟实验结果表明,该方法实时性较强,占用网络带宽较少,采用的算法运算速度提高近10倍、运算复杂度降低约50%,提取的纹理特征能充分表达图像内容,较好地满足了医学图像的检索要求,实现了对医学图像库快速较准确的检索. 相似文献
17.
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. 相似文献
18.
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. 相似文献
19.
Finite groups of prime order must be cyclic. It is natural to ask what about association schemes of prime order. In this paper,
we will give an answer to this question. An association scheme of prime order is commutative, and its valencies of nontrivial
relations and multiplicities of nontrivial irreducible characters are constant. Moreover, if we suppose that the minimal splitting
field is an abelian extension of the field of rational numbers, then the character table is the same as that of a Schurian
scheme. 相似文献
20.
1 IntroductionThispaperisdevotedtostudywhatkindofdiscreteschemesofthefollowing 2n dimen sionalHamiltoniansystemswithparameterinnormalform u=J2n H uT, H =H(u ,λ) ,(1 )whereu∈R2n,λ∈R ,H∈Ck+1(R2n×R ,R) ,k≥ 6,andJ2n =0In-In 0 ,In:unitmatrixofordernhasthepropertyofinheritinghom… 相似文献