首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   37篇
  免费   0篇
  国内免费   2篇
化学   2篇
力学   2篇
数学   32篇
物理学   3篇
  2015年   1篇
  2013年   1篇
  2011年   1篇
  2009年   1篇
  2008年   1篇
  2005年   2篇
  2003年   1篇
  2000年   2篇
  1999年   1篇
  1998年   1篇
  1997年   1篇
  1996年   2篇
  1995年   1篇
  1993年   3篇
  1991年   1篇
  1989年   1篇
  1988年   1篇
  1987年   2篇
  1986年   2篇
  1985年   1篇
  1984年   1篇
  1982年   1篇
  1981年   3篇
  1980年   2篇
  1979年   1篇
  1978年   2篇
  1977年   2篇
排序方式: 共有39条查询结果,搜索用时 62 毫秒
1.
In this paper we prove that there exists an elliptic semiplaneS(v, k, m) withkm 2 if and only if there exists a group divisible design GDD k ((km)(k – 1);km; 0, 1) withm pairwise orthogonal resolutions. As an example of this theorem, we construct an elliptic semiplaneW(45, 7, 3) and show thatW is isomorphic to the elliptic semiplaneS(45, 7, 3) given by R. D. Baker.  相似文献   
2.
We consider the problem of embedding the even graphical code based on the complete graph onn vertices into a shortening of a Hamming code of length 2m-1, wherem = h(n) should be as small as possible. As it turns out, this problem is equivalent to the existence problem for optimal codes with minimum distance 5, and optimal embeddings can always be realized as graphical codes based onK n. As a consequence, we are able to determineh(n) exactly for alln of the form 2 k + 1 and to narrow down the possibilities in general to two or three conceivable values.Dedicated to Hanfried Lenz on the occasion of his 80th birthdayThe research for this note was done while the first author was visiting the University of Waterloo and the University of Rome, respectively. He thanks his colleagues there for their hospitality and also acknowledges the financial support of the Consiglio Nazionale delle Ricerche (Italy). The third author acknowledges the support of the National Science and Engineering Research Council of Canada given under grant #0GP0009258.  相似文献   
3.
In this paper we obtain determinantal conditions necessary for the existence of (r,λ)-designs. The work is based on a paper of Connor [2]. In [3] Deza establishes an inequality which must be satisfied by the column vectors of an equidistant code; or, equivalently, the block sizes in an (r,λ)-design. We obtain a generalization of this inequality.  相似文献   
4.
The best algorithm known for finding logarithms on an elliptic curve is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a set of equivalence classes derived from , which requires fewer iterations than the standard approach. In the case of anomalous binary curves over , the new approach speeds up the standard algorithm by a factor of .

  相似文献   

5.
To each finite-dimensional vector space E can canonically associate the space ΛE*ΛE. This space has a natural inner product (bilinear, symmetric and non-degenerate) and two (algebraic) product structures. Identities relating these products should be important for understanding the structure of these algebras. Indeed such identities have been used, both to develop Mixed Exterior Algebra and to apply it. In the present paper, we obtain a new identity of this type and show that the identities mentioned above are consequences of it. In this sense, it may be regarded as basic to the subject.  相似文献   
6.
An equidistant permutation array (EPA) which we denote by A(r, λ; ν) is a ν × r array such that every row is a permutation of the integers 1, 2,…, r and such that every pair of distinct rows has precisely λ columns in common. R(r, λ) is the maximum ν such that there exists an A(r, λ; ν). In this paper we show that R(n2 + n + 2, 1) ? 2n2 + n where n is a prime power.  相似文献   
7.
We study a class of stationary transport equation with nonlocal low-order tems We obtain the existence and uniqueness of a solution in sobolev spaces  相似文献   
8.
9.
非线性涡黏性系数模型和代数应力模型联系了线性涡黏性系数湍流模型和完整的微分 雷诺应力模型.随着它们受到日益关注,其形式也越来越多样化.本篇综述的目的是对这些模 型加以总结并比较它们之间的共同点及不同之处,指出它们与完整微分雷诺应力模型之间的 关系,以及相对于线性涡黏性系数模型而言它们在预报流场上所具有的优势.  相似文献   
10.
An odd balanced tournament design,OBTD(n), is ann × 2n + 1 array of pairs defined on a (2n + 1)-setV such that (1) every row of the array contains each element ofV twice, (2) every column of the array contains 2n distinct elements ofV, and (3) the pairs of the array form a (2n + 1, 2, 1)-BIBD. In this paper, we investigate the spectrum of odd balanced tournament designs with orthogonal resolutions. These designs can be used to construct doubly near resolvable (v, 3, 2)-BIBDs.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号