Search results for: modified simplex algorithm

Authors: Alexey V. Klyuev, Valery P. Samarin, Viktor F. Klyuev, Andrey V. Klyuev

Abstract:

A power measurement algorithm of the input mix components of the noise signal and pulse interference is considered. The algorithm efficiency analysis has been carried out for different interference to signal ratio. Algorithm performance features have been explored by numerical experiment results.

Keywords: noise signal, pulse interference, signal power, spectrum width, detection

Procedia PDF Downloads 337

Authors: Doga Erisik, Ahmet Karaman, Gulfem Alptekin, Ozlem Durmaz Incel

Abstract:

Augmented reality (AR) is a type of virtual reality aiming to duplicate real world’s environment on a computer’s video feed. The mobile application, which is built for this project (called SARAS), enables annotating real world point of interests (POIs) that are located near mobile user. In this paper, we aim at introducing a robust and simple algorithm for placing labels in an augmented reality system. The system places labels of the POIs on the mobile device screen whose GPS coordinates are given. The proposed algorithm is compared to an existing one in terms of energy consumption and accuracy. The results show that the proposed algorithm gives better results in energy consumption and accuracy while standing still, and acceptably accurate results when driving. The technique provides benefits to AR browsers with its open access algorithm. Going forward, the algorithm will be improved to more rapidly react to position changes while driving.

Keywords: accurate tagging algorithm, augmented reality, localization, location-based AR

Procedia PDF Downloads 375

Authors: Vaibhav Singh Rajput, Ravi Kumar Jatoth, Nagu Bhookya, Bhasker Boda

Abstract:

In this paper proportional, integral, derivative (PID) controller is used to control the pitch angle of the aircraft when the elevation angle is changed or modified. The pitch angle is dependent on elevation angle; a change in one corresponds to a change in the other. The PID controller helps in restricted change of pitch rate in response to the elevation angle. The PID controller is dependent on different parameters like Kp, Ki, Kd which change the pitch rate as they change. Various methodologies are used for changing those parameters for getting a perfect time response pitch angle, as desired or wished by a concerned person. While reckoning the values of those parameters, trial and guessing may prove to be futile in order to provide comfort to passengers. So, using some metaheuristic techniques can be useful in handling these errors. Hybrid GA-PSO is one such powerful algorithm which can improve transient and steady state response and can give us more reliable results for PID gain scheduling problem.

Keywords: pitch rate, elevation angle, PID controller, genetic algorithm, particle swarm optimization, phugoid

Procedia PDF Downloads 329

Authors: Fatima Zohra Zeggai, Benjamin Carbonnier, Aïcha Hachemaoui, Ahmed Yahiaoui, Samia Mahouche-Chergui, Zakaria Salmi

Abstract:

A series of polyaniline (PANI)/modified Montmorillonite (MMT) Clay nanocomposite materials have been successfully prepared by In-Situ polymerization in the presence of modified MMT-Clay or Diazonium-MMT-Clay. The obtained nanocomposites were characterized and compared by various physicochemical techniques. The presence of physicochemical interaction, probably hydrogen bonding, between clay and polyaniline, which was confirmed by FTIR, UV-Vis Spectroscopy. The electrical conductivity of neat PANI and a series of the obtained nanocomposites were also studied by cyclic voltammograms.

Keywords: polyaniline, clay, nanocomposites, in-situ polymerization, polymers conductors, diazonium salt

Procedia PDF Downloads 474

Authors: Soha A. Bahanshal, Byung G. Kim

Abstract:

Identification of patients at high risk for hospital readmission is of crucial importance for quality health care and cost reduction. Predicting hospital readmissions among diabetic patients has been of great interest to many researchers and health decision makers. We build a prediction model to predict hospital readmission for diabetic patients within 30 days of discharge. The core of the prediction model is a modified k Nearest Neighbor called Hybrid Fuzzy Weighted k Nearest Neighbor algorithm. The prediction is performed on a patient dataset which consists of more than 70,000 patients with 50 attributes. We applied data preprocessing using different techniques in order to handle data imbalance and to fuzzify the data to suit the prediction algorithm. The model so far achieved classification accuracy of 80% compared to other models that only use k Nearest Neighbor.

