Fibonacci helps to evacuate from a convex region in a grid network

This study considers an evacuation problem where the evacuees try to escape to the boundary of an affected area, which is convex, and a grid network is embedded in the area. The boundary is unknown to the evacuees and we propose an online evacuation strategy based on the Fibonacci sequence. This strategy is proved to have a competitive ratio of 19.5, which is better than the best previously reported result of 21.     

印度、巴基斯坦冲突中的民族、宗教因素

冷战结束以后,国际形势风云变幻,各种政治力量为谋求自身的发展而不断分化、组合,在世界政治舞台上扮演着不同的角色。伴随着国际政治斗争的开展,民族和宗教因素在其中的作用和影响越来越突出。近年来,中东的巴以战争、俄罗斯的车臣战争等无一不与当地的民族、宗教矛盾相联系。在南亚次大陆,印度与巴基斯坦的冲突更是如此。本文拟从民族与宗教的层面对印巴冲突进行粗浅的解读。一、印巴民族、宗教冲突的由来现在的巴基斯坦原本属于印度,它是根据宗教信仰的差异于1947年从印度分出去的。印度居民主要信仰印度教,而巴基斯坦居民则多信奉伊斯兰…     

Online MapReduce scheduling problem of minimizing the makespan

MapReduce system is a popular big data processing framework, and the performance of it is closely related to the efficiency of the centralized scheduler. In practice, the centralized scheduler often has little information in advance, which means each job may be known only after being released. In this paper, hence, we consider the online MapReduce scheduling problem of minimizing the makespan, where jobs are released over time. Both preemptive and non-preemptive version of the problem are considered. In addition, we assume that reduce tasks cannot be parallelized because they are often complex and hard to be decomposed. For the non-preemptive version, we prove the lower bound is \(\frac{m+m(\Psi (m)-\Psi (k))}{k+m(\Psi (m)-\Psi (k))}\), higher than the basic online machine scheduling problem, where k is the root of the equation \(k=\big \lfloor {\frac{m-k}{1+\Psi (m)-\Psi (k)}+1 }\big \rfloor \) and m is the quantity of machines. Then we devise an \((2-\frac{1}{m})\)-competitive online algorithm called MF-LPT (Map First-Longest Processing Time) based on the LPT. For the preemptive version, we present a 1-competitive algorithm for two machines.     

《元韵谱》微母来源考

轻唇音微母主要来源于中古明母合口三等字,只有东韵三等及尤韵出现例外.在<元韵谱>中保留微母,但其来源却与中古不一致,不仅收录了中古的微母字,而且还收入了很多中古明母字.这种特殊现象引起了我们的注意,这些混入微母的中古明母字应读为何母?这种现象是当时实际语音的反映吗?通过考察发现<元韵谱>微母下收录中古的明母字,并不能读为微母,也不是实际语音的反映,而是完全照搬<五音集韵>的做法.     

中国流通A股市场大盘股价指数研究

本文对我国现行股价指数计算中存在的问题进行了分析,提出了流通A股价格指数和流通A股资金指数方案。本文计算出的指数不仅有助于解决现行指数反映市场变化不充分的问题,同时还为股票市场的定量分析奠定了基础。     

试论建立和实施党内罢免或撤换制度

党内民主是党的生命。罢免或撤换制度是全面实现党员权利,改革党内选举制度,进一步强化党内监督的一项重要制度。随着党内民主改革的不断发展,党内制度建设的不断加强,建立和实施党内罢免或撤换制度已势在必行。就当前党内民主发展现状看,建立和实施党内罢免或撤换制度,还面临着民主发育尚不完全成熟、配套的制度改革尚未到位、党员权利保障机制仍不够完善等一系列问题。因此,必须坚持以改革的精神,积极进行党的代表大会常任制的试点探索,自上而下地稳步推进党内罢免或撤换制度建设。     

高额现金股利分配的原因分析——基于沧州明珠的案例研究

运用案例研究方法,从沧州明珠高额现金股利分配入手,对我国一些上市公司高额现金股利政策进行了深入剖析.研究发现,从利润流和现金流角度分析,沧州明珠均属于非理性派现,但派现后市场反应平淡,既没有热捧,也没有负面反应.公司派发高额现金股利根源在于限售股股东放弃一些对于非限售股股东而言净现值大于零的项目,从而发放高额现金股利,达到加快回收其投入资金的目的.     

Competitive analysis for make-to-order scheduling with reliable lead time quotation

This paper makes extended studies on the discrete problem of online scheduling and reliable lead time quotation (discrete Q-SLTQ) introduced by Keskinocak et al. (Manag. Sci. 47(2):264–279, 2001). We first relax the assumption on revenue function from a linear decreasing function to any decreasing function. We present an online deterministic strategy which is optimal in competitiveness for concave revenue functions. The above results are further extended to the continuous Q-SLTQ model where orders are released at arbitrary time points. For the discrete Q-SLTQ problem, if orders are with nonuniform lengths, we prove the nonexistence of online strategies with bounded competitive ratios; otherwise if orders are with unit length but various weights, we present an optimal online strategy.     

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.