Search results for: multi-objective genetic algorithm
3867 Comparison between the Conventional Methods and PSO Based MPPT Algorithm for Photovoltaic Systems
Authors: Ramdan B. A. Koad, Ahmed F. Zobaa
Abstract:
Since the output characteristics of Photovoltaic (PV) system depends on the ambient temperature, solar radiation and load impedance, its maximum Power Point (MPP) is not constant. Under each condition PV module has a point at which it can produce its MPP. Therefore, a Maximum Power Point Tracking (MPPT) method is needed to uphold the PV panel operating at its MPP. This paper presents comparative study between the conventional MPPT methods used in (PV) system: Perturb and Observe (P&O), Incremental Conductance (IncCond), and Particle Swarm Optimization (PSO) algorithm for (MPPT) of (PV) system. To evaluate the study, the proposed PSO MPPT is implemented on a DC-DC converter and has been compared with P&O and INcond methods in terms of their tracking speed, accuracy and performance by using the Matlab tool Simulink. The simulation result shows that the proposed algorithm is simple, and is superior to the P&O and IncCond methods.Keywords: photovoltaic systems, maximum power point tracking, perturb and observe method, incremental conductance, methods and practical swarm optimization algorithm
Procedia PDF Downloads 3563866 Genetic Analysis of the Endangered Mangrove Species Avicennia Marina in Qatar Detected by Inter-Simple Sequence Repeat DNA Markers
Authors: Talaat Ahmed, Amna Babssail
Abstract:
Mangroves are evergreen trees and grow along the coastal areas of Qatar. The largest and oldest area of mangroves can be found around Al-Thakhira and Al-Khor. Other mangrove areas originate from fairly recent plantings by the government, although unfortunately the picturesque mangrove lake in Al-Wakra has now been uprooted. Avicinnia marina is the predominant mangrove species found in the region. Mangroves protect and stabilize low lying coastal land, and provide protection and food sources for estuarine and coastal fishery food chains. They also serve as feeding, breeding and nursery grounds for a variety of fish, crustaceans, reptiles, birds and other wildlife. A total of 21 individuals of A. marina, representing seven diverse Natural and artificial populations, were sampled throughout its range in Qatar. Leaves from 2-3 randomly selected trees at each location were collected. The locations are as follows: Al-Rawis, Ras-Madpak, Fuwairt, Summaseima, Al-khour, AL-Mafjar and Zekreet. Total genomic DNA was extracted using commercial DNeasy Plant System (Qiagen, Inc., Valencia, CA) kit to be used for genetic diversity analysis. Total of 12 (Inter-Simple Sequence Repeat) ISSR primers were used to amplify DNA fragments using genomic DNA. The 12 ISSR primers amplified polymorphic bands among mangrove samples in different areas as well as within each area indicating the existing of variation within each area and among the different areas of mangrove in Qatar. The results could characterize Avicinnia marina populations exist in different areas of Qatar and establish DNA fingerprint documentations for mangrove population to be used in further studies. Moreover, existing of genetic variation within and among Avicinnia marina populations is a strong indication for the ability of such populations to adapt different environmental conditions in Qatar. This study could be a warning to save mangrove in Qatar and save the environment as well.Keywords: DNA fingerprint, Avicinnia marina, genetic analysis, Qatar
Procedia PDF Downloads 3903865 Design and Implementation of a Counting and Differentiation System for Vehicles through Video Processing
Authors: Derlis Gregor, Kevin Cikel, Mario Arzamendia, Raúl Gregor
Abstract:
This paper presents a self-sustaining mobile system for counting and classification of vehicles through processing video. It proposes a counting and classification algorithm divided in four steps that can be executed multiple times in parallel in a SBC (Single Board Computer), like the Raspberry Pi 2, in such a way that it can be implemented in real time. The first step of the proposed algorithm limits the zone of the image that it will be processed. The second step performs the detection of the mobile objects using a BGS (Background Subtraction) algorithm based on the GMM (Gaussian Mixture Model), as well as a shadow removal algorithm using physical-based features, followed by morphological operations. In the first step the vehicle detection will be performed by using edge detection algorithms and the vehicle following through Kalman filters. The last step of the proposed algorithm registers the vehicle passing and performs their classification according to their areas. An auto-sustainable system is proposed, powered by batteries and photovoltaic solar panels, and the data transmission is done through GPRS (General Packet Radio Service)eliminating the need of using external cable, which will facilitate it deployment and translation to any location where it could operate. The self-sustaining trailer will allow the counting and classification of vehicles in specific zones with difficult access.Keywords: intelligent transportation system, object detection, vehicle couting, vehicle classification, video processing
Procedia PDF Downloads 3183864 Identity Verification Using k-NN Classifiers and Autistic Genetic Data
Authors: Fuad M. Alkoot
Abstract:
DNA data have been used in forensics for decades. However, current research looks at using the DNA as a biometric identity verification modality. The goal is to improve the speed of identification. We aim at using gene data that was initially used for autism detection to find if and how accurate is this data for identification applications. Mainly our goal is to find if our data preprocessing technique yields data useful as a biometric identification tool. We experiment with using the nearest neighbor classifier to identify subjects. Results show that optimal classification rate is achieved when the test set is corrupted by normally distributed noise with zero mean and standard deviation of 1. The classification rate is close to optimal at higher noise standard deviation reaching 3. This shows that the data can be used for identity verification with high accuracy using a simple classifier such as the k-nearest neighbor (k-NN).Keywords: biometrics, genetic data, identity verification, k nearest neighbor
Procedia PDF Downloads 2493863 Algorithm Optimization to Sort in Parallel by Decreasing the Number of the Processors in SIMD (Single Instruction Multiple Data) Systems
Authors: Ali Hosseini
Abstract:
Paralleling is a mechanism to decrease the time necessary to execute the programs. Sorting is one of the important operations to be used in different systems in a way that the proper function of many algorithms and operations depend on sorted data. CRCW_SORT algorithm executes ‘N’ elements sorting in O(1) time on SIMD (Single Instruction Multiple Data) computers with n^2/2-n/2 number of processors. In this article having presented a mechanism by dividing the input string by the hinge element into two less strings the number of the processors to be used in sorting ‘N’ elements in O(1) time has decreased to n^2/8-n/4 in the best state; by this mechanism the best state is when the hinge element is the middle one and the worst state is when it is minimum. The findings from assessing the proposed algorithm by other methods on data collection and number of the processors indicate that the proposed algorithm uses less processors to sort during execution than other methods.Keywords: CRCW, SIMD (Single Instruction Multiple Data) computers, parallel computers, number of the processors
Procedia PDF Downloads 3033862 Efficient Motion Estimation by Fast Three Step Search Algorithm
Authors: S. M. Kulkarni, D. S. Bormane, S. L. Nalbalwar
Abstract:
The rapid development in the technology have dramatic impact on the medical health care field. Medical data base obtained with latest machines like CT Machine, MRI scanner requires large amount of memory storage and also it requires large bandwidth for transmission of data in telemedicine applications. Thus, there is need for video compression. As the database of medical images contain number of frames (slices), hence while coding of these images there is need of motion estimation. Motion estimation finds out movement of objects in an image sequence and gets motion vectors which represents estimated motion of object in the frame. In order to reduce temporal redundancy between successive frames of video sequence, motion compensation is preformed. In this paper three step search (TSS) block matching algorithm is implemented on different types of video sequences. It is shown that three step search algorithm produces better quality performance and less computational time compared with exhaustive full search algorithm.Keywords: block matching, exhaustive search motion estimation, three step search, video compression
Procedia PDF Downloads 4803861 The Parallelization of Algorithm Based on Partition Principle for Association Rules Discovery
Authors: Khadidja Belbachir, Hafida Belbachir
Abstract:
subsequently the expansion of the physical supports storage and the needs ceaseless to accumulate several data, the sequential algorithms of associations’ rules research proved to be ineffective. Thus the introduction of the new parallel versions is imperative. We propose in this paper, a parallel version of a sequential algorithm “Partition”. This last is fundamentally different from the other sequential algorithms, because it scans the data base only twice to generate the significant association rules. By consequence, the parallel approach does not require much communication between the sites. The proposed approach was implemented for an experimental study. The obtained results, shows a great reduction in execution time compared to the sequential version and Count Distributed algorithm.Keywords: association rules, distributed data mining, partition, parallel algorithms
Procedia PDF Downloads 4023860 Wireless Sensor Networks Optimization by Using 2-Stage Algorithm Based on Imperialist Competitive Algorithm
Authors: Hamid R. Lashgarian Azad, Seyed N. Shetab Boushehri
Abstract:
Wireless sensor networks (WSN) have become progressively popular due to their wide range of applications. Wireless Sensor Network is made of numerous tiny sensor nodes that are battery-powered. It is a very significant problem to maximize the lifetime of wireless sensor networks. In this paper, we propose a two-stage protocol based on an imperialist competitive algorithm (2S-ICA) to solve a sensor network optimization problem. The energy of the sensors can be greatly reduced and the lifetime of the network reduced by long communication distances between the sensors and the sink. We can minimize the overall communication distance considerably, thereby extending the lifetime of the network lifetime through connecting sensors into a series of independent clusters using 2SICA. Comparison results of the proposed protocol and LEACH protocol, which is common to solving WSN problems, show that our protocol has a better performance in terms of improving network life and increasing the number of transmitted data.Keywords: wireless sensor network, imperialist competitive algorithm, LEACH protocol, k-means clustering
Procedia PDF Downloads 953859 Analysis of OPG Gene Polymorphism T245G (rs3134069) in Slovak Postmenopausal Women
Authors: I. Boroňová, J. Bernasovská, J. Kľoc, Z. Tomková, E. Petrejčíková, S. Mačeková, J. Poráčová, M. M. Blaščáková
Abstract:
Osteoporosis is a common multifactorial disease with a strong genetic component characterized by reduced bone mass and increased risk of fractures. Genetic factors play an important role in the pathogenesis of osteoporosis. The aim of our study was to identify the genotype and allele distribution of T245G polymorphism in OPG gene in Slovak postmenopausal women. A total of 200 unrelated Slovak postmenopausal women with diagnosed osteoporosis and 200 normal controls were genotyped for T245G (rs3134069) polymorphism of OPG gene. Genotyping was performed using the Custom Taqman®SNP Genotyping assays. Genotypes and alleles frequencies showed no significant differences (p=0.5551; p=0.6022). The results of the present study confirm the importance of T245G polymorphism in OPG gene in the pathogenesis of osteoporosis.Keywords: OPG gene, T245G polymorphism, osteoporosis, T245G polymorphism, real-time PCR
Procedia PDF Downloads 4033858 Pattern Recognition Search: An Advancement Over Interpolation Search
Authors: Shahpar Yilmaz, Yasir Nadeem, Syed A. Mehdi
Abstract:
Searching for a record in a dataset is always a frequent task for any data structure-related application. Hence, a fast and efficient algorithm for the approach has its importance in yielding the quickest results and enhancing the overall productivity of the company. Interpolation search is one such technique used to search through a sorted set of elements. This paper proposes a new algorithm, an advancement over interpolation search for the application of search over a sorted array. Pattern Recognition Search or PR Search (PRS), like interpolation search, is a pattern-based divide and conquer algorithm whose objective is to reduce the sample size in order to quicken the process and it does so by treating the array as a perfect arithmetic progression series and thereby deducing the key element’s position. We look to highlight some of the key drawbacks of interpolation search, which are accounted for in the Pattern Recognition Search.Keywords: array, complexity, index, sorting, space, time
Procedia PDF Downloads 2343857 A Communication Signal Recognition Algorithm Based on Holder Coefficient Characteristics
Authors: Hui Zhang, Ye Tian, Fang Ye, Ziming Guo
Abstract:
Communication signal modulation recognition technology is one of the key technologies in the field of modern information warfare. At present, communication signal automatic modulation recognition methods are mainly divided into two major categories. One is the maximum likelihood hypothesis testing method based on decision theory, the other is a statistical pattern recognition method based on feature extraction. Now, the most commonly used is a statistical pattern recognition method, which includes feature extraction and classifier design. With the increasingly complex electromagnetic environment of communications, how to effectively extract the features of various signals at low signal-to-noise ratio (SNR) is a hot topic for scholars in various countries. To solve this problem, this paper proposes a feature extraction algorithm for the communication signal based on the improved Holder cloud feature. And the extreme learning machine (ELM) is used which aims at the problem of the real-time in the modern warfare to classify the extracted features. The algorithm extracts the digital features of the improved cloud model without deterministic information in a low SNR environment, and uses the improved cloud model to obtain more stable Holder cloud features and the performance of the algorithm is improved. This algorithm addresses the problem that a simple feature extraction algorithm based on Holder coefficient feature is difficult to recognize at low SNR, and it also has a better recognition accuracy. The results of simulations show that the approach in this paper still has a good classification result at low SNR, even when the SNR is -15dB, the recognition accuracy still reaches 76%.Keywords: communication signal, feature extraction, Holder coefficient, improved cloud model
Procedia PDF Downloads 1463856 PointNetLK-OBB: A Point Cloud Registration Algorithm with High Accuracy
Authors: Wenhao Lan, Ning Li, Qiang Tong
Abstract:
To improve the registration accuracy of a source point cloud and template point cloud when the initial relative deflection angle is too large, a PointNetLK algorithm combined with an oriented bounding box (PointNetLK-OBB) is proposed. In this algorithm, the OBB of a 3D point cloud is used to represent the macro feature of source and template point clouds. Under the guidance of the iterative closest point algorithm, the OBB of the source and template point clouds is aligned, and a mirror symmetry effect is produced between them. According to the fitting degree of the source and template point clouds, the mirror symmetry plane is detected, and the optimal rotation and translation of the source point cloud is obtained to complete the 3D point cloud registration task. To verify the effectiveness of the proposed algorithm, a comparative experiment was performed using the publicly available ModelNet40 dataset. The experimental results demonstrate that, compared with PointNetLK, PointNetLK-OBB improves the registration accuracy of the source and template point clouds when the initial relative deflection angle is too large, and the sensitivity of the initial relative position between the source point cloud and template point cloud is reduced. The primary contribution of this paper is the use of PointNetLK to avoid the non-convex problem of traditional point cloud registration and leveraging the regularity of the OBB to avoid the local optimization problem in the PointNetLK context.Keywords: mirror symmetry, oriented bounding box, point cloud registration, PointNetLK-OBB
Procedia PDF Downloads 1463855 Improved Pattern Matching Applied to Surface Mounting Devices Components Localization on Automated Optical Inspection
Authors: Pedro M. A. Vitoriano, Tito. G. Amaral
Abstract:
Automated Optical Inspection (AOI) Systems are commonly used on Printed Circuit Boards (PCB) manufacturing. The use of this technology has been proven as highly efficient for process improvements and quality achievements. The correct extraction of the component for posterior analysis is a critical step of the AOI process. Nowadays, the Pattern Matching Algorithm is commonly used, although this algorithm requires extensive calculations and is time consuming. This paper will present an improved algorithm for the component localization process, with the capability of implementation in a parallel execution system.Keywords: AOI, automated optical inspection, SMD, surface mounting devices, pattern matching, parallel execution
Procedia PDF Downloads 2953854 Genetic Diversity Analysis in Embelia Ribes by RAPD Markers
Authors: Sabitha Rani A., Nagamani V.
Abstract:
Embelia ribes Burm.f (Family-Myrsinaceae) commonly known as Vidanga or Baibirang, is one of the important medicinal plants of India. The seed extract is reported to be antidiabetic, antitumour, analgesic, anti-inflammatory, antispermatogenic, free radical scavenging activities and widely used in more than 75 Ayurvedic commercial formulations. Among the 100 different species of Embelia, E. ribes is considered as a major source of Embelin, a bioactive compound. Because of high demand and low availability, the seeds of E. ribes are substituted with many cheaper alternatives. Therefore, the present study of RAPD-PCR analysis was undertaken to develop molecular markers for identification of E. ribes. A total of 13 different seed samples of Embelia were collected from different agro-climatic regions of India. The seeds of E.ribes were collected from Kalpetta, Kerala and three different seed samples were collected from traders of Odisha, Madhya Pradesh, Maharastra. The other nine seed samples were collected from local traders which they have collected from different regions of India. Genomic DNA was isolated from different seed samples E. ribes and RAPD-PCR was performed on 13 different seed samples using 47 random primers. Out of all the primers, only 22 primers produced clear and highly-reproducible banding patterns. The 22 selected RAPD primers generated a total of 280 alleles with an average of 12 alleles per primer pair. In the present study, we have identified three RAPD-PCR markers i.e. OPF5_480 bp, OPH11_520 bp and OPH4_530 bp which can be used for genetic fingerprinting of E. ribes. This methodology can be employed for identification of original E. ribes and also distinguishing it from other substitutes and adulterants.Keywords: Embelia ribes, RAPD-PCR, primers, genetic analysis
Procedia PDF Downloads 2923853 Genetic Diversity of Mycobacterium bovis and Its Zoonotic Potential in Ethiopia: A Systematic Review
Authors: Begna Tulu, Gobena Ameni
Abstract:
Understanding the types of Mycobacterium bovis (M. bovis) strains circulating in a country and exploring its zoonotic potential has significant contribution in the effort to design control strategies. The main aim of this study was to review and compile the results of studies conducted on M. bovis genotyping and its zoonotic potential of M. bovis in Ethiopia. A systematic search and review of articles published on M. bovis strains in Ethiopia were made. PubMed and Google Scholar databases were considered for the search while the keywords used were 'Mycobacteria,' 'Mycobacterium bovis,' 'Bovine Tuberculosis' and 'Ethiopia.' Fourteen studies were considered in this review and a total of 31 distinct strains of M. bovis (N=211) were obtained; the most dominant strains were SB0133 (N=62, 29.4%), SB1176 (N=61, 28.9%), and followed by SB0134 and SB1476 each (N=18, 8.5%). The clustering rate of M. bovis strains was found to be 42.0%. On the other hand, 6 strains of M. bovis were reported from human namely; SB0665 (N=4), SB0303 (N=2), SB0982 (N=2), SB0133 (N=1), SB1176 (N=1), and 1 new strain. Similarly, a total of 8 strains (N=13) of M. tuberculosis bacteria were also identified from animal subjects; namely SIT149 (N=3), SIT1 (N=2), SIT1688 (n=2), SIT262 (N=2), SIT53 (N=1), SIT59 (N=1), and one new-Ethiopian strain. The result showed that the genetic diversity of M. bovis strains reported from Ethiopia are less diversified and highly clustered. And also the result underlines that there is an ongoing active transmission of M. bovis and M. tuberculosis between human and animals in Ethiopia because a significant number strains of both type of bacteria were reported from human and animals.Keywords: mycobacterium bovis, Mycobacterium tuberculosis, zoonotic potential, genetic diversity, Ethiopia
Procedia PDF Downloads 1323852 A Unique Multi-Class Support Vector Machine Algorithm Using MapReduce
Authors: Aditi Viswanathan, Shree Ranjani, Aruna Govada
Abstract:
With data sizes constantly expanding, and with classical machine learning algorithms that analyze such data requiring larger and larger amounts of computation time and storage space, the need to distribute computation and memory requirements among several computers has become apparent. Although substantial work has been done in developing distributed binary SVM algorithms and multi-class SVM algorithms individually, the field of multi-class distributed SVMs remains largely unexplored. This research seeks to develop an algorithm that implements the Support Vector Machine over a multi-class data set and is efficient in a distributed environment. For this, we recursively choose the best binary split of a set of classes using a greedy technique. Much like the divide and conquer approach. Our algorithm has shown better computation time during the testing phase than the traditional sequential SVM methods (One vs. One, One vs. Rest) and out-performs them as the size of the data set grows. This approach also classifies the data with higher accuracy than the traditional multi-class algorithms.Keywords: distributed algorithm, MapReduce, multi-class, support vector machine
Procedia PDF Downloads 3963851 Phylogenetic Relationships of the Malaysian Primates Cercopithecine Based on COI Gene Sequences
Authors: B. M. Md-Zain, N. A. Rahman, M. A. B. Abdul-Latiff, W. M. R. Idris
Abstract:
We conducted molecular research to portray phylogenetic relationships of Malaysian primates particularly in the genus of Macaca. We have sequenced cytochrome C oxidase subunit I (COI) of mitochondrial DNA of several individuals from M. fascicularis and M. arctoides. PCR amplifications were performed and COI DNA sequences were aligned using ClustalW. Phylogenetic trees were constructed using distance analyses by employing neighbor-joining algorithm (NJ). We managed to sequence 700 bp of COI DNA sequences. The tree topology showed that M. fascicularis did not clump based on phyleogeography division in Peninsular Malaysia. Individuals from Negeri Sembilan merged together with samples from Perak and Penang into one clade. In addition, phylogenetic analyses indicated that M. arctoides was classified into sinica group instead of fascicularis group supported by genetic distance data. COI gene is an effective locus to clarify phylogenetic position of M. arctoides but not in discriminating M. fascicularis population in Peninsular Malaysia.Keywords: cercopithecine, long-tailed macaque, Macaca fascicularis, Macaca arctoides
Procedia PDF Downloads 3533850 Association of Xeroderma pigmentosum Group D Gene Polymorphism with Colorectal Cancer Risk in Kashmiri Population
Authors: Syed Sameer Aga, Saniya Nissar
Abstract:
The Xeroderma pigmentosum group D gene (XPD) plays a key role in nucleotide excision repair (NER) pathway of the damaged DNA. Genetic polymorphisms in the coding region of the XPD gene may alter DNA repair capacity of the protein and hence can modulate the risk of colorectal cancer (CRC) risk. The aim of the study was to determine the genetic association of XPD Lys751Gln polymorphism with the risk of colorectal cancer (CRC) development. 120 CRC patients and 160 normal controls were assessed for genotype frequencies of XPD Lys751Gln polymorphism using PCR-RFLP technique. We observed a significant association (p < 0.05) between the XPD Lys751Gln polymorphism and the risk of developing CRC (p < 0.05). Additionally, Gln/Gln genotype of the XPD gene doubled the risk for the development of CRC [p < 0.05; OR=2.25 95% CI (1.07-4.7)]. Our results suggest that there is a significant association between the XPD Lys751Gln polymorphism and the risk of CRC.Keywords: colorectal cancer, polymorphism, RFLP, DNA Repair, NER, XPD
Procedia PDF Downloads 2103849 Multiobjective Optimization of Wastwater Treatment by Electrochemical Process
Authors: Malek Bendjaballah, Hacina Saidi, Sarra Hamidoud
Abstract:
The aim of this study is to model and optimize the performance of a new electrocoagulation (E.C) process for the treatment of wastewater as well as the energy consumption in order to extrapolate it to the industrial scale. Through judicious application of an experimental design (DOE), it has been possible to evaluate the individual effects and interactions that have a significant influence on both objective functions (maximizing efficiency and minimizing energy consumption) by using aluminum electrodes as sacrificial anode. Preliminary experiments have shown that the pH of the medium, the applied potential and the treatment time with E.C are the main parameters. A factorial design 33 has been adopted to model performance and energy consumption. Under optimal conditions, the pollution reduction efficiency is 93%, combined with a minimum energy consumption of 2.60.10-3 kWh / mg-COD. The potential or current applied and the processing time and their interaction were the most influential parameters in the mathematical models obtained. The results of the modeling were also correlated with the experimental ones. The results offer promising opportunities to develop a clean process and inexpensive technology to eliminate or reduce wastewater,Keywords: electrocoagulation, green process, experimental design, optimization
Procedia PDF Downloads 913848 Simulation of Utility Accrual Scheduling and Recovery Algorithm in Multiprocessor Environment
Authors: A. Idawaty, O. Mohamed, A. Z. Zuriati
Abstract:
This paper presents the development of an event based Discrete Event Simulation (DES) for a recovery algorithm known Backward Recovery Global Preemptive Utility Accrual Scheduling (BR_GPUAS). This algorithm implements the Backward Recovery (BR) mechanism as a fault recovery solution under the existing Time/Utility Function/ Utility Accrual (TUF/UA) scheduling domain for multiprocessor environment. The BR mechanism attempts to take the faulty tasks back to its initial safe state and then proceeds to re-execute the affected section of the faulty tasks to enable recovery. Considering that faults may occur in the components of any system; a fault tolerance system that can nullify the erroneous effect is necessary to be developed. Current TUF/UA scheduling algorithm uses the abortion recovery mechanism and it simply aborts the erroneous task as their fault recovery solution. None of the existing algorithm in TUF/UA scheduling domain in multiprocessor scheduling environment have considered the transient fault and implement the BR mechanism as a fault recovery mechanism to nullify the erroneous effect and solve the recovery problem in this domain. The developed BR_GPUAS simulator has derived the set of parameter, events and performance metrics according to a detailed analysis of the base model. Simulation results revealed that BR_GPUAS algorithm can saved almost 20-30% of the accumulated utilities making it reliable and efficient for the real-time application in the multiprocessor scheduling environment.Keywords: real-time system (RTS), time utility function/ utility accrual (TUF/UA) scheduling, backward recovery mechanism, multiprocessor, discrete event simulation (DES)
Procedia PDF Downloads 3003847 A Blind Three-Dimensional Meshes Watermarking Using the Interquartile Range
Authors: Emad E. Abdallah, Alaa E. Abdallah, Bajes Y. Alskarnah
Abstract:
We introduce a robust three-dimensional watermarking algorithm for copyright protection and indexing. The basic idea behind our technique is to measure the interquartile range or the spread of the 3D model vertices. The algorithm starts by converting all the vertices to spherical coordinate followed by partitioning them into small groups. The proposed algorithm is slightly altering the interquartile range distribution of the small groups based on predefined watermark. The experimental results on several 3D meshes prove perceptual invisibility and the robustness of the proposed technique against the most common attacks including compression, noise, smoothing, scaling, rotation as well as combinations of these attacks.Keywords: watermarking, three-dimensional models, perceptual invisibility, interquartile range, 3D attacks
Procedia PDF Downloads 4683846 Algorithm Research on Traffic Sign Detection Based on Improved EfficientDet
Authors: Ma Lei-Lei, Zhou You
Abstract:
Aiming at the problems of low detection accuracy of deep learning algorithm in traffic sign detection, this paper proposes improved EfficientDet based traffic sign detection algorithm. Multi-head self-attention is introduced in the minimum resolution layer of the backbone of EfficientDet to achieve effective aggregation of local and global depth information, and this study proposes an improved feature fusion pyramid with increased vertical cross-layer connections, which improves the performance of the model while introducing a small amount of complexity, the Balanced L1 Loss is introduced to replace the original regression loss function Smooth L1 Loss, which solves the problem of balance in the loss function. Experimental results show, the algorithm proposed in this study is suitable for the task of traffic sign detection. Compared with other models, the improved EfficientDet has the best detection accuracy. Although the test speed is not completely dominant, it still meets the real-time requirement.Keywords: convolutional neural network, transformer, feature pyramid networks, loss function
Procedia PDF Downloads 913845 Heritability and Diversity Analysis of Blast Resistant Upland Rice Genotypes Based on Quantitative Traits
Authors: Mst. Tuhina-Khatun, Mohamed Hanafi Musa, Mohd Rafii Yosup, Wong Mui Yun, Md. Aktar-Uz-Zaman, Mahbod Sahebi
Abstract:
Rice is a staple crop of economic importance of most Asian people, and blast is the major constraints for its higher yield. Heritability of plants traits helps plant breeders to make an appropriate selection and to assess the magnitude of genetic improvement through hybridization. Diversity of crop plants is necessary to manage the continuing genetic erosion and address the issues of genetic conservation for successfully meet the future food requirements. Therefore, an experiment was conducted to estimate heritability and to determine the diversity of 27 blast resistant upland rice genotypes based on 18 quantitative traits using randomized complete block design. Heritability value was found to vary from 38 to 93%. The lowest heritability belonged to the character total number of tillers/plant (38%). In contrast, number of filled grains/panicle, and yield/plant (g) was recorded for their highest heritability value viz. 93 and 91% correspondingly. Cluster analysis based on 18 traits grouped 27 rice genotypes into six clusters. Cluster I was the biggest, which comprised 17 genotypes, accounted for about 62.96% of total population. The multivariate analysis suggested that the genotype ‘Chokoto 14’ could be hybridized with ‘IR 5533-55-1-11’ and ‘IR 5533-PP 854-1’ for broadening the gene pool of blast resistant upland rice germplasms for yield and other favorable characters.Keywords: blast resistant, diversity analysis, heritability, upland rice
Procedia PDF Downloads 3663844 Upgraded Cuckoo Search Algorithm to Solve Optimisation Problems Using Gaussian Selection Operator and Neighbour Strategy Approach
Authors: Mukesh Kumar Shah, Tushar Gupta
Abstract:
An Upgraded Cuckoo Search Algorithm is proposed here to solve optimization problems based on the improvements made in the earlier versions of Cuckoo Search Algorithm. Short comings of the earlier versions like slow convergence, trap in local optima improved in the proposed version by random initialization of solution by suggesting an Improved Lambda Iteration Relaxation method, Random Gaussian Distribution Walk to improve local search and further proposing Greedy Selection to accelerate to optimized solution quickly and by “Study Nearby Strategy” to improve global search performance by avoiding trapping to local optima. It is further proposed to generate better solution by Crossover Operation. The proposed strategy used in algorithm shows superiority in terms of high convergence speed over several classical algorithms. Three standard algorithms were tested on a 6-generator standard test system and the results are presented which clearly demonstrate its superiority over other established algorithms. The algorithm is also capable of handling higher unit systems.Keywords: economic dispatch, gaussian selection operator, prohibited operating zones, ramp rate limits
Procedia PDF Downloads 1223843 A Smart Electric Power Wheelchair Controlled by Head Motion
Authors: Dechrit Maneetham
Abstract:
The aim of this paper was to design a smart electric power wheelchair (SEPW) with a novel control system for quadriplegics with head and neck mobility. Head movement has been used as a control interface for people with motor impairments in a range of applications. Acquiring measurements from the module is simplified through a synchronous a motor. Axis measures the two directions namely X ,Y and Z. The model of a DC motor is considered as a speed control by selection of a PID parameters using genetic algorithm. An experimental set-up constructed, which consists of micro controller Arduino ATmega32u4 as controllers, a DC motor driven SEPW and feedback elements. And this paper is tuning methods of parameter for a pulse width modulation (PWM) control system. A speed controller has been designed successfully for closed loop of the DC motor so that the motor runs very closed to the reference speed and angle. SEPW controller can be used to ensure the person’s head is attending the direction of travel asserted by a conventional, direction and speed control.Keywords: wheelchair, quadriplegia, rehabilitation, medical devices, speed control
Procedia PDF Downloads 4003842 A Hybrid Data-Handler Module Based Approach for Prioritization in Quality Function Deployment
Authors: P. Venu, Joeju M. Issac
Abstract:
Quality Function Deployment (QFD) is a systematic technique that creates a platform where the customer responses can be positively converted to design attributes. The accuracy of a QFD process heavily depends on the data that it is handling which is captured from customers or QFD team members. Customized computer programs that perform Quality Function Deployment within a stipulated time have been used by various companies across the globe. These programs heavily rely on storage and retrieval of the data on a common database. This database must act as a perfect source with minimum missing values or error values in order perform actual prioritization. This paper introduces a missing/error data handler module which uses Genetic Algorithm and Fuzzy numbers. The prioritization of customer requirements of sesame oil is illustrated and a comparison is made between proposed data handler module-based deployment and manual deployment.Keywords: hybrid data handler, QFD, prioritization, module-based deployment
Procedia PDF Downloads 2903841 Design of Permanent Sensor Fault Tolerance Algorithms by Sliding Mode Observer for Smart Hybrid Powerpack
Authors: Sungsik Jo, Hyeonwoo Kim, Iksu Choi, Hunmo Kim
Abstract:
In the SHP, LVDT sensor is for detecting the length changes of the EHA output, and the thrust of the EHA is controlled by the pressure sensor. Sensor is possible to cause hardware fault by internal problem or external disturbance. The EHA of SHP is able to be uncontrollable due to control by feedback from uncertain information, on this paper; the sliding mode observer algorithm estimates the original sensor output information in permanent sensor fault. The proposed algorithm shows performance to recovery fault of disconnection and short circuit basically, also the algorithm detect various of sensor fault mode.Keywords: smart hybrid powerpack (SHP), electro hydraulic actuator (EHA), permanent sensor fault tolerance, sliding mode observer (SMO), graphic user interface (GUI)
Procedia PDF Downloads 5433840 Study of Pathogenicity and Characterization of Fusarium oxysporum f.sp. albedinis by Isozymes Systemes
Authors: Abouamama Sidaoui, Noureddine Karkachi, Mebrouk Kihal
Abstract:
The characteristics of Fusarium oxysporium f.sp. albedinis (Foa) isolates were investigated using electrophoretic studies of isozymes systems (esterase and phosphatase). All the (F.o.a) isolates were pathogenic to the date palm seedlings cultivar Deglet Nour, but they did not induce any disease symptoms on control plants. Fusarium sp. isolated from soil did not show aggression against these seedlings. The isoenzymes profiles revealed polymorphic bands. The data were subjected to analysis with the JMP method. The isolates were delineated into two main groups A and B which were divided into sub-groups. 19 isolates create the group A, and four isolates (E1, E2, E3 and M15A) formed the group B. Analysis of isozyme banding patterns was found to be a reliable marker technology, efficient, and effective tools to find the genetic variability among isolates isolated in different geographical areas.Keywords: genetic diversity, Fusarium oxysporium f. sp. albedinis, isozyme analysis, pathogenicity
Procedia PDF Downloads 2123839 A Nonlocal Means Algorithm for Poisson Denoising Based on Information Geometry
Authors: Dongxu Chen, Yipeng Li
Abstract:
This paper presents an information geometry NonlocalMeans(NLM) algorithm for Poisson denoising. NLM estimates a noise-free pixel as a weighted average of image pixels, where each pixel is weighted according to the similarity between image patches in Euclidean space. In this work, every pixel is a Poisson distribution locally estimated by Maximum Likelihood (ML), all distributions consist of a statistical manifold. A NLM denoising algorithm is conducted on the statistical manifold where Fisher information matrix can be used for computing distribution geodesics referenced as the similarity between patches. This approach was demonstrated to be competitive with related state-of-the-art methods.Keywords: image denoising, Poisson noise, information geometry, nonlocal-means
Procedia PDF Downloads 2823838 A General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem
Authors: G. M. Komaki, S. Mobin, E. Teymourian, S. Sheikh
Abstract:
This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attention and due to NP-Hard nature of the problem, metaheuristic algorithms have been proposed to tackle it. Majority of the proposed algorithms require large computational time which is the main drawback. In this study, a general variable neighborhood search algorithm (GVNS) is proposed where several time-saving schemes have been incorporated into it. Also, the GVNS uses the sophisticated method to change the shaking procedure or perturbation depending on the progress of the incumbent solution to prevent stagnation of the search. The performance of the proposed algorithm is compared to the state-of-the-art algorithms based on standard benchmark instances.Keywords: distributed permutation flow shop, scheduling, makespan, general variable neighborhood search algorithm
Procedia PDF Downloads 349