Computer Sciences Commons^™

Umpjj- Wcs (Wages Claims System) Through Web, Min Tat Ong

Student Works (2000-2009)

The final year thesis paper has divided into 2 major parts which are the WXET 3181 Latihan Ilmiah I and WXET 3182 Latihan Ilmiah II. The division of these 2 thesis paper is based on the 7 major stages in SDLC (System Development Life Cycle) context which WXET 3181 Latiban Ilmiah I covers 3 major stages in SDLC whereas WXET 3182 Latihan Ilmiah II covers the remaining 4 major stages in SDLC. The WXET 3181 Latihan Ilmiah I is a special 4 credit hours thesis paper which does not involve any lecture or tutorial classes but to let the FSKTM …

Sistem Penyelenggaraan Kenderaan Jpphb, Ideris Ahmad Hazimin

Student Works (2000-2009)

Pembangunan sistem berasaskan web menjadi semakin penting dan mendapat perhatian Jantaran kemudahan capaian yang luas dan mudah untuk diselenggarakan. Tidak seperti sistem persekitaran pengguna tunggal yang perlu di'install' ke dalam setiap komputer pengguna, sistem berasaskan web ini boleh diakses serta dikemaskini secara terus pada bila-bila masa dan di mana-mana sahaja tempat yang mempunyai kemudahan internet. Dengan sebab itu, Sistem Penyelenggaraan Kenderaan JPPHB ini dibangunkan dalam persekitaran web bagi memudahkan pengurusan maklumat kenderaan di bawah kendalian Jabatan Pembangunan Harta Benda Universiti Malaya (JPPHB). Sistem ini diharap dapat menggantikan sistem manual yang ada dengan mengautomasikan banyak kerja yang remeh dan sekaligus meringankan …

Sales, Purchases And Stock System, Chee Hoe Mok

Student Works (2000-2009)

Like any other general accounting software, Sales & Purchases Recording System is designed in such a way that it fir into use of different types of organizations. It consists of an accounting database which stores all information regarding the organization’s trading status. Since it should fit to any types of organization, Sales & Purchases Recording System has the capability of allowing multiple users to create their own database files and gain access to them. The software is one of dynamic file allocation in which users can specify and create their own database files. Records inside those files are also of …

Sistem Maklumat Pertolongan Cemas (Smpc), Baharudin Norafizah

Student Works (2000-2009)

Latihan ilmiah ini merupakan satu krusus yang wajib bagi pelajar tahun akhir bagi memenuhi keperluan penganugerahan ljazah Sarjana Muda Teknologi Maklumat dengan kepujian di Fakulti Sains Komputer dan Teknologi Maklumat di Universiti Malaya. Melalui kursus ini pelajar perlu membuat satu projek dimana pelajar dapat mengaplikasikan apa-apa yang dipelajari selama ini. Dalam laporan latihan ilmiah ini, tumpuan diberikan kepada konsep, teknik dan kaedah analisis yang dibuat untuk menjayakan projek latihan ilmiah yang bertajuk Sistem Maklumat Pertolongan Cemas (SMPC). Laporan latihan ilmiah ini meliputi segala aspek praktis yang wujud dalam pembangunan sistem yang ditunjukkan dalam jadual pembangunan projek pada fasa 1 dan …

Isolated Ramp Metering Feedback Control Utilizing Mixed Sensitivity For Desired Mainline Density And The Ramp Queues, Pushkin Kachroo, Kaan Ozbay, Donald E. Grove

Electrical & Computer Engineering Faculty Research

This paper presents a feedback control design for isolated ramp metering control. This feedback control design, unlike the existing isolated feedback ramp controllers, also takes into account the ramp queue length. Using a nonlinear H∞ control design methodology, we formulate the problem in the desired setting to be able to utilize the results of the methodology.

Meeting Scheduling System (Mss), Mun Ting Ng

Student Works (2000-2009)

