Search results for: meta heuristic algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 4108

Search results for: meta heuristic algorithm

3868 A Novel Algorithm for Production Scheduling

Authors: Ali Mohammadi Bolban Abad, Fariborz Ahmadi

Abstract:

Optimization in manufacture is a method to use limited resources to obtain the best performance and reduce waste. In this paper a new algorithm based on eurygaster life is introduced to obtain a plane in which task order and completion time of resources are defined. Evaluation results show our approach has less make span when the resources are allocated with some products in comparison to genetic algorithm.

Keywords: evolutionary computation, genetic algorithm, particle swarm optimization, NP-Hard problems, production scheduling

Procedia PDF Downloads 352
3867 Drastic Increase of Wave Dissipation within Metastructures Having Negative Stiffness Inclusions

Authors: D. Chronopoulos, I. Antoniadis, V. Spitas, D. Koulocheris, V. Polenta

Abstract:

A concept of a simple linear oscillator, incorporating a negative stiffness element is demonstrated to exhibit extraordinary damping properties. This oscillator shares the same overall (static) stiffness, the same mass and the same damping element with a reference classical linear SDOF oscillator. However, it differs from the original SDOF oscillator by appropriately redistributing the component spring stiffness elements and by re-allocating the damping element. Despite the fact that the proposed oscillator incorporates a negative stiffness element, it is designed to be both statically and dynamically stable. Once such an oscillator is optimally designed, it is shown to exhibit an extraordinary apparent damping ratio, which is even several orders of magnitude higher than that of the original SDOF system, especially in cases where the original damping of the SDOF system is low. This damping behavior is not a result of a novel additional extraordinary energy dissipation mechanism, but a result of the phase difference between the positive and the negative stiffness elastic forces, which is in turn a consequence of the proper re-distribution of the stiffness and the damper elements. This fact ensures that an adequate level of elastic forces exists throughout the entire frequency range, able to counteract the inertial and the excitation forces. Next, Acoustic or Phononic Meta-materials are considered, in which one atom is replaced by the concept of the above simple linear oscillator. The results indicate that not only the damping of the meta-material verifies and exceeds the one expected from the so-called "meta-damping" behavior, but also that the band gap of the meta-material can be significantly increased.

Keywords: wave propagation, periodic structures, wave damping, mechanical engineering

Procedia PDF Downloads 332
3866 Downscaling Daily Temperature with Neuroevolutionary Algorithm

Authors: Min Shi

Abstract:

State of the art research with Artificial Neural Networks for the downscaling of General Circulation Models (GCMs) mainly uses back-propagation algorithm as a training approach. This paper introduces another training approach of ANNs, Evolutionary Algorithm. The combined algorithm names neuroevolutionary (NE) algorithm. We investigate and evaluate the use of the NE algorithms in statistical downscaling by generating temperature estimates at interior points given information from a lattice of surrounding locations. The results of our experiments indicate that NE algorithms can be efficient alternative downscaling methods for daily temperatures.

Keywords: temperature, downscaling, artificial neural networks, evolutionary algorithms

Procedia PDF Downloads 320
3865 An Optimization Algorithm Based on Dynamic Schema with Dissimilarities and Similarities of Chromosomes

Authors: Radhwan Yousif Sedik Al-Jawadi

Abstract:

Optimization is necessary for finding appropriate solutions to a range of real-life problems. In particular, genetic (or more generally, evolutionary) algorithms have proved very useful in solving many problems for which analytical solutions are not available. In this paper, we present an optimization algorithm called Dynamic Schema with Dissimilarity and Similarity of Chromosomes (DSDSC) which is a variant of the classical genetic algorithm. This approach constructs new chromosomes from a schema and pairs of existing ones by exploring their dissimilarities and similarities. To show the effectiveness of the algorithm, it is tested and compared with the classical GA, on 15 two-dimensional optimization problems taken from literature. We have found that, in most cases, our method is better than the classical genetic algorithm.

Keywords: chromosome injection, dynamic schema, genetic algorithm, similarity and dissimilarity

