Search results for: heuristic procedures
1990 Dynamic Store Procedures in Database
Authors: Muhammet Dursun Kaya, Hasan Asil
Abstract:
In recent years, different methods have been proposed to optimize question processing in database. Although different methods have been proposed to optimize the query, but the problem which exists here is that most of these methods destroy the query execution plan after executing the query. This research attempts to solve the above problem by using a combination of methods of communicating with the database (the present questions in the programming code and using store procedures) and making query processing adaptive in database, and proposing a new approach for optimization of query processing by introducing the idea of dynamic store procedures. This research creates dynamic store procedures in the database according to the proposed algorithm. This method has been tested on applied software and results shows a significant improvement in reducing the query processing time and also reducing the workload of DBMS. Other advantages of this algorithm include: making the programming environment a single environment, eliminating the parametric limitations of the stored procedures in the database, making the stored procedures in the database dynamic, etc.Keywords: relational database, agent, query processing, adaptable, communication with the database
Procedia PDF Downloads 3721989 A New Heuristic Algorithm for Maximization Total Demands of Nodes and Number of Covered Nodes Simultaneously
Authors: Ehsan Saghehei, Mahdi Eghbali
Abstract:
The maximal covering location problem (MCLP) was originally developed to determine a set of facility locations which would maximize the total customers' demand serviced by the facilities within a predetermined critical service criterion. However, on some problems that differences between the demand nodes are covered or the number of nodes each node is large, the method of solving MCLP may ignore these differences. In this paper, Heuristic solution based on the ranking of demands in each node and the number of nodes covered by each node according to a predetermined critical value is proposed. The output of this method is to maximize total demands of nodes and number of covered nodes, simultaneously. Furthermore, by providing an example, the solution algorithm is described and its results are compared with Greedy and Lagrange algorithms. Also, the results of the algorithm to solve the larger problem sizes that compared with other methods are provided. A summary and future works conclude the paper.Keywords: heuristic solution, maximal covering location problem, ranking, set covering
Procedia PDF Downloads 5731988 A Low Power Consumption Routing Protocol Based on a Meta-Heuristics
Authors: Kaddi Mohammed, Benahmed Khelifa D. Benatiallah
Abstract:
A sensor network consists of a large number of sensors deployed in areas to monitor and communicate with each other through a wireless medium. The collected routing data in the network consumes most of the energy of the sensor nodes. For this purpose, multiple routing approaches have been proposed to conserve energy resource at the sensors and to overcome the challenges of its limitation. In this work, we propose a new low energy consumption routing protocol for wireless sensor networks based on a meta-heuristic methods. Our protocol is to operate more fairly energy when routing captured data to the base station.Keywords: WSN, routing, energy, heuristic
Procedia PDF Downloads 3431987 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 literatureKeywords: logistic, production, distribution, variable neighbourhood search
Procedia PDF Downloads 3371986 New Approach for Minimizing Wavelength Fragmentation in Wavelength-Routed WDM Networks
Authors: Sami Baraketi, Jean Marie Garcia, Olivier Brun
Abstract:
Wavelength Division Multiplexing (WDM) is the dominant transport technology used in numerous high capacity backbone networks, based on optical infrastructures. Given the importance of costs (CapEx and OpEx) associated to these networks, resource management is becoming increasingly important, especially how the optical circuits, called “lightpaths”, are routed throughout the network. This requires the use of efficient algorithms which provide routing strategies with the lowest cost. We focus on the lightpath routing and wavelength assignment problem, known as the RWA problem, while optimizing wavelength fragmentation over the network. Wavelength fragmentation poses a serious challenge for network operators since it leads to the misuse of the wavelength spectrum, and then to the refusal of new lightpath requests. In this paper, we first establish a new Integer Linear Program (ILP) for the problem based on a node-link formulation. This formulation is based on a multilayer approach where the original network is decomposed into several network layers, each corresponding to a wavelength. Furthermore, we propose an efficient heuristic for the problem based on a greedy algorithm followed by a post-treatment procedure. The obtained results show that the optimal solution is often reached. We also compare our results with those of other RWA heuristic methods.Keywords: WDM, lightpath, RWA, wavelength fragmentation, optimization, linear programming, heuristic
Procedia PDF Downloads 5271985 Joint Training Offer Selection and Course Timetabling Problems: Models and Algorithms
Authors: Gianpaolo Ghiani, Emanuela Guerriero, Emanuele Manni, Alessandro Romano
Abstract:
In this article, we deal with a variant of the classical course timetabling problem that has a practical application in many areas of education. In particular, in this paper we are interested in high schools remedial courses. The purpose of such courses is to provide under-prepared students with the skills necessary to succeed in their studies. In particular, a student might be under prepared in an entire course, or only in a part of it. The limited availability of funds, as well as the limited amount of time and teachers at disposal, often requires schools to choose which courses and/or which teaching units to activate. Thus, schools need to model the training offer and the related timetabling, with the goal of ensuring the highest possible teaching quality, by meeting the above-mentioned financial, time and resources constraints. Moreover, there are some prerequisites between the teaching units that must be satisfied. We first present a Mixed-Integer Programming (MIP) model to solve this problem to optimality. However, the presence of many peculiar constraints contributes inevitably in increasing the complexity of the mathematical model. Thus, solving it through a general purpose solver may be performed for small instances only, while solving real-life-sized instances of such model requires specific techniques or heuristic approaches. For this purpose, we also propose a heuristic approach, in which we make use of a fast constructive procedure to obtain a feasible solution. To assess our exact and heuristic approaches we perform extensive computational results on both real-life instances (obtained from a high school in Lecce, Italy) and randomly generated instances. Our tests show that the MIP model is never solved to optimality, with an average optimality gap of 57%. On the other hand, the heuristic algorithm is much faster (in about the 50% of the considered instances it converges in approximately half of the time limit) and in many cases allows achieving an improvement on the objective function value obtained by the MIP model. Such an improvement ranges between 18% and 66%.Keywords: heuristic, MIP model, remedial course, school, timetabling
Procedia PDF Downloads 6051984 Penguins Search Optimization Algorithm for Chaotic Synchronization System
Authors: Sofiane Bououden, Ilyes Boulkaibet
Abstract:
In terms of security of the information signal, the meta-heuristic Penguins Search Optimization Algorithm (PeSOA) is applied to synchronize chaotic encryption communications in the case of sensitive dependence on initial conditions in chaotic generator oscillator. The objective of this paper is the use of the PeSOA algorithm to exploring search space with random and iterative processes for synchronization of symmetric keys in both transmission and reception. Simulation results show the effectiveness of the PeSOA algorithm in generating symmetric keys of the encryption process and synchronizing.Keywords: meta-heuristic, PeSOA, chaotic systems, encryption, synchronization optimization
Procedia PDF Downloads 1951983 Heuristic Search Algorithm (HSA) for Enhancing the Lifetime of Wireless Sensor Networks
Authors: Tripatjot S. Panag, J. S. Dhillon
Abstract:
The lifetime of a wireless sensor network can be effectively increased by using scheduling operations. Once the sensors are randomly deployed, the task at hand is to find the largest number of disjoint sets of sensors such that every sensor set provides complete coverage of the target area. At any instant, only one of these disjoint sets is switched on, while all other are switched off. This paper proposes a heuristic search method to find the maximum number of disjoint sets that completely cover the region. A population of randomly initialized members is made to explore the solution space. A set of heuristics has been applied to guide the members to a possible solution in their neighborhood. The heuristics escalate the convergence of the algorithm. The best solution explored by the population is recorded and is continuously updated. The proposed algorithm has been tested for applications which require sensing of multiple target points, referred to as point coverage applications. Results show that the proposed algorithm outclasses the existing algorithms. It always finds the optimum solution, and that too by making fewer number of fitness function evaluations than the existing approaches.Keywords: coverage, disjoint sets, heuristic, lifetime, scheduling, Wireless sensor networks, WSN
Procedia PDF Downloads 4521982 Systems and Procedures in Indonesian Administrative Law
Authors: Andhika Danesjvara
Abstract:
Governance of the Republic of Indonesia should be based on the principle of sovereignty and the rule of law. Based on these principles, all forms of decisions and/or actions of government administration should be based on the sovereignty of the people and the law. Decisions and/or actions for citizens should be based on the provisions of the legislation and the general principles of good governance. Control of the decisions and/or actions is a part of administrative review and also judicial control. The control is part of the administrative justice system, which is intended for people affected by the decisions or administrative actions. This control is the duty and authority of the government or independent administrative court. Therefore, systems and procedures for the implementation of the task of governance and development must be regulated by law. Systems and procedures of governance is a subject studied in administrative law, therefore, the research also includes a review of the principles of law in administrative law. The administrative law procedure is important for the government to make decisions, the question is whether the procedures are part of the justice system itself.Keywords: administrative court, administrative justice, administrative law, administrative procedures
Procedia PDF Downloads 2851981 Two-Stage Flowshop Scheduling with Unsystematic Breakdowns
Authors: Fawaz Abdulmalek
Abstract:
The two-stage flowshop assembly scheduling problem is considered in this paper. There are more than one parallel machines at stage one and an assembly machine at stage two. The jobs will be processed into the flowshop based on Johnson rule and two extensions of Johnson rule. A simulation model of the two-stage flowshop is constructed where both machines at stage one are subject to random failures. Three simulation experiments will be conducted to test the effect of the three job ranking rules on the makespan. Johnson Largest heuristic outperformed both Johnson rule and Johnson Smallest heuristic for two performed experiments for all scenarios where each experiments having five scenarios.Keywords: flowshop scheduling, random failures, johnson rule, simulation
Procedia PDF Downloads 3391980 An Approximation Algorithm for the Non Orthogonal Cutting Problem
Abstract:
We study the problem of cutting a rectangular material entity into smaller sub-entities of trapezoidal forms with minimum waste of the material. This problem will be denoted TCP (Trapezoidal Cutting Problem). The TCP has many applications in manufacturing processes of various industries: pipe line design (petro chemistry), the design of airfoil (aeronautical) or cuts of the components of textile products. We introduce an orthogonal build to provide the optimal horizontal and vertical homogeneous strips. In this paper we develop a general heuristic search based upon orthogonal build. By solving two one-dimensional knapsack problems, we combine the horizontal and vertical homogeneous strips to give a non orthogonal cutting pattern.Keywords: combinatorial optimization, cutting problem, heuristic
Procedia PDF Downloads 5411979 Adaptive Swarm Balancing Algorithms for Rare-Event Prediction in Imbalanced Healthcare Data
Authors: Jinyan Li, Simon Fong, Raymond Wong, Mohammed Sabah, Fiaidhi Jinan
Abstract:
Clinical data analysis and forecasting have make great contributions to disease control, prevention and detection. However, such data usually suffer from highly unbalanced samples in class distributions. In this paper, we target at the binary imbalanced dataset, where the positive samples take up only the minority. We investigate two different meta-heuristic algorithms, particle swarm optimization and bat-inspired algorithm, and combine both of them with the synthetic minority over-sampling technique (SMOTE) for processing the datasets. One approach is to process the full dataset as a whole. The other is to split up the dataset and adaptively process it one segment at a time. The experimental results reveal that while the performance improvements obtained by the former methods are not scalable to larger data scales, the later one, which we call Adaptive Swarm Balancing Algorithms, leads to significant efficiency and effectiveness improvements on large datasets. We also find it more consistent with the practice of the typical large imbalanced medical datasets. We further use the meta-heuristic algorithms to optimize two key parameters of SMOTE. Leading to more credible performances of the classifier, and shortening the running time compared with the brute-force method.Keywords: Imbalanced dataset, meta-heuristic algorithm, SMOTE, big data
Procedia PDF Downloads 4411978 Genetic Algorithm for Solving the Flexible Job-Shop Scheduling Problem
Authors: Guilherme Baldo Carlos
Abstract:
The flexible job-shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which can be applied to model several applications in a wide array of industries. This problem will have its importance increase due to the shift in the production mode that modern society is going through. The demands are increasing and for products personalized and customized. This work aims to apply a meta-heuristic called a genetic algorithm (GA) to solve this problem. A GA is a meta-heuristic inspired by the natural selection of Charles Darwin; it produces a population of individuals (solutions) and selects, mutates, and mates the individuals through generations in order to find a good solution for the problem. The results found indicate that the GA is suitable for FJSP solving.Keywords: genetic algorithm, evolutionary algorithm, scheduling, flexible job-shop scheduling
Procedia PDF Downloads 1471977 Type A Quadricuspid Aortic Valve; Rarer than a Four-Leaf Clover, an Example of Availability Heuristic
Authors: Frazer Kirk, Rohen Skiba, Pankaj Saxena
Abstract:
The natural history of the QAV is poorly understood due to the exceeding rarity of the condition. Incidence rates vary between 0.00028-1%. Classically patients present with Aortic Regurgitation (AR) between 40-60 years of age experiencing palpitations, chest pain, or heart failure. (1, 2) Echocardiography is the mainstay of diagnosis for this condition; however, given the rarity of this condition, it can easily be overlooked, as demonstrated here. The case report that follows serves as a reminder of the condition to reduce the innate cognitive bias to overlook the diagnosis due to the availability heuristic. Intraoperative photography, echocardiographic and magnetic resonance imaging from this case for reference to demonstrate that while the diagnosis of Aortic regurgitation was recognized early, the valve morphology was underappreciated.Keywords: quadricuspid aortic valve, cardiac surgery, echocardiography, congenital
Procedia PDF Downloads 1621976 Cosmetic Dermatology Procedures: Survey Results of American Society for Dermatologic Surgery
Authors: Marina S. Basta, Kirollos S. Basta
Abstract:
Cosmetic dermatology procedures have witnessed exponential growth and diversification over the last 10 years. Thus, the purpose of this study was to collect data about the latest trends for cosmetic procedures reported by dermatologists during the year 2018. This study was performed by American Society for Dermatologic Surgery (ASDS) in 2018 through sending survey invitations to 3,358 practicing dermatologists in the U.S. containing streamline questions as well as statistical questions targeted to specific analysis of cosmetic dermatology trends. Out of the targeted physicians, only 596 dermatologists reply to the survey invitation (15% overall response rate). It was noted that data collected from that survey was generalized to represent all ASDS members. Results show that there is an increase in cosmetic dermatology procedures since 12.5 million procedures were reported for 2018 compared to only 7.8 million for 2012. Injectable neuromodulators and soft tissue fillers have topped the list with a 3.7 million procedure count. Body sculpting, chemical peeling, hair transplantation, and microneedling procedures were reported to be 1.57 million cases combined. Also, the top two procedures using laser were represented in wrinkle treatment as well as sun damage correction, while the lowest two trends for laser usage were for treatments of tattoos and birthmarks. Cryolipolysis was found to be at the head of body sculpting procedures with 287,435 cases, while tumescent liposuction was reported as the least performed body sculpting procedure (18,286 cases). In conclusion, comparing the procedural trends for the last 7 years has indicated that there has been a 78% increase in soft tissue filler treatment compared to 2012. In addition, it was further noted that laser procedures scored 74% increase in the last 7 years while body contouring procedures have had four folds increase in general compared to 2012.Keywords: cosmetic dermatology, ASDS procedure survey, laser, body sculpting
Procedia PDF Downloads 1241975 Phishing Detection: Comparison between Uniform Resource Locator and Content-Based Detection
Authors: Nuur Ezaini Akmar Ismail, Norbazilah Rahim, Norul Huda Md Rasdi, Maslina Daud
Abstract:
A web application is the most targeted by the attacker because the web application is accessible by the end users. It has become more advantageous to the attacker since not all the end users aware of what kind of sensitive data already leaked by them through the Internet especially via social network in shake on ‘sharing’. The attacker can use this information such as personal details, a favourite of artists, a favourite of actors or actress, music, politics, and medical records to customize phishing attack thus trick the user to click on malware-laced attachments. The Phishing attack is one of the most popular attacks for social engineering technique against web applications. There are several methods to detect phishing websites such as Blacklist/Whitelist based detection, heuristic-based, and visual similarity-based detection. This paper illustrated a comparison between the heuristic-based technique using features of a uniform resource locator (URL) and visual similarity-based detection techniques that compares the content of a suspected phishing page with the legitimate one in order to detect new phishing sites based on the paper reviewed from the past few years. The comparison focuses on three indicators which are false positive and negative, accuracy of the method, and time consumed to detect phishing website.Keywords: heuristic-based technique, phishing detection, social engineering and visual similarity-based technique
Procedia PDF Downloads 1771974 Protein Tertiary Structure Prediction by a Multiobjective Optimization and Neural Network Approach
Authors: Alexandre Barbosa de Almeida, Telma Woerle de Lima Soares
Abstract:
Protein structure prediction is a challenging task in the bioinformatics field. The biological function of all proteins majorly relies on the shape of their three-dimensional conformational structure, but less than 1% of all known proteins in the world have their structure solved. This work proposes a deep learning model to address this problem, attempting to predict some aspects of the protein conformations. Throughout a process of multiobjective dominance, a recurrent neural network was trained to abstract the particular bias of each individual multiobjective algorithm, generating a heuristic that could be useful to predict some of the relevant aspects of the three-dimensional conformation process formation, known as protein folding.Keywords: Ab initio heuristic modeling, multiobjective optimization, protein structure prediction, recurrent neural network
Procedia PDF Downloads 2051973 Reduction of Physician's Radiation Dose during Cardiac Catheterization Procedures Using Lead-Free Sterile Radiation Shields
Authors: Mohammad O. Diab, Sahera A. Saleh, Mustapha M. Dichari, Nijez Aloulou, Omar Hamoui, Feras Chehade
Abstract:
This study sought to evaluate the efficiency of lead-free sterile radiation shield (Radionex) in the reduction of physician's exposure dose during interventional cardiology procedures. Cardiac catheterization procedures are often associated with high radiation doses and high levels of secondary radiation emitted by the patient's body. This study compares physician exposure dose rate during cardiac catheterization procedures done through the femoral artery with sterile radiation shielding to same procedures made without the shielding. The mean operator radiation dose rate without using the shield was found to be 18.4µSv/min compared to a mean dose rate of 5.1 µSv/min when using the shield, rendering a reduction of 72.5% of radiation received by the physician. Sterile radiation shielding is consequently an effective addition to a cardiac catheterization lab radiation protection system.Keywords: cardiac catheterization, physician exposure dose, sterile radiation shielding, lead-free sterile radiation shields
Procedia PDF Downloads 5131972 Approximation Algorithms for Peak-Demand Reduction
Authors: Zaid Jamal Saeed Almahmoud
Abstract:
Smart grid is emerging as the future power grid, with smart techniques to optimize power consumption and electricity generation. Minimizing peak power consumption under a fixed delay requirement is a significant problem in the smart grid.For this problem, all appliances must be scheduled within a given finite time duration. We consider the problem of minimizing the peak demand under appliances constraints by scheduling power jobs with uniform release dates and deadlines. As the problem is known to be NP-hard, we analyze the performance of a version of the natural greedy heuristic for solving this problem. Our theoretical analysis and experimental results show that the proposed heuristic outperforms existing methods by providing a better approximation to the optimal solution.Keywords: peak demand scheduling, approximation algorithms, smart grid, heuristics
Procedia PDF Downloads 941971 Engineering Optimization Using Two-Stage Differential Evolution
Authors: K. Y. Tseng, C. Y. Wu
Abstract:
This paper employs a heuristic algorithm to solve engineering problems including truss structure optimization and optimal chiller loading (OCL) problems. Two different type algorithms, real-valued differential evolution (DE) and modified binary differential evolution (MBDE), are successfully integrated and then can obtain better performance in solving engineering problems. In order to demonstrate the performance of the proposed algorithm, this study adopts each one testing case of truss structure optimization and OCL problems to compare the results of other heuristic optimization methods. The result indicates that the proposed algorithm can obtain similar or better solution in comparing with previous studies.Keywords: differential evolution, Truss structure optimization, optimal chiller loading, modified binary differential evolution
Procedia PDF Downloads 1681970 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 3891969 Designing the Procedures of Building and Environment Management for Basic Education Schools by Using Quality Management
Authors: Suppara Charoenpoom
Abstract:
This study focuses on 1) a good-quality management procedures of buildings and environment in schools 2) designing the management procedures and 3) creating an operation manual for the procedures. This study is the combination of qualitative and quantitative research method. Populations in the research were 83 deans and directors of primary and secondary schools from the 10th educational district in Samut Songkram. Sample group was selected from the voluntary deans and directors. There were 14 participants in sample group. Research tools in this study were divided into 2 categories. The first one was data-collecting tools, which were in-depth interview and questionnaires. The second one was the designing tools to help creating management procedures: quality business, quality work procedure and key quality indicator of each activity in schools. All data were analyzed by mean and standard deviation. The result from this study has found out 1 effective process of building and environment management for basic education schools which is called Quality Business Process (QBP) and 7 Quality Work Procedures (QWP). In terms of academic feasibility checkup by experts, the research had shown that new design of building and environment management was approved unanimously. It means that new process of building and environment management in schools works very well and can be adapted. After examining the possibility of management process being used in schools by calculating the mean value among sample group (14 school deans and directors), the mean value was between 0.64-1.00. It means that the new design of building and environment management can be operated effectively in schools. For the satisfaction part, deans and school directors gave the satisfaction score in the highest level (Mean = 4.7372, S.D. = 0.4385).Keywords: buildings, environment, procedures, quality management
Procedia PDF Downloads 2331968 An Efficient Algorithm for Global Alignment of Protein-Protein Interaction Networks
Authors: Duc Dong Do, Ngoc Ha Tran, Thanh Hai Dang, Cao Cuong Dang, Xuan Huan Hoang
Abstract:
Global aligning two protein-protein interaction networks is an essentially important task in bioinformatics/computational biology field of study. It is a challenging and widely studied research topic in recent years. Accurately aligned networks allow us to identify functional modules of proteins and/ororthologous proteins from which unknown functions of a protein can be inferred. We here introduce a novel efficient heuristic global network alignment algorithm called FASTAn, including two phases: the first to construct an initial alignment and the second to improve such alignment by exerting a local optimization repeated procedure. The experimental results demonstrated that FASTAn outperformed the state-of-the-art global network alignment algorithm namely SPINAL in terms of both commonly used objective scores and the run-time.Keywords: FASTAn, Heuristic algorithm, biological network alignment, protein-protein interaction networks
Procedia PDF Downloads 6041967 Efficient Heuristic Algorithm to Speed Up Graphcut in Gpu for Image Stitching
Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran
Abstract:
GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm
Procedia PDF Downloads 1321966 The Whale Optimization Algorithm and Its Implementation in MATLAB
Authors: S. Adhirai, R. P. Mahapatra, Paramjit Singh
Abstract:
Optimization is an important tool in making decisions and in analysing physical systems. In mathematical terms, an optimization problem is the problem of finding the best solution from among the set of all feasible solutions. The paper discusses the Whale Optimization Algorithm (WOA), and its applications in different fields. The algorithm is tested using MATLAB because of its unique and powerful features. The benchmark functions used in WOA algorithm are grouped as: unimodal (F1-F7), multimodal (F8-F13), and fixed-dimension multimodal (F14-F23). Out of these benchmark functions, we show the experimental results for F7, F11, and F19 for different number of iterations. The search space and objective space for the selected function are drawn, and finally, the best solution as well as the best optimal value of the objective function found by WOA is presented. The algorithmic results demonstrate that the WOA performs better than the state-of-the-art meta-heuristic and conventional algorithms.Keywords: optimization, optimal value, objective function, optimization problems, meta-heuristic optimization algorithms, Whale Optimization Algorithm, implementation, MATLAB
Procedia PDF Downloads 3711965 An Investigation into the Use of an Atomistic, Hermeneutic, Holistic Approach in Education Relating to the Architectural Design Process
Authors: N. Pritchard
Abstract:
Within architectural education, students arrive fore-armed with; their life-experience; knowledge gained from subject-based learning; their brains and more specifically their imaginations. The learning-by-doing that they embark on in studio-based/project-based learning calls for supervision that allows the student to proactively undertake research and experimentation with design solution possibilities. The degree to which this supervision includes direction is subject to debate and differing opinion. It can be argued that if the student is to learn-by-doing, then design decision making within the design process needs to be instigated and owned by the student so that they have the ability to personally reflect on and evaluate those decisions. Within this premise lies the problem that the student's endeavours can become unstructured and unfocused as they work their way into a new and complex activity. A resultant weakness can be that the design activity is compartmented and not holistic or comprehensive, and therefore, the student's reflections are consequently impoverished in terms of providing a positive, informative feedback loop. The construct proffered in this paper is that a supportive 'armature' or 'Heuristic-Framework' can be developed that facilitates a holistic approach and reflective learning. The normal explorations of architectural design comprise: Analysing the site and context, reviewing building precedents, assimilating the briefing information. However, the student can still be compromised by 'not knowing what they need to know'. The long-serving triad 'Firmness, Commodity and Delight' provides a broad-brush framework of considerations to explore and integrate into good design. If this were further atomised in subdivision formed from the disparate aspects of architectural design that need to be considered within the design process, then the student could sieve through the facts more methodically and reflectively in terms of considering their interrelationship conflict and alliances. The words facts and sieve hold the acronym of the aspects that form the Heuristic-Framework: Function, Aesthetics, Context, Tectonics, Spatial, Servicing, Infrastructure, Environmental, Value and Ecological issues. The Heuristic could be used as a Hermeneutic Model with each aspect of design being focused on and considered in abstraction and then considered in its relation to other aspect and the design proposal as a whole. Importantly, the heuristic could be used as a method for gathering information and enhancing the design brief. The more poetic, mysterious, intuitive, unconscious processes should still be able to occur for the student. The Heuristic-Framework should not be seen as comprehensive prescriptive formulaic or inhibiting to the wide exploration of possibilities and solutions within the architectural design process.Keywords: atomistic, hermeneutic, holistic, approach architectural design studio education
Procedia PDF Downloads 2601964 Public Perception and Willingness to Undergo Cosmetic Procedures during COVID-19 Pandemic: A Questionnaire-Based Study Applied to Asymptomatic Individuals
Authors: Ibrahim Alreshidi, Aseel Albrekeit, Ruaa Alharthi
Abstract:
Background: As a result of the spread of COVID-19 at the beginning of 2020, many governments, including Saudi Arabia, have suspended operations in many agencies. Most dermatologists have restricted their practice, including cosmetic procedures, to ensure social distancing. On the 7th of May 2020, Saudi authorities reduced the restriction of COVID-19 virus preventative measures, allowing clinics to start accepting patients following the ministry of health protocols. Objectives: Evaluation of the public's perception and willingness to undergo cosmetic procedures during COVID-19 outbreaks in Saudi Arabia. Materials and methods: A descriptive, cross-sectional, questionnaire-based study was carried out among the individuals who lack typical symptoms of COVID-19 infection in Saudi Arabia. A self-designed web-based questionnaire was developed; content face validity and a pilot study were done. The questionnaire was distributed electronically from the 8th of May until the 31st of May 2020. Results: A total of 656 individuals who lack typical symptoms of COVID-19 infection were included in this analysis. Only 10.5% of participants expressed their will to do cosmetic procedures during the COVID-19 pandemic. More than 90% of the participants believed that the COVID-19 pandemic was either somewhat serious (52.9%) or very serious (38.7%). The willingness to do cosmetic procedures during the COVID-19 pandemic remained unaltered when the price was discounted (p<0.001) and when infection control measures were ensured (p<0.001). Conclusion: The COVID-19 pandemic had a negative impact on the practice of cosmetic dermatology. Fear of transferring the infection to a beloved home member is the main reason to avoid these procedures. Generating well-structured safety guidelines to decrease the risk of this unusual virus transmission in dermatology practice and creating financial incentives may help increase the public willingness to do these cosmetic procedures during this pandemic.Keywords: COVID-19 pandemic, cosmetic procedures, questionnaire, dermatology
Procedia PDF Downloads 1821963 The Effectiveness of Video Modeling Procedures on Request an Item Behavior Children with Autism Spectrum Disorders
Authors: Melih Cattik
Abstract:
The present study investigate effectiveness of video modeling procedures on request an item behavior of children with ASD. Two male and a female children with ASD participated in the study. A multiple baseline across participant single-subject design was used to evaluate the effects of the video modeling procedures on request an item behavior. During baseline, no prompts were presented to participants. In the intervention phase, the teacher gave video model to the participant and than created opportunity for request an item to him/her. When the first participant reached to criterion, the second participant began intervention. This procedure continued till all participants completed intervention. Finally, all three participants learned to request an item behavior. Based upon findings of this study, it will make suggestions to future researches.Keywords: autism spectrum disorders, video modeling procedures, request an item behavior, single subject design
Procedia PDF Downloads 4091962 Evaluating the Radiation Dose Involved in Interventional Radiology Procedures
Authors: Kholood Baron
Abstract:
Radiologic interventional studies use fluoroscopy imaging guidance to perform both diagnostic and therapeutic procedures. These could result in high radiation doses being delivered to the patients and also to the radiology team. This is due to the prolonged fluoroscopy time and the large number of images taken, even when dose-minimizing techniques and modern fluoroscopic tools are applied. Hence, these procedures are part of the everyday routine of interventional radiology doctors, assistant nurses, and radiographers. Thus, it is important to estimate the radiation exposure dose they received in order to give objective advice and reduce both patient and radiology team radiation exposure dose. The aim of this study was to find out the total radiation dose reaching the radiologist and the patient during an interventional procedure and to determine the impact of certain parameters on the patient dose. Method: The radiation dose was measured by TLD devices (thermoluminescent dosimeter; radiation dosimeter device). Physicians, patients, nurses, and radiographers wore TLDs during 12 interventional radiology procedures performed in two hospitals, Mubarak and Chest Hospital. This study highlights the need for interventional radiologists to be mindful of the radiation doses received by both patients and medical staff during interventional radiology procedures. The findings emphasize the impact of factors such as fluoroscopy duration and the number of images taken on the patient dose. By raising awareness and providing insights into optimizing techniques and protective measures, this research contributes to the overall goal of reducing radiation doses and ensuring the safety of patients and medical staff.Keywords: dosimetry, radiation dose, interventional radiology procedures, patient radiation dose
Procedia PDF Downloads 1111961 Model and Algorithm for Dynamic Wireless Electric Vehicle Charging Network Design
Authors: Trung Hieu Tran, Jesse O'Hanley, Russell Fowler
Abstract:
When in-wheel wireless charging technology for electric vehicles becomes mature, a need for such integrated charging stations network development is essential. In this paper, we thus investigate the optimisation problem of in-wheel wireless electric vehicle charging network design. A mixed-integer linear programming model is formulated to solve into optimality the problem. In addition, a meta-heuristic algorithm is proposed for efficiently solving large-sized instances within a reasonable computation time. A parallel computing strategy is integrated into the algorithm to speed up its computation time. Experimental results carried out on the benchmark instances show that our model and algorithm can find the optimal solutions and their potential for practical applications.Keywords: electric vehicle, wireless charging station, mathematical programming, meta-heuristic algorithm, parallel computing
Procedia PDF Downloads 79