Meeting Scheduling System (MSS) is a web-based system developed to support the organization of meetings, that is for each meeting request, a suitable meeting date can be determine based on constraints like meeting location, equipment and the number of invitees that can attend the meeting. Besides that, Meeting Scheduling System (MSS) allow users to check if the invitees are available to attend a meeting, and will inform participants on details about meetings tl1at involve them. It is to avoid the possibility of scheduling a person to attend two or more meetings at one time. Other than that, Meeting Scheduling System …

Corba: A Quantitative And Qualitative Comparison Of Industrial Strength, Commercial Corba Orbs For The Java Platform, Michelle Leigh Mckeller

UNF Graduate Theses and Dissertations

In distributed systems design, middleware is a key component. Middleware establishes the communication between a client and server in a multi-tiered architecture. One approach to middleware is implementing the OMG's CORBA standard, through the use of ORBs. Three of the more popular commercially available ORBs are Sun's Java 2 ORB, Borland's VisiBroker for Java, and IONA's Orbix 2000 for Java. The purpose of this graduate project was to compare the three ORBs both quantitatively and qualitatively. The project compares the ORBs quantitatively by measuring the performance of each ORB, in terms of response time. The comparison was done qualitatively by …

Modal Rules Are Co-Implications, Alexander Kurz

Engineering Faculty Articles and Research

In [13], it was shown that modal logic for coalgebras dualises—concerning definability— equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications:It is shown that a class of coalgebras is definable by modal rules iff it is closed under H (images) and Σ (disjoint unions). As a corollary the expressive power of rules of infinitary modal logic on Kripke frames is characterised.

Language Support For Morton-Order Matrices, David S. Wise, Gregory A. Alexander, Jeremy D. Frens

University Faculty Publications and Creative Works

The uniform representation of 2-dimensional arrays serially in Morton order (or Ee Cyrillic sign order) supports both their iterative scan with cartesian indices and their divide-and-conquer manipulation as quaternary trees. This data structure is important because it relaxes serious problems of locality and latency, and the tree helps to schedule multi-processing. Results here show how it facilitates algorithms that avoid cache misses and page faults at all levels in hierarchical memory, independently of a specific runtime environment. We have built a rudimentary C-to-C translator that implements matrices in Morton-order from source that presumes a row-major implementation. Early performance from LAPACK's …

Working For Excellence In The E-Conomy: 2nd International We-B Conference, Sue Stoney (Ed.)

Research outputs pre 2011

Welcome to Perth, Western Australia, and to the 2nd International We-B Conference 2001 "working for excellence in the e-conomy" hosted by the We-B Centre, School of Management Information Systems at Edith Cowan University.

This is an international conference for academics and industry specialists in e-business, e-government and related fields. The conference has drawn participants from national and international organisations.

All submitted papers were subjected to an anonymous peer review process managed by the Conference Committee.

A Case For Systems Thinking And System Dynamics, Craig William Caulfield, Stanislaw P. Maj

Research outputs pre 2011

Systems thinking is a way of thinking that focuses on the relationships between the parts forming a purposeful whole. System dynamics is concerned with building computer models of complex problem situations and then experimenting with and studying the behaviour of these models over time. This paper is a review of systems thinking that considers its unique history and influences, paradigms and methodologies, and presents a case for the system dynamics methodology as the best tool for the most diverse range of problem situations

B-Nodes: A New Scalable High Level Abstraction Model, Stanislaw P. Maj, Craig William Caulfield

Research outputs pre 2011

This paper proposes a new modeling technique called B-Nodes. B-Nodes represent a new, high-level abstraction that allows technical detail to be controlled using top-down recursive decomposition. This abstraction. is independent of architectural detail and can therefore accommodate rapid changes in technology. The use of recursive decomposition allows B-Nodes to be used not only for entire e-commerce system but also sub-modules within this system. The use of fundamental units allows the performance of heterogeneous technologies to be compared and other units to be derived. Results to date indicate no comparable model exists. Should further work validate this technique the authors recommend …

