Search results for: Ab initio heuristic modeling
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 4074

Search results for: Ab initio heuristic modeling

4044 Electronic and Optical Properties of Li₂S Antifluorite Material

Authors: Brahim Bahloul, Khatir Babesse, Azzedine Dkhira, Yacine Bahloul, Dalila Hammoutene

Abstract:

In this paper, we investigate with ab initio calculations some structural and optoelectronic properties of Li₂S compound. The structural and electronic properties of the Li₂S antifluorite structure have been studied by first-principles calculations within the density functional theory (DFT), whereas the optical properties have been obtained using empirical relationships such as the modified Moss relation. Our calculated lattice parameters are in good agreement with the experimental data and other theoretical calculations. The electronic band structures and density of states were obtained. The anti-fluorite Li₂S present an indirect band gap of 3.388 eV at equilibrium. The top of the valence bands reflects the p electronic character for both structures. The calculated energy gaps and optical constants are in good agreement with experimental measurements.

Keywords: Ab initio calculations, antifluorite, electronic properties, optical properties

Procedia PDF Downloads 259
4043 Theoretical and Experimental Study of Iron Oxide Thin Film

Authors: Fahima Djefaflia, M. Loutfi Benkhedir

Abstract:

The aim of this work was to development and characterisation of iron oxide thin films by spray pyrolysis technique. Influences of deposition parameters pile temperature on structural and optical properties have been studied Thin films are analysed by various techniques of materials. The structural characterization of films by analysis of spectra of X-ray diffraction showed that the films prepared at T=350,400,450 are crystalline and amorphous at T=300C. For particular condition, two phases hematiteFe2O3 and magnetite Fe3O4 have been observed.The UV-Visible spectrophotometer of this films confirms that it is possible to obtain films with a transmittance of about 15-30% in the visible range. In addition, this analysis allowed us to determine the optical gap and disorder of films. We conclude that the increase in temperature is accompanied by a reduction in the optical gap with increasing in disorder. An ab initio calculation for this phase shows that the results are in good agreement with the experimental results.

Keywords: spray pyrolysis technique, iron oxide, ab initio calculation, optical properties

Procedia PDF Downloads 530
4042 Modeling the Impact of Time Pressure on Activity-Travel Rescheduling Heuristics

Authors: Jingsi Li, Neil S. Ferguson

Abstract:

Time pressure could have an influence on the productivity, quality of decision making, and the efficiency of problem-solving. This has been mostly stemmed from cognitive research or psychological literature. However, a salient scarce discussion has been held for transport adjacent fields. It is conceivable that in many activity-travel contexts, time pressure is a potentially important factor since an excessive amount of decision time may incur the risk of late arrival to the next activity. The activity-travel rescheduling behavior is commonly explained by costs and benefits of factors such as activity engagements, personal intentions, social requirements, etc. This paper hypothesizes that an additional factor of perceived time pressure could affect travelers’ rescheduling behavior, thus leading to an impact on travel demand management. Time pressure may arise from different ways and is assumed here to be essentially incurred due to travelers planning their schedules without an expectation of unforeseen elements, e.g., transport disruption. In addition to a linear-additive utility-maximization model, the less computationally compensatory heuristic models are considered as an alternative to simulate travelers’ responses. The paper will contribute to travel behavior modeling research by investigating the following questions: how to measure the time pressure properly in an activity-travel day plan context? How do travelers reschedule their plans to cope with the time pressure? How would the importance of the activity affect travelers’ rescheduling behavior? What will the behavioral model be identified to describe the process of making activity-travel rescheduling decisions? How do these identified coping strategies affect the transport network? In this paper, a Mixed Heuristic Model (MHM) is employed to identify the presence of different choice heuristics through a latent class approach. The data about travelers’ activity-travel rescheduling behavior is collected via a web-based interactive survey where a fictitious scenario is created comprising multiple uncertain events on the activity or travel. The experiments are conducted in order to gain a real picture of activity-travel reschedule, considering the factor of time pressure. The identified behavioral models are then integrated into a multi-agent transport simulation model to investigate the effect of the rescheduling strategy on the transport network. The results show that an increased proportion of travelers use simpler, non-compensatory choice strategies instead of compensatory methods to cope with time pressure. Specifically, satisfying - one of the heuristic decision-making strategies - is adopted commonly since travelers tend to abandon the less important activities and keep the important ones. Furthermore, the importance of the activity is found to increase the weight of negative information when making trip-related decisions, especially route choices. When incorporating the identified non-compensatory decision-making heuristic models into the agent-based transport model, the simulation results imply that neglecting the effect of perceived time pressure may result in an inaccurate forecast of choice probability and overestimate the affectability to the policy changes.

