Search results for: modified backtracking search algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 7424

Search results for: modified backtracking search algorithm

6914 Use of Hierarchical Temporal Memory Algorithm in Heart Attack Detection

Authors: Tesnim Charrad, Kaouther Nouira, Ahmed Ferchichi

Abstract:

In order to reduce the number of deaths due to heart problems, we propose the use of Hierarchical Temporal Memory Algorithm (HTM) which is a real time anomaly detection algorithm. HTM is a cortical learning algorithm based on neocortex used for anomaly detection. In other words, it is based on a conceptual theory of how the human brain can work. It is powerful in predicting unusual patterns, anomaly detection and classification. In this paper, HTM have been implemented and tested on ECG datasets in order to detect cardiac anomalies. Experiments showed good performance in terms of specificity, sensitivity and execution time.

Keywords: cardiac anomalies, ECG, HTM, real time anomaly detection

Procedia PDF Downloads 228
6913 Study on the Heavy Oil Degradation Performance and Kinetics of Immobilized Bacteria on Modified Zeolite

Authors: Xiao L Dai, Wen X Wei, Shuo Wang, Jia B Li, Yan Wei

Abstract:

Heavy oil pollution generated from both natural and anthropogenic sources could cause significant damages to the ecological environment, due to the toxicity of some of its constituents. Nowadays, microbial remediation is becoming a promising technology to treat oil pollution owing to its low cost and prevention of secondary pollution; microorganisms are key players in the process. Compared to the free microorganisms, immobilized microorganisms possess several advantages, including high metabolic activity rates, strong resistance to toxic chemicals and natural competition with the indigenous microorganisms, and effective resistance to washing away (in open water system). Many immobilized microorganisms have been successfully used for bioremediation of heavy oil pollution. Considering the broad choices, low cost, simple process, large specific surface area and less impact on microbial activity, modified zeolite were selected as a bio-carrier for bacteria immobilization. Three strains of heavy oil-degrading bacteria Bacillus sp. DL-13, Brevibacillus sp. DL-1 and Acinetobacter sp. DL-34 were immobilized on the modified zeolite under mild conditions, and the bacterial load (bacteria /modified zeolite) was 1.12 mg/g, 1.11 mg/g, and 1.13 mg/g, respectively. SEM results showed that the bacteria mainly adsorbed on the surface or punctured in the void of modified zeolite. The heavy oil degradation efficiency of immobilized bacteria was 62.96%, higher than that of the free bacteria (59.83%). The heavy oil degradation process of immobilized bacteria accords with the first-order reaction equation, and the reaction rate constant is 0.1483 d⁻¹, which was significantly higher than the free bacteria (0.1123 d⁻¹), suggesting that the immobilized bacteria can rapidly start up the heavy oil degradation and has a high activity of heavy oil degradation. The results suggested that immobilized bacteria are promising technology for bioremediation of oil pollution.

Keywords: heavy oil pollution, microbial remediation, modified zeolite, immobilized bacteria

Procedia PDF Downloads 150
6912 Symmetric Key Encryption Algorithm Using Indian Traditional Musical Scale for Information Security

Authors: Aishwarya Talapuru, Sri Silpa Padmanabhuni, B. Jyoshna

Abstract:

Cryptography helps in preventing threats to information security by providing various algorithms. This study introduces a new symmetric key encryption algorithm for information security which is linked with the "raagas" which means Indian traditional scale and pattern of music notes. This algorithm takes the plain text as input and starts its encryption process. The algorithm then randomly selects a raaga from the list of raagas that is assumed to be present with both sender and the receiver. The plain text is associated with the thus selected raaga and an intermediate cipher-text is formed as the algorithm converts the plain text characters into other characters, depending upon the rules of the algorithm. This intermediate code or cipher text is arranged in various patterns in three different rounds of encryption performed. The total number of rounds in the algorithm is equal to the multiples of 3. To be more specific, the outcome or output of the sequence of first three rounds is again passed as the input to this sequence of rounds recursively, till the total number of rounds of encryption is performed. The raaga selected by the algorithm and the number of rounds performed will be specified at an arbitrary location in the key, in addition to important information regarding the rounds of encryption, embedded in the key which is known by the sender and interpreted only by the receiver, thereby making the algorithm hack proof. The key can be constructed of any number of bits without any restriction to the size. A software application is also developed to demonstrate this process of encryption, which dynamically takes the plain text as input and readily generates the cipher text as output. Therefore, this algorithm stands as one of the strongest tools for information security.

