试论民族法制现代化的路径选择

民族法制现代化是法制现代化的重要组成部分,是适应时代发展的需要。民族法制现代化在践行过程中有其固有的属性诉求,特别是民族性。满足、适应和推进民族法制现代化的路径是多元的,包括构建市民社会的理论视角、完善民族法制的形式合理性、促进人的现代化和少数民族本土法治资源的现代化转型。     

Two Variations of the Minimum Steiner Problem

Given a set S of starting vertices and a set T of terminating vertices in a graph G = (V,E) with non-negative weights on edges, the minimum Steiner network problem is to find a subgraph of G with the minimum total edge weight. In such a subgraph, we require that for each vertex s S and t T, there is a path from s to a terminating vertex as well as a path from a starting vertex to t. This problem can easily be proven NP-hard. For solving the minimum Steiner network problem, we first present an algorithm that runs in time and space that both are polynomial in n with constant degrees, but exponential in |S|+|T|, where n is the number of vertices in G. Then we present an algorithm that uses space that is quadratic in n and runs in time that is polynomial in n with a degree O(max {max {|S|,|T|}–2,min {|S|,|T|}–1}). In spite of this degree, we prove that the number of Steiner vertices in our solution can be as large as |S|+|T|–2. Our algorithm can enumerate all possible optimal solutions. The input graph G can either be undirected or directed acyclic. We also give a linear time algorithm for the special case when min {|S|,|T|} = 1 and max {|S|,|T|} = 2.The minimum union paths problem is similar to the minimum Steiner network problem except that we are given a set H of hitting vertices in G in addition to the sets of starting and terminating vertices. We want to find a subgraph of G with the minimum total edge weight such that the conditions required by the minimum Steiner network problem are satisfied as well as the condition that every hitting vertex is on a path from a starting vertex to a terminating vertex. Furthermore, G must be directed acyclic. For solving the minimum union paths problem, we also present algorithms that have a time and space tradeoff similar to algorithms for the minimum Steiner network problem. We also give a linear time algorithm for the special case when |S| = 1, |T| = 1 and |H| = 2.An extended abstract of part of this paper appears in Hsu et al. (1996).Supported in part by the National Science Foundation under Grants CCR-9309743 and INT-9207212, and by the Office of Naval Research under Grant No. N00014-93-1-0272.Supported in part by the National Science Council, Taiwan, ROC, under Grant No. NSC-83-0408-E-001-021.     

职业流动的途径及其相关因素对上海市劳动力市场的实证分析

“职业流动”是经济学和社会学共同关注的重要主题之一。对于这一现象,经济学家往往站在“理性人”的角度上,把劳动者解释为追求利益最大化的“理性”行动者(霍夫曼,1989:20),流动与否、采用何种途径流动以及相应的结果都是其理性决策的过程。在他们看来,劳动者的职业流动如果不是因为劳动力市场产生了职位空缺需要有人去填补(White, 1970; Tuma & Hannan, 1984),就是因为劳动者预计流动后的收益大于不流动的收益(陆铭,2002:135 137)。但在社会学家看来,这些解释显然不够充分,因为他们发现职业流动中劳动者的行为往往混杂着对非经济目标的…     

基于自适应迭代更新的函数型数据聚类方法研究

函数型数据的稀疏性和无穷维特性使得传统聚类分析失效。针对此问题,本文在界定函数型数据概念与内涵的基础上提出了一种自适应迭代更新聚类分析。首先,基于数据参数信息实现无穷维函数空间向有限维多元空间的过渡;在此基础上,依据变量信息含量的差异构建了自适应赋权聚类统计量,并依此为函数型数据的相似性测度进行初始类别划分;进一步地,在给定阈值限制下,对所有函数的初始类别归属进行自适应迭代更新,将收敛的优化结果作为最终的类别划分。随机模拟和实证检验表明,与现有的同类函数型聚类分析相比,文中方法的分类正确率显著提高,体现了新方法的相对优良性和实际问题应用中的有效性。     

中小私营企业文化存在的问题及对策

文章论述了中小私营企业在我国经济建设中的重要作用,对经验文化、家族文化、短视文化、用人文化、人治文化、鸡头文化产生的原因及其对中小私营企业发展的不良影响进行了剖析,并提出了中小私营企业建设现代企业文化的实现途径,即提高中小私营企业家的素质,使其发挥核心作用;培育以人为本的深层次企业文化;创建纵横立体互动的企业文化新体系。     

Lattice path counting and the theory of queues

In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like M^a/M^b/1$M^a/M^b/1$ systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto–Hahn model or systems with preemptive priorities.     

Parallelizing computation of expected values in recombinant binomial trees

Recombinant binomial trees are binary trees where each non-leaf node has two child nodes, but adjacent parents share a common child node. Such trees arise in option pricing in finance. For example, an option can be valued by evaluating the expected payoffs with respect to random paths in the tree. The cost to exactly compute expected values over random paths grows exponentially in the depth of the tree, rendering a serial computation of one branch at a time impractical. We propose a parallelization method that transforms the calculation of the expected value into an embarrassingly parallel problem by mapping the branches of the binomial tree to the processes in a multiprocessor computing environment. We also discuss a parallel Monte Carlo method and verify the convergence and the variance reduction behavior by simulation study. Performance results from R and Julia implementations are compared on a distributed computing cluster.     

网络视域下党反腐倡廉建设的现状与路径选择

信息时代下,网络反腐在党的反腐倡廉建设中具有参与主体广、信息传递快、舆论监督压力大等优势,对党的反腐倡廉建设有重要的作用。随着人民群众反腐期望值的持续上升,新时期党的网络反腐工作也遭遇了许多困境：网络监督的自发性和偶然性缺乏完善的执法制度规范;网络的隐蔽性和匿名性容易导致网络暴力,伤及无辜;网民的非理性参与行动容易破坏社会的安定团结。深入推进新时期反腐倡廉建设,一方面需要积极应对,充分利用网络新兴技术形成新的监督体系,另一方面需要正确认识网络反腐的局限性,加强制度创新,实现网络反腐与制度反腐有效对接。     

论在少数民族大学生中发展党员的多元意义及其培养路径

在少数民族大学生中发展党员,对提升少数民族大学生的政治素质,提高少数民族人才质量,培养民族干部,加强民族团结等许多方面都有着重要意义。要创新思路,拓宽培养路径,加大对少数民族大学生组织发展工作的力度。     

高职院校工学结合模式创新的障碍与突破路径

我国高职教育工学结合模式的形成受制于高职院校的“路径依赖”障碍和能力障碍以及企业的参与障碍。有效推动工学结合模式创新,关键是充分发挥院校和企业作为工学结合模式创新主体的作用。