Clustering Of Web Users Using Session-Based Similarity Measures, Jitian Xiao, Yanchun Zhang

Research outputs pre 2011

One important research topic in web usage mining is the clustering of web users based on their common properties. Informative knowledge obtained from web user clusters were used for many applications, such as the prefetching of pages between web clients and proxies. This paper presents an approach for measuring similarity of interests among web users from their past access behaviors. The similarity measures are based on the user sessions extracted from the user's access logs. A multi-level scheme for clustering a large number of web users is proposed, as an extension to the method proposed in our previous work (2001). …

Educating Professional Software Engineers: Pathways And Progress In The Australian Experience, Rick Duley, David Veal, Stanislaw P. Maj

Research outputs pre 2011

Australia has seized the international initiative in the recognition of software engineers as professionals. Of the 37 universities in Australia offering undergraduate courses in computing, eleven offer courses in software engineering which are accredited by the Institute of Engineers, Australia (IEAust) and which may lead the graduate to membership of the Institute. In this way, the Institute has plausible claim to being the first national professional engineering body in the world to have accredited four-year undergraduate software engineering degrees as professional qualifications. The paper traces the development of the relationship between the Institute of Engineers and the computing industry and …

Inference Of Regular Languages Using Model Simplicity, Philip Hingston

Research outputs pre 2011

We describe an approach that is related to a number of existing algorithms for the inference of a regular language from a set of positive (and optionally also negative) examples. Variations on this approach provide a family of algorithms that attempt to minimise the complexity of a description of the example data in terms of a finite state automaton model. Experiments using a standard set of small problems show that this approach produces satisfactory results when positive examples only are given, and can be helpful when only a limited number of negative examples is available. The results also suggest that …

Rush Hour® And Dijkstra’S Algorithm, Mark Stamp, Brad Engel, Mcintosh Ewell, Victor Morrow

Faculty Publications, Computer Science

The game of Rush Hour® includes a 6 × 6 grid and game pieces representing cars and trucks. The object of the puzzle is to move a special car out of a gridlocked “traffic jam.” In this note we apply Dijkstra’s algorithm and a breadth-first search to solve any Rush Hour configuration.

Machine Learning In Euchre: A Comparison Of Techniques, Michael J. Holmes

Dissertations and Theses @ UNI

This study compares the effectiveness of inductive and analytical learning techniques for a specific type of problem. The set of problems has a large number of parameter combinations as inputs, and a small set of possible output solutions. The card game, Euchre, was the basis for research. Four algorithms were used for comparison. Two were variants of induction using decision tree learning, and the other two used variants of explanation-based learning, an analytical approach. The example data were gathered from human players, along with one set of random, "noisy" data. These data were then used as training sets for the …

Depth-First Search Embedded Wavelet Algorithm For Hardware Implementation, Li-Minn Ang

Theses: Doctorates and Masters

The emerging technology of image communication over wireless transmission channels requires several new challenges to be simultaneously met at the algorithm and architecture levels. At the algorithm level, desirable features include high coding performance, bit stream scalability, robustness to transmission errors and suitability for content-based coding schemes. At the architecture level, we require efficient architectures for construction of portable devices with small size and low power consumption. An important question is to ask if a single coding algorithm can be designed to meet the diverse requirements. Recently, researchers working on improving different features have converged on a set of coding …

The Need For Information And Communication Technology (Ict) Literacy Among Lower Secondary Students, Sri Kumaran Rajendran

Student Works (2000-2009)

The purpose of this study is to determine the need for ICT literacy among lower secondary students. The study was designed to answer the following objectives: 1) Whether there is any significance difference between the need for a structured ICT syllabus and that of informal learning of ICT through friends, reading materials, parents, CD-ROM, and interest. 2) To gauge the interest shown towards ICT related activities after undergoing structured ICT syllabus. The study focused on two secondary schools in the Petaling District of Selangor. A questionnaire was distributed to a total 300 student from Form One, Two, and Three of …