Keywords: cipher text, cryptography, plaintext, raaga

Procedia PDF Downloads 289
6911 A New Graph Theoretic Problem with Ample Practical Applications

Authors: Mehmet Hakan Karaata

Abstract:

In this paper, we first coin a new graph theocratic problem with numerous applications. Second, we provide two algorithms for the problem. The first solution is using a brute-force techniques, whereas the second solution is based on an initial identification of the cycles in the given graph. We then provide a correctness proof of the algorithm. The applications of the problem include graph analysis, graph drawing and network structuring.

Keywords: algorithm, cycle, graph algorithm, graph theory, network structuring

Procedia PDF Downloads 386
6910 Considering the Reliability of Measurements Issue in Distributed Adaptive Estimation Algorithms

Authors: Wael M. Bazzi, Amir Rastegarnia, Azam Khalili

Abstract:

In this paper we consider the issue of reliability of measurements in distributed adaptive estimation problem. To this aim, we assume a sensor network with different observation noise variance among the sensors and propose new estimation method based on incremental distributed least mean-square (IDLMS) algorithm. The proposed method contains two phases: I) Estimation of each sensors observation noise variance, and II) Estimation of the desired parameter using the estimated observation variances. To deal with the reliability of measurements, in the second phase of the proposed algorithm, the step-size parameter is adjusted for each sensor according to its observation noise variance. As our simulation results show, the proposed algorithm considerably improves the performance of the IDLMS algorithm in the same condition.

Keywords: adaptive filter, distributed estimation, sensor network, IDLMS algorithm

Procedia PDF Downloads 634
6909 Consensus Problem of High-Order Multi-Agent Systems under Predictor-Based Algorithm

Authors: Cheng-Lin Liu, Fei Liu

Abstract:

For the multi-agent systems with agent's dynamics described by high-order integrator, and usual consensus algorithm composed of the state coordination control parts is proposed. Under communication delay, consensus algorithm in asynchronously-coupled form just can make the agents achieve a stationary consensus, and sufficient consensus condition is obtained based on frequency-domain analysis. To recover the original consensus state of the high-order agents without communication delay, besides, a predictor-based consensus algorithm is constructed via multiplying the delayed neighboring agents' states by a delay-related compensation part, and sufficient consensus condition is also obtained. Simulation illustrates the correctness of the results.

Keywords: high-order dynamic agents, communication delay, consensus, predictor-based algorithm

Procedia PDF Downloads 570
6908 Nanoparticles Using in Chiral Analysis with Different Methods of Separation

Authors: Bounoua Nadia, Rebizi Mohamed Nadjib

Abstract:

Chiral molecules in relation to particular biological roles are stereoselective. Enantiomers differ significantly in their biochemical responses in a biological environment. Despite the current advancement in drug discovery and pharmaceutical biotechnology, the chiral separation of some racemic mixtures continues to be one of the greatest challenges because the available techniques are too costly and time-consuming for the assessment of therapeutic drugs in the early stages of development worldwide. Various nanoparticles became one of the most investigated and explored nanotechnology-derived nanostructures, especially in chirality, where several studies are reported to improve the enantiomeric separation of different racemic mixtures. The production of surface-modified nanoparticles has contributed to these limitations in terms of sensitivity, accuracy, and enantioselectivity that can be optimized and therefore makes these surface-modified nanoparticles convenient for enantiomeric identification and separation.

Keywords: chirality, enantiomeric recognition, selectors, analysis, surface-modified nanoparticles

Procedia PDF Downloads 94
6907 Cadmium Adsorption by Modified Magnetic Biochar

Authors: Chompoonut Chaiyaraksa, Chanida Singbubpha, Kliaothong Angkabkingkaew, Thitikorn Boonyasawin

Abstract:

Heavy metal contamination in an environment is an important problem in Thailand that needs to be addressed urgently, particularly contaminated with water. It can spread to other environments faster. This research aims to study the adsorption of cadmium ion by unmodified biochar and sodium dodecyl sulfate modified magnetic biochar derived from Eichhornia Crassipes. The determination of the adsorbent characteristics was by Scanning Electron Microscope, Fourier Transform Infrared Spectrometer, X-ray Diffractometer, and the pH drift method. This study also included the comparison of adsorption efficiency of both types of biochar, adsorption isotherms, and kinetics. The pH value at the point of zero charges of the unmodified biochar and modified magnetic biochar was 7.40 and 3.00, respectively. The maximum value of adsorption reached when using pH 8. The equilibrium adsorption time was 5 hours and 1 hour for unmodified biochar and modified magnetic biochar, respectively. The cadmium adsorption by both adsorbents followed Freundlich, Temkin, and Dubinin – Radushkevich isotherm model and the pseudo-second-order kinetic. The adsorption process was spontaneous at high temperatures and non-spontaneous at low temperatures. It was an endothermic process, physisorption in nature, and can occur naturally.

