Carbon Monoxide in the Cold Debris of Supernova 1987A

We report spectroscopic and imaging observations of rotational transitions of cold CO and SiO in the ejecta of SN1987A, the first such emission detected in a supernova remnant. In addition to line luminosities for the CO J=1-0, 2-1, 6-5, and 7-6 transitions, we present upper limits for all other transitions up to J=13-12, collectively measured from the Atacama Large Millimeter Array (ALMA), the Atacama Pathfinder EXperiment (APEX), and the Herschel Spectral and Photometric Imaging REceiver (SPIRE). Simple models show the lines are emitted from at least 0.01 solar masses of CO at a temperature > 14 K, confined within at most 35% of a spherical volume expanding at ~ 2000 km/s. Moreover, we locate the emission within 1'' of the central debris. These observations, along with a partial observation of SiO, confirm the presence of cold molecular gas within supernova remnants and provide insight into the physical conditions and chemical processes in the ejecta. Furthermore, we demonstrate the powerful new window into supernova ejecta offered by submillimeter observations.Comment: Accepted to the Astrophysical Journal Letters, 6 pages, 3 figure

Course Time Table Scheduling for a Local College

This study dive into the field of course time table scheduling for a local institution. The subject of the study will be a local college in Malaysia, in particular on the SEGi College branch in Penang. This covers the development of the prototype software which will enable the simulation of the course time table for both the students and lecturers. The prototype software will be on a local search approach with reference to Hill Climbing with Random Walk algorithm and Best First Search algorithm. This research enables users to increase efficiency and performance in developing a course time table. Later,this research will be proposed for implementation to the management of SEGi College branch in Penang

University space planning and space-type profiles

Universities planning the provision of space for their teaching requirements need to do so in a fashion that reduces capital and maintenance costs whilst still providing a high-quality level of service. Space plans should aim to provide sufficient capacity without incurring excessive costs due to over-capacity. A simple measure used to estimate over-provision is utilisation. Essentially, the utilisation is the fraction of seats that are used in practice, or the ratio of demand to supply. However, studies usually find that utilisation is low, often only 20–40%, and this is suggestive of significant over-capacity. Our previous work has provided methods to improve such space planning. They identify a critical level of utilisation as the highest level that can be achieved whilst still reliably satisfying the demand for places to allocate teaching events. In this paper, we extend this body of work to incorporate the notions of event-types and space-types. Teaching events have multiple ‘event-types’, such as lecture, tutorial, workshop, etc., and there are generally corresponding space-types. Matching the type of an event to a room of a corresponding space-type is generally desirable. However, realistically, allocation happens in a mixed space-type environment where teaching events of a given type are allocated to rooms of another space-type; e.g., tutorials will borrow lecture theatres or workshop rooms. We propose a model and methodology to quantify the effects of space-type mixing and establish methods to search for better space-type profiles; where the term “space-type profile” refers to the relative numbers of each type of space. We give evidence that these methods have the potential to improve utilisation levels. Hence, the contribution of this paper is twofold. Firstly, we present informative studies of the effects of space-type mixing on utilisation, and critical utilisations. Secondly, we present straightforward though novel methods to determine better space-type profiles, and give an example in which the resulting profiles are indeed significantly improved. <br/

A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling

A university course timetabling problem is a combination of optimization problems. The problems are more challenging when a set of events need to be scheduled in the time slot, to be located to the suitable rooms, which is subjected to several sets of hard and soft constraints. All these constraints that exist as regulations within each resource for the event need to be fulfilled in order to achieve the optimum tasks. In addition, the design of course timetables for universities is a very difficult task because it is a non-deterministic polynomial, (NP) hard problem. This problem can be minimized by using a Micro Genetic Algorithm approach. This approach, encodes a chromosome representation as one of the key elements to ensure the infeasible individual chromosome produced is minimized. Thus, this study proposes an encoding chromosome representation using one-dimensional arrays to improve the Micro Genetic algorithm approach to soft constraint problems in the university course schedule. The research contribution of this study is in developing effective and feasible timetabling software using Micro Genetic Algorithm approach in order to minimize the production of an infeasible individual chromosome compared to the existing optimization algorithm for university course timetabling where UNITAR International University have been used as a data sample. The Micro Genetic Algorithm proposed has been tested in a test comparison with the Standard Genetic algorithm and the Guided Search Genetic algorithm as a benchmark. The results showed that the proposed algorithm is able to generate a minimum number of an infeasible individual chromosome. The result from the experiment also demonstrated that the Micro Genetic Algorithm is capable to produce the best course schedule to the UNITAR International University

Comparing league formats with respect to match importance in Belgian football

Recently, most clubs in the highest Belgian football division have become convinced that the format of their league should be changed. Moreover, the TV station that broadcasts the league is pleading for a more attractive competition. However, the clubs have not been able to agree on a new league format, mainly because they have conflicting interests. In this paper, we compare the current league format, and three other formats that have been considered by the Royal Belgian Football Association. We simulate the course of each of these league formats, based on historical match results. We assume that the attractiveness of a format is determined by the importance of its games; our importance measure for a game is based on the number of teams for which this game can be decisive to reach a given goal. Furthermore, we provide an overview of how each league format aligns with the expectations and interests of each type of club

Toughening of ceramic shell mould with rice husk fiber (CSm-RH) to improve strength property and mould performance

For ages, ceramic shell mould (CSm) have been extensively applied in investment casting industry. The formation of CSm requires multiple steps of dipping, layering drying and firing stages. The later steps are very crucial as the solidification thin layer CSm that consist of loose ceramic particles easily cracks when exposed to the higher thermal effect. The inclusion of fiber or any reinforces phases is able to enhance fired ceramic body and also strengthen the green ceramic structure. Thus, the feasibility of rougher NaOH treated rice husk fiber (RHT) prior embedded into composited structure has shown a significant CSm improvement by induced a better adhesion properties and larger bonding area with brittle ceramic matrix, resulted in increased green strength (1.34 MPa) and fired body strength (4.32 MPa). Owing to the decomposed of lignin layer in CSm with untreated rice husk fiber (CSm-RHU) exhibited a higher porosity that provide a better permeation paths of air flow during molten metal pouring as increased 30 % from the standard CSm permeability, giving an enormous benefit for investment casting cooling process. Overall, the incorporation of RHT fiber in a CSm matrix of both green and fired body governed in toughening of brittle ceramic body, hence avoid failure to the casting mould

Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can operate with greater generality than is currently possible. The basic idea behind this is that we maintain a case base of information about the most successful heuristics for a range of previous timetabling problems to predict the best heuristic for the new problem in hand using the previous knowledge. Knowledge discovery techniques are used to carry out the training on the CBR system to improve the system performance on the prediction. Initial results presented in this paper are good and we conclude by discussing the con-siderable promise for future work in this area

Solving Challenging Real-World Scheduling Problems

This work contains a series of studies on the optimization of three real-world scheduling problems, school timetabling, sports scheduling and staff scheduling. These challenging problems are solved to customer satisfaction using the proposed PEAST algorithm. The customer satisfaction refers to the fact that implementations of the algorithm are in industry use. The PEAST algorithm is a product of long-term research and development. The first version of it was introduced in 1998. This thesis is a result of a five-year development of the algorithm. One of the most valuable characteristics of the algorithm has proven to be the ability to solve a wide range of scheduling problems. It is likely that it can be tuned to tackle also a range of other combinatorial problems. The algorithm uses features from numerous different metaheuristics which is the main reason for its success. In addition, the implementation of the algorithm is fast enough for real-world use.Siirretty Doriast