Dynamic Bandwidth Allocation Using Neural-Fuzzy In Atm Network, Yan Sing Chua

Student Works (2000-2009)

Dynamic bandwidth allocation is becoming one of the crucial issues in the design and research in the computer network. This is due to the continuous increasing demand of intensive applications that require more bandwidth while retaining higher quality. Dynamic bandwidth allocation utilises the current network state information to optimise the bandwidth distribution. The state information can be gathered through prediction using past data and measurement on current state. Agility and flexibility of dynamic bandwidth allocation using Neural-Fuzzy has the advantage that it can adapt to the state changes of the network. ATM network carries heterogeneous traffic and this causes the …

Network Simulation And Performance Evalution Of Ip Multicast Using Pim-Dm In Umjanetsim, Jui Hiangh Teoh

Student Works (2000-2009)

The demand for multicast capabilities in IP networks is growing very rapidly. New applications that take advantage of IP Multicast are being introduced constantly. Therefore, IP Multicast is regarded as one of the most important technologies in IP networks today. This dissertation focuses on the simulation and performance evaluation of IP Multicast using Protocol Independent Multicast- Dense Mode (PIM-OM) as the multicast routing protocol. The simulation is executed in a network simulator named UMJaNetSim, where custom components are built in order to simulate IP Multicast. First, the advantages and applications of IP Multicast, multicast addressing, Internet Group Management Protocol (IGMP), …

Mpls Vpn Simulation Using Mp-Ibgp, Tan Fong Ang

Student Works (2000-2009)

As Internet traffic continues to increase, companies are demanding greater speeds and better services to disseminate information to their customers, partners and employees. In order to provide reliable services and to support a variety of secure communications among a wide range of locations, Multiprotocol Label Switching Virtual Private Network (MPLS VPN) has been introduced. MPLS is an emerging technology that aims to address many of the existing issues associated with packet forwarding in today's internetworking environment. Whereas, VPN provides secure private connections through public infrastructure amongst multiple locations. MPLS­ based VPN provides isolation. security, simplified routing, easier provisioning as well …

Dres: Internet Resource Management Using Deferred Reservations, Samphel Norden

All Computer Science and Engineering Research

In this proposal, we consider the problem of resource reservation for Integrated Services (IntServ) and Differentiated Services (DiffServ) networks. Current approaches for resource reservation in INtegrated Service Networks adopt an all-or-nothing approach, where partially acquired resources must be released if resources are not available at all routers on the chosen path. Furthermore, under high load, end-systems must retry requests repeatedly leading to inefficient allocation and increased traffic. We propose a new approach called Deferred REServation (DERS) that substantially improves performance (reduces the overall cell rejection probability and increases link utilization) over the all-or-nothing reservation approach. Call admissibility is increased by …

Layered Protocol Wrappers For Internet Packet Processing In Reconfigurable Hardware, Florian Braun, John Lockwood, Marcel Waldvogel

All Computer Science and Engineering Research

The ongoing increases of line speed in the Internet backbone combined with the need for increased functionality of network devices presents a major challenge. These demands call for the use of reprogrammable hardware to provide the required flexible, high-speed functionality, at all network layers. The Field Programmable Port Extender (FPX) provides such an environment for development of networking components in reprogrammable hardware. We present a framework to streamline and simplify networking applications that process ATM cells, AAL5 frames, Internet Protocol (IP) packets and UDP datagrams directly in hardware.

Scalable Ip Lookup For Programmable Routers, David E. Taylor, John W. Lockwood, Todd Sproull, David B. Parlour

All Computer Science and Engineering Research

