Search results for: light weight algorithm

Authors: Arbnor Pajaziti, Hasan Cana

Abstract:

In this paper, the structural genetic algorithm is used to optimize the neural network to control the joint movements of robotic arm. The robotic arm has also been modeled in 3D and simulated in real-time in MATLAB. It is found that Neural Networks provide a simple and effective way to control the robot tasks. Computer simulation examples are given to illustrate the significance of this method. By combining Genetic Algorithm optimization method and Neural Networks for the given robotic arm with 5 D.O.F. the obtained the results shown that the base joint movements overshooting time without controller was about 0.5 seconds, while with Neural Network controller (optimized with Genetic Algorithm) was about 0.2 seconds, and the population size of 150 gave best results.

Keywords: robotic arm, neural network, genetic algorithm, optimization

Procedia PDF Downloads 524

Authors: Anuj Abraham, N. Pappa, Daniel Honc, Rahul Sharma

Abstract:

In this paper, an analysis of some model order reduction techniques is presented. A new hybrid algorithm for model order reduction of linear time invariant systems is compared with the conventional techniques namely Balanced Truncation, Hankel Norm reduction and Dominant Pole Algorithm (DPA). The proposed hybrid algorithm is known as Clustering Dominant Pole Algorithm (CDPA) is able to compute the full set of dominant poles and its cluster center efficiently. The dominant poles of a transfer function are specific eigenvalues of the state space matrix of the corresponding dynamical system. The effectiveness of this novel technique is shown through the simulation results.

Keywords: balanced truncation, clustering, dominant pole, Hankel norm, model reduction

Procedia PDF Downloads 599

Authors: Gkolfo I. Smani, Vasileios Megalooikonomou

Abstract:

Social influence and influence diffusion have been studied in social networks. However, most existing tasks on this subject focus on static networks. In this paper, the problem of maximizing influence diffusion in dynamic social networks, i.e., the case of networks that change over time, is studied. The DM algorithm is an extension of the MATI algorithm and solves the influence maximization (IM) problem in dynamic networks and is proposed under the linear threshold (LT) and independent cascade (IC) models. Experimental results show that our proposed algorithm achieves a diffusion performance better by 1.5 times than several state-of-the-art algorithms and comparable results in diffusion scale with the Greedy algorithm. Also, the proposed algorithm is 2.4 times faster than previous methods.

Keywords: influence maximization, dynamic social networks, diffusion, social influence, graphs

Procedia PDF Downloads 242

Authors: Vun Yee Thien, Kenneth Francis Rodrigues, Clemente Michael Vui Ling Wong, Wilson Thau Lym Yong

Abstract:

Transcriptomes associated with the process of photosynthesis have offered insights into the mechanism of gene regulation in terrestrial plants; however, limited information is available as far as macroalgae are concerned. This investigation aims to decipher the underlying mechanisms associated with photosynthesis in the red alga, Kappaphycus alvarezii, by performing a differential expression analysis on a de novo assembled transcriptomes. Comparative analysis of gene expression was designed to examine the alteration of light qualities and its effect on physiological mechanisms in the red alga. High-throughput paired-end RNA-sequencing was applied to profile the transcriptome of K. alvarezii irradiated with different wavelengths of light (blue 492-455 nm, green 577-492 nm and red 780-622 nm) as compared to the full light spectrum, resulted in more than 60 million reads individually and assembled using Trinity and SOAPdenovo-Trans. The transcripts were annotated in the NCBI non-redundant (nr) protein, SwissProt, KEGG and COG databases with a cutoff E-value of 1e-5 and nearly 30% of transcripts were assigned to functional annotation by Blast searches. Differential expression analysis was performed using edgeR. The DEGs were designated to six categories: BL (blue light) regulated, GL (green light) regulated, RL (red light) regulated, BL or GL regulated, BL or RL regulated, GL or RL regulated, and either BL, GL or RL regulated. These DEGs were mapped to terms in KEGG database and compared with the whole transcriptome background to search for genes that regulated by light quality. The outcomes of this study will enhance our understanding of molecular mechanisms underlying light-induced responses in red algae.

