Aliran Kerja dalam Sistem Otomasi Pejabat di Universiti Putra Malaysia: Satu Kajian Kes

Pengurusan aliran kerja rnerupakan entiti teknologi rnaklumat tahun 90 an ekoran dari penggabungan teknologi perkongsian maklumat, infrastruktur rangkaian komputer dan teknik pembangunan aplikasi yang maju. Aliran kerja adalah sistem komputer atau alat bantuan (tool) perisian yang digunakan untuk mengotomasi, mengurus dan mengintegrasikan proses-proses urusan melalui set peraturan yang ditentukan bagi mencapai matlamat organisasi dari segi kecekapan, kecepatan, kualiti dan produktiviti. Cabaran utama dalam membangunkan sistem aliran kerja adalah kelemahan perspektif aliran kerja semasa dan kepelbagaian metodologi pembangunan. Situasi ini jelas memerlukan satu metodologi implementasi yang berbeza dari sistem maklumat biasa dan boleh diterima pakai secara menyeluruh. Kajian ini telah menyorot dua metodologi implementasi aliran kerja yang telah diamalkan dan mendapati beberapa kesamaan yang ketara. Seterusnya satu metodologi implernentasi aliran ketja diperkenalkan dan digunakan ke atas kajian kes iaitu Cuti Sabatikal dan Cuti Online. Satu elemen penting dalam metodologi implementasi aliran kerja adalah permodelannya. Permodelan ini adalah untuk memberikan gambaran bentuk masa larian sesuatu aliran kerja. Oleh itu kajian ini tumt mengemukakan satu bentuk model perlaksanaan sebagai sebahagian daripada metodologi implementasi dan diuji ke atas kajian kes terlibat. Dua proses telah dipilih untuk diotomasikan ke bentuk aliran kerja iaitu proses permohonan Cuti Sabatikal (PPCS) dan proses permohonan Cuti Online. Pemilihan kedua-dua proses ini dibuat berasaskan perbezaan yang terdapat antara keduanya. Proses Permohonan Cuti Sabatikal mempakan proses manual yang melibatkan unit-unit fungsian yang berbeza dan aliran maklumat yang melepasi batasan sesebuah unit. Sementara itu Proses Permohonan Cuti online adalah sistem otomasi pejabat dalam sesuatu unit dan sedang digunakan. PPCS akan diotomasikan ke bentuk aliran kerja sementara cuti online akan ditingkatkan prestasi aliran kepada yang lebih optima. Penilaian yang diperolehi melalui pengukuran prestasi sistem aliran kerja yang dibina menggunakan Metodologi dan model perlaksanaannya akan menentukan keberkesanan metodologi yang disyorkan . Pengukuran prestasi ini meliputi kesesuaian sistem, tahap integrasi, penjimatan sumber dan juga persepsi pengguna terhadap kepenggunaannya. Keputusan yang diperolehi menunjukkan Metodologi Implementasi dengan Model Perlaksanaannya berjaya menghasilkan sistem aliran kerja yang berkualiti dan memenuhi objektif pembangunannya. Beberapa syor juga dikemukakan hasil penemuan kajian sebagai faktorfaktor kritikal bagi menentukan kejayaan perlaksanaan sistem aliran kerja. Selain itu beberapa kajian lanjutan turut diketengahkan dalam usaha meningkatkan penemuan teknologi aliran kerja ini

Knowledge management and usability model for knowledge management system.

Many studies and works have been done to produce a Knowledge Management System (KMS) in which employees of any organization can access the organization’s sources of information and solutions. However, there is still no standard knowledge measurement and usability model that can assist KMS user to select or evaluate the appropriate KMS. The aim of this paper is to analyze how the ISO Consolidated Usability Model suggested by Abran, Khelifi, Suryn and Seffah can be used in measuring knowledge and evaluating usability for any Knowledge Management System. The methodology used is a user-satisfaction questionnaire de veloped based on the ISO Consolidated Usability Model

Adoption of Free Open Source Geographic Information System Solution for Health Sector in Zanzibar Tanzania

\ud The study aims at developing in-depth understanding on how Open Source Geographic Information System technology is used to provide solutions for data visualization in the health sector of Zanzibar, Tanzania. The study focuses on implementing the health visualization solutions for the purpose of bridging the gap during the transition period from proprietary software to the Free Open-Source Software using Key Indicator Data System. The developed tool facilitates data integration between the two District Health Information Software versions and hence served as a gateway solution during the transition process. Implementation challenges that include outdated spatial data and the reluctance of the key users in coping with the new Geographical Information System technologies were also identified. Participatory action research and interviews were used in understanding the requirements for the new tool to facilitate the smooth system development for better health service delivery.\u

Validate conference paper using dice coefficient.

Dice Coefficient is the techniques to find similarity of an object and widely used in digital library, sciences and other fields. Thus, this project is the first attempts to employed Dice Coefficient for selecting paper in conference management system. An experimental result with limited test cases indicates Dice Coefficient is potentially to be used in the broad spectrum of respective application

A genetic algorithm approach for timetabling problem: the time group strategy

The university timetabling problems (TTP) deal with the scheduling of the teaching program. Over the last decade variant of Genetic Algorithm (GA) approaches have been used to solve various types of TTP with great success. Most of the approaches are problem dependent, applied only to the institutions where they were designed. In this paper we proposed time group strategy and Simple GA (TGGA) to solve highly constrained TTP. The proposed model promises to solve highly constrained timetabling with less effort. The model is tested and results are discussed

