Unequal Error Protection for Region of Interest with Embedded Zerotree Wavelet

This paper describes a new method of unequal error protection (UEP) for region of interest (ROI) with embedded zerotree wavelet algorithm (EZW). ROI technique is important in applications with different parts of importance. In ROI coding, a chosen ROI is encoded with higher quality than the background (BG). Unequal error protection of image is provided by different coding techniques. In our proposed method, image is divided into two parts (ROI, BG) that consist of more important bytes (MIB) and less important bytes (LIB). The experimental results verify effectiveness of the design. The results of our method demonstrate the comparison of the unequal error protection (UEP) of image transmission with defined ROI and the equal error protection (EEP) over multiple noisy channels.

A Fuzzy Dynamic Load Balancing Algorithm for Homogenous Distributed Systems

Load balancing in distributed computer systems is the process of redistributing the work load among processors in the system to improve system performance. Most of previous research in using fuzzy logic for the purpose of load balancing has only concentrated in utilizing fuzzy logic concepts in describing processors load and tasks execution length. The responsibility of the fuzzy-based load balancing process itself, however, has not been discussed and in most reported work is assumed to be performed in a distributed fashion by all nodes in the network. This paper proposes a new fuzzy dynamic load balancing algorithm for homogenous distributed systems. The proposed algorithm utilizes fuzzy logic in dealing with inaccurate load information, making load distribution decisions, and maintaining overall system stability. In terms of control, we propose a new approach that specifies how, when, and by which node the load balancing is implemented. Our approach is called Centralized-But-Distributed (CBD).

Synthesis of Analogue to Camptothecine

Camptothecin (CPT) is a cytotoxic quinoline alkaloid, which inhibits the DNA enzyme topoisomerase I (topo I). It was discovered in 1966 by M. E. Wall and M. C. Wani in systematic screening of natural products for anticancer drugs. It was isolated from the bark and stem of Camptotheca acuminata (Camptotheca, Happy tree), a tree native in China. CPT showed remarkable anticancer activity in preliminary clinical trials but also low solubility and (high) adverse drug reaction. Because of these disadvantages synthetic and medicinal chemists have developed numerous syntheses of Camptothecine [1][2][3] and various derivatives to increase the benefits of the chemical, with good results. In our method CPT analogues has be six steps starting from available material DL Malic acid.

On SNR Estimation by the Likelihood of near Pitch for Speech Detection

People have the habitual pitch level which is used when people say something generally. However this pitch should be changed irregularly in the presence of noise. So it is useful to estimate SNR of speech signal by pitch. In this paper, we obtain the energy of input speech signal and then we detect a stationary region on voiced speech. And we get the pitch period by NAMDF for the stationary region that is not varied pitch rapidly. After getting pitch, each frame is divided by pitch period and the likelihood of closed pitch is estimated. In this paper, we proposed new parameter, NLF, to estimate the SNR of received speech signal. The NLF is derived from the correlation of near pitch periods. The NLF is obtained for each stationary region in voiced speech. Finally we confirmed good performance of the estimation of the SNR of received input speech in the presence of noise.

Bandwidth allocation in ATM Network for different QOS Requirements

For future Broad band ISDN, Asynchronous Transfer Mode (ATM) is designed not only to support a wide range of traffic classes with diverse flow characteristics, but also to guarantee the different quality of service QOS requirements. The QOS may be measured in terms of cell loss probability and maximum cell delay. In this paper, ATM networks in which the virtual path (VP) concept is implemented are considered. By applying the Markov Deterministic process method, an efficient algorithm to compute the minimum capacity required to satisfy the QOS requirements when multiple classes of on-off are multiplexed on to a single VP. Using the result, we then proposed a simple algorithm to determine different combinations of VP to achieve the optimum of the total capacity required for satisfying the individual QOS requirements (loss- delay).

A Programming Solution for Moving Mobile Transaction

In this paper, our concern is the management of mobile transactions in the shared area among many servers, when the mobile user moves from one cell to another in online partiallyreplicated distributed mobile database environment. We defined the concept of transaction and classified the different types of transactions. Based on this analysis, we propose an algorithm that handles the disconnection due to moving among sites.

MONPAR - A Page Replacement Algorithm for a Spatiotemporal Database

For a spatiotemporal database management system, I/O cost of queries and other operations is an important performance criterion. In order to optimize this cost, an intense research on designing robust index structures has been done in the past decade. With these major considerations, there are still other design issues that deserve addressing due to their direct impact on the I/O cost. Having said this, an efficient buffer management strategy plays a key role on reducing redundant disk access. In this paper, we proposed an efficient buffer strategy for a spatiotemporal database index structure, specifically indexing objects moving over a network of roads. The proposed strategy, namely MONPAR, is based on the data type (i.e. spatiotemporal data) and the structure of the index structure. For the purpose of an experimental evaluation, we set up a simulation environment that counts the number of disk accesses while executing a number of spatiotemporal range-queries over the index. We reiterated simulations with query sets with different distributions, such as uniform query distribution and skewed query distribution. Based on the comparison of our strategy with wellknown page-replacement techniques, like LRU-based and Prioritybased buffers, we conclude that MONPAR behaves better than its competitors for small and medium size buffers under all used query-distributions.

