绿色管理——企业可持续发展的必然选择

保护生态环境,实现可持续发展是企业在21世纪必须面对的发展战略问题.随着环境污染的日益严重和人们环保意识的不断提高,传统企业管理方式已无法适应人类社会发展的需要.一种新型管理方式——绿色管理应运而生.该文通过对绿色管理的概念、绿色管理产生与发展过程的阐述,揭示了绿色管理是企业可持续发展的必然选择.     

近600年来我国的旱灾与瘟疫

根据有关历史文献、气象资料、报表和地方志的统计结果 ,15— 19世纪 ,全国共发生旱灾 15次 ,总历时 4 9年 ,其中 14次有瘟疫伴生。北方旱灾 14次 ,13次有瘟疫伴生 ;南方旱灾 7次 ,均有瘟疫伴生 ,有 6次南北同旱。 2 0世纪 ,全国共发生旱灾 18次 ,其中 ,北方旱灾 17次 ,两次有瘟疫伴生 ;南方旱灾 11次 ,1次有瘟疫伴生。 2 0世纪的灾害发生率是前 5 0 0年的 6倍。该文指出 ,这是由于在全球工业化过程中 ,不断增加的温室气体产生了温室效应 ,使气候变暖、降水减少、持续冬暖所致。因此 ,该文建议加快实施西部开发 ,治理环境 ,实施节水、调水工程 ,提高防灾抗灾能力 ,以缓解南北旱灾和瘟疫的发生     

对西部林业生态环境建设资源配置方式的探讨

资源配置的方式是西部林业生态环境建设的重要问题 ,它决定着资源的合理利用和效益大小 ,也影响着我国西部地区经济发展的进程。该文探讨了在西部大开发的背景下 ,在林业实施跨越式发展的形势所需下 ,西部所进行的林业生态环境建设 ,如何进行资源配置方式的选择。在分析了关于计划和市场两种资源配置方式的观点后 ,认为根据西部目前的现实状况 ,西部林业生态环境建设应实行计划和市场相结合的资源配置方式     

印度东北与中国西南的民族志诗歌

印度东北与中国西南在地域上山水相连,相互之间的文化交流是非常密切的。这个区域里居住着众多的民族或族群,他们的文化相似性和可比性是很明显的。从跨国的视角来探寻文化互动或文化个性,这是一个理想的地域。这些不同民族或族群身份的诗人写作的民族志诗歌是探寻各自文化共性和个性的较好途径：虽然诗歌创作过程中采用不同的语言,印度东北的土著诗人通常用英语写作,中国西南少数民族诗人经常用汉语写作,但是这些诗人都受到了近代西方现代主义诗歌潮流的影响。同时,这些诗人的诗歌也受到了当下全球化的影响,比如本民族传统文化与文化教育现代化、全球生态环境日益恶化等等冲突的影响。因为受到了相似的影响,这个区域内的民族志诗歌的风格和肌理是可以比较的;诗歌的主题和内容也是可以展开对比研究的。     

A Nation from the Sands

Abstract

Since its birth ninety years ago Tel Aviv has been a leading symbol ofthe Zionist, and subsequently, Israeli claim to be a modem, progressive, and essentially ‘Western’ nation. The power of this image has obscured both the intimate connection between the modern(ist) architectural and town-planning discourses upon which its identity has been constructed and the exclusivism of Zionism as a nationalist movement, and the fact that the neighboring town ofJaffa, long considered Tel Aviv’s ancient and backward alter ego, was in fact developing along similar lines as the Jewish city until its conquest in 1948.     

Every Minute Counts: Using Process Improvement and Performance Feedback to Improve Patient Flow in an Emergency Department

Prolonged emergency department (ED) visits are associated with a number of adverse outcomes for patients as well as lower patient satisfaction scores and increased costs. Several factors that influence the length of ED visits are out of the control of hospital employees, but some opportunities exist to improve performance. For this study, the ED department of a 150-bed hospital in the southeastern United States wanted to improve door-to-discharge time. To do so, a subprocess of door-to-discharge time was targeted, door-to-order. After analyzing the process, the team created standard orders for the 10 most common presenting conditions in the ER with preapproval, allowing nurses to submit the orders without the provider first visiting the patient. Following the process change, daily feedback was added to increase utilization of the preapproved orders. Reductions in door-to-order times and door-to-discharge were observed and patient satisfaction remained stable. Implications for future research in this area are discussed.     

Leader individual differences,situational parameters,and leadership outcomes: A comprehensive review and integration

In this article, we provide a wide-ranging review of recent research on leader individual differences. The review focuses specifically on the explosion of such research in the last decade. The first purpose of this review is to summarize and integrate various conceptual frameworks describing how leader attributes influence leader emergence and leader effectiveness. The second purpose is to provide a comprehensive review of empirical research on this relationship. Also, most prior reviews primarily examined leader personality traits; this review includes a broader array of leader attributes, including cognitive capacities, personality, motives and values, social skills, and knowledge and expertise. The final broad purpose of this paper is to review and integrate situational and contextual parameters into our conceptual framing of leader individual differences. Few, if any, prior reviews have systematically accounted for the critical role of such parameters in cuing, activating, or delimiting the effects of particular leader attributes. We do so in this article.     

Reliability evaluation of a multicast over coded packet networks

Network coding is a generalization of conventional routing methods that allows a network node to code information flows before forwarding them. While it has been theoretically proved that network coding can achieve maximum network throughput, theoretical results usually do not consider the stochastic nature in information processing and transmission, especially when the capacity of each arc becomes stochastic due to failure, attacks, or maintenance. Hence, the reliability measurement of network coding becomes an important issue to evaluate the performance of the network under various system settings. In this paper, we present analytical expressions to measure the reliability of multicast communications in coded networks, where network coding is most promising. We define the probability that a multicast rate can be transmitted through a coded packet network under a total transmission cost constraint as the reliability metric. To do this, we first introduce an exact mathematical formulation to construct multicast connections over coded packet networks under a limited transmission cost. We then propose an algorithm based on minimal paths to calculate the reliability measurement of multicast connections and analyze the complexity of the algorithm. Our results show that the reliability of multicast routing with network coding improved significantly compared to the case of multicast routing without network coding.     

FPT-algorithms for some problems related to integer programming

This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem, where one of the centers must be in P, and we solve it in \(O(n^2\log n)\) time. Second, we consider the mixed k-center problem, where m of the centers are in P, and we solve it in \(O(n^{m+O(\sqrt{k-m})})\) time. Motivated by two practical constraints, we propose two variations of the problem. Third, we present a 2-approximation algorithm and three heuristics solving the mixed k-center problem (\(k>2\)).     

A characterization of linearizable instances of the quadratic minimum spanning tree problem

We investigate special cases of the quadratic minimum spanning tree problem (QMSTP) on a graph \(G=(V,E)\) that can be solved as a linear minimum spanning tree problem. We give a characterization of such problems when G is a complete graph, which is the standard case in the QMSTP literature. We extend our characterization to a larger class of graphs that include complete bipartite graphs and cactuses, among others. Our characterization can be verified in \(O(|E|^2)\) time. In the case of complete graphs and when the cost matrix is given in factored form, we show that our characterization can be verified in O(|E|) time. Related open problems are also indicated.