Continuing growth in optical link speeds places increasing demands on the performance of Internet routers, while deployment of embedded and distributed network services imposes new demands for flexibility and programmability. IP adress lookup has become a significant performance bottleneck for the highest performance routers. New commercial products utilize dedicated Content Addressable Memory (CAM) devides to achieve high lookup speeds. This paper describes an efficient, scalable lookup engine design, able to achieve high-performance with the use of a small portion of a reconfigurable logic device and a commodity Random Access Memory (RAM) device. Based on Eatherton's Tree Bitmap algorithm [1] the …

Synthesizable Design Of A Multi-Module Memory Controller, Sarang Dharmapurikar, John W. Lockwood

All Computer Science and Engineering Research

Random Access Memory (RAM) is a common resources needed by networking hardware modules. Synchronous Dynamic RAM (SDRAM) provides a cost effective solution for such data storage. As the packet processing speeds in the hardware increase memory throughput can be a bottleneck to achieve overall high performance. Typically there are multiple hardware modules which perform different operations on the packet payload and hence all try to access the common packet buffer simultaneously. This gives rise to a need for a memory controller which arbitrates between the memory requests made by different modules and maximizes the memory throughput. This paper discusses the …

Obiwan - An Internet Protocol Router In Reconfigurable Hardware, Florian Braun, Marcel Waldvogel, John Lockwood

All Computer Science and Engineering Research

The ongoing exponential increase of line speed in the Internet and combined with the uncountable requests for increased functionality of network devices presents a major challenge. These demands call for the use of reprogrammable hardware to provide the required flexible high-speed functionaltiy. The Field Programmable Port Extender (FPX) provides such an environment for development of networking components in reprogrammable hardware. We present the high-speed IP routing components in reprogrammable hardware. We present the high-speed IP routing module "OBIWAN" (Optimal Binary search IP lookup for Wide Area Networks) built on top of an IP processing framework.

Network Abstractions For Context-Aware Mobile Computing, Gruia-Catalin Roman, Christine Julien, Qingfeng Huang

All Computer Science and Engineering Research

Context-Aware computing is characterized by the ability of a software system to continuously adapt its behavior to a changing environment over which it has little or no control. Previous work along these lines presumed a rather narrow definition of context, one that was centered on resources immediately available to the component in question, e.g., communication bandwidth, physical location, etc. This paper explores context-aware computing in the setting of ad hoc networks consisting of numerous mobile hosts that interact with each other opportunistically via transient wireless interconnections. We extend the context to encompass awareness of an entire neighborhood within the ad …

Implementation Of An Open Multi-Service Router, Fred Kuhns, John Dehart, Ralph Keller, John Lockwood, Prashanth Papu, Jyoti Parwatikar, Ed Spitznagel, David Richard, David Taylor, Jon Turner, Ken Wong

All Computer Science and Engineering Research

This paper describes the design, implementation, and performance of an open, high-performance, dynamically reconfigurable Multi-Service Router (MSR) being developed at Washington University in St. Louis. This router provides an experimentation platform for research on protocols, router software, and hardware design, network management, quality of service and advanced applications. The MSR has been designed to be flexible, without sacrificing performance. It support gigabit links and uses a scalable architecture suitable for supporting hundreds or even thousands of links. The MSR's flexibility makes it an ideal platform for experimental research on dynamically extensible networks that implement higher level functions in direct support …

Efficient Queue Management For Tcp Flows, Anshul Kantawala, Jonathan Turner

All Computer Science and Engineering Research

Packets in the Internet can experience large queueing delays during busy periods. Backbone routers are generally engineered to have large buffers, in which packets may wait as long as half a second (assuming FIFO service, longer otherwise). During congestion periods, these bufferfs may stay close to full, subjecting packets to long delays, even when the intrinsic latency of the path is relatively small. This paper studies the performance improvements that can be obtained by using more sophisticated packet schedulers, than are typical of Internet routers. The results show that the large buffers found in WAN routers ocntribute only marginally to …