Implementing Adaptive Steganography by Exploring the Ycbcr Color Model Characteristics

Stegnography is a new way of secret communication the most widely used mechanism on account of its simplicity is the use of the least significant bit. We have used the least significant bit (2 LSB and 4 LSB) substitution method. Depending upon the characteristics of the individual portions of cover image we decide whether to use 2 LSB or 4 LSB thus it is an adaptive stegnography technique. We used one of the three channels to behave as indicator to indicate the presence of hidden data in other two channels. The module showed impressive results in terms of capacity to hide the data. In proposed method, instead of using RGB color space directly, YCbCr color space is used to make use of human visual system characteristic.

Venice 17th Century: The Greek Ethnic Identity in Danger

At the end of the 17th Century the Greek orthodox Archbishop in Venice -Meletios Typaldos- decided to turn the doctrine of the orthodox Greeks into Catholicism. More than 5.000 Greeks were living in Venice then. Their leadership -the Greek confraternity- fought against Meletios. Participants in this conflict were the Pope, the ecumenical Patriarch in Constantinople and Peter the Great of Russia. All the play according to my opinion -which is followed by evidence and theoretical support is a strong conflict between the two actors -the Archbishop and the Confraternity- and the object of conflict is the change of the Greek orthodox beliefs to Catholicism. Ethnicity especially for Greeks of the era is identified with orthodoxy. So this was a conflict of identity. The results of that conflict were of tremendous importance to the Greeks in Venice and affected them for long.

Application of a Novel Audio Compression Scheme in Automatic Music Recommendation, Digital Rights Management and Audio Fingerprinting

Rapid progress in audio compression technology has contributed to the explosive growth of music available in digital form today. In a reversal of ideas, this work makes use of a recently proposed efficient audio compression scheme to develop three important applications in the context of Music Information Retrieval (MIR) for the effective manipulation of large music databases, namely automatic music recommendation (AMR), digital rights management (DRM) and audio finger-printing for song identification. The performance of these three applications has been evaluated with respect to a database of songs collected from a diverse set of genres.

ORPP with MAIEP Based Technique for Loadability Enhancement

One of the factors to maintain system survivability is the adequate reactive power support to the system. Lack of reactive power support may cause undesirable voltage decay leading to total system instability. Thus, appropriate reactive power support scheme should be arranged in order to maintain system stability. The strength of a system capacity is normally denoted as system loadability. This paper presents the enhancement of system loadability through optimal reactive power planning technique using a newly developed optimization technique, termed as Multiagent Immune Evolutionary Programming (MAIEP). The concept of MAIEP is developed based on the combination of Multiagent System (MAS), Artificial Immune System (AIS) and Evolutionary Programming (EP). In realizing the effectiveness of the proposed technique, validation is conducted on the IEEE-26-Bus Reliability Test System. The results obtained from pre-optimization and post-optimization process were compared which eventually revealed the merit of MAIEP.

Navigation of Multiple Mobile Robots using Rule-based-Neuro-Fuzzy Technique

This paper deals with motion planning of multiple mobile robots. Mobile robots working together to achieve several objectives have many advantages over single robot system. However, the planning and coordination between the mobile robots is extremely difficult. In the present investigation rule-based and rulebased- neuro-fuzzy techniques are analyzed for multiple mobile robots navigation in an unknown or partially known environment. The final aims of the robots are to reach some pre-defined goals. Based upon a reference motion, direction; distances between the robots and obstacles; and distances between the robots and targets; different types of rules are taken heuristically and refined later to find the steering angle. The control system combines a repelling influence related to the distance between robots and nearby obstacles and with an attracting influence between the robots and targets. Then a hybrid rule-based-neuro-fuzzy technique is analysed to find the steering angle of the robots. Simulation results show that the proposed rulebased- neuro-fuzzy technique can improve navigation performance in complex and unknown environments compared to this simple rulebased technique.

Strongly Screenableness and its Tychonoff Products

In this paper, we prove that if X is regular strongly screenable DC-like (C-scattered), then X ×Y is strongly screenable for every strongly screenable space Y . We also show that the product i∈ω Yi is strongly screenable if every Yi is a regular strongly screenable DC-like space. Finally, we present that the strongly screenableness are poorly behaved with its Tychonoff products.

Adaptive Non-linear Filtering Technique for Image Restoration

Removing noise from the any processed images is very important. Noise should be removed in such a way that important information of image should be preserved. A decisionbased nonlinear algorithm for elimination of band lines, drop lines, mark, band lost and impulses in images is presented in this paper. The algorithm performs two simultaneous operations, namely, detection of corrupted pixels and evaluation of new pixels for replacing the corrupted pixels. Removal of these artifacts is achieved without damaging edges and details. However, the restricted window size renders median operation less effective whenever noise is excessive in that case the proposed algorithm automatically switches to mean filtering. The performance of the algorithm is analyzed in terms of Mean Square Error [MSE], Peak-Signal-to-Noise Ratio [PSNR], Signal-to-Noise Ratio Improved [SNRI], Percentage Of Noise Attenuated [PONA], and Percentage Of Spoiled Pixels [POSP]. This is compared with standard algorithms already in use and improved performance of the proposed algorithm is presented. The advantage of the proposed algorithm is that a single algorithm can replace several independent algorithms which are required for removal of different artifacts.

