首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   623篇
  免费   17篇
  国内免费   75篇
化学   3篇
力学   8篇
综合类   8篇
数学   667篇
物理学   29篇
  2024年   1篇
  2023年   7篇
  2022年   8篇
  2021年   8篇
  2020年   15篇
  2019年   23篇
  2018年   27篇
  2017年   26篇
  2016年   22篇
  2015年   7篇
  2014年   19篇
  2013年   86篇
  2012年   18篇
  2011年   34篇
  2010年   27篇
  2009年   34篇
  2008年   41篇
  2007年   45篇
  2006年   35篇
  2005年   31篇
  2004年   32篇
  2003年   25篇
  2002年   25篇
  2001年   14篇
  2000年   23篇
  1999年   26篇
  1998年   16篇
  1997年   15篇
  1996年   9篇
  1995年   7篇
  1994年   3篇
  1993年   2篇
  1989年   1篇
  1988年   1篇
  1986年   1篇
  1936年   1篇
排序方式: 共有715条查询结果,搜索用时 15 毫秒
101.
    
《组合设计杂志》2018,26(9):417-438
We define and study variable strength covering arrays (also called covering arrays on hypergraphs), which are generalizations of covering arrays and covering arrays on graphs. Variable strength covering arrays have the potential for use in software testing, allowing the engineer to omit the parameter combinations known to not interact in order to reduce the number of tests required. The present paper shows that variable strength covering arrays are relevant combinatorial objects that have deep connections with hypergraph homomorphisms and generalize other important combinatorial designs. We give optimal constructions for special types of hypergraphs, constructions based on columns with uniform occurrence of symbols, and constructions for mixed alphabets.  相似文献   
102.
    
Pallav Goyal 《代数通讯》2018,46(10):4511-4529
  相似文献   
103.
    
  相似文献   
104.
    
For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .  相似文献   
105.
In this paper, we introduce a Frobenius Painlevé IV equation and the corresponding Hamilton system, and we give the symmetric form of the Frobenius Painlevé IV equation. Then, we construct the Lax pair of the Frobenius Painlevé IV equation. Furthermore, we recall the Frobenius modified KP hierarchy and the Frobenius KP hierarchy by bilinear equations, then we show how to get Frobenius Painlevé IV equation from the Frobenius modified KP hierarchy. In order to study the different aspects of the Frobenius Painlevé IV equation, we give the similarity reduction and affine Weyl group symmetry of the equation. Similarly, we introduce a Frobenius Painlevé II equation and show the connection between the Frobenius modified KP hierarchy and the Frobenius Painlevé II equation.  相似文献   
106.
针对车载武器系统快速发射需求,提出一种基于GNSS辅助的捷联惯导行进间对准自适应滤波方法。该方法把行进间传递对准分为粗对准与精对准两个阶段。粗对准阶段以GNSS为观测基准完成对捷联惯导姿态的粗捕获,降低初始偏差不确定性对于精对准阶段的影响。在精对准阶段,考虑到车载系统的运动特性,提出一种"水平+方位"行进间对准双滤波器并行的设计思路,利用车载系统在不同时间段的动力学特性,对三轴姿态估计进行分时解耦,实现初始姿态的高精度估计;与此同时,引入协方差成形自适应调节过程,以最小化Frobenius范数为优化指标,实现对行进间对准卡尔曼滤波器的自适应调节,增强系统鲁棒性。数值仿真表明,协方差成形自适应卡尔曼滤波方法能够有效保证系统在全运动剖面内的稳定,结合双滤波器并行方案能够有效解决行进间对准精度不高与稳定性欠佳等问题,水平对准精度优于1.5′(1σ),方位对准精度优于6′(1σ)。  相似文献   
107.
In this paper, we bound the Fitting height of a solvable group by the number of zeros in a character table.

  相似文献   

108.
Let c?k(n) be the number of k-colored generalized Frobenius partitions of n. We establish some infinite families of congruences for c?3(n) and c?9(n) modulo arbitrary powers of 3, which refine the results of Kolitsch. For example, for k3 and n0, we prove that
c?3(32kn+7?32k+18)0(mod34k+5).
We give two different proofs to the congruences satisfied by c?9(n). One of the proofs uses a relation between c?9(n) and c?3(n) due to Kolitsch, for which we provide a new proof in this paper.  相似文献   
109.
110.
We study asymptotics of an irreducible representation of the symmetric group Sn corresponding to a balanced Young diagram λ (a Young diagram with at most rows and columns for some fixed constant C) in the limit as n tends to infinity. We show that there exists a constant D (which depends only on C) with a property that
  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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