Keywords: activity-travel rescheduling, decision making under uncertainty, mixed heuristic model, perceived time pressure, travel demand management

Procedia PDF Downloads 85
4041 Structural and Magnetic Properties of Mn-Doped 6H-SiC

Authors: M. Al Azri, M. Elzain, K. Bouziane, S. M. Chérif

Abstract:

n-Type 6H-SiC(0001) substrates were implanted with three fluencies of Mn+ 5x1015 Mn/cm2 (Mn content: 0.7%), 1x1016 (~2 %), and 5x1016 cm–2 (7%) with implantation energy of 80 keV and substrate temperature of 365ºC. The samples were characterized using Rutherford Backscattering and Channeling Spectroscopy (RBS/C), High-Resolution X-Ray Diffraction technique (HRXRD), micro-Raman Spectroscopy (μRS), and Superconducting Quantum Interference Device (SQUID) techniques. The aim of our work is to investigate implantation induced defects with dose and to study any correlation between disorder-composition and magnetic properties. In addition, ab-initio calculations were used to investigate the structural and magnetic properties of Mn-doped 6H-SiC. Various configurations of Mn sites and vacancy types were considered. The calculations showed that a substitutional Mn atom at Si site possesses larger magnetic moment than Mn atom at C site. A model is introduced to explain the dependence of the magnetic structure on site occupation. The magnetic properties of ferromagnetically (FM) and antiferromagnetically (AFM) coupled pairs of Mn atoms with and without neighboring vacancies have also been explored.

Keywords: ab-initio calculations, diluted magnetic semiconductors, magnetic properties, silicon carbide

Procedia PDF Downloads 287
4040 Personas Help Understand Users’ Needs, Goals and Desires in an Online Institutional Repository

Authors: Maha ALjohani, James Blustein

Abstract:

Communicating users' needs, goals and problems help designers and developers overcome challenges faced by end users. Personas are used to represent end users’ needs. In our research, creating personas allowed the following questions to be answered: Who are the potential user groups? What do they want to achieve by using the service? What are the problems that users face? What should the service provide to them? To develop realistic personas, we conducted a focus group discussion with undergraduate and graduate students and also interviewed a university librarian. The personas were created to help evaluating the Institutional Repository that is based on the DSpace system. The profiles helped to communicate users' needs, abilities, tasks, and problems, and the task scenarios used in the heuristic evaluation were based on these personas. Four personas resulted of a focus group discussion with undergraduate and graduate students and from interviewing a university librarian. We then used these personas to create focused task-scenarios for a heuristic evaluation on the system interface to ensure that it met users' needs, goals, problems and desires. In this paper, we present the process that we used to create the personas that led to devise the task scenarios used in the heuristic evaluation as a follow up study of the DSpace university repository.

Keywords: heuristic evaluation, institutional repositories, user experience, human computer interaction, user profiles, personas, task scenarios, heuristics

Procedia PDF Downloads 472
4039 Raman and FTIR Studies of Azobenzene: Experimental and Theoretical Approach

Authors: Gomti Devi

Abstract:

Photoisomerization has been attracting to researchers due to its wide range of applications in optical switches, polymeric chains, liquid-crystalline systems and bilayer membranes etc. Azobenzene is a photochromic molecule which exhibits a reversible isomerisation process between its trans and cis isomers of different stability. An investigation has been conducted of the effects of temperature on intensity and position of Raman band of N=N, C-N stretching modes of Azobenzene (AZBN). It was found that the N=N stretching mode of Raman band shape shifts to lower frequency region with the increase in temperature. The Raman intensity was also decreased with the increase of temperature. The change in bandwidth with the increase in temperature has been studied. The FTIR spectrum of the molecule is recorded so as to complement the Raman spectra. In order to investigate the possibility of undergoing dimerization and trimerization as well as the stability of this molecule, ab initio calculation for geometry optimization and vibrational wavenumber calculation have been performed. Theoretically calculated values are found in good agreement with the experimental results.

