Parity and strong parity edge-colorings of graphs

A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. A parity edge-coloring (respectively, strong parity edge-coloring) is an edge-coloring in which there is no nontrivial parity path (respectively, open parity walk). The parity edge-chromatic number p(G) (respectively, strong parity edge-chromatic number $\widehat{p}(G)$ ) is the least number of colors in a parity edge-coloring (respectively, strong parity edge-coloring) of G. Notice that $\widehat{p}(G) \ge p(G) \ge \chi'(G) \ge \Delta(G)$ for any graph G. In this paper, we determine $\widehat{p}(G)$ and p(G) for some complete bipartite graphs and some products of graphs. For instance, we determine $\widehat{p}(K_{m,n})$ and p(K _m,n ) for m≤n with n≡0,?1,?2 (mod 2^?lg?m?).     

Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

An adjacent vertex distinguishing edge-coloring of a graph G is a proper edge coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is denoted by χ′ _a (G). Let mad(G)\mathop{\mathrm{mad}}(G) and Δ denote the maximum average degree and the maximum degree of a graph G, respectively.     

论协调

党的十六届六中全会作出的《中共中央关于构建社会主义和谐社会若干重大问题的决定》,是党中央从中国特色社会主义事业总体布局和全面建设小康社会全局出发提出的重大战略任务,体现了全党全国各族人民的共同愿望。学习好、宣传好、贯彻好党中央这一重大决定,是摆在广大领导干部面前的一项重要任务。     

On Reinventing OBM

Abstract

This article comments on an argument in favor of a change in OBM's content and focus to include certain empirical findings and theoretical constructs derived from fields like Cognitive and Social Psychology. Specifically, the argument suggests that personal beliefs such as optimism, self-efficacy, and response-efficacy are influential determinants of behavior that give rise to achievement motivation and a success-seeking typology. By incorporating such constructs into OBM, it is suggested that the field will better align itself with related disciplines sharing the goal of promoting personal success, thereby enhancing its performance-improvement toolkit and fostering greater recognition and acceptance for itself within mainstream Psychology. After summarizing key aspects of this argument, this paper identifies certain of its associated challenges and then presents some specific strategies by which the OBM community can chart a future course for the field.     

城市品牌论

在系统回顾城市品牌相关理论研究现状的基础上,提出了城市品牌的概念、实质与分类,重点对城市品牌形成的内部品牌驱动机理和利益相关者认知驱动机理进行了初步探讨,并绘制出了城市品牌塑造过程与塑造方法模型,最后从5个方面对城市品牌的塑造方法进行了扼要阐述。     

管理的基本原则

归纳了12条管理原则,即创新与改善原则、激活原则、重点原则、差别原则、简化原则、配套原则、逐步过渡原则、适度原则、责权利统一原则、分类原则、目标原则和例外原则,并结合实际论述了每条原则的含义.     

On Forward Induction

A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect recall if there exists a weakly sequential equilibrium with that outcome for which the strategy is an optimal reply at every information set it does not exclude. The outcome satisfies forward induction if it results from a weakly sequential equilibrium in which players' beliefs assign positive probability only to relevant strategies at each information set reached by a profile of relevant strategies. We prove that if there are two players and payoffs are generic, then an outcome satisfies forward induction if every game with the same reduced normal form after eliminating redundant pure strategies has a sequential equilibrium with an equivalent outcome. Thus in this case forward induction is implied by decision‐theoretic criteria.     

论把握

大千世界,古往今来,任何事情都离不开“把握”二字。把握无处不在,无时不有。人生顺逆、事业成败,无不在把握之中见分晓;国运盛衰、历史兴替,无不在把握之中得体现。把握既是一个理论问题,又是一个实践问题。从理论和实践的结合上进行一些深入的思考和分析,是非常有意义的。一把握,就是掌握和控制的意思。把握是一种无固定模式可循、既确定又不确定的实践技能,是个人品德、才能、情感、知识、经验、气度等各种因素的综合反映。把握显示能力。把握得好不好,取决于人的主观能动性,体现人的处世能力。把握能力与把握者的知识水平、社会经验、心…     

On Split-Coloring Problems

We study a new coloring concept which generalizes the classical vertex coloring problem in a graph by extending the notion of stable sets to split graphs. First of all, we propose the packing problem of finding the split graph of maximum size where a split graph is a graph G = (V,E) in which the vertex set V can be partitioned into a clique K and a stable set S. No condition is imposed on the edges linking vertices in S to the vertices in K. This maximum split graph problem gives rise to an associated partitioning problem that we call the split-coloring problem. Given a graph, the objective is to cover all his vertices by a least number of split graphs. Definitions related to this new problem are introduced. We mention some polynomially solvable cases and describe open questions on this area. An erratum to this article is available at .     

基于SVM的建设项目风险识别方法研究

支持向量机(SVM)是在统计学习理论的基础上发展起来的一种新的机器学习方法。它基于结构风险最小化原则,能有效地解决过学习问题,具有良好的推广性和分类精确性。在项目风险管理中,风险识别是很重要的一个步骤,如果风险不能被识别,那么我们就不能对风险进行转移、控制或管理。针对该问题,本文提出了一种新的风险识别方法-支持向量机,利用该方法对项目风险识别进行了研究,并取得了很好的识别效果。     

论行政成本

《中共中央关于加强党的执政能力建设的决定》指出,要降低行政成本。行政是一个投入与产出并存的活动,其中必然有一个成本问题。从实际来看,行政成本会分别投入在行政活动的各个方面,而行政成本的投入不仅仅是有形的,同时也包含着大量的无形成本。因此,必须将行政的无形成本和行政的有形成本放在行政活动的各个主要方面进行研究,将整个行政成本与行政绩效结合起来进行研究。一、行政的无形成本行政的无形成本,包括行政者在行政活动中为实现行政目标所付出的时间、精力以及由社会所承担的某些付出。因为在领导活动中,为实现领导目标,需要对事…     

On nonlinear multi-covering problems

In this paper we define the exact k-coverage problem, and study it for the special cases of intervals and circular-arcs. Given a set system consisting of a ground set of n points with integer demands \(\{d_0,\dots ,d_{n-1}\}\) and integer rewards, subsets of points, and an integer k, select up to k subsets such that the sum of rewards of the covered points is maximized, where point i is covered if exactly \(d_i\) subsets containing it are selected. Here we study this problem and some related optimization problems. We prove that the exact k-coverage problem with unbounded demands is NP-hard even for intervals on the real line and unit rewards. Our NP-hardness proof uses instances where some of the natural parameters of the problem are unbounded (each of these parameters is linear in the number of points). We show that this property is essential, as if we restrict (at least) one of these parameters to be a constant, then the problem is polynomial time solvable. Our polynomial time algorithms are given for various generalizations of the problem (in the setting where one of the parameters is a constant).