Procedia PDF Downloads 315
3864 A Two Phase VNS Algorithm for the Combined Production Routing Problem

Authors: Nejah Ben Mabrouk, Bassem Jarboui, Habib Chabchoub

Abstract:

Production and distribution planning is the most important part in supply chain management. In this paper, a NP-hard production-distribution problem for one product over a multi-period horizon is investigated. The aim is to minimize the sum of costs of three items: production setups, inventories and distribution, while determining, for each period, the amount produced, the inventory levels and the delivery trips. To solve this difficult problem, we propose a bi-phase approach based on a Variable Neighbourhood Search (VNS). This heuristic is tested on 90 randomly generated instances from the literature, with 20 periods and 50, 100, 200 customers. Computational results show that our approach outperforms existing solution procedures available in the literature

Keywords: logistic, production, distribution, variable neighbourhood search

Procedia PDF Downloads 304
3863 Simulation Approach for a Comparison of Linked Cluster Algorithm and Clusterhead Size Algorithm in Ad Hoc Networks

Authors: Ameen Jameel Alawneh

Abstract:

A Mobile ad-hoc network (MANET) is a collection of wireless mobile hosts that dynamically form a temporary network without the aid of a system administrator. It has neither fixed infrastructure nor wireless ad hoc sessions. It inherently reaches several nodes with a single transmission, and each node functions as both a host and a router. The network maybe represented as a set of clusters each managed by clusterhead. The cluster size is not fixed and it depends on the movement of nodes. We proposed a clusterhead size algorithm (CHSize). This clustering algorithm can be used by several routing algorithms for ad hoc networks. An elected clusterhead is assigned for communication with all other clusters. Analysis and simulation of the algorithm has been implemented using GloMoSim networks simulator, MATLAB and MAPL11 proved that the proposed algorithm achieves the goals.

Keywords: simulation, MANET, Ad-hoc, cluster head size, linked cluster algorithm, loss and dropped packets

Procedia PDF Downloads 366
3862 Family History of Obesity and Risk of Childhood Overweight and Obesity: A Meta-Analysis

Authors: Martina Kanciruk, Jac J. W. Andrews, Tyrone Donnon

Abstract:

The purpose of this study was to determine the significance of history of obesity for the development of childhood overweight and/or obesity. Accordingly, a systematic literature review of English-language studies published from 1980 to 2012 using the following data bases: MEDLINE, PsychINFO, Cochrane Database of Systematic Reviews, and Dissertation Abstracts International was conducted. The following terms were used in the search: pregnancy, overweight, obesity, family history, parents, childhood, risk factors. Eleven studies of family history and obesity conducted in Europe, Asia, North America, and South America met the inclusion criteria. A meta-analysis of these studies indicated that family history of obesity is a significant risk factor of overweight and /or obesity in offspring; risk for offspring overweight and/or obesity associated with family history varies depending of the family members included in the analysis; and when family history of obesity is present, the offspring are at greater risk for developing obesity or overweight. In addition, the results from moderator analyses suggest that part of the heterogeneity discovered between the studies can be explained by the region of world that the study occurred in and the age of the child at the time of weight assessment.

Keywords: childhood obesity, overweight, family history, risk factors, meta-analysis

Procedia PDF Downloads 491
3861 Hybrid Algorithm for Frequency Channel Selection in Wi-Fi Networks

Authors: Cesar Hernández, Diego Giral, Ingrid Páez

Abstract:

This article proposes a hybrid algorithm for spectrum allocation in cognitive radio networks based on the algorithms Analytical Hierarchical Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) to improve the performance of the spectrum mobility of secondary users in cognitive radio networks. To calculate the level of performance of the proposed algorithm a comparative analysis between the proposed AHP-TOPSIS, Grey Relational Analysis (GRA) and Multiplicative Exponent Weighting (MEW) algorithm is performed. Four evaluation metrics is used. These metrics are the accumulative average of failed handoffs, the accumulative average of handoffs performed, the accumulative average of transmission bandwidth, and the accumulative average of the transmission delay. The results of the comparison show that AHP-TOPSIS Algorithm provides 2.4 times better performance compared to a GRA Algorithm and, 1.5 times better than the MEW Algorithm.

