Symbolic Game Semantics for Model Checking Program Families
Dimovski, Aleksandar
2016-01-01
represent program families with infinite integers as so-called (finite-state) featured symbolic automata. Specifically designed model checking algorithms are then employed to verify safety of all programs from a family at once and pinpoint those programs that are unsafe (respectively, safe). We present...... a prototype tool implementing this approach, and we illustrate it with several examples....
Symbolic Dependency Graphs for PCTL Model-Checking
Mariegaard, Anders; Larsen, Kim Guldstrand
2017-01-01
We consider the problem of model-checking a subset of probabilistic CTL, interpreted over (discrete-time) Markov reward models, allowing the specification of lower bounds on the probability of the set of paths satisfying a cost-bounded path formula. We first consider a reduction to fixed-point co......We consider the problem of model-checking a subset of probabilistic CTL, interpreted over (discrete-time) Markov reward models, allowing the specification of lower bounds on the probability of the set of paths satisfying a cost-bounded path formula. We first consider a reduction to fixed...
Symbolic Model Checking and Analysis for E-Commerce Protocol
WEN Jing-Hua; ZHANG Mei; LI Xiang
2005-01-01
A new approach is proposed for analyzing non-repudiation and fairness of e-commerce protocols. The authentication e-mail protocol CMP1 is modeled as finite state machine and analyzed in two vital aspects - non-repudiation and fairness using SMV. As a result, the CMP1 protocol is not fair and we have improved it. This result shows that it is effective to analyze and check the new features of e-commerce protocols using SMV model checker
Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking
Christian Appold
2010-06-01
Full Text Available One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation. Dynamic symmetry reduction calculates representatives of equivalence classes of states dynamically and thus avoids the construction of the orbit relation. In this paper, we present a new efficient model checking algorithm based on dynamic symmetry reduction. Our experiments show that the algorithm is very fast and allows the verification of larger systems. We additionally implemented the use of state symmetries for symbolic symmetry reduction. To our knowledge we are the first who investigated state symmetries in combination with BDD based symbolic model checking.
Symbolic Game Semantics for Model Checking Program Families
Dimovski, Aleksandar
2016-01-01
Program families can produce a (potentially huge) number of related programs from a common code base. Many such programs are safety critical. However, most verification techniques are designed to work on the level of single programs, and thus are too costly to apply to the entire program family. In this paper, we propose an efficient game semantics based approach for verifying open program families, i.e. program families with free (undefined) identifiers. We use symbolic representation of alg...
Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking
Williams, Poul Frederick; Biere, Armin; Clarke, Edmund M.
2000-01-01
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Diagrams (BDDs), the traditionally used canonical representation. The method is based on standard fixed point algorithm...
Model Checking Feature Interactions
Le Guilly, Thibaut; Olsen, Petur; Pedersen, Thomas
2015-01-01
This paper presents an offline approach to analyzing feature interactions in embedded systems. The approach consists of a systematic process to gather the necessary information about system components and their models. The model is first specified in terms of predicates, before being refined to t...... to timed automata. The consistency of the model is verified at different development stages, and the correct linkage between the predicates and their semantic model is checked. The approach is illustrated on a use case from home automation....
Parallel Algorithms for Model Checking
van de Pol, Jaco; Mousavi, Mohammad Reza; Sgall, Jiri
2017-01-01
Model checking is an automated verification procedure, which checks that a model of a system satisfies certain properties. These properties are typically expressed in some temporal logic, like LTL and CTL. Algorithms for LTL model checking (linear time logic) are based on automata theory and graph
Compositional and Quantitative Model Checking
Larsen, Kim Guldstrand
2010-01-01
This paper gives a survey of a composition model checking methodology and its succesfull instantiation to the model checking of networks of finite-state, timed, hybrid and probabilistic systems with respect; to suitable quantitative versions of the modal mu-calculus [Koz82]. The method is based...
Model Checking Algorithms for CTMDPs
Buchholz, Peter; Hahn, Ernst Moritz; Hermanns, Holger
2011-01-01
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategie...
Coverage Metrics for Model Checking
Penix, John; Visser, Willem; Norvig, Peter (Technical Monitor)
2001-01-01
When using model checking to verify programs in practice, it is not usually possible to achieve complete coverage of the system. In this position paper we describe ongoing research within the Automated Software Engineering group at NASA Ames on the use of test coverage metrics to measure partial coverage and provide heuristic guidance for program model checking. We are specifically interested in applying and developing coverage metrics for concurrent programs that might be used to support certification of next generation avionics software.
A k-Bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems
Lee, Jooyong; Deng, Xianghua; Bogor, Robby
2006-01-01
This paper presents Kiasan, a bounded technique to reason about open systems based on a path sensitive, relatively sound and complete symbolic execution instead of the usual compositional reasoning through weakest precondition calculation that summarizes all execution paths. Kiasan is able to che...... framework and observed that its performance is comparable to ESC/Java on similar scales of problems and behavioral coverage, while providing the ability to check much stronger specifications...
Model Checking Markov Chains: Techniques and Tools
Zapreev, I.S.
2008-01-01
This dissertation deals with four important aspects of model checking Markov chains: the development of efficient model-checking tools, the improvement of model-checking algorithms, the efficiency of the state-space reduction techniques, and the development of simulation-based model-checking
Model Checking Timed Automata with Priorities using DBM Subtraction
David, Alexandre; Larsen, Kim Guldstrand; Pettersson, Paul
2006-01-01
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result...... in a non-convex set needing sets of DBMs for representation. Our subtraction algorithms are efficient in the sense that the number of generated DBMs is significantly reduced compared to a naive algorithm. The overhead in time is compensated by the gain from reducing the number of resulting DBMs since...... this number affects the performance of symbolic model-checking. The uses of the DBM subtraction operation extend beyond timed automata with priorities. It is also useful for allowing guards on transitions with urgent actions, deadlock checking, and timed games....
Model Checking as Static Analysis
Zhang, Fuyuan
fairness problems can be encoded into ALFP as well. To deal with multi-valued model checking problems, we have proposed multivalued ALFP. A Moore Family result for multi-valued ALFP is also established, which ensures the existence and uniqueness of the least model. When the truth values in multi-valued...... of states satisfying a CTL formula can be characterized as the least model of ALFP clauses specifying this CTL formula. The existence of the least model of ALFP clauses is ensured by the Moore Family property of ALFP. Then, we take fairness assumptions in CTL into consideration and have shown that CTL...... ALFP constitute a nite distributive complete lattice, multi-valued ALFP can be reduced to two-valued ALFP. This result enables to implement a solver for multi-valued ALFP by reusing existing solvers for twovalued ALFP. Our ALFP-based technique developed for the two-valued CTL naturally generalizes...
Model Checking Structured Infinite Markov Chains
Remke, Anne Katharina Ingrid
2008-01-01
In the past probabilistic model checking hast mostly been restricted to finite state models. This thesis explores the possibilities of model checking with continuous stochastic logic (CSL) on infinite-state Markov chains. We present an in-depth treatment of model checking algorithms for two special
Model Checking Real-Time Systems
Bouyer, Patricia; Fahrenberg, Uli; Larsen, Kim Guldstrand
2018-01-01
This chapter surveys timed automata as a formalism for model checking real-time systems. We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. We then present the main model-checking results in this framework, and give a hint...
Anomalous diffusion in a symbolic model
Ribeiro, H V; Lenzi, E K; Mendes, R S; Santoro, P A
2011-01-01
In this work, we investigate some statistical properties of symbolic sequences generated by a numerical procedure in which the symbols are repeated following the power-law probability density. In this analysis, we consider that the sum of n symbols represents the position of a particle in erratic movement. This approach reveals a rich diffusive scenario characterized by non-Gaussian distribution and, depending on the power-law exponent or the procedure used to build the walker, we may have superdiffusion, subdiffusion or usual diffusion. Additionally, we use the continuous-time random walk framework to compare the analytic results with the numerical data, thereby finding good agreement. Because of its simplicity and flexibility, this model can be a candidate for describing real systems governed by power-law probability densities.
Model checking mobile ad hoc networks
Ghassemi, Fatemeh; Fokkink, Wan
2016-01-01
Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying
Model-Checking Discrete Duration Calculus
Hansen, Michael Reichhardt
1994-01-01
can do model-checking. The subset we consider is expressive enough to formalize the requirements to the gas burner system given by A.P. Ravn (1993); but only for a discrete time domain. Model-checking is done by reducing the correctness problem ℳ|=𝒟 to the inclusion problem of regular...
Model Checking Infinite-State Markov Chains
Remke, Anne Katharina Ingrid; Haverkort, Boudewijn R.H.M.; Cloth, L.
2004-01-01
In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state
Engineering Abstractions in Model Checking and Testing
Achenbach, Michael; Ostermann, Klaus
2009-01-01
Abstractions are used in model checking to tackle problems like state space explosion or modeling of IO. The application of these abstractions in real software development processes, however, lacks engineering support. This is one reason why model checking is not widely used in practice yet...... and testing is still state of the art in falsification. We show how user-defined abstractions can be integrated into a Java PathFinder setting with tools like AspectJ or Javassist and discuss implications of remaining weaknesses of these tools. We believe that a principled engineering approach to designing...... and implementing abstractions will improve the applicability of model checking in practice....
Modeling oil production based on symbolic regression
Yang, Guangfei; Li, Xianneng; Wang, Jianliang; Lian, Lian; Ma, Tieju
2015-01-01
Numerous models have been proposed to forecast the future trends of oil production and almost all of them are based on some predefined assumptions with various uncertainties. In this study, we propose a novel data-driven approach that uses symbolic regression to model oil production. We validate our approach on both synthetic and real data, and the results prove that symbolic regression could effectively identify the true models beneath the oil production data and also make reliable predictions. Symbolic regression indicates that world oil production will peak in 2021, which broadly agrees with other techniques used by researchers. Our results also show that the rate of decline after the peak is almost half the rate of increase before the peak, and it takes nearly 12 years to drop 4% from the peak. These predictions are more optimistic than those in several other reports, and the smoother decline will provide the world, especially the developing countries, with more time to orchestrate mitigation plans. -- Highlights: •A data-driven approach has been shown to be effective at modeling the oil production. •The Hubbert model could be discovered automatically from data. •The peak of world oil production is predicted to appear in 2021. •The decline rate after peak is half of the increase rate before peak. •Oil production projected to decline 4% post-peak
Model Checking Discounted Temporal Properties
de Alfaro, Luca; Faella, Marco; Henzinger, Thomas A.; Majumdar, Rupak; Stoelinga, Mariëlle Ida Antoinette
2005-01-01
Temporal logic is two-valued: a property is either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a
Model Checking Discounted Temporal Properties
de Alfaro, Luca; Faella, Marco; Henzinger, Thomas A.; Majumdar, Rupak; Stoelinga, Mariëlle Ida Antoinette; Jensen, K; Podelski, A.
2004-01-01
Temporal logic is two-valued: a property is either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a
UTP and Temporal Logic Model Checking
Anderson, Hugh; Ciobanu, Gabriel; Freitas, Leo
In this paper we give an additional perspective to the formal verification of programs through temporal logic model checking, which uses Hoare and He Unifying Theories of Programming (UTP). Our perspective emphasizes the use of UTP designs, an alphabetised relational calculus expressed as a pre/post condition pair of relations, to verify state or temporal assertions about programs. The temporal model checking relation is derived from a satisfaction relation between the model and its properties. The contribution of this paper is that it shows a UTP perspective to temporal logic model checking. The approach includes the notion of efficiency found in traditional model checkers, which reduced a state explosion problem through the use of efficient data structures
Model checking exact cost for attack scenarios
Aslanyan, Zaruhi; Nielson, Flemming
2017-01-01
Attack trees constitute a powerful tool for modelling security threats. Many security analyses of attack trees can be seamlessly expressed as model checking of Markov Decision Processes obtained from the attack trees, thus reaping the benefits of a coherent framework and a mature tool support....... However, current model checking does not encompass the exact cost analysis of an attack, which is standard for attack trees. Our first contribution is the logic erPCTL with cost-related operators. The extended logic allows to analyse the probability of an event satisfying given cost bounds and to compute...... the exact cost of an event. Our second contribution is the model checking algorithm for erPCTL. Finally, we apply our framework to the analysis of attack trees....
A Method for Model Checking Feature Interactions
Pedersen, Thomas; Le Guilly, Thibaut; Ravn, Anders Peter
2015-01-01
This paper presents a method to check for feature interactions in a system assembled from independently developed concurrent processes as found in many reactive systems. The method combines and refines existing definitions and adds a set of activities. The activities describe how to populate the ...... the definitions with models to ensure that all interactions are captured. The method is illustrated on a home automation example with model checking as analysis tool. In particular, the modelling formalism is timed automata and the analysis uses UPPAAL to find interactions....
Discrete-time rewards model-checked
Larsen, K.G.; Andova, S.; Niebert, Peter; Hermanns, H.; Katoen, Joost P.
2003-01-01
This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints. This allows to formulate complex measures – involving expected as well as accumulated rewards – in a precise and
Local Model Checking of Weighted CTL with Upper-Bound Constraints
Jensen, Jonas Finnemann; Larsen, Kim Guldstrand; Srba, Jiri
2013-01-01
We present a symbolic extension of dependency graphs by Liu and Smolka in order to model-check weighted Kripke structures against the logic CTL with upper-bound weight constraints. Our extension introduces a new type of edges into dependency graphs and lifts the computation of fixed-points from...
Model Checking the Remote Agent Planner
Khatib, Lina; Muscettola, Nicola; Havelund, Klaus; Norvig, Peter (Technical Monitor)
2001-01-01
This work tackles the problem of using Model Checking for the purpose of verifying the HSTS (Scheduling Testbed System) planning system. HSTS is the planner and scheduler of the remote agent autonomous control system deployed in Deep Space One (DS1). Model Checking allows for the verification of domain models as well as planning entries. We have chosen the real-time model checker UPPAAL for this work. We start by motivating our work in the introduction. Then we give a brief description of HSTS and UPPAAL. After that, we give a sketch for the mapping of HSTS models into UPPAAL and we present samples of plan model properties one may want to verify.
Statistical Model Checking for Biological Systems
David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel
2014-01-01
Statistical Model Checking (SMC) is a highly scalable simulation-based verification approach for testing and estimating the probability that a stochastic system satisfies a given linear temporal property. The technique has been applied to (discrete and continuous time) Markov chains, stochastic...
Model checking the HAVi leader election protocol
J.M.T. Romijn (Judi)
1999-01-01
textabstractThe HAVi specification proposes an architecture for audio/video interoperability in home networks. Part of the HAVi specification is a distributed leader election protocol. We have modelled this leader election protocol in Promela and Lotos and have checked several properties with the
Model Checking - Automated Verification of Computational Systems
Home; Journals; Resonance – Journal of Science Education; Volume 14; Issue 7. Model Checking - Automated Verification of Computational Systems. Madhavan Mukund. General Article Volume 14 Issue 7 July 2009 pp 667-681. Fulltext. Click here to view fulltext PDF. Permanent link:
Slicing AADL specifications for model checking
Odenbrett, M.R.; Nguyen, V.Y.; Noll, T.
2010-01-01
To combat the state-space explosion problem in model checking larger systems, abstraction techniques can be employed. Here, methods that operate on the system specification before constructing its state space are preferable to those that try to minimize the resulting transition system as they
Automatic Generation of Symbolic Model for Parameterized Synchronous Systems
Wei-Wen Xu
2004-01-01
With the purpose of making the verification of parameterized system more general and easier, in this paper, a new and intuitive language PSL (Parameterized-system Specification Language) is proposed to specify a class of parameterized synchronous systems. From a PSL script, an automatic method is proposed to generate a constraint-based symbolic model. The model can concisely symbolically represent the collections of global states by counting the number of processes in a given state. Moreover, a theorem has been proved that there is a simulation relation between the original system and its symbolic model. Since the abstract and symbolic techniques are exploited in the symbolic model, state-explosion problem in traditional verification methods is efficiently avoided. Based on the proposed symbolic model, a reachability analysis procedure is implemented using ANSI C++ on UNIX platform. Thus, a complete tool for verifying the parameterized synchronous systems is obtained and tested for some cases. The experimental results show that the method is satisfactory.
Linear Parametric Model Checking of Timed Automata
Hune, Tohmas Seidelin; Romijn, Judi; Stoelinga, Mariëlle
2001-01-01
We present an extension of the model checker Uppaal capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identication...... of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidable, contrary to the full class where it is know to be undecidable. Also we present a number of lemmas enabling the verication eort to be reduced for L/U automata in some cases. We illustrate our approach...
Automata-Based CSL Model Checking
Zhang, Lijun; Jansen, David N.; Nielson, Flemming
2011-01-01
For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996. The presented decision procedure, however, has exponential complexity. In this paper, we...... probability can then be approximated in polynomial time (using uniformization). This makes the present work the centerpiece of a broadly applicable full CSL model checker. Recently, the decision algorithm by Aziz et al. was shown to be incorrect in general. In fact, it works only for stratified CTMCs...
Statistical Model Checking of Rich Models and Properties
Poulsen, Danny Bøgsted
in undecidability issues for the traditional model checking approaches. Statistical model checking has proven itself a valuable supplement to model checking and this thesis is concerned with extending this software validation technique to stochastic hybrid systems. The thesis consists of two parts: the first part...... motivates why existing model checking technology should be supplemented by new techniques. It also contains a brief introduction to probability theory and concepts covered by the six papers making up the second part. The first two papers are concerned with developing online monitoring techniques...... systems. The fifth paper shows how stochastic hybrid automata are useful for modelling biological systems and the final paper is concerned with showing how statistical model checking is efficiently distributed. In parallel with developing the theory contained in the papers, a substantial part of this work...
Model Checking Markov Reward Models with Impulse Rewards
Cloth, Lucia; Katoen, Joost-Pieter; Khattri, Maneesh; Pulungan, Reza; Bondavalli, Andrea; Haverkort, Boudewijn; Tang, Dong
This paper considers model checking of Markov reward models (MRMs), continuous-time Markov chains with state rewards as well as impulse rewards. The reward extension of the logic CSL (Continuous Stochastic Logic) is interpreted over such MRMs, and two numerical algorithms are provided to check the
A variety of nutrition symbols and rating systems are in use on the front of food packages. They are intended to help consumers make healthier food choices. One system, the American Heart Association Heart (AHA) Heart-Check Program, has evolved over time to incorporate current science-based recommen...
Model Checking JAVA Programs Using Java Pathfinder
Havelund, Klaus; Pressburger, Thomas
2000-01-01
This paper describes a translator called JAVA PATHFINDER from JAVA to PROMELA, the "programming language" of the SPIN model checker. The purpose is to establish a framework for verification and debugging of JAVA programs based on model checking. This work should be seen in a broader attempt to make formal methods applicable "in the loop" of programming within NASA's areas such as space, aviation, and robotics. Our main goal is to create automated formal methods such that programmers themselves can apply these in their daily work (in the loop) without the need for specialists to manually reformulate a program into a different notation in order to analyze the program. This work is a continuation of an effort to formally verify, using SPIN, a multi-threaded operating system programmed in Lisp for the Deep-Space 1 spacecraft, and of previous work in applying existing model checkers and theorem provers to real applications.
Circular blurred shape model for multiclass symbol recognition.
Escalera, Sergio; Fornés, Alicia; Pujol, Oriol; Lladós, Josep; Radeva, Petia
2011-04-01
In this paper, we propose a circular blurred shape model descriptor to deal with the problem of symbol detection and classification as a particular case of object recognition. The feature extraction is performed by capturing the spatial arrangement of significant object characteristics in a correlogram structure. The shape information from objects is shared among correlogram regions, where a prior blurring degree defines the level of distortion allowed in the symbol, making the descriptor tolerant to irregular deformations. Moreover, the descriptor is rotation invariant by definition. We validate the effectiveness of the proposed descriptor in both the multiclass symbol recognition and symbol detection domains. In order to perform the symbol detection, the descriptors are learned using a cascade of classifiers. In the case of multiclass categorization, the new feature space is learned using a set of binary classifiers which are embedded in an error-correcting output code design. The results over four symbol data sets show the significant improvements of the proposed descriptor compared to the state-of-the-art descriptors. In particular, the results are even more significant in those cases where the symbols suffer from elastic deformations.
Classification and checking model of pedestrian crossing
Luis Delgado Méndez
2012-11-01
After realizing this investigation it can be confirmed that the functionality of a pedestrian crossing depends on almost a hundred parameters which must be checked or measured, in turn proving that this design and construction process is indeed complex.
Performability assessment by model checking of Markov reward models
Baier, Christel; Cloth, L.; Haverkort, Boudewijn R.H.M.; Hermanns, H.; Katoen, Joost P.
2010-01-01
This paper describes efficient procedures for model checking Markov reward models, that allow us to evaluate, among others, the performability of computer-communication systems. We present the logic CSRL (Continuous Stochastic Reward Logic) to specify performability measures. It provides flexibility
Strategic Planning through Model Checking of ATL Formulae
Jamroga, W.J.; Rutkowski, L.; Siekmann, J.; Tadeusiewicz, R.; Zadeh, L.A.
2004-01-01
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns a strategy to achieve given goal. We point out that the algorithm generalizes minimaxing, and that ATL models generalize
Query Language for Location-Based Services: A Model Checking Approach
Hoareau, Christian; Satoh, Ichiro
We present a model checking approach to the rationale, implementation, and applications of a query language for location-based services. Such query mechanisms are necessary so that users, objects, and/or services can effectively benefit from the location-awareness of their surrounding environment. The underlying data model is founded on a symbolic model of space organized in a tree structure. Once extended to a semantic model for modal logic, we regard location query processing as a model checking problem, and thus define location queries as hybrid logicbased formulas. Our approach is unique to existing research because it explores the connection between location models and query processing in ubiquitous computing systems, relies on a sound theoretical basis, and provides modal logic-based query mechanisms for expressive searches over a decentralized data structure. A prototype implementation is also presented and will be discussed.
Efficient probabilistic model checking on general purpose graphic processors
Bosnacki, D.; Edelkamp, S.; Sulewski, D.; Pasareanu, C.S.
2009-01-01
We present algorithms for parallel probabilistic model checking on general purpose graphic processing units (GPGPUs). For this purpose we exploit the fact that some of the basic algorithms for probabilistic model checking rely on matrix vector multiplication. Since this kind of linear algebraic
Dynamic State Space Partitioning for External Memory Model Checking
Evangelista, Sami; Kristensen, Lars Michael
2009-01-01
We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms. The goal of the scheme is to reduce the number of transitions that link states belonging to different...
Partial-Order Reduction for GPU Model Checking
Neele, T.; Wijs, A.; Bosnacki, D.; van de Pol, Jan Cornelis; Artho, C; Legay, A.; Peled, D.
2016-01-01
Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicit-state model checking, we improve memory efficiency by applying partial-order reduction. We propose
Partial-order reduction for GPU model checking
Neele, T.S.; Wijs, A.J.; Bošnački, D.; van de Pol, J.C.
2016-01-01
Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicitstate model checking, we improve memory efficiency by applying partialorder reduction. We propose
Symbolic Processing Combined with Model-Based Reasoning
James, Mark
2009-01-01
A computer program for the detection of present and prediction of future discrete states of a complex, real-time engineering system utilizes a combination of symbolic processing and numerical model-based reasoning. One of the biggest weaknesses of a purely symbolic approach is that it enables prediction of only future discrete states while missing all unmodeled states or leading to incorrect identification of an unmodeled state as a modeled one. A purely numerical approach is based on a combination of statistical methods and mathematical models of the applicable physics and necessitates development of a complete model to the level of fidelity required for prediction. In addition, a purely numerical approach does not afford the ability to qualify its results without some form of symbolic processing. The present software implements numerical algorithms to detect unmodeled events and symbolic algorithms to predict expected behavior, correlate the expected behavior with the unmodeled events, and interpret the results in order to predict future discrete states. The approach embodied in this software differs from that of the BEAM methodology (aspects of which have been discussed in several prior NASA Tech Briefs articles), which provides for prediction of future measurements in the continuous-data domain.
Symbolic modeling of human anatomy for visualization and simulation
Pommert, Andreas; Schubert, Rainer; Riemer, Martin; Schiemann, Thomas; Tiede, Ulf; Hoehne, Karl H.
1994-09-01
Visualization of human anatomy in a 3D atlas requires both spatial and more abstract symbolic knowledge. Within our 'intelligent volume' model which integrates these two levels, we developed and implemented a semantic network model for describing human anatomy. Concepts for structuring (abstraction levels, domains, views, generic and case-specific modeling, inheritance) are introduced. Model, tools for generation and exploration and applications in our 3D anatomical atlas are presented and discussed.
Implementing Model-Check for Employee and Management Satisfaction
Jones, Corey; LaPha, Steven
2013-01-01
This presentation will discuss methods to which ModelCheck can be implemented to not only improve model quality, but also satisfy both employees and management through different sets of quality checks. This approach allows a standard set of modeling practices to be upheld throughout a company, with minimal interaction required by the end user. The presenter will demonstrate how to create multiple ModelCheck standards, preventing users from evading the system, and how it can improve the quality of drawings and models.
Multi-Valued Modal Fixed Point Logics for Model Checking
Nishizawa, Koki
In this paper, I will show how multi-valued logics are used for model checking. Model checking is an automatic technique to analyze correctness of hardware and software systems. A model checker is based on a temporal logic or a modal fixed point logic. That is to say, a system to be checked is formalized as a Kripke model, a property to be satisfied by the system is formalized as a temporal formula or a modal formula, and the model checker checks that the Kripke model satisfies the formula. Although most existing model checkers are based on 2-valued logics, recently new attempts have been made to extend the underlying logics of model checkers to multi-valued logics. I will summarize these new results.
Optimisation of BPMN Business Models via Model Checking
Herbert, Luke Thomas; Sharp, Robin
2013-01-01
We present a framework for the optimisation of business processes modelled in the business process modelling language BPMN, which builds upon earlier work, where we developed a model checking based method for the analysis of BPMN models. We define a structure for expressing optimisation goals...... for synthesized BPMN components, based on probabilistic computation tree logic and real-valued reward structures of the BPMN model, allowing for the specification of complex quantitative goals. We here present a simple algorithm, inspired by concepts from evolutionary algorithms, which iteratively generates...
Formal verification of dynamic hybrid systems: a NuSMV-based model checking approach
Xu Zhi
2018-01-01
Full Text Available Software security is an important and challenging research topic in developing dynamic hybrid embedded software systems. Ensuring the correct behavior of these systems is particularly difficult due to the interactions between the continuous subsystem and the discrete subsystem. Currently available security analysis methods for system risks have been limited, as they rely on manual inspections of the individual subsystems under simplifying assumptions. To improve this situation, a new approach is proposed that is based on the symbolic model checking tool NuSMV. A dual PID system is used as an example system, for which the logical part and the computational part of the system are modeled in a unified manner. Constraints are constructed on the controlled object, and a counter-example path is ultimately generated, indicating that the hybrid system can be analyzed by the model checking tool.
Model checking biological systems described using ambient calculus
Mardare, Radu Iulian; Priami, Corrado; Qualia, Paola
2005-01-01
Model checking biological systems described using ambient calculus. In Proc. of the second International Workshop on Computational Methods in Systems Biology (CMSB04), Lecture Notes in Bioinformatics 3082:85-103, Springer, 2005.......Model checking biological systems described using ambient calculus. In Proc. of the second International Workshop on Computational Methods in Systems Biology (CMSB04), Lecture Notes in Bioinformatics 3082:85-103, Springer, 2005....
Towards Model Checking Stochastic Process Algebra
Hermanns, H.; Grieskamp, W.; Santen, T.; Katoen, Joost P.; Stoddart, B.; Meyer-Kayser, J.; Siegle, M.
2000-01-01
Stochastic process algebras have been proven useful because they allow behaviour-oriented performance and reliability modelling. As opposed to traditional performance modelling techniques, the behaviour- oriented style supports composition and abstraction in a natural way. However, analysis of
Bringing LTL Model Checking to Biologists
Ahmed, Z; Benque, D; Berezin, S; Dahl, ACE; Fisher, Jasmin; Hall, Benjamin Andrew; Ishtiaq, S; Nanavati, J; Piterman, N; Riechert, M; Skoblov, N
2017-01-01
The BioModelAnalyzer (BMA) is a web based tool for the development of discrete models of biological systems. Through a graphical user interface, it allows rapid development of complex models of gene and protein interaction networks and stability analysis without requiring users to be proficient computer programmers. Whilst stability is a useful specification for testing many systems, testing temporal specifications in BMA presently requires the user to perform simulations. Here we describe th...
Workflow Fault Tree Generation Through Model Checking
Herbert, Luke Thomas; Sharp, Robin
2014-01-01
We present a framework for the automated generation of fault trees from models of realworld process workflows, expressed in a formalised subset of the popular Business Process Modelling and Notation (BPMN) language. To capture uncertainty and unreliability in workflows, we extend this formalism...
Learning Markov Decision Processes for Model Checking
Mao, Hua; Chen, Yingke; Jaeger, Manfred
2012-01-01
. The proposed learning algorithm is adapted from algorithms for learning deterministic probabilistic finite automata, and extended to include both probabilistic and nondeterministic transitions. The algorithm is empirically analyzed and evaluated by learning system models of slot machines. The evaluation......Constructing an accurate system model for formal model verification can be both resource demanding and time-consuming. To alleviate this shortcoming, algorithms have been proposed for automatically learning system models based on observed system behaviors. In this paper we extend the algorithm...... on learning probabilistic automata to reactive systems, where the observed system behavior is in the form of alternating sequences of inputs and outputs. We propose an algorithm for automatically learning a deterministic labeled Markov decision process model from the observed behavior of a reactive system...
Memoised Garbage Collection for Software Model Checking
Nguyen, V.Y.; Ruys, T.C.; Kowalewski, S.; Philippou, A.
Virtual machine based software model checkers like JPF and MoonWalker spend up to half of their veri��?cation time on garbage collection. This is no surprise as after nearly each transition the heap has to be cleaned from garbage. To improve this, this paper presents the Memoised Garbage Collection
Statistical Model Checking for Product Lines
ter Beek, Maurice H.; Legay, Axel; Lluch Lafuente, Alberto
2016-01-01
average cost of products (in terms of the attributes of the products’ features) and the probability of features to be (un)installed at runtime. The product lines must be modelled in QFLan, which extends the probabilistic feature-oriented language PFLan with novel quantitative constraints among features...
Model checking meets probability: a gentle introduction
Katoen, Joost P.
2013-01-01
This paper considers fully probabilistic system models. Each transition is quantified with a probability—its likelihood of occurrence. Properties are expressed as automata that either accept or reject system runs. The central question is to determine the fraction of accepted system runs. We also
[Understanding King's model on the paradigm of symbolic interactionism].
Araújo, Iliana Maria de Almeida; Oliveira, Marcos Venícios; de Oliveira, Marcos Venícius; Fernandes, Ana Fátima Carvalho
2005-01-01
It was aimed to reflect on King's Theory, according to the approach of Symbolic Interaccionism, and theory analyses model of Meleis. To reach the objective, we proceeded the reading of the three models as mentioned before, looking for the consistencies and discrepancies among the concepts and correlating them. The study allowed to conclude that the theories agree when elucidating the man as a being that reacts and search to understand the meaning of things to his/her circuit, drifting and judging their actions and the one of the other ones. It is important the subject of the meanings could be modified and they generate the elaboration of goals in common.
Model Checking of a Diabetes-Cancer Model
Gong, Haijun; Zuliani, Paolo; Clarke, Edmund M.
2011-06-01
Accumulating evidence suggests that cancer incidence might be associated with diabetes mellitus, especially Type II diabetes which is characterized by hyperinsulinaemia, hyperglycaemia, obesity, and overexpression of multiple WNT pathway components. These diabetes risk factors can activate a number of signaling pathways that are important in the development of different cancers. To systematically understand the signaling components that link diabetes and cancer risk, we have constructed a single-cell, Boolean network model by integrating the signaling pathways that are influenced by these risk factors to study insulin resistance, cancer cell proliferation and apoptosis. Then, we introduce and apply the Symbolic Model Verifier (SMV), a formal verification tool, to qualitatively study some temporal logic properties of our diabetes-cancer model. The verification results show that the diabetes risk factors might not increase cancer risk in normal cells, but they will promote cell proliferation if the cell is in a precancerous or cancerous stage characterized by losses of the tumor-suppressor proteins ARF and INK4a.
Model Checking Temporal Logic Formulas Using Sticker Automata
Feng, Changwei; Wu, Huanmei
2017-01-01
As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of approaches for DNA model checking. To address this challenge, a model checking method is proposed for checking the basic formulas in the above three temporal logic types with DNA molecules. First, one-type single-stranded DNA molecules are employed to encode the Finite State Automaton (FSA) model of the given basic formula so that a sticker automaton is obtained. On the other hand, other single-stranded DNA molecules are employed to encode the given system model so that the input strings of the sticker automaton are obtained. Next, a series of biochemical reactions are conducted between the above two types of single-stranded DNA molecules. It can then be decided whether the system satisfies the formula or not. As a result, we have developed a DNA-based approach for checking all the basic formulas of CTL, ITL, and PTL. The simulated results demonstrate the effectiveness of the new method. PMID:29119114
CheckMATE 2: From the model to the limit
Dercks, Daniel; Desai, Nishita; Kim, Jong Soo; Rolbiecki, Krzysztof; Tattersall, Jamie; Weber, Torsten
2017-12-01
We present the latest developments to the CheckMATE program that allows models of new physics to be easily tested against the recent LHC data. To achieve this goal, the core of CheckMATE now contains over 60 LHC analyses of which 12 are from the 13 TeV run. The main new feature is that CheckMATE 2 now integrates the Monte Carlo event generation via MadGraph5_aMC@NLO and Pythia 8. This allows users to go directly from a SLHA file or UFO model to the result of whether a model is allowed or not. In addition, the integration of the event generation leads to a significant increase in the speed of the program. Many other improvements have also been made, including the possibility to now combine signal regions to give a total likelihood for a model.
Schedulability of Herschel revisited using statistical model checking
David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel
2015-01-01
-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter...... and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability...... analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques...
modelling of queuing process at airport check-in system
HOD
Key words: Airport check-in system, discrete time events, analytical models, simulation model, SimEvents toolbox. 1. ..... [6] Gross, D. and Harris, C. M. Fundamentals of. Queueing ... [11] Manataki I. E. and Zogra os K. G. “A Generic. System ...
Bayesian inference with information content model check for Langevin equations
Krog, Jens F. C.; Lomholt, Michael Andersen
2017-01-01
The Bayesian data analysis framework has been proven to be a systematic and effective method of parameter inference and model selection for stochastic processes. In this work we introduce an information content model check which may serve as a goodness-of-fit, like the chi-square procedure...
Towards Model Checking a Spi-Calculus Dialect
Gnesi, S.; Latella, D.; Lenzini, Gabriele
We present a model checking framework for a spi-calculus dialect which uses a linear time temporal logic for expressing security properties. We have provided our spi-calculus dialect, called SPID, with a semantics based on labeled transition systems (LTS), where the intruder is modeled in the
Model checking: one can do much more than you think!
Katoen, Joost P.
2012-01-01
Model checking is an automated verification technique that actively is applied to find bugs in hardware and software designs. Companies like IBM and Cadence developed their in-house model checkers, and acted as driving forces behind the design of the IEEE-standardized temporal logic PSL. On the
Recent advances in importance sampling for statistical model checking
Reijsbergen, D.P.; de Boer, Pieter-Tjerk; Scheinhardt, Willem R.W.; Haverkort, Boudewijn R.H.M.
2013-01-01
In the following work we present an overview of recent advances in rare event simulation for model checking made at the University of Twente. The overview is divided into the several model classes for which we propose algorithms, namely multicomponent systems, Markov chains and stochastic Petri
A voice-actuated wind tunnel model leak checking system
Larson, William E.
1989-01-01
A computer program has been developed that improves the efficiency of wind tunnel model leak checking. The program uses a voice recognition unit to relay a technician's commands to the computer. The computer, after receiving a command, can respond to the technician via a voice response unit. Information about the model pressure orifice being checked is displayed on a gas-plasma terminal. On command, the program records up to 30 seconds of pressure data. After the recording is complete, the raw data and a straight line fit of the data are plotted on the terminal. This allows the technician to make a decision on the integrity of the orifice being checked. All results of the leak check program are stored in a database file that can be listed on the line printer for record keeping purposes or displayed on the terminal to help the technician find unchecked orifices. This program allows one technician to check a model for leaks instead of the two or three previously required.
Symbolic PathFinder: Symbolic Execution of Java Bytecode
Pasareanu, Corina S.; Rungta, Neha
2010-01-01
Symbolic Pathfinder (SPF) combines symbolic execution with model checking and constraint solving for automated test case generation and error detection in Java programs with unspecified inputs. In this tool, programs are executed on symbolic inputs representing multiple concrete inputs. Values of variables are represented as constraints generated from the analysis of Java bytecode. The constraints are solved using off-the shelf solvers to generate test inputs guaranteed to achieve complex coverage criteria. SPF has been used successfully at NASA, in academia, and in industry.
Consistency checks in beam emission modeling for neutral beam injectors
Punyapu, Bharathi; Vattipalle, Prahlad; Sharma, Sanjeev Kumar; Baruah, Ujjwal Kumar; Crowley, Brendan
2015-01-01
In positive neutral beam systems, the beam parameters such as ion species fractions, power fractions and beam divergence are routinely measured using Doppler shifted beam emission spectrum. The accuracy with which these parameters are estimated depend on the accuracy of the atomic modeling involved in these estimations. In this work, an effective procedure to check the consistency of the beam emission modeling in neutral beam injectors is proposed. As a first consistency check, at a constant beam voltage and current, the intensity of the beam emission spectrum is measured by varying the pressure in the neutralizer. Then, the scaling of measured intensity of un-shifted (target) and Doppler shifted intensities (projectile) of the beam emission spectrum at these pressure values are studied. If the un-shifted component scales with pressure, then the intensity of this component will be used as a second consistency check on the beam emission modeling. As a further check, the modeled beam fractions and emission cross sections of projectile and target are used to predict the intensity of the un-shifted component and then compared with the value of measured target intensity. An agreement between the predicted and measured target intensities provide the degree of discrepancy in the beam emission modeling. In order to test this methodology, a systematic analysis of Doppler shift spectroscopy data obtained on the JET neutral beam test stand data was carried out
Application of Model-Checking Technology to Controller Synthesis
David, Alexandre; Grunnet, Jacob Deleuran; Jessen, Jan Jacob
2011-01-01
In this paper we present two frameworks that have been implemented to link traditional model-checking techniques to the domain of control. The techniques are based on solving a timed game and using the resulting solution (a strategy) as a controller. The obtained discrete controller must fit with...
Model checking conditional CSL for continuous-time Markov chains
Gao, Yang; Xu, Ming; Zhan, Naijun
2013-01-01
In this paper, we consider the model-checking problem of continuous-time Markov chains (CTMCs) with respect to conditional logic. To the end, we extend Continuous Stochastic Logic introduced in Aziz et al. (2000) [1] to Conditional Continuous Stochastic Logic (CCSL) by introducing a conditional...
State Space Reduction for Model Checking Agent Programs
S.-S.T.Q. Jongmans (Sung-Shik); K.V. Hindriks; M.B. van Riemsdijk; L. Dennis; O. Boissier; R.H. Bordini (Rafael)
2012-01-01
htmlabstractState space reduction techniques have been developed to increase the efficiency of model checking in the context of imperative programming languages. Unfortunately, these techniques cannot straightforwardly be applied to agents: the nature of states in the two programming paradigms
Verifying large SDL-specifications using model checking
Sidorova, N.; Steffen, M.; Reed, R.; Reed, J.
2001-01-01
In this paper we propose a methodology for model-checking based verification of large SDL specifications. The methodology is illustrated by a case study of an industrial medium-access protocol for wireless ATM. To cope with the state space explosion, the verification exploits the layered and modular
Efficient family-based model checking via variability abstractions
Dimovski, Aleksandar; Al-Sibahi, Ahmad Salim; Brabrand, Claus
2016-01-01
with the abstract model checking of the concrete high-level variational model. This allows the use of Spin with all its accumulated optimizations for efficient verification of variational models without any knowledge about variability. We have implemented the transformations in a prototype tool, and we illustrate......Many software systems are variational: they can be configured to meet diverse sets of requirements. They can produce a (potentially huge) number of related systems, known as products or variants, by systematically reusing common parts. For variational models (variational systems or families...... of related systems), specialized family-based model checking algorithms allow efficient verification of multiple variants, simultaneously, in a single run. These algorithms, implemented in a tool Snip, scale much better than ``the brute force'' approach, where all individual systems are verified using...
Mixed Portmanteau Test for Diagnostic Checking of Time Series Models
Sohail Chand
2014-01-01
Full Text Available Model criticism is an important stage of model building and thus goodness of fit tests provides a set of tools for diagnostic checking of the fitted model. Several tests are suggested in literature for diagnostic checking. These tests use autocorrelation or partial autocorrelation in the residuals to criticize the adequacy of fitted model. The main idea underlying these portmanteau tests is to identify if there is any dependence structure which is yet unexplained by the fitted model. In this paper, we suggest mixed portmanteau tests based on autocorrelation and partial autocorrelation functions of the residuals. We derived the asymptotic distribution of the mixture test and studied its size and power using Monte Carlo simulations.
An efficient symbolic model checker | Ferdenache | Synthèse: Revue ...
The main of this paper is to design and implement a powerful new tool to check important properties in critical systems based on the concept of symbolic state and DBM data structures (Difference Bound Matrices). The specifications are expressed using timed automata system and realtime logic for properties. The obtained ...
Un vérificateur symbolique efficace An efficient symbolic model ...
The main of this paper is to design and implement a powerful new tool to check important properties in critical systems based on the concept of symbolic state and DBM data structures (Difference Bound Matrices). The specifications are expressed using timed automata system and real- time logic for properties. The obtained ...
Logic Model Checking of Unintended Acceleration Claims in Toyota Vehicles
Gamble, Ed
2012-01-01
Part of the US Department of Transportation investigation of Toyota sudden unintended acceleration (SUA) involved analysis of the throttle control software, JPL Laboratory for Reliable Software applied several techniques including static analysis and logic model checking, to the software; A handful of logic models were build, Some weaknesses were identified; however, no cause for SUA was found; The full NASA report includes numerous other analyses
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Diaz, Ricardo Graciani; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-01-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple, the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike con...
Frølunde, Lisbeth
2008-01-01
an analytic working model called Animated Symbols concerning critical reflection in a dialogic learning process. The model shows dialogue as interactions that involve two types of transformation: inner ‘learning processes' and outer signs and symbols. The classroom-based research study is part of a Ph...
Meta-Modeling by Symbolic Regression and Pareto Simulated Annealing
Stinstra, E.; Rennen, G.; Teeuwen, G.J.A.
2006-01-01
The subject of this paper is a new approach to Symbolic Regression.Other publications on Symbolic Regression use Genetic Programming.This paper describes an alternative method based on Pareto Simulated Annealing.Our method is based on linear regression for the estimation of constants.Interval
Using Stochastic Model Checking to Provision Complex Business Services
Herbert, Luke Thomas; Sharp, Robin
2012-01-01
bounds on resources consumed during execution of business processes. Accurate resource provisioning is often central to ensuring the safe execution of a process. We first introduce a formalised core subset of the Business Process Modelling and Notation (BPMN), which we extend with probabilistic and non......-deterministic branching and reward annotations. We then develop an algorithm for the efficient translation of these models into the guarded command language used by the model checker PRISM, in turn enabling model checking of BPMN processes and allowing for the calculation of a wide range of quantitative properties...
Model Checking Processes Specified In Join-Calculus Algebra
Sławomir Piotr Maludziński
2014-01-01
Full Text Available This article presents a model checking tool used to verify concurrent systems specified in join-calculus algebra. The temporal properties of systems under verification are expressed in CTL logic. Join-calculus algebra with its operational semantics defined by the chemical abstract machine serves as the basic method for the specification of concurrent systems and their synchronization mechanisms, and allows the examination of more complex systems.
Introduction of Virtualization Technology to Multi-Process Model Checking
Leungwattanakit, Watcharin; Artho, Cyrille; Hagiya, Masami; Tanabe, Yoshinori; Yamamoto, Mitsuharu
2009-01-01
Model checkers find failures in software by exploring every possible execution schedule. Java PathFinder (JPF), a Java model checker, has been extended recently to cover networked applications by caching data transferred in a communication channel. A target process is executed by JPF, whereas its peer process runs on a regular virtual machine outside. However, non-deterministic target programs may produce different output data in each schedule, causing the cache to restart the peer process to handle the different set of data. Virtualization tools could help us restore previous states of peers, eliminating peer restart. This paper proposes the application of virtualization technology to networked model checking, concentrating on JPF.
Using Model Checking for Analyzing Distributed Power Control Problems
Brihaye, Thomas; Jungers, Marc; Lasaulce, Samson
2010-01-01
Model checking (MC) is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control ( PC) problem can be modeled by a timed game between a given transmitter and its environment, the authors...... objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired...
From Transition Systems to Variability Models and from Lifted Model Checking Back to UPPAAL
Dimovski, Aleksandar; Wasowski, Andrzej
2017-01-01
efficient lifted (family-based) model checking for real-time variability models. This reduces the cost of maintaining specialized family-based real-time model checkers. Real-time variability models can be model checked using the standard UPPAAL. We have implemented abstractions as syntactic source...
Model-checking techniques based on cumulative residuals.
Lin, D Y; Wei, L J; Ying, Z
2002-03-01
Residuals have long been used for graphical and numerical examinations of the adequacy of regression models. Conventional residual analysis based on the plots of raw residuals or their smoothed curves is highly subjective, whereas most numerical goodness-of-fit tests provide little information about the nature of model misspecification. In this paper, we develop objective and informative model-checking techniques by taking the cumulative sums of residuals over certain coordinates (e.g., covariates or fitted values) or by considering some related aggregates of residuals, such as moving sums and moving averages. For a variety of statistical models and data structures, including generalized linear models with independent or dependent observations, the distributions of these stochastic processes tinder the assumed model can be approximated by the distributions of certain zero-mean Gaussian processes whose realizations can be easily generated by computer simulation. Each observed process can then be compared, both graphically and numerically, with a number of realizations from the Gaussian process. Such comparisons enable one to assess objectively whether a trend seen in a residual plot reflects model misspecification or natural variation. The proposed techniques are particularly useful in checking the functional form of a covariate and the link function. Illustrations with several medical studies are provided.
Optimizing ZigBee Security using Stochastic Model Checking
Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming
, we identify an important gap in the specification on key updates, and present a methodology for determining optimal key update policies and security parameters. We exploit the stochastic model checking approach using the probabilistic model checker PRISM, and assess the security needs for realistic......ZigBee is a fairly new but promising wireless sensor network standard that offers the advantages of simple and low resource communication. Nevertheless, security is of great concern to ZigBee, and enhancements are prescribed in the latest ZigBee specication: ZigBee-2007. In this technical report...
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
Bulychev, Petr; David, Alexandre; Larsen, Kim Guldstrand
2012-01-01
on a series of extensions of the statistical model checking approach generalized to handle real-time systems and estimate undecidable problems. U PPAAL - SMC comes together with a friendly user interface that allows a user to specify complex problems in an efficient manner as well as to get feedback...... in the form of probability distributions and compare probabilities to analyze performance aspects of systems. The focus of the survey is on the evolution of the tool – including modeling and specification formalisms as well as techniques applied – together with applications of the tool to case studies....
Applying Model Checking to Industrial-Sized PLC Programs
AUTHOR|(CDS)2079190; Darvas, Daniel; Blanco Vinuela, Enrique; Tournier, Jean-Charles; Bliudze, Simon; Blech, Jan Olaf; Gonzalez Suarez, Victor M
2015-01-01
Programmable logic controllers (PLCs) are embedded computers widely used in industrial control systems. Ensuring that a PLC software complies with its specification is a challenging task. Formal verification has become a recommended practice to ensure the correctness of safety-critical software but is still underused in industry due to the complexity of building and managing formal models of real applications. In this paper, we propose a general methodology to perform automated model checking of complex properties expressed in temporal logics (\\eg CTL, LTL) on PLC programs. This methodology is based on an intermediate model (IM), meant to transform PLC programs written in various standard languages (ST, SFC, etc.) to different modeling languages of verification tools. We present the syntax and semantics of the IM and the transformation rules of the ST and SFC languages to the nuXmv model checker passing through the intermediate model. Finally, two real cases studies of \\CERN PLC programs, written mainly in th...
Efficient Parallel Statistical Model Checking of Biochemical Networks
Paolo Ballarini
2009-12-01
Full Text Available We consider the problem of verifying stochastic models of biochemical networks against behavioral properties expressed in temporal logic terms. Exact probabilistic verification approaches such as, for example, CSL/PCTL model checking, are undermined by a huge computational demand which rule them out for most real case studies. Less demanding approaches, such as statistical model checking, estimate the likelihood that a property is satisfied by sampling executions out of the stochastic model. We propose a methodology for efficiently estimating the likelihood that a LTL property P holds of a stochastic model of a biochemical network. As with other statistical verification techniques, the methodology we propose uses a stochastic simulation algorithm for generating execution samples, however there are three key aspects that improve the efficiency: first, the sample generation is driven by on-the-fly verification of P which results in optimal overall simulation time. Second, the confidence interval estimation for the probability of P to hold is based on an efficient variant of the Wilson method which ensures a faster convergence. Third, the whole methodology is designed according to a parallel fashion and a prototype software tool has been implemented that performs the sampling/verification process in parallel over an HPC architecture.
SoS contract verification using statistical model checking
Alessandro Mignogna
2013-11-01
Full Text Available Exhaustive formal verification for systems of systems (SoS is impractical and cannot be applied on a large scale. In this paper we propose to use statistical model checking for efficient verification of SoS. We address three relevant aspects for systems of systems: 1 the model of the SoS, which includes stochastic aspects; 2 the formalization of the SoS requirements in the form of contracts; 3 the tool-chain to support statistical model checking for SoS. We adapt the SMC technique for application to heterogeneous SoS. We extend the UPDM/SysML specification language to express the SoS requirements that the implemented strategies over the SoS must satisfy. The requirements are specified with a new contract language specifically designed for SoS, targeting a high-level English- pattern language, but relying on an accurate semantics given by the standard temporal logics. The contracts are verified against the UPDM/SysML specification using the Statistical Model Checker (SMC PLASMA combined with the simulation engine DESYRE, which integrates heterogeneous behavioral models through the functional mock-up interface (FMI standard. The tool-chain allows computing an estimation of the satisfiability of the contracts by the SoS. The results help the system architect to trade-off different solutions to guide the evolution of the SoS.
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Basu, Samik; Ghosh, Arka P.; He, Ru
We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate methods have been proposed primarily to deal with state-space explosion that makes the exact model checking by numerical methods practically infeasible for large systems. However, the existing statistical methods either consider a restricted subset of PCTL, specifically, the subset that can only express bounded until properties; or rely on user-specified finite bound on the sample path length. We propose a new method that does not have such restrictions and can be effectively used to reason about unbounded until properties. We approximate probabilistic characteristics of an unbounded until property by that of a bounded until property for a suitably chosen value of the bound. In essence, our method is a two-phase process: (a) the first phase is concerned with identifying the bound k 0; (b) the second phase computes the probability of satisfying the k 0-bounded until property as an estimate for the probability of satisfying the corresponding unbounded until property. In both phases, it is sufficient to verify bounded until properties which can be effectively done using existing statistical techniques. We prove the correctness of our technique and present its prototype implementations. We empirically show the practical applicability of our method by considering different case studies including a simple infinite-state model, and large finite-state models such as IPv4 zeroconf protocol and dining philosopher protocol modeled as Discrete Time Markov chains.
Model checking coalitional games in shortage resource scenarios
Dario Della Monica
2013-07-01
Full Text Available Verification of multi-agents systems (MAS has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL, whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula to a semantic one (part of the model. This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions.
Conformity checking of LPG Transportation Trucks by Modelling and Simulation
Gallab Maryam
2017-01-01
Full Text Available LPG Loading /unloading site is considered as a dangerous environment of significant risk, especially during LPG transfer operations. These risks may cause catastrophic dangers such as BLEVE (Boiling Liquid Expanding Vapour Explosion, UVCE (Unconfined Vapour Cloud Explosion, etc. The site consists of a tank (RST containing LPG and threetransfer posts. Two posts allow loading of small carrier tankers 6 tons. The other one transfer post transfer LPG contained injumbo tankers 20 tons inside the tank. The industrial site at risks chooses to demonstrate the need for a modelling-simulation approach. The aim is to check first compliance and authorization of the truck when it enters the site for loading /unloading, to verify the authorization to make the transfer, and then, to identify the driver and his training to ensure that the transfer operations are going to take place without incident. Sometimes, it may happen that Consignment Operator (CO is busy orabsent and thus the driver operates alone without being authorized, in this case the site risks a loss of control due to a lack of resources. The modelling-simulation will be done using multi-agent systems that will present the drivers, trucks, PO and loading unloading posts as agents in order to have a model facilitating this checking.
Model-checking dense-time Duration Calculus
Fränzle, Martin
2004-01-01
Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of dense-time Duration Calculus [Zhou, Hansen, Sestoft, 1993] it is well-known that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary...... of this logic. While this was formerly taken as an indication that key-press verification of implementations with respect to elaborate Duration Calculus specifications were also impossible, we show that the model property is well decidable for realistic designs which feature natural constraints...... suitably sparser model classes we obtain model-checking procedures for rich subsets of Duration Calculus. Together with undecidability results also obtained, this sheds light upon the exact borderline between decidability and undecidability of Duration Calculi and related logics....
Using Model Checking for Analyzing Distributed Power Control Problems
Thomas Brihaye
2010-01-01
Full Text Available Model checking (MC is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control (PC problem can be modeled by a timed game between a given transmitter and its environment, the authors wanted to know whether this approach can be applied to distributed PC. It turns out that it can be applied successfully and allows one to analyze realistic scenarios including the case of discrete transmit powers and games with incomplete information. The proposed methodology is as follows. We state some objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired properties are verified and determine a winning strategy.
Methods to model-check parallel systems software
Matlin, O. S.; McCune, W.; Lusk, E.
2003-01-01
We report on an effort to develop methodologies for formal verification of parts of the Multi-Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of communicating processes. While the individual components of the collection execute simple algorithms, their interaction leads to unexpected errors that are difficult to uncover by conventional means. Two verification approaches are discussed here: the standard model checking approach using the software model checker SPIN and the nonstandard use of a general-purpose first-order resolution-style theorem prover OTTER to conduct the traditional state space exploration. We compare modeling methodology and analyze performance and scalability of the two methods with respect to verification of MPD
Model checking as an aid to procedure design
Zhang, Wenhu
2001-01-01
The OECD Halden Reactor Project has been actively working on computer assisted operating procedures for many years. The objective of the research has been to provide computerised assistance for procedure design, verification and validation, implementation and maintenance. For the verification purpose, the application of formal methods has been considered in several reports. The recent formal verification activity conducted at the Halden Project is based on using model checking to the verification of procedures. This report presents verification approaches based on different model checking techniques and tools for the formalization and verification of operating procedures. Possible problems and relative merits of the different approaches are discussed. A case study of one of the approaches is presented to show the practical application of formal verification. Application of formal verification in the traditional procedure design process can reduce the human resources involved in reviews and simulations, and hence reduce the cost of verification and validation. A discussion of the integration of the formal verification with the traditional procedure design process is given at the end of this report. (Author)
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Templon, Jeff; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof; Diaz, Ricardo Graciani
2012-01-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple; the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike conventional testing, it allows full control over the parallel processes execution, and supports exhaustive state-space exploration. We used the mCRL2 language and toolset to model the behavior of two related DIRAC subsystems: the workload and storage management system. Based on process algebra, mCRL2 allows defining custom data types as well as functions over these. This makes it suitable for modeling the data manipulations made by DIRAC's agents. By visualizing the state space and replaying scenarios with the toolkit's simulator, we have detected race-conditions and deadlocks in these systems, which, in several cases, were confirmed to occur in the reality. Several properties of interest were formulated and verified with the tool. Our future direction is automating the translation from DIRAC to a formal model.
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Templon, Jeff; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Graciani Diaz, Ricardo; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-12-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple; the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike conventional testing, it allows full control over the parallel processes execution, and supports exhaustive state-space exploration. We used the mCRL2 language and toolset to model the behavior of two related DIRAC subsystems: the workload and storage management system. Based on process algebra, mCRL2 allows defining custom data types as well as functions over these. This makes it suitable for modeling the data manipulations made by DIRAC's agents. By visualizing the state space and replaying scenarios with the toolkit's simulator, we have detected race-conditions and deadlocks in these systems, which, in several cases, were confirmed to occur in the reality. Several properties of interest were formulated and verified with the tool. Our future direction is automating the translation from DIRAC to a formal model.
Model Checking A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs
Malekpour, Mahyar R.
2012-01-01
This report presents the mechanical verification of a self-stabilizing distributed clock synchronization protocol for arbitrary digraphs in the absence of faults. This protocol does not rely on assumptions about the initial state of the system, other than the presence of at least one node, and no central clock or a centrally generated signal, pulse, or message is used. The system under study is an arbitrary, non-partitioned digraph ranging from fully connected to 1-connected networks of nodes while allowing for differences in the network elements. Nodes are anonymous, i.e., they do not have unique identities. There is no theoretical limit on the maximum number of participating nodes. The only constraint on the behavior of the node is that the interactions with other nodes are restricted to defined links and interfaces. This protocol deterministically converges within a time bound that is a linear function of the self-stabilization period. A bounded model of the protocol is verified using the Symbolic Model Verifier (SMV) for a subset of digraphs. Modeling challenges of the protocol and the system are addressed. The model checking effort is focused on verifying correctness of the bounded model of the protocol as well as confirmation of claims of determinism and linear convergence with respect to the self-stabilization period.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
Transformation of UML Behavioral Diagrams to Support Software Model Checking
Luciana Brasil Rebelo dos Santos
2014-04-01
Full Text Available Unified Modeling Language (UML is currently accepted as the standard for modeling (object-oriented software, and its use is increasing in the aerospace industry. Verification and Validation of complex software developed according to UML is not trivial due to complexity of the software itself, and the several different UML models/diagrams that can be used to model behavior and structure of the software. This paper presents an approach to transform up to three different UML behavioral diagrams (sequence, behavioral state machines, and activity into a single Transition System to support Model Checking of software developed in accordance with UML. In our approach, properties are formalized based on use case descriptions. The transformation is done for the NuSMV model checker, but we see the possibility in using other model checkers, such as SPIN. The main contribution of our work is the transformation of a non-formal language (UML to a formal language (language of the NuSMV model checker towards a greater adoption in practice of formal methods in software development.
Take the Reins on Model Quality with ModelCHECK and Gatekeeper
Jones, Corey
2012-01-01
Model quality and consistency has been an issue for us due to the diverse experience level and imaginative modeling techniques of our users. Fortunately, setting up ModelCHECK and Gatekeeper to enforce our best practices has helped greatly, but it wasn't easy. There were many challenges associated with setting up ModelCHECK and Gatekeeper including: limited documentation, restrictions within ModelCHECK, and resistance from end users. However, we consider ours a success story. In this presentation we will describe how we overcame these obstacles and present some of the details of how we configured them to work for us.
The analysis of actual and symbolic models of secondary school students in Serbia
Stepanović Ivana
2009-01-01
Full Text Available This paper deals with role models of secondary school students in Serbia. In the course of adolescence, there is a gradual separation from parental figures, and other persons become role models for behavior. For that reason, secondary school population is of interest when analyzing this phenomenon, particularly bearing in mind that role models influence not only social, but also other aspects of development. We analyzed role models from students' personal (actual models and public life (symbolic models. The main aim was to determine who their actual and symbolic models are, and why secondary school students look up to them. Based on the data on secondary school students' actual models, it is possible to identify who important persons from their milieu are and why they are important to them. The data about the categories in which symbolic models can be divided, as well as about their occurrence, indicate the young people's system of values in these analyses. The sample comprises 2426 students from 26 schools in 9 Serbian towns. Actual and symbolic models were examined in separate questions, where students were asked to name up to three people from their private life or the world of celebrities that they look up to. 53,9% of students named their actual models, the most common being their mothers. Nearly half the examinees (49,3% stated their symbolic models are public figures. Most symbolic models are from the world of show-business. The results show that parental figures remain the models of behavior throughout adolescence. The data about the categories of symbolic models show the young are drawn to the world of entertainment and indicate a weak role of schools as a potential source of models in the fields of science and culture who would promote cognitive values.
Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking
Clarke, Edmund; Kroening, Daniel; Yorav, Karen
2003-01-01
.... We describe experimental results on various reactive present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking...
Simple nonparametric checks for model data fit in CAT
Meijer, R.R.
2005-01-01
In this paper, the usefulness of several nonparametric checks is discussed in a computerized adaptive testing (CAT) context. Although there is no tradition of nonparametric scalability in CAT, it can be argued that scalability checks can be useful to investigate, for example, the quality of item
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
2012-01-01
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In thi...
Creating Büchi automata for multi-valued model checking
Vijzelaar, Stefan J.J.; Fokkink, Wan J.
2017-01-01
In explicit state model checking of linear temporal logic properties, a Büchi automaton encodes a temporal property. It interleaves with a Kripke model to form a state space, which is searched for counterexamples. Multi-valued model checking considers additional truth values beyond the Boolean true
A Prototype Symbolic Model of Canonical Functional Neuroanatomy of the Motor System
Rubin, Daniel L.; Halle, Michael; Musen, Mark; Kikinis, Ron
2008-01-01
Recent advances in bioinformatics have opened entire new avenues for organizing, integrating and retrieving neuroscientific data, in a digital, machine-processable format, which can be at the same time understood by humans, using ontological, symbolic data representations. Declarative information stored in ontological format can be perused and maintained by domain experts, interpreted by machines, and serve as basis for a multitude of decision-support, computerized simulation, data mining, and teaching applications. We have developed a prototype symbolic model of canonical neuroanatomy of the motor system. Our symbolic model is intended to support symbolic lookup, logical inference and mathematical modeling by integrating descriptive, qualitative and quantitative functional neuroanatomical knowledge. Furthermore, we show how our approach can be extended to modeling impaired brain connectivity in disease states, such as common movement disorders. In developing our ontology, we adopted a disciplined modeling approach, relying on a set of declared principles, a high-level schema, Aristotelian definitions, and a frame-based authoring system. These features, along with the use of the Unified Medical Language System (UMLS) vocabulary, enable the alignment of our functional ontology with an existing comprehensive ontology of human anatomy, and thus allow for combining the structural and functional views of neuroanatomy for clinical decision support and neuroanatomy teaching applications. Although the scope of our current prototype ontology is limited to a particular functional system in the brain, it may be possible to adapt this approach for modeling other brain functional systems as well. PMID:18164666
ter Beek, Maurice H.; Legay, Axel; Lluch Lafuente, Alberto
2015-01-01
We investigate the suitability of statistical model checking techniques for analysing quantitative properties of software product line models with probabilistic aspects. For this purpose, we enrich the feature-oriented language FLAN with action rates, which specify the likelihood of exhibiting pa...
WCET Analysis of ARM Processors using Real-Time Model Checking
Toft, Martin; Olesen, Mads Christian; Dalsgaard, Andreas
2009-01-01
This paper presents a flexible method that utilises real-time model checking to determine safe and sharp WCETs for processes running on hardware platforms featuring pipelining and caching.......This paper presents a flexible method that utilises real-time model checking to determine safe and sharp WCETs for processes running on hardware platforms featuring pipelining and caching....
Busch, Fredric N
2017-01-01
In psychoanalytic theory, the importance of actual neuroses-considered to be devoid of psychic content-diminished as Freud and subsequent analysts focused on unconscious intrapsychic conflict. This paper explores the relationship between actual neurotic and unrepresented states, which are believed to be best addressed through attention to countertransference, intersubjectivity, and enactments rather than interpretation of intrapsychic conflict. Models suggesting how actual neurotic states and symbolized intrapsychic conflict may interact with each other and environmental stressors are described. Symbolizing actual neurotic states and establishing meaningful linkages between somatic/affective experiences and intrapsychic conflict are viewed as necessary for effective treatment of many disorders. © 2017 The Psychoanalytic Quarterly, Inc.
PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool
AlTurki, Musab
2011-01-01
Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability of statistical model checking, and making such scalability of analysis available to tools like Maude, where probabilistic systems can be specified at a high level as probabilistic rewrite theories. It presents PVeStA, an extension and parallelization of the VeStA statistical model checking tool [10]. PVeStA supports statistical model checking of probabilistic real-time systems specified as either: (i) discrete or continuous Markov Chains; or (ii) probabilistic rewrite theories in Maude. Furthermore, the properties that it can model check can be expressed in either: (i) PCTL/CSL, or (ii) the QuaTEx quantitative temporal logic. As our experiments show, the performance gains obtained from parallelization can be very high. © 2011 Springer-Verlag.
Symbolic and Numerical Modeling of Nonlinear Dynamics of Particles in Accelerators
Andrianov, Sergey; Sboeva, Ekaterina
2018-02-01
This paper is devoted to one of the methods of symbolic computation, which based on perturbation theory and constructed in the framework of matrix formalism. This method can be used for solving optimization problems and preliminary modeling in accelerator physics. There are presented the main theoretical positions and demonstration the result of this method on example of one of classical problems.
Using Canonical Forms for Isomorphism Reduction in Graph-based Model Checking
Kant, Gijs
Graph isomorphism checking can be used in graph-based model checking to achieve symmetry reduction. Instead of one-to-one comparing the graph representations of states, canonical forms of state graphs can be computed. These canonical forms can be used to store and compare states. However, computing
LHCb: Analysing DIRAC's Behavior using Model Checking with Process Algebra
Remenska, Daniela
2012-01-01
DIRAC is the Grid solution designed to support LHCb production activities as well as user data analysis. Based on a service-oriented architecture, DIRAC consists of many cooperating distributed services and agents delivering the workload to the Grid resources. Services accept requests from agents and running jobs, while agents run as light-weight components, fulfilling specific goals. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check for changes in the service states, and react to these accordingly. A characteristic of DIRAC's architecture is the relatively low complexity in the logic of each agent; the main source of complexity lies in their cooperation. These agents run concurrently, and communicate using the services' databases as a shared memory for synchronizing the state transitions. Although much effort is invested in making DIRAC reliable, entities occasionally get into inconsistent states, leadi...
Checking the new IRI model: The bottomside B parameters
Mosert, M.; Buresova, D.; Miro, G.; Lazo, B.; Ezquer, R.
2003-01-01
Electron density profiles obtained at Pruhonice (50.0, 15.0), El Arenosillo (37.1, 353.2) and Havana (23, 278) were used to check the bottom-side B parameters BO (thickness parameter) and B1 (shape parameter) predicted by the new IRI - 2000 version. The electron density profiles were derived from ionograms using the ARP technique. The data base includes daytime and nighttime ionograms recorded under different seasonal and solar activity conditions. Comparisons with IRI predictions were also done. The analysis shows that: a) The parameter B1 given by IRI 2000 reproduces better the observed ARP values than the IRI-90 version and b) The observed BO values are in general well reproduced by both IRI versions: IRI-90 and IRI-2000. (author)
Checking the new IRI model The bottomside B parameters
Mosert, M; Ezquer, R; Lazo, B; Miro, G
2002-01-01
Electron density profiles obtained at Pruhonice (50.0, 15.0), El Arenosillo (37.1, 353.2) and Havana (23, 278) were used to check the bottom-side B parameters BO (thickness parameter) and B1 (shape parameter) predicted by the new IRI - 2000 version. The electron density profiles were derived from ionograms using the ARP technique. The data base includes daytime and nighttime ionograms recorded under different seasonal and solar activity conditions. Comparisons with IRI predictions were also done. The analysis shows that: a) The parameter B1 given by IRI 2000 reproduces better the observed ARP values than the IRI-90 version and b) The observed BO values are in general well reproduced by both IRI versions: IRI-90 and IRI-2000.
Symbolic Model of Perception in Dynamic 3D Environments
Carruth, D. W; Robbins, B; Thomas, M. D; Morais, A; Letherwood, M; Nebel, K
2006-01-01
Computational models of human cognition have been applied to many complex real-world tasks including air traffic control, human-computer interaction, learning arithmetic, traversing the World Wide Web...
Development of a butterfly check valve model under natural circulation conditions
Rao, Yuxian; Yu, Lei; Fu, Shengwei; Zhang, Fan
2015-01-01
Highlights: • Bases on Lim’s swing check valve model, a butterfly check valve model was developed. • The method to quantify the friction torque T F in Li’s model was corrected. • The developed model was implemented into the RELAP5 code and verified. - Abstract: A butterfly check valve is widely used to prevent a reverse flow in the pipe lines of a marine nuclear power plant. Under some conditions, the natural circulation conditions in particular, the fluid velocity through the butterfly check valve might become too low to hold the valve disk fully open, thereby the flow resistance of the butterfly check valve varies with the location of the valve disk and as a result the fluid flow is significantly affected by the dynamic motion of the valve disk. Simulation of a pipe line that includes some butterfly check valves, especially under natural circulation conditions, is thus complicated. This paper focuses on the development of a butterfly check valve model to enhance the capability of the thermal–hydraulic system code and the developed model is implemented into the RELAP5 code. Both steady-state calculations and transient calculations were carried out for the primary loop system of a marine nuclear power plant and the calculation results are compared with the experimental data for verification purpose. The simulation results show an agreement with the experimental data
Integrating model checking with HiP-HOPS in model-based safety analysis
Sharvia, Septavera; Papadopoulos, Yiannis
2015-01-01
The ability to perform an effective and robust safety analysis on the design of modern safety–critical systems is crucial. Model-based safety analysis (MBSA) has been introduced in recent years to support the assessment of complex system design by focusing on the system model as the central artefact, and by automating the synthesis and analysis of failure-extended models. Model checking and failure logic synthesis and analysis (FLSA) are two prominent MBSA paradigms. Extensive research has placed emphasis on the development of these techniques, but discussion on their integration remains limited. In this paper, we propose a technique in which model checking and Hierarchically Performed Hazard Origin and Propagation Studies (HiP-HOPS) – an advanced FLSA technique – can be applied synergistically with benefit for the MBSA process. The application of the technique is illustrated through an example of a brake-by-wire system. - Highlights: • We propose technique to integrate HiP-HOPS and model checking. • State machines can be systematically constructed from HiP-HOPS. • The strengths of different MBSA techniques are combined. • Demonstrated through modeling and analysis of brake-by-wire system. • Root cause analysis is automated and system dynamic behaviors analyzed and verified
Data-driven modelling of LTI systems using symbolic regression
Khandelwal, D.; Toth, R.; Van den Hof, P.M.J.
2017-01-01
The aim of this project is to automate the task of data-driven identification of dynamical systems. The underlying goal is to develop an identification tool that models a physical system without distinguishing between classes of systems such as linear, nonlinear or possibly even hybrid systems. Such
Models, Metaphors and Symbols for Information and Knowledge Systems
David Williams
2014-01-01
Full Text Available A literature search indicates that Data, Information and Knowledge continue to be placed into a hierarchical construct where it is considered that information is more valuable than data and that information can be processed into becoming precious knowledge. Wisdom continues to be added to the model to further confuse the issue. This model constrains our ability to think more logically about how and why we develop knowledge management systems to support and enhance knowledge- intensive processes, tasks or projects. This paper seeks to summarise development of the Data-Information-Knowledge-Wisdom hierarchy, explore the extensive criticism of it and present a more logical (and accurate construct for the elements of intellectual capital when developing and managing Knowledge Management Systems.
Wen, Shameng; Meng, Qingkun; Feng, Chao; Tang, Chaojing
2017-01-01
Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM) model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.
Shameng Wen
Full Text Available Formal techniques have been devoted to analyzing whether network protocol specifications violate security policies; however, these methods cannot detect vulnerabilities in the implementations of the network protocols themselves. Symbolic execution can be used to analyze the paths of the network protocol implementations, but for stateful network protocols, it is difficult to reach the deep states of the protocol. This paper proposes a novel model-guided approach to detect vulnerabilities in network protocol implementations. Our method first abstracts a finite state machine (FSM model, then utilizes the model to guide the symbolic execution. This approach achieves high coverage of both the code and the protocol states. The proposed method is implemented and applied to test numerous real-world network protocol implementations. The experimental results indicate that the proposed method is more effective than traditional fuzzing methods such as SPIKE at detecting vulnerabilities in the deep states of network protocol implementations.
Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking
National Aeronautics and Space Administration — The translation of temporal logic specifications constitutes an essen- tial step in model checking and a major influence on the efficiency of formal verification via...
PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool
AlTurki, Musab; Meseguer, José
2011-01-01
Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability
R. Lestari; S. Linuwih
2012-01-01
Tujuan penelitian tindakan kelas ini untuk mengetahui pengaruh proses pembelajaran dengan menggunakan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah terhadap peningkatan social skill siswa. Pada proses penerapan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah siswa dibagi dalam kelompok-kelompok dan satu kelompok terdiri dari dua orang. Setiap kelompok berdiskusi untuk menyelesaikan suatu masalah, kemudian hasil diskusi kelompok akan dicek oleh pasangan dari...
Phase Two Feasibility Study for Software Safety Requirements Analysis Using Model Checking
Turgeon, Gregory; Price, Petra
2010-01-01
A feasibility study was performed on a representative aerospace system to determine the following: (1) the benefits and limitations to using SCADE , a commercially available tool for model checking, in comparison to using a proprietary tool that was studied previously [1] and (2) metrics for performing the model checking and for assessing the findings. This study was performed independently of the development task by a group unfamiliar with the system, providing a fresh, external perspective free from development bias.
Model-checking statistique pour la vérification de véhicules autonomes
Barbot , Benoît; Bérard , Béatrice; Duplouy , Yann; Haddad , Serge
2017-01-01
National audience; We present an application of statistical model-checking to the verification of an autonomous vehicle controller. Our goal is to check safety properties in various traffic situations. More specifically, we focus on a traffic jam situation. The controller is specified by a C++ program. Using sensors, it registers positions and velocities of nearby vehicles and modifies the position and velocity of the controlled vehicle to avoid collisions. We model the environment using a st...
Possible check of the QCD parton model in semiinclusive μ- -production of tau/psi-meson
Bagdasaryan, I.A.; Grigoryan, S.G.; Yesaibegyan, S.V.
1982-01-01
The process of tau/psi meson production in the semi-inclusive μN → μ+tau/psi+X interaction is discussed. It is shown that the measurement of azimuthal asymmetry in semi-inclusive production of tau/psi can serve as a good test for the check of the QCD parton model. An additional method of the check of distribution gluon functions in photon-gluon fusion model is suggested
Toward a model framework of generalized parallel componential processing of multi-symbol numbers.
Huber, Stefan; Cornelsen, Sonja; Moeller, Korbinian; Nuerk, Hans-Christoph
2015-05-01
In this article, we propose and evaluate a new model framework of parallel componential multi-symbol number processing, generalizing the idea of parallel componential processing of multi-digit numbers to the case of negative numbers by considering the polarity signs similar to single digits. In a first step, we evaluated this account by defining and investigating a sign-decade compatibility effect for the comparison of positive and negative numbers, which extends the unit-decade compatibility effect in 2-digit number processing. Then, we evaluated whether the model is capable of accounting for previous findings in negative number processing. In a magnitude comparison task, in which participants had to single out the larger of 2 integers, we observed a reliable sign-decade compatibility effect with prolonged reaction times for incompatible (e.g., -97 vs. +53; in which the number with the larger decade digit has the smaller, i.e., negative polarity sign) as compared with sign-decade compatible number pairs (e.g., -53 vs. +97). Moreover, an analysis of participants' eye fixation behavior corroborated our model of parallel componential processing of multi-symbol numbers. These results are discussed in light of concurrent theoretical notions about negative number processing. On the basis of the present results, we propose a generalized integrated model framework of parallel componential multi-symbol processing. (c) 2015 APA, all rights reserved).
Lahtinen, J.; Launiainen, T.; Heljanko, K.; Ropponen, J.
2012-01-01
Digital instrumentation and control (I and C) systems are challenging to verify. They enable complicated control functions, and the state spaces of the models easily become too large for comprehensive verification through traditional methods. Model checking is a formal method that can be used for system verification. A number of efficient model checking systems are available that provide analysis tools to determine automatically whether a given state machine model satisfies the desired safety properties. This report reviews the work performed in the Safety Evaluation and Reliability Analysis of Nuclear Automation (SARANA) project in 2011 regarding model checking. We have developed new, more exact modelling methods that are able to capture the behaviour of a system more realistically. In particular, we have developed more detailed fault models depicting the hardware configuration of a system, and methodology to model function-block-based systems asynchronously. In order to improve the usability of our model checking methods, we have developed an algorithm for model checking large modular systems. The algorithm can be used to verify properties of a model that could otherwise not be verified in a straightforward manner. (orig.)
Lahtinen, J. [VTT Technical Research Centre of Finland, Espoo (Finland); Launiainen, T.; Heljanko, K.; Ropponen, J. [Aalto Univ., Espoo (Finland). Dept. of Information and Computer Science
2012-07-01
Digital instrumentation and control (I and C) systems are challenging to verify. They enable complicated control functions, and the state spaces of the models easily become too large for comprehensive verification through traditional methods. Model checking is a formal method that can be used for system verification. A number of efficient model checking systems are available that provide analysis tools to determine automatically whether a given state machine model satisfies the desired safety properties. This report reviews the work performed in the Safety Evaluation and Reliability Analysis of Nuclear Automation (SARANA) project in 2011 regarding model checking. We have developed new, more exact modelling methods that are able to capture the behaviour of a system more realistically. In particular, we have developed more detailed fault models depicting the hardware configuration of a system, and methodology to model function-block-based systems asynchronously. In order to improve the usability of our model checking methods, we have developed an algorithm for model checking large modular systems. The algorithm can be used to verify properties of a model that could otherwise not be verified in a straightforward manner. (orig.)
On Diagnostic Checking of Vector ARMA-GARCH Models with Gaussian and Student-t Innovations
Yongning Wang
2013-04-01
Full Text Available This paper focuses on the diagnostic checking of vector ARMA (VARMA models with multivariate GARCH errors. For a fitted VARMA-GARCH model with Gaussian or Student-t innovations, we derive the asymptotic distributions of autocorrelation matrices of the cross-product vector of standardized residuals. This is different from the traditional approach that employs only the squared series of standardized residuals. We then study two portmanteau statistics, called Q1(M and Q2(M, for model checking. A residual-based bootstrap method is provided and demonstrated as an effective way to approximate the diagnostic checking statistics. Simulations are used to compare the performance of the proposed statistics with other methods available in the literature. In addition, we also investigate the effect of GARCH shocks on checking a fitted VARMA model. Empirical sizes and powers of the proposed statistics are investigated and the results suggest a procedure of using jointly Q1(M and Q2(M in diagnostic checking. The bivariate time series of FTSE 100 and DAX index returns is used to illustrate the performance of the proposed portmanteau statistics. The results show that it is important to consider the cross-product series of standardized residuals and GARCH effects in model checking.
Efficient Multi-Valued Bounded Model Checking for LTL over Quasi-Boolean Algebras
Andrade, Jefferson O.; Kameyama, Yukiyoshi
Multi-valued Model Checking extends classical, two-valued model checking to multi-valued logic such as Quasi-Boolean logic. The added expressivity is useful in dealing with such concepts as incompleteness and uncertainty in target systems, while it comes with the cost of time and space. Chechik and others proposed an efficient reduction from multi-valued model checking problems to two-valued ones, but to the authors' knowledge, no study was done for multi-valued bounded model checking. In this paper, we propose a novel, efficient algorithm for multi-valued bounded model checking. A notable feature of our algorithm is that it is not based on reduction of multi-values into two-values; instead, it generates a single formula which represents multi-valuedness by a suitable encoding, and asks a standard SAT solver to check its satisfiability. Our experimental results show a significant improvement in the number of variables and clauses and also in execution time compared with the reduction-based one.
Model based feasibility study on bidirectional check valves in wave energy converters
Hansen, Anders Hedegaard; Pedersen, Henrik C.; Andersen, Torben Ole
2014-01-01
Discrete fluid power force systems have been proposed as the primary stage for Wave Energy Converters (WEC’s) when converting ocean waves into electricity, this to improve the overall efficiency of wave energy devices. This paper presents a model based feasibility study of using bidirectional check....../Off and bidirectional check valves. Based on the analysis it is found that the energy production may be slightly improved by using bidirectional check valves as compared to on/off valves, due to a decrease in switching losses. Furthermore a reduction in high flow peaks are realised. The downside being increased...
Closing open SDL-systems for model checking with DTSpin
N. Ioustinova (Natalia); N. Sidorova; M. Steffen
2002-01-01
textabstractModel checkers like Spin can handle closed reactive systems, only. Thus to handle open systems, in particular when using assume-guarantee reasoning, we need to be able to close (sub-)systems, which is commonly done by adding an environment process. For models with asynchronous
Modelling and Analysis of Smart Grid: A Stochastic Model Checking Case Study
Yuksel, Ender; Zhu, Huibiao; Nielson, Hanne Riis
2012-01-01
that require novel methods and applications. In this context, an important issue is the verification of certain quantitative properties of the system. In this paper, we consider a specific Chinese Smart Grid implementation as a case study and address the verification problem for performance and energy......Cyber-physical systems integrate information and communication technology functions to the physical elements of a system for monitoring and controlling purposes. The conversion of traditional power grid into a smart grid, a fundamental example of a cyber-physical system, raises a number of issues...... consumption. We employ stochastic model checking approach and present our modelling and analysis study using PRISM model checker....
Quantitative modelling and analysis of a Chinese smart grid: a stochastic model checking case study
Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
Cyber-physical systems integrate information and communication technology with the physical elements of a system, mainly for monitoring and controlling purposes. The conversion of traditional power grid into a smart grid, a fundamental example of a cyber-physical system, raises a number of issues...... that require novel methods and applications. One of the important issues in this context is the verification of certain quantitative properties of the system. In this paper, we consider a specific Chinese smart grid implementation as a case study and address the verification problem for performance and energy...... consumption.We employ stochastic model checking approach and present our modelling and analysis study using PRISM model checker....
Model-Checking Real-Time Control Programs
Iversen, T. K.; Kristoffersen, K. J.; Larsen, Kim Guldstrand
2000-01-01
In this paper, we present a method for automatic verification of real-time control programs running on LEGO(R) RCX(TM) bricks using the verification tool UPPALL. The control programs, consisting of a number of tasks running concurrently, are automatically translated into the mixed automata model...... of UPPAAL. The fixed scheduling algorithm used by the LEGO(R) RCX(TM) processor is modeled in UPPALL, and supply of similar (sufficient) timed automata models for the environment allows analysis of the overall real-time system using the tools of UPPALL. To illustrate our technique for sorting LEGO(R) bricks...
Application of symbolic computations to the constitutive modeling of structural materials
Arnold, Steven M.; Tan, H. Q.; Dong, X.
1990-01-01
In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.
Abstraction and Model Checking in the PEPA Plug-in for Eclipse
Smith, Michael James Andrew
2010-01-01
lead to very large Markov chains. One way of analysing such models is to use abstraction - constructing a smaller model that bounds the properties of the original. We present an extension to the PEPA plug-in for Eclipse that enables abstracting and model checking of PEPA models. This implements two new...
Hussain, Faraz; Jha, Sumit K; Jha, Susmit; Langmead, Christopher J
2014-01-01
Stochastic models are increasingly used to study the behaviour of biochemical systems. While the structure of such models is often readily available from first principles, unknown quantitative features of the model are incorporated into the model as parameters. Algorithmic discovery of parameter values from experimentally observed facts remains a challenge for the computational systems biology community. We present a new parameter discovery algorithm that uses simulated annealing, sequential hypothesis testing, and statistical model checking to learn the parameters in a stochastic model. We apply our technique to a model of glucose and insulin metabolism used for in-silico validation of artificial pancreata and demonstrate its effectiveness by developing parallel CUDA-based implementation for parameter synthesis in this model.
COMPREHENSIVE CHECK MEASUREMENT OF KEY PARAMETERS ON MODEL BELT CONVEYOR
Vlastimil MONI
2013-07-01
Full Text Available Complex measurements of characteristic parameters realised on a long distance model belt conveyor are described. The main objective was to complete and combine the regular measurements of electric power on drives of belt conveyors operated in Czech opencast mines with measurements of other physical quantities and to gain by this way an image of their mutual relations and relations of quantities derived from them. The paper includes a short description and results of the measurements on an experimental model conveyor with a closed material transport way.
Dynamic Delayed Duplicate Detection for External Memory Model Checking
Evangelista, Sami
2008-01-01
Duplicate detection is an expensive operation of disk-based model checkers. It consists of comparing some potentially new states, the candidate states, to previous visited states. We propose a new approach to this technique called dynamic delayed duplicate detection. This one exploits some typical...
Model Checking Geographically Distributed Interlocking Systems Using UMC
Fantechi, Alessandro; Haxthausen, Anne Elisabeth; Nielsen, Michel Bøje Randahl
2017-01-01
the relevant distributed protocols. By doing that we obey the safety guidelines of the railway signalling domain, that require formal methods to support the certification of such products. We also show how formal modelling can help designing alternative distributed solutions, while maintaining adherence...
Hypersonic: Model Analysis and Checking in the Cloud
Acretoaie, Vlad; Störrle, Harald
2014-01-01
”. Objective: In this paper we investigate the conceptual and technical feasibility of a new software architecture for modeling tools, where certain advanced features are factored out of the client and moved towards the Cloud. With this approach we plan to address the above mentioned drawbacks of existing...
CSL model checking of deterministic and stochastic Petri nets
Martinez Verdugo, J.M.; Haverkort, Boudewijn R.H.M.; German, R.; Heindl, A.
2006-01-01
Deterministic and Stochastic Petri Nets (DSPNs) are a widely used high-level formalism for modeling discrete-event systems where events may occur either without consuming time, after a deterministic time, or after an exponentially distributed time. The underlying process dened by DSPNs, under
Dynamic Delayed Duplicate Detection for External Memory Model Checking
Evangelista, Sami
2008-01-01
Duplicate detection is an expensive operation of disk-based model checkers. It consists of comparing some potentially new states, the candidate states, to previous visited states. We propose a new approach to this technique called dynamic delayed duplicate detection. This one exploits some typica...... significantly better than some previously published algorithms....
UML Statechart Fault Tree Generation By Model Checking
Herbert, Luke Thomas; Herbert-Hansen, Zaza Nadja Lee
of the popular Business Process Modelling and Nota-tion (BPMN) language. To capture uncertainty and unreliability in workflows, we extend this formalism with probabilistic non-deterministic branching.We present an algorithm that allows for exhaustive gen-eration of possible error states that could arise in ex...
Model checking the FlexRay startup phase
Cranen, S.
2012-01-01
This report describes a discrete-time model of the startup phase of a FlexRay network. The startup behaviour of this network is analysed in the presence of several faults. It is shown that in certain cases a faulty node can prevent the network from communicating altogether. One previously unknown
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
Fränzle, Martin; Herde, Christian
2005-01-01
In this paper we present HySat, a new bounded model checker for linear hybrid systems, incorporating a tight integration of a DPLL-based pseudo-Boolean SAT solver and a linear programming routine as core engine. In contrast to related tools like MathSAT, ICS, or CVC, our tool exploits all...
Testing Model with "Check Technique" for Physics Education
Demir, Cihat
2016-01-01
As the number, date and form of the written tests are structured and teacher-oriented, it is considered that it creates fear and anxiety among the students. It has been found necessary and important to form a testing model which will keep the students away from the test anxiety and allows them to learn only about the lesson. For this study,…
Modeling tides and vertical tidal mixing: A reality check
Robertson, Robin
2010-01-01
Recently, there has been a great interest in the tidal contribution to vertical mixing in the ocean. In models, vertical mixing is estimated using parameterization of the sub-grid scale processes. Estimates of the vertical mixing varied widely depending on which vertical mixing parameterization was used. This study investigated the performance of ten different vertical mixing parameterizations in a terrain-following ocean model when simulating internal tides. The vertical mixing parameterization was found to have minor effects on the velocity fields at the tidal frequencies, but large effects on the estimates of vertical diffusivity of temperature. Although there was no definitive best performer for the vertical mixing parameterization, several parameterizations were eliminated based on comparison of the vertical diffusivity estimates with observations. The best performers were the new generic coefficients for the generic length scale schemes and Mellor-Yamada's 2.5 level closure scheme.
Using Runtime Analysis to Guide Model Checking of Java Programs
Havelund, Klaus; Norvig, Peter (Technical Monitor)
2001-01-01
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java programs. Runtime analysis is based on the idea of executing the program once. and observing the generated run to extract various kinds of information. This information can then be used to predict whether other different runs may violate some properties of interest, in addition of course to demonstrate whether the generated run itself violates such properties. These runtime analyses can be performed stand-alone to generate a set of warnings. It is furthermore demonstrated how these warnings can be used to guide a model checker, thereby reducing the search space. The described techniques have been implemented in the b e grown Java model checker called PathFinder.
Model Checking and Model-based Testing in the Railway Domain
Haxthausen, Anne Elisabeth; Peleska, Jan
2015-01-01
This chapter describes some approaches and emerging trends for verification and model-based testing of railway control systems. We describe state-of-the-art methods and associated tools for verifying interlocking systems and their configuration data, using bounded model checking and k...... with good test strength are explained. Interlocking systems represent just one class of many others, where concrete system instances are created from generic representations, using configuration data for determining the behaviour of the instances. We explain how the systematic transition from generic...... to concrete instances in the development path is complemented by associated transitions in the verification and testing paths....
Contextualizing symbol, symbolizing context
Maudy, Septiani Yugni; Suryadi, Didi; Mulyana, Endang
2017-08-01
When students learn algebra for the first time, inevitably they are experiencing transition from arithmetic to algebraic thinking. Once students could apprehend this essential mathematical knowledge, they are cultivating their ability in solving daily life problems by applying algebra. However, as we dig into this transitional stage, we identified possible students' learning obstacles to be dealt with seriously in order to forestall subsequent hindrance in studying more advance algebra. We come to realize this recurring problem as we undertook the processes of re-personalization and re-contextualization in which we scrutinize the very basic questions: 1) what is variable, linear equation with one variable and their relationship with the arithmetic-algebraic thinking? 2) Why student should learn such concepts? 3) How to teach those concepts to students? By positioning ourselves as a seventh grade student, we address the possibility of children to think arithmetically when confronted with the problems of linear equation with one variable. To help them thinking algebraically, Bruner's modes of representation developed contextually from concrete to abstract were delivered to enhance their interpretation toward the idea of variables. Hence, from the outset we designed the context for student to think symbolically initiated by exploring various symbols that could be contextualized in order to bridge student traversing the arithmetic-algebraic fruitfully.
Checking Fine and Gray subdistribution hazards model with cumulative sums of residuals
Li, Jianing; Scheike, Thomas; Zhang, Mei Jie
2015-01-01
Recently, Fine and Gray (J Am Stat Assoc 94:496–509, 1999) proposed a semi-parametric proportional regression model for the subdistribution hazard function which has been used extensively for analyzing competing risks data. However, failure of model adequacy could lead to severe bias in parameter...... estimation, and only a limited contribution has been made to check the model assumptions. In this paper, we present a class of analytical methods and graphical approaches for checking the assumptions of Fine and Gray’s model. The proposed goodness-of-fit test procedures are based on the cumulative sums...
Prototype of Automated PLC Model Checking Using Continuous Integration Tools
Lettrich, Michael
2015-01-01
To deal with the complexity of operating and supervising large scale industrial installations at CERN, often Programmable Logic Controllers (PLCs) are used. A failure in these control systems can cause a disaster in terms of economic loses, environmental damages or human losses. Therefore the requirements to software quality are very high. To provide PLC developers with a way to verify proper functionality against requirements, a Java tool named PLCverif has been developed which encapsulates and thus simplifies the use of third party model checkers. One of our goals in this project is to integrate PLCverif in development process of PLC programs. When the developer changes the program, all the requirements should be verified again, as a change on the code can produce collateral effects and violate one or more requirements. For that reason, PLCverif has been extended to work with Jenkins CI in order to trigger automatically the verication cases when the developer changes the PLC program. This prototype has been...
Symbolic Solution Approach to Wind Turbine based on Doubly Fed Induction Generator Model
Cañas–Carretón, M.; Gómez–Lázaro, E.; Martín–Martínez, S.
2015-01-01
–order induction generator is selected to model the electric machine, being this approach suitable to estimate the DFIG performance under transient conditions. The corresponding non–linear integro-differential equation system has been reduced to a linear state-space system by using an ad-hoc local linearization......This paper describes an alternative approach based on symbolic computations to simulate wind turbines equipped with Doubly–Fed Induction Generator (DFIG). The actuator disk theory is used to represent the aerodynamic part, and the one-mass model simulates the mechanical part. The 5th...
Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks
Zhi Chen
2015-01-01
Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.
Model Checking Real Time Java Using Java PathFinder
Lindstrom, Gary; Mehlitz, Peter C.; Visser, Willem
2005-01-01
The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real time threads; user defined schedulers; asynchronous events, handlers, and control transfers; a priority inheritance based default scheduler; non-heap memory areas such as immortal and scoped, and non-heap real time threads whose execution is not impeded by garbage collection. The Robust Software Systems group at NASA Ames Research Center has JAVA PATHFINDER (JPF) under development, a Java model checker. JPF at its core is a state exploring JVM which can examine alternative paths in a Java program (e.g., via backtracking) by trying all nondeterministic choices, including thread scheduling order. This paper describes our implementation of an RTSJ profile (subset) in JPF, including requirements, design decisions, and current implementation status. Two examples are analyzed: jobs on a multiprogramming operating system, and a complex resource contention example involving autonomous vehicles crossing an intersection. The utility of JPF in finding logic and timing errors is illustrated, and the remaining challenges in supporting all of RTSJ are assessed.
Solving scheduling problems by untimed model checking. The clinical chemical analyser case study
Margaria, T.; Wijs, Anton J.; Massink, M.; van de Pol, Jan Cornelis; Bortnik, Elena M.
2009-01-01
In this article, we show how scheduling problems can be modelled in untimed process algebra, by using special tick actions. A minimal-cost trace leading to a particular action, is one that minimises the number of tick steps. As a result, we can use any (timed or untimed) model checking tool to find
Bounded Model Checking and Inductive Verification of Hybrid Discrete-Continuous Systems
Becker, Bernd; Behle, Markus; Eisenbrand, Fritz
2004-01-01
We present a concept to signicantly advance the state of the art for bounded model checking (BMC) and inductive verication (IV) of hybrid discrete-continuous systems. Our approach combines the expertise of partners coming from dierent domains, like hybrid systems modeling and digital circuit veri...
Lahtinen, J.; Bjoerkman, K.; Valkonen, J.; Frits, J.; Niemelae, I.
2010-12-01
Digital instrumentation and control (I and C) systems containing programmable logic controllers are challenging to verify. They enable complicated control functions and the state spaces (number of distinct values of inputs, outputs and internal memory) of the designs easily become too large for comprehensive manual inspection. Model checking is a formal method that can be used for verifying that systems have been correctly designed. A number of efficient model checking systems are available which provide analysis tools that are able to determine automatically whether a given state machine model satisfies the desired safety properties. The practical case analysed in this research project is called an 'emergency diesel generator control system' and its purpose is to provide reserve power to critical devices and computers that must be available without interruption. This report describes 1) the development of a compositional approach for checking the models in large system designs, 2) the development of a modular model checking approach for modelling function block diagrams with the Uppaal model checker and 3) the experience of utilising the new modelling approaches in practice. (orig.)
Sound statistical model checking for MDP using partial order and confluence reduction
Hartmanns, Arnd; Timmer, Mark
Statistical model checking (SMC) is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-based technique, it can in general only provide sound
On-the-fly confluence detection for statistical model checking (extended version)
Hartmanns, Arnd; Timmer, Mark
Statistical model checking is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-based technique, it can only provide sound results if the
Gamble, Ed; Holzmann, Gerard
2011-01-01
Part of the US DOT investigation of Toyota SUA involved analysis of the throttle control software. JPL LaRS applied several techniques, including static analysis and logic model checking, to the software. A handful of logic models were built. Some weaknesses were identified; however, no cause for SUA was found. The full NASA report includes numerous other analyses
Variability-Specific Abstraction Refinement for Family-Based Model Checking
Dimovski, Aleksandar; Wasowski, Andrzej
2017-01-01
and property, while the number of possible scenarios is very large. In this work, we present an automatic iterative abstraction refinement procedure for family-based model checking. We use Craig interpolation to refine abstract variational models based on the obtained spurious counterexamples (traces...
Logical Specification and Analysis of Fault Tolerant Systems through Partial Model Checking
Gnesi, S.; Etalle, Sandro; Mukhopadhyay, S.; Lenzini, Gabriele; Lenzini, G.; Martinelli, F.; Roychoudhury, A.
2003-01-01
This paper presents a framework for a logical characterisation of fault tolerance and its formal analysis based on partial model checking techniques. The framework requires a fault tolerant system to be modelled using a formal calculus, here the CCS process algebra. To this aim we propose a uniform
Requirements-level semantics and model checking of object-oriented statecharts
Eshuis, H.; Jansen, D.N.; Wieringa, Roelf J.
2002-01-01
In this paper we define a requirements-level execution semantics for object-oriented statecharts and show how properties of a system specified by these statecharts can be model checked using tool support for model checkers. Our execution semantics is requirements-level because it uses the perfect
R. Lestari
2012-07-01
Full Text Available Tujuan penelitian tindakan kelas ini untuk mengetahui pengaruh proses pembelajaran dengan menggunakan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah terhadap peningkatan social skill siswa. Pada proses penerapan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah siswa dibagi dalam kelompok-kelompok dan satu kelompok terdiri dari dua orang. Setiap kelompok berdiskusi untuk menyelesaikan suatu masalah, kemudian hasil diskusi kelompok akan dicek oleh pasangan dari kelompok lain. Metode Penelitian yang digunakan adalah penelitian tindakan kelas yang dilaksanakan dua siklus. Metode pengumpulan data menggunakan tes dan angket skala sikap, sedangkan teknik analisis data menggunakan teknik analisis data kuantitatif. Social Skill siswa dari siklus I ke siklus II mengalami peningkatan. Hal ini didapatkan dari data angket skala sikap siklus I ke siklus II ketuntasan klasikalnya meningkat dan sebagian besar siswa sudah memiliki social skill yang baik. Hasil belajar kognitif siswa juga mengalami peningkatan. Model pembelajaran kooperatif tipe Pair Checks pemecahan masalah dapat meningkatkan social skill siswa.This two cycles-action research aimed to know learning process applying cooperative learning model-pair checks problem solving type and improvement of studentâ€™s social skills. The process of the model was as follows: deviding students into some groups consisting of two students, solving problem by each group and checking result of the discussion by other groups. Data collection method used was test and the use of attitude scale questionnaire, while technique of data analysis used was quantitative data analysis technique. The data analysis result showed that there was an increase of studentâ€™s social skill and studentsâ€™ achievement from cycle one to two. It is concluded that cooperative learning model-pair checks problem solving type can enhance studentâ€™s social skills
Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic
Bulychev, Petr; David, Alexandre; Larsen, Kim Guldstrand
2012-01-01
We present a novel approach and implementation for ana- lysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL≤ ). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction with desi......We present a novel approach and implementation for ana- lysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL≤ ). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction...
DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking
Jiří Barnat
2009-12-01
Full Text Available In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-accelerated version of the algorithm and we discuss where the limits of the tool are and what we intend to do in the future to avoid them.
Automated parameter estimation for biological models using Bayesian statistical model checking.
Hussain, Faraz; Langmead, Christopher J; Mi, Qi; Dutta-Moscato, Joyeeta; Vodovotz, Yoram; Jha, Sumit K
2015-01-01
Probabilistic models have gained widespread acceptance in the systems biology community as a useful way to represent complex biological systems. Such models are developed using existing knowledge of the structure and dynamics of the system, experimental observations, and inferences drawn from statistical analysis of empirical data. A key bottleneck in building such models is that some system variables cannot be measured experimentally. These variables are incorporated into the model as numerical parameters. Determining values of these parameters that justify existing experiments and provide reliable predictions when model simulations are performed is a key research problem. Using an agent-based model of the dynamics of acute inflammation, we demonstrate a novel parameter estimation algorithm by discovering the amount and schedule of doses of bacterial lipopolysaccharide that guarantee a set of observed clinical outcomes with high probability. We synthesized values of twenty-eight unknown parameters such that the parameterized model instantiated with these parameter values satisfies four specifications describing the dynamic behavior of the model. We have developed a new algorithmic technique for discovering parameters in complex stochastic models of biological systems given behavioral specifications written in a formal mathematical logic. Our algorithm uses Bayesian model checking, sequential hypothesis testing, and stochastic optimization to automatically synthesize parameters of probabilistic biological models.
Temporal Precedence Checking for Switched Models and its Application to a Parallel Landing Protocol
Duggirala, Parasara Sridhar; Wang, Le; Mitra, Sayan; Viswanathan, Mahesh; Munoz, Cesar A.
2014-01-01
This paper presents an algorithm for checking temporal precedence properties of nonlinear switched systems. This class of properties subsume bounded safety and capture requirements about visiting a sequence of predicates within given time intervals. The algorithm handles nonlinear predicates that arise from dynamics-based predictions used in alerting protocols for state-of-the-art transportation systems. It is sound and complete for nonlinear switch systems that robustly satisfy the given property. The algorithm is implemented in the Compare Execute Check Engine (C2E2) using validated simulations. As a case study, a simplified model of an alerting system for closely spaced parallel runways is considered. The proposed approach is applied to this model to check safety properties of the alerting logic for different operating conditions such as initial velocities, bank angles, aircraft longitudinal separation, and runway separation.
Tian Bo; Gao Yitian
2005-01-01
A realistic, inhomogeneous fiber in the optical communication systems can be described by the perturbed nonlinear Schrodinger model (also named as the normalized nonlinear Schrodinger model with periodically varying coefficients, dispersion managed nonlinear Schrodinger model or nonlinear Schrodinger model with variable coefficients). Hereby, we extend to this model a direct method, perform symbolic computation and obtain two families of the exact, analytic bright-solitonic solutions, with or without the chirp respectively. The parameters addressed include the shape of the bright soliton, soliton amplitude, inverse width of the soliton, chirp, frequency, center of the soliton and center of the phase of the soliton. Of optical and physical interests, we discuss some previously-published special cases of our solutions. Those solutions could help the future studies on the optical communication systems. ms
Nigam, Ravi; Schlosser, Ralf W; Lloyd, Lyle L
2006-09-01
Matrix strategies employing parts of speech arranged in systematic language matrices and milieu language teaching strategies have been successfully used to teach word combining skills to children who have cognitive disabilities and some functional speech. The present study investigated the acquisition and generalized production of two-term semantic relationships in a new population using new types of symbols. Three children with cognitive disabilities and little or no functional speech were taught to combine graphic symbols. The matrix strategy and the mand-model procedure were used concomitantly as intervention procedures. A multiple probe design across sets of action-object combinations with generalization probes of untrained combinations was used to teach the production of graphic symbol combinations. Results indicated that two of the three children learned the early syntactic-semantic rule of combining action-object symbols and demonstrated generalization to untrained action-object combinations and generalization across trainers. The results and future directions for research are discussed.
Model checking optimal finite-horizon control for probabilistic gene regulatory networks.
Wei, Ou; Guo, Zonghao; Niu, Yun; Liao, Wenyuan
2017-12-14
Probabilistic Boolean networks (PBNs) have been proposed for analyzing external control in gene regulatory networks with incorporation of uncertainty. A context-sensitive PBN with perturbation (CS-PBNp), extending a PBN with context-sensitivity to reflect the inherent biological stability and random perturbations to express the impact of external stimuli, is considered to be more suitable for modeling small biological systems intervened by conditions from the outside. In this paper, we apply probabilistic model checking, a formal verification technique, to optimal control for a CS-PBNp that minimizes the expected cost over a finite control horizon. We first describe a procedure of modeling a CS-PBNp using the language provided by a widely used probabilistic model checker PRISM. We then analyze the reward-based temporal properties and the computation in probabilistic model checking; based on the analysis, we provide a method to formulate the optimal control problem as minimum reachability reward properties. Furthermore, we incorporate control and state cost information into the PRISM code of a CS-PBNp such that automated model checking a minimum reachability reward property on the code gives the solution to the optimal control problem. We conduct experiments on two examples, an apoptosis network and a WNT5A network. Preliminary experiment results show the feasibility and effectiveness of our approach. The approach based on probabilistic model checking for optimal control avoids explicit computation of large-size state transition relations associated with PBNs. It enables a natural depiction of the dynamics of gene regulatory networks, and provides a canonical form to formulate optimal control problems using temporal properties that can be automated solved by leveraging the analysis power of underlying model checking engines. This work will be helpful for further utilization of the advances in formal verification techniques in system biology.
Modeling and analysis of cell membrane systems with probabilistic model checking
2011-01-01
Background Recently there has been a growing interest in the application of Probabilistic Model Checking (PMC) for the formal specification of biological systems. PMC is able to exhaustively explore all states of a stochastic model and can provide valuable insight into its behavior which are more difficult to see using only traditional methods for system analysis such as deterministic and stochastic simulation. In this work we propose a stochastic modeling for the description and analysis of sodium-potassium exchange pump. The sodium-potassium pump is a membrane transport system presents in all animal cell and capable of moving sodium and potassium ions against their concentration gradient. Results We present a quantitative formal specification of the pump mechanism in the PRISM language, taking into consideration a discrete chemistry approach and the Law of Mass Action aspects. We also present an analysis of the system using quantitative properties in order to verify the pump reversibility and understand the pump behavior using trend labels for the transition rates of the pump reactions. Conclusions Probabilistic model checking can be used along with other well established approaches such as simulation and differential equations to better understand pump behavior. Using PMC we can determine if specific events happen such as the potassium outside the cell ends in all model traces. We can also have a more detailed perspective on its behavior such as determining its reversibility and why its normal operation becomes slow over time. This knowledge can be used to direct experimental research and make it more efficient, leading to faster and more accurate scientific discoveries. PMID:22369714
Image/video understanding systems based on network-symbolic models
Kuvich, Gary
2004-03-01
Vision is a part of a larger information system that converts visual information into knowledge structures. These structures drive vision process, resolve ambiguity and uncertainty via feedback projections, and provide image understanding that is an interpretation of visual information in terms of such knowledge models. Computer simulation models are built on the basis of graphs/networks. The ability of human brain to emulate similar graph/network models is found. Symbols, predicates and grammars naturally emerge in such networks, and logic is simply a way of restructuring such models. Brain analyzes an image as a graph-type relational structure created via multilevel hierarchical compression of visual information. Primary areas provide active fusion of image features on a spatial grid-like structure, where nodes are cortical columns. Spatial logic and topology naturally present in such structures. Mid-level vision processes like perceptual grouping, separation of figure from ground, are special kinds of network transformations. They convert primary image structure into the set of more abstract ones, which represent objects and visual scene, making them easy for analysis by higher-level knowledge structures. Higher-level vision phenomena are results of such analysis. Composition of network-symbolic models combines learning, classification, and analogy together with higher-level model-based reasoning into a single framework, and it works similar to frames and agents. Computational intelligence methods transform images into model-based knowledge representation. Based on such principles, an Image/Video Understanding system can convert images into the knowledge models, and resolve uncertainty and ambiguity. This allows creating intelligent computer vision systems for design and manufacturing.
Design of Installing Check Dam Using RAMMS Model in Seorak National Park of South Korea
Jun, K.; Tak, W.; JUN, B. H.; Lee, H. J.; KIM, S. D.
2016-12-01
Design of Installing Check Dam Using RAMMS Model in Seorak National Park of South Korea Kye-Won Jun*, Won-Jun Tak*, Byong-Hee Jun**, Ho-Jin Lee***, Soung-Doug Kim* *Graduate School of Disaster Prevention, Kangwon National University, 346 Joogang-ro, Samcheok-si, Gangwon-do, Korea **School of Fire and Disaster Protection, Kangwon National University, 346 Joogang-ro, Samcheok-si, Gangwon-do, Korea ***School of Civil Engineering, Chungbuk National University, 1 Chungdae-ro, Seowon-gu, Cheongju, Korea Abstract As more than 64% of the land in South Korea is mountainous area, so many regions in South Korea are exposed to the danger of landslide and debris flow. So it is important to understand the behavior of debris flow in mountainous terrains, the various methods and models are being presented and developed based on the mathematical concept. The purpose of this study is to investigate the regions that experienced the debris flow due to typhoon called Ewiniar and to perform numerical modeling to design and layout of the Check dam for reducing the damage by the debris flow. For the performance of numerical modeling, on-site measurement of the research area was conducted including: topographic investigation, research on bridges in the downstream, and precision LiDAR 3D scanning for composed basic data of numerical modeling. The numerical simulation of this study was performed using RAMMS (Rapid Mass Movements Simulation) model for the analysis of the debris flow. This model applied to the conditions of the Check dam which was installed in the upstream, midstream, and downstream. Considering the reduction effect of debris flow, the expansion of debris flow, and the influence on the bridges in the downstream, proper location of the Check dam was designated. The result of present numerical model showed that when the Check dam was installed in the downstream section, 50 m above the bridge, the reduction effect of the debris flow was higher compared to when the Check dam were
Lin, T.
2014-01-01
In this paper, we settle a problem in probabilistic verification of infinite--state process (specifically, {\\it probabilistic pushdown process}). We show that model checking {\\it stateless probabilistic pushdown process} (pBPA) against {\\it probabilistic computational tree logic} (PCTL) is undecidable.
Specification and Generation of Environment for Model Checking of Software Components
Pařízek, P.; Plášil, František
2007-01-01
Roč. 176, - (2007), s. 143-154 ISSN 1571-0661 R&D Projects: GA AV ČR 1ET400300504 Institutional research plan: CEZ:AV0Z10300504 Keywords : software components * behavior protocols * model checking * automated generation of environment Subject RIV: JC - Computer Hardware ; Software
Efficient model checking for duration calculus based on branching-time approximations
Fränzle, Martin; Hansen, Michael Reichhardt
2008-01-01
Duration Calculus (abbreviated to DC) is an interval-based, metric-time temporal logic designed for reasoning about embedded real-time systems at a high level of abstraction. But the complexity of model checking any decidable fragment featuring both negation and chop, DC's only modality, is non...
A practical approach to model checking Duration Calculus using Presburger Arithmetic
Hansen, Michael Reichhardt; Dung, Phan Anh; Brekling, Aske Wiid
2014-01-01
This paper investigates the feasibility of reducing a model-checking problem K ⊧ ϕ for discrete time Duration Calculus to the decision problem for Presburger Arithmetic. Theoretical results point at severe limitations of this approach: (1) the reduction in Fränzle and Hansen (Int J Softw Inform 3...... limits of the approach are illustrated by a family of examples....
Pârvu, Ovidiu; Gilbert, David
2016-01-01
Insights gained from multilevel computational models of biological systems can be translated into real-life applications only if the model correctness has been verified first. One of the most frequently employed in silico techniques for computational model verification is model checking. Traditional model checking approaches only consider the evolution of numeric values, such as concentrations, over time and are appropriate for computational models of small scale systems (e.g. intracellular networks). However for gaining a systems level understanding of how biological organisms function it is essential to consider more complex large scale biological systems (e.g. organs). Verifying computational models of such systems requires capturing both how numeric values and properties of (emergent) spatial structures (e.g. area of multicellular population) change over time and across multiple levels of organization, which are not considered by existing model checking approaches. To address this limitation we have developed a novel approximate probabilistic multiscale spatio-temporal meta model checking methodology for verifying multilevel computational models relative to specifications describing the desired/expected system behaviour. The methodology is generic and supports computational models encoded using various high-level modelling formalisms because it is defined relative to time series data and not the models used to generate it. In addition, the methodology can be automatically adapted to case study specific types of spatial structures and properties using the spatio-temporal meta model checking concept. To automate the computational model verification process we have implemented the model checking approach in the software tool Mule (http://mule.modelchecking.org). Its applicability is illustrated against four systems biology computational models previously published in the literature encoding the rat cardiovascular system dynamics, the uterine contractions of labour
Testing a model of componential processing of multi-symbol numbers-evidence from measurement units.
Huber, Stefan; Bahnmueller, Julia; Klein, Elise; Moeller, Korbinian
2015-10-01
Research on numerical cognition has addressed the processing of nonsymbolic quantities and symbolic digits extensively. However, magnitude processing of measurement units is still a neglected topic in numerical cognition research. Hence, we investigated the processing of measurement units to evaluate whether typical effects of multi-digit number processing such as the compatibility effect, the string length congruity effect, and the distance effect are also present for measurement units. In three experiments, participants had to single out the larger one of two physical quantities (e.g., lengths). In Experiment 1, the compatibility of number and measurement unit (compatible: 3 mm_6 cm with 3 mm) as well as string length congruity (congruent: 1 m_2 km with m 2 characters) were manipulated. We observed reliable compatibility effects with prolonged reaction times (RT) for incompatible trials. Moreover, a string length congruity effect was present in RT with longer RT for incongruent trials. Experiments 2 and 3 served as control experiments showing that compatibility effects persist when controlling for holistic distance and that a distance effect for measurement units exists. Our findings indicate that numbers and measurement units are processed in a componential manner and thus highlight that processing characteristics of multi-digit numbers generalize to measurement units. Thereby, our data lend further support to the recently proposed generalized model of componential multi-symbol number processing.
Kuvich, Gary
2004-08-01
Vision is only a part of a system that converts visual information into knowledge structures. These structures drive the vision process, resolving ambiguity and uncertainty via feedback, and provide image understanding, which is an interpretation of visual information in terms of these knowledge models. These mechanisms provide a reliable recognition if the object is occluded or cannot be recognized as a whole. It is hard to split the entire system apart, and reliable solutions to the target recognition problems are possible only within the solution of a more generic Image Understanding Problem. Brain reduces informational and computational complexities, using implicit symbolic coding of features, hierarchical compression, and selective processing of visual information. Biologically inspired Network-Symbolic representation, where both systematic structural/logical methods and neural/statistical methods are parts of a single mechanism, is the most feasible for such models. It converts visual information into relational Network-Symbolic structures, avoiding artificial precise computations of 3-dimensional models. Network-Symbolic Transformations derive abstract structures, which allows for invariant recognition of an object as exemplar of a class. Active vision helps creating consistent models. Attention, separation of figure from ground and perceptual grouping are special kinds of network-symbolic transformations. Such Image/Video Understanding Systems will be reliably recognizing targets.
Requeno, José Ignacio; Colom, José Manuel
2014-12-01
Model checking is a generic verification technique that allows the phylogeneticist to focus on models and specifications instead of on implementation issues. Phylogenetic trees are considered as transition systems over which we interrogate phylogenetic questions written as formulas of temporal logic. Nonetheless, standard logics become insufficient for certain practices of phylogenetic analysis since they do not allow the inclusion of explicit time and probabilities. The aim of this paper is to extend the application of model checking techniques beyond qualitative phylogenetic properties and adapt the existing logical extensions and tools to the field of phylogeny. The introduction of time and probabilities in phylogenetic specifications is motivated by the study of a real example: the analysis of the ratio of lactose intolerance in some populations and the date of appearance of this phenotype.
Chaos and crises in a model for cooperative hunting: a symbolic dynamics approach.
Duarte, Jorge; Januário, Cristina; Martins, Nuno; Sardanyés, Josep
2009-12-01
In this work we investigate the population dynamics of cooperative hunting extending the McCann and Yodzis model for a three-species food chain system with a predator, a prey, and a resource species. The new model considers that a given fraction sigma of predators cooperates in prey's hunting, while the rest of the population 1-sigma hunts without cooperation. We use the theory of symbolic dynamics to study the topological entropy and the parameter space ordering of the kneading sequences associated with one-dimensional maps that reproduce significant aspects of the dynamics of the species under several degrees of cooperative hunting. Our model also allows us to investigate the so-called deterministic extinction via chaotic crisis and transient chaos in the framework of cooperative hunting. The symbolic sequences allow us to identify a critical boundary in the parameter spaces (K,C(0)) and (K,sigma) which separates two scenarios: (i) all-species coexistence and (ii) predator's extinction via chaotic crisis. We show that the crisis value of the carrying capacity K(c) decreases at increasing sigma, indicating that predator's populations with high degree of cooperative hunting are more sensitive to the chaotic crises. We also show that the control method of Dhamala and Lai [Phys. Rev. E 59, 1646 (1999)] can sustain the chaotic behavior after the crisis for systems with cooperative hunting. We finally analyze and quantify the inner structure of the target regions obtained with this control method for wider parameter values beyond the crisis, showing a power law dependence of the extinction transients on such critical parameters.
Exact and approximate probabilistic symbolic execution for nondeterministic programs
Luckow, Kasper Søe; Păsăreanu, Corina S.; Dwyer, Matthew B.
2014-01-01
Probabilistic software analysis seeks to quantify the likelihood of reaching a target event under uncertain environments. Recent approaches compute probabilities of execution paths using symbolic execution, but do not support nondeterminism. Nondeterminism arises naturally when no suitable probab...... Java programs. We show that our algorithms significantly improve upon a state-of-the-art statistical model checking algorithm, originally developed for Markov Decision Processes....... probabilistic model can capture a program behavior, e.g., for multithreading or distributed systems. In this work, we propose a technique, based on symbolic execution, to synthesize schedulers that resolve nondeterminism to maximize the probability of reaching a target event. To scale to large systems, we also...
Koh, Kwang Yong; Seong, Poong Hyun
2010-01-01
Fault tree analysis (FTA) has suffered from several drawbacks such that it uses only static gates and hence can not capture dynamic behaviors of the complex system precisely, and it is in lack of rigorous semantics, and reasoning process which is to check whether basic events really cause top events is done manually and hence very labor-intensive and time-consuming for the complex systems while it has been one of the most widely used safety analysis technique in nuclear industry. Although several attempts have been made to overcome this problem, they can not still do absolute or actual time modeling because they adapt relative time concept and can capture only sequential behaviors of the system. In this work, to resolve the problems, FTA and model checking are integrated to provide formal, automated and qualitative assistance to informal and/or quantitative safety analysis. Our approach proposes to build a formal model of the system together with fault trees. We introduce several temporal gates based on timed computational tree logic (TCTL) to capture absolute time behaviors of the system and to give concrete semantics to fault tree gates to reduce errors during the analysis, and use model checking technique to automate the reasoning process of FTA
Gina Belmonte
2016-07-01
Full Text Available Recent research on formal verification for Collective Adaptive Systems (CAS pushed advancements in spatial and spatio-temporal model checking, and as a side result provided novel image analysis methodologies, rooted in logical methods for topological spaces. Medical Imaging (MI is a field where such technologies show potential for ground-breaking innovation. In this position paper, we present a preliminary investigation centred on applications of spatial model checking to MI. The focus is shifted from pure logics to a mixture of logical, statistical and algorithmic approaches, driven by the logical nature intrinsic to the specification of the properties of interest in the field. As a result, novel operators are introduced, that could as well be brought back to the setting of CAS.
HyLTL: a temporal logic for model checking hybrid systems
Davide Bresolin
2013-08-01
Full Text Available The model-checking problem for hybrid systems is a well known challenge in the scientific community. Most of the existing approaches and tools are limited to safety properties only, or operates by transforming the hybrid system to be verified into a discrete one, thus loosing information on the continuous dynamics of the system. In this paper we present a logic for specifying complex properties of hybrid systems called HyLTL, and we show how it is possible to solve the model checking problem by translating the formula into an equivalent hybrid automaton. In this way the problem is reduced to a reachability problem on hybrid automata that can be solved by using existing tools.
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
Karin Quaas
2014-03-01
Full Text Available Parametric timed automata extend timed automata (Alur and Dill, 1991 in that they allow the specification of parametric bounds on the clock values. Since their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the emptiness problem for parametric timed automata with one clock is decidable, whereas it is undecidable if the automaton uses three or more parametric clocks. The problem is open for parametric timed automata with two parametric clocks. Metric temporal logic, MTL for short, is a widely used specification language for real-time systems. MTL-model checking of timed automata is decidable, no matter how many clocks are used in the timed automaton. In this paper, we prove that MTL-model checking for parametric timed automata is undecidable, even if the automaton uses only one clock and one parameter and is deterministic.
Schultz, J.H.; Lettvin, J.D.
1982-02-01
A system of nonalgebraic symbol manipulators, called The FORSE (FORtran Symbol Expanders) has been developed to document and prepare input-output for Fortran programs. The use of documentation at the level of the individual equation is defended. The operation of The FORSE is described, along with user instructions and a worked example
On Modeling Affect in Audio with Non-Linear Symbolic Dynamics
Pauline Mouawad
2017-09-01
Full Text Available The discovery of semantic information from complex signals is a task concerned with connecting humans’ perceptions and/or intentions with the signals content. In the case of audio signals, complex perceptions are appraised in a listener’s mind, that trigger affective responses that may be relevant for well-being and survival. In this paper we are interested in the broader question of relations between uncertainty in data as measured using various information criteria and emotions, and we propose a novel method that combines nonlinear dynamics analysis with a method of adaptive time series symbolization that finds the meaningful audio structure in terms of symbolized recurrence properties. In a first phase we obtain symbolic recurrence quantification measures from symbolic recurrence plots, without the need to reconstruct the phase space with embedding. Then we estimate symbolic dynamical invariants from symbolized time series, after embedding. The invariants are: correlation dimension, correlation entropy and Lyapunov exponent. Through their application for the logistic map, we show that our measures are in agreement with known methods from literature. We further show that one symbolic recurrence measure, namely the symbolic Shannon entropy, correlates positively with the positive Lyapunov exponents. Finally we evaluate the performance of our measures in emotion recognition through the implementation of classification tasks for different types of audio signals, and show that in some cases, they perform better than state-of-the-art methods that rely on low-level acoustic features.
Analysis of DGNB-DK criteria for BIM-based Model Checking automatization
Gade, Peter Nørkjær; Svidt, Kjeld; Jensen, Rasmus Lund
This report includes the results of an analysis of the automation potential of the Danish edition of building sustainability assessment method Deutsche Gesellschaft für Nachhaltiges Bauen (DGNB) for office buildings version 2014 1.1. The analysis investigate the criteria related to DGNB-DK and if......-DK and if they would be suited for automation through the technological concept BIM-based Model Checking (BMC)....
Model-Checking of Linear-Time Properties in Multi-Valued Systems
Li, Yongming; Droste, Manfred; Lei, Lihui
2012-01-01
In this paper, we study model-checking of linear-time properties in multi-valued systems. Safety property, invariant property, liveness property, persistence and dual-persistence properties in multi-valued logic systems are introduced. Some algorithms related to the above multi-valued linear-time properties are discussed. The verification of multi-valued regular safety properties and multi-valued $\\omega$-regular properties using lattice-valued automata are thoroughly studied. Since the law o...
Model checking software for phylogenetic trees using distribution and database methods
Requeno José Ignacio
2013-12-01
Full Text Available Model checking, a generic and formal paradigm stemming from computer science based on temporal logics, has been proposed for the study of biological properties that emerge from the labeling of the states defined over the phylogenetic tree. This strategy allows us to use generic software tools already present in the industry. However, the performance of traditional model checking is penalized when scaling the system for large phylogenies. To this end, two strategies are presented here. The first one consists of partitioning the phylogenetic tree into a set of subgraphs each one representing a subproblem to be verified so as to speed up the computation time and distribute the memory consumption. The second strategy is based on uncoupling the information associated to each state of the phylogenetic tree (mainly, the DNA sequence and exporting it to an external tool for the management of large information systems. The integration of all these approaches outperforms the results of monolithic model checking and helps us to execute the verification of properties in a real phylogenetic tree.
A Novel Algorithm for Intrusion Detection Based on RASL Model Checking
Weijun Zhu
2013-01-01
Full Text Available The interval temporal logic (ITL model checking (MC technique enhances the power of intrusion detection systems (IDSs to detect concurrent attacks due to the strong expressive power of ITL. However, an ITL formula suffers from difficulty in the description of the time constraints between different actions in the same attack. To address this problem, we formalize a novel real-time interval temporal logic—real-time attack signature logic (RASL. Based on such a new logic, we put forward a RASL model checking algorithm. Furthermore, we use RASL formulas to describe attack signatures and employ discrete timed automata to create an audit log. As a result, RASL model checking algorithm can be used to automatically verify whether the automata satisfy the formulas, that is, whether the audit log coincides with the attack signatures. The simulation experiments show that the new approach effectively enhances the detection power of the MC-based intrusion detection methods for a number of telnet attacks, p-trace attacks, and the other sixteen types of attacks. And these experiments indicate that the new algorithm can find several types of real-time attacks, whereas the existing MC-based intrusion detection approaches cannot do that.
A rule-based approach to model checking of UML state machines
Grobelna, Iwona; Grobelny, Michał; Stefanowicz, Łukasz
2016-12-01
In the paper a new approach to formal verification of control process specification expressed by means of UML state machines in version 2.x is proposed. In contrast to other approaches from the literature, we use the abstract and universal rule-based logical model suitable both for model checking (using the nuXmv model checker), but also for logical synthesis in form of rapid prototyping. Hence, a prototype implementation in hardware description language VHDL can be obtained that fully reflects the primary, already formally verified specification in form of UML state machines. Presented approach allows to increase the assurance that implemented system meets the user-defined requirements.
Model Checking Verification and Validation at JPL and the NASA Fairmont IV and V Facility
Schneider, Frank; Easterbrook, Steve; Callahan, Jack; Montgomery, Todd
1999-01-01
We show how a technology transfer effort was carried out. The successful use of model checking on a pilot JPL flight project demonstrates the usefulness and the efficacy of the approach. The pilot project was used to model a complex spacecraft controller. Software design and implementation validation were carried out successfully. To suggest future applications we also show how the implementation validation step can be automated. The effort was followed by the formal introduction of the modeling technique as a part of the JPL Quality Assurance process.
Rechester, A.B.; White, R.B.
1993-01-01
Complex dynamic processes exhibit many complicated patterns of evolution. How can all these patterns be recognized using only output (observational, experimental) data without prior knowledge of the equations of motion? The powerful method for doing this is based on symbolic dynamics: (1) Present output data in symbolic form (trial language). (2) Topological and metric entropies are constructed. (3) Develop algorithms for computer optimization of entropies. (4) By maximizing entropies, find the most appropriate symbolic language for the purpose of pattern recognition. (5) Test this method using a variety of dynamical models from nonlinear science. The authors are in the process of applying this method for analysis of MHD fluctuations in tokamaks
Sediment depositions upstream of open check dams: new elements from small scale models
Piton, Guillaume; Le Guern, Jules; Carbonari, Costanza; Recking, Alain
2015-04-01
numbers that the flows tend to adopt? New small scale model experiments have been undertaken focusing on depositions processes and their related hydraulics. Accurate photogrammetric measurements allowed us to better describe the deposition processes3. Large Scale Particle Image Velocimetry (LS-PIV) was performed to determine surface velocity fields in highly active channels with low grain submersion4. We will present preliminary results of our experiments showing the new elements we observed in massive deposit dynamics. REFERENCES 1.Armanini, A., Dellagiacoma, F. & Ferrari, L. From the check dam to the development of functional check dams. Fluvial Hydraulics of Mountain Regions 37, 331-344 (1991). 2.Piton, G. & Recking, A. Design of sediment traps with open check dams: a review, part I: hydraulic and deposition processes. (Accepted by the) Journal of Hydraulic Engineering 1-23 (2015). 3.Le Guern, J. Ms Thesis: Modélisation physique des plages de depot : analyse de la dynamique de remplissage.(2014) . 4.Carbonari, C. Ms Thesis: Small scale experiments of deposition processes occuring in sediment traps, LS-PIV measurments and geomorphological descriptions. (in preparation).
Pushing the asymptotics of the 6j-symbol further
Dupuis, Maiete; Livine, Etera R.
2009-01-01
In the context of spin-foam models for quantum gravity, we investigate the asymptotical behavior of the (6j)-symbol at next-to-leading order. This gives the first quantum gravity correction to the (3d) Regge action. We compute it analytically and check our results against numerical calculations. The (6j)-symbol is the building block of the Ponzano-Regge amplitudes for 3d quantum gravity, and the present analysis is directly relevant to deriving the quantum corrections to gravitational correlations in the spin-foam formalism.
GRAPHIC ADVERTISING, SPECIALIZED COMMUNICATIONS MODEL THROUGH SYMBOLS, WORDS, IMAGES WORDS, IMAGES
ADRONACHI Maria
2011-01-01
The aim of the paper is to identify the graphic advertising components: symbol, text, colour, to illustrate how they cooperate in order to create the advertising message, and to analyze the corelation product – advertising – consumer.
GRAPHIC ADVERTISING, SPECIALIZED COMMUNICATIONS MODEL THROUGH SYMBOLS, WORDS, IMAGES WORDS, IMAGES
ADRONACHI Maria
2011-06-01
Full Text Available The aim of the paper is to identify the graphic advertising components: symbol, text, colour, to illustrate how they cooperate in order to create the advertising message, and to analyze the corelation product – advertising – consumer.
Mayzelis, Z.A.; Apostolov, S.S.; Melnyk, S.S.; Usatenko, O.V.; Yampol'skii, V.A.
2007-01-01
A theory of symbolic dynamic systems with long-range correlations based on the consideration of the binary N-step Markov chains developed earlier in Phys Rev Lett 2003;90:110601 is generalized to the biased case (non-equal numbers of zeros and unities in the chain). In the model, the conditional probability that the ith symbol in the chain equals zero (or unity) is a linear function of the number of unities (zeros) among the preceding N symbols. The correlation and distribution functions as well as the variance of number of symbols in the words of arbitrary length L are obtained analytically and verified by numerical simulations. A self-similarity of the studied stochastic process is revealed and the similarity group transformation of the chain parameters is presented. The diffusion Fokker-Planck equation governing the distribution function of the L-words is explored. If the persistent correlations are not extremely strong, the distribution function is shown to be the Gaussian with the variance being nonlinearly dependent on L. An equation connecting the memory and correlation function of the additive Markov chain is presented. This equation allows reconstructing a memory function using a correlation function of the system. Effectiveness and robustness of the proposed method is demonstrated by simple model examples. Memory functions of concrete coarse-grained literary texts are found and their universal power-law behavior at long distances is revealed
Mayzelis, Z.A. [Department of Physics, Kharkov National University, 4 Svoboda Sq., Kharkov 61077 (Ukraine); Apostolov, S.S. [Department of Physics, Kharkov National University, 4 Svoboda Sq., Kharkov 61077 (Ukraine); Melnyk, S.S. [A. Ya. Usikov Institute for Radiophysics and Electronics, Ukrainian Academy of Science, 12 Proskura Street, 61085 Kharkov (Ukraine); Usatenko, O.V. [A. Ya. Usikov Institute for Radiophysics and Electronics, Ukrainian Academy of Science, 12 Proskura Street, 61085 Kharkov (Ukraine)]. E-mail: usatenko@ire.kharkov.ua; Yampol' skii, V.A. [A. Ya. Usikov Institute for Radiophysics and Electronics, Ukrainian Academy of Science, 12 Proskura Street, 61085 Kharkov (Ukraine)
2007-10-15
A theory of symbolic dynamic systems with long-range correlations based on the consideration of the binary N-step Markov chains developed earlier in Phys Rev Lett 2003;90:110601 is generalized to the biased case (non-equal numbers of zeros and unities in the chain). In the model, the conditional probability that the ith symbol in the chain equals zero (or unity) is a linear function of the number of unities (zeros) among the preceding N symbols. The correlation and distribution functions as well as the variance of number of symbols in the words of arbitrary length L are obtained analytically and verified by numerical simulations. A self-similarity of the studied stochastic process is revealed and the similarity group transformation of the chain parameters is presented. The diffusion Fokker-Planck equation governing the distribution function of the L-words is explored. If the persistent correlations are not extremely strong, the distribution function is shown to be the Gaussian with the variance being nonlinearly dependent on L. An equation connecting the memory and correlation function of the additive Markov chain is presented. This equation allows reconstructing a memory function using a correlation function of the system. Effectiveness and robustness of the proposed method is demonstrated by simple model examples. Memory functions of concrete coarse-grained literary texts are found and their universal power-law behavior at long distances is revealed.
Marcus Völp
2012-11-01
Full Text Available Reliability in terms of functional properties from the safety-liveness spectrum is an indispensable requirement of low-level operating-system (OS code. However, with evermore complex and thus less predictable hardware, quantitative and probabilistic guarantees become more and more important. Probabilistic model checking is one technique to automatically obtain these guarantees. First experiences with the automated quantitative analysis of low-level operating-system code confirm the expectation that the naive probabilistic model checking approach rapidly reaches its limits when increasing the numbers of processes. This paper reports on our work-in-progress to tackle the state explosion problem for low-level OS-code caused by the exponential blow-up of the model size when the number of processes grows. We studied the symmetry reduction approach and carried out our experiments with a simple test-and-test-and-set lock case study as a representative example for a wide range of protocols with natural inter-process dependencies and long-run properties. We quickly see a state-space explosion for scenarios where inter-process dependencies are insignificant. However, once inter-process dependencies dominate the picture models with hundred and more processes can be constructed and analysed.
Model checking of safety-critical software in the nuclear engineering domain
Lahtinen, J.; Valkonen, J.; Björkman, K.; Frits, J.; Niemelä, I.; Heljanko, K.
2012-01-01
Instrumentation and control (I and C) systems play a vital role in the operation of safety-critical processes. Digital programmable logic controllers (PLC) enable sophisticated control tasks which sets high requirements for system validation and verification methods. Testing and simulation have an important role in the overall verification of a system but are not suitable for comprehensive evaluation because only a limited number of system behaviors can be analyzed due to time limitations. Testing is also performed too late in the development lifecycle and thus the correction of design errors is expensive. This paper discusses the role of formal methods in software development in the area of nuclear engineering. It puts forward model checking, a computer-aided formal method for verifying the correctness of a system design model, as a promising approach to system verification. The main contribution of the paper is the development of systematic methodology for modeling safety critical systems in the nuclear domain. Two case studies are reviewed, in which we have found errors that were previously not detected. We also discuss the actions that should be taken in order to increase confidence in the model checking process.
Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language
Madhavapeddy, Anil
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which provides a usable middle ground between ad-hoc coding and formal reasoning. It enables programmers to embed automata in their code which can be statically model-checked using SPIN and dynamically enforced. The performance overheads are minimal, and the automata also provide higher-level debugging capabilities. We also describe some practical uses of SPL by describing the automata used in an SSH server written entirely in OCaml/SPL.
Misbah Razzaq
Full Text Available Internet worms are analogous to biological viruses since they can infect a host and have the ability to propagate through a chosen medium. To prevent the spread of a worm or to grasp how to regulate a prevailing worm, compartmental models are commonly used as a means to examine and understand the patterns and mechanisms of a worm spread. However, one of the greatest challenge is to produce methods to verify and validate the behavioural properties of a compartmental model. This is why in this study we suggest a framework based on Petri Nets and Model Checking through which we can meticulously examine and validate these models. We investigate Susceptible-Exposed-Infectious-Recovered (SEIR model and propose a new model Susceptible-Exposed-Infectious-Recovered-Delayed-Quarantined (Susceptible/Recovered (SEIDQR(S/I along with hybrid quarantine strategy, which is then constructed and analysed using Stochastic Petri Nets and Continuous Time Markov Chain. The analysis shows that the hybrid quarantine strategy is extremely effective in reducing the risk of propagating the worm. Through Model Checking, we gained insight into the functionality of compartmental models. Model Checking results validate simulation ones well, which fully support the proposed framework.
Bringing Automated Model Checking to PLC Program Development - A CERN Case Study
Fernandez Adiego, B; Tournier, J-C; Blanco Vinuela, E; Gonzalez Suarez, V M
2014-01-01
Verification of critical software is a high priority but a challenging task for industrial control systems. Model checking appears to be an appropriate approach for this purpose. However, this technique is not widely used in industry yet, due to some obstacles. The main obstacles encountered when trying to apply formal verification techniques at industrial installations are the difficulty of creating models out of PLC programs and defining formally the specification requirements. In addition, models produced out of real-life programs have a huge state space, thus preventing the verification due to performance issues. Our work at CERN (European Organization for Nuclear Research) focuses on developing efficient automatic verification methods for industrial critical installations based on PLC (Programmable Logic Controller) control systems. In this paper, we present a tool generating automatically formal models out of PLC code. The tool implements a general methodology which can support several input languages, ...
An Integrated Approach of Model checking and Temporal Fault Tree for System Safety Analysis
Koh, Kwang Yong; Seong, Poong Hyun [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of)
2009-10-15
Digitalization of instruments and control systems in nuclear power plants offers the potential to improve plant safety and reliability through features such as increased hardware reliability and stability, and improved failure detection capability. It however makes the systems and their safety analysis more complex. Originally, safety analysis was applied to hardware system components and formal methods mainly to software. For software-controlled or digitalized systems, it is necessary to integrate both. Fault tree analysis (FTA) which has been one of the most widely used safety analysis technique in nuclear industry suffers from several drawbacks as described in. In this work, to resolve the problems, FTA and model checking are integrated to provide formal, automated and qualitative assistance to informal and/or quantitative safety analysis. Our approach proposes to build a formal model of the system together with fault trees. We introduce several temporal gates based on timed computational tree logic (TCTL) to capture absolute time behaviors of the system and to give concrete semantics to fault tree gates to reduce errors during the analysis, and use model checking technique to automate the reasoning process of FTA.
Kuvich, Gary
2003-08-01
Vision is a part of a larger information system that converts visual information into knowledge structures. These structures drive vision process, resolve ambiguity and uncertainty via feedback projections, and provide image understanding that is an interpretation of visual information in terms of such knowledge models. The ability of human brain to emulate knowledge structures in the form of networks-symbolic models is found. And that means an important shift of paradigm in our knowledge about brain from neural networks to "cortical software". Symbols, predicates and grammars naturally emerge in such active multilevel hierarchical networks, and logic is simply a way of restructuring such models. Brain analyzes an image as a graph-type decision structure created via multilevel hierarchical compression of visual information. Mid-level vision processes like clustering, perceptual grouping, separation of figure from ground, are special kinds of graph/network transformations. They convert low-level image structure into the set of more abstract ones, which represent objects and visual scene, making them easy for analysis by higher-level knowledge structures. Higher-level vision phenomena are results of such analysis. Composition of network-symbolic models works similar to frames and agents, combines learning, classification, analogy together with higher-level model-based reasoning into a single framework. Such models do not require supercomputers. Based on such principles, and using methods of Computational intelligence, an Image Understanding system can convert images into the network-symbolic knowledge models, and effectively resolve uncertainty and ambiguity, providing unifying representation for perception and cognition. That allows creating new intelligent computer vision systems for robotic and defense industries.
Re-engineering pre-employment check-up systems: a model for improving health services.
Rateb, Said Abdel Hakim; El Nouman, Azza Abdel Razek; Rateb, Moshira Abdel Hakim; Asar, Mohamed Naguib; El Amin, Ayman Mohammed; Gad, Saad abdel Aziz; Mohamed, Mohamed Salah Eldin
2011-01-01
The purpose of this paper is to develop a model for improving health services provided by the pre-employment medical fitness check-up system affiliated to Egypt's Health Insurance Organization (HIO). Operations research, notably system re-engineering, is used in six randomly selected centers and findings before and after re-engineering are compared. The re-engineering model follows a systems approach, focusing on three areas: structure, process and outcome. The model is based on six main components: electronic booking, standardized check-up processes, protected medical documents, advanced archiving through an electronic content management (ECM) system, infrastructure development, and capacity building. The model originates mainly from customer needs and expectations. The centers' monthly customer flow increased significantly after re-engineering. The mean time spent per customer cycle improved after re-engineering--18.3 +/- 5.5 minutes as compared to 48.8 +/- 14.5 minutes before. Appointment delay was also significantly decreased from an average 18 to 6.2 days. Both beneficiaries and service providers were significantly more satisfied with the services after re-engineering. The model proves that re-engineering program costs are exceeded by increased revenue. Re-engineering in this study involved multiple structure and process elements. The literature review did not reveal similar re-engineering healthcare packages. Therefore, each element was compared separately. This model is highly recommended for improving service effectiveness and efficiency. This research is the first in Egypt to apply the re-engineering approach to public health systems. Developing user-friendly models for service improvement is an added value.
An Efficient Explicit-time Description Method for Timed Model Checking
Hao Wang
2009-12-01
Full Text Available Timed model checking, the method to formally verify real-time systems, is attracting increasing attention from both the model checking community and the real-time community. Explicit-time description methods verify real-time systems using general model constructs found in standard un-timed model checkers. Lamport proposed an explicit-time description method using a clock-ticking process (Tick to simulate the passage of time together with a group of global variables to model time requirements. Two methods, the Sync-based Explicit-time Description Method using rendezvous synchronization steps and the Semaphore-based Explicit-time Description Method using only one global variable were proposed; they both achieve better modularity than Lamport's method in modeling the real-time systems. In contrast to timed automata based model checkers like UPPAAL, explicit-time description methods can access and store the current time instant for future calculations necessary for many real-time systems, especially those with pre-emptive scheduling. However, the Tick process in the above three methods increments the time by one unit in each tick; the state spaces therefore grow relatively fast as the time parameters increase, a problem when the system's time period is relatively long. In this paper, we propose a more efficient method which enables the Tick process to leap multiple time units in one tick. Preliminary experimental results in a high performance computing environment show that this new method significantly reduces the state space and improves both the time and memory efficiency.
G. Bussi
2013-08-01
Full Text Available Soil loss and sediment transport in Mediterranean areas are driven by complex non-linear processes which have been only partially understood. Distributed models can be very helpful tools for understanding the catchment-scale phenomena which lead to soil erosion and sediment transport. In this study, a modelling approach is proposed to reproduce and evaluate erosion and sediment yield processes in a Mediterranean catchment (Rambla del Poyo, Valencia, Spain. Due to the lack of sediment transport records for model calibration and validation, a detailed description of the alluvial stratigraphy infilling a check dam that drains a 12.9 km2 sub-catchment was used as indirect information of sediment yield data. These dam infill sediments showed evidences of at least 15 depositional events (floods over the time period 1990–2009. The TETIS model, a distributed conceptual hydrological and sediment model, was coupled to the Sediment Trap Efficiency for Small Ponds (STEP model for reproducing reservoir retention, and it was calibrated and validated using the sedimentation volume estimated for the depositional units associated with discrete runoff events. The results show relatively low net erosion rates compared to other Mediterranean catchments (0.136 Mg ha−1 yr−1, probably due to the extensive outcrops of limestone bedrock, thin soils and rather homogeneous vegetation cover. The simulated sediment production and transport rates offer model satisfactory results, further supported by in-site palaeohydrological evidences and spatial validation using additional check dams, showing the great potential of the presented data assimilation methodology for the quantitative analysis of sediment dynamics in ungauged Mediterranean basins.
Model Checking Artificial Intelligence Based Planners: Even the Best Laid Plans Must Be Verified
Smith, Margaret H.; Holzmann, Gerard J.; Cucullu, Gordon C., III; Smith, Benjamin D.
2005-01-01
Automated planning systems (APS) are gaining acceptance for use on NASA missions as evidenced by APS flown On missions such as Orbiter and Deep Space 1 both of which were commanded by onboard planning systems. The planning system takes high level goals and expands them onboard into a detailed of action fiat the spacecraft executes. The system must be verified to ensure that the automatically generated plans achieve the goals as expected and do not generate actions that would harm the spacecraft or mission. These systems are typically tested using empirical methods. Formal methods, such as model checking, offer exhaustive or measurable test coverage which leads to much greater confidence in correctness. This paper describes a formal method based on the SPIN model checker. This method guarantees that possible plans meet certain desirable properties. We express the input model in Promela, the language of SPIN and express the properties of desirable plans formally.
Location Contexts of User Check-Ins to Model Urban Geo Life-Style Patterns
Hasan, Samiul; Ukkusuri, Satish V.
2015-01-01
Geo-location data from social media offers us information, in new ways, to understand people's attitudes and interests through their activity choices. In this paper, we explore the idea of inferring individual life-style patterns from activity-location choices revealed in social media. We present a model to understand life-style patterns using the contextual information (e. g. location categories) of user check-ins. Probabilistic topic models are developed to infer individual geo life-style patterns from two perspectives: i) to characterize the patterns of user interests to different types of places and ii) to characterize the patterns of user visits to different neighborhoods. The method is applied to a dataset of Foursquare check-ins of the users from New York City. The co-existence of several location contexts and the corresponding probabilities in a given pattern provide useful information about user interests and choices. It is found that geo life-style patterns have similar items—either nearby neighborhoods or similar location categories. The semantic and geographic proximity of the items in a pattern reflects the hidden regularity in user preferences and location choice behavior. PMID:25970430
Verification of Java Programs using Symbolic Execution and Invariant Generation
Pasareanu, Corina; Visser, Willem
2004-01-01
Software verification is recognized as an important and difficult problem. We present a norel framework, based on symbolic execution, for the automated verification of software. The framework uses annotations in the form of method specifications an3 loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants automatically. The technique handles different types of data (e.g. boolean and numeric constraints, dynamically allocated structures and arrays) and it allows for checking universally quantified formulas. Our framework is built on top of the Java PathFinder model checking toolset and it was used for the verification of several non-trivial Java programs.
Kumst, S
2015-01-01
The ability of children to delay gratification is correlated with a range of positive outcomes in adulthood, showing the potential impact of helping young children increase their competence in this area. This study investigated the influence of symbolic models on the self-control of 3-year old children. Eighty-three children were randomly assigned to one of three modelling conditions: personal storytelling, impersonal storytelling, and control. Children were tested on the delay-of-gratification maintenance paradigm both before and after being exposed to a symbolic model or control condition. Repeated measures ANOVA revealed no significant differences between the two storytelling groups and the control group, indicating that the symbolic models did not influence children’s ability to delay gratification. A serendipitous finding showed a positive relationship between the ability of children to wait and their production and accurate use of temporal terms, which was more pronounced in girls than boys. This finding may be an indication that a higher temporal vocabulary is linked to a continuous representation of the self in time, facilitating a child’s representation of the future-self receiving a larger reward than what the present-self could receive. PMID:25737814
White, Michael J; Harmel, R Daren; Arnold, Jeff G; Williams, Jimmy R
2014-01-01
The Soil and Water Assessment Tool (SWAT) is a basin-scale hydrologic model developed by the United States Department of Agriculture Agricultural Research Service. SWAT's broad applicability, user-friendly model interfaces, and automatic calibration software have led to a rapid increase in the number of new users. These advancements also allow less experienced users to conduct SWAT modeling applications. In particular, the use of automated calibration software may produce simulated values that appear appropriate because they adequately mimic measured data used in calibration and validation. Autocalibrated model applications (and often those of unexperienced modelers) may contain input data errors and inappropriate parameter adjustments not readily identified by users or the autocalibration software. The objective of this research was to develop a program to assist users in the identification of potential model application problems. The resulting "SWAT Check" is a stand-alone Microsoft Windows program that (i) reads selected SWAT output and alerts users of values outside the typical range; (ii) creates process-based figures for visualization of the appropriateness of output values, including important outputs that are commonly ignored; and (iii) detects and alerts users of common model application errors. By alerting users to potential model application problems, this software should assist the SWAT community in developing more reliable modeling applications. Copyright © by the American Society of Agronomy, Crop Science Society of America, and Soil Science Society of America, Inc.
Klapisch, M.; Bar-Shalom, A.
1997-12-01
Busquet's RADIOM model for effective ionization temperature Tz is an appealing and simple way to introduce non LTE effects in hydrocodes. The authors report checking the validity of RADIOM in the optically thin case by comparison with two collisional radiative models, MICCRON (level-by-level) for C and Al and SCROLL (superconfiguration- by-superconfiguration) for Lu and Au. MICCRON is described in detail. The agreement between the average ion charge >ZBusquet is very good in most cases. There is however room for improvement when the departure from LTE is more pronounced for heavy atoms and for emissivity. Improvement appears possible because the concept of ionization temperature seems to hold in a broader range of parameters.
A Formal Approach for RT-DVS Algorithms Evaluation Based on Statistical Model Checking
Shengxin Dai
2015-01-01
Full Text Available Energy saving is a crucial concern in embedded real time systems. Many RT-DVS algorithms have been proposed to save energy while preserving deadline guarantees. This paper presents a novel approach to evaluate RT-DVS algorithms using statistical model checking. A scalable framework is proposed for RT-DVS algorithms evaluation, in which the relevant components are modeled as stochastic timed automata, and the evaluation metrics including utilization bound, energy efficiency, battery awareness, and temperature awareness are expressed as statistical queries. Evaluation of these metrics is performed by verifying the corresponding queries using UPPAAL-SMC and analyzing the statistical information provided by the tool. We demonstrate the applicability of our framework via a case study of five classical RT-DVS algorithms.
Yamaguchi, Hiroshi; Hongo, Syozo; Takeshita, Hiroshi
1990-01-01
We have developed Japanese phantoms in two procedures for computation of organ doses exposed to internal and/or external radiation sources. One method is to make mathematical phantoms on the basis of ORNL mathematical phantoms. Parameters to specify organs of Japanese mathematical phantom are determined by interpolations of the ORNL data, which define the organs of Caucasian males and females of various ages, i.e. new born, 1, 5, 10, 15 years and adult, with survey data for Japanese physiques. Another procedure is to build 'symbol phantoms' for the Japanese public. The concept and its method of the symbol phantom enables us to make a phantom for an individual when we have all of his transversal section images obtained by a medical imaging device like MRI, and thus we may achieve more realistic phantoms for Japanese public than the mathematical phantoms. Both studies are in progress in NIRS. (author)
Enabling model checking for collaborative process analysis: from BPMN to `Network of Timed Automata'
Mallek, Sihem; Daclin, Nicolas; Chapurlat, Vincent; Vallespir, Bruno
2015-04-01
Interoperability is a prerequisite for partners involved in performing collaboration. As a consequence, the lack of interoperability is now considered a major obstacle. The research work presented in this paper aims to develop an approach that allows specifying and verifying a set of interoperability requirements to be satisfied by each partner in the collaborative process prior to process implementation. To enable the verification of these interoperability requirements, it is necessary first and foremost to generate a model of the targeted collaborative process; for this research effort, the standardised language BPMN 2.0 is used. Afterwards, a verification technique must be introduced, and model checking is the preferred option herein. This paper focuses on application of the model checker UPPAAL in order to verify interoperability requirements for the given collaborative process model. At first, this step entails translating the collaborative process model from BPMN into a UPPAAL modelling language called 'Network of Timed Automata'. Second, it becomes necessary to formalise interoperability requirements into properties with the dedicated UPPAAL language, i.e. the temporal logic TCTL.
Verification of communication protocols in web services model-checking service compositions
Tari, Zahir; Mukherjee, Anshuman
2014-01-01
Gathers recent advancements in the field of self-organizing wireless sensor networks and provides readers with the essential, state-of-the-art information about sensor networking. In the near future, wireless sensor networks will become an integral part of our day-to-day life. To solve different sensor networking related issues, researchers have put a great deal of effort into coming up with innovative ideas. Verification of Communication Protocols in Web Services: Model-Checking Service Compositions gathers recent advancements in the field of self-organizing wireless sensor networks and provides readers with integral information about sensor networking. It introduces current technological trends, particularly in node organization, and provides implementation details of each networking type to help readers set up sensor networks in their related job fields. In addition, it identifies the limitations of current technologies, as well as future research directions.
Borst, J.P.; Taatgen, N.A.; Van Rijn, D.H.
2011-01-01
In this paper, a model-based analysis method for fMRI is used with a high-level symbolic process model. Participants performed a triple-task in which intermediate task information needs to be updated frequently. Previous work has shown that the associated resource - the problem state resource - acts
Fluid Petri Nets and hybrid model-checking: a comparative case study
Gribaudo, M.; Horvath, A.; Bobbio, A.; Tronci, E.; Ciancamerla, E.; Minichino, M.
2003-01-01
The modeling and analysis of hybrid systems is a recent and challenging research area which is actually dominated by two main lines: a functional analysis based on the description of the system in terms of discrete state (hybrid) automata (whose goal is to ascertain conformity and reachability properties), and a stochastic analysis (whose aim is to provide performance and dependability measures). This paper investigates a unifying view between formal methods and stochastic methods by proposing an analysis methodology of hybrid systems based on Fluid Petri Nets (FPNs). FPNs can be analyzed directly using appropriate tools. Our paper shows that the same FPN model can be fed to different functional analyzers for model checking. In order to extensively explore the capability of the technique, we have converted the original FPN into languages for discrete as well as hybrid as well as stochastic model checkers. In this way, a first comparison among the modeling power of well known tools can be carried out. Our approach is illustrated by means of a 'real world' hybrid system: the temperature control system of a co-generative plant
Alternate symbol inversion for improved symbol synchronization in convolutionally coded systems
Simon, M. K.; Smith, J. G.
1980-01-01
Inverting alternate symbols of the encoder output of a convolutionally coded system provides sufficient density of symbol transitions to guarantee adequate symbol synchronizer performance, a guarantee otherwise lacking. Although alternate symbol inversion may increase or decrease the average transition density, depending on the data source model, it produces a maximum number of contiguous symbols without transition for a particular class of convolutional codes, independent of the data source model. Further, this maximum is sufficiently small to guarantee acceptable symbol synchronizer performance for typical applications. Subsequent inversion of alternate detected symbols permits proper decoding.
Pires, Luis F.G.; Barreto, Claudio V.; Sarmento, Renata C. [Pontificia Univ. Catolica do Rio de Janeiro, RJ (Brazil). Dept. de Engenharia Mecanica. Nucleo de Simulacao Termohidraulica de Dutos (SIMDUT)
2005-07-01
As usual a shipping terminal contains a header and its diameter is smaller than the main pipeline diameter. This diameter reduction amplifies the effects caused by hydraulic transients. It was noticed during simulations that check valves without dynamic modeling may introduce some error in the maximum pressure results without a dynamic model approach. The current paper uses commercial pipeline simulation software to model the dynamic behavior of the check valves. It was studied the header diameter influence and how the check valve model type may change the maximum pressure in the pipeline. It was proved that even a pipeline that works with low pressure and small elevation drop needs a detailed valve modeling to prevent the calculation of unreal pressure values in the region with diameter reduction. (author)
Symbolic Analysis of the Cycle-to-Cycle Variability of a Gasoline–Hydrogen Fueled Spark Engine Model
Israel Reyes-Ramírez
2018-04-01
Full Text Available An study of temporal organization of the cycle-to-cycle variability (CCV in spark ignition engines fueled with gasoline–hydrogen blends is presented. First, long time series are generated by means of a quasi-dimensional model incorporating the key chemical and physical components, leading to variability in the time evolution of energetic functions. The alterations in the combustion process, for instance the composition of reactants, may lead to quantitative changes in the time evolution of the main engine variables. It has been observed that the presence of hydrogen in the fuel mixture leads to an increased laminar flame speed, with a corresponding decrease in CCV dispersion. Here, the effects of different hydrogen concentrations in the fuel are considered. First, it is observed that return maps of heat release sequences exhibit different patterns for different hydrogen concentrations and fuel–air ratios. Second, a symbolic analysis is used to characterize time series. The symbolic method is based on the probability of occurrence of consecutive states (a word in a symbolic sequence histogram (SSH. Modified Shannon entropy is computed in order to determine the adequate word length. Results reveal the presence of non-random patterns in the sequences and soft transitions between states. Moreover, the general behavior of CCV simulations results and three types of synthetic noises: white, log-normal, and a noisy logistic map, are compared. This analysis reveals that the non-random features observed in heat release sequences are quite different from synthetic noises.
Fukui, Hirokazu; Yoshida, Michio; Yamaura, Kazuho
2000-01-01
For those who run an organization, it is critical to identify the causal relationship between the organization's characteristics and the safety-checking action of its staff, in order to effectively implement activities for promoting safety. In this research. a causal model of the safety-checking action was developed and factors affecting it were studied. A questionnaire survey, which includes safety awareness, attitude toward safety, safety culture and others, was conducted at three nuclear power plants and eight factors were extracted by means of factor analysis of the questionnaire items. The extracted eight interrelated factors were as follows: work norm, supervisory action, interest in training, recognition of importance, safety-checking action, the subject of safety, knowledge/skills, and the attitude of an organization. Among them, seven factors except the recognition of importance were defined as latent variables and a causal model of safety-checking action was constructed. By means of covariance structure analysis, it was found that the three factors: the attitude of an organization, supervisory action and the subject of safety, have a significant effect on the safety-checking action. Moreover, it was also studied that workplaces in which these three factors are highly regarded form social environment where safety-checking action is fully supported by the workplace as a whole, while workplaces in which these three factors are poorly regarded do not fully form social environment where safety-checking action is supported. Therefore, the workplaces form an organizational environment where safety-checking action tends to depend strongly upon the knowledge or skills of individuals. On top of these, it was noted that the attitude of an organization and supervisory action are important factors that serve as the first trigger affecting the formation of the organizational climate for safety. (author)
Fukui, Hirokazu [Institute of Nuclear Safety System Inc., Seika, Kyoto (Japan); Yoshida, Michio; Yamaura, Kazuho [Japan Institute for Group Dynamics, Fukuoka (Japan)
2000-09-01
For those who run an organization, it is critical to identify the causal relationship between the organization's characteristics and the safety-checking action of its staff, in order to effectively implement activities for promoting safety. In this research. a causal model of the safety-checking action was developed and factors affecting it were studied. A questionnaire survey, which includes safety awareness, attitude toward safety, safety culture and others, was conducted at three nuclear power plants and eight factors were extracted by means of factor analysis of the questionnaire items. The extracted eight interrelated factors were as follows: work norm, supervisory action, interest in training, recognition of importance, safety-checking action, the subject of safety, knowledge/skills, and the attitude of an organization. Among them, seven factors except the recognition of importance were defined as latent variables and a causal model of safety-checking action was constructed. By means of covariance structure analysis, it was found that the three factors: the attitude of an organization, supervisory action and the subject of safety, have a significant effect on the safety-checking action. Moreover, it was also studied that workplaces in which these three factors are highly regarded form social environment where safety-checking action is fully supported by the workplace as a whole, while workplaces in which these three factors are poorly regarded do not fully form social environment where safety-checking action is supported. Therefore, the workplaces form an organizational environment where safety-checking action tends to depend strongly upon the knowledge or skills of individuals. On top of these, it was noted that the attitude of an organization and supervisory action are important factors that serve as the first trigger affecting the formation of the organizational climate for safety. (author)
Checking the Adequacy of Fit of Models from Split-Plot Designs
Almini, A. A.; Kulahci, Murat; Montgomery, D. C.
2009-01-01
models. In this article, we propose the computation of two R-2, R-2-adjusted, prediction error sums of squares (PRESS), and R-2-prediction statistics to measure the adequacy of fit for the WP and the SP submodels in a split-plot design. This is complemented with the graphical analysis of the two types......One of the main features that distinguish split-plot experiments from other experiments is that they involve two types of experimental errors: the whole-plot (WP) error and the subplot (SP) error. Taking this into consideration is very important when computing measures of adequacy of fit for split-plot...... of errors to check for any violation of the underlying assumptions and the adequacy of fit of split-plot models. Using examples, we show how computing two measures of model adequacy of fit for each split-plot design model is appropriate and useful as they reveal whether the correct WP and SP effects have...
A Directed Acyclic Graph-Large Margin Distribution Machine Model for Music Symbol Classification.
Cuihong Wen
Full Text Available Optical Music Recognition (OMR has received increasing attention in recent years. In this paper, we propose a classifier based on a new method named Directed Acyclic Graph-Large margin Distribution Machine (DAG-LDM. The DAG-LDM is an improvement of the Large margin Distribution Machine (LDM, which is a binary classifier that optimizes the margin distribution by maximizing the margin mean and minimizing the margin variance simultaneously. We modify the LDM to the DAG-LDM to solve the multi-class music symbol classification problem. Tests are conducted on more than 10000 music symbol images, obtained from handwritten and printed images of music scores. The proposed method provides superior classification capability and achieves much higher classification accuracy than the state-of-the-art algorithms such as Support Vector Machines (SVMs and Neural Networks (NNs.
A Directed Acyclic Graph-Large Margin Distribution Machine Model for Music Symbol Classification.
Wen, Cuihong; Zhang, Jing; Rebelo, Ana; Cheng, Fanyong
2016-01-01
Optical Music Recognition (OMR) has received increasing attention in recent years. In this paper, we propose a classifier based on a new method named Directed Acyclic Graph-Large margin Distribution Machine (DAG-LDM). The DAG-LDM is an improvement of the Large margin Distribution Machine (LDM), which is a binary classifier that optimizes the margin distribution by maximizing the margin mean and minimizing the margin variance simultaneously. We modify the LDM to the DAG-LDM to solve the multi-class music symbol classification problem. Tests are conducted on more than 10000 music symbol images, obtained from handwritten and printed images of music scores. The proposed method provides superior classification capability and achieves much higher classification accuracy than the state-of-the-art algorithms such as Support Vector Machines (SVMs) and Neural Networks (NNs).
Symbolic Time Separation of Events
Amon, Tod; Hulgaard, Henrik
1999-01-01
We extend the TSE~\\cite{Hulgaard95} timing analysis algorithm into the symbolic domain, that is, we allow symbolic variables to be used to specify unknown parameters of the model (essentially, unknown delays) and verification algorithms which are capable of identifying not just failure or success...
Herbert, L.T.; Hansen, Z.N.L.
2016-01-01
This paper presents a framework for the automated restructuring of stochastic workflows to reduce the impact of faults. The framework allows for the modelling of workflows by means of a formalised subset of the BPMN workflow language. We extend this modelling formalism to describe faults and incorporate an intention preserving stochastic semantics able to model both probabilistic- and non-deterministic behaviour. Stochastic model checking techniques are employed to generate the state-space of a given workflow. Possible improvements obtained by restructuring are measured by employing the framework's capacity for tracking real-valued quantities associated with states and transitions of the workflow. The space of possible restructurings of a workflow is explored by means of an evolutionary algorithm, where the goals for improvement are defined in terms of optimising quantities, typically employed to model resources, associated with a workflow. The approach is fully automated and only the modelling of the production workflows, potential faults and the expression of the goals require manual input. We present the design of a software tool implementing this framework and explore the practical utility of this approach through an industrial case study in which the risk of production failures and their impact are reduced by restructuring the workflow. - Highlights: • We present a framework which allows for the automated restructuring of workflows. • This framework seeks to minimise the impact of errors on the workflow. • We illustrate a scalable software implementation of this framework. • We explore the practical utility of this approach through an industry case. • The impact of errors can be substantially reduced by restructuring the workflow.
Simulation Modeling of a Check-in and Medication Reconciliation Ambulatory Clinic Kiosk
Blake Lesselroth
2011-01-01
Full Text Available Gaps in information about patient medication adherence may contribute to preventable adverse drug events and patient harm. Hence, health-quality advocacy groups, including the Joint Commission, have called for the implementation of standardized processes to collect and compare patient medication lists. This manuscript describes the implementation of a self-service patient kiosk intended to check in patients for a clinic appointment and collect a medication adherence history, which is then available through the electronic health record. We used business process engineering and simulation modeling to analyze existing workflow, evaluate technology impact on clinic throughput, and predict future infrastructure needs. Our empiric data indicated that a multi-function healthcare kiosk offers a feasible platform to collect medical history data. Furthermore, our simulation model showed a non-linear association between patient arrival rate, kiosk number, and estimated patient wait times. This study provides important data to help administrators and healthcare executives predict infrastructure needs when considering the use of self-service kiosks.
Upton, H.A.; Garcia, P.
1999-08-24
A check valve for use in a GDCS of a nuclear reactor and having a motor driven disk including a rotatable armature for rotating the check valve disk over its entire range of motion is described. In one embodiment, the check valve includes a valve body having a coolant flow channel extending therethrough. The coolant flow channel includes an inlet end and an outlet end. A valve body seat is located on an inner surface of the valve body. The check valve further includes a disk assembly, sometimes referred to as the motor driven disc, having a counterweight and a disk shaped valve. The disk valve includes a disk base having a seat for seating with the valve body seat. The disk assembly further includes a first hinge pin member which extends at least partially through the disk assembly and is engaged to the disk. The disk valve is rotatable relative to the first hinge pin member. The check valve also includes a motor having a stator frame with a stator bore therein. An armature is rotatably positioned within the stator bore and the armature is coupled to the disk valve to cause the disk valve to rotate about its full range of motion. 5 figs.
Upton, H.A.; Garcia, P.
1999-01-01
A check valve for use in a GDCS of a nuclear reactor and having a motor driven disk including a rotatable armature for rotating the check valve disk over its entire range of motion is described. In one embodiment, the check valve includes a valve body having a coolant flow channel extending therethrough. The coolant flow channel includes an inlet end and an outlet end. A valve body seat is located on an inner surface of the valve body. The check valve further includes a disk assembly, sometimes referred to as the motor driven disc, having a counterweight and a disk shaped valve. The disk valve includes a disk base having a seat for seating with the valve body seat. The disk assembly further includes a first hinge pin member which extends at least partially through the disk assembly and is engaged to the disk. The disk valve is rotatable relative to the first hinge pin member. The check valve also includes a motor having a stator frame with a stator bore therein. An armature is rotatably positioned within the stator bore and the armature is coupled to the disk valve to cause the disk valve to rotate about its full range of motion. 5 figs
Norman, Laura M.; Niraula, Rewati
2016-01-01
The objective of this study was to evaluate the effect of check dam infrastructure on soil and water conservation at the catchment scale using the Soil and Water Assessment Tool (SWAT). This paired watershed study includes a watershed treated with over 2000 check dams and a Control watershed which has none, in the West Turkey Creek watershed, Southeast Arizona, USA. SWAT was calibrated for streamflow using discharge documented during the summer of 2013 at the Control site. Model results depict the necessity to eliminate lateral flow from SWAT models of aridland environments, the urgency to standardize geospatial soils data, and the care for which modelers must document altering parameters when presenting findings. Performance was assessed using the percent bias (PBIAS), with values of ±2.34%. The calibrated model was then used to examine the impacts of check dams at the Treated watershed. Approximately 630 tons of sediment is estimated to be stored behind check dams in the Treated watershed over the 3-year simulation, increasing water quality for fish habitat. A minimum precipitation event of 15 mm was necessary to instigate the detachment of soil, sediments, or rock from the study area, which occurred 2% of the time. The resulting watershed model is useful as a predictive framework and decision-support tool to consider long-term impacts of restoration and potential for future restoration.
Vester, Steen
2015-01-01
We study the complexity of the model-checking problem for the branching-time logic CTL ∗ and the alternating-time temporal logics ATL/ATL ∗ in one-counter processes and one-counter games respectively. The complexity is determined for all three logics when integer weights are input in unary (non...
Kennedy, William G; Trafton, J. G
2007-01-01
What are the characteristics of long-term learning? We investigated the characteristics of long-term, symbolic learning using the Soar and ACT-R cognitive architectures running cognitive models of two simple tasks...
Towards Symbolic Encryption Schemes
Ahmed, Naveed; Jensen, Christian D.; Zenner, Erik
2012-01-01
, namely an authenticated encryption scheme that is secure under chosen ciphertext attack. Therefore, many reasonable encryption schemes, such as AES in the CBC or CFB mode, are not among the implementation options. In this paper, we report new attacks on CBC and CFB based implementations of the well......Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security models. In its common use, encryption on a whole message is specified as a single monolithic block. From a cryptographic perspective, however, this may require a resource-intensive cryptographic algorithm......-known Needham-Schroeder and Denning-Sacco protocols. To avoid such problems, we advocate the use of refined notions of symbolic encryption that have natural correspondence to standard cryptographic encryption schemes....
Facchini, F
2000-12-01
The aptitude for symbolization, characteristic of man, is revealed not only in artistic representations and funerary practices. It is exhibited by every manifestation of human activity or representation of natural phenomena that assumes or refers to a meaning. We can recognize functional symbolism (tool-making, habitative or food technology), social symbolism, (language and social communication) and spiritual symbolism (funerary practices and artistic expressions). On the basis of these concepts, research into symbolism in prehistoric man allows us to recognize forms of symbolism already in the manifestations of the most ancient humans, starting with Homo habilis (or rudolfensis). Toolmaking, social organization and organization of the territory are oriented toward survival and the life of the family group. They attest to symbolic behaviors and constitute symbolic systems by means of which man expresses himself, lives and transmits his symbolic world. The diverse forms of symbolism are discussed with reference to the different phases of prehistoric humanity.
Neuhaus, Thorsten; Schaffrath, Andreas
2009-01-01
In this contribution the analysis and calculation of a compensator burst after a pump start and check valve slam with the pressure surge code DYVRO mod. 3 are presented. The compensator burst occurred in the essential service water system (ESWS) of a pressurized water reactor (PWR) in a deviant operation mode. Due to lack of knowledge about the causes a systematic investigation has been performed by TUV NORD SysTec GmbH and Co. KG. The following scenario was identified as most likely: Because of maintenance a heat exchanger was shut off from the ESWS by a closed valve. Due to the hydrostatic pressure profile air had been sucked in through this leaky closed valve forming an air bubble. After the pump start the water was accelerated against the closed valve where the air bubble was compressed. The subsequent backflow resulted in a fast closing of a check valve and a pressure surge that caused the compensator burst. Calculations have been performed with the self developed and validated pressure surge computer code DYVRO mod. 3. The present paper is focussed on the modelling of the pipe system, the pump, the check valve and the behaviour of the air bubble as well as the simulation of the incident. The calculated maximum pressure in the ESWS is above 3 MPa, which is approx. four times higher than the design pressure of 0.7 MPa. This pressure increase has led most likely to the abrupt compensator failure. (author)
Model-based problem solving through symbolic regression via pareto genetic programming
Vladislavleva, E.
2008-01-01
Pareto genetic programming methodology is extended by additional generic model selection and generation strategies that (1) drive the modeling engine to creation of models of reduced non-linearity and increased generalization capabilities, and (2) improve the effectiveness of the search for robust
Nuclear reactors; graphical symbols
1987-11-01
This standard contains graphical symbols that reveal the type of nuclear reactor and is used to design graphical and technical presentations. Distinguishing features for nuclear reactors are laid down in graphical symbols. (orig.) [de
Katie Ovens
2012-01-01
Full Text Available Introduction: Delta checks use two specimen test results taken in succession in order to detect test result changes greater than expected physiological variation. One of the most common and serious errors detected by delta checks is specimen mix-up errors. The positive and negative predictive values of delta checks for detecting specimen mix-up errors, however, are largely unknown. Materials and Methods: We addressed this question by first constructing a stochastic dynamic model using repeat test values for five analytes from approximately 8000 inpatients in Calgary, Alberta, Canada. The analytes examined were sodium, potassium, chloride, bicarbonate, and creatinine. The model simulated specimen mix-up errors by randomly switching a set number of pairs of second test results. Sensitivities and specificities were then calculated for each analyte for six combinations of delta check equations and cut-off values from the published literature. Results: Delta check specificities obtained from this model ranged from 50% to 99%; however the sensitivities were generally below 20% with the exception of creatinine for which the best performing delta check had a sensitivity of 82.8%. Within a plausible incidence range of specimen mix-ups the positive predictive values of even the best performing delta check equation and analyte became negligible. Conclusion: This finding casts doubt on the ongoing clinical utility of delta checks in the setting of low rates of specimen mix-ups.
Physical modelling of sediment transport in mountain torrents upstream of open check dams
Schwindt, Sebastian; Franca, Mario J.; Schleiss, Anton J.
2015-04-01
Dynamic morphological processes in mountain torrents do not only attract the attention of many contemporary researchers, but are also a relevant issue for the design of flood protection measures in the downstream sections where dwellers may be threatened by the important potential of flows with high concentration of sediments. Events which have a morphodynamic effect are simulated at the Laboratory of Hydraulic Constructions (LCH) in order to optimize the design of a flood protection measure, notably open check dams. Different scenarios with a fix bed consisting of boulders as well as mobile beds are studied and the influence of flow constrictions, i.e. distinct geometric configurations of open check dams are analysed. Three varying water pumped discharges in the order of 5 to 20 l/s are tested with progressively increasing solid discharges of 1, 3 and 6 % of the liquid discharge according to the transport capacity. The moistened sediments are introduced via a system of conveyor belts and are then mixed with the liquid discharge in an about 3 m long rough trapezoidal channel with a base width of 24 cm. The mean diameter Dm of the injected sediments is 0.86 cm and the dimensionless grain size distribution is in line with a normalized shape derived from over 60 streams in the Alps. A wide range of frequent floods in morphologically diverging types of mountain torrents is covered, in particular regarding the sediment availability in the catchment area and along the river. A basic assumption here is considering that the frequent floods are floods with return periods between 1 to 5 years and are the most important process in terms of amounts of sediment transport. This may be arguable for some mountain torrents and landscape effective processes which are driven by floods with return periods of more than several decades. In order to identify benchmarks for hydraulic parameters which lead to the obstruction of flow restrictions at mountain torrents, the water depth is
Cătălin Dima
2010-06-01
Full Text Available We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of cooperation between members of the coalition in which agents issue their actions based on the distributed knowledge, for that coalition, of the system history. We show that model-checking is decidable for this logic. The technique utilizes two variants of games with imperfect information and partially observable objectives, as well as a subset construction for identifying states whose histories are indistinguishable to the considered coalition.
Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete
Laura Bozzelli
2016-09-01
Full Text Available In the plethora of fragments of Halpern and Shoham's modal logic of time intervals (HS, the logic AB of Allen's relations Meets and Started-by is at a central position. Statements that may be true at certain intervals, but at no sub-interval of them, such as accomplishments, as well as metric constraints about the length of intervals, that force, for instance, an interval to be at least (resp., at most, exactly k points long, can be expressed in AB. Moreover, over the linear order of the natural numbers N, it subsumes the (point-based logic LTL, as it can easily encode the next and until modalities. Finally, it is expressive enough to capture the ω-regular languages, that is, for each ω-regular expression R there exists an AB formula Φ such that the language defined by R coincides with the set of models of Φ over N. It has been shown that the satisfiability problem for AB over N is EXPSPACE-complete. Here we prove that, under the homogeneity assumption, its model checking problem is Δ^p_2 = P^NP-complete (for the sake of comparison, the model checking problem for full HS is EXPSPACE-hard, and the only known decision procedure is nonelementary. Moreover, we show that the modality for the Allen relation Met-by can be added to AB at no extra cost (AA'B is P^NP-complete as well.
Neumann, U.; Puzalowski, R.; Grimm, I.
1985-01-01
Numerical valve models for simulation of selfactuating safety valves and damped check valves are introduced for the computer programs TRAC-PF1 and ROLAST. As examples of application post-test calculations and stability analysis are given. (orig.)
Wahyu Budi Wicaksono
2017-08-01
Full Text Available The purpose of this research was to know the effectiveness of Pair Checks cooperative model towards students’ learning result and learning motivation of eight grade. Population of this research were students of eight grade Junior High School 2 Pati in the academic year 2016/1017. The research used cluster random sampling technique.Where the selected samples were students of class VIII H as experimental class and class VIII G as control class. The data collected by the method of documentation, test methods, and scale methods. The analyzed of data used completeness test and average different test. The results showed that: (1 students’ learning result who join Pair Checks cooperative model have classical study completeness; (2 students’ mathematics learning result who join Pair Checks cooperative model is better than students mathematics learning result who join ekspository learning; (3 students’ learning motivation who join Pair Checks cooperative model is better than students’ learning motivation who join ekspository learning.
2010-01-01
...-case holds) C-19Notice at automated teller machines C-20Notice at automated teller machines (delayed... would like a list of the routing numbers for these institutions. C-9—Automated Teller Machine Deposits (Extended Hold) Deposits at Automated Teller Machines Funds from any deposits (cash or checks) made at...
Modeling and simulation in inquiry learning: Checking solutions and giving intelligent advice
Bravo, C.; van Joolingen, W.R.; de Jong, T.
2006-01-01
Inquiry learning is a didactic approach in which students acquire knowledge and skills through processes of theory building and experimentation. Computer modeling and simulation can play a prominent role within this approach. Students construct representations of physical systems using modeling.
Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N
2015-04-28
Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.
A Model-Based Framework for Legal Policy Simulation and Compliance Checking
Soltana, Ghanem
2017-01-01
Information systems implementing requirements from laws and regulations, such as taxes and social benefits, need to be thoroughly verified to demonstrate their compliance. Several Verification and Validation (V&V) techniques, such as reliability testing, and modeling and simulation, can be used for assessing that such systems meet their legal. Typically, one has to model the expected (legal) behavior of the system in a form that can be executed (simulated), subject the resulting models and th...
Learning and Model-checking Networks of I/O Automata
Mao, Hua; Jaeger, Manfred
2012-01-01
We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can...... learn generic models for network entities in the form of automata templates. As is characteristic for SRL techniques, the abstraction level aorded by learning generic templates enables one to apply the learned model to new domains. A main benet of learning models based on nite automata lies in the fact...
Logic Model Checking of Time-Periodic Real-Time Systems
Florian, Mihai; Gamble, Ed; Holzmann, Gerard
2012-01-01
In this paper we report on the work we performed to extend the logic model checker SPIN with built-in support for the verification of periodic, real-time embedded software systems, as commonly used in aircraft, automobiles, and spacecraft. We first extended the SPIN verification algorithms to model priority based scheduling policies. Next, we added a library to support the modeling of periodic tasks. This library was used in a recent application of the SPIN model checker to verify the engine control software of an automobile, to study the feasibility of software triggers for unintended acceleration events.
Abrahart, R. J.; Beriro, D. J.
2012-04-01
The information content in a rainfall-runoff record is sufficient to support models of only very limited complexity (Jakeman and Hornberger, 1993). This begs the question of what limits should observed data place on the allowable complexity of rainfall-runoff models? Eureqa1 (Schmidt and Lipson, 2009) - pronounced "eureka" - is a software tool for finding equations and detecting mathematical relationships in a dataset. The challenge, for both software and modeller, is to identify, by means of symbolic regression, the simplest mathematical formulas which describe the underlying mechanisms that produced the data. It actually delivers, however, a series of preferred modelling solutions comprising one champion for each specific level of complexity i.e. related to solution enlargement involving the progressive incorporation of additional permitted factors (internal operators/ external drivers). The potential benefit of increased complexity can as a result be assessed in a rational manner. Eureqa is free to download and use; and, in the current study, has been employed to construct a set of rainfall-runoff transfer function models for the Annapolis River at Wilmot, in north-western Nova Scotia, Canada. The climatic conditions in this catchment present an interesting set of modelling challenges; daily variations and seasonal changes in temperature, snowfall and retention result in great difficulty for runoff prediction by means of a data-driven approach. Data from 10 years of daily observations are used in the present study (01/01/2000-31/12/2009): comprising [i] discharge, [ii] total rainfall (excluding snowfall), [iii] total snowfall, [iv] thickness of snow cover, and [v] maximum and [vi] minimum temperature. Precipitation occurs throughout the whole year being slightly lower during summer. Snowfall is common from November until April and rare hurricane weather may occur in autumn. The average maximum temperature is below 0 0C in January and February, but significant
Demichev, A.; Kryukov, A.; Rodionov, A.
2002-01-01
We propose an XML-based standard for formulation of field theoretical models. The goal of creation of such a standard is to provide a way for an unambiguous exchange and cross-checking of results of computer calculations in high energy physics. At the moment, the suggested standard implies that models under consideration are of the SM or MSSM type (i.e., they are just SM or MSSM, their submodels, smooth modifications or straightforward generalizations). (author)
Automated evolutionary restructuring of workflows to minimise errors via stochastic model checking
Herbert, Luke Thomas; Hansen, Zaza Nadja Lee; Jacobsen, Peter
2014-01-01
This paper presents a framework for the automated restructuring of workflows that allows one to minimise the impact of errors on a production workflow. The framework allows for the modelling of workflows by means of a formalised subset of the Business Process Modelling and Notation (BPMN) language...
Herbert, Luke Thomas; Hansen, Zaza Nadja Lee
2016-01-01
This article presents a framework for the automated restructuring of stochastic workflows to reduce the impact of faults. The framework allows for the modelling of workflows by means of a formalised subset of the BPMN workflow language. We extend this modelling formalism to describe faults...
K.C. , Santosh; Wendling , Laurent
2015-01-01
International audience; The chapter focuses on one of the key issues in document image processing i.e., graphical symbol recognition. Graphical symbol recognition is a sub-field of a larger research domain: pattern recognition. The chapter covers several approaches (i.e., statistical, structural and syntactic) and specially designed symbol recognition techniques inspired by real-world industrial problems. It, in general, contains research problems, state-of-the-art methods that convey basic s...
Scalable and Accurate SMT-Based Model Checking of Data Flow Systems
2013-10-31
of variable x is always less than that of variable y) can be represented in this theory. • A theory of inductive datatypes . Modeling software... datatypes can be done directly in this theory. • A theory of arrays. Software that uses arrays can be modeled with constraints in this theory, as can...Arithmetic (and specialized fragments) Arrays Inductive datatypes Bit-vectors Uninterpreted functions SMT Engine Input interfaces FEATURES Support for
Koesling, Jens
2010-06-15
We introduce a novel method to determine 6j-symbols of quantum groups. This method is inspired by the methods used in the determination of fusing matrices of WZNW models. With this method we determine the 6j-symbols of the quantum group U{sub q}sl(2) and the super quantum group U{sub q}osp(1 vertical stroke 2). We present the 6j-symbols as a recurrence relation and its initial values. The 6j-symbols transform between the s-channel and the u-channel decomposition of the invariants of the four-fold tensor product of modules of a quantum group. These invariants fulfil certain difference equations. We set one of the representations in the invariant to the fundamental representation, and deduce a system of linear equations for the initial values of the recurrence relation determining the 6j-symbols. (orig.)
Trimboli, Angela
This document argues that the Statue of Liberty has a lot to offer teachers who need to teach citizenship to elementary students. Among the symbols within the statue that have relevance to citizenship are: (1) the tablet; (2) the chains; (3) the step from the chains; () the torch; (5) the crown; (6) the face; and (7) the new infrastructure. The…
A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking
Jacobsen, Lasse; Jacobsen, Morten; Møller, Mikael Harkjær
2010-01-01
Many formal translations between time dependent models have been proposed over the years. While some of them produce timed bisimilar models, others preserve only reachability or (weak) trace equivalence. We suggest a general framework for arguing when a translation preserves Timed Computation Tree...... Logic (TCTL) or its safety fragment.The framework works at the level of timed transition systems, making it independent of the modeling formalisms and applicable to many of the translations published in the literature. Finally, we present a novel translation from extended Timed-Arc Petri Nets...... to Networks of Timed Automata and using the framework argue that itpreserves the full TCTL. The translation has been implemented in the verification tool TAPAAL....
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
Arrahman, Yehia Abd; Andric, Marina; Beggiato, Alessandro
2014-01-01
to the state space explosion. Several techniques have been proposed to mitigate those problems so to make verification under relaxed memory models feasible. We discuss how to adopt some of those techniques in a Maude-based approach to language prototyping, and suggest the use of other techniques that have been......Relaxed memory models offer suitable abstractions of the actual optimizations offered by multi-core architectures and by compilers of concurrent programming languages. Using such abstractions for verification purposes is challenging in part due to their inherent non-determinism which contributes...
Gladchenkov, E V; Kolyubin, V A; Nedosekin, P G; Zaharchenko, K V; Ibragimov, R F; Kadilin, V V; Tyurin, E M
2017-01-01
Were conducted a series of experiments, the purpose of which had to verify the mathematical model of the radiation environment sensor. Theoretical values of the beta particles count rate from 90 Sr - 90 Y source registered by radiation environment sensor was compared with the experimental one. Theoretical (calculated) count rate of beta particles was found with using the developed mathematical model of the radiation environment sensor. Deviation of the calculated values of the beta particle count rate does not exceed 10% from the experimental. (paper)
Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
Viesmose, Sine Lyhne; Jacobsen, Thomas Stig; Jensen, Jacob Jon
2014-01-01
can be considerably faster but it does not in general guarantee conclusive answers. We implement the algorithms within the open-source model checker TAPAAL and demonstrate on a number of experiments that our approximation techniques often result in a significant speed-up of the verification....
Addressing challenges in obtaining high coverage when model checking android applications
Botha, Heila-Marie
2017-07-01
Full Text Available -state-comparator and can be excluded from the state using JPF’s @FilterField annotation or other conguration options discussed in [5]. JPF-Android further optimizes state-matching by pre-loading all application classes and application specic models. It also rede...
Model checking a cache coherence protocol for a Java DSM implementation
J. Pang; W.J. Fokkink (Wan); R. Hofman (Rutger); R. Veldema
2007-01-01
textabstractJackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java's memory model and allows multithreaded Java programs to run unmodified on a distributed memory system. It employs a multiple-writer cache coherence
Model checking a cache coherence protocol of a Java DSM implementation
Pang, J.; Fokkink, W.J.; Hofman, R.; Veldema, R.S.
2007-01-01
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java's memory model and allows multithreaded Java programs to run unmodified on a distributed memory system. It employs a multiple-writer cache coherence protocol. In this paper,
Gindlesparger, Kathryn Johnson
2010-01-01
This ethnographic study argues that reciprocity--the attempt to equalize the power dynamics that occur in working relationships--is a way to counteract the widely-used but rarely-critiqued deficit models that dominate the nonprofit landscape. If community work is not done with a near constant attention to power dynamics, programming that is…
Brat, Guillaume P.; Martinie, Celia; Palanque, Philippe
2013-01-01
During early phases of the development of an interactive system, future system properties are identified (through interaction with end users in the brainstorming and prototyping phase of the application, or by other stakehold-ers) imposing requirements on the final system. They can be specific to the application under development or generic to all applications such as usability principles. Instances of specific properties include visibility of the aircraft altitude, speed… in the cockpit and the continuous possibility of disengaging the autopilot in whatever state the aircraft is. Instances of generic properties include availability of undo (for undoable functions) and availability of a progression bar for functions lasting more than four seconds. While behavioral models of interactive systems using formal description techniques provide complete and unambiguous descriptions of states and state changes, it does not provide explicit representation of the absence or presence of properties. Assessing that the system that has been built is the right system remains a challenge usually met through extensive use and acceptance tests. By the explicit representation of properties and the availability of tools to support checking these properties, it becomes possible to provide developers with means for systematic exploration of the behavioral models and assessment of the presence or absence of these properties. This paper proposes the synergistic use two tools for checking both generic and specific properties of interactive applications: Petshop and Java PathFinder. Petshop is dedicated to the description of interactive system behavior. Java PathFinder is dedicated to the runtime verification of Java applications and as an extension dedicated to User Interfaces. This approach is exemplified on a safety critical application in the area of interactive cockpits for large civil aircrafts.
Simulation-Based Model Checking for Nondeterministic Systems and Rare Events
2016-03-24
rounds of Monte Carlo sampling and Reinforcement Learning to improve the policy for nondeterminic choices with respect to satisfying a Bounded Linear ...computations for evaluating elementary functions in the Embedded GNU C Library [11]. For instance, the sine function can return values larger than 1053...Joint International Work- shop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification 9 Final Report, March 14, 2016
Symbolic Dynamics of Reanalysis Data
Larson, J. W.; Dickens, P. M.
2003-12-01
Symbolic dynamics1 is the study of sequences of symbols belonging to a discrete set of elements, the most commmon example being a sequence of ones and zeroes. Often the set of symbols is derived from a timeseries of a continuous variable through the introduction of a partition function--a process called symbolization. Symbolic dynamics has been used widely in the physical sciences; a geophysical example being the application of C1 and C2 complexity2 to hourly precipitation station data3. The C1 and C2 complexities are computed by examining subsequences--or words--of fixed length L in the limit of large values of L. Recent advances in information theory have led to techniques focused on the growth rate of the Shannon entropy and its asymptotic behavior in the limit of long words--levels of entropy convergence4. The result is a set of measures one can use to quantify the amount of memory stored in the sequence, whether or not an observer is able to synchronize to the sequence, and with what confidence it may be predicted. These techniques may also be used to uncover periodic behavior in the sequence. We are currently applying complexity theory and levels of entropy convergence to gridpoint timeseries from the NCAR/NCEP 50-year reanalysis5. Topics to be discussed include: a brief introduction to symbolic dynamics; a description of the partition function/symbolization strategy; a discussion of C1 and C2 complexity and entropy convergence rates and their utility; and example applications of these techniques to NCAR/NCEP 50-reanalyses gridpoint timeseries, resulting in maps of C1 and C2 complexities and entropy convergence rates. Finally, we will discuss how these results may be used to validate climate models. 1{Hao, Bai-Lin, Elementary Symbolic Dynamics and Chaos in Dissipative Systems, Wold Scientific, Singapore (1989)} 2{d'Alessandro, G. and Politi, A., Phys. Rev. Lett., 64, 1609-1612 (1990).} 3{Elsner, J. and Tsonis, A., J. Atmos. Sci., 50, 400-405 (1993).} 4
On the Verification of a WiMax Design Using Symbolic Simulation
Gabriela Nicolescu
2013-07-01
Full Text Available In top-down multi-level design methodologies, design descriptions at higher levels of abstraction are incrementally refined to the final realizations. Simulation based techniques have traditionally been used to verify that such model refinements do not change the design functionality. Unfortunately, with computer simulations it is not possible to completely check that a design transformation is correct in a reasonable amount of time, as the number of test patterns required to do so increase exponentially with the number of system state variables. In this paper, we propose a methodology for the verification of conformance of models generated at higher levels of abstraction in the design process to the design specifications. We model the system behavior using sequence of recurrence equations. We then use symbolic simulation together with equivalence checking and property checking techniques for design verification. Using our proposed method, we have verified the equivalence of three WiMax system models at different levels of design abstraction, and the correctness of various system properties on those models. Our symbolic modeling and verification experiments show that the proposed verification methodology provides performance advantage over its numerical counterpart.
'demoted'?: Symbols as religious phenomena
2013-03-06
Mar 6, 2013 ... process by which symbols grow and develop, the particular context of a symbol is important. In this article a particular theory as to what symbols are, is presented. ... of communication and reference between these two worlds are symbols. .... from a psychological perspective, understands symbols as a.
O. G. Shostak
2003-06-01
Full Text Available This paper is dedicated to the question of similarities in the approach to the multilevel symbolism in Slav and Native American cultures. Ambivalent symbol of the snake is analyzed in the frame of mythological thinking. At the end the author comes to the conclusion that elements of mythological thinking are still present in everyday life and influence human behavior levels
An Evaluation Framework for Energy Aware Buildings using Statistical Model Checking
David, Alexandre; Du, DeHui; Larsen, Kim Guldstrand
2012-01-01
properties of this formalisms. A particular kind of cyber-physical systems are Smart Grids which together with Intelligent, Energy Aware Buildings will play a major role in achieving an energy efficient society of the future. In this paper we present a framework in Uppaal-smc for energy aware buildings...... allowing to evaluate the performance of proposed control strategies in terms of their induced comfort and energy profiles under varying environmental settings (e.g. weather, user behaviour, ...). To demonstrate the intended use and usefulness of our framework, we present an application to the Hybrid......Cyber-physical systems are to be found in numerous applications throughout society. The principal barrier to develop trustworthy cyber-physical systems is the lack of expressive modelling and specification for- malisms supported by efficient tools and methodologies. To overcome this barrier, we...
Wanda Vrasti
2012-03-01
Full Text Available Over the past couple of months history has been unfolding with dizzying speed. The #occupy model of leaderless, demandless direct action, which in the beginning no one with only a slim understanding of how capitalism works thought could become anything more than a facile if charming jab at anti-corporate activism, has gone viral. Every morning we wake up to new reports about ‘occupying X’, where X can be anything from cities, campuses, boardrooms, buildings, highways, and public events, all the way to academic disciplines. What originally seemed like a romantic fantasy about temporary autonomous zones now feels like history. And no one likes to find themselves on thewrong side of history, especially not intellectuals, let alone intellectuals in the business of explaining global politics.
Attila Krajcsi
2018-02-01
Full Text Available HIGHLIGHTSWe test whether symbolic number comparison is handled by an analog noisy system.Analog system model has systematic biases in describing symbolic number comparison.This suggests that symbolic and non-symbolic numbers are processed by different systems.Dominant numerical cognition models suppose that both symbolic and non-symbolic numbers are processed by the Analog Number System (ANS working according to Weber's law. It was proposed that in a number comparison task the numerical distance and size effects reflect a ratio-based performance which is the sign of the ANS activation. However, increasing number of findings and alternative models propose that symbolic and non-symbolic numbers might be processed by different representations. Importantly, alternative explanations may offer similar predictions to the ANS prediction, therefore, former evidence usually utilizing only the goodness of fit of the ANS prediction is not sufficient to support the ANS account. To test the ANS model more rigorously, a more extensive test is offered here. Several properties of the ANS predictions for the error rates, reaction times, and diffusion model drift rates were systematically analyzed in both non-symbolic dot comparison and symbolic Indo-Arabic comparison tasks. It was consistently found that while the ANS model's prediction is relatively good for the non-symbolic dot comparison, its prediction is poorer and systematically biased for the symbolic Indo-Arabic comparison. We conclude that only non-symbolic comparison is supported by the ANS, and symbolic number comparisons are processed by other representation.
Noncoherent Symbol Synchronization Techniques
Simon, Marvin
2005-01-01
Traditional methods for establishing symbol synchronization (sync) in digital communication receivers assume that carrier sync has already been established, i.e., the problem is addressed at the baseband level assuming that a 'perfect' estimate of carrier phase is available. We refer to this approach as coherent symbol sync. Since, for NRZ signaling, a suppressed carrier sync loop such as an I-Q Costas loop includes integrate-and-dump (I and D) filters in its in-phase (1) and quadrature (Q) arms, the traditional approach is to first track the carrier in the absence of symbol sync information, then feed back the symbol sync estimate to these filters, and then iterate between the two to a desirable operating level In this paper, we revisit the symbol sync problem by examining methods for obtaining such sync in the absence of carrier phase information, i.e., so-called noncoherent symbol sync loops. We compare the performance of these loops with that of a well-known coherent symbol sync loop and examine the conditions under which one is preferable over the other.
Grønhøj Larsen, Christian; Jørgensen, Karsten Juhl; Gøtzsche, Peter C
2012-01-01
To investigate whether Danish providers of general health checks present a balanced account of possible benefits and harms on their websites and whether the health checks are evidence-based.......To investigate whether Danish providers of general health checks present a balanced account of possible benefits and harms on their websites and whether the health checks are evidence-based....
Nadine BOUDOU
2015-07-01
Full Text Available The objective of this article is to show why the zombie can be presented as a justifiable object of search for the symbolic communication. The zombie exists as symbol because the word the leading to a qualification became of current usage, what allows a widened communication. The diversity of the interpretations that he makes possible testifies of its ambivalence. That he is defined as a symbol or as a metaphor we shall see that, far from being that a lasted fad, the zombie is rich in different senses.
Formalising Symbolic Interactionism
de Nooy, W.
2009-01-01
Symbolic interactionism is generally known as a theory typically linked with a qualitative methodology. Recent developments in quantitative social network analysis, however, can analyze processes theorized within this theoretical tradition. Thick description can be complemented with statistical
Symbolic Violence and Victimisation
Pedersen, Bodil Maria
2009-01-01
has been criticised for over-generalisations, as well as for disregarding culture and the embeddedness of psychological problems in situated societal processes. The proposed paper is a contribution to this critique. It will draw on Bourdieu's concept of symbolic violence (1992). The concept connects......Nay (1999). It also undertakes a critical discussion of symbolic violence in the meanings given to victimisation and its aftermaths, as when conceptualised with the help of PTSD (e.g. may the use of concepts of this kind and the practices developed in relation to it constitute symbolic violence...... and contribute to victimisation?) Furthermore the analysis aims at unfolding an understanding of victimisation inclusive of connections between cultural/ societal practices, aspects of symbolic violence and lives of concrete subjects. The discussion takes its point of departure in theoretical deliberations...
Fosco, Gregory M.; Van Ryzin, Mark; Stormshak, Elizabeth A.; Dishion, Thomas J.
2014-01-01
This study examined contextual factors (caregiver depression, family resources, ethnicity, and initial levels of youth problem behavior) related to the effectiveness of the Family Check-Up (FCU) and evaluated family processes as a mediator of FCU intervention response and adolescent antisocial behavior. We followed a sample of 180 ethnically diverse youths of families who engaged in the FCU intervention. Family data were collected as part of the FCU assessment, and youth data were collected over 4 years, from sixth through ninth grade. Findings indicated that caregiver depression and minority status predicted greater caregiver motivation to change. In turn, caregiver motivation was the only direct predictor of FCU intervention response during a 1-year period. Growth in family conflict from sixth through eighth grade mediated the link between FCU response and ninth-grade antisocial behavior. This study explicitly tested core aspects of the FCU intervention model and demonstrated that caregiver motivation is a central factor that underlies family response to the FCU. The study also provided support for continued examination of family process mechanisms that account for enduring effects of the FCU and other family-centered interventions. PMID:24438894
Fosco, Gregory M; Van Ryzin, Mark; Stormshak, Elizabeth A; Dishion, Thomas J
2014-05-01
This study examined contextual factors (caregiver depression, family resources, ethnicity, and initial levels of youth problem behavior) related to the effectiveness of the Family Check-Up (FCU) and evaluated family processes as a mediator of FCU intervention response and adolescent antisocial behavior. We followed a sample of 180 ethnically diverse youths of families who engaged in the FCU intervention. Family data were collected as part of the FCU assessment, and youth data were collected over 4 years, from sixth through ninth grade. Findings indicated that caregiver depression and minority status predicted greater caregiver motivation to change. In turn, caregiver motivation was the only direct predictor of FCU intervention response during a 1-year period. Growth in family conflict from sixth through eighth grade mediated the link between FCU response and ninth-grade antisocial behavior. This study explicitly tested core aspects of the FCU intervention model and demonstrated that caregiver motivation is a central factor that underlies family response to the FCU. The study also provided support for continued examination of family process mechanisms that account for enduring effects of the FCU and other family-centered interventions.
El Hariri, Mohamad [Florida Intl Univ., Miami, FL (United States); Faddel, Samy [Florida Intl Univ., Miami, FL (United States); Mohammed, Osama [Florida Intl Univ., Miami, FL (United States)
2017-11-01
Decentralized and hierarchical microgrid control strategies have lain the groundwork for shaping the future smart grid. Such control approaches require the cooperation between microgrid operators in control centers, intelligent microcontrollers, and remote terminal units via secure and reliable communication networks. In order to enhance the security and complement the work of network intrusion detection systems, this paper presents an artificially intelligent physical model-checking that detects tampered-with circuit breaker switching control commands whether, due to a cyber-attack or human error. In this technique, distributed agents, which are monitoring sectionalized areas of a given microgrid, will be trained and continuously adapted to verify that incoming control commands do not violate the physical system operational standards and do not put the microgrid in an insecure state. The potential of this approach has been tested by deploying agents that monitor circuit breakers status commands on a 14-bus IEEE benchmark system. The results showed the accuracy of the proposed framework in characterizing the power system and successfully detecting malicious and/or erroneous control commands.
Ueno Kazuko
2009-04-01
Full Text Available Abstract Background Model checking approaches were applied to biological pathway validations around 2003. Recently, Fisher et al. have proved the importance of model checking approach by inferring new regulation of signaling crosstalk in C. elegans and confirming the regulation with biological experiments. They took a discrete and state-based approach to explore all possible states of the system underlying vulval precursor cell (VPC fate specification for desired properties. However, since both discrete and continuous features appear to be an indispensable part of biological processes, it is more appropriate to use quantitative models to capture the dynamics of biological systems. Our key motivation of this paper is to establish a quantitative methodology to model and analyze in silico models incorporating the use of model checking approach. Results A novel method of modeling and simulating biological systems with the use of model checking approach is proposed based on hybrid functional Petri net with extension (HFPNe as the framework dealing with both discrete and continuous events. Firstly, we construct a quantitative VPC fate model with 1761 components by using HFPNe. Secondly, we employ two major biological fate determination rules – Rule I and Rule II – to VPC fate model. We then conduct 10,000 simulations for each of 48 sets of different genotypes, investigate variations of cell fate patterns under each genotype, and validate the two rules by comparing three simulation targets consisting of fate patterns obtained from in silico and in vivo experiments. In particular, an evaluation was successfully done by using our VPC fate model to investigate one target derived from biological experiments involving hybrid lineage observations. However, the understandings of hybrid lineages are hard to make on a discrete model because the hybrid lineage occurs when the system comes close to certain thresholds as discussed by Sternberg and Horvitz in
Gitz-Johansen, Thomas
2018-01-01
The article explores how Bruce Springsteen and his music function as a symbol. The article first presents the Jungian theory of symbols and of music as symbol. The central argument of the article is that, by functioning symbolically, Springsteen has the potential to influence the psyche of his au...
Matter and symbols of the artificial
Rocha, L.M.
1998-08-01
The study of complex systems should be based on a systems-theoretic framework which requires both self-organizing and symbolic dimensions. An inclusive framework based on the notion of semiotics is advanced to build models capable of representing, as well as evolving in their environments, with implications for Artificial Life. Such undertaking is pursued by discussing the ways in which symbol and matter are irreducibly intertwined in evolutionary systems. The problem is thus phrased in terms of the semiotic categories of syntax, semantics, and pragmatics. With this semiotic view of matter and symbols the requirements of semiotic closure are expressed in models with both self-organizing and symbolic characteristics. Situated action and recent developments in the evolution of cellular automata rules to solve non-trivial tasks are discussed in this context. Finally, indirect encoding schemes for genetic algorithms are developed which follow the semiotic framework here proposed.
Symbol generators with program control
Gryaznov, V.M.; Tomik, J.
1974-01-01
Methods of constructing symbol generators are described which ensure a program variation of symbol shape and setup. The symbols are formed on the basis of a point microraster. A symbol description code contains information on a symbol shape, with one digit corresponding to each microraster element. For a microraster discrete by-pass the description code is transformed into succession of illuminating pulses by means of a shift register
Multiple symbol differential detection
Divsalar, Dariush (Inventor); Simon, Marvin K. (Inventor)
1991-01-01
A differential detection technique for multiple phase shift keying (MPSK) signals is provided which uses a multiple symbol observation interval on the basis of which a joint decision is made regarding the phase of the received symbols. In accordance with the invention, a first difference phase is created between first and second received symbols. Next, the first difference phase is correlated with the possible values thereof to provide a first plurality of intermediate output signals. A second difference phase is next created between second and third received symbols. The second difference phase is correlated with plural possible values thereof to provide a second plurality of intermediate output signals. Next, a third difference phase is created between the first and third symbols. The third difference phase is correlated with plural possible values thereof to provide a third plurality of intermediate output signals. Each of the first plurality of intermediate outputs are combined with each of the second plurality of intermediate outputs and each of the third plurality of intermediate outputs to provide a plurality of possible output values. Finally, a joint decision is made by choosing from the plurality of possible output values the value which represents the best combined correlation of the first, second and third difference values with the possible values thereof.
Darwin, Ian
2007-01-01
This Short Cut tells you about tools that will improve the quality of your Java code, using checking above and beyond what the standard tools do, including: Using javac options, JUnit and assertions Making your IDE work harder Checking your source code with PMD Checking your compiled code (.class files) with FindBugs Checking your program's run-time behavior with Java PathFinder
Pedersen, Bodil Maria
2011-01-01
- to praxis, and drawing on the concept of symbolic violence, this article contributes to their critique. In order to develop the analysis of difficulties victims may experience, they will be reconceptualised using critical psychological concepts such as 1st person perspectives and participation. The analysis...... seeks to undertake a discussion of personal meanings attributed to 'traumatisation'. It raises questions as to whether concepts of this kind and related practices may constitute symbolic violence and contribute to victimisation through looping-processes. Furthermore it aims at unfolding an understanding...... inclusive of connections between societal practices, aspects of symbolic violence, and the conduct of lives. The analysis is based on an empirical study of victimisation through rape and other forms of sexualised coercion....
Cross-spectrum symbol synchronization
Mccallister, R. D.; Simon, M. K.
1981-01-01
A popular method of symbol synchronization exploits one aspect of generalized harmonic analysis, normally referred to as the cross-spectrum. Utilizing nonlinear techniques, the input symbol energy is effectively concentrated onto multiples of the symbol clock frequency, facilitating application of conventional phase lock synchronization techniques. A general treatment of the cross-spectrum technique is developed and shown to be applicable across a broad class of symbol modulation formats. An important specific symbol synchronization application is then treated, focusing the general development to provide both insight and quantitative measure of the performance impact associated with variation in these key synchronization parameters: symbol modulation format, symbol transition probability, symbol energy to noise density ratio, and symbol rate to filter bandwidth ratio.
Symbolic computer vector analysis
Stoutemyer, D. R.
1977-01-01
A MACSYMA program is described which performs symbolic vector algebra and vector calculus. The program can combine and simplify symbolic expressions including dot products and cross products, together with the gradient, divergence, curl, and Laplacian operators. The distribution of these operators over sums or products is under user control, as are various other expansions, including expansion into components in any specific orthogonal coordinate system. There is also a capability for deriving the scalar or vector potential of a vector field. Examples include derivation of the partial differential equations describing fluid flow and magnetohydrodynamics, for 12 different classic orthogonal curvilinear coordinate systems.
Bysko Maxim V.
2013-12-01
Full Text Available The article considers the role of jingles in the industrial era, from the occurrence of the regular radio broadcasting, sound films and television up of modern video games, audio and video podcasts, online broadcasts, and mobile communications. Jingles are researched from the point of view of the theory of symbols: the forward motion is detected in the process of development of jingles from the social symbols (radio callsigns to the individual signs-images (ringtones. The role of technical progress in the formation of jingles as important cultural audio elements of modern digital civilization.
Symbolism in European Integration
Manners, Ian
2011-01-01
Ernst Haas observed over fifty years ago that ‘United Europe' is a resilient, adaptable, unifying, and yet unspecified symbol'. It is precisely this adaptability and ambiguity that has ensures the continuing importance of European studies as a means of understanding ‘the remarkable social...... of social transformation involved' (Calhoun 2003: 18). This article will consider the role of symbolism in European integration as part of answering Craig Calhoun's call for a means of transcending specific regimes of analysis in order to advance European studies....
Tian Bo; Gao Yitian; Zhu Hongwu
2007-01-01
Symbolically investigated in this Letter is a variable-coefficient higher-order nonlinear Schroedinger (vcHNLS) model for ultrafast signal-routing, fiber laser systems and optical communication systems with distributed dispersion and nonlinearity management. Of physical and optical interests, with bilinear method extend, the vcHNLS model is transformed into a variable-coefficient bilinear form, and then an auto-Baecklund transformation is constructed. Constraints on coefficient functions are analyzed. Potentially observable with future optical-fiber experiments, variable-coefficient brightons are illustrated. Relevant properties and features are discussed as well. Baecklund transformation and other results of this Letter will be of certain value to the studies on inhomogeneous fiber media, core of dispersion-managed brightons, fiber amplifiers, laser systems and optical communication links with distributed dispersion and nonlinearity management
Symbolic Analysis of Cryptographic Protocols
Dahl, Morten
We present our work on using abstract models for formally analysing cryptographic protocols: First, we present an ecient method for verifying trace-based authenticity properties of protocols using nonces, symmetric encryption, and asymmetric encryption. The method is based on a type system...... of Gordon et al., which we modify to support fully-automated type inference. Tests conducted via an implementation of our algorithm found it to be very ecient. Second, we show how privacy may be captured in a symbolic model using an equivalencebased property and give a formal denition. We formalise...
Symbolic computation in waste management
Grant, M.W.
1989-01-01
This paper reports a prototype environment for decision analysis implemented on the PC using an object-oriented LISP. A unique feature of this environment is the extensive use of symbolic computation and object oriented programming. Models, e.g. contaminant transport and uptake, are built with the environment, itself recognizing new parameters, uncertainties and functions as they first appear and can be modified at any time with the appropriate changes propagated throughout the environment. The environment automatically generates and executes a complete interactive input sequence during the model construction. In addition to a primary decision criterion, secondary criteria or constraints may be used to define any decision
Basic ionizing radiation symbol
1987-01-01
A description is given of the standard symbol for ionizing radiation and of the conditions under which it should not be used. The Arabic equivalent of some English technical terms in this subject is given in one page. 1 ref., 1 fig
Communication in Symbolic Play.
Umek, Ljubica Marjanovic; Musek, Petra Lesnik; Kranjc, Simona
2001-01-01
Analyzed records of Slovene children's speech from a linguistic point of view and established differences in communication patterns with regard to the children's ages and the type of symbolic play. Found a shift in play from make-believe with regard to objects to roleplay related to social context. The older the child, the more language functions…
Symbolic Multidimensional Scaling
P.J.F. Groenen (Patrick); Y. Terada
2015-01-01
markdownabstract__Abstract__ Multidimensional scaling (MDS) is a technique that visualizes dissimilarities between pairs of objects as distances between points in a low dimensional space. In symbolic MDS, a dissimilarity is not just a value but can represent an interval or even a histogram. Here,
Checking behavioral conformance of artifacts
Fahland, D.; Leoni, de M.; Dongen, van B.F.; Aalst, van der W.M.P.
2011-01-01
The usefulness of process models (e.g., for analysis, improvement, or execution) strongly depends on their ability to describe reality. Conformance checking is a technique to validate how good a given process model describes recorded executions of the actual process. Recently, artifacts have been
Numerical and symbolic scientific computing
Langer, Ulrich
2011-01-01
The book presents the state of the art and results and also includes articles pointing to future developments. Most of the articles center around the theme of linear partial differential equations. Major aspects are fast solvers in elastoplasticity, symbolic analysis for boundary problems, symbolic treatment of operators, computer algebra, and finite element methods, a symbolic approach to finite difference schemes, cylindrical algebraic decomposition and local Fourier analysis, and white noise analysis for stochastic partial differential equations. Further numerical-symbolic topics range from
checkCIF/PLATON (full publication check)
editor handling your paper, to upload your CIF via our web site. PLATON version of 05/02/2014; check.def file version of 05/02/2014. Datablock I - ellipsoid plot http://vm02b.iucr.org/cgi-bin/checkcif_hkl.pl（第 3／4 页）2014-2-12 09:09:12 ...
Lisbon Symbol Database (LSD): Subjective norms for 600 symbols.
Prada, Marília; Rodrigues, David; Silva, Rita R; Garrido, Margarida V
2016-12-01
This article presents subjective rating norms for a new set of 600 symbols, depicting various contents (e.g., transportation, technology, and leisure activities) that can be used by researchers in different fields. Symbols were evaluated for aesthetic appeal, familiarity, visual complexity, concreteness, valence, arousal, and meaningfulness. The normative data were obtained from 388 participants, and no gender differences were found. Descriptive results (means, standard deviations, and confidence intervals) for each symbol in each dimension are presented. Overall, the dimensions were highly correlated. Additionally, participants were asked to briefly describe the meaning of each symbol. The results indicate that the present symbol set is varied, allowing for the selection of exemplars with different levels on the seven examined dimensions. This set of symbols constitutes a tool with potential for research in different areas. The database with all of the symbols is available as supplemental materials.
HMD symbol stabilization concepts
Newman, Richard L.; Greeley, Kevin W.
1995-05-01
Helmet-mounted displays (HMDs) present flight, navigation, and weapon information in the pilot's line of sight. The HMD was developed to allow the pilot to retain aircraft and weapon information while looking off boresight. Symbol stabilization is a key issue for HMDs. In current equipment, the lack of compensation for pilot head motion creates excessive workload during hovering and nap-of-the-earth flight. This high workload translates into excessive training requirements. At the same time, misleading symbology makes interpretation of the height of obstructions impossible. A set of standardized coordinate transformations are necessary for the development of HMD symbology and the control laws. Part of the problem is there is no agreed upon set of definitions or descriptions for how HMD symbols are driven to compensate for pilot head motion. A candidate set of coordinate definitions is proposed to address this issue.
Formalising Symbolic Interactionism
de Nooy, W.
2009-01-01
Symbolic interactionism is generally known as a theory typically linked with a qualitative methodology. Recent developments in quantitative social network analysis, however, can analyze processes theorized within this theoretical tradition. Thick description can be complemented with statistical analyses of network structure and dynamics, expanding the scope and detail of results. This paper argues that social network analysis can bridge the divide between qualitative and quantitative analysis...
Symbolic Play in the Treatment of Autism in Children.
Voyat, Gilbert
1982-01-01
Explores the role of symbolic play in the cognitive and psychic development of the normal child and describes the autistic child. Reviews a model treatment program for autism developed at the City College of New York, discussing the therapeutic role of symbolic play in that model. (Author/MJL)
Political symbols and political transitions
Herrero de Miñón, Miguel
2006-11-01
Full Text Available Politics, Law and Psychology are fields that come together in the symbolic. This text takes evidence from those three areas to develop an analysis of political symbols and political transitions. The development of the analysis goes through three stages. The first succinctly describes the concept of transition and its meaning. The second closely examines the notion of the symbol, in terms of its definition, to explain aspects that allow us to understand it, characterise it and make its functions clear. Finally, from the author's experience as a witness and as an actor, I suggest three ways of understanding symbols in the processes of political transition: as symbols of change, as symbols of acknowledgment, and as symbols of support.
Symbol interval optimization for molecular communication with drift.
Kim, Na-Rae; Eckford, Andrew W; Chae, Chan-Byoung
2014-09-01
In this paper, we propose a symbol interval optimization algorithm in molecular communication with drift. Proper symbol intervals are important in practical communication systems since information needs to be sent as fast as possible with low error rates. There is a trade-off, however, between symbol intervals and inter-symbol interference (ISI) from Brownian motion. Thus, we find proper symbol interval values considering the ISI inside two kinds of blood vessels, and also suggest no ISI system for strong drift models. Finally, an isomer-based molecule shift keying (IMoSK) is applied to calculate achievable data transmission rates (achievable rates, hereafter). Normalized achievable rates are also obtained and compared in one-symbol ISI and no ISI systems.
Second International workshop Geometry and Symbolic Computation
Walczak, Paweł; Geometry and its Applications
2014-01-01
This volume has been divided into two parts: Geometry and Applications. The geometry portion of the book relates primarily to geometric flows, laminations, integral formulae, geometry of vector fields on Lie groups, and osculation; the articles in the applications portion concern some particular problems of the theory of dynamical systems, including mathematical problems of liquid flows and a study of cycles for non-dynamical systems. This Work is based on the second international workshop entitled "Geometry and Symbolic Computations," held on May 15-18, 2013 at the University of Haifa and is dedicated to modeling (using symbolic calculations) in differential geometry and its applications in fields such as computer science, tomography, and mechanics. It is intended to create a forum for students and researchers in pure and applied geometry to promote discussion of modern state-of-the-art in geometric modeling using symbolic programs such as Maple™ and Mathematica®, as well as presentation of new results. ...
Royo, B.; Valdes, R.
2012-11-01
This report contains the description and the results of the dynamic simulation model that has been developed to predict the behaviour of one of our lift check valve design. The aim of the model is not only to simulate the closing process of the valve and to product the magnitude of the water hammer effect that may appear immediately after the valve closing, but also to simulate several design version until obtain the optimum which further minimizes such effect. the input data used for this study ensure reliable results since they represent a real system. (Author)
Symbolics in control design: prospects and research issues
Christensen, Anders
1994-01-01
The symbolic processor is targeted as a novel basic service in computer aided control system design. Basic symbolic tools are exemplified. A design process model is formulated for control design, with subsets manipulator, tools, target and goals. It is argued, that symbolic processing will give...... substantial contributions to future design environments, as it provides flexibility of representation not possible with traditional numerics. Based on the design process, views on research issues in the incorporation of symbolic processing into traditional numerical design environments are given...
Using LDPC Code Constraints to Aid Recovery of Symbol Timing
Jones, Christopher; Villasnor, John; Lee, Dong-U; Vales, Esteban
2008-01-01
A method of utilizing information available in the constraints imposed by a low-density parity-check (LDPC) code has been proposed as a means of aiding the recovery of symbol timing in the reception of a binary-phase-shift-keying (BPSK) signal representing such a code in the presence of noise, timing error, and/or Doppler shift between the transmitter and the receiver. This method and the receiver architecture in which it would be implemented belong to a class of timing-recovery methods and corresponding receiver architectures characterized as pilotless in that they do not require transmission and reception of pilot signals. Acquisition and tracking of a signal of the type described above have traditionally been performed upstream of, and independently of, decoding and have typically involved utilization of a phase-locked loop (PLL). However, the LDPC decoding process, which is iterative, provides information that can be fed back to the timing-recovery receiver circuits to improve performance significantly over that attainable in the absence of such feedback. Prior methods of coupling LDPC decoding with timing recovery had focused on the use of output code words produced as the iterations progress. In contrast, in the present method, one exploits the information available from the metrics computed for the constraint nodes of an LDPC code during the decoding process. In addition, the method involves the use of a waveform model that captures, better than do the waveform models of the prior methods, distortions introduced by receiver timing errors and transmitter/ receiver motions. An LDPC code is commonly represented by use of a bipartite graph containing two sets of nodes. In the graph corresponding to an (n,k) code, the n variable nodes correspond to the code word symbols and the n-k constraint nodes represent the constraints that the code places on the variable nodes in order for them to form a valid code word. The decoding procedure involves iterative computation
Symbolic dynamics of the Lorenz equations
Fang Hai-ping; Hao Bailin.
1994-07-01
The Lorenz equations are investigated in a wide range of parameters by using the method of symbolic dynamics. First, the systematics of stable periodic orbits in the Lorenz equations is compared with that of the one-dimensional cubic map, which shares the same discrete symmetry with the Lorenz model. The systematics is then ''corrected'' in such a way as to encompass all the known periodic windows of the Lorenz equations with only one exception. Second, in order to justify the above approach and to understand the exceptions, another 1D map with a discontinuity is extracted from an extension of the geometric Lorenz attractor and its symbolic dynamics is constructed. All this has to be done in light of symbolic dynamics of two-dimensional maps. Finally, symbolic dynamics for the actual Poincare return map of the Lorenz equations is constructed in a heuristic way. New periodic windows of the Lorenz equations and their parameters can be predicted from this symbolic dynamics in combination with the 1D cubic map. The extended geometric 2D Lorenz map and the 1D antisymmetric map with a discontinuity describe the topological aspects of the Lorenz equations to high accuracy. (author). 44 refs, 17 figs, 8 tabs
Symbolic dynamics of noisy chaos
Crutchfield, J P; Packard, N H
1983-05-01
One model of randomness observed in physical systems is that low-dimensional deterministic chaotic attractors underly the observations. A phenomenological theory of chaotic dynamics requires an accounting of the information flow fromthe observed system to the observer, the amount of information available in observations, and just how this information affects predictions of the system's future behavior. In an effort to develop such a description, the information theory of highly discretized observations of random behavior is discussed. Metric entropy and topological entropy are well-defined invariant measures of such an attractor's level of chaos, and are computable using symbolic dynamics. Real physical systems that display low dimensional dynamics are, however, inevitably coupled to high-dimensional randomness, e.g. thermal noise. We investigate the effects of such fluctuations coupled to deterministic chaotic systems, in particular, the metric entropy's response to the fluctuations. It is found that the entropy increases with a power law in the noise level, and that the convergence of the entropy and the effect of fluctuations can be cast as a scaling theory. It is also argued that in addition to the metric entropy, there is a second scaling invariant quantity that characterizes a deterministic system with added fluctuations: I/sub 0/, the maximum average information obtainable about the initial condition that produces a particular sequence of measurements (or symbols). 46 references, 14 figures, 1 table.
Anthropologists as symbols: Geertz
Aleksandar Bošković
2016-02-01
Full Text Available Clifford Geertz (1926-2006 was certainly one of the most influential anthropologists in the last decades of the 20th century, even though some of his former students (like Rabinow in Slyomovics 2010 claim that he was not very accessible as a person, and that sometimes he did not even care for his students. Somewhat paradoxically, Geertz´s influence on anthropology and related disciplines remained notable even after his death. This paper analyzes interest in aspects of his work over the last decade, as an indicator of transforming a personality into a global cultural symbol.
Concealed identification symbols and nondestructive determination of the identification symbols
Nance, Thomas A.; Gibbs, Kenneth M.
2014-09-16
The concealing of one or more identification symbols into a target object and the subsequent determination or reading of such symbols through non-destructive testing is described. The symbols can be concealed in a manner so that they are not visible to the human eye and/or cannot be readily revealed to the human eye without damage or destruction of the target object. The identification symbols can be determined after concealment by e.g., the compilation of multiple X-ray images. As such, the present invention can also provide e.g., a deterrent to theft and the recovery of lost or stolen objects.
Manicone, Santo
2001-01-01
Discusses the importance of educational facilities conducting "reality check" self-audits to uncover the real truth behind underlying environmental problems. An environmental compliance multimedia checklist is included. (GR)
AMMIN
Calculated. Reported. Volume ... PLAT094_ALERT_2_C Ratio of Maximum / Minimum Residual Density .... 3.24 Report ... checkCIF was carefully designed to identify outliers and unusual parameters, but every test has its limitations and alerts ...
Tian Bo; Wei Guangmei; Zhang Chunyi; Shan Wenrui; Gao Yitian
2006-01-01
The variable-coefficient Korteweg-de Vries (KdV)-typed models, although often hard to be studied, are of current interest in describing various real situations. Under investigation hereby is a large class of the generalized variable-coefficient KdV models with external-force and perturbed/dissipative terms. Recent examples of this class include those in blood vessels and circulatory system, arterial dynamics, trapped Bose-Einstein condensates related to matter waves and nonlinear atom optics, Bose gas of impenetrable bosons with longitudinal confinement, rods of compressible hyperelastic material and semiconductor heterostructures with positonic phenomena. In this Letter, based on symbolic computation, four transformations are proposed from this class either to the cylindrical or standard KdV equation when the respective constraint holds. The constraints have nothing to do with the external-force term. Under those transformations, such analytic solutions as those with the Airy, Hermit and Jacobian elliptic functions can be obtained, including the solitonic profiles. The roles for the perturbed and external-force terms to play are observed and discussed. Investigations on this class can be performed through the properties of solutions of cylindrical and standard KdV equations
Henriksen, Jørgen; Nielsen, Mette Benedicte Olaf; Madsen, Jørgen
2009-01-01
This check list, financed by DanChurchAid, highlights all issues should be carefully investigated before investing in distribution of goats and in interventions to assist poor rural communities to improve their livelihood through goat production.......This check list, financed by DanChurchAid, highlights all issues should be carefully investigated before investing in distribution of goats and in interventions to assist poor rural communities to improve their livelihood through goat production....
Zimnicki, Katherine M
2015-01-01
Preoperative teaching and stoma marking are supported by research and included in clinical practice guidelines from the WOCN Society and others. Using a FOCUS-Plan-Do-Check-Act model of Total Quality Management, a multidisciplinary team was formed that developed a flow chart outlining the process of care for patients undergoing planned ostomy surgery that included an educational intervention that enabled staff nurses to perform preoperative stoma site marking and education. After 3 months, we found a statistically significant increase in the number of surgical patients who received these evidence-based interventions (14% vs 64%; χ = 9.32; P = .002).
Symbolic behavior in regular classrooms. A specification of symbolic and non-symbolic behavior
Stefan eBillinger
2011-06-01
Full Text Available Students’ capabilities to use symbolic information in classroom setting could be expected to influence their possibilities to be active and participating. The development of strategies for teachers to compensate for reduced capability need specific operational definition of symbolic behavior. Fifty-three students, aged 11 to 13 years old, 29 boys and 24 girls, from three classes in the same Swedish compulsory regular school participated in the current study. After a short training sequence 25 students (47% were defined as showing symbolic behavior (symbolic, and 28 students (53% were not (non-symbolic, based on their follow-up test performances. Symbolic and non-symbolic differed significantly on post test performances (p. < .05. Surprisingly, non-symbolic behavior deteriorated their performance, while symbolic enhanced their performance (p. < .05. The results indicate that the operational definition used in the present study may be useful in further studies relating the capability to show symbolic behavior and students’ activity and participation in classroom settings.
Symbolic Interactionism and Social Action Theory
Morrione, Thomas J.
1975-01-01
An explanation and elaboration of existing theory on interaction, this article describes a point of convergence between Parsons' Voluntaristic Theory of Action and Blumer's conceptualization of Symbolic Interactionism and develops specific problems of divergence in these normative and interpretive models of interaction. (JC)
Symbolic approximate time-optimal control
Mazo, Manuel; Tabuada, Paulo
There is an increasing demand for controller design techniques capable of addressing the complex requirements of today's embedded applications. This demand has sparked the interest in symbolic control where lower complexity models of control systems are used to cater for complex specifications given
Eagle, Dawn M; Noschang, Cristie; d'Angelo, Laure-Sophie Camilla; Noble, Christie A; Day, Jacob O; Dongelmans, Marie Louise; Theobald, David E; Mar, Adam C; Urcelay, Gonzalo P; Morein-Zamir, Sharon; Robbins, Trevor W
2014-05-01
Excessive checking is a common, debilitating symptom of obsessive-compulsive disorder (OCD). In an established rodent model of OCD checking behaviour, quinpirole (dopamine D2/3-receptor agonist) increased checking in open-field tests, indicating dopaminergic modulation of checking-like behaviours. We designed a novel operant paradigm for rats (observing response task (ORT)) to further examine cognitive processes underpinning checking behaviour and clarify how and why checking develops. We investigated i) how quinpirole increases checking, ii) dependence of these effects on D2/3 receptor function (following treatment with D2/3 receptor antagonist sulpiride) and iii) effects of reward uncertainty. In the ORT, rats pressed an 'observing' lever for information about the location of an 'active' lever that provided food reinforcement. High- and low-checkers (defined from baseline observing) received quinpirole (0.5mg/kg, 10 treatments) or vehicle. Parametric task manipulations assessed observing/checking under increasing task demands relating to reinforcement uncertainty (variable response requirement and active-lever location switching). Treatment with sulpiride further probed the pharmacological basis of long-term behavioural changes. Quinpirole selectively increased checking, both functional observing lever presses (OLPs) and non-functional extra OLPs (EOLPs). The increase in OLPs and EOLPs was long-lasting, without further quinpirole administration. Quinpirole did not affect the immediate ability to use information from checking. Vehicle and quinpirole-treated rats (VEH and QNP respectively) were selectively sensitive to different forms of uncertainty. Sulpiride reduced non-functional EOLPs in QNP rats but had no effect on functional OLPs. These data have implications for treatment of compulsive checking in OCD, particularly for serotonin-reuptake-inhibitor treatment-refractory cases, where supplementation with dopamine receptor antagonists may be beneficial
Eagle, Dawn M.; Noschang, Cristie; d’Angelo, Laure-Sophie Camilla; Noble, Christie A.; Day, Jacob O.; Dongelmans, Marie Louise; Theobald, David E.; Mar, Adam C.; Urcelay, Gonzalo P.; Morein-Zamir, Sharon; Robbins, Trevor W.
2014-01-01
Excessive checking is a common, debilitating symptom of obsessive-compulsive disorder (OCD). In an established rodent model of OCD checking behaviour, quinpirole (dopamine D2/3-receptor agonist) increased checking in open-field tests, indicating dopaminergic modulation of checking-like behaviours. We designed a novel operant paradigm for rats (observing response task (ORT)) to further examine cognitive processes underpinning checking behaviour and clarify how and why checking develops. We investigated i) how quinpirole increases checking, ii) dependence of these effects on D2/3 receptor function (following treatment with D2/3 receptor antagonist sulpiride) and iii) effects of reward uncertainty. In the ORT, rats pressed an ‘observing’ lever for information about the location of an ‘active’ lever that provided food reinforcement. High- and low-checkers (defined from baseline observing) received quinpirole (0.5 mg/kg, 10 treatments) or vehicle. Parametric task manipulations assessed observing/checking under increasing task demands relating to reinforcement uncertainty (variable response requirement and active-lever location switching). Treatment with sulpiride further probed the pharmacological basis of long-term behavioural changes. Quinpirole selectively increased checking, both functional observing lever presses (OLPs) and non-functional extra OLPs (EOLPs). The increase in OLPs and EOLPs was long-lasting, without further quinpirole administration. Quinpirole did not affect the immediate ability to use information from checking. Vehicle and quinpirole-treated rats (VEH and QNP respectively) were selectively sensitive to different forms of uncertainty. Sulpiride reduced non-functional EOLPs in QNP rats but had no effect on functional OLPs. These data have implications for treatment of compulsive checking in OCD, particularly for serotonin-reuptake-inhibitor treatment-refractory cases, where supplementation with dopamine receptor antagonists may be
Mathematical symbol hypothesis recognition with rejection option
Julca-Aguilar , Frank; Hirata , Nina ,; Viard-Gaudin , Christian; Mouchère , Harold; Medjkoune , Sofiane
2014-01-01
International audience; In the context of handwritten mathematical expressions recognition, a first step consist on grouping strokes (segmentation) to form symbol hypotheses: groups of strokes that might represent a symbol. Then, the symbol recognition step needs to cope with the identification of wrong segmented symbols (false hypotheses). However, previous works on symbol recognition consider only correctly segmented symbols. In this work, we focus on the problem of mathematical symbol reco...
Sound Symbolism in Basic Vocabulary
Søren Wichmann
2010-04-01
Full Text Available The relationship between meanings of words and their sound shapes is to a large extent arbitrary, but it is well known that languages exhibit sound symbolism effects violating arbitrariness. Evidence for sound symbolism is typically anecdotal, however. Here we present a systematic approach. Using a selection of basic vocabulary in nearly one half of the world’s languages we find commonalities among sound shapes for words referring to same concepts. These are interpreted as due to sound symbolism. Studying the effects of sound symbolism cross-linguistically is of key importance for the understanding of language evolution.
Haynes, H.D.
1991-01-01
In support of the NRC Nuclear Plant Aging Research (NPAR) program, the Oak Ridge National Laboratory (ORNL) has carried out an assessment of several check value diagnostic monitoring methods, in particular, those based on measurements of acoustic emission, ultrasonics, and magnetic flux. The evaluations have focussed on the capabilities of each method to provide information useful in determining check valve aging and service wear effects, check valve failures, and undesirable operating modes. This paper describes the benefits and limitations associated with each method and includes recent laboratory and field test data, including data obtained from the vendors who recently participated in a comprehensive series of tests directed by a nuclear industry users group. In addition, as part of the ORNL Advanced Diagnostic Engineering Research and Development Center (ADEC), two novel nonintrusive monitoring methods were developed that provide several unique capabilities. These methods, based on external ac- an dc-magnetic monitoring are also described. None of the examined methods could, by themselves, monitor both the instantaneous position and motion of check valve internals and valve leakage; however, the combination of acoustic emission monitoring with one of the other methods provides the means to determine vital check valve operational information
Estoup Arnaud
2010-07-01
Full Text Available Abstract Background Approximate Bayesian computation (ABC is a recent flexible class of Monte-Carlo algorithms increasingly used to make model-based inference on complex evolutionary scenarios that have acted on natural populations. The software DIYABC offers a user-friendly interface allowing non-expert users to consider population histories involving any combination of population divergences, admixtures and population size changes. We here describe and illustrate new developments of this software that mainly include (i inference from DNA sequence data in addition or separately to microsatellite data, (ii the possibility to analyze five categories of loci considering balanced or non balanced sex ratios: autosomal diploid, autosomal haploid, X-linked, Y-linked and mitochondrial, and (iii the possibility to perform model checking computation to assess the "goodness-of-fit" of a model, a feature of ABC analysis that has been so far neglected. Results We used controlled simulated data sets generated under evolutionary scenarios involving various divergence and admixture events to evaluate the effect of mixing autosomal microsatellite, mtDNA and/or nuclear autosomal DNA sequence data on inferences. This evaluation included the comparison of competing scenarios and the quantification of their relative support, and the estimation of parameter posterior distributions under a given scenario. We also considered a set of scenarios often compared when making ABC inferences on the routes of introduction of invasive species to illustrate the interest of the new model checking option of DIYABC to assess model misfit. Conclusions Our new developments of the integrated software DIYABC should be particularly useful to make inference on complex evolutionary scenarios involving both recent and ancient historical events and using various types of molecular markers in diploid or haploid organisms. They offer a handy way for non-expert users to achieve model checking
Lassègue, Jean
2008-03-01
In his article 'A New View of Language, Emotion and the Brain,' Dan Shanahan claims that the post-war Cognitive Turn focused mainly on information processing and that little attention was paid to the dramatic role played by emotion in human cognition. One key argument in his defence of a more comprehensive view of human cognition rests upon the idea that the process of symbolization--a unique capacity only developed by humans--combines, right from the start, information processing and feelings. The author argues that any theory ignoring this fact would miss the whole point, just as mainstream cognitive science has done since Noam Chomsky published Syntactic Structures, exactly 50 years ago.
Daniela Sacco
2015-11-01
Full Text Available An excerpt from Sergei M. Eisenstein's memoirs describing a night visit to the museum of Chichén Itzá in Mexico is set forth as a real life example reflecting, both from a visual and theoretical perspective, the architecture of Aby Warburg's Bilderatlas Mnemosyne and his concept of Denkraum. Drawing upon Warburg's own writings and F. T. Vischer's theory of symbol, the paper looks at Eisenstein's experience at the museum as highlighting the dynamic relation between man's religious/magical and scientific/rational psychic poles, and the in-between space of thought inherent to the concept of Denkraum and visually represented by the empty dark intervals separating the images in the Bilderatlas. Adding significance to its argumentation, the paper also hints at an affinity between Eisenstein's film montaging and Warburg's image assembling criteria.
Wagoner, Brady
2013-01-01
them vis-à-vis other research at Clark and in American psychology more generally. The second two articles analyse Werner and Kaplan’s notions of ‘distancing’ and ‘physiognomic metaphor’, showing their roots in naturphilosophie and comparing them with contemporary theories. The last four articles apply......Werner and Kaplan’s Symbol formation was published 50 years ago but its insights have yet to be adequately explored by psychology and other social sciences. This special issue aims to revisit this seminal work in search of concepts to work on key issues facing us today. This introductory article...... begins with a brief outline and contextualization of the book as well as of the articles that this special issue comprises. The first two articles were written by contributors who were part of the Werner era at Clark University. They explore the key concepts of the organismic and development, and situate...
From preventive to permissive checks
Weisdorf, Jacob Louis; Sharp, Paul Richard
2009-01-01
The Malthusian "preventive check" mechanism has been well documented for pre-industrial England through evidence for a negative correlation between the marriage rate and the price of wheat. Other literature, however, speculates that the correlation was in fact positive from the early nineteenth c...... model shows that this result is not in fact inconsistent with a stylised Malthusian mechanism, and can be understood within the context of an increasing dominance of shocks to aggregate demand rather than to aggregate supply....
Montano, Joshua Daniel [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-03-23
Coordinate Measuring Machines (CMM) are widely used in industry, throughout the Nuclear Weapons Complex and at Los Alamos National Laboratory (LANL) to verify part conformance to design definition. Calibration cycles for CMMs at LANL are predominantly one year in length. Unfortunately, several nonconformance reports have been generated to document the discovery of a certified machine found out of tolerance during a calibration closeout. In an effort to reduce risk to product quality two solutions were proposed – shorten the calibration cycle which could be costly, or perform an interim check to monitor the machine’s performance between cycles. The CMM interim check discussed makes use of Renishaw’s Machine Checking Gauge. This off-the-shelf product simulates a large sphere within a CMM’s measurement volume and allows for error estimation. Data was gathered, analyzed, and simulated from seven machines in seventeen different configurations to create statistical process control run charts for on-the-floor monitoring.
Scientific applications of symbolic computation
Hearn, A.C.
1976-02-01
The use of symbolic computation systems for problem solving in scientific research is reviewed. The nature of the field is described, and particular examples are considered from celestial mechanics, quantum electrodynamics and general relativity. Symbolic integration and some more recent applications of algebra systems are also discussed [fr
Mohamad reza Yousefi
2013-11-01
Full Text Available Abstract Symbol from the perspective of rhetorical word, is phrase or sentence that apparent meaning, also inspires to reader a wide range of semantic.Since exploring the complex social and political ideas in the most mysticalway and indirectreflectionsocial and political thoughts symbolically is easier, so the symbol and symbolism especially in Persian literatureespeciallyin the realm of Persian poetry, has a special appearance.In addition to the factors mentioned in the contemporary literature, according familiar in literature and the emergence of particular schools interest toambiguoussymbolization has spreadfurther, especially the symbol has all the features of art ambiguity in the poem and it isone the major factors causing uncertainty.Thus, the precise definitions and symbols of contemporary poetry could be dominant in the unwinding ambiguous symbol detection of cryptic allusions and metaphors that matches the cursor symbol to help readers. In the literature, especially language poetry, the inability of language toreflecting obscure mystical ideas, avoid to directexpression of political and social concerns of the reader in the course of participate to creation ambiguous literary works is the main motivation towards symbol and symbolization.According widespread use of symbol and its different of species can be viewed from different perspectives.The creation of ambiguity is the main purposes of using symbols (especially in poetry, so many poets have tried to achieve this goal have to formation of similar symbols and the explanation and resolution of this issue can open new window for understanding the poetry in front of an audience. In this paper examines the ambiguity of symbols in terms of its precise boundaries are reviewed. Ambiguity is one of the important processes and also is the key Iranian poetry its means is today poetry. In such poetry ambiguity is a need to explore the new world from a different perspective, or explore this
Ümit Baran Metin
2015-07-01
Full Text Available Soldiering is defined as engaging behaviourally or cognitively into non-work-related activities during working hours with no intention of harming the employer, co-workers, and/or clients. The present study will investigate this phenomenon using the Job-Demands Resources Model. The proposed model will consider the influence of job demands and resources on soldiering, as well as the relationship of soldiering with employee wellbeing and performance. The data, collected via online questionnaires across seven European countries, will be analysed using structural equation modelling in order to explore the goodness-of-fit of the proposed model as well as its potential cross cultural variations.
The influence of math anxiety on symbolic and non-symbolic magnitude processing.
Dietrich, Julia F; Huber, Stefan; Moeller, Korbinian; Klein, Elise
2015-01-01
Deficits in basic numerical abilities have been investigated repeatedly as potential risk factors of math anxiety. Previous research suggested that also a deficient approximate number system (ANS), which is discussed as being the foundation for later math abilities, underlies math anxiety. However, these studies examined this hypothesis by investigating ANS acuity using a symbolic number comparison task. Recent evidence questions the view that ANS acuity can be assessed using a symbolic number comparison task. To investigate whether there is an association between math anxiety and ANS acuity, we employed both a symbolic number comparison task and a non-symbolic dot comparison task, which is currently the standard task to assess ANS acuity. We replicated previous findings regarding the association between math anxiety and the symbolic distance effect for response times. High math anxious individuals showed a larger distance effect than less math anxious individuals. However, our results revealed no association between math anxiety and ANS acuity assessed using a non-symbolic dot comparison task. Thus, our results did not provide evidence for the hypothesis that a deficient ANS underlies math anxiety. Therefore, we propose that a deficient ANS does not constitute a risk factor for the development of math anxiety. Moreover, our results suggest that previous interpretations regarding the interaction of math anxiety and the symbolic distance effect have to be updated. We suggest that impaired number comparison processes in high math anxious individuals might account for the results rather than deficient ANS representations. Finally, impaired number comparison processes might constitute a risk factor for the development of math anxiety. Implications for current models regarding the origins of math anxiety are discussed.
The influence of math anxiety on symbolic and non-symbolic magnitude processing
Julia Felicitas Dietrich
2015-10-01
Full Text Available Deficits in basic numerical abilities have been investigated repeatedly as potential risk factors of math anxiety. Previous research suggested that also a deficient approximate number system (ANS, which is discussed as being the foundation for later math abilities, underlies math anxiety. However, these studies examined this hypothesis by investigating ANS acuity using a symbolic number comparison task. Recent evidence questions the view that ANS acuity can be assessed using a symbolic number comparison task. To investigate whether there is an association between math anxiety and ANS acuity, we employed both a symbolic number comparison task and a non-symbolic dot comparison task, which is currently the standard task to assess ANS acuity. We replicated previous findings regarding the association between math anxiety and the symbolic distance effect for response times. High math anxious individuals showed a larger distance effect than less math anxious individuals. However, our results revealed no association between math anxiety and ANS acuity assessed using a non-symbolic dot comparison task. Thus, our results did not provide evidence for the hypothesis that a deficient ANS underlies math anxiety. Therefore, we propose that a deficient ANS does not constitute a risk factor for the development of math anxiety. Moreover, our results suggest that previous interpretations regarding the interaction of math anxiety and the symbolic distance effect have to be updated. We suggest that impaired number comparison processes in high math anxious individuals might account for the results rather than deficient ANS representations. Finally, impaired number comparison processes might constitute a risk factor for the development of math anxiety. Implications for current models regarding the origins of math anxiety are discussed.
Checking BEBC superconducting magnet
CERN PhotoLab
1974-01-01
The superconducting coils of the magnet for the 3.7 m Big European Bubble Chamber (BEBC) had to be checked, see Annual Report 1974, p. 60. The photo shows a dismantled pancake. By December 1974 the magnet reached again the field design value of 3.5 T.
Hart, Joseph T.
Two basic tests for checking memory skills are included in these appendices. The first, the General Information Test, uses the same 150 items for each of its two versions. One version is a completion-type test which measures recall by requiring the examinee to supply a specific response. The other version supplements each of the 150 items with…
Alter, David; Grenache, David G; Bosler, David S; Karcher, Raymond E; Nichols, James; Rajadhyaksha, Aparna; Camelo-Piragua, Sandra; Rauch, Carol; Huddleston, Brent J; Frank, Elizabeth L; Sluss, Patrick M; Lewandrowski, Kent; Eichhorn, John H; Hall, Janet E; Rahman, Saud S; McPherson, Richard A; Kiechle, Frederick L; Hammett-Stabler, Catherine; Pierce, Kristin A; Kloehn, Erica A; Thomas, Patricia A; Walts, Ann E; Madan, Rashna; Schlesinger, Kathie; Nawgiri, Ranjana; Bhutani, Manoop; Kanber, Yonca; Abati, Andrea; Atkins, Kristen A; Farrar, Robert; Gopez, Evelyn Valencerina; Jhala, Darshana; Griffin, Sonya; Jhala, Khushboo; Jhala, Nirag; Bentz, Joel S; Emerson, Lyska; Chadwick, Barbara E; Barroeta, Julieta E; Baloch, Zubair W; Collins, Brian T; Middleton, Owen L; Davis, Gregory G; Haden-Pinneri, Kathryn; Chu, Albert Y; Keylock, Joren B; Ramoso, Robert; Thoene, Cynthia A; Stewart, Donna; Pierce, Arand; Barry, Michelle; Aljinovic, Nika; Gardner, David L; Barry, Michelle; Shields, Lisa B E; Arnold, Jack; Stewart, Donna; Martin, Erica L; Rakow, Rex J; Paddock, Christopher; Zaki, Sherif R; Prahlow, Joseph A; Stewart, Donna; Shields, Lisa B E; Rolf, Cristin M; Falzon, Andrew L; Hudacki, Rachel; Mazzella, Fermina M; Bethel, Melissa; Zarrin-Khameh, Neda; Gresik, M Vicky; Gill, Ryan; Karlon, William; Etzell, Joan; Deftos, Michael; Karlon, William J; Etzell, Joan E; Wang, Endi; Lu, Chuanyi M; Manion, Elizabeth; Rosenthal, Nancy; Wang, Endi; Lu, Chuanyi M; Tang, Patrick; Petric, Martin; Schade, Andrew E; Hall, Geraldine S; Oethinger, Margret; Hall, Geraldine; Picton, Avis R; Hoang, Linda; Imperial, Miguel Ranoa; Kibsey, Pamela; Waites, Ken; Duffy, Lynn; Hall, Geraldine S; Salangsang, Jo-Anne M; Bravo, Lulette Tricia C; Oethinger, Margaret D; Veras, Emanuela; Silva, Elvia; Vicens, Jimena; Silva, Elvio; Keylock, Joren; Hempel, James; Rushing, Elizabeth; Posligua, Lorena E; Deavers, Michael T; Nash, Jason W; Basturk, Olca; Perle, Mary Ann; Greco, Alba; Lee, Peng; Maru, Dipen; Weydert, Jamie Allen; Stevens, Todd M; Brownlee, Noel A; Kemper, April E; Williams, H James; Oliverio, Brock J; Al-Agha, Osama M; Eskue, Kyle L; Newlands, Shawn D; Eltorky, Mahmoud A; Puri, Puja K; Royer, Michael C; Rush, Walter L; Tavora, Fabio; Galvin, Jeffrey R; Franks, Teri J; Carter, James Elliot; Kahn, Andrea Graciela; Lozada Muñoz, Luis R; Houghton, Dan; Land, Kevin J; Nester, Theresa; Gildea, Jacob; Lefkowitz, Jerry; Lacount, Rachel A; Thompson, Hannis W; Refaai, Majed A; Quillen, Karen; Lopez, Ana Ortega; Goldfinger, Dennis; Muram, Talia; Thompson, Hannis
2009-02-01
The following abstracts are compiled from Check Sample exercises published in 2008. These peer-reviewed case studies assist laboratory professionals with continuing medical education and are developed in the areas of clinical chemistry, cytopathology, forensic pathology, hematology, microbiology, surgical pathology, and transfusion medicine. Abstracts for all exercises published in the program will appear annually in AJCP.
Generating and Solving Symbolic Parity Games
Gijs Kant
2014-07-01
Full Text Available We present a new tool for verification of modal mu-calculus formulae for process specifications, based on symbolic parity games. It enhances an existing method, that first encodes the problem to a Parameterised Boolean Equation System (PBES and then instantiates the PBES to a parity game. We improved the translation from specification to PBES to preserve the structure of the specification in the PBES, we extended LTSmin to instantiate PBESs to symbolic parity games, and implemented the recursive parity game solving algorithm by Zielonka for symbolic parity games. We use Multi-valued Decision Diagrams (MDDs to represent sets and relations, thus enabling the tools to deal with very large systems. The transition relation is partitioned based on the structure of the specification, which allows for efficient manipulation of the MDDs. We performed two case studies on modular specifications, that demonstrate that the new method has better time and memory performance than existing PBES based tools and can be faster (but slightly less memory efficient than the symbolic model checker NuSMV.
Symbolic analysis of spatio-temporal systems: The measurement problem
Brown, R.; Tang, Xianzhu; Tracy, E.R.
1996-01-01
We consider the problem of measuring physical quantities using time-series observations. The approach taken is to validate theoretical models which are derived heuristically or from first principles. The fitting of parameters in such models constitutes the measurement. This is a basic problem in measurement science and a wide array of tools are available. However, an important gap in the present toolkit exists when the system of interest, and hence the models used, exhibit chaotic or turbulent behavior. The development of reliable schemes for analyzing such signals is necessary before one can claim to have a quantitative understanding of the underlying physics. In experimental situations, the number of independently measured time-series is limited, but the number of dynamical degrees of freedom can be large. In addition, the signals of interest will typically be embedded in a noisy background. In the symbol statistics approach, the time-series is coarse-grained and converted into a long, symbol stream. The probability of occurrence of various symbol sequences of fixed length constitutes the symbol statistics. These statistics contain a wealth of information about the underlying dynamics and, as we shall discuss, can be used to validate models. Previously, we have applied this symbolic approach to low dimensional systems with great success. The symbol statistics are robust up to noise/signal ∼20%. At higher noise levels the symbol statistics are biased, but in a relatively simple manner. By including the noise characteristics into the model, we were able to use the symbol statistics to measure parameters even when signal/noise is ∼ O(1). More recently, we have extended the symbolic approach to spatio-temporal systems. We have considered both coupled-map lattices and the complex Ginzburg-Landau equation. This equation arises generically near the onset of instabilities
Narotam, Pradeep K; Morrison, John F; Schmidt, Michael D; Nathoo, Narendra
2014-04-01
Predictive modeling of emergent behavior, inherent to complex physiological systems, requires the analysis of large complex clinical data streams currently being generated in the intensive care unit. Brain tissue oxygen protocols have yielded outcome benefits in traumatic brain injury (TBI), but the critical physiological thresholds for low brain oxygen have not been established for a dynamical patho-physiological system. High frequency, multi-modal clinical data sets from 29 patients with severe TBI who underwent multi-modality neuro-clinical care monitoring and treatment with a brain oxygen protocol were analyzed. The inter-relationship between acute physiological parameters was determined using symbolic regression (SR) as the computational framework. The mean patient age was 44.4±15 with a mean admission GCS of 6.6±3.9. Sixty-three percent sustained motor vehicle accidents and the most common pathology was intra-cerebral hemorrhage (50%). Hospital discharge mortality was 21%, poor outcome occurred in 24% of patients, and good outcome occurred in 56% of patients. Criticality for low brain oxygen was intracranial pressure (ICP) ≥22.8 mm Hg, for mortality at ICP≥37.1 mm Hg. The upper therapeutic threshold for cerebral perfusion pressure (CPP) was 75 mm Hg. Eubaric hyperoxia significantly impacted partial pressure of oxygen in brain tissue (PbtO2) at all ICP levels. Optimal brain temperature (Tbr) was 34-35°C, with an adverse effect when Tbr≥38°C. Survivors clustered at [Formula: see text] Hg vs. non-survivors [Formula: see text] 18 mm Hg. There were two mortality clusters for ICP: High ICP/low PbtO2 and low ICP/low PbtO2. Survivors maintained PbtO2 at all ranges of mean arterial pressure in contrast to non-survivors. The final SR equation for cerebral oxygenation is: [Formula: see text]. The SR-model of acute TBI advances new physiological thresholds or boundary conditions for acute TBI management: PbtO2≥25 mmHg; ICP≤22 mmHg; CPP≈60-75
Levin, V. L.; Yuan, H.
2011-12-01
A newly developed 3D model of shear wave velocity and anisotropy beneath the North American continent (Yuan et al, 2011) offers a Solomonic solution to the long-standing dispute regarding the provenance of seismic anisotropy, with directional dependency of wave speed placed into both the lithosphere and the asthenosphere. However, due to its continent-wide coverage, the new model has lateral resolution on the scale of 500 km and is expected to average, and thus misrepresent, structure in regions with abrupt lateral changes in properties. The north-eastern US, especially along the coast, presents an example of such complex region. One of the earliest cases for stratified anisotropy was built on data from this part of North America (Levin et al., 1999), and also this is a region with significant, and enigmatic, lateral changes in isotropic velocity (van der Lee and Nolet, 1997; Nettles and Dziewonski, 2008). A decade since the initial studies of the region were performed, we have vastly more data that facilitate a new look at the seismic anisotropy parameters of the upper mantle beneath this region. We use shear wave splitting observations and anisotropy-aware receiver functions to develop high-quality constraints on the vertical and lateral variation in attributes of anisotropy, which we then compare (and contrast) with structure predicted for this region by the Yuan et al. (2011) model. Our goals are both to test the new model in one place, and to develop a strategy for such testing. Our primary data set comes from one of the longest-operating broad-band stations, HRV (Harvard, MA). Here, P wave receiver functions (PRFs) confirm the presence of features previously associated with the LAB and a mid-lithosphere discontinuity by Rychert et al. (2007). Notably, both features have very significant anisotropic components, with likely orientation of anisotropic symmetry axes being ~130SE or ~220SW. Similar symmetry is seen in PRFs constructed for other nearby sites
Social Symbolic Work in Context
Brincker, Benedikte
‘the good organisation’ may offer a supportive organisational framework for social symbolic work, thus promoting regional development in peripheral and poorly developed regions. Exploring what qualifies as a ‘good organisation’, the paper identifies three key elements: management, motivation......This paper reports on a research project that explores social symbolic work. The social symbolic work in question seeks to introduce education in entrepreneurship into the school curriculum in a remote part of Greenland – in order to contribute to regional development. The paper investigates how...
Proportional Symbol Mapping in R
Susumu Tanimura
2006-01-01
Full Text Available Visualization of spatial data on a map aids not only in data exploration but also in communication to impart spatial conception or ideas to others. Although recent carto-graphic functions in R are rapidly becoming richer, proportional symbol mapping, which is one of the common mapping approaches, has not been packaged thus far. Based on the theories of proportional symbol mapping developed in cartography, the authors developed some functions for proportional symbol mapping using R, including mathematical and perceptual scaling. An example of these functions demonstrated the new expressive power and options available in R, particularly for the visualization of conceptual point data.
Eminger, H.E.
1977-01-01
A swing check valve which includes a valve body having an inlet and outlet is described. A recess in the valve body designed to hold a seal ring and a check valve disc swingable between open and closed positions. The disc is supported by a high strength wire secured at one end in a support spacer pinned through bearing blocks fixed to the valve body and at its other end in a groove formed on the outer peripheral surface of the disc. The parts are designed and chosen such to provide a lightweight valve disc which is held open by minimum velocity of fluid flowing through the valve which thus reduces oscillations and accompanying wear of bearings supporting the valve operating parts. (Auth.)
Check Verbraucherpolitik und Verbraucherbeteiligung
Hagen, Kornelia; Micklitz, Hans-W.; Oehler, Andreas
2013-01-01
The paper discusses the opportunities for an empirically grounded decision support system as an instrument for independent and scientifically based consumer policy consulting. To date, consumer policy is dominated by the information paradigm and the leitbild of the rational, sovereign...... and information-seeking consumer. Yet, both everyday practice and research in behavioural economics show that this view lacks empirical ground. In fact, there are different consumer types and different forms of rationalities at work. Effective consumer policy making should be based on the empirically revealed...... an empirically based “Check Consumer Policy and Consumer Participation” as a systematic decision and evaluation tool for policy makers. This check should be independent from the government and should be grounded on an empirical view of the consumer. Consumer policy tools should be tested with real consumers...
Magnetically operated check valve
Morris, Brian G.; Bozeman, Richard J., Jr.
1994-06-01
A magnetically operated check valve is disclosed. The valve is comprised of a valve body and a movable poppet disposed therein. A magnet attracts the poppet to hold the valve shut until the force of fluid flow through the valve overcomes the magnetic attraction and moves the poppet to an unseated, open position. The poppet and magnet are configured and disposed to trap a magnetically attracted particulate and prevent it from flowing to a valve seating region.
Abstract Expression Grammar Symbolic Regression
Korns, Michael F.
This chapter examines the use of Abstract Expression Grammars to perform the entire Symbolic Regression process without the use of Genetic Programming per se. The techniques explored produce a symbolic regression engine which has absolutely no bloat, which allows total user control of the search space and output formulas, which is faster, and more accurate than the engines produced in our previous papers using Genetic Programming. The genome is an all vector structure with four chromosomes plus additional epigenetic and constraint vectors, allowing total user control of the search space and the final output formulas. A combination of specialized compiler techniques, genetic algorithms, particle swarm, aged layered populations, plus discrete and continuous differential evolution are used to produce an improved symbolic regression sytem. Nine base test cases, from the literature, are used to test the improvement in speed and accuracy. The improved results indicate that these techniques move us a big step closer toward future industrial strength symbolic regression systems.
Applications of symbolic algebraic computation
Brown, W.S.; Hearn, A.C.
1979-01-01
This paper is a survey of applications of systems for symbomic algebraic computation. In most successful applications, calculations that can be taken to a given order by hand are then extended one or two more orders by computer. Furthermore, with a few notable exceptins, these applications also involve numerical computation in some way. Therefore the authors emphasize the interface between symbolic and numerical computation, including: 1. Computations with both symbolic and numerical phases. 2. Data involving both the unpredictible size and shape that typify symbolic computation and the (usually inexact) numerical values that characterize numerical computation. 3. Applications of one field to the other. It is concluded that the fields of symbolic and numerical computation can advance most fruitfully in harmony rather than in competition. (Auth.)
Symbol Recognition using Spatial Relations
K.C., Santosh; Lamiroy, Bart; Wendling, Laurent
2012-01-01
International audience; In this paper, we present a method for symbol recognition based on the spatio-structural description of a 'vocabulary' of extracted visual elementary parts. It is applied to symbols in electrical wiring diagrams. The method consists of first identifying vocabulary elements into different groups based on their types (e.g., circle, corner ). We then compute spatial relations between the possible pairs of labelled vocabulary types which are further used as a basis for bui...
A Bayesian classifier for symbol recognition
Barrat , Sabine; Tabbone , Salvatore; Nourrissier , Patrick
2007-01-01
URL : http://www.buyans.com/POL/UploadedFile/134_9977.pdf; International audience; We present in this paper an original adaptation of Bayesian networks to symbol recognition problem. More precisely, a descriptor combination method, which enables to improve significantly the recognition rate compared to the recognition rates obtained by each descriptor, is presented. In this perspective, we use a simple Bayesian classifier, called naive Bayes. In fact, probabilistic graphical models, more spec...
Pack, Robert C.; Standiford, Keith; Lukanc, Todd; Ning, Guo Xiang; Verma, Piyush; Batarseh, Fadi; Chua, Gek Soon; Fujimura, Akira; Pang, Linyong
2014-10-01
A methodology is described wherein a calibrated model-based `Virtual' Variable Shaped Beam (VSB) mask writer process simulator is used to accurately verify complex Optical Proximity Correction (OPC) and Inverse Lithography Technology (ILT) mask designs prior to Mask Data Preparation (MDP) and mask fabrication. This type of verification addresses physical effects which occur in mask writing that may impact lithographic printing fidelity and variability. The work described here is motivated by requirements for extreme accuracy and control of variations for today's most demanding IC products. These extreme demands necessitate careful and detailed analysis of all potential sources of uncompensated error or variation and extreme control of these at each stage of the integrated OPC/ MDP/ Mask/ silicon lithography flow. The important potential sources of variation we focus on here originate on the basis of VSB mask writer physics and other errors inherent in the mask writing process. The deposited electron beam dose distribution may be examined in a manner similar to optical lithography aerial image analysis and image edge log-slope analysis. This approach enables one to catch, grade, and mitigate problems early and thus reduce the likelihood for costly long-loop iterations between OPC, MDP, and wafer fabrication flows. It moreover describes how to detect regions of a layout or mask where hotspots may occur or where the robustness to intrinsic variations may be improved by modification to the OPC, choice of mask technology, or by judicious design of VSB shots and dose assignment.
22 CFR 42.11 - Classification symbols.
2010-04-01
... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Classification symbols. 42.11 Section 42.11... NATIONALITY ACT, AS AMENDED Classification and Foreign State Chargeability § 42.11 Classification symbols. A... visa symbol to show the classification of the alien. Immigrants Symbol Class Section of law Immediate...
Symbol synchronization in convolutionally coded systems
Baumert, L. D.; Mceliece, R. J.; Van Tilborg, H. C. A.
1979-01-01
Alternate symbol inversion is sometimes applied to the output of convolutional encoders to guarantee sufficient richness of symbol transition for the receiver symbol synchronizer. A bound is given for the length of the transition-free symbol stream in such systems, and those convolutional codes are characterized in which arbitrarily long transition free runs occur.
7 CFR 29.1008 - Combination symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Combination symbols. 29.1008 Section 29.1008..., 13, 14 and Foreign Type 92) § 29.1008 Combination symbols. A color or group symbol used with another symbol to form the third factor of a grademark to denote a particular side or characteristic of the...
40 CFR 86.327-79 - Quench checks; NOX analyzer.
2010-07-01
... any flow rate into the reaction chamber. This includes, but is not limited to, sample capillary, ozone... Quench checks; NOX analyzer. (a) Perform the reaction chamber quench check for each model of high vacuum reaction chamber analyzer prior to initial use. (b) Perform the reaction chamber quench check for each new...
Morris, Brian G.; Bozeman, Richard J., Jr.
1994-01-01
Poppet in proposed check valve restored to closed condition by magnetic attraction instead of spring force. Oscillations suppressed, with consequent reduction of wear. Stationary magnetic disk mounted just upstream of poppet, also containing magnet. Valve body nonmagnetic. Forward pressure or flow would push poppet away from stationary magnetic disk so fluid flows easily around poppet. Stop in valve body prevents poppet from being swept away. When flow stopped or started to reverse, magnetic attraction draws poppet back to disk. Poppet then engages floating O-ring, thereby closing valve and preventing reverse flow. Floating O-ring facilitates sealing at low loads.
Symbolic BDD and ADD Algorithms for Energy Games
Shahar Maoz
2016-11-01
Full Text Available Energy games, which model quantitative consumption of a limited resource, e.g., time or energy, play a central role in quantitative models for reactive systems. Reactive synthesis constructs a controller which satisfies a given specification, if one exists. For energy games a synthesized controller ensures to satisfy not only the safety constraints of the specification but also the quantitative constraints expressed in the energy game. A symbolic algorithm for energy games, recently presented by Chatterjee et al., is symbolic in its representation of quantitative values but concrete in the representation of game states and transitions. In this paper we present an algorithm that is symbolic both in the quantitative values and in the underlying game representation. We have implemented our algorithm using two different symbolic representations for reactive games, Binary Decision Diagrams (BDD and Algebraic Decision Diagrams (ADD. We investigate the commonalities and differences of the two implementations and compare their running times on specifications of energy games.
Madjid, F. Hadi; Myers, John M.
2016-10-01
The world runs on networks over which signals communicate sequences of symbols, e.g. numerals. Examining both engineered and natural communications networks reveals an unsuspected order that depends on contact with an unpredictable entity. This order has three roots. The first is a proof within quantum theory that no evidence can ever determine its explanation, so that an agent choosing an explanation must do so unpredictably. The second root is the showing that clocks that step computers do not "tell time" but serve as self-adjusting symbol-handling agents that regulate "logically synchronized" motion in response to unpredictable disturbances. Such a clock-agent has a certain independence as well as the capacity to communicate via unpredictable symbols with other clock-agents and to adjust its own tick rate in response to that communication. The third root is the noticing of unpredictable symbol exchange in natural systems, including the transmission of symbols found in molecular biology. We introduce a symbol-handling agent as a role played in some cases by a person, for example a physicist who chooses an explanation of given experimental outcomes, and in other cases by some other biological entity, and in still other cases by an inanimate device, such as a computer-based detector used in physical measurements. While we forbear to try to explain the propensity of agents at all levels from cells to civilizations to form and operate networks of logically synchronized symbol-handling agents, we point to this propensity as an overlooked cosmic order, an order structured by the unpredictability ensuing from the proof. Appreciating the cosmic order leads to a conception of agency that replaces volition by unpredictability and reconceives the notion of objectivity in a way that makes a place for agency in the world as described by physics. Some specific implications for physics are outlined.
Dek, E.C.P.
2015-01-01
Obsessive-compulsive disorder (OCD) is characterized by persistent doubt. The majority of patients with OCD engage in repeated checking to reduce these feelings of uncertainty. However, numerous studies demonstrated that repetitive behavior ironically increases uncertainty: perseverative checking
Model Checking Multivariate State Rewards
Nielsen, Bo Friis; Nielson, Flemming; Nielson, Hanne Riis
2010-01-01
We consider continuous stochastic logics with state rewards that are interpreted over continuous time Markov chains. We show how results from multivariate phase type distributions can be used to obtain higher-order moments for multivariate state rewards (including covariance). We also generalise...
Program Analysis as Model Checking
Olesen, Mads Chr.
Software programs are proliferating throughout modern life, to a point where even the simplest appliances such as lightbulbs contain software, in addition to the software embedded in cars and airplanes. The correct functioning of these programs is therefore of the utmost importance, for the quality...
Repeated checking causes memory distrust
van den Hout, M.; Kindt, M.
2003-01-01
This paper attempts to explain why in obsessive-compulsive disorder (OCD) checkers distrust in memory persists despite extensive checking. It is argued that: (1) repeated checking increases familiarity with the issues checked; (2) increased familiarity promotes conceptual processing which inhibits
The symbolic economy of drugs.
Lentacker, Antoine
2016-02-01
This essay reviews four recent studies representing a new direction in the history of pharmaceuticals and pharmaceutical science. To this end, it introduces the notion of a symbolic economy of drugs, defined as the production, circulation, and reception of signs that convey information about drugs and establish trust in them. Each of the studies under review focuses on one key signifier in this symbolic economy, namely the brand, the patent, the clinical trial, and the drug itself. Drawing on Pierre Bourdieu's theory of the economy of symbolic goods, I conceptualize these signifiers as symbolic assets, that is, as instruments of communication and credit, delivering knowledge, carrying value, and producing authority. The notion of a symbolic economy is offered with a threefold intention. First, I introduce it in order to highlight the implications of historical and anthropological work for a broader theory of the economy of drugs, thus suggesting a language for interdisciplinary conversations in the study of pharmaceuticals. Second, I deploy it in an attempt to emphasize the contributions of the recent scholarship on drugs to a critical understanding of our own contemporary ways of organizing access to drugs and information about drugs. Finally, I suggest ways in which it might be of use to scholars of other commodities and technologies.
Non intrusive check valve diagnostics at Bruce A
Marsch, S.P.
1997-01-01
Bruce A purchased non intrusive check valve diagnostic equipment in 1995 to ensure operability and availability of critical check valves in the Station. Diagnostics can be used to locate and monitor check valve degradation modes. Bruce A initiated a pilot program targeting check valves with flow through them and ones that completed open or close cycles. Approaches to determine how to confirm operability of passive check valves using non intrusive techniques were explored. A sample population of seventy-three check valves was selected to run the pilot program on prior to complete implementation. The pilot program produced some significant results and some inconclusive results. The program revealed a major finding that check valve performance modeling is required to ensure continuous operability of check valves. (author)
Non intrusive check valve diagnostics at Bruce A
Marsch, S.P. [Ontario Hydro, Bruce Nuclear Generating Station A, Tiverton, ON (Canada)
1997-07-01
Bruce A purchased non intrusive check valve diagnostic equipment in 1995 to ensure operability and availability of critical check valves in the Station. Diagnostics can be used to locate and monitor check valve degradation modes. Bruce A initiated a pilot program targeting check valves with flow through them and ones that completed open or close cycles. Approaches to determine how to confirm operability of passive check valves using non intrusive techniques were explored. A sample population of seventy-three check valves was selected to run the pilot program on prior to complete implementation. The pilot program produced some significant results and some inconclusive results. The program revealed a major finding that check valve performance modeling is required to ensure continuous operability of check valves. (author)
Diagrams benefit symbolic problem-solving.
Chu, Junyi; Rittle-Johnson, Bethany; Fyfe, Emily R
2017-06-01
The format of a mathematics problem often influences students' problem-solving performance. For example, providing diagrams in conjunction with story problems can benefit students' understanding, choice of strategy, and accuracy on story problems. However, it remains unclear whether providing diagrams in conjunction with symbolic equations can benefit problem-solving performance as well. We tested the impact of diagram presence on students' performance on algebra equation problems to determine whether diagrams increase problem-solving success. We also examined the influence of item- and student-level factors to test the robustness of the diagram effect. We worked with 61 seventh-grade students who had received 2 months of pre-algebra instruction. Students participated in an experimenter-led classroom session. Using a within-subjects design, students solved algebra problems in two matched formats (equation and equation-with-diagram). The presence of diagrams increased equation-solving accuracy and the use of informal strategies. This diagram benefit was independent of student ability and item complexity. The benefits of diagrams found previously for story problems generalized to symbolic problems. The findings are consistent with cognitive models of problem-solving and suggest that diagrams may be a useful additional representation of symbolic problems. © 2017 The British Psychological Society.
Advanced symbolic analysis for VLSI systems methods and applications
Shi, Guoyong; Tlelo Cuautle, Esteban
2014-01-01
This book provides comprehensive coverage of the recent advances in symbolic analysis techniques for design automation of nanometer VLSI systems. The presentation is organized in parts of fundamentals, basic implementation methods and applications for VLSI design. Topics emphasized include statistical timing and crosstalk analysis, statistical and parallel analysis, performance bound analysis and behavioral modeling for analog integrated circuits . Among the recent advances, the Binary Decision Diagram (BDD) based approaches are studied in depth. The BDD-based hierarchical symbolic analysis approaches, have essentially broken the analog circuit size barrier. In particular, this book • Provides an overview of classical symbolic analysis methods and a comprehensive presentation on the modern BDD-based symbolic analysis techniques; • Describes detailed implementation strategies for BDD-based algorithms, including the principles of zero-suppression, variable ordering and canonical reduction; • Int...
A STUDY OF SYMBOLIC RELATIONS IN PUBLIC TRANSPORT
ANDREI BALAN
2011-04-01
Full Text Available This paper presents an anthropological, exploratory study of the microsocial world of public transport. Our research focuses on the symbolic relations that are being established (verbally or nonverbally between urban transport travellers that do not know each other and the consequences these relations create. Modern urban configuration forces large numbers of individuals to share public space every day. When this space becomes restrictive, symbolic relations and interpersonal behaviors such as territoriality and personal space management become clearer. Due to overcrowding, public transport is the scene of one of the most restrictive public spaces in a city. The challenge was to observe and interpret daily, casual behaviors through a sociological and psychological scheme, following the methodological tradition established by Erving Goffman and the other symbolic interactionists. Finally, our study generates a number of hypotheses and explanatory models for common practices and behaviors in trams and metros regarded from a symbolic perspective.
Bevilacqua, F.
1978-01-01
A pressurized nuclear reactor having an instrument assembly sheathed in a metallic tube which is extended vertically upward into the reactor core by traversing a metallic guide tube which is welded to the wall of the vessel is described. Sensors in each instrument assembly are connected to instruments outside the vessel to manifest the conditions within the core. Each instrument assembly probe is moved into position within a metallic guide channel. The guide channel penetrates the wall of the vessel and forms part of the barrier to the environment within the pressure vessel. Each channel includes a ball check valve which is opened by the instrument assembly probe when the probe passes through the valve. A ball valve element is moved from its seat by the probe to a position lateral of the bore of the channel and is guided to its seat along a sloped path within the valve body when the probe is removed. 5 claims, 3 figures
The mathematica guidebook for symbolics
Trott, Michael
2006-01-01
Mathematica is today's most advanced technical computing system. It features a rich programming environment, two-and three-dimensional graphics capabilities and hundreds of sophisticated, powerful programming and mathematical functions using state-of-the-art algorithms. Combined with a user-friendly interface, and a complete mathematical typesetting system, Mathematica offers an intuitive easy-to-handle environment of great power and utility. "The Mathematica GuideBook for Symbolics" (code and text fully tailored for Mathematica 5.1) deals with Mathematica's symbolic mathematical capabilities. Structural and mathematical operations on single and systems of polynomials are fundamental to many symbolic calculations and they are covered in considerable detail. The solution of equations and differential equations, as well as the classical calculus operations (differentiation, integration, summation, series expansion, limits) are exhaustively treated. Generalized functions and their uses are discussed. In addition...
On the Symbolic Verification of Timed Systems
Moeller, Jesper; Lichtenberg, Jacob; Andersen, Henrik Reif
1999-01-01
This paper describes how to analyze a timed system symbolically. That is, given a symbolic representation of a set of (timed) states (as an expression), we describe how to determine an expression that represents the set of states that can be reached either by firing a discrete transition...... or by advancing time. These operations are used to determine the set of reachable states symbolically. We also show how to symbolically determine the set of states that can reach a given set of states (i.e., a backwards step), thus making it possible to verify TCTL-formulae symbolically. The analysis is fully...... symbolic in the sense that both the discrete and the continuous part of the state space are represented symbolically. Furthermore, both the synchronous and asynchronous concurrent composition of timed systems can be performed symbolically. The symbolic representations are given as formulae expressed...
A complex symbol signal-to-noise ratio estimator and its performance
Feria, Y.
1994-01-01
This article presents an algorithm for estimating the signal-to-noise ratio (SNR) of signals that contain data on a downconverted suppressed carrier or the first harmonic of a square-wave subcarrier. This algorithm can be used to determine the performance of the full-spectrum combiner for the Galileo S-band (2.2- to 2.3-GHz) mission by measuring the input and output symbol SNR. A performance analysis of the algorithm shows that the estimator can estimate the complex symbol SNR using 10,000 symbols at a true symbol SNR of -5 dB with a mean of -4.9985 dB and a standard deviation of 0.2454 dB, and these analytical results are checked by simulations of 100 runs with a mean of -5.06 dB and a standard deviation of 0.2506 dB.
Dream Symbol or Dream Process?
Himelstein, Philip
1984-01-01
Discusses the relationship of the symbolic content of dreams to the theory of the dream in psychoanalysis and Gestalt therapy. Points out that the utility of the dream depends upon the techniques of the therapist and not on the validity of the underlying theory of the dream. (LLL)
Symbolic power, robotting, and surveilling
Skovsmose, Ole
2012-01-01
describes as it prioritises is discussed with reference to robotting and surveillance. In general, the symbolic power of mathematics and formal languages is summarised through the observations: that mathematics treats parts and properties as autonomous, that it dismembers what it addresses and destroys...
Symbol signing design for older drivers
1997-07-01
This project evaluated the effectiveness of symbol traffic signs for young, middle-aged and elderly drivers. Daytime legibility distance and comprehension of 85 symbols in the Manual on Uniform Traffic Control Devices (MUTCD) were measured. Legibilit...
Consumers recall and recognition for brand symbols
Subhani, Muhammad Imtiaz; Hasan, Syed Akif; Osman, Ms. Amber
2012-01-01
Brand Symbols are important for any brand in helping consumers to remember one’s brand at the point of purchase. In advertising different ways are used to grab attention in consumers’ mind and majorly it’s through brand recall and recognition. This research captivates the Brand Symbol concept and determines whether symbols play an important role in creating a differential impact with other brands. Secondly, it also answers that whether brand symbol is the cause of creating positive associatio...
The Analysis of Mythological Symbols in Shahnameh
موسی پرنیان
2012-05-01
Full Text Available Recognizing symbols of Shahnameh requires an understanding of the context and condition of creation and emergence of symbol, myth and epic. Symbol has a relationship with consciousness and unconsciousness of man and constitutes the language of mythologies, legends, and epics. Thus the language of mythological and epic works is symbolic. The main theme in Iranian mythologies is the dual nature of creation, and during the passage from myth to epic the conflict between the two forces of good and evil appear in various aspects of existence. Some characters that represent symbolic and coded concepts more than other elements can be considered as symbols of the evolution of gods to kings and against them there are devilish kings as symbols of drought (Apush. The other symbolic elements analyzed in this study are: epic-romance stories, imaginary creatures, symbolic dreams of kings and heroes, symbolic numbers, symbolic patterns of flags, the symbolism of water, fire and charisma The findings of the study illustrate that people, more than other elements, are the constitutive elements of mythological symbols, and the tension between these human elements depicts the mutual conflict between good and evil in Ferdowsiâs Shahnameh. Like other elements, symbolic characters (especially kings are of symbolic value and constitute a part of constructing elements of mythological symbols in Shahname. Moreover their reputation is dependent on the extent of their benefit from âGod charismaâ as the most pivotal element of their personality. Kings like Afrasiab and Zahak, due to lack of it, are the most disreputable kings. On the other hand, Fereidoon and Kaikhosro are on the top of the most reputable kings because of continuous benefit from that. This study has been conducted on the basis of library resources and has applied a descriptive-analytic method.
Information measures and uncertainty of particular symbols
Mareš, Milan
2011-01-01
Roč. 47, č. 1 (2011), s. 144-163 ISSN 0023-5954 R&D Projects: GA MŠk(CZ) 1M0572; GA ČR GA402/08/0618 Institutional research plan: CEZ:AV0Z10750506 Keywords : Information source * Information measure * Uncertainty modelling Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.454, year: 2011 http://library.utia.cas.cz/separaty/2011/E/mares-information measures and uncertainty of particular symbols.pdf
Simulations of Stagewise Development with a Symbolic Architecture
Gobet, Fernand
This chapter compares Piaget's theory of development with Feigenbaum & Simon's (1962; 1984) EPAM theory. An attempt is made to map the concepts of assimilation and accommodation in Piaget's theory onto the concepts of familiarisation and accommodation in EPAM. An EPAM-like model of the balance scale task is then presented, with a discussion of preliminary results showing how it accounts for children's discontinuous, stage-like development. The analysis focuses on the transition between rules, using catastrophe flags (Gilmore, 1981) as criteria. It is argued that some symbolic models may be described as dynamical systems, in the same way as some non-symbolic models.
Symbol recognition with kernel density matching.
Zhang, Wan; Wenyin, Liu; Zhang, Kun
2006-12-01
We propose a novel approach to similarity assessment for graphic symbols. Symbols are represented as 2D kernel densities and their similarity is measured by the Kullback-Leibler divergence. Symbol orientation is found by gradient-based angle searching or independent component analysis. Experimental results show the outstanding performance of this approach in various situations.
Sound-Symbolism Boosts Novel Word Learning
Lockwood, Gwilym; Dingemanse, Mark; Hagoort, Peter
2016-01-01
The existence of sound-symbolism (or a non-arbitrary link between form and meaning) is well-attested. However, sound-symbolism has mostly been investigated with nonwords in forced choice tasks, neither of which are representative of natural language. This study uses ideophones, which are naturally occurring sound-symbolic words that depict sensory…
7 CFR 29.3012 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.3012 Section 29.3012 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Color symbols. As applied to Burley, single color symbols are as follows: L—buff, F—tan, R—red, D—dark...
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Symbol (S). 29.1066 Section 29.1066 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 92) § 29.1066 Symbol (S). As applied to Flue-cured tobacco the symbol (S) when used (a) as the...
7 CFR 29.3510 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.3510 Section 29.3510 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 95) § 29.3510 Color symbols. As applied to Dark Air-cured tobacco, color symbols are L—light brown...
7 CFR 29.2259 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.2259 Section 29.2259 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... symbols. As applied to this type, color symbols are: L—light brown, F—medium brown, D—dark brown, M—mixed...
7 CFR 29.1007 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.1007 Section 29.1007 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing... Type 92) § 29.1007 Color symbols. As applied to flue-cured tobacco, color symbols are L—lemon, F—orange...
Symbol-String Sensitivity and Children's Reading
Pammer, Kristen; Lavis, Ruth; Hansen, Peter; Cornelissen, Piers L.
2004-01-01
In this study of primary school children, a novel "symbol-string" task is used to assess sensitivity to the position of briefly presented non-alphabetic but letter-like symbols. The results demonstrate that sensitivity in the symbol-string task explains a unique proportion of the variability in children's contextual reading accuracy. Moreover,…
Reciprocity Laws for the Higher Tame Symbol and the Witt Symbol on an Algebraic Surface
Syder, Kirsty
2013-01-01
Parshin's higher Witt pairing on an arithmetic surface can be combined with the higher tame pairing to form a symbol taking values in the absolute abelian Galois group of the function field. We prove reciprocity laws for this symbol using techniques of Morrow for the Witt symbol and Romo for the higher tame symbol.
Diagnostic information in compliance checking
Ramezani Taghiabadi, E.; Fahland, D.; Aalst, van der W.M.P.
2012-01-01
Compliance checking is gaining importance as today's organizations need to show that operational processes are executed in a controlled manner while satisfying predefined (legal) requirements. Deviations may be costly and expose the organization to severe risks. Compliance checking is of growing
Between Agency and Symbolic Violence
Pedersen, Bodil Maria
The Role of Symbolic Violence in Research and Policy: In Denmark it is a common assumption that gender equality, especially concerning sexual practices and other personal relations, has been fully accomplished. Consequently, public as well as professional discourses and practices concerning rape...... - could be exposed to sexualised violence. Another example is that therapy and other forms of help do not draw on critical perspectives on gender conditions. Rather, frequently and in essencialising approaches to concepts of femininity and masculinity, they individualise or over...... of this kind in public policies concerning gendered and gendering violence, it is necessary to develop critiques of aspects of symbolic violence (Beate Krais 1993), that have been conceptualised as ‘genderless gender’ by Suvi Ronkainen (2001). Thus statistic and other forms of research approaches wishing...
Performance of Low-Density Parity-Check Coded Modulation
Hamkins, Jon
2010-01-01
This paper reports the simulated performance of each of the nine accumulate-repeat-4-jagged-accumulate (AR4JA) low-density parity-check (LDPC) codes [3] when used in conjunction with binary phase-shift-keying (BPSK), quadrature PSK (QPSK), 8-PSK, 16-ary amplitude PSK (16- APSK), and 32-APSK.We also report the performance under various mappings of bits to modulation symbols, 16-APSK and 32-APSK ring scalings, log-likelihood ratio (LLR) approximations, and decoder variations. One of the simple and well-performing LLR approximations can be expressed in a general equation that applies to all of the modulation types.
Type Checking with XML Schema in XACT
Kirkegaard, Christian; Møller, Anders
to support XML Schema as type formalism. The technique is able to model advanced features, such as type derivations and overloaded local element declarations, and also datatypes of attribute values and character data. Moreover, we introduce optional type annotations to improve modularity of the type checking...
checkCIF/PLATON report Datablock: shelxl
6 ALERT level G = General information/check it is not something unexpected. 1 ALERT type 1 CIF construction/syntax error, inconsistent or missing data. 15 ALERT type 2 Indicator that the structure model may be wrong or deficient. 9 ALERT type 3 Indicator that the structure quality may be low. 1 ALERT type 4 Improvement, ...
Luckow, Kasper Søe; Păsăreanu, Corina
2014-01-01
We describe Symbolic PathFinder v7 in terms of its updated design addressing the changes of Java PathFinder v7 and of its new optimization when computing path conditions. Furthermore, we describe the Symbolic Execution Tree Extension; a newly added feature that allows for outputting the symbolic...... execution tree that characterizes the execution paths covered during symbolic execution. The new extension can be tailored to the needs of subsequent analyses/processing facilities, and we demonstrate this by presenting SPF-Visualizer, which is a tool for customizable visualization of the symbolic execution...
VULTURES: EXEGESIS OF A SYMBOL
Maura Andreoni
2016-12-01
Full Text Available Depending on the different cultures and historical periods, vultures have been considered both impure or sacred. But, since they usually do not prey upon living animals, their symbolic dimension, associated to the idea of purification, is present in many myths, religions, burial praxis of ancient populations and remains in some religions today.In the ancient Mediterranean civilizations, they have been carved in some of the most ancient bas-reliefs of the history by stone age people; were sacred to Egyptians, who even took them as symbol of gods; in the classical times they were supposed to be all feminine and breed by parthenogenesis, and therefore appreciated by some early Christian authors, who came to comparing them even to the Virgin Mary; they have been studied and described by ancient scientists, naturalists, philosophers, playwrights; involved in many of the most enduring Greek and Roman myths and legends; many parts of their body were considered as a medicine or even a talisman for happiness; and they were so proverbial for Romans to become even one of the symbols of the founding of Rome itself.But they were also so fragile that perfumes, myrrh and pomegranates were supposed to be lethal for them ….
Meter Detection in Symbolic Music Using Inner Metric Analysis
de Haas, W.B.; Volk, A.
2016-01-01
In this paper we present PRIMA: a new model tailored to symbolic music that detects the meter and the first downbeat position of a piece. Given onset data, the metrical structure of a piece is interpreted using the Inner Metric Analysis (IMA) model. IMA identifies the strong and weak metrical
Ionizing-radiation warning - Supplementary symbol
2007-01-01
This International Standard specifies the symbol to warn of the presence of a dangerous level of ionizing radiation from a high-level sealed radioactive source that can cause death or serious injury if handled carelessly. This symbol is not intended to replace the basic ionizing radiation symbol [ISO 361, ISO 7010:2003, Table 1 (Reference number W003)], but to supplement it by providing further information on the danger associated with the source and the necessity for untrained or uninformed members of the public to stay away from it. This symbol is recommended for use with International Atomic Energy Agency (IAEA) Category 1, 2, and 3 sealed radioactive sources. These sources are defined by the IAEA as having the ability to cause death or serious injuries. The paper informs about scope, shape, proportions and colour of the symbol, and application of the symbol. An annex provides the technical specifications of the symbol
Yuan, Lei; Uttal, David H
2017-07-01
We argue that analogical reasoning, particularly Gentner's (1983, 2010) structure-mapping theory, provides an integrative theoretical framework through which we can better understand the development of symbol use. Analogical reasoning can contribute both to the understanding of others' intentions and the establishment of correspondences between symbols and their referents, two crucial components of symbolic understanding. We review relevant research on the development of symbolic representations, intentionality, comparison, and similarity, and demonstrate how structure-mapping theory can shed light on several ostensibly disparate findings in the literature. Focusing on visual symbols (e.g., scale models, photographs, and maps), we argue that analogy underlies and supports the understanding of both intention and correspondence, which may enter into a reciprocal bootstrapping process that leads children to gain the prodigious human capacity of symbol use. Copyright © 2017 Cognitive Science Society, Inc.
Scram system with continuos check
Rodriguez Sacco, Walter.
1976-02-01
The equipment described pretends to be a further step to the use of integrated circuits in nuclear instrumentation, considering that this type of control was traditionally carried out on the bases of electromechanical elements. A continuous self-check method has been applied in accordance with the high reliability requiered for this type of equipments. The developed equipment fulfils the condition that any deficiency in its component elements, causes an anormal self-detected operation. The equipment covers two systems: the Scram one, that includes the sequence generator-detector, the rods check and scram chain, and the Check system that uses pulses from the sequence detector. (author) [es
Schneider, Michael; Beeres, Kassandra; Coban, Leyla; Merz, Simon; Susan Schmidt, S; Stricker, Johannes; De Smedt, Bert
2017-05-01
Many studies have investigated the association between numerical magnitude processing skills, as assessed by the numerical magnitude comparison task, and broader mathematical competence, e.g. counting, arithmetic, or algebra. Most correlations were positive but varied considerably in their strengths. It remains unclear whether and to what extent the strength of these associations differs systematically between non-symbolic and symbolic magnitude comparison tasks and whether age, magnitude comparison measures or mathematical competence measures are additional moderators. We investigated these questions by means of a meta-analysis. The literature search yielded 45 articles reporting 284 effect sizes found with 17,201 participants. Effect sizes were combined by means of a two-level random-effects regression model. The effect size was significantly higher for the symbolic (r = .302, 95% CI [.243, .361]) than for the non-symbolic (r = .241, 95% CI [.198, .284]) magnitude comparison task and decreased very slightly with age. The correlation was higher for solution rates and Weber fractions than for alternative measures of comparison proficiency. It was higher for mathematical competencies that rely more heavily on the processing of magnitudes (i.e. mental arithmetic and early mathematical abilities) than for others. The results support the view that magnitude processing is reliably associated with mathematical competence over the lifespan in a wide range of tasks, measures and mathematical subdomains. The association is stronger for symbolic than for non-symbolic numerical magnitude processing. So symbolic magnitude processing might be a more eligible candidate to be targeted by diagnostic screening instruments and interventions for school-aged children and for adults. © 2016 John Wiley & Sons Ltd.
Alignment based precision checking
Adriansyah, A.; Munoz-Gama, J.; Carmona, J.; Dongen, van B.F.; Aalst, van der W.M.P.; La Rosa, M.; Soffer, P.
2013-01-01
Most organizations have process models describing how cases need to be handled. In fact, legislation and standardization (cf. the Sarbanes-Oxley Act, the Basel II Accord, and the ISO 9000 family of standards) are forcing organizations to document their processes. These processes are often not
The primal scene and symbol formation.
Niedecken, Dietmut
2016-06-01
This article discusses the meaning of the primal scene for symbol formation by exploring its way of processing in a child's play. The author questions the notion that a sadomasochistic way of processing is the only possible one. A model of an alternative mode of processing is being presented. It is suggested that both ways of processing intertwine in the "fabric of life" (D. Laub). Two clinical vignettes, one from an analytic child psychotherapy and the other from the analysis of a 30 year-old female patient, illustrate how the primal scene is being played out in the form of a terzet. The author explores whether the sadomasochistic way of processing actually precedes the "primal scene as a terzet". She discusses if it could even be regarded as a precondition for the formation of the latter or, alternatively, if the "combined parent-figure" gives rise to ways of processing. The question is being left open. Finally, it is shown how both modes of experiencing the primal scene underlie the discoursive and presentative symbol formation, respectively. Copyright © 2015 Institute of Psychoanalysis.
Treasury Check Verification Query (TCVQ)
Social Security Administration — The TCVQ system determines the SSN of an individual whose check has been returned to a local field office. The FO is able to request this information via the TCVQ...
Do alcohol compliance checks decrease underage sales at neighboring establishments?
Erickson, Darin J; Smolenski, Derek J; Toomey, Traci L; Carlin, Bradley P; Wagenaar, Alexander C
2013-11-01
Underage alcohol compliance checks conducted by law enforcement agencies can reduce the likelihood of illegal alcohol sales at checked alcohol establishments, and theory suggests that an alcohol establishment that is checked may warn nearby establishments that compliance checks are being conducted in the area. In this study, we examined whether the effects of compliance checks diffuse to neighboring establishments. We used data from the Complying with the Minimum Drinking Age trial, which included more than 2,000 compliance checks conducted at more than 900 alcohol establishments. The primary outcome was the sale of alcohol to a pseudo-underage buyer without the need for age identification. A multilevel logistic regression was used to model the effect of a compliance check at each establishment as well as the effect of compliance checks at neighboring establishments within 500 m (stratified into four equal-radius concentric rings), after buyer, license, establishment, and community-level variables were controlled for. We observed a decrease in the likelihood of establishments selling alcohol to underage youth after they had been checked by law enforcement, but these effects quickly decayed over time. Establishments that had a close neighbor (within 125 m) checked in the past 90 days were also less likely to sell alcohol to young-appearing buyers. The spatial effect of compliance checks on other establishments decayed rapidly with increasing distance. Results confirm the hypothesis that the effects of police compliance checks do spill over to neighboring establishments. These findings have implications for the development of an optimal schedule of police compliance checks.
Expressions of manipulator kinematic equations via symbolic computation
Sasaki, Shinobu
1993-09-01
While it is simple in principle to determine the position and orientation of the manipulator hand, its computational process has been regarded as extremely laborious since trigonometric functions must be calculated many times in operations of revolute or rotation. Due to development of a general class of kinematic algorithm based on iterative methods, however, we have come to a satisfactory settlement of this problem. In the present article, we consider to construct symbolic kinematic equations in an automatic fashion making use of the algorithm. To this end, recursive expressions are applied to a symbolic computation system REDUCE. As a concrete result, a complete kinematic model for a six-jointed arm having all kinematic attributes is provided. Together with work space analysis, the computer-aided generation of kinematic equations in symbolic form will serve to liberate us from their cumbersome derivations. (author)
Symbolic computation of nonlinear wave interactions on MACSYMA
Bers, A.; Kulp, J.L.; Karney, C.F.F.
1976-01-01
In this paper the use of a large symbolic computation system - MACSYMA - in determining approximate analytic expressions for the nonlinear coupling of waves in an anisotropic plasma is described. MACSYMA was used to implement the solutions of a fluid plasma model nonlinear partial differential equations by perturbation expansions and subsequent iterative analytic computations. By interacting with the details of the symbolic computation, the physical processes responsible for particular nonlinear wave interactions could be uncovered and appropriate approximations introduced so as to simplify the final analytic result. Details of the MACSYMA system and its use are discussed and illustrated. (Auth.)
Finiteness of Lorentzian 10j symbols and partition functions
Christensen, J Daniel
2006-01-01
We give a short and simple proof that the Lorentzian 10j symbol, which forms a key part of the Barrett-Crane model of Lorentzian quantum gravity, is finite. The argument is very general, and applies to other integrals. For example, we show that the Lorentzian and Riemannian causal 10j symbols are finite, despite their singularities. Moreover, we show that integrals that arise in Cherrington's work are finite. Cherrington has shown that this implies that the Lorentzian partition function for a single triangulation is finite, even for degenerate triangulations. Finally, we also show how to use these methods to prove finiteness of integrals based on other graphs and other homogeneous domains
Peric, A; Plecas, I; Kostadinovic, A [Institute of Nuclear Sciences VINCA, Belgrade (Yugoslavia)
1992-07-01
Immobilization process of the spent ion-exchange resins was performed in bitumen matrix. from the twelve investigated formulations, one was chosen: BIT 200-40% I.I. resin, on which the mathematical model of the migration velocity for radionuclides Co-60 and Cs-137 was checked. Behaviour of the migration velocity trend obtained by mathematical modeling was compared with the measured results. Leaching level trends obtained by measurements and by mathematical modeling of the process do not show great differences in the nearly two years of investigation, and pointed out the stability of the bitumenized rad-waste form in the relatively relevant period of time. (author)
Next-generation nozzle check valve significantly reduces operating costs
Roorda, O. [SMX International, Toronto, ON (Canada)
2009-01-15
Check valves perform an important function in preventing reverse flow and protecting plant and mechanical equipment. However, the variety of different types of valves and extreme differences in performance even within one type can change maintenance requirements and life cycle costs, amounting to millions of dollars over the typical 15-year design life of piping components. A next-generation non-slam nozzle check valve which prevents return flow has greatly reduced operating costs by protecting the mechanical equipment in a piping system. This article described the check valve varieties such as the swing check valve, a dual-plate check valve, and nozzle check valves. Advancements in optimized design of a non-slam nozzle check valve were also discussed, with particular reference to computer flow modelling such as computational fluid dynamics; computer stress modelling such as finite element analysis; and flow testing (using rapid prototype development and flow loop testing), both to improve dynamic performance and reduce hydraulic losses. The benefits of maximized dynamic performance and minimized pressure loss from the new designed valve were also outlined. It was concluded that this latest non-slam nozzle check valve design has potential applications in natural gas, liquefied natural gas, and oil pipelines, including subsea applications, as well as refineries, and petrochemical plants among others, and is suitable for horizontal and vertical installation. The result of this next-generation nozzle check valve design is not only superior performance, and effective protection of mechanical equipment but also minimized life cycle costs. 1 fig.
Socialization by Way of Symbolic Interactionism and Culture Theory: A Communication Perspective.
Hartley, Karen C.
While not presuming to present a model of organizational socialization that is complete and totally accurate, this paper examines organizational socialization in a new way through the lenses of symbolic interactionism and culture theory. The first section of the paper describes the basic tenets of symbolic interactionism and how these have been…
[Rod of Asclepius. Symbol of medicine].
Young, Pablo; Finn, Bárbara C; Bruetman, Julio E; Cesaro Gelos, Jorge; Trimarchi, Hernán
2013-09-01
Symbolism is one of the most archaic forms of human thoughts. Symbol derives from the Latin word symbolum, and the latter from the Greek symbolon or symballo, which means "I coincide, I make matches". The Medicine symbol represents a whole series of historical and ethical values. Asclepius Rod with one serpent entwined, has traditionally been the symbol of scientific medicine. In a misconception that has lasted 500 years, the Caduceus of Hermes, entwined by two serpents and with two wings, has been considered the symbol of Medicine. However, the Caduceus is the current symbol of Commerce. Asclepius Rod and the Caduceus of Hermes represent two professions, Medicine and Commerce that, in ethical practice, should not be mixed. Physicians should be aware of their real emblem, its historical origin and meaning.
Symbols in numbers: From numerals to magnitude information
Lindemann, O.; Rüschemeyer, S.A.; Bekkering, H.
2009-01-01
A dual-code model of number processing needs to take into account the difference between a number symbol and its meaning. The transition of automatic non-abstract number representations into intentional abstract representations could be conceptualized as a translation of perceptual asematic
Symbolic trephinations and population structure
László Szathmáry
2006-12-01
Full Text Available The sample examined consists of 19 skulls with symbolic trephinations and 86 skulls without trepanations dated from the X century. Skulls were all excavated in the Great Hungarian Plain in the Carpathian Basin, which was occupied by the Hungarian conquerors at the end of the IX century. The variations of 12 cranial dimensions of the trephined skulls were investigated and compared to the skulls without trepanations after performing a discriminant analysis. The classification results evince that the variability of non-trephined skulls shows a more homogeneous and a more characteristic picture of their own group than the trephined samples, which corresponds to the notion, formed by archaeological evidence and written historical sources, of a both ethnically and socially differing population of the Hungarian conquerors. According to historical research, a part of the population was of Finno-Ugric origin, while the military leading layer of society can be brought into connection with Turkic ethnic groups. All the same, individuals dug up with rich grave furniture and supposed to belong to this upper stratum of society are primarily characterized by the custom of symbolic trephination, and, as our results demonstrate, craniologically they seem to be more heterogeneous.
[Symbolism on "natural" in food].
da Veiga Soares Carvalho, Maria Claudia; Luz, Madel Therezinha
2011-01-01
The incorporated senses represent a set of possibilities for future life able to build individual and collective identities. This work deepens the habitus, in Bourdieu's terms, associated with "natural" and fast-food styles, making an interpretative analysis of symbolic exchanges of elements reproduced in feeding practices. We believe that this bricolage arrangement of elements enables bartering and hybridism, marked by a tension that reflects the insecurity of technological innovations. The "natural" style represents an ideal of self-sustainability, non-polluting production, which faces the sanitary and ecologic crisis of the planet, against the large-scale industrialization and fast urbanization, defined as depredation factors of basic living conditions. The exchanges happen in a symbolic game connected with the global economic game, in which social actors make bets, illusio, according to particular intentions in concrete action. There is a chance to reformulate the rules of the game in the "game", although with a precarious balance of forces, in which the weaker side loses, an agent may have the possibility of not reproducing the pressures of globalized feeding, which is far from what might seem supernatural.
Honorary authorship and symbolic violence.
Kovacs, Jozsef
2017-03-01
This paper invokes the conceptual framework of Bourdieu to analyse the mechanisms, which help to maintain inappropriate authorship practices and the functions these practices may serve. Bourdieu's social theory with its emphasis on mechanisms of domination can be applied to the academic field, too, where competition is omnipresent, control mechanisms of authorship are loose, and the result of performance assessment can be a matter of symbolic life and death for the researchers. This results in a problem of game-theoretic nature, where researchers' behaviour will be determined more by the logic of competition, than by individual character or motives. From this follows that changing this practice requires institutionalized mechanisms, and change cannot be expected from simply appealing to researchers' individual conscience. The article aims at showing that academic capital (administrative power, seniority) is translated into honorary authorship. With little control, undetected honorary authorship gives the appearance of possessing intellectual capital (scientific merit). In this way a dominant position is made to be seen as natural result of intellectual ability or scientific merit, which makes it more acceptable to those in dominated positions. The final conclusion of this paper is that undemocratic authorship decisions and authorship based performance assessment together are a form of symbolic violence.
The rhetoric of disenchantment through symbolism
Munyangeyo, Théophile
2012-01-01
The symbolism of flowers has always been a significant part of cultures around the world due to their functional meaning in daily life. From their decorative to their aromatic role, flowers and their symbolic meaning trigger emotions, convey wishes and represent thoughts that can not be explicitly expressed. In this regard, an elaborate language based on flower symbolism was developed in many societies, to convey clear messages to the recipient. However, in some cultural contexts, although th...
7 CFR 29.2509 - Color symbols.
2010-01-01
... 7 Agriculture 2 2010-01-01 2010-01-01 false Color symbols. 29.2509 Section 29.2509 Agriculture...-Cured Tobacco (u.s. Types 22, 23, and Foreign Type 96) § 29.2509 Color symbols. As applied to these types, color symbols are L—light brown, F—medium brown, D—dark brown, M—mixed or variegated VF—greenish...
Information decomposition method to analyze symbolical sequences
Korotkov, E.V.; Korotkova, M.A.; Kudryashov, N.A.
2003-01-01
The information decomposition (ID) method to analyze symbolical sequences is presented. This method allows us to reveal a latent periodicity of any symbolical sequence. The ID method is shown to have advantages in comparison with application of the Fourier transformation, the wavelet transform and the dynamic programming method to look for latent periodicity. Examples of the latent periods for poetic texts, DNA sequences and amino acids are presented. Possible origin of a latent periodicity for different symbolical sequences is discussed
Applied cartographic communication: map symbolization for atlases.
Morrison, J.L.
1984-01-01
A detailed investigation of the symbolization used on general-purpose atlas reference maps. It indicates how theories of cartographic communication can be put into practice. Two major points emerge. First, that a logical scheme can be constructed from existing cartographic research and applied to an analysis of the choice of symbolization on a map. Second, the same structure appears to allow the cartographer to specify symbolization as a part of map design. An introductory review of cartographic communication is followed by an analysis of selected maps' usage of point, area and line symbols, boundaries, text and colour usage.-after Author
Can symbols be ‘promoted’ or ‘demoted’?: Symbols as religious phenomena
Jaco Beyers
2013-03-01
Full Text Available Religious symbols are part of our world, relating to another world. In order to understand the process by which symbols grow and develop, the particular context of a symbol is important. In this article a particular theory as to what symbols are, is presented. Religion presupposes the existence of two worlds: this-worldly (profane and the other-worldly (sacred. The means of communication and reference between these two worlds are symbols. Two examples are investigated so as to indicate how symbols can over time either be demoted or promoted. In the case of the Asherah and asherah as related in the Old Testament a demotion of a symbol is illustrated. The growth of ancient Egyptian religion is an example of a possible promotion of symbols. The conditions under which these processes can occur are investigated.
Symbolic feature detection for image understanding
Aslan, Sinem; Akgül, Ceyhun Burak; Sankur, Bülent
2014-03-01
In this study we propose a model-driven codebook generation method used to assign probability scores to pixels in order to represent underlying local shapes they reside in. In the first version of the symbol library we limited ourselves to photometric and similarity transformations applied on eight prototypical shapes of flat plateau , ramp, valley, ridge, circular and elliptic respectively pit and hill and used randomized decision forest as the statistical classifier to compute shape class ambiguity of each pixel. We achieved90% accuracy in identification of known objects from alternate views, however, we could not outperform texture, global and local shape methods, but only color-based method in recognition of unknown objects. We present a progress plan to be accomplished as a future work to improve the proposed approach further.
Photogrammetric approach to automated checking of DTMs
Potucková, Marketa
2005-01-01
Geometrically accurate digital terrain models (DTMs) are essential for orthoimage production and many other applications. Collecting reference data or visual inspection are reliable but time consuming and therefore expensive methods for finding errors in DTMs. In this paper, a photogrammetric...... approach to automated checking and improving of DTMs is evaluated. Corresponding points in two overlapping orthoimages are found by means of area based matching. Provided the image orientation is correct, discovered displacements correspond to DTM errors. Improvements of the method regarding its...
Data science and symbolic AI: Synergies, challenges and opportunities
Hoehndorf, Robert
2017-06-02
Symbolic approaches to artificial intelligence represent things within a domain of knowledge through physical symbols, combine symbols into symbol expressions, and manipulate symbols and symbol expressions through inference processes. While a large part of Data Science relies on statistics and applies statistical approaches to artificial intelligence, there is an increasing potential for successfully applying symbolic approaches as well. Symbolic representations and symbolic inference are close to human cognitive representations and therefore comprehensible and interpretable; they are widely used to represent data and metadata, and their specific semantic content must be taken into account for analysis of such information; and human communication largely relies on symbols, making symbolic representations a crucial part in the analysis of natural language. Here we discuss the role symbolic representations and inference can play in Data Science, highlight the research challenges from the perspective of the data scientist, and argue that symbolic methods should become a crucial component of the data scientists’ toolbox.
Data science and symbolic AI: Synergies, challenges and opportunities
Hoehndorf, Robert; Queralt-Rosinach, Nú ria
2017-01-01
Symbolic approaches to artificial intelligence represent things within a domain of knowledge through physical symbols, combine symbols into symbol expressions, and manipulate symbols and symbol expressions through inference processes. While a large part of Data Science relies on statistics and applies statistical approaches to artificial intelligence, there is an increasing potential for successfully applying symbolic approaches as well. Symbolic representations and symbolic inference are close to human cognitive representations and therefore comprehensible and interpretable; they are widely used to represent data and metadata, and their specific semantic content must be taken into account for analysis of such information; and human communication largely relies on symbols, making symbolic representations a crucial part in the analysis of natural language. Here we discuss the role symbolic representations and inference can play in Data Science, highlight the research challenges from the perspective of the data scientist, and argue that symbolic methods should become a crucial component of the data scientists’ toolbox.
Logic-Symbolic and Alphabetization
Dair Aily Franco de Camargo
2007-10-01
Full Text Available The present article tries to recoup the ideas and the proposal of H. Furth (1973, pointing it as another option to try to work with the children’s difficulties in the alphabetization process. The author considers the substitution of “schools of the language” for “schools of the thought”, that is, to substitute the option of the teacher in the reading-writing education, in its traditional form, of how to transform graphical signals into sonorous and vice-versa, for that one of the thought consolidation, feeding the intellect in development of the child by exercises of “symbolic logic”. For theoretical basing, we still present some aspects of the psychogenetic theory, as well as other works carried through more recently on the subject, that even so “transvestite” (disguised with new clothing, still find their beddings in the J. Piaget’s basis.
Delphine Sasanguie
2016-12-01
Full Text Available Three theoretical accounts have been put forward for the development of children’s response patterns on number line estimation tasks: the log-to-linear representational shift, the two-linear-to-linear transformation and the proportion judgment account. These three accounts have not been contrasted, however, within one study, using one single criterion to determine which model provides the best fit. The present study contrasted these three accounts by examining first, second and sixth graders with a symbolic and non-symbolic number line estimation task (Experiment 1. In addition, first and second graders were tested again one year later (Experiment 2. In case of symbolic estimations, the proportion judgment account described the data best. Most young children’s non-symbolic estimation patterns were best described by a logarithmic model (within the log-to-lin account, whereas those of most older children were best described by the simple power model (within the proportion judgment account.
The Rhetoric of Disenchantment through Symbolism
Munyangeyo, Théophile
2012-01-01
The symbolism of "flowers" has always been a significant part of cultures around the world due to their functional meaning in daily life. From their decorative to their aromatic role, flowers and their symbolic meaning trigger emotions, convey wishes and represent thoughts that can not be explicitly expressed. In this regard, an…
Television Commercials: Symbols, Myths and Metaphors.
Feasley, Florence G.
Television commercials convey to the audience through symbols, metaphors, and myths the feelings and emotions deeply rooted in our culture. While commercials on one level are concerned with a representation of the product or service, they are on another level a symbol of a larger meaning: love, family, romance, motherhood, or hero worship. A can…
Efficient Bit-to-Symbol Likelihood Mappings
Moision, Bruce E.; Nakashima, Michael A.
2010-01-01
This innovation is an efficient algorithm designed to perform bit-to-symbol and symbol-to-bit likelihood mappings that represent a significant portion of the complexity of an error-correction code decoder for high-order constellations. Recent implementation of the algorithm in hardware has yielded an 8- percent reduction in overall area relative to the prior design.
NMR-CT image and symbol phantoms
Hongo, Syozo; Yamaguchi, Hiroshi; Takeshita, Hiroshi
1990-01-01
We have developed Japanese phantoms in two procedures. One is described as a mathematical expression. Another is 'symbol phantoms' in 3 dimensional picture-elements, each of which symbolize an organ name. The concept and the algorithm of the symbol phantom enables us to make a phantom for a individual in terms of all his transversal section images. We got 85 transversal section images of head and trunk parts, and those of 40 legs parts by using NMR-CT. We have made the individual phantom for computation of organ doses. The transversal section images were not so clear to identify all organs needed to dose estimation that we had to do hand-editing the shapes of organs with viewing a typical section images: we could not yet make symbol phantom in a automatic editing. Symbols were coded to be visual cords as ASCII characters. After we got the symbol phantom of the first stage, we can edit it easily using a word-processor. Symbol phantom could describe more freely the shape of organs than mathematical phantom. Symbol phantom has several advantages to be an individual phantom, but the only difficult point is how to determine its end-point as a reference man when we apply the method to build the reference man. (author)
2010-01-01
... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Symbols. 95.3 Section 95.3 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF TRANSPORTATION (CONTINUED) AIR TRAFFIC AND GENERAL OPERATING RULES IFR ALTITUDES General § 95.3 Symbols. For the purposes of this part— (a) COP means...
An FMRI-compatible Symbol Search task.
Liebel, Spencer W; Clark, Uraina S; Xu, Xiaomeng; Riskin-Jones, Hannah H; Hawkshead, Brittany E; Schwarz, Nicolette F; Labbe, Donald; Jerskey, Beth A; Sweet, Lawrence H
2015-03-01
Our objective was to determine whether a Symbol Search paradigm developed for functional magnetic resonance imaging (FMRI) is a reliable and valid measure of cognitive processing speed (CPS) in healthy older adults. As all older adults are expected to experience cognitive declines due to aging, and CPS is one of the domains most affected by age, establishing a reliable and valid measure of CPS that can be administered inside an MR scanner may prove invaluable in future clinical and research settings. We evaluated the reliability and construct validity of a newly developed FMRI Symbol Search task by comparing participants' performance in and outside of the scanner and to the widely used and standardized Symbol Search subtest of the Wechsler Adult Intelligence Scale (WAIS). A brief battery of neuropsychological measures was also administered to assess the convergent and discriminant validity of the FMRI Symbol Search task. The FMRI Symbol Search task demonstrated high test-retest reliability when compared to performance on the same task administered out of the scanner (r=.791; pSymbol Search (r=.717; pSymbol Search task were also observed. The FMRI Symbol Search task is a reliable and valid measure of CPS in healthy older adults and exhibits expected sensitivity to the effects of age on CPS performance.
Deficient symbol processing in Alzheimer disease.
Toepper, Max; Steuwe, Carolin; Beblo, Thomas; Bauer, Eva; Boedeker, Sebastian; Thomas, Christine; Markowitsch, Hans J; Driessen, Martin; Sammer, Gebhard
2014-01-01
Symbols and signs have been suggested to improve the orientation of patients suffering from Alzheimer disease (AD). However, there are hardly any studies that confirm whether AD patients benefit from signs or symbols and which symbol characteristics might improve or impede their symbol comprehension. To address these issues, 30 AD patients and 30 matched healthy controls performed a symbol processing task (SPT) with 4 different item categories. A repeated-measures analysis of variance was run to identify impact of different item categories on performance accuracy in both the experimental groups. Moreover, SPT scores were correlated with neuropsychological test scores in a broad range of other cognitive domains. Finally, diagnostic accuracy of the SPT was calculated by a receiver-operating characteristic curve analysis. Results revealed a global symbol processing dysfunction in AD that was associated with semantic memory and executive deficits. Moreover, AD patients showed a disproportional performance decline at SPT items with visual distraction. Finally, the SPT total score showed high sensitivity and specificity in differentiating between AD patients and healthy controls. The present findings suggest that specific symbol features impede symbol processing in AD and argue for a diagnostic benefit of the SPT in neuropsychological assessment.
History of international symbol for ionizing radiation
Franic, Z.
1996-01-01
The year 1996 marks the 50th anniversary of the radiation warning symbol as we currently know it. It was (except the colours used) doodled out at the University of California, Berkeley, sometime in 1946 by a small group of people. The key guy responsible was Nelson Garden, then the head of the Health Chemistry Group, at the Radiation Laboratory. The radiation warning symbol should not be confused with the civil defence symbol (circle divided into six equal sections, three of these being black and three yellow), designed to identify fallout shelters. The basic radiation symbol was eventually internationally standardized by ISO code: 361-1975 (E). Variations of this symbol are frequently used in logotypes radiation protection organizations or associations. Particularly nice are those of International Radiation Protection Association (IRPA) and Croatian Radiation Protection Association (CRPA) that combines traditional Croatian motives with high technology. However, apart from speculations, there is no definite answer why did the Berkeley people chose this particular symbol. Whatever the reason was, it was very good choice because the ionizing radiation symbol is simple, readily identifiable, i.e., not similar to other warning symbols, and discernible at a large distance. (author)
2010-10-01
... appropriate symbol(s) on areas, such as wildlife management areas and fishing access facilities, acquired..., losses and damages arising out of any allegedly unauthorized use of any patent, process, idea, method or... and also from any claims, suits, losses and damages arising out of alleged defects in the articles or...
Sound-symbolism boosts novel word learning
Lockwood, G.F.; Dingemanse, M.; Hagoort, P.
2016-01-01
The existence of sound-symbolism (or a non-arbitrary link between form and meaning) is well-attested. However, sound-symbolism has mostly been investigated with nonwords in forced choice tasks, neither of which are representative of natural language. This study uses ideophones, which are naturally
Self-symbols as implicit motivators
Holland, R.W.; Wennekers, A.M.; Bijlstra, G.; Jongenelen, M.M.; Knippenberg, A.F.M. van
2009-01-01
The present research explored the nonconscious motivational influence of self-symbols. In line with recent findings on the motivational influence of positive affect, we hypothesized that positive affect associated with self-symbols may boost motivation. In Study I people drank more of a beverage
Self-symbols as implicit motivators
Holland, R.W.; Wennekers, A.M.; Bijlstra, G.; Jongenelen, M.M.; van Knippenberg, A.
2009-01-01
The present research explored the nonconscious motivational influence of self-symbols. In line with recent findings on the motivational influence of positive affect, we hypothesized that positive affect associated with self-symbols may boost motivation. In Study 1 people drank more of a beverage
Statistical Symbolic Execution with Informed Sampling
Filieri, Antonio; Pasareanu, Corina S.; Visser, Willem; Geldenhuys, Jaco
2014-01-01
Symbolic execution techniques have been proposed recently for the probabilistic analysis of programs. These techniques seek to quantify the likelihood of reaching program events of interest, e.g., assert violations. They have many promising applications but have scalability issues due to high computational demand. To address this challenge, we propose a statistical symbolic execution technique that performs Monte Carlo sampling of the symbolic program paths and uses the obtained information for Bayesian estimation and hypothesis testing with respect to the probability of reaching the target events. To speed up the convergence of the statistical analysis, we propose Informed Sampling, an iterative symbolic execution that first explores the paths that have high statistical significance, prunes them from the state space and guides the execution towards less likely paths. The technique combines Bayesian estimation with a partial exact analysis for the pruned paths leading to provably improved convergence of the statistical analysis. We have implemented statistical symbolic execution with in- formed sampling in the Symbolic PathFinder tool. We show experimentally that the informed sampling obtains more precise results and converges faster than a purely statistical analysis and may also be more efficient than an exact symbolic analysis. When the latter does not terminate symbolic execution with informed sampling can give meaningful results under the same time and memory limits.
Democracy and the Symbolic Constitution of Society
Lindahl, H.K.
1998-01-01
Abstract. Building on Cassirer's philosophy of symbolic forms, this paper argues that the continuities and discontinuities characterizing the passage from medieval politics to modern democracy can best be understood by reference to political power's symbolic structure. For the one, political power,
Symbolic initiative and its application to computers
Hellerman, L
1982-01-01
The author reviews the role of symbolic initiative in mathematics and then defines a sense in which computers compute mathematical functions. This allows a clarification of the semantics of computer and communication data. Turing's view of machine intelligence is examined in terms of its use of symbolic initiative. 12 references.
The Symbolic Meaning of Legal Subjectivity
Pessers, D.; van Klink, B.; van Beers, B.; Poort, L.
2016-01-01
The legitimacy of the law is not to be found, as is often claimed, in procedural justice, but in the core function of the law: the symbolic insertion of every new generation into the community of legal subjects. This symbolic function is most ambitiously expressed in the Universal Declaration of
Self-organisation of symbolic information
Feistel, R.
2017-01-01
Information is encountered in two different appearances, in native form by arbitrary physical structures, or in symbolic form by coded sequences of letters or the like. The self-organised emergence of symbolic information from structural information is referred to as a ritualisation transition. Occurring at some stage in evolutionary history, ritualisation transitions have in common that after the crossover, arbitrary symbols are issued and recognised by information-processing devices, by transmitters and receivers in the sense of Shannon's communication theory. Symbolic information-processing systems exhibit the fundamental code symmetry whose key features, such as largely lossless copying or persistence under hostile conditions, may elucidate the reasons for the repeated successful occurrence of ritualisation phenomena in evolution history. Ritualisation examples are briefly reviewed such as the origin of life, the appearance of human languages, the establishment of emergent social categories such as money, or the development of digital computers. In addition to their role as carriers of symbolic information, symbols are physical structures which also represent structural information. For a thermodynamic description of symbols and their arrangements, it appears reasonable to distinguish between Boltzmann entropy, Clausius entropy and Pauling entropy. Thermodynamic properties of symbols imply that their lifetimes are limited by the 2nd law.
Symbolic math for computation of radiation shielding
Suman, Vitisha; Datta, D.; Sarkar, P.K.; Kushwaha, H.S.
2010-01-01
Radiation transport calculations for shielding studies in the field of accelerator technology often involve intensive numerical computations. Traditionally, radiation transport equation is solved using finite difference scheme or advanced finite element method with respect to specific initial and boundary conditions suitable for the geometry of the problem. All these computations need CPU intensive computer codes for accurate calculation of scalar and angular fluxes. Computation using symbols of the analytical expression representing the transport equation as objects is an enhanced numerical technique in which the computation is completely algorithm and data oriented. Algorithm on the basis of symbolic math architecture is developed using Symbolic math toolbox of MATLAB software. Present paper describes the symbolic math algorithm and its application as a case study in which shielding calculation of rectangular slab geometry is studied for a line source of specific activity. Study of application of symbolic math in this domain evolves a new paradigm compared to the existing computer code such as DORT. (author)
Exact computation of the 9-j symbols
Lai Shantao; Chiu Jingnan
1992-01-01
A useful algebraic formula for the 9-j symbol has been rewritten for convenient use on a computer. A simple FORTRAN program for the exact computation of 9-j symbols has been written for the VAX with VMS version V5,4-1 according to this formula. The results agree with the approximate values in existing literature. Some specific values of 9-j symbols needed for the intensity and alignments of three-photon nonresonant transitions are tabulated. Approximate 9-j symbol values beyond the limitation of the computer can also be computed by this program. The computer code of the exact computation of 3-j, 6-j and 9-j symbols are available through electronic mail upon request. (orig.)
Symbol in Point View of Ambiguity
Dr. M. R. Yousefi
Full Text Available Symbol from the perspective of rhetorical word, is phrase or sentence that apparent meaning, also inspires to reader a wide range of semantic.Since exploring the complex social and political ideas in the most mysticalway and indirectreflectionsocial and political thoughts symbolically is easier, so the symbol and symbolism especially in Persian literatureespeciallyin the realm of Persian poetry, has a special appearance.In addition to the factors mentioned in the contemporary literature, according familiar in literature and the emergence of particular schools interest toambiguoussymbolization has spreadfurther, especially the symbol has all the features of art ambiguity in the poem and it isone the major factors causing uncertainty.Thus, the precise definitions and symbols of contemporary poetry could be dominant in the unwinding ambiguous symbol detection of cryptic allusions and metaphors that matches the cursor symbol to help readers.In the literature, especially language poetry, the inability of language toreflecting obscure mystical ideas, avoid to directexpression of political and social concerns of the reader in the course of participate to creation ambiguous literary works is the main motivation towards symbol and symbolization.According widespread use of symbol and its different of species can be viewed from different perspectives.The creation of ambiguity is the main purposes of using symbols (especially in poetry, so many poets have tried to achieve this goal have to formation of similar symbols and the explanation and resolution of this issue can open new window for understanding the poetry in front of an audience.In this paper examines the ambiguity of symbols in terms of its precise boundaries are reviewed. Ambiguity is one of the important processes and also is the key Iranian poetry; its means is today poetry. In such poetry ambiguity is a need to explore the new world from a different perspective, or explore this complex world
Reducing Lookups for Invariant Checking
Thomsen, Jakob Grauenkjær; Clausen, Christian; Andersen, Kristoffer Just
2013-01-01
This paper helps reduce the cost of invariant checking in cases where access to data is expensive. Assume that a set of variables satisfy a given invariant and a request is received to update a subset of them. We reduce the set of variables to inspect, in order to verify that the invariant is still...
Context-aware compliance checking
Werf, van der J.M.E.M.; Verbeek, H.M.W.; Aalst, van der W.M.P.; Barros, A.; Gal, A.; Kindler, E.
2012-01-01
Organizations face more and more the burden to show that their business is compliant with respect to many different boundaries. The activity of compliance checking is commonly referred to as auditing. As information systems supporting the organization’s business record their usage, process mining
SYMBOL AND LOGO. THE WAY IN WHICH YOUNG PEOPLE IN KRAKOW PERCEIVE SYMBOLS
Marta Jarzyna
2006-01-01
Full Text Available Symbols are essential elements of each culture. Thanks to them the meaning is created and tradition is kept alive. Advertising and marketing specialist quite often use the meanings of the symbols to create trademarks. In this way specialists refer to the assotiations rooted in the tradition.In my article I am trying to answer following questions: Has logo become symbol? Has logo taken over all the function of the symbol? Can we tell the difference between the meaning of the advertisement and the cultural meaning? I also want to find out, what people understand through the meaning of the symbol. Therfore I have conducted the survey among the high school students and the customers of three banks of Krakow. My researches have shown that most young people find it difficult to define the meaning of the symbol. Moreover high school students cannot show the difference between the symbol and the trade mark.
Assembly processor program converts symbolic programming language to machine language
Pelto, E. V.
1967-01-01
Assembly processor program converts symbolic programming language to machine language. This program translates symbolic codes into computer understandable instructions, assigns locations in storage for successive instructions, and computer locations from symbolic addresses.
2010-04-01
... 27 Alcohol, Tobacco Products and Firearms 2 2010-04-01 2010-04-01 false Bad checks. 70.101 Section....101 Bad checks. If any check or money order in payment of any amount receivable under Title 26 of the... appropriate TTB officer that such check was tendered in good faith and that such person had reasonable cause...
Higher-Order and Symbolic Computation. LISP and Symbolic Computationditorial
Danvy, Olivier; Dybvig, R. Kent; Lawall, Julia
2008-01-01
system for these static checks and a corresponding type-inference algorithm. In "An Investigation of Jones Optimality and BTI-Universal Specializers," Robert Glueck establishes a connection between Jones optimal-program specializers and binding-time improvers. This article completes a study started...... at ASIA-PEPM 2002 [1]. In "On the Implementation of Automatic Differentiation Tools," Christian H. Bischof, Paul D. Hovland, and Boyana Norris present a survey of some recent tools for the Automatic Differentiation technology (concentrating mainly on ADIC, ADIFOR and sketching XAIF). They also offer...... for removing tuple constructions and tuple selections. This technique solves the problem of efficiently passing tuples to polymorphic functions by avoiding extra memory operations in selecting components of the tuple....
The rhetoric of disenchantment through symbolism
Théophile Munyangeyo
2012-10-01
Full Text Available The symbolism of flowers has always been a significant part of cultures around the world due to their functional meaning in daily life. From their decorative to their aromatic role, flowers and their symbolic meaning trigger emotions, convey wishes and represent thoughts that can not be explicitly expressed. In this regard, an elaborate language based on flower symbolism was developed in many societies, to convey clear messages to the recipient. However, in some cultural contexts, although the flower symbolism has social connotations, it is mainly associated with economic references. As flowers are an essential precursor to fruits, they are inevitably a source of expectations and hence foster a set of hopes and dreams, which can ultimately lead to excitement or disappointment.Through a discourse analysis based on factional narratives, this article explores the parameters through which the symbolism of bifaceted meaning of flowers fictionalises a space that refers to the social reality. This association between the fictional world and social reference has highlighted that writing can profoundly be a means of representing social events through the rhetoric of symbolism. Through a sociological reading approach, this paper aims to analyse how the symbolism of flowers informs the rhetoric of disenchantment that can foster a content-based pedagogy in language learning where silencing practices engender imagery to exercise the freedom of expression.
Symbol synchronization for the TDRSS decoder
Costello, D. J., Jr.
1983-01-01
Each 8 bits out of the Viterbi decoder correspond to one symbol of the R/S code. Synchronization must be maintained here so that each 8-bit symbol delivered to the R/S decoder corresponds to an 8-bit symbol from the R/S encoder. Lack of synchronization, would cause an error in almost every R/S symbol since even a - 1-bit sync slip shifts every bit in each 8-bit symbol by one position, therby confusing the mapping betweeen 8-bit sequences and symbols. The error correcting capability of the R/S code would be exceeded. Possible ways to correcting this condition include: (1) designing the R/S decoder to recognize the overload and shifting the output sequence of the inner decoder to establish a different sync state; (2) using the characteristics of the inner decoder to establish symbol synchronization for the outer code, with or without a deinterleaver and an interleaver; and (3) modifying the encoder to alternate periodically between two sets of generators.
European Languages: Instruments and Symbols
Martina Ožbot
2008-07-01
Further, the role of Latin as the single most important European language over the centuries and as a unifying feature of European culture is discussed. Parallels are drawn between Latin as the historical European lingua franca on the one hand and English as the modern language of international communication on the other: the importance of both languages started growing after substantial territorial expansion of their speakers and it was especially the political and economic power associated to these languages that played a significant role in their diffusion and long-term influence. Taking into consideration the instrumental as well as the symbolic function of languages, the question about the relationship between English and other European languages in today’s Europe is dealt with; it is suggested that the European languages are in principle not endangered as a result of the spread of English, with the exception of those instances in which English has been taking over the functions they have traditionally performed as national or community languages. It is emphasized that the future of Europe lies in the promotion of biand multilingualism, which have, in actual fact, been present on this continent throughout its history, and which in the cases of some European languages (e.g. Catalan, Basque, Irish, etc. have been successfully enhanced over the past decades.
Calibration and check light source
Nejedla, B; Krotil, J
1979-02-15
The light source is designed for calibrating photomultipliers and checking the function of the thermoluminescent dosemeters evaluation equipment. The check light source consists of a polymer material-based (polyvinyl toluene) plastic scintillator and a 2-phenyl-5-(4-bisphenyl)-1,3,4-oxadiazol and/or paraterphenyl activator, and of emission spectrum shifters for response in the green and the blue light regions. The plastic scintillator is sealed in a case to whose bottom a radiation source is fixed, such as a /sup 90/Sr-/sup 90/Y source of an activity of 1.85x10/sup 3/s/sup -1/ to 0.74x10/sup 9/s/sup -1/.
2005-09-30
There is currently no common symbology standard for the electronic display of navigation information. The wide range of display technology and the different functions these displays support makes it difficult to design symbols that are easily recogni...
Social and Symbolic Capital in Firm Clusters
Gretzinger, Susanne; Royer, Susanne
Based on a relational perspective this paper analyses the case of the “Mechatronics Cluster” in Southern Jutland, Denmark. We found that cluster managers are not aware of the importance of social and symbolic capital. Cluster managers could have access to both but they are not aware...... of this resource and they don´t have any knowledge how to manage social and symbolic capital. Just to integrate social-capital-supporting initiatives in the day to day business would help to develop and to foster social and symbolic capital on a low cost level. And in our example just to integrate successful sub...
Democratisation of AAC Symbol Choices Using Technology.
Draffan, E A; Wald, Mike; Zeinoun, Nadine; Banes, David
2017-01-01
The use of an online voting system has been developed to enable democratic choices of newly designed symbols to support speech, language and literacy skills in a localisation situation. The system works for those using and supporting Augmentative and Alternative Communication (AAC) symbols on electronic systems by the provision of simplified scales of acceptance and adapted grids. The methodology and results highlighted the importance of user participation at the outset and concrete examples of symbol adaptations that were found necessary to ensure higher levels of user satisfaction. Design changes included appropriate local dress codes, linguistic nuances, social settings, the built environment and religious sensitivities.
From Preventive to Permissive Checks
Sharp, Paul Richard; Weisdorf, Jacob Louis
The Malthusian "preventive check" mechanism has been well documented for pre-industrial England through evidence for a negativcorrelation between the marriage rate and the price of wheat. Other literature, however, speculates that the correlation was in fact positive from the early nineteenth cen...... shows that this result is not in fact inconsistent with a stylized Malthusian mechanism, and can be understood within the context of an increasing dominance of shocks to aggregate demand rather than to aggregate supply...
Trails of meaning construction: Symbolic artifacts engage the social brain.
Tylén, Kristian; Philipsen, Johanne Stege; Roepstorff, Andreas; Fusaroli, Riccardo
2016-07-01
Symbolic artifacts present a challenge to theories of neurocognitive processing due to their hybrid nature: they are at the same time physical objects and vehicles of intangible social meanings. While their physical properties can be read of their perceptual appearance, the meaning of symbolic artifacts depends on the perceiver's interpretative attitude and embeddedness in cultural practices. In this study, participants built models of LEGO bricks to illustrate their understanding of abstract concepts. They were then scanned with fMRI while presented to photographs of their own and others' models. When participants attended to the meaning of the models in contrast to their bare physical properties, we observed activations in mPFC and TPJ, areas often associated with social cognition, and IFG, possibly related to semantics. When contrasting own and others' models, we also found activations in precuneus, an area associated with autobiographical memory and agency, while looking at one's own collective models yielded interaction effects in rostral ACC, right IFG and left Insula. Interestingly, variability in the insula was predicted by individual differences in participants' feeling of relatedness to their fellow group members during LEGO construction activity. Our findings support a view of symbolic artifacts as neuro-cognitive trails of human social interactions. Copyright © 2016 Elsevier Inc. All rights reserved.
CONSUMPTION AS A SOCIAL STATUS SYMBOL IN STRUCTURALISM
N. D. Naydenov
2014-10-01
Full Text Available The article looks at the basic theoretical concepts of the political economy of the sign (structuralism, postmodernity and their development in the theory of power based on the work by J. Baudrillard ‘For a Critique of the Political Economy of the Sign’. The study is focused on consumption as the person’s social status symbol, it compares and contrasts basic concepts of structuralism and neo-liberalism.According to structuralism social structure is reproduced through the reproduction of objects/signs. It is important that not only things or money but mathematical formulas, linguistic constructions and people can act as signs. Structuralism views consumption as a person’s social status symbol. Respectively, exchange is viewed as the exchange of symbols. The society needs the diversity of signs and manipulating the signs is one of the modern society’s illnesses.Liberalism is a social movement, which confronts the person’s enslavement by communal ties and limitations within the limits of property and in the aspects where the individual is helpless in front of the society. Neoliberalism proclaims the liberal model of an individual, who is primarily concerned with their belonging to their society and the struggle between the signs is significant. Assigning a certain value to the symbol is typical both for structuralism and neo-modernism.The authors find it necessary to raise the symbolic diversity of the Russian society trough increasing the forms of consumption. At the same time we should not forget that the society is based on material production.
Znojil, Miloslav
2013-01-01
Roč. 336, SEP (2013), s. 98-111 ISSN 0003-4916 R&D Projects: GA ČR GAP203/11/1433 Institutional support: RVO:61389005 Keywords : Non-Hermitian quantum Hamiltonian * exceptional point * phase transition * exactly solvable model Subject RIV: BE - Theoretical Physics Impact factor: 3.065, year: 2013 http://www.sciencedirect.com/science/article/pii/S0003491613001267
Helping children express grief through symbolic communication.
Segal, R M
1984-12-01
Communication barriers erected by grieving children delay problem resolution. Use of the expressive arts--music, art, and body movement--in symbolic communication helps them to express overwhelming feelings and cope with trauma and stress.
Multi-core symbolic bisimulation minimisation
Dijk, Tom van; Pol, Jaco van de
2017-01-01
We introduce parallel symbolic algorithms for bisimulation minimisation, to combat the combinatorial state space explosion along three different paths. Bisimulation minimisation reduces a transition system to the smallest system with equivalent behaviour. We consider strong and branching