The application of rough set and Kohonen network to feature selection for object extraction

Selecting a set of features which is optimal for a given task is a problem which plays an important role in a wide variety of contexts including pattern recognition, images understanding and machine learning. The paper describes an application of rough sets method to feature selection and reduction in texture images recognition. The proposed methods include continuous data discretization based on Kohonen neural network and maximum covariance, and rough set algorithms for feature selection and reduction. The experiments on trees extraction from aerial images show that the methods presented in this paper are practical and effective.

A platform for dynamic organization of agents in agent-based systems

In most agent-based systems, different middle agents are employed to increase their flexibility. However, there are still three issues remain unsolved. In centralized architecture with single middle agent, the middle agent itself is a bottleneck and suffers from single point failure; middle agents in distributed architecture lack capability of dynamic organization of agents; The reliability is not strong because of the single point failure and lack of effective architecture. We introduce a platform with ring architectural model to solve all above problems. In the platform, multiple middle agents are dynamically supported for solving the first problem. For solving the second problem, middle agents dynamically manage the registration and cancellation of service provider agents and application teams, each of which includes a set of closely interacting requester agents to complete an independent task. Redundancy middle agent technique is proposed for solving the third problem. All middle agents are of the feature of proliferation and self-cancellation according to the sensory inputs from their environment. For organizing the middle agents effectively, a ring architectural model is proposed. We demonstrate the applicability of the platform by its application and present experimental evidence that the platform is flexible and robust.

A proposed hybrid evaluation methodology for intelligent transport system deployment

The rapid deployment of intelligent transport systems in practice requires serious evaluation of new construction projects. Traditional transportation evaluation methods are insufficient to capture the new features of intelligent transport systems, particularly the applications of recently developed information technologies. This research aims to develop a new conceptual framework to evaluate the social, economic and environmental impacts of intelligent transport systems deployment, with explicit consideration of impacts of information technologies on variant travel behaviours. The research would provide a systematic evaluation methodology to enable decision makers and publics better evaluating and understanding the social, economic and environmental benefits of implementation of intelligent transport systems.

A computation trust model with trust network in multi-agent systems

Trust is a fundamental issue in multi-agent systems, especially when they are applied in e-commence. The computational models of trust play an important role in determining who and how to interact in open and dynamic environments. To this end, a computation trust model is proposed in which the confidence information based on direct prior interactions with the target agent and the reputation information from trust network are used. In this way, agents can autonomously deal with deception and identify trustworthy parties in multi-agent systems. The ontological property of trust is also considered in the model. A case study is provided to show the effectiveness of the proposed model.

Performance analysis of heterogeneous multi-cluster systems

When building a cost-effective high-performance parallel processing system, a performance model is a useful tool for exploring the design space and examining various parameters. However, performance analysis in such systems has proven to be a challenging task that requires the innovative performance analysis tools and methods to keep up with the rapid evolution and ever increasing complexity of such systems. To this end, we propose an analytical model for heterogeneous multi-cluster systems. The model takes into account stochastic quantities as well as network heterogeneity in bandwidth and latency in each cluster. Also, blocking and non-blocking network architecture model is proposed and are used in performance analysis of the system. The message latency is used as the primary performance metric. The model is validated by constructing a set of simulators to simulate different types of clusters, and by comparing the modeled results with the simulated ones.

Analysis of interconnection networks in heterogeneous multi-cluster systems

The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of its interconnection network. In the mean time, the heterogeneity is one of the most important factors of such systems. This paper addresses the problem of interconnection networks performance modeling of large-scale distributed systems with emphases on heterogeneous multi-cluster computing systems. So, we present an analytical model to predict message latency in multi-cluster systems in the presence of cluster size heterogeneity. The model is validated through comprehensive simulation, which demonstrates that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions.

Economy-based data replication broker

Data replication is one of the key components in data grid architecture as it enhances data access and reliability and minimises the cost of data transmission. In this paper, we address the problem of reducing the overheads of the replication mechanisms that drive the data management components of a data grid. We propose an approach that extends the resource broker with policies that factor in user quality of service as well as service costs when replicating and transferring data. A realistic model of the data grid was created to simulate and explore the performance of the proposed policy. The policy displayed an effective means of improving the performance of the grid network traffic and is indicated by the improvement of speed and cost of transfers by brokers.

