树立全方位的可持续发展观

可持续发展,从全方位看,不限于人与自然的关系,还意味着经济、社会、文化与自然之间的协调和和谐发展.因此,除人口、资源和生态、环境问题外,必须关注经济的持续增长和发展问题、社会的进步和可持续问题,这些都相互依存,不能相互替代.可持续发展是一个大概念,一定要多管齐下,整体推进.     

Prevalence and correlates of problematic gambling among Danish adolescents

This study reports the findings from a national survey on gambling behaviour among Danish primary school children. A questionnaire was administered to 2,223 primary school students ranging in age from 11 to 17 years. The questionnaire contained a gambling screen (SOGS‐RA) and items that measure gambling behaviour, social network and cognitive perceptions. The prevalence of problem gambling was 1.29 per cent, while 4.5 per cent were categorised as at‐risk gamblers. The three most frequently reported reasons for gambling were to win money, to have fun and to socialise with family and friends. It is suggested that gambling may be linked to a masculine universe and that at‐risk gambling behaviour patterns may be part of a normal adolescent life in which gambling serves recreational or leisure purposes. Implications for further research and preventive measures are discussed.     

论私营经济对生产力的兼容性

一定生产关系的物质基础不是一类型的生产力，而是多层次多类型生产力体系，我国私营经济存在的客观物质基础既不是人们常说的是生产力落后，也不是单一的机器大工业，而是包括发达的手工业、机器大工业、社会化大生产在内的多层次生产力。因而，在我国社会生产力还滑有发生更大突破而入更高类型的生产力以前，私营经济是不可能灭亡的。     

A Class of Markov Chain Models for Average Run Length Computations for Autocorrelated Processes

The average run length (ARL) of conventional control charts is typically computed assuming temporal independence. However, this assumption is frequently violated in practical applications. Alternative ARL computations have often been conducted via time consuming and yet not necessarily very accurate simulations. In this article, we develop a class of Markov chain models for evaluating the run length performance of traditional control charts for autocorrelated processes. We show extensions from the univariate AR(1) model to the general multivariate VARMA(p, q) time series. The results of the proposed method are highly comparable to those of simulations and with significantly less computational overhead.     

关于马克思主义文学批评的当代形态

当代文学批评形态的变革与重建，正形成“主导多元”的格局。当今建构的主要任务，在于“主导”形态的建构，这一主导形态即马克思主义文学批评的当代形态。应在总结本世纪马克思主义文学批评“中国化”的成果和经验的基础上，联系当今我国现代化的具体实践，将原来中国化马克思主义批评所依据的认知论哲学与社会学统一的理论基点，调整转换到马克思主义实践论哲学与人学统一的理论基点上来，进而走向文学批评观念的系统整合。这种系统整合的基本框架，可设想为主体论、本体论与价值论的有机统一。     

Offshoring practices of Danish and Swedish SMEs: effects on operations configuration

This paper examines how small and medium enterprises (SMEs) configure their operations on the global scale and how this affects their home bases in terms of operations requirements and priorities. In order to relate SMEs’ offshoring initiatives with their operations configuration attributes, we draw on the operations networks literature and survey responses from 675 Danish and 410 Swedish companies. On the basis of the survey results, we find that although the SMEs are less experienced and less advanced in their offshoring ventures than large companies, they are building dispersed operations networks. Although still in their infancy, these networks are, as expected, creating new demands for their home bases in terms of demands for formalisation of work processes, systems development and managerial capability related to orchestrating operations across national borders, but more fundamentally, it also challenges the strategic foundations of the home base. Based on these observations, we discuss future global operations management challenges, practices and priorities of SMEs.     

三层组织内的串谋理论分析

引入监督层,建立了三层层级组织结构模型,并对这种结构中可能存在的串谋行为进行了分析;利用成本利益分析方法对委托人是否要雇佣监督者和是否要关心串谋作了分析和论证.     

不只是形式的论争——关于《雅歌》的诗歌体式

关于《圣经》中的《雅歌》究竟应该界定为哪种诗歌体式 ,文学史上向来见仁见智 ,莫衷一是。“恋歌集”、“牧歌”、“戏剧”是较有代表性的三种说法。然而 ,从诗作者的精神状态、象征手法的运用、象征手法与寓意法的关系等角度审视 ,似应将《雅歌》认定是一卷象征体的长篇抒情诗。     

Scheduling with interjob communication on parallel processors

Consider a scheduling problem in which a set of tasks needs to be scheduled on m parallel processors. Each task \(T_i\) consists of a set of jobs with interjob communication demands, represented by a weighted, undirected graph \(G_i\). The processors are assumed to be interconnected by a shared communication channel, which can be used by jobs to communicate among each other while being processed in parallel. In each time step, the scheduler assigns jobs to the processors and allows any processed job to use a certain capacity of the channel in order to satisfy (parts of) its communication demands to adjacent jobs processed in the same step. The goal is to find a schedule with minimum length in which the communication demands of all jobs are satisfied. We show that this problem is NP-hard in the strong sense even if the number of processors is constant and the underlying graph is a single path or a forest with arbitrary constant maximum degree. Consequently, we design and analyze approximation algorithms with asymptotic approximation ratio \(\min \{1.8, 1.5 \frac{m}{m-1}\}+1\) if the underlying graph G, the union of the \(G_i\), is a forest. For general graphs it is \(\min \left\{ 1.8, \frac{1.5m}{m-1}\right\} \cdot \left( \text {arb}(G) + \frac{5}{3}\right) \), where \(\text {arb}(G)\) denotes the arboricity of G.