全文获取类型
收费全文 | 1036篇 |
免费 | 50篇 |
国内免费 | 98篇 |
专业分类
化学 | 87篇 |
力学 | 8篇 |
综合类 | 24篇 |
数学 | 945篇 |
物理学 | 120篇 |
出版年
2024年 | 1篇 |
2023年 | 8篇 |
2022年 | 20篇 |
2021年 | 14篇 |
2020年 | 29篇 |
2019年 | 23篇 |
2018年 | 21篇 |
2017年 | 23篇 |
2016年 | 32篇 |
2015年 | 9篇 |
2014年 | 43篇 |
2013年 | 95篇 |
2012年 | 26篇 |
2011年 | 48篇 |
2010年 | 33篇 |
2009年 | 65篇 |
2008年 | 73篇 |
2007年 | 83篇 |
2006年 | 67篇 |
2005年 | 54篇 |
2004年 | 51篇 |
2003年 | 45篇 |
2002年 | 52篇 |
2001年 | 39篇 |
2000年 | 36篇 |
1999年 | 36篇 |
1998年 | 34篇 |
1997年 | 19篇 |
1996年 | 13篇 |
1995年 | 10篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 8篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 3篇 |
1987年 | 2篇 |
1985年 | 3篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1970年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有1184条查询结果,搜索用时 0 毫秒
21.
R. G. Stoneham 《BIT Numerical Mathematics》1970,10(4):481-500
In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x
0
1
i
/p} on [0, 1] fori=0, 1,..., (p–1)p–1–1, i.e. in current terminology, generators given byx
n+1
1
x
n mod p wheren=0, 1,..., (p–1)p
–1–1,p is any odd prime, (x
0,p)=1,
1 is a primitive root modp
2, and 1 is any positive integer.We derive the expectationsE(X, ),E(X
2, ),E(X
nXn+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of
1 for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally. 相似文献
22.
Two Convergence Problems for Monotone Sequences 总被引:1,自引:0,他引:1
Eight measures of rate of convergence of monotone sequences of real numbers have been proposed and discussed in a paper by Beyer, Ebanks, and Qualls (Acta Appl. Math. 20 (1990), 267–284). These rates arose in discussions of dynamical systems. In the comparisons of these rates, two problems remained. A complete answer is given to one of the problems and a partial answer is given to the other problem. 相似文献
23.
研究了Banach空间中有限个渐近伪压缩映射近迫点序列的收敛性问题,此结果推广了以前的结论. 相似文献
24.
M.R. Leadbetter G. Lindgren H. Rootzén 《Stochastic Processes and their Applications》1978,8(2):131-139
The asymptotic distribution of the maximum Mn=max1?t?nξt in a stationary normal sequence ξ1,ξ,… depends on the correlation rt between ξ0 and ξt. It is well known that if rt log t → 0 as t → ∞ or if Σr2t<∞, then the limiting distribution is the same as for a sequence of independent normal variables. Here it is shown that this also follows from a weaker condition, which only puts a restriction on the number of t-values for which rt log t islarge. The condition gives some insight into what is essential for this asymptotic behaviour of maxima. Similar results are obtained for a stationary normal process in continuous time. 相似文献
25.
Sequence comparison is an important topic in bioinformatics. With the exponential increase of biological sequences, the traditional protein sequence comparison methods — the alignment methods become limited, so the alignment-free methods are widely proposed in the past two decades. In this paper, we considered not only the six typical physicochemical properties of amino acids, but also their frequency and positional distribution. A 51-dimensional vector was obtained to describe the protein sequence. We got a pairwise distance matrix by computing the standardized Euclidean distance, and discriminant analysis and phylogenetic analysis can be made. The results on the Influenza A virus and ND5 datasets indicate that our method is accurate and efficient for classifying proteins and inferring the phylogeny of species. 相似文献
26.
The Protein Structure Prediction (PSP) problem comprises, among other issues, forecasting the three-dimensional native structure of proteins using only their primary structure information. Most computational studies in this area use synthetic data instead of real biological data. However, the closer to the real-world, the more the impact of results and their applicability. This work presents 17 real protein sequences extracted from the Protein Data Bank for a benchmark to the PSP problem using the tri-dimensional Hydrophobic-Polar with Side-Chains model (3D-HP-SC). The native structure of these proteins was found by maximizing the number of hydrophobic contacts between the side-chains of amino acids. The problem was treated as an optimization problem and solved by means of an Integer Programming approach. Although the method optimally solves the problem, the processing time has an exponential trend. Therefore, due to computational limitations, the method is a proof-of-concept and it is not applicable to large sequences. For unknown sequences, an upper bound of the number of hydrophobic contacts (using this model) can be found, due to a linear relationship with the number of hydrophobic residues. The comparison between the predicted and the biological structures showed that the highest similarity between them was found with distance thresholds around 5.2–8.2 Å. Both the dataset and the programs developed will be freely available to foster further research in the area. 相似文献
27.
The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period. 相似文献
28.
We study a generalization of the classical Marcinkiewicz–Zygmund inequalities. We relate this problem to the sampling sequences in the Paley–Wiener space and by using this analogy we give sharp necessary and sufficient computable conditions for a family of points to satisfy the Marcinkiewicz–Zygmund inequalities. 相似文献
29.
In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x
2n
+ y
2n
, n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well
as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the
first kind are presented here. 相似文献
30.
Summary For P∈ F2[z] with P(0)=1 and deg(P)≧ 1, let A =A(P) be the unique subset of N (cf. [9]) such that Σn≧0 p(A,n)zn ≡ P(z) mod 2, where p(A,n) is the number of partitions of n with parts in A. To determine the elements of the set A, it is important to consider the sequence σ(A,n) = Σ d|n, d∈A d, namely, the periodicity of the sequences (σ(A,2kn) mod 2k+1)n≧1 for all k ≧ 0 which was proved in [3]. In this paper, the values of such sequences will be given in terms of orbits. Moreover, a formula
to σ(A,2kn) mod 2k+1 will be established, from which it will be shown that the weight σ(A1,2kzi) mod 2k+1 on the orbit <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>z_i$
is moved on some other orbit zj when A1 is replaced by A2 with A1= A(P1) and A2= A(P2) P1 and P2 being irreducible in F2[z] of the same odd order. 相似文献