全文获取类型
收费全文 | 4794篇 |
免费 | 811篇 |
国内免费 | 190篇 |
专业分类
化学 | 283篇 |
晶体学 | 2篇 |
力学 | 1219篇 |
综合类 | 85篇 |
数学 | 2587篇 |
物理学 | 1619篇 |
出版年
2024年 | 4篇 |
2023年 | 57篇 |
2022年 | 84篇 |
2021年 | 136篇 |
2020年 | 184篇 |
2019年 | 135篇 |
2018年 | 128篇 |
2017年 | 197篇 |
2016年 | 204篇 |
2015年 | 165篇 |
2014年 | 224篇 |
2013年 | 351篇 |
2012年 | 276篇 |
2011年 | 298篇 |
2010年 | 243篇 |
2009年 | 300篇 |
2008年 | 303篇 |
2007年 | 280篇 |
2006年 | 256篇 |
2005年 | 256篇 |
2004年 | 224篇 |
2003年 | 210篇 |
2002年 | 161篇 |
2001年 | 172篇 |
2000年 | 148篇 |
1999年 | 130篇 |
1998年 | 136篇 |
1997年 | 105篇 |
1996年 | 86篇 |
1995年 | 48篇 |
1994年 | 61篇 |
1993年 | 39篇 |
1992年 | 40篇 |
1991年 | 35篇 |
1990年 | 21篇 |
1989年 | 19篇 |
1988年 | 9篇 |
1987年 | 17篇 |
1986年 | 8篇 |
1985年 | 11篇 |
1984年 | 12篇 |
1983年 | 4篇 |
1982年 | 2篇 |
1980年 | 2篇 |
1979年 | 3篇 |
1978年 | 2篇 |
1976年 | 3篇 |
1959年 | 1篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有5795条查询结果,搜索用时 15 毫秒
31.
This paper is about algorithms that schedule tasks to be performed in a distributed failure‐prone environment, when processors communicate by message‐passing, and when tasks are independent and of unit length. The processors work under synchrony and may fail by crashing. Failure patterns are imposed by adversaries. Linearly‐bounded adversaries may fail up to a constant fraction of the processors. Weakly‐adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure‐prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point‐to‐point messages. A randomized algorithm is developed, that attains both ??(n log*n) expected work and ??(n log*n) expected communication, against weakly‐adaptive linearly‐bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly‐adaptive linearly‐bounded adversaries, which has to be Ω(n log n/log log n) in terms of work. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
32.
将心磁信号从干扰噪声中加以提取并有效地消除噪声干扰是心磁信号处理中尤为重要的环节 .从改进算法的角度出发,提出互补型自适应滤波器结构以实现心磁信号的消噪处理.该滤波器针对心磁这类非平稳信号进行设计,有效地解决了常规自适应滤波器应用于心磁信号处理时收敛速度和稳态误差的矛盾.通过仿真实验和心磁实验结果表明,该算法能有效地消除心磁信号的背景噪声和工频干扰噪声.同时该算法也可用于其他非平稳信号的消噪处理.
关键词:
自适应滤波
心磁图
最小均方误差 相似文献
33.
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. 相似文献
34.
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. 相似文献
35.
36.
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. 相似文献
37.
It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing. 相似文献
38.
提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。 相似文献
39.
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… 相似文献
40.
In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.