Search results for: Cramer Rao bound

Authors: Hossain Aziz, Rinku Mukherjee

Abstract:

A potential flow model is used to study the unsteady flow past two airfoils in configuration, each of which is suddenly set into motion. The airfoil bound vortices are modeled using lumped vortex elements and the wake behind the airfoil is modeled by discrete vortices. This consists of solving a steady state flow problem at each time-step where unsteadiness is incorporated through the “zero normal flow on a solid surface" boundary condition at every time instant. Additionally, along with the “zero normal flow on a solid surface" boundary condition Kelvin-s condition is used to compute the strength of the latest wake vortex shed from the trailing edge of the airfoil. Location of the wake vortices is updated at each time-step to get the wake shape at each time instant. Results are presented to show the effect of airfoil-airfoil interaction and airfoil-wake interaction on the aerodynamic characteristics of each airfoil.

Keywords: Aerodynamics, Airfoils, Configuration, Unsteady.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1992

Authors: P. Prakasam, M. Madheswaran

Abstract:

A generalized Digital Modulation Identification algorithm for adaptive demodulator has been developed and presented in this paper. The algorithm developed is verified using wavelet Transform and histogram computation to identify QPSK and QAM with GMSK and M–ary FSK modulations. It has been found that the histogram peaks simplifies the procedure for identification. The simulated results show that the correct modulation identification is possible to a lower bound of 5 dB and 12 dB for GMSK and QPSK respectively. When SNR is above 5 dB the throughput of the proposed algorithm is more than 97.8%. The receiver operating characteristics (ROC) has been computed to measure the performance of the proposed algorithm and the analysis shows that the probability of detection (Pd) drops rapidly when SNR is 5 dB and probability of false alarm (Pf) is smaller than 0.3. The performance of the proposed algorithm has been compared with existing methods and found it will identify all digital modulation schemes with low SNR.

Keywords: Bit Error rate, Receiver Operating Characteristics, Software Defined Radio, Wavelet Transform.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2379

Authors: Anton A. Larenkov, Alesya Ya Maruk

Abstract:

In the present study, highly effective iTLC single strip method for the determination of radiochemical purity (RCP) of ⁶⁸Ga-BCA-peptides was developed (with no double-developing, changing of eluents or other additional manipulation). In this method iTLC-SG strips and commonly used eluent TFA_aq. (3-5 % (v/v)) are used. The method allows determining each of the key radiochemical forms of ⁶⁸Ga (colloidal, bound, ionic) separately with the peaks separation being no less than 4 σ. Rf = 0.0-0.1 for ⁶⁸Ga-colloid; Rf = 0.5-0.6 for ⁶⁸Ga-BCA-peptides; Rf = 0.9-1.0 for ionic ⁶⁸Ga. The method is simple and fast: For developing length of 75 mm only 4-6 min is required (versus 18-20 min for pharmacopoeial method). The method has been tested on various compounds (including ⁶⁸Ga-DOTA-TOC, ⁶⁸Ga-DOTA-TATE, ⁶⁸Ga-NODAGA-RGD₂ etc.). The cross-validation work for every specific form of ⁶⁸Ga showed good correlation between method developed and control (pharmacopoeial) methods. The method can become convenient and much more informative replacement for pharmacopoeial methods, including HPLC.

Keywords: DOTA-TATE, 68Ga, quality control, radiochemical purity, radiopharmaceuticals, iTLC.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1943

Authors: Toru Murayama, Akinori Nagano, Zhi-Wei Luo

Abstract:

In this research, we study a control method of a multivehicle system while considering the limitation of communication range for each vehicles. When we control networked vehicles with limitation of communication range, it is important to control the communication network structure of a multi-vehicle system in order to keep the network-s connectivity. From this, we especially aim to control the network structure to the target structure. We formulate the networked multi-vehicle system with some disturbance and the communication constraints as a hybrid dynamical system, and then we study the optimal control problems of the system. It is shown that the system converge to the objective network structure in finite time when the system is controlled by the receding horizon method. Additionally, the optimal control probrems are convertible into the mixed integer problems and these problems are solvable by some branch and bound algorithm.

Keywords: Hybrid system, multi-vehicle system, receding horizon control, topology control.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1353

Authors: J. Tengrang, T. Rungrotmongkol, S. Hannongbua

Abstract:

Every 2-3 years the influenza B virus serves epidemics. Neuraminidase (NA) is an important target for influenza drug design. Although, oseltamivir, an oral neuraminidase drug, has been shown good inhibitory efficiency against wild-type of influenza B virus, the lower susceptibility to the R152K mutation has been reported. Better understanding of oseltamivir efficiency and resistance toward the influenza B NA wild-type and R152K mutant, respectively, could be useful for rational drug design. Here, two complex systems of wild-type and R152K NAs with oseltamivir bound were studied using molecular dynamics (MD) simulations. Based on 5-ns MD simulation, the loss of notable hydrogen bond and decrease in per-residue decomposition energy from the mutated residue K152 contributed to drug compared to those of R152 in wildtype were found to be a primary source of high-level of oseltamivir resistance due to the R152K mutation.

Keywords: Influenza B neuraminidase, Molecular dynamics simulation, Oseltamivir resistance, R152K mutant

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1858

Authors: Oğuzhan Hasançebi, Saeid Kazemzadeh Azad

Abstract:

Keywords: Structural design optimization, optimal sizing, metaheuristics, self-adaptive step-size search, steel trusses, steel frames.}

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1377

Authors: Samee Ullah Khan, Ishfaq Ahmad

Abstract:

This paper proposes a novel game theoretical technique to address the problem of data object replication in largescale distributed computing systems. The proposed technique draws inspiration from computational economic theory and employs the extended Vickrey auction. Specifically, players in a non-cooperative environment compete for server-side scarce memory space to replicate data objects so as to minimize the total network object transfer cost, while maintaining object concurrency. Optimization of such a cost in turn leads to load balancing, fault-tolerance and reduced user access time. The method is experimentally evaluated against four well-known techniques from the literature: branch and bound, greedy, bin-packing and genetic algorithms. The experimental results reveal that the proposed approach outperforms the four techniques in both the execution time and solution quality.

Keywords: Auctions, data replication, pricing, static allocation.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1423

Authors: Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Halim Mohd. Yatim

Abstract:

In this paper, application of Sliding Mode Control (SMC) technique for an Active Magnetic Bearing (AMB) system with varying rotor speed is considered. The gyroscopic effect and mass imbalance inherited in the system is proportional to rotor speed in which this nonlinearity effect causes high system instability as the rotor speed increases. Transformation of the AMB dynamic model into regular system shows that these gyroscopic effect and imbalance lie in the mismatched part of the system. A H2-based sliding surface is designed which bound the mismatched parts. The solution of the surface parameter is obtained using Linear Matrix Inequality (LMI). The performance of the controller applied to the AMB model is demonstrated through simulation works under various system conditions.

Keywords: Active magnetic bearing, sliding mode control, linear matrix inequality, mismatched uncertainty and imbalance.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1557

Authors: Jinghao Sun, Guozhen Tan, Guangjian Hou

Abstract:

The Chinese Postman Problem (CPP) is one of the classical problems in graph theory and is applicable in a wide range of fields. With the rapid development of hybrid systems and model based testing, Chinese Postman Problem with Time Dependent Travel Times (CPPTDT) becomes more realistic than the classical problems. In the literature, we have proposed the first integer programming formulation for the CPPTDT problem, namely, circuit formulation, based on which some polyhedral results are investigated and a cutting plane algorithm is also designed. However, there exists a main drawback: the circuit formulation is only available for solving the special instances with all circuits passing through the origin. Therefore, this paper proposes a new integer programming formulation for solving all the general instances of CPPTDT. Moreover, the size of the circuit formulation is too large, which is reduced dramatically here. Thus, it is possible to design more efficient algorithm for solving the CPPTDT in the future research.

Keywords: Chinese Postman Problem, Time Dependent, Integer Programming, Upper Bound Analysis.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2691

Authors: Maryam Nejat Dehkordi, Per Lincoln, Hassan Momtaz

Abstract:

Interaction of Schiff base complexes of Iron and Manganese: Iron [N, N’ Bis (5- (triphenyl phosphonium methyl) salicylidene) -1, 2 ethanediamine) chloride, [Fe Salen]Cl; Manganese [N, N’ Bis (5- (triphenyl phosphonium methyl) salicylidene) -1, 2 ethanediamine) acetate, were investigated by spectroscopic and isothermal titration calorimetry techniques (ITC). The absorbance spectra of complexes have shown hyper and hypochromism in the presence of DNA that is indication of interaction of complexes with DNA. The linear dichroism (LD) measurements confirmed the bending of DNA in the presence of complexes. Furthermore, Isothermal titration calorimetry experiments approved that complexes bound to DNA on the base of both electrostatic and hydrophobic interactions. More, ITC profile exhibits the existence of two binding phases for the complexes. Antibacterial activity of ligand and complexes were tested in vitro to evaluate their activity against the gram positive and negative bacteria.

Keywords: Schiff base complexes, Linear dichroism (LD), Isothermal titration calorimetry (ITC).

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2554

Authors: Jana Doležalová, Josef Holík, Zdeněk Wimmer, Sándor T. Forczek

Abstract:

Chlorine is one of the most abundant elements in nature, which undergoes a complex biogeochemical cycle. Chlorine bound in some substances is partly responsible for atmospheric ozone depletion and contamination of some ecosystems. As due to international regulations anthropogenic burden of volatile organochlorines (VOCls) in atmosphere decreases, natural sources (plants, soil, abiotic formation) are expected to dominate VOCl production in the near future. Examples of plant VOCl production are methyl chloride, and bromide emission from (sub)tropical ferns, chloroform, 1,1,1-trichloroethane and tetrachloromethane emission from temperate forest fern and moss. Temperate forests are found to emit in addition to the previous compounds tetrachloroethene, and brominated volatile compounds. VOCls can be taken up and further metabolized in plants. The aim of this work is to identify and quantitatively analyze the formed VOCls in temperate forest ecosystems by a cryofocusing/GC-ECD detection method, hence filling a gap of knowledge in the biogeochemical cycle of chlorine.

Keywords: chloroform, cryofocusing-GC-ECD, ozonedepletion, volatile organochlorines

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1382

Authors: Joselito P. Duyanen, Aries Milay

Abstract:

Arsenic in the sediments of the ash lagoons of the coal-fired power plant in Pagbilao, Quezon Province in the Philippines was sequentially extracted to determine its potential for leaching to the groundwater and the adjacent marine environment. Results show that 89% of the As is bound to the quasi-crystalline Fe/Mn oxides and hydroxide matrix in the sediments, whereas, the adsorbed and exchangeable As hosted by the clay minerals, representing those that are easiest to release from the sediment matrix, is below 10% of the acid leachable As. These As in these sediment matrices represent the possible maximum amount of As that can be released and supplied to the groundwater and the adjacent marine environment. Of the 89% reducible As, up to 4% is associated with the easily reducible variety, whereas, the rest is more strongly bonded by the moderately reducible variety. Based on the long-term As content of the lagoon water, the average desorption rate of As is calculated to be very low -- 0.3-0.5% on the average and 0.6% on the maximum. This indicates that As is well-fixed by its sediment matrices in the ash lagoon, attenuating the influx of As into the adjacent groundwater and marine environments.

Keywords: Arsenic, natural attenuation, coal-fired power plant, Philippines.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1636

Authors: Wei Wang, Dongming Peng, Honggang Wang, Hamid Sharif

Abstract:

Multirate multimedia delivery applications in multihop Wireless Mesh Network (WMN) are data redundant and delay-sensitive, which brings a lot of challenges for designing efficient transmission systems. In this paper, we propose a new cross layer resource allocation scheme to minimize the receiver side distortion within the delay bound requirements, by exploring application layer Position and Value (P-V) diversity as well as the multihop Effective Capacity (EC). We specifically consider image transmission optimization here. First of all, the maximum supportable source traffic rate is identified by exploring the multihop Effective Capacity (EC) model. Furthermore, the optimal source coding rate is selected according to the P-V diversity of multirate media streaming, which significantly increases the decoded media quality. Simulation results show the proposed approach improved media quality significantly compared with traditional approaches under the same QoS requirements.

Keywords: Multirate Multimedia Streaming, Effective CapacityMultihop Wireless Mesh Network

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1419

Authors: T. T. Manikandan, Rajeev Sukumaran

Abstract:

Coral Reefs are very important for the majority of marine ecosystems. But, such vital species are under major threat due to the factors such as ocean acidification, overfishing, and coral bleaching. To conserve the coral reefs, reef restoration activities are carried out across the world. After reef restoration, various parameters have to be monitored in order to ensure the overall effectiveness of the reef restoration. Underwater Wireless Sensor Network (UWSN) based  monitoring is widely adopted for such long monitoring activities. Since monitoring of coral reef restoration activities is time sensitive, the QoS guarantee offered by the network with respect to delay is vital. So this research focuses on the analytical modeling of network layer delay using Stochastic Network Calculus (SNC). The core focus of the proposed model will be on the analysis of stochastic dependencies between the network flow and deriving the stochastic delay bounds for the flows that traverse in tandem in UWSNs. The derived analytical bounds are evaluated for their effectiveness using discrete event simulations.

Keywords: Coral Reef Restoration, SNC, SFA, PMOO, Tandem of Queues, Delay Bound.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 354

Authors: K. Ramasamy, B. Balamuralithara, Mohammad Umar Siddiqi

Abstract:

We proposed a new class of asymmetric turbo encoder for 3G systems that performs well in both “water fall" and “error floor" regions in [7]. In this paper, a modified (optimal) power allocation scheme for the different bits of new class of asymmetric turbo encoder has been investigated to enhance the performance. The simulation results and performance bound for proposed asymmetric turbo code with modified Unequal Power Allocation (UPA) scheme for the frame length, N=400, code rate, r=1/3 with Log-MAP decoder over Additive White Gaussian Noise (AWGN) channel are obtained and compared with the system with typical UPA and without UPA. The performance tests are extended over AWGN channel for different frame size to verify the possibility of implementation of the modified UPA scheme for the proposed asymmetric turbo code. From the performance results, it is observed that the proposed asymmetric turbo code with modified UPA performs better than the system without UPA and with typical UPA and it provides a coding gain of 0.4 to 0.52dB.

Keywords: Asymmetric turbo code, Generator polynomial, Interleaver, UPA, WCDMA, cdma2000.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1839

Authors: Zhifeng Kong

Abstract:

Over-parameterized neural networks have attracted a great deal of attention in recent deep learning theory research, as they challenge the classic perspective of over-fitting when the model has excessive parameters and have gained empirical success in various settings. While a number of theoretical works have been presented to demystify properties of such models, the convergence properties of such models are still far from being thoroughly understood. In this work, we study the convergence properties of training two-hidden-layer partially over-parameterized fully connected networks with the Rectified Linear Unit activation via gradient descent. To our knowledge, this is the first theoretical work to understand convergence properties of deep over-parameterized networks without the equally-wide-hidden-layer assumption and other unrealistic assumptions. We provide a probabilistic lower bound of the widths of hidden layers and proved linear convergence rate of gradient descent. We also conducted experiments on synthetic and real-world datasets to validate our theory.

Keywords: Over-parameterization, Rectified Linear Units (ReLU), convergence, gradient descent, neural networks.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 811

Authors: Maha Shamseddine, Amjad Nusayr, Wassim Itani

Abstract:

In this paper, we present a Platform-as-a-Service (PaaS) model for controlling the privacy enforcement mechanisms applied on user data when stored and processed in Cloud data centers. The proposed architecture consists of establishing user configurable ‘sticky’ policies on the Graphical User Interface (GUI) data-bound components during the application development phase to specify the details of privacy enforcement on the contents of these components. Various privacy classification classes on the data components are formally defined to give the user full control on the degree and scope of privacy enforcement including the type of execution containers to process the data in the Cloud. This not only enhances the privacy-awareness of the developed Cloud services, but also results in major savings in performance and energy efficiency due to the fact that the privacy mechanisms are solely applied on sensitive data units and not on all the user content. The proposed design is implemented in a real PaaS cloud computing environment on the Microsoft Azure platform.

Keywords: Privacy enforcement, Platform-as-a-Service privacy awareness, cloud computing privacy.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 698

Authors: M. F. R. Zuthi, H. H. Ngo, W. S. Guo, S. S. Chen, N. C. Nguyen, L. J. Deng, T. D. C. Tran

Abstract:

Sustaining a desired rate of oxygen transfer for microbial activity is a matter of major concern for biological wastewater treatment (MBR). The study reported in the paper was aimed at assessing the effects of microbial products on the specific oxygen uptake rate (SOUR) in a conventional membrane bioreactor (CMBR) and that in a sponge submerged MBR (SSMBR). The production and progressive accumulation of soluble microbial products (SMP) and bound-extracellular polymeric substances (bEPS) were affecting the SOUR of the microorganisms which varied at different stages of operation of the MBR systems depending on the variable concentrations of the SMP/bEPS. The effect of bEPS on the SOUR was stronger in the SSMBR compared to that of the SMP, while relative high concentrations of SMP had adverse effects on the SOUR of the CMBR system. Of the different mathematical correlations analyzed in the study, logarithmic mathematical correlations could be established between SOUR and bEPS in SSMBR, and similar correlations could also be found between SOUR and SMP concentrations in the CMBR.

Keywords: Microbial products, Microbial activity, Specific oxygen uptake rate, Membrane bioreactor.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1842

Authors: Mohammad Mahdi Paydar, Armin Cheraghalipour, Mostafa Hajiaghaei-Keshteli

Abstract:

Nowadays, in advanced countries, agriculture as one of the most significant sectors of the economy, plays an important role in its political and economic independence. Due to farmers' lack of information about products' demand and lack of proper planning for harvest time, annually the considerable amount of products is corrupted. Besides, in this paper, we attempt to improve these unfavorable conditions via designing an effective supply chain network that tries to minimize total costs of agricultural products along with minimizing shortage in demand points. To validate the proposed model, a stochastic optimization approach by using a branch and bound solver of the LINGO software is utilized. Furthermore, to accumulate the data of parameters, a case study in Mazandaran province placed in the north of Iran has been applied. Finally, using ɛ-constraint approach, a Pareto front is obtained and one of its Pareto solutions as best solution is selected. Then, related results of this solution are explained. Finally, conclusions and suggestions for the future research are presented.

Keywords: Perishable products, stochastic optimization, agricultural supply chain, ɛ-constraint.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 943

Authors: Sanjay Kanade, Danielle Camara, Dijana Petrovska-Delacretaz, Bernadette Dorizzi

Abstract:

In this paper, a two factor scheme is proposed to generate cryptographic keys directly from biometric data, which unlike passwords, are strongly bound to the user. Hash value of the reference iris code is used as a cryptographic key and its length depends only on the hash function, being independent of any other parameter. The entropy of such keys is 94 bits, which is much higher than any other comparable system. The most important and distinct feature of this scheme is that it regenerates the reference iris code by providing a genuine iris sample and the correct user password. Since iris codes obtained from two images of the same eye are not exactly the same, error correcting codes (Hadamard code and Reed-Solomon code) are used to deal with the variability. The scheme proposed here can be used to provide keys for a cryptographic system and/or for user authentication. The performance of this system is evaluated on two publicly available databases for iris biometrics namely CBS and ICE databases. The operating point of the system (values of False Acceptance Rate (FAR) and False Rejection Rate (FRR)) can be set by properly selecting the error correction capacity (ts) of the Reed- Solomon codes, e.g., on the ICE database, at ts = 15, FAR is 0.096% and FRR is 0.76%.

Keywords:

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2045

Authors: Priyadarsini P. L. K, Hemalatha T.

Abstract:

This paper proves that the problem of finding connected vertex cover in a 2-connected planar graph ( CVC-2 ) with maximum degree 4 is NP-complete. The motivation for proving this result is to give a shorter and simpler proof of NP-Completeness of TRA-MLC (the Top Right Access point Minimum-Length Corridor) problem [1], by finding the reduction from CVC-2. TRA-MLC has many applications in laying optical fibre cables for data communication and electrical wiring in floor plans.The problem of finding connected vertex cover in any planar graph ( CVC ) with maximum degree 4 is NP-complete [2]. We first show that CVC-2 belongs to NP and then we find a polynomial reduction from CVC to CVC-2. Let a graph G0 and an integer K form an instance of CVC, where G0 is a planar graph and K is an upper bound on the size of the connected vertex cover in G0. We construct a 2-connected planar graph, say G, by identifying the blocks and cut vertices of G0, and then finding the planar representation of all the blocks of G0, leading to a plane graph G1. We replace the cut vertices with cycles in such a way that the resultant graph G is a 2-connected planar graph with maximum degree 4. We consider L = K -2t+3 t i=1 di where t is the number of cut vertices in G1 and di is the number of blocks for which ith cut vertex is common. We prove that G will have a connected vertex cover with size less than or equal to L if and only if G0 has a connected vertex cover of size less than or equal to K.