Analytical network modeling of heterogeneous large-scale cluster systems

The study of the communication networks for distributed systems is very important, since the overall performance of these systems is often depends on the effectiveness of its communication network. In this paper, we address the problem of networks modeling for heterogeneous large-scale cluster systems. We consider the large-scale cluster systems as a typical cluster of clusters system. Since the heterogeneity is becoming common in such systems, we take into account network as well as cluster size heterogeneity to propose the model. To this end, we present an analytical network model and validate the model through comprehensive simulation. The results of the simulation demonstrated that the proposed model exhibits a good degree of accuracy for various system organizations and under different working conditions.

Analytical modeling of communication latency in multi-cluster systems

This paper addresses the problem of performance modeling of large-scale distributed systems with emphasis on communication networks in heterogeneous multi-cluster systems. The study of interconnection networks is important because the overall performance of a distributed system is often critically hinged on the effectiveness of this part. We present an analytical model to predict message latency in multi-cluster systems in the presence of processor heterogeneity. The model is validated through comprehensive simulation, which demonstrates that the proposed model exhibits a good degree of accuracy for various system sizes and under different operating conditions.

Design of reduced-order state/unknown input observers: a descriptor system approach

This paper addresses the problem of estimating simultaneously a linear function of both the state and unknown input of linear system with unknown inputs. By adopting the descriptor system approach, the problem can be conveniently solved. Observers proposed in this paper are of low-order and do not include the derivatives of the outputs. New conditions for the existence of reduced-order observers are derived. A design procedure for the determination of the observer parameters can also be easily derived based on the derived existence conditions

Design of reduced-order observers for neutral time-delay systems

This paper presents a method for the design of reduced-order observers for a class of linear time-delay systems of the neutral-type. Conditions for the existence of reduced-order observers that are capable of asymptotically estimating any given function of the state vector are derived. A step-by-step design procedure is given for the determination of the observer parameters. A numerical example is given to illustrate the design procedure.

A transformation model for heterogeneous servers

One of the characteristics of the current Web services is that many clients request the same or similar service from a group of replicated servers, e.g. music or movie downloading in peer-to-peer networks. Most of the time, servers are heterogeneous ones in terms of service rate. Much of research has been done in the homogeneous environment. However, there is has been little done on the heterogeneous scenario. It is important and urgent that we have models for heterogeneous server groups for the current Internet applications design and analysis. In this paper, we deploy an approximation method to transform heterogeneous systems into a group of homogeneous system. As a result, the previous results of homogeneous studies can be applied in heterogeneous cases. In order to test the approximation ratio of the proposed model to real applications, we conducted simulations to obtain the degree of similarity. We use two common strategies: random selection algorithm and Firs-Come-First-Serve (FCFS) algorithm to test the approximation ratio of the proposed model. The simulations indicate that the approximation model works well.

Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Peer-to-Peer (P2P) Web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P Web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. The experiments show that our P2P cache system improves the performance of index operations through the reduction of the amount of information processed by nodes, the reduction of the number of index messages sent by nodes, and the improvement of the locality of cache pointers.

Design of a low cost underwater robotic research platform

To perform under water robotic research requires specialized equipment. A few pieces of electronics atop a set of wheels is not going to cut it. An underwater research platform must be waterproof, reliable, robust, recoverable and easy to maintain. It must also be able to move in 3 dimensions. Finally it must be able to navigate and avoid obstacles. To purchase such a platform can be very expensive. However, for shallow water, a suitable platform can be built from mostly off the shelf items at little cost. This paper describes the design of one such underwater robot including various sensors and communications systems that allow for swarm robotics.

Simulation of underwater robots using MS Robot Studio©

One stage in designing the control for underwater robot swarms is to confirm the control algorithms via simulation. To perform the simulation Microsoftpsilas Robotic Studiocopy was chosen. The problem with this simulator and others like it is that it is set up for land-based robots only. This paper explores one possible way to get around this limitation. This solution cannot only work for underwater vehicles but aerial vehicles as well.