Search results for: real-coded genetic algorithm
3415 Overview of Adaptive Spline interpolation
Authors: Rongli Gai, Zhiyuan Chang
Abstract:
At this stage, in view of various situations in the interpolation process, most researchers use self-adaptation to adjust the interpolation process, which is also one of the current and future research hotspots in the field of CNC machining. In the interpolation process, according to the overview of the spline curve interpolation algorithm, the adaptive analysis is carried out from the factors affecting the interpolation process. The adaptive operation is reflected in various aspects, such as speed, parameters, errors, nodes, feed rates, random Period, sensitive point, step size, curvature, adaptive segmentation, adaptive optimization, etc. This paper will analyze and summarize the research of adaptive imputation in the direction of the above factors affecting imputation.Keywords: adaptive algorithm, CNC machining, interpolation constraints, spline curve interpolation
Procedia PDF Downloads 2093414 Molecular Characterization of Chicken B Cell Marker (ChB6) in Native Chicken of Poonch Region from International Borders of India and Pakistan
Authors: Mandeep Singh Azad.Dibyendu Chakraborty, Vikas Vohra
Abstract:
Introduction: Poonch is one of the remotest districts of the Jammu and Kashmir (UT) and situated on international borders. This native poultry population in these areas is quite hardy and thrives well in adverse climatic conditions. Till date, no local breed from this area (Jammu Province) has been characterized thus present study was undertaken with the main objectives of molecular characterization of ChB6 gene in local native chicken of Poonch region located at international borders between India and Pakistan. The chicken B-cell marker (ChB6) gene has been proposed as a candidate gene in regulating B-cell development. Material and Method: RNA was isolated by Blood RNA Purification Kit (HiPura) and Trizol method from whole blood samples. Positive PCR products with size 1110 bp were selected for further purification, sequencing and analysis. The amplified PCR product was sequenced by Sangers dideoxy chain termination method. The obtained sequence of ChB6 gene of Poonchi chicken were compared by MEGAX software. BioEdit software was used to construct phylogenic tree, and Neighbor Joining method was used to infer evolutionary history. In order to compute evolutionary distance Maximum Composite Likelihood method was used. Results: The positively amplified samples of ChB6 genes were then subjected to Sanger sequencing with “Primer Walking. The sequences were then analyzed using MEGA X and BioEdit software. The sequence results were compared with other reported sequence from different breed of chicken and with other species obtained from the NCBI (National Center for Biotechnology Information). ClustalW method using MEGA X software was used for multiple sequence alignment. The sequence results of ChB6 gene of Poonchi chicken was compared with Centrocercus urophasianus, G. gallus mRNA for B6.1 protein, G. gallus mRNA for B6.2, G. gallus mRNA for B6.3, Gallus gallus B6.1, Halichoeres bivittatus, Miniopterus fuliginosus Ferringtonia patagonica, Tympanuchus phasianellus. The genetic distances were 0.2720, 0.0000, 0.0245, 0.0212, 0.0147, 1.6461, 2.2394, 2.0070 and 0.2363 for ChB6 gene of Poonchi chicken sequence with other sequences in the present study respectively. Sequencing results showed variations between different species. It was observed that AT content were higher then GC content for ChB6 gene. The lower AT content suggests less thermostable. It was observed that there was no sequence difference within the Poonchi population for ChB6 gene. The high homology within chicken population indicates the conservation of ChB6 gene. The maximum difference was observed with Miniopterus fuliginosus (Eastern bent-wing bat) followed by Ferringtonia patagonica and Halichoeres bivittatus. Conclusion: Genetic variation is the essential component for genetic improvement. The results of immune related gene Chb6 shows between population genetic variability. Therefore, further association studies of this gene with some prevalent diseases in large population would be helpful to identify disease resistant/ susceptible genotypes in the indigenous chicken population.Keywords: ChB6, sequencing, ClustalW, genetic distance, poonchi chicken, SNP
Procedia PDF Downloads 733413 Breast Cancer and BRCA Gene: A Study on Genetic and Environmental Interaction
Authors: Abhishikta Ghosh Roy
Abstract:
Breast cancer is the most common malignancy among women globally, including India. Human breast cancer results from the genetic and environmental interaction. The present study attempts to understand the molecular heterogeneity of BRCA1 and BRCA2 genes, as well as to understand the association of various lifestyle and reproductive variables for the Breast Cancer risk. The study was conducted amongst 110 patients and 128 controls with total DNA sequencing of flanking and coding regions of BRCA1 BRCA2 genes that revealed ten Single Nucleotide Polymorphisms (SNPs) (6 novels). The controls selected for the study were age, sex and ethnic group matched. After written and informed consent biological samples were collected from the subjects. After detailed molecular analysis, significant (p < 0.005) molecular heterogeneity is revealed in terms of SNPs in BRCA1 (4 Exonic & 1 Intronic) and BRCA2 (2exonic and 3 Intronic) genes. The augmentation study investigated significant (p < 0.05) association with positive family history, early age at menarche, irregular menstrual periods, menopause, prolong contraceptive use, nulliparity, history of abortions, consumption of alcohol and smoking for breast cancer risk. To the best of authors knowledge, this study is the first of its kind, envisaged that the identification of the SNPs and modification of the lifestyle factors might aid to minimize the risk among the Bengalee Hindu females.Keywords: breast cancer, BRCA, lifestyle, India
Procedia PDF Downloads 1153412 Design of a Chaotic Trajectory Generator Algorithm for Mobile Robots
Authors: J. J. Cetina-Denis, R. M. López-Gutiérrez, R. Ramírez-Ramírez, C. Cruz-Hernández
Abstract:
This work addresses the problem of designing an algorithm capable of generating chaotic trajectories for mobile robots. Particularly, the chaotic behavior is induced in the linear and angular velocities of a Khepera III differential mobile robot by infusing them with the states of the H´enon chaotic map. A possible application, using the properties of chaotic systems, is patrolling a work area. In this work, numerical and experimental results are reported and analyzed. In addition, two quantitative numerical tests are applied in order to measure how chaotic the generated trajectories really are.Keywords: chaos, chaotic trajectories, differential mobile robot, Henon map, Khepera III robot, patrolling applications
Procedia PDF Downloads 3113411 Top-K Shortest Distance as a Similarity Measure
Authors: Andrey Lebedev, Ilya Dmitrenok, JooYoung Lee, Leonard Johard
Abstract:
Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network. However, in many real world networks, whose diameters are small, top-k shortest path is more interesting as it contains more information about the network topology. Many variations to compute top-k shortest paths have been studied. In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Then, we also propose a top-k distance based graph matching algorithm.Keywords: graph matching, link prediction, shortest path, similarity
Procedia PDF Downloads 3613410 Computer Countenanced Diagnosis of Skin Nodule Detection and Histogram Augmentation: Extracting System for Skin Cancer
Authors: S. Zith Dey Babu, S. Kour, S. Verma, C. Verma, V. Pathania, A. Agrawal, V. Chaudhary, A. Manoj Puthur, R. Goyal, A. Pal, T. Danti Dey, A. Kumar, K. Wadhwa, O. Ved
Abstract:
Background: Skin cancer is now is the buzzing button in the field of medical science. The cyst's pandemic is drastically calibrating the body and well-being of the global village. Methods: The extracted image of the skin tumor cannot be used in one way for diagnosis. The stored image contains anarchies like the center. This approach will locate the forepart of an extracted appearance of skin. Partitioning image models has been presented to sort out the disturbance in the picture. Results: After completing partitioning, feature extraction has been formed by using genetic algorithm and finally, classification can be performed between the trained and test data to evaluate a large scale of an image that helps the doctors for the right prediction. To bring the improvisation of the existing system, we have set our objectives with an analysis. The efficiency of the natural selection process and the enriching histogram is essential in that respect. To reduce the false-positive rate or output, GA is performed with its accuracy. Conclusions: The objective of this task is to bring improvisation of effectiveness. GA is accomplishing its task with perfection to bring down the invalid-positive rate or outcome. The paper's mergeable portion conflicts with the composition of deep learning and medical image processing, which provides superior accuracy. Proportional types of handling create the reusability without any errors.Keywords: computer-aided system, detection, image segmentation, morphology
Procedia PDF Downloads 1533409 Instance Selection for MI-Support Vector Machines
Authors: Amy M. Kwon
Abstract:
Support vector machine (SVM) is a well-known algorithm in machine learning due to its superior performance, and it also functions well in multiple-instance (MI) problems. Our study proposes a schematic algorithm to select instances based on Hausdorff distance, which can be adapted to SVMs as input vectors under the MI setting. Based on experiments on five benchmark datasets, our strategy for adapting representation outperformed in comparison with original approach. In addition, task execution times (TETs) were reduced by more than 80% based on MissSVM. Hence, it is noteworthy to consider this representation adaptation to SVMs under MI-setting.Keywords: support vector machine, Margin, Hausdorff distance, representation selection, multiple-instance learning, machine learning
Procedia PDF Downloads 373408 Clustering Categorical Data Using the K-Means Algorithm and the Attribute’s Relative Frequency
Authors: Semeh Ben Salem, Sami Naouali, Moetez Sallami
Abstract:
Clustering is a well known data mining technique used in pattern recognition and information retrieval. The initial dataset to be clustered can either contain categorical or numeric data. Each type of data has its own specific clustering algorithm. In this context, two algorithms are proposed: the k-means for clustering numeric datasets and the k-modes for categorical datasets. The main encountered problem in data mining applications is clustering categorical dataset so relevant in the datasets. One main issue to achieve the clustering process on categorical values is to transform the categorical attributes into numeric measures and directly apply the k-means algorithm instead the k-modes. In this paper, it is proposed to experiment an approach based on the previous issue by transforming the categorical values into numeric ones using the relative frequency of each modality in the attributes. The proposed approach is compared with a previously method based on transforming the categorical datasets into binary values. The scalability and accuracy of the two methods are experimented. The obtained results show that our proposed method outperforms the binary method in all cases.Keywords: clustering, unsupervised learning, pattern recognition, categorical datasets, knowledge discovery, k-means
Procedia PDF Downloads 2643407 Genetic Divergence and Morphogenic Analysis of Sugarcane Red Rot Pathogen Colletotrichum falcatum under South Gujarat Condition
Authors: Prittesh Patel, Ramar Krishnamurthy
Abstract:
In the present study, nine strains of C. falcatum obtained from different places and cultivars were characterized for sporulation, growth rate, and 18S rRNA gene sequence. All isolates had characteristic fast-growing sparse and fleecy aerial mycelia on potato dextrose agar with sickle shape conidia (length x width: varied from 20.0 X 3.89 to 25.52 X 5.34 μm) and blackish to orange acervuli with setae (length x width: varied from 112.37X 2.78 to 167.66 X 6.73 μm). They could be divided into two groups on the base of morphology; P1, dense mycelia with concentric growth and P2, sparse mycelia with uneven growth. Genomic DNA isolation followed by PCR amplification with ITS1 and ITS4 primer produced ~550bp amplicons for all isolates. Phylogeny generated by 18S rRNA gene sequence confirmed the variation in isolates and mainly grouped into two clusters; cluster 1 contained CoC671 isolates (cfNAV and cfPAR) and Co86002 isolate (cfTIM). Other isolates cfMAD, cfKAM, and cfMAR were grouped into cluster 2. Remaining isolates did not fall into any cluster. Isolate cfGAN, collected from Co86032 was found highly diverse of all the nine isolates. In a nutshell, we found considerable genetic divergence and morphological variation within C. falcatum accessions collected from different areas of south Gujarat, India and these can be used for the breeding program.Keywords: Colletotrichum falcatum, ITS, morphology, red rot, sugarcane
Procedia PDF Downloads 1303406 Hull Detection from Handwritten Digit Image
Authors: Sriraman Kothuri, Komal Teja Mattupalli
Abstract:
In this paper we proposed a novel algorithm for recognizing hulls in a hand written digits. This is an extension to the work on “Digit Recognition Using Freeman Chain code”. In order to find out the hulls in a user given digit it is necessary to follow three steps. Those are pre-processing, Boundary Extraction and at last apply the Hull Detection system in a way to attain the better results. The detection of Hull Regions is mainly intended to increase the machine learning capability in detection of characters or digits. This can also extend this in order to get the hull regions and their intensities in Black Holes in Space Exploration.Keywords: chain code, machine learning, hull regions, hull recognition system, SASK algorithm
Procedia PDF Downloads 4043405 Reinforcing The Nagoya Protocol through a Coherent Global Intellectual Property Framework: Effective Protection for Traditional Knowledge Associated with Genetic Resources in Biodiverse African States
Authors: Oluwatobiloba Moody
Abstract:
On October 12, 2014, the Nagoya Protocol, negotiated by Parties to the Convention on Biological Diversity (CBD), entered into force. The Protocol was negotiated to implement the third objective of the CBD which relates to the fair and equitable sharing of benefits arising from the utilization of genetic resources (GRs). The Protocol aims to ‘protect’ GRs and traditional knowledge (TK) associated with GRs from ‘biopiracy’, through the establishment of a binding international regime on access and benefit sharing (ABS). In reflecting on the question of ‘effectiveness’ in the Protocol’s implementation, this paper argues that the underlying problem of ‘biopiracy’, which the Protocol seeks to address, is one which goes beyond the ABS regime. It rather thrives due to indispensable factors emanating from the global intellectual property (IP) regime. It contends that biopiracy therefore constitutes an international problem of ‘borders’ as much as of ‘regimes’ and, therefore, while the implementation of the Protocol may effectively address the ‘trans-border’ issues which have hitherto troubled African provider countries in their establishment of regulatory mechanisms, it remains unable to address the ‘trans-regime’ issues related to the eradication of biopiracy, especially those issues which involve the IP regime. This is due to the glaring incoherence in the Nagoya Protocol’s implementation and the existing global IP system. In arriving at conclusions, the paper examines the ongoing related discussions within the IP regime, specifically those within the WIPO Intergovernmental Committee on Intellectual Property and Genetic Resources, Traditional Knowledge and Folklore (IGC) and the WTO TRIPS Council. It concludes that the Protocol’s effectiveness in protecting TK associated with GRs is conditional on the attainment of outcomes, within the ongoing negotiations of the IP regime, which could be implemented in a coherent manner with the Nagoya Protocol. It proposes specific ways to achieve this coherence. Three main methodological steps have been incorporated in the paper’s development. First, a review of data accumulated over a two year period arising from the coordination of six important negotiating sessions of the WIPO Intergovernmental Committee on Intellectual Property and Genetic Resources, Traditional Knowledge and Folklore. In this respect, the research benefits from reflections on the political, institutional and substantive nuances which have coloured the IP negotiations and which provide both the context and subtext to emerging texts. Second, a desktop review of the history, nature and significance of the Nagoya Protocol, using relevant primary and secondary literature from international and national sources. Third, a comparative analysis of selected biopiracy cases is undertaken for the purpose of establishing the inseparability of the IP regime and the ABS regime in the conceptualization and development of solutions to biopiracy. A comparative analysis of select African regulatory mechanisms (Kenya, South Africa and Ethiopia and the ARIPO Swakopmund Protocol) for the protection of TK is also undertaken.Keywords: biopiracy, intellectual property, Nagoya protocol, traditional knowledge
Procedia PDF Downloads 4313404 Finding a Set of Long Common Substrings with Repeats from m Input Strings
Authors: Tiantian Li, Lusheng Wang, Zhaohui Zhan, Daming Zhu
Abstract:
In this paper, we propose two string problems, and study algorithms and complexity of various versions for those problems. Let S = {s₁, s₂, . . . , sₘ} be a set of m strings. A common substring of S is a substring appearing in every string in S. Given a set of m strings S = {s₁, s₂, . . . , sₘ} and a positive integer k, we want to find a set C of k common substrings of S such that the k common substrings in C appear in the same order and have no overlap among the m input strings in S, and the total length of the k common substring in C is maximized. This problem is referred to as the longest total length of k common substrings from m input strings (LCSS(k, m) for short). The other problem we study here is called the longest total length of a set of common substrings with length more than l from m input string (LSCSS(l, m) for short). Given a set of m strings S = {s₁, s₂, . . . , sₘ} and a positive integer l, for LSCSS(l, m), we want to find a set of common substrings of S, each is of length more than l, such that the total length of all the common substrings is maximized. We show that both problems are NP-hard when k and m are variables. We propose dynamic programming algorithms with time complexity O(k n₁n₂) and O(n₁n₂) to solve LCSS(k, 2) and LSCSS(l, 2), respectively, where n1 and n₂ are the lengths of the two input strings. We then design an algorithm for LSCSS(l, m) when every length > l common substring appears once in each of the m − 1 input strings. The running time is O(n₁²m), where n1 is the length of the input string with no restriction on length > l common substrings. Finally, we propose a fixed parameter algorithm for LSCSS(l, m), where each length > l common substring appears m − 1 + c times among the m − 1 input strings (other than s1). In other words, each length > l common substring may repeatedly appear at most c times among the m − 1 input strings {s₂, s₃, . . . , sₘ}. The running time of the proposed algorithm is O((n12ᶜ)²m), where n₁ is the input string with no restriction on repeats. The LSCSS(l, m) is proposed to handle whole chromosome sequence alignment for different strains of the same species, where more than 98% of letters in core regions are identical.Keywords: dynamic programming, algorithm, common substrings, string
Procedia PDF Downloads 233403 SARS-CoV-2: Prediction of Critical Charged Amino Acid Mutations
Authors: Atlal El-Assaad
Abstract:
Viruses change with time through mutations and result in new variants that may persist or disappear. A Mutation refers to an actual change in the virus genetic sequence, and a variant is a viral genome that may contain one or more mutations. Critical mutations may cause the virus to be more transmissible, with high disease severity, and more vulnerable to diagnostics, therapeutics, and vaccines. Thus, variants carrying such mutations may increase the risk to human health and are considered variants of concern (VOC). Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) - the contagious in humans, positive-sense single-stranded RNA virus that caused coronavirus disease 2019 (COVID-19) - has been studied thoroughly, and several variants were revealed across the world with their corresponding mutations. SARS-CoV-2 has four structural proteins, known as the S (spike), E (envelope), M (membrane), and N (nucleocapsid) proteins, but prior study and vaccines development focused on genetic mutations in the S protein due to its vital role in allowing the virus to attach and fuse with the membrane of a host cell. Specifically, subunit S1 catalyzes attachment, whereas subunit S2 mediates fusion. In this perspective, we studied all charged amino acid mutations of the SARS-CoV-2 viral spike protein S1 when bound to Antibody CC12.1 in a crystal structure and assessed the effect of different mutations. We generated all missense mutants of SARS-CoV-2 protein amino acids (AAs) within the SARS-CoV-2:CC12.1 complex model. To generate the family of mutants in each complex, we mutated every charged amino acid with all other charged amino acids (Lysine (K), Arginine (R), Glutamic Acid (E), and Aspartic Acid (D)) and studied the new binding of the complex after each mutation. We applied Poisson-Boltzmann electrostatic calculations feeding into free energy calculations to determine the effect of each mutation on binding. After analyzing our data, we identified charged amino acids keys for binding. Furthermore, we validated those findings against published experimental genetic data. Our results are the first to propose in silico potential life-threatening mutations of SARS-CoV-2 beyond the present mutations found in the five common variants found worldwide.Keywords: SARS-CoV-2, variant, ionic amino acid, protein-protein interactions, missense mutation, AESOP
Procedia PDF Downloads 1153402 Development of Configuration Software of Space Environment Simulator Control System Based on Linux
Authors: Zhan Haiyang, Zhang Lei, Ning Juan
Abstract:
This paper presents a configuration software solution in Linux, which is used for the control of space environment simulator. After introducing the structure and basic principle, it is said that the developing of QT software frame and the dynamic data exchanging between PLC and computer. The OPC driver in Linux is also developed. This driver realizes many-to-many communication between hardware devices and SCADA software. Moreover, an algorithm named “Scan PRI” is put forward. This algorithm is much more optimizable and efficient compared with "Scan in sequence" in Windows. This software has been used in practical project. It has a good control effect and can achieve the expected goal.Keywords: Linux OS, configuration software, OPC Server driver, MYSQL database
Procedia PDF Downloads 2923401 A Feature Clustering-Based Sequential Selection Approach for Color Texture Classification
Authors: Mohamed Alimoussa, Alice Porebski, Nicolas Vandenbroucke, Rachid Oulad Haj Thami, Sana El Fkihi
Abstract:
Color and texture are highly discriminant visual cues that provide an essential information in many types of images. Color texture representation and classification is therefore one of the most challenging problems in computer vision and image processing applications. Color textures can be represented in different color spaces by using multiple image descriptors which generate a high dimensional set of texture features. In order to reduce the dimensionality of the feature set, feature selection techniques can be used. The goal of feature selection is to find a relevant subset from an original feature space that can improve the accuracy and efficiency of a classification algorithm. Traditionally, feature selection is focused on removing irrelevant features, neglecting the possible redundancy between relevant ones. This is why some feature selection approaches prefer to use feature clustering analysis to aid and guide the search. These techniques can be divided into two categories. i) Feature clustering-based ranking algorithm uses feature clustering as an analysis that comes before feature ranking. Indeed, after dividing the feature set into groups, these approaches perform a feature ranking in order to select the most discriminant feature of each group. ii) Feature clustering-based subset search algorithms can use feature clustering following one of three strategies; as an initial step that comes before the search, binded and combined with the search or as the search alternative and replacement. In this paper, we propose a new feature clustering-based sequential selection approach for the purpose of color texture representation and classification. Our approach is a three step algorithm. First, irrelevant features are removed from the feature set thanks to a class-correlation measure. Then, introducing a new automatic feature clustering algorithm, the feature set is divided into several feature clusters. Finally, a sequential search algorithm, based on a filter model and a separability measure, builds a relevant and non redundant feature subset: at each step, a feature is selected and features of the same cluster are removed and thus not considered thereafter. This allows to significantly speed up the selection process since large number of redundant features are eliminated at each step. The proposed algorithm uses the clustering algorithm binded and combined with the search. Experiments using a combination of two well known texture descriptors, namely Haralick features extracted from Reduced Size Chromatic Co-occurence Matrices (RSCCMs) and features extracted from Local Binary patterns (LBP) image histograms, on five color texture data sets, Outex, NewBarktex, Parquet, Stex and USPtex demonstrate the efficiency of our method compared to seven of the state of the art methods in terms of accuracy and computation time.Keywords: feature selection, color texture classification, feature clustering, color LBP, chromatic cooccurrence matrix
Procedia PDF Downloads 1393400 Design of an Improved Distributed Framework for Intrusion Detection System Based on Artificial Immune System and Neural Network
Authors: Yulin Rao, Zhixuan Li, Burra Venkata Durga Kumar
Abstract:
Intrusion detection refers to monitoring the actions of internal and external intruders on the system and detecting the behaviours that violate security policies in real-time. In intrusion detection, there has been much discussion about the application of neural network technology and artificial immune system (AIS). However, many solutions use static methods (signature-based and stateful protocol analysis) or centralized intrusion detection systems (CIDS), which are unsuitable for real-time intrusion detection systems that need to process large amounts of data and detect unknown intrusions. This article proposes a framework for a distributed intrusion detection system (DIDS) with multi-agents based on the concept of AIS and neural network technology to detect anomalies and intrusions. In this framework, multiple agents are assigned to each host and work together, improving the system's detection efficiency and robustness. The trainer agent in the central server of the framework uses the artificial neural network (ANN) rather than the negative selection algorithm of AIS to generate mature detectors. Mature detectors can distinguish between self-files and non-self-files after learning. Our analyzer agents use genetic algorithms to generate memory cell detectors. This kind of detector will effectively reduce false positive and false negative errors and act quickly on known intrusions.Keywords: artificial immune system, distributed artificial intelligence, multi-agent, intrusion detection system, neural network
Procedia PDF Downloads 1113399 Computational Fluid Dynamics Simulations and Analysis of Air Bubble Rising in a Column of Liquid
Authors: Baha-Aldeen S. Algmati, Ahmed R. Ballil
Abstract:
Multiphase flows occur widely in many engineering and industrial processes as well as in the environment we live in. In particular, bubbly flows are considered to be crucial phenomena in fluid flow applications and can be studied and analyzed experimentally, analytically, and computationally. In the present paper, the dynamic motion of an air bubble rising within a column of liquid is numerically simulated using an open-source CFD modeling tool 'OpenFOAM'. An interface tracking numerical algorithm called MULES algorithm, which is built-in OpenFOAM, is chosen to solve an appropriate mathematical model based on the volume of fluid (VOF) numerical method. The bubbles initially have a spherical shape and starting from rest in the stagnant column of liquid. The algorithm is initially verified against numerical results and is also validated against available experimental data. The comparison revealed that this algorithm provides results that are in a very good agreement with the 2D numerical data of other CFD codes. Also, the results of the bubble shape and terminal velocity obtained from the 3D numerical simulation showed a very good qualitative and quantitative agreement with the experimental data. The simulated rising bubbles yield a very small percentage of error in the bubble terminal velocity compared with the experimental data. The obtained results prove the capability of OpenFOAM as a powerful tool to predict the behavior of rising characteristics of the spherical bubbles in the stagnant column of liquid. This will pave the way for a deeper understanding of the phenomenon of the rise of bubbles in liquids.Keywords: CFD simulations, multiphase flows, OpenFOAM, rise of bubble, volume of fluid method, VOF
Procedia PDF Downloads 1273398 A Survey on Various Technique of Modified TORA over MANET
Authors: Shreyansh Adesara, Sneha Pandiya
Abstract:
The mobile ad-hoc network (MANET) is an important and open area research for the examination and determination of the performance evolution. Temporary ordered routing algorithm (TORA) is adaptable and distributed MANET routing algorithm which is totally dependent on internet MANET Encapsulation protocol (IMEP) for the detection of the link and sensing of the link. If IMEP detect the wrong link failure then the network suffer from congestion and unnecessary route maintenance. Thus, the improvement in link detection method of TORA is introduced by various methods on IMEP by different perspective from different person. There are also different reactive routing protocols like AODV, TORA and DSR has been compared for the knowledge of the routing scenario for different parameter and using different model.Keywords: IMEP, mobile ad-hoc network, protocol, TORA
Procedia PDF Downloads 4433397 Genetic Diversity in Capsicum Germplasm Based on Inter Simple Sequence Repeat Markers
Authors: Siwapech Silapaprayoon, Januluk Khanobdee, Sompid Samipak
Abstract:
Chili peppers are the fruits of Capsicum pepper plants well known for their fiery burning sensation on the tongue after consumption. They are members of the Solanaceae or common nightshade family along with potato, tomato and eggplant. Thai cuisine has gained popularity for its distinct flavors due to usages of various spices and its heat from the addition of chili pepper. Though being used in little quantity for each dish, chili pepper holds a special place in Thai cuisine. There are many varieties of chili peppers in Thailand, and thirty accessions were collected at Rajamangala University of Technology Lanna, Lampang, Thailand. To effectively manage any germplasm it is essential to know the diversity and relationships among members. Thirty-six Inter Simple Sequence Repeat (ISSRs) DNA markers were used to analyze the germplasm. Total of 335 polymorphic bands was obtained giving the average of 9.3 alleles per marker. Unweighted pair-group mean arithmetic method (UPGMA) clustering of data using NTSYS-pc software indicated that the accessions showed varied levels of genetic similarity ranging from 0.57-1.00 similarity coefficient index indicating significant levels of variation. At SM coefficient of 0.81, the germplasm was separated into four groups. Phenotypic variation was discussed in context of phylogenetic tree clustering.Keywords: diversity, germplasm, Chili pepper, ISSR
Procedia PDF Downloads 1533396 A Review Investigating the Potential Of Zooxanthellae to Be Genetically Engineered to Combat Coral Bleaching
Authors: Anuschka Curran, Sandra Barnard
Abstract:
Coral reefs are of the most diverse and productive ecosystems on the planet, but due to the impact of climate change, these infrastructures are dying off primarily through coral bleaching. Coral bleaching can be described as the process by which zooxanthellae (algal endosymbionts) are expelled from the gastrodermal cavity of the respective coral host, causing increased coral whitening. The general consensus is that mass coral bleaching is due to the dysfunction of photosynthetic processes in the zooxanthellae as a result of the combined action of elevated temperature and light-stress. The question then is, do zooxanthellae have the potential to play a key role in the future of coral reef restoration through genetic engineering? The aim of this study is firstly to review the different zooxanthellae taxa and their traits with respect to environmental stress, and secondly, to review the information available on the protective mechanisms present in zooxanthellae cells when experiencing temperature fluctuations, specifically concentrating on heat shock proteins and the antioxidant stress response of zooxanthellae. The eight clades (A-H) previously recognized were redefined into seven genera. Different zooxanthellae taxa exhibit different traits, such as their photosynthetic stress responses to light and temperature. Zooxanthellae have the ability to determine the amount and type of heat shock proteins (hsps) present during a heat response. The zooxanthellae can regulate both the host’s respective hsps as well as their own. Hsps, generally found in genotype C3 zooxanthellae, such as Hsp70 and Hsp90, contribute to the thermal stress response of the respective coral host. Antioxidant activity found both within exposed coral tissue, and the zooxanthellae cells can prevent coral hosts from expelling their endosymbionts. The up-regulation of gene expression, which may mitigate thermal stress induction of any of the physiological aspects discussed, can ensure stable coral-zooxanthellae symbiosis in the future. It presents a viable alternative strategy to preserve reefs amidst climate change. In conclusion, despite their unusual molecular design, genetic engineering poses as a useful tool in understanding and manipulating variables and systems within zooxanthellae and therefore presents a solution that can ensure stable coral-zooxanthellae symbiosis in the future.Keywords: antioxidant enzymes, genetic engineering, heat-shock proteins, Symbiodinium
Procedia PDF Downloads 1923395 Enumerative Search for Crane Schedule in Anodizing Operations
Authors: Kanate Pantusavase, Jaramporn Hassamontr
Abstract:
This research aims to develop an algorithm to generate a schedule of multiple cranes that will maximize load throughputs in anodizing operation. The algorithm proposed utilizes an enumerative strategy to search for constant time between successive loads and crane covering range over baths. The computer program developed is able to generate a near-optimal crane schedule within reasonable times, i.e. within 10 minutes. Its results are compared with existing solutions from an aluminum extrusion industry. The program can be used to generate crane schedules for mixed products, thus allowing mixed-model line balancing to improve overall cycle times.Keywords: crane scheduling, anodizing operations, cycle time minimization
Procedia PDF Downloads 4663394 Screening Some Accessions of Lentil (Lens culinaris M.) for Salt Tolerance at Germination and Early Seedling Stage in Eastern Ethiopia
Authors: Azene Tesfaye, Yohannes Petros, Habtamu Zeleke
Abstract:
To evaluate genetic variation among Ethiopian lentil, laboratory experiment were conducted to screen 12 accessions of lentil (Lens culinaris M.) for salt tolerance. Seeds of 12 Lentil accessions were grown at laboratory (Petri dish) condition with different levels of salinity (0, 2, 4, and 8 dSm-1 NaCl) for 4 weeks. The experimental design was completely randomized design (CRD) in factorial combination with three replications. Data analysis was carried out using SAS software. Average germination time, germination percentage, seedling shoot and root traits, seedling shoot and root weight were evaluated. The two way ANOVA for varieties revealed statistically significant variation among lentil accession, NaCl level and their interactions (p<0.001) with respect to the entire parameters. It was found that salt stress significantly delays germination rate and decreases germination percentage, shoot and root length, seedling shoot and root weight of lentil accessions. The degree of decrement varied with accessions and salinity levels. Accessions 36120, 9235 and 36004 were better salt tolerant than the other accessions. As the result, it is recommended to be used as a genetic resource for the development of lentil accession and other very salt sensitive crop with improved germination under salt stress condition.Keywords: accession, germination, lentil, NaCl, screening, seedling stage
Procedia PDF Downloads 3443393 Support Vector Regression with Weighted Least Absolute Deviations
Authors: Kang-Mo Jung
Abstract:
Least squares support vector machine (LS-SVM) is a penalized regression which considers both fitting and generalization ability of a model. However, the squared loss function is very sensitive to even single outlier. We proposed a weighted absolute deviation loss function for the robustness of the estimates in least absolute deviation support vector machine. The proposed estimates can be obtained by a quadratic programming algorithm. Numerical experiments on simulated datasets show that the proposed algorithm is competitive in view of robustness to outliers.Keywords: least absolute deviation, quadratic programming, robustness, support vector machine, weight
Procedia PDF Downloads 5313392 The Diversity of DRB1 Locus of Exon 2 of MHC Molecule of Sudanese Indigenous Desert Sheep
Authors: Muna A. Eissawi, Safaa Abed Elfataah, Haytham Hago, Fatima E Abukunna, Ibtisam Amin Goreish, Nahid Gornas
Abstract:
The study examined and analyzed the genetic diversity of DRB1locus of exon 2 of major histocompatibility complex of Sudanese desert sheep using PCR-RFLP and DNA sequencing. Five hundred samples belonging to five ecotypes of Desert Sudanese sheep (Abrag (Ab), Ashgar (Ash), Hamari (H), Kabashi (K) and Watish (W) were included. Amplification of exon 2 of the DRB1 gene yielded (300bp) amplified product in different ecotypes. Nine different digestion patterns corresponding to Five distinct alleles were observed with Rsa1 digestion. Genotype (ag) was the most common among all ecotypes, with a percentage comprised (40.4 %). The Hardy-Weinberg equilibrium (HWE) test showed that the studied ecotypes have significantly deviated from the theoretical proportions of Rsa1 patterns; probability values of the Chi-square test for HWE for MHC-DRB1 gene in SDS were 0.00 in all ecotypes. The constructed phylogenetic tree revealed the relation of 22 Sudanese isolates with each other and showed the shared sequences with 47 published foreign sequences randomly selected from different geographic regions. The results of this study highlight the effect of heterozygosity of MHC genes of the Desert sheep of Sudan which may clarify some of genetic back ground of their disease resistance and adaptation to environment.Keywords: desert sheep, MHC, Ovar-DRB1, polymerase chain reaction (PCR), restriction fragment length polymorphism (RFLP)
Procedia PDF Downloads 793391 An Enhanced Distributed Weighted Clustering Algorithm for Intra and Inter Cluster Routing in MANET
Authors: K. Gomathi
Abstract:
Mobile Ad hoc Networks (MANET) is defined as collection of routable wireless mobile nodes with no centralized administration and communicate each other using radio signals. Especially MANETs deployed in hostile environments where hackers will try to disturb the secure data transfer and drain the valuable network resources. Since MANET is battery operated network, preserving the network resource is essential one. For resource constrained computation, efficient routing and to increase the network stability, the network is divided into smaller groups called clusters. The clustering architecture consists of Cluster Head(CH), ordinary node and gateway. The CH is responsible for inter and intra cluster routing. CH election is a prominent research area and many more algorithms are developed using many different metrics. The CH with longer life sustains network lifetime, for this purpose Secondary Cluster Head(SCH) also elected and it is more economical. To nominate efficient CH, a Enhanced Distributed Weighted Clustering Algorithm (EDWCA) has been proposed. This approach considers metrics like battery power, degree difference and speed of the node for CH election. The proficiency of proposed one is evaluated and compared with existing algorithm using Network Simulator(NS-2).Keywords: MANET, EDWCA, clustering, cluster head
Procedia PDF Downloads 4003390 Integrated Navigation System Using Simplified Kalman Filter Algorithm
Authors: Othman Maklouf, Abdunnaser Tresh
Abstract:
GPS and inertial navigation system (INS) have complementary qualities that make them ideal use for sensor fusion. The limitations of GPS include occasional high noise content, outages when satellite signals are blocked, interference and low bandwidth. The strengths of GPS include its long-term stability and its capacity to function as a stand-alone navigation system. In contrast, INS is not subject to interference or outages, have high bandwidth and good short-term noise characteristics, but have long-term drift errors and require external information for initialization. A combined system of GPS and INS subsystems can exhibit the robustness, higher bandwidth and better noise characteristics of the inertial system with the long-term stability of GPS. The most common estimation algorithm used in integrated INS/GPS is the Kalman Filter (KF). KF is able to take advantages of these characteristics to provide a common integrated navigation implementation with performance superior to that of either subsystem (GPS or INS). This paper presents a simplified KF algorithm for land vehicle navigation application. In this integration scheme, the GPS derived positions and velocities are used as the update measurements for the INS derived PVA. The KF error state vector in this case includes the navigation parameters as well as the accelerometer and gyroscope error states.Keywords: GPS, INS, Kalman filter, inertial navigation system
Procedia PDF Downloads 4743389 Budget Optimization for Maintenance of Bridges in Egypt
Authors: Hesham Abd Elkhalek, Sherif M. Hafez, Yasser M. El Fahham
Abstract:
Allocating limited budget to maintain bridge networks and selecting effective maintenance strategies for each bridge represent challenging tasks for maintenance managers and decision makers. In Egypt, bridges are continuously deteriorating. In many cases, maintenance works are performed due to user complaints. The objective of this paper is to develop a practical and reliable framework to manage the maintenance, repair, and rehabilitation (MR&R) activities of Bridges network considering performance and budget limits. The model solves an optimization problem that maximizes the average condition of the entire network given the limited available budget using Genetic Algorithm (GA). The framework contains bridge inventory, condition assessment, repair cost calculation, deterioration prediction, and maintenance optimization. The developed model takes into account multiple parameters including serviceability requirements, budget allocation, element importance on structural safety and serviceability, bridge impact on network, and traffic. A questionnaire is conducted to complete the research scope. The proposed model is implemented in software, which provides a friendly user interface. The framework provides a multi-year maintenance plan for the entire network for up to five years. A case study of ten bridges is presented to validate and test the proposed model with data collected from Transportation Authorities in Egypt. Different scenarios are presented. The results are reasonable, feasible and within acceptable domain.Keywords: bridge management systems (BMS), cost optimization condition assessment, fund allocation, Markov chain
Procedia PDF Downloads 2923388 Efficient Broadcasting in Wireless Sensor Networks
Authors: Min Kyung An, Hyuk Cho
Abstract:
In this paper, we study the Minimum Latency Broadcast Scheduling (MLBS) problem in wireless sensor networks (WSNs). The main issue of the MLBS problem is to compute schedules with the minimum number of timeslots such that a base station can broadcast data to all other sensor nodes with no collisions. Unlike existing works that utilize the traditional omni-directional WSNs, we target the directional WSNs where nodes can collaboratively determine and orientate their antenna directions. We first develop a 7-approximation algorithm, adopting directional WSNs. Our ratio is currently the best, to the best of our knowledge. We then validate the performance of the proposed algorithm through simulation.Keywords: broadcast, collision-free, directional antenna, approximation, wireless sensor networks
Procedia PDF Downloads 3493387 A Simple Adaptive Atomic Decomposition Voice Activity Detector Implemented by Matching Pursuit
Authors: Thomas Bryan, Veton Kepuska, Ivica Kostanic
Abstract:
A simple adaptive voice activity detector (VAD) is implemented using Gabor and gammatone atomic decomposition of speech for high Gaussian noise environments. Matching pursuit is used for atomic decomposition, and is shown to achieve optimal speech detection capability at high data compression rates for low signal to noise ratios. The most active dictionary elements found by matching pursuit are used for the signal reconstruction so that the algorithm adapts to the individual speakers dominant time-frequency characteristics. Speech has a high peak to average ratio enabling matching pursuit greedy heuristic of highest inner products to isolate high energy speech components in high noise environments. Gabor and gammatone atoms are both investigated with identical logarithmically spaced center frequencies, and similar bandwidths. The algorithm performs equally well for both Gabor and gammatone atoms with no significant statistical differences. The algorithm achieves 70% accuracy at a 0 dB SNR, 90% accuracy at a 5 dB SNR and 98% accuracy at a 20dB SNR using 30dB SNR as a reference for voice activity.Keywords: atomic decomposition, gabor, gammatone, matching pursuit, voice activity detection
Procedia PDF Downloads 2963386 Organic Agriculture Harmony in Nutrition, Environment and Health: Case Study in Iran
Authors: Sara Jelodarian
Abstract:
Organic agriculture is a kind of living and dynamic agriculture that was introduced in the early 20th century. The fundamental basis for organic agriculture is in harmony with nature. This version of farming emphasizes removing growth hormones, chemical fertilizers, toxins, radiation, genetic manipulation and instead, integration of modern scientific techniques (such as biologic and microbial control) that leads to the production of healthy food and the preservation of the environment and use of agricultural products such as forage and manure. Supports from governments for the markets producing organic products and taking advantage of the experiences from other successful societies in this field can help progress the positive and effective aspects of this technology, especially in developing countries. This research proves that till 2030, 25% of the global agricultural lands would be covered by organic farming. Consequently Iran, due to its rich genetic resources and various climates, can be a pioneer in promoting organic products. In addition, for sustainable farming, blend of organic and other innovative systems is needed. Important limitations exist to accept these systems, also a diversity of policy instruments will be required to comfort their development and implementation. The paper was conducted to results of compilation of reports, issues, books, articles related to the subject with library studies and research. Likewise we combined experimental and survey to get data.Keywords: develop, production markets, progress, strategic role, technology
Procedia PDF Downloads 119