Keywords: NP-complete, 2-Connected planar graph, block, cut vertex

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1961

Authors: Samee Ullah Khan, C. Ardil

Abstract:

Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms.

Keywords: Internet, data content replication, static allocation, mechanism design, equilibrium.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1364

Authors: Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Halim Mohd. Yatim

Abstract:

In this paper, stabilization of an Active Magnetic Bearing (AMB) system with varying rotor speed using Sliding Mode Control (SMC) technique is considered. The gyroscopic effect inherited in the system is proportional to rotor speed in which this nonlinearity effect causes high system instability as the rotor speed increases. Also, transformation of the AMB dynamic model into a new class of uncertain system shows that this gyroscopic effect lies in the mismatched part of the system matrix. Moreover, the current gain parameter is allowed to be varied in a known bound as an uncertainty in the input matrix. SMC design method is proposed in which the sufficient condition that guarantees the global exponential stability of the reduced-order system is represented in Linear Matrix Inequality (LMI). Then, a new chattering-free control law is established such that the system states are driven to reach the switching surface and stay on it thereafter. The performance of the controller applied to the AMB model is demonstrated through simulation works under various system conditions.

Keywords: Active Magnetic Bearing (AMB), Sliding ModeControl (SMC), Linear Matrix Inequality (LMI), mismatcheduncertainty.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1486

Authors: Samee Ullah Khan, C. Ardil

Abstract:

Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms.

Keywords: Data replication, auctions, static allocation, pricing.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1653

Authors: Manas Ranjan Kabat, Manoj Kumar Patel, Chita Ranjan Tripathy

Abstract:

Many multimedia communication applications require a source to transmit messages to multiple destinations subject to quality of service (QoS) delay constraint. To support delay constrained multicast communications, computer networks need to guarantee an upper bound end-to-end delay from the source node to each of the destination nodes. This is known as multicast delay problem. On the other hand, if the same message fails to arrive at each destination node at the same time, there may arise inconsistency and unfairness problem among users. This is related to multicast delayvariation problem. The problem to find a minimum cost multicast tree with delay and delay-variation constraints has been proven to be NP-Complete. In this paper, we propose an efficient heuristic algorithm, namely, Economic Delay and Delay-Variation Bounded Multicast (EDVBM) algorithm, based on a novel heuristic function, to construct an economic delay and delay-variation bounded multicast tree. A noteworthy feature of this algorithm is that it has very high probability of finding the optimal solution in polynomial time with low computational complexity.

Keywords: EDVBM, Heuristic algorithm, Multicast tree, QoS routing, Shortest path.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1581

Authors: Peyman Sindareh Esfahani, Jeffery Kurt Pieper

Abstract:

In this paper, the problem of robust model predictive control (MPC) for discrete-time linear systems in linear fractional transformation form with structured uncertainty and norm-bounded disturbance is investigated. The problem of minimization of the cost function for MPC design is converted to minimization of the worst case of the cost function. Then, this problem is reduced to minimization of an upper bound of the cost function subject to a terminal inequality satisfying the l₂-norm of the closed loop system. The characteristic of the linear fractional transformation system is taken into account, and by using some mathematical tools, the robust predictive controller design problem is turned into a linear matrix inequality minimization problem. Afterwards, a formulation which includes an integrator to improve the performance of the proposed robust model predictive controller in steady state condition is studied. The validity of the approaches is illustrated through a robust control benchmark problem.

Keywords: Linear fractional transformation, linear matrix inequality, robust model predictive control, state feedback control.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1240

Authors: Konstantinos G. Dassios, Guillaume Bonnefont, Gilbert Fantozzi, Theodore E. Matikas, Costas Galiotis

Abstract:

We report herein the development and preliminary mechanical characterization of fully-dense multi-wall carbon nanotube (MWCNT)-reinforced ceramics and glasses based on a completely new methodology termed High Shear Compaction (HSC). The tubes are introduced and bound to the matrix grains by aid of polymeric binders to form flexible green bodies which are sintered and densified by spark plasma sintering to unprecedentedly high densities of 100% of the pure-matrix value. The strategy was validated across a PyrexTM glass / MWCNT composite while no identifiable factors limit application to other types of matrices. Nondestructive evaluation, based on ultrasonics, of the dynamic mechanical properties of the materials including elastic, shear and bulk modulus as well as Poisson’s ratio showed optimum property improvement at 0.5 %wt tube loading while evidence of nanoscalespecific energy dissipative characteristics acting complementary to nanotube bridging and pull-out indicate a high potential in a wide range of reinforcing and multifunctional applications. 