Keywords: machine learning, prediction, classification, hybrid fuzzy weighted k-nearest neighbor, diabetic hospital readmission

Procedia PDF Downloads 186

Authors: Mohamed Mahmoud

Abstract:

This paper has developed an effect-cause analysis technique for fault diagnosis in digital circuits. The main algorithm of our technique is based on the Enhanced Deduction Algorithm, which processes the real response of the CUT to the applied test T to deduce the values of the internal lines. An experimental version of the algorithm has been implemented in C++. The code takes about 7592 lines. The internal values are determined based on the logic values under the permanent stuck-fault model. Using a backtracking strategy guarantees that the actual values are covered by at least one solution, or no solution is found.

Keywords: enhanced deduction algorithm, backtracking strategy, automatic test equipment, verfication

Procedia PDF Downloads 120

Authors: Yanhua Zhao, Chenli Rao, Dongdong Li, Chuanmin Tao

Abstract:

The Chinese Centers for Disease Control and Prevention (CCDC) issued a new laboratory-based algorithm for HIV diagnosis on April 2016, which initially screens with a combination HIV-1/HIV-2 antigen/antibody fourth-generation immunoassay (IA) followed, when reactive, an HIV-1/HIV-2 undifferentiated antibody IA in duplicate. Reactive specimens with concordant results undergo supplemental tests with western blots, or HIV-1 nucleic acid tests (NATs) and non-reactive specimens with discordant results receive HIV-1 NATs or p24 antigen tests or 2-4 weeks follow-up tests. However, little data evaluating the application of the new algorithm have been reported to date. The study was to evaluate the performance of new laboratory-based HIV diagnostic algorithm in an inpatient population of Southwest China over the initial 6 months by compared with the old algorithm. Plasma specimens collected from inpatients from May 1, 2016, to October 31, 2016, are submitted to the laboratory for screening HIV infection performed by both the new HIV testing algorithm and the old version. The sensitivity and specificity of the algorithms and the difference of the categorized numbers of plasmas were calculated. Under the new algorithm for HIV diagnosis, 170 of the total 52 749 plasma specimens were confirmed as positively HIV-infected (0.32%). The sensitivity and specificity of the new algorithm were 100% (170/170) and 100% (52 579/52 579), respectively; while 167 HIV-1 positive specimens were identified by the old algorithm with sensitivity 98.24% (167/170) and 100% (52 579/52 579), respectively. Three acute HIV-1 infections (AHIs) and two early HIV-1 infections (EHIs) were identified by the new algorithm; the former was missed by old procedure. Compared with the old version, the new algorithm produced fewer WB-indeterminate results (2 vs. 16, p = 0.001), which led to fewer follow-up tests. Therefore, the new HIV testing algorithm is more sensitive for detecting acute HIV-1 infections with maintaining the ability to verify the established HIV-1 infections and can dramatically decrease the greater number of WB-indeterminate specimens.

Keywords: algorithm, diagnosis, HIV, laboratory

Procedia PDF Downloads 401

Authors: Mohsen Adabi, Mahdi Adabi, Reza Saber

Abstract:

The recent advancements in nanomaterials have provided a platform to develop efficient transduction matrices for sensors. Modified electrodes allow to electrochemists to enhance the property of electrode surface and provide desired properties such as improved sensing capabilities, higher electron transfer rate and prevention of undesirable reactions competing kinetically with desired electrode process. Nanostructured electrodes including arrays of carbon nanotubes have demonstrated great potential for the development of electrochemical sensors and biosensors. The aim of this work is to evaluate the concentration of multi-walled carbon nanotubes (MWCNTs) on the conductivity of gold electrode. For this work, raw MWCNTs was functionalized and shortened. Raw and shorten MWCNTs were characterized using transfer electron microscopy (TEM). Next, 0.5, 2 and 3.5 mg of Shortened and functionalized MWCNTs were dispersed in 2 mL Dimethyl formamide (DMF) and cysteamine modified gold electrodes were incubated in the different concentrations of MWCNTs for 8 hours. Then, the immobilization of MWCNTs on cysteamine modified gold electrode was characterized by scanning electron microscopy (SEM) and the effect of MWCNT concentrations on electron transfer of modified electrodes was investigated by cyclic voltammetry (CV). The results demonstrated that CV response of ferricyanide redox at modified gold electrodes increased as concentration of MWCNTs enhanced from 0.5 to 2 mg in 2 mL DMF. This increase can be attributed to the number of MWCNTs which enhance on the surface of cysteamine modified gold electrode as the MWCNTs concentration increased whereas CV response of ferricyanide redox at modified gold electrodes did not changed significantly as the MWCNTs concentration increased from 2 to 3.5 mg in 2 mL DMF. The reason may be that amine groups of cysteamine modified gold electrodes are limited to a given number which can interact with the given number of carboxylic groups of MWCNTs and CV response of ferricyanide redox at modified gold do not enhance after amine groups of cysteamine are saturated with carboxylic groups of MWCNTs.

Keywords: carbon nanotube, cysteamine, electrochemical sensor, gold electrode

Procedia PDF Downloads 469

Authors: Doru Anastasiu Popescu, Dan Rădulescu

Abstract:

In this paper, we determine the similarity of two HTML web applications. We are going to use a genetic algorithm in order to determine the most significant web pages of each application (we are not going to use every web page of a site). Using these significant web pages, we will find the similarity value between the two applications. The algorithm is going to be efficient because we are going to use a reduced number of web pages for comparisons but it will return an approximate value of the similarity. The binary trees are used to keep the tags from the significant pages. The algorithm was implemented in Java language.

Keywords: Tag, HTML, web page, genetic algorithm, similarity value, binary tree

Procedia PDF Downloads 355

Authors: Engy Adel Mohamed, Yasser Gamal-Eldin Hegazy

Abstract:

This paper presents a firefly based algorithm for optimal sizing and allocation of distributed generators for profit maximization. Distributed generators in the proposed algorithm are of photovoltaic and combined heat and power technologies. Combined heat and power distributed generators are modeled as voltage controlled nodes while photovoltaic distributed generators are modeled as constant power nodes. The proposed algorithm is implemented in MATLAB environment and tested the unbalanced IEEE 37-node feeder. The results show the effectiveness of the proposed algorithm in optimal selection of distributed generators size and site in order to maximize the total system profit.

Keywords: distributed generators, firefly algorithm, IEEE 37-node feeder, profit maximization

Procedia PDF Downloads 443

Authors: Selcuk Aslan, Dervis Karaboga, Celal Ozturk

Abstract:

Artificial Bee Colony (ABC) algorithm is one of the most successful swarm intelligence based metaheuristics. It has been applied to a number of constrained or unconstrained numerical and combinatorial optimization problems. In this paper, we presented a parallelized version of ABC algorithm by adapting employed and onlooker bee phases to the Compute Unified Device Architecture (CUDA) platform which is a graphical processing unit (GPU) programming environment by NVIDIA. The execution speed and obtained results of the proposed approach and sequential version of ABC algorithm are compared on functions that are typically used as benchmarks for optimization algorithms. Tests on standard benchmark functions with different colony size and number of parameters showed that proposed parallelization approach for ABC algorithm decreases the execution time consumed by the employed and onlooker bee phases in total and achieved similar or better quality of the results compared to the standard sequential implementation of the ABC algorithm.

Keywords: Artificial Bee Colony algorithm, GPU computing, swarm intelligence, parallelization

Procedia PDF Downloads 379

Authors: Qiang Zhang, Chun Yuan

Abstract:

Since the PU (Prediction Unit) decision process is the most time consuming part of the emerging HEVC (High Efficient Video Coding) standardin intra and inter frame coding, this paper proposes the fast PU decision algorithm and speed up the algorithm using CUDA (Compute Unified Device Architecture). In intra frame coding, the fast PU decision algorithm uses the texture features to skip intra-frame prediction or terminal the intra-frame prediction for smaller PU size. In inter frame coding of HEVC, the fast PU decision algorithm takes use of the similarity of its own two Nx2N size PU's motion vectors and the hierarchical structure of CU (Coding Unit) partition to skip some modes of PU partition, so as to reduce the motion estimation times. The accelerate algorithm using CUDA is based on the fast PU decision algorithm which uses the GPU to make the motion search and the gradient computation could be parallel computed. The proposed algorithm achieves up to 57% time saving compared to the HM 10.0 with little rate-distortion losses (0.043dB drop and 1.82% bitrate increase on average).

Keywords: HEVC, PU decision, inter prediction, intra prediction, CUDA, parallel

Procedia PDF Downloads 399

Authors: Mengjun Yang, Zhulin Zong, Jie Gao

Abstract:

In this paper, a new and robust algorithm is proposed to achieve high resolution for inverse synthetic aperture radar (ISAR) imaging in the compressive sensing (CS) framework. Traditional CS based methods have to assume that unknown scatters exactly lie on the pre-divided grids; otherwise, their reconstruction performance dropped significantly. In this processing algorithm, several basis shifts are utilized to achieve the same effect as grid refinement does. The detailed implementation of the basis shift algorithm is presented in this paper. From the simulation we can see that using the basis shift algorithm, imaging precision can be improved. The effectiveness and feasibility of the proposed method are investigated by the simulation results.

Keywords: ISAR imaging, sparse reconstruction, off-grid, basis shift

Procedia PDF Downloads 266

Authors: Mahmoud M. Othman, Y. G. Hegazy, A. Y. Abdelaziz

Abstract:

This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm.

Keywords: distributed generation, heuristic approach, optimization, planning

Procedia PDF Downloads 526

Authors: Javad Rahimipour Anaraki, Saeed Samet, Mahdi Eftekhari, Chang Wook Ahn

Abstract:

Feature selection and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality. This paper presents a feature selection method that efficiently carries out attribute reduction, thereby selecting the most informative features of a dataset. It consists of two components: 1) a measure for feature subset evaluation, and 2) a search strategy. For the evaluation measure, we have employed the fuzzy-rough dependency degree (FRFDD) of the lower approximation-based fuzzy-rough feature selection (L-FRFS) due to its effectiveness in feature selection. As for the search strategy, a modified version of a binary shuffled frog leaping algorithm is proposed (B-SFLA). The proposed feature selection method is obtained by hybridizing the B-SFLA with the FRDD. Nine classifiers have been employed to compare the proposed approach with several existing methods over twenty two datasets, including nine high dimensional and large ones, from the UCI repository. The experimental results demonstrate that the B-SFLA approach significantly outperforms other metaheuristic methods in terms of the number of selected features and the classification accuracy.

Keywords: binary shuffled frog leaping algorithm, feature selection, fuzzy-rough set, minimal reduct

Procedia PDF Downloads 227

Authors: Sheng-Long Lee, Tse-An Pan

Abstract:

In this study, an optical microscope (OM), electron microscope (SEM), electrical conductivity meter (% IACS), hardness test, and wear test were subjected to analyze the microstructure of the wrought Al-11Si-3Cu-0.5Mg alloys. The effect of eutectic silicon morphology and alloy hardness on wear properties was investigated. The results showed that in the cast state, the morphology of eutectic silicon modified by strontium and antimony is lamellar and finer fibrous structure. After homogenization, the eutectic Si modified by Sr coarsened, and the eutectic Si modified by Sb refined due to fragmentation. The addition of modifiers, hot rolling, and solution aging treatment can control eutectic silicon morphology and hardness. The finer eutectic silicon and higher hardness have better wear resistance. During the wearing process, a protective oxide layer, also known as Mechanical Mixed Layer (MML), is formed on the surface of the alloy. The MML has higher stability and cracking resistance in Sr-modified alloys than in Sb-modified alloys. The study found that the wearing behavior of Al-11Si-3Cu-0.5Mg alloy was enhanced by the combination of adding Sr with lower solution time and T6 peak aging.