Keywords: de novo transcriptome sequencing, differential gene expression, Kappaphycus alvareziired, red alga

Procedia PDF Downloads 509

Authors: Elham Alaee, Mousa Shamsi, Hossein Ahmadi, Soroosh Nazem, Mohammad Hossein Sedaaghi

Abstract:

Human face has a fundamental role in the appearance of individuals. So the importance of facial surgeries is undeniable. Thus, there is a need for the appropriate and accurate facial skin segmentation in order to extract different features. Since Fuzzy C-Means (FCM) clustering algorithm doesn’t work appropriately for noisy images and outliers, in this paper we exploit Possibilistic C-Means (PCM) algorithm in order to segment the facial skin. For this purpose, first, we convert facial images from RGB to YCbCr color space. To evaluate performance of the proposed algorithm, the database of Sahand University of Technology, Tabriz, Iran was used. In order to have a better understanding from the proposed algorithm; FCM and Expectation-Maximization (EM) algorithms are also used for facial skin segmentation. The proposed method shows better results than the other segmentation methods. Results include misclassification error (0.032) and the region’s area error (0.045) for the proposed algorithm.

Keywords: facial image, segmentation, PCM, FCM, skin error, facial surgery

Procedia PDF Downloads 586

Authors: Abdelhadi Lotfi, Abdelkader Benyettou

Abstract:

In this work, a training algorithm for probabilistic neural networks (PNN) is presented. The algorithm addresses one of the major drawbacks of PNN, which is the size of the hidden layer in the network. By using a cross-validation training algorithm, the number of hidden neurons is shrunk to a smaller number consisting of the most representative samples of the training set. This is done without affecting the overall architecture of the network. Performance of the network is compared against performance of standard PNN for different databases from the UCI database repository. Results show an important gain in network size and performance.

Keywords: classification, probabilistic neural networks, network optimization, pattern recognition

Procedia PDF Downloads 265

Authors: B. Benalioua, I. Benyamina, M. Mansour, A. Bentouami, B. Boury

Abstract:

The objective of this study is based on the synthesis of a new photocatalyst based on TiO2 and its application in the photo-degradation of an acid dye under the visible light. The material obtained was characterized by XRD, BET and UV- vis DRS. The photocatalytic efficiency of the Zn -Fe TiO2 treated at 500°C was tested on the Indigo Carmine under the irradiation of visible light and compared with that of the commercial titanium oxide TiO2-P25 (Degussa). The XRD characterization of the material Zn-Fe-TiO2 (500°C) revealed the presence of the anatase phase and the absence of the Rutile phase in comparison of the TiO2 P25 diffractogram. Characterization by UV-visible diffuse reflection material showed that the Fe-Zn-TiO2 exhibits redshift (move visible) relative to commercial titanium oxide TiO2-P25, this property promises a photocatalytic activity of Zn -Fe- TiO2 under visible light. Indeed, the efficiency of photocatalytic Fe-Zn-TiO2 as a visible light is shown by a complete discoloration of indigo carmine solution of 16 mg/L after 40 minutes, whereas with the P25-TiO2 discoloration is achieved after 90 minutes.

Keywords: POA, heterogeneous photocatalysis, TiO2, doping

Procedia PDF Downloads 415

Authors: Mohd Faridz Ahmad, Muhammad Amir Asyraf Rosli

Abstract:

Aerobic dance has becoming a popular mode of exercise especially among women due to its fun nature. With a catchy music background and joyful dance steps, aerobic dancers would be able to have fun while sweating out. Depending on its level of aggressiveness, aerobic may also improve and maintain cardiorespiratory fitness other than being a great tool for weight loss. This study intends to prove that aerobic dance activity can bring the same, if not better impacts on health than other types of cardiovascular exercise such as jogging and cycling. The objective of this study was to evaluate and identify the effect of six weeks aerobic dance on cardiovascular fitness and weight loss among women. This study, which was held in Seremban Fit Challenge, used a quasi-experimental design. The subjects selected include a total of 14 women (n = 14) with age (32.4 years old ± 9.1), weight (65.93 kg ± 11.24) and height (165.36 ± 3.46) who joined the Seremban Fit Challenge Season 13. The subjects were asked to join an aerobic dance class with duration of one hour for six weeks in a row. As for the outcome, cardiovascular fitness was measured with a 1-mile run test while any changes on weight was measured using the weighing scale. The result showed that there was a significant difference between pre and post-test for cardiovascular fitness when p = 0.02 < 0.05 and weight loss when p = 0.00 < 0.05. In conclusion, a six-week long aerobic dance program would have a positive effect on cardiovascular fitness and weight. Therefore, aerobic dance may be used as an alternative tool for people who wish to lead a healthy lifestyle in a fun way.

Keywords: aerobic dance, cardiovascular fitness, weight loss, 1-mile run test

Procedia PDF Downloads 547

Authors: S. Kumchoo

Abstract:

The result of suggestion for low energy diet (1,000-1,200 kcal) in obese women to the effect on body weight, waist circumference and body mass index (BMI) in this experiment. Quisi experimental research was used for this study and it is a One-group pretest-posttest designs measurement method. The aim of this study was body weight, waist circumference and body mass index (BMI) reduction by using low energy diet (1,000-1,200 kcal) in obese women, the result found that in 15 of obese women that contained their body mass index (BMI) ≥ 30, after they obtained low energy diet (1,000-1,200 kcal) within 2 weeks. The data were collected before and after of testing the results showed that the average of body weight decrease 3.4 kilogram, waist circumference value decrease 6.1 centimeter and the body mass index (BMI) decrease 1.3 kg.m² from their previous body weight, waist circumference and body mass index (BMI) before experiment started. After this study, the volunteers got healthy and they can choose or select some food for themselves. For this study, the research can be improved for data development for forward study in the future.

Keywords: body weight, waist circumference, low energy diet, BMI

Procedia PDF Downloads 388

Authors: Augusto P. Andrade, Pedro L. Guedes, Pedro T. Da Silva, Liliane Ventura

Abstract:

The present study evaluates the contribution of sunglasses frames as additional eye safety for ultraviolet backscatter light. Current sunglasses standards establish safe limits regarding lens transmittance in the 280 nm to 380 nm range. However, frames are additionally relevant in protecting the eyes from ultraviolet exposure. This study involves the use of a prototype that simulates backscattered light environments and quantifies the contribution of the frame as a function of the light that reaches the eye when wearing sunglasses. The prototype consists of an LED illuminated sphere, a mannequin head with optical sensors, and baseline and measurements are performed. A set of 29 samples was tested, and results show the variation of light blocking presented by different types of frames, ranging from 68% to 80%. This is still ongoing research. Prototype improvements for allowing albedo simulation, as well as the six types of sky simulation, are being implemented to show the intensity of UV light reaching the eye for several environments worldwide.

Keywords: sunglasses standards, sunglasses frame, ultraviolet protection, albedo

Procedia PDF Downloads 104

Authors: Israa Sh. Tawfic, Sema Koc Kayhan

Abstract:

In this paper, first, we propose least support orthogonal matching pursuit (LS-OMP) algorithm to improve the performance, of the OMP (orthogonal matching pursuit) algorithm. LS-OMP algorithm adaptively chooses optimum L (least part of support), at each iteration. This modification helps to reduce the computational complexity significantly and performs better than OMP algorithm. Second, we give the procedure for the invisible image watermarking in the presence of compressive sampling. The image reconstruction based on a set of watermarked measurements is performed using LS-OMP.

Keywords: compressed sensing, orthogonal matching pursuit, restricted isometry property, signal reconstruction, least support orthogonal matching pursuit, watermark

Procedia PDF Downloads 339

Authors: Kay Thi Yar, Khin Mar Lar Tun

Abstract:

