一种求解双目标flow shop排序问题的进化算法

提出一种求解双目标flow shop排序的递进多目标进化算法.算法采用改进的精英复制策略,在实现精英保留的前提下降低了计算复杂性;通过递进进化模式增加群体多样性,改善了算法收敛性;通过群体进化过程中对非劣解集进行竞争型可变邻域启发式搜索,增强了算法局部搜索性能.采用新算法和参照算法NSGA-II对31个标准双目标flow shop算例进行优化.研究结果表明,新算法在所有算例的求解中均获得了优于NSGA-II的非劣解集,验证了算法的有效性.     

Cell-to-switch level planning in mobile wireless networks for efficient management of radio resources

A major step in effectively managing radio resources in a cellular network is to design an appropriate scheme for assigning cells to a location area (LA), serviced by a switch, and allocate resources for individual switches. However, this assignment is already proven in the literature to be an NP-hard problem [Merchant A, Sengupta B. Assignment of cells to switches in PCS networks. IEEE/ACM Transactions on Networking 3(5) (1995) 521–6] that requires efficient heuristic search techniques for obtaining real-time solutions. This work presents a state-space search technique, which is a variant of best first search heuristic technique. The algorithm called the block depth first search (BDFS), allocates cells to switches during switch level resource planning. Under various simulated performance criteria, we compare the performance of the proposed technique with other similar procedures in the literature. Our results indicate that the BDFS outperforms the meta-heuristic procedures in terms of both efficiency and quality of solutions. Hence, we conclude that our proposed technique can be effectively used for switch level planning leading to an efficient management of scarce radio resource in cellular networks.     

On edge orienting methods for graph coloring

We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge orienting problem is equivalent to finding the chromatic number of a graph. We study various properties of edge orienting methods in the context of local search for graph coloring. We then exploit these properties to derive four tabu search algorithms, each based on a different neighborhood. We compare these algorithms numerically to determine which are the most promising and to give potential research directions.     

利用和声分散搜索算法解决动态共乘的乘客选择研究

动态共乘作为一种配合解决城市交通出行难题的新模式近年来引起了人们越来越多的关注，然而在较大范围内选择合适的乘客，以便获得最佳的综合服务效果却具有相当大的挑战性。本文正是针对这一问题，建立了以乘客效用最大化和司机总行程最短为目标函数，以满足司机与乘客的时间要求和司机参与约束为限制条件的多目标0-1规划共乘模型，用于帮助司机选择最合适的乘客。根据该模型的特点，构造了加入了分散搜索机制的新的和声搜索算法。在仿真实验时，针对司机和乘客效用的两种产生方式，在较大规模的路网环境下利用该算法分别对模型进行了求解，得到了Pareto最优解集。仿真结果不仅表明了模型的合理性和算法的可行性，而且还指出基于效用函数可以发现更多合适的潜在乘客。最后，通过与文献中其它算法的对比进一步展示了本文算法的有效性。     

基于柔性资源约束的前摄性项目调度优化研究

不确定环境中，项目进度计划鲁棒性的高低直接影响项目能否顺利实施。本文研究了具有随机活动工期的柔性资源约束下的前摄性项目调度优化问题，目标是在柔性资源和项目工期的约束下，借助对活动开始时间合理的进行安排进而得到拥有最大鲁棒性的进度计划。首先对研究问题进行界定；随后构建优化模型，并根据问题NP-hard属性和模型特点设计了双层嵌套禁忌搜索启发式算法，通过内外两层交互搜索寻找满意解；最后通过一个实际案例对本文研究进行说明，并分析关键参数对进度计划鲁棒性的影响，得到如下结论：相对于资源无柔性情况下的项目进度计划而言，资源具备柔性后得到的项目进度计划的鲁棒性更高，具有更强的抗干扰能力，能够保证项目稳定执行；同时，项目进度计划鲁棒性分别随着项目工期的延长、资源可用量的增加或资源柔性的提高而上升。     

Sparse Bayesian variable selection in multinomial probit regression model with application to high-dimensional data classification

Here we consider a multinomial probit regression model where the number of variables substantially exceeds the sample size and only a subset of the available variables is associated with the response. Thus selecting a small number of relevant variables for classification has received a great deal of attention. Generally when the number of variables is substantial, sparsity-enforcing priors for the regression coefficients are called for on grounds of predictive generalization and computational ease. In this paper, we propose a sparse Bayesian variable selection method in multinomial probit regression model for multi-class classification. The performance of our proposed method is demonstrated with one simulated data and three well-known gene expression profiling data: breast cancer data, leukemia data, and small round blue-cell tumors. The results show that compared with other methods, our method is able to select the relevant variables and can obtain competitive classification accuracy with a small subset of relevant genes.     

中国先秦哲学党性质疑

中西方哲学原本有着不同的反思基础：欧洲是以探索知识和主客体关系为基础的求知哲学，中国早期则是以关怀道德修养和国家治理为基础的伦理哲学．故不宜把思路方向和内容各不相同的哲学用同一标准划分党派。先秦哲学，特别是孔子和老子的思想特征表明，这种哲学侧重的是人生、社会及以社会伦理为着眼点面对事物运动规律的研究。我们习惯于以唯物、唯心为判断定势，将先秦哲学家划线的做法是不适宜的。     

科技正义与法之正义关系的辨析

改革开放后,我国的科技发展模式由行政计划模式向市场法治模式过渡,市场经济使科技主体与立法主体的正义观发生巨大变化,进而导致科技法的正义内涵也在发生着演化.科技产生的社会问题激化了伦理道德与实在法之间的矛盾,立法者亟须发掘当代科技的正义内涵,并适时创制或修订科技法,以适应新形势的要求.应从正义内涵入手,拓展科技的正义价值观,为整合科技法的价值目标提供理论基础,并且探析科技引发现行法弊端的解决途径.     

促进高校科技成果转化之法律环境研究

我国高校科技成果转化率十分低下，不利于经济的健康发展。分析我国高校科技成果转化率低下的原因，不难发现，我国法律制度存在着诸多错误和不足。本文通过对国外高校科技成果转化过程中政府立法经验的分析借鉴，最后提出提高我国高校科技成果转化率的立法建议。     

A variable selection approach to monotonic regression with Bernstein polynomials

One of the standard problems in statistics consists of determining the relationship between a response variable and a single predictor variable through a regression function. Background scientific knowledge is often available that suggests that the regression function should have a certain shape (e.g. monotonically increasing or concave) but not necessarily a specific parametric form. Bernstein polynomials have been used to impose certain shape restrictions on regression functions. The Bernstein polynomials are known to provide a smooth estimate over equidistant knots. Bernstein polynomials are used in this paper due to their ease of implementation, continuous differentiability, and theoretical properties. In this work, we demonstrate a connection between the monotonic regression problem and the variable selection problem in the linear model. We develop a Bayesian procedure for fitting the monotonic regression model by adapting currently available variable selection procedures. We demonstrate the effectiveness of our method through simulations and the analysis of real data.