Keywords: Al-Si-Cu-Mg alloy, eutectic silicon, heat treatment, wear property

Procedia PDF Downloads 79

Authors: R. Vishnu, K. S. Reddy, Amrendra Kumar

Abstract:

The present guideline for the construction of flexible pavement in India, IRC 37: 2012 recommends to use viscous grade VG 40 bitumen in both wearing and binder bituminous layers. However, most of the bitumen production plants in India are unable to produce the air-blown VG40 grade bitumen. This requires plant’s air-blowing technique modification, and often the manufactures finds it as uneconomical. In this context, stiffer grade bitumen can be produced if bitumen is modified. Gilsonite, which is naturally occurring asphalt have been found to be used for increasing the stiffness of binders. The present study evaluates the physical, rheological characteristics of Gilsonite modified binders and the performance characteristics of these binders when used in the mix.

Keywords: bitumen, gilsonite, stiffness, laboratory evaluation

Procedia PDF Downloads 465

Authors: Patrícia Branco, Catarina Prista, Helena Albergaria

Abstract:

Industrial fuel-ethanol fermentations are carried out under non-sterile conditions, which favors the development of microbial contaminants, leading to huge economic losses. Wild yeasts such as Brettanomyces bruxellensis and lactic acid bacteria are the main contaminants of industrial bioethanol fermentation, affecting Saccharomyces cerevisiae performance and decreasing ethanol yields and productivity. In order to control microbial contaminations, the fuel-ethanol industry uses different treatments, including acid washing and antibiotics. However, these control measures carry environmental risks such as acid toxicity and the rise of antibiotic-resistant bacteria. Therefore, it is crucial to develop and apply less toxic and more environmentally friendly biocontrol methods. In the present study, an industrial fuel-ethanol starter, S. cerevisiae Ethanol-Red, was genetically modified to over-express AMPs with activity against fuel-ethanol microbial contaminants and evaluated regarding its biocontrol effect during mixed-culture alcoholic fermentations artificially contaminated with B. bruxellensis. To achieve this goal, S. cerevisiae Ethanol-Red strain was transformed with a plasmid containing the AMPs-codifying genes, i.e., partial sequences of TDH1 (925-963 bp) and TDH2/3 (925-963 bp) and a geneticin resistance marker. The biocontrol effect of those genetically modified strains was evaluated against B. bruxellensis and compared with the antagonistic effect exerted by the modified strain with an empty plasmid (without the AMPs-codifying genes) and the non-modified strain S. cerevisiae Ethanol-Red. For that purpose, mixed-culture alcoholic fermentations were performed in a synthetic must use the modified S. cerevisiae Ethanol-Red strains together with B. bruxellensis. Single-culture fermentations of B. bruxellensis strains were also performed as a negative control of the antagonistic effect exerted by S. cerevisiae strains. Results clearly showed an improved biocontrol effect of the genetically-modified strains against B. bruxellensis when compared with the modified Ethanol-Red strain with the empty plasmid (without the AMPs-codifying genes) and with the non-modified Ethanol-Red strain. In mixed-culture fermentation with the modified S. cerevisiae strain, B. bruxellensis culturability decreased from 5×104 CFU/mL on day-0 to less than 1 CFU/mL on day-10, while in single-culture B. bruxellensis increased its culturability from 6×104 to 1×106 CFU/mL in the first 6 days and kept this value until day-10. Besides, the modified Ethanol-Red strain exhibited an enhanced antagonistic effect against B. bruxellensis when compared with that induced by the non-modified Ethanol-Red strain. Indeed, culturability loss of B. bruxellensis after 10 days of fermentation with the modified Ethanol-Red strain was 98.7 and 100% higher than that occurred in fermentations performed with the non-modified Ethanol-Red and the empty-plasmid modified strain, respectively. Therefore, one can conclude that the S. cerevisiae genetically modified strain obtained in the present work may be a valuable solution for the mitigation of microbial contamination in fuel-ethanol fermentations, representing a much safer and environmentally friendly preservation strategy than the antimicrobial treatments (acid washing and antibiotics) currently applied in fuel-ethanol industry.