Keywords: Eichhornia crassipes, magnetic biochar, sodium dodecyl sulfate, water treatment

Procedia PDF Downloads 172
6906 Genetic Algorithm Optimization of the Economical, Ecological and Self-Consumption Impact of the Energy Production of a Single Building

Authors: Ludovic Favre, Thibaut M. Schafer, Jean-Luc Robyr, Elena-Lavinia Niederhäuser

Abstract:

This paper presents an optimization method based on genetic algorithm for the energy management inside buildings developed in the frame of the project Smart Living Lab (SLL) in Fribourg (Switzerland). This algorithm optimizes the interaction between renewable energy production, storage systems and energy consumers. In comparison with standard algorithms, the innovative aspect of this project is the extension of the smart regulation over three simultaneous criteria: the energy self-consumption, the decrease of greenhouse gas emissions and operating costs. The genetic algorithm approach was chosen due to the large quantity of optimization variables and the non-linearity of the optimization function. The optimization process includes also real time data of the building as well as weather forecast and users habits. This information is used by a physical model of the building energy resources to predict the future energy production and needs, to select the best energetic strategy, to combine production or storage of energy in order to guarantee the demand of electrical and thermal energy. The principle of operation of the algorithm as well as typical output example of the algorithm is presented.

Keywords: building's energy, control system, energy management, energy storage, genetic optimization algorithm, greenhouse gases, modelling, renewable energy

Procedia PDF Downloads 257
6905 Curve Fitting by Cubic Bezier Curves Using Migrating Birds Optimization Algorithm

Authors: Mitat Uysal

Abstract:

A new met heuristic optimization algorithm called as Migrating Birds Optimization is used for curve fitting by rational cubic Bezier Curves. This requires solving a complicated multivariate optimization problem. In this study, the solution of this optimization problem is achieved by Migrating Birds Optimization algorithm that is a powerful met heuristic nature-inspired algorithm well appropriate for optimization. The results of this study show that the proposed method performs very well and being able to fit the data points to cubic Bezier Curves with a high degree of accuracy.

Keywords: algorithms, Bezier curves, heuristic optimization, migrating birds optimization

Procedia PDF Downloads 337
6904 Modified Approximation Methods for Finding an Optimal Solution for the Transportation Problem

Authors: N. Guruprasad

Abstract:

This paper presents a modification of approximation method for transportation problems. The initial basic feasible solution can be computed using either Russel's or Vogel's approximation methods. Russell’s approximation method provides another excellent criterion that is still quick to implement on a computer (not manually) In most cases Russel's method yields a better initial solution, though it takes longer than Vogel's method (finding the next entering variable in Russel's method is in O(n1*n2), and in O(n1+n2) for Vogel's method). However, Russel's method normally has a lesser total running time because less pivots are required to reach the optimum for all but small problem sizes (n1+n2=~20). With this motivation behind we have incorporated a variation of the same – what we have proposed it has TMC (Total Modified Cost) to obtain fast and efficient solutions.

Keywords: computation, efficiency, modified cost, Russell’s approximation method, transportation, Vogel’s approximation method

Procedia PDF Downloads 548
6903 Hybrid Intelligent Optimization Methods for Optimal Design of Horizontal-Axis Wind Turbine Blades

Authors: E. Tandis, E. Assareh

Abstract:

Designing the optimal shape of MW wind turbine blades is provided in a number of cases through evolutionary algorithms associated with mathematical modeling (Blade Element Momentum Theory). Evolutionary algorithms, among the optimization methods, enjoy many advantages, particularly in stability. However, they usually need a large number of function evaluations. Since there are a large number of local extremes, the optimization method has to find the global extreme accurately. The present paper introduces a new population-based hybrid algorithm called Genetic-Based Bees Algorithm (GBBA). This algorithm is meant to design the optimal shape for MW wind turbine blades. The current method employs crossover and neighborhood searching operators taken from the respective Genetic Algorithm (GA) and Bees Algorithm (BA) to provide a method with good performance in accuracy and speed convergence. Different blade designs, twenty-one to be exact, were considered based on the chord length, twist angle and tip speed ratio using GA results. They were compared with BA and GBBA optimum design results targeting the power coefficient and solidity. The results suggest that the final shape, obtained by the proposed hybrid algorithm, performs better compared to either BA or GA. Furthermore, the accuracy and speed convergence increases when the GBBA is employed

