Optimization of cable cycles : a trade-off between reliability and cost

This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.

Pupils' Interaction with the Exhibits According to the Learning Behaviour Model

Science centres are one of the best opportunities for informal study of natural science. There are many advantages to learn in the science centres compared with the traditional methods: it is possible to motivate and supply visitors with the social experience, to improve people’s understandings and attitudes, thereby bringing on and attaching wider interest towards natural science. In the science centres, pupils show interest, enthusiasm, motivation, self-confidence, sensitiveness and also they are more open and eager to learn. Traditional school-classes however mostly do not favour these capabilities. This research presents the qualitative study in the science centre. Data was gathered from observations and interviews at Science North science centre in Canada. Pupils’ learning behaviours were studied at different exhibits in the science centre. Learning behaviours are classified as follows: labels reading, experimenting with the exhibits, observing others or exhibit, using guide, repeating the activity, positive emotional response, acknowledged relevance, seeking and sharing information. In this research, it became clear that in general pupils do not read labels; in most cases pupils do not use the guides help; pupils prefer exhibits that enable high level of interactivity; pupils display more learning behaviours at exhibits that enable a high level of interactivity.

Using ant colonies for solve the multiprocessor task graph scheduling

The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allowed and each operation demands a setup time on the machines. The problem seeks to compose a schedule that minimizes the total completion time.We therefore rely on heuristics to find solutions since solution methods are not feasible for most problems as such. This novel heuristic searching approach to the multiprocessor based on the ACO algorithm a collection of agents cooperate to effectively explore the search space.A computational experiment is conducted on a suit of benchmark application. By comparing our algorithm result obtained to that of previous heuristic algorithm, it is evince that the ACO algorithm exhibits competitive performance with small error ratio.