Keywords: cognitive radio, decision making, hybrid algorithm, spectrum handoff, wireless networks

Procedia PDF Downloads 508
3860 Modified Active (MA) Algorithm to Generate Semantic Web Related Clustered Hierarchy for Keyword Search

Authors: G. Leena Giri, Archana Mathur, S. H. Manjula, K. R. Venugopal, L. M. Patnaik

Abstract:

Keyword search in XML documents is based on the notion of lowest common ancestors in the labelled trees model of XML documents and has recently gained a lot of research interest in the database community. In this paper, we propose the Modified Active (MA) algorithm which is an improvement over the active clustering algorithm by taking into consideration the entity aspect of the nodes to find the level of the node pertaining to a particular keyword input by the user. A portion of the bibliography database is used to experimentally evaluate the modified active algorithm and results show that it performs better than the active algorithm. Our modification improves the response time of the system and thereby increases the efficiency of the system.

Keywords: keyword matching patterns, MA algorithm, semantic search, knowledge management

Procedia PDF Downloads 377
3859 Cuckoo Search (CS) Optimization Algorithm for Solving Constrained Optimization

Authors: Sait Ali Uymaz, Gülay Tezel

Abstract:

This paper presents the comparison results on the performance of the Cuckoo Search (CS) algorithm for constrained optimization problems. For constraint handling, CS algorithm uses penalty method. CS algorithm is tested on thirteen well-known test problems and the results obtained are compared to Particle Swarm Optimization (PSO) algorithm. Mean, best, median and worst values were employed for the analyses of performance.

Keywords: cuckoo search, particle swarm optimization, constrained optimization problems, penalty method

Procedia PDF Downloads 524
3858 Left to Right-Right Most Parsing Algorithm with Lookahead

Authors: Jamil Ahmed

Abstract:

Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It is contingent on a parsing table, whereas the parsing tables are extracted from the grammar. The parsing table specifies the actions to be taken during parsing. It requires that the parsing table should have no action conflicts for the same input symbol. This requirement imposes a condition on the class of grammars over which the LR algorithms work. However, there are grammars for which the parsing tables hold action conflicts. In such cases, the algorithm needs a capability of scanning (looking-ahead) next input symbols ahead of the current input symbol. In this paper, a ‘Left to Right’-‘Right Most’ parsing algorithm with lookahead capability is introduced. The 'look-ahead' capability in the LR parsing algorithm is the major contribution of this paper. The practicality of the proposed algorithm is substantiated by the parser implementation of the Context Free Grammar (CFG) of an already proposed programming language 'State Controlled Object Oriented Programming' (SCOOP). SCOOP’s Context Free Grammar has 125 productions and 192 item sets. This algorithm parses SCOOP while the grammar requires to ‘look ahead’ the input symbols due to action conflicts in its parsing table. Proposed LR parsing algorithm with lookahead capability can be viewed as an optimization of ‘Simple Left to Right’-‘Right Most’ (SLR) parsing algorithm.

Keywords: left to right-right most parsing, syntax analysis, bottom-up parsing algorithm

Procedia PDF Downloads 93
3857 A Novel Solution Methodology for Transit Route Network Design Problem

Authors: Ghada Moussa, Mamoud Owais

Abstract:

Transit Route Network Design Problem (TrNDP) is the most important component in Transit planning, in which the overall cost of the public transportation system highly depends on it. The main purpose of this study is to develop a novel solution methodology for the TrNDP, which goes beyond pervious traditional sophisticated approaches. The novelty of the solution methodology, adopted in this paper, stands on the deterministic operators which are tackled to construct bus routes. The deterministic manner of the TrNDP solution relies on using linear and integer mathematical formulations that can be solved exactly with their standard solvers. The solution methodology has been tested through Mandl’s benchmark network problem. The test results showed that the methodology developed in this research is able to improve the given network solution in terms of number of constructed routes, direct transit service coverage, transfer directness and solution reliability. Although the set of routes resulted from the methodology would stand alone as a final efficient solution for TrNDP, it could be used as an initial solution for meta-heuristic procedures to approach global optimal. Based on the presented methodology, a more robust network optimization tool would be produced for public transportation planning purposes.