Keywords: Blade Design, Optimization, Genetic Algorithm, Bees Algorithm, Genetic-Based Bees Algorithm, Large Wind Turbine

Procedia PDF Downloads 316
6902 A Low-Latency Quadratic Extended Domain Modular Multiplier for Bilinear Pairing Based on Non-Least Positive Multiplication

Authors: Yulong Jia, Xiang Zhang, Ziyuan Wu, Shiji Hu

Abstract:

The calculation of bilinear pairing is the core of the SM9 algorithm, which relies on the underlying prime domain algorithm and the quadratic extension domain algorithm. Among the field algorithms, modular multiplication operation is the most time-consuming part. Therefore, the underlying modular multiplication algorithm is optimized to maximize the operation speed of bilinear pairings. This paper uses a modular multiplication method based on non-least positive (NLP) combined with Karatsuba and schoolbook multiplication to improve the Montgomery algorithm. At the same time, according to the characteristics of multiplication operation in the quadratic extension domain, a quadratic extension domain FP2-NLP modular multiplication algorithm for bilinear pairings is proposed, which effectively reduces the operation time of modular multiplication in the quadratic extension domain. The sub-expanded domain Fp₂ -NLP modular multiplication algorithm effectively reduces the operation time of modular multiplication under the second-expanded domain. The multiplication unit in the quadratic extension domain is implemented using SMIC55nm process, and two different implementation architectures are designed to cope with different application scenarios. Compared with the existing related literature, The output latency of this design can reach a minimum of 15 cycles. The shortest time for calculating the (AB+CD)r⁻¹ mod form is 37.5ns, and the comprehensive area-time product (AT) is 11400. The final R-ate pairing algorithm hardware accelerator consumes 2670k equivalent logic gates and 1.8ms computing time in 55nm process.

Keywords: sm9, hardware, NLP, Montgomery

Procedia PDF Downloads 8
6901 Modified Mangrove Pens for Polyculture System in Mud Crab (Scylla serrata) and Milkfish (Chanos chanos) Production

Authors: Laurence G. Almoguera, Vitaliana U. Malamug, Armando N. Espino, Marvin M. Cinense

Abstract:

The mangrove pens were modified to produce mud crab (Scylla serrata) and milkfish (Chanos chanos) in a polyculture system. The modification of mangrove pens was done by adding excavations inside the pen. The water quality parameters (dissolved oxygen, pH, salinity, and temperature) were monitored, the recovery and the production rate in each pen were evaluated. The experiment was conducted for a rearing period of 143 days in nine mangrove pens, each having an area of 32 m² with an average net enclosure height of 3 m from the soil surface. The three different pens constructed (existing design - with canal only, with 43% excavation by area, and 54% excavation by area) were designated as T₁, T₂, and T₃, respectively. All experimental units were stocked with 31 pieces of crablets (with 33.3 g average weight) and additional 130 pieces of milkfish fingerlings (with 0.11 g average weight) to the modified mangrove pens. The water quality parameters recorded in the pens were favorable for the growth and recovery of the mud crab and milkfish, except for dissolved oxygen (DO). It was found to be the reason for the total mortality of the stocked milkfish. For mud crab, the highest mean recovery was recorded in T₂ (34.41%), followed by T₃ (26.91%) and the lowest in T1 (21.50%). The production rate followed the same trend as the recovery, where T₂ (74.49 g/m²) obtained the highest, followed by T₃ (55 g/m2) and the lowest was in T₁ (34.87 g/m²). The statistical analysis revealed that the variations of the mud crab recovery were not significant, while in terms of production rate, modified mangrove pens were found to be more effective than the existing design. Due to the total mortality of the cultured milkfish, the current set-up of modified mangrove pens was found to be not suitable for the polyculture system of milkfish and mud crab production.

Keywords: aquasilviculture, milkfish, modified mangrove pen, mud crab, polyculture, production rate

Procedia PDF Downloads 199
6900 Using Personalized Spiking Neural Networks, Distinct Techniques for Self-Governing

Authors: Brwa Abdulrahman Abubaker

Abstract:

Recently, there has been a lot of interest in the difficult task of applying reinforcement learning to autonomous mobile robots. Conventional reinforcement learning (TRL) techniques have many drawbacks, such as lengthy computation times, intricate control frameworks, a great deal of trial and error searching, and sluggish convergence. In this paper, a modified Spiking Neural Network (SNN) is used to offer a distinct method for autonomous mobile robot learning and control in unexpected surroundings. As a learning algorithm, the suggested model combines dopamine modulation with spike-timing-dependent plasticity (STDP). In order to create more computationally efficient, biologically inspired control systems that are adaptable to changing settings, this work uses the effective and physiologically credible Izhikevich neuron model. This study is primarily focused on creating an algorithm for target tracking in the presence of obstacles. Results show that the SNN trained with three obstacles yielded an impressive 96% success rate for our proposal, with collisions happening in about 4% of the 214 simulated seconds.

Keywords: spiking neural network, spike-timing-dependent plasticity, dopamine modulation, reinforcement learning

Procedia PDF Downloads 21
6899 Analytical Solutions to the N-Dimensional Schrödinger Equation with a Collective Potential Model to Study Energy Spectra Andthermodynamic Properties of Selected Diatomic Molecules

Authors: BenedictI Ita, Etido P. Inyang

Abstract:

In this work, the resolutions of the N-dimensional Schrödinger equation with the screened modified Kratzerplus inversely quadratic Yukawa potential (SMKIQYP) have been obtained with the Greene-Aldrich approximation scheme using the Nikiforov-Uvarov method. The eigenvalues and the normalized eigenfunctions are obtained. We then apply the energy spectrum to study four (HCl, N₂, NO, and CO) diatomic molecules. The results show that the energy spectra of these diatomic molecules increase as quantum numbers increase. The energy equation was also used to calculate the partition function and other thermodynamic properties. We predicted the partition function of CO and NO. To check the accuracy of our work, the special case (Modified Kratzer and screened Modified Kratzer potentials) of the collective potential energy eigenvalues agrees excellently with the existing literature.

Keywords: Schrödinger equation, Nikiforov-Uvarov method, modified screened Kratzer, inversely quadratic Yukawa potential, diatomic molecules

Procedia PDF Downloads 85
6898 An Inviscid Compressible Flow Solver Based on Unstructured OpenFOAM Mesh Format

Authors: Utkan Caliskan

Abstract:

Two types of numerical codes based on finite volume method are developed in order to solve compressible Euler equations to simulate the flow through forward facing step channel. Both algorithms have AUSM+- up (Advection Upstream Splitting Method) scheme for flux splitting and two-stage Runge-Kutta scheme for time stepping. In this study, the flux calculations differentiate between the algorithm based on OpenFOAM mesh format which is called 'face-based' algorithm and the basic algorithm which is called 'element-based' algorithm. The face-based algorithm avoids redundant flux computations and also is more flexible with hybrid grids. Moreover, some of OpenFOAM’s preprocessing utilities can be used on the mesh. Parallelization of the face based algorithm for which atomic operations are needed due to the shared memory model, is also presented. For several mesh sizes, 2.13x speed up is obtained with face-based approach over the element-based approach.

Keywords: cell centered finite volume method, compressible Euler equations, OpenFOAM mesh format, OpenMP

Procedia PDF Downloads 319
6897 A New DIDS Design Based on a Combination Feature Selection Approach

Authors: Adel Sabry Eesa, Adnan Mohsin Abdulazeez Brifcani, Zeynep Orman

Abstract:

Feature selection has been used in many fields such as classification, data mining and object recognition and proven to be effective for removing irrelevant and redundant features from the original data set. In this paper, a new design of distributed intrusion detection system using a combination feature selection model based on bees and decision tree. Bees algorithm is used as the search strategy to find the optimal subset of features, whereas decision tree is used as a judgment for the selected features. Both the produced features and the generated rules are used by Decision Making Mobile Agent to decide whether there is an attack or not in the networks. Decision Making Mobile Agent will migrate through the networks, moving from node to another, if it found that there is an attack on one of the nodes, it then alerts the user through User Interface Agent or takes some action through Action Mobile Agent. The KDD Cup 99 data set is used to test the effectiveness of the proposed system. The results show that even if only four features are used, the proposed system gives a better performance when it is compared with the obtained results using all 41 features.

Keywords: distributed intrusion detection system, mobile agent, feature selection, bees algorithm, decision tree