Keywords: azobenzene, temperature, ab-initio, frequency

Procedia PDF Downloads 312
4038 A Heuristic Based Decomposition Approach for a Hierarchical Production Planning Problem

Authors: Nusrat T. Chowdhury, M. F. Baki, A. Azab

Abstract:

The production planning problem is concerned with specifying the optimal quantities to produce in order to meet the demand for a prespecified planning horizon with the least possible expenditure. Making the right decisions in production planning will affect directly the performance and productivity of a manufacturing firm, which is important for its ability to compete in the market. Therefore, developing and improving solution procedures for production planning problems is very significant. In this paper, we develop a Dantzig-Wolfe decomposition of a multi-item hierarchical production planning problem with capacity constraint and present a column generation approach to solve the problem. The original Mixed Integer Linear Programming model of the problem is decomposed item by item into a master problem and a number of subproblems. The capacity constraint is considered as the linking constraint between the master problem and the subproblems. The subproblems are solved using the dynamic programming approach. We also propose a multi-step iterative capacity allocation heuristic procedure to handle any kind of infeasibility that arises while solving the problem. We compare the computational performance of the developed solution approach against the state-of-the-art heuristic procedure available in the literature. The results show that the proposed heuristic-based decomposition approach improves the solution quality by 20% as compared to the literature.

Keywords: inventory, multi-level capacitated lot-sizing, emission control, setup carryover

Procedia PDF Downloads 105
4037 A Rapid and Cost-Effective Approach to Manufacturing Modeling Platform for Fused Deposition Modeling

Authors: Chil-Chyuan Kuo, Chen-Hsuan Tsai

Abstract:

This study presents a cost-effective approach for rapid fabricating modeling platforms utilized in fused deposition modeling system. A small-batch production of modeling platforms about 20 pieces can be obtained economically through silicone rubber mold using vacuum casting without applying the plastic injection molding. The air venting systems is crucial for fabricating modeling platform using vacuum casting. Modeling platforms fabricated can be used for building rapid prototyping model after sandblasting. This study offers industrial value because it has both time-effectiveness and cost-effectiveness.

Keywords: vacuum casting, fused deposition modeling, modeling platform, sandblasting, surface roughness

Procedia PDF Downloads 353
4036 An Algorithm for the Map Labeling Problem with Two Kinds of Priorities

Authors: Noboru Abe, Yoshinori Amai, Toshinori Nakatake, Sumio Masuda, Kazuaki Yamaguchi

Abstract:

We consider the problem of placing labels of the points on a plane. For each point, its position, the size of its label and a priority are given. Moreover, several candidates of its label positions are prespecified, and each of such label positions is assigned a priority. The objective of our problem is to maximize the total sum of priorities of placed labels and their points. By refining a labeling algorithm that can use these priorities, we propose a new heuristic algorithm which is more suitable for treating the assigned priorities.

Keywords: map labeling, greedy algorithm, heuristic algorithm, priority

Procedia PDF Downloads 402
4035 The Layered Transition Metal Dichalcogenides as Materials for Storage Clean Energy: Ab initio Investigations

Authors: S. Meziane, H. I. Faraoun, C. Esling

Abstract:

Transition metal dichalcogenides have potential applications in power generation devices that convert waste heat into electric current by the so-called Seebeck and Hall effects thus providing an alternative energy technology to reduce the dependence on traditional fossil fuels. In this study, the thermoelectric properties of 1T and 2HTaX2 (X= S or Se) dichalcogenide superconductors have been computed using the semi-classical Boltzmann theory. Technologically, the task is to fabricate suitable materials with high efficiency. It is found that 2HTaS2 possesses the largest value of figure of merit ZT= 1.27 at 175 K. From a scientific point of view, we aim to model the underlying materials properties and in particular the transport phenomena as mediated by electrons and lattice vibrations responsible for superconductivity, Charge Density Waves (CDW) and metal/insulator transitions as function of temperature. The goal of the present work is to develop an understanding of the superconductivity of these selected materials using the transport properties at the fundamental level.

Keywords: Ab initio, High efficiency, Power generation devices, Transition metal dichalcogenides

Procedia PDF Downloads 168
4034 Bee Colony Optimization Applied to the Bin Packing Problem

Authors: Kenza Aida Amara, Bachir Djebbar

Abstract:

We treat the two-dimensional bin packing problem which involves packing a given set of rectangles into a minimum number of larger identical rectangles called bins. This combinatorial problem is NP-hard. We propose a pretreatment for the oriented version of the problem that allows the valorization of the lost areas in the bins and the reduction of the size problem. A heuristic method based on the strategy first-fit adapted to this problem is presented. We present an approach of resolution by bee colony optimization. Computational results express a comparison of the number of bins used with and without pretreatment.

Keywords: bee colony optimization, bin packing, heuristic algorithm, pretreatment

Procedia PDF Downloads 599
4033 Survey Paper on Graph Coloring Problem and Its Application

Authors: Prateek Chharia, Biswa Bhusan Ghosh

Abstract:

Graph coloring is one of the prominent concepts in graph coloring. It can be defined as a coloring of the various regions of the graph such that all the constraints are fulfilled. In this paper various graphs coloring approaches like greedy coloring, Heuristic search for maximum independent set and graph coloring using edge table is described. Graph coloring can be used in various real time applications like student time tabling generation, Sudoku as a graph coloring problem, GSM phone network.

Keywords: graph coloring, greedy coloring, heuristic search, edge table, sudoku as a graph coloring problem

Procedia PDF Downloads 511
4032 Standardized Description and Modeling Methods of Semiconductor IP Interfaces

Authors: Seongsoo Lee

Abstract:

IP reuse is an effective design methodology for modern SoC design to reduce effort and time. However, description and modeling methods of IP interfaces are different due to different IP designers. In this paper, standardized description and modeling methods of IP interfaces are proposed. It consists of 11 items such as IP information, model provision, data type, description level, interface information, port information, signal information, protocol information, modeling level, modeling information, and source file. The proposed description and modeling methods enables easy understanding, simulation, verification, and modification in IP reuse.

Keywords: interface, standardization, description, modeling, semiconductor IP

Procedia PDF Downloads 469
4031 Characterization of Group Dynamics for Fostering Mathematical Modeling Competencies

Authors: Ayse Ozturk

Abstract:

The study extends the prior research on modeling competencies by positioning students’ cognitive and language resources as the fundamentals for pursuing their own inquiry and expression lines through mathematical modeling. This strategy aims to answer the question that guides this study, “How do students’ group approaches to modeling tasks affect their modeling competencies over a unit of instruction?” Six bilingual tenth-grade students worked on open-ended modeling problems along with the content focused on quantities over six weeks. Each group was found to have a unique cognitive approach for solving these problems. Three different problem-solving strategies affected how the groups’ modeling competencies changed. The results provide evidence that the discussion around groups’ solutions, coupled with their reflections, advances group interpreting and validating competencies in the mathematical modeling process

Keywords: cognition, collective learning, mathematical modeling competencies, problem-solving

Procedia PDF Downloads 129
4030 Ab Initio Studies of Structural and Thermal Properties of Aluminum Alloys

Authors: M. Saadi, S. E. H. Abaidia, M. Y. Mokeddem.

Abstract:

We present the results of a systematic and comparative study of the bulk, the structural properties, and phonon calculations of aluminum alloys using several exchange–correlations functional theory (DFT) with different plane-wave basis pseudo potential techniques. Density functional theory implemented by the Vienna Ab Initio Simulation Package (VASP) technique is applied to calculate the bulk and the structural properties of several structures. The calculations were performed for within several exchange–correlation functional and pseudo pententials available in this code (local density approximation (LDA), generalized gradient approximation (GGA), projector augmented wave (PAW)). The lattice dynamic code “PHON” developed by Dario Alfè was used to calculate some thermodynamics properties and phonon dispersion relation frequency distribution of Aluminium alloys using the VASP LDA PAW and GGA PAW results. The bulk and structural properties of the calculated structures were compared to different experimental and calculated works.

Keywords: DFT, exchange-correlation functional, LDA, GGA, pseudopotential, PAW, VASP, PHON, phonon dispersion

Procedia PDF Downloads 452
4029 A Coordinate-Based Heuristic Route Search Algorithm for Delivery Truck Routing Problem

Authors: Ahmed Tarek, Ahmed Alveed

Abstract:

Vehicle routing problem is a well-known re-search avenue in computing. Modern vehicle routing is more focused with the GPS-based coordinate system, as the state-of-the-art vehicle, and trucking systems are equipped with digital navigation. In this paper, a new two dimensional coordinate-based algorithm for addressing the vehicle routing problem for a supply chain network is proposed and explored, and the algorithm is compared with other available, and recently devised heuristics. For the algorithms discussed, which includes the pro-posed coordinate-based search heuristic as well, the advantages and the disadvantages associated with the heuristics are explored. The proposed algorithm is studied from the stand point of a small supermarket chain delivery network that supplies to its stores in four different states around the East Coast area, and is trying to optimize its trucking delivery cost. Minimizing the delivery cost for the supply network of a supermarket chain is important to ensure its business success.

Keywords: coordinate-based optimal routing, Hamiltonian Circuit, heuristic algorithm, traveling salesman problem, vehicle routing problem

Procedia PDF Downloads 119
4028 Algorithms for Run-Time Task Mapping in NoC-Based Heterogeneous MPSoCs

Authors: M. K. Benhaoua, A. K. Singh, A. E. Benyamina, P. Boulet

Abstract:

Mapping parallelized tasks of applications onto these MPSoCs can be done either at design time (static) or at run-time (dynamic). Static mapping strategies find the best placement of tasks at design-time, and hence, these are not suitable for dynamic workload and seem incapable of runtime resource management. The number of tasks or applications executing in MPSoC platform can exceed the available resources, requiring efficient run-time mapping strategies to meet these constraints. This paper describes a new Spiral Dynamic Task Mapping heuristic for mapping applications onto NoC-based Heterogeneous MPSoC. This heuristic is based on packing strategy and routing Algorithm proposed also in this paper. Heuristic try to map the tasks of an application in a clustering region to reduce the communication overhead between the communicating tasks. The heuristic proposed in this paper attempts to map the tasks of an application that are most related to each other in a spiral manner and to find the best possible path load that minimizes the communication overhead. In this context, we have realized a simulation environment for experimental evaluations to map applications with varying number of tasks onto an 8x8 NoC-based Heterogeneous MPSoCs platform, we demonstrate that the new mapping heuristics with the new modified dijkstra routing algorithm proposed are capable of reducing the total execution time and energy consumption of applications when compared to state-of-the-art run-time mapping heuristics reported in the literature.

Keywords: multiprocessor system on chip, MPSoC, network on chip, NoC, heterogeneous architectures, run-time mapping heuristics, routing algorithm

Procedia PDF Downloads 453
4027 Tabu Search Algorithm for Ship Routing and Scheduling Problem with Time Window

Authors: Khaled Moh. Alhamad

Abstract:

This paper describes a tabu search heuristic for a ship routing and scheduling problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size.

Keywords: heuristic, scheduling, tabu search, transportation

Procedia PDF Downloads 478
4026 DNA-Polycation Condensation by Coarse-Grained Molecular Dynamics

Authors: Titus A. Beu

Abstract:

Many modern gene-delivery protocols rely on condensed complexes of DNA with polycations to introduce the genetic payload into cells by endocytosis. In particular, polyethyleneimine (PEI) stands out by a high buffering capacity (enabling the efficient condensation of DNA) and relatively simple fabrication. Realistic computational studies can offer essential insights into the formation process of DNA-PEI polyplexes, providing hints on efficient designs and engineering routes. We present comprehensive computational investigations of solvated PEI and DNA-PEI polyplexes involving calculations at three levels: ab initio, all-atom (AA), and coarse-grained (CG) molecular mechanics. In the first stage, we developed a rigorous AA CHARMM (Chemistry at Harvard Macromolecular Mechanics) force field (FF) for PEI on the basis of accurate ab initio calculations on protonated model pentamers. We validated this atomistic FF by matching the results of extensive molecular dynamics (MD) simulations of structural and dynamical properties of PEI with experimental data. In a second stage, we developed a CG MARTINI FF for PEI by Boltzmann inversion techniques from bead-based probability distributions obtained from AA simulations and ensuring an optimal match between the AA and CG structural and dynamical properties. In a third stage, we combined the developed CG FF for PEI with the standard MARTINI FF for DNA and performed comprehensive CG simulations of DNA-PEI complex formation and condensation. Various technical aspects which are crucial for the realistic modeling of DNA-PEI polyplexes, such as options of treating electrostatics and the relevance of polarizable water models, are discussed in detail. Massive CG simulations (with up to 500 000 beads) shed light on the mechanism and provide time scales for DNA polyplex formation independence of PEI chain size and protonation pattern. The DNA-PEI condensation mechanism is shown to primarily rely on the formation of DNA bundles, rather than by changes of the DNA-strand curvature. The gained insights are expected to be of significant help for designing effective gene-delivery applications.