Hybrid Metaheuristic Algorithm and Metaheuristic Performance Measurement for Solving University Course Timetabling Problem

Metaheuristics have received considerable interest in the fields of applied artificial intelligence and combinatorial optimization such as university course timetabling problem (UCTP). Metaheuristics begin with one or more initial solutions and iteratively employ search strategies to avoid local optima. Recently, it was observed that the combination of concepts of different metaheuristics, called hybrid metaheuristics, can provide a more efficient behavior and higher flexibility in dealing with real-world and large-scale problems. Frequently, hybridzing the metaheuristic components lie on how we can effectively structure metaheuristic components to efficiently explore and exploite search space. Acquiring the proper balance between intensification and diversification strategies is the crucial factor in obtaining an effective metaheuristic. This research focused on the implementation of an hybrid evolutionary metaheuristic namely Two_point Hybrid Evolutionary Algorithm (Tp_HEA) on university course timetabling problem instances (UCTP). Tp_HEA is based on two solutions that represent intensification at one point and diversification on the other point. Systematic exchange of information between these two points is to ensure the proper management of the balance between intensification and diversification. The proposed Tp_HEA was tested on twelve standard UCTP instances according to the specified experimental procedure. The result obtained from the average point analysis and percentage of invalid solution was very promising. Out of twelve datasets, eight produced better performance when comparison was made against five other metaheuristics. The performance was measured in terms of constraints solved. Experimental results revealed that the arrangement of the Tp_HEA component would affect the search landscape of most UCTP problem instances. The stochastic nature of metaheuristic including the Tp_HEA, results in inconsistent performance and the difficulty in obtaining accurate prediction from average point analyses. Thus, the second contribution of this research is the introduction of Metaheuristic Performance Measurement (MPM). MPM is the attempt of measuring metaheuristic performance statistically, thus accurate indices can be obtained. The validity of MPM as a new measuring technique was tested using selected results obtained from proposed Tp_HEA together with the result produced by genetic algorithm (GA). The analysis showed that MPM values obtained from both algorithms almost in line with the result obtained from average point analysis. The specific indices of performance produced by MPM were the major elements that differentiate MPM from average point analysis. The indices gave values for the performance, and thus the performance was more easily estimated. The reliability of MPM could be further observed when the analysis of variance showed that MPM values obtained from different independent runs were not significantly varied. Therefore, MPM was able to obtain a good estimation as compared to other commonly used metaheuristic measuring techniques

Application of software reuse concept in case-based reasoning for time tabling problem

This paper demonstrates the application of software reuse concept together with case-based reasoning to solve time-tabling problem. The combination of both concept was induce through the similarity solution pattern which is both revise to previous cases as reference to solve current problem. A brief process flow is explained in this paper to show the possibility of combining case-based reasoning and software reuse to bring a new solution method

An autonomous software approach to enhance information sharing in university course timetable planning

One of the major activities of university departments at the beginning of an academic semester is creating a course timetable. During course timetable creation, a department usually needs to book one or more courses from other departments. In order to book courses, a department needs to send request to another department that offers that course and exchange relevant information with it. This information is essential for the department in order to assign the academic provider resource to appropriate time slot in its own courses timetable which has to satisfy specific conditions. Information sharing during timetable planning in academic departments still faces difficulties due to the low level of cross-department information sharing. These issues seriously restrict and delay the process of collaborative timetabling planning. In order to automate the information sharing between academic providers in timetabling planning we present a prototype of an autonomous and efficient information sharing tool. The aim of this tool is to reduce communication gaps among the departments. The proposed approach is applied on timetable planning for the department of Computer Science (CS) and Software Engineering (SE) at the Universiti of Putra Malaysia (UPM)

Shuffling algorithms for automatic generator question paper system.

Examination process is important activities for educational institutions to evaluate student performance. Thus the quality of the exam questions would determine the quality of the students produced by the institutions. Preparing exam questions is challenges, tedious and time consuming for the instructors. Usually the instructors keeping their own test bank in some form to help them prepare future exams. Current technologies help the instructors to store the questions in computer databases. The issue arise is how the current technologies would also help the instructors to automatically generate the different sets of questions from time to time without concern about repetition and duplication from the pass exam while the exam bank growing. This paper describes the usage of shuffling algorithm in an Automatic Generator Question paper System (GQS) as a randomization technique for organising sets of exam paper. The results indicate shuffling algorithm could be used to overcome randomization issue for GQS

Systematic literature review on search based software testing

The use of random search is very poor at finding solutions when those solutions occupy a very small part of the overall search space. Test data may be found faster and more reliably if the search is given some guidance. This work is a paper that explains the application of metaheuristic techniques in search-based software testing. The paper systematically review 47 papers selected randomly from online databases and conference proceeding based on the metaheuristic search techniques that have been most widely applied to problem solving, the different fitness function used for test data selection in each of the metaheuristic technique, and the limitation in the use of each search-based technique for software testing. It was found that GA outperformed its counterparts SA, HC, GP and random search approaches in generating test data automatically, different approaches were used to make sure that test data are selected within shorter period of time and also with wider coverage of the paths based on the fitness function, and most of the limitations of the articles are the handling of complex data types, like array, object types, and branch coverage. The paper also provides areas of possible future work on the use of metaheuristic techniques in search-based software testing