Procedia PDF Downloads 409
6896 Methane Plasma Modified Polyvinyl Alcohol Scaffolds for Melanocytes Cultivation

Authors: B. Kodedova, E. Filova, M. Kralovic, E. Amler

Abstract:

Vitiligo is the most common depigmentation disorder of the skin characterized by loss of melanocyte in the epidermis that leads to white lesions. One of the possible treatments is autologous transplantation of melanocytes. Biodegradable electrospun polymeric nanofibers provide good mechanical properties and could serve as suitable scaffold for epithelial cells cultivation and follow up transplantation. Moreover the microarchitecture of nanofibers mimics the structure of extracellular matrix and its porosity allows nutrients and waste exchange. The aim of this work was to develop biocompatible and biodegradable polymeric scaffolds suitable for autologous melanocytes transplantation. Electrospun polyvinyl alcohol (PVA) nanofibers were modified by cold methane plasma to lower their hydrofility and to achieve better adhesion, proliferation and viability of the murine melanocyte (Melan-a). Cells were seeded on the modified scaffolds and their adhesion, metabolic activity, proliferation and melanin synthesis was evaluated and compared to non-modified scaffolds. Results clearly indicate that cold methane plasma modified PVA nanofibers are suitable for melanocyte cultivation and may be future candidate for vitiligo treatment. Furthermore, the nanofibers can be functionalized with various bioactive substances, for enhancement of the melanocyte proliferation, melanogenesis or healing and regenerative processes. The project was supported by the Ministry of Education, Youth and Sports NPU I: LO1309 and by Grant Agency of Charles University (grant No. 1228214).

Keywords: melanocyte, nanofibers, polyvinyl alcohol, plasma modification

Procedia PDF Downloads 322
6895 Accurate Algorithm for Selecting Ground Motions Satisfying Code Criteria

Authors: S. J. Ha, S. J. Baik, T. O. Kim, S. W. Han

Abstract:

For computing the seismic responses of structures, current seismic design provisions permit response history analyses (RHA) that can be used without limitations in height, seismic design category, and building irregularity. In order to obtain accurate seismic responses using RHA, it is important to use adequate input ground motions. Current seismic design provisions provide criteria for selecting ground motions. In this study, the accurate and computationally efficient algorithm is proposed for accurately selecting ground motions that satisfy the requirements specified in current seismic design provisions. The accuracy of the proposed algorithm is verified using single-degree-of-freedom systems with various natural periods and yield strengths. This study shows that the mean seismic responses obtained from RHA with seven and ten ground motions selected using the proposed algorithm produce errors within 20% and 13%, respectively.

Keywords: algorithm, ground motion, response history analysis, selection

Procedia PDF Downloads 286
6894 Wireless Battery Charger with Adaptive Rapid-Charging Algorithm

Authors: Byoung-Hee Lee

Abstract:

Wireless battery charger with adaptive rapid charging algorithm is proposed. The proposed wireless charger adopts voltage regulation technique to reduce the number of power conversion steps. Moreover, based on battery models, an adaptive rapid charging algorithm for Li-ion batteries is obtained. Rapid-charging performance with the proposed wireless battery charger and the proposed rapid charging algorithm has been experimentally verified to show more than 70% charging time reduction compared to conventional constant-current constant-voltage (CC-CV) charging without the degradation of battery lifetime.

Keywords: wireless, battery charger, adaptive, rapid-charging

Procedia PDF Downloads 378
6893 Heuristic Classification of Hydrophone Recordings

Authors: Daniel M. Wolff, Patricia Gray, Rafael de la Parra Venegas

Abstract:

An unsupervised machine listening system is constructed and applied to a dataset of 17,195 30-second marine hydrophone recordings. The system is then heuristically supplemented with anecdotal listening, contextual recording information, and supervised learning techniques to reduce the number of false positives. Features for classification are assembled by extracting the following data from each of the audio files: the spectral centroid, root-mean-squared values for each frequency band of a 10-octave filter bank, and mel-frequency cepstral coefficients in 5-second frames. In this way both time- and frequency-domain information are contained in the features to be passed to a clustering algorithm. Classification is performed using the k-means algorithm and then a k-nearest neighbors search. Different values of k are experimented with, in addition to different combinations of the available feature sets. Hypothesized class labels are 'primarily anthrophony' and 'primarily biophony', where the best class result conforming to the former label has 104 members after heuristic pruning. This demonstrates how a large audio dataset has been made more tractable with machine learning techniques, forming the foundation of a framework designed to acoustically monitor and gauge biological and anthropogenic activity in a marine environment.

