基于学习曲线的ERP实施培训时间决策模型

通过分析ERP项目的特点,将学习曲线引入到ERP实施的研究中,基于学习曲线理论刻画企业的工作效率随项目时间变化的规律.在此基础上,将ERP项目抽象为前期的培训和后期的具体实施两个阶段,以项目实施周期和咨询成本最小为目标,建立ERP实施培训时间决策模型,通过培训时间控制并预测ERP项目的整体周期,进一步利用遗传算法对模型进行优化求解.为区分信息化基础不同的企业在项目初期工作效率的差异,在模型中加入初始工作效率这一变量,通过企业的信息化基础水平间接地测算企业的初始工作效率;结合行为导向的实证研究结果,在模型中限定培训时间的取值范围,解决多个近似解之间的取舍问题.案例研究表明,模型在实际应用中可以起到较好的优化和预测效果,能够为企业制定ERP项目计划和投资预算提供决策支持.     

基于协同效应的知识创新团队伙伴选择方法

在知识创新团队的伙伴选择问题中着重考虑了伙伴间的协同效应信息。首先,分析了伙伴之间的协同关系与协同效应,描述了考虑多个协同效应评价指标的知识创新团队伙伴选择问题;然后,建立了团队伙伴选择的数学模型,该模型是一个0-1二次整数规划问题,为了求解该问题,开发了一种GRASP启发式算法;最后,通过一个实例分析说明了所提出方法的可行性和实际应用价值。     

带工期指派的产品服务系统订单随机调度问题研究

针对由一个制造工厂和多个区域服务中心组成的服务型制造企业,研究了考虑生产时间和服务时间均具有随机性且工期可指派的产品服务系统（PSS）订单调度问题。首先以最小化订单提前、误工和工期指派费用的期望总额为目标构建问题的优化模型,然后分析目标函数近似值的最优性条件,据此提出加权最短平均生产时间排序规则,并结合该规则与插入邻域局部搜索设计了启发式算法对问题进行求解,最后通过数值仿真验证算法的可行性和有效性。研究表明,提前费用偏差对PSS订单调度与工期指派决策的影响很小,因此企业管理者无需准确估计库存费用也能制定出比较有效的PSS订单调度策略;而工期指派费用偏差对决策结果的影响非常大,因此企业管理者在决策时必须谨慎估计该项费用。     

Throughput and delay analysis of an opportunistic tree algorithm

Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.

We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.

Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users.     

以灵活多样的教学方法彰显马克思主义哲学的理论魅力

对马克思主义哲学课面临困境的原因进行分析;对立统一是该理论的灵魂;探索以讲授法为主,辅以启发式教学法、案例教学法、多媒体技术等灵活多样的方法,增强该课的吸引力.     

Quantifying the similarity of 2D images using edge pixels: an application to the forensic comparison of footwear impressions

We propose a novel method to quantify the similarity between an impression (Q) from an unknown source and a test impression (K) from a known source. Using the property of geometrical congruence in the impressions, the degree of correspondence is quantified using ideas from graph theory and maximum clique (MC). The algorithm uses the x and y coordinates of the edges in the images as the data. We focus on local areas in Q and the corresponding regions in K and extract features for comparison. Using pairs of images with known origin, we train a random forest to classify pairs into mates and non-mates. We collected impressions from 60 pairs of shoes of the same brand and model, worn over six months. Using a different set of very similar shoes, we evaluated the performance of the algorithm in terms of the accuracy with which it correctly classified images into source classes. Using classification error rates and ROC curves, we compare the proposed method to other algorithms in the literature and show that for these data, our method shows good classification performance relative to other methods. The algorithm can be implemented with the R package shoeprintr.     

考虑风险规避的秘书问题求解的一个启发式方法

秘书问题是一类序贯观察与选择问题,描述了动态的信息搜索与决策过程.针对现有的以寻找满意解为目标的启发式方法存在诸多局限,提出了新的启发式方法,该方法基于当前观测中侯选项在已观察侯选项中的相对排名、待观测侯选项数量以及决策者的抱负水平,决策者可以通过设定抱负水平灵活决定该启发式方法的结果导向.推导了该启发式方法的性能指标,并通过仿真的方法与已有启发式方法的性能进行了比较.结果发现,该启发式方法在最终选择的侯选项的期望排名和稳定性,以及风险解的避免上均优于已有的启发式方法.     

An upper bound on the minimal total cost of the transportation problem with varying demands and supplies

In general cases, to find the exact upper bound on the minimal total cost of the transportation problem with varying demands and supplies is an NP-hard problem. In literature, there are only two approaches with several shortcomings to solve the problem. In this paper, the problem is formulated as a bi-level programming model, and proven to be solvable in a polynomial time if the sum of the lower bounds for all the supplies is no less than the sum of the upper bounds for all the demands; and a heuristic algorithm named TPVDS-A based on genetic algorithm is developed as an efficient and robust solution method of the model. Computational experiments on benchmark and new randomly generated instances show that the TPVDS-A algorithm outperforms the two existing approaches.     

Evaluation of multi-objective optimization approaches for solving green supply chain design problems

This paper evaluates the applicability of different multi-objective optimization methods for environmentally conscious supply chain design. We analyze a case study with three objectives: costs, CO₂ and fine dust (also known as PM – Particulate Matters) emissions. We approximate the Pareto front using the weighted sum and epsilon constraint scalarization methods with pre-defined or adaptively selected parameters, two popular evolutionary algorithms, SPEA2 and NSGA-II, with different selection strategies, and their interactive counterparts that incorporate Decision Maker׳s (DM׳s) indirect preferences into the search process. Within this case study, the CO₂ emissions could be lowered significantly by accepting a marginal increase of costs over their global minimum. NSGA-II and SPEA2 enabled faster estimation of the Pareto front, but produced significantly worse solutions than the exact optimization methods. The interactive methods outperformed their a posteriori counterparts, and could discover solutions corresponding better to the DM preferences. In addition, by adjusting appropriately the elicitation interval and starting generation of the elicitation, the number of pairwise comparisons needed by the interactive evolutionary methods to construct a satisfactory solution could be decreased.     

A comparison of nonparametric priors in hierarchical mixture modelling for AFT regression

We will pursue a Bayesian nonparametric approach in the hierarchical mixture modelling of lifetime data in two situations: density estimation, when the distribution is a mixture of parametric densities with a nonparametric mixing measure, and accelerated failure time (AFT) regression modelling, when the same type of mixture is used for the distribution of the error term. The Dirichlet process is a popular choice for the mixing measure, yielding a Dirichlet process mixture model for the error; as an alternative, we also allow the mixing measure to be equal to a normalized inverse-Gaussian prior, built from normalized inverse-Gaussian finite dimensional distributions, as recently proposed in the literature. Markov chain Monte Carlo techniques will be used to estimate the predictive distribution of the survival time, along with the posterior distribution of the regression parameters. A comparison between the two models will be carried out on the grounds of their predictive power and their ability to identify the number of components in a given mixture density.