Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Simulated annealing (2)
- Timetabling problem (2)
- Agile satellite scheduling (1)
- Cross-lingual information retrieval (1)
- Formal executable semantics (1)
-
- Genetic Algorithm (1)
- GitHub (1)
- Hybrid algorithm (1)
- Improvement heuristic algorithm (1)
- Iterated local search (1)
- K framework (1)
- Language model (1)
- Latent Dirichlet Allocation (1)
- Mathematical programming (1)
- Mathematical programming model (1)
- Multimodality (1)
- Near-duplicate keyframes (1)
- News videos (1)
- Novelty and redundancy detection (1)
- OpenPLC (1)
- PLC programming (1)
- Similarity measure (1)
- Structured text (1)
- Tabu search (1)
- Teacher assignment (1)
- Time-dependent profits (1)
- Time-dependent transition time (1)
- Timetabling (1)
Articles 1 - 8 of 8
Full-Text Articles in Theory and Algorithms
K-St: A Formal Executable Semantics Of The Structured Text Language For Plcs, Kun Wang, Jingyi Wang, Christopher M. Poskitt, Xiangxiang Chen, Jun Sun, Peng Cheng
K-St: A Formal Executable Semantics Of The Structured Text Language For Plcs, Kun Wang, Jingyi Wang, Christopher M. Poskitt, Xiangxiang Chen, Jun Sun, Peng Cheng
Research Collection School Of Computing and Information Systems
Programmable Logic Controllers (PLCs) are responsible for automating process control in many industrial systems (e.g. in manufacturing and public infrastructure), and thus it is critical to ensure that they operate correctly and safely. The majority of PLCs are programmed in languages such as Structured Text (ST). However, a lack of formal semantics makes it difficult to ascertain the correctness of their translators and compilers, which vary from vendor-to-vendor. In this work, we develop K-ST, a formal executable semantics for ST in the K framework. Defined with respect to the IEC 61131-3 standard and PLC vendor manuals, K-ST is a high-level …
Agile Earth Observation Satellite Scheduling: An Orienteering Problem With Time-Dependent Profits And Travel Times, Guansheng Peng, Reginald Dewil, Cédric Verbeeck, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen
Agile Earth Observation Satellite Scheduling: An Orienteering Problem With Time-Dependent Profits And Travel Times, Guansheng Peng, Reginald Dewil, Cédric Verbeeck, Aldy Gunawan, Lining Xing, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
The scheduling problem of an Agile Earth Observation Satellite is to schedule a subset of weighted observation tasks with each a specific “profit” in order to maximize the total collected profit, under its operational constraints. The “time-dependent transition time” and the “time-dependent profit” are two crucial features of this problem. The former relates to the fact that each pair of consecutive tasks requires a transition time to maneuver the look angle of the camera from the previous task to the next task. The latter follows from the fact that a different look angle of an observation leads to a different …
Cataloging Github Repositories, Abhishek Sharma, Ferdian Thung, Pavneet Singh Kochhar, Agus Sulistya, David Lo
Cataloging Github Repositories, Abhishek Sharma, Ferdian Thung, Pavneet Singh Kochhar, Agus Sulistya, David Lo
Research Collection School Of Computing and Information Systems
GitHub is one of the largest and most popular repository hosting service today, having about 14 million users and more than 54 million repositories as of March 2017. This makes it an excellent platform to find projects that developers are interested in exploring. GitHub showcases its most popular projects by cataloging them manually into categories such as DevOps tools, web application frameworks, and game engines. We propose that such cataloging should not be limited only to popular projects. We explore the possibility of developing such cataloging system by automatically extracting functionality descriptive text segments from readme files of GitHub repositories. …
Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng
Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng
Research Collection School Of Computing and Information Systems
The timetabling problem arising from a university in Indonesia is addressed in this paper.It involves the assignment of teachers to the courses and course sections. We formulate theproblem as a mathematical programming model. Two different algorithms, mainly basedon simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving theproblem. The proposed algorithms consist of two phases. The first phase involves allocatingthe teachers to the courses and determining the number of courses to be assigned to eachteacher. The second phase involves assigning the teachers to the course sections in order tobalance the teachers’ load. The performance of the proposed …
Novelty Detection For Cross-Lingual News Stories With Visual Duplicates And Speech Transcripts, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
Novelty Detection For Cross-Lingual News Stories With Visual Duplicates And Speech Transcripts, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
An overwhelming volume of news videos from different channels and languages is available today, which demands automatic management of this abundant information. To effectively search, retrieve, browse and track cross-lingual news stories, a news story similarity measure plays a critical role in assessing the novelty and redundancy among them. In this paper, we explore the novelty and redundancy detection with visual duplicates and speech transcripts for cross-lingual news stories. News stories are represented by a sequence of keyframes in the visual track and a set of words extracted from speech transcript in the audio track. A major difference to pure …
Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska
Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska
Research Collection School Of Computing and Information Systems
Traditional supervised classification algorithms require a large number of labelled examples to perform accurately. Semi-supervised classification algorithms attempt to overcome this major limitation by also using unlabelled examples. Unlabelled examples have also been used to improve nearest neighbour text classification in a method called bridging. In this paper, we propose the use of bridging in a semi-supervised setting. We introduce a new bridging algorithm that can be used as a base classifier in any supervised approach such as co-training or selflearning. We empirically show that classification performance increases by improving the semi-supervised algorithm’s ability to correctly assign labels to previouslyunlabelled …
Solving The Teacher Assignment-Course Scheduling Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
Solving The Teacher Assignment-Course Scheduling Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
Research Collection School Of Computing and Information Systems
This paper presents a hybrid algorithm for solving atimetabling problem, which is commonly encountered in manyuniversities. The problem combines both teacher assignment andcourse scheduling problems simultaneously, and is presented as amathematical programming model. However, this problem becomesintractable and it is unlikely that a proven optimal solution can beobtained by an integer programming approach, especially for largeproblem instances. A hybrid algorithm that combines an integerprogramming approach, a greedy heuristic and a modified simulatedannealing algorithm collaboratively is proposed to solve the problem.Several randomly generated data sets of sizes comparable to that ofan institution in Indonesia are solved using the proposed algorithm.Computational results …
An Improvement Heuristic For The Timetabling Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
An Improvement Heuristic For The Timetabling Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh
Research Collection School Of Computing and Information Systems
This paper formulates a timetabling problem, which is often encountered in a university, as a mathematical programming model. The proposed model combines both teacher assignment and course scheduling problems simultaneously, which causes the entire model to become more complex. We propose an improvement heuristic algorithm to solve such a model. The proposed algorithm has been tested with several randomly generated datasets of sizes that are comparable to those occurring in a university in Indonesia. The computational results show that the improvement heuristic is not only able to obtain good solutions, but is also able to do so within reasonable computational …