Keywords: integer programming, transit route design, transportation, urban planning

Procedia PDF Downloads 236
3856 Integration of Climatic Factors in the Meta-Population Modelling of the Dynamic of Malaria Transmission, Case of Douala and Yaoundé, Two Cities of Cameroon

Authors: Justin-Herve Noubissi, Jean Claude Kamgang, Eric Ramat, Januarius Asongu, Christophe Cambier

Abstract:

The goal of our study is to analyse the impact of climatic factors in malaria transmission taking into account migration between Douala and Yaoundé, two cities of Cameroon country. We show how variations of climatic factors such as temperature and relative humidity affect the malaria spread. We propose a meta-population model of the dynamic transmission of malaria that evolves in space and time and that takes into account temperature and relative humidity and the migration between Douala and Yaoundé. We also integrate the variation of environmental factors as events also called mathematical impulsion that can disrupt the model evolution at any time. Our modelling has been done using the Discrete EVents System Specification (DEVS) formalism. Our implementation has been done on Virtual Laboratory Environment (VLE) that uses DEVS formalism and abstract simulators for coupling models by integrating the concept of DEVS.

Keywords: compartmental models, DEVS, discrete events, meta-population model, VLE

Procedia PDF Downloads 532
3855 Inquiry on the Improvement Teaching Quality in the Classroom with Meta-Teaching Skills

Authors: Shahlan Surat, Saemah Rahman, Saadiah Kummin

Abstract:

When teachers reflect and evaluate whether their teaching methods actually have an impact on students’ learning, they will adjust their practices accordingly. This inevitably improves their students’ learning and performance. The approach in meta-teaching can invigorate and create a passion for teaching. It thus helps to increase the commitment and love for the teaching profession. This study was conducted to determine the level of metacognitive thinking of teachers in the process of teaching and learning in the classroom. Metacognitive thinking teachers include the use of metacognitive knowledge which consists of different types of knowledge: declarative, procedural and conditional. The ability of the teachers to plan, monitor and evaluate the teaching process can also be determined. This study was conducted on 377 graduate teachers in Klang Valley, Malaysia. The stratified sampling method was selected for the purpose of this study. The metacognitive teaching inventory consisting of 24 items is called InKePMG (Teacher Indicators of Effectiveness Meta-Teaching). The results showed the level of mean is high for two components of metacognitive knowledge; declarative knowledge (mean = 4.16) and conditional (mean = 4.11) whereas, the mean of procedural knowledge is 4.00 (moderately high). Similarly, the level of knowledge in monitoring (mean = 4.11), evaluating (mean = 4.00) which indicate high score and planning (mean = 4.00) are moderately high score among teachers. In conclusion, this study shows that the planning and procedural knowledge is an important element in improving the quality of teachers teaching in the classroom. Thus, the researcher recommended that further studies should focus on training programs for teachers on metacognitive skills and also on developing creative thinking among teachers.

Keywords: metacognitive thinking skills, procedural knowledge, conditional knowledge, meta-teaching and regulation of cognitive

Procedia PDF Downloads 380
3854 Improved Whale Algorithm Based on Information Entropy and Its Application in Truss Structure Optimization Design

Authors: Serges Mendomo Meye, Li Guowei, Shen Zhenzhong, Gan Lei, Xu Liqun

Abstract:

Given the limitations of the original whale optimization algorithm (WAO) in local optimum and low convergence accuracy in truss structure optimization problems, based on the fundamental whale algorithm, an improved whale optimization algorithm (SWAO) based on information entropy is proposed. The information entropy itself is an uncertain measure. It is used to control the range of whale searches in path selection. It can overcome the shortcomings of the basic whale optimization algorithm (WAO) and can improve the global convergence speed of the algorithm. Taking truss structure as the optimization research object, the mathematical model of truss structure optimization is established; the cross-sectional area of truss is taken as the design variable; the objective function is the weight of truss structure; and an improved whale optimization algorithm (SWAO) is used for optimization design, which provides a new idea and means for its application in large and complex engineering structure optimization design.

Keywords: information entropy, structural optimization, truss structure, whale algorithm

Procedia PDF Downloads 211
3853 Coronary Artery Calcium Score and Statin Treatment Effect on Myocardial Infarction and Major Adverse Cardiovascular Event of Atherosclerotic Cardiovascular Disease: A Systematic Review and Meta-Analysis

Authors: Yusra Pintaningrum, Ilma Fahira Basyir, Sony Hilal Wicaksono, Vito A. Damay

Abstract:

Background: Coronary artery calcium (CAC) scores play an important role in improving prognostic accuracy and can be selectively used to guide the allocation of statin therapy for atherosclerotic cardiovascular disease outcomes and potentially associated with the occurrence of MACE (Major Adverse Cardiovascular Event) and MI (Myocardial Infarction). Objective: This systematic review and meta-analysis aim to analyze the findings of a study about CAC Score and statin treatment effect on MI and MACE risk. Methods: Search for published scientific articles using the PRISMA (Preferred Reporting, Items for Systematic Reviews and Meta-Analysis) method conducted on PubMed, Cochrane Library, and Medline databases published in the last 20 years on “coronary artery calcium” AND “statin” AND “cardiovascular disease” Further systematic review and meta-analysis using RevMan version 5.4 were performed based on the included published scientific articles. Results: Based on 11 studies included with a total of 1055 participants, we performed a meta-analysis and found that individuals with CAC score > 0 increased risk ratio of MI 8.48 (RR = 9.48: 95% CI: 6.22 – 14.45) times and MACE 2.48 (RR = 3.48: 95% CI: 2.98 – 4.05) times higher than CAC score 0 individual. Statin compared against non-statin treatment showed a statistically insignificant overall effect on the risk of MI (P = 0.81) and MACE (P = 0.89) in an individual with elevated CAC score 1 – 100 (P = 0.65) and > 100 (P = 0.11). Conclusions: This study found that an elevated CAC scores individual has a higher risk of MI and MACE than a non-elevated CAC score individual. There is no significant effect of statin compared against non-statin treatment to reduce MI and MACE in elevated CAC score individuals of 1 – 100 or > 100.

Keywords: coronary artery calcium, statin, cardiovascular disease, myocardial infarction, MACE

Procedia PDF Downloads 66
3852 Parallel Version of Reinhard’s Color Transfer Algorithm

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 583
3851 A Filtering Algorithm for a Nonlinear State-Space Model

Authors: Abdullah Eqal Al Mazrooei

Abstract:

Kalman filter is a famous algorithm that utilizes to estimate the state in the linear systems. It has numerous applications in technology and science. Since of the most of applications in real life can be described by nonlinear systems. So, Kalman filter does not work with the nonlinear systems because it is suitable to linear systems only. In this work, a nonlinear filtering algorithm is presented which is suitable to use with the special kinds of nonlinear systems. This filter generalizes the Kalman filter. This means that this filter also can be used for the linear systems. Our algorithm depends on a special linearization of the second degree. We introduced the nonlinear algorithm with a bilinear state-space model. A simulation example is presented to illustrate the efficiency of the algorithm.

Keywords: Kalman filter, filtering algorithm, nonlinear systems, state-space model

Procedia PDF Downloads 347
3850 Chemical Reaction Algorithm for Expectation Maximization Clustering

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems.

Keywords: chemical reaction optimization, expection maimization, initia, objective function clustering

Procedia PDF Downloads 682
3849 An Improved Genetic Algorithm for Traveling Salesman Problem with Precedence Constraint

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 534
3848 Development of an Optimised, Automated Multidimensional Model for Supply Chains

