全文获取类型
收费全文 | 1988篇 |
免费 | 101篇 |
国内免费 | 17篇 |
专业分类
化学 | 1338篇 |
晶体学 | 15篇 |
力学 | 57篇 |
数学 | 398篇 |
物理学 | 298篇 |
出版年
2023年 | 16篇 |
2022年 | 52篇 |
2021年 | 68篇 |
2020年 | 49篇 |
2019年 | 50篇 |
2018年 | 55篇 |
2017年 | 44篇 |
2016年 | 97篇 |
2015年 | 77篇 |
2014年 | 81篇 |
2013年 | 143篇 |
2012年 | 139篇 |
2011年 | 145篇 |
2010年 | 60篇 |
2009年 | 74篇 |
2008年 | 101篇 |
2007年 | 107篇 |
2006年 | 96篇 |
2005年 | 77篇 |
2004年 | 73篇 |
2003年 | 72篇 |
2002年 | 47篇 |
2001年 | 38篇 |
2000年 | 24篇 |
1999年 | 21篇 |
1998年 | 13篇 |
1997年 | 7篇 |
1996年 | 17篇 |
1995年 | 12篇 |
1994年 | 16篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 15篇 |
1990年 | 18篇 |
1989年 | 18篇 |
1988年 | 13篇 |
1987年 | 9篇 |
1985年 | 10篇 |
1984年 | 15篇 |
1983年 | 8篇 |
1982年 | 16篇 |
1981年 | 9篇 |
1980年 | 11篇 |
1979年 | 6篇 |
1978年 | 5篇 |
1977年 | 9篇 |
1975年 | 4篇 |
1974年 | 4篇 |
1973年 | 4篇 |
1947年 | 7篇 |
排序方式: 共有2106条查询结果,搜索用时 15 毫秒
1.
2.
Balázs Szendröi 《Mathematische Zeitschrift》2002,240(2):233-241
This note shows that a certain toric quotient of the quintic Calabi-Yau threefold in provides a counterexample to a recent conjecture of Cox and Katz concerning nef cones of toric hypersurfaces.
Received: 8 February 2001; in final form: 17 September 2001 / Published online: 1 February 2002 相似文献
3.
The exponential functional of simple, symmetric random walks with negative
drift is an infinite polynomial Y = 1 + ξ1 + ξ1ξ2 + ξ1ξ2ξ3 + ⋯ of independent
and identically distributed non-negative random variables. It has moments that are
rational functions of the variables μ
k
= E(ξ
k
) < 1 with universal coefficients. It
turns out that such a coefficient is equal to the number of permutations with descent
set defined by the multiindex of the coefficient. A recursion enumerates all numbers
of permutations with given descent sets in the form of a Pascal-type triangle.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
4.
We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour
hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check
the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization
problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and
the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located
by the new technique. 相似文献
5.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
6.
A new type of optoelectronic cellular neural network has been developed by providing the capability of coefficients adjusment of cellular neural network (CNN) using Widrow based perceptron learning algorithm. The new supervised cellular neural network is called Widrow-CNN. Despite the unsupervised CNN, the proposed learning algorithm allows to use the Widrow-CNN for various image processing applications easily. Also, the capability of CNN for image processing and feature extraction has been improved using basic joint transform correlation architecture. This hardware application presents high speed processing capability compared to digital applications. The optoelectronic Widrow-CNN has been tested for classic CNN feature extraction problems. It yields the best results even in case of hard feature extraction problems such as diagonal line detection and vertical line determination. 相似文献
7.
In bricklayers' model, which is a generalization of the misanthrope processes, we show that a nontrivial class of product distributions is closed under the time-evolution of the process. This class also includes measures fitting to shock data of the limiting PDE. In particular, we show that shocks of this type with discontinuity of size one perform ordinary nearest neighbor random walks only interacting, in an attractive way, via their jump rates. Our results are related to those of Belitsky and Schütz(4) on the simple exclusion process, although we do not use quantum formalism as they do. The structures we find are described from a fixed position. Similar ones were found in Balázs,(2) valak as seen from the random position of the second class particle. 相似文献
8.
We consider noncommutative line bundles associated with the Hopf fibrations of SUq(2) over all Podle? spheres and with a locally trivial Hopf fibration of S3pq. These bundles are given as finitely generated projective modules associated via 1-dimensional representations of U(1) with Galois-type extensions encoding the principal fibrations of SUq(2) and S3pq. We show that the Chern numbers of these modules coincide with the winding numbers of representations defining them. To cite this article: P.M. Hajac et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003). 相似文献
9.
Research supported by the NSF Grant DMS-8602672 相似文献
10.
Wojciech Pieczynski 《Comptes Rendus Mathematique》2002,335(3):275-278
The Hidden Markov Chains (HMC) are widely applied in various problems. This succes is mainly due to the fact that the hidden process can be recovered even in the case of very large set of data. These models have been recetly generalized to ‘Pairwise Markov Chains’ (PMC) model, which admit the same processing power and a better modeling one. The aim of this note is to propose further generalization called Triplet Markov Chains (TMC), in which the distribution of the couple (hidden process, observed process) is the marginal distribution of a Markov chain. Similarly to HMC, we show that posterior marginals are still calculable in Triplets Markov Chains. We provide a necessary and sufficient condition that a TMC is a PMC, which shows that the new model is strictly more general. Furthermore, a link with the Dempster–Shafer fusion is specified. To cite this article: W. Pieczynski, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 275–278. 相似文献