首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   227篇
  免费   4篇
  国内免费   18篇
化学   9篇
力学   2篇
综合类   1篇
数学   224篇
物理学   13篇
  2023年   6篇
  2022年   11篇
  2021年   3篇
  2020年   9篇
  2019年   3篇
  2018年   4篇
  2017年   5篇
  2016年   5篇
  2015年   4篇
  2014年   9篇
  2013年   60篇
  2012年   6篇
  2011年   7篇
  2010年   4篇
  2009年   16篇
  2008年   13篇
  2007年   12篇
  2006年   3篇
  2005年   5篇
  2004年   5篇
  2003年   6篇
  2002年   5篇
  2001年   3篇
  2000年   4篇
  1999年   12篇
  1998年   3篇
  1997年   1篇
  1996年   2篇
  1995年   6篇
  1994年   7篇
  1993年   3篇
  1991年   3篇
  1990年   1篇
  1989年   1篇
  1988年   1篇
  1977年   1篇
排序方式: 共有249条查询结果,搜索用时 62 毫秒
161.
本文给出了广义对角占优矩阵的新判定条件,改进了近期的相关结果,并用数值例子说明了所得结果判定范围的更加广泛性.  相似文献   
162.
We present a method for computing pth roots using a polynomial basis over finite fields of odd characteristic p, p ≥ 5, by taking advantage of a binomial reduction polynomial. For a finite field extension of our method requires p − 1 scalar multiplications of elements in by elements in . In addition, our method requires at most additions in the extension field. In certain cases, these additions are not required. If z is a root of the irreducible reduction polynomial, then the number of terms in the polynomial basis expansion of z 1/p , defined as the Hamming weight of z 1/p or , is directly related to the computational cost of the pth root computation. Using trinomials in characteristic 3, Ahmadi et al. (Discrete Appl Math 155:260–270, 2007) give is greater than 1 in nearly all cases. Using a binomial reduction polynomial over odd characteristic p, p ≥ 5, we find always.   相似文献   
163.
在一类无限维非交换Hopf代数上,借助其Hopf理想,构造出商Hopf代数,讨论了此商代数上的有限维不可约模,得出此非平凡不可约模的维数一定是2.  相似文献   
164.
《代数通讯》2013,41(9):3367-3373
ABSTRACT

Let D be a finite dimensional F -central division algebra and G an irreducible subgroup of D*: = GL 1(D). Here we investigate the structure of D under various group identities on G. In particular, it is shown that when [D:F] = p 2, p a prime, then D is cyclic if and only if D* contains a nonabelian subgroup satisfying a group identity.  相似文献   
165.
166.
167.
Previous results of the authors completely determine when the n-fold self-products of two 3-dimensional lens spaces are diffeomorphic; in particular, if n is odd then the fundamental group determines the diffeomorphism type. We prove that for all other irreducible geometric 3-manifolds with trivial first Betti number, the n-fold products of such manifolds with themselves are homeomorphic for some n?2 if and only if the manifolds themselves are homeomorphic and obtain partial results for other cases. The proofs use an assortment of techniques from 3-dimensional topology and group theory.  相似文献   
168.
How to effectively deal with non-linearity and accurately fulfill the consistency condition is essential for modeling and computing in plasticity. Utilizing the concepts of two phases and homogeneous coordinates, we obtain a linear representation of a constitutive model of perfect elastoplasticity with large deformation, and, furthermore, a linear irreducible representation, which contains a five-order spin tensor. The underlying vector space is found to be the projective realization of a composite space resulting from a surgery on Minkowski spacetime 5+1. The irreducible representation in the vector space admits of the projective proper orthochronous Lorentz group PSOo(5, 1) in the on (or elastoplastic) phase and the special Euclidean group SE(5) in the off (or elastic) phase. The input path dictates symmetry switching between the two groups. Based on such symmetry a numerical scheme is devised which preserves the consistency condition for every time step. The consistency scheme is shown to be stabler, more accurate, and more efficient than the current numerical schemes developed directly based upon the model itself, because the new scheme preserves the internal symmetry SOo(5, 1) of the model in the on phase so as to locate the stress point automatically on the yield surface at each time step without iterations at all.  相似文献   
169.
We apply two methods to the block diagonalization of the adjacency matrix of the Cayley graph defined on the affine group. The affine group will be defined over the finite ring Z/pnZ. The method of irreducible representations will allow us to find nontrivial eigenvalue bounds for two different graphs. One of these bounds will result in a family of Ramanujan graphs. The method of covering graphs will be used to block diagonalize the affine graphs using a Galois group of graph automorphisms. In addition, we will demonstrate the method of covering graphs on a generalized version of the graphs of Lubotzky et al. [A. Lubotzky, R. Phillips, P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988) 261-277].  相似文献   
170.
For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property, i.e., working with irreducible games over restricted strategy spaces. The proposed procedure gives the value of the communicating game with an arbitrarily small error when the value is independent of the initial state.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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