Authors: Safaa H. Sindi, Michael Roe

Abstract:

This project divides supply chain (SC) models into seven Eras, according to the evolution of the market’s needs throughout time. The five earliest Eras describe the emergence of supply chains, while the last two Eras are to be created. Research objectives: The aim is to generate the two latest Eras with their respective models that focus on the consumable goods. Era Six contains the Optimal Multidimensional Matrix (OMM) that incorporates most characteristics of the SC and allocates them into four quarters (Agile, Lean, Leagile, and Basic SC). This will help companies, especially (SMEs) plan their optimal SC route. Era Seven creates an Automated Multidimensional Model (AMM) which upgrades the matrix of Era six, as it accounts for all the supply chain factors (i.e. Offshoring, sourcing, risk) into an interactive system with Heuristic Learning that helps larger companies and industries to select the best SC model for their market. Methodologies: The data collection is based on a Fuzzy-Delphi study that analyses statements using Fuzzy Logic. The first round of Delphi study will contain statements (fuzzy rules) about the matrix of Era six. The second round of Delphi contains the feedback given from the first round and so on. Preliminary findings: both models are applicable, Matrix of Era six reduces the complexity of choosing the best SC model for SMEs by helping them identify the best strategy of Basic SC, Lean, Agile and Leagile SC; that’s tailored to their needs. The interactive heuristic learning in the AMM of Era seven will help mitigate error and aid large companies to identify and re-strategize the best SC model and distribution system for their market and commodity, hence increasing efficiency. Potential contributions to the literature: The problematic issue facing many companies is to decide which SC model or strategy to incorporate, due to the many models and definitions developed over the years. This research simplifies this by putting most definition in a template and most models in the Matrix of era six. This research is original as the division of SC into Eras, the Matrix of Era six (OMM) with Fuzzy-Delphi and Heuristic Learning in the AMM of Era seven provides a synergy of tools that were not combined before in the area of SC. Additionally the OMM of Era six is unique as it combines most characteristics of the SC, which is an original concept in itself.

Keywords: Leagile, automation, heuristic learning, supply chain models

Procedia PDF Downloads 365
3847 A Meta Analysis of the Recent Work-Related Research of BEC-Teachers in the Graduate Programs of the Selected HEIs in Region I and CAR

Authors: Sherelle Lou Sumera Icutan, Sheila P. Cayabyab, Mary Jane Laruan, Paulo V. Cenas, Agustina R. Tactay

Abstract:

This study critically analyzed the recent theses and dissertations of the Basic Education Curriculum (BEC) teachers who finished their graduate programs in selected higher educational institutions in Region I and CAR to be able to come up with a unified result from the varied results of the analyzed research works. All theses and dissertations completed by the educators/teachers/school personnel in the secondary and elementary public and private schools in Region 1 and CAR from AY 2003–2004 to AY 2007–2008 were classified first–as to work or non-work related; second–as to the different aspects of the curriculum: implementation, content, instructional materials, assessment instruments, learning, teaching, and others; third–as to being eligible for meta-analysis or not. Only studies found eligible for meta-analysis were subjected to the procedure. Aside from documentary analysis, the statistical treatments used in meta-analysis include the standardized effect size, Pearson’s correlation (r), the chi-square test of homogeneity and the inverse of the Fisher transformation. This study found out that the BEC-teachers usually probe on work-related researchers with topics that are focused on the learning performances of the students and on factors related to teaching. The development of instructional materials and assessment of implemented programs are also equally explored. However, there are only few researches on content and assessment instrument. Research findings on the areas of learning and teaching are the only aspects that are meta-analyzable. The research findings across studies in Region I and CAR of BEC teachers that focused on similar variables correlated to teaching do not vary significantly. On the contrary, research findings across studies in Region I and CAR that focused on variables correlated to learning performance significantly vary. Within each region, variations on the findings of research works related to learning performance that considered similar variables still exist. The combined finding on the effect size or relationship of the variables that are correlated to learning performance are low which means that effect is small but definite while the combined findings on the relationship of the variables correlated to teaching are slight or almost negligible.