Keywords: Carbon nanotubes, ceramic matrix composites, toughening, ultrasonics.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1700

Authors: Dalia Angeles-Wedler, Katrin Mackenzie, Frank-Dieter Kopinke

Abstract:

Palladium-catalyzed hydrodechlorination is a promising alternative for the treatment of environmentally relevant water bodies, such as groundwater, contaminated with chlorinated organic compounds (COCs). In the aqueous phase hydrodechlorination of COCs, Pd-based catalysts were found to have a very high catalytic activity. However, the full utilization of the catalyst-s potential is impeded by the sensitivity of the catalyst to poisoning and deactivation induced by reduced sulfur compounds (e.g. sulfides). Several regenerants have been tested before to recover the performance of sulfide-fouled Pd catalyst. But these only delivered partial success with respect to re-establishment of the catalyst activity. In this study, the deactivation behaviour of Pd/Al2O3 in the presence of sulfide was investigated. Subsequent to total deactivation the catalyst was regenerated in the aqueous phase using potassium permanganate. Under neutral pH condition, oxidative regeneration with permanganate delivered a slow recovery of catalyst activity. However, changing the pH of the bulk solution to acidic resulted in the complete recovery of catalyst activity within a regeneration time of about half an hour. These findings suggest the superiority of permanganate as regenerant in re-activating Pd/Al2O3 by oxidizing Pd-bound sulfide.

Keywords: Deactivation, hydrodechlorination, Pd catalyst, regeneration.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2213

Authors: A. Thomas, B. John Oommen

Abstract:

Although the field of parametric Pattern Recognition (PR) has been thoroughly studied for over five decades, the use of the Order Statistics (OS) of the distributions to achieve this has not been reported. The pioneering work on using OS for classification was presented in [1] for the Uniform distribution, where it was shown that optimal PR can be achieved in a counter-intuitive manner, diametrically opposed to the Bayesian paradigm, i.e., by comparing the testing sample to a few samples distant from the mean. This must be contrasted with the Bayesian paradigm in which, if we are allowed to compare the testing sample with only a single point in the feature space from each class, the optimal strategy would be to achieve this based on the (Mahalanobis) distance from the corresponding central points, for example, the means. In [2], we showed that the results could be extended for a few symmetric distributions within the exponential family. In this paper, we attempt to extend these results significantly by considering asymmetric distributions within the exponential family, for some of which even the closed form expressions of the cumulative distribution functions are not available. These distributions include the Rayleigh, Gamma and certain Beta distributions. As in [1] and [2], the new scheme, referred to as Classification by Moments of Order Statistics (CMOS), attains an accuracy very close to the optimal Bayes’ bound, as has been shown both theoretically and by rigorous experimental testing.

Keywords: Classification using Order Statistics (OS), Exponential family, Moments of OS

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1485

Authors: Hanieh Tarbiat Khosrowshahi, Mojtaba Shakeri

Abstract:

Wireless Sensor Networks (WSNs) consist of a set of sensor nodes with limited capability. WSNs may suffer from multiple node failures when they are exposed to harsh environments such as military zones or disaster locations and lose connectivity by getting partitioned into disjoint segments. Relay nodes (RNs) are alternatively introduced to restore connectivity. They cost more than sensors as they benefit from mobility, more power and more transmission range, enforcing a minimum number of them to be used. This paper addresses the problem of RN placement in a multiple disjoint network by developing a genetic algorithm (GA). The problem is reintroduced as the Steiner tree problem (which is known to be an NP-hard problem) by the aim of finding the minimum number of Steiner points where RNs are to be placed for restoring connectivity. An upper bound to the number of RNs is first computed to set up the length of initial chromosomes. The GA algorithm then iteratively reduces the number of RNs and determines their location at the same time. Experimental results indicate that the proposed GA is capable of establishing network connectivity using a reasonable number of RNs compared to the best existing work.

Keywords: Connectivity restoration, genetic algorithms, multiple-node failure, relay nodes, wireless sensor networks.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1054