Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases

In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items brought together in a sufficient number of transactions. We revise a graph-based algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our algorithms. The revised algorithm is a significant improvement over the original one on mining association rules. The algorithms for maintaining association rules are more efficient than re-running the mining algorithms for the whole updated database and outperform previously proposed algorithms that need multiple passes over the database. Received 4 August 1999 / Revised 18 March 2000 / Accepted in revised form 18 October 2000     

计算机维修模拟训练系统的设计与实现

探索了一种在多媒体环境下进行计算机及外部设备维修教学、训练的新方法 ,介绍了计算机维修模拟训练系统的设计与实现 ,给出了主要的设计思想、总体结构及关键技术。     

Note on “Unrelated parallel-machine scheduling with deteriorating maintenance activities”

In this note, we prove that both problems studied by Cheng et al. [Cheng, T. C. E., Hsu, C.-J., & Yang, D.-L. (2011). Unrelated parallel-machine scheduling with deteriorating maintenance activities. Computers and Industrial Engineering, 60, 602–605] can be solved in O(n^m+3) time no matter what the processing time of a job after a maintenance activity is greater or less than its processing time before the maintenance activity, where m is the number of machines and n is the number of jobs.     

Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

This research focuses on the problem of scheduling jobs on a single machine that requires periodic maintenance with the objective of minimizing the number of tardy jobs. We present a two-phase heuristic algorithm in which an initial solution is obtained first with a method modified from Moore's algorithm for the problem without maintenance and then the solution is improved in the second phase. Performance of the proposed heuristic algorithm is evaluated through computational experiments on randomly generated problem instances and results show that the heuristic gives solutions close to those obtained from a commercial integer programming solver in much shorter time and works better than an existing heuristic algorithm in terms of the solution quality.     

How to take into account general and contextual knowledge for interactive aiding design: Towards the coupling of CSP and CBR approaches

The goal of this paper is to show how it is possible to support design decisions with two different tools relying on two kinds of knowledge: case-based reasoning operating with contextual knowledge embodied in past cases and constraint filtering that operates with general knowledge formalized using constraints. Our goals are, firstly to make an overview of existing works that analyses the various ways to associate these two kinds of aiding tools essentially in a sequential way. Secondly, we propose an approach that allows us to use them simultaneously in order to assist design decisions with these two kinds of knowledge. The paper is organized as follows. In the first section, we define the goal of the paper and recall the background of case-based reasoning and constraint filtering. In the second section, the industrial problem which led us to consider these two kinds of knowledge is presented. In the third section, an overview of the various possibilities of using these two aiding decision tools in a sequential way is drawn up. In the fourth section, we propose an approach that allows us to use both aiding decision tools in a simultaneous and iterative way according to the availability of knowledge. An example dealing with helicopter maintenance illustrates our proposals.     

Human and program factors affecting the maintenance of programs with deployed design patterns

Context

Practitioners may use design patterns to organize program code. Various empirical studies have investigated the effects of pattern deployment and work experience on the effectiveness and efficiency of program maintenance. However, results from these studies are not all consistent. Moreover, these studies have not considered some interesting factors, such as a maintainer’s prior exposure to the program under maintenance.

Objective

This paper aims at identifying what factors may contribute to the productivity of maintainers in the context of making correct software changes when they work on programs with deployed design patterns.

Method

We performed an empirical study involving 118 human subjects with three change tasks on a medium-sized program to explore the possible effects of a suite of six human and program factors on the productivity of maintainers, measured by the time taken to produce a correctly revised program in a course-based setting. The factors we studied include the deployment of design patterns and the presence of pattern-unaware solutions, as well as the maintainer’s prior exposure to design patterns, the subject program and the programming language, and prior work experience.

Results

Among the factors under examination, we find that the deployment of design patterns, prior exposure to the program and the presence of pattern-unaware solutions are strongly correlated with the time taken to correctly complete maintenance tasks. We also report some interesting observations from the experiment.

Conclusion

A new factor, namely, the presence of pattern-unaware solutions, contributes to the efficient completion of maintenance tasks of programs with deployed design patterns. Moreover, we conclude from the study that neither prior exposure to design patterns nor prior exposure to the programming language is supported by sufficient evidences to be significant factors, whereas the subjects’ exposure to the program under maintenance is notably more important.     

文峪河灌区节水改造工程铸铁闸门与螺杆式启闭机施工技术探讨

通过对文峪河灌区节水改造配套工程铸铁闸门与螺杆式启闭机施工这一工程实例,简单介绍铸铁闸门与螺杆式启闭机新施工方法、新安装步骤及调试与保养。     

大中型水电站机电工程质量全过程控制的主要措施

水电站机电工程质量控制,对确保按照设计质量要求生产供货、按照规范标准安装试验、确保电站安全稳定运行、提高经济收益有着重要的意义。但是,质量控制是一个系统全面、不断进步的工作,需要我们不断探索,不断进步。     

浅谈校园网的规划设计与管理

随着网络技术迅速发展,校园网的建设已成为各级各类学校实现教育现代化、管理信息自动化不可缺少的基础设施之一。概述了校园网的规划设计方法,对校园网的硬件和软件的设施提出了需求,最后介绍了校园网的安全、故障维护和流量管理的方法,并对校园网的日常管理维护提出了自己的见解。     

改进的约束多目标粒子群算法

在约束优化问题搜索空间分析的基础上提出了一种改进的约束多目标粒子群算法（CMOPSO）。提出一种动态ε不可行度许可约束支配关系作为主要约束的处理方法,提高了算法的边缘搜索能力和跨越非联通可行区域的能力。设计了一种新的密集距离度量方法用于外部档案维护,提高了算法的效率;提出了新的全局向导选取策略,使算法获得了更好的收敛性和多样性。数值仿真实验结果表明约束多目标粒子群算法算法可得到分布性、均匀性及逼近性都较好的Pareto最优解。