Keywords: anthrophony, hydrophone, k-means, machine learning

Procedia PDF Downloads 170
6892 An Integrated Cognitive Performance Evaluation Framework for Urban Search and Rescue Applications

Authors: Antonio D. Lee, Steven X. Jiang

Abstract:

A variety of techniques and methods are available to evaluate cognitive performance in Urban Search and Rescue (USAR) applications. However, traditional cognitive performance evaluation techniques typically incorporate either the conscious or systematic aspect, failing to take into consideration the subconscious or intuitive aspect. This leads to incomplete measures and produces ineffective designs. In order to fill the gaps in past research, this study developed a theoretical framework to facilitate the integration of situation awareness (SA) and intuitive pattern recognition (IPR) to enhance the cognitive performance representation in USAR applications. This framework provides guidance to integrate both SA and IPR in order to evaluate the cognitive performance of the USAR responders. The application of this framework will help improve the system design.

Keywords: cognitive performance, intuitive pattern recognition, situation awareness, urban search and rescue

Procedia PDF Downloads 328
6891 Investigating the Properties of Asphalt and Asphalt Mixture Based on the Effect of Waste Toner

Authors: Prince Igor Itoua, Daquan Sun, Shihui Shen

Abstract:

This study aimed at investigating the properties of asphalt and mix asphalt based on the effects of waste toner sources (WT1 and WT2) with 8% dosage waste toner powders (WT). The test results included penetration, softening points, ductility, G*sinδ, G*/sinδ, Ideal cracking test(IDEAL-CT), and Ideal shear rutting test(IDEAL-RT). The results showed that the base binder with WT2 had a significantly higher viscosity value compared to the WT1 modified binder, and thus, higher energy for mixing and compaction is needed. Fur-thermore, the results of penetration, softening points, G*sinδ, and G*/sinδ were all affected by waste toner type. In terms of asphalt mixture, the IDEAL-RT test revealed that the addition of waste toner improved the rutting resistance of the asphalt mixture regardless of toner type. Further, CTindex values for waste toner-modified asphalt mixtures show no significant difference. Above all, WT-modified asphalt mixtures produced by the wet process have better rutting performance.

Keywords: waste toner, waste toner modified asphalt, asphalt mixture properties, IDEAL-RT test, IDEAL-CT test

Procedia PDF Downloads 87
6890 Frequency- and Content-Based Tag Cloud Font Distribution Algorithm

Authors: Ágnes Bogárdi-Mészöly, Takeshi Hashimoto, Shohei Yokoyama, Hiroshi Ishikawa

Abstract:

The spread of Web 2.0 has caused user-generated content explosion. Users can tag resources to describe and organize them. Tag clouds provide rough impression of relative importance of each tag within overall cloud in order to facilitate browsing among numerous tags and resources. The goal of our paper is to enrich visualization of tag clouds. A font distribution algorithm has been proposed to calculate a novel metric based on frequency and content, and to classify among classes from this metric based on power law distribution and percentages. The suggested algorithm has been validated and verified on the tag cloud of a real-world thesis portal.

Keywords: tag cloud, font distribution algorithm, frequency-based, content-based, power law

Procedia PDF Downloads 505
6889 Improving Research by the Integration of a Collaborative Dimension in an Information Retrieval (IR) System

Authors: Amel Hannech, Mehdi Adda, Hamid Mcheick

Abstract:

In computer science, the purpose of finding useful information is still one of the most active and important research topics. The most popular application of information retrieval (IR) are Search Engines, they meet users' specific needs and aim to locate the effective information in the web. However, these search engines have some limitations related to the relevancy of the results and the ease to explore those results. In this context, we proposed in previous works a Multi-Space Search Engine model that is based on a multidimensional interpretation universe. In the present paper, we integrate an additional dimension that allows to offer users new research experiences. The added component is based on creating user profiles and calculating the similarity between them that then allow the use of collaborative filtering in retrieving search results. To evaluate the effectiveness of the proposed model, a prototype is developed. The experiments showed that the additional dimension has improved the relevancy of results by predicting the interesting items of users based on their experiences and the experiences of other similar users. The offered personalization service allows users to approve the pertinent items, which allows to enrich their profiles and further improve research.

Keywords: information retrieval, v-facets, user behavior analysis, user profiles, topical ontology, association rules, data personalization

