Search results for: Evolutionary programming
347 From Modeling of Data Structures towards Automatic Programs Generating
Authors: Valentin P. Velikov
Abstract:
Automatic program generation saves time, human resources, and allows receiving syntactically clear and logically correct modules. The 4-th generation programming languages are related to drawing the data and the processes of the subject area, as well as, to obtain a frame of the respective information system. The application can be separated in interface and business logic. That means, for an interactive generation of the needed system to be used an already existing toolkit or to be created a new one.Keywords: Computer science, graphical user interface, user dialog interface, dialog frames, data modeling, subject area modeling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1444346 A New Spectral-based Approach to Query-by-Humming for MP3 Songs Database
Authors: Leon Fu, Xiangyang Xue
Abstract:
In this paper, we propose a new approach to query-by-humming, focusing on MP3 songs database. Since MP3 songs are much more difficult in melody representation than symbolic performance data, we adopt to extract feature descriptors from the vocal sounds part of the songs. Our approach is based on signal filtering, sub-band spectral processing, MDCT coefficients analysis and peak energy detection by ignorance of the background music as much as possible. Finally, we apply dual dynamic programming algorithm for feature similarity matching. Experiments will show us its online performance in precision and efficiency. Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1781345 Logic Program for Authorizations
Authors: Yun Bai
Abstract:
As a security mechanism, authorization is to provide access control to the system resources according to the polices and rules specified by the security strategies. Either by update or in the initial specification, conflicts in authorization is an issue needs to be solved. In this paper, we propose a new approach to solve conflict by using prioritized logic programs and discuss the uniqueness of its answer set. Addressing conflict resolution from logic programming viewpoint and the uniqueness analysis of the answer set provide a novel, efficient approach for authorization conflict resolution.
Keywords: authorization, formal specification, conflict resolution, prioritized logic program.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1526344 IIR Filter design with Craziness based Particle Swarm Optimization Technique
Authors: Suman Kumar Saha, Rajib Kar, Durbadal Mandal, S. P. Ghoshal
Abstract:
This paper demonstrates the application of craziness based particle swarm optimization (CRPSO) technique for designing the 8th order low pass Infinite Impulse Response (IIR) filter. CRPSO, the much improved version of PSO, is a population based global heuristic search algorithm which finds near optimal solution in terms of a set of filter coefficients. Effectiveness of this algorithm is justified with a comparative study of some well established algorithms, namely, real coded genetic algorithm (RGA) and particle swarm optimization (PSO). Simulation results affirm that the proposed algorithm CRPSO, outperforms over its counterparts not only in terms of quality output i.e. sharpness at cut-off, pass band ripple, stop band ripple, and stop band attenuation but also in convergence speed with assured stability.
Keywords: IIR Filter, RGA, PSO, CRPSO, Evolutionary Optimization Techniques, Low Pass (LP) Filter, Magnitude Response, Pole-Zero Plot, Stability.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2576343 Multi-Scale Urban Spatial Evolution Analysis Based on Space Syntax: A Case Study in Modern Yangzhou, China
Authors: Dai Zhimei, Hua Chen
Abstract:
The exploration of urban spatial evolution is an important part of urban development research. Therefore, the evolutionary modern Yangzhou urban spatial texture was taken as the research object, and Spatial Syntax was used as the main research tool, this paper explored Yangzhou spatial evolution law and its driving factors from the urban street network scale, district scale and street scale. The study has concluded that at the urban scale, Yangzhou urban spatial evolution is the result of a variety of causes, including physical and geographical condition, policy and planning factors, and traffic conditions, and the evolution of space also has an impact on social, economic, environmental and cultural factors. At the district and street scales, changes in space will have a profound influence on the history of the city and the activities of people. At the end of the article, the matters needing attention during the evolution of urban space were summarized.
Keywords: Space Syntax, spatial texture, urban space, Yangzhou.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 780342 Optimum Design of Trusses by Cuckoo Search
Authors: M. Saravanan, J. Raja Murugadoss, V. Jayanthi
Abstract:
Optimal design of structure has a main role in reduction of material usage which leads to deduction in the final cost of construction projects. Evolutionary approaches are found to be more successful techniques for solving size and shape structural optimization problem since it uses a stochastic random search instead of a gradient search. By reviewing the recent literature works the problem found was the optimization of weight. A new meta-heuristic algorithm called as Cuckoo Search (CS) Algorithm has used for the optimization of the total weight of the truss structures. This paper has used set of 10 bars and 25 bars trusses for the testing purpose. The main objective of this work is to reduce the number of iterations, weight and the total time consumption. In order to demonstrate the effectiveness of the present method, minimum weight design of truss structures is performed and the results of the CS are compared with other algorithms.
Keywords: Cuckoo search algorithm, levy’s flight, meta-heuristic, optimal weight.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2105341 Evolved Disease Avoidance Mechanisms, Generalized Prejudice, Modern Attitudes towards Individuals with Intellectual Disability
Authors: Campbell Townsend, David Hamilton
Abstract:
Previous research has demonstrated that negative attitudes towards people with physical disabilities and obesity are predicted by a component of perceived vulnerability to disease; germ aversion. These findings have been suggested as illustrations of an evolved but over-active mechanism which promotes the avoidance of pathogen-carrying individuals. To date, this interpretation of attitude formation has not been explored with regard to people with intellectual disability, and no attempts have been made to examine possible mediating factors. This study examined attitudes in 333 adults and demonstrated that the moderate positive relationship between germ aversion and negative attitudes toward people with intellectual disability is fully mediated by social dominance orientation, a general preference for hierarchies and inequalities among social groups. These findings have implications for the design of programs which attempt to promote community acceptance and inclusion of people with disabilities.Keywords: avoidance, evolutionary psychology, intellectual disability, prejudice
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1931340 Evolutionary Eigenspace Learning using CCIPCA and IPCA for Face Recognition
Authors: Ghazy M.R. Assassa, Mona F. M. Mursi, Hatim A. Aboalsamh
Abstract:
Traditional principal components analysis (PCA) techniques for face recognition are based on batch-mode training using a pre-available image set. Real world applications require that the training set be dynamic of evolving nature where within the framework of continuous learning, new training images are continuously added to the original set; this would trigger a costly continuous re-computation of the eigen space representation via repeating an entire batch-based training that includes the old and new images. Incremental PCA methods allow adding new images and updating the PCA representation. In this paper, two incremental PCA approaches, CCIPCA and IPCA, are examined and compared. Besides, different learning and testing strategies are proposed and applied to the two algorithms. The results suggest that batch PCA is inferior to both incremental approaches, and that all CCIPCAs are practically equivalent.Keywords: Candid covariance-free incremental principal components analysis (CCIPCA), face recognition, incremental principal components analysis (IPCA).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1822339 DNA Computing for an Absolute 1-Center Problem: An Evolutionary Approach
Authors: Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki Khalid
Abstract:
Deoxyribonucleic Acid or DNA computing has emerged as an interdisciplinary field that draws together chemistry, molecular biology, computer science and mathematics. Thus, in this paper, the possibility of DNA-based computing to solve an absolute 1-center problem by molecular manipulations is presented. This is truly the first attempt to solve such a problem by DNA-based computing approach. Since, part of the procedures involve with shortest path computation, research works on DNA computing for shortest path Traveling Salesman Problem, in short, TSP are reviewed. These approaches are studied and only the appropriate one is adapted in designing the computation procedures. This DNA-based computation is designed in such a way that every path is encoded by oligonucleotides and the path-s length is directly proportional to the length of oligonucleotides. Using these properties, gel electrophoresis is performed in order to separate the respective DNA molecules according to their length. One expectation arise from this paper is that it is possible to verify the instance absolute 1-center problem using DNA computing by laboratory experiments.Keywords: DNA computing, operation research, 1-center problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1462338 Considering Assembly Operations and Product Structure for Manufacturing Cell Formation
Authors: M.B. Aryanezhad, J. Aliabadi
Abstract:
This paper considers the integration of assembly operations and product structure to Cellular Manufacturing System (CMS) design so that to correct the drawbacks of previous researches in the literature. For this purpose, a new mathematical model is developed which dedicates machining and assembly operations to manufacturing cells while the objective function is to minimize the intercellular movements resulting due to both of them. A linearization method is applied to achieve optimum solution through solving aforementioned nonlinear model by common programming language such as Lingo. Then, using different examples and comparing the results, the importance of integrating assembly considerations is demonstrated.Keywords: Assembly operations and Product structure, CellFormation, Genetic Algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1586337 How Social Network Structure Affects the Dynamics of Evolution of Cooperation?
Authors: Mohammad Akbarpour, Reza Nasiri Mahalati, Caro Lucas
Abstract:
The existence of many biological systems, especially human societies, is based on cooperative behavior [1, 2]. If natural selection favors selfish individuals, then what mechanism is at work that we see so many cooperative behaviors? One answer is the effect of network structure. On a graph, cooperators can evolve by forming network bunches [2, 3, 4]. In a research, Ohtsuki et al used the idea of iterated prisoners- dilemma on a graph to model an evolutionary game. They showed that the average number of neighbors plays an important role in determining whether cooperation is the ESS of the system or not [3]. In this paper, we are going to study the dynamics of evolution of cooperation in a social network. We show that during evolution, the ratio of cooperators among individuals with fewer neighbors to cooperators among other individuals is greater than unity. The extent to which the fitness function depends on the payoff of the game determines this ratio.Keywords: Evolution of cooperation, Iterated prisoner's dilemma, Model dynamics, Social network structure, Intensity of selection.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1356336 Recurrent Radial Basis Function Network for Failure Time Series Prediction
Authors: Ryad Zemouri, Paul Ciprian Patic
Abstract:
An adaptive software reliability prediction model using evolutionary connectionist approach based on Recurrent Radial Basis Function architecture is proposed. Based on the currently available software failure time data, Fuzzy Min-Max algorithm is used to globally optimize the number of the k Gaussian nodes. The corresponding optimized neural network architecture is iteratively and dynamically reconfigured in real-time as new actual failure time data arrives. The performance of our proposed approach has been tested using sixteen real-time software failure data. Numerical results show that our proposed approach is robust across different software projects, and has a better performance with respect to next-steppredictability compared to existing neural network model for failure time prediction.Keywords: Neural network, Prediction error, Recurrent RadialBasis Function Network, Reliability prediction.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1819335 A Pattern Language for Software Debugging
Authors: Mehdi Amoui, Mohammad Zarafshan, Caro Lucas
Abstract:
In spite of all advancement in software testing, debugging remains a labor-intensive, manual, time consuming, and error prone process. A candidate solution to enhance debugging process is to fuse it with testing process. To achieve this integration, a possible solution may be categorizing common software tests and errors followed by the effort on fixing the errors through general solutions for each test/error pair. Our approach to address this issue is based on Christopher Alexander-s pattern and pattern language concepts. The patterns in this language are grouped into three major sections and connect the three concepts of test, error, and debug. These patterns and their hierarchical relationship shape a pattern language that introduces a solution to solve software errors in a known testing context. Finally, we will introduce our developed framework ADE as a sample implementation to support a pattern of proposed language, which aims to automate the whole process of evolving software design via evolutionary methods.Keywords: Coding Errors, Software debugging, Testing, Patterns, Pattern Language
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1411334 Phylogenetic Inference from 18S rRNA Gene Sequences of Horseshoe Crabs, Tachypleus gigas between Tanjung Dawai, Kedah and Cherating, Pahang, Peninsular Malaysia
Authors: Ismail, N., Sarijan, S
Abstract:
The phylogenetic analysis using the most conservative portions of 18S rRNA gene revealed the phylogenetic relationship among the two populations where DNA divergence showed that the nucleotides diversity value were -0.00838 for the Tanjung Dawai, Kedah and -0.00708 for the Cherating, Pahang populations respectively. The net nucleotide divergence among populations (Da) was -0.0073 indicating a low polymorphism among the populations studied. Total number of mutations in the Tanjung Dawai, Kedah samples was higher than Cherating, Pahang samples, which are 73 and 59 respectively while shared mutations across the populations were 8, and reveal the evolutionary in the genome of Malaysian T. gigas. The tree topology of both populations inferred using Neigbour-joining method by comparing 1791 bp of partial 18S rRNA sequence revealed that T. gigas haplotypes were clustered into seven clades, suggesting that they are genetically diverse among populations which derived from a common ancestor.Keywords: Horseshoe crabs, Tachypleus gigas, 18S rRNA genesequences, phylogenetic analysis
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1843333 Microwave LNA Design Based On Adaptive Network Fuzzy Inference and Evolutionary Optimization
Authors: Samad Nejatian, Vahideh Rezaie, Vahid Asadpour
Abstract:
This paper presents a novel approach for the design of microwave circuits using Adaptive Network Fuzzy Inference Optimizer (ANFIO). The method takes advantage of direct synthesis of subsections of the amplifier using very fast and accurate ANFIO models based on exact simulations using ADS. A mapping from course space to fine space known as space mapping is also used. The proposed synthesis approach takes into account the noise and scattering parameters due to parasitic elements to achieve optimal results. The overall ANFIO system is capable of designing different LNAs at different noise and scattering criteria. This approach offers significantly reduced time in the design of microwave amplifiers within the validity range of the ANFIO system. The method has been proven to work efficiently for a 2.4GHz LNA example. The S21 of 10.1 dB and noise figure (NF) of 2.7 dB achieved for ANFIO while S21 of 9.05 dB and NF of 2.6 dB achieved for ANN.Keywords: fuzzy system, low noise amplifier, microwaveamplifier, space mapping
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1796332 Minimizing Fresh and Wastewater Using Water Pinch Technique in Petrochemical Industries
Authors: W. Mughees, M. Al-Ahmad, M. Naeem
Abstract:
This research involves the design and analysis of pinch-based water/wastewater networks to minimize water utility in the petrochemical and petroleum industries. A study has been done on Tehran Oil Refinery to analyze feasibilities of regeneration, reuse and recycling of water network. COD is considered as a single key contaminant. Amount of freshwater was reduced about 149m3/h (43.8%) regarding COD. Re-design (or retrofitting) of water allocation in the networks was undertaken. The results were analyzed through graphical method and mathematical programming technique which clearly demonstrated that amount of required water would be determined by mass transfer of COD.
Keywords: Minimization, Water Pinch, Water Management, Pollution Prevention.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3934331 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, expectation maximization, initial, objective function clustering.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1295330 Simulation of Inverter Fed Induction Motor Drive with LabVIEW
Authors: R. Gunabalan, S. Immanuel Prabakaran, J. Reegan, S. Ganesh
Abstract:
This paper describes a software approach for modeling inverter fed induction motor drive using Laboratory Virtual Instrument Engineering Workbench (LabVIEW). The reason behind the selection of LabVIEW software is because of its strong graphical interface, flexibility of its programming language combined with built-in tools designed specifically for test, measurement and control. LabVIEW is generally used in most of the applications for data acquisition, test and control. In this paper, inverter and induction motor are modeled using LabVIEW toolkits. Simulation results are presented and are validated.
Keywords: Induction motor, LabVIEW, State model.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 8576329 Approximate Solution of Nonlinear Fredholm Integral Equations of the First Kind via Converting to Optimization Problems
Authors: Akbar H. Borzabadi, Omid S. Fard
Abstract:
In this paper we introduce an approach via optimization methods to find approximate solutions for nonlinear Fredholm integral equations of the first kind. To this purpose, we consider two stages of approximation. First we convert the integral equation to a moment problem and then we modify the new problem to two classes of optimization problems, non-constraint optimization problems and optimal control problems. Finally numerical examples is proposed.Keywords: Fredholm integral equation, Optimization method, Optimal control, Nonlinear and linear programming
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1774328 On a New Inverse Polynomial Numerical Scheme for the Solution of Initial Value Problems in Ordinary Differential Equations
Authors: R. B. Ogunrinde
Abstract:
This paper presents the development, analysis and implementation of an inverse polynomial numerical method which is well suitable for solving initial value problems in first order ordinary differential equations with applications to sample problems. We also present some basic concepts and fundamental theories which are vital to the analysis of the scheme. We analyzed the consistency, convergence, and stability properties of the scheme. Numerical experiments were carried out and the results compared with the theoretical or exact solution and the algorithm was later coded using MATLAB programming language.Keywords: Differential equations, Numerical, Initial value problem, Polynomials.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1773327 Distribution Centers Reliability Cost in Capacitated Facility Location Problem
Authors: Mehdi Seifbarghy, Sajjad Jalali, Seyed Habib A. Rahmati
Abstract:
Recently studies in area of supply chain network (SCN) have focused on the disruption issues in distribution systems. Also this paper extends the previous literature by providing a new biobjective model for cost minimization of designing a three echelon SCN across normal and failure scenarios with considering multi capacity option for manufacturers and distribution centers. Moreover, in order to solve the problem by means of LINGO software, novel model will be reformulated through a branch of LP-Metric method called Min-Max approach.Keywords: Scenario programming, Distribution, Multi-echelon supply chain design, Reliable facility
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1745326 Identification of Optimum Parameters of Deep Drawing of a Cylindrical Workpiece using Neural Network and Genetic Algorithm
Authors: D. Singh, R. Yousefi, M. Boroushaki
Abstract:
Intelligent deep-drawing is an instrumental research field in sheet metal forming. A set of 28 different experimental data have been employed in this paper, investigating the roles of die radius, punch radius, friction coefficients and drawing ratios for axisymmetric workpieces deep drawing. This paper focuses an evolutionary neural network, specifically, error back propagation in collaboration with genetic algorithm. The neural network encompasses a number of different functional nodes defined through the established principles. The input parameters, i.e., punch radii, die radii, friction coefficients and drawing ratios are set to the network; thereafter, the material outputs at two critical points are accurately calculated. The output of the network is used to establish the best parameters leading to the most uniform thickness in the product via the genetic algorithm. This research achieved satisfactory results based on demonstration of neural networks.
Keywords: Deep-drawing, Neural network, Genetic algorithm, Sheet metal forming.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2203325 A Study of the Change of Damping Coefficient Regarding Minimum Displacement
Authors: Tawiwat V., Narongkorn D., Auttapoom L.
Abstract:
This research proposes the change of damping coefficient regarding minimum displacement. From the mass with external forced and damper problem, when is the constant external forced transmitted to the understructure in the difference angle between 30 and 60 degrees. This force generates the vibration as general known; however, the objective of this problem is to have minimum displacement. As the angle is changed and the goal is the same; therefore, the damper of the system must be varied while keeping constant spring stiffness. The problem is solved by using nonlinear programming and the suitable changing of the damping coefficient is provided.
Keywords: Damping coefficient, Optimal control, Minimum Displacement and Vibration
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1342324 Transformation of Course Timetablinng Problem to RCPSP
Authors: M. Ahmad, M. Gourgand, C. Caux
Abstract:
The Resource-Constrained Project Scheduling Problem (RCPSP) is concerned with single-item or small batch production where limited resources have to be allocated to dependent activities over time. Over the past few decades, a lot of work has been made with the use of optimal solution procedures for this basic problem type and its extensions. Brucker and Knust[1] discuss, how timetabling problems can be modeled as a RCPSP. Authors discuss high school timetabling and university course timetabling problem as an example. We have formulated two mathematical formulations of course timetabling problem in a new way which are the prototype of single-mode RCPSP. Our focus is to show, how course timetabling problem can be transformed into RCPSP. We solve this transformation model with genetic algorithm.Keywords: Course Timetabling, Integer programming, Combinatorial optimizations
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2016323 FPGA-based Systems for Evolvable Hardware
Authors: Cyrille Lambert, Tatiana Kalganova, Emanuele Stomeo
Abstract:
Since 1992, year where Hugo de Garis has published the first paper on Evolvable Hardware (EHW), a period of intense creativity has followed. It has been actively researched, developed and applied to various problems. Different approaches have been proposed that created three main classifications: extrinsic, mixtrinsic and intrinsic EHW. Each of these solutions has a real interest. Nevertheless, although the extrinsic evolution generates some excellent results, the intrinsic systems are not so advanced. This paper suggests 3 possible solutions to implement the run-time configuration intrinsic EHW system: FPGA-based Run-Time Configuration system, JBits-based Run-Time Configuration system and Multi-board functional-level Run-Time Configuration system. The main characteristic of the proposed architectures is that they are implemented on Field Programmable Gate Array. A comparison of proposed solutions demonstrates that multi-board functional-level run-time configuration is superior in terms of scalability, flexibility and the implementation easiness.Keywords: Evolvable hardware, evolutionary computation, FPGA systems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2451322 A Profit-Based Maintenance Scheduling of Thermal Power Units in Electricity Market
Authors: Smajo Bisanovic, Mensur Hajro, Muris Dlakic
Abstract:
This paper presents one comprehensive modelling approach for maintenance scheduling problem of thermal power units in competitive market. This problem is formulated as a 0/1 mixedinteger linear programming model. Model incorporates long-term bilateral contracts with defined profiles of power and price, and weekly forecasted market prices for market auction. The effectiveness of the proposed model is demonstrated through case study with detailed discussion.
Keywords: Maintenance scheduling, bilateral contracts, market prices, profit.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1609321 Architecture Based on Dynamic Graphs for the Dynamic Reconfiguration of Farms of Computers
Authors: Carmen Navarrete, Eloy Anguiano
Abstract:
In the last years, the computers have increased their capacity of calculus and networks, for the interconnection of these machines. The networks have been improved until obtaining the actual high rates of data transferring. The programs that nowadays try to take advantage of these new technologies cannot be written using the traditional techniques of programming, since most of the algorithms were designed for being executed in an only processor,in a nonconcurrent form instead of being executed concurrently ina set of processors working and communicating through a network.This paper aims to present the ongoing development of a new system for the reconfiguration of grouping of computers, taking into account these new technologies.
Keywords: Dynamic network topology, resource and task allocation, parallel computing, heterogeneous computing, dynamic reconfiguration.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1364320 Optimal Design and Intelligent Management of Hybrid Power System
Authors: Reza Sedaghati
Abstract:
Given the increasing energy demand in the world as well as limited fossil energy fuel resources, it is necessary to use renewable energy resources more than ever. Developing a hybrid energy system is suggested to overcome the intermittence of renewable energy resources such as sun and wind, in which the excess electrical energy can be converted and stored. While these resources store the energy, they can provide a more reliable system that is really suitable for off-grid applications. In hybrid systems, a methodology for optimal sizing of power generation systems components is of great importance in terms of economic aspects and efficiency. In this study, a hybrid energy system is designed to supply an off-grid sample load pattern with the aim of supplying necessary energy and minimizing the total production cost throughout the system life as well as increasing the reliability. For this purpose, the optimal size and the cost function of these resources is determined and minimized using evolutionary algorithms and system efficiency is studied with real-time load and meteorological information of Kazerun, a city in southern Iran under different conditions.Keywords: Hybrid energy system, intelligent method, optimal size, minimal.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1474319 Dynamic Attribute Dependencies in Relational Attribute Grammars
Authors: K. Barbar, M. Dehayni, A. Awada, M. Smaili
Abstract:
Considering the theory of attribute grammars, we use logical formulas instead of traditional functional semantic rules. Following the decoration of a derivation tree, a suitable algorithm should maintain the consistency of the formulas together with the evaluation of the attributes. This may be a Prolog-like resolution, but this paper examines a somewhat different strategy, based on production specialization, local consistency and propagation: given a derivation tree, it is interactively decorated, i.e. incrementally checked and evaluated. The non-directed dependencies are dynamically directed during attribute evaluation.Keywords: Input/Output attribute grammars, local consistency, logical programming, propagation, relational attribute grammars.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1461318 Robust Batch Process Scheduling in Pharmaceutical Industries: A Case Study
Authors: Tommaso Adamo, Gianpaolo Ghiani, Antonio D. Grieco, Emanuela Guerriero
Abstract:
Batch production plants provide a wide range of scheduling problems. In pharmaceutical industries a batch process is usually described by a recipe, consisting of an ordering of tasks to produce the desired product. In this research work we focused on pharmaceutical production processes requiring the culture of a microorganism population (i.e. bacteria, yeasts or antibiotics). Several sources of uncertainty may influence the yield of the culture processes, including (i) low performance and quality of the cultured microorganism population or (ii) microbial contamination. For these reasons, robustness is a valuable property for the considered application context. In particular, a robust schedule will not collapse immediately when a cell of microorganisms has to be thrown away due to a microbial contamination. Indeed, a robust schedule should change locally in small proportions and the overall performance measure (i.e. makespan, lateness) should change a little if at all. In this research work we formulated a constraint programming optimization (COP) model for the robust planning of antibiotics production. We developed a discrete-time model with a multi-criteria objective, ordering the different criteria and performing a lexicographic optimization. A feasible solution of the proposed COP model is a schedule of a given set of tasks onto available resources. The schedule has to satisfy tasks precedence constraints, resource capacity constraints and time constraints. In particular time constraints model tasks duedates and resource availability time windows constraints. To improve the schedule robustness, we modeled the concept of (a, b) super-solutions, where (a, b) are input parameters of the COP model. An (a, b) super-solution is one in which if a variables (i.e. the completion times of a culture tasks) lose their values (i.e. cultures are contaminated), the solution can be repaired by assigning these variables values with a new values (i.e. the completion times of a backup culture tasks) and at most b other variables (i.e. delaying the completion of at most b other tasks). The efficiency and applicability of the proposed model is demonstrated by solving instances taken from a real-life pharmaceutical company. Computational results showed that the determined super-solutions are near-optimal.Keywords: Constraint programming, super-solutions, robust scheduling, batch process, pharmaceutical industries.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1975