An Enhanced Distributed System to improve theTime Complexity of Binary Indexed Trees

Distributed Computing Systems are usually considered the most suitable model for practical solutions of many parallel algorithms. In this paper an enhanced distributed system is presented to improve the time complexity of Binary Indexed Trees (BIT). The proposed system uses multi-uniform processors with identical architectures and a specially designed distributed memory system. The analysis of this system has shown that it has reduced the time complexity of the read query to O(Log(Log(N))), and the update query to constant complexity, while the naive solution has a time complexity of O(Log(N)) for both queries. The system was implemented and simulated using VHDL and Verilog Hardware Description Languages, with xilinx ISE 10.1, as the development environment and ModelSim 6.1c, similarly as the simulation tool. The simulation has shown that the overhead resulting by the wiring and communication between the system fragments could be fairly neglected, which makes it applicable to practically reach the maximum speed up offered by the proposed model.

Decolorization of Reactive Black 5 and Reactive Red 198 using Nanoscale Zerovalent Iron

Residual dye contents in textile dyeing wastewater have complex aromatic structures that are resistant to degrade in biological wastewater treatment. The objectives of this study were to determine the effectiveness of nanoscale zerovalent iron (NZVI) to decolorize Reactive Black 5 (RB5) and Reactive Red 198 (RR198) in synthesized wastewater and to investigate the effects of the iron particle size, iron dosage and solution pHs on the destruction of RB5 and RR198. Synthesized NZVI was confirmed by transmission electron microscopy (TEM), X-ray diffraction (XRD), and X-ray photoelectron spectroscopy (XPS). The removal kinetic rates (kobs) of RB5 (0.0109 min-1) and RR198 (0.0111 min-1) by 0.5% NZVI were many times higher than those of microscale zerovalent iron (ZVI) (0.0007 min-1 and 0.0008 min-1, respectively). The iron dosage increment exponentially increased the removal efficiencies of both RB5 and RR198. Additionally, lowering pH from 9 to 5 increased the decolorization kinetic rates of both RB5 and RR198 by NZVI. The destruction of azo bond (N=N) in the chromophore of both reactive dyes led to decolorization of dye solutions.

Parallel Branch and Bound Model Using Logarithmic Sampling (PBLS) for Symmetric Traveling Salesman Problem

Very Large and/or computationally complex optimization problems sometimes require parallel or highperformance computing for achieving a reasonable time for computation. One of the most popular and most complicate problems of this family is “Traveling Salesman Problem". In this paper we have introduced a Branch & Bound based algorithm for the solution of such complicated problems. The main focus of the algorithm is to solve the “symmetric traveling salesman problem". We reviewed some of already available algorithms and felt that there is need of new algorithm which should give optimal solution or near to the optimal solution. On the basis of the use of logarithmic sampling, it was found that the proposed algorithm produced a relatively optimal solution for the problem and results excellent performance as compared with the traditional algorithms of this series.

Segmentation Problems and Solutions in Printed Degraded Gurmukhi Script

Character segmentation is an important preprocessing step for text recognition. In degraded documents, existence of touching characters decreases recognition rate drastically, for any optical character recognition (OCR) system. In this paper we have proposed a complete solution for segmenting touching characters in all the three zones of printed Gurmukhi script. A study of touching Gurmukhi characters is carried out and these characters have been divided into various categories after a careful analysis. Structural properties of the Gurmukhi characters are used for defining the categories. New algorithms have been proposed to segment the touching characters in middle zone, upper zone and lower zone. These algorithms have shown a reasonable improvement in segmenting the touching characters in degraded printed Gurmukhi script. The algorithms proposed in this paper are applicable only to machine printed text. We have also discussed a new and useful technique to segment the horizontally overlapping lines.

Simulation of Lightning Surge Propagation in Transmission Lines Using the FDTD Method

This paper describes a finite-difference time-domainFDTD) method to analyze lightning surge propagation in electric transmission lines. Numerical computation of solving the Telegraphist-s equations is determined and investigated its effectiveness. A source of lightning surge wave on power transmission lines is modeled by using Heidler-s surge model. The proposed method was tested against medium-voltage power transmission lines in comparison with the solution obtained by using lattice diagram. As a result, the calculation showed that the method is one of accurate methods to analyze transient lightning wave in power transmission lines.

Control Strategy for an Active Suspension System

The paper presents the virtual model of the active suspension system used for improving the dynamic behavior of a motor vehicle. The study is focused on the design of the control system, the purpose being to minimize the effect of the road disturbances (which are considered as perturbations for the control system). The analysis is performed for a quarter-car model, which corresponds to the suspension system of the front wheel, by using the DFC (Design for Control) software solution EASY5 (Engineering Analysis Systems) of MSC Software. The controller, which is a PIDbased device, is designed through a parametric optimization with the Matrix Algebra Tool (MAT), considering the gain factors as design variables, while the design objective is to minimize the overshoot of the indicial response.

Permanence and Almost Periodic Solutions to an Epidemic Model with Delay and Feedback Control