Keywords: antimicrobial peptides, fuel-ethanol microbial contaminations, fuel-ethanol fermentation, biocontrol agents, genetically-modified yeasts

Procedia PDF Downloads 99

Authors: Ahmed Esmael, Ali El Shrif

Abstract:

In this study the instability problem of a modified Taylor-Couette flow between two vertical coaxial cylinders of radius R1, R2 is considered. The modification is based on the wavy shape of the inner cylinder surface, where inner cylinders with different surface amplitude and wavelength are used. The study aims to discover the effect of the inner surface geometry on the instability phenomenon that undergoes Taylor-Couette flow. The study reveals that the transition processes depends strongly on the amplitude and wavelength of the inner cylinder surface and resulting in flow instabilities that are strongly different from that encountered in the case of the classical Taylor-Couette flow.

Keywords: hydrodynamic instability, Modified Taylor-Couette Flow, turbulence, Taylor vortices

Procedia PDF Downloads 433

Authors: Meng-Hui Chen, Chiao-Wei Yu, Pei-Chann Chang

Abstract:

Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods.

Keywords: traveling salesman problem, artificial chromosomes, greedy search, imperial competitive algorithm

Procedia PDF Downloads 459

Authors: Abbas Mirakhorli

Abstract:

A hub covering problem is a type of hub location problem that tries to maximize the coverage area with the least amount of installed hubs. There have not been many studies in the literature about multi-objective hubs covering location problems. Thus, in this paper, a bi-objective model for the hub covering problem is presented. The two objectives that are considered in this paper are the minimization of total transportation costs and the maximization of coverage of origin-destination nodes. A genetic algorithm is presented to solve the model when the number of nodes is increased. The genetic algorithm is capable of solving the model when the number of nodes increases by more than 20. Moreover, the genetic algorithm solves the model in less amount of time.

Keywords: facility location, hub covering, multi-objective optimization, genetic algorithm

Procedia PDF Downloads 60

Authors: Masoumeh Ali Pouri, Hamid Haj Seyyed Javadi

Abstract:

Nowadays, cloud processing is one of the important issues in information technology. Since scheduling of tasks graph is an NP-hard problem, considering approaches based on undeterminisitic methods such as evolutionary processing, mostly genetic and cuckoo algorithms, will be effective. Therefore, an efficient algorithm has been proposed for scheduling of tasks graph to obtain an appropriate scheduling with minimum time. In this algorithm, the new approach is based on making the length of the critical path shorter and reducing the cost of communication. Finally, the results obtained from the implementation of the presented method show that this algorithm acts the same as other algorithms when it faces graphs without communication cost. It performs quicker and better than some algorithms like DSC and MCP algorithms when it faces the graphs involving communication cost.

Keywords: cloud computing, scheduling, tasks graph, chakoos algorithm

Procedia PDF Downloads 67

Authors: Hudson Akewe

Abstract:

In this study, we introduce a modified Jungck (Dual Jungck) iterative scheme and use the scheme to approximate the unique common fixed point of a pair of generalized contractive-like operators in a Banach space. The iterative scheme is also shown to be stable with respect to the maps (S,T). An example is taken to justify the convergence of the scheme. Our result is a generalization and improvement of several results in the literature on single map T.

Keywords: generalized contractive-like operators, modified Jungck iterative scheme, stability results, weakly compatible maps, unique common fixed point

