Vafaee Sharbaf, Fatemeh; Mosafer, Sara; Moattar, Mohammad Hossein
2016-06-01
This paper proposes an approach for gene selection in microarray data. The proposed approach consists of a primary filter approach using Fisher criterion which reduces the initial genes and hence the search space and time complexity. Then, a wrapper approach which is based on cellular learning automata (CLA) optimized with ant colony method (ACO) is used to find the set of features which improve the classification accuracy. CLA is applied due to its capability to learn and model complicated relationships. The selected features from the last phase are evaluated using ROC curve and the most effective while smallest feature subset is determined. The classifiers which are evaluated in the proposed framework are K-nearest neighbor; support vector machine and naïve Bayes. The proposed approach is evaluated on 4 microarray datasets. The evaluations confirm that the proposed approach can find the smallest subset of genes while approaching the maximum accuracy. PMID:27154739
Irregular Cellular Learning Automata.
Esnaashari, Mehdi; Meybodi, Mohammad Reza
2015-08-01
Cellular learning automaton (CLA) is a recently introduced model that combines cellular automaton (CA) and learning automaton (LA). The basic idea of CLA is to use LA to adjust the state transition probability of stochastic CA. This model has been used to solve problems in areas such as channel assignment in cellular networks, call admission control, image processing, and very large scale integration placement. In this paper, an extension of CLA called irregular CLA (ICLA) is introduced. This extension is obtained by removing the structure regularity assumption in CLA. Irregularity in the structure of ICLA is needed in some applications, such as computer networks, web mining, and grid computing. The concept of expediency has been introduced for ICLA and then, conditions under which an ICLA becomes expedient are analytically found. PMID:25291810
Linear System Control Using Stochastic Learning Automata
NASA Technical Reports Server (NTRS)
Ziyad, Nigel; Cox, E. Lucien; Chouikha, Mohamed F.
1998-01-01
This paper explains the use of a Stochastic Learning Automata (SLA) to control switching between three systems to produce the desired output response. The SLA learns the optimal choice of the damping ratio for each system to achieve a desired result. We show that the SLA can learn these states for the control of an unknown system with the proper choice of the error criteria. The results of using a single automaton are compared to using multiple automata.
Varieties of learning automata: an overview.
Thathachar, M L; Sastry, P S
2002-01-01
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper by Narendra and Thathachar (1974). Since then, there have been many fundamental advances in the theory as well as applications of these learning models. In the past few years, the structure of LA, has been modified in several directions to suit different applications. Concepts such as parameterized learning automata (PLA), generalized learning,automata (GLA), and continuous action-set learning automata (CALA) have been proposed, analyzed, and applied to solve many significant learning problems. Furthermore, groups of LA forming teams and feedforward networks have been shown to converge to desired solutions under appropriate learning algorithms. Modules of LA have been used for parallel operation with consequent increase in speed of convergence. All of these concepts and results are relatively new and are scattered in technical literature. An attempt has been made in this paper to bring together the main ideas involved in a unified framework and provide pointers to relevant references. PMID:18244878
Solving multiconstraint assignment problems using learning automata.
Horn, Geir; Oommen, B John
2010-02-01
This paper considers the NP-hard problem of object assignment with respect to multiple constraints: assigning a set of elements (or objects) into mutually exclusive classes (or groups), where the elements which are "similar" to each other are hopefully located in the same class. The literature reports solutions in which the similarity constraint consists of a single index that is inappropriate for the type of multiconstraint problems considered here and where the constraints could simultaneously be contradictory. This feature, where we permit possibly contradictory constraints, distinguishes this paper from the state of the art. Indeed, we are aware of no learning automata (or other heuristic) solutions which solve this problem in its most general setting. Such a scenario is illustrated with the static mapping problem, which consists of distributing the processes of a parallel application onto a set of computing nodes. This is a classical and yet very important problem within the areas of parallel computing, grid computing, and cloud computing. We have developed four learning-automata (LA)-based algorithms to solve this problem: First, a fixed-structure stochastic automata algorithm is presented, where the processes try to form pairs to go onto the same node. This algorithm solves the problem, although it requires some centralized coordination. As it is desirable to avoid centralized control, we subsequently present three different variable-structure stochastic automata (VSSA) algorithms, which have superior partitioning properties in certain settings, although they forfeit some of the scalability features of the fixed-structure algorithm. All three VSSA algorithms model the processes as automata having first the hosting nodes as possible actions; second, the processes as possible actions; and, third, attempting to estimate the process communication digraph prior to probabilistically mapping the processes. This paper, which, we believe, comprehensively reports the
Abductive learning of quantized stochastic processes with probabilistic finite automata.
Chattopadhyay, Ishanu; Lipson, Hod
2013-02-13
We present an unsupervised learning algorithm (GenESeSS) to infer the causal structure of quantized stochastic processes, defined as stochastic dynamical systems evolving over discrete time, and producing quantized observations. Assuming ergodicity and stationarity, GenESeSS infers probabilistic finite state automata models from a sufficiently long observed trace. Our approach is abductive; attempting to infer a simple hypothesis, consistent with observations and modelling framework that essentially fixes the hypothesis class. The probabilistic automata we infer have no initial and terminal states, have no structural restrictions and are shown to be probably approximately correct-learnable. Additionally, we establish rigorous performance guarantees and data requirements, and show that GenESeSS correctly infers long-range dependencies. Modelling and prediction examples on simulated and real data establish relevance to automated inference of causal stochastic structures underlying complex physical phenomena. PMID:23277601
Sampling from complex networks using distributed learning automata
NASA Astrophysics Data System (ADS)
Rezvanian, Alireza; Rahmati, Mohammad; Meybodi, Mohammad Reza
2014-02-01
A complex network provides a framework for modeling many real-world phenomena in the form of a network. In general, a complex network is considered as a graph of real world phenomena such as biological networks, ecological networks, technological networks, information networks and particularly social networks. Recently, major studies are reported for the characterization of social networks due to a growing trend in analysis of online social networks as dynamic complex large-scale graphs. Due to the large scale and limited access of real networks, the network model is characterized using an appropriate part of a network by sampling approaches. In this paper, a new sampling algorithm based on distributed learning automata has been proposed for sampling from complex networks. In the proposed algorithm, a set of distributed learning automata cooperate with each other in order to take appropriate samples from the given network. To investigate the performance of the proposed algorithm, several simulation experiments are conducted on well-known complex networks. Experimental results are compared with several sampling methods in terms of different measures. The experimental results demonstrate the superiority of the proposed algorithm over the others.
Algorithmic crystal chemistry: A cellular automata approach
Krivovichev, S. V.
2012-01-15
Atomic-molecular mechanisms of crystal growth can be modeled based on crystallochemical information using cellular automata (a particular case of finite deterministic automata). In particular, the formation of heteropolyhedral layered complexes in uranyl selenates can be modeled applying a one-dimensional three-colored cellular automaton. The use of the theory of calculations (in particular, the theory of automata) in crystallography allows one to interpret crystal growth as a computational process (the realization of an algorithm or program with a finite number of steps).
On the applications of multiplicity automata in learning
Beimel, A.; Bergadano, F.; Bshouty, N.H.
1996-12-31
Recently the learnability of multiplicity automata attracted a lot of attention, mainly because of its implications on the learnability of several classes of DNF formulae. In this paper we further study the learnability of multiplicity automata. Our starting point is a known theorem from automata theory relating the number of states in a minimal multiplicity automaton for a function f to the rank of a certain matrix F. With this theorem in hand we obtain the following results: (1) A new simple algorithm for learning multiplicity automata in the spirit with a better query complexity. As a result, we improve the complexity for all classes that use the algorithms of and also obtain the best query complexity for several classes known to be learnable by other methods such as decision trees and polynomials over GF(2). (2) We prove the learnability of some new classes that were not known to be learnable before. Most notably, the class of polynomials over finite fields, the class of bounded-degree polynomials over infinite fields, the class of XOR of terms, and a certain class of decision-trees. (3) While multiplicity automata were shown to be useful to prove the learnability of some subclasses of DNF formulae and various other classes, we study the limitations of this method. We prove that this method cannot be used to resolve the learnability of some other open problems such as the learnability of general DNF formulae or even k -term DNF for k = {omega}(log n) or satisfy-s DNF formulae for s = {omega}(1). These results are proven by exhibiting functions in the above classes that require multiplicity automata with superpolynomial number of states.
Incremental Learning of Cellular Automata for Parallel Recognition of Formal Languages
NASA Astrophysics Data System (ADS)
Nakamura, Katsuhiko; Imada, Keita
Parallel language recognition by cellular automata (CAs) is currently an important subject in computation theory. This paper describes incremental learning of one-dimensional, bounded, one-way, cellular automata (OCAs) that recognize formal languages from positive and negative sample strings. The objectives of this work are to develop automatic synthesis of parallel systems and to contribute to the theory of real-time recognition by cellular automata. We implemented methods to learn the rules of OCAs in the Occam system, which is based on grammatical inference of context-free grammars (CFGs) implemented in Synapse. An important feature of Occam is incremental learning by a rule generation mechanism called bridging and the search for rule sets. The bridging looks for and fills gaps in incomplete space-time transition diagrams for positive samples. Another feature of our approach is that the system synthesizes minimal or semi-minimal rule sets of CAs. This paper reports experimental results on learning several OCAs for fundamental formal languages including sets of balanced parentheses and palindromes as well as the set {a n b n c n | n ≥ 1}.
A quantum model for autonomous learning automata
NASA Astrophysics Data System (ADS)
Siomau, Michael
2014-05-01
The idea of information encoding on quantum bearers and its quantum-mechanical processing has revolutionized our world and brought mankind on the verge of enigmatic era of quantum technologies. Inspired by this idea, in present paper, we search for advantages of quantum information processing in the field of machine learning. Exploiting only basic properties of the Hilbert space, superposition principle of quantum mechanics and quantum measurements, we construct a quantum analog for Rosenblatt's perceptron, which is the simplest learning machine. We demonstrate that the quantum perceptron is superior to its classical counterpart in learning capabilities. In particular, we show that the quantum perceptron is able to learn an arbitrary (Boolean) logical function, perform the classification on previously unseen classes and even recognize the superpositions of learned classes—the task of high importance in applied medical engineering.
LAHS: A novel harmony search algorithm based on learning automata
NASA Astrophysics Data System (ADS)
Enayatifar, Rasul; Yousefi, Moslem; Abdullah, Abdul Hanan; Darus, Amer Nordin
2013-12-01
This study presents a learning automata-based harmony search (LAHS) for unconstrained optimization of continuous problems. The harmony search (HS) algorithm performance strongly depends on the fine tuning of its parameters, including the harmony consideration rate (HMCR), pitch adjustment rate (PAR) and bandwidth (bw). Inspired by the spur-in-time responses in the musical improvisation process, learning capabilities are employed in the HS to select these parameters based on spontaneous reactions. An extensive numerical investigation is conducted on several well-known test functions, and the results are compared with the HS algorithm and its prominent variants, including the improved harmony search (IHS), global-best harmony search (GHS) and self-adaptive global-best harmony search (SGHS). The numerical results indicate that the LAHS is more efficient in finding optimum solutions and outperforms the existing HS algorithm variants.
A cellular automata approach for modeling surface water runoff
NASA Astrophysics Data System (ADS)
Jozefik, Zoltan; Nanu Frechen, Tobias; Hinz, Christoph; Schmidt, Heiko
2015-04-01
This abstract reports the development and application of a two-dimensional cellular automata based model, which couples the dynamics of overland flow, infiltration processes and surface evolution through sediment transport. The natural hill slopes are represented by their topographic elevation and spatially varying soil properties infiltration rates and surface roughness coefficients. This model allows modeling of Hortonian overland flow and infiltration during complex rainfall events. An advantage of the cellular automata approach over the kinematic wave equations is that wet/dry interfaces that often appear with rainfall overland flows can be accurately captured and are not a source of numerical instabilities. An adaptive explicit time stepping scheme allows for rainfall events to be adequately resolved in time, while large time steps are taken during dry periods to provide for simulation run time efficiency. The time step is constrained by the CFL condition and mass conservation considerations. The spatial discretization is shown to be first-order accurate. For validation purposes, hydrographs for non-infiltrating and infiltrating plates are compared to the kinematic wave analytic solutions and data taken from literature [1,2]. Results show that our cellular automata model quantitatively accurately reproduces hydrograph patterns. However, recent works have showed that even through the hydrograph is satisfyingly reproduced, the flow field within the plot might be inaccurate [3]. For a more stringent validation, we compare steady state velocity, water flux, and water depth fields to rainfall simulation experiments conducted in Thies, Senegal [3]. Comparisons show that our model is able to accurately capture these flow properties. Currently, a sediment transport and deposition module is being implemented and tested. [1] M. Rousseau, O. Cerdan, O. Delestre, F. Dupros, F. James, S. Cordier. Overland flow modeling with the Shallow Water Equation using a well balanced
Adaptive stochastic cellular automata: Applications
NASA Astrophysics Data System (ADS)
Qian, S.; Lee, Y. C.; Jones, R. D.; Barnes, C. W.; Flake, G. W.; O'Rourke, M. K.; Lee, K.; Chen, H. H.; Sun, G. Z.; Zhang, Y. Q.; Chen, D.; Giles, C. L.
1990-09-01
The stochastic learning cellular automata model has been applied to the problem of controlling unstable systems. Two example unstable systems studied are controlled by an adaptive stochastic cellular automata algorithm with an adaptive critic. The reinforcement learning algorithm and the architecture of the stochastic CA controller are presented. Learning to balance a single pole is discussed in detail. Balancing an inverted double pendulum highlights the power of the stochastic CA approach. The stochastic CA model is compared to conventional adaptive control and artificial neural network approaches.
Solving initial and boundary value problems using learning automata particle swarm optimization
NASA Astrophysics Data System (ADS)
Nemati, Kourosh; Mariyam Shamsuddin, Siti; Darus, Maslina
2015-05-01
In this article, the particle swarm optimization (PSO) algorithm is modified to use the learning automata (LA) technique for solving initial and boundary value problems. A constrained problem is converted into an unconstrained problem using a penalty method to define an appropriate fitness function, which is optimized using the LA-PSO method. This method analyses a large number of candidate solutions of the unconstrained problem with the LA-PSO algorithm to minimize an error measure, which quantifies how well a candidate solution satisfies the governing ordinary differential equations (ODEs) or partial differential equations (PDEs) and the boundary conditions. This approach is very capable of solving linear and nonlinear ODEs, systems of ordinary differential equations, and linear and nonlinear PDEs. The computational efficiency and accuracy of the PSO algorithm combined with the LA technique for solving initial and boundary value problems were improved. Numerical results demonstrate the high accuracy and efficiency of the proposed method.
Distributed learning automata-based algorithm for community detection in complex networks
NASA Astrophysics Data System (ADS)
Khomami, Mohammad Mehdi Daliri; Rezvanian, Alireza; Meybodi, Mohammad Reza
2016-03-01
Community structure is an important and universal topological property of many complex networks such as social and information networks. The detection of communities of a network is a significant technique for understanding the structure and function of networks. In this paper, we propose an algorithm based on distributed learning automata for community detection (DLACD) in complex networks. In the proposed algorithm, each vertex of network is equipped with a learning automation. According to the cooperation among network of learning automata and updating action probabilities of each automaton, the algorithm interactively tries to identify high-density local communities. The performance of the proposed algorithm is investigated through a number of simulations on popular synthetic and real networks. Experimental results in comparison with popular community detection algorithms such as walk trap, Danon greedy optimization, Fuzzy community detection, Multi-resolution community detection and label propagation demonstrated the superiority of DLACD in terms of modularity, NMI, performance, min-max-cut and coverage.
Learning to construct pushdown automata for accepting deterministic context-free languages
NASA Astrophysics Data System (ADS)
Sen, Sandip; Janakiraman, Janani
1992-03-01
Genetic algorithms (GAs) are a class of probabilistic optimization algorithms which utilize ideas from natural genetics. In this paper, we apply the genetic algorithm to a difficult machine learning problem, viz., to learn the description of pushdown automata (PDA) to accept a context-free language (CFL), given legal and illegal sentences of the language. Previous work has involved the use of GAs in learning descriptions for finite state machines for accepting regular languages. CFLs are known to properly include regular languages, and hence, the learning problem addressed here is of a greater complexity. The ability to accept context free languages can be applied to a number of practical problems like text processing, speech recognition, etc.
Excellent approach to modeling urban expansion by fuzzy cellular automata: agent base model
NASA Astrophysics Data System (ADS)
Khajavigodellou, Yousef; Alesheikh, Ali A.; Mohammed, Abdulrazak A. S.; Chapi, Kamran
2014-09-01
Recently, the interaction between humans and their environment is the one of important challenges in the world. Landuse/ cover change (LUCC) is a complex process that includes actors and factors at different social and spatial levels. The complexity and dynamics of urban systems make the applicable practice of urban modeling very difficult. With the increased computational power and the greater availability of spatial data, micro-simulation such as the agent based and cellular automata simulation methods, has been developed by geographers, planners, and scholars, and it has shown great potential for representing and simulating the complexity of the dynamic processes involved in urban growth and land use change. This paper presents Fuzzy Cellular Automata in Geospatial Information System and remote Sensing to simulated and predicted urban expansion pattern. These FCA-based dynamic spatial urban models provide an improved ability to forecast and assess future urban growth and to create planning scenarios, allowing us to explore the potential impacts of simulations that correspond to urban planning and management policies. A fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on Land use change is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. The model integrates an ABM (agent-based model) and FCA (Fuzzy Cellular Automata) to investigate a complex decision-making process and future urban dynamic processes. Based on this model rapid development and green land protection under the influences of the behaviors and decision modes of regional authority agents, real estate developer agents, resident agents and non- resident agents and their interactions have been applied to predict the future development patterns of the Erbil metropolitan region.
Li, Ming; Miao, Chunyan; Leung, Cyril
2015-01-01
Coverage control is one of the most fundamental issues in directional sensor networks. In this paper, the coverage optimization problem in a directional sensor network is formulated as a multi-objective optimization problem. It takes into account the coverage rate of the network, the number of working sensor nodes and the connectivity of the network. The coverage problem considered in this paper is characterized by the geographical irregularity of the sensed events and heterogeneity of the sensor nodes in terms of sensing radius, field of angle and communication radius. To solve this multi-objective problem, we introduce a learning automata-based coral reef algorithm for adaptive parameter selection and use a novel Tchebycheff decomposition method to decompose the multi-objective problem into a single-objective problem. Simulation results show the consistent superiority of the proposed algorithm over alternative approaches. PMID:26690162
A Multi-Teacher Learning Automata Computing Model for Graph Partitioning Problems
NASA Astrophysics Data System (ADS)
Ikebo, Shigeya; Qian, Fei; Hirata, Hironori
Graph partitioning is an important problem that has extensive applications in many areas, including VLSI design, scientific computing, data mining, geographical information systems and job scheduling. The graph partitioning problem (GPP) is NP-complete. There are several heuristic algorithms developed finding a reasonably good resolution. The most famous partitioning methods are simulated annealing (SA) and mean field algorithm (MFA) known to produce good partition for a wide class of problems, and they are used quite extensively. However these methods are very expensive in time and very sensitive in parameters tuning methods. In this paper, a new parameter-free algorithm for GPP has been proposed. The algorithm has been constructed using the S-model learning automata with multi-teacher random environments. As shown in our experiments, the proposed algorithm has some advantages superior to SA, MFA and ParMeTiS.
NASA Astrophysics Data System (ADS)
Adabi, Sepideh; Adabi, Sahar; Rezaee, Ali
According to the traditional definition of Wireless Sensor Networks (WSNs), static sensors have limited the feasibility of WSNs in some kind of approaches, so the mobility was introduced in WSN. Mobile nodes in a WSN come equipped with battery and from the point of deployment, this battery reserve becomes a valuable resource since it cannot be replenished. Hence, maximizing the network lifetime by minimizing the energy is an important challenge in Mobile WSN. Energy conservation can be accomplished by different approaches. In this paper, we presented an energy conservation solution based on Cellular Automata. The main objective of this solution is based on dynamically adjusting the transmission range and switching between operational states of the sensor nodes.
NASA Astrophysics Data System (ADS)
Afshar, M. H.; Rohani, M.
2012-01-01
In this article, cellular automata based hybrid methods are proposed for the optimal design of sewer networks and their performance is compared with some of the common heuristic search methods. The problem of optimal design of sewer networks is first decomposed into two sub-optimization problems which are solved iteratively in a two stage manner. In the first stage, the pipe diameters of the network are assumed fixed and the nodal cover depths of the network are determined by solving a nonlinear sub-optimization problem. A cellular automata (CA) method is used for the solution of the optimization problem with the network nodes considered as the cells and their cover depths as the cell states. In the second stage, the nodal cover depths calculated from the first stage are fixed and the pipe diameters are calculated by solving a second nonlinear sub-optimization problem. Once again a CA method is used to solve the optimization problem of the second stage with the pipes considered as the CA cells and their corresponding diameters as the cell states. Two different updating rules are derived and used for the CA of the second stage depending on the treatment of the pipe diameters. In the continuous approach, the pipe diameters are considered as continuous variables and the corresponding updating rule is derived mathematically from the original objective function of the problem. In the discrete approach, however, an adhoc updating rule is derived and used taking into account the discrete nature of the pipe diameters. The proposed methods are used to optimally solve two sewer network problems and the results are presented and compared with those obtained by other methods. The results show that the proposed CA based hybrid methods are more efficient and effective than the most powerful search methods considered in this work.
NASA Technical Reports Server (NTRS)
Havelund, Klaus
2014-01-01
We present a form of automaton, referred to as data automata, suited for monitoring sequences of data-carrying events, for example emitted by an executing software system. This form of automata allows states to be parameterized with data, forming named records, which are stored in an efficiently indexed data structure, a form of database. This very explicit approach differs from other automaton-based monitoring approaches. Data automata are also characterized by allowing transition conditions to refer to other parameterized states, and by allowing transitions sequences. The presented automaton concept is inspired by rule-based systems, especially the Rete algorithm, which is one of the well-established algorithms for executing rule-based systems. We present an optimized external DSL for data automata, as well as a comparable unoptimized internal DSL (API) in the Scala programming language, in order to compare the two solutions. An evaluation compares these two solutions to several other monitoring systems.
NASA Astrophysics Data System (ADS)
Bartoletti, Massimo
Usage automata are an extension of finite stata automata, with some additional features (e.g. parameters and guards) that improve their expressivity. Usage automata are expressive enough to model security requirements of real-world applications; at the same time, they are simple enough to be statically amenable, e.g. they can be model-checked against abstractions of program usages. We study here some foundational aspects of usage automata. In particular, we discuss about their expressive power, and about their effective use in run-time mechanisms for enforcing usage policies.
Finite state automata resulting from temporal information maximization and a temporal learning rule.
Wennekers, Thomas; Ay, Nihat
2005-10-01
We extend Linkser's Infomax principle for feedforward neural networks to a measure for stochastic interdependence that captures spatial and temporal signal properties in recurrent systems. This measure, stochastic interaction, quantifies the Kullback-Leibler divergence of a Markov chain from a product of split chains for the single unit processes. For unconstrained Markov chains, the maximization of stochastic interaction, also called Temporal Infomax, has been previously shown to result in almost deterministic dynamics. This letter considers Temporal Infomax on constrained Markov chains, where some of the units are clamped to prescribed stochastic processes providing input to the system. Temporal Infomax in that case leads to finite state automata, either completely deterministic or weakly nondeterministic. Transitions between internal states of these systems are almost perfectly predictable given the complete current state and the input, but the activity of each single unit alone is virtually random. The results are demonstrated by means of computer simulations and confirmed analytically. It is furthermore shown numerically that Temporal Infomax leads to a high information flow from the input to internal units and that a simple temporal learning rule can approximately achieve the optimization of temporal interaction. We relate these results to experimental data concerning the correlation dynamics and functional connectivities observed in multiple electrode recordings. PMID:16105225
Baba, Norio; Mogami, Yoshio
2006-08-01
A new learning algorithm for the hierarchical structure learning automata (HSLA) operating in the nonstationary multiteacher environment (NME) is proposed. The proposed algorithm is derived by extending the original relative reward-strength algorithm to be utilized in the HSLA operating in the general NME. It is shown that the proposed algorithm ensures convergence with probability 1 to the optimal path under a certain type of the NME. Several computer-simulation results, which have been carried out in order to compare the relative performance of the proposed algorithm in some NMEs against those of the two of the fastest algorithms today, confirm the effectiveness of the proposed algorithm. PMID:16903364
Modelling approaches for coastal simulation based on cellular automata: the need and potential.
Dearing, J A; Richmond, N; Plater, A J; Wolf, J; Prandle, D; Coulthard, T J
2006-04-15
The paper summarizes the theoretical and practical needs for cellular automata (CA)-type models in coastal simulation, and describes early steps in the development of a CA-based model for estuarine sedimentation. It describes the key approaches and formulae used for tidal, wave and sediment processes in a prototype integrated cellular model for coastal simulation designed to simulate estuary sedimentary responses during the tidal cycle in the short-term and climate driven changes in sea-level in the long-term. Results of simple model testing for both one-dimensional and two-dimensional models, and a preliminary parameterization for the Blackwater Estuary, UK, are shown. These reveal a good degree of success in using a CA-type model for water and sediment transport as a function of water level and wave height, but tidal current vectors are not effectively simulated in the approach used. The research confirms that a CA-type model for the estuarine sediment system is feasible, with a real prospect for coupling to existing catchment and nearshore beach/cliff models to produce integrated coastal simulators of sediment response to climate, sea-level change and human actions. PMID:16537155
Setny, Piotr; Zacharias, Martin
2010-07-01
A simple, semiheuristic solvation model based on a discrete, BCC grid of solvent cells has been presented. The model utilizes a mean field approach for the calculation of solute-solvent and solvent-solvent interaction energies and a cellular automata based algorithm for the prediction of solvent distribution in the presence of solute. The construction of the effective Hamiltonian for a solvent cell provides an explicit coupling between orientation-dependent water-solute electrostatic interactions and water-water hydrogen bonding. The water-solute dispersion interaction is also explicitly taken into account. The model does not depend on any arbitrary definition of the solute-solvent interface nor does it use a microscopic surface tension for the calculation of nonpolar contributions to the hydration free energies. It is demonstrated that the model provides satisfactory predictions of hydration free energies for drug-like molecules and is able to reproduce the distribution of buried water molecules within protein structures. The model is computationally efficient and is applicable to arbitrary molecules described by atomistic force field. PMID:20552986
Design Pattern Mining Using Distributed Learning Automata and DNA Sequence Alignment
Esmaeilpour, Mansour; Naderifar, Vahideh; Shukur, Zarina
2014-01-01
Context Over the last decade, design patterns have been used extensively to generate reusable solutions to frequently encountered problems in software engineering and object oriented programming. A design pattern is a repeatable software design solution that provides a template for solving various instances of a general problem. Objective This paper describes a new method for pattern mining, isolating design patterns and relationship between them; and a related tool, DLA-DNA for all implemented pattern and all projects used for evaluation. DLA-DNA achieves acceptable precision and recall instead of other evaluated tools based on distributed learning automata (DLA) and deoxyribonucleic acid (DNA) sequences alignment. Method The proposed method mines structural design patterns in the object oriented source code and extracts the strong and weak relationships between them, enabling analyzers and programmers to determine the dependency rate of each object, component, and other section of the code for parameter passing and modular programming. The proposed model can detect design patterns better that available other tools those are Pinot, PTIDEJ and DPJF; and the strengths of their relationships. Results The result demonstrate that whenever the source code is build standard and non-standard, based on the design patterns, then the result of the proposed method is near to DPJF and better that Pinot and PTIDEJ. The proposed model is tested on the several source codes and is compared with other related models and available tools those the results show the precision and recall of the proposed method, averagely 20% and 9.6% are more than Pinot, 27% and 31% are more than PTIDEJ and 3.3% and 2% are more than DPJF respectively. Conclusion The primary idea of the proposed method is organized in two following steps: the first step, elemental design patterns are identified, while at the second step, is composed to recognize actual design patterns. PMID:25243670
Gutowitz, H.A.
1988-11-17
In this lecture the map from a cellular automaton to a sequence of analytical approximations called the local structure theory is described. Connections are drawn between cellular automata and neural network models. It is suggested that the process by which a cellular automaton holds particular probability measures invariant is an appropriate model for biological memory. 20 figs.
Query Monitoring and Analysis for Database Privacy - A Security Automata Model Approach
Kumar, Anand; Ligatti, Jay; Tu, Yi-Cheng
2015-01-01
Privacy and usage restriction issues are important when valuable data are exchanged or acquired by different organizations. Standard access control mechanisms either restrict or completely grant access to valuable data. On the other hand, data obfuscation limits the overall usability and may result in loss of total value. There are no standard policy enforcement mechanisms for data acquired through mutual and copyright agreements. In practice, many different types of policies can be enforced in protecting data privacy. Hence there is the need for an unified framework that encapsulates multiple suites of policies to protect the data. We present our vision of an architecture named security automata model (SAM) to enforce privacy-preserving policies and usage restrictions. SAM analyzes the input queries and their outputs to enforce various policies, liberating data owners from the burden of monitoring data access. SAM allows administrators to specify various policies and enforces them to monitor queries and control the data access. Our goal is to address the problems of data usage control and protection through privacy policies that can be defined, enforced, and integrated with the existing access control mechanisms using SAM. In this paper, we lay out the theoretical foundation of SAM, which is based on an automata named Mandatory Result Automata. We also discuss the major challenges of implementing SAM in a real-world database environment as well as ideas to meet such challenges. PMID:26997936
Learning deterministic finite automata with a smart state labeling evolutionary algorithm.
Lucas, Simon M; Reynolds, T Jeff
2005-07-01
Learning a Deterministic Finite Automaton (DFA) from a training set of labeled strings is a hard task that has been much studied within the machine learning community. It is equivalent to learning a regular language by example and has applications in language modeling. In this paper, we describe a novel evolutionary method for learning DFA that evolves only the transition matrix and uses a simple deterministic procedure to optimally assign state labels. We compare its performance with the Evidence Driven State Merging (EDSM) algorithm, one of the most powerful known DFA learning algorithms. We present results on random DFA induction problems of varying target size and training set density. We also studythe effects of noisy training data on the evolutionary approach and on EDSM. On noise-free data, we find that our evolutionary method outperforms EDSM on small sparse data sets. In the case of noisy training data, we find that our evolutionary method consistently outperforms EDSM, as well as other significant methods submitted to two recent competitions. PMID:16013754
Modelling the role of nucleation on recrystallization kinetics: A cellular automata approach
NASA Astrophysics Data System (ADS)
Tripathy, Haraprasanna; Rai, Arun Kumar; Hajra, Raj Narayan; Raju, Subramanian; Saibaba, Saroja
2016-05-01
In present study, a two dimensional cellular automata (CA) simulation has been carried out to study the effect of nucleation mode on the kinetics of recrystallization and microstructure evolution in an austenitic stainless steel. Two different nucleation modes i.e. site saturation and continuous nucleation with interface control growth mechanism has been considered in this modified CA algorithm. The observed Avrami exponent for both nucleation modes shows a better agreement with the theoretical predicted values. The site saturated nucleation mode shows a nearly consistent value of Avrami exponent, whereas in the case of continuous nucleation the exponent shows a little variation during transformation. The simulations in the present work can be applied for the optimization of microstructure and properties in austenitic steels.
NASA Astrophysics Data System (ADS)
Alonso-Sanz, Ramón; Adamatzky, Andy
Actin is a globular protein which forms long polar filaments in eukaryotic. The actin filaments play the roles of cytoskeleton, motility units, information processing and learning. We model actin filament as a double chain of finite state machines, nodes, which take states “0” and “1”. The states are abstractions of absence and presence of a subthreshold charge on actin units corresponding to the nodes. All nodes update their state in parallel to discrete time. A node updates its current state depending on states of two closest neighbors in the node chain and two closest neighbors in the complementary chain. Previous models of actin automata consider momentary state transitions of nodes. We enrich the actin automata model by assuming that states of nodes depend not only on the current states of neighboring node but also on their past states. Thus, we assess the effect of memory of past states on the dynamics of acting automata. We demonstrate in computational experiments that memory slows down propagation of perturbations, decrease entropy of space-time patterns generated, transforms traveling localizations to stationary oscillators, and stationary oscillations to still patterns.
Dynamics of the HIV infection under antiretroviral therapy: A cellular automata approach
NASA Astrophysics Data System (ADS)
González, Ramón E. R.; Coutinho, Sérgio; Zorzenon dos Santos, Rita Maria; de Figueirêdo, Pedro Hugo
2013-10-01
The dynamics of human immunodeficiency virus infection under antiretroviral therapy is investigated using a cellular automata model where the effectiveness of each drug is self-adjusted by the concentration of CD4+ T infected cells present at each time step. The effectiveness of the drugs and the infected cell concentration at the beginning of treatment are the control parameters of the cell population’s dynamics during therapy. The model allows describing processes of mono and combined therapies. The dynamics that emerges from this model when considering combined antiretroviral therapies reproduces with fair qualitative agreement the phases and different time scales of the process. As observed in clinical data, the results reproduce the significant decrease in the population of infected cells and a concomitant increase of the population of healthy cells in a short timescale (weeks) after the initiation of treatment. Over long time scales, early treatment with potent drugs may lead to undetectable levels of infection. For late treatment or treatments starting with a low density of CD4+ T healthy cells it was observed that the treatment may lead to a steady state in which the T cell counts are above the threshold associated with the onset of AIDS. The results obtained are validated through comparison to available clinical trial data.
Modeling the “learning process” of the teacher in a tutorial-like system using learning automata.
Oommen, B John; Hashem, M Khaled
2013-12-01
Unlike the field of tutorial systems, where a real-life student interacts and learns from a software system, our research focuses on a new philosophy in which no entity needs to be a real-life individual. Such systems are termed as tutorial-like systems, and research in this field endeavors to model every component of the system using an appropriate learning model [in our case, a learning automaton (LA)].1 While models for the student, the domain, the teacher, etc., have been presented elsewhere, the aim of this paper is to present a new approach to model how the teacher, in this paradigm, of our tutorial-like system "learns and improves his "teaching skills" while being himself an integral component of the system. We propose to model the "learning process" of the teacher by using a higher level LA, referred to as the metateacher, whose task is to assist the teacher himself. Ultimately, the intention is that the latter can communicate the teaching material to the student(s) in a manner customized to the particular student's ability and progress. In short, the teacher will infer the progress of the student and initiate a strategy by which he can "custom-communicate" the material to each individual student. The results that we present in a simulated environment validate the model for the teacher and for the metateacher. The use of the latter can be seen to significantly improve the teaching abilities of the teacher. PMID:23757589
Mitochondrial fusion through membrane automata.
Giannakis, Konstantinos; Andronikos, Theodore
2015-01-01
Studies have shown that malfunctions in mitochondrial processes can be blamed for diseases. However, the mechanism behind these operations is yet not sufficiently clear. In this work we present a novel approach to describe a biomolecular model for mitochondrial fusion using notions from the membrane computing. We use a case study defined in BioAmbient calculus and we show how to translate it in terms of a P automata variant. We combine brane calculi with (mem)brane automata to produce a new scheme capable of describing simple, realistic models. We propose the further use of similar methods and the test of other biomolecular models with the same behaviour. PMID:25417022
NASA Technical Reports Server (NTRS)
Hinchey, Michael G. (Inventor); Margaria, Tiziana (Inventor); Rash, James L. (Inventor); Rouff, Christopher A. (Inventor); Steffen, Bernard (Inventor)
2010-01-01
Systems, methods and apparatus are provided through which in some embodiments, automata learning algorithms and techniques are implemented to generate a more complete set of scenarios for requirements based programming. More specifically, a CSP-based, syntax-oriented model construction, which requires the support of a theorem prover, is complemented by model extrapolation, via automata learning. This may support the systematic completion of the requirements, the nature of the requirement being partial, which provides focus on the most prominent scenarios. This may generalize requirement skeletons by extrapolation and may indicate by way of automatically generated traces where the requirement specification is too loose and additional information is required.
NASA Astrophysics Data System (ADS)
González, Ramón E. R.; de Figueirêdo, Pedro Hugo; Coutinho, Sérgio
2013-10-01
We study a cellular automata model to test the timing of antiretroviral therapy strategies for the dynamics of infection with human immunodeficiency virus (HIV). We focus on the role of virus diffusion when its population is included in previous cellular automata model that describes the dynamics of the lymphocytes cells population during infection. This inclusion allows us to consider the spread of infection by the virus-cell interaction, beyond that which occurs by cell-cell contagion. The results show an acceleration of the infectious process in the absence of treatment, but show better efficiency in reducing the risk of the onset of AIDS when combined antiretroviral therapies are used even with drugs of low effectiveness. Comparison of results with clinical data supports the conclusions of this study.
Two-lane traffic rules for cellular automata: A systematic approach
Nagel, K. |; Wolf, D.E. |; Wagner, P. |; Simon, P.
1997-11-05
Microscopic modeling of multi-lane traffic is usually done by applying heuristic lane changing rules, and often with unsatisfying results. Recently, a cellular automation model for two-lane traffic was able to overcome some of these problems and to produce a correct density inversion at densities somewhat below the maximum flow density. In this paper, the authors summarize different approaches to lane changing and their results, and propose a general scheme, according to which realistic lane changing rules can be developed. They test this scheme by applying it to several different lane changing rules, which, in spite of their differences, generate similar and realistic results. The authors thus conclude that, for producing realistic results, the logical structure of the lane changing rules, as proposed here, is at least as important as the microscopic details of the rules.
A multi-layer cellular automata approach for algorithmic generation of virtual case studies: VIBe.
Sitzenfrei, R; Fach, S; Kinzel, H; Rauch, W
2010-01-01
Analyses of case studies are used to evaluate new or existing technologies, measures or strategies with regard to their impact on the overall process. However, data availability is limited and hence, new technologies, measures or strategies can only be tested on a limited number of case studies. Owing to the specific boundary conditions and system properties of each single case study, results can hardly be generalized or transferred to other boundary conditions. virtual infrastructure benchmarking (VIBe) is a software tool which algorithmically generates virtual case studies (VCSs) for urban water systems. System descriptions needed for evaluation are extracted from VIBe whose parameters are based on real world case studies and literature. As a result VIBe writes Input files for water simulation software as EPANET and EPA SWMM. With such input files numerous simulations can be performed and the results can be benchmarked and analysed stochastically at a city scale. In this work the approach of VIBe is applied with parameters according to a section of the Inn valley and therewith 1,000 VCSs are generated and evaluated. A comparison of the VCSs with data of real world case studies shows that the real world case studies fit within the parameter ranges of the VCSs. Consequently, VIBe tackles the problem of limited availability of case study data. PMID:20057089
Infrared image enhancement using Cellular Automata
NASA Astrophysics Data System (ADS)
Qi, Wei; Han, Jing; Zhang, Yi; Bai, Lian-fa
2016-05-01
Image enhancement is a crucial technique for infrared images. The clear image details are important for improving the quality of infrared images in computer vision. In this paper, we propose a new enhancement method based on two priors via Cellular Automata. First, we directly learn the gradient distribution prior from the images via Cellular Automata. Second, considering the importance of image details, we propose a new gradient distribution error to encode the structure information via Cellular Automata. Finally, an iterative method is applied to remap the original image based on two priors, further improving the quality of enhanced image. Our method is simple in implementation, easy to understand, extensible to accommodate other vision tasks, and produces more accurate results. Experiments show that the proposed method performs better than other methods using qualitative and quantitative measures.
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study.
Tîrnăucă, Cristina; Montaña, José L; Ontañón, Santiago; González, Avelino J; Pardo, Luis M
2016-01-01
Imagine an agent that performs tasks according to different strategies. The goal of Behavioral Recognition (BR) is to identify which of the available strategies is the one being used by the agent, by simply observing the agent's actions and the environmental conditions during a certain period of time. The goal of Behavioral Cloning (BC) is more ambitious. In this last case, the learner must be able to build a model of the behavior of the agent. In both settings, the only assumption is that the learner has access to a training set that contains instances of observed behavioral traces for each available strategy. This paper studies a machine learning approach based on Probabilistic Finite Automata (PFAs), capable of achieving both the recognition and cloning tasks. We evaluate the performance of PFAs in the context of a simulated learning environment (in this case, a virtual Roomba vacuum cleaner robot), and compare it with a collection of other machine learning approaches. PMID:27347956
Statistical Mechanics of Surjective Cellular Automata
NASA Astrophysics Data System (ADS)
Kari, Jarkko; Taati, Siamak
2015-09-01
Reversible cellular automata are seen as microscopic physical models, and their states of macroscopic equilibrium are described using invariant probability measures. We establish a connection between the invariance of Gibbs measures and the conservation of additive quantities in surjective cellular automata. Namely, we show that the simplex of shift-invariant Gibbs measures associated to a Hamiltonian is invariant under a surjective cellular automaton if and only if the cellular automaton conserves the Hamiltonian. A special case is the (well-known) invariance of the uniform Bernoulli measure under surjective cellular automata, which corresponds to the conservation of the trivial Hamiltonian. As an application, we obtain results indicating the lack of (non-trivial) Gibbs or Markov invariant measures for "sufficiently chaotic" cellular automata. We discuss the relevance of the randomization property of algebraic cellular automata to the problem of approach to macroscopic equilibrium, and pose several open questions. As an aside, a shift-invariant pre-image of a Gibbs measure under a pre-injective factor map between shifts of finite type turns out to be always a Gibbs measure. We provide a sufficient condition under which the image of a Gibbs measure under a pre-injective factor map is not a Gibbs measure. We point out a potential application of pre-injective factor maps as a tool in the study of phase transitions in statistical mechanical models.
Cellular-automata method for phase unwrapping
Ghiglia, D.C.; Mastin, G.A.; Romero, L.A.
1987-01-01
Research into two-dimensional phase unwrapping has uncovered interesting and troublesome inconsistencies that cause path-dependent results. Cellular automata, which are simple, discrete mathematical systems, offered promise of computation in nondirectional, parallel manner. A cellular automaton was discovered that can unwrap consistent phase data in n dimensions in a path-independent manner and can automatically accommodate noise-induced (pointlike) inconsistencies and arbitrary boundary conditions (region partitioning). For data with regional (nonpointlike) inconsistencies, no phase-unwrapping algorithm will converge, including the cellular-automata approach. However, the automata method permits more simple visualization of the regional inconsistencies. Examples of its behavior on one- and two-dimensional data are presented.
Automata-Based Verification of Temporal Properties on Running Programs
NASA Technical Reports Server (NTRS)
Giannakopoulou, Dimitra; Havelund, Klaus; Lan, Sonie (Technical Monitor)
2001-01-01
This paper presents an approach to checking a running program against its Linear Temporal Logic (LTL) specifications. LTL is a widely used logic for expressing properties of programs viewed as sets of executions. Our approach consists of translating LTL formulae to finite-state automata, which are used as observers of the program behavior. The translation algorithm we propose modifies standard LTL to Buchi automata conversion techniques to generate automata that check finite program traces. The algorithm has been implemented in a tool, which has been integrated with the generic JPaX framework for runtime analysis of Java programs.
Fuzzy tree automata and syntactic pattern recognition.
Lee, E T
1982-04-01
An approach of representing patterns by trees and processing these trees by fuzzy tree automata is described. Fuzzy tree automata are defined and investigated. The results include that the class of fuzzy root-to-frontier recognizable ¿-trees is closed under intersection, union, and complementation. Thus, the class of fuzzy root-to-frontier recognizable ¿-trees forms a Boolean algebra. Fuzzy tree automata are applied to processing fuzzy tree representation of patterns based on syntactic pattern recognition. The grade of acceptance is defined and investigated. Quantitative measures of ``approximate isosceles triangle,'' ``approximate elongated isosceles triangle,'' ``approximate rectangle,'' and ``approximate cross'' are defined and used in the illustrative examples of this approach. By using these quantitative measures, a house, a house with high roof, and a church are also presented as illustrative examples. In addition, three fuzzy tree automata are constructed which have the capability of processing the fuzzy tree representations of ``fuzzy houses,'' ``houses with high roofs,'' and ``fuzzy churches,'' respectively. The results may have useful applications in pattern recognition, image processing, artificial intelligence, pattern database design and processing, image science, and pictorial information systems. PMID:21869062
Probabilistic cellular automata.
Agapie, Alexandru; Andreica, Anca; Giuclea, Marius
2014-09-01
Cellular automata are binary lattices used for modeling complex dynamical systems. The automaton evolves iteratively from one configuration to another, using some local transition rule based on the number of ones in the neighborhood of each cell. With respect to the number of cells allowed to change per iteration, we speak of either synchronous or asynchronous automata. If randomness is involved to some degree in the transition rule, we speak of probabilistic automata, otherwise they are called deterministic. With either type of cellular automaton we are dealing with, the main theoretical challenge stays the same: starting from an arbitrary initial configuration, predict (with highest accuracy) the end configuration. If the automaton is deterministic, the outcome simplifies to one of two configurations, all zeros or all ones. If the automaton is probabilistic, the whole process is modeled by a finite homogeneous Markov chain, and the outcome is the corresponding stationary distribution. Based on our previous results for the asynchronous case-connecting the probability of a configuration in the stationary distribution to its number of zero-one borders-the article offers both numerical and theoretical insight into the long-term behavior of synchronous cellular automata. PMID:24999557
NASA Technical Reports Server (NTRS)
Havelund, Klaus
2014-01-01
The field of runtime verification has during the last decade seen a multitude of systems for monitoring event sequences (traces) emitted by a running system. The objective is to ensure correctness of a system by checking its execution traces against formal specifications representing requirements. A special challenge is data parameterized events, where monitors have to keep track of the combination of control states as well as data constraints, relating events and the data they carry across time points. This poses a challenge wrt. efficiency of monitors, as well as expressiveness of logics. Data automata is a form of automata where states are parameterized with data, supporting monitoring of data parameterized events. We describe the full details of a very simple API in the Scala programming language, an internal DSL (Domain-Specific Language), implementing data automata. The small implementation suggests a design pattern. Data automata allow transition conditions to refer to other states than the source state, and allow target states of transitions to be inlined, offering a temporal logic flavored notation. An embedding of a logic in a high-level language like Scala in addition allows monitors to be programmed using all of Scala's language constructs, offering the full flexibility of a programming language. The framework is demonstrated on an XML processing scenario previously addressed in related work.
Approach to learning disability.
Kulkarni, M; Kalantre, S; Upadhye, S; Karande, S; Ahuja, S
2001-06-01
Learning disabilities (LD) is one of the important causes of poor academic performance in school going children. Learning disabilities are developmental disorders that usually manifest during the period of normal education. These disabilities create a significant gap between the true potential and day to day performance of an individual. Dyslexia, dysgraphia and dyscalculia denote the problem related to reading, writing and mathematics. Perinatal problems are certain neurological conditions, known to be associated with LD; however, genetic predisposition seems to be the most probable etiological factors. Evaluation of a child suspected to be having LD consists of medical examination, vision and hearing test analysis of school performance. The psycho-behaviour assessment and education testing are essential in the process of diagnosis. The experienced persons in the field of LD should interpret the results of such tests. With Individualized Remedial Education Plan (IEP) most children learn to cope up with disability and may get integrated in a regular steam. PMID:11450386
Hybrid Approach to Reinforcement Learning
NASA Astrophysics Data System (ADS)
Boulebtateche, Brahim; Fezari, Mourad; Boughazi, Mohamed
2008-06-01
Reinforcement Learning (RL) is a general framework in which an autonomous agent tries to learn an optimal policy of actions from direct interaction with the surrounding environment (RL). However, one difficulty for the application of RL control is its slow convergence, especially in environments with continuous state space. In this paper, a modified structure of RL is proposed to speed up reinforcement learning control. In this approach, supervision technique is combined with the standard Q-learning, a model-free algorithm of reinforcement learning. The a priori information is provided to the RL by an optimal LQ-controller, used to indicate preferred actions at intermittent times. It is shown that the convergence speed of the supervised RL agent is greatly improved compared to the conventional Q-Learning algorithm. Simulation work and results on the cart-pole balancing problem are given to illustrate the efficiency of the proposed method.
Game level layout generation using evolved cellular automata
NASA Astrophysics Data System (ADS)
Pech, Andrew; Masek, Martin; Lam, Chiou-Peng; Hingston, Philip
2016-01-01
Design of level layouts typically involves the production of a set of levels which are different, yet display a consistent style based on the purpose of a particular level. In this paper, a new approach to the generation of unique level layouts, based on a target set of attributes, is presented. These attributes, which are learned automatically from an example layout, are used for the off-line evolution of a set of cellular automata rules. These rules can then be used for the real-time generation of level layouts that meet the target parameters. The approach is demonstrated on a set of maze-like level layouts. Results are presented to show the effect of various CA parameters and rule representation.
Predictability in cellular automata.
Agapie, Alexandru; Andreica, Anca; Chira, Camelia; Giuclea, Marius
2014-01-01
Modelled as finite homogeneous Markov chains, probabilistic cellular automata with local transition probabilities in (0, 1) always posses a stationary distribution. This result alone is not very helpful when it comes to predicting the final configuration; one needs also a formula connecting the probabilities in the stationary distribution to some intrinsic feature of the lattice configuration. Previous results on the asynchronous cellular automata have showed that such feature really exists. It is the number of zero-one borders within the automaton's binary configuration. An exponential formula in the number of zero-one borders has been proved for the 1-D, 2-D and 3-D asynchronous automata with neighborhood three, five and seven, respectively. We perform computer experiments on a synchronous cellular automaton to check whether the empirical distribution obeys also that theoretical formula. The numerical results indicate a perfect fit for neighbourhood three and five, which opens the way for a rigorous proof of the formula in this new, synchronous case. PMID:25271778
The Wonder Approach to learning.
L'Ecuyer, Catherine
2014-01-01
Wonder, innate in the child, is an inner desire to learn that awaits reality in order to be awakened. Wonder is at the origin of reality-based consciousness, thus of learning. The scope of wonder, which occurs at a metaphysical level, is greater than that of curiosity. Unfortunate misinterpretations of neuroscience have led to false brain-based ideas in the field of education, all of these based on the scientifically wrong assumption that children's learning depends on an enriched environment. These beliefs have re-enforced the Behaviorist Approach to education and to parenting and have contributed to deadening our children's sense of wonder. We suggest wonder as the center of all motivation and action in the child. Wonder is what makes life genuinely personal. Beauty is what triggers wonder. Wonder attunes to beauty through sensitivity and is unfolded by secure attachment. When wonder, beauty, sensitivity and secure attachment are present, learning is meaningful. On the contrary, when there is no volitional dimension involved (no wonder), no end or meaning (no beauty) and no trusting predisposition (secure attachment), the rigid and limiting mechanical process of so-called learning through mere repetition become a deadening and alienating routine. This could be described as training, not as learning, because it does not contemplate the human being as a whole. PMID:25339882
The Wonder Approach to learning
L’Ecuyer, Catherine
2014-01-01
Wonder, innate in the child, is an inner desire to learn that awaits reality in order to be awakened. Wonder is at the origin of reality-based consciousness, thus of learning. The scope of wonder, which occurs at a metaphysical level, is greater than that of curiosity. Unfortunate misinterpretations of neuroscience have led to false brain-based ideas in the field of education, all of these based on the scientifically wrong assumption that children’s learning depends on an enriched environment. These beliefs have re-enforced the Behaviorist Approach to education and to parenting and have contributed to deadening our children’s sense of wonder. We suggest wonder as the center of all motivation and action in the child. Wonder is what makes life genuinely personal. Beauty is what triggers wonder. Wonder attunes to beauty through sensitivity and is unfolded by secure attachment. When wonder, beauty, sensitivity and secure attachment are present, learning is meaningful. On the contrary, when there is no volitional dimension involved (no wonder), no end or meaning (no beauty) and no trusting predisposition (secure attachment), the rigid and limiting mechanical process of so-called learning through mere repetition become a deadening and alienating routine. This could be described as training, not as learning, because it does not contemplate the human being as a whole. PMID:25339882
NASA Astrophysics Data System (ADS)
Bagnoli, Franco; Rechtman, Raúl; El Yacoubi, Samira
2012-12-01
We study the problem of master-slave synchronization and control of totalistic cellular automata. The synchronization mechanism is that of setting a fraction of sites of the slave system equal to those of the master one (pinching synchronization). The synchronization observable is the distance between the two configurations. We present three control strategies that exploit local information (the number of nonzero first-order Boolean derivatives) in order to choose the sites to be synchronized. When no local information is used, we speak of simple pinching synchronization. We find the critical properties of control and discuss the best control strategy compared with simple synchronization.
Clemente-Juan, Juan Modesto; Palii, Andrew; Coronado, Eugenio; Tsukerblat, Boris
2016-08-01
In this article, we focus on the electron-vibrational problem of the tetrameric mixed-valence (MV) complexes proposed for implementation as four-dot molecular quantum cellular automata (mQCA).1 Although the adiabatic approximation explored in ref 2 is an appropriate tool for the qualitative analysis of the basic characteristics of mQCA, like vibronic trapping of the electrons encoding binary information and cell-cell response, it loses its accuracy providing moderate vibronic coupling and fails in the description of the discrete pattern of the vibronic levels. Therefore, a precise solution of the quantum-mechanical vibronic problem is of primary importance for the evaluation of the shapes of the electron transfer optical absorption bands and quantitative analysis of the main parameters of tetrameric quantum cells. Here, we go beyond the Born-Oppenheimer paradigm and present a solution of the quantum-mechanical pseudo Jahn-Teller (JT) vibronic problem in bielectronic MV species (exemplified by the tetra-ruthenium complexes) based on the recently developed symmetry-assisted approach.3,4 The mathematical approach to the vibronic eigenproblem takes into consideration the point symmetry basis, and therefore, the total matrix of the JT Hamiltonian is blocked to the maximum extent. The submatrices correspond to the irreducible representations (irreps) of the point group. With this tool, we also extend the theory of the mQCA cell beyond the limit of prevailing Coulomb repulsion in the electronic pair (adopted in ref 2), and therefore, the general pseudo-JT problems for spin-singlet ((1)B1g, 2(1)A1g, (1)B2g, (1)Eu) ⊗ (b1g + eu) and spin-triplet states ((3)A2g, (3)B1g, 2(3)Eu) ⊗ (b1g + eu) in a square-planar bielectronic system are solved. The obtained symmetry-adapted electron-vibrational functions are employed for the calculation of the profiles (shape functions) of the charge transfer absorption bands in the tetrameric MV complexes and for the discussion of the
Weighted Watson-Crick automata
NASA Astrophysics Data System (ADS)
Tamrin, Mohd Izzuddin Mohd; Turaev, Sherzod; Sembok, Tengku Mohd Tengku
2014-07-01
There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.
Weighted Watson-Crick automata
Tamrin, Mohd Izzuddin Mohd; Turaev, Sherzod; Sembok, Tengku Mohd Tengku
2014-07-10
There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.
An Ecological Approach to Learning Dynamics
ERIC Educational Resources Information Center
Normak, Peeter; Pata, Kai; Kaipainen, Mauri
2012-01-01
New approaches to emergent learner-directed learning design can be strengthened with a theoretical framework that considers learning as a dynamic process. We propose an approach that models a learning process using a set of spatial concepts: learning space, position of a learner, niche, perspective, step, path, direction of a step and step…
Global properties of cellular automata
Jen, E.
1986-04-01
Cellular automata are discrete mathematical systems that generate diverse, often complicated, behavior using simple deterministic rules. Analysis of the local structure of these rules makes possible a description of the global properties of the associated automata. A class of cellular automata that generate infinitely many aperoidic temporal sequences is defined,a s is the set of rules for which inverses exist. Necessary and sufficient conditions are derived characterizing the classes of ''nearest-neighbor'' rules for which arbitrary finite initial conditions (i) evolve to a homogeneous state; (ii) generate at least one constant temporal sequence.
Modeling biological pathway dynamics with timed automata.
Schivo, Stefano; Scholma, Jetse; Wanders, Brend; Urquidi Camacho, Ricardo A; van der Vet, Paul E; Karperien, Marcel; Langerak, Rom; van de Pol, Jaco; Post, Janine N
2014-05-01
Living cells are constantly subjected to a plethora of environmental stimuli that require integration into an appropriate cellular response. This integration takes place through signal transduction events that form tightly interconnected networks. The understanding of these networks requires capturing their dynamics through computational support and models. ANIMO (analysis of Networks with Interactive Modeling) is a tool that enables the construction and exploration of executable models of biological networks, helping to derive hypotheses and to plan wet-lab experiments. The tool is based on the formalism of Timed Automata, which can be analyzed via the UPPAAL model checker. Thanks to Timed Automata, we can provide a formal semantics for the domain-specific language used to represent signaling networks. This enforces precision and uniformity in the definition of signaling pathways, contributing to the integration of isolated signaling events into complex network models. We propose an approach to discretization of reaction kinetics that allows us to efficiently use UPPAAL as the computational engine to explore the dynamic behavior of the network of interest. A user-friendly interface hides the use of Timed Automata from the user, while keeping the expressive power intact. Abstraction to single-parameter kinetics speeds up construction of models that remain faithful enough to provide meaningful insight. The resulting dynamic behavior of the network components is displayed graphically, allowing for an intuitive and interactive modeling experience. PMID:24808226
Configurable Cellular Automata for Pseudorandom Number Generation
NASA Astrophysics Data System (ADS)
Quieta, Marie Therese; Guan, Sheng-Uei
This paper proposes a generalized structure of cellular automata (CA) — the configurable cellular automata (CoCA). With selected properties from programmable CA (PCA) and controllable CA (CCA), a new approach to cellular automata is developed. In CoCA, the cells are dynamically reconfigured at run-time via a control CA. Reconfiguration of a cell simply means varying the properties of that cell with time. Some examples of properties to be reconfigured are rule selection, boundary condition, and radius. While the objective of this paper is to propose CoCA as a new CA method, the main focus is to design a CoCA that can function as a good pseudorandom number generator (PRNG). As a PRNG, CoCA can be a suitable candidate as it can pass 17 out of 18 Diehard tests with 31 cells. CoCA PRNG's performance based on Diehard test is considered superior over other CA PRNG works. Moreover, CoCA opens new rooms for research not only in the field of random number generation, but in modeling complex systems as well.
Behavioral Modeling Based on Probabilistic Finite Automata: An Empirical Study †
Tîrnăucă, Cristina; Montaña, José L.; Ontañón, Santiago; González, Avelino J.; Pardo, Luis M.
2016-01-01
Imagine an agent that performs tasks according to different strategies. The goal of Behavioral Recognition (BR) is to identify which of the available strategies is the one being used by the agent, by simply observing the agent’s actions and the environmental conditions during a certain period of time. The goal of Behavioral Cloning (BC) is more ambitious. In this last case, the learner must be able to build a model of the behavior of the agent. In both settings, the only assumption is that the learner has access to a training set that contains instances of observed behavioral traces for each available strategy. This paper studies a machine learning approach based on Probabilistic Finite Automata (PFAs), capable of achieving both the recognition and cloning tasks. We evaluate the performance of PFAs in the context of a simulated learning environment (in this case, a virtual Roomba vacuum cleaner robot), and compare it with a collection of other machine learning approaches. PMID:27347956
Efficient Translation of LTL Formulae into Buchi Automata
NASA Technical Reports Server (NTRS)
Giannakopoulou, Dimitra; Lerda, Flavio
2001-01-01
Model checking is a fully automated technique for checking that a system satisfies a set of required properties. With explicit-state model checkers, properties are typically defined in linear-time temporal logic (LTL), and are translated into B chi automata in order to be checked. This report presents how we have combined and improved existing techniques to obtain an efficient LTL to B chi automata translator. In particular, we optimize the core of existing tableau-based approaches to generate significantly smaller automata. Our approach has been implemented and is being released as part of the Java PathFinder software (JPF), an explicit state model checker under development at the NASA Ames Research Center.
Conceptions of Learning and Approaches to Learning in Portuguese Students
ERIC Educational Resources Information Center
Duarte, Antonio M.
2007-01-01
The article describes a study that attempted to characterise Portuguese students' conceptions of learning and approaches to learning. A sample of university students answered open questions on the meaning, process and context of learning. Results, derived from content analysis, replicate most conceptions of learning described by phenomenographical…
Design and Evaluation of Two Blended Learning Approaches: Lessons Learned
ERIC Educational Resources Information Center
Cheung, Wing Sum; Hew, Khe Foon
2011-01-01
In this paper, we share two blended learning approaches used at the National Institute of Education in Singapore. We have been using these two approaches in the last twelve years in many courses ranging from the diploma to graduate programs. For the first blended learning approach, we integrated one asynchronous communication tool with face to…
NASA Astrophysics Data System (ADS)
Porod, Wolfgang; Lent, Craig S.; Bernstein, Gary H.
1994-06-01
The Notre Dame group has developed a new paradigm for ultra-dense and ultra-fast information processing in nanoelectronic systems. These Quantum Cellular Automata (QCA's) are the first concrete proposal for a technology based on arrays of coupled quantum dots. The basic building block of these cellular arrays is the Notre Dame Logic Cell, as it has been called in the literature. The phenomenon of Coulomb exclusion, which is a synergistic interplay of quantum confinement and Coulomb interaction, leads to a bistable behavior of each cell which makes possible their use in large-scale cellular arrays. The physical interaction between neighboring cells has been exploited to implement logic functions. New functionality may be achieved in this fashion, and the Notre Dame group invented a versatile majority logic gate. In a series of papers, the feasibility of QCA wires, wire crossing, inverters, and Boolean logic gates was demonstrated. A major finding is that all logic functions may be integrated in a hierarchial fashion which allows the design of complicated QCA structures. The most complicated system which was simulated to date is a one-bit full adder consisting of some 200 cells. In addition to exploring these new concepts, efforts are under way to physically realize such structures both in semiconductor and metal systems. Extensive modeling work of semiconductor quantum dot structures has helped identify optimum design parameters for QCA experimental implementations.
Project Management Approaches for Online Learning Design
ERIC Educational Resources Information Center
Eby, Gulsun; Yuzer, T. Volkan
2013-01-01
Developments in online learning and its design are areas that continue to grow in order to enhance students' learning environments and experiences. However, in the implementation of new technologies, the importance of properly and fairly overseeing these courses is often undervalued. "Project Management Approaches for Online Learning Design"…
E-Learning Approach in Teacher Training
ERIC Educational Resources Information Center
Yucel, Seda A.
2006-01-01
There has been an increasing interest in e-learning in teacher training at universities during the last ten years. With the developing technology, educational methods have differed as well as many other processes. Firstly, a definition on e-learning as a new approach should be given. E-learning could shortly be defined as a web-based educational…
Quantum cellular automata without particles
NASA Astrophysics Data System (ADS)
Meyer, David A.; Shakeel, Asif
2016-01-01
Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are explicitly interpreted in terms of interacting particles. Similarly, the easiest QCA to construct are quantum lattice gas automata (QLGA). A natural question then is, which QCA are not QLGA? Here we construct a nontrivial example of such a QCA; it provides a simple model in 1 +1 dimensions with no particle interpretation at the scale where the QCA dynamics are homogeneous.
NASA Astrophysics Data System (ADS)
Mendicino, Giuseppe; Pedace, Jessica; Senatore, Alfonso
2015-04-01
Cellular Automata are often used for modeling the evolution in time of environmental systems mainly because they are directly compatible with parallel programming. Nevertheless, defining the optimal time step criterion for integrating forward in time numerical processes can further enhance model computational efficiency. To this aim, a numerical stability analysis of an original overland flow model, within the framework of a fully coupled eco-hydrological system based on the Macroscopic Cellular Automata paradigm, is performed. According to the other modules of the system describing soil water flow, soil-surface-atmosphere fluxes and vegetation dynamics, overland flow model equations were derived through a direct discrete formulation (i.e. no differential equations were discretized), adopting the diffusion wave model as an approximation of the full De Saint Venant equations and including the capability of accounting for specific processes, such as the increasing roughness effects due to vegetation growth or surface-soil water exchanges. Suitable formulations of robust tools usually applied in the stability analyses, such as Courant-Friedrichs-Lewy and von Neumann conditions, were initially derived for the CA-based overland flow model. Afterwards, the theoretical stability conditions were compared to experimental time step constraints through several numerical simulations of a 5-h rain event. Specifically, adopting a constant (i.e. not adaptive) time step for simulations, and discretizing head losses in a way that increases model stability, experimental upper limits preventing numerical instability were found for 13 test cases with different slopes, precipitation intensities, vegetation densities and depths of surface depressions. Even though von Neumann condition and experimental values were well positively correlated, the latter were almost always sensibly lower, excluding cases when free surface gradients tended to zero. Therefore, based on the original method
Cellular Automata and the Humanities.
ERIC Educational Resources Information Center
Gallo, Ernest
1994-01-01
The use of cellular automata to analyze several pre-Socratic hypotheses about the evolution of the physical world is discussed. These hypotheses combine characteristics of both rigorous and metaphoric language. Since the computer demands explicit instructions for each step in the evolution of the automaton, such models can reveal conceptual…
Probabilistic arithmetic automata and their applications.
Marschall, Tobias; Herms, Inke; Kaltenbach, Hans-Michael; Rahmann, Sven
2012-01-01
We present a comprehensive review on probabilistic arithmetic automata (PAAs), a general model to describe chains of operations whose operands depend on chance, along with two algorithms to numerically compute the distribution of the results of such probabilistic calculations. PAAs provide a unifying framework to approach many problems arising in computational biology and elsewhere. We present five different applications, namely 1) pattern matching statistics on random texts, including the computation of the distribution of occurrence counts, waiting times, and clump sizes under hidden Markov background models; 2) exact analysis of window-based pattern matching algorithms; 3) sensitivity of filtration seeds used to detect candidate sequence alignments; 4) length and mass statistics of peptide fragments resulting from enzymatic cleavage reactions; and 5) read length statistics of 454 and IonTorrent sequencing reads. The diversity of these applications indicates the flexibility and unifying character of the presented framework. While the construction of a PAA depends on the particular application, we single out a frequently applicable construction method: We introduce deterministic arithmetic automata (DAAs) to model deterministic calculations on sequences, and demonstrate how to construct a PAA from a given DAA and a finite-memory random text model. This procedure is used for all five discussed applications and greatly simplifies the construction of PAAs. Implementations are available as part of the MoSDi package. Its application programming interface facilitates the rapid development of new applications based on the PAA framework. PMID:22868683
Astrobiological complexity with probabilistic cellular automata.
Vukotić, Branislav; Ćirković, Milan M
2012-08-01
The search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata (PCA) represent the best quantitative framework for modeling the astrobiological history of the Milky Way and its Galactic Habitable Zone. The relevant astrobiological parameters are to be modeled as the elements of the input probability matrix for the PCA kernel. With the underlying simplicity of the cellular automata constructs, this approach enables a quick analysis of large and ambiguous space of the input parameters. We perform a simple clustering analysis of typical astrobiological histories with "Copernican" choice of input parameters and discuss the relevant boundary conditions of practical importance for planning and guiding empirical astrobiological and SETI projects. In addition to showing how the present framework is adaptable to more complex situations and updated observational databases from current and near-future space missions, we demonstrate how numerical results could offer a cautious rationale for continuation of practical SETI searches. PMID:22832998
Astrobiological Complexity with Probabilistic Cellular Automata
NASA Astrophysics Data System (ADS)
Vukotić, Branislav; Ćirković, Milan M.
2012-08-01
The search for extraterrestrial life and intelligence constitutes one of the major endeavors in science, but has yet been quantitatively modeled only rarely and in a cursory and superficial fashion. We argue that probabilistic cellular automata (PCA) represent the best quantitative framework for modeling the astrobiological history of the Milky Way and its Galactic Habitable Zone. The relevant astrobiological parameters are to be modeled as the elements of the input probability matrix for the PCA kernel. With the underlying simplicity of the cellular automata constructs, this approach enables a quick analysis of large and ambiguous space of the input parameters. We perform a simple clustering analysis of typical astrobiological histories with "Copernican" choice of input parameters and discuss the relevant boundary conditions of practical importance for planning and guiding empirical astrobiological and SETI projects. In addition to showing how the present framework is adaptable to more complex situations and updated observational databases from current and near-future space missions, we demonstrate how numerical results could offer a cautious rationale for continuation of practical SETI searches.
Accelerated learning approaches for maintenance training
Erickson, E.J.
1991-01-01
As a training tool, Accelerated Learning techniques have been in use since 1956. Trainers from a variety of applications and disciplines have found success in using Accelerated Learning approaches, such as training aids, positive affirmations, memory aids, room arrangement, color patterns, and music. Some have thought that maintenance training and Accelerated Learning have nothing in common. Recent training applications by industry and education of Accelerated Learning are proving very successful by several standards. This paper cites available resource examples and challenges maintenance trainers to adopt new ideas and concepts to accelerate learning in all training setting. 7 refs.
Learning Families: Intergenerational Approach to Literacy Teaching and Learning
ERIC Educational Resources Information Center
Hanemann, Ulrike, Ed.
2015-01-01
Within a learning family, every member is a lifelong learner. A family literacy and learning approach is more likely to break the intergenerational cycle of low education and inadequate literacy skills, particularly among disadvantaged families and communities. The selection of case studies presented in this compilation show that for an…
Aperiodicity in one-dimensional cellular automata
Jen, E.
1990-01-01
Cellular automata are a class of mathematical systems characterized by discreteness (in space, time, and state values), determinism, and local interaction. A certain class of one-dimensional, binary site-valued, nearest-neighbor automata is shown to generate infinitely many aperiodic temporal sequences from arbitrary finite initial conditions on an infinite lattice. The class of automaton rules that generate aperiodic temporal sequences are characterized by a particular form of injectivity in their interaction rules. Included are the nontrivial linear'' automaton rules (that is, rules for which the superposition principle holds); certain nonlinear automata that retain injectivity properties similar to those of linear automata; and a wider subset of nonlinear automata whose interaction rules satisfy a weaker form of injectivity together with certain symmetry conditions. A technique is outlined here that maps this last set of automata onto a linear automaton, and thereby establishes the aperiodicity of their temporal sequences. 12 refs., 3 figs.
Approaches to Learning in the Workplace
ERIC Educational Resources Information Center
Geertshuis, Susan A.; Fazey, John A.
2006-01-01
Purpose: The aim of this study is to explore approaches to learning in the workplace. Design/methodology/approach: Computer based questionnaires are used with a sample of over 300 employees. Findings: Using a version of the Revised Approaches to Study Inventory (RASI) adapted to workforce development, the factor structure of deep, surface and…
A Learning Cycle Approach To Introducing Osmosis.
ERIC Educational Resources Information Center
Lawson, Anton E.
2000-01-01
Presents an inquiry activity with a learning cycle approach to engage students in testing their own hypotheses about how molecules move through cell membranes. Offers student materials and teacher materials, including teaching tips for each phase of the learning cycle. (Contains 11 references.) (ASK)
Xtoys: Cellular automata on xwindows
Creutz, M.
1995-08-15
Xtoys is a collection of xwindow programs for demonstrating simulations of various statistical models. Included are xising, for the two dimensional Ising model, xpotts, for the q-state Potts model, xautomalab, for a fairly general class of totalistic cellular automata, xsand, for the Bak-Tang-Wiesenfield model of self organized criticality, and xfires, a simple forest fire simulation. The programs should compile on any machine supporting xwindows.
An approach to elemental task learning
Belmans, P
1990-01-01
In this article we deal with the automated learning of tasks by a robotic system through observation of a human operator. Particularly, we explain what is meant by a learning ability in autonomous robots and in teleoperation systems, where several operators and several machines may work in cooperation to perform tasks. We discuss different approaches to learning in these systems and outline the features of the models they are based upon. This leads us to choose an analytical model suited for tasks analysis. We then present the software architecture for our proposed approach and show the first results obtained on sample tests. 5 refs., 9 figs.
A Cognitive Approach to e-Learning
Greitzer, Frank L.; Rice, Douglas M.; Eaton, Sharon L.; Perkins, Michael C.; Scott, Ryan T.; Burnette, John R.; Robertson, Sarah R.
2003-12-01
Like traditional classroom instruction, distributed learning derives from passive training paradigms. Just as student-centered classroom teaching methods have been applied over several decades of classroom instruction, interactive approaches have been encouraged for distributed learning. While implementation of multimedia-based training features may appear to produce active learning, sophisticated use of multimedia features alone does not necessarily enhance learning. This paper describes the results of applying cognitive science principles to enhance learning in a student-centered, distributed learning environment, and lessons learned in developing and delivering this training. Our interactive, scenario-based approach exploits multimedia technology within a systematic, cognitive framework for learning. The basis of the application of cognitive principles is the innovative use of multimedia technology to implement interaction elements. These simple multimedia interactions, which are used to support new concepts, are later combined with other interaction elements to create more complex, integrated practical exercises. This technology-based approach may be applied in a variety of training and education contexts, but is especially well suited for training of equipment operators and maintainers. For example, it has been used in a sustainment training application for the United States Army's Combat Support System Automated Information System Interface (CAISI). The CAISI provides a wireless communications capability that allows various logistics systems to communicate across the battlefield. Based on classroom training material developed by the CAISI Project Office, the Pacific Northwest National Laboratory designed and developed an interactive, student-centered distributed-learning application for CAISI operators and maintainers. This web-based CAISI training system is also distributed on CD media for use on individual computers, and material developed for the computer
Concept Learning for Achieving Personalized Ontologies: An Active Learning Approach
NASA Astrophysics Data System (ADS)
Şensoy, Murat; Yolum, Pinar
In many multiagent approaches, it is usual to assume the existence of a common ontology among agents. However, in dynamic systems, the existence of such an ontology is unrealistic and its maintenance is cumbersome. Burden of maintaining a common ontology can be alleviated by enabling agents to evolve their ontologies personally. However, with different ontologies, agents are likely to run into communication problems since their vocabularies are different from each other. Therefore, to achieve personalized ontologies, agents must have a means to understand the concepts used by others. Consequently, this paper proposes an approach that enables agents to teach each other concepts from their ontologies using examples. Unlike other concept learning approaches, our approach enables the learner to elicit most informative examples interactively from the teacher. Hence, the learner participates to the learning process actively. We empirically compare the proposed approach with the previous concept learning approaches. Our experiments show that using the proposed approach, agents can learn new concepts successfully and with fewer examples.
Personality, Approaches to Learning and Achievement
ERIC Educational Resources Information Center
Swanberg, Anne Berit; Martinsen, Oyvind Lund
2010-01-01
The present study investigated the relationships between the five-factor model of personality, approaches to learning and academic achievement. Based on the previous research, we expected approaches to have a mediating effect between personality and academic achievement. Six hundred and eighty-seven business students participated in a survey; 56%…
Heutagogy: An alternative practice based learning approach.
Bhoyrub, John; Hurley, John; Neilson, Gavin R; Ramsay, Mike; Smith, Margaret
2010-11-01
Education has explored and utilised multiple approaches in attempts to enhance the learning and teaching opportunities available to adult learners. Traditional pedagogy has been both directly and indirectly affected by andragogy and transformational learning, consequently widening our understandings and approaches toward view teaching and learning. Within the context of nurse education, a major challenge has been to effectively apply these educational approaches to the complex, unpredictable and challenging environment of practice based learning. While not offered as a panacea to such challenges, heutagogy is offered in this discussion paper as an emerging and potentially highly congruent educational framework to place around practice based learning. Being an emergent theory its known conceptual underpinnings and possible applications to nurse education need to be explored and theoretically applied. Through placing the adult learner at the foreground of grasping learning opportunities as they unpredictability emerge from a sometimes chaotic environment, heutagogy can be argued as offering the potential to minimise many of the well published difficulties of coordinating practice with faculty teaching and learning. PMID:20554249
Generalized information-lossless automata. I
Speranskii, D.V.
1995-01-01
Huffman and Even introduced classes of abstract automata, which they called respectively information-lossless automata (ILL) and information-lossless automata of finite order (ILLFO). The underlying property of these automata is the ability to reconstruct unknown input sequences from observations of the output response, assuming that the true initial state of the automaton is known. Similar classes of automata introduced in are called essentially information-lossless automata, and they are capable of reconstructing the unknown input word without knowledge of the initial state of the automaton. It is only assumed that the set of possible initial states of the automaton is the set of all automaton states. In this paper we analyze a structural analog of an abstract ILL-automaton whose set of initial states may be of arbitrary cardinality. This class of automata is thus a generalization of the classical ILL-automata, which allows not only for the structure of the input and output alphabets, but also for the configuration of the set of possible initial states.
Understanding Observational Learning: An Interbehavioral Approach
Fryling, Mitch J; Johnston, Cristin; Hayes, Linda J
2011-01-01
Observational learning is an important area in the field of psychology and behavior science more generally. Given this, it is essential that behavior analysts articulate a sound theory of how behavior change occurs through observation. This paper begins with an overview of seminal research in the area of observational learning, followed by a consideration of common behavior analytic conceptualizations of these findings. The interbehavioral perspective is then outlined, shedding light on some difficulties with the existing behavior analytic approaches. The implications of embracing the interbehavioral perspective for understanding the most complex sorts of behavior, including those involved in observational learning are considered. PMID:22532764
On the secure obfuscation of deterministic finite automata.
Anderson, William Erik
2008-06-01
In this paper, we show how to construct secure obfuscation for Deterministic Finite Automata, assuming non-uniformly strong one-way functions exist. We revisit the software protection approaches originally proposed by [5, 10, 12, 17] and revise them to the current obfuscation setting of Barak et al. [2]. Under this model, we introduce an efficient oracle that retains some 'small' secret about the original program. Using this secret, we can construct an obfuscator and two-party protocol that securely obfuscates Deterministic Finite Automata against malicious adversaries. The security of this model retains the strong 'virtual black box' property originally proposed in [2] while incorporating the stronger condition of dependent auxiliary inputs in [15]. Additionally, we show that our techniques remain secure under concurrent self-composition with adaptive inputs and that Turing machines are obfuscatable under this model.
Extended Self Organised Criticality in Asynchronously Tuned Cellular Automata
NASA Astrophysics Data System (ADS)
Gunji, Yukio-Pegio
2014-12-01
Systems at a critical point in phase transitions can be regarded as being relevant to biological complex behaviour. Such a perspective can only result, in a mathematical consistent manner, from a recursive structure. We implement a recursive structure based on updating by asynchronously tuned elementary cellular automata (AT ECA), and show that a large class of elementary cellular automata (ECA) can reveal critical behavior due to the asynchronous updating and tuning.We show that the obtained criticality coincides with the criticality in phase transitions of asynchronous ECA with respect to density decay, and that multiple distributed ECAs, synchronously updated, can emulate critical behavior in AT ECA. Our approach draws on concepts and tools from category and set theory, in particular on "adjunction dualities" of pairs of adjoint functors.
Relational String Verification Using Multi-track Automata
NASA Astrophysics Data System (ADS)
Yu, Fang; Bultan, Tevfik; Ibarra, Oscar H.
Verification of string manipulation operations is a crucial problem in computer security. In this paper, we present a new relational string verification technique based on multi-track automata. Our approach is capable of verifying properties that depend on relations among string variables. This enables us to prove that vulnerabilities that result from improper string manipulation do not exist in a given program. Our main contributions in this paper can be summarized as follows: (1) We formally characterize the string verification problem as the reachability analysis of string systems and show decidability/undecidability results for several string analysis problems. (2) We develop a sound symbolic analysis technique for string verification that over-approximates the reachable states of a given string system using multi-track automata and summarization. (3) We evaluate the presented techniques with respect to several string analysis benchmarks extracted from real web applications.
Universal map for cellular automata
NASA Astrophysics Data System (ADS)
García-Morales, V.
2012-08-01
A universal map is derived for all deterministic 1D cellular automata (CAs) containing no freely adjustable parameters and valid for any alphabet size and any neighborhood range (including non-symmetrical neighborhoods). The map can be extended to an arbitrary number of dimensions and topologies and to arbitrary order in time. Specific CA maps for the famous Conway's Game of Life and Wolfram's 256 elementary CAs are given. An induction method for CAs, based in the universal map, allows mathematical expressions for the orbits of a wide variety of elementary CAs to be systematically derived.
Symmetry analysis of cellular automata
NASA Astrophysics Data System (ADS)
García-Morales, V.
2013-01-01
By means of B-calculus [V. García-Morales, Phys. Lett. A 376 (2012) 2645] a universal map for deterministic cellular automata (CAs) has been derived. The latter is shown here to be invariant upon certain transformations (global complementation, reflection and shift). When constructing CA rules in terms of rules of lower range a new symmetry, “invariance under construction” is uncovered. Modular arithmetic is also reformulated within B-calculus and a new symmetry of certain totalistic CA rules, which calculate the Pascal simplices modulo an integer number p, is then also uncovered.
Stochastic computing with biomolecular automata
NASA Astrophysics Data System (ADS)
Adar, Rivka; Benenson, Yaakov; Linshiz, Gregory; Rosner, Amit; Tishby, Naftali; Shapiro, Ehud
2004-07-01
Stochastic computing has a broad range of applications, yet electronic computers realize its basic step, stochastic choice between alternative computation paths, in a cumbersome way. Biomolecular computers use a different computational paradigm and hence afford novel designs. We constructed a stochastic molecular automaton in which stochastic choice is realized by means of competition between alternative biochemical pathways, and choice probabilities are programmed by the relative molar concentrations of the software molecules coding for the alternatives. Programmable and autonomous stochastic molecular automata have been shown to perform direct analysis of disease-related molecular indicators in vitro and may have the potential to provide in situ medical diagnosis and cure.
Pre-Service English Teachers in Blended Learning Environment in Respect to Their Learning Approaches
ERIC Educational Resources Information Center
Yilmaz, M. Betul; Orhan, Feza
2010-01-01
Blended learning environment (BLE) is increasingly used in the world, especially in university degrees and it is based on integrating web-based learning and face-to-face (FTF) learning environments. Besides integrating different learning environments, BLE also addresses to students with different learning approaches. The "learning approach"…
Transformative Learning Approaches for Public Relations Pedagogy
ERIC Educational Resources Information Center
Motion, Judy; Burgess, Lois
2014-01-01
Public relations educators are frequently challenged by students' flawed perceptions of public relations. Two contrasting case studies are presented in this paper to illustrate how socially-oriented paradigms may be applied to a real-client project to deliver a transformative learning experience. A discourse-analytic approach is applied…
An Approach to Learning by Construction
ERIC Educational Resources Information Center
Bagarukayo, Emily; Weide, Theo; Meijden, Henny
2012-01-01
This paper proposes an innovative idea for providing affordable, sustainable, and meaningful education for students in Least Developed Countries (LDCs). The authors show how a Digital Learning Environment (DLE) can play a central role in community development. The authors develop and validate an approach for introduction of an ICT education…
A Mixed Learning Approach in Mechatronics Education
ERIC Educational Resources Information Center
Yilmaz, O.; Tuncalp, K.
2011-01-01
This study aims to investigate the effect of a Web-based mixed learning approach model on mechatronics education. The model combines different perception methods such as reading, listening, and speaking and practice methods developed in accordance with the vocational background of students enrolled in the course Electromechanical Systems in…
Linking Action Learning and Inter-Organisational Learning: The Learning Journey Approach
ERIC Educational Resources Information Center
Schumacher, Thomas
2015-01-01
The article presents and illustrates the learning journey (LJ)--a new management development approach to inter-organisational learning based on observation, reflection and problem-solving. The LJ involves managers from different organisations and applies key concepts of action learning and systemic organisational development. Made up of…
Distribution functions of probabilistic automata
NASA Technical Reports Server (NTRS)
Vatan, F.
2001-01-01
Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.
Rasmussen, S. |; Smith, J.R. |
1995-05-01
We present a new style of molecular dynamics and self-assembly simulation, the Lattice Polymer Automaton (LPA). In the LPA all interactions, including electromagnetic forces, are decomposed and communicated via propagating particles, {open_quotes}photons.{close_quotes} The monomer-monomer bondforces, the molecular excluded volume forces, the longer range intermolecular forces, and the polymer-solvent interactions may all be modeled with propagating particles. The LPA approach differs significantly from both of the standard approaches, Monte Carlo lattice methods and Molecular Dynamics simulations. On the one hand, the LPA provides more realism than Monte Carlo methods, because it produces a time series of configurations of a single molecule, rather than a set of causally unrelated samples from a distribution of configurations. The LPA can therefore be used directly to study dynamical properties; one can in fact watch polymers move in real time. On the other hand, the LPA is fully discrete, and therefore much simpler than traditional Molecular Dynamics models, which are continuous and operate on much shorter time scales. Due to this simplicity it is possible to simulate longer real time periods, which should enable the study of molecular self-organization on workstations supercomputers are not needed.
Towards a voxel-based geographic automata for the simulation of geospatial processes
NASA Astrophysics Data System (ADS)
Jjumba, Anthony; Dragićević, Suzana
2016-07-01
Many geographic processes evolve in a three dimensional space and time continuum. However, when they are represented with the aid of geographic information systems (GIS) or geosimulation models they are modelled in a framework of two-dimensional space with an added temporal component. The objective of this study is to propose the design and implementation of voxel-based automata as a methodological approach for representing spatial processes evolving in the four-dimensional (4D) space-time domain. Similar to geographic automata models which are developed to capture and forecast geospatial processes that change in a two-dimensional spatial framework using cells (raster geospatial data), voxel automata rely on the automata theory and use three-dimensional volumetric units (voxels). Transition rules have been developed to represent various spatial processes which range from the movement of an object in 3D to the diffusion of airborne particles and landslide simulation. In addition, the proposed 4D models demonstrate that complex processes can be readily reproduced from simple transition functions without complex methodological approaches. The voxel-based automata approach provides a unique basis to model geospatial processes in 4D for the purpose of improving representation, analysis and understanding their spatiotemporal dynamics. This study contributes to the advancement of the concepts and framework of 4D GIS.
Stimulus-Response Theory of Finite Automata, Technical Report No. 133.
ERIC Educational Resources Information Center
Suppes, Patrick
The central aim of this paper and its projected successors is to prove in detail that stimulus-response theory, or at least a mathematically precise version, can give an account of the learning of many phrase-structure grammars. Section 2 is concerned with standard notions of finite and probabilistic automata. An automaton is defined as a device…
Quantum features of natural cellular automata
NASA Astrophysics Data System (ADS)
Elze, Hans-Thomas
2016-03-01
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schrödinger equation. This includes corresponding conservation laws. The class of “natural” Hamiltonian cellular automata is based exclusively on integer-valued variables and couplings and their dynamics derives from an Action Principle. They can be mapped reversibly to continuum models by applying Sampling Theory. Thus, “deformed” quantum mechanical models with a finite discreteness scale l are obtained, which for l → 0 reproduce familiar continuum results. We have recently demonstrated that such automata can form “multipartite” systems consistently with the tensor product structures of nonrelativistic many-body quantum mechanics, while interacting and maintaining the linear evolution. Consequently, the Superposition Principle fully applies for such primitive discrete deterministic automata and their composites and can produce the essential quantum effects of interference and entanglement.
A Decomposition Theorem for Finite Automata.
ERIC Educational Resources Information Center
Santa Coloma, Teresa L.; Tucci, Ralph P.
1990-01-01
Described is automata theory which is a branch of theoretical computer science. A decomposition theorem is presented that is easier than the Krohn-Rhodes theorem. Included are the definitions, the theorem, and a proof. (KR)
Cellular automata to describe seismicity: A review
NASA Astrophysics Data System (ADS)
Jiménez, Abigail
2013-12-01
Cellular Automata have been used in the literature to describe seismicity. We first historically introduce Cellular Automata and provide some important definitions. Then we proceed to review the most important models, most of them being variations of the spring-block model proposed by Burridge and Knopoff, and describe the most important results obtained from them. We discuss the relation with criticality and also describe some models that try to reproduce real data.
Economic Gardening through Entrepreneurship Education: A Service-Learning Approach
ERIC Educational Resources Information Center
Desplaces, David E.; Wergeles, Fred; McGuigan, Patrick
2009-01-01
This article outlines the implementation of a service-learning approach in an entrepreneurship programme using an "economic gardening" strategy. Economic Gardening through Service-Learning (EGS-L) is an approach to economic development that helps local businesses and students grow through a facilitated learning process. Learning is made possible…
Understanding Fatty Acid Metabolism through an Active Learning Approach
ERIC Educational Resources Information Center
Fardilha, M.; Schrader, M.; da Cruz e Silva, O. A. B.; da Cruz e Silva, E. F.
2010-01-01
A multi-method active learning approach (MALA) was implemented in the Medical Biochemistry teaching unit of the Biomedical Sciences degree at the University of Aveiro, using problem-based learning as the main learning approach. In this type of learning strategy, students are involved beyond the mere exercise of being taught by listening. Less…
Fuzzy automata and pattern matching
NASA Technical Reports Server (NTRS)
Setzer, C. B.; Warsi, N. A.
1986-01-01
A wide-ranging search for articles and books concerned with fuzzy automata and syntactic pattern recognition is presented. A number of survey articles on image processing and feature detection were included. Hough's algorithm is presented to illustrate the way in which knowledge about an image can be used to interpret the details of the image. It was found that in hand generated pictures, the algorithm worked well on following the straight lines, but had great difficulty turning corners. An algorithm was developed which produces a minimal finite automaton recognizing a given finite set of strings. One difficulty of the construction is that, in some cases, this minimal automaton is not unique for a given set of strings and a given maximum length. This algorithm compares favorably with other inference algorithms. More importantly, the algorithm produces an automaton with a rigorously described relationship to the original set of strings that does not depend on the algorithm itself.
Distinguishing Asthma Phenotypes Using Machine Learning Approaches.
Howard, Rebecca; Rattray, Magnus; Prosperi, Mattia; Custovic, Adnan
2015-07-01
Asthma is not a single disease, but an umbrella term for a number of distinct diseases, each of which are caused by a distinct underlying pathophysiological mechanism. These discrete disease entities are often labelled as 'asthma endotypes'. The discovery of different asthma subtypes has moved from subjective approaches in which putative phenotypes are assigned by experts to data-driven ones which incorporate machine learning. This review focuses on the methodological developments of one such machine learning technique-latent class analysis-and how it has contributed to distinguishing asthma and wheezing subtypes in childhood. It also gives a clinical perspective, presenting the findings of studies from the past 5 years that used this approach. The identification of true asthma endotypes may be a crucial step towards understanding their distinct pathophysiological mechanisms, which could ultimately lead to more precise prevention strategies, identification of novel therapeutic targets and the development of effective personalized therapies. PMID:26143394
Cellular Automata Generalized To An Inferential System
NASA Astrophysics Data System (ADS)
Blower, David J.
2007-11-01
Stephen Wolfram popularized elementary one-dimensional cellular automata in his book, A New Kind of Science. Among many remarkable things, he proved that one of these cellular automata was a Universal Turing Machine. Such cellular automata can be interpreted in a different way by viewing them within the context of the formal manipulation rules from probability theory. Bayes's Theorem is the most famous of such formal rules. As a prelude, we recapitulate Jaynes's presentation of how probability theory generalizes classical logic using modus ponens as the canonical example. We emphasize the important conceptual standing of Boolean Algebra for the formal rules of probability manipulation and give an alternative demonstration augmenting and complementing Jaynes's derivation. We show the complementary roles played in arguments of this kind by Bayes's Theorem and joint probability tables. A good explanation for all of this is afforded by the expansion of any particular logic function via the disjunctive normal form (DNF). The DNF expansion is a useful heuristic emphasized in this exposition because such expansions point out where relevant 0s should be placed in the joint probability tables for logic functions involving any number of variables. It then becomes a straightforward exercise to rely on Boolean Algebra, Bayes's Theorem, and joint probability tables in extrapolating to Wolfram's cellular automata. Cellular automata are seen as purely deductive systems, just like classical logic, which probability theory is then able to generalize. Thus, any uncertainties which we might like to introduce into the discussion about cellular automata are handled with ease via the familiar inferential path. Most importantly, the difficult problem of predicting what cellular automata will do in the far future is treated like any inferential prediction problem.
Generic framework for mining cellular automata models on protein-folding simulations.
Diaz, N; Tischer, I
2016-01-01
Cellular automata model identification is an important way of building simplified simulation models. In this study, we describe a generic architectural framework to ease the development process of new metaheuristic-based algorithms for cellular automata model identification in protein-folding trajectories. Our framework was developed by a methodology based on design patterns that allow an improved experience for new algorithms development. The usefulness of the proposed framework is demonstrated by the implementation of four algorithms, able to obtain extremely precise cellular automata models of the protein-folding process with a protein contact map representation. Dynamic rules obtained by the proposed approach are discussed, and future use for the new tool is outlined. PMID:27323045
Modeling Pseudorandom Sequence Generators using Cellular Automata: The Alternating Step Generator
NASA Astrophysics Data System (ADS)
Pazo-Robles, María Eugenia; Fúster-Sabater, Amparo
2007-12-01
Stream ciphers are pseudorandom bit generators whose output sequences are combined with the sensitive information by means of a mathematical function currently an addition module 2. The Alternating Step Generator is a pseudorandom sequence generator with good cryptographic properties and non-linear structure. In this work, we propose two different ways to model such a generator by using linear and discrete mathematical functions e.g. Cellular Automata. One of these ways deals with the realization of a linear model from a pair of basic automata provided by the Catell and Muzio algorithm. The other way is a new approach based on automata's addition consisting in the realization of a new automaton with non-primitive polynomial and short length. Both methods provide linear models able to generate the output sequence of the Alternating Step Generator.
Cellular automata modelling of biomolecular networks dynamics.
Bonchev, D; Thomas, S; Apte, A; Kier, L B
2010-01-01
The modelling of biological systems dynamics is traditionally performed by ordinary differential equations (ODEs). When dealing with intracellular networks of genes, proteins and metabolites, however, this approach is hindered by network complexity and the lack of experimental kinetic parameters. This opened the field for other modelling techniques, such as cellular automata (CA) and agent-based modelling (ABM). This article reviews this emerging field of studies on network dynamics in molecular biology. The basics of the CA technique are discussed along with an extensive list of related software and websites. The application of CA to networks of biochemical reactions is exemplified in detail by the case studies of the mitogen-activated protein kinase (MAPK) signalling pathway, the FAS-ligand (FASL)-induced and Bcl-2-related apoptosis. The potential of the CA method to model basic pathways patterns, to identify ways to control pathway dynamics and to help in generating strategies to fight with cancer is demonstrated. The different line of CA applications presented includes the search for the best-performing network motifs, an analysis of importance for effective intracellular signalling and pathway cross-talk. PMID:20373215
ERIC Educational Resources Information Center
Ozkal, Kudret; Tekkaya, Ceren; Cakiroglu, Jale; Sungur, Semra
2009-01-01
This study proposed a conceptual model of relationships among constructivist learning environment perception variables (Personal Relevance, Uncertainty, Critical Voice, Shared Control, and Student Negotiation), scientific epistemological belief variables (fixed and tentative), and learning approach. It was proposed that learning environment…
Maximizing Exposure Therapy: An Inhibitory Learning Approach
Craske, Michelle G.; Treanor, Michael; Conway, Chris; Zbozinek, Tomislav; Vervliet, Bram
2014-01-01
Exposure therapy is an effective approach for treating anxiety disorders, although a substantial number of individuals fail to benefit or experience a return of fear after treatment. Research suggests that anxious individuals show deficits in the mechanisms believed to underlie exposure therapy, such as inhibitory learning. Targeting these processes may help improve the efficacy of exposure-based procedures. Although evidence supports an inhibitory learning model of extinction, there has been little discussion of how to implement this model in clinical practice. The primary aim of this paper is to provide examples to clinicians for how to apply this model to optimize exposure therapy with anxious clients, in ways that distinguish it from a ‘fear habituation’ approach and ‘belief disconfirmation’ approach within standard cognitive-behavior therapy. Exposure optimization strategies include 1) expectancy violation, 2) deepened extinction, 3) occasional reinforced extinction, 4) removal of safety signals, 5) variability, 6) retrieval cues, 7) multiple contexts, and 8) affect labeling. Case studies illustrate methods of applying these techniques with a variety of anxiety disorders, including obsessive-compulsive disorder, posttraumatic stress disorder, social phobia, specific phobia, and panic disorder. PMID:24864005
Lattice gas automata for flow and transport in geochemical systems
Janecky, D.R.; Chen, S.; Dawson, S.; Eggert, K.C.; Travis, B.J.
1992-01-01
Lattice gas automata models are described, which couple solute transport with chemical reactions at mineral surfaces within pore networks. Diffusion in a box calculations are illustrated, which compare directly with Fickian diffusion. Chemical reactions at solid surfaces, including precipitation/dissolution, sorption, and catalytic reaction, can be examined with the model because hydrodynamic transport, solute diffusion and mineral surface processes are all treated explicitly. The simplicity and flexibility of the approach provides the ability to study the interrelationship between fluid flow and chemical reactions in porous materials, at a level of complexity that has not previously been computationally possible.
Social learning in Models and Cases - an Interdisciplinary Approach
NASA Astrophysics Data System (ADS)
Buhl, Johannes; De Cian, Enrica; Carrara, Samuel; Monetti, Silvia; Berg, Holger
2016-04-01
Our paper follows an interdisciplinary understanding of social learning. We contribute to the literature on social learning in transition research by bridging case-oriented research and modelling-oriented transition research. We start by describing selected theories on social learning in innovation, diffusion and transition research. We present theoretical understandings of social learning in techno-economic and agent-based modelling. Then we elaborate on empirical research on social learning in transition case studies. We identify and synthetize key dimensions of social learning in transition case studies. In the following we bridge between more formal and generalising modelling approaches towards social learning processes and more descriptive, individualising case study approaches by interpreting the case study analysis into a visual guide on functional forms of social learning typically identified in the cases. We then try to exemplarily vary functional forms of social learning in integrated assessment models. We conclude by drawing the lessons learned from the interdisciplinary approach - methodologically and empirically.
ERIC Educational Resources Information Center
Malie, Senian; Akir, Oriah
2012-01-01
Learning approaches, learning methods and learning environments have different effects on students? academic performance. However, they are not the sole factors that impact students? academic achievement. The aims of this research are three-fold: to determine the learning approaches preferred by most students and the impact of the learning…
ERIC Educational Resources Information Center
Vanthournout, Gert; Coertjens, Liesje; Gijbels, David; Donche, Vincent; Van Petegem, Peter
2013-01-01
Research regarding the development of students' learning approaches have at times reported unexpected or lack of expected changes. The current study explores the idea of differential developments in learning approaches according to students' initial learning profiles as a possible explanation for these outcomes. A learning profile is conceived as…
Concept Based Approach for Adaptive Personalized Course Learning System
ERIC Educational Resources Information Center
Salahli, Mehmet Ali; Özdemir, Muzaffer; Yasar, Cumali
2013-01-01
One of the most important factors for improving the personalization aspects of learning systems is to enable adaptive properties to them. The aim of the adaptive personalized learning system is to offer the most appropriate learning path and learning materials to learners by taking into account their profiles. In this paper, a new approach to…
Component-Based Approach in Learning Management System Development
ERIC Educational Resources Information Center
Zaitseva, Larisa; Bule, Jekaterina; Makarov, Sergey
2013-01-01
The paper describes component-based approach (CBA) for learning management system development. Learning object as components of e-learning courses and their metadata is considered. The architecture of learning management system based on CBA being developed in Riga Technical University, namely its architecture, elements and possibilities are…
Course Management Systems and Blended Learning: An Innovative Learning Approach
ERIC Educational Resources Information Center
Chou, Amy Y.; Chou, David C.
2011-01-01
This article utilizes Rogers' innovation-decision process model (2003) and Beckman and Berry's innovation process model (2007) to create an innovative learning map that illustrates three learning methods (i.e., face-to-face learning, online learning, and blended learning) in two types of innovation (i.e., incremental innovation and radical…
Looking at Learning Approaches from the Angle of Student Profiles
ERIC Educational Resources Information Center
Kyndt, Eva; Dochy, Filip; Struyven, Katrien; Cascallar, Eduardo
2012-01-01
This study starts with investigating the relation of perceived workload, motivation for learning and working memory capacity (WMC) with students' approaches to learning. Secondly, this study investigates if differences exist between different student profiles concerning their approach to the learning and the influence of workloads thereon. Results…
The Learning Center Approach to Physical Education Instruction.
ERIC Educational Resources Information Center
Espiritu, Joyce K.; Loughrey, Thomas J.
1985-01-01
A learning center approach to physical education is recommended and presented. This approach can resolve the problem of large class sizes by freeing the teacher to work with individual students. Both psychomotor and cognitive learning experiences can be incorporated into learning centers. (MT)
Approaches to Learning and Study Orchestrations in High School Students
ERIC Educational Resources Information Center
Cano, Francisco
2007-01-01
In the framework of the SAL (Students' approaches to learning) position, the learning experience (approaches to learning and study orchestrations) of 572 high school students was explored, examining its interrelationships with some personal and familial variables. Three major results emerged. First, links were found between family's intellectual…
A Conceptual Analysis on the Approaches to Learning
ERIC Educational Resources Information Center
Ak, Serife
2008-01-01
The concept of approach to learning was first identified by Marton and Saljo in 1976. Numerous researchers have conducted studies on students' approaches to learning since 1976. There appears considerable confusion in the literature concerning the terms cognitive styles and learning styles. Therefore, there is a remarkable ambiguity about the…
Integrating Adult Learning and Technologies for Effective Education: Strategic Approaches
ERIC Educational Resources Information Center
Wang, Victor C. X.
2010-01-01
As adult learners and educators pioneer the use of technology in the new century, attention has been focused on developing strategic approaches to effectively integrate adult learning and technology in different learning environments. "Integrating Adult Learning and Technologies for Effective Education: Strategic Approaches" provides innovative…
A Bayesian Approach to Learning Scoring Systems.
Ertekin, Şeyda; Rudin, Cynthia
2015-12-01
We present a Bayesian method for building scoring systems, which are linear models with coefficients that have very few significant digits. Usually the construction of scoring systems involve manual effort-humans invent the full scoring system without using data, or they choose how logistic regression coefficients should be scaled and rounded to produce a scoring system. These kinds of heuristics lead to suboptimal solutions. Our approach is different in that humans need only specify the prior over what the coefficients should look like, and the scoring system is learned from data. For this approach, we provide a Metropolis-Hastings sampler that tends to pull the coefficient values toward their "natural scale." Empirically, the proposed method achieves a high degree of interpretability of the models while maintaining competitive generalization performances. PMID:27441407
Computational approaches to motor learning by imitation.
Schaal, Stefan; Ijspeert, Auke; Billard, Aude
2003-01-01
Movement imitation requires a complex set of mechanisms that map an observed movement of a teacher onto one's own movement apparatus. Relevant problems include movement recognition, pose estimation, pose tracking, body correspondence, coordinate transformation from external to egocentric space, matching of observed against previously learned movement, resolution of redundant degrees-of-freedom that are unconstrained by the observation, suitable movement representations for imitation, modularization of motor control, etc. All of these topics by themselves are active research problems in computational and neurobiological sciences, such that their combination into a complete imitation system remains a daunting undertaking-indeed, one could argue that we need to understand the complete perception-action loop. As a strategy to untangle the complexity of imitation, this paper will examine imitation purely from a computational point of view, i.e. we will review statistical and mathematical approaches that have been suggested for tackling parts of the imitation problem, and discuss their merits, disadvantages and underlying principles. Given the focus on action recognition of other contributions in this special issue, this paper will primarily emphasize the motor side of imitation, assuming that a perceptual system has already identified important features of a demonstrated movement and created their corresponding spatial information. Based on the formalization of motor control in terms of control policies and their associated performance criteria, useful taxonomies of imitation learning can be generated that clarify different approaches and future research directions. PMID:12689379
Benchmark study between FIDAP and a cellular automata code
Akau, R.L.; Stockman, H.W.
1991-01-01
A fluid flow benchmark exercise was conducted to compare results between a cellular automata code and FIDAP. Cellular automata codes are free from gridding constraints, and are generally used to model slow (Reynolds number {approx} 1) flows around complex solid obstacles. However, the accuracy of cellular automata codes at higher Reynolds numbers, where inertial terms are significant, is not well-documented. In order to validate the cellular automata code, two fluids problems were investigated. For both problems, flow was assumed to be laminar, two-dimensional, isothermal, incompressible and periodic. Results showed that the cellular automata code simulated the overall behavior of the flow field. 7 refs., 12 figs.
Automata in random environments with application to machine intelligence
Wegman, E.J.; Gould, J.
1982-09-01
Computers and brains are modeled by finite and probabilistic automata, respectively. Probabilistic automata are known to be strictly more powerful than finite automata. The observation that the environment affects behavior of both computer and brain is made. Automata are then modeled in an environment. Theorem 1 shows that useful environmental models are those which are infinite sets. A probabilistic structure is placed on the environment set. Theorem 2 compares the behavior of finite (deterministic) and probabilistic automata in random environments. Several interpretations of theorem 2 are discussed which offer some insight into some mathematical limits of machine intelligence. 15 references.
Cellular automata modeling of weld solidification structure
Dress, W.B.; Zacharia, T.; Radhakrishnan, B.
1993-12-31
The authors explore the use of cellular automata in modeling arc-welding processes. A brief discussion of cellular automata and their previous use in micro-scale solidification simulations is presented. Macro-scale thermal calculations for arc-welding at a thin plate are shown to give good quantitative and qualitative results. Combining the two calculations in a single cellular array provides a realistic simulation of grain growth in a welding process. Results of simulating solidification in a moving melt pool in a poly-crystalline alloy sheet are presented.
Modelling and synthesis of automata in HDLs
NASA Astrophysics Data System (ADS)
Chmielewski, Sławomir; Węgrzyn, Marek
2006-10-01
In the paper digital modelling and synthesis of automata in Hardware Description Languages is described. There is presented different kinds of automata and methods of realization using languages like VHDL and Verilog. Basic models for control units are: Finite State Machine (FSM), Algorithmic State Machine (ASM) and Linked State Machine (LSM). FSM, ASM and LSM can be represented graphically, which would help a designer to visualize and design in a more efficient way. On the other hand, a designer needs a fast and direct way to convert the considered designs into Hardware Description Language (HDL) codes for simulation and analysis it for synthesis and implementation.
Towards modeling DNA sequences as automata
NASA Astrophysics Data System (ADS)
Burks, Christian; Farmer, Doyne
1984-01-01
We seek to describe a starting point for modeling the evolution and role of DNA sequences within the framework of cellular automata by discussing the current understanding of genetic information storage in DNA sequences. This includes alternately viewing the role of DNA in living organisms as a simple scheme and as a complex scheme; a brief review of strategies for identifying and classifying patterns in DNA sequences; and finally, notes towards establishing DNA-like automata models, including a discussion of the extent of experimentally determined DNA sequence data present in the database at Los Alamos.
Automata theory. 1964-May 1983 (Citations from the NTIS Data Base)
Not Available
1983-06-01
Research reports are cited on pushdown automata, tessellation automata, web automata, and finite state automata. Studies on finite state machines, turing machines, and sequential machines are included. Research on Boolean functions, recursive functions, the Moore model, and the Mealey model, as applied to automata theory, are also covered. (This updated bibliography contains 298 citations, 41 of which are new entries to the previous edition.)
Particle learning for probabilistic deterministic finite automata
Energy Science and Technology Software Center (ESTSC)
2011-09-01
The plpdfa software is a product of an LDRD project at LLNL entitked "Adaptive Sampling for Very High Throughput Data Streams" (tracking number 11-ERD-035). This software was developed by a graduate student summer intern, Chris Challis, who worked under project PI Dan Merl furing the summer of 2011. The software the source code is implementing is a statistical analysis technique for clustering and classification of text-valued data. The method had been previously published by themore » PI in the open literature.« less
Particle learning for probabilistic deterministic finite automata
2011-09-01
The plpdfa software is a product of an LDRD project at LLNL entitked "Adaptive Sampling for Very High Throughput Data Streams" (tracking number 11-ERD-035). This software was developed by a graduate student summer intern, Chris Challis, who worked under project PI Dan Merl furing the summer of 2011. The software the source code is implementing is a statistical analysis technique for clustering and classification of text-valued data. The method had been previously published by the PI in the open literature.
Cyber Asynchronous versus Blended Cyber Approach in Distance English Learning
ERIC Educational Resources Information Center
Ge, Zi-Gang
2012-01-01
This study aims to compare the single cyber asynchronous learning approach with the blended cyber learning approach in distance English education. Two classes of 70 students participated in this study, which lasted one semester of about four months, with one class using the blended approach for their English study and the other only using the…
The Relationship between Intelligence, Approaches to Learning and Academic Achievement.
ERIC Educational Resources Information Center
Diseth, Age
2002-01-01
Administered three tests of intelligence and the Approaches and Study Skills Inventory for Students (Entwhistle, 1997) to 89 Norwegian undergraduates to study the relationships among intelligence, approaches of learning, and academic achievement. Findings support the construct validity of approaches to learning because of its independence from…
Learning Approaches, Demographic Factors to Predict Academic Outcomes
ERIC Educational Resources Information Center
Nguyen, Tuan Minh
2016-01-01
Purpose: The purpose of this paper is to predict academic outcome in math and math-related subjects using learning approaches and demographic factors. Design/Methodology/Approach: ASSIST was used as the instrumentation to measure learning approaches. The study was conducted in the International University of Vietnam with 616 participants. An…
Stochastic Games for Verification of Probabilistic Timed Automata
NASA Astrophysics Data System (ADS)
Kwiatkowska, Marta; Norman, Gethin; Parker, David
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic timed automata, forwards reachability is the analysis method of choice, since it can be implemented extremely efficiently. However, for PTAs, such techniques are only able to compute upper bounds on maximum reachability probabilities. In this paper, we propose a new approach to the analysis of PTAs using abstraction and stochastic games. We show how efficient forwards reachability techniques can be extended to yield both lower and upper bounds on maximum (and minimum) reachability probabilities. We also present abstraction-refinement techniques that are guaranteed to improve the precision of these probability bounds, providing a fully automatic method for computing the exact values. We have implemented these techniques and applied them to a set of large case studies. We show that, in comparison to alternative approaches to verifying PTAs, such as backwards reachability and digital clocks, our techniques exhibit superior performance and scalability.
Fuzzy cellular automata models in immunology
NASA Astrophysics Data System (ADS)
Ahmed, E.
1996-10-01
The self-nonself character of antigens is considered to be fuzzy. The Chowdhury et al. cellular automata model is generalized accordingly. New steady states are found. The first corresponds to a below-normal help and suppression and is proposed to be related to autoimmune diseases. The second corresponds to a below-normal B-cell level.
Dynamical Systems Perspective of Wolfram's Cellular Automata
NASA Astrophysics Data System (ADS)
Courbage, M.; Kamiński, B.
2013-01-01
Leon Chua, following Wolfram, devoted a big effort to understand deeply the wealth of complexity of the rules of all elementary one-dimensional cellular automata from the point of view of the nonlinear dynamicist. Here we complete this point of view by a dynamical system perspective, extending them to the limit of infinite number of sites.
Self-reproduction in small cellular automata
NASA Astrophysics Data System (ADS)
Byl, John
1989-01-01
Self-reproduction in cellular automata is discussed with reference to Langton's criteria as to what constitutes genuine self-reproduction. It is found that it is possible to construct self-reproducing structures that are substantially less complex than that presented by Langton.
Partial Derivative Automata Formalized in Coq
NASA Astrophysics Data System (ADS)
Almeida, José Bacelar; Moreira, Nelma; Pereira, David; de Sousa, Simão Melo
In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in Coq towards their usage in program certification.
Additive Cellular Automata and Volume Growth
NASA Astrophysics Data System (ADS)
Ward, Thomas B.
2000-09-01
A class of dynamical systems associated to rings of S-integers in rational function fields is described. General results about these systems give a rather complete description of the well-known dynamics in one-dimensional additive cellular automata with prime alphabet, including simple formulæ for the topological entropy and the number of periodic configurations. For these systems the periodic points are uniformly distributed along some subsequence with respect to the maximal measure, and in particular are dense. Periodic points may be constructed arbitrarily close to a given configuration, and rationality of the dynamical zeta function is characterized. Throughout the emphasis is to place this particular family of cellular automata into the wider context of S-integer dynamical systems, and to show how the arithmetic of rational function fields determines their behaviour. Using a covering space the dynamics of additive cellular automata are related to a form of hyperbolicity in completions of rational function fields. This expresses the topological entropy of the automata directly in terms of volume growth in the covering space.
ERIC Educational Resources Information Center
Phan, Huy P.
2008-01-01
Introduction: Recent research in educational psychology has explored student approaches to learning (SAL) and epistemological beliefs within the theoretical framework of self-regulated learning. The focus of this research study seeks to explore the predictiveness of learning approaches and epistemological beliefs on students' self-regulatory…
Students' Questions: Building a Bridge between Kolb's Learning Styles and Approaches to Learning
ERIC Educational Resources Information Center
de Jesus, Helena T. Pedrosa; Almeida, Patricia Albergaria; Teixeira-Dias, Jose Joaquim; Watts, Mike
2006-01-01
Purpose: The purpose of this study is to identify the types of questions that students ask during the learning of chemistry; discuss the role of students' questions in the process of constructing knowledge, and investigate the relationship between students' questions, approaches to learning, and learning styles. Design/methodology/approach: The…
ERIC Educational Resources Information Center
Baeten, Marlies; Dochy, Filip; Struyven, Katrien
2013-01-01
Previous research has shown the difficulty of enhancing students' approaches to learning, in particular the deep approach, through student-centred teaching methods such as problem- and case-based learning. This study investigates whether mixed instructional methods combining case-based learning and lectures have the power to enhance students'…
Do Learning Approaches of Medical Students Affect Their Satisfaction with Problem-Based Learning?
ERIC Educational Resources Information Center
Gurpinar, Erol; Kulac, Esin; Tetik, Cihat; Akdogan, Ilgaz; Mamakli, Sumer
2013-01-01
The aim of this research was to determine the satisfaction of medical students with problem-based learning (PBL) and their approaches to learning to investigate the effect of learning approaches on their levels of satisfaction. The study group was composed of medical students from three different universities, which apply PBL at different levels…
Supervised nuclear track detection of CR-39 detectors by cellular automata
NASA Astrophysics Data System (ADS)
Chahkandi Nejad, Hadi; Khayat, Omid; Mohammadi, Kheirollah; Tavakoli, Saeed
2014-05-01
In this paper, cellular automata are used to detect the nuclear tracks in the track images captured from the surface of CR-39 detectors. Parameters of the automaton as the states, neighborhood, rules and quality parameters are defined optimally for the track image data set under analysis. The presented method is a supervised computational algorithm which comprises a rule definition phase as the learning procedure. Parameter optimization is also performed to adapt the algorithm to the data set used.
Adult Learning in Health and Safety: Some Issues and Approaches.
ERIC Educational Resources Information Center
O Fathaigh, Mairtin
This document, which was developed for presentation at a seminar on adult learning and safety, examines approaches to occupational safety and health (OSH) learning/training in the workplace. Section 1 examines selected factors affecting adults' learning in workplace OSH programs. The principal dimensions along which individual adult learners will…
Demarcating Advanced Learning Approaches from Methodological and Technological Perspectives
ERIC Educational Resources Information Center
Horvath, Imre; Peck, David; Verlinden, Jouke
2009-01-01
In the field of design and engineering education, the fast and expansive evolution of information and communication technologies is steadily converting traditional learning approaches into more advanced ones. Facilitated by Broadband (high bandwidth) personal computers, distance learning has developed into web-hosted electronic learning. The…
(Re)Conceptualizing Design Approaches for Mobile Language Learning
ERIC Educational Resources Information Center
Hoven, Debra; Palalas, Agnieszka
2011-01-01
An exploratory study conducted at George Brown College in Toronto, Canada between 2007 and 2009 investigated language learning with mobile devices as an approach to augmenting ESP learning by taking learning outside the classroom into the real-world context. In common with findings at other community colleges, this study identified inadequate…
Investigating Teachers' Views of Student-Centred Learning Approach
ERIC Educational Resources Information Center
Seng, Ernest Lim Kok
2014-01-01
Conventional learning is based on low levels of students' participation where students are rarely expected to ask questions or to challenge the theories of the academic. A paradigm shift in curriculum has resulted in implementing student-centred learning (SCL) approach, putting students as the centre of the learning process. This mode of…
Opening Lines: Approaches to the Scholarship of Teaching and Learning.
ERIC Educational Resources Information Center
Hutchings, Pat, Ed.
This publication features reports by eight Carnegie Scholars who are working to develop a scholarship of teaching and learning that will advance the profession of teaching and improve student learning. Following the Introduction, "Approaching the Scholarship of Teaching and Learning" (Pat Hutchings), the papers are: "Investigating Student Learning…
Assessing the Learning Organization: Part 2--Exploring Practical Assessment Approaches.
ERIC Educational Resources Information Center
Tosey, Paul; Smith, Peter A. C.
1999-01-01
Presents two approaches to assessing learning organizations: (1) Focus, Will, Capability, Performance System and (2) organizations as energies. Describes ways in which behavior change is measured in each approach. (SK)
Encoding nondeterministic fuzzy tree automata into recursive neural networks.
Gori, Marco; Petrosino, Alfredo
2004-11-01
Fuzzy neural systems have been a subject of great interest in the last few years, due to their abilities to facilitate the exchange of information between symbolic and subsymbolic domains. However, the models in the literature are not able to deal with structured organization of information, that is typically required by symbolic processing. In many application domains, the patterns are not only structured, but a fuzziness degree is attached to each subsymbolic pattern primitive. The purpose of this paper is to show how recursive neural networks, properly conceived for dealing with structured information, can represent nondeterministic fuzzy frontier-to-root tree automata. Whereas available prior knowledge expressed in terms of fuzzy state transition rules are injected into a recursive network, unknown rules are supposed to be filled in by data-driven learning. We also prove the stability of the encoding algorithm, extending previous results on the injection of fuzzy finite-state dynamics in high-order recurrent networks. PMID:15565771
Simulation of the 1992 Tessina landslide by a cellular automata model and future hazard scenarios
NASA Astrophysics Data System (ADS)
Avolio, MV; Di Gregorio, Salvatore; Mantovani, Franco; Pasuto, Alessandro; Rongo, Rocco; Silvano, Sandro; Spataro, William
Cellular Automata are a powerful tool for modelling natural and artificial systems, which can be described in terms of local interactions of their constituent parts. Some types of landslides, such as debris/mud flows, match these requirements. The 1992 Tessina landslide has characteristics (slow mud flows) which make it appropriate for modelling by means of Cellular Automata, except for the initial phase of detachment, which is caused by a rotational movement that has no effect on the mud flow path. This paper presents the Cellular Automata approach for modelling slow mud/debris flows, the results of simulation of the 1992 Tessina landslide and future hazard scenarios based on the volumes of masses that could be mobilised in the future. They were obtained by adapting the Cellular Automata Model called SCIDDICA, which has been validated for very fast landslides. SCIDDICA was applied by modifying the general model to the peculiarities of the Tessina landslide. The simulations obtained by this initial model were satisfactory for forecasting the surface covered by mud. Calibration of the model, which was obtained from simulation of the 1992 event, was used for forecasting flow expansion during possible future reactivation. For this purpose two simulations concerning the collapse of about 1 million m 3 of material were tested. In one of these, the presence of a containment wall built in 1992 for the protection of the Tarcogna hamlet was inserted. The results obtained identified the conditions of high risk affecting the villages of Funes and Lamosano and show that this Cellular Automata approach can have a wide range of applications for different types of mud/debris flows.
The Learning of Consumer Skills in Adolescents: An Eclectic Approach.
ERIC Educational Resources Information Center
Kuo, Cheng
A study investigated the learning of consumer skills by adolescents, using two theoretical approaches--the social learning and the family communication pattern approaches. It was hypothesized that (1) assuming that parents are more experienced consumers than are adolescents, frequent discussion with parents on consumption matters are likely to…
Enhancing the Teaching-Learning Process: A Knowledge Management Approach
ERIC Educational Resources Information Center
Bhusry, Mamta; Ranjan, Jayanthi
2012-01-01
Purpose: The purpose of this paper is to emphasize the need for knowledge management (KM) in the teaching-learning process in technical educational institutions (TEIs) in India, and to assert the impact of information technology (IT) based KM intervention in the teaching-learning process. Design/methodology/approach: The approach of the paper is…
Manpower Development for Workers in Tertiary Institutions: Distance Learning Approach
ERIC Educational Resources Information Center
Hassan, Moshood Ayinde
2011-01-01
The purpose of this study is to determine the extent to which workers patronize distance learning approach to further their education. Other purposes include: determine problems facing workers in the process of improving their knowledge and skills through distance learning approach; establish the level of attainment of manpower development…
Forward-Oriented Design for Learning: Illustrating the Approach
ERIC Educational Resources Information Center
Dimitriadis, Yannis; Goodyear, Peter
2013-01-01
This paper concerns sustainable approaches to design for learning, emphasising the need for designs to be able to thrive outside of the protective niches of project-based innovation. It builds on the "in medias res" framework and more specifically on a forward-oriented approach to design for learning: one that takes a pro-active design…
A Guided Discovery Approach for Learning Metabolic Pathways
ERIC Educational Resources Information Center
Schultz, Emeric
2005-01-01
Learning the wealth of information in metabolic pathways is both challenging and overwhelming for students. A step-by-step guided discovery approach to the learning of the chemical steps in gluconeogenesis and the citric acid cycle is described. This approach starts from concepts the student already knows, develops these further in a logical…
Hong Kong Students' Approaches to Learning: Cross-Cultural Comparisons
ERIC Educational Resources Information Center
Dasari, Bhoomiah
2009-01-01
Anecdotal evidence abounds in Hong Kong to the effect that students entering tertiary education are predisposed to a "rote" learning approach. With the internalisation of higher education in many countries, there is still insufficient understanding of how Chinese students approach their learning. Except few studies were conducted locally, there…
Conceptions of and Approaches to Learning through Online Peer Assessment
ERIC Educational Resources Information Center
Yang, Yu-Fang; Tsai, Chin-Chung
2010-01-01
The present study investigated junior college students' conceptions of and approaches to learning via online peer assessment (PA) using a phenomenographic approach. Participants were 163 college students. Students were asked to accomplish a given learning task via an online PA system. Of the participants, 62 were interviewed after the activity.…
Students' Approaches to Learning a New Mathematical Model
ERIC Educational Resources Information Center
Flegg, Jennifer A.; Mallet, Daniel G.; Lupton, Mandy
2013-01-01
In this article, we report on the findings of an exploratory study into the experience of undergraduate students as they learn new mathematical models. Qualitative and quantitative data based around the students' approaches to learning new mathematical models were collected. The data revealed that students actively adopt three approaches to…
Approaches to Learning in a Second Year Chemical Engineering Course.
ERIC Educational Resources Information Center
Case, Jennifer M.; Gunstone, Richard F.
2003-01-01
Investigates student approaches to learning in a second year chemical engineering course by means of a qualitative research project which utilized interview and journal data from a group of 11 students. Identifies three approaches to learning: (1) conceptual; (2) algorithmic; and (3) information-based. Presents student responses to a series of…
Approach to Learning of Sub-Degree Students in Hong Kong
ERIC Educational Resources Information Center
Chan, Yiu Man; Chan, Christine Mei Sheung
2010-01-01
The learning approaches and learning experiences of 404 sub-degree students were assessed by using a Study Process Questionnaire and a Learning Experience Questionnaire. While the learning approaches in this study meant whether students used a deep learning or surface learning approach, the learning experiences referred to students' perceptions…
Argumentation Based Joint Learning: A Novel Ensemble Learning Approach
Xu, Junyi; Yao, Li; Li, Le
2015-01-01
Recently, ensemble learning methods have been widely used to improve classification performance in machine learning. In this paper, we present a novel ensemble learning method: argumentation based multi-agent joint learning (AMAJL), which integrates ideas from multi-agent argumentation, ensemble learning, and association rule mining. In AMAJL, argumentation technology is introduced as an ensemble strategy to integrate multiple base classifiers and generate a high performance ensemble classifier. We design an argumentation framework named Arena as a communication platform for knowledge integration. Through argumentation based joint learning, high quality individual knowledge can be extracted, and thus a refined global knowledge base can be generated and used independently for classification. We perform numerous experiments on multiple public datasets using AMAJL and other benchmark methods. The results demonstrate that our method can effectively extract high quality knowledge for ensemble classifier and improve the performance of classification. PMID:25966359
Learning Based Approach for Optimal Clustering of Distributed Program's Call Flow Graph
NASA Astrophysics Data System (ADS)
Abofathi, Yousef; Zarei, Bager; Parsa, Saeed
Optimal clustering of call flow graph for reaching maximum concurrency in execution of distributable components is one of the NP-Complete problems. Learning automatas (LAs) are search tools which are used for solving many NP-Complete problems. In this paper a learning based algorithm is proposed to optimal clustering of call flow graph and appropriate distributing of programs in network level. The algorithm uses learning feature of LAs to search in state space. It has been shown that the speed of reaching to solution increases remarkably using LA in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of proposed algorithm over others.
Lifelong Learning in Architectural Design Studio: The Learning Contract Approach
ERIC Educational Resources Information Center
Hassanpour, B.; Che-Ani, A. I.; Usman, I. M. S.; Johar, S.; Tawil, N. M.
2015-01-01
Avant-garde educational systems are striving to find lifelong learning methods. Different fields and majors have tested a variety of proposed models and found varying difficulties and strengths. Architecture is one of the most critical areas of education because of its special characteristics, such as learning by doing and complicated evaluation…
Problem Finding in Professional Learning Communities: A Learning Study Approach
ERIC Educational Resources Information Center
Tan, Yuen Sze Michelle; Caleon, Imelda Santos
2016-01-01
This study marries collaborative problem solving and learning study in understanding the onset of a cycle of teacher professional development process within school-based professional learning communities (PLCs). It aimed to explore how a PLC carried out collaborative problem finding--a key process involved in collaborative problem solving--that…
Nonsynchronous updating in the multiverse of cellular automata.
Reia, Sandro M; Kinouchi, Osame
2015-04-01
In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities. PMID:25974442
Nonsynchronous updating in the multiverse of cellular automata
NASA Astrophysics Data System (ADS)
Reia, Sandro M.; Kinouchi, Osame
2015-04-01
In this paper we study updating effects on cellular automata rule space. We consider a subset of 6144 order-3 automata from the space of 262144 bidimensional outer-totalistic rules. We compare synchronous to asynchronous and sequential updatings. Focusing on two automata, we discuss how update changes destroy typical structures of these rules. Besides, we show that the first-order phase transition in the multiverse of synchronous cellular automata, revealed with the use of a recently introduced control parameter, seems to be robust not only to changes in update schema but also to different initial densities.
Generational diversity: teaching and learning approaches.
Johnson, Susan A; Romanello, Mary L
2005-01-01
Nursing students represent multiple generations--Baby Boomers, Generation X, and now the Millennials. Each generation has its own set of values, ideas, ethics, beliefs, and learning styles. The authors describe the context, characteristics, and learning styles of each generation and provide suggestions for enhanced teaching and learning across multiple generations. Using generational diversity as a teaching tool in the classroom is also discussed. PMID:16170263
GARDENS OF EDEN OF ELEMENTARY CELLULAR AUTOMATA.
Barrett, C. L.; Chen, W. Y. C.; Reidys, C. M.
2001-01-01
Using de Bruijn graphs, we give a characterization of elementary cellular automata on the linear lattice that do not have any Gardens of Eden. It turns out that one can easily recoginze a CA that does not have any Gardens of Eden by looking at its de Bruijn graph. We also present a sufficient condition for the set of words accepted by a CA not to constitute a finite-complement language.
Cellular automata model for citrus variegated chlorosis.
Martins, M L; Ceotto, G; Alves, S G; Bufon, C C; Silva, J M; Laranjeira, F F
2000-11-01
A cellular automata model is proposed to analyze the progress of citrus variegated chlorosis epidemics in São Paulo orange plantations. In this model epidemiological and environmental features, such as motility of sharpshooter vectors that perform Lévy flights, level of plant hydric and nutritional stress, and seasonal climatic effects, are included. The observed epidemic data were quantitatively reproduced by the proposed model on varying the parameters controlling vector motility, plant stress, and initial population of diseased plants. PMID:11102058
Child Development: An Active Learning Approach
ERIC Educational Resources Information Center
Levine, Laura E.; Munsch, Joyce
2010-01-01
Within each chapter of this innovative topical text, the authors engage students by demonstrating the wide range of real-world applications of psychological research connected to child development. In particular, the distinctive Active Learning features incorporated throughout the book foster a dynamic and personal learning process for students.…
Design Approaches in Technology-Enhanced Learning
ERIC Educational Resources Information Center
Mor, Yishay; Winters, Niall
2007-01-01
Design is critical to the successful development of any interactive learning environment (ILE). Moreover, in technology-enhanced learning (TEL) the design process requires input from many diverse areas of expertise. As such, anyone undertaking tool development is required to directly address the design challenge from multiple perspectives. We…
A New Approach to Group Learning
ERIC Educational Resources Information Center
Parsons, Jerry
1976-01-01
To help teachers plan strategy for working with a learning group, 12 factors affecting a learning group are discussed and a series of check points are identified as criteria for evaluation. Concepts and principles of group dynamics are drawn from sociology and the work of Carl Rogers. (Author/AJ)
Understanding Observational Learning: An Interbehavioral Approach
ERIC Educational Resources Information Center
Fryling, Mitch J.; Johnston, Cristin; Hayes, Linda J.
2011-01-01
Observational learning is an important area in the field of psychology and behavior science more generally. Given this, it is essential that behavior analysts articulate a sound theory of how behavior change occurs through observation. This paper begins with an overview of seminal research in the area of observational learning, followed by a…
Individualistic and Collectivistic Approaches to Language Learning
ERIC Educational Resources Information Center
Pena, Elizabeth D.; Mendez-Perez, Anita
2006-01-01
Mediated learning describes what parents and teachers do to teach and includes four components: (1) intent to teach; (2) competence; (3) transcendence to promote high level thinking; and (4) mediation of meaning, helping children to focus on the importance of what is being focused on. Mediated learning is assumed to be universal for all cultural…
Holistic Approaches to E-Learning Accessibility
ERIC Educational Resources Information Center
Phipps, Lawrie; Kelly, Brian
2006-01-01
The importance of accessibility to digital e-learning resources is widely acknowledged. The World Wide Web Consortium Web Accessibility Initiative has played a leading role in promoting the importance of accessibility and developing guidelines that can help when developing accessible web resources. The accessibility of e-learning resources…
ERIC Educational Resources Information Center
Changeiywo, Johnson M.; Wambugu, P. W.; Wachanga, S. W.
2011-01-01
Teaching method is a major factor that affects students' motivation to learn physics. This study investigated the effects of using mastery learning approach (MLA) on secondary school students' motivation to learn physics. Solomon four non-equivalent control group design under the quasi-experimental research method was used in which a random sample…
ERIC Educational Resources Information Center
Baeten, Marlies; Dochy, Filip; Struyven, Katrien; Parmentier, Emmeline; Vanderbruggen, Anne
2016-01-01
The use of student-centred learning environments in education has increased. This study investigated student teachers' instructional preferences for these learning environments and how these preferences are related to their approaches to learning. Participants were professional Bachelor students in teacher education. Instructional preferences and…
Towards a Standards-Based Approach to E-Learning Personalization Using Reusable Learning Objects.
ERIC Educational Resources Information Center
Conlan, Owen; Dagger, Declan; Wade, Vincent
E-Learning systems that produce personalized course offerings for the learner are often expensive, both from a time and financial perspective, to develop and maintain. Learning content personalized to a learners' cognitive preferences has been shown to produce more effective learning, however many approaches to realizing this form of…
A Team Approach to Successful Learning: Peer Learning Coaches in Chemistry
ERIC Educational Resources Information Center
Popejoy, Kate; Asala, Kathryn S.
2013-01-01
High failure rates in introductory large lecture chemistry courses for STEM majors have been of concern for years. Through our weekly Team Approach to Successful Learning (TASL) workshops, students learn and apply problem-solving strategies, coached by specially trained peer learning coaches (LCs). These coaches concurrently enroll in Chemistry…
ERIC Educational Resources Information Center
Struyven, Katrien; Dochy, Filip; Janssens, Steven; Gielen, Sarah
2006-01-01
This study investigates the effects of the learning/teaching environment on students' approaches to learning (i.e. combination of intention and learning strategies) and compares a lecture based to a student-activating setting within the first year of elementary teacher education. Data collection (N = 790) was carried out using a pre-test/post-test…
ERIC Educational Resources Information Center
Shen, Kuan-Ming; Lee, Min-Hsien; Tsai, Chin-Chung; Chang, Chun-Yen
2016-01-01
In the area of science education research, studies have attempted to investigate conceptions of learning, approaches to learning, and self-efficacy, mainly focusing on science in general or on specific subjects such as biology, physics, and chemistry. However, few empirical studies have probed students' earth science learning. This study aimed to…
ERIC Educational Resources Information Center
Zandi, Hamed; Kaivanpanah, Shiva; Alavi, Sayyed Mohammad
2015-01-01
Contract learning as an approach to individualizing education in the context of assessment for learning is relatively underexplored in English as a Foreign Language instruction. The present study used a mixed-methods design to investigate its efficacy to provide feedback to students and improve self-directed learning. Furthermore, it studied…
ERIC Educational Resources Information Center
Wu, Po-Han; Hwang, Gwo-Jen; Tsai, Wen-Hung
2013-01-01
Context-aware ubiquitous learning has been recognized as being a promising approach that enables students to interact with real-world learning targets with supports from the digital world. Several researchers have indicated the importance of providing learning guidance or hints to individual students during the context-aware ubiquitous learning…
Approaches to Learning and Kolb's Learning Styles of Undergraduates with Better Grades
NASA Astrophysics Data System (ADS)
Almeida, Patrícia; Teixeira-Dias, José Joaquim; Martinho, Mariana; Balasooriya, Chinthaka
The purpose of this study is to investigate if the teaching, learning and assessment strategies conceived and implemented in a higher education chemistry course promote the development of conceptual understanding, as intended. Thus, our aim is to analyse the learning styles and the approaches to learning of chemistry undergraduates with better grades. The overall results show that the students with better grades possess the assimilator learning style, that is usually associated to the archetypal chemist. Moreover, the students with the highest grades revealed a conception of learning emphasising understanding. However, these students diverged both in their learning approaches and in their preferences for teaching strategies. The majority of students adopted a deep approach or a combination of a deep and a strategic approach, but half of them revealed their preference for teaching-centred strategies.
A Goal-Based Approach for Learning in Business Processes
NASA Astrophysics Data System (ADS)
Soffer, Pnina; Ghattas, Johny; Peleg, Mor
Organizations constantly strive to improve their business performance; hence they make business process redesign efforts. So far, redesign has mainly been a human task, which relies on human reasoning and creativity, although various analysis tools can support it by identifying improvement opportunities. This chapter proposes an automated approach for learning from accumulated experience and improving business processes over time. The approach ties together three aspects of business processes: goals, context, and actual paths. It proposes a learning cycle, including a learning phase, where the relevant context is identified and used for making improvements in the process model, and a runtime application phase, where the improved process model is applied at runtime and actual results are stored for the next learning cycle. According to our approach, a goal-oriented process model is essential for learning to improve process outcomes.
Towards Time Automata and Multi-Agent Systems
NASA Technical Reports Server (NTRS)
Hutzler, G.; Klaudel, H.; Wang, D. Y.
2004-01-01
The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of temporal constraints) criteria. In this paper, we propose a global approach for the design of adaptive reactive systems, i.e., systems that dynamically adapt their architecture depending on the context. We use the timed automata formalism for the design of the agents' behavior. This allows evaluating beforehand the properties of the system (regarding logical correctness and timeliness), thanks to model-checking and simulation techniques. This model is enhanced with tools that we developed for the automatic generation of code, allowing to produce very quickly a running multi-agent prototype satisfying the properties of the model.
Dynamics of HIV infection on 2D cellular automata
NASA Astrophysics Data System (ADS)
Benyoussef, A.; HafidAllah, N. El; ElKenz, A.; Ez-Zahraouy, H.; Loulidi, M.
2003-05-01
We use a cellular automata approach to describe the interactions of the immune system with the human immunodeficiency virus (HIV). We study the evolution of HIV infection, particularly in the clinical latency period. The results we have obtained show the existence of four different behaviours in the plane of death rate of virus-death rate of infected T cell. These regions meet at a critical point, where the virus density and the infected T cell density remain invariant during the evolution of disease. We have introduced two kinds of treatments, the protease inhibitors and the RT inhibitors, in order to study their effects on the evolution of HIV infection. These treatments are powerful in decreasing the density of the virus in the blood and the delay of the AIDS onset.
Cellular automata simulation of traffic including cars and bicycles
NASA Astrophysics Data System (ADS)
Vasic, Jelena; Ruskin, Heather J.
2012-04-01
As 'greening' of all aspects of human activity becomes mainstream, transportation science is also increasingly focused around sustainability. Modal co-existence between motorised and non-motorised traffic on urban networks is, in this context, of particular interest for traffic flow modelling. The main modelling problems here are posed by the heterogeneity of vehicles, including size and dynamics, and by the complex interactions at intersections. Herein we address these with a novel technique, based on one-dimensional cellular automata components, for modelling network infrastructure and its occupancy by vehicles. We use this modelling approach, together with a corresponding vehicle behaviour model, to simulate combined car and bicycle traffic for two elemental scenarios-examples of components that would be used in the building of an arbitrary network. Results of simulations performed on these scenarios, (i) a stretch of road and (ii) an intersection causing conflict between cars and bicycles sharing a lane, are presented and analysed.
Learning from project experiences using a legacy-based approach
NASA Technical Reports Server (NTRS)
Cooper, Lynne P.; Majchrzak, Ann; Faraj, Samer
2005-01-01
As project teams become used more widely, the question of how to capitalize on the knowledge learned in project teams remains an open issue. Using previous research on shared cognition in groups, an approach to promoting post-project learning was developed. This Legacy Review concept was tested on four in tact project teams. The results from those test sessions were used to develop a model of team learning via group cognitive processes. The model and supporting propositions are presented.
Learning Approach and Learning Strengths: A Case Study in an Ultraorthodox Community
ERIC Educational Resources Information Center
Aflalo, Ester
2012-01-01
This study furthers the understanding of the connections between learning approaches and learning strengths. The research population embraced 65 males from the Jewish ultraorthodox community, who abide by distinct methods of study. One group follows the very didactic, linear and structured approach with performance orientation, while the second…
ERIC Educational Resources Information Center
Nordin, Abu Bakar; Alias, Norlidah
2013-01-01
Today teachers in schools and lecturers in institutions of higher learning are endowed with a wide range of new teaching experiences through web-based teaching and learning approaches (WBTLA), which was not possible before through the traditional classroom approach. With the use of WBTLA emerged problems related to usability in technical,…
ERIC Educational Resources Information Center
Herrmann, Kim Jesper
2014-01-01
This study examines differences in university students' approaches to learning when attending tutorials as well as variation in students' perceptions of tutorials as an educational arena. In-depth qualitative analysis of semi-structured interviews with undergraduates showed how surface and deep approaches to learning were revealed in the…
Learning Styles and Approaches to Learning in Excellent and Average First-Year University Students
ERIC Educational Resources Information Center
Gargallo López, Bernardo; Almerich Cerveró, Gonzalo; Suárez Rodríguez, Jesús M.; García Félix, Eloïna; Garfella Esteban, Pedro R.
2013-01-01
We assessed the learning approaches and learning styles of a sample of 148 excellent students selected from 11 degrees from nine centers of the Polytechnic University of Valencia (Spain), and we compared the results with those of a sample of 133 average students from the same centers. We found that excellent students took deeper approach than…
Situated Poetry Learning Using Multimedia Resource Sharing Approach
ERIC Educational Resources Information Center
Yang, Che-Ching; Tseng, Shian-Shyong; Liao, Anthony Y. H.; Liang, Tyne
2013-01-01
Educators have emphasized the importance of situating students in an authentic learning environment. By using such approach, teachers can encourage students to learn Chinese poems by browsing content resources and relevant online multimedia resources by using handheld devices. Nevertheless, students in heterogeneous network environments may have…
University Students' Achievement Goals and Approaches to Learning in Mathematics
ERIC Educational Resources Information Center
Cano, Francisco; Berben, A. B. G.
2009-01-01
Background: Achievement goals (AG) and students' approaches to learning (SAL) are two research perspectives on student motivation and learning in higher education that have until now been pursued quite independently. Aims: This study sets out: (a) to explore the relationship between the most representative variables of SAL and AG; (b) to identify…
Blended Learning in Higher Education: Three Different Design Approaches
ERIC Educational Resources Information Center
Alammary, Ali; Sheard, Judy; Carbone, Angela
2014-01-01
Blended learning has been growing in popularity as it has proved to be an effective approach for accommodating an increasingly diverse student population whilst adding value to the learning environment through incorporation of online teaching resources. Despite this growing interest, there is ongoing debate about the definition of the concept of…
Developing a Competency-Based Assessment Approach for Student Learning
ERIC Educational Resources Information Center
Dunning, Pamela T.
2014-01-01
Higher education accrediting bodies are increasing the emphasis on assessing student learning outcomes as opposed to teaching methodology. The purpose of this article is to describe the process used by Troy University's Master of Public Administration program to change their assessment approach from a course learning objective perspective to a…
A Challenge-Feedback Learning Approach to Teaching International Business
ERIC Educational Resources Information Center
Sternad, Dietmar
2015-01-01
This article introduces a challenge-feedback learning (CFL) approach based on the goal-setting theory of human motivation, the deliberate practice theory of expert performance, and findings from the research on active and collaborative learning. The core of the teaching concept is the CFL cycle in which students repeatedly progress through four…
Students' Studying and Approaches to Learning in Introductory Biology
ERIC Educational Resources Information Center
Tomanek, Debra; Montplaisir, Lisa
2004-01-01
This exploratory study was conducted in an introductory biology course to determine 1) how students used the large lecture environment to create their own learning tasks during studying and 2) whether meaningful learning resulted from the students' efforts. Academic task research from the K-12 education literature and student approaches to…
Contextualized Teaching & Learning: A Promising Approach for Basic Skills Instruction
ERIC Educational Resources Information Center
Baker, Elaine DeLott; Hope, Laura; Karandjeff, Kelley
2009-01-01
Contextualized teaching and learning (CTL), or the concept of relating subject matter content to meaningful situations that are relevant to students' lives, offers one promising approach to helping students learn more effectively. This brief offers instructors, college leaders, policy makers and funders a high-level summary of the CTL…
Learning Objects Update: Review and Critical Approach to Content Aggregation
ERIC Educational Resources Information Center
Balatsoukas, Panos; Morris, Anne; O'Brien, Ann
2008-01-01
The structure and composite nature of a learning object is still open to interpretation. Although several theoretical studies advocate integrated approaches to the structure and aggregation level of learning objects, in practice, many content specifications, such as SCORM, IMS Content Packaging, and course authoring tools, do not explicitly state…
Teaching Math in the Primary Grades: The Learning Trajectories Approach
ERIC Educational Resources Information Center
Sarama, Julie; Clements, Douglas
2009-01-01
Children's thinking follows natural developmental paths in learning math. When teachers understand those paths and offer activities based on children's progress along them, they build developmentally appropriate math environments. The authors explain math learning trajectories and why teaching math using the trajectories approach is effective. A…
Sound Foundations: Organic Approaches to Learning Notation in Beginning Band
ERIC Educational Resources Information Center
West, Chad
2016-01-01
By starting with a foundation of sound before sight, we can help our students learn notation organically in a way that honors the natural process. This article describes five organic approaches to learning notation in beginning band: (1) iconic notation, (2) point and play, (3) student lead-sheet, (4) modeling, and (5) kid dictation. While…
Afterschool Programs: Inspiring Students with a Connected Learning Approach
ERIC Educational Resources Information Center
Afterschool Alliance, 2015
2015-01-01
Afterschool programs have been among the pioneers in applying a connected learning approach-creating a learning environment for students that builds on their interests; introduces them to new passions; provides mentors and a supportive peer network; and links this engagement to academics, careers and civic participation. This report, discusses the…
Practical Approaches to Using Learning Styles in Higher Education.
ERIC Educational Resources Information Center
Dunn, Rita, Ed.; Griggs, Shirley A., Ed.
The focus of this collection of essays is on new approaches to teaching in higher education. Selections are organized in five sections; the first section focuses on learning styles, while the remaining sections focus on applications in various academic disciplines. The chapters include: (1) "Capitalizing on College Students' Learning Styles:…
Approaches to Learning: Supporting Brain Development for School Success
ERIC Educational Resources Information Center
Petersen, Sandra
2012-01-01
Prenatally and in infants and toddlers, the brain is being constructed as a foundation for all later learning. Positive early experiences contribute to the formation of a brain that is capable, early in infancy, of utilizing and strengthening the basic processes of learning. Throughout a lifetime, a person will repeatedly use these approaches to…
Exploring the Behavioural Patterns of Entrepreneurial Learning: A Competency Approach
ERIC Educational Resources Information Center
Man, Thomas Wing Yan
2006-01-01
Purpose: The purpose of this study is to empirically explore the behavioural patterns involved in entrepreneurial learning through a conceptualization of entrepreneurial learning as a "competency". Design/methodology/approach: Semi-structured interviews to 12 entrepreneurs were conducted with a focus on the critical incidents in which significant…
Blending Online Learning with Traditional Approaches: Changing Practices
ERIC Educational Resources Information Center
Condie, Rae; Livingston, Kay
2007-01-01
Considerable claims have been made for the development of e-learning, either as stand-alone programmes or alongside more traditional approaches to teaching and learning, for students across school and tertiary education. National initiatives have improved the position of schools in terms of access to hardware and electronic networking, software…
A Hybrid Approach to University Subject Learning Activities
ERIC Educational Resources Information Center
Osorio Gomez, Luz Adriana; Duart, Josep M.
2012-01-01
In order to get a better understanding of subject design and delivery using a hybrid approach, we have studied a hybrid learning postgraduate programme offered by the University of the Andes, Bogota, Colombia. The study analyses students' perceptions of subject design and delivery, with particular reference to learning activities and the roles of…
Mini Anchors: A Universal Design for Learning Approach
ERIC Educational Resources Information Center
Zydney, Janet Mannheimer; Hasselbring, Ted S.
2014-01-01
Teachers are challenged to create flexible learning environments that prepare students with diverse learning needs for adaptable thinking in a fast-paced and changing society. To address this need, we used a design-based research approach to develop a technology-based solution to individualize mathematical problem solving instruction to students…
Group Experiential Learning with Undergraduate Nursing Students: An Interdisciplinary Approach
ERIC Educational Resources Information Center
Pistole, M. Carole; Kinyon, Jane; Keith, Cynthia Bozich
2008-01-01
This research examined an interdisciplinary, collaborative experiential group learning approach, in which undergraduate nursing students met in small groups led by counseling doctoral student co-leaders. Statistical analysis suggests that the teaching method lead to learning of group concepts. Discussion addresses anecdotal observations,…
Students' Evaluation of Teaching, Approaches to Learning, and Academic Achievement
ERIC Educational Resources Information Center
Diseth, Age
2007-01-01
Students' evaluation and perception of the learning environment are considered to be important predictors of students' approaches to learning. These variables may also account for variance in academic outcome, such as in examination grades, but previous research has rarely included a comparison between all of these variables. This article…
An active learning approach with uncertainty, representativeness, and diversity.
He, Tianxu; Zhang, Shukui; Xin, Jie; Zhao, Pengpeng; Wu, Jian; Xian, Xuefeng; Li, Chunhua; Cui, Zhiming
2014-01-01
Big data from the Internet of Things may create big challenge for data classification. Most active learning approaches select either uncertain or representative unlabeled instances to query their labels. Although several active learning algorithms have been proposed to combine the two criteria for query selection, they are usually ad hoc in finding unlabeled instances that are both informative and representative and fail to take the diversity of instances into account. We address this challenge by presenting a new active learning framework which considers uncertainty, representativeness, and diversity creation. The proposed approach provides a systematic way for measuring and combining the uncertainty, representativeness, and diversity of an instance. Firstly, use instances' uncertainty and representativeness to constitute the most informative set. Then, use the kernel k-means clustering algorithm to filter the redundant samples and the resulting samples are queried for labels. Extensive experimental results show that the proposed approach outperforms several state-of-the-art active learning approaches. PMID:25180208
An Active Learning Approach with Uncertainty, Representativeness, and Diversity
He, Tianxu; Zhang, Shukui; Xin, Jie; Xian, Xuefeng; Li, Chunhua; Cui, Zhiming
2014-01-01
Big data from the Internet of Things may create big challenge for data classification. Most active learning approaches select either uncertain or representative unlabeled instances to query their labels. Although several active learning algorithms have been proposed to combine the two criteria for query selection, they are usually ad hoc in finding unlabeled instances that are both informative and representative and fail to take the diversity of instances into account. We address this challenge by presenting a new active learning framework which considers uncertainty, representativeness, and diversity creation. The proposed approach provides a systematic way for measuring and combining the uncertainty, representativeness, and diversity of an instance. Firstly, use instances' uncertainty and representativeness to constitute the most informative set. Then, use the kernel k-means clustering algorithm to filter the redundant samples and the resulting samples are queried for labels. Extensive experimental results show that the proposed approach outperforms several state-of-the-art active learning approaches. PMID:25180208
Exploiting the features of the finite state automata for biomolecular computing.
Martínez-Pérez, Israel Marck; Ignatova, Zoya; Zimmermann, Karl-Heinz
2009-01-01
Here, we review patents that have emerged in the field of DNA-based computing focusing thereby on the discoveries using the concept of molecular finite state automata. A finite state automaton, operating on a finite sequence of symbols and converting information from one to another, provides a basis for developing molecular-scale autonomous programmable models of biomolecular computation at cellular level. We also provide a brief overview on inventions which methodologically support the DNA-based computational approach. PMID:19519583
Service-Learning Pedagogy: Benefits of a Learning Community Approach
ERIC Educational Resources Information Center
Flinders, Brooke A.
2013-01-01
Service-learning is, by nature, continually evolving. Seifer (1996) stressed the importance of partnerships between communities and schools, and stated that reflection should facilitate the connection between practice and theory, and lead to critical thinking. Before these reflective activities occur, however, much can be done to maximize…
Promoting Hybrid Learning through a Sharable eLearning Approach
ERIC Educational Resources Information Center
Bai, Xin; Smith, Michael B.
2010-01-01
Educational technology is developing rapidly, making education more accessible, affordable, adaptable, and equitable. Students now have the option to choose a campus that can provide an excellent blended learning curriculum with minimal geographical restraints. We explored ways to maximize the power of educational technologies to improve teaching…
Self-structuring data learning approach
NASA Astrophysics Data System (ADS)
Ternovskiy, Igor; Graham, James; Carson, Daniel
2016-05-01
In this paper, we propose a hierarchical self-structuring learning algorithm based around the general principles of the Stanovich/Evans framework and "Quest" group definition of unexpected query. One of the main goals of our algorithm is for it to be capable of patterns learning and extrapolating more complex patterns from less complex ones. This pattern learning, influenced by goals, either learned or predetermined, should be able to detect and reconcile anomalous behaviors. One example of a proposed application of this algorithm would be traffic analysis. We choose this example, because it is conceptually easy to follow. Despite the fact that we are unlikely to develop superior traffic tracking techniques using our algorithm, a traffic based scenario remains a good starting point if only do to the easy availability of data and the number of other known techniques. In any case, in this scenario, the algorithm would observe and track all vehicular traffic in a particular area. After some initial time passes, it would begin detecting and learning the traffic's patters. Eventually the patterns would stabilize. At that point, "new" patterns could be considered anomalies, flagged, and handled accordingly. This is only one, particular application of our proposed algorithm. Ideally, we want to make it as general as possible, such that it can be applies to numerous different problems with varying types of sensory input and data types, such as IR, RF, visual, census data, meta data, etc.
Larvae, Ladies and Learning: The Project Approach.
ERIC Educational Resources Information Center
Whitham, Laurel; Killoran, Isabel
2003-01-01
Describes the Project Approach and how it was used in a Grade 1 exploration of Painted Lady butterflies in Ontario, Canada. Outlines the students' experience with the project and examines the compatibility of the Project Approach with the Ontario Science and Technology Curriculum document. Maintains that the Project Approach supports and…
Learning topological maps: An alternative approach
Buecken, A.; Thrun, S.
1996-12-31
Our goal is autonomous real-time control of a mobile robot. In this paper we want to show a possibility to learn topological maps of a large-scale indoor environment autonomously. In the literature there are two paradigms how to store information on the environment of a robot: as a grid-based (geometric) or as a topological map. While grid-based maps are considerably easy to learn and maintain, topological maps are quite compact and facilitate fast motion-planning.
ERIC Educational Resources Information Center
Heikkila, Annamari; Niemivirta, Markku; Nieminen, Juha; Lonka, Kirsti
2011-01-01
This study investigated the relationships among approaches to learning, regulation of learning, cognitive and attributional strategies, stress, exhaustion, and study success. University students (N = 437) from three faculties filled in a questionnaire concerning their self-reported study behaviour, cognitive strategies, and well-being. Their…
A Cognitive Approach to Student-Centered e-Learning
Greitzer, Frank L.
2002-09-30
Like traditional classroom instruction, distance/electronic learning (e-Learning) derives from largely behaviorist computer-based instruction paradigms that tend to reflect passive training philosophies. Over the past thirty years, more flexible, student-centered classroom teaching methods have been advocated based on the concepts of ''discovery'' learning and ''active'' learning; student-centered approaches are likewise encouraged in the development of e-Learning applications. Nevertheless, many e-Learning applications that employ state-of-the art multimedia technology in which students interact with simulations, animations, video, and sounds still fail to meet their expected training potential. Implementation of multimedia-based training features may give the impression of engaging the student in more active forms of learning, but sophisticated use of multimedia features does not necessarily produce the desired effect. This paper briefly reviews some general guidelines for applying cognitive science principles to development of student-centered e-Learning applications and describes a cognitive approach to e-Learning development that is being undertaken for the US Army.
Newton's First Law: A Learning Cycle Approach
ERIC Educational Resources Information Center
McCarthy, Deborah
2005-01-01
To demonstrate how Newton's first law of motion applies to students' everyday lives, the author developed a learning cycle series of activities on inertia. The discrepant event at the heart of these activities is sure to elicit wide-eyed stares and puzzled looks from students, but also promote critical thinking and help bring an abstract concept…
The Learning Centers Approach to Instruction.
ERIC Educational Resources Information Center
George, Paul S.; And Others
The learning center is a place for using and storing materials that relate to a special interest or curriculum area. It is a place where the students, after consulting with the teacher, may go to work; where ideas, materials, and activities are presented on a variety of levels of difficulty. Teachers, however, must first decide what the role of…
Bangladeshi EFL Learners' Approach towards Learning English
ERIC Educational Resources Information Center
Fathema, Fawzia
2015-01-01
Bangladesh is a poverty stricken country with a huge population "unemployed' in respect of the definition of Economics including both male and female. Government is striving hard to make the people well-equipped with necessary skills and learning in order that they can prove themselves fit for the upcoming challenges of the global economy and…
Integrated Learning Systems--An 'Open' Approach.
ERIC Educational Resources Information Center
Rogers, Laurence; Newton, Leonard
2001-01-01
Evaluates a new version of software explicitly designed to make links with several external factors, in particular with another software application for supporting investigative work in practical science. Explores the contributions to the learning process made by the teacher, the student, and the software itself. (Author/SAH)
Flipped Approach to Mobile Assisted Language Learning
ERIC Educational Resources Information Center
Yamamoto, Junko
2013-01-01
There are abundant possibilities for using smart phones and tablet computers for foreign language learning. However, if there is an emphasis on memorization or on technology, language learners may not develop proficiency in their target language. Therefore, language teachers should be familiar with strategies for facilitating creative…
A Belgian Approach to Learning Disabilities.
ERIC Educational Resources Information Center
Hayes, Cheryl W.
The paper reviews Belgian philosophy toward the education of learning disabled students and cites the differences between American behaviorally-oriented theory and Belgian emphasis on identifying the underlying causes of the disability. Academic methods observed in Belgium (including psychodrama and perceptual motor training) are discussed and are…
Teaching and Learning Forgiveness: A Multidimensional Approach
ERIC Educational Resources Information Center
Malcolm, Lois; Ramsey, Janet
2006-01-01
This essay seeks to illumine the teaching and learning of the practice of forgiveness by relating a range of theoretical perspectives (theological, psychological, and socio-cultural) to the process of cultivating the practical wisdom needed for forgiveness. We discuss how a Trinitarian "epistemology of the cross" might lead one to a new way of…
Approaches to the Validation of Learning Hierarchies.
ERIC Educational Resources Information Center
Resnick, Lauren B.; Wang, Margaret C.
This paper describes a program of research in the application of scalogram analysis to the validation of learning hierarchies, together with the development of an alternative method for assessing hierarchical relationships among tests of instructional objectives. The relationship between scalability of tests and positive transfer between…
Enterprise Approaches to Information and Learning Technology
ERIC Educational Resources Information Center
Ferrell, Gill
2007-01-01
Like it or not, an institution's IT infrastructure is a matter with which institutional strategic planners must concern themselves. Information systems represent a significant investment, they perform mission-critical functions, and the appropriate use of information and learning technologies can have a critical part to play in delivering against…
An Active Learning Approach to Teaching Statistics.
ERIC Educational Resources Information Center
Dolinsky, Beverly
2001-01-01
Provides suggestions for using active learning as the primary means to teaching statistics in order to create a collaborative environment. Addresses such strategies as using SPSS Base 7.5 for Windows and course periods centered on answering student-generated questions. Discusses various writing intensive assignments. (CMK)
The Cognitive Vocabulary Approach to Word Learning
ERIC Educational Resources Information Center
Harmon, Janis M.; Buckelew-Martin, Elizabeth; Wood, Karen D.
2010-01-01
English teachers face myriad demands every day that include not only helping students read literature in interesting and engaging ways but also attending to the needs of students challenged by the demands of more complex and sophisticated texts. Vocabulary learning is at the heart of this struggle for many students, especially for English language…
Walks: An Effective Approach to Learning.
ERIC Educational Resources Information Center
Wineberg, Lenore Peachin
1997-01-01
Whether planned or spontaneous, walks offer young children unexpected pleasures and discoveries about their environment. This article describes five strategies for using walks in early childhood programs (plan, gather information, develop safety rules, integrate with the curriculum, assess what has been learned), as well as specific indoor,…
Learning by imitation: a hierarchical approach.
Byrne, R W; Russon, A E
1998-10-01
To explain social learning without invoking the cognitively complex concept of imitation, many learning mechanisms have been proposed. Borrowing an idea used routinely in cognitive psychology, we argue that most of these alternatives can be subsumed under a single process, priming, in which input increases the activation of stored internal representations. Imitation itself has generally been seen as a "special faculty." This has diverted much research towards the all-or-none question of whether an animal can imitate, with disappointingly inconclusive results. In the great apes, however, voluntary, learned behaviour is organized hierarchically. This means that imitation can occur at various levels, of which we single out two clearly distinct ones: the "action level," a rather detailed and linear specification of sequential acts, and the "program level," a broader description of subroutine structure and the hierarchical layout of a behavioural "program." Program level imitation is a high-level, constructive mechanism, adapted for the efficient learning of complex skills and thus not evident in the simple manipulations used to test for imitation in the laboratory. As examples, we describe the food-preparation techniques of wild mountain gorillas and the imitative behaviour of orangutans undergoing "rehabilitation" to the wild. Representing and manipulating relations between objects seems to be one basic building block in their hierarchical programs. There is evidence that great apes suffer from a stricter capacity limit than humans in the hierarchical depth of planning. We re-interpret some chimpanzee behaviour previously described as "emulation" and suggest that all great apes may be able to imitate at the program level. Action level imitation is seldom observed in great ape skill learning, and may have a largely social role, even in humans. PMID:10097023
Phase transitions in coupled map lattices and in associated probabilistic cellular automata.
Just, Wolfram
2006-10-01
Analytical tools are applied to investigate piecewise linear coupled map lattices in terms of probabilistic cellular automata. The so-called disorder condition of probabilistic cellular automata is closely related with attracting sets in coupled map lattices. The importance of this condition for the suppression of phase transitions is illustrated by spatially one-dimensional systems. Invariant densities and temporal correlations are calculated explicitly. Ising type phase transitions are found for one-dimensional coupled map lattices acting on repelling sets and for a spatially two-dimensional Miller-Huse-like system with stable long time dynamics. Critical exponents are calculated within a finite size scaling approach. The relevance of detailed balance of the resulting probabilistic cellular automaton for the critical behavior is pointed out. PMID:17155155
The Relationship between Learning Approaches of Prospective Teachers and Their Academic Achievement
ERIC Educational Resources Information Center
Gurlen, Eda; Turan, Sevgi; Senemoglu, Nuray
2013-01-01
To prepare for future professional challenges, prospective teachers should acquire the capabilities for independent learning. Prospective teachers should know how to learn effectively. In this article, prospective teachers' learning approaches, learning preference and the relationship between learning preference, learning approaches with…
Learner Performance in Multimedia Learning Arrangements: An Analysis across Instructional Approaches
ERIC Educational Resources Information Center
Eysink, Tessa H. S.; de Jong, Ton; Berthold, Kirsten; Kolloffel, Bas; Opfermann, Maria; Wouters, Pieter
2009-01-01
In this study, the authors compared four multimedia learning arrangements differing in instructional approach on effectiveness and efficiency for learning: (a) hypermedia learning, (b) observational learning, (c) self-explanation-based learning, and (d) inquiry learning. The approaches all advocate learners' active attitude toward the learning…
Modeling dynamical geometry with lattice gas automata
Hasslacher, B.; Meyer, D.A.
1998-06-27
Conventional lattice gas automata consist of particles moving discretely on a fixed lattice. While such models have been quite successful for a variety of fluid flow problems, there are other systems, e.g., flow in a flexible membrane or chemical self-assembly, in which the geometry is dynamical and coupled to the particle flow. Systems of this type seem to call for lattice gas models with dynamical geometry. The authors construct such a model on one dimensional (periodic) lattices and describe some simulations illustrating its nonequilibrium dynamics.