Model Checking A Self-Stabilizing Synchronization Protocol for Arbitrary Digraphs

Science.gov (United States)

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.

MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable

Directory of Open Access Journals (Sweden)

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.

Model Checking Structured Infinite Markov Chains

NARCIS (Netherlands)

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

Statistical Model Checking of Rich Models and Properties

DEFF Research Database (Denmark)

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 Chains: Techniques and Tools

NARCIS (Netherlands)

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

Temporal Precedence Checking for Switched Models and its Application to a Parallel Landing Protocol

Science.gov (United States)

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.

Model Checking Real-Time Systems

DEFF Research Database (Denmark)

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...

Compositional and Quantitative Model Checking

DEFF Research Database (Denmark)

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 Discrete Duration Calculus

DEFF Research Database (Denmark)

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...

Bounding species distribution models

Directory of Open Access Journals (Sweden)

Thomas J. STOHLGREN, Catherine S. JARNEVICH, Wayne E. ESAIAS,Jeffrey T. MORISETTE

2011-10-01

Full Text Available Species distribution models are increasing in popularity for mapping suitable habitat for species of management concern. Many investigators now recognize that extrapolations of these models with geographic information systems (GIS might be sensitive to the environmental bounds of the data used in their development, yet there is no recommended best practice for “clamping” model extrapolations. We relied on two commonly used modeling approaches: classification and regression tree (CART and maximum entropy (Maxent models, and we tested a simple alteration of the model extrapolations, bounding extrapolations to the maximum and minimum values of primary environmental predictors, to provide a more realistic map of suitable habitat of hybridized Africanized honey bees in the southwestern United States. Findings suggest that multiple models of bounding, and the most conservative bounding of species distribution models, like those presented here, should probably replace the unbounded or loosely bounded techniques currently used [Current Zoology 57 (5: 642–647, 2011].

Bounding Species Distribution Models

Science.gov (United States)

Stohlgren, Thomas J.; Jarnevich, Cahterine S.; Morisette, Jeffrey T.; Esaias, Wayne E.

2011-01-01

Species distribution models are increasing in popularity for mapping suitable habitat for species of management concern. Many investigators now recognize that extrapolations of these models with geographic information systems (GIS) might be sensitive to the environmental bounds of the data used in their development, yet there is no recommended best practice for "clamping" model extrapolations. We relied on two commonly used modeling approaches: classification and regression tree (CART) and maximum entropy (Maxent) models, and we tested a simple alteration of the model extrapolations, bounding extrapolations to the maximum and minimum values of primary environmental predictors, to provide a more realistic map of suitable habitat of hybridized Africanized honey bees in the southwestern United States. Findings suggest that multiple models of bounding, and the most conservative bounding of species distribution models, like those presented here, should probably replace the unbounded or loosely bounded techniques currently used [Current Zoology 57 (5): 642-647, 2011].

Model Checking Markov Reward Models with Impulse Rewards

NARCIS (Netherlands)

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

UTP and Temporal Logic Model Checking

Science.gov (United States)

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 Infinite-State Markov Chains

NARCIS (Netherlands)

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

Coverage Metrics for Model Checking

Science.gov (United States)

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.

Engineering Abstractions in Model Checking and Testing

DEFF Research Database (Denmark)

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....

Implementing Model-Check for Employee and Management Satisfaction

Science.gov (United States)

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.

Partial-order reduction for GPU model checking

NARCIS (Netherlands)

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

Partial-Order Reduction for GPU Model Checking

NARCIS (Netherlands)

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

Bounded Satisfiability for PCTL

OpenAIRE

Bertrand, Nathalie; Fearnley, John; Schewe, Sven

2012-01-01

While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open problems. While general satisfiability is an intriguing challenge from a purely theoretical point of view, we argue that general solutions would not be of interest to practitioners: such solutions could be too big to be implementable or even infinite. Inspired by bounded synthesis techniques, we turn to the more appl...

Model Checking the Remote Agent Planner

Science.gov (United States)

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.

Multi-Valued Modal Fixed Point Logics for Model Checking

Science.gov (United States)

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.

Take the Reins on Model Quality with ModelCHECK and Gatekeeper

Science.gov (United States)

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.

Strategic Planning through Model Checking of ATL Formulae

NARCIS (Netherlands)

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

Model Checking Temporal Logic Formulas Using Sticker Automata

Science.gov (United States)

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

Model Checking Feature Interactions

DEFF Research Database (Denmark)

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....

Discrete-time rewards model-checked

NARCIS (Netherlands)

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

A Formal Approach for RT-DVS Algorithms Evaluation Based on Statistical Model Checking

Directory of Open Access Journals (Sweden)

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.

A Method for Model Checking Feature Interactions

DEFF Research Database (Denmark)

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....

Model checking mobile ad hoc networks

NARCIS (Netherlands)

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

Creating Büchi automata for multi-valued model checking

NARCIS (Netherlands)

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

Model Checking Algorithms for CTMDPs

DEFF Research Database (Denmark)

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...

A voice-actuated wind tunnel model leak checking system

Science.gov (United States)

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.

Checking Consistency of C and Verilog using Predicate Abstraction and Induction

National Research Council Canada - National Science Library

Clarke, Edmund; Kroening, Daniel

2004-01-01

.... In contrast to existing tools that perform predicate abstraction, our approach is SAT-based and allows all ANSI-C and Verilog operators in the predicates. We report experimental results on an out-of-order RISC processor. We compare the performance of the new technique to Bounded Model Checking (BMC).

Efficient probabilistic model checking on general purpose graphic processors

NARCIS (Netherlands)

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

Schedulability of Herschel revisited using statistical model checking

DEFF Research Database (Denmark)

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...

Absolute Lower Bound on the Bounce Action

Science.gov (United States)

Sato, Ryosuke; Takimoto, Masahiro

2018-03-01

The decay rate of a false vacuum is determined by the minimal action solution of the tunneling field: bounce. In this Letter, we focus on models with scalar fields which have a canonical kinetic term in N (>2 ) dimensional Euclidean space, and derive an absolute lower bound on the bounce action. In the case of four-dimensional space, we show the bounce action is generically larger than 24 /λcr, where λcr≡max [-4 V (ϕ )/|ϕ |4] with the false vacuum being at ϕ =0 and V (0 )=0 . We derive this bound on the bounce action without solving the equation of motion explicitly. Our bound is derived by a quite simple discussion, and it provides useful information even if it is difficult to obtain the explicit form of the bounce solution. Our bound offers a sufficient condition for the stability of a false vacuum, and it is useful as a quick check on the vacuum stability for given models. Our bound can be applied to a broad class of scalar potential with any number of scalar fields. We also discuss a necessary condition for the bounce action taking a value close to this lower bound.

Model checking biological systems described using ambient calculus

DEFF Research Database (Denmark)

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....

Dynamic State Space Partitioning for External Memory Model Checking

DEFF Research Database (Denmark)

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...

From Transition Systems to Variability Models and from Lifted Model Checking Back to UPPAAL

DEFF Research Database (Denmark)

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...

Performability assessment by model checking of Markov reward models

NARCIS (Netherlands)

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

Models and Techniques for Proving Data Structure Lower Bounds

DEFF Research Database (Denmark)

Larsen, Kasper Green

In this dissertation, we present a number of new techniques and tools for proving lower bounds on the operational time of data structures. These techniques provide new lines of attack for proving lower bounds in both the cell probe model, the group model, the pointer machine model and the I...... bound of tutq = (lgd􀀀1 n). For ball range searching, we get a lower bound of tutq = (n1􀀀1=d). The highest previous lower bound proved in the group model does not exceed ((lg n= lg lg n)2) on the maximum of tu and tq. Finally, we present a new technique for proving lower bounds....../O-model. In all cases, we push the frontiers further by proving lower bounds higher than what could possibly be proved using previously known techniques. For the cell probe model, our results have the following consequences: The rst (lg n) query time lower bound for linear space static data structures...

Development of a butterfly check valve model under natural circulation conditions

International Nuclear Information System (INIS)

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

Optimal Bounds in Parametric LTL Games

Directory of Open Access Journals (Sweden)

Martin Zimmermann

2011-06-01

Full Text Available We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as "PLTL" by Alur et al. and (in a different version called "PROMPT-LTL" by Kupferman et al.. We present an algorithm to determine optimal variable valuations that allow a player to win a game. Furthermore, we show how to determine whether a player wins a game with respect to some, infinitely many, or all valuations. All our algorithms run in doubly-exponential time; so, adding bounded temporal operators does not increase the complexity compared to solving plain LTL games.

CheckMATE 2: From the model to the limit

Science.gov (United States)

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.

Optimisation of BPMN Business Models via Model Checking

DEFF Research Database (Denmark)

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...

Statistical Model Checking for Biological Systems

DEFF Research Database (Denmark)

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...

Slicing AADL specifications for model checking

NARCIS (Netherlands)

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

Efficient family-based model checking via variability abstractions

DEFF Research Database (Denmark)

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...

Towards Model Checking a Spi-Calculus Dialect

NARCIS (Netherlands)

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

PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool

KAUST Repository

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.

Automata-Based CSL Model Checking

DEFF Research Database (Denmark)

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...

WCET Analysis of ARM Processors using Real-Time Model Checking

DEFF Research Database (Denmark)

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....

Sanity check for NN bound states in lattice QCD with Lüscher’s finite volume formula – Disclosing Symptoms of Fake Plateaux –

Directory of Open Access Journals (Sweden)

Aoki Sinya

2018-01-01

Full Text Available The sanity check is to rule out certain classes of obviously false results, not to catch every possible error. After reviewing such a sanity check for NN bound states with the Lüscher’s finite volume formula [1–3], we give further evidences for the operator dependence of plateaux, a symptom of the fake plateau problem, against the claim [4]. We then present our critical comments on [5] by NPLQCD: (i Operator dependences of plateaux in NPL2013 [6, 7] exist with the P value of 4–5%. (ii The volume independence of plateaux in NPL2013 does not prove their correctness. (iii Effective range expansions (EREs in NPL2013 violate the physical pole condition. (iv Their comment is partly based on new data and analysis different from the original ones. (v Their new ERE does not satisfy the Lüscher’s finite volume formula.

P2-16: Dual-Bound Model and the Role of Time Bound in Perceptual Decision Making

Directory of Open Access Journals (Sweden)

Daeseob Lim

2012-10-01

Full Text Available The diffusion model (DM encapsulates the dynamics of perceptual decision within a ‘diffusion field’ that is defined by a basis with sensory-evidence (SE and time vectors. At the core of the DM, it assumes that a decision is not made until an evidence particle drifts in the diffusion field and eventually hits one of the two pre-fixed bounds defined in the SE axis. This assumption dictates when and which choice is made by referring to when and which bound will be hit by the evidence particle. What if urgency pressures the decision system to make a choice even when the evidence particle has yet hit the SE bound? Previous modeling attempts at coping with time pressure, despite differences in detail, all manipulated the coordinate of SE bounds. Here, we offer a novel solution by adopting another bound on the time axis. This ‘dual-bound’ model (DBM posits that decisions can also be made when the evidence particle hits a time bound, which is determined on a trial-by-trial basis by a ‘perceived time interval’ – how long the system can stay in the ‘diffusion’ field. The classic single-bound model (SBM exhibited systematic errors in predicting both the reaction time distributions and the time-varying bias in choice. Those errors were not corrected by previously proposed variants of the SBM until the time bound was introduced. The validity of the DBM was further supported by the strong across-individual correlation between observed precision of interval timing and the predicted trial-by-trial variability of the time bound.

Integrating model checking with HiP-HOPS in model-based safety analysis

International Nuclear Information System (INIS)

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

Towards a Certified Lightweight Array Bound Checker for Java Bytecode

Science.gov (United States)

Pichardie, David

2009-01-01

Dynamic array bound checks are crucial elements for the security of a Java Virtual Machines. These dynamic checks are however expensive and several static analysis techniques have been proposed to eliminate explicit bounds checks. Such analyses require advanced numerical and symbolic manipulations that 1) penalize bytecode loading or dynamic compilation, 2) complexify the trusted computing base. Following the Foundational Proof Carrying Code methodology, our goal is to provide a lightweight bytecode verifier for eliminating array bound checks that is both efficient and trustable. In this work, we define a generic relational program analysis for an imperative, stackoriented byte code language with procedures, arrays and global variables and instantiate it with a relational abstract domain as polyhedra. The analysis has automatic inference of loop invariants and method pre-/post-conditions, and efficient checking of analysis results by a simple checker. Invariants, which can be large, can be specialized for proving a safety policy using an automatic pruning technique which reduces their size. The result of the analysis can be checked efficiently by annotating the program with parts of the invariant together with certificates of polyhedral inclusions. The resulting checker is sufficiently simple to be entirely certified within the Coq proof assistant for a simple fragment of the Java bytecode language. During the talk, we will also report on our ongoing effort to scale this approach for the full sequential JVM.

Model-checking techniques based on cumulative residuals.

Science.gov (United States)

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.

Model Checking - Automated Verification of Computational Systems

Indian Academy of Sciences (India)

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:

Consistency checks in beam emission modeling for neutral beam injectors

International Nuclear Information System (INIS)

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

Model checking the HAVi leader election protocol

NARCIS (Netherlands)

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

Bounded-Angle Iterative Decoding of LDPC Codes

Science.gov (United States)

Dolinar, Samuel; Andrews, Kenneth; Pollara, Fabrizio; Divsalar, Dariush

2009-01-01

Bounded-angle iterative decoding is a modified version of conventional iterative decoding, conceived as a means of reducing undetected-error rates for short low-density parity-check (LDPC) codes. For a given code, bounded-angle iterative decoding can be implemented by means of a simple modification of the decoder algorithm, without redesigning the code. Bounded-angle iterative decoding is based on a representation of received words and code words as vectors in an n-dimensional Euclidean space (where n is an integer).

Verifying large SDL-specifications using model checking

NARCIS (Netherlands)

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

Model checking optimal finite-horizon control for probabilistic gene regulatory networks.

Science.gov (United States)

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.

Mixed Portmanteau Test for Diagnostic Checking of Time Series Models

Directory of Open Access Journals (Sweden)

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.

Model Checking as Static Analysis

DEFF Research Database (Denmark)

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...

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

Directory of Open Access Journals (Sweden)

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.

A gauged baby Skyrme model and a novel BPS bound

International Nuclear Information System (INIS)

Adam, C; Naya, C; Sanchez-Guillen, J; Wereszczynski, A

2013-01-01

The baby Skyrme model is a well-known nonlinear field theory supporting topological solitons in two space dimensions. Its action functional consist of a potential term, a kinetic term quadratic in derivatives (the 'nonlinear sigma model term') and the Skyrme term quartic in first derivatives. The limiting case of vanishing sigma model term (the so-called BPS baby Skyrme model) is known to support exact soliton solutions saturating a BPS bound which exists for this model. Further, the BPS model has infinitely many symmetries and conservation laws. Recently it was found that the gauged version of the BPS baby Skyrme model with gauge group U(1) and the usual Maxwell term, too, has a BPS bound and BPS solutions saturating this bound. This BPS bound is determined by a superpotential which has to obey a superpotential equation, in close analogy to the situation in supergravity. Further, the BPS bound and the corresponding BPS solitons only may exist for potentials such that the superpotential equation has a global solution. We also briefly describe some properties of soliton solutions.

Model checking methodology for large systems, faults and asynchronous behaviour. SARANA 2011 work report

International Nuclear Information System (INIS)

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.)

Model checking methodology for large systems, faults and asynchronous behaviour. SARANA 2011 work report

Energy Technology Data Exchange (ETDEWEB)

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.)

modelling of queuing process at airport check-in system

African Journals Online (AJOL)

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 ...

Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic

DEFF Research Database (Denmark)

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...

Using Canonical Forms for Isomorphism Reduction in Graph-based Model Checking

NARCIS (Netherlands)

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

Variability-Specific Abstraction Refinement for Family-Based Model Checking

DEFF Research Database (Denmark)

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...

State Space Reduction for Model Checking Agent Programs

NARCIS (Netherlands)

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

A Novel Method to Verify Multilevel Computational Models of Biological Systems Using Multiscale Spatio-Temporal Meta Model Checking.

Science.gov (United States)

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

Temperature bounds in a model of laminar flames

International Nuclear Information System (INIS)

Kirane, M.; Badraoui, S.

1994-06-01

We consider reaction-diffusion equations coupling temperature and mass fraction in one-step-reaction model of combustion in R N . Uniform temperature bounds are derived when the Lewis number is less than one. This result completes the case of Lewis number greater than one studied by J.D. Avrin and M. Kirane ''Temperature growth and temperature bounds in special cases of combustion models'' (to appear in Applicable Analysis). (author). 5 refs

Query Language for Location-Based Services: A Model Checking Approach

Science.gov (United States)

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.

Recent advances in importance sampling for statistical model checking

NARCIS (Netherlands)

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

On Diagnostic Checking of Vector ARMA-GARCH Models with Gaussian and Student-t Innovations

Directory of Open Access Journals (Sweden)

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.

Model-checking dense-time Duration Calculus

DEFF Research Database (Denmark)

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....

Efficient Parallel Statistical Model Checking of Biochemical Networks

Directory of Open Access Journals (Sweden)

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.

Quantitative Analysis of Probabilistic Models of Software Product Lines with Statistical Model Checking

DEFF Research Database (Denmark)

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...

Application of Model-Checking Technology to Controller Synthesis

DEFF Research Database (Denmark)

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...

Relevance of the ICRP biokinetic model for dietary organically bound tritium

International Nuclear Information System (INIS)

Trivedi, A.

1999-10-01

Ingested dietary tritium can participate in metabolic processes, and become synthesized into organically bound tritium in the tissues and organs. The distribution and retention of the organically bound tritium throughout the body are much different than tritium in the body water. The International Commission on Radiological Protection (ICRP) Publication 56 (1989) has a biokinetic model to calculate dose from the ingestion of organically bound dietary tritium. The model predicts that the dose from the ingestion of organically bound dietary tritium is about 2.3 times higher than from the ingestion of the same activity of tritiated water. Under steady-state conditions, the calculated dose rate (using the first principle approach) from the ingestion of dietary organically bound tritium can be twice that from the ingestion of tritiated water. For an adult, the upper-bound dose estimate for the ingestion of dietary organically bound tritium is estimated to be close to 2.3 times higher than that of tritiated water. Therefore, given the uncertainty in the dose calculation with respect to the actual relevant dose, the ICRP biokinetic model for organically bound tritium is sufficient for dosimetry for adults. (author)

Rigorous bounds on the free energy of electron-phonon models

NARCIS (Netherlands)

Raedt, Hans De; Michielsen, Kristel

1997-01-01

We present a collection of rigorous upper and lower bounds to the free energy of electron-phonon models with linear electron-phonon interaction. These bounds are used to compare different variational approaches. It is shown rigorously that the ground states corresponding to the sharpest bounds do

Bounds for perpetual American option prices in a jump diffusion model

OpenAIRE

Ekström, Erik

2006-01-01

We provide bounds for perpetual American option prices in a jump diffusion model in terms of American option prices in the standard Black-Scholes model. We also investigate the dependence of the bounds on different parameters of the model.

SoS contract verification using statistical model checking

Directory of Open Access Journals (Sweden)

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.

Checking Fine and Gray subdistribution hazards model with cumulative sums of residuals

DEFF Research Database (Denmark)

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...

HyLTL: a temporal logic for model checking hybrid systems

Directory of Open Access Journals (Sweden)

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.

Model checking software for phylogenetic trees using distribution and database methods

Directory of Open Access Journals (Sweden)

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.

Phase Two Feasibility Study for Software Safety Requirements Analysis Using Model Checking

Science.gov (United States)

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 as an aid to procedure design

International Nuclear Information System (INIS)

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)

Braneworld black holes and entropy bounds

Directory of Open Access Journals (Sweden)

Y. Heydarzade

2018-01-01

Full Text Available The Bousso's D-bound entropy for the various possible black hole solutions on a 4-dimensional brane is checked. It is found that the D-bound entropy here is apparently different from that of obtained for the 4-dimensional black hole solutions. This difference is interpreted as the extra loss of information, associated to the extra dimension, when an extra-dimensional black hole is moved outward the observer's cosmological horizon. Also, it is discussed that N-bound entropy is hold for the possible solutions here. Finally, by adopting the recent Bohr-like approach to black hole quantum physics for the excited black holes, the obtained results are written also in terms of the black hole excited states.

Methods to model-check parallel systems software

International Nuclear Information System (INIS)

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

Symbolic Game Semantics for Model Checking Program Families

DEFF Research Database (Denmark)

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....

Model checking: one can do much more than you think!

NARCIS (Netherlands)

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

Bayesian inference with information content model check for Langevin equations

DEFF Research Database (Denmark)

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...

Requirements-level semantics and model checking of object-oriented statecharts

NARCIS (Netherlands)

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

Dependence in probabilistic modeling Dempster-Shafer theory and probability bounds analysis

Energy Technology Data Exchange (ETDEWEB)

Ferson, Scott [Applied Biomathematics, Setauket, NY (United States); Nelsen, Roger B. [Lewis & Clark College, Portland OR (United States); Hajagos, Janos [Applied Biomathematics, Setauket, NY (United States); Berleant, Daniel J. [Iowa State Univ., Ames, IA (United States); Zhang, Jianzhong [Iowa State Univ., Ames, IA (United States); Tucker, W. Troy [Applied Biomathematics, Setauket, NY (United States); Ginzburg, Lev R. [Applied Biomathematics, Setauket, NY (United States); Oberkampf, William L. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-05-01

This report summarizes methods to incorporate information (or lack of information) about inter-variable dependence into risk assessments that use Dempster-Shafer theory or probability bounds analysis to address epistemic and aleatory uncertainty. The report reviews techniques for simulating correlated variates for a given correlation measure and dependence model, computation of bounds on distribution functions under a specified dependence model, formulation of parametric and empirical dependence models, and bounding approaches that can be used when information about the intervariable dependence is incomplete. The report also reviews several of the most pervasive and dangerous myths among risk analysts about dependence in probabilistic models.

Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

DEFF Research Database (Denmark)

Benes, Nikola; Kretinsky, Jan; Larsen, Kim Guldstrand

2009-01-01

Modal transition systems (MTS), a specification formalism introduced more than 20 years ago, has recently received a considerable attention in several different areas. Many of the fundamental questions related to MTSs have already been answered. However, the problem of the exact computational...... complexity of thorough refinement checking between two finite MTSs remained unsolved. We settle down this question by showing EXPTIME-completeness of thorough refinement checking on finite MTSs. The upper-bound result relies on a novel algorithm running in single exponential time providing a direct goal...

The dynamics of Bertrand model with bounded rationality

International Nuclear Information System (INIS)

Zhang Jixiang; Da Qingli; Wang Yanhua

2009-01-01

The paper considers a Bertrand model with bounded rational. A duopoly game is modelled by two nonlinear difference equations. By using the theory of bifurcations of dynamical systems, the existence and stability for the equilibria of this system are obtained. Numerical simulations used to show bifurcations diagrams, phase portraits for various parameters and sensitive dependence on initial conditions. We observe that an increase of the speed of adjustment of bounded rational player may change the stability of Nash equilibrium point and cause bifurcation and chaos to occur. The analysis and results in this paper are interesting in mathematics and economics.

Lower Bounds in the Asymmetric External Memory Model

DEFF Research Database (Denmark)

Jacob, Riko; Sitchinava, Nodari

2017-01-01

Motivated by the asymmetric read and write costs of emerging non-volatile memory technologies, we study lower bounds for the problems of sorting, permuting and multiplying a sparse matrix by a dense vector in the asymmetric external memory model (AEM). Given an AEM with internal (symmetric) memory...... of size M, transfers between symmetric and asymmetric memory in blocks of size B and the ratio ω between write and read costs, we show Ω(min (N, ωN/B logω M/B N/B) lower bound for the cost of permuting N input elements. This lower bound also applies to the problem of sorting N elements. This proves...

Model checking conditional CSL for continuous-time Markov chains

DEFF Research Database (Denmark)

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...

Influence of low-energy scattering on loosely bound states

International Nuclear Information System (INIS)

Sparenberg, Jean-Marc; Capel, Pierre; Baye, Daniel

2010-01-01

Compact algebraic equations are derived that connect the binding energy and the asymptotic normalization constant (ANC) of a subthreshold bound state with the effective-range expansion of the corresponding partial wave. These relations are established for positively charged and neutral particles, using the analytic continuation of the scattering (S) matrix in the complex wave-number plane. Their accuracy is checked on simple local potential models for the 16 O+n, 16 O+p, and 12 C+α nuclear systems, with exotic nuclei and nuclear astrophysics applications in mind.

Combinatorial bounds on the α-divergence of univariate mixture models

KAUST Repository

Nielsen, Frank

2017-06-20

We derive lower- and upper-bounds of α-divergence between univariate mixture models with components in the exponential family. Three pairs of bounds are presented in order with increasing quality and increasing computational cost. They are verified empirically through simulated Gaussian mixture models. The presented methodology generalizes to other divergence families relying on Hellinger-type integrals.

A Novel Algorithm for Intrusion Detection Based on RASL Model Checking

Directory of Open Access Journals (Sweden)

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.

Models of bounded rationality under certainty

NARCIS (Netherlands)

Rasouli, S.; Timmermans, H.J.P.; Rasouli, S.; Timmermans, H.J.P.

2015-01-01

Purpose This chapter reviews models of decision-making and choice under conditions of certainty. It allows readers to position the contribution of the other chapters in this book in the historical development of the topic area. Theory Bounded rationality is defined in terms of a strategy to simplify

PENERAPAN MODEL PEMBELAJARAN KOOPERATIF TIPE PAIR CHECKS PEMECAHAN MASALAH UNTUK MENINGKATKAN SOCIAL SKILL SISWA

Directory of Open Access Journals (Sweden)

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

Systematic assignment of Feshbach resonances via an asymptotic bound state model

NARCIS (Netherlands)

Goosen, M.; Kokkelmans, SJ.J.M.F.

2008-01-01

We present an Asymptotic Bound state Model (ABM), which is useful to predict Feshbach resonances. The model utilizes asymptotic properties of the interaction potentials to represent coupled molecular wavefunctions. The bound states of this system give rise to Feshbach resonances, localized at the

Improved rigorous upper bounds for transport due to passive advection described by simple models of bounded systems

International Nuclear Information System (INIS)

Kim, Chang-Bae; Krommes, J.A.

1988-08-01

The work of Krommes and Smith on rigorous upper bounds for the turbulent transport of a passively advected scalar [/ital Ann. Phys./ 177:246 (1987)] is extended in two directions: (1) For their ''reference model,'' improved upper bounds are obtained by utilizing more sophisticated two-time constraints which include the effects of cross-correlations up to fourth order. Numerical solutions of the model stochastic differential equation are also obtained; they show that the new bounds compare quite favorably with the exact results, even at large Reynolds and Kubo numbers. (2) The theory is extended to take account of a finite spatial autocorrelation length L/sub c/. As a reasonably generic example, the problem of particle transport due to statistically specified stochastic magnetic fields in a collisionless turbulent plasma is revisited. A bound is obtained which reduces for small L/sub c/ to the quasilinear limit and for large L/sub c/ to the strong turbulence limit, and which provides a reasonable and rigorous interpolation for intermediate values of L/sub c/. 18 refs., 6 figs

Model based feasibility study on bidirectional check valves in wave energy converters

DEFF Research Database (Denmark)

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...

DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking

Directory of Open Access Journals (Sweden)

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.

Combinatorial bounds on the α-divergence of univariate mixture models

KAUST Repository

Nielsen, Frank; Sun, Ke

2017-01-01

We derive lower- and upper-bounds of α-divergence between univariate mixture models with components in the exponential family. Three pairs of bounds are presented in order with increasing quality and increasing computational cost. They are verified

Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

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.

Analysis of DIRAC's behavior using model checking with process algebra

CERN Document Server

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...

Optimizing ZigBee Security using Stochastic Model Checking

DEFF Research Database (Denmark)

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...

Hyperon polarizabilities in the bound-state soliton model

International Nuclear Information System (INIS)

Gobbi, C.; Scoccola, N.N.

1996-01-01

A detailed calculation of electric and magnetic static polarizabilities of octet hyperons is presented in the framework of the bound-state soliton model. Both seagull and dispersive contributions are considered, and the results are compared with different model predictions. (orig.)

Model-checking statistique pour la vérification de véhicules autonomes

OpenAIRE

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...

Modeling and analysis of cell membrane systems with probabilistic model checking

Science.gov (United States)

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

Analysis of an emergency diesel generator control system by compositional model checking. MODSAFE 2010 work report

International Nuclear Information System (INIS)

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.)

Model Checking Processes Specified In Join-Calculus Algebra

Directory of Open Access Journals (Sweden)

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.

Exploring L1 model space in search of conductivity bounds for the MT problem

Science.gov (United States)

Wheelock, B. D.; Parker, R. L.

2013-12-01

Geophysical inverse problems of the type encountered in electromagnetic techniques are highly non-unique. As a result, any single inverted model, though feasible, is at best inconclusive and at worst misleading. In this paper, we use modified inversion methods to establish bounds on electrical conductivity within a model of the earth. Our method consists of two steps, each making use of the 1-norm in model regularization. Both 1-norm minimization problems are framed without approximation as non-negative least-squares (NNLS) problems. First, we must identify a parsimonious set of regions within the model for which upper and lower bounds on average conductivity will be sought. This is accomplished by minimizing the 1-norm of spatial variation, which produces a model with a limited number of homogeneous regions; in fact, the number of homogeneous regions will never be greater than the number of data, regardless of the number of free parameters supplied. The second step establishes bounds for each of these regions with pairs of inversions. The new suite of inversions also uses a 1-norm penalty, but applied to the conductivity values themselves, rather than the spatial variation thereof. In the bounding step we use the 1-norm of our model parameters because it is proportional to average conductivity. For a lower bound on average conductivity, the 1-norm within a bounding region is minimized. For an upper bound on average conductivity, the 1-norm everywhere outside a bounding region is minimized. The latter minimization has the effect of concentrating conductance into the bounding region. Taken together, these bounds are a measure of the uncertainty in the associated region of our model. Starting with a blocky inverse solution is key in the selection of the bounding regions. Of course, there is a tradeoff between resolution and uncertainty: an increase in resolution (smaller bounding regions), results in greater uncertainty (wider bounds). Minimization of the 1-norm of

PENERAPAN MODEL PEMBELAJARAN KOOPERATIF TIPE PAIR CHECKS PEMECAHAN MASALAH UNTUK MENINGKATKAN SOCIAL SKILL SISWA

OpenAIRE

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...

Petri Net and Probabilistic Model Checking Based Approach for the Modelling, Simulation and Verification of Internet Worm Propagation.

Directory of Open Access Journals (Sweden)

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.

Design of Installing Check Dam Using RAMMS Model in Seorak National Park of South Korea

Science.gov (United States)

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

Symbolic Model Checking and Analysis for E-Commerce Protocol

Institute of Scientific and Technical Information of China (English)

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

Using Model Checking for Analyzing Distributed Power Control Problems

DEFF Research Database (Denmark)

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...

Model-Independent Lower Bounds for $b \\to d$ Penguin Processes

CERN Document Server

Fleischer, Robert; Fleischer, Robert; Recksiegel, Stefan

2005-01-01

For the exploration of flavour physics, b -> d penguin processes are an important aspect, with the prominent example of \\bar B^0_d -> K^0 \\bar K^0. We recently derived lower bounds for the CP-averaged branching ratio of this channel in the Standard Model; they were found to be very close to the corresponding experimental upper limits, thereby suggesting that \\bar B^0_d -> K^0 \\bar K^0 should soon be observed. In fact, the BaBar collaboration subsequently announced the first signals of this transition. Here we point out that it is also possible to derive lower bounds for \\bar B -> \\rho \\gamma decays, which are again surprisingly close to the current experimental upper limits. We show that these bounds are realizations of a general bound that holds within the Standard Model for b -> d penguin processes, allowing further applications to decays of the kind B^\\pm -> K^{(\\ast)\\pm} K^{(\\ast)} and B^\\pm -> \\pi^\\pm \\ell^+ \\ell^-, \\rho^\\pm \\ell^+ \\ell^-.

Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking

Data.gov (United States)

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...

Cryptography In The Bounded Quantum-Storage Model

DEFF Research Database (Denmark)

Damgård, Ivan Bjerre; Salvail, Louis; Schaffner, Christian

2005-01-01

We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivious transfer and bit commitment can be implemented in this model using protocols where honest parties need no quantum memory...

Cryptography in the Bounded Quantum-Storage Model

DEFF Research Database (Denmark)

Damgård, Ivan Bjerre; Serge, Fehr; Schaffner, Christian

2008-01-01

We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivious transfer and bit commitment can be implemented in this model using protocols where honest parties need no quantum memory...

Tools for model-independent bounds in direct dark matter searches

DEFF Research Database (Denmark)

Cirelli, M.; Del Nobile, E.; Panci, P.

2013-01-01

We discuss a framework (based on non-relativistic operators) and a self-contained set of numerical tools to derive the bounds from some current direct detection experiments on virtually any arbitrary model of Dark Matter elastically scattering on nuclei.......We discuss a framework (based on non-relativistic operators) and a self-contained set of numerical tools to derive the bounds from some current direct detection experiments on virtually any arbitrary model of Dark Matter elastically scattering on nuclei....

Logic Model Checking of Unintended Acceleration Claims in Toyota Vehicles

Science.gov (United States)

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

Two-vibron bound states in the β–Fermi–Pasta–Ulam model

International Nuclear Information System (INIS)

Hu Xinguang; Tang Yi

2008-01-01

This paper studies the two-vibron bound states in the β–Fermi–Pasta–Ulam model by means of the number conserving approximation combined with the number state method. The results indicate that on-site, adjacent-site and mixed two-vibron bound states may exist in the model. Specially, wave number has a significant effect on such bound states, which may be considered as the quantum effects of the localized states in quantum systems. (condensed matter: structure, thermal and mechanical properties)

Model Checking JAVA Programs Using Java Pathfinder

Science.gov (United States)

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.

Models for light QCD bound states

International Nuclear Information System (INIS)

LaCourse, D.P.

1992-01-01

After a brief overview of Regge, tower, and heavy-quark experimental data, this thesis examines two massless wave equations relevant to quark bound states. We establish general conditions on the Lorentz scalar and Lorentz vector potentials which yield arbitrary leading Regge trajectories for the case of circular classical motion. A semi-classical approximation which includes radial motion reproduces remarkably well the exact solutions. Conditions for tower structure are examined, and found to be incompatible with conditions which give a Nambu stringlike Regge slope. The author then proposes a generalization of the usual potential model of quark bound states in which the confining flux tube is a dynamical object carrying both angular momentum and energy. The Q bar Q-string system with spinless quarks is quantized using an implicit operator technique and the resulting relativistic wave equation is solved. For heavy quarks the usual Schroedinger valence-quark model is recovered. The Regge slope with light quarks agree with the classical rotating-string result and is significantly larger and the effects of short-range forces are also considered. A relativistic generalization of the quantized flux tube model predicts the glueball ground state mass to be √3/α' ≅ 1.9 GeV where α' is the normal Regge slope. The groundstate as well as excited levels like considerably above the expectations of previous models and also above various proposed experimental candidates. The glueball Regge slope is only about three-eighths that for valence quark hadrons. A semi-classical calculation of the Regge slope is in good agreement with a numerically exact value

Modelling Ca2+ bound Troponin in Excitation Contraction Coupling

Directory of Open Access Journals (Sweden)

Henry G. Zot

2016-09-01

Full Text Available To explain disparate decay rates of cytosolic Ca2+ and structural changes in the thin filaments during a twitch, we model the time course of Ca2+ bound troponin (Tn resulting from the free Ca2+ transient of fast skeletal muscle. In fibers stretched beyond overlap, the decay of Ca2+ as measured by a change in fluo 3 fluorescence is significantly slower than the intensity decay of the meridional 1/38.5 nm-1 reflection of Tn; this is not simply explained by considering only the Ca2+ binding properties of Tn alone (Matsuo, T., Iwamoto, H., and Yagi, N. (2010. Biophys. J. 99, 193-200. We apply a comprehensive model that includes the known Ca2+ binding properties of Tn in the context of the thin filament with and without cycling crossbridges. Calculations based on the model predict that the transient of Ca2+ bound Tn correlates with either the fluo 3 time course in muscle with overlapping thin and thick filaments or the intensity of the meridional 1/38.5 nm-1 reflection in overstretched muscle. Hence, cycling crossbridges delay the dissociation of Ca2+ from Tn. Correlation with the fluo 3 fluorescence change is not causal given that the transient of Ca2+ bound Tn depends on sarcomere length, whereas the fluo-3 fluorescence change does not. Transient positions of tropomyosin calculated from the time course of Ca2+ bound Tn are in reasonable agreement with the transient of measured perturbations of the Tn repeat in overlap and non-overlap muscle preparations.

An Efficient Explicit-time Description Method for Timed Model Checking

Directory of Open Access Journals (Sweden)

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.

Parameter discovery in stochastic biological models using simulated annealing and statistical model checking.

Science.gov (United States)

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.

Modelling and Analysis of Smart Grid: A Stochastic Model Checking Case Study

DEFF Research Database (Denmark)

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....

Possible check of the QCD parton model in semiinclusive μ- -production of tau/psi-meson

International Nuclear Information System (INIS)

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

Generalized Skyrme model with the loosely bound potential

Science.gov (United States)

Gudnason, Sven Bjarke; Zhang, Baiyang; Ma, Nana

2016-12-01

We study a generalization of the loosely bound Skyrme model which consists of the Skyrme model with a sixth-order derivative term—motivated by its fluidlike properties—and the second-order loosely bound potential—motivated by lowering the classical binding energies of higher-charged Skyrmions. We use the rational map approximation for the Skyrmion of topological charge B =4 , calculate the binding energy of the latter, and estimate the systematic error in using this approximation. In the parameter space that we can explore within the rational map approximation, we find classical binding energies as low as 1.8%, and once taking into account the contribution from spin-isospin quantization, we obtain binding energies as low as 5.3%. We also calculate the contribution from the sixth-order derivative term to the electric charge density and axial coupling.

Applying Model Checking to Industrial-Sized PLC Programs

CERN Document Server

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...

Introduction of Virtualization Technology to Multi-Process Model Checking

Science.gov (United States)

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.

Physical Uncertainty Bounds (PUB)

Energy Technology Data Exchange (ETDEWEB)

Vaughan, Diane Elizabeth [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Preston, Dean L. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2015-03-19

This paper introduces and motivates the need for a new methodology for determining upper bounds on the uncertainties in simulations of engineered systems due to limited fidelity in the composite continuum-level physics models needed to simulate the systems. We show that traditional uncertainty quantification methods provide, at best, a lower bound on this uncertainty. We propose to obtain bounds on the simulation uncertainties by first determining bounds on the physical quantities or processes relevant to system performance. By bounding these physics processes, as opposed to carrying out statistical analyses of the parameter sets of specific physics models or simply switching out the available physics models, one can obtain upper bounds on the uncertainties in simulated quantities of interest.

Minimal Z' models: present bounds and early LHC reach

International Nuclear Information System (INIS)

Salvioni, Ennio; Zwirner, Fabio; Villadoro, Giovanni

2009-01-01

We consider 'minimal' Z' models, whose phenomenology is controlled by only three parameters beyond the Standard Model ones: the Z' mass and two effective coupling constants. They encompass many popular models motivated by grand unification, as well as many arising in other theoretical contexts. This parameterization takes also into account both mass and kinetic mixing effects, which we show to be sizable in some cases. After discussing the interplay between the bounds from electroweak precision tests and recent direct searches at the Tevatron, we extend our analysis to estimate the early LHC discovery potential. We consider a center-of-mass energy from 7 towards 10 TeV and an integrated luminosity from 50 to several hundred pb -1 , taking all existing bounds into account. We find that the LHC will start exploring virgin land in parameter space for M Z' around 700 GeV, with lower masses still excluded by the Tevatron and higher masses still excluded by electroweak precision tests. Increasing the energy up to 10 TeV, the LHC will start probing a wider range of Z' masses and couplings, although several hundred pb -1 will be needed to explore the regions of couplings favored by grand unification and to overcome the Tevatron bounds in the mass region around 250 GeV.

Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking

DEFF Research Database (Denmark)

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...

Logical Specification and Analysis of Fault Tolerant Systems through Partial Model Checking

NARCIS (Netherlands)

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

Model checking of safety-critical software in the nuclear engineering domain

International Nuclear Information System (INIS)

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.

Model independent bounds on magnetic moments of Majorana neutrinos

International Nuclear Information System (INIS)

Bell, Nicole F.; Gorchtein, Mikhail; Ramsey-Musolf, Michael J.; Vogel, Petr; Wang, Peng

2006-01-01

We analyze the implications of neutrino masses for the magnitude of neutrino magnetic moments. By considering electroweak radiative corrections to the neutrino mass, we derive model-independent naturalness upper bounds on neutrino magnetic moments, μ ν , generated by physics above the electroweak scale. For Dirac neutrinos, the bound is several orders of magnitude more stringent than present experimental limits. However, for Majorana neutrinos the magnetic moment contribution to the mass is Yukawa suppressed. The bounds we derive for magnetic moments of Majorana neutrinos are weaker than present experimental limits if μ ν is generated by new physics at ∼1 TeV, and surpass current experimental sensitivity only for new physics scales >10-100 TeV. The discovery of a neutrino magnetic moment near present limits would thus signify that neutrinos are Majorana particles

PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool

KAUST Repository

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

Specification and Generation of Environment for Model Checking of Software Components

Czech Academy of Sciences Publication Activity Database

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

UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata

DEFF Research Database (Denmark)

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....

Error assessment of biogeochemical models by lower bound methods (NOMMA-1.0

Directory of Open Access Journals (Sweden)

V. Sauerland

2018-03-01

Full Text Available Biogeochemical models, capturing the major feedbacks of the pelagic ecosystem of the world ocean, are today often embedded into Earth system models which are increasingly used for decision making regarding climate policies. These models contain poorly constrained parameters (e.g., maximum phytoplankton growth rate, which are typically adjusted until the model shows reasonable behavior. Systematic approaches determine these parameters by minimizing the misfit between the model and observational data. In most common model approaches, however, the underlying functions mimicking the biogeochemical processes are nonlinear and non-convex. Thus, systematic optimization algorithms are likely to get trapped in local minima and might lead to non-optimal results. To judge the quality of an obtained parameter estimate, we propose determining a preferably large lower bound for the global optimum that is relatively easy to obtain and that will help to assess the quality of an optimum, generated by an optimization algorithm. Due to the unavoidable noise component in all observations, such a lower bound is typically larger than zero. We suggest deriving such lower bounds based on typical properties of biogeochemical models (e.g., a limited number of extremes and a bounded time derivative. We illustrate the applicability of the method with two real-world examples. The first example uses real-world observations of the Baltic Sea in a box model setup. The second example considers a three-dimensional coupled ocean circulation model in combination with satellite chlorophyll a.

Error assessment of biogeochemical models by lower bound methods (NOMMA-1.0)

Science.gov (United States)

Sauerland, Volkmar; Löptien, Ulrike; Leonhard, Claudine; Oschlies, Andreas; Srivastav, Anand

2018-03-01

Biogeochemical models, capturing the major feedbacks of the pelagic ecosystem of the world ocean, are today often embedded into Earth system models which are increasingly used for decision making regarding climate policies. These models contain poorly constrained parameters (e.g., maximum phytoplankton growth rate), which are typically adjusted until the model shows reasonable behavior. Systematic approaches determine these parameters by minimizing the misfit between the model and observational data. In most common model approaches, however, the underlying functions mimicking the biogeochemical processes are nonlinear and non-convex. Thus, systematic optimization algorithms are likely to get trapped in local minima and might lead to non-optimal results. To judge the quality of an obtained parameter estimate, we propose determining a preferably large lower bound for the global optimum that is relatively easy to obtain and that will help to assess the quality of an optimum, generated by an optimization algorithm. Due to the unavoidable noise component in all observations, such a lower bound is typically larger than zero. We suggest deriving such lower bounds based on typical properties of biogeochemical models (e.g., a limited number of extremes and a bounded time derivative). We illustrate the applicability of the method with two real-world examples. The first example uses real-world observations of the Baltic Sea in a box model setup. The second example considers a three-dimensional coupled ocean circulation model in combination with satellite chlorophyll a.

Conformity checking of LPG Transportation Trucks by Modelling and Simulation

Directory of Open Access Journals (Sweden)

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.

Applied Bounded Model Checking for Interlocking System Designs

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth; Peleska, Jan; Pinger, Ralf

2014-01-01

In this paper the verification and validation of interlocking systems is investigated. Reviewing both geographical and route-related interlocking, the verification objectives can be structured from a perspective of computer science into (1) verification of static semantics, and (2) verification o...

Applied Bounded Model Checking for Interlocking System Designs

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth; Peleska, Jan; Pinger, Ralf

2013-01-01

In this article the verification and validation of interlocking systems is investigated. Reviewing both geographical and route-related interlocking, the verification objectives can be structured from a perspective of computer science into (1) verification of static semantics, and (2) verification...

Dynamic modelling of check valves in shipping terminals; Modelagem dinamica de valvulas de retencao em terminais maritimos

Energy Technology Data Exchange (ETDEWEB)

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)

Efficient model checking for duration calculus based on branching-time approximations

DEFF Research Database (Denmark)

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...

Re-derived overclosure bound for the inert doublet model

Science.gov (United States)

Biondini, S.; Laine, M.

2017-08-01

We apply a formalism accounting for thermal effects (such as modified Sommerfeld effect; Salpeter correction; decohering scatterings; dissociation of bound states), to one of the simplest WIMP-like dark matter models, associated with an "inert" Higgs doublet. A broad temperature range T ˜ M/20 . . . M/104 is considered, stressing the importance and less-understood nature of late annihilation stages. Even though only weak interactions play a role, we find that resummed real and virtual corrections increase the tree-level overclosure bound by 1 . . . 18%, depending on quartic couplings and mass splittings.

Typical performance of regular low-density parity-check codes over general symmetric channels

Energy Technology Data Exchange (ETDEWEB)

Tanaka, Toshiyuki [Department of Electronics and Information Engineering, Tokyo Metropolitan University, 1-1 Minami-Osawa, Hachioji-shi, Tokyo 192-0397 (Japan); Saad, David [Neural Computing Research Group, Aston University, Aston Triangle, Birmingham B4 7ET (United Kingdom)

2003-10-31

Typical performance of low-density parity-check (LDPC) codes over a general binary-input output-symmetric memoryless channel is investigated using methods of statistical mechanics. Relationship between the free energy in statistical-mechanics approach and the mutual information used in the information-theory literature is established within a general framework; Gallager and MacKay-Neal codes are studied as specific examples of LDPC codes. It is shown that basic properties of these codes known for particular channels, including their potential to saturate Shannon's bound, hold for general symmetric channels. The binary-input additive-white-Gaussian-noise channel and the binary-input Laplace channel are considered as specific channel models.

Typical performance of regular low-density parity-check codes over general symmetric channels

International Nuclear Information System (INIS)

Tanaka, Toshiyuki; Saad, David

2003-01-01

Typical performance of low-density parity-check (LDPC) codes over a general binary-input output-symmetric memoryless channel is investigated using methods of statistical mechanics. Relationship between the free energy in statistical-mechanics approach and the mutual information used in the information-theory literature is established within a general framework; Gallager and MacKay-Neal codes are studied as specific examples of LDPC codes. It is shown that basic properties of these codes known for particular channels, including their potential to saturate Shannon's bound, hold for general symmetric channels. The binary-input additive-white-Gaussian-noise channel and the binary-input Laplace channel are considered as specific channel models

Upper Higgs boson mass bounds from a chirally invariant lattice Higgs-Yukawa Model

Energy Technology Data Exchange (ETDEWEB)

Gerhold, P. [Humboldt-Universitaet, Berlin (Germany). Inst. fuer Physik; John von Neumann-Institut fuer Computing NIC/DESY, Zeuthen (Germany); Jansen, K. [John von Neumann-Institut fuer Computing NIC/DESY, Zeuthen (Germany)

2010-02-15

We establish the cutoff-dependent upper Higgs boson mass bound by means of direct lattice computations in the framework of a chirally invariant lattice Higgs-Yukawa model emulating the same chiral Yukawa coupling structure as in the Higgs-fermion sector of the Standard Model. As expected from the triviality picture of the Higgs sector, we observe the upper mass bound to decrease with rising cutoff parameter {lambda}. Moreover, the strength of the fermionic contribution to the upper mass bound is explored by comparing to the corresponding analysis in the pure {phi}{sup 4}-theory. (orig.)

Formal verification of dynamic hybrid systems: a NuSMV-based model checking approach

Directory of Open Access Journals (Sweden)

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.

Undecidability of model-checking branching-time properties of stateless probabilistic pushdown process

OpenAIRE

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.

Higgs mass bounds from a chirally invariant lattice Higgs-Yukawa model with overlap fermions

International Nuclear Information System (INIS)

Gerhold, Philipp; Kallarackal, Jim

2008-10-01

We study the parameter dependence of the Higgs mass in a chirally invariant lattice Higgs-Yukawa model emulating the same Higgs-fermion coupling structure as in the Higgs sector of the electroweak Standard Model. Eventually, the aim is to establish upper and lower Higgs mass bounds. Here we present our preliminary results on the lower Higgs mass bound at several selected values for the cutoff and give a brief outlook towards the upper Higgs mass bound. (orig.)

Percolation bounds for decoding thresholds with correlated erasures in quantum LDPC codes

Science.gov (United States)

Hamilton, Kathleen; Pryadko, Leonid

Correlations between errors can dramatically affect decoding thresholds, in some cases eliminating the threshold altogether. We analyze the existence of a threshold for quantum low-density parity-check (LDPC) codes in the case of correlated erasures. When erasures are positively correlated, the corresponding multi-variate Bernoulli distribution can be modeled in terms of cluster errors, where qubits in clusters of various size can be marked all at once. In a code family with distance scaling as a power law of the code length, erasures can be always corrected below percolation on a qubit adjacency graph associated with the code. We bound this correlated percolation transition by weighted (uncorrelated) percolation on a specially constructed cluster connectivity graph, and apply our recent results to construct several bounds for the latter. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-14-1-0272.

Stieltjes electrostatic model interpretation for bound state problems

Indian Academy of Sciences (India)

In this paper, it is shown that Stieltjes electrostatic model and quantum Hamilton Jacobi formalism are analogous to each other. This analogy allows the bound state problem to mimic as unit moving imaginary charges i ℏ , which are placed in between the two fixed imaginary charges arising due to the classical turning ...

Automated parameter estimation for biological models using Bayesian statistical model checking.

Science.gov (United States)

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.

Model-Checking of Linear-Time Properties in Multi-Valued Systems

OpenAIRE

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...

Simple nonparametric checks for model data fit in CAT

NARCIS (Netherlands)

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

Algebraic model checking for Boolean gene regulatory networks.

Science.gov (United States)

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.

Bounded fractional diffusion in geological media: Definition and Lagrangian approximation

Science.gov (United States)

Zhang, Yong; Green, Christopher T.; LaBolle, Eric M.; Neupauer, Roseanna M.; Sun, HongGuang

2016-01-01

Spatiotemporal Fractional-Derivative Models (FDMs) have been increasingly used to simulate non-Fickian diffusion, but methods have not been available to define boundary conditions for FDMs in bounded domains. This study defines boundary conditions and then develops a Lagrangian solver to approximate bounded, one-dimensional fractional diffusion. Both the zero-value and non-zero-value Dirichlet, Neumann, and mixed Robin boundary conditions are defined, where the sign of Riemann-Liouville fractional derivative (capturing non-zero-value spatial-nonlocal boundary conditions with directional super-diffusion) remains consistent with the sign of the fractional-diffusive flux term in the FDMs. New Lagrangian schemes are then proposed to track solute particles moving in bounded domains, where the solutions are checked against analytical or Eularian solutions available for simplified FDMs. Numerical experiments show that the particle-tracking algorithm for non-Fickian diffusion differs from Fickian diffusion in relocating the particle position around the reflective boundary, likely due to the non-local and non-symmetric fractional diffusion. For a non-zero-value Neumann or Robin boundary, a source cell with a reflective face can be applied to define the release rate of random-walking particles at the specified flux boundary. Mathematical definitions of physically meaningful nonlocal boundaries combined with bounded Lagrangian solvers in this study may provide the only viable techniques at present to quantify the impact of boundaries on anomalous diffusion, expanding the applicability of FDMs from infinite do mains to those with any size and boundary conditions.

A Model-Free No-arbitrage Price Bound for Variance Options

Energy Technology Data Exchange (ETDEWEB)

Bonnans, J. Frederic, E-mail: frederic.bonnans@inria.fr [Ecole Polytechnique, INRIA-Saclay (France); Tan Xiaolu, E-mail: xiaolu.tan@polytechnique.edu [Ecole Polytechnique, CMAP (France)

2013-08-01

We suggest a numerical approximation for an optimization problem, motivated by its applications in finance to find the model-free no-arbitrage bound of variance options given the marginal distributions of the underlying asset. A first approximation restricts the computation to a bounded domain. Then we propose a gradient projection algorithm together with the finite difference scheme to solve the optimization problem. We prove the general convergence, and derive some convergence rate estimates. Finally, we give some numerical examples to test the efficiency of the algorithm.

Analyzing Phylogenetic Trees with Timed and Probabilistic Model Checking: The Lactose Persistence Case Study.

Science.gov (United States)

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.

Solving scheduling problems by untimed model checking. The clinical chemical analyser case study

NARCIS (Netherlands)

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

Analysis of DIRAC's behavior using model checking with process algebra

International Nuclear Information System (INIS)

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

Science.gov (United States)

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.

How useful are delta checks in the 21st century? A stochastic-dynamic model of specimen mix-up and detection

Directory of Open Access Journals (Sweden)

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.

Bounding uncertainty in volumetric geometric models for terrestrial lidar observations of ecosystems.

Science.gov (United States)

Paynter, Ian; Genest, Daniel; Peri, Francesco; Schaaf, Crystal

2018-04-06

Volumetric models with known biases are shown to provide bounds for the uncertainty in estimations of volume for ecologically interesting objects, observed with a terrestrial laser scanner (TLS) instrument. Bounding cuboids, three-dimensional convex hull polygons, voxels, the Outer Hull Model and Square Based Columns (SBCs) are considered for their ability to estimate the volume of temperate and tropical trees, as well as geomorphological features such as bluffs and saltmarsh creeks. For temperate trees, supplementary geometric models are evaluated for their ability to bound the uncertainty in cylinder-based reconstructions, finding that coarser volumetric methods do not currently constrain volume meaningfully, but may be helpful with further refinement, or in hybridized models. Three-dimensional convex hull polygons consistently overestimate object volume, and SBCs consistently underestimate volume. Voxel estimations vary in their bias, due to the point density of the TLS data, and occlusion, particularly in trees. The response of the models to parametrization is analysed, observing unexpected trends in the SBC estimates for the drumlin dataset. Establishing that this result is due to the resolution of the TLS observations being insufficient to support the resolution of the geometric model, it is suggested that geometric models with predictable outcomes can also highlight data quality issues when they produce illogical results.

Vulnerable Derivatives and Good Deal Bounds: A Structural Model

DEFF Research Database (Denmark)

Murgoci, Agatha

2013-01-01

We price vulnerable derivatives -- i.e. derivatives where the counterparty may default. These are basically the derivatives traded on the over-the-counter (OTC) markets. Default is modeled in a structural framework. The technique employed for pricing is good deal bounds (GDBs). The method imposes...

Check, check, double check: checking the autopilot causes distrust : Experimental studies on the effects of compulsive perseveration

NARCIS (Netherlands)

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

Finite state projection based bounds to compare chemical master equation models using single-cell data

Energy Technology Data Exchange (ETDEWEB)

Fox, Zachary [School of Biomedical Engineering, Colorado State University, Fort Collins, Colorado 80523 (United States); Neuert, Gregor [Department of Molecular Physiology and Biophysics, Vanderbilt University School of Medicine, Nashville, Tennessee 37232 (United States); Department of Pharmacology, School of Medicine, Vanderbilt University, Nashville, Tennessee 37232 (United States); Department of Biomedical Engineering, Vanderbilt University School of Engineering, Nashville, Tennessee 37232 (United States); Munsky, Brian [School of Biomedical Engineering, Colorado State University, Fort Collins, Colorado 80523 (United States); Department of Chemical and Biological Engineering, Colorado State University, Fort Collins, Colorado 80523 (United States)

2016-08-21

Emerging techniques now allow for precise quantification of distributions of biological molecules in single cells. These rapidly advancing experimental methods have created a need for more rigorous and efficient modeling tools. Here, we derive new bounds on the likelihood that observations of single-cell, single-molecule responses come from a discrete stochastic model, posed in the form of the chemical master equation. These strict upper and lower bounds are based on a finite state projection approach, and they converge monotonically to the exact likelihood value. These bounds allow one to discriminate rigorously between models and with a minimum level of computational effort. In practice, these bounds can be incorporated into stochastic model identification and parameter inference routines, which improve the accuracy and efficiency of endeavors to analyze and predict single-cell behavior. We demonstrate the applicability of our approach using simulated data for three example models as well as for experimental measurements of a time-varying stochastic transcriptional response in yeast.

Model analysis of check dam impacts on long-term sediment and water budgets in southeast Arizona, USA

Science.gov (United States)

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.

Resolvent-based modeling of passive scalar dynamics in wall-bounded turbulence

Science.gov (United States)

Dawson, Scott; Saxton-Fox, Theresa; McKeon, Beverley

2017-11-01

The resolvent formulation of the Navier-Stokes equations expresses the system state as the output of a linear (resolvent) operator acting upon a nonlinear forcing. Previous studies have demonstrated that a low-rank approximation of this linear operator predicts many known features of incompressible wall-bounded turbulence. In this work, this resolvent model for wall-bounded turbulence is extended to include a passive scalar field. This formulation allows for a number of additional simplifications that reduce model complexity. Firstly, it is shown that the effect of changing scalar diffusivity can be approximated through a transformation of spatial wavenumbers and temporal frequencies. Secondly, passive scalar dynamics may be studied through the low-rank approximation of a passive scalar resolvent operator, which is decoupled from velocity response modes. Thirdly, this passive scalar resolvent operator is amenable to approximation by semi-analytic methods. We investigate the extent to which this resulting hierarchy of models can describe and predict passive scalar dynamics and statistics in wall-bounded turbulence. The support of AFOSR under Grant Numbers FA9550-16-1-0232 and FA9550-16-1-0361 is gratefully acknowledged.

A practical approach to model checking Duration Calculus using Presburger Arithmetic

DEFF Research Database (Denmark)

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....

Symanzik approach in modeling of bound states of Dirac particle in singular background

Directory of Open Access Journals (Sweden)

Pismak Yu. M.

2017-01-01

Full Text Available In the model of interaction of spinor field with homogeneous isotropic material plane constructed in framework of Symanzik approach, the bound states are studied. For localized near plane Dirac particle the expression for current, charge and density are presented. For bound state with massless dispersion law the current, charge and density are calculated for simplified model with 2 parameter exactly.The model can find application to a wide class of phenomena arising by the interaction of fields of quantum electrodynamics with two-dimensional materials.

Stochastic bounded consensus of second-order multi-agent systems in noisy environment

International Nuclear Information System (INIS)

Ren Hong-Wei; Deng Fei-Qi

2017-01-01

This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted by noises and time delays. Based on the graph theory, stochastic tools, and the Lyapunov function method, we derive the sufficient conditions under which the systems would reach stochastic bounded consensus in mean square with the protocol we designed. Finally, a numerical simulation is illustrated to check the effectiveness of the proposed algorithms. (paper)

Fault Tree Analysis with Temporal Gates and Model Checking Technique for Qualitative System Safety Analysis

International Nuclear Information System (INIS)

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

Non intrusive check valve diagnostics at Bruce A

International Nuclear Information System (INIS)

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

Energy Technology Data Exchange (ETDEWEB)

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)

Topological boundary conditions, the BPS bound, and elimination of ambiguities in the quantum mass of solitons

International Nuclear Information System (INIS)

Nastase, Horatiu; Stephanov, Misha; Nieuwenhuizen, Peter van; Rebhan, Anton

1999-01-01

We fix the long-standing ambiguity in the one-loop contribution to the mass of a 1 + 1-dimensional supersymmetric soliton by adopting a set of boundary conditions which follow from the symmetries of the action and which depend only on the topology of the sector considered, and by invoking a physical principle that ought to hold generally in quantum field theories with a topological sector: for vanishing mass and other dimensionful constants, the vacuum energies in the trivial and topological sectors have to become equal. In the two-dimensional N = 1 supersymmetric case we find a result which for the supersymmetric sine-Gordon model agrees with the known exact solution of the S-matrix but seems to violate the BPS bound. We analyze the non-trivial relation between the quantum soliton mass and the quantum BPS bound and find a resolution. For N = 2 supersymmetric theories, there are no one-loop corrections to the soliton mass and to the central charge (and also no ambiguities) so that the BPS bound is always saturated. Beyond one-loop there are no ambiguities in any theory, which we explicitly check by a two-loop calculation in the sine-Gordon model

Causal model of safety-checking action of the staff of nuclear power plants and the organization climate

International Nuclear Information System (INIS)

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)

Causal model of safety-checking action of the staff of nuclear power plants and the organization climate

Energy Technology Data Exchange (ETDEWEB)

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)

Analysis of DGNB-DK criteria for BIM-based Model Checking automatization

DEFF Research Database (Denmark)

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)....

Leader's opinion priority bounded confidence model for network opinion evolution

Science.gov (United States)

Zhu, Meixia; Xie, Guangqiang

2017-08-01

Aiming at the weight of trust someone given to participate in the interaction in Hegselmann-Krause's type consensus model is the same and virtual social networks among individuals with different level of education, personal influence, etc. For differences between agents, a novelty bounded confidence model was proposed with leader's opinion considered priority. Interaction neighbors can be divided into two kinds. The first kind is made up of "opinion leaders" group, another kind is made up of ordinary people. For different groups to give different weights of trust. We also analyzed the related characteristics of the new model under the symmetrical bounded confidence parameters and combined with the classical HK model were analyzed. Simulation experiment results show that no matter the network size and initial view is subject to uniform distribution or discrete distribution. We can control the "opinion-leader" good change the number of views and values, and even improve the convergence speed. Experiment also found that the choice of "opinion leaders" is not the more the better, the model well explain how the "opinion leader" in the process of the evolution of the public opinion play the role of the leader.

Metabolism of organically bound tritium

International Nuclear Information System (INIS)

Travis, C.C.

1984-01-01

The classic methodology for estimating dose to man from environmental tritium ignores the fact that organically bound tritium in foodstuffs may be directly assimilated in the bound compartment of tissues without previous oxidation. We propose a four-compartment model consisting of a free body water compartment, two organic compartments, and a small, rapidly metabolizing compartment. The utility of this model lies in the ability to input organically bound tritium in foodstuffs directly into the organic compartments of the model. We found that organically bound tritium in foodstuffs can increase cumulative total body dose by a factor of 1.7 to 4.5 times the free body water dose alone, depending on the bound-to-loose ratio of tritium in the diet. Model predictions are compared with empirical measurements of tritium in human urine and tissue samples, and appear to be in close agreement. 10 references, 4 figures, 3 tables

Simulation-Based Model Checking for Nondeterministic Systems and Rare Events

Science.gov (United States)

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

A rule-based approach to model checking of UML state machines

Science.gov (United States)

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.

Boson bound states in the β-Fermi–Pasta–Ulam model

Indian Academy of Sciences (India)

The bound states of four bosons in the quantum -Fermi–Pasta–Ulam model are investigated and some interesting results are presented using the number conserving approximation combined ... Proceedings of the International Workshop/Conference on Computational Condensed Matter Physics and Materials Science

Assessment of check-dam groundwater recharge with water-balance calculations

Science.gov (United States)

Djuma, Hakan; Bruggeman, Adriana; Camera, Corrado; Eliades, Marinos

2017-04-01

Studies on the enhancement of groundwater recharge by check-dams in arid and semi-arid environments mainly focus on deriving water infiltration rates from the check-dam ponding areas. This is usually achieved by applying simple water balance models, more advanced models (e.g., two dimensional groundwater models) and field tests (e.g., infiltrometer test or soil pit tests). Recharge behind the check-dam can be affected by the built-up of sediment as a result of erosion in the upstream watershed area. This natural process can increase the uncertainty in the estimates of the recharged water volume, especially for water balance calculations. Few water balance field studies of individual check-dams have been presented in the literature and none of them presented associated uncertainties of their estimates. The objectives of this study are i) to assess the effect of a check-dam on groundwater recharge from an ephemeral river; and ii) to assess annual sedimentation at the check-dam during a 4-year period. The study was conducted on a check-dam in the semi-arid island of Cyprus. Field campaigns were carried out to measure water flow, water depth and check-dam topography in order to establish check-dam water height, volume, evaporation, outflow and recharge relations. Topographic surveys were repeated at the end of consecutive hydrological years to estimate the sediment built up in the reservoir area of the check dam. Also, sediment samples were collected from the check-dam reservoir area for bulk-density analyses. To quantify the groundwater recharge, a water balance model was applied at two locations: at the check-dam and corresponding reservoir area, and at a 4-km stretch of the river bed without check-dam. Results showed that a check-dam with a storage capacity of 25,000 m3 was able to recharge to the aquifer, in four years, a total of 12 million m3 out of the 42 million m3 of measured (or modelled) streamflow. Recharge from the analyzed 4-km long river section without

Bounded Gaussian process regression

DEFF Research Database (Denmark)

Jensen, Bjørn Sand; Nielsen, Jens Brehm; Larsen, Jan

2013-01-01

We extend the Gaussian process (GP) framework for bounded regression by introducing two bounded likelihood functions that model the noise on the dependent variable explicitly. This is fundamentally different from the implicit noise assumption in the previously suggested warped GP framework. We...... with the proposed explicit noise-model extension....

Classification and checking model of pedestrian crossing

Directory of Open Access Journals (Sweden)

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.

Using Model Checking for Analyzing Distributed Power Control Problems

Directory of Open Access Journals (Sweden)

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.

Strongest model-independent bound on the lifetime of Dark Matter

CERN Document Server

Audren, Benjamin; Mangano, Gianpiero; Serpico, Pasquale Dario; Tram, Thomas

2014-01-01

Dark Matter is essential for structure formation in the late Universe so it must be stable on cosmological time scales. But how stable exactly? Only assuming decays into relativistic particles, we report an otherwise model independent bound on the lifetime of Dark Matter using current cosmological data. Since these decays affect only the low-$\\ell$ multipoles of the CMB, the Dark Matter lifetime is expected to correlate with the tensor-to-scalar ratio $r$ as well as curvature $\\Omega_k$. We consider two models, including $r$ and $r+\\Omega_k$ respectively, versus data from Planck, WMAP, WiggleZ and Baryon Acoustic Oscillations, with or without the BICEP2 data (if interpreted in terms of primordial gravitational waves). This results in a lower bound on the lifetime of CDM given by 160Gyr (without BICEP2) or 200Gyr (with BICEP2) at 95% confidence level.

Quantitative modelling and analysis of a Chinese smart grid: a stochastic model checking case study

DEFF Research Database (Denmark)

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....

Transformation of UML Behavioral Diagrams to Support Software Model Checking

Directory of Open Access Journals (Sweden)

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.

Upper bounds on superpartner masses from upper bounds on the Higgs boson mass.

Science.gov (United States)

Cabrera, M E; Casas, J A; Delgado, A

2012-01-13

The LHC is putting bounds on the Higgs boson mass. In this Letter we use those bounds to constrain the minimal supersymmetric standard model (MSSM) parameter space using the fact that, in supersymmetry, the Higgs mass is a function of the masses of sparticles, and therefore an upper bound on the Higgs mass translates into an upper bound for the masses for superpartners. We show that, although current bounds do not constrain the MSSM parameter space from above, once the Higgs mass bound improves big regions of this parameter space will be excluded, putting upper bounds on supersymmetry (SUSY) masses. On the other hand, for the case of split-SUSY we show that, for moderate or large tanβ, the present bounds on the Higgs mass imply that the common mass for scalars cannot be greater than 10(11)  GeV. We show how these bounds will evolve as LHC continues to improve the limits on the Higgs mass.

The Effects of Check-In, Check-Up, Check-Out for Students with Moderate Intellectual Disability during On- and Off-Site Vocational Training

Science.gov (United States)

Boden, Lauren J.; Jolivette, Kristine; Alberto, Paul A.

2018-01-01

Check-in/check-out is a secondary-tier intervention within the positive behavior interventions and supports framework. Check-in/check-out pairs the use of an adult mentor with a daily progress report to help students meet individualized behavioral goals. This study adds to the research base by examining the effects of check-in, check-up, check-out…

Regular health checks

DEFF Research Database (Denmark)

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....

Fuzzy upper bounds and their applications

Energy Technology Data Exchange (ETDEWEB)

Soleimani-damaneh, M. [Department of Mathematics, Faculty of Mathematical Science and Computer Engineering, Teacher Training University, 599 Taleghani Avenue, Tehran 15618 (Iran, Islamic Republic of)], E-mail: soleimani_d@yahoo.com

2008-04-15

This paper considers the concept of fuzzy upper bounds and provides some relevant applications. Considering a fuzzy DEA model, the existence of a fuzzy upper bound for the objective function of the model is shown and an effective approach to solve that model is introduced. Some dual interpretations are provided, which are useful for practical purposes. Applications of the concept of fuzzy upper bounds in two physical problems are pointed out.

40 CFR 86.327-79 - Quench checks; NOX analyzer.

Science.gov (United States)

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...

Checking Java Programs

CERN Document Server

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

Establishing the existence of a distance-based upper bound for a fuzzy DEA model using duality

International Nuclear Information System (INIS)

Soleimani-damaneh, M.

2009-01-01

In a recent paper [Soleimani-damaneh M. Fuzzy upper bounds and their applications. Chaos, Solitons and Fractals 2008;36:217-25.], I established the existence of a distance-based fuzzy upper bound for the objective function of a fuzzy DEA model, using the properties of a discussed signed distance, and provided an effective approach to solve that model. In this paper a new dual-based proof for the existence of the above-mentioned upper bound is provided which gives a useful insight into the theory of fuzzy DEA.

Sediment depositions upstream of open check dams: new elements from small scale models

Science.gov (United States)

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).

Chiefly Symmetric: Results on the Scalability of Probabilistic Model Checking for Operating-System Code

Directory of Open Access Journals (Sweden)

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.

Checking behavioral conformance of artifacts

NARCIS (Netherlands)

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

Bag-model analyses of proton-antiproton scattering and atomic bound states

International Nuclear Information System (INIS)

Alberg, M.A.; Freedman, R.A.; Henley, E.M.; Hwang, W.P.; Seckel, D.; Wilets, L.

1983-01-01

We study proton-antiproton (pp-bar ) scattering using the static real potential of Bryan and Phillips outside a cutoff radius rsub0 and two different shapes for the imaginary potential inside a radius R*. These forms, motivated by bag models, are a one-gluon-annihilation potential and a simple geometric-overlap form. In both cases there are three adjustable parameters: the effective bag radius R*, the effective strong coupling constant αsubssup*, and rsub0. There is also a choice for the form of the real potential inside the cutoff radius rsub0. Analysis of the pp-bar scattering data in the laboratory-momentum region 0.4--0.7 GeV/c yields an effective nucleon bag radius R* in the range 0.6--1.1 fm, with the best fit obtained for R* = 0.86 fm. Arguments are presented that the deduced value of R* is likely to be an upper bound on the isolated nucleon bag radius. The present results are consistent with the range of bag radii in current bag models. We have also used the resultant optical potential to calculate the shifts and widths of the sup3Ssub1 and sup1Ssub0 atomic bound states of the pp-bar system. For both states we find upward (repulsive) shifts and widths of about 1 keV. We find no evidence for narrow, strongly bound pp-bar states in our potential model

The Kadanoff lower-bound variational renormalization group applied to an SU(2) lattice spin model

International Nuclear Information System (INIS)

Thorleifsson, G.; Damgaard, P.H.

1990-07-01

We apply the variational lower-bound Renormalization Group transformation of Kadanoff to an SU(2) lattice spin model in 2 and 3 dimensions. Even in the one-hypercube framework of this renormalization group transformation the present model is characterised by having an infinite basis of fundamental operators. We investigate whether the lower-bound variational renormalization group transformation yields results stable under truncations of this operator basis. Our results show that for this particular spin model this is not the case. (orig.)

Innovative Adolescent Chemical Dependency Treatment and Its Outcome: A Model Based on Outward Bound Programming.

Science.gov (United States)

McPeake, John D.; And Others

1991-01-01

Describes adolescent chemical dependency treatment model developed at Beech Hill Hospital (New Hampshire) which integrated Twelve Step-oriented alcohol and drug rehabilitation program with experiential education school, Hurricane Island Outward Bound School. Describes Beech Hill Hurricane Island Outward Bound School Adolescent Chemical Dependency…

Re-engineering pre-employment check-up systems: a model for improving health services.

Science.gov (United States)

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.

Improved bounds on the epidemic threshold of exact SIS models on complex networks

KAUST Repository

Ruhi, Navid Azizan; Thrampoulidis, Christos; Hassibi, Babak

2017-01-01

The SIS (susceptible-infected-susceptible) epidemic model on an arbitrary network, without making approximations, is a 2n-state Markov chain with a unique absorbing state (the all-healthy state). This makes analysis of the SIS model and, in particular, determining the threshold of epidemic spread quite challenging. It has been shown that the exact marginal probabilities of infection can be upper bounded by an n-dimensional linear time-invariant system, a consequence of which is that the Markov chain is “fast-mixing” when the LTI system is stable, i.e. when equation (where β is the infection rate per link, δ is the recovery rate, and λmax(A) is the largest eigenvalue of the network's adjacency matrix). This well-known threshold has been recently shown not to be tight in several cases, such as in a star network. In this paper, we provide tighter upper bounds on the exact marginal probabilities of infection, by also taking pairwise infection probabilities into account. Based on this improved bound, we derive tighter eigenvalue conditions that guarantee fast mixing (i.e., logarithmic mixing time) of the chain. We demonstrate the improvement of the threshold condition by comparing the new bound with the known one on various networks with various epidemic parameters.

Improved bounds on the epidemic threshold of exact SIS models on complex networks

KAUST Repository

Ruhi, Navid Azizan

2017-01-05

The SIS (susceptible-infected-susceptible) epidemic model on an arbitrary network, without making approximations, is a 2n-state Markov chain with a unique absorbing state (the all-healthy state). This makes analysis of the SIS model and, in particular, determining the threshold of epidemic spread quite challenging. It has been shown that the exact marginal probabilities of infection can be upper bounded by an n-dimensional linear time-invariant system, a consequence of which is that the Markov chain is “fast-mixing” when the LTI system is stable, i.e. when equation (where β is the infection rate per link, δ is the recovery rate, and λmax(A) is the largest eigenvalue of the network\\'s adjacency matrix). This well-known threshold has been recently shown not to be tight in several cases, such as in a star network. In this paper, we provide tighter upper bounds on the exact marginal probabilities of infection, by also taking pairwise infection probabilities into account. Based on this improved bound, we derive tighter eigenvalue conditions that guarantee fast mixing (i.e., logarithmic mixing time) of the chain. We demonstrate the improvement of the threshold condition by comparing the new bound with the known one on various networks with various epidemic parameters.

Bounding the electrostatic free energies associated with linear continuum models of molecular solvation.

Science.gov (United States)

Bardhan, Jaydeep P; Knepley, Matthew G; Anitescu, Mihai

2009-03-14

The importance of electrostatic interactions in molecular biology has driven extensive research toward the development of accurate and efficient theoretical and computational models. Linear continuum electrostatic theory has been surprisingly successful, but the computational costs associated with solving the associated partial differential equations (PDEs) preclude the theory's use in most dynamical simulations. Modern generalized-Born models for electrostatics can reproduce PDE-based calculations to within a few percent and are extremely computationally efficient but do not always faithfully reproduce interactions between chemical groups. Recent work has shown that a boundary-integral-equation formulation of the PDE problem leads naturally to a new approach called boundary-integral-based electrostatics estimation (BIBEE) to approximate electrostatic interactions. In the present paper, we prove that the BIBEE method can be used to rigorously bound the actual continuum-theory electrostatic free energy. The bounds are validated using a set of more than 600 proteins. Detailed numerical results are presented for structures of the peptide met-enkephalin taken from a molecular-dynamics simulation. These bounds, in combination with our demonstration that the BIBEE methods accurately reproduce pairwise interactions, suggest a new approach toward building a highly accurate yet computationally tractable electrostatic model.

Bounding the electrostatic free energies associated with linear continuum models of molecular solvation.

Energy Technology Data Exchange (ETDEWEB)

Bardhan, J. P.; Knepley, M. G.; Anitescu, M. (Biosciences Division); ( MCS); (Rush Univ.)

2009-03-01

The importance of electrostatic interactions in molecular biology has driven extensive research toward the development of accurate and efficient theoretical and computational models. Linear continuum electrostatic theory has been surprisingly successful, but the computational costs associated with solving the associated partial differential equations (PDEs) preclude the theory's use in most dynamical simulations. Modern generalized-Born models for electrostatics can reproduce PDE-based calculations to within a few percent and are extremely computationally efficient but do not always faithfully reproduce interactions between chemical groups. Recent work has shown that a boundary-integral-equation formulation of the PDE problem leads naturally to a new approach called boundary-integral-based electrostatics estimation (BIBEE) to approximate electrostatic interactions. In the present paper, we prove that the BIBEE method can be used to rigorously bound the actual continuum-theory electrostatic free energy. The bounds are validated using a set of more than 600 proteins. Detailed numerical results are presented for structures of the peptide met-enkephalin taken from a molecular-dynamics simulation. These bounds, in combination with our demonstration that the BIBEE methods accurately reproduce pairwise interactions, suggest a new approach toward building a highly accurate yet computationally tractable electrostatic model.

Improved Range Searching Lower Bounds

DEFF Research Database (Denmark)

Larsen, Kasper Green; Nguyen, Huy L.

2012-01-01

by constructing a hard input set and query set, and then invoking Chazelle and Rosenberg's [CGTA'96] general theorem on the complexity of navigation in the pointer machine. For the group model, we show that input sets and query sets that are hard for range reporting in the pointer machine (i.e. by Chazelle...... and Rosenberg's theorem), are also hard for dynamic range searching in the group model. This theorem allows us to reuse decades of research on range reporting lower bounds to immediately obtain a range of new group model lower bounds. Amongst others, this includes an improved lower bound for the fundamental...

From Collective Adaptive Systems to Human Centric Computation and Back: Spatial Model Checking for Medical Imaging

Directory of Open Access Journals (Sweden)

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.

14 CFR 121.411 - Qualifications: Check airmen (airplane) and check airmen (simulator).

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Qualifications: Check airmen (airplane) and... § 121.411 Qualifications: Check airmen (airplane) and check airmen (simulator). (a) For the purposes of this section and § 121.413: (1) A check airman (airplane) is a person who is qualified, and permitted...

Next-generation nozzle check valve significantly reduces operating costs

Energy Technology Data Exchange (ETDEWEB)

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.

A point particle model of lightly bound skyrmions

Directory of Open Access Journals (Sweden)

Mike Gillard

2017-04-01

Full Text Available A simple model of the dynamics of lightly bound skyrmions is developed in which skyrmions are replaced by point particles, each carrying an internal orientation. The model accounts well for the static energy minimizers of baryon number 1≤B≤8 obtained by numerical simulation of the full field theory. For 9≤B≤23, a large number of static solutions of the point particle model are found, all closely resembling size B subsets of a face centred cubic lattice, with the particle orientations dictated by a simple colouring rule. Rigid body quantization of these solutions is performed, and the spin and isospin of the corresponding ground states extracted. As part of the quantization scheme, an algorithm to compute the symmetry group of an oriented point cloud, and to determine its corresponding Finkelstein–Rubinstein constraints, is devised.

Simulation-based model checking approach to cell fate specification during Caenorhabditis elegans vulval development by hybrid functional Petri net with extension

Directory of Open Access Journals (Sweden)

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

An Integrated Approach of Model checking and Temporal Fault Tree for System Safety Analysis

Energy Technology Data Exchange (ETDEWEB)

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.

Fragment-based modelling of single stranded RNA bound to RNA recognition motif containing proteins

Science.gov (United States)

de Beauchene, Isaure Chauvot; de Vries, Sjoerd J.; Zacharias, Martin

2016-01-01

Abstract Protein-RNA complexes are important for many biological processes. However, structural modeling of such complexes is hampered by the high flexibility of RNA. Particularly challenging is the docking of single-stranded RNA (ssRNA). We have developed a fragment-based approach to model the structure of ssRNA bound to a protein, based on only the protein structure, the RNA sequence and conserved contacts. The conformational diversity of each RNA fragment is sampled by an exhaustive library of trinucleotides extracted from all known experimental protein–RNA complexes. The method was applied to ssRNA with up to 12 nucleotides which bind to dimers of the RNA recognition motifs (RRMs), a highly abundant eukaryotic RNA-binding domain. The fragment based docking allows a precise de novo atomic modeling of protein-bound ssRNA chains. On a benchmark of seven experimental ssRNA–RRM complexes, near-native models (with a mean heavy-atom deviation of <3 Å from experiment) were generated for six out of seven bound RNA chains, and even more precise models (deviation < 2 Å) were obtained for five out of seven cases, a significant improvement compared to the state of the art. The method is not restricted to RRMs but was also successfully applied to Pumilio RNA binding proteins. PMID:27131381

Upper and lower Higgs boson mass bounds from a chirally invariant lattice Higgs-Yukawa model

International Nuclear Information System (INIS)

Gerhold, Philipp Frederik Clemens

2009-01-01

Motivated by the advent of the Large Hadron Collider (LHC) the aim of the present work is the non-perturbative determination of the cutoff-dependent upper and lower mass bounds of the Standard Model Higgs boson based on first principle calculations, in particular not relying on additional information such as the triviality property of the Higgs- Yukawa sector or indirect arguments like vacuum stability considerations. For that purpose the lattice approach is employed to allow for a non-perturbative investigation of a chirally invariant lattice Higgs-Yukawa model, serving here as a reasonable simplification of the full Standard Model, containing only those fields and interactions which are most essential for the intended Higgs boson mass determination. These are the complex Higgs doublet as well as the top and bottom quark fields and their mutual interactions. To maintain the chiral character of the Standard Model Higgs-fermion coupling also on the lattice, the latter model is constructed on the basis of the Neuberger overlap operator, obeying then an exact global lattice chiral symmetry. Respecting the fermionic degrees of freedom in a fully dynamical manner by virtue of a PHMC algorithm appropriately adapted to the here intended lattice calculations, such mass bounds can indeed be established with the aforementioned approach. Supported by analytical calculations performed in the framework of the constraint effective potential, the lower bound is found to be approximately m low H (Λ)=80 GeV at a cutoff of Λ=1000 GeV. The emergence of a lower Higgs boson mass bound is thus a manifest property of the pure Higgs-Yukawa sector that evolves directly from the Higgs-fermion interaction for a given set of Yukawa coupling constants. Its quantitative size, however, turns out to be non-universal in the sense, that it depends on the specific form, for instance, of the Higgs boson self-interaction. The upper Higgs boson mass bound is then established in the strong coupling

Location Contexts of User Check-Ins to Model Urban Geo Life-Style Patterns

Science.gov (United States)

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

Triviality bound on lightest Higgs mass in next to minimal supersymmetric model

International Nuclear Information System (INIS)

Choudhury, S.R.; Mamta; Dutta, Sukanta

1998-01-01

We study the implication of triviality on Higgs sector in next to minimal supersymmetric model (NMSSM) using variational field theory. It is shown that the mass of the lightest Higgs boson in NMSSM has an upper bound ∼ 10 M w which is of the same order as that in the standard model. (author)

Organically bound tritium

International Nuclear Information System (INIS)

Diabate, S.; Strack, S.

1993-01-01

Tritium released into the environment may be incorporated into organic matter. Organically bound tritium in that case will show retention times in organisms that are considerably longer than those of tritiated water which has significant consequences on dose estimates. This article reviews the most important processes of organically bound tritium production and transport through food networks. Metabolic reactions in plant and animal organisms with tritiated water as a reaction partner are of great importance in this respect. The most important production process, in quantitative terms, is photosynthesis in green plants. The translocation of organically bound tritium from the leaves to edible parts of crop plants should be considered in models of organically bound tritium behavior. Organically bound tritium enters the human body on several pathways, either from the primary producers (vegetable food) or at a higher tropic level (animal food). Animal experiments have shown that the dose due to ingestion of organically bound tritium can be up to twice as high as a comparable intake of tritiated water in gaseous or liquid form. In the environment, organically bound tritium in plants and animals is often found to have higher specific tritium concentrations than tissue water. This is not due to some tritium enrichment effects but to the fact that no equilibrium conditions are reached under natural conditions. 66 refs

An evolutionary model of bounded rationality and intelligence.

Directory of Open Access Journals (Sweden)

Thomas J Brennan

Full Text Available BACKGROUND: Most economic theories are based on the premise that individuals maximize their own self-interest and correctly incorporate the structure of their environment into all decisions, thanks to human intelligence. The influence of this paradigm goes far beyond academia-it underlies current macroeconomic and monetary policies, and is also an integral part of existing financial regulations. However, there is mounting empirical and experimental evidence, including the recent financial crisis, suggesting that humans do not always behave rationally, but often make seemingly random and suboptimal decisions. METHODS AND FINDINGS: Here we propose to reconcile these contradictory perspectives by developing a simple binary-choice model that takes evolutionary consequences of decisions into account as well as the role of intelligence, which we define as any ability of an individual to increase its genetic success. If no intelligence is present, our model produces results consistent with prior literature and shows that risks that are independent across individuals in a generation generally lead to risk-neutral behaviors, but that risks that are correlated across a generation can lead to behaviors such as risk aversion, loss aversion, probability matching, and randomization. When intelligence is present the nature of risk also matters, and we show that even when risks are independent, either risk-neutral behavior or probability matching will occur depending upon the cost of intelligence in terms of reproductive success. In the case of correlated risks, we derive an implicit formula that shows how intelligence can emerge via selection, why it may be bounded, and how such bounds typically imply the coexistence of multiple levels and types of intelligence as a reflection of varying environmental conditions. CONCLUSIONS: Rational economic behavior in which individuals maximize their own self interest is only one of many possible types of behavior that

An evolutionary model of bounded rationality and intelligence.

Science.gov (United States)

Brennan, Thomas J; Lo, Andrew W

2012-01-01

Most economic theories are based on the premise that individuals maximize their own self-interest and correctly incorporate the structure of their environment into all decisions, thanks to human intelligence. The influence of this paradigm goes far beyond academia-it underlies current macroeconomic and monetary policies, and is also an integral part of existing financial regulations. However, there is mounting empirical and experimental evidence, including the recent financial crisis, suggesting that humans do not always behave rationally, but often make seemingly random and suboptimal decisions. Here we propose to reconcile these contradictory perspectives by developing a simple binary-choice model that takes evolutionary consequences of decisions into account as well as the role of intelligence, which we define as any ability of an individual to increase its genetic success. If no intelligence is present, our model produces results consistent with prior literature and shows that risks that are independent across individuals in a generation generally lead to risk-neutral behaviors, but that risks that are correlated across a generation can lead to behaviors such as risk aversion, loss aversion, probability matching, and randomization. When intelligence is present the nature of risk also matters, and we show that even when risks are independent, either risk-neutral behavior or probability matching will occur depending upon the cost of intelligence in terms of reproductive success. In the case of correlated risks, we derive an implicit formula that shows how intelligence can emerge via selection, why it may be bounded, and how such bounds typically imply the coexistence of multiple levels and types of intelligence as a reflection of varying environmental conditions. Rational economic behavior in which individuals maximize their own self interest is only one of many possible types of behavior that arise from natural selection. The key to understanding which types of

Check valve

Science.gov (United States)

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.

Check valve

International Nuclear Information System (INIS)

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

The Preisach hysteresis model: Error bounds for numerical identification and inversion

Czech Academy of Sciences Publication Activity Database

Krejčí, Pavel

2013-01-01

Roč. 6, č. 1 (2013), s. 101-119 ISSN 1937-1632 R&D Projects: GA ČR GAP201/10/2315 Institutional support: RVO:67985840 Keywords : hysteresis * Preisach model * error bounds Subject RIV: BA - General Mathematics http://www.aimsciences.org/journals/displayArticlesnew.jsp?paperID=7779

Checking the Adequacy of Fit of Models from Split-Plot Designs

DEFF Research Database (Denmark)

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 comparison between skeleton and bounding box models for falling direction recognition

Science.gov (United States)

Narupiyakul, Lalita; Srisrisawang, Nitikorn

2017-12-01

Falling is an injury that can lead to a serious medical condition in every range of the age of people. However, in the case of elderly, the risk of serious injury is much higher. Due to the fact that one way of preventing serious injury is to treat the fallen person as soon as possible, several works attempted to implement different algorithms to recognize the fall. Our work compares the performance of two models based on features extraction: (i) Body joint data (Skeleton Data) which are the joint's positions in 3 axes and (ii) Bounding box (Box-size Data) covering all body joints. Machine learning algorithms that were chosen are Decision Tree (DT), Naïve Bayes (NB), K-nearest neighbors (KNN), Linear discriminant analysis (LDA), Voting Classification (VC), and Gradient boosting (GB). The results illustrate that the models trained with Skeleton data are performed far better than those trained with Box-size data (with an average accuracy of 94-81% and 80-75%, respectively). KNN shows the best performance in both Body joint model and Bounding box model. In conclusion, KNN with Body joint model performs the best among the others.

Probabilistic error bounds for reduced order modeling

Energy Technology Data Exchange (ETDEWEB)

Abdo, M.G.; Wang, C.; Abdel-Khalik, H.S., E-mail: abdo@purdue.edu, E-mail: wang1730@purdue.edu, E-mail: abdelkhalik@purdue.edu [Purdue Univ., School of Nuclear Engineering, West Lafayette, IN (United States)

2015-07-01

Reduced order modeling has proven to be an effective tool when repeated execution of reactor analysis codes is required. ROM operates on the assumption that the intrinsic dimensionality of the associated reactor physics models is sufficiently small when compared to the nominal dimensionality of the input and output data streams. By employing a truncation technique with roots in linear algebra matrix decomposition theory, ROM effectively discards all components of the input and output data that have negligible impact on reactor attributes of interest. This manuscript introduces a mathematical approach to quantify the errors resulting from the discarded ROM components. As supported by numerical experiments, the introduced analysis proves that the contribution of the discarded components could be upper-bounded with an overwhelmingly high probability. The reverse of this statement implies that the ROM algorithm can self-adapt to determine the level of the reduction needed such that the maximum resulting reduction error is below a given tolerance limit that is set by the user. (author)

Bounds on the number of bound states in the transfer matrix spectrum for some weakly correlated lattice models

International Nuclear Information System (INIS)

O’Carroll, Michael

2012-01-01

We consider the interaction of particles in weakly correlated lattice quantum field theories. In the imaginary time functional integral formulation of these theories there is a relative coordinate lattice Schroedinger operator H which approximately describes the interaction of these particles. Scalar and vector spin, QCD and Gross-Neveu models are included in these theories. In the weakly correlated regime H=H o +W where H o =−γΔ l , 0 l is the d-dimensional lattice Laplacian: γ=β, the inverse temperature for spin systems and γ=κ 3 where κ is the hopping parameter for QCD. W is a self-adjoint potential operator which may have non-local contributions but obeys the bound ‖W(x, y)‖⩽cexp ( −a(‖x‖+‖y‖)), a large: exp−a=β/β o (1/2) (κ/κ o ) for spin (QCD) models. H o , W, and H act in l 2 (Z d ), d⩾ 1. The spectrum of H below zero is known to be discrete and we obtain bounds on the number of states below zero. This number depends on the short range properties of W, i.e., the long range tail does not increase the number of states.

Transient analysis for a system with a tilted disc check valve

International Nuclear Information System (INIS)

Jeung, Jaesik; Lee, Kyukwang; Cho, Daegwan

2014-01-01

Check valves are used to prevent reverse flow conditions in a variety of systems in nuclear power plants. When a check valve is closed by a reverse flow, the transient load can jeopardize the structural integrity on the piping system and its supports. It may also damage intended function of the in-line components even though the severity of the load differs and depends strongly on types of the check valves. To incorporate the transient load in the piping system, it is very important to properly predict the system response to transients such as a check valve closure accompanied by pump trip and to evaluate the system transient. The one-dimensional transient simulation codes such as the RELAP5/MOD3.3 and TRACE were used. There has not been a single model that integrates the two codes to handle the behavior of a tilted disc check valve, which is designed to mitigate check valve slams by shorting the travel of the disc. In this paper a model is presented to predict the dynamic motion of a tilted disc check valve in the transient simulation using the RELAP5/MOD3.3 code and the model is incorporated in a system transient analysis using control variables of the code. In addition, transient analysis for Essential Service Water (ESW) system is performed using the proposed model and the associated load is evaluated for the system. (author)

Bound and rebound states

International Nuclear Information System (INIS)

Orzalesi, C.A.

1979-01-01

In relativistic quantum theory, bound states generate forces in the crossed channel; such forces can affect the binding and self-consistent solutions should be sought for the bound-state problem. The author investigates how self-consistency can be achieved by successive approximations, in a simple scalar model and with successive relativistic eikonal approximations (EAs). Within the generalized ladder approximation, some exact properties of the resulting ''first generation'' bound states are discussed. The binding energies in this approximation are rather small even for rather large values of the primary coupling constant. The coupling of the constituent particles to the first-generation reggeon is determined by a suitable EA and a new generalized ladder amplitude is constructed with rungs given either by the primary gluons or by the first-generation reggeons. The resulting new (second-generation) bound states are found in a reggeized EA. The size of the corrections to the binding energies due to the rebinding effects is surprisingly large. The procedure is then iterated, so as to find - again in an EA - the third-generation bound states. The procedure is found to be self-consistent already at this stage: the third-generation bound states coincide with those of second generation, and no further rebinding takes place in the higher iterations of the approximation method. Features - good and bad - of the model are discussed, as well as the possible relevance of rebinding mechanisms in hadron dynamics. (author)

Logic Model Checking of Unintended Acceleration Claims in the 2005 Toyota Camry Electronic Throttle Control System

Science.gov (United States)

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

14 CFR 91.1089 - Qualifications: Check pilots (aircraft) and check pilots (simulator).

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Qualifications: Check pilots (aircraft) and check pilots (simulator). 91.1089 Section 91.1089 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION... RULES Fractional Ownership Operations Program Management § 91.1089 Qualifications: Check pilots...

WE-E-BRB-10: DosCheck - an Electronic Chart Checking Tool for Dosimetrists.

Science.gov (United States)

Yang, D; Wu, Y; Yaddanapudi, S; Moore, K; Pierbuxg, B; Brame, S; Mutic, S

2012-06-01

In addition to treatment planning, dosimetrists have to prepare documentation and manually enter data in treatment management system (TMS) which did not transfer or setup automatically. The required documents and data are dependent on the disease site, treatment machine and clinical workflow. Errors and inconsistencies can cause redundant work, treatment delays and potentially treatment errors. To address these issues, an electronic checking software tool, DosCheck was clinically implemented to check the existence of necessary documentations and the integrity of manually-entered data. The purpose of this software is to reduce the frequency of human errors and to improve efficiency. DosCheck reads data and documents from 1) TMS, 2) Pinnacle TPS, and 3) DICOM plan files stored in a DICOM-RT PACS. It processes documents in Word and PDF format, treatment plan data in Pinnacle native format and DICOM format, and Mosaiq data in database records. The software cross-checks data accuracy and consistency by following rules that are pre-defined according to the clinical requirements and treatment sties. It interacts with dosimetrists and presents instantaneous results via graphical user interface. DosCheck has been implemented in C#. It performs a full check for a patient with 20 seconds. It has been clinically commissioned and is used daily by all dosimetrists at our institution. Retrospective analysis shows that DosCheck identifies 30% to 40% of previously reported dosimetrist human errors. Additional ∼30% errors are checked by other tools that could be integrated DosCheck in the near future. As an electronic data checking tool, DosCheck can obtain and process data and documents from multiple clinical computer systems in the radiation oncology department, and perform checks according to clinical rules. It is able to improve the accuracy and efficiency of clinical data and document process, and therefore to reduce any potential inconsistencies and errors. © 2012 American

Fluid Petri Nets and hybrid model-checking: a comparative case study

International Nuclear Information System (INIS)

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

Spot-checks to measure general hygiene practice.

Science.gov (United States)

Sonego, Ina L; Mosler, Hans-Joachim

2016-01-01

A variety of hygiene behaviors are fundamental to the prevention of diarrhea. We used spot-checks in a survey of 761 households in Burundi to examine whether something we could call general hygiene practice is responsible for more specific hygiene behaviors, ranging from handwashing to sweeping the floor. Using structural equation modeling, we showed that clusters of hygiene behavior, such as primary caregivers' cleanliness and household cleanliness, explained the spot-check findings well. Within our model, general hygiene practice as overall concept explained the more specific clusters of hygiene behavior well. Furthermore, the higher general hygiene practice, the more likely children were to be categorized healthy (r = 0.46). General hygiene practice was correlated with commitment to hygiene (r = 0.52), indicating a strong association to psychosocial determinants. The results show that different hygiene behaviors co-occur regularly. Using spot-checks, the general hygiene practice of a household can be rated quickly and easily.

Some Improved Nonperturbative Bounds for Fermionic Expansions

Energy Technology Data Exchange (ETDEWEB)

Lohmann, Martin, E-mail: marlohmann@gmail.com [Universita di Roma Tre, Dipartimento di Matematica (Italy)

2016-06-15

We reconsider the Gram-Hadamard bound as it is used in constructive quantum field theory and many body physics to prove convergence of Fermionic perturbative expansions. Our approach uses a recursion for the amplitudes of the expansion, discovered in a model problem by Djokic (2013). It explains the standard way to bound the expansion from a new point of view, and for some of the amplitudes provides new bounds, which avoid the use of Fourier transform, and are therefore superior to the standard bounds for models like the cold interacting Fermi gas.

Boundedly rational learning and heterogeneous trading strategies with hybrid neuro-fuzzy models

NARCIS (Netherlands)

Bekiros, S.D.

2009-01-01

The present study deals with heterogeneous learning rules in speculative markets where heuristic strategies reflect the rules-of-thumb of boundedly rational investors. The major challenge for "chartists" is the development of new models that would enhance forecasting ability particularly for time

The Effectiveness of Cooperative Learning Model of Pair Checks Type on Motivation and Mathematics Learning Outcomes of 8th Grade Junior High School Students

Directory of Open Access Journals (Sweden)

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.

Curvature bound from gravitational catalysis

Science.gov (United States)

Gies, Holger; Martini, Riccardo

2018-04-01

We determine bounds on the curvature of local patches of spacetime from the requirement of intact long-range chiral symmetry. The bounds arise from a scale-dependent analysis of gravitational catalysis and its influence on the effective potential for the chiral order parameter, as induced by fermionic fluctuations on a curved spacetime with local hyperbolic properties. The bound is expressed in terms of the local curvature scalar measured in units of a gauge-invariant coarse-graining scale. We argue that any effective field theory of quantum gravity obeying this curvature bound is safe from chiral symmetry breaking through gravitational catalysis and thus compatible with the simultaneous existence of chiral fermions in the low-energy spectrum. With increasing number of dimensions, the curvature bound in terms of the hyperbolic scale parameter becomes stronger. Applying the curvature bound to the asymptotic safety scenario for quantum gravity in four spacetime dimensions translates into bounds on the matter content of particle physics models.

Checking the validity of Busquet's ionization temperature with detailed collisional radiative models.

Science.gov (United States)

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.

Uncertainty Quantification of Turbulence Model Closure Coefficients for Transonic Wall-Bounded Flows

Science.gov (United States)

Schaefer, John; West, Thomas; Hosder, Serhat; Rumsey, Christopher; Carlson, Jan-Renee; Kleb, William

2015-01-01

The goal of this work was to quantify the uncertainty and sensitivity of commonly used turbulence models in Reynolds-Averaged Navier-Stokes codes due to uncertainty in the values of closure coefficients for transonic, wall-bounded flows and to rank the contribution of each coefficient to uncertainty in various output flow quantities of interest. Specifically, uncertainty quantification of turbulence model closure coefficients was performed for transonic flow over an axisymmetric bump at zero degrees angle of attack and the RAE 2822 transonic airfoil at a lift coefficient of 0.744. Three turbulence models were considered: the Spalart-Allmaras Model, Wilcox (2006) k-w Model, and the Menter Shear-Stress Trans- port Model. The FUN3D code developed by NASA Langley Research Center was used as the flow solver. The uncertainty quantification analysis employed stochastic expansions based on non-intrusive polynomial chaos as an efficient means of uncertainty propagation. Several integrated and point-quantities are considered as uncertain outputs for both CFD problems. All closure coefficients were treated as epistemic uncertain variables represented with intervals. Sobol indices were used to rank the relative contributions of each closure coefficient to the total uncertainty in the output quantities of interest. This study identified a number of closure coefficients for each turbulence model for which more information will reduce the amount of uncertainty in the output significantly for transonic, wall-bounded flows.

Toward improved design of check dam systems: A case study in the Loess Plateau, China

Science.gov (United States)

Pal, Debasish; Galelli, Stefano; Tang, Honglei; Ran, Qihua

2018-04-01

Check dams are one of the most common strategies for controlling sediment transport in erosion prone areas, along with soil and water conservation measures. However, existing mathematical models that simulate sediment production and delivery are often unable to simulate how the storage capacity of check dams varies with time. To explicitly account for this process-and to support the design of check dam systems-we developed a modelling framework consisting of two components, namely (1) the spatially distributed Soil Erosion and Sediment Delivery Model (WaTEM/SEDEM), and (2) a network-based model of check dam storage dynamics. The two models are run sequentially, with the second model receiving the initial sediment input to check dams from WaTEM/SEDEM. The framework is first applied to Shejiagou catchment, a 4.26 km2 area located in the Loess Plateau, China, where we study the effect of the existing check dam system on sediment dynamics. Results show that the deployment of check dams altered significantly the sediment delivery ratio of the catchment. Furthermore, the network-based model reveals a large variability in the life expectancy of check dams and abrupt changes in their filling rates. The application of the framework to six alternative check dam deployment scenarios is then used to illustrate its usefulness for planning purposes, and to derive some insights on the effect of key decision variables, such as the number, size, and site location of check dams. Simulation results suggest that better performance-in terms of life expectancy and sediment delivery ratio-could have been achieved with an alternative deployment strategy.

Modeling pedestrian shopping behavior using principles of bounded rationality: model comparison and validation

Science.gov (United States)

Zhu, Wei; Timmermans, Harry

2011-06-01

Models of geographical choice behavior have been dominantly based on rational choice models, which assume that decision makers are utility-maximizers. Rational choice models may be less appropriate as behavioral models when modeling decisions in complex environments in which decision makers may simplify the decision problem using heuristics. Pedestrian behavior in shopping streets is an example. We therefore propose a modeling framework for pedestrian shopping behavior incorporating principles of bounded rationality. We extend three classical heuristic rules (conjunctive, disjunctive and lexicographic rule) by introducing threshold heterogeneity. The proposed models are implemented using data on pedestrian behavior in Wang Fujing Street, the city center of Beijing, China. The models are estimated and compared with multinomial logit models and mixed logit models. Results show that the heuristic models are the best for all the decisions that are modeled. Validation tests are carried out through multi-agent simulation by comparing simulated spatio-temporal agent behavior with the observed pedestrian behavior. The predictions of heuristic models are slightly better than those of the multinomial logit models.

Emergent low-energy bound states in the two-orbital Hubbard model

Science.gov (United States)

Núñez-Fernández, Y.; Kotliar, G.; Hallberg, K.

2018-03-01

A repulsive Coulomb interaction between electrons in different orbitals in correlated materials can give rise to bound quasiparticle states. We study the nonhybridized two-orbital Hubbard model with intra- (inter)orbital interaction U (U12) and different bandwidths using an improved dynamical mean-field theory numerical technique which leads to reliable spectra on the real energy axis directly at zero temperature. We find that a finite density of states at the Fermi energy in one band is correlated with the emergence of well-defined quasiparticle states at excited energies Δ =U -U12 in the other band. These excitations are interband holon-doublon bound states. At the symmetric point U =U12 , the quasiparticle peaks are located at the Fermi energy, leading to a simultaneous and continuous Mott transition settling a long-standing controversy.

Charge–mass ratio bound and optimization in the Parikh–Wilczek tunneling model of Hawking radiation

International Nuclear Information System (INIS)

Kim, Kyung Kiu; Wen, Wen-Yu

2014-01-01

In this Letter, we study the mutual information hidden in the Parikh–Wilczek tunneling model of Hawking radiation for Reissner–Nordström black holes. We argue that the condition of nonnegativity of mutual information suggests bound(s) for charge–mass ratio of emitted particles. We further view the radiation as an optimization process and discuss its effect on time evolution of a charged black hole.

Model Checking Verification and Validation at JPL and the NASA Fairmont IV and V Facility

Science.gov (United States)

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.

Information-Theoretic Bounded Rationality and ε-Optimality

Directory of Open Access Journals (Sweden)

Daniel A. Braun

2014-08-01

Full Text Available Bounded rationality concerns the study of decision makers with limited information processing resources. Previously, the free energy difference functional has been suggested to model bounded rational decision making, as it provides a natural trade-off between an energy or utility function that is to be optimized and information processing costs that are measured by entropic search costs. The main question of this article is how the information-theoretic free energy model relates to simple ε-optimality models of bounded rational decision making, where the decision maker is satisfied with any action in an ε-neighborhood of the optimal utility. We find that the stochastic policies that optimize the free energy trade-off comply with the notion of ε-optimality. Moreover, this optimality criterion even holds when the environment is adversarial. We conclude that the study of bounded rationality based on ε-optimality criteria that abstract away from the particulars of the information processing constraints is compatible with the information-theoretic free energy model of bounded rationality.

Model checking of time Petri nets using the state class timed automaton

DEFF Research Database (Denmark)

Lime, Didier; Roux, Olivier H.

2006-01-01

In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that our translation preserves the b...

Bringing Automated Model Checking to PLC Program Development - A CERN Case Study

CERN Document Server

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, ...

Combining Static Model Checking with Dynamic Enforcement Using the Statecall Policy Language

Science.gov (United States)

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.

Error Checking for Chinese Query by Mining Web Log

Directory of Open Access Journals (Sweden)

Jianyong Duan

2015-01-01

Full Text Available For the search engine, error-input query is a common phenomenon. This paper uses web log as the training set for the query error checking. Through the n-gram language model that is trained by web log, the queries are analyzed and checked. Some features including query words and their number are introduced into the model. At the same time data smoothing algorithm is used to solve data sparseness problem. It will improve the overall accuracy of the n-gram model. The experimental results show that it is effective.

Plant experience with check valves in passive systems

Energy Technology Data Exchange (ETDEWEB)

Pahladsingh, R R [GKN Joint Nuclear Power Plant, Dodewaard (Netherlands)

1996-12-01

In the design of the advanced nuclear reactors there is a tendency to introduce more passive safety systems. The 25 year old design of the GKN nuclear reactor is different from the present BWR reactors because of some special features, such as the Natural Circulation - and the Passive Isolation Condenser system. When reviewing the design, one can conclude that the plant has 25 years of experience with check valves in passive systems and as passive components in systems. The result of this experience has been modeled in a plant-specific ``living PSA`` for the plant. A data-analysis has been performed on components which are related to the safety systems in the plant. As part of this study also the check valves have been taken in consideration. At GKN, the check valves have shown to be reliable components in the systems and no catastrophic failures have been experienced during the 25 years of operation. Especially the Isolation Condenser with its operation experience can contribute substantially to the insight of check valves in stand-by position at reactor pressure and operating by gravity under different pressure conditions. With the introduction of several passive systems in the SBWR-600 design, such as the Isolation Condensers, Gravity Driven Cooling, and Suppression Pool Cooling System, the issue of reliability of check valves in these systems is actual. Some critical aspects for study in connection with check valves are: What is the reliability of a check valve in a system at reactor pressure, to open on demand; what is the reliability of a check valve in a system at low pressure (gravity), to open on demand; what is the reliability of a check valve to open/close when the stand-by check wave is at zero differential pressure. The plant experience with check valves in a few essential safety systems is described and a brief introduction will be made about the application of check valves in the design of the new generation reactors is given. (author). 6 figs, 1 tab.

Remarks on Bousso's covariant entropy bound

CERN Document Server

Mayo, A E

2002-01-01

Bousso's covariant entropy bound is put to the test in the context of a non-singular cosmological solution of general relativity found by Bekenstein. Although the model complies with every assumption made in Bousso's original conjecture, the entropy bound is violated due to the occurrence of negative energy density associated with the interaction of some the matter components in the model. We demonstrate how this property allows for the test model to 'elude' a proof of Bousso's conjecture which was given recently by Flanagan, Marolf and Wald. This corroborates the view that the covariant entropy bound should be applied only to stable systems for which every matter component carries positive energy density.

An interval-valued reliability model with bounded failure rates

DEFF Research Database (Denmark)

Kozine, Igor; Krymsky, Victor

2012-01-01

The approach to deriving interval-valued reliability measures described in this paper is distinctive from other imprecise reliability models in that it overcomes the issue of having to impose an upper bound on time to failure. It rests on the presupposition that a constant interval-valued failure...... rate is known possibly along with other reliability measures, precise or imprecise. The Lagrange method is used to solve the constrained optimization problem to derive new reliability measures of interest. The obtained results call for an exponential-wise approximation of failure probability density...

Vacuum stability bounds in anomaly and gaugino mediated supersymmetry breaking models

International Nuclear Information System (INIS)

Gabrielli, Emidio; Huitu, Katri; Roy, Sourov

2002-01-01

We constrain the parameter space of the minimal and gaugino-assisted anomaly mediation, and gaugino mediation models by requiring that the electroweak vacuum corresponds to the deepest minimum of the scalar potential. In the framework of anomaly mediation models we find strong lower bounds on slepton and squark masses. In the gaugino mediation models the mass spectrum is forced to be at the TeV scale. We find extensive regions of the parameter space which are ruled out, even at low tanβ. The implications of these results on the g-2 of the muon are also analyzed

The influence of social anxiety on the body checking behaviors of female college students.

Science.gov (United States)

White, Emily K; Warren, Cortney S

2014-09-01

Social anxiety and eating pathology frequently co-occur. However, there is limited research examining the relationship between anxiety and body checking, aside from one study in which social physique anxiety partially mediated the relationship between body checking cognitions and body checking behavior (Haase, Mountford, & Waller, 2007). In an independent sample of 567 college women, we tested the fit of Haase and colleagues' foundational model but did not find evidence of mediation. Thus we tested the fit of an expanded path model that included eating pathology and clinical impairment. In the best-fitting path model (CFI=.991; RMSEA=.083) eating pathology and social physique anxiety positively predicted body checking, and body checking positively predicted clinical impairment. Therefore, women who endorse social physique anxiety may be more likely to engage in body checking behaviors and experience impaired psychosocial functioning. Published by Elsevier Ltd.

Bound state solution of the Grassmannian nonlinear sigma model with fermions

International Nuclear Information System (INIS)

Abdalla, E.; Lima-Santos, A.

1987-11-01

We construct the s matrix for bound state (gauge-invariant) scattering for nonlinear sigma models defined on the manifold SU(N)/S(U(p)x (lower casex)U(n-p)) with fermions. It is not possible to compute gauge non-singlet matrix elements. In the present language they are not submitted to sufficiently many constraints derived from higher conservation laws. (author) [pt

Kumaraswamy autoregressive moving average models for double bounded environmental data

Science.gov (United States)

Bayer, Fábio Mariano; Bayer, Débora Missio; Pumi, Guilherme

2017-12-01

In this paper we introduce the Kumaraswamy autoregressive moving average models (KARMA), which is a dynamic class of models for time series taking values in the double bounded interval (a,b) following the Kumaraswamy distribution. The Kumaraswamy family of distribution is widely applied in many areas, especially hydrology and related fields. Classical examples are time series representing rates and proportions observed over time. In the proposed KARMA model, the median is modeled by a dynamic structure containing autoregressive and moving average terms, time-varying regressors, unknown parameters and a link function. We introduce the new class of models and discuss conditional maximum likelihood estimation, hypothesis testing inference, diagnostic analysis and forecasting. In particular, we provide closed-form expressions for the conditional score vector and conditional Fisher information matrix. An application to environmental real data is presented and discussed.

Opinion formation and distribution in a bounded-confidence model on various networks

Science.gov (United States)

Meng, X. Flora; Van Gorder, Robert A.; Porter, Mason A.

2018-02-01

In the social, behavioral, and economic sciences, it is important to predict which individual opinions eventually dominate in a large population, whether there will be a consensus, and how long it takes for a consensus to form. Such ideas have been studied heavily both in physics and in other disciplines, and the answers depend strongly both on how one models opinions and on the network structure on which opinions evolve. One model that was created to study consensus formation quantitatively is the Deffuant model, in which the opinion distribution of a population evolves via sequential random pairwise encounters. To consider heterogeneity of interactions in a population along with social influence, we study the Deffuant model on various network structures (deterministic synthetic networks, random synthetic networks, and social networks constructed from Facebook data). We numerically simulate the Deffuant model and conduct regression analyses to investigate the dependence of the time to reach steady states on various model parameters, including a confidence bound for opinion updates, the number of participating entities, and their willingness to compromise. We find that network structure and parameter values both have important effects on the convergence time and the number of steady-state opinion groups. For some network architectures, we observe that the relationship between the convergence time and model parameters undergoes a transition at a critical value of the confidence bound. For some networks, the steady-state opinion distribution also changes from consensus to multiple opinion groups at this critical value.

Statistical validation of engineering and scientific models : bounds, calibration, and extrapolation.

Energy Technology Data Exchange (ETDEWEB)

Dowding, Kevin J.; Hills, Richard Guy (New Mexico State University, Las Cruces, NM)

2005-04-01

Numerical models of complex phenomena often contain approximations due to our inability to fully model the underlying physics, the excessive computational resources required to fully resolve the physics, the need to calibrate constitutive models, or in some cases, our ability to only bound behavior. Here we illustrate the relationship between approximation, calibration, extrapolation, and model validation through a series of examples that use the linear transient convective/dispersion equation to represent the nonlinear behavior of Burgers equation. While the use of these models represents a simplification relative to the types of systems we normally address in engineering and science, the present examples do support the tutorial nature of this document without obscuring the basic issues presented with unnecessarily complex models.

Sediment yield model implementation based on check dam infill stratigraphy in a semiarid Mediterranean catchment

Directory of Open Access Journals (Sweden)

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.

Do alcohol compliance checks decrease underage sales at neighboring establishments?

Science.gov (United States)

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.

Influence of check dams on debris-flow run-out intensity

Directory of Open Access Journals (Sweden)

A. Remaître

2008-12-01

Full Text Available Debris flows are very dangerous phenomena claiming thousands of lives and millions of Euros each year over the world. Disaster mitigation includes non-structural (hazard mapping, insurance policies, active structural (drainage systems and passive structural (check dams, stilling basins countermeasures. Since over twenty years, many efforts are devoted by the scientific and engineering communities to the design of proper devices able to capture the debris-flow volume and/or break down the energy. If considerable theoretical and numerical work has been performed on the size, the shape and structure of check dams, allowing the definition of general design criteria, it is worth noting that less research has focused on the optimal location of these dams along the debris-flow pathway.

In this paper, a methodological framework is proposed to evaluate the influence of the number and the location of the check dams on the reduction of the debris-flow intensity (in term of flow thickness, flow velocity and volume. A debris-flow model is used to simulate the run-out of the debris flow. The model uses the Janbu force diagram to resolve the force equilibrium equations; a bingham fluid rheology is introduced and represents the resistance term. The model has been calibrated on two muddy debris-flow events that occurred in 1996 and 2003 at the Faucon watershed (South French Alps.

Influence of the check dams on the debris-flow intensity is quantified taking into account several check dams configurations (number and location as input geometrical parameters. Results indicate that debris-flow intensity is decreasing with the distance between the source area and the first check dams. The study demonstrates that a small number of check dams located near the source area may decrease substantially the debris-flow intensity on the alluvial fans.

A gauge model describing N relativistic particles bound by linear forces

International Nuclear Information System (INIS)

Filippov, A.T.

1988-01-01

A relativistic model of N particles bound by linear forces is obtained by applying the gauging procedure to the linear canonical symmteries of a simple (rudimentary) nonrelativistic N-particle Lagrangian extended to relativistic phase space. The new (gauged) Lagrangian is formally Poincare invariant, the Hamiltonian is a linear combination of first-class constraints which are closed with respect to Pisson brackets and generate the localized canonical symmteries. The gauge potentials appear as the Lagrange multipliers of the constraints. Gauge fixing and quantization of the model are also briefly discussed. 11 refs

Simulation bounds for system availability

International Nuclear Information System (INIS)

Tietjen, G.L.; Waller, R.A.

1976-01-01

System availability is a dominant factor in the practicality of nuclear power electrical generating plants. A proposed model for obtaining either lower bounds or interval estimates on availability uses observed data on ''n'' failure-to-repair cycles of the system to estimate the parameters in the time-to-failure and time-to-repair models. These estimates are then used in simulating failure/repair cycles of the system. The availability estimate is obtained for each of 5000 samples of ''n'' failure/repair cycles to form a distribution of estimates. Specific percentile points of those simulated distributions are selected as lower simulation bounds or simulation interval bounds for the system availability. The method is illustrated with operational data from two nuclear plants for which an exponential time-to-failure and a lognormal time-to-repair are assumed

Efficient Semantics-Based Compliance Checking Using LTL Formulae and Unfolding

Directory of Open Access Journals (Sweden)

Liang Song

2013-01-01

Full Text Available Business process models are required to be in line with frequently changing regulations, policies, and environments. In the field of intelligent modeling, organisations concern automated business process compliance checking as the manual verification is a time-consuming and inefficient work. There exist two key issues for business process compliance checking. One is the definition of a business process retrieval language that can be employed to capture the compliance rules, the other concerns efficient evaluation of these rules. Traditional syntax-based retrieval approaches cannot deal with various important requirements of compliance checking in practice. Although a retrieval language that is based on semantics can overcome the drawback of syntax-based ones, it suffers from the well-known state space explosion. In this paper, we define a semantics-based process model query language through simplifying a property specification pattern system without affecting its expressiveness. We use this language to capture semantics-based compliance rules and constraints. We also propose a feasible approach in such a way that the compliance checking will not suffer from the state space explosion as much as possible. A tool is implemented to evaluate the efficiency. An experiment conducted on three model collections illustrates that our technology is very efficient.

The bound state problem and quark confinement

International Nuclear Information System (INIS)

Chaichian, M.; Demichev, A.P.; Nelipa, N.F.

1980-01-01

A quantum field-theoretic model in which quark is confined is considered. System of equations for the Green functions of colour singlet and octet bound states is obtained. The method is based on the nonperturbative Schwinger-Dyson equations with the use of Slavnov-Taylor identities. It is shown that in the framework of the model if there exist singlet, then also exist octet bound states of the quark-antiquark system. Thus in general, confinement of free quarks does not mean absence of their coloured bound states. (author)

Pharmacist and Technician Perceptions of Tech-Check-Tech in Community Pharmacy Practice Settings.

Science.gov (United States)

Frost, Timothy P; Adams, Alex J

2018-04-01

Tech-check-tech (TCT) is a practice model in which pharmacy technicians with advanced training can perform final verification of prescriptions that have been previously reviewed for appropriateness by a pharmacist. Few states have adopted TCT in part because of the common view that this model is controversial among members of the profession. This article aims to summarize the existing research on pharmacist and technician perceptions of community pharmacy-based TCT. A literature review was conducted using MEDLINE (January 1990 to August 2016) and Google Scholar (January 1990 to August 2016) using the terms "tech* and check," "tech-check-tech," "checking technician," and "accuracy checking tech*." Of the 7 studies identified we found general agreement among both pharmacists and technicians that TCT in community pharmacy settings can be safely performed. This agreement persisted in studies of theoretical TCT models and in studies assessing participants in actual community-based TCT models. Pharmacists who had previously worked with a checking technician were generally more favorable toward TCT. Both pharmacists and technicians in community pharmacy settings generally perceived TCT to be safe, in both theoretical surveys and in surveys following actual TCT demonstration projects. These perceptions of safety align well with the actual outcomes achieved from community pharmacy TCT studies.

On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems

DEFF Research Database (Denmark)

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...

Twisting, supercoiling and stretching in protein bound DNA

Science.gov (United States)

Lam, Pui-Man; Zhen, Yi

2018-04-01

We have calculated theoretical results for the torque and slope of the twisted DNA, with various proteins bound on it, using the Neukirch-Marko model, in the regime where plectonemes exist. We found that the torque in the protein bound DNA decreases compared to that in the bare DNA. This is caused by the decrease in the free energy g(f) , and hence the smaller persistence lengths, in the case of protein bound DNA. We hope our results will encourage experimental investigations of supercoiling in protein bound DNA, which can provide further tests of the Neukirch-Marko model.

Deployment of check-in nodes in complex networks

Science.gov (United States)

Jiang, Zhong-Yuan; Ma, Jian-Feng

2017-01-01

In many real complex networks such as the city road networks and highway networks, vehicles often have to pass through some specially functioned nodes to receive check-in like services such as gas supplement at gas stations. Based on existing network structures, to guarantee every shortest path including at least a check-in node, the location selection of all check-in nodes is very essential and important to make vehicles to easily visit these check-in nodes, and it is still remains an open problem in complex network studies. In this work, we aim to find possible solutions for this problem. We first convert it into a set cover problem which is NP-complete and propose to employ the greedy algorithm to achieve an approximate result. Inspired by heuristic information of network structure, we discuss other four check-in node location deployment methods including high betweenness first (HBF), high degree first (HDF), random and low degree first (LDF). Finally, we compose extensive simulations in classical scale-free networks, random networks and real network models, and the results can well confirm the effectiveness of the greedy algorithm. This work has potential applications into many real networks.

NLIE of Dirichlet sine-Gordon model for boundary bound states

International Nuclear Information System (INIS)

Ahn, Changrim; Bajnok, Zoltan; Palla, Laszlo; Ravanini, Francesco

2008-01-01

We investigate boundary bound states of sine-Gordon model on the finite-size strip with Dirichlet boundary conditions. For the purpose we derive the nonlinear integral equation (NLIE) for the boundary excited states from the Bethe ansatz equation of the inhomogeneous XXZ spin 1/2 chain with boundary imaginary roots discovered by Saleur and Skorik. Taking a large volume (IR) limit we calculate boundary energies, boundary reflection factors and boundary Luescher corrections and compare with the excited boundary states of the Dirichlet sine-Gordon model first considered by Dorey and Mattsson. We also consider the short distance limit and relate the IR scattering data with that of the UV conformal field theory

Multi-Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction

DEFF Research Database (Denmark)

Laarman, Alfons; Olesen, Mads Chr.; Dalsgaard, Andreas

2013-01-01

This paper contributes to the multi-core model checking of timed automata (TA) with respect to liveness properties, by investigating checking of TA Büchi emptiness under the very coarse inclusion abstraction or zone subsumption, an open problem in this field. We show that in general Büchi emptiness...... parallel LTL model checking algorithm for timed automata. The algorithms are implemented in LTSmin, and experimental evaluations show the effectiveness and scalability of both contributions: subsumption halves the number of states in the real-world FDDI case study, and the multi-core algorithm yields...

Constraint-based deadlock checking of high-level specifications

DEFF Research Database (Denmark)

Hallerstede, Stefan; Leuschel, Michael

2011-01-01

Establishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is limited because in many industrial applications the state space is either infinite or much too large to be explored exhaustively. In this ......Establishing the absence of deadlocks is important in many applications of formal methods. The use of model checking for finding deadlocks in formal models is limited because in many industrial applications the state space is either infinite or much too large to be explored exhaustively......B's Prolog kernel, such as reification of membership and arithmetic constraints. ProB typically finds counter examples to deadlock-freedom constraints, a formula of about 900 partly nested conjunctions and disjunction among them 80 arithmetic and 150 set-theoretic predicates (in total a formula of 30 pages...

Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

OpenAIRE

Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

2017-01-01

In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

Electronic bound states in parity-preserving QED3 applied to high-Tc cuprate superconductors

International Nuclear Information System (INIS)

Christiansen, H.R.; Cima, O.M. Del; Ferreira Junior, M.M.; Maranhao Univ., Sao Luis, MA; Helayel-Neto, J.A.; Centro Brasileiro de Pesquisas Fisicas

2001-08-01

We consider a parity-preserving QED 3 model with spontaneous breaking of the gauge symmetry as a framework for the evaluation of the electron-electron interaction potential underlying high-T e superconductivity. The fact that resulting potential, - C s K o (Mr), is non-confining and weak (in the sense of Kato) strongly suggests the mechanism of pair-condensation. This potential, compatible with an s-wave order parameters, is then applied to the Schrodinger equation for the sake of numerical calculations, thereby enforcing the existence of bound states. The results worked out by means of our theoretical framework are checked by considering a number of phenomenological data extracted from different copper oxide superconductors. The agreement may motivate a deeper analysis of our model viewing an application to quasi-planar cuprate superconductors. The data analyzed here suggest an energy scale of 1-10 meV for the breaking of the U(1)-symmetry. (author)

Solvable light-front model of the electromagnetic form factor of the relativistic two-body bound state in 1+1 dimensions

International Nuclear Information System (INIS)

Mankiewicz, L.; Sawicki, M.

1989-01-01

Within a relativistically correct yet analytically solvable model of light-front quantum mechanics we construct the electromagnetic form factor of the two-body bound state and we study the validity of the static approximation to the full form factor. Upon comparison of full form factors calculated for different values of binding energy we observe an unexpected effect that for very strongly bound states further increase in binding leads to an increase in the size of the bound system. A similar effect is found for another quantum-mechanical model of relativistic dynamics

Effects of soft interactions and bound mobility on diffusion in crowded environments: a model of sticky and slippery obstacles

Science.gov (United States)

Stefferson, Michael W.; Norris, Samantha L.; Vernerey, Franck J.; Betterton, Meredith D.; E Hough, Loren

2017-08-01

Crowded environments modify the diffusion of macromolecules, generally slowing their movement and inducing transient anomalous subdiffusion. The presence of obstacles also modifies the kinetics and equilibrium behavior of tracers. While previous theoretical studies of particle diffusion have typically assumed either impenetrable obstacles or binding interactions that immobilize the particle, in many cellular contexts bound particles remain mobile. Examples include membrane proteins or lipids with some entry and diffusion within lipid domains and proteins that can enter into membraneless organelles or compartments such as the nucleolus. Using a lattice model, we studied the diffusive movement of tracer particles which bind to soft obstacles, allowing tracers and obstacles to occupy the same lattice site. For sticky obstacles, bound tracer particles are immobile, while for slippery obstacles, bound tracers can hop without penalty to adjacent obstacles. In both models, binding significantly alters tracer motion. The type and degree of motion while bound is a key determinant of the tracer mobility: slippery obstacles can allow nearly unhindered diffusion, even at high obstacle filling fraction. To mimic compartmentalization in a cell, we examined how obstacle size and a range of bound diffusion coefficients affect tracer dynamics. The behavior of the model is similar in two and three spatial dimensions. Our work has implications for protein movement and interactions within cells.

Repeated checking causes memory distrust

NARCIS (Netherlands)

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

CAPD Software Development for Automatic Piping System Design: Checking Piping Pocket, Checking Valve Level and Flexibility

International Nuclear Information System (INIS)

Ari Satmoko; Edi Karyanta; Dedy Haryanto; Abdul Hafid; Sudarno; Kussigit Santosa; Pinitoyo, A.; Demon Handoyo

2003-01-01

One of several steps in industrial plant construction is preparing piping layout drawing. In this drawing, pipe and all other pieces such as instrumentation, equipment, structure should be modeled A software called CAPD was developed to replace and to behave as piping drafter or designer. CAPD was successfully developed by adding both subprogram CHKUPIPE and CHKMANV. The first subprogram can check and gives warning if there is piping pocket in the piping system. The second can identify valve position and then check whether valve can be handled by operator hand The main program CAPD was also successfully modified in order to be capable in limiting the maximum length of straight pipe. By limiting the length, piping flexibility can be increased. (author)

Tight Bounds for Distributed Functional Monitoring

DEFF Research Database (Denmark)

Woodruff, David P.; Zhang, Qin

2011-01-01

$, our bound resolves their main open question. Our lower bounds are based on new direct sum theorems for approximate majority, and yield significant improvements to problems in the data stream model, improving the bound for estimating $F_p, p > 2,$ in $t$ passes from $\\tilde{\\Omega}(n^{1-2/p}/(\\eps^{2/p......} t))$ to $\\tilde{\\Omega}(n^{1-2/p}/(\\eps^{4/p} t))$, giving the first bound for estimating $F_0$ in $t$ passes of $\\Omega(1/(\\eps^2 t))$ bits of space that does not use the gap-hamming problem, and showing a distribution for the gap-hamming problem with high external information cost or super...

Robust nonlinear model predictive control for nuclear power plants in load following operations with bounded xenon oscillations

International Nuclear Information System (INIS)

Eliasi, H.; Menhaj, M.B.; Davilu, H.

2011-01-01

Research highlights: → In this work, a robust nonlinear model predictive control algorithm is developed. → This algorithm is applied to control the power level for load following. → The state constraints are imposed on the predicted trajectory during optimization. → The xenon oscillations are the main constraint for the load following problem. → In this algorithm, xenon oscillations are bounded within acceptable limits. - Abstract: One of the important operations in nuclear power plants is load-following in which imbalance of axial power distribution induces xenon oscillations. These oscillations must be maintained within acceptable limits otherwise the nuclear power plant could become unstable. Therefore, bounded xenon oscillation considered to be a constraint for the load-following operation. In this paper, a robust nonlinear model predictive control for the load-following operation problem is proposed that ensures xenon oscillations are kept bounded within acceptable limits. The proposed controller uses constant axial offset (AO) strategy to maintain xenon oscillations to be bounded. The constant AO is a robust state constraint for load-following problem. The controller imposes restricted state constraints on the predicted trajectory during optimization which guarantees robust satisfaction of state constraints without restoring to a min-max optimization problem. Simulation results show that the proposed controller for the load-following operation is so effective so that the xenon oscillations kept bounded in the given region.

Threshold energy dependence as a function of potential strength and the nonexistence of bound states

International Nuclear Information System (INIS)

Aronson, I.; Kleinman, C.J.; Spruch, L.

1975-01-01

The difficulty in attempting to prove that a given set of particles cannot form a bound state is the absence of a margin of error; the possibility of a bound state of arbitrarily small binding energy must be ruled out. At the sacrifice of rigor, one can hope to bypass the difficulty by studying the ground-state energy E(lambda) associated with H(lambda) identical with H/sub true/ + lambda/sub ν/, where H/sub true/ is the true Hamiltonian, ν is an artificial attractive potential, and lambda greater than 0. E(lambda) can be estimated via a Rayleigh-Ritz calculation. If H/sub true/ falls just short of being able to support a bound state, H(lambda) for lambda ''not too small'' will support a bound state of some significant binding. A margin of error is thereby created; the inability to find a bound state for lambda ''not too small'' suggests not only that H(lambda) can support at best a weakly bound state but that H/sub true/ cannot support a bound state at all. To give the argument real substance, one studies E(lambda) in the neighborhood of lambda = lambda 0 , the (unknown) smallest value for lambda for which H(lambda) can support a bound state. A comparison of E(lambda) determined numerically with the form of E(lambda) obtained with the use of a crude bound-state wave function in the Feynman theorem gives a rough self-consistency check. One thereby obtains a believable lower bound on the energy of a possible bound state of H/sub true/ or a believable argument that no such bound state exists. The method is applied to the triplet state of H -

Noninvasive estimation of bound and mobile platinum compounds in the kidney using a radiopharmacokinetic model

International Nuclear Information System (INIS)

Brechner, R.R.; D'Argenio, D.Z.; Dahalan, R.; Wolf, W.

1986-01-01

Nephrotoxicity remains a major limitation in the use of cisplatin [cis-diamminedichloroplatinum(II)]. Although several strategies are in use to limit this serious side effect, none is fully satisfactory. Classical pharmacokinetic studies of cisplatin have been based on blood and urine samples. As nephrotoxicity plays a significant role in the design of the therapeutic strategy, the kidneys should be considered as a separate state in any model formulated for ultimate control purposes. Previous studies of organ pharmacokinetics have relied on population measurements. The authors have developed an organ compartmental model from individual animal data obtained noninvasively. The eight-compartment model used to represent the distribution of cisplatin considers free and bound platinum in plasma, platinum in the erythrocytes, mobile and bound platinum in the kidneys, mobile and bound platinum in the tissues, and platinum in the urine. Data were collected from experiments with anesthetized female rats, after intravenous administration of [195mPt]cisplatin. Both arterial and bladder samples, and multiple images obtained with an Anger camera interfaced to a microcomputer were used. The model was estimated from individual data obtained after injection of a bolus of cisplatin (six animals). The model was validated by using it to predict data obtained from forcing the system with a different input function, a 0.5-h intravenous infusion (three animals). The results of this work show that it is possible to noninvasively study drug kinetics in organs that are not readily accessible to direct measurements in an individual, rather than relying on invasive measurements performed on a population.(ABSTRACT TRUNCATED AT 250 WORDS)

Quantum Kronecker sum-product low-density parity-check codes with finite rate

Science.gov (United States)

Kovalev, Alexey A.; Pryadko, Leonid P.

2013-07-01

We introduce an ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Zémor and generalized bicycle codes by MacKay as limiting cases. The construction allows for both the lower and the upper bounds on the minimum distance; they scale as a square root of the block length. Many thus defined codes have a finite rate and limited-weight stabilizer generators, an analog of classical low-density parity-check (LDPC) codes. Compared to the hypergraph-product codes, hyperbicycle codes generally have a wider range of parameters; in particular, they can have a higher rate while preserving the estimated error threshold.

What is a good health check? An interview study of health check providers' views and practices.

Science.gov (United States)

Stol, Yrrah H; Asscher, Eva C A; Schermer, Maartje H N

2017-10-02

Health checks identify (risk factors for) disease in people without symptoms. They may be offered by the government through population screenings and by other providers to individual users as 'personal health checks'. Health check providers' perspective of 'good' health checks may further the debate on the ethical evaluation and possible regulation of these personal health checks. In 2015, we interviewed twenty Dutch health check providers on criteria for 'good' health checks, and the role these criteria play in their practices. Providers unanimously formulate a number of minimal criteria: Checks must focus on (risk factors for) treatable/preventable disease; Tests must be reliable and clinically valid; Participation must be informed and voluntary; Checks should provide more benefits than harms; Governmental screenings should be cost-effective. Aspirational criteria mentioned were: Follow-up care should be provided; Providers should be skilled and experienced professionals that put the benefit of (potential) users first; Providers should take time and attention. Some criteria were contested: People should be free to test on any (risk factor for) disease; Health checks should only be performed in people at high risk for disease that are likely to implement health advice; Follow up care of privately funded tests should not drain on collective resources. Providers do not always fulfil their own criteria. Their reasons reveal conflicts between criteria, conflicts between criteria and other ethical values, and point to components in the (Dutch) organisation of health care that hinder an ethical provision of health checks. Moreover, providers consider informed consent a criterion that is hard to establish in practice. According to providers, personal health checks should meet the same criteria as population screenings, with the exception of cost-effectiveness. Providers do not always fulfil their own criteria. Results indicate that in thinking about the ethics of health

Cell-bound lipases from Burkholderia sp. ZYB002: gene sequence analysis, expression, enzymatic characterization, and 3D structural model.

Science.gov (United States)

Shu, Zhengyu; Lin, Hong; Shi, Shaolei; Mu, Xiangduo; Liu, Yanru; Huang, Jianzhong

2016-05-03

The whole-cell lipase from Burkholderia cepacia has been used as a biocatalyst in organic synthesis. However, there is no report in the literature on the component or the gene sequence of the cell-bound lipase from this species. Qualitative analysis of the cell-bound lipase would help to illuminate the regulation mechanism of gene expression and further improve the yield of the cell-bound lipase by gene engineering. Three predictive cell-bound lipases, lipA, lipC21 and lipC24, from Burkholderia sp. ZYB002 were cloned and expressed in E. coli. Both LipA and LipC24 displayed the lipase activity. LipC24 was a novel mesophilic enzyme and displayed preference for medium-chain-length acyl groups (C10-C14). The 3D structural model of LipC24 revealed the open Y-type active site. LipA displayed 96 % amino acid sequence identity with the known extracellular lipase. lipA-inactivation and lipC24-inactivation decreased the total cell-bound lipase activity of Burkholderia sp. ZYB002 by 42 % and 14 %, respectively. The cell-bound lipase activity from Burkholderia sp. ZYB002 originated from a multi-enzyme mixture with LipA as the main component. LipC24 was a novel lipase and displayed different enzymatic characteristics and structural model with LipA. Besides LipA and LipC24, other type of the cell-bound lipases (or esterases) should exist.

A relativistic gauge model describing N particles bound by harmonic forces

International Nuclear Information System (INIS)

Filippov, A.T.

1987-01-01

Application of the principle of gauging to linear canonical symmetries of simplest/rudimentary/bilinear lagrangians is shown to produce a relativistic version of the Lagrangian describing N particles bound by harmonic forces. For pairwise coupled identical particles the gauge group is T 1 xU 1 , xSU N-1 . A model for the relativistic discrete string (a chain of N particles) is also discussed. All these gauge theoried of particles can be quantized by standard methods

A material optimization model to approximate energy bounds for cellular materials under multiload conditions

DEFF Research Database (Denmark)

Guedes, J.M.; Rodrigues, H.C.; Bendsøe, Martin P.

2003-01-01

This paper describes a computational model, based on inverse homogenization and topology design, for approximating energy bounds for two-phase composites under multiple load cases. The approach allows for the identification of possible single-scale cellular materials that give rise to the optimal...

Lower Bounds for Sorted Geometric Queries in the I/O Model

DEFF Research Database (Denmark)

Afshani, Peyman; Zeh, Norbert

2012-01-01

. This is highly relevant in an I/O context because storing a massive data set in a superlinear-space data structure is often infeasible. We also prove that answering queries using I/Os requires space, where N is the input size, B is the block size, and M is the size of the main memory. This bound is unlikely...... to be optimal and in fact we can show that, for a particular class of “persistence-based” data structures, the space lower bound can be improved to Ω(N2 / MO(1)). Both these lower bounds are a first step towards understanding the complexity of sorted geometric query problems. All our lower bounds assume...

Bounds and inequalities relating h-index, g-index, e-index and generalized impact factor: an improvement over existing models.

Science.gov (United States)

Abbas, Ash Mohammad

2012-01-01

In this paper, we describe some bounds and inequalities relating h-index, g-index, e-index, and generalized impact factor. We derive the bounds and inequalities relating these indexing parameters from their basic definitions and without assuming any continuous model to be followed by any of them. We verify the theorems using citation data for five Price Medalists. We observe that the lower bound for h-index given by Theorem 2, [formula: see text], g ≥ 1, comes out to be more accurate as compared to Schubert-Glanzel relation h is proportional to C(2/3)P(-1/3) for a proportionality constant of 1, where C is the number of citations and P is the number of papers referenced. Also, the values of h-index obtained using Theorem 2 outperform those obtained using Egghe-Liang-Rousseau power law model for the given citation data of Price Medalists. Further, we computed the values of upper bound on g-index given by Theorem 3, g ≤ (h + e), where e denotes the value of e-index. We observe that the upper bound on g-index given by Theorem 3 is reasonably tight for the given citation record of Price Medalists.

Model Checking the Logic of Allen's Relations Meets and Started-by is P^NP-Complete

Directory of Open Access Journals (Sweden)

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.

SOLA-LOOP analysis of a back pressure check valve

International Nuclear Information System (INIS)

Travis, J.R.

1984-01-01

The SOLA-LOOP computer code for transient, nonequilibrium, two-phase flows in networks has been coupled with a simple valve model to analyze a feedwater pipe breakage with a back-pressure check valve. Three tests from the Superheated Steam Reactor Safety Program Project (PHDR) at Kahl, West Germany, are analyzed, and the calculated transient back-pressure check valve behavior and fluid dynamics effects are found to be in excellent agreement with the experimentally measured data

Check valves aging assessment

International Nuclear Information System (INIS)

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

Achieving the physical limits of the bounded-storage model

International Nuclear Information System (INIS)

Mandayam, Prabha; Wehner, Stephanie

2011-01-01

Secure two-party cryptography is possible if the adversary's quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the protocol. This special case is known as the bounded-storage model, and it has long been an open question whether security can still be achieved if the adversary's storage were any larger. Here, we answer this question positively and demonstrate a two-party protocol which is secure as long as the adversary cannot store even a small fraction of the transmitted pulses. We also show that security can be extended to a larger class of noisy quantum memories.

Relativistic bound state wave functions

International Nuclear Information System (INIS)

Micu, L.

2005-01-01

A particular method of writing the bound state wave functions in relativistic form is applied to the solutions of the Dirac equation with confining potentials in order to obtain a relativistic description of a quark antiquark bound system representing a given meson. Concerning the role of the effective constituent in the present approach we first observe that without this additional constituent we couldn't expand the bound state wave function in terms of products of free states. Indeed, we notice that if the wave function depends on the relative coordinates only, all the expansion coefficients would be infinite. Secondly we remark that the effective constituent enabled us to give a Lorentz covariant meaning to the potential energy of the bound system which is now seen as the 4th component of a 4-momentum. On the other side, by relating the effective constituent to the quantum fluctuations of the background field which generate the binding, we provided a justification for the existence of some spatial degrees of freedom accompanying the interaction potential. These ones, which are quite unusual in quantum mechanics, in our model are the natural consequence of the the independence of the quarks and can be seen as the effect of the imperfect cancellation of the vector momenta during the quantum fluctuations. Related with all these we remark that the adequate representation for the relativistic description of a bound system is the momentum representation, because of the transparent and easy way of writing the conservation laws and the transformation properties of the wave functions. The only condition to be fulfilled is to find a suitable way to take into account the potential energy of the bound system. A particular feature of the present approach is that the confining forces are due to a kind of glue where both quarks are embedded. This recalls other bound state models where the wave function is factorized in terms of constituent wave functions and the confinement is

Analytical models for lower and upper bounds of the condensation-induced water hammer in long horizontal pipes

International Nuclear Information System (INIS)

Chun, Moon Hyun; Park, Joo Wan; Nam, Ho Yun

1992-01-01

Improved analytical models have been proposed that can predict the lower and upper limits of the water hammer region for given flow conditions by incorporation of recent advances made in the understanding of phenomena associated with the condensation-induced water hammer into existing methods. Present models are applicable for steam-water counterflow in a long horizontal pipe geometry. Both lower and upper bounds of the water hammer region are expressed in terms of the 'critical inlet water flow rate' as a function of axial position. Water hammer region boundaries predicted by present and typical existing models are compared for particular flow conditions of the water hammer event occurred at San Onofre Unit 1 to assess the applicability of the models examined. The result shows that present models for lower and upper bounds of the water hammer region compare favorably with the best performing existing models

HiggsBounds-4. Improved tests of extended Higgs sectors against exclusion bounds from LEP, the Tevatron and the LHC

Energy Technology Data Exchange (ETDEWEB)

Bechtle, Philip [Bonn Univ. (Germany). Physikalisches Inst.; Heinemeyer, Sven [Instituto de Fisica de Cantabria (CSIC-UC), Santander (Spain); Staal, Oscar [Stockholm Univ. (Sweden). Dept. of Physics; Stefaniak, Tim; Williams, Karina E. [Bonn Univ. (Germany). Physikalisches Inst.; Bonn Univ. (Germany). Bethe Center for Theoretical Physics; Weiglein, Georg [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Brein, Oliver

2013-12-15

We describe the new developments in version 4 of the public computer code HiggsBounds. HiggsBounds is a tool to test models with arbitrary Higgs sectors, containing both neutral and charged Higgs bosons, against the published exclusion bounds from Higgs searches at the LEP, Tevatron and LHC experiments. From the model predictions for the Higgs masses, branching ratios, production cross sections and total decay widths - which are specified by the user in the input for the program - the code calculates the predicted signal rates for the search channels considered in the experimental data. The signal rates are compared to the expected and observed cross section limits from the Higgs searches to determine whether a point in the model parameter space is excluded at 95% confidence level. In this paper we present a modification of the HiggsBounds main algorithm that extends the exclusion test in order to ensure that it provides useful results in the presence of one or more significant excesses in the data, corresponding to potential Higgs signals. We also describe a new method to test whether the limits from an experimental search performed under certain model assumptions can be applied to a different theoretical model. Further developments discussed here include a framework to take into account theoretical uncertainties on the Higgs mass predictions, and the possibility to obtain the {chi}{sup 2} likelihood of Higgs exclusion limits from LEP. Extensions to the user subroutines from earlier versions of HiggsBounds are described. The new features are demonstrated by additional example programs.

HiggsBounds-4. Improved tests of extended Higgs sectors against exclusion bounds from LEP, the Tevatron and the LHC

International Nuclear Information System (INIS)

Bechtle, Philip; Staal, Oscar; Brein, Oliver

2013-12-01

We describe the new developments in version 4 of the public computer code HiggsBounds. HiggsBounds is a tool to test models with arbitrary Higgs sectors, containing both neutral and charged Higgs bosons, against the published exclusion bounds from Higgs searches at the LEP, Tevatron and LHC experiments. From the model predictions for the Higgs masses, branching ratios, production cross sections and total decay widths - which are specified by the user in the input for the program - the code calculates the predicted signal rates for the search channels considered in the experimental data. The signal rates are compared to the expected and observed cross section limits from the Higgs searches to determine whether a point in the model parameter space is excluded at 95% confidence level. In this paper we present a modification of the HiggsBounds main algorithm that extends the exclusion test in order to ensure that it provides useful results in the presence of one or more significant excesses in the data, corresponding to potential Higgs signals. We also describe a new method to test whether the limits from an experimental search performed under certain model assumptions can be applied to a different theoretical model. Further developments discussed here include a framework to take into account theoretical uncertainties on the Higgs mass predictions, and the possibility to obtain the χ 2 likelihood of Higgs exclusion limits from LEP. Extensions to the user subroutines from earlier versions of HiggsBounds are described. The new features are demonstrated by additional example programs.

Stochastic Modeling and Performance Analysis of Multimedia SoCs

DEFF Research Database (Denmark)

Raman, Balaji; Nouri, Ayoub; Gangadharan, Deepak

2013-01-01

solutions where each modeling technique has both the above mentioned characteristics. We present a probabilistic analytical framework and a statistical model checking approach to design system-on-chips for low-cost multimedia systems. We apply the modeling techniques to size the output buffer in a video......Reliability and flexibility are among the key required features of a framework used to model a system. Existing approaches to design resource-constrained, soft-real time systems either provide guarantees for output quality or account for loss in the system, but not both. We propose two independent...... decoder. The results shows that, for our stochastic design metric, the analytical framework upper bounds (and relatively accurate) compare to the statistical model checking technique. Also, we observed significant reduction in resource usage (such as output buffer size) with tolerable loss in output...

Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy

DEFF Research Database (Denmark)

Phillips, Jeff; Verbin, Elad; Zhang, Qin

2012-01-01

; the technique seems applicable to a wide range of other problems as well. The obtained communication lower bounds imply new lower bounds in the functional monitoring model [11] (also called the distributed streaming model). All of our lower bounds allow randomized communication protocols with two-sided error......In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players to see) and (mainly) in the message-passing model, where messages are sent player-to-player. We introduce a new...... technique for proving such bounds, called symmetrization, which is natural, intuitive, and often easy to use. For example, for the problem where each of k players gets a bit-vector of length n, and the goal is to compute the coordinate-wise XOR of these vectors, we prove a tight lower bounds of Ω...

27 CFR 70.101 - Bad checks.

Science.gov (United States)

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...

New bounds on isotropic Lorentz violation

International Nuclear Information System (INIS)

Carone, Christopher D.; Sher, Marc; Vanderhaeghen, Marc

2006-01-01

Violations of Lorentz invariance that appear via operators of dimension four or less are completely parametrized in the Standard Model Extension (SME). In the pure photonic sector of the SME, there are 19 dimensionless, Lorentz-violating parameters. Eighteen of these have experimental upper bounds ranging between 10 -11 and 10 -32 ; the remaining parameter, k-tilde tr , is isotropic and has a much weaker bound of order 10 -4 . In this Brief Report, we point out that k-tilde tr gives a significant contribution to the anomalous magnetic moment of the electron and find a new upper bound of order 10 -8 . With reasonable assumptions, we further show that this bound may be improved to 10 -14 by considering the renormalization of other Lorentz-violating parameters that are more tightly constrained. Using similar renormalization arguments, we also estimate bounds on Lorentz-violating parameters in the pure gluonic sector of QCD

The tightly bound nuclei in the liquid drop model

Science.gov (United States)

Sree Harsha, N. R.

2018-05-01

In this paper, we shall maximise the binding energy per nucleon function in the semi-empirical mass formula of the liquid drop model of the atomic nuclei to analytically prove that the mean binding energy per nucleon curve has local extrema at A ≈ 58.6960, Z ≈ 26.3908 and at A ≈ 62.0178, Z ≈ 27.7506. The Lagrange method of multipliers is used to arrive at these results, while we have let the values of A and Z take continuous fractional values. The shell model that shows why 62Ni is the most tightly bound nucleus is outlined. A brief account on stellar nucleosynthesis is presented to show why 56Fe is more abundant than 62Ni and 58Fe. We believe that the analytical proof presented in this paper can be a useful tool to the instructors to introduce the nucleus with the highest mean binding energy per nucleon.

Check In / Check Out. The Public Space as an Internet of Things

NARCIS (Netherlands)

van t Hof, C.C.G.; van Est, R.; Daemen, F.

2011-01-01

Mobile phones, public transport smart cards, security cameras and GPS systems in our car - we are surrounded by digital devices. They track us, guide us, help us, and control us. The book Check In / Check Out. The Public Space as an Internet of Things shows us how our digital and physical worlds are

Check in / check out : the public space as an internet of things

NARCIS (Netherlands)

Hof, van 't C.; Est, van R.; Daemen, F.

2011-01-01

Mobile phones, public transport smart cards, security cameras and GPS systems in our car - we are surrounded by digital devices. They track us, guide us, help us, and control us. The book Check In / Check Out. The Public Space as an Internet of Things shows us how our digital and physical worlds are

What is a good health check? An interview study of health check providers' views and practices

NARCIS (Netherlands)

Y. Stol (Yrrah); E.C.A. Asscher (Eva); M.H.N. Schermer (Maartje)

2017-01-01

markdownabstract__Background:__ Health checks identify (risk factors for) disease in people without symptoms. They may be offered by the government through population screenings and by other providers to individual users as 'personal health checks'. Health check providers' perspective of 'good'

Covariant entropy bound and loop quantum cosmology

International Nuclear Information System (INIS)

Ashtekar, Abhay; Wilson-Ewing, Edward

2008-01-01

We examine Bousso's covariant entropy bound conjecture in the context of radiation filled, spatially flat, Friedmann-Robertson-Walker models. The bound is violated near the big bang. However, the hope has been that quantum gravity effects would intervene and protect it. Loop quantum cosmology provides a near ideal setting for investigating this issue. For, on the one hand, quantum geometry effects resolve the singularity and, on the other hand, the wave function is sharply peaked at a quantum corrected but smooth geometry, which can supply the structure needed to test the bound. We find that the bound is respected. We suggest that the bound need not be an essential ingredient for a quantum gravity theory but may emerge from it under suitable circumstances.

checkCIF/PLATON (full publication check)

Indian Academy of Sciences (India)

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 ...

From superWIMPs to decaying dark matter. Models, bounds and indirect searches

International Nuclear Information System (INIS)

Weniger, Christoph

2010-06-01

Despite lots of observational and theoretical efforts, the particle nature of dark matter remains unknown. Beyond the paradigmatic WIMPs (Weakly Interacting Massive Particles), many theoretically well motivated models exist where dark matter interacts much more weakly than electroweak with Standard Model particles. In this case new phenomena occur, like the decay of dark matter or the interference with the standard cosmology of the early Universe. In this thesis we study some of these aspects of superweakly coupled dark matter in general, and in the special case of hidden U(1) X gauginos that kinetically mix with hypercharge. There, we will assume that the gauge group remains unbroken, similar to the Standard Model U(1) em . We study different kinds of cosmological bounds, including bounds from thermal overproduction, from primordial nucleosynthesis and from structure formation. Furthermore, we study the possible cosmic-ray signatures predicted by this scenario, with emphasis on the electron and positron channel in light of the recent observations by PAMELA and Fermi LAT. Moreover we study the cosmic-ray signatures of decaying dark matter independently of concrete particle-physics models. In particular we analyze in how far the rise in the positron fraction above 10 GeV, as observed by PAMELA, can be explained by dark matter decay. Lastly, we concentrate on related predictions for gamma-ray observations with the Fermi LAT, and propose to use the dipole-like anisotropy of the prompt gamma-ray dark matter signal to distinguish exotic dark matter contributions from the extragalactic gamma-ray background. (orig.)

From superWIMPs to decaying dark matter. Models, bounds and indirect searches

Energy Technology Data Exchange (ETDEWEB)

Weniger, Christoph

2010-06-15

Despite lots of observational and theoretical efforts, the particle nature of dark matter remains unknown. Beyond the paradigmatic WIMPs (Weakly Interacting Massive Particles), many theoretically well motivated models exist where dark matter interacts much more weakly than electroweak with Standard Model particles. In this case new phenomena occur, like the decay of dark matter or the interference with the standard cosmology of the early Universe. In this thesis we study some of these aspects of superweakly coupled dark matter in general, and in the special case of hidden U(1){sub X} gauginos that kinetically mix with hypercharge. There, we will assume that the gauge group remains unbroken, similar to the Standard Model U(1){sub em}. We study different kinds of cosmological bounds, including bounds from thermal overproduction, from primordial nucleosynthesis and from structure formation. Furthermore, we study the possible cosmic-ray signatures predicted by this scenario, with emphasis on the electron and positron channel in light of the recent observations by PAMELA and Fermi LAT. Moreover we study the cosmic-ray signatures of decaying dark matter independently of concrete particle-physics models. In particular we analyze in how far the rise in the positron fraction above 10 GeV, as observed by PAMELA, can be explained by dark matter decay. Lastly, we concentrate on related predictions for gamma-ray observations with the Fermi LAT, and propose to use the dipole-like anisotropy of the prompt gamma-ray dark matter signal to distinguish exotic dark matter contributions from the extragalactic gamma-ray background. (orig.)

Circuit lower bounds in bounded arithmetics

Czech Academy of Sciences Publication Activity Database

Pich, Ján

2015-01-01

Roč. 166, č. 1 (2015), s. 29-45 ISSN 0168-0072 R&D Projects: GA AV ČR IAA100190902 Keywords : bounded arithmetic * circuit lower bounds Subject RIV: BA - General Mathematics Impact factor: 0.582, year: 2015 http://www.sciencedirect.com/science/article/pii/S0168007214000888

Simulation Modeling of a Check-in and Medication Reconciliation Ambulatory Clinic Kiosk

Directory of Open Access Journals (Sweden)

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.

Space shuttle prototype check valve development

Science.gov (United States)

Tellier, G. F.

1976-01-01

Contaminant-resistant seal designs and a dynamically stable prototype check valve for the orbital maneuvering and reaction control helium pressurization systems of the space shuttle were developed. Polymer and carbide seal models were designed and tested. Perfluoroelastomers compatible with N2O4 and N2H4 types were evaluated and compared with Teflon in flat and captive seal models. Low load sealing and contamination resistance tests demonstrated cutter seal superiority over polymer seals. Ceramic and carbide materials were evaluated for N2O4 service using exposure to RFNA as a worst case screen; chemically vapor deposited tungsten carbide was shown to be impervious to the acid after 6 months immersion. A unique carbide shell poppet/cutter seat check valve was designed and tested to demonstrate low cracking pressure ( 2.0 psid), dynamic stability under all test bench flow conditions, contamination resistance (0.001 inch CRES wires cut with 1.5 pound seat load) and long life of 100,000 cycles (leakage 1.0 scc/hr helium from 0.1 to 400 psig).

Verification of communication protocols in web services model-checking service compositions

CERN Document Server

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.

Polarized quark distributions in bound nucleon and polarized EMC effect in Thermodynamical Bag Model

Energy Technology Data Exchange (ETDEWEB)

Ganesamurthy, Kuppusamy, E-mail: udckgm@sify.co [Research Department of Physics, Urumu Dhanalakshmi College, Trichy 620019 (India); Sambasivam, Raghavan, E-mail: udcsam@sify.co [Research Department of Physics, Urumu Dhanalakshmi College, Trichy 620019 (India)

2011-04-15

The polarized parton distribution functions (PDFs) and nuclear structure functions are evaluated by the phenomenological Thermodynamical Bag Model for nuclear media {sup 7}Li and {sup 27}Al. The Fermi statistical distribution function which includes the spin degree of freedom is used in this statistical model. We predict a sizeable polarized EMC effect. The results of quark spin sum and axial coupling constant of bound nucleons are compared with theoretical predictions of modified Nambu-Jona-Lasinio (NJL) model by Bentz et al.

Bounded rationality alters the dynamics of paediatric immunization acceptance.

Science.gov (United States)

Oraby, Tamer; Bauch, Chris T

2015-06-02

Interactions between disease dynamics and vaccinating behavior have been explored in many coupled behavior-disease models. Cognitive effects such as risk perception, framing, and subjective probabilities of adverse events can be important determinants of the vaccinating behaviour, and represent departures from the pure "rational" decision model that are often described as "bounded rationality". However, the impact of such cognitive effects in the context of paediatric infectious disease vaccines has received relatively little attention. Here, we develop a disease-behavior model that accounts for bounded rationality through prospect theory. We analyze the model and compare its predictions to a reduced model that lacks bounded rationality. We find that, in general, introducing bounded rationality increases the dynamical richness of the model and makes it harder to eliminate a paediatric infectious disease. In contrast, in other cases, a low cost, highly efficacious vaccine can be refused, even when the rational decision model predicts acceptance. Injunctive social norms can prevent vaccine refusal, if vaccine acceptance is sufficiently high in the beginning of the vaccination campaign. Cognitive processes can have major impacts on the predictions of behaviour-disease models, and further study of such processes in the context of vaccination is thus warranted.

checkCIF/PLATON report Datablock: shelxl

Indian Academy of Sciences (India)

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, ...

Persistence-Based Branch Misprediction Bounds for WCET Analysis

DEFF Research Database (Denmark)

Puffitsch, Wolfgang

2015-01-01

Branch prediction is an important feature of pipelined processors to achieve high performance. However, it can lead to overly pessimistic worst-case execution time (WCET) bounds when being modeled too conservatively. This paper presents bounds on the number of branch mispredictions for local...... dynamic branch predictors. To handle interferences between branch instructions we use the notion of persistence, a concept that is also found in cache analyses. The bounds apply to branches in general, not only to branches that close a loop. Furthermore, the bounds can be easily integrated into integer...... linear programming formulations of the WCET problem. An evaluation on a number of benchmarks shows that with these bounds, dynamic branch prediction does not necessarily lead to higher WCET bounds than static prediction schemes....

Orthogonality-condition model for bound states with a separable expansion of the potential

International Nuclear Information System (INIS)

Pal, K.F.

1984-01-01

A very efficient solution of the equation of Saito's orthogonality-condition model (OCM) is reported for bound states by means of a separable expansion of the potential (PSE method). Some simplifications of the published formulae of the PSE method is derived, which facilitate its application to the OCM and may be useful in solving the Schroedinger equation as well. (author)

On devising Boussinesq-type models with bounded eigenspectra: One horizontal dimension

DEFF Research Database (Denmark)

Eskilsson, Claes; Engsig-Karup, Allan Peter

2014-01-01

) are introduced. Using spectral element simulations of stream function waves it is illustrated that (i) the bounded equations capture the physics of the wave motion as well as the standard unbounded equations, and (ii) the bounded equations are computationally more efficient when explicit time-stepping schemes...... using a spectral element method of arbitrary spatial order p. It is shown that existing sets of parameters, found by optimising the linear dispersion relation, give rise to unbounded eigenspectra which govern stability. For explicit time-stepping schemes the global CFL time-step restriction typically...... requires Δt∝p−2. We derive and present conditions on the parameters under which implicitly-implicit Boussinesq-type equations will exhibit bounded eigenspectra. Two new bounded versions having comparable nonlinear and dispersive properties as the equations of Nwogu (1993) and Schäffer and Madsen (1995...

Type Checking with XML Schema in XACT

DEFF Research Database (Denmark)

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...

Enabling model checking for collaborative process analysis: from BPMN to `Network of Timed Automata'

Science.gov (United States)

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.

Robust model predictive control of nonlinear systems with unmodeled dynamics and bounded uncertainties based on neural networks.

Science.gov (United States)

Yan, Zheng; Wang, Jun

2014-03-01

This paper presents a neural network approach to robust model predictive control (MPC) for constrained discrete-time nonlinear systems with unmodeled dynamics affected by bounded uncertainties. The exact nonlinear model of underlying process is not precisely known, but a partially known nominal model is available. This partially known nonlinear model is first decomposed to an affine term plus an unknown high-order term via Jacobian linearization. The linearization residue combined with unmodeled dynamics is then modeled using an extreme learning machine via supervised learning. The minimax methodology is exploited to deal with bounded uncertainties. The minimax optimization problem is reformulated as a convex minimization problem and is iteratively solved by a two-layer recurrent neural network. The proposed neurodynamic approach to nonlinear MPC improves the computational efficiency and sheds a light for real-time implementability of MPC technology. Simulation results are provided to substantiate the effectiveness and characteristics of the proposed approach.

Modelling of coupled self-actuating safety, relief and damped check valve systems with the codes TRAC-PF1 and ROLAST

International Nuclear Information System (INIS)

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.)

Dynamic Garment Simulation based on Hybrid Bounding Volume Hierarchy

Directory of Open Access Journals (Sweden)

Zhu Dongyong

2016-12-01

Full Text Available In order to solve the computing speed and efficiency problem of existing dynamic clothing simulation, this paper presents a dynamic garment simulation based on a hybrid bounding volume hierarchy. It firstly uses MCASG graph theory to do the primary segmentation for a given three-dimensional human body model. And then it applies K-means cluster to do the secondary segmentation to collect the human body’s upper arms, lower arms, upper legs, lower legs, trunk, hip and woman’s chest as the elementary units of dynamic clothing simulation. According to different shapes of these elementary units, it chooses the closest and most efficient hybrid bounding box to specify these units, such as cylinder bounding box and elliptic cylinder bounding box. During the process of constructing these bounding boxes, it uses the least squares method and slices of the human body to get the related parameters. This approach makes it possible to use the least amount of bounding boxes to create close collision detection regions for the appearance of the human body. A spring-mass model based on a triangular mesh of the clothing model is finally constructed for dynamic simulation. The simulation result shows the feasibility and superiority of the method described.

Boudot's Range-Bounded Commitment Scheme Revisited

Science.gov (United States)

Cao, Zhengjun; Liu, Lihua

Checking whether a committed integer lies in a specific interval has many cryptographic applications. In Eurocrypt'98, Chan et al. proposed an instantiation (CFT Proof). Based on CFT, Boudot presented a popular range-bounded commitment scheme in Eurocrypt'2000. Both CFT Proof and Boudot Proof are based on the encryption E(x, r)=g^xh^r mod n, where n is an RSA modulus whose factorization is unknown by the prover. They did not use a single base as usual. Thus an increase in cost occurs. In this paper, we show that it suffices to adopt a single base. The cost of the modified Boudot Proof is about half of that of the original scheme. Moreover, the key restriction in the original scheme, i.e., both the discrete logarithm of g in base h and the discrete logarithm of h in base g are unknown by the prover, which is a potential menace to the Boudot Proof, is definitely removed.

Role of recent research in improving check valve reliability at nuclear power plants

International Nuclear Information System (INIS)

Kalsi, M.S.; Horst, C.L.; Wang, J.K.; Sharma, V.

1990-01-01

Check valve failures at nuclear power plants in recent years have led to serious safety concerns, and caused extensive damage to other plant components which had a significant impact on plant availability. In order to understand the failure mechanism and improve the reliability of check valves, a systematic research effort was proposed by Kalsi Engineering, Inc. to U.S. Nuclear Regulatory Commission (NRC). The overall goal of the research was to develop models for predicting the performance and degradation of swing check valves in nuclear power plant systems so that appropriate preventive maintenance or design modifications can be performed to improve the reliability of check valves. Under Phase I of this research, a large matrix of tests was run with instrumented swing check valves to determine the stability of the disc under a variety of upstream flow disturbances, covering a wide range of disc stop positions and flow velocities in two different valve sizes. The goals of Phase II research were to develop predictive models which quantify the anticipated degradation of swing check valves that have flow disturbances closely upstream of the valve and are operating under flow velocities that do not result in full disc opening. This research allows the inspection/maintenance activities to be focussed on those check valves that are more likely to suffer premature degradation. The quantitative wear and fatigue prediction methodology can be used to develop a sound preventive maintenance program. The results of the research also show the improvements in check valve performance/reliability that can be achieved by certain modifications in the valve design

An upper bound on Q-star masses

International Nuclear Information System (INIS)

Hochron, D.R.; Selipsky, S.B.

1992-06-01

Q-stars (the gravitational generalization of Q-balls, strongly bound bulk matter that an appear in field theories of strongly interacting hadrons) are the only known impact objects consistent with the known bulk structure of nuclei and chiral symmetry that evade the Rhoades-Ruffini upper bound of 3.2M circle-dot . Generic bounds are quite weak: M Q-star circle-dot . If, however, we assume that the 1.558 ms pulsar is a Q-star, equilibrium. A stability criteria of rotating fluids place a much stronger upper bound of M c ≤ 5.3M circle-dot on such models under certain special assumptions. This has important implications for heavy compact objects such as Cygnus X-1

NLO+NLL collider bounds, Dirac fermion and scalar dark matter in the B-L model

Energy Technology Data Exchange (ETDEWEB)

Klasen, Michael [Westfaelische Wilhelms-Universitaet Muenster, Institut fuer Theoretische Physik, Muenster (Germany); Lyonnet, Florian [Southern Methodist University, Dallas, TX (United States); Queiroz, Farinaldo S. [Max-Planck-Institut fuer Kernphysik, Particle and Astroparticle Physics Division, Heidelberg (Germany)

2017-05-15

Baryon and lepton numbers being accidental global symmetries of the Standard Model (SM), it is natural to promote them to local symmetries. However, to preserve anomaly-freedom, only combinations of B-L are viable. In this spirit, we investigate possible dark matter realizations in the context of the U(1){sub B-L} model: (i) Dirac fermion with unbroken B-L; (ii) Dirac fermion with broken B-L; (iii) scalar dark matter; (iv) two-component dark matter. We compute the relic abundance, direct and indirect detection observables and confront them with recent results from Planck, LUX-2016, and Fermi-LAT and prospects from XENON1T. In addition to the well-known LEP bound M{sub Z}{sup {sub '}}/g{sub BL} >or similar 7 TeV, we include often ignored LHC bounds using 13 TeV dilepton (dimuon + dielectron) data at next-to-leading order plus next-to-leading logarithmic accuracy. We show that, for gauge couplings smaller than 0.4, the LHC gives rise to the strongest collider limit. In particular, we find M{sub Z}{sup {sub '}}/g{sub BL} > 8.7 TeV for g{sub BL} = 0.3. We conclude that the NLO+NLL corrections improve the dilepton bounds on the Z{sup '} mass and that both dark matter candidates are only viable in the Z{sup '} resonance region, with the parameter space for scalar dark matter being fully probed by XENON1T. Lastly, we show that one can successfully have a minimal two-component dark matter model. (orig.)

Perceptron Mistake Bounds

OpenAIRE

Mohri, Mehryar; Rostamizadeh, Afshin

2013-01-01

We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz loss function, and admit a very simple proof.

Bounded rationality alters the dynamics of paediatric immunization acceptance

Science.gov (United States)

Oraby, Tamer; Bauch, Chris T.

2015-01-01

Interactions between disease dynamics and vaccinating behavior have been explored in many coupled behavior-disease models. Cognitive effects such as risk perception, framing, and subjective probabilities of adverse events can be important determinants of the vaccinating behaviour, and represent departures from the pure “rational” decision model that are often described as “bounded rationality”. However, the impact of such cognitive effects in the context of paediatric infectious disease vaccines has received relatively little attention. Here, we develop a disease-behavior model that accounts for bounded rationality through prospect theory. We analyze the model and compare its predictions to a reduced model that lacks bounded rationality. We find that, in general, introducing bounded rationality increases the dynamical richness of the model and makes it harder to eliminate a paediatric infectious disease. In contrast, in other cases, a low cost, highly efficacious vaccine can be refused, even when the rational decision model predicts acceptance. Injunctive social norms can prevent vaccine refusal, if vaccine acceptance is sufficiently high in the beginning of the vaccination campaign. Cognitive processes can have major impacts on the predictions of behaviour-disease models, and further study of such processes in the context of vaccination is thus warranted. PMID:26035413

The method of a joint intraday security check system based on cloud computing

Science.gov (United States)

Dong, Wei; Feng, Changyou; Zhou, Caiqi; Cai, Zhi; Dan, Xu; Dai, Sai; Zhang, Chuancheng

2017-01-01

The intraday security check is the core application in the dispatching control system. The existing security check calculation only uses the dispatch center’s local model and data as the functional margin. This paper introduces the design of all-grid intraday joint security check system based on cloud computing and its implementation. To reduce the effect of subarea bad data on the all-grid security check, a new power flow algorithm basing on comparison and adjustment with inter-provincial tie-line plan is presented. And the numerical example illustrated the effectiveness and feasibility of the proposed method.

A lower bound on the mass of dark matter particles

International Nuclear Information System (INIS)

Boyarsky, Alexey; Ruchayskiy, Oleg; Iakubovskyi, Dmytro

2009-01-01

We discuss the bounds on the mass of Dark Matter (DM) particles, coming from the analysis of DM phase-space distribution in dwarf spheroidal galaxies (dSphs). After reviewing the existing approaches, we choose two methods to derive such a bound. The first one depends on the information about the current phase space distribution of DM particles only, while the second one uses both the initial and final distributions. We discuss the recent data on dSphs as well as astronomical uncertainties in relevant parameters. As an application, we present lower bounds on the mass of DM particles, coming from various dSphs, using both methods. The model-independent bound holds for any type of fermionic DM. Stronger, model-dependent bounds are quoted for several DM models (thermal relics, non-resonantly and resonantly produced sterile neutrinos, etc.). The latter bounds rely on the assumption that baryonic feedback cannot significantly increase the maximum of a distribution function of DM particles. For the scenario in which all the DM is made of sterile neutrinos produced via non-resonant mixing with the active neutrinos (NRP) this gives m NRP > 1.7 keV. Combining these results in their most conservative form with the X-ray bounds of DM decay lines, we conclude that the NRP scenario remains allowed in a very narrow parameter window only. This conclusion is independent of the results of the Lyman-α analysis. The DM model in which sterile neutrinos are resonantly produced in the presence of lepton asymmetry remains viable. Within the minimal neutrino extension of the Standard Model (the νMSM), both mass and the mixing angle of the DM sterile neutrino are bounded from above and below, which suggests the possibility for its experimental search

Online Conformance Checking for Petri Nets and Event Streams

DEFF Research Database (Denmark)

Burattin, Andrea

2017-01-01

Within process mining, we can identify conformance checking as the task of computing the extent to which executions of a process model are in line with the reference behavior. Most approaches currently available in the literature (for imperative models, such as Petri nets) perform just a-posterio...

The Supermarket Model with Bounded Queue Lengths in Equilibrium

Science.gov (United States)

Brightwell, Graham; Fairthorne, Marianne; Luczak, Malwina J.

2018-04-01

In the supermarket model, there are n queues, each with a single server. Customers arrive in a Poisson process with arrival rate λ n , where λ = λ (n) \\in (0,1) . Upon arrival, a customer selects d=d(n) servers uniformly at random, and joins the queue of a least-loaded server amongst those chosen. Service times are independent exponentially distributed random variables with mean 1. In this paper, we analyse the behaviour of the supermarket model in the regime where λ (n) = 1 - n^{-α } and d(n) = \\lfloor n^β \\rfloor , where α and β are fixed numbers in (0, 1]. For suitable pairs (α , β ) , our results imply that, in equilibrium, with probability tending to 1 as n → ∞, the proportion of queues with length equal to k = \\lceil α /β \\rceil is at least 1-2n^{-α + (k-1)β } , and there are no longer queues. We further show that the process is rapidly mixing when started in a good state, and give bounds on the speed of mixing for more general initial conditions.

Four-quark bound states

International Nuclear Information System (INIS)

Zouzou, S.

1986-01-01

In the framework of simple non-relativistic potential models, we examine the system consisting of two quarks and two antiquarks with equal or unequal masses. We search for possible bound states below the threshold for the spontaneous dissociation into two mesons. We solve the four body problem by empirical or systematic variational methods and we include the virtual meson-meson components of the wave function. With standard two-body potentials, there is no proliferation of multiquarks. With unequal quark masses, we obtain however exotic (anti Qanti Qqq) bound states with a baryonic antidiquark-quark-quark structure very analogous to the heavy flavoured (Q'qq) baryons. (orig.)

Electronic bound states in parity-preserving QED{sub 3} applied to high-T{sub c} cuprate superconductors

Energy Technology Data Exchange (ETDEWEB)

Christiansen, H.R. [Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil). Coordenacao de Teoria de Campos e Particulas]. E-mail: hugo@cbpf.br; Cima, O.M. Del [Universidade Catolica de Petropolis, RJ (Brazil). Grupo de Fisica Teorica]. E-mail: delcima@gft.ucp.br; Ferreira Junior, M.M. [Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil). Coordenacao de Teoria de Campos e Particulas]|[Maranhao Univ., Sao Luis, MA (Brazil). Dept. de Fisica]. E-mail: manojr@cbpf.br; Helayel-Neto, J.A. [Universidade Catolica de Petropolis, RJ (Brazil). Grupo de Fisica Teorica]|[Centro Brasileiro de Pesquisas Fisicas (CBPF), Rio de Janeiro, RJ (Brazil). Coordenacao de Teoria de Campos e Particulas]. E-mail: helayel@gft.ucp.br

2001-08-01

We consider a parity-preserving QED{sub 3} model with spontaneous breaking of the gauge symmetry as a framework for the evaluation of the electron-electron interaction potential underlying high-T{sub e} superconductivity. The fact that resulting potential, - C{sub s} K{sub o} (Mr), is non-confining and weak (in the sense of Kato) strongly suggests the mechanism of pair-condensation. This potential, compatible with an s-wave order parameters, is then applied to the Schrodinger equation for the sake of numerical calculations, thereby enforcing the existence of bound states. The results worked out by means of our theoretical framework are checked by considering a number of phenomenological data extracted from different copper oxide superconductors. The agreement may motivate a deeper analysis of our model viewing an application to quasi-planar cuprate superconductors. The data analyzed here suggest an energy scale of 1-10 meV for the breaking of the U(1)-symmetry. (author)

Two-phonon bound states in imperfect crystals

International Nuclear Information System (INIS)

Behera, S.N.; Samsur, Sk.

1980-01-01

The question of the occurrence of two-phonon bound states in imperfect crystals is investigated. It is shown that the anharmonicity mediated two-phonon bound state which is present in perfect crystals gets modified due to the presence of impurities. Moreover, the possibility of the occurrence of a purely impurity mediated two-phonon bound state is demonstrated. The bound state frequencies are calculated using the simple Einstein oscillator model for the host phonons. The two-phonon density of states for the imperfect crystal thus obtained has peaks at the combination and difference frequencies of two host phonons besides the peaks at the bound state frequencies. For a perfect crystal the theory predicts a single peak at the two-phonon bound state frequency in conformity with experimental observations and other theoretical calculations. Experimental data on the two-phonon infrared absorption and Raman scattering from mixed crystals of Gasub(1-c)Alsub(c)P and Gesub(1-c)Sisub(c) are analysed to provide evidence in support of impurity-mediated two-phonon bound states. The relevance of the zero frequency (difference spectrum) peak to the central peak, observed in structural phase transitions, is conjectured. (author)

Inequalities and bounds for nucleon-nucleon scattering

International Nuclear Information System (INIS)

Ramandurai, K.S.

1979-08-01

The objective of this work is to derive model-independent inequalities and bounds for nucleon-nucleon elastic scattering amplitudes based on well-established theoretical principles and symmetries. Two classes of methods are used: algebraic and variational. In the algebraic part, the author derives inequalities and bounds for NN amplitudes and observables using their mutual relations and x symmetries. In the variational part, he employs Lagrange's method of undetermined multipliers to evaluate the bounds. He tests the predictions of a sample of proposed phase shifts at three different energies using the results obtained

Search for quasi bound η mesons

International Nuclear Information System (INIS)

Machner, H

2015-01-01

The search for a quasi bound η meson in atomic nuclei is reviewed. This tentative state is studied theoretically as well as experimentally. The theory starts from elastic η nucleon scattering which is derived from production data within some models. From this interaction the η nucleus interaction is derived. Model calculations predict binding energies and widths of the quasi bound state. Another method is to derive the η nucleus interaction from excitation functions of η production experiments. The s wave interaction is extracted from such data via final state interaction (FSI) theorem. We give the derivation of s wave amplitudes in partial wave expansion and in helicity amplitudes and their relation to observables. Different experiments extracting the FSI are discussed as are production experiments. So far only three experiments give evidence for the existence of the quasi bound state: a pion double charge exchange experiment, an effective mass measurement, and a transfer reaction at recoil free kinematics with observation of the decay of the state. (topical review)

Software tool for physics chart checks.

Science.gov (United States)

Li, H Harold; Wu, Yu; Yang, Deshan; Mutic, Sasa

2014-01-01

Physics chart check has long been a central quality assurance (QC) measure in radiation oncology. The purpose of this work is to describe a software tool that aims to accomplish simplification, standardization, automation, and forced functions in the process. Nationally recognized guidelines, including American College of Radiology and American Society for Radiation Oncology guidelines and technical standards, and the American Association of Physicists in Medicine Task Group reports were identified, studied, and summarized. Meanwhile, the reported events related to physics chart check service were analyzed using an event reporting and learning system. A number of shortfalls in the chart check process were identified. To address these problems, a software tool was designed and developed under Microsoft. Net in C# to hardwire as many components as possible at each stage of the process. The software consists of the following 4 independent modules: (1) chart check management; (2) pretreatment and during treatment chart check assistant; (3) posttreatment chart check assistant; and (4) quarterly peer-review management. The users were a large group of physicists in the author's radiation oncology clinic. During over 1 year of use the tool has proven very helpful in chart checking management, communication, documentation, and maintaining consistency. The software tool presented in this work aims to assist physicists at each stage of the physics chart check process. The software tool is potentially useful for any radiation oncology clinics that are either in the process of pursuing or maintaining the American College of Radiology accreditation.

25 CFR 115.704 - May we accept for deposit into a trust account retirement checks/payments or pension fund checks...

Science.gov (United States)

2010-04-01

... checks/payments or pension fund checks/payments even though those funds are not specified in § 115.702... May we accept for deposit into a trust account retirement checks/payments or pension fund checks.../payments or pension fund checks/payments or any funds from sources that are not identified in the table in...

Application of risk-based methods to inservice testing of check valves

Energy Technology Data Exchange (ETDEWEB)

Closky, N.B.; Balkey, K.R.; McAllister, W.J. [and others

1996-12-01

Research efforts have been underway in the American Society of Mechanical Engineers (ASME) and industry to define appropriate methods for the application of risk-based technology in the development of inservice testing (IST) programs for pumps and valves in nuclear steam supply systems. This paper discusses a pilot application of these methods to the inservice testing of check valves in the emergency core cooling system of Georgia Power`s Vogtle nuclear power station. The results of the probabilistic safety assessment (PSA) are used to divide the check valves into risk-significant and less-risk-significant groups. This information is reviewed by a plant expert panel along with the consideration of appropriate deterministic insights to finally categorize the check valves into more safety-significant and less safety-significant component groups. All of the more safety-significant check valves are further evaluated in detail using a failure modes and causes analysis (FMCA) to assist in defining effective IST strategies. A template has been designed to evaluate how effective current and emerging tests for check valves are in detecting failures or in finding significant conditions that are precursors to failure for the likely failure causes. This information is then used to design and evaluate appropriate IST strategies that consider both the test method and frequency. A few of the less safety-significant check valves are also evaluated using this process since differences exist in check valve design, function, and operating conditions. Appropriate test strategies are selected for each check valve that has been evaluated based on safety and cost considerations. Test strategies are inferred from this information for the other check valves based on similar check valve conditions. Sensitivity studies are performed using the PSA model to arrive at an overall IST program that maintains or enhances safety at the lowest achievable cost.

[Pre-verbality in focusing and the need for self check. An attempt at "focusing check"].

Science.gov (United States)

Masui, T; Ikemi, A; Murayama, S

1983-06-01

Though the Focusing process is not entirely non-verbal, in Focusing, careful attention is paid by the Focuser and the Listener to the pre-verbal experiential process. In other words, Focusing involves attending to the felt sense that is not easily expressed in words immediately. Hence, during the process of learning to Focus, the Focusing teacher attempts to communicate the experiences of Focusing to the student which are not easily done by words. Due to such difficulties, the Focusing student may (and quite frequently does) mistake the experiential process in Focusing with other processes. Often, the felt sense can be confused with other phenomena such as "autogenic discharge". Also the Focuser may not stay with the felt sense and drift into "free association" or frequently, certain processes in "meditation" can be confused with Focusing. Therefore, there is a need for a "check" by which the Focusing student can confirm the Focusing experience for himself. For the Focusing student, such a "check" serves not only to confirm the Focusing process, but also an aid to learning Focusing. We will report here a "Focusing Check" which we developed by translating Eugene Gendlin's "Focusing Check" and making several modifications in it so that it will be more understandable to the Japanese. Along with the "Focusing Check" we developed, the authors discuss the need for such a check.

Estimated emission reductions from California's enhanced Smog Check program.

Science.gov (United States)

Singer, Brett C; Wenzel, Thomas P

2003-06-01

The U.S. Environmental Protection Agency requires that states evaluate the effectiveness of their vehicle emissions inspection and maintenance (I/M) programs. This study demonstrates an evaluation approach that estimates mass emission reductions over time and includes the effect of I/M on vehicle deterioration. It includes a quantitative assessment of benefits from pre-inspection maintenance and repairs and accounts for the selection bias effect that occurs when intermittent high emitters are tested. We report estimates of one-cycle emission benefits of California's Enhanced Smog Check program, ca. 1999. Program benefits equivalent to metric tons per day of prevented emissions were calculated with a "bottom-up" approach that combined average per vehicle reductions in mass emission rates (g/gal) with average per vehicle activity, resolved by model year. Accelerated simulation mode test data from the statewide vehicle information database (VID) and from roadside Smog Check testing were used to determine 2-yr emission profiles of vehicles passing through Smog Check and infer emission profiles that would occur without Smog Check. The number of vehicles participating in Smog Check was also determined from the VID. We estimate that in 1999 Smog Check reduced tailpipe emissions of HC, CO, and NO(x) by 97, 1690, and 81 t/d, respectively. These correspond to 26, 34, and 14% of the HC, CO, and NO(x) that would have been emitted by vehicles in the absence of Smog Check. These estimates are highly sensitive to assumptions about vehicle deterioration in the absence of Smog Check. Considering the estimated uncertainty in these assumptions yields a range for calculated benefits: 46-128 t/d of HC, 860-2200 t/d of CO, and 60-91 t/d of NO(x). Repair of vehicles that failed an initial, official Smog Check appears to be the most important mechanism of emission reductions, but pre-inspection maintenance and repair also contributed substantially. Benefits from removal of nonpassing

[Infection prevention check-in and infection prevention check-out to prevent nosocomial infections].

Science.gov (United States)

Kramer, A; Schilling, M; Heidecke, C D

2010-02-01

A precondition for the success of the prevention of SSI is the complete realisation of the proven anti-infective measures in form of the multi-barrier strategy or the so-called bundles. In daily practice it is important to follow the fixed instructions, i. e., to ensure a high compliance. In much the same way as an airline pilot or co-pilot must examine whether all instruments are functioning before each take-off, a comparable procedure should be developed as a pre-operative control for the observance of all -defined measures by the responsible surgeon and for the post-operative supervision by the patient. For the control of the observance of the defined pre-operative prevention measures, a check list with 12 items was developed, named the "infection prevention check-in". The check list is authorised by the responsible surgeon be-fore each operation. For the surveillance of the general hygiene in the post-operative period the "infection prevention check-out" with 14 items was developed. Thereby the patient is able to evaluate the staff's compliance with the hygienic measures at the time of dismissal. With the introduction of the check-lists a simple means is given to involve both the team of the surgeons and the ward staff, together with the patient, into the infection prophylaxis even more effectively. In order to assess the success of those measures, the influence on the rate of SSI is to be determined prospectively. Georg Thieme Verlag Stuttgart, New York.

Bounds on fluid permeability for viscous flow through porous media

International Nuclear Information System (INIS)

Berryman, J.G.

1985-01-01

General properties of variational bounds on Darcy's constant for slow viscous flow through porous media are studied. The bounds are also evaluated numerically for the penetrable sphere model. The bound of Doi depending on two-point correlations and the analytical bound of Weissberg and Prager give comparable results in the low density limit but the analytical bound is superior for higher densities. Prager's bound depending on three-point correlation functions is worse than the analytical bound at low densities but better (although comparable to it) at high densities. A procedure for methodically improving Prager's three point bound is presented. By introducing a Gaussian trial function, the three-point bound is improved by an order of magnitude for moderate values of porosity. The new bounds are comparable in magnitude to the Kozeny--Carman empirical relation for porous materials

Effect of precipitation spatial distribution uncertainty on the uncertainty bounds of a snowmelt runoff model output

Science.gov (United States)

Jacquin, A. P.

2012-04-01

This study analyses the effect of precipitation spatial distribution uncertainty on the uncertainty bounds of a snowmelt runoff model's discharge estimates. Prediction uncertainty bounds are derived using the Generalized Likelihood Uncertainty Estimation (GLUE) methodology. The model analysed is a conceptual watershed model operating at a monthly time step. The model divides the catchment into five elevation zones, where the fifth zone corresponds to the catchment glaciers. Precipitation amounts at each elevation zone i are estimated as the product between observed precipitation (at a single station within the catchment) and a precipitation factor FPi. Thus, these factors provide a simplified representation of the spatial variation of precipitation, specifically the shape of the functional relationship between precipitation and height. In the absence of information about appropriate values of the precipitation factors FPi, these are estimated through standard calibration procedures. The catchment case study is Aconcagua River at Chacabuquito, located in the Andean region of Central Chile. Monte Carlo samples of the model output are obtained by randomly varying the model parameters within their feasible ranges. In the first experiment, the precipitation factors FPi are considered unknown and thus included in the sampling process. The total number of unknown parameters in this case is 16. In the second experiment, precipitation factors FPi are estimated a priori, by means of a long term water balance between observed discharge at the catchment outlet, evapotranspiration estimates and observed precipitation. In this case, the number of unknown parameters reduces to 11. The feasible ranges assigned to the precipitation factors in the first experiment are slightly wider than the range of fixed precipitation factors used in the second experiment. The mean squared error of the Box-Cox transformed discharge during the calibration period is used for the evaluation of the

QuickChecking static analysis properties

DEFF Research Database (Denmark)

Midtgaard, Jan; Møller, Anders

2017-01-01

A static analysis can check programs for potential errors. A natural question that arises is therefore: who checks the checker? Researchers have given this question varying attention, ranging from basic testing techniques, informal monotonicity arguments, thorough pen-and-paper soundness proofs....... Moreover, we offer a number of generic, type-safe combinators to check transfer functions and operators on lattices, to help ensure that these are, eg, monotone, strict, or invariant. We substantiate our claims by quickchecking a type analysis for the Lua programming language....

K-nuclear bound states in a dynamical model

Czech Academy of Sciences Publication Activity Database

Mareš, Jiří; Friedman, E.; Gal, A.

2006-01-01

Roč. 770, 1/2 (2006), s. 84-105 ISSN 0375-9474 Institutional research plan: CEZ:AV0Z10480505 Keywords : kaonic atoms * K-nuclear bound states * K-nucleus interaction Subject RIV: BE - Theoretical Physics Impact factor: 2.155, year: 2006

Simple Check Valves for Microfluidic Devices

Science.gov (United States)

Willis, Peter A.; Greer, Harold F.; Smith, J. Anthony

2010-01-01

A simple design concept for check valves has been adopted for microfluidic devices that consist mostly of (1) deformable fluorocarbon polymer membranes sandwiched between (2) borosilicate float glass wafers into which channels, valve seats, and holes have been etched. The first microfluidic devices in which these check valves are intended to be used are micro-capillary electrophoresis (microCE) devices undergoing development for use on Mars in detecting compounds indicative of life. In this application, it will be necessary to store some liquid samples in reservoirs in the devices for subsequent laboratory analysis, and check valves are needed to prevent cross-contamination of the samples. The simple check-valve design concept is also applicable to other microfluidic devices and to fluidic devices in general. These check valves are simplified microscopic versions of conventional rubber- flap check valves that are parts of numerous industrial and consumer products. These check valves are fabricated, not as separate components, but as integral parts of microfluidic devices. A check valve according to this concept consists of suitably shaped portions of a deformable membrane and the two glass wafers between which the membrane is sandwiched (see figure). The valve flap is formed by making an approximately semicircular cut in the membrane. The flap is centered over a hole in the lower glass wafer, through which hole the liquid in question is intended to flow upward into a wider hole, channel, or reservoir in the upper glass wafer. The radius of the cut exceeds the radius of the hole by an amount large enough to prevent settling of the flap into the hole. As in a conventional rubber-flap check valve, back pressure in the liquid pushes the flap against the valve seat (in this case, the valve seat is the adjacent surface of the lower glass wafer), thereby forming a seal that prevents backflow.

A mechanistic model of an upper bound on oceanic carbon export as a function of mixed layer depth and temperature

Directory of Open Access Journals (Sweden)

Z. Li

2017-11-01

Full Text Available Export production reflects the amount of organic matter transferred from the ocean surface to depth through biological processes. This export is in large part controlled by nutrient and light availability, which are conditioned by mixed layer depth (MLD. In this study, building on Sverdrup's critical depth hypothesis, we derive a mechanistic model of an upper bound on carbon export based on the metabolic balance between photosynthesis and respiration as a function of MLD and temperature. We find that the upper bound is a positively skewed bell-shaped function of MLD. Specifically, the upper bound increases with deepening mixed layers down to a critical depth, beyond which a long tail of decreasing carbon export is associated with increasing heterotrophic activity and decreasing light availability. We also show that in cold regions the upper bound on carbon export decreases with increasing temperature when mixed layers are deep, but increases with temperature when mixed layers are shallow. A meta-analysis shows that our model envelopes field estimates of carbon export from the mixed layer. When compared to satellite export production estimates, our model indicates that export production in some regions of the Southern Ocean, particularly the subantarctic zone, is likely limited by light for a significant portion of the growing season.

Supergravity and upper bound on scale of supersymmetry breaking

International Nuclear Information System (INIS)

Kim, J.E.; Nishino, H.

1983-09-01

In locally supersymmetric grand unified models we show rather a model independent upper bound 3x10 11 GeV for the scale of supersymmetry breaking, which is derived by considering SU(2)xU(1) breaking at electro-weak mass scale. This bound necessarily implies the existence of new particles (superpartners) below 10 4 GeV. (author)

Logical-Rule Models of Classification Response Times: A Synthesis of Mental-Architecture, Random-Walk, and Decision-Bound Approaches

Science.gov (United States)

Fific, Mario; Little, Daniel R.; Nosofsky, Robert M.

2010-01-01

We formalize and provide tests of a set of logical-rule models for predicting perceptual classification response times (RTs) and choice probabilities. The models are developed by synthesizing mental-architecture, random-walk, and decision-bound approaches. According to the models, people make independent decisions about the locations of stimuli…

Mitigating check valve slamming and subsequentwater hammer events for PPFS using MOC

International Nuclear Information System (INIS)

Tian Wenxi; Su Guanghui; Wang Gaopeng; Qiu Suizheng; Xiao Zejun

2009-01-01

The method of characteristic (MOC) was adopted to analyze the check valve-induced water hammer behaviors for a Parallel Pumps Feedwater System (PPFS) during the alternate startup process. The motion of check valve disc was simulated using inertial valve model. Transient parameters including the pressure oscillation, local flow velocity and slamming of the check valve disc etc. have been obtained. The results showed that severe slamming between the valve disc and valve seat occurred during the alternate startup of parallel pumps. The induced maximum pressure vibration amplitude is up to 5.0 MPa. The scheme of appending a damping torque to slow down the check valve closing speed was also performed to mitigate of water hammer. It has been numerically approved to be an effective approach. (authors)

Mitigating check valve slamming and subsequentwater hammer events for PPFS using MOC

Institute of Scientific and Technical Information of China (English)

TIAN Wenxi; SU Guanghui; WANG Gaopeng; QIU Suizheng; XIAO Zejun

2009-01-01

The method of characteristic (MOC) was adopted to analyze the check valve-induced water hammer behaviors for a Parallel Pumps Feedwater System (PPFS) during the alternate startup process. The motion of check valve disc was simulated using inertial valve model. Transient parameters including the pressure oscillation, local flow velocity and slamming of the check valve disc etc. have been obtained. The results showed that severe slamming between the valve disc and valve seat occurred during the alternate startup of parallel pumps. The induced maximum pressure vibration amplitude is up to 5.0 MPa. The scheme of appending a damping torque to slow down the check valve closing speed was also performed to mitigate of water hammer. It has been numerically approved to be an effective approach.

Model Checking Artificial Intelligence Based Planners: Even the Best Laid Plans Must Be Verified

Science.gov (United States)

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.

25 CFR 11.421 - Bad checks.

Science.gov (United States)

2010-04-01

... 25 Indians 1 2010-04-01 2010-04-01 false Bad checks. 11.421 Section 11.421 Indians BUREAU OF... Criminal Offenses § 11.421 Bad checks. (a) A person who issues or passes a check or similar sight order for..., and the issuer failed to make good within 10 days after receiving notice of that refusal. ...

QuickChecking Static Analysis Properties

DEFF Research Database (Denmark)

Midtgaard, Jan; Møller, Anders

2015-01-01

A static analysis can check programs for potential errors. A natural question that arises is therefore: who checks the checker? Researchers have given this question varying attention, ranging from basic testing techniques, informal monotonicity arguments, thorough pen-and-paper soundness proofs...... of a lattice. Moreover, we offer a number of generic, type-safe combinators to check transfer functions and operators on lattices, to help ensure that these are, e.g., monotone, strict, or invariant. We substantiate our claims by quickchecking a type analysis for the Lua programming language...

From preventive to permissive checks

DEFF Research Database (Denmark)

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....

A Game-Theoretic Approach to Branching Time Abstract-Check-Refine Process

Science.gov (United States)

Wang, Yi; Tamai, Tetsuo

2009-01-01

Since the complexity of software systems continues to grow, most engineers face two serious problems: the state space explosion problem and the problem of how to debug systems. In this paper, we propose a game-theoretic approach to full branching time model checking on three-valued semantics. The three-valued models and logics provide successful abstraction that overcomes the state space explosion problem. The game style model checking that generates counter-examples can guide refinement or identify validated formulas, which solves the system debugging problem. Furthermore, output of our game style method will give significant information to engineers in detecting where errors have occurred and what the causes of the errors are.

Diagnostic information in compliance checking

NARCIS (Netherlands)

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

Formal Modeling and Verification of Interlocking Systems Featuring Sequential Release

DEFF Research Database (Denmark)

Vu, Linh Hong; Haxthausen, Anne Elisabeth; Peleska, Jan

2015-01-01

In this paper, we present a method and an associated tool suite for formal verification of the new ETCS level 2 based Danish railway interlocking systems. We have made a generic and reconfigurable model of the system behavior and generic high-level safety properties. This model accommodates seque...... SMT based bounded model checking (BMC) and inductive reasoning, we are able to verify the properties for model instances corresponding to railway networks of industrial size. Experiments also show that BMC is efficient for finding bugs in the railway interlocking designs....

Formal Modeling and Verification of Interlocking Systems Featuring Sequential Release

DEFF Research Database (Denmark)

Vu, Linh Hong; Haxthausen, Anne Elisabeth; Peleska, Jan

2014-01-01

In this paper, we present a method and an associated tool suite for formal verification of the new ETCS level 2 based Danish railway interlocking systems. We have made a generic and reconfigurable model of the system behavior and generic high-level safety properties. This model accommodates seque...... SMT based bounded model checking (BMC) and inductive reasoning, we are able to verify the properties for model instances corresponding to railway networks of industrial size. Experiments also show that BMC is efficient for finding bugs in the railway interlocking designs....

Implementing Check in/Check out for Students with Intellectual Disability in Self-Contained Classrooms

Science.gov (United States)

Boden, Lauren J.; Ennis, Robin P.; Jolivette, Kristine

2012-01-01

Check in/check out (CICO) is a secondary-tier intervention implemented within the framework of schoolwide positive behavior interventions and supports (SWPBIS) that uses school-based contingencies to encourage positive behavior. CICO is a five-step cycle which uses daily progress report cards (DPR) to monitor progress toward schoolwide or…

Classical Physics and the Bounds of Quantum Correlations.

Science.gov (United States)

Frustaglia, Diego; Baltanás, José P; Velázquez-Ahumada, María C; Fernández-Prieto, Armando; Lujambio, Aintzane; Losada, Vicente; Freire, Manuel J; Cabello, Adán

2016-06-24

A unifying principle explaining the numerical bounds of quantum correlations remains elusive, despite the efforts devoted to identifying it. Here, we show that these bounds are indeed not exclusive to quantum theory: for any abstract correlation scenario with compatible measurements, models based on classical waves produce probability distributions indistinguishable from those of quantum theory and, therefore, share the same bounds. We demonstrate this finding by implementing classical microwaves that propagate along meter-size transmission-line circuits and reproduce the probabilities of three emblematic quantum experiments. Our results show that the "quantum" bounds would also occur in a classical universe without quanta. The implications of this observation are discussed.

Can the Σ-nn system be bound?

International Nuclear Information System (INIS)

Stadler, A.; Gibson, B.F.

1994-01-01

Motivated by the Σ-hypernuclear states reported in (K - ,π ± ) experiments, we have explored the possibility that there exists a particle-stable Σ - nn bound state. For the Juelich A hyperon-nucleon, realistic-force model, our calculations yield little reason to expect a positive-parity bound state or resonance in either the J=1/2 or the J=3/2 channels

Preparatory steps for a robust dynamic model for organically bound tritium dynamics in agricultural crops

Energy Technology Data Exchange (ETDEWEB)

Melintescu, A.; Galeriu, D. [' Horia Hulubei' National Institute for Physics and Nuclear Engineering, Bucharest-Magurele (Romania); Diabate, S.; Strack, S. [Institute of Toxicology and Genetics, Karlsruhe Institute of Technology - KIT, Eggenstein-Leopoldshafen (Germany)

2015-03-15

The processes involved in tritium transfer in crops are complex and regulated by many feedback mechanisms. A full mechanistic model is difficult to develop due to the complexity of the processes involved in tritium transfer and environmental conditions. First, a review of existing models (ORYZA2000, CROPTRIT and WOFOST) presenting their features and limits, is made. Secondly, the preparatory steps for a robust model are discussed, considering the role of dry matter and photosynthesis contribution to the OBT (Organically Bound Tritium) dynamics in crops.

Upper bounds on Higgs and top quark masses in the flipped SU(5)xU(1) superstring model

Energy Technology Data Exchange (ETDEWEB)

Durand, L.; Lopez, J.L.

1989-02-02

In this letter, we use a simplified method to calculate high-energy unitarity constraints on grand unified broken supersymmetric models. We apply the method to the ''flipped'' SU(5)xU(1) superstring model, obtain the constraints at a grand unified mass scale M/sub G/=4x10/sup 16/ GeV, and then use the renormalization group equations to evolve the constraints to the low-energy mass scale M/sub W/. We find upper bounds on the low-energy superpotential parameters which in turn imply absolute upper bounds on the top quark mass, m/sub t/< or approx.200 GeV, and on the lightest neutral Higgs boson mass, Msub(H/sub 1//sup 0/)< or approx.155 GeV. We also obtain an upper bound on Msub(H/sub 1//sup 0/) as a function of m/sub t/ which shows that for favored values of the ratio of Higgs vacuum expectation values Msub(H/sub 1//sup 0/)< or approx.125 GeV.

Towards an abstract parallel branch and bound machine

NARCIS (Netherlands)

A. de Bruin (Arie); G.A.P. Kindervater (Gerard); H.W.J.M. Trienekens

1995-01-01

textabstractMany (parallel) branch and bound algorithms look very different from each other at first glance. They exploit, however, the same underlying computational model. This phenomenon can be used to define branch and bound algorithms in terms of a set of basic rules that are applied in a

Inference on population history and model checking using DNA sequence and microsatellite data with the software DIYABC (v1.0

Directory of Open Access Journals (Sweden)

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

FAO/IAEA model protocol for the determination of bound residues in soil

International Nuclear Information System (INIS)

1986-01-01

A protocol for determining bound pesticide residue content in soils was developed and collaboratively tested by 11 members of the FAO/IAEA Research Co-ordination Committee. The method assumes prior incubation of soil with a radioactive pesticide or related organic compound. The major process steps of the protocol include: (a) Soxhlet extraction of air-dry soil with methanol for 24 h; (b) determination of radioactivity in unextracted soil, in methanol-extracted soil (yielding bound residue content), and in the methanol extract (yielding extractable residue content); and (c) use of triplicate samples per analysis. The participants received lysimeter soils treated six to seven years earlier with 14 C-allyl alcohol (Soil A) or 14 C-hexachloro-benzene (Soil H). The inter-laboratory results first indicated non-homogeneity of Soil A sub-samples, since the initial and bound radioactivity for four laboratories was about half of that found by the remaining seven laboratories. Intra-laboratory (in one laboratory) analyses of sub-subsamples from six 'high-group' laboratories, two 'low-group' laboratories and two additional laboratories confirmed the homogeneity of Soil A and implicated error in the combustion methods at 'low-group' laboratories. The intra- and inter-laboratory coefficients of variation for initial 14 C-content were 4.7% and 7.0%, respectively. Of the residual 14 C in Soil A, 95% was bound; in contrast, only 15% of 14 C in Soil H was bound. The coefficients of variation among ten laboratories, for Soil H, were 8.4% and 18.1% for percentage extractable residue and percentage bound residue, respectively. Some limited testing of alternative protocols, using other solvents or batch extraction, confirmed that the IAEA protocol was most efficient in the extraction of non-bound radioactivity; pre-wetting Soil A may, however, improve extraction. (author)

Comments upon a bound state model for a two body system

International Nuclear Information System (INIS)

Micu, L.

2005-01-01

We show that in classical mechanics, classical and relativistic quantum mechanics it is possible to replace the equation of the relative motion for a two-body bound system at rest by individual dynamical equations with correlated solutions. We compare the representations of a bound system in terms of the relative and individual coordinates and mention some of the observable differences. (author)

Bounds for the propagation speed of combustion flames

International Nuclear Information System (INIS)

Fort, Joaquim; Campos, Daniel; Gonzalez, Josep R; Velayos, Joaquim

2004-01-01

We focus on a combustion model for premixed flames based on two coupled equations determining the spatial dynamics of temperature and fuel density. We rewrite these equations as a classical reaction-diffusion model, so that we can apply some known methods for the prediction of lower and upper bounds to the front speed. The predictions are compared to simulations, which show that our new bounds substantially improve those following from the linearization method, used in the previous work of Fort et al (2000 J. Phys. A: Math. Gen. 33 6953). Radiative losses lead to pulses rather than fronts. We find a bound for their speed which (in contrast to the linearization one) correctly predicts the order of magnitude of the flame speed

Bounds for the propagation speed of combustion flames

Energy Technology Data Exchange (ETDEWEB)

Fort, Joaquim [Departament de FIsica, Universitat de Girona, Campus de Montilivi, 17071 Girona, Catalonia (Spain); Campos, Daniel [Grup de FIsica EstadIstica, Departament de FIsica, Universitat Autonoma de Barcelona, E-08193 Bellaterra (Spain); Gonzalez, Josep R [Grup de Mecanica de Fluids, Departament d' Enginyeria Mecanica, Universitat de Girona, Campus de Montilivi, 17071 Girona, Catalonia (Spain); Velayos, Joaquim [Grup de Mecanica de Fluids, Departament d' Enginyeria Mecanica, Universitat de Girona, Campus de Montilivi, 17071 Girona, Catalonia (Spain)

2004-07-23

We focus on a combustion model for premixed flames based on two coupled equations determining the spatial dynamics of temperature and fuel density. We rewrite these equations as a classical reaction-diffusion model, so that we can apply some known methods for the prediction of lower and upper bounds to the front speed. The predictions are compared to simulations, which show that our new bounds substantially improve those following from the linearization method, used in the previous work of Fort et al (2000 J. Phys. A: Math. Gen. 33 6953). Radiative losses lead to pulses rather than fronts. We find a bound for their speed which (in contrast to the linearization one) correctly predicts the order of magnitude of the flame speed.

XML-based formulation of field theoretical models. A proposal for a future standard and data base for model storage, exchange and cross-checking of results

International Nuclear Information System (INIS)

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)

Goat production check list

DEFF Research Database (Denmark)

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....

Error bounds on block Gauss-Seidel solutions of coupled multiphysics problems

KAUST Repository

Whiteley, J. P.

2011-05-09

Mathematical models in many fields often consist of coupled sub-models, each of which describes a different physical process. For many applications, the quantity of interest from these models may be written as a linear functional of the solution to the governing equations. Mature numerical solution techniques for the individual sub-models often exist. Rather than derive a numerical solution technique for the full coupled model, it is therefore natural to investigate whether these techniques may be used by coupling in a block Gauss-Seidel fashion. In this study, we derive two a posteriori bounds for such linear functionals. These bounds may be used on each Gauss-Seidel iteration to estimate the error in the linear functional computed using the single physics solvers, without actually solving the full, coupled problem. We demonstrate the use of the bound first by using a model problem from linear algebra, and then a linear ordinary differential equation example. We then investigate the effectiveness of the bound using a non-linear coupled fluid-temperature problem. One of the bounds derived is very sharp for most linear functionals considered, allowing us to predict very accurately when to terminate our block Gauss-Seidel iteration. © 2011 John Wiley & Sons, Ltd.

Error bounds on block Gauss-Seidel solutions of coupled multiphysics problems

KAUST Repository

Whiteley, J. P.; Gillow, K.; Tavener, S. J.; Walter, A. C.

2011-01-01

Mathematical models in many fields often consist of coupled sub-models, each of which describes a different physical process. For many applications, the quantity of interest from these models may be written as a linear functional of the solution to the governing equations. Mature numerical solution techniques for the individual sub-models often exist. Rather than derive a numerical solution technique for the full coupled model, it is therefore natural to investigate whether these techniques may be used by coupling in a block Gauss-Seidel fashion. In this study, we derive two a posteriori bounds for such linear functionals. These bounds may be used on each Gauss-Seidel iteration to estimate the error in the linear functional computed using the single physics solvers, without actually solving the full, coupled problem. We demonstrate the use of the bound first by using a model problem from linear algebra, and then a linear ordinary differential equation example. We then investigate the effectiveness of the bound using a non-linear coupled fluid-temperature problem. One of the bounds derived is very sharp for most linear functionals considered, allowing us to predict very accurately when to terminate our block Gauss-Seidel iteration. © 2011 John Wiley & Sons, Ltd.

Bounded Rational Managers Struggle with Talent Management - An Agent-based Modelling Approach

DEFF Research Database (Denmark)

Adamsen, Billy; Thomsen, Svend Erik

This study applies an agent-based modeling approach to explore some aspects of an important managerial task: finding and cultivating talented individuals capable of creating value for their organization at some future state. Given that the term talent in talent management is an empty signifier...... and its denotative meaning floating, we propose that bounded rational managers base their decisions on a simple heuristic, i.e. selecting and cultivating individuals so that their capabilities resemble their own capabilities the most (Adamsen 2015). We model the consequences of this talent management...... heuristic by varying the capabilities of today’s managers, which in turn impact which individuals will be selected as talent. We model the average level of capabilities and the distribution thereof in the sample where managers identify and select individuals from. We consider varying degrees of path...

12 CFR Appendix A to Part 229 - Routing Number Guide to Next-Day Availability Checks and Local Checks

Science.gov (United States)

2010-01-01

... Checks and Local Checks A Appendix A to Part 229 Banks and Banking FEDERAL RESERVE SYSTEM (CONTINUED) BOARD OF GOVERNORS OF THE FEDERAL RESERVE SYSTEM AVAILABILITY OF FUNDS AND COLLECTION OF CHECKS... Association. The routing number takes two forms: a fractional form and a nine-digit form. A paying bank...

New bounds on the phase transition line in a non-compact abelian lattice Higgs model

International Nuclear Information System (INIS)

Nill, F.

1987-01-01

The Higgs expectation value and the 't Hooft loop are investigated as order respectively disorder parameters in a fixed-length Higgs model of Villain type with gauge group R. Based on either observable the phase transition line is shown to be monotonically decreasing and Lipschitz continuous with Lipschitz constant 4d in dimension d ≥ 3. This gives new bounds on the phase transition line in terms of its endpoints, i.e. the critical couplings of the Z-gauge model and the XY-model with Villain action, respectively. (orig.)

Bounds on the Capacity of Weakly constrained two-dimensional Codes

DEFF Research Database (Denmark)

Forchhammer, Søren

2002-01-01

Upper and lower bounds are presented for the capacity of weakly constrained two-dimensional codes. The maximum entropy is calculated for two simple models of 2-D codes constraining the probability of neighboring 1s as an example. For given models of the coded data, upper and lower bounds...... on the capacity for 2-D channel models based on occurrences of neighboring 1s are considered....

Weak radiative decays of the B meson and bounds on M{sub H}± in the Two-Higgs-Doublet Model

Energy Technology Data Exchange (ETDEWEB)

Misiak, Mikolaj [University of Warsaw, Faculty of Physics, Institute of Theoretical Physics, Warsaw (Poland); CERN, Theoretical Physics Department, Geneva 23 (Switzerland); Steinhauser, Matthias [Karlsruhe Institute of Technology (KIT), Institut fuer Theoretische Teilchenphysik, Karlsruhe (Germany)

2017-03-15

In a recent publication (Abdesselam et al. arXiv:1608.02344), the Belle collaboration updated their analysis of the inclusive weak radiative B-meson decay, including the full dataset of (772 ± 11) x 10{sup 6} B anti B pairs. Their result for the branching ratio is now below the Standard Model prediction (Misiak et al. Phys Rev Lett 114:221801, 2015, Czakon et al. JHEP 1504:168, 2015), though it remains consistent with it. However, bounds on the charged Higgs boson mass in the Two-Higgs-Doublet Model get affected in a significant manner. In the so-called Model II, the 95% C.L. lower bound on M{sub H}± is now in the 570-800 GeV range, depending quite sensitively on the method applied for its determination. Our present note is devoted to presenting and discussing the updated bounds, as well as to clarifying several ambiguities that one might encounter in evaluating them. One of such ambiguities stems from the photon energy cutoff choice, which deserves re-consideration in view of the improved experimental accuracy. (orig.)

Can i just check...? Effects of edit check questions on measurement error and survey estimates

NARCIS (Netherlands)

Lugtig, Peter; Jäckle, Annette

2014-01-01

Household income is difficult to measure, since it requires the collection of information about all potential income sources for each member of a household.Weassess the effects of two types of edit check questions on measurement error and survey estimates: within-wave edit checks use responses to

Bounds on quantum confinement effects in metal nanoparticles

Science.gov (United States)

Blackman, G. Neal; Genov, Dentcho A.

2018-03-01

Quantum size effects on the permittivity of metal nanoparticles are investigated using the quantum box model. Explicit upper and lower bounds are derived for the permittivity and relaxation rates due to quantum confinement effects. These bounds are verified numerically, and the size dependence and frequency dependence of the empirical Drude size parameter is extracted from the model. Results suggest that the common practice of empirically modifying the dielectric function can lead to inaccurate predictions for highly uniform distributions of finite-sized particles.

Scram system with continuos check

International Nuclear Information System (INIS)

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

Virial Expansion Bounds

Science.gov (United States)

Tate, Stephen James

2013-10-01

In the 1960s, the technique of using cluster expansion bounds in order to achieve bounds on the virial expansion was developed by Lebowitz and Penrose (J. Math. Phys. 5:841, 1964) and Ruelle (Statistical Mechanics: Rigorous Results. Benjamin, Elmsford, 1969). This technique is generalised to more recent cluster expansion bounds by Poghosyan and Ueltschi (J. Math. Phys. 50:053509, 2009), which are related to the work of Procacci (J. Stat. Phys. 129:171, 2007) and the tree-graph identity, detailed by Brydges (Phénomènes Critiques, Systèmes Aléatoires, Théories de Jauge. Les Houches 1984, pp. 129-183, 1986). The bounds achieved by Lebowitz and Penrose can also be sharpened by doing the actual optimisation and achieving expressions in terms of the Lambert W-function. The different bound from the cluster expansion shows some improvements for bounds on the convergence of the virial expansion in the case of positive potentials, which are allowed to have a hard core.

Detecting and (not) dealing with plagiarism in an engineering paper: beyond CrossCheck-a case study.

Science.gov (United States)

Zhang, Xin-xin; Huo, Zhao-lin; Zhang, Yue-hong

2014-06-01

In papers in areas such as engineering and the physical sciences, figures, tables and formulae are the basic elements to communicate the authors' core ideas, workings and results. As a computational text-matching tool, CrossCheck cannot work on these non-textual elements to detect plagiarism. Consequently, when comparing engineering or physical sciences papers, CrossCheck may return a low similarity index even when plagiarism has in fact taken place. A case of demonstrated plagiarism involving engineering papers with a low similarity index is discussed, and editor's experiences and suggestions are given on how to tackle this problem. The case shows a lack of understanding of plagiarism by some authors or editors, and illustrates the difficulty of getting some editors and publishers to take appropriate action. Consequently, authors, journal editors, and reviewers, as well as research institutions all are duty-bound not only to recognize the differences between ethical and unethical behavior in order to protect a healthy research environment, and also to maintain consistent ethical publishing standards.

Operational workforce planning for check-in counters at airports

DEFF Research Database (Denmark)

Stolletz, Raik

2010-01-01

This paper addresses operation models for workforce planning for check-in systems at airports. We characterize different tasks of the hierarchical workforce planning problem with time-dependent demand. A binary linear programming formulation is developed for the fortnightly tour scheduling problem...

Large Eddy Simulation of Wall-Bounded Turbulent Flows with the Lattice Boltzmann Method: Effect of Collision Model, SGS Model and Grid Resolution

Science.gov (United States)

Pradhan, Aniruddhe; Akhavan, Rayhaneh

2017-11-01

Effect of collision model, subgrid-scale model and grid resolution in Large Eddy Simulation (LES) of wall-bounded turbulent flows with the Lattice Boltzmann Method (LBM) is investigated in turbulent channel flow. The Single Relaxation Time (SRT) collision model is found to be more accurate than Multi-Relaxation Time (MRT) collision model in well-resolved LES. Accurate LES requires grid resolutions of Δ+ LBM requires either grid-embedding in the near-wall region, with grid resolutions comparable to DNS, or a wall model. Results of LES with grid-embedding and wall models will be discussed.

Bounded Memory, Inertia, Sampling and Weighting Model for Market Entry Games

Directory of Open Access Journals (Sweden)

Yi-Shan Lee

2011-03-01

Full Text Available This paper describes the “Bounded Memory, Inertia, Sampling and Weighting” (BI-SAW model, which won the http://sites.google.com/site/gpredcomp/Market Entry Prediction Competition in 2010. The BI-SAW model refines the I-SAW Model (Erev et al. [1] by adding the assumption of limited memory span. In particular, we assume when players draw a small sample to weight against the average payoff of all past experience, they can only recall 6 trials of past experience. On the other hand, we keep all other key features of the I-SAW model: (1 Reliance on a small sample of past experiences, (2 Strong inertia and recency effects, and (3 Surprise triggers change. We estimate this model using the first set of experimental results run by the competition organizers, and use it to predict results of a second set of similar experiments later ran by the organizers. We find significant improvement in out-of-sample predictability (against the I-SAW model in terms of smaller mean normalized MSD, and such result is robust to resampling the predicted game set and reversing the role of the sets of experimental results. Our model’s performance is the best among all the participants.

Lower Bounds to the Reliabilities of Factor Score Estimators.

Science.gov (United States)

Hessen, David J

2016-10-06

Under the general common factor model, the reliabilities of factor score estimators might be of more interest than the reliability of the total score (the unweighted sum of item scores). In this paper, lower bounds to the reliabilities of Thurstone's factor score estimators, Bartlett's factor score estimators, and McDonald's factor score estimators are derived and conditions are given under which these lower bounds are equal. The relative performance of the derived lower bounds is studied using classic example data sets. The results show that estimates of the lower bounds to the reliabilities of Thurstone's factor score estimators are greater than or equal to the estimates of the lower bounds to the reliabilities of Bartlett's and McDonald's factor score estimators.

31 CFR 248.6 - Recovery of original check.

Science.gov (United States)

2010-07-01

... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Recovery of original check. 248.6... § 248.6 Recovery of original check. (a) If the claimant recovers an original check after he has... or agency concerned regarding the negotiability of such original check. (b) In the event the...

Comparing two reliability upper bounds for multistate systems

International Nuclear Information System (INIS)

Meng, Fan C.

2005-01-01

The path-cut reliability bound due to Esary and Proschan [J. Am. Stat. Assoc. 65 (1970) 329] and the minimax reliability bound due to Barlow and Proschan [Statistical Theory of Reliability and Life Testing: Probability Models, 1981] for binary systems have been generalized to multistate systems by Block and Savits [J. Appl. Probab. 19 (1982) 391]. Some comparison results concerning the two multistate lower bounds for various types of multistate systems are given by Meng [Probab. Eng. Inform. Sci. 16 (2002) 485]. In this note we compare the two multistate upper bounds and present results which generalize some previous ones obtained by Maymin [J. Stat. Plan. Inference 16 (1987) 337] for binary systems. Examples are given to illustrate our results

CMM Interim Check (U)

Energy Technology Data Exchange (ETDEWEB)

Montano, Joshua Daniel [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)