Procedia PDF Downloads 349

Authors: Lei Lei, Hongbo Zhang, Donald J. Bergstrom, Bing Zhang, K. Y. Song, W. J. Zhang

Abstract:

This paper presents a model for a modified T-junction device for microspheres generation. The numerical model is developed using a commercial software package: COMSOL Multiphysics. In order to test the accuracy of the numerical model, multiple variables, such as the flow rate of cross-flow, fluid properties, structure, and geometry of the microdevice are applied. The results from the model are compared with the experimental results in the diameter of the microsphere generated. The comparison shows a good agreement. Therefore the model is useful in further optimization of the device and feedback control of microsphere generation if any.

Keywords: CFD modeling, validation, microsphere generation, modified T-junction

Procedia PDF Downloads 707

Authors: Hamidreza Saberkari, Mousa Shamsi, Hossein Ahmadi, Saeed Vaali, , MohammadHossein Sedaaghi

Abstract:

In the recent years, using signal processing tools for accurate identification of the protein coding regions has become a challenge in bioinformatics. Most of the genomic signal processing methods is based on the period-3 characteristics of the nucleoids in DNA strands and consequently, spectral analysis is applied to the numerical sequences of DNA to find the location of periodical components. In this paper, a novel ensemble algorithm for gene selection in DNA sequences has been presented which is based on the combination of Goertzel algorithm and anti-notch filter (ANF). The proposed algorithm has many advantages when compared to other conventional methods. Firstly, it leads to identify the coding protein regions more accurate due to using the Goertzel algorithm which is tuned at the desired frequency. Secondly, faster detection time is achieved. The proposed algorithm is applied on several genes, including genes available in databases BG570 and HMR195 and their results are compared to other methods based on the nucleotide level evaluation criteria. Implementation results show the excellent performance of the proposed algorithm in identifying protein coding regions, specifically in identification of small-scale gene areas.

Keywords: protein coding regions, period-3, anti-notch filter, Goertzel algorithm

Procedia PDF Downloads 388

Authors: Kayode A. Olaniyi, Olabanji F. Omotoye, Adeola A. Ogunleye

Abstract:

The skew detection and correction form an important part of digital document analysis. This is because uncompensated skew can deteriorate document features and can complicate further document image processing steps. Efficient text document analysis and digitization can rarely be achieved when a document is skewed even at a small angle. Once the documents have been digitized through the scanning system and binarization also achieved, document skew correction is required before further image analysis. Research efforts have been put in this area with algorithms developed to eliminate document skew. Skew angle correction algorithms can be compared based on performance criteria. Most important performance criteria are accuracy of skew angle detection, range of skew angle for detection, speed of processing the image, computational complexity and consequently memory space used. The standard Hough Transform has successfully been implemented for text documentation skew angle estimation application. However, the standard Hough Transform algorithm level of accuracy depends largely on how much fine the step size for the angle used. This consequently consumes more time and memory space for increase accuracy and, especially where number of pixels is considerable large. Whenever the Hough transform is used, there is always a tradeoff between accuracy and speed. So a more efficient solution is needed that optimizes space as well as time. In this paper, an improved Hough transform (HT) technique that optimizes space as well as time to robustly detect document skew is presented. The modified algorithm of Hough Transform presents solution to the contradiction between the memory space, running time and accuracy. Our algorithm starts with the first step of angle estimation accurate up to zero decimal place using the standard Hough Transform algorithm achieving minimal running time and space but lacks relative accuracy. Then to increase accuracy, suppose estimated angle found using the basic Hough algorithm is x degree, we then run again basic algorithm from range between ±x degrees with accuracy of one decimal place. Same process is iterated till level of desired accuracy is achieved. The procedure of our skew estimation and correction algorithm of text images is implemented using MATLAB. The memory space estimation and process time are also tabulated with skew angle assumption of within 00 and 450. The simulation results which is demonstrated in Matlab show the high performance of our algorithms with less computational time and memory space used in detecting document skew for a variety of documents with different levels of complexity.

