Search results for: cellular automata
732 Classification Based on Deep Neural Cellular Automata Model
Authors: Yasser F. Hassan
Abstract:Deep learning structure is a branch of machine learning science and greet achievement in research and applications. Cellular neural networks are regarded as array of nonlinear analog processors called cells connected in a way allowing parallel computations. The paper discusses how to use deep learning structure for representing neural cellular automata model. The proposed learning technique in cellular automata model will be examined from structure of deep learning. A deep automata neural cellular system modifies each neuron based on the behavior of the individual and its decision as a result of multi-level deep structure learning. The paper will present the architecture of the model and the results of simulation of approach are given. Results from the implementation enrich deep neural cellular automata system and shed a light on concept formulation of the model and the learning in it.
Keywords: cellular automata, neural cellular automata, deep learning, classificationProcedia PDF Downloads 112
731 Cellular Automata Using Fractional Integral Model
Authors: Yasser F. Hassan
Abstract:In this paper, a proposed model of cellular automata is studied by means of fractional integral function. A cellular automaton is a decentralized computing model providing an excellent platform for performing complex computation with the help of only local information. The paper discusses how using fractional integral function for representing cellular automata memory or state. The architecture of computing and learning model will be given and the results of calibrating of approach are also given.
Keywords: fractional integral, cellular automata, memory, learningProcedia PDF Downloads 308
730 Improved Particle Swarm Optimization with Cellular Automata and Fuzzy Cellular Automata
Authors: Ramin Javadzadeh
Abstract:The particle swarm optimization are Meta heuristic optimization method, which are used for clustering and pattern recognition applications are abundantly. These algorithms in multimodal optimization problems are more efficient than genetic algorithms. A major drawback in these algorithms is their slow convergence to global optimum and their weak stability can be considered in various running of these algorithms. In this paper, improved Particle swarm optimization is introduced for the first time to overcome its problems. The fuzzy cellular automata is used for improving the algorithm efficiently. The credibility of the proposed approach is evaluated by simulations, and it is shown that the proposed approach achieves better results can be achieved compared to the Particle swarm optimization algorithms.
Keywords: cellular automata, cellular learning automata, local search, optimization, particle swarm optimizationProcedia PDF Downloads 518
729 A Graph SEIR Cellular Automata Based Model to Study the Spreading of a Transmittable Disease
Authors: Natasha Sharma, Kulbhushan Agnihotri
Abstract:Cellular Automata are discrete dynamical systems which are based on local character and spatial disparateness of the spreading process. These factors are generally neglected by traditional models based on differential equations for epidemic spread. The aim of this work is to introduce an SEIR model based on cellular automata on graphs to imitate epidemic spreading. Distinctively, it is an SEIR-type model where the population is divided into susceptible, exposed, infected and recovered individuals. The results obtained from simulations are in accordance with the spreading behavior of a real time epidemics.
Keywords: cellular automata, epidemic spread, graph, susceptibleProcedia PDF Downloads 395
728 2D Hexagonal Cellular Automata: The Complexity of Forms
Authors: Vural Erdogan
Abstract:We created two-dimensional hexagonal cellular automata to obtain complexity by using simple rules same as Conway’s game of life. Considering the game of life rules, Wolfram's works about life-like structures and John von Neumann's self-replication, self-maintenance, self-reproduction problems, we developed 2-states and 3-states hexagonal growing algorithms that reach large populations through random initial states. Unlike the game of life, we used six neighbourhoods cellular automata instead of eight or four neighbourhoods. First simulations explained that whether we are able to obtain sort of oscillators, blinkers, and gliders. Inspired by Wolfram's 1D cellular automata complexity and life-like structures, we simulated 2D synchronous, discrete, deterministic cellular automata to reach life-like forms with 2-states cells. The life-like formations and the oscillators have been explained how they contribute to initiating self-maintenance together with self-reproduction and self-replication. After comparing simulation results, we decided to develop the algorithm for another step. Appending a new state to the same algorithm, which we used for reaching life-like structures, led us to experiment new branching and fractal forms. All these studies tried to demonstrate that complex life forms might come from uncomplicated rules.
Keywords: hexagonal cellular automata, self-replication, self-reproduction, self- maintenanceProcedia PDF Downloads 82
727 Rough Neural Networks in Adapting Cellular Automata Rule for Reducing Image Noise
Authors: Yasser F. Hassan
Abstract:The reduction or removal of noise in a color image is an essential part of image processing, whether the final information is used for human perception or for an automatic inspection and analysis. This paper describes the modeling system based on the rough neural network model to adaptive cellular automata for various image processing tasks and noise remover. In this paper, we consider the problem of object processing in colored image using rough neural networks to help deriving the rules which will be used in cellular automata for noise image. The proposed method is compared with some classical and recent methods. The results demonstrate that the new model is capable of being trained to perform many different tasks, and that the quality of these results is comparable or better than established specialized algorithms.
Keywords: rough sets, rough neural networks, cellular automata, image processingProcedia PDF Downloads 350
726 Drying Modeling of Banana Using Cellular Automata
Authors: M. Fathi, Z. Farhaninejad, M. Shahedi, M. Sadeghi
Abstract:Drying is one of the oldest preservation methods for food and agriculture products. Appropriate control of operation can be obtained by modeling. Limitation of continues models for complex boundary condition and non-regular geometries leading to appearance of discrete novel methods such as cellular automata, which provides a platform for obtaining fast predictions by rule-based mathematics. In this research a one D dimensional CA was used for simulating thin layer drying of banana. Banana slices were dried with a convectional air dryer and experimental data were recorded for validating of final model. The model was programmed by MATLAB, run for 70000 iterations and von-Neumann neighborhood. The validation results showed a good accordance between experimental and predicted data (R=0.99). Cellular automata are capable to reproduce the expected pattern of drying and have a powerful potential for solving physical problems with reasonable accuracy and low calculating resources.
Keywords: banana, cellular automata, drying, modelingProcedia PDF Downloads 371
725 Multilevel Gray Scale Image Encryption through 2D Cellular Automata
Authors: Rupali Bhardwaj
Abstract:Cryptography is the science of using mathematics to encrypt and decrypt data; the data are converted into some other gibberish form, and then the encrypted data are transmitted. The primary purpose of this paper is to provide two levels of security through a two-step process, rather than transmitted the message bits directly, first encrypted it using 2D cellular automata and then scrambled with Arnold Cat Map transformation; it provides an additional layer of protection and reduces the chance of the transmitted message being detected. A comparative analysis on effectiveness of scrambling technique is provided by scrambling degree measurement parameters i.e. Gray Difference Degree (GDD) and Correlation Coefficient.
Keywords: scrambling, cellular automata, Arnold cat map, game of life, gray difference degree, correlation coefficientProcedia PDF Downloads 304
724 Achieving Better Security by Using Nonlinear Cellular Automata as a Cryptographic Primitive
Authors: Swapan Maiti, Dipanwita Roy Chowdhury
Abstract:Nonlinear functions are essential in different cryptoprimitives as they play an important role on the security of the cipher designs. Rule 30 was identified as a powerful nonlinear function for cryptographic applications. However, an attack (MS attack) was mounted against Rule 30 Cellular Automata (CA). Nonlinear rules as well as maximum period CA increase randomness property. In this work, nonlinear rules of maximum period nonlinear hybrid CA (M-NHCA) are studied and it is shown to be a better crypto-primitive than Rule 30 CA. It has also been analysed that the M-NHCA with single nonlinearity injection proposed in the literature is vulnerable against MS attack, whereas M-NHCA with multiple nonlinearity injections provide maximum length cycle as well as better cryptographic primitives and they are also secure against MS attack.
Keywords: cellular automata, maximum period nonlinear CA, Meier and Staffelbach attack, nonlinear functionsProcedia PDF Downloads 210
723 Playing Light Switching Games with Langton's Turmite
Authors: Crista Arangala
Abstract:Light switching games are both popular and well studied. This paper introduces a cellular automata called Langton’s turmite to several different light switching scenarios and discusses when Langton’s turmite can solve these games.
Keywords: cellular automata, lights out, alien tiles, chaos, Langton's TurmiteProcedia PDF Downloads 420
722 Exploration of Various Metrics for Partitioning of Cellular Automata Units for Efficient Reconfiguration of Field Programmable Gate Arrays (FPGAs)
Authors: Peter Tabatt, Christian Siemers
Abstract:Using FPGA devices to improve the behavior of time-critical parts of embedded systems is a proven concept for years. With reconfigurable FPGA devices, the logical blocks can be partitioned and grouped into static and dynamic parts. The dynamic parts can be reloaded 'on demand' at runtime. This work uses cellular automata, which are constructed through compilation from (partially restricted) ANSI-C sources, to determine the suitability of various metrics for optimal partitioning. Significant metrics, in this case, are for example the area on the FPGA device for the partition, the pass count for loop constructs and communication characteristics to other partitions. With successful partitioning, it is possible to use smaller FPGA devices for the same requirements as with not reconfigurable FPGA devices or – vice versa – to use the same FPGAs for larger programs.
Keywords: reconfigurable FPGA, cellular automata, partitioning, metrics, parallel computingProcedia PDF Downloads 206
721 Cellular Automata Modelling of Titanium Alloy
Authors: Jyoti Jha, Asim Tewari, Sushil Mishra
Abstract:The alpha-beta Titanium alloy (Ti-6Al-4V) is the most common alloy in the aerospace industry. The hot workability of Ti–6Al–4V has been investigated by means of hot compression tests carried out in the 750–950 °C temperature range and 0.001–10s-1 strain rate range. Stress-strain plot obtained from the Gleeble 3800 test results show the dynamic recrystallization at temperature 950 °C. The effect of microstructural characteristics of the deformed specimens have been studied and correlated with the test temperature, total strain and strain rate. Finite element analysis in DEFORM 2D has been carried out to see the effect of flow stress parameters in different zones of deformed sample. Dynamic recrystallization simulation based on Cellular automata has been done in DEFORM 2D to simulate the effect of hardening and recovery during DRX. Simulated results well predict the grain growth and DRX in the deformed sample.
Keywords: compression test, Cellular automata, DEFORM , DRXProcedia PDF Downloads 233
720 Land Use Change Modeling Using Cellular Automata, Case Study: Karawang City, West Java Province, Indonesia
Authors: Bagus Indrawan Hardi
Abstract:Cellular Automata are widely used in land use modeling, it has been proven powerful to simulate land use change for small scale in many large cities in the world. In this paper, we try to implement CA for land use modeling in unique city in Indonesia, Karawang. Instead the complex numerical implementation, CA are simple, and it is accurate and also highly dependable on the on the rules (rule based). The most important to do in CA is how we form and calculate the neighborhood effect. The neighborhood effect represents the environment and relationship situation between the occupied cell and others. We adopted 196 cells of circular neighborhood with 8 cells of radius. For the results, CA works well in this study, we exhibit several analyzed and proceed of zoomed part in Karawang region. The rule set can handle the complexity in land use modeling. However, we cannot strictly believe of the result, many non-technical parameters, such as politics, natural disaster activities, etc. may change the results dramatically.
Keywords: cellular automata (CA), land use change, spatial dynamics, urban sprawlProcedia PDF Downloads 186
719 A Neuro-Automata Decision Support System for the Control of Late Blight in Tomato Crops
Authors: Gizelle K. Vianna, Gustavo S. Oliveira, Gabriel V. Cunha
Abstract:The use of decision support systems in agriculture may help monitoring large fields of crops by automatically detecting the symptoms of foliage diseases. In our work, we designed and implemented a decision support system for small tomatoes producers. This work investigates ways to recognize the late blight disease from the analysis of digital images of tomatoes, using a pair of multilayer perceptron neural networks. The networks outputs are used to generate repainted tomato images in which the injuries on the plant are highlighted, and to calculate the damage level of each plant. Those levels are then used to construct a situation map of a farm where a cellular automata simulates the outbreak evolution over the fields. The simulator can test different pesticides actions, helping in the decision on when to start the spraying and in the analysis of losses and gains of each choice of action.
Keywords: artificial neural networks, cellular automata, decision support system, pattern recognitionProcedia PDF Downloads 366
718 Future of Nanotechnology in Digital MacDraw
Authors: Pejman Hosseinioun, Abolghasem Ghasempour, Elham Gholami, Hamed Sarbazi
Abstract:Considering the development in global semiconductor technology, it is anticipated that gadgets such as diodes and resonant transistor tunnels (RTD/RTT), Single electron transistors (SET) and quantum cellular automata (QCA) will substitute CMOS (Complementary Metallic Oxide Semiconductor) gadgets in many applications. Unfortunately, these new technologies cannot disembark the common Boolean logic efficiently and are only appropriate for liminal logic. Therefor there is no doubt that with the development of these new gadgets it is necessary to find new MacDraw technologies which are compatible with them. Resonant transistor tunnels (RTD/RTT) and circuit MacDraw with enhanced computing abilities are candida for accumulating Nano criterion in the future. Quantum cellular automata (QCA) are also advent Nano technological gadgets for electrical circuits. Advantages of these gadgets such as higher speed, smaller dimensions, and lower consumption loss are of great consideration. QCA are basic gadgets in manufacturing gates, fuses and memories. Regarding the complex Nano criterion physical entity, circuit designers can focus on logical and constructional design to decrease complication in MacDraw. Moreover Single electron technology (SET) is another noteworthy gadget considered in Nano technology. This article is a survey in future of Nano technology in digital MacDraw.
Keywords: nano technology, resonant transistor tunnels, quantum cellular automata, semiconductorProcedia PDF Downloads 210
717 Empirical Study and Modelling of Three-Dimensional Pedestrian Flow in Railway Foot-Over-Bridge Stair
Authors: Ujjal Chattaraj, M. Raviteja, Chaitanya Aemala
Abstract:Over the years vehicular traffic has been given priority over pedestrian traffic. With the increase of population in cities, pedestrian traffic is increasing day by day. Pedestrian safety has become a matter of concern for the Traffic Engineers. Pedestrian comfort is primary important for the Engineers who design different pedestrian facilities. Pedestrian comfort and safety can be measured in terms of different level of service (LOS) of the facilities. In this study video data on pedestrian movement have been collected from different railway foot over bridges (FOB) in India. The level of service of those facilities has been analyzed. A cellular automata based model has been formulated to mimic the route choice behaviour of the pedestrians on the foot over bridges.
Keywords: cellular automata model, foot over bridge, level of service, pedestrianProcedia PDF Downloads 197
716 The Different Ways to Describe Regular Languages by Using Finite Automata and the Changing Algorithm Implementation
Authors: Abdulmajid Mukhtar Afat
Abstract:This paper aims at introducing finite automata theory, the different ways to describe regular languages and create a program to implement the subset construction algorithms to convert nondeterministic finite automata (NFA) to deterministic finite automata (DFA). This program is written in c++ programming language. The program reads FA 5tuples from text file and then classifies it into either DFA or NFA. For DFA, the program will read the string w and decide whether it is acceptable or not. If accepted, the program will save the tracking path and point it out. On the other hand, when the automation is NFA, the program will change the Automation to DFA so that it is easy to track and it can decide whether the w exists in the regular language or not.
Keywords: finite automata, subset construction, DFA, NFAProcedia PDF Downloads 364
715 Design of Speedy, Scanty Adder for Lossy Application Using QCA
Authors: T. Angeline Priyanka, R. Ganesan
Abstract:Recent trends in microelectronics technology have gradually changed the strategies used in very large scale integration (VLSI) circuits. Complementary Metal Oxide Semiconductor (CMOS) technology has been the industry standard for implementing VLSI device for the past two decades, but due to scale-down issues of ultra-low dimension achievement is not achieved so far. Hence it paved a way for Quantum Cellular Automata (QCA). It is only one of the many alternative technologies proposed as a replacement solution to the fundamental limit problem that CMOS technology will impose in the years to come. In this brief, presented a new adder that possesses high speed of operation occupying less area is proposed. This adder is designed especially for error tolerant application. Hence in the proposed adder, the overall area (cell count) and simulation time are reduced by 88 and 73 percent respectively. Various results of the proposed adder are shown and described.
Keywords: quantum cellular automata, carry look ahead adder, ripple carry adder, lossy application, majority gate, crossoverProcedia PDF Downloads 494
714 Cellular Automata Model for Car Accidents at a Signalized Intersection
Authors: Rachid Marzoug, Noureddine Lakouari, Beatriz Castillo Téllez, Margarita Castillo Téllez, Gerardo Alberto Mejía Pérez
Abstract:This paper developed a two-lane cellular automata model to explain the relationship between car accidents at a signalized intersection and traffic-related parameters. It is found that the increase of the lane-changing probability P?ₕ? increases the risk of accidents, besides, the inflow α and the probability of accidents Pₐ? exhibit a nonlinear relationship. Furthermore, depending on the inflow, Pₐ? exhibits three different phases. The transition from phase I to phase II is of first (second) order when P?ₕ?=0 (P?ₕ?>0). However, the system exhibits a second (first) order transition from phase II to phase III when P?ₕ?=0 (P?ₕ?>0). In addition, when the inflow is not very high, the green light length of one road should be increased to improve road safety. Finally, simulation results show that the traffic at the intersection is safer adopting symmetric lane-changing rules than asymmetric ones.
Keywords: two-lane intersection, accidents, fatality risk, lane-changing, phase transitionProcedia PDF Downloads 142
713 Using ε Value in Describe Regular Languages by Using Finite Automata, Operation on Languages and the Changing Algorithm Implementation
Authors: Abdulmajid Mukhtar Afat
Abstract:This paper aims at introducing nondeterministic finite automata with ε value which is used to perform some operations on languages. a program is created to implement the algorithm that converts nondeterministic finite automata with ε value (ε-NFA) to deterministic finite automata (DFA).The program is written in c++ programming language. The program inputs are FA 5-tuples from text file and then classifies it into either DFA/NFA or ε -NFA. For DFA, the program will get the string w and decide whether it is accepted or rejected. The tracking path for an accepted string is saved by the program. In case of NFA or ε-NFA automation, the program changes the automation to DFA to enable tracking and to decide if the string w exists in the regular language or not.
Keywords: DFA, NFA, ε-NFA, eclose, finite automata, operations on languagesProcedia PDF Downloads 420
712 Computationally Efficient Stacking Sequence Blending for Composite Structures with a Large Number of Design Regions Using Cellular Automata
Authors: Ellen Van Den Oord, Julien Marie Jan Ferdinand Van Campen
Abstract:This article introduces a computationally efficient method for stacking sequence blending of composite structures. The computational efficiency makes the presented method especially interesting for composite structures with a large number of design regions. Optimization of composite structures with an unequal load distribution may lead to locally optimized thicknesses and ply orientations that are incompatible with one another. Blending constraints can be enforced to achieve structural continuity. In literature, many methods can be found to implement structural continuity by means of stacking sequence blending in one way or another. The complexity of the problem makes the blending of a structure with a large number of adjacent design regions, and thus stacking sequences, prohibitive. In this work the local stacking sequence optimization is preconditioned using a method found in the literature that couples the mechanical behavior of the laminate, in the form of lamination parameters, to blending constraints, yielding near-optimal easy-to-blend designs. The preconditioned design is then fed to the scheme using cellular automata that have been developed by the authors. The method is applied to the benchmark 18-panel horseshoe blending problem to demonstrate its performance. The computational efficiency of the proposed method makes it especially suited for composite structures with a large number of design regions.
Keywords: composite, blending, optimization, lamination parametersProcedia PDF Downloads 153
711 Multi-Objective Optimization of Intersections
Authors: Xiang Li, Jian-Qiao Sun
Abstract:As the crucial component of city traffic network, intersections have significant impacts on urban traffic performance. Despite of the rapid development in transportation systems, increasing traffic volumes result in severe congestions especially at intersections in urban areas. Effective regulation of vehicle flows at intersections has always been an important issue in the traffic control system. This study presents a multi-objective optimization method at intersections with cellular automata to achieve better traffic performance. Vehicle conflicts and pedestrian interference are considered. Three categories of the traffic performance are studied including transportation efficiency, energy consumption and road safety. The left-turn signal type, signal timing and lane assignment are optimized for different traffic flows. The multi-objective optimization problem is solved with the cell mapping method. The optimization results show the conflicting nature of different traffic performance. The influence of different traffic variables on the intersection performance is investigated. It is observed that the proposed optimization method is effective in regulating the traffic at the intersection to meet multiple objectives. Transportation efficiency can be usually improved by the permissive left-turn signal, which sacrifices safety. Right-turn traffic suffers significantly when the right-turn lanes are shared with the through vehicles. The effect of vehicle flow on the intersection performance is significant. The display pattern of the optimization results can be changed remarkably by the traffic volume variation. Pedestrians have strong interference with the traffic system.
Keywords: cellular automata, intersection, multi-objective optimization, traffic systemProcedia PDF Downloads 382
710 Glushkov's Construction for Functional Subsequential Transducers
Authors: Aleksander Mendoza
Abstract:Glushkov's construction has many interesting properties, and they become even more evident when applied to transducers. This article strives to show the vast range of possible extensions and optimisations for this algorithm. Special flavour of regular expressions is introduced, which can be efficiently converted to e-free functional subsequential weighted finite state transducers. Produced automata are very compact, as they contain only one state for each symbol (from input alphabet) of original expression and only one transition for each range of symbols, no matter how large. Such compactified ranges of transitions allow for efficient binary search lookup during automaton evaluation. All the methods and algorithms presented here were used to implement open-source compiler of regular expressions for multitape transducers.
Keywords: weighted automata, transducers, Glushkov, follow automata, regular expressionsProcedia PDF Downloads 75
709 A Hybrid System of Hidden Markov Models and Recurrent Neural Networks for Learning Deterministic Finite State Automata
Authors: Pavan K. Rallabandi, Kailash C. Patidar
Abstract:In this paper, we present an optimization technique or a learning algorithm using the hybrid architecture by combining the most popular sequence recognition models such as Recurrent Neural Networks (RNNs) and Hidden Markov models (HMMs). In order to improve the sequence or pattern recognition/ classification performance by applying a hybrid/neural symbolic approach, a gradient descent learning algorithm is developed using the Real Time Recurrent Learning of Recurrent Neural Network for processing the knowledge represented in trained Hidden Markov Models. The developed hybrid algorithm is implemented on automata theory as a sample test beds and the performance of the designed algorithm is demonstrated and evaluated on learning the deterministic finite state automata.
Keywords: hybrid systems, hidden markov models, recurrent neural networks, deterministic finite state automataProcedia PDF Downloads 309
708 The Use of Rule-Based Cellular Automata to Track and Forecast the Dispersal of Classical Biocontrol Agents at Scale, with an Application to the Fopius arisanus Fruit Fly Parasitoid
Authors: Agboka Komi Mensah, John Odindi, Elfatih M. Abdel-Rahman, Onisimo Mutanga, Henri Ez Tonnang
Abstract:Ecosystems are networks of organisms and populations that form a community of various species interacting within their habitats. Such habitats are defined by abiotic and biotic conditions that establish the initial limits to a population's growth, development, and reproduction. The habitat’s conditions explain the context in which species interact to access resources such as food, water, space, shelter, and mates, allowing for feeding, dispersal, and reproduction. Dispersal is an essential life-history strategy that affects gene flow, resource competition, population dynamics, and species distributions. Despite the importance of dispersal in population dynamics and survival, understanding the mechanism underpinning the dispersal of organisms remains challenging. For instance, when an organism moves into an ecosystem for survival and resource competition, its progression is highly influenced by extrinsic factors such as its physiological state, climatic variables and ability to evade predation. Therefore, greater spatial detail is necessary to understand organism dispersal dynamics. Understanding organisms dispersal can be addressed using empirical and mechanistic modelling approaches, with the adopted approach depending on the study's purpose Cellular automata (CA) is an example of these approaches that have been successfully used in biological studies to analyze the dispersal of living organisms. Cellular automata can be briefly described as occupied cells by an individual that evolves based on proper decisions based on a set of neighbours' rules. However, in the ambit of modelling individual organisms dispersal at the landscape scale, we lack user friendly tools that do not require expertise in mathematical models and computing ability; such as a visual analytics framework for tracking and forecasting the dispersal behaviour of organisms. The term "visual analytics" (VA) describes a semiautomated approach to electronic data processing that is guided by users who can interact with data via an interface. Essentially, VA converts large amounts of quantitative or qualitative data into graphical formats that can be customized based on the operator's needs. Additionally, this approach can be used to enhance the ability of users from various backgrounds to understand data, communicate results, and disseminate information across a wide range of disciplines. To support effective analysis of the dispersal of organisms at the landscape scale, we therefore designed Pydisp which is a free visual data analytics tool for spatiotemporal dispersal modeling built in Python. Its user interface allows users to perform a quick and interactive spatiotemporal analysis of species dispersal using bioecological and climatic data. Pydisp enables reuse and upgrade through the use of simple principles such as Fuzzy cellular automata algorithms. The potential of dispersal modeling is demonstrated in a case study by predicting the dispersal of Fopius arisanus (Sonan), endoparasitoids to control Bactrocera dorsalis (Hendel) (Diptera: Tephritidae) in Kenya. The results obtained from our example clearly illustrate the parasitoid's dispersal process at the landscape level and confirm that dynamic processes in an agroecosystem are better understood when designed using mechanistic modelling approaches. Furthermore, as demonstrated in the example, the built software is highly effective in portraying the dispersal of organisms despite the unavailability of detailed data on the species dispersal mechanisms.
Keywords: cellular automata, fuzzy logic, landscape, spatiotemporalProcedia PDF Downloads 14
707 A Parallel Cellular Automaton Model of Tumor Growth for Multicore and GPU Programming
Authors: Manuel I. Capel, Antonio Tomeu, Alberto Salguero
Abstract:Tumor growth from a transformed cancer-cell up to a clinically apparent mass spans through a range of spatial and temporal magnitudes. Through computer simulations, Cellular Automata (CA) can accurately describe the complexity of the development of tumors. Tumor development prognosis can now be made -without making patients undergo through annoying medical examinations or painful invasive procedures- if we develop appropriate CA-based software tools. In silico testing mainly refers to Computational Biology research studies of application to clinical actions in Medicine. To establish sound computer-based models of cellular behavior, certainly reduces costs and saves precious time with respect to carrying out experiments in vitro at labs or in vivo with living cells and organisms. These aim to produce scientifically relevant results compared to traditional in vitro testing, which is slow, expensive, and does not generally have acceptable reproducibility under the same conditions. For speeding up computer simulations of cellular models, specific literature shows recent proposals based on the CA approach that include advanced techniques, such the clever use of supporting efficient data structures when modeling with deterministic stochastic cellular automata. Multiparadigm and multiscale simulation of tumor dynamics is just beginning to be developed by the concerned research community. The use of stochastic cellular automata (SCA), whose parallel programming implementations are open to yield a high computational performance, are of much interest to be explored up to their computational limits. There have been some approaches based on optimizations to advance in multiparadigm models of tumor growth, which mainly pursuit to improve performance of these models through efficient memory accesses guarantee, or considering the dynamic evolution of the memory space (grids, trees,…) that holds crucial data in simulations. In our opinion, the different optimizations mentioned above are not decisive enough to achieve the high performance computing power that cell-behavior simulation programs actually need. The possibility of using multicore and GPU parallelism as a promising multiplatform and framework to develop new programming techniques to speed-up the computation time of simulations is just starting to be explored in the few last years. This paper presents a model that incorporates parallel processing, identifying the synchronization necessary for speeding up tumor growth simulations implemented in Java and C++ programming environments. The speed up improvement that specific parallel syntactic constructs, such as executors (thread pools) in Java, are studied. The new tumor growth parallel model is proved using implementations with Java and C++ languages on two different platforms: chipset Intel core i-X and a HPC cluster of processors at our university. The parallelization of Polesczuk and Enderling model (normally used by researchers in mathematical oncology) proposed here is analyzed with respect to performance gain. We intend to apply the model and overall parallelization technique presented here to solid tumors of specific affiliation such as prostate, breast, or colon. Our final objective is to set up a multiparadigm model capable of modelling angiogenesis, or the growth inhibition induced by chemotaxis, as well as the effect of therapies based on the presence of cytotoxic/cytostatic drugs.
Keywords: cellular automaton, tumor growth model, simulation, multicore and manycore programming, parallel programming, high performance computing, speed upProcedia PDF Downloads 179
706 Low-Density Nanocellular Foam Based on PMMA/PEBAX Blend for Thermal Insulation Application
Authors: Nigus Maregu Demewoz, Shu-Kai Yeh
Abstract:Low-density nano cellular foam is a fascinating new-generation advanced material due to its mechanical strength and thermal insulation properties. In nano cellular foam, reducing the density increases the insulation ability. However, producing a nano cellular foam of densities less than 0.3 with a cell size of less than 100 nm is very challenging. In this study, we added 2 wt% of PEBAX with a PMMA matrix, and the PEBAX nanoparticles were well dispersed in the PMMA matrix. The result showed that we successfully produced a nano cellular foam of cell size less than 100 nm with a relative density of 0.2. A new generation special, bouquet-like nano cellular structure was able to produce for the second time. In addition to thermal insulation applications, the bouquet-like nano cellular foam may apply for filtration.
Keywords: nano cellular foam, low-density, cell size, relative densityProcedia PDF Downloads 18
705 Presenting a Job Scheduling Algorithm Based on Learning Automata in Computational Grid
Authors: Roshanak Khodabakhsh Jolfaei, Javad Akbari Torkestani
Abstract:As a cooperative environment for problem-solving, it is necessary that grids develop efficient job scheduling patterns with regard to their goals, domains and structure. Since the Grid environments facilitate distributed calculations, job scheduling appears in the form of a critical problem for the management of Grid sources that influences severely on the efficiency for the whole Grid environment. Due to the existence of some specifications such as sources dynamicity and conditions of the network in Grid, some algorithm should be presented to be adjustable and scalable with increasing the network growth. For this purpose, in this paper a job scheduling algorithm has been presented on the basis of learning automata in computational Grid which the performance of its results were compared with FPSO algorithm (Fuzzy Particle Swarm Optimization algorithm) and GJS algorithm (Grid Job Scheduling algorithm). The obtained numerical results indicated the superiority of suggested algorithm in comparison with FPSO and GJS. In addition, the obtained results classified FPSO and GJS in the second and third position respectively after the mentioned algorithm.
Keywords: computational grid, job scheduling, learning automata, dynamic schedulingProcedia PDF Downloads 252
704 Application of Strength Criteria for Cellular Pressure Vessels
Authors: Antanas Žiliukas, Mindaugas Kukis
Abstract:The work deals with cellular pressure vessels subjected to internal pressure. Their cellular insert can be used for placing liquids or gases, which is necessary to carry out technological processes, and the vessel itself has a good bearing capacity. Numerical calculations of the three core structures, which measure the influence of the inner cylinder thickness on maximum bearing capacity are presented. The calculations are compared using strength criteria and they show the different strength safety level.
Keywords: pressure, strength criterion, sandwich plate, cellular vesselProcedia PDF Downloads 246
703 An Adaptive Cooperative Scheme for Reliability of Transmission Using STBC and CDD in Wireless Communications
Authors: Hyun-Jun Shin, Jae-Jeong Kim, Hyoung-Kyu Song
Abstract:In broadcasting and cellular system, a cooperative scheme is proposed for the improvement of performance of bit error rate. Up to date, the coverage of broadcasting system coexists with the coverage of cellular system. Therefore each user in a cellular coverage is frequently involved in a broadcasting coverage. The proposed cooperative scheme is derived from the shared areas. The users receive signals from both broadcasting base station and cellular base station. The proposed scheme selects a cellular base station of a worse channel to achieve better performance of bit error rate in cooperation. The performance of the proposed scheme is evaluated in fading channel.
Keywords: cooperative communication, diversity, STBC, CDD, channel condition, broadcasting system, cellular systemProcedia PDF Downloads 435