This paper is concerned with an epidemic model with delay. By using the comparison theorem of the differential equation and constructing a suitable Lyapunov functional, Some sufficient conditions which guarantee the permeance and existence of a unique globally attractive positive almost periodic solution of the model are obtain. Finally, an example is employed to illustrate our result.

A Graph-Based Approach for Placement of No-Replicated Databases in Grid

On a such wide-area environment as a Grid, data placement is an important aspect of distributed database systems. In this paper, we address the problem of initial placement of database no-replicated fragments in Grid architecture. We propose a graph based approach that considers resource restrictions. The goal is to optimize the use of computing, storage and communication resources. The proposed approach is developed in two phases: in the first phase, we perform fragment grouping using knowledge about fragments dependency and, in the second phase, we determine an efficient placement of the fragment groups on the Grid. We also show, via experimental analysis that our approach gives solutions that are close to being optimal for different databases and Grid configurations.

The Identification of Anuran Glial Cells

Attempts were made to identify anuran glial cells. They were found as nervous tissue resident. Having stage dependent morphotype changes, whereby, appeared as an ovoid to oval in resting state and amoeboid mrophotypes in activated state, stained fairly with methylene blue and take up Pelikane blue 10% aqueous solution, as well as having the ability to phagocytize heat killed Staphylococcus aureus. They were delineated from the migrating peripheral monocytes by morphotypic and morphometeric differences. Such criteria were consistence with glial cells. Thus, the anuran glial cells are being identified in the frog Rana ridibunda Pallas 1771 and this animal can be of use as a simple model for the immunobiology of glial cells.

Negotiation Support for Value-based Decision in Construction

A Negotiation Support is required on a value-based decision to enable each stakeholder to evaluate and rank the solution alternatives before engaging into negotiation with the other stakeholders. This study demonstrates a process of negotiation support model for selection of a building system from value-based design perspective. The perspective is based on comparison of function and cost of a building system. Multi criteria decision techniques were applied to determine the relative value of the alternative solutions for performing the function. A satisfying option game theory are applied to the criteria of value-based decision which are LCC (life cycle cost) and function based FAST. The results demonstrate a negotiation process to select priorities of a building system. The support model can be extended to an automated negotiation by combining value based decision method, group decision and negotiation support.

Arrival and Departure Scheduling at Hub Airports Considering Airlines Level

As the air traffic increases at a hub airport, some flights cannot land or depart at their preferred target time. This event happens because the airport runways become occupied to near their capacity. It results in extra costs for both passengers and airlines because of the loss of connecting flights or more waiting, more fuel consumption, rescheduling crew members, etc. Hence, devising an appropriate scheduling method that determines a suitable runway and time for each flight in order to efficiently use the hub capacity and minimize the related costs is of great importance. In this paper, we present a mixed-integer zero-one model for scheduling a set of mixed landing and departing flights (despite of most previous studies considered only landings). According to the fact that the flight cost is strongly affected by the level of airline, we consider different airline categories in our model. This model presents a single objective minimizing the total sum of three terms, namely 1) the weighted deviation from targets, 2) the scheduled time of the last flight (i.e., makespan), and 3) the unbalancing the workload on runways. We solve 10 simulated instances of different sizes up to 30 flights and 4 runways. Optimal solutions are obtained in a reasonable time, which are satisfactory in comparison with the traditional rule, namely First- Come-First-Serve (FCFS) that is far apart from optimality in most cases.

The Effect of Carbon on Molybdenum in the Preparation of Microwave Induced Molybdenum Carbide

This study shows the effect of carbon towards molybdenum carbide alloy when exposed to Microwave. This technique is also known as Microwave Induced Alloying (MIA) for the preparation of molybdenum carbide. In this study ammonium heptamolybdate solution and carbon black powder were heterogeneously mixed and exposed to microwave irradiation for 2 minutes. The effect on amount of carbon towards the produced alloy on morphological and oxidation states changes during microwave is presented. In this experiment, it is expected carbon act as a reducing agent with the ratio 2:7 molybdenum to carbon as the optimum for the production of molybdenum carbide alloy. All the morphological transformations and changes in this experiment were followed and characterized using X-Ray Diffraction and FESEM.

The removal of Ni, Cu and Fe from a Mixed Metal System using Sodium Hypophosphite as a Reducing Agent

The main objective of this study was to remove and recover Ni, Cu and Fe from a mixed metal system using sodium hypophosphite as a reducing agent and nickel powder as seeding material. The metal systems studied consisted of Ni-Cu, Ni-Fe and Ni-Cu-Fe solutions. A 5 L batch reactor was used to conduct experiments where 100 mg/l of each respective metal was used. It was found that the metals were reduced to their elemental form with removal efficiencies of over 80%. The removal efficiency decreased in the order Fe>Ni>Cu. The metal powder obtained contained between 97-99% Ni and was almost spherical and porous. Size enlargement by aggregation was the dominant particulate process.

An Analytical Solution for Vibration of Elevator Cables with Small Bending Stiffness