Nowadays, social networks are so popular and widely used in all over the world. In addition, searching personal information of each person and searching connection between them (peoples’ relation in real world) becomes interesting issue in our society. In this paper, we propose a framework with three portions for exploring peoples’ relations from their connected information. The first portion focuses on the Graph database structure to store the connected data of peoples’ information. The second one proposes the graph database searching algorithm, the Modified-SoS-ACO (Sense of Smell-Ant Colony Optimization). The last portion proposes the Deductive Reasoning Algorithm to define two persons’ relationship. This study reveals the proper storage structure for connected information, graph searching algorithm and deductive reasoning algorithm to predict and analyze the personnel relationship from peoples’ relation in their connected information.

Keywords: personnel information, graph storage structure, graph searching algorithm, deductive reasoning algorithm

Procedia PDF Downloads 452

Authors: Linyu Wang, Jiahui Ma, Jianhong Xiang, Hanyu Jiang

Abstract:

the traditional greedy compressed sensing algorithm needs to know the signal sparsity when recovering the signal, but the signal sparsity in the practical application can not be obtained as a priori information, and the recovery accuracy is low, which does not meet the needs of practical application. To solve this problem, this paper puts forward Piecewise adaptive backtracking orthogonal least squares algorithm. The algorithm is divided into two stages. In the first stage, the sparsity pre-estimation strategy is adopted, which can quickly approach the real sparsity and reduce time consumption. In the second stage iteration, the correction strategy and adaptive step size are used to accurately estimate the sparsity, and the backtracking idea is introduced to improve the accuracy of signal recovery. Through experimental simulation, the algorithm can accurately recover the estimated signal with fewer iterations when the sparsity is unknown.

Keywords: compressed sensing, greedy algorithm, least square method, adaptive reconstruction

Procedia PDF Downloads 151

Authors: Yong Zhang

Abstract:

Light has proven to be useful in a wide range of biomedical applications such as fluorescence imaging, photoacoustic imaging, optogenetics, photodynamic therapy, photothermal therapy, and light controlled drug/gene delivery. Taking photodynamic therapy (PDT) as an example, PDT has been proven clinically effective in early lung cancer, bladder cancer, head, and neck cancer and is the primary treatment for skin cancer as well. However, clinical use of PDT is severely constrained by the low penetration depth of visible light through thick tissue, limiting its use to target regions only a few millimeters deep. One way to enhance the range is to use invisible near-infrared (NIR) light within the optical window (700–1100nm) for biological tissues, extending the depth up to 1cm with no observable damage to the intervening tissue. We have demonstrated use of NIR-to-visible upconversion fluorescent nanoparticles (UCNPs), emitting visible fluorescence when excited by a NIR light at 980nm, as a nanotransducer for PDT to convert deep tissue-penetrating NIR light to visible light suitable for activating photosensitizers. The unique optical properties of UCNPs enable the upconversion wavelength to be tuned and matched to the activation absorption wavelength of the photosensitizer. At depths beyond 1cm, however, tissue remains inaccessible to light even within the NIR window, and this critical depth limitation renders existing phototherapy ineffective against most deep-seated cancers. We have demonstrated some new treatment modalities for deep-seated cancers based on UCNP hydrogel implants and miniaturized, wirelessly powered optoelectronic devices for light delivery to deep tissues.

Keywords: upconversion, fluorescent, nanoparticle, bioimaging, photodynamic therapy

Procedia PDF Downloads 161

Authors: Ahmad M. Awwad, Jehad Al-Sadi

Abstract:

The star network is one of the promising interconnection networks for future high speed parallel computers, it is expected to be one of the future-generation networks. The star network is both edge and vertex symmetry, it was shown to have many gorgeous topological proprieties also it is owns hierarchical structure framework. Although much of the research work has been done on this promising network in literature, it still suffers from having enough algorithms for load balancing problem. In this paper we try to work on this issue by investigating and proposing an efficient algorithm for load balancing problem for the star network. The proposed algorithm is called Star Clustered Dimension Exchange Method SCDEM to be implemented on the star network. The proposed algorithm is based on the Clustered Dimension Exchange Method (CDEM). The SCDEM algorithm is shown to be efficient in redistributing the load balancing as evenly as possible among all nodes of different factor networks.

