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

本文主要讨论组合地图列举问题.刘的一部专著中提出了一个判定两个地图是否同构的算法.该算法的时间复杂度为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)性质.     

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

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

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

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

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

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

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

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

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

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

Generalized symmetry of graphs — A survey

Symmetry of graphs has been extensively studied over the past fifty years by using automorphisms of graphs and group theory which have played and still play an important role for graph theory, and promising and interesting results have been obtained, see for examples, [L.W. Beineke, R.J. Wilson, Topics in Algebraic Graph Theory, Cambridge University Press, London, 2004; N. Biggs, Algebraic Graph Theory, Cambridge University Press, London, 1993; C. Godsil, C. Royle, Algebraic graph theory, Springer-Verlag, London, 2001; G. Hahn, G. Sabidussi, Graph Symmetry: Algebraic Methods and Application, in: NATO ASI Series C, vol. 497, Kluwer Academic Publishers, Dordrecht, 1997]. We introduced generalized symmetry of graphs and investigated it by using endomorphisms of graphs and semigroup theory. In this paper, we will survey some results we have achieved in recent years. The paper consists of the following sections.

1. Introduction

2. End-regular graphs

3. End-transitive graphs

4. Unretractive graphs

5. Graphs and their endomorphism monoids.

Moment information for probability distributions,without solving the moment problem,II: Main-mass,tails and shape approximation

How much information does a small number of moments carry about the unknown distribution function? Is it possible to explicitly obtain from these moments some useful information, e.g., about the support, the modality, the general shape, or the tails of a distribution, without going into a detailed numerical solution of the moment problem? In this, previous and subsequent papers, clear and easy to implement answers will be given to some questions of this type. First, the question of how to distinguish between the main-mass interval and the tail regions, in the case we know only a number of moments of the target distribution function, will be addressed. The answer to this question is based on a version of the Chebyshev–Stieltjes–Markov inequality, which provides us with upper and lower, moment-based, bounds for the target distribution. Then, exploiting existing asymptotic results in the main-mass region, an explicit, moment-based approximation of the target probability density function is provided. Although the latter cannot be considered, in general, as a satisfactory solution, it can always serve as an initial approximation in any iterative scheme for the numerical solution of the moment problem. Numerical results illustrating all the theoretical statements are also presented.     

Splitting up value: A critical review of residual income theories

This paper deals with the notion of residual income, which may be defined as the surplus profit that residues after a capital charge (opportunity cost) has been covered. While the origins of the notion trace back to the 19th century, in-depth theoretical investigations and widespread real-life applications are relatively recent and concern an interdisciplinary field connecting management accounting, corporate finance and financial mathematics (Peasnell, 1981, 1982; Peccati, 1987, 1989, 1991; Stewart, 1991; Ohlson, 1995; Arnold and Davies, 2000; Young and O’Byrne, 2001; Martin, Petty and Rich, 2003). This paper presents both a historical outline of its birth and development and an overview of the main recent contributions regarding capital budgeting decisions, production and sales decisions, implementation of optimal portfolios, forecasts of asset prices and calculation of intrinsic values. A most recent theory, the systemic-value-added approach (also named lost-capital paradigm), provides a different definition of residual income, consistent with arbitrage theory. Enfolded in Keynes’s (1936) notion of user cost and forerun by Pressacco and Stucchi (1997), the theory has been formally introduced in Magni (2000a,b,c; 2001a,b; 2003), where its properties are thoroughly investigated as well as its relations with the standard theory; two different lost-capital metrics have been considered, for value-based management purposes, by Drukarczyk and Schueler (2000) and Young and O’Byrne (2001). This work illustrates the main properties of the two theories and their relations, and provides a minimal guide to construction of performance metrics in the two approaches.     

A Sequent Calculus for Propositional Dynamic Logic for Agents with Interactions

We consider a propositional dynamic logic for agents with interactions such as known commitment, no learning, and perfect recall. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 261–269, April–June, 2005.     

关于群中乘积元素的阶

讨论群中两个元素a,b的阶不相等时其乘积ab的阶的一类计算问题.设ㄧaㄧ=m,ㄧ bㄧ=n,若(m,n)=1,且存在k∈N使a=bk,则有ㄧabㄧ=mn/d1d2,其中d1=(m,k+1),d2=(n,k+1).若m≠n,ab=ba,且(m,n)ㄧm/(m,n),或(m,n)ㄧn/(m,n),则有ㄧabㄧ=[m,n].     

城市老旧居住小区交通环境评价指标与评价方法

定量的评判城市老旧居住小区整体交通环境质量并进而科学有效的提出老旧小区交通环境更新与改善措施,对城市老旧居住小区交通环境进行了调查,明确了老旧居住小区存在的突出交通问题,并提出了城市老旧居住小区交通环境评价的指标体系,包括行人跨路出行指数、无人行道路段长度占比、停车泊位供需比、路内非法停车占比、平均停车步行距离、泊位数量户数比、人均步行空间、无障碍通道、盲道设置比例、非机动车泊位供需比、地面停放车辆数小区面积比、外部穿行交通周转量小区面积比等。并给出了具体指标的计算方法与获得办法。以长沙市四个典型老旧居住小区为例,对评价方法进行了论证,并得到城市老旧居住小区存在的一般问题,包括人车混杂、人车交织现象严重,停车泊位短缺、车辆乱停乱放,交通设施、特别是弱势群体交通设施缺乏。给出的评价指标、评价方法与结论可为城市老旧小区改造更新,特别是其中很重要的交通环境更新提供决策依据。     

The permanence and extinction of a nonlinear growth rate single-species non-autonomous dispersal models with time delays

In this paper, we consider the effect of diffusion on the permanence and extinction of a non-autonomous nonlinear growth rate single-species dispersal model with time delays. Firstly, the sufficient conditions of the permanence and extinction of the species are established, which shows if the growth rate and dispersal coefficients is suitable, the species is permanent, on the contrary, it is extinction. Secondly, an interesting result is established, that is, if only the species in some patches even in one patch is permanent, then it is also permanent in other patches. Finally, some examples together with their numerical simulations show the feasibility of our main results.     

互连网络的向量图模型

n-超立方体,环网,k元n超立方体,Star网络,煎饼(pancake)网络,冒泡排序(bubble sort)网络,对换树的Cayley图,De Bruijn图,Kautz图,Consecutive-d有向图,循环图以及有向环图等已被广泛的应用做处理机或通信互连网络.这些网络的性能通常通过它们的度,直径,连通度,hamiltonian性,容错度以及路由选择算法等来度量.在本文中,首先,我们提出了有向向量图和向量图的概念;其次,我们开发了有向向量图模型和向量图模型来更好地设计,分析,改良互连网络;我们进一步证明了上述各类著名互连网络都可表示为有向向量图模型或向量图模型;更重要的是该模型能够使我们设计出了新的互连网络---双星网络和三角形网络.