Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.     

电子文件对中国档案事业生态环境的影响*

中国档案事业生态环境主要包括政治、经济、法律、科技、人文等档案事业生存和发展的现实社会环境要素。以电子文件为基本单元的信息技术的飞速发展和普及,大大改善了中国档案事业的生态环境,同时也带来了新的挑战。     

An ERP study for the degrees of the difficulty in visual search

The present study mainly probed the relationships between ERP components and the degrees of difficulty in visual search. Three experimental and one controlled conditions were randomly selected. Results showed that the P1, N1, and P2 amplitudes and latencies had no significant differences among the three experimental and one controlled conditions, and the ERP waveforms of low perceptual load of visual search were different from that of high perceptual load. These results might indicate that the latencies and amplitudes of initial P1, N1 and P2 in high and low perceptual load conditions were almost the same. The ERP waveforms of parallel search were very different from that of serial search, and the ERP waveforms of serial search were very similar. The P3 amplitudes increased as the degrees of the difficulty in visual search decreased.     

基于改进的模糊核C-均值算法在商业银行客户细分中的应用

随着商业银行信息化进程中数据集中阶段任务的完成,各商业银行将面临如何从大量的数据中提取有价值的信息和知识以提高企业决策质量和市场竞争力,数据挖掘技术的出现使企业“数据变知识”成为可能。文章主要结合商业银行的实际,探讨了核聚类方法在提高银行服务成功率等方面的应用。     

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

流量管理中信息重发问题的研究

信息重发在通信网络中广泛存在。通过对信息重发问题的研究，建立了概率模型，分析了信息到达流的各种性质，得到了到达间隔时间的分布及平均到达速率等重要性能指标，利用数值实验对理论结论进行了验证。所得结果对网络流量管理和拥塞控制有一定的参考价值。     

关于非平行板电容器电容计算的讨论

用串联方法计算非平行板电容器的电容，简便地得到与其他方法相同的结果。     

试题质量评价研究

教学过程的规范化管理是保证教学质量的重要手段。考试是对教和学的效果的检验，是教学过程管理规范化必须要解决的问题，一直受到教学管理部门的重视，采取了多项措施解决有关问题，其中一个重要的手段是采用试题库。在采用试题库时，必须要有高质量的试题作保证。本探讨基于KDD技术的试题质量评价方法和指标，并通过实例来说明其有效性。