Keywords: hough-transform, skew-detection, skew-angle, skew-correction, text-document

Procedia PDF Downloads 159

Authors: Jingpeng Gao, Xinrui Mao, Zhibin Deng

Abstract:

Aiming at the low recognition rate on the composite signal modulation in low signal to noise ratio (SNR), this paper proposes a modulation recognition algorithm based on ICanny-CNN. Firstly, the radar signal is transformed into the time-frequency image by Choi-Williams Distribution (CWD). Secondly, we propose an image processing algorithm using the Guided Filter and the threshold selection method, which is combined with the hole filling and the mask operation. Finally, the shallow convolutional neural network (CNN) is combined with the idea of the depth-wise convolution (Dw Conv) and the point-wise convolution (Pw Conv). The proposed CNN is designed to complete image classification and realize modulation recognition of radar signal. The simulation results show that the proposed algorithm can reach 90.83% at 0dB and 71.52% at -8dB. Therefore, the proposed algorithm has a good classification and anti-noise performance in radar signal modulation recognition and other fields.

Keywords: modulation recognition, image processing, composite signal, improved Canny algorithm

Procedia PDF Downloads 191

Authors: Hassen Hamouda, Mohamed Ouwais Kabaou, Med Salim Bouhlel

Abstract:

The growth of wireless technology made opportunistic scheduling a widespread theme in recent research. Providing high system throughput without reducing fairness allocation is becoming a very challenging task. A suitable policy for resource allocation among users is of crucial importance. This study focuses on scheduling multiple streaming flows on the downlink of a WiMAX system based on orthogonal frequency division multiple access (OFDMA). In this paper, we take the first step in formulating and analyzing this problem scrupulously. As a result, we proposed a new scheduling scheme based on Round Robin (RR) Algorithm. Because of its non-opportunistic process, RR does not take in account radio conditions and consequently it affect both system throughput and multi-users diversity. Our contribution called MORRA (Modified Round Robin Opportunistic Algorithm) consists to propose a solution to this issue. MORRA not only exploits the concept of opportunistic scheduler but also takes into account other parameters in the allocation process. The first parameter is called courtesy coefficient (CC) and the second is called Buffer Occupancy (BO). Performance evaluation shows that this well-balanced scheme outperforms both RR and MaxSNR schedulers and demonstrate that choosing between system throughput and fairness is not required.

Keywords: OFDMA, opportunistic scheduling, fairness hierarchy, courtesy coefficient, buffer occupancy

Procedia PDF Downloads 301

Authors: Ali M. Babalghaith, Hamad A. Alsoliman, Abdulrahman S. Al-Suhaibani

Abstract:

Flexible pavement made with neat asphalt binder is not enough to resist heavy traffic loads as well as harsh environmental condition found in Riyadh region. Therefore, there is a need to modify asphalt binder with polymers to satisfy such conditions. There are several types of polymers that are used to modify asphalt binder. The objective of this paper is to compare the rheological properties of six polymer modified asphalt binders (Lucolast7010, Anglomak2144, Paveflex140, SBS KTR401, EE-2 and Crumb rubber) obtained from asphalt manufacturer plants. The rheological properties of polymer modified asphalt binders were tested using conventional tests such as penetration, softening point and viscosity; and SHRP tests such as dynamic shear rheometer and bending beam rheometer. The results have indicated that the polymer modified asphalt binders have lower penetration and higher softening point than neat asphalt indicating an improvement in stiffness of asphalt binder, and as a result, more resistant to rutting. Moreover, the dynamic shear rheometer results have shown that all modifiers used in this study improved the binder properties and satisfied the Superpave specifications except SBS KTR401 which failed to satisfy the rutting parameter (G*/sinδ).

Keywords: polymer modified asphalt, rheological properties, SBS, crumb rubber, EE-2

Procedia PDF Downloads 290

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