Benevolence-dominant,authoritarianism-dominant,and classical paternalistic leadership: Testing their relationships with subordinate performance

We propose a new typology of paternalistic leadership styles based on how leaders demonstrate authoritarianism and benevolence, the two essential components of this type of leadership. Benevolence-dominant paternalistic leadership refers to leaders' sole dependence on the use of benevolence without their strong assertion of authority, whereas authoritarianism-dominant paternalistic leadership is based mainly on authoritarianism itself; classical paternalistic leadership, which best fits early observations of paternalistic leaders, refers to the salient combination of both leadership components. We used two distinct samples and methods to test this typology and the association with subordinate performance. Across the two studies, a field investigation with Taiwanese military supervisor-subordinate dyads and a hypothetical scenario experiment with U.S. working adults, we found a positive relationship between classical paternalistic leadership and subordinate performance as strong as that between benevolence-dominant paternalistic leadership and performance. Our findings echo the phenomenon that paternalistic leaders tend to combine benevolence with authoritarianism to affect subordinate performance.     

Online MapReduce processing on two identical parallel machines

In this work we investigate the online over-list MapReduce processing problem on two identical parallel machines, aiming at minimizing the makespan. Jobs are revealed one by one, and each job consists of one map task and one reduce task. The map task can be arbitrarily split and processed on both machines simultaneously, while the reduce task has to be processed on a single machine and it cannot be started unless the map task has been completed. We first show that the general case of the problem reduces to the classical two machine online scheduling model with an optimal competitive ratio of 3/2. For a special case where the map task is at least as long as the reduce task, we prove that no online algorithm can be less than 4/3-competitive. An optimal Greedy algorithm with a matching competitive ratio is proposed as well.     

An $$O(|E(G)|^2)$$ algorithm for recognizing Pfaffian graphs of a type of bipartite graphs

A graph \(G=(V,E)\) with even number vertices is called Pfaffian if it has a Pfaffian orientation, namely it admits an orientation such that the number of edges of any M-alternating cycle which have the same direction as the traversal direction is odd for some perfect matching M of the graph G. In this paper, we obtain a necessary and sufficient condition of Pfaffian graphs in a type of bipartite graphs. Then, we design an \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs in this class and constructs a Pfaffian orientation if the graph is Pfaffian. The results improve and generalize some known results.     

Relation between the skew-rank of an oriented graph and the independence number of its underlying graph

An oriented graph \(G^\sigma \) is a digraph without loops or multiple arcs whose underlying graph is G. Let \(S\left( G^\sigma \right) \) be the skew-adjacency matrix of \(G^\sigma \) and \(\alpha (G)\) be the independence number of G. The rank of \(S(G^\sigma )\) is called the skew-rank of \(G^\sigma \), denoted by \(sr(G^\sigma )\). Wong et al. (Eur J Comb 54:76–86, 2016) studied the relationship between the skew-rank of an oriented graph and the rank of its underlying graph. In this paper, the correlation involving the skew-rank, the independence number, and some other parameters are considered. First we show that \(sr(G^\sigma )+2\alpha (G)\geqslant 2|V_G|-2d(G)\), where \(|V_G|\) is the order of G and d(G) is the dimension of cycle space of G. We also obtain sharp lower bounds for \(sr(G^\sigma )+\alpha (G),\, sr(G^\sigma )-\alpha (G)\), \(sr(G^\sigma )/\alpha (G)\) and characterize all corresponding extremal graphs.     

A simpler PTAS for connected <Emphasis Type="Italic">k</Emphasis>-path vertex cover in homogeneous wireless sensor network

Because of its application in the field of security in wireless sensor networks, k-path vertex cover (\(\hbox {VCP}_k\)) has received a lot of attention in recent years. Given a graph \(G=(V,E)\), a vertex set \(C\subseteq V\) is a k-path vertex cover (\(\hbox {VCP}_k\)) of G if every path on k vertices has at least one vertex in C, and C is a connected k-path vertex cover of G (\(\hbox {CVCP}_k\)) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for \(\hbox {MinCVCP}_k\) on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the time-complexity, but also simplifies the analysis by a large amount.     

渠道冲突管理的"生命周期观"——机会主义及其治理机制

渠道冲突管理是营销研究的热门课题之一.遗憾的是,文献对于渠道冲突管理的分析都是以结果为导向,忽视了对渠道冲突的前因分析,也没有树立渠道冲突管理的全程意识.本文指出,机会主义是渠道冲突的直接前因,必须引入渠道冲突的全程管理.机会主义治理的渠道冲突观认为,渠道关系初期进行渠道成员选择,渠道关系持续期谋求长期导向、互动、协商、开放的渠道关系,可以确保渠道冲突管理树立全程的"生命周期观".本文结合中国市场渠道中机会主义的渠道冲突案例进行剖析,为如何进行机会主义治理、杜绝渠道冲突之源,保持渠道和谐提供了新的视角.     

政策及经济环境对企业投资决策方法选择的影响

本文使用结构方程方法,基于问卷调查结果,对政策和经济环境变化对于企业投资决策方法选择的影响进行了研究。研究结果表明,政策环境对企业投资决策方法有影响,在政策因素变化条件下,上市公司回避使用净现值方法;经济环境对于企业投资决策方法影响不大,论文分析结果没有表现出经济因素是否变化对投资决策方法选择有明显影响。     

我国上市公司独立审计质量的博弈模型刻画及其分析

本文分析了我国上市公司独立审计中会计师事务所、公司管理当局、独立董事、监管部门在审计行为中的博弈关系,应用博弈经济理论研究了在信息不对称条件下四方互动博弈策略的选择,并针对多方博弈的影响因素提出了提高独立审计质量的策略,以期对改进我国上市公司独立审计质量有所裨益.     

On the computational hardness based on linear FPT-reductions

The notion of linear fpt-reductions has been recently introduced to derive strong computational lower bounds for well-known NP-hard problems. In this paper, we formally investigate the notion of W[t]-hardness under the linear fpt-reduction, and study the structural properties of the corresponding complexity classes. Additional complexity lower bounds on important computational problems are established. Some observations on structural properties of the standard parameterized hierarchy, the W -hierarchy, are also presented. In this paper, we always assume that complexity functions are “nice” with both domain and range being non-negative integers and the values of the functions and their inverses can be easily computed.     

信息缺失下的应急方案选择模型及算法研究

信息缺失是应急事件处置中的一个重要特征.对于考虑信息缺失的两阶段应急处置问题,本文提出了应急方案效度的概念,构造了考虑资源约束条件下的应急方案选择模型,并给出了求解算法.数值结果表明模型及算法的有效性.