Keywords: load balancing, star network, interconnection networks, algorithm

Procedia PDF Downloads 320

Authors: Kriangkrai Maneerat, Chutima Prommak

Abstract:

Indoor wireless localization systems have played an important role to enhance context-aware services. Determining the position of mobile objects in complex indoor environments, such as those in multi-floor buildings, is very challenging problems. This paper presents an effective floor estimation algorithm, which can accurately determine the floor where mobile objects located. The proposed algorithm is based on the confidence interval of the summation of online Received Signal Strength (RSS) obtained from the IEEE 802.15.4 Wireless Sensor Networks (WSN). We compare the performance of the proposed algorithm with those of other floor estimation algorithms in literature by conducting a real implementation of WSN in our facility. The experimental results and analysis showed that the proposed floor estimation algorithm outperformed the other algorithms and provided highest percentage of floor accuracy up to 100% with 95-percent confidence interval.

Keywords: floor estimation algorithm, floor determination, multi-floor building, indoor wireless systems

Procedia PDF Downloads 419

Authors: Cao Xiaopeng, Shi Linkai

Abstract:

The practical Byzantine fault-tolerant algorithm does not add nodes dynamically. It is limited in practical application. In order to add nodes dynamically, Dynamic Practical Byzantine Fault Tolerance Algorithm (DPBFT) was proposed. Firstly, a new node sends request information to other nodes in the network. The nodes in the network decide their identities and requests. Then the nodes in the network reverse connect to the new node and send block information of the current network. The new node updates information. Finally, the new node participates in the next round of consensus, changes the view and selects the master node. This paper abstracts the decision of nodes into the undirected connected graph. The final consistency of the graph is used to prove that the proposed algorithm can adapt to the network dynamically. Compared with the PBFT algorithm, DPBFT has better fault tolerance and lower network bandwidth.

Keywords: practical byzantine, fault tolerance, blockchain, consensus algorithm, consistency analysis

Procedia PDF Downloads 130

Authors: Richa Soni, Vibha Bhatnagar, N. K. Jain

Abstract:

This study was conducted to develop a computer mediated programme for weight management and physical fitness and examining its efficacy in reducing weight and improving physical fitness in obese adults. A user friendly, computer based programme was developed to provide a simple, quick, easy and user-friendly method of assessing energy balance at individual level. The programme had four main sections viz. personal Profile, know about your weight, fitness and food exchange list. The computer programme was developed to provide facilities of creating individual profile, tracking meal and physical activities, suggesting nutritional and exercise requirements, planning calorie specific menus, keeping food diaries and revising the diet and exercise plans if needed. The programme was also providing information on obesity, underweight, physical fitness. An exhaustive food exchange list was also given in the programme to assist user to make right food choice decisions. The developed programme was evaluated by a panel of 15 experts comprising endocrinologists, nutritionists and diet counselors. Suggestions given by the experts were paned down and the entire programme was modified in light of suggestions given by the panel members and was reevaluated by the same panel of experts. For assessing the impact of the programme 22 obese subjects were selected purposively and randomly assigned to intervention group (n=12) and no information control group. (n=10). The programme group was asked to strictly follow the programme for one month. Significant reduction in the intake of energy, fat and carbohydrates was observed while intake of fruits, green leafy vegetables was increased. The programme was also found to be effective in reducing body weight, body fat percent and body fat mass whereas total body water and physical fitness scores improved significantly. There was no significant alteration observed in any parameters in the control group.

Keywords: body composition, body weight, computer programme, physical fitness

Procedia PDF Downloads 286

Authors: S. Kumchoo

Abstract:

The result of suggestion for low energy diet (1,000-1,200 kcal) in obese women to the effect on body weight, waist circumference and body mass index (BMI) in this experiment. Quisi experimental research was used for this study and it is a One-group pretest-posttest designs measurement method. The aim of this study was body weight, waist circumference and body mass index (BMI) reduction by using low energy diet (1,000-1,200 kcal) in obese women, the result found that in 15 of obese women that contained their body mass index (BMI) ≥ 30, after they obtained low energy diet (1,000-1,200 kcal) within 2 weeks. The data were collected before and after of testing the results showed that the average of body weight decrease 3.4 kilogram, waist circumference value decrease 6.1 centimeter and the body mass index (BMI) decrease 1.3 kg.m2 from their previous body weight, waist circumference and body mass index (BMI) before experiment started. After this study, the volunteers got healthy and they can choose or select some food for themselves. For this study, the research can be improved for data development for forward study in the future.

Keywords: body weight, waist circumference, BMI, low energy diet

Procedia PDF Downloads 456

Authors: C. Juntarasaid, T. Pulngern, S. Chucheepsakul

Abstract:

A formulation of postbuckling analysis of end supported rods under self-weight has been presented by the variational method. The variational formulation involving the strain energy due to bending and the potential energy of the self-weight, are expressed in terms of the intrinsic coordinates. The variational formulation is accomplished by introducing the Lagrange multiplier technique to impose the boundary conditions. The finite element method is used to derive a system of nonlinear equations resulting from the stationary of the total potential energy and then Newton-Raphson iterative procedure is applied to solve this system of equations. The numerical results demonstrate the postbluckled configurations of end supported rods under self-weight. This finite element method based on variational formulation expressed in term of intrinsic coordinate is highly recommended for postbuckling analysis of end-supported rods under self-weight.

Keywords: postbuckling, finite element method, variational method, intrinsic coordinate

Procedia PDF Downloads 158

Authors: Haifa Ben Saber, Mourad Elloumi

Abstract:

In a number of domains, like in DNA microarray data analysis, we need to cluster simultaneously rows (genes) and columns (conditions) of a data matrix to identify groups of constant rows with a group of columns. This kind of clustering is called biclustering. Biclustering algorithms are extensively used in DNA microarray data analysis. More effective biclustering algorithms are highly desirable and needed. We introduce a new algorithm called, Enumerative tree (EnumTree) for biclustering of binary microarray data. is an algorithm adopting the approach of enumerating biclusters. This algorithm extracts all biclusters consistent good quality. The main idea of ​​EnumLat is the construction of a new tree structure to represent adequately different biclusters discovered during the process of enumeration. This algorithm adopts the strategy of all biclusters at a time. The performance of the proposed algorithm is assessed using both synthetic and real DNA micryarray data, our algorithm outperforms other biclustering algorithms for binary microarray data. Biclusters with different numbers of rows. Moreover, we test the biological significance using a gene annotation web tool to show that our proposed method is able to produce biologically relevent biclusters.

Keywords: DNA microarray, biclustering, gene expression data, tree, datamining.

Procedia PDF Downloads 372

Authors: Sahithi Yarlagadda

Abstract:

The design of antenna is constrained by mathematical and geometrical parameters. Though there are diverse antenna structures with wide range of feeds yet, there are many geometries to be tried, which cannot be customized into predefined computational methods. The antenna design and optimization qualify to apply evolutionary algorithmic approach since the antenna parameters weights dependent on geometric characteristics directly. The evolutionary algorithm can be explained simply for a given quality function to be maximized. We can randomly create a set of candidate solutions, elements of the function's domain, and apply the quality function as an abstract fitness measure. Based on this fitness, some of the better candidates are chosen to seed the next generation by applying recombination and permutation to them. In conventional approach, the quality function is unaltered for any iteration. But the antenna parameters and geometries are wide to fit into single function. So, the weight coefficients are obtained for all possible antenna electrical parameters and geometries; the variation is learnt by mining the data obtained for an optimized algorithm. The weight and covariant coefficients of corresponding parameters are logged for learning and future use as datasets. This paper drafts an approach to obtain the requirements to study and methodize the evolutionary approach to automated antenna design for our past work on Vivaldi antenna as test candidate. The antenna parameters like gain, directivity, etc. are directly caged by geometries, materials, and dimensions. The design equations are to be noted here and valuated for all possible conditions to get maxima and minima for given frequency band. The boundary conditions are thus obtained prior to implementation, easing the optimization. The implementation mainly aimed to study the practical computational, processing, and design complexities that incur while simulations. HFSS is chosen for simulations and results. MATLAB is used to generate the computations, combinations, and data logging. MATLAB is also used to apply machine learning algorithms and plotting the data to design the algorithm. The number of combinations is to be tested manually, so HFSS API is used to call HFSS functions from MATLAB itself. MATLAB parallel processing tool box is used to run multiple simulations in parallel. The aim is to develop an add-in to antenna design software like HFSS, CSTor, a standalone application to optimize pre-identified common parameters of wide range of antennas available. In this paper, we have used MATLAB to calculate Vivaldi antenna parameters like slot line characteristic impedance, impedance of stripline, slot line width, flare aperture size, dielectric and K means, and Hamming window are applied to obtain the best test parameters. HFSS API is used to calculate the radiation, bandwidth, directivity, and efficiency, and data is logged for applying the Evolutionary genetic algorithm in MATLAB. The paper demonstrates the computational weights and Machine Learning approach for automated antenna optimizing for Vivaldi antenna.

