Search results for: Minimum%20Hydrotropic%20Concentration.
885 Combining Minimum Energy and Minimum Direct Jerk of Linear Dynamic Systems
Authors: V. Tawiwat, P. Jumnong
Abstract:
Both the minimum energy consumption and smoothness, which is quantified as a function of jerk, are generally needed in many dynamic systems such as the automobile and the pick-and-place robot manipulator that handles fragile equipments. Nevertheless, many researchers come up with either solely concerning on the minimum energy consumption or minimum jerk trajectory. This research paper proposes a simple yet very interesting when combining the minimum energy and jerk of indirect jerks approaches in designing the time-dependent system yielding an alternative optimal solution. Extremal solutions for the cost functions of the minimum energy, the minimum jerk and combining them together are found using the dynamic optimization methods together with the numerical approximation. This is to allow us to simulate and compare visually and statistically the time history of state inputs employed by combining minimum energy and jerk designs. The numerical solution of minimum direct jerk and energy problem are exactly the same solution; however, the solutions from problem of minimum energy yield the similar solution especially in term of tendency.Keywords: Optimization, Dynamic, Linear Systems, Jerks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1562884 On Minimum Cycle Bases of the Wreath Product of Wheels with Stars
Authors: M. M. M. Jaradat, M. K. Al-Qeyyam
Abstract:
The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle basis is a cycle basis with minimum length. In this work, a construction of a minimum cycle basis for the wreath product of wheels with stars is presented. Moreover, the length of minimum cycle basis and the length of its longest cycle are calculated.
Keywords: Cycle space, minimum cycle basis, wreath product.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1094883 A Study of Under Actuator Dynamic System by Comparing between Minimum Energy and Minimum Jerk Problems
Authors: Tawiwat V., Phermsak S., Noppasit C.
Abstract:
This paper deals with under actuator dynamic systems such as spring-mass-damper system when the number of control variable is less than the number of state variable. In order to apply optimal control, the controllability must be checked. There are many objective functions to be selected as the goal of the optimal control such as minimum energy, maximum energy and minimum jerk. As the objective function is the first priority, if one like to have the second goal to be applied; however, it could not fit in the objective function format and also avoiding the vector cost for the objective, this paper will illustrate the problem of under actuator dynamic systems with the easiest to deal with comparing between minimum energy and minimum jerk.
Keywords: Under actuator, Dynamic optimal control, Minimumjerk, Minimum energy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1313882 Comparison between Minimum Direct and Indirect Jerks of Linear Dynamic Systems
Authors: Tawiwat Veeraklaew, Nathasit Phathana-im, Songkit Heama
Abstract:
Both the minimum energy consumption and smoothness, which is quantified as a function of jerk, are generally needed in many dynamic systems such as the automobile and the pick-and-place robot manipulator that handles fragile equipments. Nevertheless, many researchers come up with either solely concerning on the minimum energy consumption or minimum jerk trajectory. This research paper proposes a simple yet very interesting relationship between the minimum direct and indirect jerks approaches in designing the time-dependent system yielding an alternative optimal solution. Extremal solutions for the cost functions of direct and indirect jerks are found using the dynamic optimization methods together with the numerical approximation. This is to allow us to simulate and compare visually and statistically the time history of control inputs employed by minimum direct and indirect jerk designs. By considering minimum indirect jerk problem, the numerical solution becomes much easier and yields to the similar results as minimum direct jerk problem.Keywords: Optimization, Dynamic, Linear Systems, Jerks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1249881 An Effective Algorithm for Minimum Weighted Vertex Cover Problem
Authors: S. Balaji, V. Swaminathan, K. Kannan
Abstract:
The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.
Keywords: Weighted vertex cover, vertex support, approximation algorithms, NP-complete problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3867880 An Approach to the Solving Non-Steiner Minimum Link Path Problem
Authors: V. Tereshchenko, A. Tregubenko
Abstract:
In this study we survey the method for fast finding a minimum link path between two arbitrary points within a simple polygon, which can pass only through the vertices, with preprocessing.
Keywords: Minimum link path, simple polygon, Steiner points, optimal algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1501879 A Study of the Change of Damping Coefficient Regarding Minimum Displacement
Authors: Tawiwat V., Narongkorn D., Auttapoom L.
Abstract:
This research proposes the change of damping coefficient regarding minimum displacement. From the mass with external forced and damper problem, when is the constant external forced transmitted to the understructure in the difference angle between 30 and 60 degrees. This force generates the vibration as general known; however, the objective of this problem is to have minimum displacement. As the angle is changed and the goal is the same; therefore, the damper of the system must be varied while keeping constant spring stiffness. The problem is solved by using nonlinear programming and the suitable changing of the damping coefficient is provided.
Keywords: Damping coefficient, Optimal control, Minimum Displacement and Vibration
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1333878 An Iterative Method for the Symmetric Arrowhead Solution of Matrix Equation
Authors: Minghui Wang, Luping Xu, Juntao Zhang
Abstract:
In this paper, according to the classical algorithm LSQR for solving the least-squares problem, an iterative method is proposed for least-squares solution of constrained matrix equation. By using the Kronecker product, the matrix-form LSQR is presented to obtain the like-minimum norm and minimum norm solutions in a constrained matrix set for the symmetric arrowhead matrices. Finally, numerical examples are also given to investigate the performance.Keywords: Symmetric arrowhead matrix, iterative method, like-minimum norm, minimum norm, Algorithm LSQR.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1399877 Minimum Data of a Speech Signal as Special Indicators of Identification in Phonoscopy
Authors: Nazaket Gazieva
Abstract:
Voice biometric data associated with physiological, psychological and other factors are widely used in forensic phonoscopy. There are various methods for identifying and verifying a person by voice. This article explores the minimum speech signal data as individual parameters of a speech signal. Monozygotic twins are believed to be genetically identical. Using the minimum data of the speech signal, we came to the conclusion that the voice imprint of monozygotic twins is individual. According to the conclusion of the experiment, we can conclude that the minimum indicators of the speech signal are more stable and reliable for phonoscopic examinations.
Keywords: Biometric voice prints, fundamental frequency, phonogram, speech signal, temporal characteristics.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 545876 Multivariable Predictive PID Control for Quadruple Tank
Authors: Qamar Saeed, Vali Uddin, Reza Katebi
Abstract:
In this paper multivariable predictive PID controller has been implemented on a multi-inputs multi-outputs control problem i.e., quadruple tank system, in comparison with a simple multiloop PI controller. One of the salient feature of this system is an adjustable transmission zero which can be adjust to operate in both minimum and non-minimum phase configuration, through the flow distribution to upper and lower tanks in quadruple tank system. Stability and performance analysis has also been carried out for this highly interactive two input two output system, both in minimum and non-minimum phases. Simulations of control system revealed that better performance are obtained in predictive PID design.Keywords: Proportional-integral-derivative Control, GeneralizedPredictive Control, Predictive PID Control, Multivariable Systems
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3257875 Minimum Fluidization Velocities of Binary-Solid Mixtures: Model Comparison
Authors: Mohammad Asif
Abstract:
An accurate prediction of the minimum fluidization velocity is a crucial hydrodynamic aspect of the design of fluidized bed reactors. Common approaches for the prediction of the minimum fluidization velocities of binary-solid fluidized beds are first discussed here. The data of our own careful experimental investigation involving a binary-solid pair fluidized with water is presented. The effect of the relative composition of the two solid species comprising the fluidized bed on the bed void fraction at the incipient fluidization condition is reported and its influence on the minimum fluidization velocity is discussed. In this connection, the capability of packing models to predict the bed void fraction is also examined.Keywords: Bed void fraction, Binary solid mixture, Minimumfluidization velocity, Packing models
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2628874 Improved FP-growth Algorithm with Multiple Minimum Supports Using Maximum Constraints
Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam
Abstract:
Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FPgrowth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.
Keywords: Association Rules, FP-growth, Multiple minimum supports, Weka Tool
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3306873 New Feed-Forward/Feedback Generalized Minimum Variance Self-tuning Pole-placement Controller
Authors: S. A. Mohamed, A. S. Zayed, O. A. Abolaeha
Abstract:
A new Feed-Forward/Feedback Generalized Minimum Variance Pole-placement Controller to incorporate the robustness of classical pole-placement into the flexibility of generalized minimum variance self-tuning controller for Single-Input Single-Output (SISO) has been proposed in this paper. The design, which provides the user with an adaptive mechanism, which ensures that the closed loop poles are, located at their pre-specified positions. In addition, the controller design which has a feed-forward/feedback structure overcomes the certain limitations existing in similar poleplacement control designs whilst retaining the simplicity of adaptation mechanisms used in other designs. It tracks set-point changes with the desired speed of response, penalizes excessive control action, and can be applied to non-minimum phase systems. Besides, at steady state, the controller has the ability to regulate the constant load disturbance to zero. Example simulation results using both simulated and real plant models demonstrate the effectiveness of the proposed controller.Keywords: Pole-placement, Minimum variance control, self-tuning control and feedforward control.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1738872 Minimum Energy of a Prismatic Joint with out: Actuator: Application on RRP Robot
Authors: Tawiwat V., Tosapolporn P., Kedit J.
Abstract:
This research proposes the state of art on how to control or find the trajectory paths of the RRP robot when the prismatic joint is malfunction. According to this situation, the minimum energy of the dynamic optimization is applied. The RRP robot or similar systems have been used in many areas such as fire fighter truck, laboratory equipment and military truck for example a rocket launcher. In order to keep on task that assigned, the trajectory paths must be computed. Here, the open loop control is applied and the result of an example show the reasonable solution which can be applied to the controllable system.
Keywords: RRP robot, Optimal Control, Minimum Energy and Under Actuator.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1287871 An Iterative Method for the Least-squares Symmetric Solution of AXB+CYD=F and its Application
Authors: Minghui Wang
Abstract:
Based on the classical algorithm LSQR for solving (unconstrained) LS problem, an iterative method is proposed for the least-squares like-minimum-norm symmetric solution of AXB+CYD=E. As the application of this algorithm, an iterative method for the least-squares like-minimum-norm biymmetric solution of AXB=E is also obtained. Numerical results are reported that show the efficiency of the proposed methods.
Keywords: Matrix equation, bisymmetric matrix, least squares problem, like-minimum norm, iterative algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1479870 Performance Evaluation of Music and Minimum Norm Eigenvector Algorithms in Resolving Noisy Multiexponential Signals
Authors: Abdussamad U. Jibia, Momoh-Jimoh E. Salami
Abstract:
Eigenvector methods are gaining increasing acceptance in the area of spectrum estimation. This paper presents a successful attempt at testing and evaluating the performance of two of the most popular types of subspace techniques in determining the parameters of multiexponential signals with real decay constants buried in noise. In particular, MUSIC (Multiple Signal Classification) and minimum-norm techniques are examined. It is shown that these methods perform almost equally well on multiexponential signals with MUSIC displaying better defined peaks.
Keywords: Eigenvector, minimum norm, multiexponential, subspace.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1727869 Optimization of Unweighted Minimum Vertex Cover
Authors: S. Balaji, V. Swaminathan, K. Kannan
Abstract:
The Minimum Vertex Cover (MVC) problem is a classic graph optimization NP - complete problem. In this paper a competent algorithm, called Vertex Support Algorithm (VSA), is designed to find the smallest vertex cover of a graph. The VSA is tested on a large number of random graphs and DIMACS benchmark graphs. Comparative study of this algorithm with the other existing methods has been carried out. Extensive simulation results show that the VSA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.Keywords: vertex cover, vertex support, approximation algorithms, NP - complete problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2469868 Determining the Minimum Threshold for the Functional Relatedness of Inner-Outer Class
Authors: Sim Hui Tee, Rodziah Atan, Abdul Azim Abd Ghani
Abstract:
Inner class is a specialized class that defined within a regular outer class. It is used in some programming languages such as Java to carry out the task which is related to its outer class. The functional relatedness between inner class and outer class is always the main concern of defining an inner class. However, excessive use of inner class could sabotage the class cohesiveness. In addition, excessive inner class leads to the difficulty of software maintenance and comprehension. Our research aims at determining the minimum threshold for the functional relatedness of inner-outer class. Such minimum threshold is a guideline for removing or relocating the excessive inner class. Our research provides a feasible way for software developers to define inner classes which are functionally related to the outer class.Keywords: Cohesion, functional relatedness of inner-outer class, inner class.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1577867 Blind Non-Minimum Phase Channel Identification Using 3rd and 4th Order Cumulants
Authors: S. Safi, A. Zeroual
Abstract:
In this paper we propose a family of algorithms based on 3rd and 4th order cumulants for blind single-input single-output (SISO) Non-Minimum Phase (NMP) Finite Impulse Response (FIR) channel estimation driven by non-Gaussian signal. The input signal represents the signal used in 10GBASE-T (or IEEE 802.3an-2006) as a Tomlinson-Harashima Precoded (THP) version of random Pulse-Amplitude Modulation with 16 discrete levels (PAM-16). The proposed algorithms are tested using three non-minimum phase channel for different Signal-to-Noise Ratios (SNR) and for different data input length. Numerical simulation results are presented to illustrate the performance of the proposed algorithms.Keywords: Higher Order Cumulants, Channel identification, Ethernet communication.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1440866 Predicting the Minimum Free Energy RNA Secondary Structures using Harmony Search Algorithm
Authors: Abdulqader M. Mohsen, Ahamad Tajudin Khader, Dhanesh Ramachandram, Abdullatif Ghallab
Abstract:
The physical methods for RNA secondary structure prediction are time consuming and expensive, thus methods for computational prediction will be a proper alternative. Various algorithms have been used for RNA structure prediction including dynamic programming and metaheuristic algorithms. Musician's behaviorinspired harmony search is a recently developed metaheuristic algorithm which has been successful in a wide variety of complex optimization problems. This paper proposes a harmony search algorithm (HSRNAFold) to find RNA secondary structure with minimum free energy and similar to the native structure. HSRNAFold is compared with dynamic programming benchmark mfold and metaheuristic algorithms (RnaPredict, SetPSO and HelixPSO). The results showed that HSRNAFold is comparable to mfold and better than metaheuristics in finding the minimum free energies and the number of correct base pairs.
Keywords: Metaheuristic algorithms, dynamic programming algorithms, harmony search optimization, RNA folding, Minimum free energy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2324865 A Robust Controller for Output Variance Reduction and Minimum Variance with Application on a Permanent Field DC-Motor
Authors: Mahmood M. Al-Imam, M. Mustafa
Abstract:
In this paper, we present an experimental testing for a new algorithm that determines an optimal controller-s coefficients for output variance reduction related to Linear Time Invariant (LTI) Systems. The algorithm features simplicity in calculation, generalization to minimal and non-minimal phase systems, and could be configured to achieve reference tracking as well as variance reduction after compromising with the output variance. An experiment of DCmotor velocity control demonstrates the application of this new algorithm in designing the controller. The results show that the controller achieves minimum variance and reference tracking for a preset velocity reference relying on an identified model of the motor.Keywords: Output variance, minimum variance, overparameterization, DC-Motor.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1351864 Spectrum Analysis with Monte Cralo Simulation, BEAMnrc, for Low Energy X-RAY
Authors: Z. Salehi Dehyagani, A. L. Yusoff
Abstract:
BEAMnrc was used to calculate the spectrum and HVL for X-ray Beam during low energy X-ray radiation using tube model: SRO 33/100 /ROT 350 Philips. The results of BEAMnrc simulation and measurements were compared to the IPEM report number 78 and SpekCalc software. Three energies 127, 103 and 84 Kv were used. In these simulation a tungsten anode with 1.2 mm for Be window were used as source. HVLs were calculated from BEAMnrc spectrum with air Kerma method for four different filters. For BEAMnrc one billion particles were used as original particles for all simulations. The results show that for 127 kV, there was maximum 5.2 % difference between BEAMnrc and Measurements and minimum was 0.7% .the maximum 9.1% difference between BEAMnrc and IPEM and minimum was 2.3% .The maximum difference was 3.2% between BEAMnrc and SpekCal and minimum was 2.8%. The result show BEAMnrc was able to satisfactory predict the quantities of Low energy Beam as well as high energy X-ray radiation.Keywords: BEAMnr , Monte Carlo , HVL
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3043863 Thermal and Starvation Effects on Lubricated Elliptical Contacts at High Rolling/Sliding Speeds
Authors: Vinod Kumar, Surjit Angra
Abstract:
The objective of this theoretical study is to develop simple design formulas for the prediction of minimum film thickness and maximum mean film temperature rise in lightly loaded high-speed rolling/sliding lubricated elliptical contacts incorporating starvation effect. Herein, the reported numerical analysis focuses on thermoelastohydrodynamically lubricated rolling/sliding elliptical contacts, considering the Newtonian rheology of lubricant for wide range of operating parameters, namely load characterized by Hertzian pressure (PH = 0.01 GPa to 0.10 GPa), rolling speed (>10 m/s), slip parameter (S varies up to 1.0), and ellipticity ratio (k = 1 to 5). Starvation is simulated by systematically reducing the inlet supply. This analysis reveals that influences of load, rolling speed, and level of starvation are significant on the minimum film thickness. However, the maximum mean film temperature rise is strongly influenced by slip in addition to load, rolling speed, and level of starvation. In the presence of starvation, reduction in minimum film thickness and increase in maximum mean film temperature are observed. Based on the results of this study, empirical relations are developed for the prediction of dimensionless minimum film thickness and dimensionless maximum mean film temperature rise at the contacts in terms of various operating parameters.
Keywords: Starvation, lubrication, elliptical contact, traction, minimum film thickness.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1478862 Implementation of Heuristics for Solving Travelling Salesman Problem Using Nearest Neighbour and Minimum Spanning Tree Algorithms
Authors: Fatma A. Karkory, Ali A. Abudalmola
Abstract:
The travelling salesman problem (TSP) is a combinatorial optimization problem in which the goal is to find the shortest path between different cities that the salesman takes. In other words, the problem deals with finding a route covering all cities so that total distance and execution time is minimized. This paper adopts the nearest neighbor and minimum spanning tree algorithm to solve the well-known travelling salesman problem. The algorithms were implemented using java programming language. The approach is tested on three graphs that making a TSP tour instance of 5-city, 10 –city, and 229–city. The computation results validate the performance of the proposed algorithm.
Keywords: Heuristics, minimum spanning tree algorithm, Nearest Neighbor, Travelling Salesman Problem (TSP).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7809861 Bandwidth Allocation for ABR Service in Cellular Networks
Authors: Khaja Kamaluddin, Muhammed Yousoof
Abstract:
Available Bit Rate Service (ABR) is the lower priority service and the better service for the transmission of data. On wireline ATM networks ABR source is always getting the feedback from switches about increase or decrease of bandwidth according to the changing network conditions and minimum bandwidth is guaranteed. In wireless networks guaranteeing the minimum bandwidth is really a challenging task as the source is always in mobile and traveling from one cell to another cell. Re establishment of virtual circuits from start to end every time causes the delay in transmission. In our proposed solution we proposed the mechanism to provide more available bandwidth to the ABR source by re-usage of part of old Virtual Channels and establishing the new ones. We want the ABR source to transmit the data continuously (non-stop) inorderto avoid the delay. In worst case scenario at least minimum bandwidth is to be allocated. In order to keep the data flow continuously, priority is given to the handoff ABR call against new ABR call.Keywords: Bandwidth allocation, Virtual Channel (VC), CBR, ABR, MCR and QOS.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1591860 Numerical Simulation of Minimum Distance Jet Impingement Heat Transfer
Authors: Aman Agarwal, Georg Klepp
Abstract:
Impinging jets are used in various industrial areas as a cooling and drying technique. The current research is concerned with the means of improving the heat transfer for configurations with a minimum distance of the nozzle to the impingement surface. The impingement heat transfer is described using numerical methods over a wide range of parameters for an array of planar jets. These parameters include varying jet flow speed, width of nozzle, distance of nozzle, angle of the jet flow, velocity and geometry of the impingement surface. Normal pressure and shear stress are computed as additional parameters. Using dimensionless characteristic numbers the parameters and the results are correlated to gain generalized equations. The results demonstrate the effect of the investigated parameters on the flow.Keywords: Heat Transfer Coefficient, Minimum distance jet impingement, Numerical simulation, Dimensionless coefficients.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2347859 Evolutionary Program Based Approach for Manipulator Grasping Color Objects
Authors: Y. Harold Robinson, M. Rajaram, Honey Raju
Abstract:
Image segmentation and color identification is an important process used in various emerging fields like intelligent robotics. A method is proposed for the manipulator to grasp and place the color object into correct location. The existing methods such as PSO, has problems like accelerating the convergence speed and converging to a local minimum leading to sub optimal performance. To improve the performance, we are using watershed algorithm and for color identification, we are using EPSO. EPSO method is used to reduce the probability of being stuck in the local minimum. The proposed method offers the particles a more powerful global exploration capability. EPSO methods can determine the particles stuck in the local minimum and can also enhance learning speed as the particle movement will be faster.Keywords: Color information, EPSO, hue, saturation, value (HSV), image segmentation, particle swarm optimization (PSO). Active Contour, GMM.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1566858 The Survey and the Comparison of Maximum Likelihood, Mahalanobis Distance and Minimum Distance Methods in Preparing Landuse Map in the Western Part of Isfahan Province
Authors: Ali Gholami, M.Esfadiari, M.H.Masihabadi
Abstract:
In this research three methods of Maximum Likelihood, Mahalanobis Distance and Minimum Distance were analyzed in the Western part of Isfahan province in the Iran country. For this purpose, the IRS satellite images and various land preparation uses in region including rangelands, irrigation farming, dry farming, gardens and urban areas were separated and identified. In these methods, matrix error and Kappa index were calculated and accuracy of each method, based on percentages: 53.13, 56.64 and 48.44, were obtained respectively. Considering the low accuracy of these methods to separate land uses due to spread of the land uses, it-s suggested the visual interpretation of the map, to preparing the land use map in this region. The map prepared by visual interpretation is in high accuracy if it will be accompany with the visit of the region.
Keywords: Aghche Region, land use map, MaximumLikelihood, Mahalanobis Distance and Minimum Distance.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1811857 Minimum-Fuel Optimal Trajectory for Reusable First-Stage Rocket Landing Using Particle Swarm Optimization
Authors: Kevin Spencer G. Anglim, Zhenyu Zhang, Qingbin Gao
Abstract:
Reusable launch vehicles (RLVs) present a more environmentally-friendly approach to accessing space when compared to traditional launch vehicles that are discarded after each flight. This paper studies the recyclable nature of RLVs by presenting a solution method for determining minimum-fuel optimal trajectories using principles from optimal control theory and particle swarm optimization (PSO). This problem is formulated as a minimum-landing error powered descent problem where it is desired to move the RLV from a fixed set of initial conditions to three different sets of terminal conditions. However, unlike other powered descent studies, this paper considers the highly nonlinear effects caused by atmospheric drag, which are often ignored for studies on the Moon or on Mars. Rather than optimizing the controls directly, the throttle control is assumed to be bang-off-bang with a predetermined thrust direction for each phase of flight. The PSO method is verified in a one-dimensional comparison study, and it is then applied to the two-dimensional cases, the results of which are illustrated.Keywords: Minimum-fuel optimal trajectory, particle swarm optimization, reusable rocket, SpaceX.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2003856 Power Efficient OFDM Signals with Reduced Symbol's Aperiodic Autocorrelation
Authors: Ibrahim M. Hussain
Abstract:
Three new algorithms based on minimization of autocorrelation of transmitted symbols and the SLM approach which are computationally less demanding have been proposed. In the first algorithm, autocorrelation of complex data sequence is minimized to a value of 1 that results in reduction of PAPR. Second algorithm generates multiple random sequences from the sequence generated in the first algorithm with same value of autocorrelation i.e. 1. Out of these, the sequence with minimum PAPR is transmitted. Third algorithm is an extension of the second algorithm and requires minimum side information to be transmitted. Multiple sequences are generated by modifying a fixed number of complex numbers in an OFDM data sequence using only one factor. The multiple sequences represent the same data sequence and the one giving minimum PAPR is transmitted. Simulation results for a 256 subcarrier OFDM system show that significant reduction in PAPR is achieved using the proposed algorithms.
Keywords: Aperiodic autocorrelation, OFDM, PAPR, SLM, wireless communication.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1713