一些组合地图新算法的实现

本文主要讨论组合地图列举问题.刘的一部专著中提出了一个判定两个地图是否同构的算法.该算法的时间复杂度为O(m2),其中m为下图的规模.在此基础上,本文给出一个用于地图列举以及进而计算任意连通下图的地图亏格分布的通用算法.本文所得结果比之前文献中所给结果更优.     

运用新课程的理念提高数学复习课的课堂效率

如何提高数学复习课的教学效率?这是当前数学教学中值得研究的问题."复习",如果只是基础知识的简单罗列,难免使学生厌倦;如果只是习题解法的演示,又会令学生深陷题海无所适从……,对复习课的目标和功能的认识,决定了复习课内容的选择、教学的模式和教学的效果.     

最小填充问题的可分解性

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G F是弦图.这里最小值|F|称为图G的填充数,表示为f(G).作为NP-困难问题,该问题的降维性质已被研究,其中包括它的可分解性.基本的可分解定理是:如果图G的一个点割集S是一个团,则G经由S是可分解的.作为推广,如果S是一个"近似"团(即只有极少数边丢失的团),则G经由S是可分解的.本文首先给出基本分解定理的另外一个推广:如果S是G的一个极小点割集且G-S含有至少|S|个分支,则G经由S是可分解的;其次,给出了这个新推广定理的一些应用.     

自由群的直积的检验元素的注记

本文研究了自由群的直积的检验元素,通过对直积的自同态的分解,得到了直积中的元素为检验元素的充分必要条件,改进了O'neill和Turner的结果.此外,构造了两类具体的检验元素.     

一个基于复制变异准则的蛋白质作用网络的构建模型

本文主要根据生物学的复制和变异的基本原理,提出了具有反偏爱复制特性的一个蛋白质作用网络的新的演化模型.通过计算,发现所得的网络与实测的蛋白质作用网络的某些拓扑性质能够很好的吻合.生成的网络不仅是稀疏的,而且具有小世界性和无标度(scale-free)性质.     

例谈题目“提示”信息的有效利用

解题的一个重要环节是"审题",审题的目的就是希望从题目中提取有用的解题信息.一些创新性的试题,常在题干中设置了明显的"提示"信息,而对于解题者而言,如何利用好题目的这些"提示"信息,将是成功解题的关键.     

在向量解题中强化学生的解题意识

向量在近几年高考中越来越重要,其工具性作用已渗透以数学的各个分支.解答题中主要是以向量为载体的综合问题,体现向量"搭台",其他知识"唱戏"的特点.近年来高考中小题综合化的特点,已被大家所共识.选填题中对向量知识的考查更加灵活多变,对学生能力要求较高,可是只要是题型新颖一点或能力要求高点的题就成为学生得分的"事故多发地带".……     

员工配置资源行为的优化研究:自适应组织的视角

组织目标必须通过约束体系规范员工行为得以实现.进行组织约束下员工行为的定量研究,这对保证组织健康稳定发展非常必要.员工自身适应组织目标,服从组织的约束体系,配置好自有的资源,使得自身行为得以优化的研究较少.本文简要回顾了经济学理论、组织行为学、人力资源管理等方面对员工配置资源行为优化的研究及应用.界定了组织资源,并将其分为三种类型.在约束体系给出的基础上,将组织对员工行为的控制、要求或激励转为员工在之上或之下的运行约束;认为约束体系具有离散、悬河效应的特点;得出了评价组织约束体系的两种算法.讨论了员工资源及行为.尝试构造了基于员工适应组织约束下,员工的多目标、非线性,既有连续又有离散约束条件的配置资源行为优化的定量模型,并在基于员工利益最大化的前提下,对模型求解最优解的几种情况进行了研究.希望能够填补员工自身适应组织目标,行为优化定量模型这方面研究的空白.     

简议数列综合题的求解策略

数列在中学数学中占有极为重要的地位,它不仅广泛应用于实际,而且还融于高中数学的各个章节构成精彩纷呈的综合题,因此数列的综合题是高考中久考不衰的热点,且常考常新,并以此为压轴题者也屡见不鲜.本文拟就数列的几类主要综合题求解的基本策略简议如下:……     

让我们的课堂充满探索与交流——一个定值问题的诱思教学实录

新课程倡导"数学学习过程应该表现为一个探索与交流的过程--在探索的过程中形成自己对数学的理解,并在与他人的交流过程中逐渐完善自己的想法."     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

覆盖数不超过3的图上渡河问题