Keywords: DNA condensation, gene-delivery, polyethylene-imine, molecular dynamics.

Procedia PDF Downloads 94
4025 An In-silico Pharmacophore-Based Anti-Viral Drug Development for Hepatitis C Virus

Authors: Romasa Qasim, G. M. Sayedur Rahman, Nahid Hasan, M. Shazzad Hosain

Abstract:

Millions of people worldwide suffer from Hepatitis C, one of the fatal diseases. Interferon (IFN) and ribavirin are the available treatments for patients with Hepatitis C, but these treatments have their own side-effects. Our research focused on the development of an orally taken small molecule drug targeting the proteins in Hepatitis C Virus (HCV), which has lesser side effects. Our current study aims to the Pharmacophore based drug development of a specific small molecule anti-viral drug for Hepatitis C Virus (HCV). Drug designing using lab experimentation is not only costly but also it takes a lot of time to conduct such experimentation. Instead in this in silico study, we have used computer-aided techniques to propose a Pharmacophore-based anti-viral drug specific for the protein domains of the polyprotein present in the Hepatitis C Virus. This study has used homology modeling and ab initio modeling for protein 3D structure generation followed by pocket identification in the proteins. Drug-able ligands for the pockets were designed using de novo drug design method. For ligand design, pocket geometry is taken into account. Out of several generated ligands, a new Pharmacophore is proposed, specific for each of the protein domains of HCV.

Keywords: pharmacophore-based drug design, anti-viral drug, in-silico drug design, Hepatitis C virus (HCV)

Procedia PDF Downloads 238
4024 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 545
4023 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 314
4022 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 498
4021 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 581
4020 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 156
4019 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 427
4018 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 306
4017 Bridging the Gap between Different Interfaces for Business Process Modeling

Authors: Katalina Grigorova, Kaloyan Mironov

Abstract:

The paper focuses on the benefits of business process modeling. Although this discipline is developing for many years, there is still necessity of creating new opportunities to meet the ever-increasing users’ needs. Because one of these needs is related to the conversion of business process models from one standard to another, the authors have developed a converter between BPMN and EPC standards using workflow patterns as intermediate tool. Nowadays there are too many systems for business process modeling. The variety of output formats is almost the same as the systems themselves. This diversity additionally hampers the conversion of the models. The presented study is aimed at discussing problems due to differences in the output formats of various modeling environments.

Keywords: business process modeling, business process modeling standards, workflow patterns, converting models

Procedia PDF Downloads 557
4016 An Approximation Algorithm for the Non Orthogonal Cutting Problem

Authors: R. Ouafi, F. Ouafi

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 518
4015 A Study of Transferable Strategies in Multilanguage Learning

Authors: Zixi You

Abstract:

With the demand of multilingual speakers increasing in the job market, multi-language learning programs have become more and more popular among undergraduate students. A study on multi-language learning strategies is therefore highly demanded on both practical and theoretical levels. Based on previous classification of learning strategies in SLA, and an investigation of BA Modern Language program students (with post-A level L2 and ab initio L3 learning experience from year one), this study explores and compares different types of learning strategies used by multi-language speakers and learners, transferable learning strategies between L2 and L3, and factors affecting the transfer. The results indicate that all the 23 types of learning strategies of L2 are employed when learning L3 from ab initio level, yet with different tendencies. Learning strategy transfer from L2 to L3 (i.e., the learners attribute the applying of these L3 learning strategies to be a direct result of their L2 learning experience) are observed in all 23 types of learning strategies. Comparatively, six types of “cognitive strategies” have higher transfer tendency than others. With regard to the failure of the transfer of some particular L2 strategies and the development of independent L3 strategies of individual learners, factors such as language proficiency, language typology and learning environment have played important roles among others. The presentation of this study will provide audiences with detailed data, insightful analysis and discussion on both theoretical and practical aspects of multi-language learning that will benefit both students and educators.

Keywords: learning strategy, multi-language acquisition, second language acquisition, strategy transfer

Procedia PDF Downloads 544