全文获取类型
收费全文 | 1624篇 |
免费 | 63篇 |
国内免费 | 130篇 |
专业分类
化学 | 82篇 |
力学 | 16篇 |
综合类 | 19篇 |
数学 | 1581篇 |
物理学 | 119篇 |
出版年
2023年 | 22篇 |
2022年 | 30篇 |
2021年 | 41篇 |
2020年 | 33篇 |
2019年 | 53篇 |
2018年 | 50篇 |
2017年 | 53篇 |
2016年 | 48篇 |
2015年 | 34篇 |
2014年 | 69篇 |
2013年 | 236篇 |
2012年 | 40篇 |
2011年 | 87篇 |
2010年 | 83篇 |
2009年 | 108篇 |
2008年 | 106篇 |
2007年 | 83篇 |
2006年 | 81篇 |
2005年 | 58篇 |
2004年 | 63篇 |
2003年 | 60篇 |
2002年 | 47篇 |
2001年 | 37篇 |
2000年 | 48篇 |
1999年 | 40篇 |
1998年 | 46篇 |
1997年 | 36篇 |
1996年 | 22篇 |
1995年 | 9篇 |
1994年 | 16篇 |
1993年 | 11篇 |
1992年 | 9篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 6篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 7篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1974年 | 1篇 |
1973年 | 2篇 |
1969年 | 1篇 |
排序方式: 共有1817条查询结果,搜索用时 234 毫秒
141.
N. Mazars 《商业与工业应用随机模型》1989,5(3):179-201
Binary coherent system theory has played an important part in reliability. Its extension to (‘degradable’ or ‘multistate’ or) multinary systems has recently been considered in various papers, through various definitions. This paper lays the foundations of a unified theory for coherent systems by first giving unified arguments to apply and to investigate further binary and multinary systems. Monotone binary systems are introduced and examined by generalizing classic deterministic and probabilistic results. Applications of monotone coherence to the multinary case are proposed in a companion paper with a unified viewpoint on multinary coherent systems. As an indication, monotone constraints are defined with a partition of the component set and some total orderings imposed on the elements of the concerned partition. The discrete partition retrieves the classic theory of (free) binary coherent systems; some constraints defined from component levels lead to multinary coherent systems; some other constraints apply to systems submitted to some ‘common stresses’, e.g. the organizing system of a monotone coherent decomposition. 相似文献
142.
《Discrete Mathematics》2023,346(5):113309
In this work, we study Schmidt's partition theorem in a combinatorial manner, and find a strong refinement which connects the minimal excludant of ordinary partitions to the length of Schmidt's partitions. As a byproduct, we obtain a bivariate form of an identity recorded in Ramanujan's lost notebook. 相似文献
143.
信赖域法是一种保证全局收敛性的优化算法,为避免Hessian矩阵的计算,基于拟牛顿校正公式构造了求解带线性等式约束的非线性规划问题的截断拟牛顿型信赖域法.首先给出了截断拟牛顿型信赖域法的构造过程及具体步骤;然后针对随机用户均衡模型中变量和约束的特点对算法进行了修正,并将多种拟牛顿校正公式下所得结果与牛顿型信赖域法的结果进行了比较,结果发现基于对称秩1校正公式的信赖域法更为合适.最后基于数值算例结果得到了一些在算法编程过程中的重要结论,对其它形式信赖域法的编程实现具有一定的参考意义. 相似文献
144.
设X_n={1,2,…,n}并赋予自然数序,MCK_n是X_n上核具有连续横截面保序或反序变换所构成的半群.K_n是MCK_n的最大正则子半群.本文将考虑K_n的理想K(n,r)={α∈K_n:|im(α)|≤r}(3≤r≤n-1).证明了K(n,r)的秩为(n-r+1)(n-r+2)(n-r+3)/6. 相似文献
145.
Roee David Elazar Goldenberg Robert Krauthgamer 《Random Structures and Algorithms》2017,51(4):607-630
We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field and the goal is to reconstruct a (near‐optimal) matrix that is low‐rank and close to M under some distance function Δ. Furthermore, the reconstruction must be local, i.e., provides access to any desired entry of by reading only a few entries of the input M (ideally, independent of the matrix dimensions n and m). Our formulation of this problem is inspired by the local reconstruction framework of Saks and Seshadhri (SICOMP, 2010). Our main result is a local reconstruction algorithm for the case where Δ is the normalized Hamming distance (between matrices). Given M that is ‐close to a matrix of rank (together with d and ), this algorithm computes with high probability a rank‐d matrix that is ‐close to M. This is a local algorithm that proceeds in two phases. The preprocessing phase reads only random entries of M, and stores a small data structure. The query phase deterministically outputs a desired entry by reading only the data structure and 2d additional entries of M. We also consider local reconstruction in an easier setting, where the algorithm can read an entire matrix column in a single operation. When Δ is the normalized Hamming distance between vectors, we derive an algorithm that runs in polynomial time by applying our main result for matrix reconstruction. For comparison, when Δ is the truncated Euclidean distance and , we analyze sampling algorithms by using statistical learning tools. A preliminary version of this paper appears appears in ECCC, see: http://eccc.hpi-web.de/report/2015/128/ © 2017 Wiley Periodicals, Inc. Random Struct. Alg., 51, 607–630, 2017 相似文献
146.
In many atmospheric and earth sciences, it is of interest to identify dominant spatial patterns of variation based on data observed at p locations and n time points with the possibility that p > n. While principal component analysis (PCA) is commonly applied to find the dominant patterns, the eigenimages produced from PCA may exhibit patterns that are too noisy to be physically meaningful when p is large relative to n. To obtain more precise estimates of eigenimages, we propose a regularization approach incorporating smoothness and sparseness of eigenimages, while accounting for their orthogonality. Our method allows data taken at irregularly spaced or sparse locations. In addition, the resulting optimization problem can be solved using the alternating direction method of multipliers, which is easy to implement, and applicable to a large spatial dataset. Furthermore, the estimated eigenfunctions provide a natural basis for representing the underlying spatial process in a spatial random-effects model, from which spatial covariance function estimation and spatial prediction can be efficiently performed using a regularized fixed-rank kriging method. Finally, the effectiveness of the proposed method is demonstrated by several numerical examples. 相似文献
147.
Richard Kueng Holger Rauhut Ulrich Terstiege 《Applied and Computational Harmonic Analysis》2017,42(1):88-116
We study the recovery of Hermitian low rank matrices from undersampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form for some measurement vectors , i.e., the measurements are given by . The case where the matrix to be recovered is of rank one reduces to the problem of phaseless estimation (from measurements ) via the PhaseLift approach, which has been introduced recently. We derive bounds for the number m of measurements that guarantee successful uniform recovery of Hermitian rank r matrices, either for the vectors , , being chosen independently at random according to a standard Gaussian distribution, or being sampled independently from an (approximate) complex projective t-design with . In the Gaussian case, we require measurements, while in the case of 4-designs we need . Our results are uniform in the sense that one random choice of the measurement vectors guarantees recovery of all rank r-matrices simultaneously with high probability. Moreover, we prove robustness of recovery under perturbation of the measurements by noise. The result for approximate 4-designs generalizes and improves a recent bound on phase retrieval due to Gross, Krahmer and Kueng. In addition, it has applications in quantum state tomography. Our proofs employ the so-called bowling scheme which is based on recent ideas by Mendelson and Koltchinskii. 相似文献
148.
An Euler tour of a hypergraph (also called a rank‐2 universal cycle or 1‐overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, using a graph‐theoretic approach, we prove that every triple system with at least two triples is eulerian, that is, it admits an Euler tour. Horan and Hurlbert have previously shown that for every admissible order >3, there exists a Steiner triple system with an Euler tour, while Dewar and Stevens have proved that every cyclic Steiner triple system of order >3 and every cyclic twofold triple system admits an Euler tour. 相似文献
149.
《Mathematische Nachrichten》2017,290(5-6):885-889
We first prove that a compact embedded minimal annulus in meeting two concentric spheres perpendicularly along the boundaries is part of a plane. We also prove that an embedded minimal hypersurface lying outside of a ball is part of either a catenoid or a hyperplane if it is perpendicular to the sphere along the boundary and has only one end that is asymptotic to either a catenoid if , or a hyperplane if . 相似文献
150.
《Mathematische Nachrichten》2017,290(17-18):3029-3037
In this note, we show that any projective subspace arrangement can be realized as a generalized star configuration variety. This type of interpolation result may be useful in designing linear codes with prescribed codewords of minimum weight, as well as in answering a couple of questions about the number of equations needed to define a generalized star configuration variety. 相似文献