Responses of the dynamical systems are highly affected by the natural frequencies and it has a huge impact on design and operation of high-rise and high-speed elevators. In the present paper, the variational iteration method (VIM) is employed to investigate better understanding the dynamics of elevator cable as a single-degree-of-freedom (SDOF) swing system. Comparisons made among the results of the proposed closed-form analytical solution, the traditional numerical iterative time integration solution, and the linearized governing equations confirm the accuracy and efficiency of the proposed approach. Furthermore, based on the results of the proposed closed-form solution, the linearization errors in calculating the natural frequencies in different cases are discussed.

Nodal Load Profiles Estimation for Time Series Load Flow Using Independent Component Analysis

This paper presents a method to estimate load profile in a multiple power flow solutions for every minutes in 24 hours per day. A method to calculate multiple solutions of non linear profile is introduced. The Power System Simulation/Engineering (PSS®E) and python has been used to solve the load power flow. The result of this power flow solutions has been used to estimate the load profiles for each load at buses using Independent Component Analysis (ICA) without any knowledge of parameter and network topology of the systems. The proposed algorithm is tested with IEEE 69 test bus system represents for distribution part and the method of ICA has been programmed in MATLAB R2012b version. Simulation results and errors of estimations are discussed in this paper.

A Computational Stochastic Modeling Formalism for Biological Networks

Stochastic models of biological networks are well established in systems biology, where the computational treatment of such models is often focused on the solution of the so-called chemical master equation via stochastic simulation algorithms. In contrast to this, the development of storage-efficient model representations that are directly suitable for computer implementation has received significantly less attention. Instead, a model is usually described in terms of a stochastic process or a "higher-level paradigm" with graphical representation such as e.g. a stochastic Petri net. A serious problem then arises due to the exponential growth of the model-s state space which is in fact a main reason for the popularity of stochastic simulation since simulation suffers less from the state space explosion than non-simulative numerical solution techniques. In this paper we present transition class models for the representation of biological network models, a compact mathematical formalism that circumvents state space explosion. Transition class models can also serve as an interface between different higher level modeling paradigms, stochastic processes and the implementation coded in a programming language. Besides, the compact model representation provides the opportunity to apply non-simulative solution techniques thereby preserving the possible use of stochastic simulation. Illustrative examples of transition class representations are given for an enzyme-catalyzed substrate conversion and a part of the bacteriophage λ lysis/lysogeny pathway.

Tailoring the Sharpness of Tungsten Nanotips via Laser Irradiation Enhanced Etching in KOH

Controlled modification of appropriate sharpness for nanotips is of paramount importance to develop novel materials and functional devices at a nanometer resolution. Herein, we present a reliable and unique strategy of laser irradiation enhanced physicochemical etching to manufacture super sharp tungsten tips with reproducible shape and dimension as well as high yields (~80%). The corresponding morphology structure evolution of tungsten tips and laser-tip interaction mechanisms were systematically investigated and discussed using field emission scanning electron microscope (SEM) and physical optics statistics method with different fluences under 532 nm laser irradiation. This work paves the way for exploring more accessible metallic tips applications with tunable apex diameter and aspect ratio, and, furthermore, facilitates the potential sharpening enhancement technique for other materials used in a variety of nanoscale devices.

Motions of Multiple Objects Detection Based On Video Frames

This paper introduces an intelligent system, which can be applied in the monitoring of vehicle speed using a single camera. The ability of motion tracking is extremely useful in many automation problems and the solution to this problem will open up many future applications. One of the most common problems in our daily life is the speed detection of vehicles on a highway. In this paper, a novel technique is developed to track multiple moving objects with their speeds being estimated using a sequence of video frames. Field test has been conducted to capture real-life data and the processed results were presented. Multiple object problems and noisy in data are also considered. Implementing this system in real-time is straightforward. The proposal can accurately evaluate the position and the orientation of moving objects in real-time. The transformations and calibration between the 2D image and the actual road are also considered.

Crank-Nicolson Difference Scheme for the Generalized Rosenau-Burgers Equation

In this paper, numerical solution for the generalized Rosenau-Burgers equation is considered and Crank-Nicolson finite difference scheme is proposed. Existence of the solutions for the difference scheme has been shown. Stability, convergence and priori error estimate of the scheme are proved. Numerical results demonstrate that the scheme is efficient and reliable.

An Implementation of MacMahon's Partition Analysis in Ordering the Lower Bound of Processing Elements for the Algorithm of LU Decomposition

A lot of Scientific and Engineering problems require the solution of large systems of linear equations of the form bAx in an effective manner. LU-Decomposition offers good choices for solving this problem. Our approach is to find the lower bound of processing elements needed for this purpose. Here is used the so called Omega calculus, as a computational method for solving problems via their corresponding Diophantine relation. From the corresponding algorithm is formed a system of linear diophantine equalities using the domain of computation which is given by the set of lattice points inside the polyhedron. Then is run the Mathematica program DiophantineGF.m. This program calculates the generating function from which is possible to find the number of solutions to the system of Diophantine equalities, which in fact gives the lower bound for the number of processors needed for the corresponding algorithm. There is given a mathematical explanation of the problem as well. Keywordsgenerating function, lattice points in polyhedron, lower bound of processor elements, system of Diophantine equationsand : calculus.