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

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

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

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

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

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

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

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

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

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

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

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

Best approximation by downward sets with applications

We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs （W,x）, where ∈ X and W is a closed downward subset of X     

On a class of Riemann surfaces

It is considered the class of Riemann surfaces with dimT1 = 0, where T1 is a subclass of exact harmonic forms which is one of the factors in the orthogonal decomposition of the spaceΩH of harmonic forms of the surface, namely The surfaces in the class OHD and the class of planar surfaces satisfy dimT1 = 0. A.Pfluger posed the question whether there might exist other surfaces outside those two classes. Here it is shown that in the case of finite genus g, we should look for a surface S with dimT1 = 0 among the surfaces of the form Sg\K , where Sg is a closed surface of genus g and K a compact set of positive harmonic measure with perfect components and very irregular boundary.     

The use of phase portraits to visualize and investigate isolated singular points of complex functions

ABSTRACT

Undergraduate students usually study Laurent series in a standard course of Complex Analysis. One of the major applications of Laurent series is the classification of isolated singular points of complex functions. Although students are able to find series representations of functions, they may struggle to understand the meaning of the behaviour of the function near isolated singularities. In this paper, I briefly describe the method of domain colouring to create enhanced phase portraits to visualize and study isolated singularities of complex functions. Ultimately this method for plotting complex functions might help to enhance students' insight, in the spirit of learning by experimentation. By analysing the representations of singularities and the behaviour of the functions near their singularities, students can make conjectures and test them mathematically, which can help to create significant connections between visual representations, algebraic calculations and abstract mathematical concepts.     

Nonexistence in power and gamma density regression, sum of nonnegative terms

When we use the power function α(c x)^b and gamma density αx^be^-cx to fit the data by the least squares method, we have to address the question of existence. The closure of the set of each type of these functions defined on a finite domain is determined. We derive a way to determine the closure of a sum of nonnegative functions if the closures of the summands are available.     

Sur l'existence, l'unicité, la stabilité et les propriétés de grandes déviations des solutions d'équations différentielles stochastiques rétrogrades à horizon aléatoire. Application à des problèmes de perturbations singulières

We study the existence, uniqueness and stability of solutions of backward stochastic differential equations with random terminal time under new assumptions; then we establish a large deviation principle for the solutions of such equations, related to a family of Markov processes, the diffusion coefficient of which tends to zero. Finally we apply these results to the analysis of some singular perturbation problems for a class of nonlinear partial differential equations.     

Schreier rewriting beyond the classical setting Dedicated to our teacher Alfred Lvovich Shmelkin on his 70th birthday

Using actions of free monoids and free associative algebras, we establish some Schreier-type formulas involving ranks of actions and ranks of subactions in free actions or Grassmann-type relations for the ranks of intersections of subactions of free actions. The coset action of the free group is used to establish a generalization of the Schreier formula in the case of subgroups of infinite index. We also study and apply large modules over free associative and free group algebras.     

A quantum spin system with random interactions I

We study a quantum spin glass as a quantum spin system with random interactions and establish the existence of a family of evolution groups {τ_t(ω)}_ω∈/Ω of the spin system. The notion of ergodicity of a measure preserving group of automorphisms of the probability space Ω, is used to prove the almost sure independence of the Arveson spectrum Sp(τ(ω)) of τ_t(ε). As a consequence, for any family of (τ(ω),β) — KMS states {ρ(ω)}, the spectrum of the generator of the group of unitaries which implement τ(ω) in the GNS representation is also almost surely independent of ω.     

Absolute Continuity of Measures in the Class of Markov and Semi-Markov Processes of Diffusion Type

The property of absolute continuity of measures in the class of one-dimensional semi-Markov processes of diffusion type is investigated. The measure of such a process can be composed of two measures. The first one is a distribution of a random track, and the second one is a conditional distribution of a time run along the track. The desired density is represented in the form of product of two corresponding densities.     

Toward eudaimonology: notes on a quantitative framework for the study of happiness

After noting factors (concern for others, ignorance, irrationality) accounting for the divergences between preference and happiness, the question of representing the preference of an individual by a utility function is discussed, taking account of lexicographic ordering, imperfect discrimination and the corresponding concepts of semiorder and sub-semiorder. Methods to improve upon the interpersonal comparability of measures of happiness such as pinning down the dividing line of zero happiness and the use of a just perceivable increment of happiness are discussed. The relation of social welfare to individual welfare (i.e. happiness) is then considered. Some reasonable set of axioms ensuring that social welfare is a separable function of and indeed an unweighted sum of individual welfares are reviewed. Finally, happiness is regarded as a function of objective, institutional and subjective factors; an interdisciplinary approach is needed even for an incomplete analysis.     

Clustering Methods in Microarrays

Summary DCT Given a finite set of points in an Euclidean space the \emph{spanning tree} is a tree of minimal length having the given points as vertices. The length of the tree is the sum of the distances of all connected point pairs of the tree. The clustering tree with a given length of a given finite set of points is the spanning tree of an appropriately chosen other set of points approximating the given set of points with minimal sum of square distances among all spanning trees with the given length. DCM A matrix of real numbers is said to be column monotone orderable if there exists an ordering of columns of the matrix such that all rows of the matrix become monotone after ordering. The {\emph{monotone sum of squares of a matrix}} is the minimum of sum of squares of differences of the elements of the matrix and a column monotone orderable matrix where the minimum is taken on the set of all column monotone orderable matrices. Decomposition clusters of monotone orderings of a matrix is a clustering ofthe rows of the matrix into given number of clusters such that thesum of monotone sum of squares of the matrices formed by the rowsof the same cluster is minimal.DCP A matrix of real numbers is said to be column partitionable if there exists a partition of the columns such that the elements belonging to the same subset of the partition are equal in each row. Given a partition of the columns of a matrix the partition sum of squares of the matrix is the minimum of the sum of square of differences of the elements of the matrix and a column partitionable matrix where the minimum is taken on the set of all column partitionable matrices. Decomposition of the rows of a matrix into clusters of partitions is the minimization of the corresponding partition sum of squares given the number of clusters and the sizes of the subsets of the partitions.