Effectiveness of Cellular Phone with Active RFID Tag for Evacuation - The Case of Evacuation from the Underground Shopping Mall of Tenjin

The underground shopping mall has the constructional problem of the fire evacuation. Also, the people sometimes lose their direction and information of current time in the mall. If the emergencies such as terrorist explosions or gas explosions are happened, they have to go out soon. Under such circumstances, inside of the mall has high risk for life. In this research, the authors propose a way that he/she can go out from the underground shopping mall quickly. If the narrow exits are discovered by using active RFID (Radio Frequency Identification) tags and using cellular phones, they can evacuate as soon as possible. To verify this hypothesis, the authors design the model and carry out the agent-based simulation. They treat, as a case study, the Tenjin mall in Fukuoka Prefecture in Japan. The result of the simulation is that the case of the pedestrian with using active RFID tags and cellular phones reduced the amount of time to spend on the evacuation. Even if the diffusion of RFID tags and cellular phones was not perfect, they could show the effectiveness of reducing the time of evacuation.

Real-Coded Genetic Algorithm for Robust Power System Stabilizer Design

Power system stabilizers (PSS) are now routinely used in the industry to damp out power system oscillations. In this paper, real-coded genetic algorithm (RCGA) optimization technique is applied to design robust power system stabilizer for both singlemachine infinite-bus (SMIB) and multi-machine power system. The design problem of the proposed controller is formulated as an optimization problem and RCGA is employed to search for optimal controller parameters. By minimizing the time-domain based objective function, in which the deviation in the oscillatory rotor speed of the generator is involved; stability performance of the system is improved. The non-linear simulation results are presented under wide range of operating conditions; disturbances at different locations as well as for various fault clearing sequences to show the effectiveness and robustness of the proposed controller and their ability to provide efficient damping of low frequency oscillations.

Multiple-Points Fault Signature's Dynamics Modeling for Bearing Defect Frequencies

Occurrence of a multiple-points fault in machine operations could result in exhibiting complex fault signatures, which could result in lowering fault diagnosis accuracy. In this study, a multiple-points defect model (MPDM) is proposed which can simulate fault signature-s dynamics for n-points bearing faults. Furthermore, this study identifies that in case of multiple-points fault in the rotary machine, the location of the dominant component of defect frequency shifts depending upon the relative location of the fault points which could mislead the fault diagnostic model to inaccurate detections. Analytical and experimental results are presented to characterize and validate the variation in the dominant component of defect frequency. Based on envelop detection analysis, a modification is recommended in the existing fault diagnostic models to consider the multiples of defect frequency rather than only considering the frequency spectrum at the defect frequency in order to incorporate the impact of multiple points fault.

A Force-directed Graph Drawing based on the Hierarchical Individual Timestep Method

In this paper, we propose a fast and efficient method for drawing very large-scale graph data. The conventional force-directed method proposed by Fruchterman and Rheingold (FR method) is well-known. It defines repulsive forces between every pair of nodes and attractive forces between connected nodes on a edge and calculates corresponding potential energy. An optimal layout is obtained by iteratively updating node positions to minimize the potential energy. Here, the positions of the nodes are updated every global timestep at the same time. In the proposed method, each node has its own individual time and time step, and nodes are updated at different frequencies depending on the local situation. The proposed method is inspired by the hierarchical individual time step method used for the high accuracy calculations for dense particle fields such as star clusters in astrophysical dynamics. Experiments show that the proposed method outperforms the original FR method in both speed and accuracy. We implement the proposed method on the MDGRAPE-3 PCI-X special purpose parallel computer and realize a speed enhancement of several hundred times.

Optimized Multiplier Based upon 6-Input Luts and Vedic Mathematics

A new approach has been used for optimized design of multipliers based upon the concepts of Vedic mathematics. The design has been targeted to state-of-the art field-programmable gate arrays (FPGAs). The multiplier generates partial products using Vedic mathematics method by employing basic 4x4 multipliers designed by exploiting 6-input LUTs and multiplexers in the same slices resulting in drastic reduction in area. The multiplier is realized on Xilinx FPGAs using devices Virtex-5 and Virtex-6.Carry Chain Adder was employed to obtain final products. The performance of the proposed multiplier was examined and compared to well-known multipliers such as Booth, Carry Save, Carry ripple, and array multipliers. It is demonstrated that the proposed multiplier is superior in terms of speed as well as power consumption.

GA based Optimal Sizing and Placement of Distributed Generation for Loss Minimization

This paper addresses a novel technique for placement of distributed generation (DG) in electric power systems. A GA based approach for sizing and placement of DG keeping in view of system power loss minimization in different loading conditions is explained. Minimal system power loss is obtained under voltage and line loading constraints. Proposed strategy is applied to power distribution systems and its effectiveness is verified through simulation results on 16, 37-bus and 75-bus test systems.