Ara Khil

Efficient Fuzzy Rules For Classification

Fuzzy rules are suitable for describing uncertain phenomena and natural for human understanding and they are, in general, efficient for classification. In this paper, we propose an optimized fuzzy rule generation method for classification both in accuracy and comprehensibility (or rule complexity). We investigate the use of genetic algorithm to determine an optimal set of membership functions for quantitative data. In our method, for a given set of membership functions a fuzzy decision tree is constructed and its accuracy and rule complexity are evaluated, which are combined into the fitness function to be optimized. We have experimented our algorithm with several benchmark data sets. The experiment results show that our method is more efficient in performance and compactness of rules compared with the existing methods

Main Content Extraction from Web Documents Using Text Block Context

Due to various Web authoring tools, the new web standards, and improved web accessibility, a wide variety of Web contents are being produced very quickly. In such an environment, in order to provide appropriate Web services to users’ needs it is important to quickly and accurately extract relevant information from Web documents and remove irrelevant contents such as advertisements. In this paper, we propose a method that extracts main content accurately from HTML Web documents. In the method, a decision tree is built and used to classify each block of text whether it is a part of the main content. For classification we use contextual features around text blocks including word density, link density, HTML tag distribution, and distances between text blocks. We experimented with our method using a published data set and a data set that we collected. The experiment results show that our method performs 19% better in F-measure compared to the existing best performing method.

The improvement of mobile phone voice quality by bone-conduction device

This paper proposes a new way of reducing noise and enhancing speech signals of mobile phones by installing bone-conduction speakers in ordinary mobile phones. With this new system, the noise from surrounding environments can be reduced and eventually the quality and clarity of voice signals coming out of mobile phones can be improved. The improved voice quality of mobile phones was confirmed by the experiment which measured frequency responses as well as emotional responses before and after the activation of the proposed system.

Pitch Detection Based on Signal-to-Noise-Ratio Estimation and Compensation for Continuous Speech Signal

On speech signal processing, it is very important to find the pitch period of voice. The reason is why it is used in variable places, such as speech-enhancement-system, speech-recognition system, speaker-classification-system, and handicapped assisting-system. It is, however, difficult to detect the accurate pitch on the low SNR section caused by the voice transition or the corrupted signal by noise. In this paper, we propose the method which is able to detect the more accurate pitch based on the Signal to Noise Ratio(SNR) estimation by the SNR compensation for continuous speech signals. We show the improved performance of the proposed pitch detection by the implemented results for the pitch contour of variable SNR signals.

Scheduling of multimedia traffic for continuous media in packet-switched networks

Many of multimedia applications in distributed systems should transmit continuous audio/video across networks when clients request. Typically, messages for continuous media in packet-switched networks are split into periodic, different sized packets with deadlines. Since clients request different types services, traffic streams are heterogeneous. Furthermore, since the continuity of continuous media should be preserved, non-preemptive scheduling is preferred in multimedia communications. In this paper, we present a new non-preemptive scheduling algorithm which guarantees the timely delivery of more sets of messages for continuous media on a communication link connected to packet-switched networks. It schedules messages by using a heuristic based on the earliest deadline first (EDF) policy. It can always find a feasible schedule for messages which are schedulable by the EDF algorithm. We also present admission control given as sufficient conditions for a set of messages to be schedulable by our scheduling algorithm for controlling the traffic load on a link. If a new request and the previous messages satisfy these conditions, it accepts the new request. The accepted message transmission is done like the circuit-switched transmission non-preemptively. Finally, we show the improvements in performance of our scheduling algorithm by simulation results.

Optimization of a Cart Capacity Using the Three-Dimensional Single Bin Packing Problem for a Serving Robot

Given a set of rectangular-shaped items such as dishes, cups, saucers, or forks and a rectangular tray of a cart, the three-dimensional single bin packing problem (3D-BPP) involves orthogonally packing a subset of the items within the tray. If the value of an item is given by its volume, the objective is to maximize the covered volume of the tray. Thus, this paper aims to optimize the transport capacity of a serving robot carrying a cart. This experiment, the first of its type, proves the feasibility of this endeavor efficiently.

Energy-efficient routing protocol depending on dynamic message communication over wireless sensor network

We propose an energy-efficient routing mechanism for maintaining uniform distribution of each sensors energy through shorter paths. We define two metrics – energy level and vector information. The energy level describes how much the energy of the sensor remains and the vector information explains whether the direction towards the sink. Using the two factors, we choose leaders with higher energy level and the vector information when any sensor node tries to send the sink some messages. Whenever the sensor node delivers each one message to the sink, the selected leader node may be different dynamically through our defined two metrics. So we expect that the energy level of every sensor node can be maintained uniformly over the entire sensor network. Therefore, sudden sensor failure caused by battery exhaust and network partition caused by some sensors sudden deaths can be prevented. We analyze our DyMC through evaluating and comparing with existing research such as directed diffusion.

Dynamic code reservation multiple access for supporting various-bit-rate integrated traffics in slotted DS-CDMA systems

Recently, several works have been proposed for media access control protocols which are based on slotted direct-sequence code-division multiple-access and support integrated traffics. In this paper, we propose dynamic code reservation multiple access (DCRMA) which can enhance the previous works. DCRMA extends a minislot technique to the integrated traffic environment and supports connection-oriented and connectionless traffic with various bit rates. Additionally, DCRMA develops a simultaneous transmission scheme to reduce average message transmission delay for connectionless traffic. Packet dropping probability is analyzed for connection-oriented traffic with various bit rates using an embedded Markov chain model. Simulations are also performed to further investigate the integration of connection-oriented and connectionless traffics.