1000多年前,英国著名学者Alcuin曾提出一个古老的渡河问题,即狼、羊和卷心菜的渡河问题。2006年,Prisner把该问题推广到任意的冲突图上,考虑了一类情况更一般的渡河运输问题。所谓冲突图是指一个图G=(V,E),这里V代表某些物品的集合,V中的两个点有边连结当且仅当这两个点是冲突的,即在无人监管的情况下不允许留在一起的点。图G=(V,E)的一个可行运输方案是指在保证不发生任何冲突的前提下,把V的点所代表的物品全部摆渡到河对岸的一个运输方案。图G的Alcuin数定义为它存在可行运输方案时所需船的最小容量。本文讨论了覆盖数不超过3的连通图的Alcuin数,给出了该类图Alcuin数的完全刻画。     

An algebraic index theorem for orbifolds

Using the concept of a twisted trace density on a cyclic groupoid, a trace is constructed on a formal deformation quantization of a symplectic orbifold. An algebraic index theorem for orbifolds follows as a consequence of a local Riemann-Roch theorem for such densities. In the case of a reduced orbifold, this proves a conjecture by Fedosov, Schulze, and Tarkhanov. Finally, it is shown how the Kawasaki index theorem for elliptic operators on orbifolds follows from this algebraic index theorem.     

Global asymptotic properties of an SEIRS model with multiple infectious stages

The paper presents a rigorous mathematical analysis of a deterministic model, which uses a standard incidence function, for the transmission dynamics of a communicable disease with an arbitrary number of distinct infectious stages. It is shown, using a linear Lyapunov function, that the model has a globally-asymptotically stable disease-free equilibrium whenever the associated reproduction threshold is less than unity. Further, the model has a unique endemic equilibrium when the threshold exceeds unity. The equilibrium is shown to be locally-asymptotically stable, for a special case, using a Krasnoselskii sub-linearity trick. Finally, a non-linear Lyapunov function is used to show the global asymptotic stability of the endemic equilibrium (for the special case). Numerical simulation results, using parameter values relevant to the transmission dynamics of influenza, are presented to illustrate some of the main theoretical results.     

关于凸子集和（绝对）收缩核

讨论了线性度量空间中凸子集在什么情况下为该空间的收缩核，以及在什么情况下为绝对收缩核。     

Induction of Geometric Actions

We prove that, in some situations, an induced action from a normal subgroup preserves a geometric structure. Combined with known geometric rigidity results, this result implies certain rigidity statements concerning the full diffeomorphism group of a manifold. It also provides many examples of actions on Lorentz manifolds. Combining these with a small number of well-known actions, we get the full list of connected, simply connected Lie groups admitting a locally faithful, orbit nonproper action by isometries of a connected Lorentz manifold. We give an example of a connected nilpotent Lie group with no complicated action on a Lorentz manifold. We show that, if a connected Lie group has a normal closed subgroup isomorphic to a (two-dimensional) cylinder, then it admits a locally faithful, orbit nonproper action by isometries of a connected Lorentz manifold.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

Approximate evaluation of multi-location inventory models with lateral transshipments and hold back levels

We consider a continuous-time, single-echelon, multi-location inventory model with Poisson demand processes. In case of a stock-out at a local warehouse, a demand can be fulfilled via a lateral transshipment (LT). Each warehouse is assigned a pre-determined sequence of other warehouses where it will request for an LT. However, a warehouse can hold its last part(s) back from such a request. This is called a hold back pooling policy, where each warehouse has hold back levels determining whether a request for an LT by another warehouse is satisfied. We are interested in the fractions of demand satisfied from stock (fill rate), via an LT, and via an emergency procedure from an external source. From these, the average costs of a policy can be determined. We present a new approximation algorithm for the evaluation of a given policy, approximating the above mentioned fractions. Whereas algorithms currently known in the literature approximate the stream of LT requests from a warehouse by a Poisson process, we use an interrupted Poisson process. This is a process that is turned alternatingly On and Off for exponentially distributed durations. This leads to the On/Off overflow algorithm. In a numerical study we show that this algorithm is significantly more accurate than the algorithm based on Poisson processes, although it requires a longer computation time. Furthermore, we show the benefits of hold back levels, and we illustrate how our algorithm can be used in a heuristic search for the setting of the hold back levels.     

A Decomposition of Markov Processes via Group Actions

We study a decomposition of a general Markov process in a manifold invariant under a Lie group action into a radial part (transversal to orbits) and an angular part (along an orbit). We show that given a radial path, the conditioned angular part is a nonhomogeneous Lévy process in a homogeneous space, we obtain a representation of such processes and, as a consequence, we extend the well-known skew-product of Euclidean Brownian motion to a general setting.