Zulaiha Ali Othman

Soft computing applications and intelligent systems: Second international multi-conference on artificial intelligence technology, m-cait 2013 shah alam, august 28-29, 2013 Proceedings

The determination of real world coordinate from image coordinate has many applications in computer vision. This paper proposes the algorithm for determination of real world coordinate of a point on a plane from its image coordinate using single calibrated camera based on simple analytic geometry. Experiment has been done using the image of chessboard pattern taken from five different views. The experiment result shows that exact real world coordinate and its approximation lie on the same plane and there are no significant difference between exact real world coordinate and its approximation.

A Water Flow-Like Algorithm for the Travelling Salesman Problem

The water flow-like algorithm (WFA) is a relatively new metaheuristic that performs well on the object grouping problem encountered in combinatorial optimization. This paper presents a WFA for solving the travelling salesman problem (TSP) as a graph-based problem. The performance of the WFA on the TSP is evaluated using 23 TSP benchmark datasets and by comparing it with previous algorithms. The experimental results show that the proposed WFA found better solutions in terms of the average solution and the percentage deviation of the average solution from the best-known solution.

Water flow algorithm decision support tool for travelling salesman problem

This paper discuss about the role of Decision Support Tool in Travelling Salesman Problem (TSP) for helping the researchers who doing research in same area will get the better result from the proposed algorithm. A study has been conducted and Rapid Application Development (RAD) model has been use as a methodology which includes requirement planning, user design, construction and cutover. Water Flow Algorithm (WFA) with initialization technique improvement is used as the proposed algorithm in this study for evaluating effectiveness against TSP cases. For DST evaluation will go through usability testing conducted on system use, quality of information, quality of interface and overall satisfaction. Evaluation is needed for determine whether this tool can assists user in making a decision to solve TSP problems with the proposed algorithm or not. Some statistical result shown the ability of this tool in term of helping researchers to conduct the experiments on the WFA with improvements TSP initialization.

Efficient Hierarchical Diff-EDF schedulability for QoS packet networks

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in packet networks by the use of proper packet scheduling algorithms. In this paper, we propose a new priority assignment scheduling algorithm, hierarchal diff-EDF (differentiate earliest deadline first), which can meet the real-time needs of such applications while continuing to provide best effort service to non-real time traffic. The hierarchal diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. The simulation results show that the hierarchical diff-EDF achieved the minimum packet miss ratio when compared with both EDF and diff-EDF schedulers.

ASRTS: An Agent-Based Simulator for Real-Time Schedulers

In response to the complexity of communication networks, simulation was and remains the only way to evaluate network performance. Unfortunately, traditional simulation methods are not adapted to all networks such as networks with quality of service and networks with dynamic aspect. To overcome this limitation, a new method to simulate dynamic networks based on multi-agents simulation had been proposed. In this paper, we introduce a timely-constrained Agent- based Simulator for Real-Time Schedulers (ASRTS). Our Simulator not only provides the underlying software to build autonomous agents, but also it has the capability to express and enforce timing constraints on actions if the real-time schedulers decide to benefit from the flexible and responsive nature of agents in a multi-agent system.

Efficient scheduling discipline for hierarchical Diff-EDF

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent quality of service (QoS) requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet-scheduling algorithms. As a computer revolution, many scheduling algorithms have been proposed to provide different schemes of QoS guarantees, with Earliest Deadline First (EDF) as the most popular one. With EDF scheduling, all flows receive the same miss rate regardless of their traffic characteristics and deadlines. This makes the standard EDF algorithm unsuitable for situations in which the different flows have different miss rate requirements since in order to meet all miss rate requirements it is necessary to limit admissions so as to satisfy the flow with the most stringent miss rate requirements. In this paper, we propose a new priority assignment scheduling algorithm, Hierarchal Diff-EDF (Differentiate Earliest Deadline First), which can meet the real-time needs of these applications while continuing to provide best-effort service to non-real time traffic. The Hierarchal Diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly.

Adaptive scheduling for real-time network traffic using agent-based simulation

Since several years, communication networks have known a surprising growth. The increased number of users, the consequent increase of traffic, and the request for new services involve the development of new technologies and the deployment of high throughput networks. Networking technology has correspondingly grown to meet the diverse needs of applications and network administration. In response to the complexity of communication networks, simulation was and remains the only way to evaluate network performance. Unfortunately, traditional simulation methods are not adapted to all networks such as networks with quality of service and networks with dynamic aspect. To overcome this limitation, a new method to simulate dynamic networks based on multi-agents simulation and behavioral approach had been proposed. In this paper, we present an adaptive approach to schedule real-time network traffic using the agent based simulation concept. The paper introduces an adaptive real-time agent scheduler (ARTAS) architecture and agent model as basis for scheduling real-time packet networks.