Keywords: meta-analysis, BEC teachers, work-related research,

Procedia PDF Downloads 397
3846 Improved FP-Growth Algorithm with Multiple Minimum Supports Using Maximum Constraints

Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam

Abstract:

Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FP-growth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.

Keywords: association rules, FP-growth, multiple minimum supports, Weka tool

Procedia PDF Downloads 449
3845 An Improved Many Worlds Quantum Genetic Algorithm

Authors: Li Dan, Zhao Junsuo, Zhang Wenjun

Abstract:

Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm.

Keywords: quantum genetic algorithm, many worlds, quantum training operator, combinatorial optimization operator

Procedia PDF Downloads 708
3844 A Rapid Code Acquisition Scheme in OOC-Based CDMA Systems

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 503
3843 Popularization of Persian Scientific Articles in the Public Media: An Analysis Based on Experimental Meta-function View Point

Authors: Behnaz Zolfaghari

Abstract:

In civilized societies, linguists seek to find suitable equivalents for scientific terms in the common language of their society. Many researches have conducted surveys about language of science on one hand and media discourse on the other, but the goal of this research is the comparative analysis of science discourse in Persian academic media and public discourse in the general Persian media by applying experimental meta-function as one of the four theoretical tools introduced by Holiday’s Systemic Functional Grammar .The said analysis aims to explore the processes that can convert the language in which scientific facts are published to a language well suited to the interested layman. The results of comparison show that these two discourses use differently six processes of experimental meta-function. Comparing the redundancy of different processes, the researcher tried to re-identify these differences in these two discourses and present a model for the procedures of converting science discourse to popularized discourse. This model can be useful for those journalists and textbook authors who want to restate scientific technical texts in a simple style for inexpert addresser including general people and students.

Keywords: systemic functional grammar, discourse analysis, science language, popularization, media discourse

Procedia PDF Downloads 164
3842 Improvement in Oral Health-Related Quality of Life of Adult Patients After Rehabilitation With Partial Dentures: A Systematic Review and Meta-Analysis

Authors: Adama NS Bah

Abstract:

Background: Loss of teeth has a negative influence on essential oral functions such as phonetics, mastication, and aesthetics. Dentists treat people with prosthodontic rehabilitation to recover essential oral functions. The oral health quality of life inventory reflects the success of prosthodontic rehabilitation. In many countries, the current conventional care delivered to replace missing teeth for adult patients involves the provision of removable partial dentures. Aim: The aim of this systematic review and meta-analysis is to gather the best available evidence to determine patients’ oral health-related quality of life improvement after treatment with partial dentures. Methods: We searched electronic databases from January 2010 to September 2019, including PubMed, ProQuest, Science Direct, Scopus and Google Scholar. In this paper, studies were included only if the average age was 30 years and above and also published in English. Two reviewers independently screened and selected all the references based on inclusion criteria using the PRISMA guideline, and assessed the quality of the included references using the Joanna Briggs Institute quality assessment tools. Data extracted were analyzed in RevMan 5.0 software, the heterogeneity between the studies was assessed using Forest plot, I2 statistics and chi-square test with a statistical P value less than 0.05 to indicate statistical significance. Random effect models were used in case of moderate or high heterogeneity. Four studies were included in the systematic review and three studies were pooled for meta-analysis. Results: Four studies included in the systematic review and three studies included in the meta-analysis with a total of 285 patients comparing the improvement in oral health-related quality of life before and after rehabilitation with partial denture, the pooled results showed a better improvement of oral health-related quality of life after treatment with partial dentures (mean difference 5.25; 95% CI [3.81, 6.68], p < 0.00001) favoring the wearing of partial dentures. In order to ascertain the reliability of the included studies for meta-analysis risk of bias was assessed and found to be low in all included studies for meta-analysis using the Cochrane collaboration tool for risk of bias assessment. Conclusion: There is high evidence that rehabilitation with partial dentures can improve the patient’s oral health-related quality of life measured with Oral Health Impact Profile 14. This review has clinical evidence value for dentists treating the expanding vulnerable adult population.