Keywords: machine learning, Vivaldi, evolutionary algorithm, genetic algorithm

Procedia PDF Downloads 111

Authors: N. Ould Cherchali, A. Tlemçani, M. S. Boucherit, A. Morsli

Abstract:

Nature-inspired metaheuristic algorithms, particularly those founded on swarm intelligence, have attracted much attention over the past decade. Firefly algorithm has appeared in approximately seven years ago, its literature has enlarged considerably with different applications. It is inspired by the behavior of fireflies. The aim of this paper is the application of firefly algorithm for solving a nonlinear algebraic system. This resolution is needed to study the Selective Harmonic Eliminated Pulse Width Modulation strategy (SHEPWM) to eliminate the low order harmonics; results have been applied on multilevel inverters. The final results from simulations indicate the elimination of the low order harmonics as desired. Finally, experimental results are presented to confirm the simulation results and validate the efficaciousness of the proposed approach.

Keywords: firefly algorithm, metaheuristic algorithm, multilevel inverter, SHEPWM

Procedia PDF Downloads 148

Authors: Osagbai Joshua Eriki, Ngozi Agunwamba, Alice Hill, Lorna Almond, Maniya Duffy, Devashini Naidoo, David Ho, Raman Deo

Abstract:

Aims: To evaluate the baseline eating pattern in a psychiatric hospital through quantifying purchases of food and drink items at the hospital shop and to implement a traffic light healthy eating labeling system. Method: A electronic till with reporting capabilities was purchased. A two-week period of baseline data collection was conducted. Thereafter, a system for labeling items based on the nutritional value of the food items at the hospital shop was implemented. Green labeling represented the items with the lowest calories and red the most. Further data was collated on the number and types of items purchased by patients according to the category, and the initial effectiveness of the system was evaluated. Result: Despite the implementation of the traffic light system, the red category had the highest number of items purchased by patients, highlighting the importance of promoting healthy eating choices. However, the study also showed that the system was effective in promoting healthy options, as the number of items purchased from the green category increased during the study period. Conclusion: The implementation of a traffic light labeling system for items sold at the hospital shop offers a promising approach to promoting healthy eating habits and choices. This is likely to contribute to a toolkit of measures when considering the multifactorial challenges that obesity and weight issues pose for long-stay psychiatric inpatients

Keywords: mental health, nutrition, food, healthy

Procedia PDF Downloads 99

Authors: Arslan Ellahi, Syed Amjad Hussain, Fawaz Saleem Bokhari

Abstract:

Optimization of software architecture can be done with respect to a quality attributes (QA). In this paper, there is an analysis of multiple research papers from different dimensions that have been used to classify those attributes. We have proposed a technique of swarm intelligence Meta heuristic ant colony optimization algorithm as a contribution to solve this critical optimization problem of software architecture. We have ranked quality attributes and run our algorithm on every QA, and then we will rank those on the basis of accuracy. At the end, we have selected the most accurate quality attributes. Ant colony algorithm is an effective algorithm and will perform best in optimizing the QA’s and ranking them.