Procedia PDF Downloads 264
6888 Classifying and Analysis 8-Bit to 8-Bit S-Boxes Characteristic Using S-Box Evaluation Characteristic

Authors: Muhammad Luqman, Yusuf Kurniawan

Abstract:

S-Boxes is one of the linear parts of the cryptographic algorithm. The existence of S-Box in the cryptographic algorithm is needed to maintain non-linearity of the algorithm. Nowadays, modern cryptographic algorithms use an S-Box as a part of algorithm process. Despite the fact that several cryptographic algorithms today reuse theoretically secure and carefully constructed S-Boxes, there is an evaluation characteristic that can measure security properties of S-Boxes and hence the corresponding primitives. Analysis of an S-Box usually is done using manual mathematics calculation. Several S-Boxes are presented as a Truth Table without any mathematical background algorithm. Then, it’s rather difficult to determine the strength of Truth Table S-Box without a mathematical algorithm. A comprehensive analysis should be applied to the Truth Table S-Box to determine the characteristic. Several important characteristics should be owned by the S-Boxes, they are Nonlinearity, Balancedness, Algebraic degree, LAT, DAT, differential delta uniformity, correlation immunity and global avalanche criterion. Then, a comprehensive tool will be present to automatically calculate the characteristics of S-Boxes and determine the strength of S-Box. Comprehensive analysis is done on a deterministic process to produce a sequence of S-Boxes characteristic and give advice for a better S-Box construction.

Keywords: cryptographic properties, Truth Table S-Boxes, S-Boxes characteristic, deterministic process

Procedia PDF Downloads 363
6887 Energy Efficient Clustering with Adaptive Particle Swarm Optimization

Authors: KumarShashvat, ArshpreetKaur, RajeshKumar, Raman Chadha

Abstract:

Wireless sensor networks have principal characteristic of having restricted energy and with limitation that energy of the nodes cannot be replenished. To increase the lifetime in this scenario WSN route for data transmission is opted such that utilization of energy along the selected route is negligible. For this energy efficient network, dandy infrastructure is needed because it impinges the network lifespan. Clustering is a technique in which nodes are grouped into disjoints and non–overlapping sets. In this technique data is collected at the cluster head. In this paper, Adaptive-PSO algorithm is proposed which forms energy aware clusters by minimizing the cost of locating the cluster head. The main concern is of the suitability of the swarms by adjusting the learning parameters of PSO. Particle Swarm Optimization converges quickly at the beginning stage of the search but during the course of time, it becomes stable and may be trapped in local optima. In suggested network model swarms are given the intelligence of the spiders which makes them capable enough to avoid earlier convergence and also help them to escape from the local optima. Comparison analysis with traditional PSO shows that new algorithm considerably enhances the performance where multi-dimensional functions are taken into consideration.

Keywords: Particle Swarm Optimization, adaptive – PSO, comparison between PSO and A-PSO, energy efficient clustering

Procedia PDF Downloads 246
6886 New Iterative Algorithm for Improving Depth Resolution in Ionic Analysis: Effect of Iterations Number

Authors: N. Dahraoui, M. Boulakroune, D. Benatia

Abstract:

In this paper, the improvement by deconvolution of the depth resolution in Secondary Ion Mass Spectrometry (SIMS) analysis is considered. Indeed, we have developed a new Tikhonov-Miller deconvolution algorithm where a priori model of the solution is included. This is a denoisy and pre-deconvoluted signal obtained from: firstly, by the application of wavelet shrinkage algorithm, secondly by the introduction of the obtained denoisy signal in an iterative deconvolution algorithm. In particular, we have focused the light on the effect of the iterations number on the evolution of the deconvoluted signals. The SIMS profiles are multilayers of Boron in Silicon matrix.

Keywords: DRF, in-depth resolution, multiresolution deconvolution, SIMS, wavelet shrinkage

Procedia PDF Downloads 418
6885 Description of the Non-Iterative Learning Algorithm of Artificial Neuron

Authors: B. S. Akhmetov, S. T. Akhmetova, A. I. Ivanov, T. S. Kartbayev, A. Y. Malygin

Abstract:

The problem of training of a network of artificial neurons in biometric appendices is that this process has to be completely automatic, i.e. the person operator should not participate in it. Therefore, this article discusses the issues of training the network of artificial neurons and the description of the non-iterative learning algorithm of artificial neuron.

Keywords: artificial neuron, biometrics, biometrical applications, learning of neuron, non-iterative algorithm

Procedia PDF Downloads 496