System supports for protocol and application adaptation in vertical handoffs

In overlay networks, the network characteristics before and after a vertical handoff would be drastically different. Consequently, in this paper, we propose an end‐to‐end based scheme to support protocol and application adaptation in vertical handoffs. First, we proposed a Vertical‐handoff Aware TCP, called VA‐TCP. VA‐TCP can identify the packet losses caused by vertical handoffs. If segments losses are due to vertical handoffs, VA‐TCP only retransmits the missing segments but does not invoke the congestion control procedure. Moreover, VA‐TCP dynamically estimates the bandwidth and round‐trip time in a new network. Based on the estimated bandwidth and round‐trip time, VA‐TCP adjusts its parameters to respond to the new network environment. Second, during a vertical handoff, applications also need to be adapted accordingly. Therefore, we design a programming interface that allows applications to be notified upon and adapt to changing network environments. To support our interface, we utilize the signal mechanism to achieve kernel‐to‐user notification. Nevertheless, signals cannot carry information. Thus, we implement the shared memory mechanism between applications and the kernel to facilitate parameters exchange. Finally, we also provide a handoff‐aware CPU scheduler so that tasks that are interested in the vertical‐handoff event are given preference over other processes to attain a prompt response for new network conditions. We have implemented a prototype system on the Linux kernel 2.6. From the experimental results, our proposed protocol and application adaptation mechanisms are shown to effectively improve the performance of TCP and applications during vertical handoffs. Copyright © 2008 John Wiley & Sons, Ltd.     

A compiler for parsing schemata

We present a compiler that can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and to ensure that the generated implementations are efficient. The system described is general enough to be able to handle all kinds of schemata for different grammar formalisms, such as context‐free grammars and tree‐adjoining grammars, and it provides an extensibility mechanism allowing the user to define custom notational elements. This compiler has proven very useful for analyzing, prototyping and comparing natural‐language parsers in real domains, as can be seen in the empirical examples provided at the end of the paper. Copyright © 2008 John Wiley & Sons, Ltd.     

A passive tree-based backbone construction scheme for MANETs

Backbone-based broadcast schemes are effective in alleviating the broadcast storm problem in mobile ad hoc networks (MANETs). However, periodically hello packets used to maintain a backbone usually lead to extra control overhead. In this paper, passive tree-based backbone construction scheme (PTBCS) is proposed as a backbone construction scheme for MANETs. Different from other schemes, each node in PTBCS determines its role by intercepting packet transmissions in the air during a special waiting period. Hence, its most remarkable advantage is that there are no periodical packet transmissions specially for backbone construction. The property that the nodes selected by PTBCS make up a connected dominating set (CDS) of the network is proven with several ideal assumptions. Simulation results show that PTBCS is effective when compared with some other typical backbone construction schemes.     

Linkless Octree Using Multi‐Level Perfect Hashing

The standard C/C++ implementation of a spatial partitioning data structure, such as octree and quadtree, is often inefficient in terms of storage requirements particularly when the memory overhead for maintaining parent‐to‐child pointers is significant with respect to the amount of actual data in each tree node. In this work, we present a novel data structure that implements uniform spatial partitioning without storing explicit parent‐to‐child pointer links. Our linkless tree encodes the storage locations of subdivided nodes using perfect hashing while retaining important properties of uniform spatial partitioning trees, such as coarse‐to‐fine hierarchical representation, efficient storage usage, and efficient random accessibility. We demonstrate the performance of our linkless trees using image compression and path planning examples.     

Group decision making with incomplete fuzzy linguistic preference relations

The aim of this paper is to propose a procedure to estimate missing preference values when dealing with incomplete fuzzy linguistic preference relations assessed using a two‐tuple fuzzy linguistic approach. This procedure attempts to estimate the missing information in an individual incomplete fuzzy linguistic preference relation using only the preference values provided by the respective expert. It is guided by the additive consistency property to maintain experts' consistency levels. Additionally, we present a selection process of alternatives in group decision making with incomplete fuzzy linguistic preference relations and analyze the use of our estimation procedure in the decision process. © 2008 Wiley Periodicals, Inc.     

Chameleon hash without key exposure based on Schnorr signature

Based on the famous Schnorr signature scheme, we propose a new chameleon hash scheme which enjoys all advantages of the previous schemes: collision-resistant, message-hiding, semantic security, and key-exposure-freeness.     

Clonal optimization-based negative selection algorithm with applications in motor fault detection

The Negative Selection Algorithm (NSA) and clonal selection method are two typical kinds of artificial immune systems. In this paper, we first introduce their underlying inspirations and working principles. It is well known that the regular NSA detectors are not guaranteed to always occupy the maximal coverage of the nonself space. Therefore, we next employ the clonal optimization method to optimize these detectors so that the best anomaly detection performance can be achieved. A new motor fault detection scheme using the proposed NSA is also presented and discussed. We demonstrate the efficiency of our approach with an interesting example of motor bearings fault detection, in which the detection rates of three bearings faults are significantly improved.     

An expert system using rough sets theory for aided conceptual design of ship’s engine room automation

More and more complicated conceptual design of ship’s engine room (CDSER) heavily depends on designers’ engineering knowledge and existing ship data. To achieve intelligent design at the initial ship design stage, many researchers have made much significant progress in this field, however, most of them only focused on how to find the similar constructed ships. At present, how to utilize these existing data remains an untouched topic. In order to make good use of the existing data and reduce the dependence on designers’ experience, a novel system named Expert System for Aided Conceptual Design of Ship’s Engine Room Automation (ESACD), is elaborated in this study. With the support of the constructed Ship Data Warehouse System, two core subsystems Configuration Selection Assistant (CSA) and Design Scheme Decision Assistant (DSDA) are included in ESACD. A promising approach integrating Fuzzy c-means algorithm (FCM) and Rough Sets Theory (RST) to extract configuration rules from the stored data is adopted in CSA. According to engineers’ proposals, RST is utilized to reason knowledge in incomplete scheme information systems for getting design scheme rules in DSDA, which are useful suggestions for engineers to get better schemes at this stage. Finally, the validity and necessity of this interactive expert system are demonstrated through the CDSER of a new 50,000 DWT Handymax bulk carrier. It is proved that ESACD can efficiently facilitate rapid and intelligent design in CDSER, and reduce the cost of a new ship design.