Keywords: complexity, rapid evolution, swarm intelligence, dimensions

Procedia PDF Downloads 263

Authors: Daniel Kostrzewa, Henryk Josiński

Abstract:

The expanded Invasive Weed Optimization algorithm (exIWO) is an optimization metaheuristic modelled on the original IWO version created by the researchers from the University of Tehran. The authors of the present paper have extended the exIWO algorithm introducing a set of both deterministic and non-deterministic strategies of individuals’ selection. The goal of the project was to evaluate the exIWO by testing its usefulness for solving some test instances of the traveling salesman problem (TSP) taken from the TSPLIB collection which allows comparing the experimental results with optimal values.

Keywords: expanded invasive weed optimization algorithm (exIWO), traveling salesman problem (TSP), heuristic approach, inversion operator

Procedia PDF Downloads 836

Authors: Daljinder Singh, J.S.Dhillon, Balraj Singh

Abstract:

According to no free lunch theorem, a single search technique cannot perform best in all conditions. Optimization method can be attractive choice to solve optimization problem that may have exclusive advantages like robust and reliable performance, global search capability, little information requirement, ease of implementation, parallelism, no requirement of differentiable and continuous objective function. In order to synergize between exploration and exploitation and to further enhance the performance of Bat algorithm, the paper proposed a modified bat algorithm that adds additional search procedure based on bat’s previous experience. The proposed algorithm is used for solving the economic load dispatch (ELD) problem. The practical constraint such valve-point loading along with power balance constraints and generator limit are undertaken. To take care of power demand constraint variable elimination method is exploited. The proposed algorithm is tested on various ELD problems. The results obtained show that the proposed algorithm is capable of performing better in majority of ELD problems considered and is at par with existing algorithms for some of problems.

Keywords: bat algorithm, economic load dispatch, penalty method, variable elimination method

Procedia PDF Downloads 461

Authors: Pongchanun Luangpaiboon, Wanwisa Sarasang

Abstract:

In this paper, a performance of shuffled frog leaping algorithm was investigated on the stealth laser dicing process. Effect of problem on the performance of the algorithm was based on the tolerance of meandering data. From the customer specification it could be less than five microns with the target of zero microns. Currently, the meandering levels are unsatisfactory when compared to the customer specification. Firstly, the two-level factorial design was applied to preliminary study the statistically significant effects of five process variables. In this study one influential process variable is integer. From the experimental results, the new operating condition from the algorithm was superior when compared to the current manufacturing condition.

Keywords: stealth laser dicing process, meandering, meta-heuristics, shuffled frog leaping algorithm

Procedia PDF Downloads 341

Authors: Tomasz Robert Kuczerski

Abstract:

The high complexity of the algorithm of the autonomous tandem detonator system creates an optimization problem due to the parallel operation of several machine states of the system. Many years of experience and classic analyses have led to a partially optimized model. Limitations on the energy resources of this class of autonomous systems make it necessary to search for more effective methods of optimisation. The use of the Quantum Approximate Optimization Algorithm (QAOA) in these studies shows the most promising results. With the help of multiple evaluations of several qubit quantum circuits, proper results of variable parameter optimization were obtained. In addition, it was observed that the increase in the number of assessments does not result in further efficient growth due to the increasing complexity of optimising variables. The tests confirmed the effectiveness of the QAOA optimization method.

Keywords: algorithm analysis, autonomous system, quantum optimization, tandem detonator

Procedia PDF Downloads 92

Authors: Wafa Slaibi Alsharafat

Abstract:

Genetic algorithms (GA) are random algorithms as random numbers that are generated during the operation of the algorithm determine what happens. This means that if GA is applied twice to optimize exactly the same problem it might produces two different answers. In this project, we propose an evolutionary algorithm and Genetic Algorithm (GA) to be implemented in symmetric encryption and decryption. Here, user's message and user secret information (key) which represent plain text to be transferred into cipher text.

Keywords: GA, encryption, decryption, crossover

Procedia PDF Downloads 446