Keywords: meta-analysis, oral health impact profile, partial dentures, systematic review

Procedia PDF Downloads 82
3841 Efficacy and Safety of Probiotic Treatment in Patients with Liver Cirrhosis: A Systematic Review and Meta-Analysis

Authors: Samir Malhotra, Rajan K. Khandotra, Rakesh K. Dhiman, Neelam Chadha

Abstract:

There is paucity of data about safety and efficacy of probiotic treatment on patient outcomes in cirrhosis. Specifically, it is important to know whether probiotics can improve mortality, hepatic encephalopathy (HE), number of hospitalizations, ammonia levels, quality of life, and adverse events. Probiotics may improve outcomes in patients with acute or chronic HE. However, it is also important to know whether probiotics can prevent development of HE, even in situations where patients do not have acute HE at the time of administration. It is also important to know if probiotics are useful as primary prophylaxis of HE. We aimed to conduct an updated systematic review and meta-analysis to evaluate the safety and efficacy of probiotics in patients with cirrhosis. We searched PubMed, Cochrane library, Embase, Scopus, SCI, Google Scholar, conference proceedings, and references of included studies till June 2017 to identify randomised clinical trials comparing probiotics with other treatments in cirrhotics. Data was analyzed using MedCalc. Probiotics had no effect on mortality but significantly reduced HE (14 trials, 1073 patients, OR 0.371; 95% CI 0.282 to 0.489). There was not enough data to conduct a meta-analysis on outcomes like hospitalizations and quality of life. The effect on plasma ammonia levels was not significant (SMD -0.429; 95%CI -1.034 – 0.177). There was no difference in adverse events. To conclude, although the included studies had a high risk of bias, the available evidence does suggest a beneficial effect on HE. Larger studies with longer periods of follow-up are needed to determine if probiotics can reduce all-cause mortality.

Keywords: cirrhosis, hepatic encephalopathy, meta-analysis, probiotic

Procedia PDF Downloads 179
3840 Travel Planning in Public Transport Networks Applying the Algorithm A* for Metropolitan District of Quito

Authors: M. Fernanda Salgado, Alfonso Tierra, Wilbert Aguilar

Abstract:

The present project consists in applying the informed search algorithm A star (A*) to solve traveler problems, applying it by urban public transportation routes. The digitization of the information allowed to identify 26% of the total of routes that are registered within the Metropolitan District of Quito. For the validation of this information, data were taken in field on the travel times and the difference with respect to the times estimated by the program, resulting in that the difference between them was not greater than 2:20 minutes. We validate A* algorithm with the Dijkstra algorithm, comparing nodes vectors based on the public transport stops, the validation was established through the student t-test hypothesis. Then we verified that the times estimated by the program using the A* algorithm are similar to those registered on field. Furthermore, we review the performance of the algorithm generating iterations in both algorithms. Finally, with these iterations, a hypothesis test was carried out again with student t-test where it was concluded that the iterations of the base algorithm Dijsktra are greater than those generated by the algorithm A*.

Keywords: algorithm A*, graph, mobility, public transport, travel planning, routes

Procedia PDF Downloads 209
3839 Assessment of Memetic and Genetic Algorithm for a Flexible Integrated Logistics Network

Authors: E. Behmanesh, J. Pannek

Abstract:

The distribution-allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it is impossible to solve a distribution-allocation problem in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near-optimal solutions particularly for large scales test problems. This paper, presents an integrated supply chain model which is flexible in the delivery path. As the solution methodology, we apply a memetic algorithm with a novelty in population presentation. To illustrate the performance of the proposed memetic algorithm, LINGO optimization software serves as a comparison basis for small size problems. In large size cases that we are dealing with in the real world, the Genetic algorithm as the second metaheuristic algorithm is considered to compare the results and show the efficiency of the memetic algorithm.

Keywords: integrated logistics network, flexible path, memetic algorithm, genetic algorithm

Procedia PDF Downloads 349