首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   32篇
  免费   3篇
  国内免费   4篇
化学   2篇
数学   37篇
  2022年   2篇
  2021年   1篇
  2017年   1篇
  2016年   1篇
  2014年   3篇
  2013年   2篇
  2012年   2篇
  2011年   1篇
  2010年   1篇
  2009年   1篇
  2008年   2篇
  2007年   2篇
  2006年   1篇
  2005年   1篇
  2004年   2篇
  2002年   2篇
  2000年   1篇
  1999年   3篇
  1998年   3篇
  1997年   1篇
  1995年   2篇
  1993年   1篇
  1992年   1篇
  1986年   1篇
  1985年   1篇
排序方式: 共有39条查询结果,搜索用时 15 毫秒
1.
通过研究任意基数集上的拟阵圈的性质,继而得出当此拟阵连通时,它可由含任一给定元素的圈集唯一确定的结论.  相似文献   
2.
Maxwell方程组棱元离散系统的快速算法和自适应方法是当前计算电磁场中的研究热点和难点. 首先, 针对H(curl)椭圆方程组的棱元离散系统, 通过建立棱元空间的稳定性分解, 设计了相应的快速迭代法和高效预条件子, 并且证明了迭代算法的收敛率和预条件子的条件数均不依赖于模型参数和网格规模. 其次, 针对时谐Maxwell方程组的棱有限元方法, 利用离散的Helmholtz分解, 连续散度为零函数对离散散度为零函数的逼近性和对偶论证, 获得了在L2和H(curl)范数下的拟最优误差估计. 进而设计和分析了相应的两网格法. 最后, 分别针对变系数H(curl)椭圆方程组和不定时谐Maxwell方程组, 考虑了一种不需要标记振荡项和加密单元不需要满足“内节点” 性质的自适应棱有限元法(AEFEM), 并证明了AEFEM的收敛性. 进一步, 当初始网格和Dörfler标记策略参数满足一定的假设条件时, 利用AEFEM的收敛性、误差的整体下界和局部上界估计, 证明了AEFEM的拟最优复杂性.  相似文献   
3.
We show that, for , the relation of -equivalence between infinite sequences of real numbers is Borel reducible to the relation of -equivalence (i.e., the Borel cardinality of the quotient is no larger than that of ), but not vice versa. The Borel reduction is constructed using variants of the triadic Koch snowflake curve; the nonreducibility in the other direction is proved by taking a putative Borel reduction, refining it to a reduction map that is not only continuous but `modular,' and using this nicer map to derive a contradiction.

  相似文献   

4.
Two configurations are constructed and the cardinality of one of them is estimated in terms of that of the other. The estimate thus obtained is applied to certain combinatorial problems. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 729–736, May, 1998.  相似文献   
5.
We consider the generalization of the classical P||Cmax problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.  相似文献   
6.
Let R(A) denote the row space of a Boolean matrix A of order n. We show that if n 7, then the cardinality |R(A)| (2n–1 - 2n–5, 2n–1 - 2n–6) U (2n–1 - 2n–6, 2n–1). This result confirms a conjecture in [1].AMS Subject Classification (1991): 05B20 06E05 15A36Support partially by the Postdoctoral Science Foundation of China.Dedicated to Professor Chao Ko on the occasion of his 90th birthday  相似文献   
7.
整数规划是对全部或部分决策变量为整数的最优化问题的模型、算法及应用等的研究, 是运筹学和管理科学中应用最广泛的优化模型之一. 首先简要回顾整数规划的历史和发展进程, 概述线性和非线性整数规划的一些经典方法. 然后着重讨论整数规划若干新进展, 包括0-1二次规划的半定规划~(SDP)~松弛和随机化方法, 带半连续变量和稀疏约束的优化问题的整数规划模型和方法, 以及0-1二次规划的协正锥规划表示和协正锥的层级半定规划~(SDP)~逼近. 最后, 对整数规划未来研究方向进行展望并对一些公开问题进行讨论.  相似文献   
8.
We prove a Faà di Bruno formula for the Green function in the bialgebra of P-trees, for any polynomial endofunctor P. The formula appears as relative homotopy cardinality of an equivalence of groupoids.  相似文献   
9.
A new notion of partition‐determined functions is introduced, and several basic inequalities are developed for the entropies of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these functions. Here a compound set means a set obtained by varying each argument of a function of several variables over a set associated with that argument, where all the sets are subsets of an appropriate algebraic structure so that the function is well defined. On the one hand, the entropy inequalities developed for partition‐determined functions imply entropic analogues of general inequalities of Plünnecke‐Ruzsa type. On the other hand, the cardinality inequalities developed for compound sets imply several inequalities for sumsets, including for instance a generalization of inequalities proved by Gyarmati, Matolcsi and Ruzsa (2010). We also provide partial progress towards a conjecture of Ruzsa (2007) for sumsets in nonabelian groups. All proofs are elementary and rely on properly developing certain information‐theoretic inequalities. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 399–424, 2012  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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