全文获取类型
收费全文 | 586篇 |
免费 | 41篇 |
国内免费 | 64篇 |
学科分类
数理化 | 691篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 8篇 |
2021年 | 15篇 |
2020年 | 21篇 |
2019年 | 16篇 |
2018年 | 33篇 |
2017年 | 19篇 |
2016年 | 22篇 |
2015年 | 10篇 |
2014年 | 32篇 |
2013年 | 51篇 |
2012年 | 18篇 |
2011年 | 37篇 |
2010年 | 30篇 |
2009年 | 47篇 |
2008年 | 48篇 |
2007年 | 37篇 |
2006年 | 35篇 |
2005年 | 24篇 |
2004年 | 21篇 |
2003年 | 20篇 |
2002年 | 13篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 12篇 |
1998年 | 15篇 |
1997年 | 18篇 |
1996年 | 10篇 |
1995年 | 3篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 3篇 |
1984年 | 3篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有691条查询结果,搜索用时 15 毫秒
1.
Simon R. Blackburn 《Journal of Combinatorial Theory, Series A》2006,113(7):1572-1581
The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. There is no set of 2n−2+1 permutations having this property. 相似文献
2.
David M. Evans 《组合设计杂志》2004,12(6):459-465
For all ‘reasonable’ finite t, k, and s, we construct a t‐(?0, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2‐(?0, 4, 1) design with a block‐transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a by‐product of a new way of looking at a model‐theoretic construction of E. Hrushovski. © 2004 Wiley Periodicals, Inc. 相似文献
3.
4.
5.
Schôichi Ôta Franciszek Hugon Szafraniec 《Journal of Mathematical Analysis and Applications》2007,329(2):987-997
We are in progress of extending the family of ‘q-deformed operators’ considered in the previous papers by joining to them q-subnormal as well as q-formally subnormal ones. It turns out that q-positive definiteness, a notion generalizing Halmos' standard positive definiteness of bounded subnormal operators, is likewise central for our new scheme. 相似文献
6.
Victor Alexandrov 《Geometriae Dedicata》2004,107(1):169-186
Classical H. Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H. Minkowski uniqueness theorem due to A.D. Alexandrov are extended to a class of nonconvex polyhedra which are called polyhedral herissons and may be described as polyhedra with injective spherical image. 相似文献
7.
Ioannis K. Argyros 《Journal of Mathematical Analysis and Applications》2004,298(2):374-397
We provide a local as well as a semilocal convergence analysis for two-point Newton-like methods in a Banach space setting under very general Lipschitz type conditions. Our equation contains a Fréchet differentiable operator F and another operator G whose differentiability is not assumed. Using more precise majorizing sequences than before we provide sufficient convergence conditions for Newton-like methods to a locally unique solution of equation F(x)+G(x)=0. In the semilocal case we show under weaker conditions that our error estimates on the distances involved are finer and the information on the location of the solution at least as precise as in earlier results. In the local case a larger radius of convergence is obtained. Several numerical examples are provided to show that our results compare favorably with earlier ones. As a special case we show that the famous Newton-Kantorovich hypothesis is weakened under the same hypotheses as the ones contained in the Newton-Kantorovich theorem. 相似文献
8.
A q × n array with entries from 0, 1,…,q − 1 is said to form a difference matrix if the vector difference (modulo q) of each pair of columns consists of a permutation of [0, 1,… q − 1]; this definition is inverted from the more standard one to be found, e.g., in Colbourn and de Launey (1996). The following idea generalizes this notion: Given an appropriate δ (-[−1, 1]t, a λq × n array will be said to form a (t, q, λ, Δ) sign-balanced matrix if for each choice C1, C2,…, Ct of t columns and for each choice = (1,…,t) Δ of signs, the linear combination ∑j=1t jCj contains (mod q) each entry of [0, 1,…, q − 1] exactly λ times. We consider the following extremal problem in this paper: How large does the number k = k(n, t, q, λ, δ) of rows have to be so that for each choice of t columns and for each choice (1, …, t) of signs in δ, the linear combination ∑j=1t jCj contains each entry of [0, 1,…, q t- 1] at least λ times? We use probabilistic methods, in particular the Lovász local lemma and the Stein-Chen method of Poisson approximation to obtain general (logarithmic) upper bounds on the numbers k(n, t, q, λ, δ), and to provide Poisson approximations for the probability distribution of the number W of deficient sets of t columns, given a random array. It is proved, in addition, that arithmetic modulo q yields the smallest array - in a sense to be described. 相似文献
9.
Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time. 相似文献
10.
J. B. Lasserre 《Journal of Optimization Theory and Applications》1991,70(3):583-595
We consider two-dimensional discrete-time linear systems with constrained controls. We propose a simple polynomial time procedure to give an exact external representation of theN-step reachable set and controllable set. The bounding hyperplanes are explicitly derived in terms of the data of the problem. By using a result in computational geometry, all the calculations are made in polynomial time in contrast to classical methods. The limit case asN is also investigated. 相似文献