Institute of Scientific and Technical Information of China (English)
Zhi-Hong Tao; Cong-Hua Zhou; Zhong Chen; Li-Fu Wang
2007-01-01
Bounded Model Checking has been recently introduced as an efficient verification method for reactive systems.This technique reduces model checking of linear temporal logic to propositional satisfiability.In this paper we first present how quantified Boolean decision procedures can replace BDDs.We introduce a bounded model checking procedure for temporal logic CTL* which reduces model checking to the satisfiability of quantified Boolean formulas.Our new technique avoids the space blow up of BDDs, and extends the concept of bounded model checking.
A PSL Bounded Model Checking Method
Institute of Scientific and Technical Information of China (English)
YU Lei; ZHAO Zongtao
2012-01-01
SAT-based bounded model checking （BMC） is introduced as an important complementary technique to OBDD-based symbolic model checking, and is an efficient verification method for parallel and reactive systems. However, until now the properties verified by bounded model checking are very finite. Temporal logic PSL is a property specification language （IEEE-1850） describing parallel systems and is divided into two parts, i.e. the linear time logic FL and the branch time logic OBE. In this paper, the specification checked by BMC is extended to PSL and its algorithm is also proposed. Firstly, define the bounded semantics of PSL, and then reduce the bounded semantics into SAT by translating PSL specification formula and the state transition relation of the system to the propositional formula A and B, respectively. Finally, verify the satisfiability of the conjunction propositional formula of A and B. The algorithm results in the translation of the existential model checking of the temporal logic PSL into the satisfiability problem of propositional formula. An example of a queue controlling circuit is used to interpret detailedly the executing procedure of the algorithm.
A Metric Encoding for Bounded Model Checking
Pradella, Matteo; Morzenti, Angelo; San Pietro, Pierluigi
In Bounded Model Checking, both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative future and past metric temporal operators, typically found in properties of hard real time systems. The encoding is simple and intuitive in principle, but it is made more complex by the presence, typical of the Bounded Model Checking technique, of backward and forward loops used to represent an ultimately periodic infinite domain by a finite structure. We report and comment on the new encoding technique and on an extensive set of experiments carried out to assess its feasibility and effectiveness.
A Metric Encoding for Bounded Model Checking (extended version)
Pradella, Matteo; Pietro, Pierluigi San
2009-01-01
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique which is particularly optimized for managing quantitative future and past metric temporal operators, typically found in properties of hard real time systems. The encoding is simple and intuitive in principle, but it is made more complex by the presence, typical of the Bounded Model Checking technique, of backward and forward loops used to represent an ultimately periodic infinite domain by a finite structure. We report and comment on the new encoding technique and on an extensive set of experiments carried out to assess its feasibility and effectiveness.
Improved Bounded Model Checking for the Universal Fragment of CTL
Institute of Scientific and Technical Information of China (English)
Liang Xu; Wei Chen; Yan-Yan Xu; Wen-Hui Zhang
2009-01-01
SAT-based bounded model checking (BMC) has been introduced as a complementary technique to BDD-based symbolic model checking in recent years, and a lot of successful work has been done in this direction. The approach was first introduced by A. Biere et al. in checking linear temporal logic (LTL) formulae and then also adapted to check formulae of the universal fragment of computation tree logic (ACTL) by W. Penczek et al. As the efficiency of model checking is still an important issue, we present an improved BMC approach for ACTL based on Penczek's method. We consider two aspects of the approach. One is reduction of the number of variables and transitions in the k-model by distinguishing the temporal operator EX from the others. The other is simplification of the transformation of formulae by using uniform path encoding instead of a disjunction of all paths needed in the k-model. With these improvements, for an ACTI, formula, the length of the final encoding of the formula in the worst case is reduced. The improved approach is implemented in the tool BMV and is compared with the original one by applying both to two well known examples, mutual exclusion and dining philosophers. The comparison shows the advantages of the improved approach with respect to the efficiency of model checking.
Correctness of Sensor Network Applications by Software Bounded Model Checking
Werner, Frank; Faragó, David
We investigate the application of the software bounded model checking tool CBMC to the domain of wireless sensor networks (WSNs). We automatically generate a software behavior model from a network protocol (ESAWN) implementation in a WSN development and deployment platform (TinyOS), which is used to rigorously verify the protocol. Our work is a proof of concept that automatic verification of programs of practical size (≈ 21 000 LoC) and complexity is possible with CBMC and can be integrated into TinyOS. The developer can automatically check for pointer dereference and array index out of bound errors. She can also check additional, e.g., functional, properties that she provides by assume- and assert-statements. This experience paper shows that our approach is in general feasible since we managed to verify about half of the properties. We made the verification process scalable in the size of the code by abstraction (eg, from hardware) and by simplification heuristics. The latter also achieved scalability in data type complexity for the properties that were verifiable. The others require technical advancements for complex data types within CBMC's core.
SMT-based Bounded Model Checking with Difference Logic Constraints
Bersani, Marcello M; Morzenti, Angelo; Pradella, Matteo; Rossi, Matteo; Pietro, Pierluigi San
2010-01-01
Traditional Bounded Model Checking (BMC) is based on translating the model checking problem into SAT, the Boolean satisfiability problem. This paper introduces an encoding of Linear Temporal Logic with Past operators (PLTL) into the Quantifier-Free Difference Logic with Uninterpreted Functions (QF-UFIDL). The resulting encoding is a simpler and more concise version of existing SATbased encodings, currently used in BMC. In addition, we present an extension of PLTL augmented with arithmetic relations over integers, which can express unbounded counters; as such, the extended logic is more expressive than PLTL. We introduce suitable restrictions and assumptions that are shown to make the verification problem for the extended logic decidable, and we define an encoding of the new logic into QF-UFIDL. Finally, a performance comparison with the SAT-based approach on purely PLTL examples shows significant improvements in terms of both execution time and memory occupation.
Tarmo: A Framework for Parallelized Bounded Model Checking
Wieringa, Siert; Heljanko, Keijo; 10.4204/EPTCS.14.5
2009-01-01
This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo. Our framework can be used with any incremental SAT encoding for BMC but for the results in this paper we use only the current state-of-the-art encoding for full PLTL. Using this encoding allows us to check both safety and liveness properties, contrary to an earlier work on distributing BMC that is limited to safety properties only. Despite our focus on BMC after it has been translated to SAT, existing distributed SAT solvers are not well suited for our application. This is because solving a BMC problem is not solving a set of independent SAT instances but rather involves solving multiple related SAT instances, encoded incrementally, where the satisfiability of each instance corresponds to the existence of a counterexample of a specific length. Our framework includes a generic architecture for a ...
Tarmo: A Framework for Parallelized Bounded Model Checking
Directory of Open Access Journals (Sweden)
Siert Wieringa
2009-12-01
Full Text Available This paper investigates approaches to parallelizing Bounded Model Checking (BMC for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo. Our framework can be used with any incremental SAT encoding for BMC but for the results in this paper we use only the current state-of-the-art encoding for full PLTL. Using this encoding allows us to check both safety and liveness properties, contrary to an earlier work on distributing BMC that is limited to safety properties only. Despite our focus on BMC after it has been translated to SAT, existing distributed SAT solvers are not well suited for our application. This is because solving a BMC problem is not solving a set of independent SAT instances but rather involves solving multiple related SAT instances, encoded incrementally, where the satisfiability of each instance corresponds to the existence of a counterexample of a specific length. Our framework includes a generic architecture for a shared clause database that allows easy clause sharing between SAT solver threads solving various such instances. We present extensive experimental results obtained with multiple variants of our Tarmo implementation. Our shared memory variants have a significantly better performance than conventional single threaded approaches, which is a result that many users can benefit from as multi-core and multi-processor technology is widely available. Furthermore we demonstrate that our framework can be deployed in a typical cluster of workstations, where several multi-core machines are connected by a network.
Checking RTECTL properties of STSs via SMT-based Bounded Model Checking
Directory of Open Access Journals (Sweden)
Agnieszka Zbrzezny
2015-12-01
Full Text Available We present an SMT-based bounded model checking (BMC method for Simply-Timed Systems (STSs and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method for the same systems and the same property language on several benchmarks for STSs. For the SAT- based BMC we used the PicoSAT solver and for the SMT-based BMC we used the Z3 solver. The experimental results show that the SMT-based BMC performs quite well and is, in fact, sometimes significantly faster than the tested SAT-based BMC.
Applied Bounded Model Checking for Interlocking System Designs
DEFF Research Database (Denmark)
Haxthausen, Anne Elisabeth; Peleska, Jan; Pinger, Ralf
2013-01-01
of behavioural (operational) semantics. The former checks that the plant model – that is, the software components reflecting the physical components of the interlocking system – has been set up in an adequate way. The latter investigates trains moving through the network, with the objective to uncover potential...
Applied Bounded Model Checking for Interlocking System Designs
DEFF Research Database (Denmark)
Haxthausen, Anne Elisabeth; Peleska, Jan; Pinger, Ralf
2014-01-01
of behavioural (operational) semantics. The former checks that the plant model – that is, the software components reflecting the physical components of the interlocking system – has been set up in an adequate way. The latter investigates trains moving through the network, with the objective to uncover potential...
Efficient Proof Engines for Bounded Model Checking of Hybrid Systems
DEFF Research Database (Denmark)
Fränzle, Martin; Herde, Christian
2005-01-01
In this paper we present HySat, a new bounded model checker for linear hybrid systems, incorporating a tight integration of a DPLL-based pseudo-Boolean SAT solver and a linear programming routine as core engine. In contrast to related tools like MathSAT, ICS, or CVC, our tool exploits all...
Bounded Model Checking and Inductive Verification of Hybrid Discrete-Continuous Systems
DEFF Research Database (Denmark)
Becker, Bernd; Behle, Markus; Eisenbrand, Fritz;
2004-01-01
We present a concept to signicantly advance the state of the art for bounded model checking (BMC) and inductive verication (IV) of hybrid discrete-continuous systems. Our approach combines the expertise of partners coming from dierent domains, like hybrid systems modeling and digital circuit...... verication, bounded plan- ning and heuristic search, combinatorial optimization and integer programming. Af- ter sketching the overall verication ow we present rst results indicating that the combination and tight integration of dierent verication engines is a rst step to pave the way to fully automated BMC...
Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N
2015-01-01
Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.
Institute of Scientific and Technical Information of China (English)
Wanwei LIU; Ji WANG; Huowang CHEN; Xiaodong MA; Zhaofei WANG
2009-01-01
Property specification language (PSL) is a specification language which has been accepted as an industrial standard. In PSL, SEREs are used as additional formula constructs. In this paper, we present a variant of PSL, namely APSL, which replaces SEREs with finite automata. APSL and PSL are of the exactly same expressiveness. Then, we extend the LTL symbolic model checking algorithm to that of APSL, and then present a tableau based APSL verification technique, which can be easily implemented via the BDD based symbolic approach. Moreover, we implement an extension of NuSMV, and this adapted version supports symbolic model checking of APSL. Experimental results show that this variant of PSL can be efficiently verified. Henceforth, symbolic model checking PSL can be carried out by a transformation from PSL to APSL and symbolic model checking APSL.
DEFF Research Database (Denmark)
Andersen, Henrik Reif
1995-01-01
A major obstacle in applying finite-state model checking to the verification of large systems is the combinatorial explosion of the state space arising when many loosely coupled parallel processes are considered. The problem also known as the state-explosion problem has been attacked from various...... sides. This paper presents a new approach based on partial model checking where parts of the concurrent system are gradually removed while transforming the specification accordingly. When the intermediate specifications constructed in this manner can be kept small, the state-explosion problem is avoided...
Model composition in model checking
Felscher, Ingo
2014-01-01
Model-checking allows one to formally check properties of systems: these properties are modeled as logic formulas and the systems as structures like transition systems. These transition systems are often composed, i.e., they arise in form of products or sums. The composition technique allows us to deduce the truth of a formula in the composed system from "interface information": the truth of formulas for the component systems and information in which components which of these formulas hold. W...
Model Checking as Static Analysis
DEFF Research Database (Denmark)
Zhang, Fuyuan
Both model checking and static analysis are prominent approaches to detecting software errors. Model Checking is a successful formal method for verifying properties specified in temporal logics with respect to transition systems. Static analysis is also a powerful method for validating program...... properties which can predict safe approximations to program behaviors. In this thesis, we have developed several static analysis based techniques to solve model checking problems, aiming at showing the link between static analysis and model checking. We focus on logical approaches to static analysis......-calculus can be encoded as the intended model of SFP. Our research results have strengthened the link between model checking and static analysis. This provides a theoretical foundation for developing a unied tool for both model checking and static analysis techniques....
The Complexity of Model Checking Higher-Order Fixpoint Logic
DEFF Research Database (Denmark)
Axelsson, Roland; Lange, Martin; Somla, Rafal
2007-01-01
provides complexity results for its model checking problem. In particular we consider its fragments HFLk,m which are formed using types of bounded order k and arity m only. We establish k-ExpTime-completeness for model checking each HFLk,m fragment. For the upper bound we reduce the problem to the problem...
Checking Model Transformation Refinement
Büttner, Fabian; Egea, Marina; Guerra, Esther; Lara, Juan De
2013-01-01
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-38883-5_15 Proceedings of 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013 Refinement is a central notion in computer science, meaning that some artefact S can be safely replaced by a refinement R, which preserves S’s properties. Having available techniques and tools to check transformation refinement would enable (a) the reasoning on whether a transformation correctly impl...
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...
Model checking PSL safety properties
Launiainen, Tuomas
2009-01-01
Model checking is a modern, efficient approach to gaining confidence of the correctness of complex systems. It outperforms conventional testing methods especially in cases where a high degree of confidence in the correctness of the system is required, or when the test runs of the system are difficult to reproduce accurately. In model checking the system is verified against a specification that is expressed in a formal specification language. The main challenges are that the process requires q...
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...
Jansen, D.N.
2002-01-01
The logic ATCTL is a convenient logic to specify properties with actions and real-time. It is intended as a property language for Lightweight UML models [12], which consist mainly of simplified class diagrams and statecharts. ATCTL combines two known extensions of CTL, namely ACTL and TCTL. The reas
Direct Model Checking Matrix Algorithm
Institute of Scientific and Technical Information of China (English)
Zhi-Hong Tao; Hans Kleine Büning; Li-Fu Wang
2006-01-01
During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking technique has the edge over all others in all application areas. So, it is very difficult to determine which technique is the most suitable for a given model. It is thus sensible to apply different techniques to the same model. However, this is a very tedious and time-consuming task, for each algorithm uses its own description language. Applying Model Checking in software design and verification has been proved very difficult. Software architectures (SA) are engineering artifacts that provide high-level and abstract descriptions of complex software systems. In this paper a Direct Model Checking (DMC) method based on Kripke Structure and Matrix Algorithm is provided. Combined and integrated with domain specific software architecture description languages (ADLs), DMC can be used for computing consistency and other critical properties.
Model Checking Linearizability via Refinement
Liu, Yang; Chen, Wei; Liu, Yanhong A.; Sun, Jun
Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires checking that 1) all executions of concurrent operations be serializable, and 2) the serialized executions be correct with respect to the sequential semantics. This paper describes a new method to automatically check linearizability based on refinement relations from abstract specifications to concrete implementations. Our method avoids the often difficult task of determining linearization points in implementations, but can also take advantage of linearization points if they are given. The method exploits model checking of finite state systems specified as concurrent processes with shared variables. Partial order reduction is used to effectively reduce the search space. The approach is built into a toolset that supports a rich set of concurrent operators. The tool has been used to automatically check a variety of implementations of concurrent objects, including the first algorithms for the mailbox problem and scalable NonZero indicators. Our system was able to find all known and injected bugs in these implementations.
Institute of Scientific and Technical Information of China (English)
刘怡文; 李伟琴
2002-01-01
Strand Spaces serve as a model of security protocol analysis. In this paper, the main characteristics of Strand Spaces are briefly introduced, and its advantages and disadvantages are presented . An algorithm of building an ideal model of a protocol is proposed, which is used to bound both the abilities of the penetrator and the number of concurrent protocol runs. Combining Model Checking and Strand Spaces, a method is proposed to use both the automatic reasoning mechanism of the Model Checking and the bounds on security protocol analysis to achieve effective analysis of security protocols, avoiding state explosion problems.%Strand Spaces是一种用于分析安全协议的机器证明方法.简要介绍了Strand Spaces的基本特点,分析了其优劣,提出了构造协议的理想子环的算法,并以此来约束协议入侵者的能力和协议并行运行的次数.将模型检查与Strand Spaces结合在一起,提出了一种综合分析方法来验证协议的安全特性,该方法可充分发挥模型检查与Strand Spaces二者的优势.
Compositional and Quantitative Model Checking
DEFF Research Database (Denmark)
Larsen, Kim Guldstrand
2010-01-01
on the existence of a quotient construction, allowing a property phi of a parallel system phi/A to be transformed into a sufficient and necessary quotient-property yolA to be satisfied by the component 13. Given a model checking problem involving a network Pi I and a property yo, the method gradually move (by...
Bounding species distribution models
Institute of Scientific and Technical Information of China (English)
Thomas J. STOHLGREN; Catherine S. JARNEVICH; Wayne E. ESAIAS; Jeffrey T. MORISETTE
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].
From model checking to model measuring
Henzinger, Thomas A.; Otop, Jan
2013-01-01
We define the model-measuring problem: given a model $M$ and specification~$\\varphi$, what is the maximal distance $\\rho$ such that all models $M'$ within distance $\\rho$ from $M$ satisfy (or violate)~$\\varphi$. The model measuring problem presupposes a distance function on models. We concentrate on automatic distance functions, which are defined by weighted automata. The model-measuring problem subsumes several generalizations of the classical model-checking problem, in particular, qu...
Heteroscedasticity checks for regression models
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
For checking on heteroscedasticity in regression models, a unified approach is proposed to constructing test statistics in parametric and nonparametric regression models. For nonparametric regression, the test is not affected sensitively by the choice of smoothing parameters which are involved in estimation of the nonparametric regression function. The limiting null distribution of the test statistic remains the same in a wide range of the smoothing parameters. When the covariate is one-dimensional, the tests are, under some conditions, asymptotically distribution-free. In the high-dimensional cases, the validity of bootstrap approximations is investigated. It is shown that a variant of the wild bootstrap is consistent while the classical bootstrap is not in the general case, but is applicable if some extra assumption on conditional variance of the squared error is imposed. A simulation study is performed to provide evidence of how the tests work and compare with tests that have appeared in the literature. The approach may readily be extended to handle partial linear, and linear autoregressive models.
Heteroscedasticity checks for regression models
Institute of Scientific and Technical Information of China (English)
ZHU; Lixing
2001-01-01
［1］Carroll, R. J., Ruppert, D., Transformation and Weighting in Regression, New York: Chapman and Hall, 1988.［2］Cook, R. D., Weisberg, S., Diagnostics for heteroscedasticity in regression, Biometrika, 1988, 70: 1—10.［3］Davidian, M., Carroll, R. J., Variance function estimation, J. Amer. Statist. Assoc., 1987, 82: 1079—1091.［4］Bickel, P., Using residuals robustly I: Tests for heteroscedasticity, Ann. Statist., 1978, 6: 266—291.［5］Carroll, R. J., Ruppert, D., On robust tests for heteroscedasticity, Ann. Statist., 1981, 9: 205—209.［6］Eubank, R. L., Thomas, W., Detecting heteroscedasticity in nonparametric regression, J. Roy. Statist. Soc., Ser. B, 1993, 55: 145—155.［7］Diblasi, A., Bowman, A., Testing for constant variance in a linear model, Statist. and Probab. Letters, 1997, 33: 95—103.［8］Dette, H., Munk, A., Testing heteoscedasticity in nonparametric regression, J. R. Statist. Soc. B, 1998, 60: 693—708.［9］Müller, H. G., Zhao, P. L., On a semi-parametric variance function model and a test for heteroscedasticity, Ann. Statist., 1995, 23: 946—967.［10］Stute, W., Manteiga, G., Quindimil, M. P., Bootstrap approximations in model checks for regression, J. Amer. Statist. Asso., 1998, 93: 141—149.［11］Stute, W., Thies, G., Zhu, L. X., Model checks for regression: An innovation approach, Ann. Statist., 1998, 26: 1916—1939.［12］Shorack, G. R., Wellner, J. A., Empirical Processes with Applications to Statistics, New York: Wiley, 1986.［13］Efron, B., Bootstrap methods: Another look at the jackknife, Ann. Statist., 1979, 7: 1—26.［14］Wu, C. F. J., Jackknife, bootstrap and other re-sampling methods in regression analysis, Ann. Statist., 1986, 14: 1261—1295.［15］H rdle, W., Mammen, E., Comparing non-parametric versus parametric regression fits, Ann. Statist., 1993, 21: 1926—1947.［16］Liu, R. Y., Bootstrap procedures under some non-i.i.d. models, Ann. Statist., 1988, 16: 1696—1708.［17
C/C ++program memory leak detection based on bounded model checking%基于有界模型检测的C/C＋＋程序内存泄露检测
Institute of Scientific and Technical Information of China (English)
黄蔚; 洪玫; 杨秋辉; 郭鑫宇; 代声馨; 徐保平; 高婉玲; 赵鹤
2016-01-01
The dynamic memory management mechanism in C /C ++programming language is free and flexible,but when used by developer it is easy to introduce memory leaks which lead to performance degradation and even failure of system.In order to detect memory leak more effectively,this paper proposed a memory leak detection method based on bounded model checking for C program called MLD-CBMC.It took C /C ++program files as input,unwound the program and inserted memory leak proper-ties,encoded the program constraints and properties into verification conditions using satisfiability modulo theory,then passed the verification conditions to a SMT solver.Thus it converted detecting memory leaks to solving satisfiability problems.By ex-periment and cooperation with other bounded model checking tools,MLD-CBMC shows its feasibility and effectiveness.%C ／C ＋＋语言中的动态内存管理机制自由且灵活，但动态内存的使用容易引入内存泄露，导致系统性能降低甚至系统崩溃。为了更加有效地检测内存泄露，提出了一个基于有界模型检测技术的 C ／C ＋＋程序内存泄露检测方案 MLD-CBMC。该方案以 C ／C ＋＋程序文件为输入，利用有界模型检测技术对程序进行展开处理，加入内存泄露性质，并利用可满足性模理论（SMT）对程序约束和性质组成的验证条件编码，使用 SMT 求解器对验证条件求解，将检测内存泄露问题转换为求解可满足性问题，实现 C ／C ＋＋程序内存泄露的检测。通过实验验证了方案的有效性，并与其他有界模型检测工具进行对比实验，实验证明方案对内存泄露的检测能力更强。
Model Checking Is Static Analysis of Modal Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
2010-01-01
Flow Logic is an approach to the static analysis of programs that has been developed for functional, imperative and object-oriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it; to deal with modal logics and prove...... that it can give an exact characterisation of the semantics of formulae in a modal logic. This shows that model checking can be performed by means of state-of-the-art approaches to static analysis and allow us to conclude that the problems of model checking and static analysis are reducible to each other....... In terms of computational complexity we show that model checking by means of static analysis gives the same complexity bounds as are known for traditional approaches to model checking....
Model Checking Timed Automata with Priorities using DBM Subtraction
DEFF Research Database (Denmark)
David, Alexandre; Larsen, Kim Guldstrand; Pettersson, Paul;
2006-01-01
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result in...
The model checking fingerprints of CTL operators
Krebs, Andreas; Meier, Arne; Mundhenk, Martin
2015-01-01
The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking.
Model Checking of Boolean Process Models
Schneider, Christoph
2011-01-01
In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to model explicitly states with a subsequent skipping of activations and arbitrary logical rules of type AND, XOR, OR etc. to model the split and join of the control flow. We apply model checking as a verification method for the safeness and liveness of Boolean systems. Model checking of Boolean systems uses the elementary theory of propositional logic, no modal operators are needed. Our verification builds on a finite complete prefix of a certain T-system attached to the Boolean system. It splits the processes of the Boolean sy...
Engineering Abstractions in Model Checking and Testing
Achenbach, Michael; Ostermann, Klaus
2009-01-01
Abstractions are used in model checking to tackle problems like state space explosion or modeling of IO. The application of these abstractions in real software development processes, however, lacks engineering support. This is one reason why model checking is not widely used in practice yet and testing is still state of the art in falsification. We show how user-defined abstractions can be integrated into a Java PathFinder setting with tools like AspectJ or Javassist and discuss implicati...
Model Checking Discounted Temporal Properties
Alfaro, de Luca; Faella, Marco; Henzinger, Thomas A.; Majumdar, Rupak; Stoelinga, Mariëlle
2004-01-01
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We
Model Checking Discounted Temporal Properties
Alfaro, de Luca; Faella, Marco; Henzinger, Thomas A.; Majumdar, Rupak; Stoelinga, Mariëlle
2005-01-01
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We
Graded CTL Model Checking for Test Generation
Napoli, Margherita
2011-01-01
Recently there has been a great attention from the scientific community towards the use of the model-checking technique as a tool for test generation in the simulation field. This paper aims to provide a useful mean to get more insights along these lines. By applying recent results in the field of graded temporal logics, we present a new efficient model-checking algorithm for Hierarchical Finite State Machines (HSM), a well established symbolism long and widely used for representing hierarchical models of discrete systems. Performing model-checking against specifications expressed using graded temporal logics has the peculiarity of returning more counterexamples within a unique run. We think that this can greatly improve the efficacy of automatically getting test cases. In particular we verify two different models of HSM against branching time temporal properties.
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...
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 coalitional games in shortage resource scenarios
Directory of Open Access Journals (Sweden)
Dario Della Monica
2013-07-01
Full Text Available Verification of multi-agents systems (MAS has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL, whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula to a semantic one (part of the model. This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions.
Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications
Erika Ábrahám; Peter Csaba Ölveczky; Daniela Lepri
2010-01-01
This paper presents a transformational approach for model checking two important classes of metric temporal logic (MTL) properties, namely, bounded response and minimum separation, for nonhierarchical object-oriented Real-Time Maude specifications. We prove the correctness of our model checking algorithms, which terminate under reasonable non-Zeno-ness assumptions when the reachable state space is finite. These new model checking features have been integrated into Real-Time Maude, and are use...
Explicit State Model Checking for Graph Grammars
Rensink, A.; De Nicola, R.; Degano, P.; Meseguer, J.
2008-01-01
In this paper we present the philosophy behind the GROOVE project, in which graph transformation is used as a modelling formalism on top of which a model checking approach to software verification is being built. We describe the basic formalism, the current state of the project, and (current and fut
A Game-Based Approach for PCTL* Stochastic Model Checking with Evidence
Institute of Scientific and Technical Information of China (English)
Yang Liu; Xuan-Dong Li; Yan Ma
2016-01-01
Stochastic model checking is a recent extension and generalization of the classical model checking, which focuses on quantitatively checking the temporal property of a system model. PCTL* is one of the important quantitative property specification languages, which is strictly more expressive than either PCTL (probabilistic computation tree logic) or LTL (linear temporal logic) with probability bounds. At present, PCTL* stochastic model checking algorithm is very complicated, and cannot provide any relevant explanation of why a formula does or does not hold in a given model. For dealing with this problem, an intuitive and succinct approach for PCTL* stochastic model checking with evidence is put forward in this paper, which includes: presenting the game semantics for PCTL* in release-PNF (release-positive normal form), defining the PCTL*stochastic model checking game, using strategy solving in game to achieve the PCTL*stochastic model checking, and refining winning strategy as the evidence to certify stochastic model checking result. The soundness and the completeness of game-based PCTL* stochastic model checking are proved, and its complexity matches the known lower and upper bounds. The game-based PCTL*stochastic model checking algorithm is implemented in a visual prototype tool, and its feasibility is demonstrated by an illustrative example.
Model Checking as Static Analysis: Revisited
DEFF Research Database (Denmark)
Zhang, Fuyuan; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
We show that the model checking problem of the μ-calculus can be viewed as an instance of static analysis. We propose Succinct Fixed Point Logic (SFP) within our logical approach to static analysis as an extension of Alternation-free Least Fixed Logic (ALFP). We generalize the notion...
Efficient CSL Model Checking Using Stratification
DEFF Research Database (Denmark)
Zhang, Lijun; Jansen, David N.; Nielson, Flemming;
2012-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 [ 1, 2]. Their proof can be turned into an approximation algorithm with worse than expone...
Using chemical organization theory for model checking
Kaleta, Christoph; Richter, Stephan; Dittrich, Peter
2009-01-01
Motivation: The increasing number and complexity of biomodels makes automatic procedures for checking the models' properties and quality necessary. Approaches like elementary mode analysis, flux balance analysis, deficiency analysis and chemical organization theory (OT) require only the stoichiometric structure of the reaction network for derivation of valuable information. In formalisms like Systems Biology Markup Language (SBML), however, information about the stoichiometric coefficients re...
Model Checking and Model-based Testing in the Railway Domain
DEFF Research Database (Denmark)
Haxthausen, Anne Elisabeth; Peleska, Jan
2015-01-01
This chapter describes some approaches and emerging trends for verification and model-based testing of railway control systems. We describe state-of-the-art methods and associated tools for verifying interlocking systems and their configuration data, using bounded model checking and k-induction. ...
Three Notes on the Complexity of Model Checking Fixpoint Logic with Chop
DEFF Research Database (Denmark)
Lange, Martin
2007-01-01
This paper provides lower complexity bounds of deterministic exponential time for the combined, data and expression complexity of Fixpoint Logic with Chop. This matches the previously known upper bound showing that its model checking problem is EXPTIME-complete, even when the transition system or...
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...
Howard, Y; Gravell, A; Ferreira, C; Augusto, J C
2011-01-01
Trace analysis can be a useful way to discover problems in a program under test. Rather than writing a special purpose trace analysis tool, this paper proposes that traces can usefully be analysed by checking them against a formal model using a standard model-checker or else an animator for executable specifications. These techniques are illustrated using a Travel Agent case study implemented in J2EE. We added trace beans to this code that write trace information to a database. The traces are then extracted and converted into a form suitable for analysis by Spin, a popular model-checker, and Pro-B, a model-checker and animator for the B notation. This illustrates the technique, and also the fact that such a system can have a variety of models, in different notations, that capture different features. These experiments have demonstrated that model-based trace-checking is feasible. Future work is focussed on scaling up the approach to larger systems by increasing the level of automation.
Model Checking over Paraconsistent Temporal Logic
Institute of Scientific and Technical Information of China (English)
CHEN Dong-huo; WANG Lin-zhang; CUI Jia-lin
2008-01-01
Classical logic cannot be used to effectively reason about concurrent systems with inconsistencies (inconsistencies often occur, especially in the early stage of the development, when large and complex concurrent systems are developed). In this paper, we propose the use of a guasi-classical temporal logic (QCTL) for supporting the verification of temporal properties of such systems even where the consistent model is not available. Our models are paraKripke structures ( extended standard Kripke structures), in which both a formula and its negation are satisfied in a same state, and properties to be verified are expressed by QCTL with paraKripke structures semantics. We introduce a novel notion of paraKripke models, which grasps the paraconsistent character of the entailment relation of QCTL. Furthermore, we explore the methodology of model checking over QCTL, and describe the detailed algorithm of implementing QCTL model checker. In the sequel, a simple example is presented, showing how to exploit the proposed model checking technique to verify the temporal properties of inconsistent concurrent systems.
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...... timed automata and most recently hybrid systems using the tool Uppaal SMC. In this paper we enable the application of SMC to complex biological systems, by combining Uppaal SMC with ANIMO, a plugin of the tool Cytoscape used by biologists, as well as with SimBiology®, a plugin of Matlab to simulate...
SAT-Based Model Checking without Unrolling
Bradley, Aaron R.
A new form of SAT-based symbolic model checking is described. Instead of unrolling the transition relation, it incrementally generates clauses that are inductive relative to (and augment) stepwise approximate reachability information. In this way, the algorithm gradually refines the property, eventually producing either an inductive strengthening of the property or a counterexample trace. Our experimental studies show that induction is a powerful tool for generalizing the unreachability of given error states: it can refine away many states at once, and it is effective at focusing the proof search on aspects of the transition system relevant to the property. Furthermore, the incremental structure of the algorithm lends itself to a parallel implementation.
Workflow Fault Tree Generation Through Model Checking
DEFF Research Database (Denmark)
Herbert, Luke Thomas; Sharp, Robin
2014-01-01
We present a framework for the automated generation of fault trees from models of realworld process workflows, expressed in a formalised subset of the popular Business Process Modelling and Notation (BPMN) language. To capture uncertainty and unreliability in workflows, we extend this formalism...... with probabilistic non-deterministic branching. We present an algorithm that allows for exhaustive generation of possible error states that could arise in execution of the model, where the generated error states allow for both fail-stop behaviour and continued system execution. We employ stochastic model checking...... to calculate the probabilities of reaching each non-error system state. Each generated error state is assigned a variable indicating its individual probability of occurrence. Our method can determine the probability of combined faults occurring, while accounting for the basic probabilistic structure...
Model Checking JAVA Programs Using Java Pathfinder
Havelund, Klaus; Pressburger, Thomas
2000-01-01
This paper describes a translator called JAVA PATHFINDER from JAVA to PROMELA, the "programming language" of the SPIN model checker. The purpose is to establish a framework for verification and debugging of JAVA programs based on model checking. This work should be seen in a broader attempt to make formal methods applicable "in the loop" of programming within NASA's areas such as space, aviation, and robotics. Our main goal is to create automated formal methods such that programmers themselves can apply these in their daily work (in the loop) without the need for specialists to manually reformulate a program into a different notation in order to analyze the program. This work is a continuation of an effort to formally verify, using SPIN, a multi-threaded operating system programmed in Lisp for the Deep-Space 1 spacecraft, and of previous work in applying existing model checkers and theorem provers to real applications.
Model Checking of Boolean Process Models
Schneider, Christoph; Wehler, Joachim
2011-01-01
In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to mode...
Probabilistic and hybrid model checking deployments for wireless sensor networks
International Nuclear Information System (INIS)
In the early stages of system development, model checking is a good practice for examining the WSNs (Wireless Sensor Networks). Model checking involves verifying a system's properties based on the system's finite state model. For varying applications like computers and wireless communication prior to expensive simulations, model checking has become a vital requirement in order to investigate the performance and reliability. In this paper for the first time, we are presenting probabilistic and hybrid model checking tools which are being implemented to analyse and verify the WSN applications and their examples. Here we are categorizing the model checking tools and presenting how they have been used for the investigation of various behaviours of WSN solutions. Consequently, this paper helps readers/researchers to choose the appropriate model checking tool and to get benefited in shape of validating their solutions. The paper has also highlighted the problems of existing model checking tools within WSN domain. (author)
Conformant Planning via Symbolic Model Checking
Cimatti, A; 10.1613/jair.774
2011-01-01
We tackle the problem of planning in nondeterministic domains, by presenting a new approach to conformant planning. Conformant planning is the problem of finding a sequence of actions that is guaranteed to achieve the goal despite the nondeterminism of the domain. Our approach is based on the representation of the planning domain as a finite state automaton. We use Symbolic Model Checking techniques, in particular Binary Decision Diagrams, to compactly represent and efficiently search the automaton. In this paper we make the following contributions. First, we present a general planning algorithm for conformant planning, which applies to fully nondeterministic domains, with uncertainty in the initial condition and in action effects. The algorithm is based on a breadth-first, backward search, and returns conformant plans of minimal length, if a solution to the planning problem exists, otherwise it terminates concluding that the problem admits no conformant solution. Second, we provide a symbolic representation ...
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 algorithms......, combined with BDDs and SAT-solvers to perform satisfiability checking. As a result we are able to model check systems for which standard BDD-based methods fail. For example, we model check a liveness property of a 256 bit shift-and-add multiplier and we are able to find a previously undetected bug...... in the specification of a 16 bit multiplier. As opposed to Bounded Model Checking (BMC) our method is complete in practice. Our technique is based on a quantification procedure that allows us to eliminate quantifiers in Quantified Boolean Formulas (QBF). The basic step of this procedure is the up-one operation...
Using Model Checking to Validate AI Planner Domain Models
Penix, John; Pecheur, Charles; Havelund, Klaus
1999-01-01
This report describes an investigation into using model checking to assist validation of domain models for the HSTS planner. The planner models are specified using a qualitative temporal interval logic with quantitative duration constraints. We conducted several experiments to translate the domain modeling language into the SMV, Spin and Murphi model checkers. This allowed a direct comparison of how the different systems would support specific types of validation tasks. The preliminary results indicate that model checking is useful for finding faults in models that may not be easily identified by generating test plans.
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...
Analyzing Interoperability of Protocols Using Model Checking
Institute of Scientific and Technical Information of China (English)
WUPeng
2005-01-01
In practical terms, protocol interoperability testing is still laborious and error-prone with little effect, even for those products that have passed conformance testing. Deadlock and unsymmetrical data communication are familiar in interoperability testing, and it is always very hard to trace their causes. The previous work has not provided a coherent way to analyze why the interoperability was broken among protocol implementations under test. In this paper, an alternative approach is presented to analyzing these problems from a viewpoint of implementation structures. Sequential and concurrent structures are both representative implementation structures, especially in event-driven development model. Our research mainly discusses the influence of sequential and concurrent structures on interoperability, with two instructive conclusions: (a) a sequential structure may lead to deadlock; (b) a concurrent structure may lead to unsymmetrical data communication. Therefore, implementation structures carry weight on interoperability, which may not gain much attention before. To some extent, they are decisive on the result of interoperability testing. Moreover, a concurrent structure with a sound task-scheduling strategy may contribute to the interoperability of a protocol implementation. Herein model checking technique is introduced into interoperability analysis for the first time. As the paper shows, it is an effective way to validate developers' selections on implementation structures or strategies.
Statistical Model Checking of Rich Models and Properties
DEFF Research Database (Denmark)
Poulsen, Danny Bøgsted
Software is in increasing fashion embedded within safety- and business critical processes of society. Errors in these embedded systems can lead to human casualties or severe monetary loss. Model checking technology has proven formal methods capable of finding and correcting errors in software...... 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....... However, software is approaching the boundary in terms of the complexity and size that model checking can handle. Furthermore, software systems are nowadays more frequently interacting with their environment hence accurately modelling such systems requires modelling the environment as well - resulting...
Checking for normality in linear mixed models
Institute of Scientific and Technical Information of China (English)
WU Ping; ZHU LiXing; FANG Yun
2012-01-01
Linear mixed models are popularly used to fit continuous longitudinal data,and the random effects are commonly assumed to have normal distribution.However,this assumption needs to be tested so that further analysis can be proceeded well.In this paper,we consider the Baringhaus-Henze-Epps-Pulley (BHEP) tests,which are based on an empirical characteristic function.Differing from their case,we consider the normality checking for the random effects which are unobservable and the test should be based on their predictors.The test is consistent against global alternatives,and is sensitive to the local alternatives converging to the null at a certain rate arbitrarily close to 1/(√)n where n is sample size.Furthermore,to overcome the problem that the limiting null distribution of the test is not tractable,we suggest a new method:use a conditional Monte Carlo test (CMCT) to approximate the null distribution,and then to simulate p-values.The test is compared with existing methods,the power is examined,and several examples are applied to illustrate the usefulness of our test in the analysis of longitudinal data.
Verifying Multi-Agent Systems via Unbounded Model Checking
Kacprzak, M.; Lomuscio, A.; Lasica, T.; Penczek, W.; Szreter, M.
2004-01-01
We present an approach to the problem of verification of epistemic properties in multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend the technique of unbounded model checking from a purely temporal setting to a temporal-epistemic one. In order to achieve this, we base our discussion on interpreted systems semantics, a popular semantics used in multi-agent systems literature. We give details of the technique and show how it can be applied to the well known train, gate and controller problem. Keywords: model checking, unbounded model checking, multi-agent systems
Efficient Checking of Individual Rewards Properties in Markov Population Models
Bortolussi, Luca; Hillston, Jane
2015-01-01
In recent years fluid approaches to the analysis of Markov populations models have been demonstrated to have great pragmatic value. Initially developed to estimate the behaviour of the system in terms of the expected values of population counts, the fluid approach has subsequently been extended to more sophisticated interrogations of models through its embedding within model checking procedures. In this paper we extend recent work on checking CSL properties of individual agents within a Marko...
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....
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 ...... partitions, and thereby limit the amount of disk access and network communication. We report on several experiments made with our verification platform ASAP that implements the dynamic partitioning scheme proposed in this paper....
A k-Bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems
DEFF Research Database (Denmark)
Lee, Jooyong; Deng, Xianghua; Bogor, Robby
2006-01-01
This paper presents Kiasan, a bounded technique to reason about open systems based on a path sensitive, relatively sound and complete symbolic execution instead of the usual compositional reasoning through weakest precondition calculation that summarizes all execution paths. Kiasan is able to che...
Model Checking-Based Testing of Web Applications
Institute of Scientific and Technical Information of China (English)
ZENG Hongwei; MIAO Huaikou
2007-01-01
A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagram as the object model is employed to describe the object structure of a Web application design and can be translated into the behavior model. A key problem of model checking-based test generation for a Web application is how to construct a set of trap properties that intend to cause the violations of model checking against the behavior model and output of counterexamples used to construct the test sequences.We give an algorithm that derives trap properties from the object model with respect to node and edge coverage criteria.
Learning Markov Decision Processes for Model Checking
Directory of Open Access Journals (Sweden)
Hua Mao
2012-12-01
Full Text Available Constructing an accurate system model for formal model verification can be both resource demanding and time-consuming. To alleviate this shortcoming, algorithms have been proposed for automatically learning system models based on observed system behaviors. In this paper we extend the algorithm on learning probabilistic automata to reactive systems, where the observed system behavior is in the form of alternating sequences of inputs and outputs. We propose an algorithm for automatically learning a deterministic labeled Markov decision process model from the observed behavior of a reactive system. The proposed learning algorithm is adapted from algorithms for learning deterministic probabilistic finite automata, and extended to include both probabilistic and nondeterministic transitions. The algorithm is empirically analyzed and evaluated by learning system models of slot machines. The evaluation is performed by analyzing the probabilistic linear temporal logic properties of the system as well as by analyzing the schedulers, in particular the optimal schedulers, induced by the learned models.
Learning Markov Decision Processes for Model Checking
DEFF Research Database (Denmark)
Mao, Hua; Chen, Yingke; Jaeger, Manfred;
2012-01-01
. The proposed learning algorithm is adapted from algorithms for learning deterministic probabilistic finite automata, and extended to include both probabilistic and nondeterministic transitions. The algorithm is empirically analyzed and evaluated by learning system models of slot machines. The evaluation......Constructing an accurate system model for formal model verification can be both resource demanding and time-consuming. To alleviate this shortcoming, algorithms have been proposed for automatically learning system models based on observed system behaviors. In this paper we extend the algorithm...... on learning probabilistic automata to reactive systems, where the observed system behavior is in the form of alternating sequences of inputs and outputs. We propose an algorithm for automatically learning a deterministic labeled Markov decision process model from the observed behavior of a reactive system...
Checking Flavour Models at Neutrino Facilities
Meloni, Davide
2013-01-01
In the recent years, the industry of model building has been the subject of the intense activity, especially after the measurement of a relatively large values of the reactor angle. Special attention has been devoted to the use of non-abelian discrete symmetries, thanks to their ability of reproducing some of the relevant features of the neutrino mixing matrix. In this paper, we consider two special relations between the leptonic mixing angles, arising from models based on S4 and A4, and study whether, and to which extent, they can be distinguished at superbeam facilities, namely T2K, NOvA and T2HK.
Checking flavour models at neutrino facilities
Energy Technology Data Exchange (ETDEWEB)
Meloni, Davide, E-mail: meloni@fis.uniroma3.it
2014-01-20
In the recent years, the industry of model building has been the subject of the intense activity, especially after the measurement of a relatively large values of the reactor angle. Special attention has been devoted to the use of non-abelian discrete symmetries, thanks to their ability of reproducing some of the relevant features of the neutrino mixing matrix. In this Letter, we consider two special relations between the leptonic mixing angles, arising from models based on S{sub 4} and A{sub 4}, and study whether, and to which extent, they can be distinguished at superbeam facilities, namely T2K, NOνA and T2HK.
Abstraction and Model Checking in the PEPA Plug-in for Eclipse
DEFF Research Database (Denmark)
Smith, Michael James Andrew
2010-01-01
The stochastic process algebra PEPA is a widely used language for performance modelling, and a large part of its success is due to the rich tool support that is available. As a compositional Markovian formalism, however, it suffers from the state space explosion problem, where even small models can...... lead to very large Markov chains. One way of analysing such models is to use abstraction - constructing a smaller model that bounds the properties of the original. We present an extension to the PEPA plug-in for Eclipse that enables abstracting and model checking of PEPA models. This implements two new...
Universality: Accurate Checks in Dyson's Hierarchical Model
Godina, J. J.; Meurice, Y.; Oktay, M. B.
2003-06-01
In this talk we present high-accuracy calculations of the susceptibility near βc for Dyson's hierarchical model in D = 3. Using linear fitting, we estimate the leading (γ) and subleading (Δ) exponents. Independent estimates are obtained by calculating the first two eigenvalues of the linearized renormalization group transformation. We found γ = 1.29914073 ± 10 -8 and, Δ = 0.4259469 ± 10-7 independently of the choice of local integration measure (Ising or Landau-Ginzburg). After a suitable rescaling, the approximate fixed points for a large class of local measure coincide accurately with a fixed point constructed by Koch and Wittwer.
Diagnostic checking for conditional heteroscedasticity models
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
We suggest the score type tests for goodness-of-fit of conditional heteroscedasticity models in both univariate and multivariate time series.The tests can detect the alternatives converging to the null at a parametric rate.Weight functions are involved in the construction of the tests,which provides us with the flexibility to choose scores,especially under directional alternatives,for enhancing power performance.Furthermore,when the alternatives are not directional,we construct asymptotically distribution-free maximin tests for a large class of alternatives.A possibility to construct score-based omnibus tests is discussed when the alternative is saturated.The power performance is also investigated.A simulation study is carried out and a real data is analyzed.
Distributed Maximality based CTL Model Checking
Directory of Open Access Journals (Sweden)
Djamel Eddine Saidouni
2010-05-01
Full Text Available In this paper we investigate an approach to perform a distributed CTL Model checker algorithm on a network of workstations using Kleen three value logic, the state spaces is partitioned among the network nodes, We represent the incomplete state spaces as a Maximality labeled Transition System MLTS which are able to express true concurrency. we execute in parallel the same algorithm in each node, for a certain property on an incomplete MLTS , this last compute the set of states which satisfy or which if they fail are assigned the value .The third value mean unknown whether true or false because the partial state space lacks sufficient information needed for a precise answer concerning the complete state space .To solve this problem each node exchange the information needed to conclude the result about the complete state space. The experimental version of the algorithm is currently being implemented using the functional programming language Erlang.
Model checking: one can do much more than you think!
Katoen, Joost-Pieter
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 othe
Towards Model Checking a Spi-Calculus Dialect
Gnesi, S.; Latella, D.; Lenzini, G.
2002-01-01
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 Dolev-
An Extended Ontology Model and Ontology Checking Based on Description Logics
Institute of Scientific and Technical Information of China (English)
王洪伟; 蒋馥; 吴家春
2004-01-01
Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.
Model checking conditional CSL for continuous-time Markov chains
DEFF Research Database (Denmark)
Gao, Yang; Xu, Ming; Zhan, Naijun;
2013-01-01
probabilistic operator. CCSL allows us to express a richer class of properties for CTMCs. Based on a parameterized product obtained from the CTMC and an automaton extracted from a given CCSL formula, we propose an approximate model checking algorithm and analyse its complexity....
Model-Checking Real-Time Properties of an Aircraft Landing Gear System Using Fiacre
Berthomieu, Bernard; Dal Zilio, Silvano; Fronc, Lukasz
2014-01-01
International audience We describe our experience with modeling the landing gear system of an aircraft using the formal specification language Fiacre. Our model takes into account the behavior and timing properties of both the physical parts and the control software of this system. We use this formal model to check safety and real-time properties on the system but also to find a safe bound on the maximal time needed for all gears to be down and locked (assuming the absence of failures). Ou...
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.
Logic Model Checking of Unintended Acceleration Claims in Toyota Vehicles
Gamble, Ed
2012-01-01
Part of the US Department of Transportation investigation of Toyota sudden unintended acceleration (SUA) involved analysis of the throttle control software, JPL Laboratory for Reliable Software applied several techniques including static analysis and logic model checking, to the software; A handful of logic models were build, Some weaknesses were identified; however, no cause for SUA was found; The full NASA report includes numerous other analyses
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
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Diaz, Ricardo Graciani; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-01-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple, the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike con...
Schedulability of Herschel revisited using statistical model checking
DEFF Research Database (Denmark)
David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel;
2015-01-01
Schedulability analysis is a main concern for several embedded applications due to their safety-critical nature. The classical method of response time analysis provides an efficient technique used in industrial practice. However, the method is based on conservative assumptions related to execution...... 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...
Stochastic Semantics and Statistical Model Checking for Networks of Priced Timed Automata
David, Alexandre; Legay, Axel; Mikučionis, Marius; Poulsen, Danny Bøgsted; van Vliet, Jonas; Wang, Zheng
2011-01-01
This paper offers a natural stochastic semantics of Networks of Priced Timed Automata (NPTA) based on races between components. The semantics provides the basis for satisfaction of probabilistic Weighted CTL properties (PWCTL), conservatively extending the classical satisfaction of timed automata with respect to TCTL. In particular the extension allows for hard real-time properties of timed automata expressible in TCTL to be refined by performance properties, e.g. in terms of probabilistic guarantees of time- and cost-bounded properties. A second contribution of the paper is the application of Statistical Model Checking (SMC) to efficiently estimate the correctness of non-nested PWCTL model checking problems with a desired level of confidence, based on a number of independent runs of the NPTA. In addition to applying classical SMC algorithms, we also offer an extension that allows to efficiently compare performance properties of NPTAs in a parametric setting. The third contribution is an efficient tool implem...
Model Checking Real-Time Value-Passing Systems
Institute of Scientific and Technical Information of China (English)
Jing Chen; Zio-Ning Cao
2004-01-01
In this paper,to model check real-time value-passing systems,a formal language Timed Symbolic Transition Graph and a logic system named Timed Predicate μ-Calculus are proposed.An algorithm is presented which is local in that it generates and investigates the reachable state space in top-down fashion and maintains the partition for time evaluations as coarse as possible while on-the-fly instantiating data variables.It can deal with not only data variables with finite value domain,but also the so called data independent variables with infinite value domain.To authors knowledge,this is the first algorithm for model checking timed systems containing value-passing features.
Detecting feature interactions in Web services with model checking techniques
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
As a platform-independent software system, a Web service is designed to offer interoperability among diverse and heterogeneous applications.With the introduction of service composition in the Web service creation, various message interactions among the atomic services result in a problem resembling the feature interaction problem in the telecommunication area.This article defines the problem as feature interaction in Web services and proposes a model checking-based detection method.In the method, the Web service description is translated to the Promela language - the input language of the model checker simple promela interpreter (SPIN), and the specific properties, expressed as linear temporal logic (LTL) formulas, are formulated according to our classification of feature interaction.Then, SPIN is used to check these specific properties to detect the feature interaction in Web services.
A Succinct Approach to Static Analysis and Model Checking
DEFF Research Database (Denmark)
Filipiuk, Piotr
In a number of areas software correctness is crucial, therefore it is often desirable to formally verify the presence of various properties or the absence of errors. This thesis presents a framework for concisely expressing static analysis and model checking problems. The framework facilitates...... in the classical formulation of ALFP logic. Finally, we show that the logics and the associated solvers can be used for rapid prototyping. We illustrate that by a variety of case studies from static analysis and model checking....... that guarantees that there always is single best solution for a problem under consideration. We also develop a solving algorithm, based on a dierential worklist, that computes the least solution guaranteed by the Moore Family result. Furthermore, we present a logic for specifying analysis problems called Layered...
Parallel State Space Construction for Model-Checking
Garavel, Hubert; Mateescu, Radu; Smarandache, Irina
2001-01-01
The verification of concurrent finite-state systems by model-checking often requires to generate (a large part of) the state space of the system under analysis. Because of the state explosion problem, this may be a resource-consuming operation, both in terms of memory and CPU time. In this report, we aim at improving the performances of state space construction by using parallelization techniques. We present parallel algorithms for constructing state spaces (or Labeled Transition Systems) on ...
A Graphical μ-Calculus and Local Model Checking
Institute of Scientific and Technical Information of China (English)
林惠民
2002-01-01
A graphical notation for the propositionalμ-calculus, called modal graphs, ispresented. It is shown that both the textual and equational presentations of theμ-calculus canbe translated into modal graphs. A model checking algorithm based on such graphs is proposed.The algorithm is truly local in the sense that it only generates the parts of the underlyingsearch space which are necessary for the computation of the final result. The correctness of thealgorithm is proven and its complexity analysed.
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.
Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.
Klarner, Hannes; Siebert, Heike
2015-01-01
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.
Algorithmic metatheorems for decidable LTL model checking over infinite systems
To, Anthony Widjaja
2009-01-01
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a large family of classes of infinite systems. Such results normally start with a powerful formalism of infinite-state systems, over which P is undecidable, and assert decidability when is restricted by means of an extra "semantic condition" C. We prove various algorithmic metatheorems for the problems of model checking LTL and its two common fragments LTL(Fs,Gs) and LTLdet over the expressive class of word/tree automatic transition systems, which are generated by synchronized finite-state transducers operating on finite words and trees. We present numerous applications, where we derive (in a unified manner) many known and previously unknown decidability and complexity results of model checking LTL and its fragments over specific classes of infinite-state systems including pu...
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 Checking Data Consistency for Cache Coherence Protocols
Institute of Scientific and Technical Information of China (English)
Hong Pan; Hui-Min Lin; Yi Lv
2006-01-01
A method for automatic verification of cache coherence protocols is presented, in which cache coherence protocols are modeled as concurrent value-passing processes, and control and data consistency requirement are described as formulas in first-orderμ-calculus. A model checker is employed to check if the protocol under investigation satisfies the required properties. Using this method a data consistency error has been revealed in a well-known cache coherence protocol.The error has been corrected, and the revised protocol has been shown free from data consistency error for any data domain size, by appealing to data independence technique.
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
DEFF Research Database (Denmark)
Bulychev, Petr; David, Alexandre; Larsen, Kim Guldstrand;
2012-01-01
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....... 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...
Optimizing ZigBee Security using Stochastic Model Checking
DEFF Research Database (Denmark)
Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming;
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......, 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...
Network segregation in a model of misinformation and fact checking
Tambuscio, Marcella; Ciampaglia, Giovanni Luca; Ruffo, Giancarlo
2016-01-01
Misinformation under the form of rumor, hoaxes, and conspiracy theories spreads on social media at alarming rates. One hypothesis is that, since social media are shaped by homophily, belief in misinformation may be more likely to thrive on those social circles that are segregated from the rest of the network. One possible antidote is fact checking which, in some cases, is known to stop rumors from spreading further. However, fact checking may also backfire and reinforce the belief in a hoax. Here we take into account the combination of network segregation, finite memory and attention, and fact-checking efforts. We consider a compartmental model of two interacting epidemic processes over a network that is segregated between gullible and skeptic users. Extensive simulation and mean-field analysis show that a more segregated network facilitates the spread of a hoax only at low forgetting rates, but has no effect when agents forget at faster rates. This finding may inform the development of mitigation techniques ...
Applying Model Checking to Industrial-Sized PLC Programs
AUTHOR|(CDS)2079190; Darvas, Daniel; Blanco Vinuela, Enrique; Tournier, Jean-Charles; Bliudze, Simon; Blech, Jan Olaf; Gonzalez Suarez, Victor M
2015-01-01
Programmable logic controllers (PLCs) are embedded computers widely used in industrial control systems. Ensuring that a PLC software complies with its specification is a challenging task. Formal verification has become a recommended practice to ensure the correctness of safety-critical software but is still underused in industry due to the complexity of building and managing formal models of real applications. In this paper, we propose a general methodology to perform automated model checking of complex properties expressed in temporal logics (\\eg CTL, LTL) on PLC programs. This methodology is based on an intermediate model (IM), meant to transform PLC programs written in various standard languages (ST, SFC, etc.) to different modeling languages of verification tools. We present the syntax and semantics of the IM and the transformation rules of the ST and SFC languages to the nuXmv model checker passing through the intermediate model. Finally, two real cases studies of \\CERN PLC programs, written mainly in th...
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.
Of Models and Machines: Implementing Bounded Rationality.
Dick, Stephanie
2015-09-01
This essay explores the early history of Herbert Simon's principle of bounded rationality in the context of his Artificial Intelligence research in the mid 1950s. It focuses in particular on how Simon and his colleagues at the RAND Corporation translated a model of human reasoning into a computer program, the Logic Theory Machine. They were motivated by a belief that computers and minds were the same kind of thing--namely, information-processing systems. The Logic Theory Machine program was a model of how people solved problems in elementary mathematical logic. However, in making this model actually run on their 1950s computer, the JOHNNIAC, Simon and his colleagues had to navigate many obstacles and material constraints quite foreign to the human experience of logic. They crafted new tools and engaged in new practices that accommodated the affordances of their machine, rather than reflecting the character of human cognition and its bounds. The essay argues that tracking this implementation effort shows that "internal" cognitive practices and "external" tools and materials are not so easily separated as they are in Simon's principle of bounded rationality--the latter often shaping the dynamics of the former. PMID:26685521
Survey for Stochastic Model Checking%随机模型检验研究
Institute of Scientific and Technical Information of China (English)
刘阳; 李宣东; 马艳; 王林章
2015-01-01
随机模型检验作为模型检验理论的延伸和推广，可用于验证分析系统模型的定性或定量性质，其已经应用到随机分布式算法验证、通信协议性能分析甚至是系统生物学等跨学科领域。从20世纪90年代末至今，随机模型检验引起了形式验证等领域的广泛关注，并取得了很大的进展。该文追溯了随机模型检验的渊源，系统地概括了其最基本的原理及几类典型的 PCTL、概率的 LTL、PCTL*和 CSL 模型检验随机系统的算法框架。然后归纳总结了随机模型检验的主要研究方向及其进展，分析了基于随机模型检验的验证过程及其优势与劣势，并分类列出了目前出现的随机模型检验工具。最后介绍了随机模型检验的应用领域并指出了其未来的应用挑战。%Stochastic model checking is extension and generalization of the theory of model checking,which can verify and analyze system model quantitatively and qualitatively,and has been applied in the areas of verification of randomized distributed algorithms,performance analysis of communication protocols,and even the cross-disciplinary fields such as systems biology.Since the late 1990s,stochastic model checking has received widespread concern in the formal verification filed,and has made great progress.In this paper,we retrospect the origin of stochastic model checking,and discuss the basic principle of stochastic model checking systematically including the PCTL,LTL with probability bounds,PCTL* and CSL model checking algorithm.Then we summarize the main research direction and progress of stochastic model checking in recent years, analyze the verification process and advantages/disadvantages of stochastic model checking deeply, classify and list tools for stochastic model checking.Finally,we introduce the application areas of stochastic model checking and point out its future challenge.
Valuation models and Simon's bounded rationality
Directory of Open Access Journals (Sweden)
Alexandra Strommer de Farias Godoi
2009-09-01
Full Text Available This paper aims at reconciling the evidence that sophisticated valuation models are increasingly used by companies in their investment appraisal with the literature of bounded rationality, according to which objective optimization is impracticable in the real world because it would demand an immense level of sophistication of the analytical and computational processes of human beings. We show how normative valuation models should rather be viewed as forms of reality representation, frameworks according to which the real world is perceived, fragmented for a better understanding, and recomposed, providing an orderly method for undertaking a task as complex as the investment decision.
Reasoning About Strategies: On the Model-Checking Problem
Mogavero, Fabio; Perelli, Giuseppe; Vardi, Moshe Y
2011-01-01
In open systems verification, to formally check for reliability, one needs an appropriate formalism to model the interaction between agents and express the correctness of the system no matter how the environment behaves. An important contribution in this context is given by modal logics for strategic ability, in the setting of multi-agent games, such as ATL, ATL*, and the like. Recently, Chatterjee, Henzinger, and Piterman introduced Strategy Logic (CHP-SL), with the aim of getting a powerful framework for reasoning explicitly about strategies. CHP-SL is obtained by using first-order quantifications over strategies and it has been investigated in the setting of two-agents turned-based games, where a non-elementary model-checking algorithm has been provided. While CHP-SL is a very expressive logic, we claim that it does not fully capture the strategic aspects of multi-agent systems. In this paper, we introduce and study a more general strategy logic, denoted SL, for reasoning about strategies in multi-agent co...
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.
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....
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Templon, Jeff; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Graciani Diaz, Ricardo; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-12-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple; the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike conventional testing, it allows full control over the parallel processes execution, and supports exhaustive state-space exploration. We used the mCRL2 language and toolset to model the behavior of two related DIRAC subsystems: the workload and storage management system. Based on process algebra, mCRL2 allows defining custom data types as well as functions over these. This makes it suitable for modeling the data manipulations made by DIRAC's agents. By visualizing the state space and replaying scenarios with the toolkit's simulator, we have detected race-conditions and deadlocks in these systems, which, in several cases, were confirmed to occur in the reality. Several properties of interest were formulated and verified with the tool. Our future direction is automating the translation from DIRAC to a formal model.
Analysis of DIRAC's behavior using model checking with process algebra
International Nuclear Information System (INIS)
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.
A conceptual model of check dam hydraulics for gully control
Directory of Open Access Journals (Sweden)
C. Castillo
2013-09-01
Full Text Available There is little information in scientific literature regarding the modifications induced by check dam systems in flow regimes in restored gully reaches, despite it being a crucial issue for the design of conservation measures. Here, we develop a conceptual model to classify flow regimes in straight rectangular channels for initial and dam-filling conditions as well as a method of estimating efficiency in order to provide guidelines for optimal design. The model integrates several previous mathematical approaches for assessing the main processes involved (hydraulic jump HJ, impact flow, gradually varied flows. Its performance was compared with the simulations obtained from IBER, a bi-dimensional hydrodynamic model. The impact of check dam spacing (defined by the geometric factor of influence c on efficiency was explored. Eleven main classifications of flow regimes were identified depending on the element and level of influence. The model produced similar results when compared with IBER, but led to higher estimations of HJ and impact lengths. Total influence guaranteed maximum efficiency and HJ control defining the location of the optimal c. Geometric total influence (c = 1 was a valid criterion for the different stages of the structures in a wide range of situations provided that hydraulic roughness conditions remained high within the gully, e.g. through revegetation. Our total influence criterion involved shorter spacing than that habitually recommended in technical manuals for restoration, but was in line with those values found in spontaneous and stable step-pools systems, which might serve as a reference for man-made interventions.
Using Stochastic Model Checking to Provision Complex Business Services
DEFF Research Database (Denmark)
Herbert, Luke Thomas; Sharp, Robin
2012-01-01
We present a framework for modelling and analysis of real-world business workflows. Business processes regularly form the basis for the design of software services, and frequently display complex stochastic behaviour. The accurate evaluation of their qualitative aspects can allow for determining...... bounds on resources consumed during execution of business processes. Accurate resource provisioning is often central to ensuring the safe execution of a process. We first introduce a formalised core subset of the Business Process Modelling and Notation (BPMN), which we extend with probabilistic and non...... of business processes including transient probabilities, timing, occurrence and ordering of events, and best- and worst-case scenarios. The developments presented are illustrated using an example from the health-care industry....
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....../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....... The highest previous lower bound for any static data structure problem peaked at (lg n= lg lg n). An ((lg n= lg lg n)2) lower bound on the maximum of the update time and the query time of dynamic data structures. This is almost a quadratic improvement over the highest previous lower bound of (lg n...
Model Checking Vector Addition Systems with one zero-test
Bonet, Rémi; Leroux, Jérôme; Zeitoun, Marc
2012-01-01
We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test. This algorithm yields decision procedures for several problems for these systems, open until now, such as place-boundedness or LTL model-checking. The proof techniques to handle the zero-test are based on two new notions of cover: the refined and the filtered cover. The refined cover is a hybrid between the reachability set and the classical cover. It inherits properties of the reachability set: equality of two refined covers is undecidable, even for usual Vector Addition Systems (with no zero-test), but the refined cover of a Vector Addition System is a recursive set. The second notion of cover, called the filtered cover, is the central tool of our algorithms. It inherits properties of the classical cover, and in particular, one can effectively compute a finite representation of this set, e...
Verification of Quantum Cryptography Protocols by Model Checking
Directory of Open Access Journals (Sweden)
Mohamed Elboukhari
2010-10-01
Full Text Available Unlike classical cryptography which is based on mathematical functions, Quantum Cryptography orQuantum Key Distribution (QKD exploits the laws of quantum physics to offer unconditionally securecommunication. The progress of research in this field allows the anticipation of QKD to be availableoutside of laboratories within the next few years and efforts are made to improve the performance andreliability of the implemented technologies. But despite this big progress, several challenges remain. Forexample the task of how to test the devices of QKD did not yet receive enough attention. These apparatusesbecome heterogeneous, complex and so demand a big verification effort. In this paper we propose to studyquantum cryptography protocols by applying the technique of probabilistic model checking. Using PRISMtool, we analyze the security of BB84 protocol and we are focused on the specific security property ofeavesdropper's information gain on the key derived from the implementation of this protocol. We show thatthis property is affected by the parameters of the eavesdropper’s power and the quantum channel.
The Model Checking Problem for Propositional Intuitionistic Logic with One Variable is AC1-Complete
Weiss, Martin Mundhenk And Felix
2010-01-01
We investigate the complexity of the model checking problem for propositional intuitionistic logic. We show that the model checking problem for intuitionistic logic with one variable is complete for logspace-uniform AC1, and for intuitionistic logic with two variables it is P-complete. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem and for the tautology problem.
The Modeling Library of Eavesdropping Methods in Quantum Cryptography Protocols by Model Checking
Yang, Fan; Yang, Guowu; Hao, Yujie
2016-07-01
The most crucial issue of quantum cryptography protocols is its security. There exists many ways to attack the quantum communication process. In this paper, we present a model checking method for modeling the eavesdropping in quantum information protocols. So when the security properties of a certain protocol are needed to be verified, we can directly use the models which are already built. Here we adopt the probabilistic model checking tool—PRISM to model these attack methods. The verification results show that the detection rate of eavesdropping is approximately close to 1 when enough photons are transmitted.
PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool
AlTurki, Musab
2011-01-01
Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability of statistical model checking, and making such scalability of analysis available to tools like Maude, where probabilistic systems can be specified at a high level as probabilistic rewrite theories. It presents PVeStA, an extension and parallelization of the VeStA statistical model checking tool [10]. PVeStA supports statistical model checking of probabilistic real-time systems specified as either: (i) discrete or continuous Markov Chains; or (ii) probabilistic rewrite theories in Maude. Furthermore, the properties that it can model check can be expressed in either: (i) PCTL/CSL, or (ii) the QuaTEx quantitative temporal logic. As our experiments show, the performance gains obtained from parallelization can be very high. © 2011 Springer-Verlag.
Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking
Aichernig, Bernhard K; 10.4204/EPTCS.80.7
2012-01-01
Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper presents an approach for symbolic conformance checking of action systems, which are well-suited to specify reactive systems. We also consider nondeterminism in our models. Hence, we do not check for equivalence, but for refinement. We encode the transition relation as well as the conformance relation as a constraint satisfaction problem and use a constraint solver in our reachability and refinement checking algorithms. Explicit conformance checking techniques often face state space explosion. First experimental evaluations show that our approach has potential to outperform explicit conformance checkers.
a Quality Analysis and Uncertainty Modeling Approach for Crowd-Sourcing Location Check-In Data
Zhou, M.; Hu, Q.; Wang, M.
2013-05-01
The location check-in data, developing along with social network, are considered as user-generated crowd-sourcing geospatial data. With massive data volume, abundance in contained information, and high up-to-date status, the check-in data provide a new data source for geographic information service represented by location-based service. However, there is a significant quality issue regarding to crowd-sourcing data, which has a direct influence to data availability. In this paper, a data quality analysis approach is designed for the location check-in data and a check-in data uncertainty model is proposed. First of all, the quality issue of location check-in data is discussed. Then, according to the characteristics of check-in data, a location check-in data quality analysis and data processing approach is proposed, using certain standard dataset as reference to conduct an affine transformation for the check-in dataset, during which the RANSAC algorithm is adopted for outlier elimination. Subsequently, combining GIS data uncertainty theory, an uncertainty model of processed check-in data is set up. At last, using location check-in data obtained from jiepang.com as experimental data and selected navigation data as data standard, multiple location check-in data quality analysis and uncertainty modeling experiments are conducted. By comprehensive analysis of experimental results, the feasibility of proposed location checkin data quality analysis and process approach and the availability of proposed uncertainty model are verified. The novel approach is proved to have a certain practical significance to the study of the quality issue of crowd-sourcing geographic data.
Model checking and strategy synthesis for stochastic games: from theory to practice
Kwiatkowska, MZ
2016-01-01
Probabilistic model checking is an automatic procedure for establishing if a desired property holds in a probabilistic model, aimed at verifying quantitative probabilistic specifications such as the probability of a critical failure occurring or expected time to termination. Much progress has been made in recent years in algorithms, tools and applications of probabilistic model checking, as exemplified by the probabilistic model checker PRISM (www.prismmodelchecker.org). However, the unstoppa...
Checking Fine and Gray Subdistribution Hazards Model with Cumulative Sums of Residuals
Li, Jianing; Scheike, Thomas H.; Zhang, Mei-Jie
2014-01-01
Recently, Fine and Gray (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. T...
Bounds for the chaotic region in the Lorenz model
Barrio, Roberto; Serrano, Sergio
2009-08-01
In a previous paper, the authors made an extensive numerical study of the Lorenz model, changing all three parameters of the system. We conjectured that the region of parameters where the Lorenz model is chaotic is bounded for fixed r. In this paper, we give a theoretical proof of the conjecture by obtaining theoretical bounds for the chaotic region and by using Fenichel theory. The theoretical bounds are complemented with numerical studies performed using the Maximum Lyapunov Exponent and OFLI2 techniques, and a comparison of both sets of results is shown. Finally, we provide a complete three-dimensional model of the chaotic regime depending on the three parameters.
Model Checking for a General Linear Model with Nonignorable Missing Covariates
Institute of Scientific and Technical Information of China (English)
Zhi-hua SUN; Wai-Cheung IP; Heung WONG
2012-01-01
In this paper,we investigate the model checking problem for a general linear model with nonignorable missing covariates.We show that,without any parametric model assumption for the response probability,the least squares method yields consistent estimators for the linear model even if only the complete data are applied.This makes it feasible to propose two testing procedures for the corresponding model checking problem:a score type lack-of-fit test and a test based on the empirical process.The asymptotic properties of the test statistics are investigated.Both tests are shown to have asymptotic power 1 for local alternatives converging to the null at the rate n-(r),0 ≤ (r) ＜ 1/2.Simulation results show that both tests perform satisfactorily.
Checking the new IRI model The bottomside B parameters
Mosert, M; Ezquer, R; Lazo, B; Miro, G
2002-01-01
Electron density profiles obtained at Pruhonice (50.0, 15.0), El Arenosillo (37.1, 353.2) and Havana (23, 278) were used to check the bottom-side B parameters BO (thickness parameter) and B1 (shape parameter) predicted by the new IRI - 2000 version. The electron density profiles were derived from ionograms using the ARP technique. The data base includes daytime and nighttime ionograms recorded under different seasonal and solar activity conditions. Comparisons with IRI predictions were also done. The analysis shows that: a) The parameter B1 given by IRI 2000 reproduces better the observed ARP values than the IRI-90 version and b) The observed BO values are in general well reproduced by both IRI versions: IRI-90 and IRI-2000.
LHCb: Analysing DIRAC's Behavior using Model Checking with Process Algebra
Remenska, Daniela
2012-01-01
DIRAC is the Grid solution designed to support LHCb production activities as well as user data analysis. Based on a service-oriented architecture, DIRAC consists of many cooperating distributed services and agents delivering the workload to the Grid resources. Services accept requests from agents and running jobs, while agents run as light-weight components, fulfilling specific goals. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check for changes in the service states, and react to these accordingly. A characteristic of DIRAC's architecture is the relatively low complexity in the logic of each agent; the main source of complexity lies in their cooperation. These agents run concurrently, and communicate using the services' databases as a shared memory for synchronizing the state transitions. Although much effort is invested in making DIRAC reliable, entities occasionally get into inconsistent states, leadi...
An Approach to Checking 3D Model with Related Engineering Drawings
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
For some reasons, engineers build their product 3D mo del according to a set of related engineering drawings. The problem is how we ca n know the 3D model is correct. The manual checking is very boring and time cons uming, and still could not avoid mistakes. Thus, we could not confirm the model, maybe try checking again. It will effect the production preparing cycle greatly , and should be solved in a intelligent way. The difficulties are quite obvious, unlike word checking in a word processing package, ...
Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking
National Aeronautics and Space Administration — The translation of temporal logic specifications constitutes an essen- tial step in model checking and a major influence on the efficiency of formal verification...
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.
Family-Based Model Checking Without a Family-Based Model Checker
DEFF Research Database (Denmark)
Dimovski, Aleksandar; Al-Sibahi, Ahmad Salim; Brabrand, Claus;
2015-01-01
be used to model-check variational models using the standard version of (single system) SPIN. The abstractions are first defined as Galois connections on semantic domains. We then show how to translate them into syntactic source-to-source transformations on variational models. This allows the use of SPIN...... with all its accumulated optimizations for efficient verification of variational models without any knowledge about variability. We demonstrate the practicality of this method on several examples using both the SNIP (family based) and SPIN (single system) model checkers....
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.)
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.
Vulnerable Derivatives and Good Deal Bounds: A Structural Model
DEFF Research Database (Denmark)
Murgoci, Agatha
2013-01-01
a new restriction in the arbitrage free model by setting upper bounds on the Sharpe ratios (SRs) of the assets. The potential prices that are eliminated represent unreasonably good deals. The constraint on the SR translates into a constraint on the stochastic discount factor. Thus, tight pricing bounds...... can be obtained. We provide a link between the objective probability measure and the range of potential risk-neutral measures, which has an intuitive economic meaning. We also provide tight pricing bounds for European calls and show how to extend the call formula to pricing other financial products...
Verifying Real-time Commit Protocols Using Dense-time Model Checking Technology
Al-Bataineh, Omar I; French, Tim; Woodings, Terry
2012-01-01
The timed-based automata model, introduced by Alur and Dill, provides a useful formalism for describing real-time systems. Over the last two decades, several dense-time model checking tools have been developed based on that model. The paper considers the verification of real-time distributed commit protocols using dense-time model checking technology. More precisely, we model and verify the well-known timed two phase commit protocol in three different state-of-the-art real-time model checkers: UPPAAL, Rabbit, and RED, and compare the results.
Verifying Real-time Commit Protocols Using Dense-time Model Checking Technology
Al-Bataineh, Omar I.; Reynolds, Mark; French, Tim; Woodings, Terry
2012-01-01
The timed-based automata model, introduced by Alur and Dill, provides a useful formalism for describing real-time systems. Over the last two decades, several dense-time model checking tools have been developed based on that model. The paper considers the verification of real-time distributed commit protocols using dense-time model checking technology. More precisely, we model and verify the well-known timed two phase commit protocol in three different state-of-the-art real-time model checkers...
PKreport: report generation for checking population pharmacokinetic model assumptions
Directory of Open Access Journals (Sweden)
Li Jun
2011-05-01
Full Text Available Abstract Background Graphics play an important and unique role in population pharmacokinetic (PopPK model building by exploring hidden structure among data before modeling, evaluating model fit, and validating results after modeling. Results The work described in this paper is about a new R package called PKreport, which is able to generate a collection of plots and statistics for testing model assumptions, visualizing data and diagnosing models. The metric system is utilized as the currency for communicating between data sets and the package to generate special-purpose plots. It provides ways to match output from diverse software such as NONMEM, Monolix, R nlme package, etc. The package is implemented with S4 class hierarchy, and offers an efficient way to access the output from NONMEM 7. The final reports take advantage of the web browser as user interface to manage and visualize plots. Conclusions PKreport provides 1 a flexible and efficient R class to store and retrieve NONMEM 7 output, 2 automate plots for users to visualize data and models, 3 automatically generated R scripts that are used to create the plots; 4 an archive-oriented management tool for users to store, retrieve and modify figures, 5 high-quality graphs based on the R packages, lattice and ggplot2. The general architecture, running environment and statistical methods can be readily extended with R class hierarchy. PKreport is free to download at http://cran.r-project.org/web/packages/PKreport/index.html.
VERIFICATION OF CONFLICTION AND UNREACHABILITY IN RULE-BASED EXPERT SYSTEMS WITH MODEL CHECKING
Directory of Open Access Journals (Sweden)
Einollah pira
2014-03-01
Full Text Available It is important to find optimal solutions for structural errors in rule-based expert systems .Solutions to discovering such errors by using model checking techniques have already been proposed, but these solutions have problems such as state space explosion. In this paper, to overcome these problems, we model the rule-based systems as finite state transition systems and express confliction and unreachabilityas Computation Tree Logic (CTL logic formula and then use the technique of model checking to detect confliction and unreachability in rule-based systems with the model checker UPPAAL.
Electrostatic charge bounds for ball lightning models
Energy Technology Data Exchange (ETDEWEB)
Stephan, Karl D [Department of Technology, Texas State University, San Marcos, TX 78666 (United States)], E-mail: kdstephan@txstate.edu
2008-03-15
Several current theories concerning the nature of ball lightning predict a substantial electrostatic charge in order to account for its observed motion and shape (Turner 1998 Phys. Rep. 293 1; Abrahamson and Dinniss 2000 Nature 403 519). Using charged soap bubbles as a physical model for ball lightning, we show that the magnitude of charge predicted by some of these theories is too high to allow for the types of motion commonly observed in natural ball lightning, which includes horizontal motion above the ground and movement near grounded conductors. Experiments show that at charge levels of only 10-15 nC, 3-cm-diameter soap bubbles tend to be attracted by induced charges to the nearest grounded conductor and rupture. We conclude with a scaling rule that can be used to extrapolate these results to larger objects and surroundings.
Membrane Matrix models and non-perturbative checks of gauge/gravity duality
O'Connor, Denjoe
2016-01-01
We compare the bosonic and maximally supersymmetric membrane models. We find that in Hoppe regulated form the bosonic membrane is well approximated by massive Gaussian quantum matrix models. In contrast the similarly regulated supersymmetric membrane, which is equivalent to the BFSS model, has a gravity dual description. We sketch recent progress in checking gauge/gravity duality in this context.
Practical Application of Model Checking in Software Verification
Havelund, Klaus; Skakkebaek, Jens Ulrik
1999-01-01
This paper presents our experiences in applying the JAVA PATHFINDER (J(sub PF)), a recently developed JAVA to SPIN translator, in the finding of synchronization bugs in a Chinese Chess game server application written in JAVA. We give an overview of J(sub PF) and the subset of JAVA that it supports and describe the abstraction and verification of the game server. Finally, we analyze the results of the effort. We argue that abstraction by under-approximation is necessary for abstracting sufficiently smaller models for verification purposes; that user guidance is crucial for effective abstraction; and that current model checkers do not conveniently support the computational models of software in general and JAVA in particular.
Model Checking Electronic Commerce Security Protocols Based on CTL
Institute of Scientific and Technical Information of China (English)
XIAO De-qin; ZHANG Huan-guo
2005-01-01
We present a model based on Computational Temporal Logic (CTL) methods for verifying security requirements of electronic commerce protocols. The model describes formally the authentication, confidentiality integrity,non-repudiation, denial of service and access control of the electronic commerce protocols. We illustrate as case study a variant of the Lu-Smolka protocol proposed by Lu-Smolka.Moreover, we have discovered two attacks that allow a dishonest user to purchase a good debiting the amount to another user. And also, we compared our work with relative research works and found that the formal way of this paper is more general to specify security protocols for E-Commerce.
Application of Model-Checking Technology to Controller Synthesis
DEFF Research Database (Denmark)
David, Alexandre; Grunnet, Jacob Deleuran; Jessen, Jan Jacob;
2011-01-01
its continuous environment, which is modelled and taken care of in our frameworks. Our first technique does it by using Matlab to discretise the problem and then Uppaal-tiga to solve the obtained timed game. This is implemented as a toolbox. The second technique relies on the user defining a timed...... game model in Uppaal- tiga. Then the strategy is automatically imported in Simulink as an S-function for simulation and validation purposes. We demonstrate the effectiveness of these frameworks in different case-studies....
Quark model study of the triton bound stat
Juliá-Díaz, B.; Fernández, F.; Valcarce, A.; Haidenbauer, J.
2001-01-01
The three-nucleon bound state problem is studied employing nucleon-nucleon potentials derived from a basic quark-quark interaction. We analyze the effects of the nonlocalities generated by the quark model. The calculated triton binding energies indicate that quark-model nonlocalities can yield additional binding in the order of few hundred keV.
Hypersonic: Model Analysis and Checking in the Cloud
DEFF Research Database (Denmark)
Acretoaie, Vlad; Störrle, Harald
2014-01-01
”. Objective: In this paper we investigate the conceptual and technical feasibility of a new software architecture for modeling tools, where certain advanced features are factored out of the client and moved towards the Cloud. With this approach we plan to address the above mentioned drawbacks of existing...
Dynamic Delayed Duplicate Detection for External Memory Model Checking
DEFF Research Database (Denmark)
Evangelista, Sami
2008-01-01
Duplicate detection is an expensive operation of disk-based model checkers. It consists of comparing some potentially new states, the candidate states, to previous visited states. We propose a new approach to this technique called dynamic delayed duplicate detection. This one exploits some typica...
CheckMATE: Confronting your Favourite New Physics Model with LHC Data
Drees, Manuel; Kim, Jong Soo; Schmeier, Daniel; Tattersall, Jamie
2013-01-01
In the first three years of running, the LHC has delivered a wealth of new data that is now being analysed. With over 20 fb$^{-1}$ of integrated luminosity, both ATLAS and CMS have performed many searches for new physics that theorists are eager to test their model against. However, tuning the detector simulations, understanding the particular analysis details and interpreting the results can be a tedious task. CheckMATE (Check Models At Terascale Energies) is a program package which accepts simulated event files in many formats for any model. The program then determines whether the model is excluded or not at 95% C.L. by comparing to many recent experimental analyses. Furthermore the program can calculate confidence limits and provide detailed information about signal regions of interest. It is simple to use and the program structure allows for easy extensions to upcoming LHC results in the future. CheckMATE can be found at: http://checkmate.hepforge.org
Using Runtime Analysis to Guide Model Checking of Java Programs
Havelund, Klaus; Norvig, Peter (Technical Monitor)
2001-01-01
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java programs. Runtime analysis is based on the idea of executing the program once. and observing the generated run to extract various kinds of information. This information can then be used to predict whether other different runs may violate some properties of interest, in addition of course to demonstrate whether the generated run itself violates such properties. These runtime analyses can be performed stand-alone to generate a set of warnings. It is furthermore demonstrated how these warnings can be used to guide a model checker, thereby reducing the search space. The described techniques have been implemented in the b e grown Java model checker called PathFinder.
Model Checking Linear-Time Properties of Probabilistic Systems
Baier, Christel; Größer, Marcus; Ciesinski, Frank
This chapter is about the verification of Markov decision processes (MDPs) which incorporate one of the fundamental models for reasoning about probabilistic and nondeterministic phenomena in reactive systems. MDPs have their roots in the field of operations research and are nowadays used in a wide variety of areas including verification, robotics, planning, controlling, reinforcement learning, economics and semantics of randomized systems. Furthermore, MDPs served as the basis for the introduction of probabilistic automata which are related to weighted automata. We describe the use of MDPs as an operational model for randomized systems, e.g., systems that employ randomized algorithms, multi-agent systems or systems with unreliable components or surroundings. In this context we outline the theory of verifying ω-regular properties of such operational models. As an integral part of this theory we use ω-automata, i.e., finite-state automata over finite alphabets that accept languages of infinite words. Additionally, basic concepts of important reduction techniques are sketched, namely partial order reduction of MDPs and quotient system reduction of the numerical problem that arises in the verification of MDPs. Furthermore we present several undecidability and decidability results for the controller synthesis problem for partially observable MDPs.
Energy Technology Data Exchange (ETDEWEB)
Ben Said, Nader; Bregulla, Wolfgang; Kalk, Andreas [Westinghouse Electric Germany GmbH, Mannheim (Germany)
2009-07-01
Westinghouse Electric Germany GmbH has developed fluid dynamic models for medium-actuated armatures using the thermal hydraulic code RELAP5 in order to reach a more realistic description of the armature behavior including fluid-structure interactions in case of transient flow conditions in piping systems. The contribution is concerned with the modeling of damped check valves. The model allows the description of the behavior during opening and closure of a check armature. The calculated results show good agreement with the available measured data.
Formal Specification and Model-Checking of CSMA/CA Using Finite Precision Timed Automata
Institute of Scientific and Technical Information of China (English)
LI Liang; MA Hua-dong; LI Guang-yuan
2005-01-01
This paper presents the formal specification and model-checking of Carrier Sense Multiple Access with Collision Avoidance(CSMA/CA) protocol using the model checker we developed for real-time systems, which are specified as networks of finite precision timed automata. The CSMA/CA protocol proposed in the IEEE 802.11 standard is designed to reduce the probability of collision during a transmission in wireless random access environments. However, it does not eliminate completely the possibility of a collision between two or more frames transmitted simultaneously. We investigate what will give rise to a collision between frames and use our automatic verification tool for model-checking.
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
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...... of residuals, which validate the model in three aspects: (1) proportionality of hazard ratio, (2) the linear functional form and (3) the link function. For each assumption testing, we provide a p-values and a visualized plot against the null hypothesis using a simulation-based approach. We also consider...
The dynamics of Bertrand model with bounded rationality
Energy Technology Data Exchange (ETDEWEB)
Zhang Jixiang [School of Economics and Management, Southeast University, Nanjing, Jiangsu 211189 (China)], E-mail: zhang_jixiang@126.com; Da Qingli [School of Economics and Management, Southeast University, Nanjing, Jiangsu 211189 (China); Wang Yanhua [School of Environmental Science and Engineering, Shanghai Jiao Tong University Min Hang, Shanghai 200240 (China)
2009-03-15
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.
Bounds on the Tau Magnetic Moments Standard Model and Beyond
González-Sprinberg, G A; Vidal, J; Gonzalez-Sprinberg, Gabriel A.; Santamaria, Arcadi; Vidal, Jorge
2001-01-01
We obtain new bounds for the magnetic dipole moments of the tau lepton. These limits on the magnetic couplings of the tau to the electroweak gauge bosons (gamma, W, Z) are set in a model independent way using the most general effective Lagrangian with the SU(2)_L x U(1)_Y symmetry. Comparison with data from the most precise experiments at high energies shows that the present limits are more stringent than the previous published ones. For the anomalous magnetic moment the bounds are, for the first time, within one order of magnitude of the standard model prediction.
Boson bound states in the -Fermi–Pasta–Ulam model
Indian Academy of Sciences (India)
Xin-Guang Hu; Ju Xiang; Zheng Jiao; Yang Liu; Guo-Qiu Xie; Ke Hu
2013-11-01
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 with the number state method. We find that the relative magnitude of anharmonic coefficient has a significant effect on forming localized energy in the model, and the wave number plays an important role in forming different bound states. The signature of the quantum breather is also set up by the square of the amplitudes of the corresponding eigenvectors in real space.
Numerical modelling of granular flows: a reality check
Windows-Yule, C. R. K.; Tunuguntla, D. R.; Parker, D. J.
2016-07-01
Discrete particle simulations provide a powerful tool for the advancement of our understanding of granular media, and the development and refinement of the multitudinous techniques used to handle and process these ubiquitous materials. However, in order to ensure that this tool can be successfully utilised in a meaningful and reliable manner, it is of paramount importance that we fully understand the degree to which numerical models can be trusted to accurately and quantitatively recreate and predict the behaviours of the real-world systems they are designed to emulate. Due to the complexity and diverse variety of physical states and dynamical behaviours exhibited by granular media, a simulation algorithm capable of closely reproducing the behaviours of a given system may be entirely unsuitable for other systems with different physical properties, or even similar systems exposed to differing control parameters. In this paper, we focus on two widely used forms of granular flow, for which discrete particle simulations are shown to provide a full, quantitative replication of the behaviours of real industrial and experimental systems. We identify also situations for which quantitative agreement may fail are identified, but important general, qualitative trends are still recreated, as well as cases for which computational models are entirely unsuitable. By assembling this information into a single document, we hope not only to provide researchers with a useful point of reference when designing and executing future studies, but also to equip those involved in the design of simulation algorithms with a clear picture of the current strengths and shortcomings of contemporary models, and hence an improved knowledge of the most valuable areas on which to focus their work.
Cascading Verification: An Integrated Method for Domain-Specific Model Checking
Zervoudakis, F.
2014-01-01
Model checking is an established formal method for verifying the desired behavioral properties of system models. But popular model checkers tend to support low-level modeling languages that require intricate models to represent even the simplest systems. Modeling complexity arises in part from the need to encode domain knowledge, including domain objects and concepts, and their relationships, at relatively low levels of abstraction. We will demonstrate that, once formalized, domain knowledge ...
Prototype of Automated PLC Model Checking Using Continuous Integration Tools
Lettrich, Michael
2015-01-01
To deal with the complexity of operating and supervising large scale industrial installations at CERN, often Programmable Logic Controllers (PLCs) are used. A failure in these control systems can cause a disaster in terms of economic loses, environmental damages or human losses. Therefore the requirements to software quality are very high. To provide PLC developers with a way to verify proper functionality against requirements, a Java tool named PLCverif has been developed which encapsulates and thus simplifies the use of third party model checkers. One of our goals in this project is to integrate PLCverif in development process of PLC programs. When the developer changes the program, all the requirements should be verified again, as a change on the code can produce collateral effects and violate one or more requirements. For that reason, PLCverif has been extended to work with Jenkins CI in order to trigger automatically the verication cases when the developer changes the PLC program. This prototype has been...
Model Checking Real Time Java Using Java PathFinder
Lindstrom, Gary; Mehlitz, Peter C.; Visser, Willem
2005-01-01
The Real Time Specification for Java (RTSJ) is an augmentation of Java for real time applications of various degrees of hardness. The central features of RTSJ are real time threads; user defined schedulers; asynchronous events, handlers, and control transfers; a priority inheritance based default scheduler; non-heap memory areas such as immortal and scoped, and non-heap real time threads whose execution is not impeded by garbage collection. The Robust Software Systems group at NASA Ames Research Center has JAVA PATHFINDER (JPF) under development, a Java model checker. JPF at its core is a state exploring JVM which can examine alternative paths in a Java program (e.g., via backtracking) by trying all nondeterministic choices, including thread scheduling order. This paper describes our implementation of an RTSJ profile (subset) in JPF, including requirements, design decisions, and current implementation status. Two examples are analyzed: jobs on a multiprogramming operating system, and a complex resource contention example involving autonomous vehicles crossing an intersection. The utility of JPF in finding logic and timing errors is illustrated, and the remaining challenges in supporting all of RTSJ are assessed.
A "Brutus" model checking of a spi-calculus dialect (Extended Abstract)
Gnesi, S.; Latella, D.; Lenzini, G.
2000-01-01
This paper proposes a preliminary framework in which protocols, expressed in a dialect of the spi-calculus, can be verified using model checking algorithms. In particular we define a formal semantics for a dialect of the spi-calculus based on labeled transition systems in such a way that the model c
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
Requirements-level semantics and model checking of object-oriented statecharts
Eshuis, Rik; Jansen, David N.; Wieringa, Roel
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 te
Directory of Open Access Journals (Sweden)
R. Lestari
2012-12-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
Probability bounds analysis for nonlinear population ecology models.
Enszer, Joshua A; Andrei Măceș, D; Stadtherr, Mark A
2015-09-01
Mathematical models in population ecology often involve parameters that are empirically determined and inherently uncertain, with probability distributions for the uncertainties not known precisely. Propagating such imprecise uncertainties rigorously through a model to determine their effect on model outputs can be a challenging problem. We illustrate here a method for the direct propagation of uncertainties represented by probability bounds though nonlinear, continuous-time, dynamic models in population ecology. This makes it possible to determine rigorous bounds on the probability that some specified outcome for a population is achieved, which can be a core problem in ecosystem modeling for risk assessment and management. Results can be obtained at a computational cost that is considerably less than that required by statistical sampling methods such as Monte Carlo analysis. The method is demonstrated using three example systems, with focus on a model of an experimental aquatic food web subject to the effects of contamination by ionic liquids, a new class of potentially important industrial chemicals.
DEFF Research Database (Denmark)
ter Beek, Maurice H.; Legay, Axel; Lluch Lafuente, Alberto;
2015-01-01
particular behaviour or of installing features at a specific moment or in a specific order. The enriched language (called PFLAN) allows us to specify models of software product lines with probabilistic configurations and behaviour, e.g. by considering a PFLAN semantics based on discrete-time Markov chains......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....... The Maude implementation of PFLAN is combined with the distributed statistical model checker MultiVeStA to perform quantitative analyses of a simple product line case study. The presented analyses include the likelihood of certain behaviour of interest (e.g. product malfunctioning) and the expected average...
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.
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...
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...
Assessing the hydrological effect of the check dams in the Loess Plateau, China by model simulations
Directory of Open Access Journals (Sweden)
Y. D. Xu
2012-12-01
Full Text Available Check dams are commonly used for soil conservation. In the Loess Plateau of China, check dams have been widely constructed as the principal means to retain floodwater and intercept soil sediments since the 1970s. However, little research has been done to quantify the hydrological effects of the check dams.
In this research, the SWAT model (Soil and Water Assessment Tool was applied to simulate the runoff and sediment in the Yanhe watershed in the Loess Plateau. We treated the 1950s to 1960s as "reference period" since there were very few check dams during the period. The model was first calibrated and validated in the "reference period". The calibrated model was then used in the later periods to simulate the hydrological effects of the check dams.
The results showed that the check dams had a regulation effect on runoff and a retention effect on sediment. From 1984 to 1987, the runoff in rainy season (from May to October decreased by 14.7 to 25.9% due to the check dams, while in dry season (from November to the following April, runoff increased by 60.5 to 101.2%; the sediment in rainy season decreased by 34.6 to 48.0%. From 2006 to 2008, the runoff in rainy season decreased by 15.5 to 28.9%, and the runoff in dry season increased by 20.1 to 46.4%; the sediment in rainy season decreased by 79.4 to 85.5%.
Construction of the large number of in the Loess Plateau has enhanced the region's capacity to control the runoff and sediment. In the Yanhe watershed, the annual runoff was reduced by less than 14.3% due to the check dams; and the sediment in rainy season was blocked by up to 85.5%. Thus, check dams are effective measures for soil erosion control in the Loess Plateau.
Nonparametric checks for count data models: an application to demand for health care in Spain
Álvarez, Begoña; Delgado, Miguel A.
1997-01-01
This paper presents model specification checking procedures for count data regression models which are consistent in the direction of nonparametric alternatives. The discussion is motivated in the context of a model of demand for health care in Spain. The parameters of the regression model are estimated by maximum likelihood based on Poisson and Negative Binomial specifications as well as by ordinary least squares and semiparametric generalized least squares. However, our interest is not only...
Incremental checking of Master Data Management model based on contextual graphs
Lamolle, Myriam; Menet, Ludovic; Le Duc, Chan
2015-10-01
The validation of models is a crucial step in distributed heterogeneous systems. In this paper, an incremental validation method is proposed in the scope of a Model Driven Engineering (MDE) approach, which is used to develop a Master Data Management (MDM) field represented by XML Schema models. The MDE approach presented in this paper is based on the definition of an abstraction layer using UML class diagrams. The validation method aims to minimise the model errors and to optimisethe process of model checking. Therefore, the notion of validation contexts is introduced allowing the verification of data model views. Description logics specify constraints that the models have to check. An experimentation of the approach is presented through an application developed in ArgoUML IDE.
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
/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...... valves in wave energy converters to improve the system efficiency. A single float arm of the Wavestar wave energy converter is modelled including the power take-off (PTO) system. The primary stage of the utilised PTO-system is a discrete fluid power force system consisting of a multi-chamber cylinder...... and multiple common pressure lines. The valve manifold, employed in the discrete PTO system and conventionally equipped with On/Off valves, is instead considered fitted with bidirectional check valves. The energy output from the primary stage is compared for PTO systems occupying respectively On...
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....
Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics
Lomuscio, Alessio
2007-01-01
This article surveys some of the recent work in verification of temporal epistemic logic via symbolic model checking, focusing on OBDD-based and SAT-based approaches for epistemic logics built on discrete and real-time branching time temporal logics.
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...
Key management and encryption under the bounded storage model.
Energy Technology Data Exchange (ETDEWEB)
Draelos, Timothy John; Neumann, William Douglas; Lanzone, Andrew J.; Anderson, William Erik
2005-11-01
There are several engineering obstacles that need to be solved before key management and encryption under the bounded storage model can be realized. One of the critical obstacles hindering its adoption is the construction of a scheme that achieves reliable communication in the event that timing synchronization errors occur. One of the main accomplishments of this project was the development of a new scheme that solves this problem. We show in general that there exist message encoding techniques under the bounded storage model that provide an arbitrarily small probability of transmission error. We compute the maximum capacity of this channel using the unsynchronized key-expansion as side-channel information at the decoder and provide tight lower bounds for a particular class of key-expansion functions that are pseudo-invariant to timing errors. Using our results in combination with Dziembowski et al. [11] encryption scheme we can construct a scheme that solves the timing synchronization error problem. In addition to this work we conducted a detailed case study of current and future storage technologies. We analyzed the cost, capacity, and storage data rate of various technologies, so that precise security parameters can be developed for bounded storage encryption schemes. This will provide an invaluable tool for developing these schemes in practice.
Model Checking - My 27-Year Quest to Overcome the State Explosion Problem
Clarke, Ed
2009-01-01
Model Checking is an automatic verification technique for state-transition systems that are finite=state or that have finite-state abstractions. In the early 1980 s in a series of joint papers with my graduate students E.A. Emerson and A.P. Sistla, we proposed that Model Checking could be used for verifying concurrent systems and gave algorithms for this purpose. At roughly the same time, Joseph Sifakis and his student J.P. Queille at the University of Grenoble independently developed a similar technique. Model Checking has been used successfully to reason about computer hardware and communication protocols and is beginning to be used for verifying computer software. Specifications are written in temporal logic, which is particularly valuable for expressing concurrency properties. An intelligent, exhaustive search is used to determine if the specification is true or not. If the specification is not true, the Model Checker will produce a counterexample execution trace that shows why the specification does not hold. This feature is extremely useful for finding obscure errors in complex systems. The main disadvantage of Model Checking is the state-explosion problem, which can occur if the system under verification has many processes or complex data structures. Although the state-explosion problem is inevitable in worst case, over the past 27 years considerable progress has been made on the problem for certain classes of state-transition systems that occur often in practice. In this talk, I will describe what Model Checking is, how it works, and the main techniques that have been developed for combating the state explosion problem.
Machine Learning Methods in Statistical Model Checking and System Design – Tutorial
Bortolussi, Luca; Milios, Dimitrios; Sanguinetti, Guido
2015-01-01
Recent research has seen an increasingly fertile convergence of ideas from machine learning and formal modelling. Here we review some recently introduced methodologies for model checking and system design/parameter synthesis for logical properties against stochastic dynamical models. The crucial insight is a regularity result which states that the satisfaction probability of a logical formula is a smooth function of the parameters of a CTMC. This enables us to select an appropriate class of f...
Directory of Open Access Journals (Sweden)
Ravie c. Muniyandi
2010-01-01
Full Text Available Problem statement: Membrane computing formalism has provided better modeling capabilities for biological systems in comparison to conventional mathematical models. Model checking could be used to reason about the biological system in detail and with precision by verifying formally whether membrane computing model meets the properties of the system. Approach: This study was carried to investigate the preservation of properties of two biological systems that had been modeled and simulated in membrane computing by a method of model checking using PRISM. The two biological systems were prey-predator population and signal processing in the legend-receptor networks of protein TGF-ß. Results: The model checking of membrane computing model of the biological systems with five different properties showed that the properties of the biological systems could be preserved in the membrane computing model. Conclusion: Membrane computing model not only provides a better approach in representing and simulating a biological system but also able to sustain the basic properties of the system.
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
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
A Skyrme-like model with an exact BPS bound
Ferreira, L.A.; Zakrzewski, Wojtek J.
2013-01-01
We propose a new Skyrme-like model with fields taking values on the sphere S^3 or, equivalently, on the group SU(2). The action of the model contains a quadratic kinetic term plus a quartic term which is the same as that of the Skyrme-Faddeev model. The novelty of the model is that it possess a first order Bogomolny type equation whose solutions automatically satisfy the second order Euler-Lagrange equations. It also possesses a lower bound on the static energy which is saturated by the Bogom...
Generalized Skyrme model with the loosely bound potential
Gudnason, Sven Bjarke; Ma, Nana
2016-01-01
We study a generalization of the loosely bound Skyrme model which consists of the Skyrme model with a sixth-order derivative term and the second-order loosely bound potential. We use the rational map approximation for the 4-Skyrmion and calculate the binding energy and estimate the systematic error in using the latter 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.
Holography and entropy bounds in the plane wave matrix model
Bousso, R; Bousso, Raphael; Mints, Aleksey L.
2006-01-01
As a quantum theory of gravity, Matrix theory should provide a realization of the holographic principle, in the sense that a holographic theory should contain one binary degree of freedom per Planck area. We present evidence that Bekenstein's entropy bound, which is related to area differences, is manifest in the plane wave matrix model. If holography is implemented in this way, we predict crossover behavior at strong coupling when the energy exceeds N^2 in units of the mass scale.
Towards Support for Software Model Checking: Improving the Efficiency of Formal Specifications
Directory of Open Access Journals (Sweden)
Salamah Salamah
2011-01-01
presented in this paper provides improved LTL specifications for patterns and scopes over those originally provided by Prospec. This improvement comes in the efficiency of the LTL formulas as measured in terms of the number of states in the Büchi automaton generated for the formula. Minimizing the size of the Büchi automata for an LTL specification provides a significant improvement for model checking software systems using such tools as the highly acclaimed Spin model checker.
Higgs mass bound in the minimal standard model
Heller, U M
1993-01-01
A brief review of the role of the Higgs mechanism and the ensuing Higgs particle in the Minimal Standard Model is given. Then the property of triviality of the scalar sector in the Minimal Standard Model and the upper bound on the Higgs mass that follows is discussed. It is emphasized that the bound is obtained by limiting cutoff effects on physical processes. Actions that allow a parameterization and tuning of the leading cutoff effects are studied both analytically, in the large $N$ limit of the generalization of the $O(4)$ symmetry of the scalar sector to $O(N)$, and numerically for the physical case $N = 4$. Combining those results we show that the Minimal Standard Model will describe physics to an accuracy of a few percent up to energies of the order 2 to 4 times the Higgs mass, $M_H$, only if $M_H \\le 710 \\pm 60 ~ GeV$. This bound is the result of a systematic search in the space of dimension six operators and is expected to hold in the {\\it continuum}. (Complete postscript file can be obtained by anony...
Model checking process algebra of communicating resources for real-time systems
DEFF Research Database (Denmark)
Boudjadar, Jalil; Kim, Jin Hyun; Larsen, Kim Guldstrand;
2014-01-01
, urgentness and resource usage over a dense-time model. The semantic interpretation of PACoR is defined in the form of a timed transition system expressing the timed behavior and dynamic creation of processes. We define a translation of PACoR systems to Parameterized Stopwatch Automata (PSA). The translation...... preserves the original semantics of PACoR and enables the verification of PACoR systems using symbolic model checking in Uppaal and statistical model checking UppaalSMC. Finally we provide an example to illustrate system specification in PACoR, translation and verification.......This paper presents a new process algebra, called PACoR, for real-time systems which deals with resource- constrained timed behavior as an improved version of the ACSR algebra. We define PACoR as a Process Algebra of Communicating Resources which allows to explicitly express preemptiveness...
Model Checking Process Algebra of Communicating Resources for Real-time Systems
DEFF Research Database (Denmark)
Boudjadar, Jalil; Kim, Jin Hyun; Larsen, Kim Guldstrand;
2014-01-01
and resource usage over a dense-time model. The semantic interpretation of PACOR is defined in the form of a timed transition system expressing the timed behavior and dynamic creation of processes. We define a translation of PACOR systems to Parameterized Stopwatch Automata (PSA). The translation preserves...... the original semantics of PACOR and enables the verification of PACOR systems using symbolic model checking in UPPAAL and statistical model checking UPPAAL SMC. Finally we provide an example to illustrate system specification in PACOR, translation and verification.......This paper presents a new process algebra, called PACOR, for real-time systems which deals with resource constrained timed behavior as an improved version of the ACSR algebra. We define PACOR as a Process Algebra of Communicating Resources which allows to express preemptiveness, urgent ness...
Bounding the Practical Error of Path Loss Models
Directory of Open Access Journals (Sweden)
Caleb Phillips
2012-01-01
Full Text Available We seek to provide practical lower bounds on the prediction accuracy of path loss models. We describe and implement 30 propagation models of varying popularity that have been proposed over the last 70 years. Our analysis is performed using a large corpus of measurements collected on production networks operating in the 2.4 GHz ISM, 5.8 GHz UNII, and 900 MHz ISM bands in a diverse set of rural and urban environments. We find that the landscape of path loss models is precarious: typical best-case performance accuracy of these models is on the order of 12–15 dB root mean square error (RMSE and in practice it can be much worse. Models that can be tuned with measurements and explicit data fitting approaches enable a reduction in RMSE to 8-9 dB. These bounds on modeling error appear to be relatively constant, even in differing environments and at differing frequencies. Based on our findings, we recommend the use of a few well-accepted and well-performing standard models in scenarios where a priori predictions are needed and argue for the use of well-validated, measurement-driven methods whenever possible.
Characteristics of successful opinion leaders in a bounded confidence model
Chen, Shuwei; Glass, David H.; McCartney, Mark
2016-05-01
This paper analyses the impact of competing opinion leaders on attracting followers in a social group based on a bounded confidence model in terms of four characteristics: reputation, stubbornness, appeal and extremeness. In the model, reputation differs among leaders and normal agents based on the weights assigned to them, stubbornness of leaders is reflected by their confidence towards normal agents, appeal of the leaders is represented by the confidence of followers towards them, and extremeness is captured by the opinion values of leaders. Simulations show that increasing reputation, stubbornness or extremeness makes it more difficult for the group to achieve consensus, but increasing the appeal will make it easier. The results demonstrate that successful opinion leaders should generally be less stubborn, have greater appeal and be less extreme in order to attract more followers in a competing environment. Furthermore, the number of followers can be very sensitive to small changes in these characteristics. On the other hand, reputation has a more complicated impact: higher reputation helps the leader to attract more followers when the group bound of confidence is high, but can hinder the leader from attracting followers when the group bound of confidence is low.
Quantum position verification in bounded-attack-frequency model
Gao, Fei; Liu, Bin; Wen, QiaoYan
2016-11-01
In 2011, Buhrman et al. proved that it is impossible to design an unconditionally secure quantum position verification (QPV) protocol if the adversaries are allowed to previously share unlimited entanglements. Afterwards, people started to design secure QPV protocols in practical settings, e.g. the bounded-storage model, where the adversaries' pre-shared entangled resources are supposed to be limited. Here we focus on another practical factor that it is very difficult for the adversaries to perform attack operations with unlimitedly high frequency. Concretely, we present a new kind of QPV protocols, called non-simultaneous QPV. And we prove the security of a specific non-simultaneous QPV protocol with the assumption that the frequency of the adversaries' attack operations is bounded, but no assumptions on their pre-shared entanglements or quantum storage. Actually, in our nonsimultaneous protocol, the information whether there comes a signal at present time is also a piece of command. It renders the adversaries "blind", that is, they have to execute attack operations with unlimitedly high frequency no matter whether a signal arrives, which implies the non-simultaneous QPV is also secure in the bounded-storage model.
A variational study of bound states in the Higgs model
Siringo, F
2000-01-01
The possible existence of Higgs-Higgs bound states in the Higgs sector of the Standard Model is explored using the |hh>+|hhh> variational ansatz of Di Leo and Darewych. The resulting integral equations can be decoupled exactly, yielding a one-dimensional integral equation, solved numerically. We thereby avoid the extra approximations employed by Di Leo and Darewych, and we find a qualitatively different mass renormalization. Within the conventional scenario, where a not-too-large cutoff is invoked to avoid "triviality", we find, as usual, an upperbound on the Higgs mass. Bound-state solutions are only found in the very strong coupling regime, but at the same time a relatively small physical mass is required as a consequence of renormalization.
Modifying the pion mass in the loosely bound Skyrme model
Gudnason, Sven Bjarke
2016-01-01
We study the loosely bound Skyrme model with the addition of two different pion mass terms; this is the most general potential of polynomial form up to second order in the trace of the Skyrme field. The two pion mass terms are called the standard pion mass term and the modified pion mass term. We find that the binding energies are not reduced by the introduction of the modified pion mass, but slightly larger values of the coefficient of the loosely bound potential are allowed when the modified pion mass term is used compared to the standard pion mass term. We find by increasing the overall pion mass that we can reduce the classical binding energy of the 4-Skyrmion to the 2.7% level and the total binding energy including the contribution from spin/isospin quantization is reduced to the 5.8% level.
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.
Bounds for perpetual American option prices in a jump diffusion model
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.
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.
Directory of Open Access Journals (Sweden)
Nacer Tabib
2016-01-01
Full Text Available This paper proposes a new framework based on Binary Decision Diagrams (BDD for the graph distribution problem in the context of explicit model checking. The BDD are yet used to represent the state space for a symbolic verification model checking. Thus, we took advantage of high compression ratio of BDD to encode not only the state space, but also the place where each state will be put. So, a fitness function that allows a good balance load of states over the nodes of an homogeneous network is used. Furthermore, a detailed explanation of how to calculate the inter-site edges between different nodes based on the adapted data structure is presented.
Combining search space partition and search Space partition and abstraction for LTL model checking
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
The state space explosion problem is still the key obstacle for applying model checking to systems of industrial size.Abstraction-based methods have been particularly successful in this regard.This paper presents an approach based on refinement of search space partition and abstraction which combines these two techniques for reducing the complexity of model checking.The refinement depends on the representation of each portion of search space. Especially, search space can be refined stepwise to get a better reduction. As reported in the case study, the Integration of search space partition and abstraction improves the efficiencyof verification with respect to the requirement of memory and obtains significant advantage over the use of each of them in isolation.
On the Model Checking of the SpaceWire Link Interface
Directory of Open Access Journals (Sweden)
Jie Zhang
2013-02-01
Full Text Available In this paper we display a practical approach adopted for the formal verification of SpaceWire using model checking to solve state explosion. SpaceWire is a high-speed, full-duplex serial bus standard which is applied in aerospace, so its functions have a very high accuracy requirements. In order to prove the design of the SpaceWire was faithfully implements the SpaceWire protocol’s specification , we present our experience on the model checking of SpaceWire link interface using the Cadence SMV tool. We applied environment state machine to overcome state explosion and successfully verified a number of relevant properties about transmitter and controller of the SpaceWire in reasonable CPU time.
Institute of Scientific and Technical Information of China (English)
ZHANG WenHui (张文辉)
2003-01-01
Memory is one of the critical resources in model checking. This paper discusses a strategy for reducing peak memory in model checking by case-based partitioning of the search space. This strategy combines model checking for verification of different cases and static analysis or expert judgment for guaranteeing the completeness of the cases. Description of the static analysis is based on using PROMELA as the modeling language. The strategy is applicable to a subset of models including models for verification of certain aspects of protocols.
Analysis of DGNB-DK criteria for BIM-based Model Checking automatization
DEFF Research Database (Denmark)
Gade, Peter; 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)....
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.
Model checking software for phylogenetic trees using distribution and database methods.
Requeno, José Ignacio; Colom, José Manuel
2013-01-01
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. PMID:24231143
Combination of Model Checking and Theorem Proving to Verify Embedded Software
Institute of Scientific and Technical Information of China (English)
XIAO Jian-yu; ZHANG De-yun; DONG Hao; CHEN Hai-quan
2005-01-01
In this paper, a scheme of combining model checking and theorem proving techniques to verify high trustworthy embedded software is proposed. The software model described in state machine of unified model language is transformed into the input modeling language of a model checker in which the model is analyzed with associated property specifications expressed in temporal logic. The software model which has been verified by model checker is then transformed into abstract specifications of a theorem prover , in which the model will be refined, verified and translated into source C code. The transformation rules from state machine to input language of model checker and abstract specifications of theorem prover are given. The experiment shows that the proposed scheme can effectively improve the development and verification of high trustworthy embedded software.
Model Checking Verification and Validation at JPL and the NASA Fairmont IV and V Facility
Schneider, Frank; Easterbrook, Steve; Callahan, Jack; Montgomery, Todd
1999-01-01
We show how a technology transfer effort was carried out. The successful use of model checking on a pilot JPL flight project demonstrates the usefulness and the efficacy of the approach. The pilot project was used to model a complex spacecraft controller. Software design and implementation validation were carried out successfully. To suggest future applications we also show how the implementation validation step can be automated. The effort was followed by the formal introduction of the modeling technique as a part of the JPL Quality Assurance process.
Stieltjes electrostatic model interpretation for bound state problems
Indian Academy of Sciences (India)
K V S Shiv Chaitanya
2014-07-01
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\\hbar$, which are placed in between the two fixed imaginary charges arising due to the classical turning points of the potential. The interaction potential between unit moving imaginary charges $i\\hbar$ is given by the logarithm of the wave function. For an exactly solvable potential, this system attains stable equilibrium position at the zeros of the orthogonal polynomials depending upon the interval of the classical turning points.
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...... function if only partial failure information is available. An example is provided. © 2012 Copyright Taylor and Francis Group, LLC....
Combining Explicit and Symbolic Approaches for Better On-the-Fly LTL Model Checking
Duret-Lutz, Alexandre; Poitrenaud, Denis; Thierry-Mieg, Yann
2011-01-01
We present two new hybrid techniques that replace the synchronized product used in the automata-theoretic approach for LTL model checking. The proposed products are explicit graphs of aggregates (symbolic sets of states) that can be interpreted as B\\"uchi automata. These hybrid approaches allow on the one hand to use classical emptiness-check algorithms and build the graph on-the-fly, and on the other hand, to have a compact encoding of the state space thanks to the symbolic representation of the aggregates. The Symbolic Observation Product assumes a globally stuttering property (e.g., LTL \\ X) to aggregate states. The Self-Loop Aggregation Product} does not require the property to be globally stuttering (i.e., it can tackle full LTL), but dynamically detects and exploits a form of stuttering where possible. Our experiments show that these two variants, while incomparable with each other, can outperform other existing approaches.
Model-Checking the Higher-Dimensional Modal mu-Calculus
Lange, Martin; 10.4204/EPTCS.77.6
2012-01-01
The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in polynomial time, and conversely every polynomial-time decidable problem that has a bisimulation-invariant encoding into labeled transition systems can also be defined in the higher-dimensional modal mu-calculus. We exemplify the latter connection by giving several examples of decision problems which reduce to model checking of the higher-dimensional modal mu-calculus for some fixed formulas. This way generic model checking algorithms for the logic can then be used via partial evaluation in order to obtain algorithms for theses problems which may benefit from improvements that are well-established in the field of program verification, namely on-the-fly and symbolic techniques. The aim of this work is to extend such techniques to other fields as well, here exemplarily done for process...
Sediment depositions upstream of open check dams: new elements from small scale models
Piton, Guillaume; Le Guern, Jules; Carbonari, Costanza; Recking, Alain
2015-04-01
numbers that the flows tend to adopt? New small scale model experiments have been undertaken focusing on depositions processes and their related hydraulics. Accurate photogrammetric measurements allowed us to better describe the deposition processes3. Large Scale Particle Image Velocimetry (LS-PIV) was performed to determine surface velocity fields in highly active channels with low grain submersion4. We will present preliminary results of our experiments showing the new elements we observed in massive deposit dynamics. REFERENCES 1.Armanini, A., Dellagiacoma, F. & Ferrari, L. From the check dam to the development of functional check dams. Fluvial Hydraulics of Mountain Regions 37, 331-344 (1991). 2.Piton, G. & Recking, A. Design of sediment traps with open check dams: a review, part I: hydraulic and deposition processes. (Accepted by the) Journal of Hydraulic Engineering 1-23 (2015). 3.Le Guern, J. Ms Thesis: Modélisation physique des plages de depot : analyse de la dynamique de remplissage.(2014) . 4.Carbonari, C. Ms Thesis: Small scale experiments of deposition processes occuring in sediment traps, LS-PIV measurments and geomorphological descriptions. (in preparation).
Unitarity bound in the most general two Higgs doublet model
Directory of Open Access Journals (Sweden)
Shinya Kanemura
2015-12-01
Full Text Available We investigate unitarity bounds in the most general two Higgs doublet model without a discrete Z2 symmetry nor CP conservation. S-wave amplitudes for two-body elastic scatterings of Nambu–Goldstone bosons and physical Higgs bosons are calculated at high energies for all possible initial and final states (14 neutral, 8 singly-charged and 3 doubly-charged states. We obtain analytic formulae for the block-diagonalized scattering matrix by the classification of the two body scattering states using the conserved quantum numbers at high energies. Imposing the condition of perturbative unitarity to the eigenvalues of the scattering matrix, constraints on the model parameters can be obtained. We apply our results to constrain the mass range of the next-to-lightest Higgs state in the model.
An Efficient Explicit-time Description Method for Timed Model Checking
Wang, Hao; 10.4204/EPTCS.14.6
2009-01-01
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 p...
Model Checking and Code Generation for UML Diagrams Using Graph Transformation
Directory of Open Access Journals (Sweden)
Wafa Chama
2012-12-01
Full Text Available UML is considered as the standard for object-oriented modelling language adopted by the ObjectManagement Group. However, UML has been criticized due to the lack of formal semantics and theambiguity of its models. In other hands, UML models can be mathematically verified and checked by usingits equivalent formal representation. So, in this paper, we propose an approach and a tool based on graphtransformation to perform an automatic mapping for verification purposes. This transformation aims tobridge the gap between informal and formal notations and allows a formal verification of concurrent UMLmodels using Maude language. We consider both static (Class Diagram and dynamic (StateChart andCommunication Diagrams features of concurrent object-oriented system. Then, we use Maude LTL ModelChecker to verify the formal model obtained (Automatic Code Generation Maude. The meta-modellingAToM3 tool is used. A case study is presented to illustrate our approach.
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.
Directory of Open Access Journals (Sweden)
Christian Krause
2011-11-01
Full Text Available The assurance of quality of service properties is an important aspect of service-oriented software engineering. Notations for so-called service level agreements (SLAs, such as the Web Service Level Agreement (WSLA language, provide a formal syntax to specify such assurances in terms of (legally binding contracts between a service provider and a customer. On the other hand, formal methods for veriﬁcation of probabilistic real-time behavior have reached a level of expressiveness and efﬁciency which allows to apply them in real-world scenarios. In this paper, we suggest to employ the recently introduced model of Interval Probabilistic Timed Automata (IPTA for formal veriﬁcation of QoS properties of service-oriented systems. Speciﬁcally, we show that IPTA in contrast to Probabilistic Timed Automata (PTA are able to capture the guarantees speciﬁed in SLAs directly. A particular challenge in the analysis of IPTA is the fact that their naive semantics usually yields an inﬁnite set of states and inﬁnitely-branching transitions. However, using symbolic representations, IPTA can be analyzed rather efﬁciently. We have developed the ﬁrst implementation of an IPTA model checker by extending the PRISM tool and show that model checking IPTA is only slightly more expensive than model checking comparable PTA.
Lochbihler, Andreas
2012-01-01
The Java programming language provides safety and security guarantees such as type safety and its security architecture. They distinguish it from other mainstream programming languages like C and C++. In this work, we develop a machine-checked model of concurrent Java and the Java memory model and investigate the impact of concurrency on these guarantees. From the formal model, we automatically obtain an executable verified compiler to bytecode and a validated virtual machine.
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...... often exact and ex- perimentally tight. The technique is implemented in the new tool Casaal that we seamlessly connect to Uppaal-smc in a tool chain. We demon- strate the applicability of our technique and the efficiency of our imple- mentation through a number of case-studies....
Three-nucleon bound states using realistic potential models
Nogga, A.; Kievsky, A.; Kamada, H.; Glöckle, W.; Marcucci, L. E.; Rosati, S.; Viviani, M.
2003-03-01
The bound states of 3H and 3He have been calculated by using the Argonne v18 plus the Urbana IX three-nucleon potential. The isospin T=3/2 state have been included in the calculations as well as the n-p mass difference. The 3H-3He mass difference has been evaluated through the charge-dependent terms explicitly included in the two-body potential. The calculations have been performed using two different methods: the solution of the Faddeev equations in momentum space and the expansion on the correlated hyperspherical harmonic basis. The results are in agreement within 0.1% and can be used as benchmark tests. Results for the charge-dependent Bonn interaction in conjunction with the Tucson-Melbourne three-nucleon force are also presented. It is shown that the 3H and 3He binding energy difference can be predicted model independently.
The three-nucleon bound state using realistic potential models
Nogga, A; Kamada, H; Glöckle, W; Marcucci, L E; Rosati, S; Viviani, M
2003-01-01
The bound states of $^3$H and $^3$He have been calculated using the Argonne $v_{18}$ plus the Urbana three-nucleon potential. The isospin $T=3/2$ state have been included in the calculations as well as the $n$-$p$ mass difference. The $^3$H-$^3$He mass difference has been evaluated through the charge dependent terms explicitly included in the two-body potential. The calculations have been performed using two different methods: the solution of the Faddeev equations in momentum space and the expansion on the correlated hyperspherical harmonic basis. The results are in agreement within 0.1% and can be used as benchmark tests. Results for the CD-Bonn interaction are also presented. It is shown that the $^3$H and $^3$He binding energy difference can be predicted model independently.
An Evaluation Framework for Energy Aware Buildings using Statistical Model Checking
DEFF Research Database (Denmark)
David, Alexandre; Du, DeHui; Larsen, Kim Guldstrand;
2012-01-01
properties of this formalisms. A particular kind of cyber-physical systems are Smart Grids which together with Intelligent, Energy Aware Buildings will play a major role in achieving an energy efficient society of the future. In this paper we present a framework in Uppaal-smc for energy aware buildings......Cyber-physical systems are to be found in numerous applications throughout society. The principal barrier to develop trustworthy cyber-physical systems is the lack of expressive modelling and specification for- malisms supported by efficient tools and methodologies. To overcome this barrier, we...... extend in this paper the modelling formalism of the tool Uppaal-smc to stochastic hybrid automata, thus providing the expressive power required for modeling complex cyber-physical systems. The application of Statistical Model Checking provides a highly scalable technique for analyzing performance...
Bringing Automated Model Checking to PLC Program Development - A CERN Case Study
Fernandez Adiego, B; Tournier, J-C; Blanco Vinuela, E; Gonzalez Suarez, V M
2014-01-01
Verification of critical software is a high priority but a challenging task for industrial control systems. Model checking appears to be an appropriate approach for this purpose. However, this technique is not widely used in industry yet, due to some obstacles. The main obstacles encountered when trying to apply formal verification techniques at industrial installations are the difficulty of creating models out of PLC programs and defining formally the specification requirements. In addition, models produced out of real-life programs have a huge state space, thus preventing the verification due to performance issues. Our work at CERN (European Organization for Nuclear Research) focuses on developing efficient automatic verification methods for industrial critical installations based on PLC (Programmable Logic Controller) control systems. In this paper, we present a tool generating automatically formal models out of PLC code. The tool implements a general methodology which can support several input languages, ...
A Skyrme-like model with an exact BPS bound
Ferreira, L A
2013-01-01
We propose a new Skyrme-like model with fields taking values on the sphere S^3 or, equivalently, on the group SU(2). The action of the model contains a quadratic kinetic term plus a quartic term which is the same as that of the Skyrme-Faddeev model. The novelty of the model is that it possess a first order Bogomolny type equation whose solutions automatically satisfy the second order Euler-Lagrange equations. It also possesses a lower bound on the static energy which is saturated by the Bogomolny solutions. Such Bogomolny equation is equivalent to the so-called force free equation used in plasma and solar Physics, and which possesses large classes of solutions. An old result due to Chandrasekhar prevents the existence of finite energy solutions for the force free equation on the entire tridimensional space R^3. We construct new exact finite energy solutions to the Bogomolny equations for the case where the space is the three-sphere S^3, using toroidal like coordinates.
A Skyrme-like model with an exact BPS bound
Ferreira, L. A.; Zakrzewski, Wojtek J.
2013-09-01
We propose a new Skyrme-like model with fields taking values on the sphere S 3 or, equivalently, on the group SU(2). The action of the model contains a quadratic kinetic term plus a quartic term which is the same as that of the Skyrme-Faddeev model. The novelty of the model is that it possess a first order Bogomolny type equation whose solutions automatically satisfy the second order Euler-Lagrange equations. It also possesses a lower bound on the static energy which is saturated by the Bogomolny solutions. Such Bogomolny equation is equivalent to the so-called force free equation used in plasma and solar Physics, and which possesses large classes of solutions. An old result due to Chandrasekhar prevents the existence of finite energy solutions for the force free equation on the entire three-dimensional space . We construct new exact finite energy solutions to the Bogomolny equations for the case where the space is the three-sphere S 3, using toroidal like coordinates.
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.
Model Checking Artificial Intelligence Based Planners: Even the Best Laid Plans Must Be Verified
Smith, Margaret H.; Holzmann, Gerard J.; Cucullu, Gordon C., III; Smith, Benjamin D.
2005-01-01
Automated planning systems (APS) are gaining acceptance for use on NASA missions as evidenced by APS flown On missions such as Orbiter and Deep Space 1 both of which were commanded by onboard planning systems. The planning system takes high level goals and expands them onboard into a detailed of action fiat the spacecraft executes. The system must be verified to ensure that the automatically generated plans achieve the goals as expected and do not generate actions that would harm the spacecraft or mission. These systems are typically tested using empirical methods. Formal methods, such as model checking, offer exhaustive or measurable test coverage which leads to much greater confidence in correctness. This paper describes a formal method based on the SPIN model checker. This method guarantees that possible plans meet certain desirable properties. We express the input model in Promela, the language of SPIN and express the properties of desirable plans formally.
Enriched MU-Calculi Module Checking
Ferrante, Alessandro; Parente, Mimmo
2008-01-01
The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we further investigate this problem with respect to the Mu-calculus enriched with nominals and graded modalities (hybrid graded Mu-calculus), in both the finite-state and infinite-state settings. Using an automata-theoretic approach, we show that hybrid graded Mu-calculus module checking is solvable in exponential time, while hybrid graded Mu-calculus pushdown module checking is solvable in double-exponential time. These results are also tight since they match the known lower bounds for Ctl. We also investigate the module checking problem with respect to the hybrid graded Mu-calculus enriched with inverse programs (Fully enriched Mu-calculus): by showing a reduction from the domino problem, we show its undecidability. We conclude with a short overview of the model checking problem ...
WAVE EQUATION MODEL FOR SHIP WAVES IN BOUNDED SHALLOW WATER
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Ships were modelled as moving pressure disturbances on the free surface of a shallow water basin in the present paper.The moving-pressure generating waves were subjected to the reflection of land boundaries and the radiation of open boundaries.This paper proposed and examined a wave equation model (WEM) to solve the shallow water equations with moving surface pressures simulating ship waves in a bounded shallow water region.The Galerkin finite element method was used to solve a second order wave equation for the free surface elevations and the hydrodynamic pressure of the ship bottom simultaneously.Horizontal velocities were obtained from the momentum equations.Numerical solutions of Series 60 CB=0.6 ships moving with the depth Froude number of Fh=0.6, 1.0, 1.3 in a rectangular shallow water harbor were investigated.Three dimensional surface elevation profiles and the depth-averaged horizontal velocities were analysed.The numerical results characterised very well the ship waves in shallow water.Strong boundary reflection waves were found in the case of high depth Froude number (Fh=1.3).Waves generated by the interactions of two ships moving in the same directions and in the opposite directions were also numerically investigated in the present study.
Perturbative Unitarity Bounds in Composite 2-Higgs Doublet Models
De Curtis, Stefania; Yagyu, Kei; Yildirim, Emine
2016-01-01
We study bounds from perturbative unitarity in a Composite 2-Higgs Doublet Model (C2HDM) based on the spontaneous breakdown of a global symmetry $SO(6)\\to SO(4)\\times SO(2)$ at the compositeness scale $f$. The eight pseudo Nambu-Goldstone Bosons (pNGBs) emerging from such a dynamics are identified as two isospin doublet Higgs fields. We calculate the $S$-wave amplitude for all possible 2-to-2-body elastic (pseudo)scalar boson scatterings at energy scales $\\sqrt{s}$ reachable at the Large Hadron Collider (LHC) and beyond it, including the longitudinal components of weak gauge boson states as the corresponding pNGB states. In our calculation, the Higgs potential is assumed to have the same form as that in the Elementary 2-Higgs Doublet Model (E2HDM) with a discrete $Z_2$ symmetry, which is expected to be generated at the one-loop level via the Coleman-Weinberg (CW) mechanism. We find that the $S$-wave amplitude matrix can be block-diagonalized with maximally $2\\times 2$ submatrices in a way similar to the E2HDM...
Notes on shear viscosity bound violation in anisotropic models
Ge, Xian-Hui
2015-01-01
The shear viscosity bound violation in Einstein gravity for anisotropic black branes is discussed, with the aim of constraining the deviation of the shear viscosity-entropy density ratio from the shear viscosity bound using causality and thermodynamics analysis. The results show that no stringent constraints can be imposed. The diffusion bound in anisotropic phases is also studied. Ultimately, it is concluded that shear viscosity violation always occurs in cases where the equation of motion of the metric fluctuations cannot be written in a form identical to that of the minimally coupled massless scalar fields.
Application of a hazard-based visual predictive check to evaluate parametric hazard models.
Huh, Yeamin; Hutmacher, Matthew M
2016-02-01
Parametric models used in time to event analyses are evaluated typically by survival-based visual predictive checks (VPC). Kaplan-Meier survival curves for the observed data are compared with those estimated using model-simulated data. Because the derivative of the log of the survival curve is related to the hazard--the typical quantity modeled in parametric analysis--isolation, interpretation and correction of deficiencies in the hazard model determined by inspection of survival-based VPC's is indirect and thus more difficult. The purpose of this study is to assess the performance of nonparametric hazard estimators of hazard functions to evaluate their viability as VPC diagnostics. Histogram-based and kernel-smoothing estimators were evaluated in terms of bias of estimating the hazard for Weibull and bathtub-shape hazard scenarios. After the evaluation of bias, these nonparametric estimators were assessed as a method for VPC evaluation of the hazard model. The results showed that nonparametric hazard estimators performed reasonably at the sample sizes studied with greater bias near the boundaries (time equal to 0 and last observation) as expected. Flexible bandwidth and boundary correction methods reduced these biases. All the nonparametric estimators indicated a misfit of the Weibull model when the true hazard was a bathtub shape. Overall, hazard-based VPC plots enabled more direct interpretation of the VPC results compared to survival-based VPC plots. PMID:26563504
Pricing bounds for discrete arithmetic Asian options under Lévy models
Lemmens, D.; Liang, L. Z. J.; Tempere, J.; De Schepper, A.
2010-11-01
Analytical bounds for Asian options are almost exclusively available in the Black-Scholes framework. In this paper we derive bounds for the price of a discretely monitored arithmetic Asian option when the underlying asset follows an arbitrary Lévy process. Explicit formulas are given for Kou’s model, Merton’s model, the normal inverse Gaussian model, the CGMY model and the variance gamma model. The results are compared with the comonotonic upper bound, existing numerical results, Monte carlo simulations and in the case of the variance gamma model with an existing lower bound. The method outlined here provides lower and upper bounds that are quick to evaluate, and more accurate than existing bounds.
Taming Numbers and Durations in the Model Checking Integrated Planning System
Edelkamp, S
2011-01-01
The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures. MIPS has shown distinguished performance in the last two international planning competitions. In the last event the description language was extended from pure propositional planning to include numerical state variables, action durations, and plan quality objective functions. Plans were no longer sequences of actions but time-stamped schedules. As a participant of the fully automated track of the competition, MIPS has proven to be a general system; in each track and every benchmark domain it efficiently computed plans of remarkable quality. This article introduces and analyzes the most important algorithmic novelties that were necessary to tackle the new layers of expressiven...
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
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 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...... 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...
Two-vibron bound states in the β-Fermi-Pasta-Ulam model
Institute of Scientific and Technical Information of China (English)
Hu Xin-Guang; 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.
Extended FRAM by Integrating with Model Checking to Effectively Explore Hazard Evolution
Directory of Open Access Journals (Sweden)
Guihuan Duan
2015-01-01
Full Text Available Functional Resonance Analysis Method (FRAM, which defines a systemic framework to model complex systems from the perspective of function and views accidents as emergent phenomenon of function’s variability, is playing an increasingly significant role in the development of systemic accident theory. However, as FRAM is typically taken as a theoretic method, there is a lack of specific approaches or supportive tools to bridge the theory and practice. To fill the gap and contribute to the development of FRAM, (1 function’s variability was described further, with the rules of interaction among variability of different functions being determined and (2 the technology of model checking (MC was used for the analysis of function’s variability to automatically search the potential paths that could lead to hazards. By means of MC, system’s behaviors (normal or abnormal are simulated and the counter example(s that violates the safety constraints and requirements can be provided, if there is any, to improve the system design. The extended FRAM approach was applied to a typical air accident analysis, with more details drawn than the conclusions in the accident report issued officially by Agenzia Nazionale per la Sicurezza del Volo (ANSV.
Improved shape hardening function for bounding surface model for cohesive soils
Institute of Scientific and Technical Information of China (English)
Andrés Nieto-Leal; Victor N.Kaliakin
2014-01-01
A shape hardening function is developed that improves the predictive capabilities of the generalized bounding surface model for cohesive soils, especially when applied to overconsolidated specimens. This improvement is realized without any changes to the simple elliptical shape of the bounding surface, and actually reduces the number of parameters associated with the model by one.
Improved shape hardening function for bounding surface model for cohesive soils
Directory of Open Access Journals (Sweden)
Andrés Nieto-Leal
2014-08-01
Full Text Available A shape hardening function is developed that improves the predictive capabilities of the generalized bounding surface model for cohesive soils, especially when applied to overconsolidated specimens. This improvement is realized without any changes to the simple elliptical shape of the bounding surface, and actually reduces the number of parameters associated with the model by one.
Skyrmion model in 2+1 dimensions with soliton bound states
Energy Technology Data Exchange (ETDEWEB)
Piette, B.; Zakrzewski, W.J. (Dept. of Mathematical Sciences, Univ. Durham (United Kingdom))
1993-03-22
We consider a class of skyrmion models in 2+1 dimensions which possess bound stable solitons. We show that these models have one-soliton solutions as well as static solutions corresponding to their bound states. We study the scattering and stability properties of these solutions, compute their energies and estimate their binding energies. (orig.).
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.
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...
Dependence in probabilistic modeling, Dempster-Shafer theory, and probability bounds analysis.
Energy Technology Data Exchange (ETDEWEB)
Oberkampf, William Louis; Tucker, W. Troy (Applied Biomathematics, Setauket, NY); Zhang, Jianzhong (Iowa State University, Ames, IA); Ginzburg, Lev (Applied Biomathematics, Setauket, NY); Berleant, Daniel J. (Iowa State University, Ames, IA); Ferson, Scott (Applied Biomathematics, Setauket, NY); Hajagos, Janos (Applied Biomathematics, Setauket, NY); Nelsen, Roger B. (Lewis & Clark College, Portland, OR)
2004-10-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.
Evading Lyth bound in models of quintessential inflation
International Nuclear Information System (INIS)
Quintessential inflation refers to an attempt to unify inflation and late-time cosmic acceleration using a single scalar field. In this letter we consider two different classes of quintessential inflation, one of which is based upon a Lagrangian with non-canonical kinetic term k2(ϕ)∂μϕ∂μϕ and a steep exponential potential while the second class uses the concept of steep brane world inflation. We show that in both cases the Lyth bound can be evaded, despite the large tensor-to-scalar ratio of perturbations. The post-inflationary dynamics is consistent with nucleosynthesis constraint in these cases
Automated parameter estimation for biological models using Bayesian statistical model checking
Hussain, Faraz; Langmead, Christopher J.; Mi, Qi; Dutta-Moscato, Joyeeta; Vodovotz, Yoram; Jha, Sumit K.
2015-01-01
Background 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 mode...
Mixed and Mixture Regression Models for Continuous Bounded Responses Using the Beta Distribution
Verkuilen, Jay; Smithson, Michael
2012-01-01
Doubly bounded continuous data are common in the social and behavioral sciences. Examples include judged probabilities, confidence ratings, derived proportions such as percent time on task, and bounded scale scores. Dependent variables of this kind are often difficult to analyze using normal theory models because their distributions may be quite…
Model of bound interface dynamics for coupled magnetic domain walls
Politi, P.; Metaxas, P. J.; Jamet, J.-P.; Stamps, R. L.; Ferré, J.
2011-08-01
A domain wall in a ferromagnetic system will move under the action of an external magnetic field. Ultrathin Co layers sandwiched between Pt have been shown to be a suitable experimental realization of a weakly disordered 2D medium in which to study the dynamics of 1D interfaces (magnetic domain walls). The behavior of these systems is encapsulated in the velocity-field response v(H) of the domain walls. In a recent paper [P. J. Metaxas , Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.104.237206 104, 237206 (2010)] we studied the effect of ferromagnetic coupling between two such ultrathin layers, each exhibiting different v(H) characteristics. The main result was the existence of bound states over finite-width field ranges, wherein walls in the two layers moved together at the same speed. Here we discuss in detail the theory of domain wall dynamics in coupled systems. In particular, we show that a bound creep state is expected for vanishing H and we give the analytical, parameter free expression for its velocity which agrees well with experimental results.
An error bound for a discrete reduced order model of a linear multivariable system
Al-Saggaf, Ubaid M.; Franklin, Gene F.
1987-01-01
The design of feasible controllers for high dimension multivariable systems can be greatly aided by a method of model reduction. In order for the design based on the order reduction to include a guarantee of stability, it is sufficient to have a bound on the model error. Previous work has provided such a bound for continuous-time systems for algorithms based on balancing. In this note an L-infinity bound is derived for model error for a method of order reduction of discrete linear multivariable systems based on balancing.
A heterogeneous boundedly rational expectation model for housing market
Institute of Scientific and Technical Information of China (English)
Andrew Y. T. LEUNG; Jia-na XU; Wing Shum TSUI
2009-01-01
This research aims to test the housing price dynamics when considering heterogeneous boundedly rational expectations such as naive expectation, adaptive expectation and biased belief. The housing market is investigated as an evolutionary system with heterogeneous and competing expectations. The results show that the dynamics of the expected housing price varies substantially when heterogeneous expectations are considered together with some other endogenous factors. Simulation results explain some stylized phenomena such as equilibrium or oscillation, convergence or divergence, and over-shooting or under-shooting. Furthermore, the results suggest that variation of the proportion of groups of agents is basically dependent on the selected strategies. It also indicates that control policies should be chosen carefully in consistence with a unique real estate market during a unique period since certain parameter portfolio may increase or suppress oscillation.
Model Checking for a Class of Performance Properties of Fluid Stochastic Models
Bujorianu, L.M.; Bujorianu, M.C.; Horváth, A.; Telek, M.
2006-01-01
Recently, there is an explosive development of fluid approa- ches to computer and distributed systems. These approaches are inherently stochastic and generate continuous state space models. Usually, the performance measures for these systems are defined using probabilities of reaching certain sets o
Tools for model-independent bounds in direct dark matter searches
Del Nobile, Eugenio; Panci, Paolo
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 any arbitrary model of Dark Matter.
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....
Two-hole bound states in modified t-J model
Kuchiev, M Yu
1995-01-01
We consider modified $t-J$ model with minimum of single-hole dispersion at the points $(0,\\pm \\pi)$, $(\\pm \\pi,0)$. It is shown that two holes on antiferromagnetic background produce a bound state which properties strongly differs from the states known in the unmodified $t-J$ model. The bound state is d-wave, it has four nodes on the face of the magnetic Brillouin zone. However, in the coordinate representation it looks like as usual s-wave.
ROBUST DESIGN MODELS FOR CUSTOMER-SPECIFIED BOUNDS ON PROCESS PARAMETERS
Institute of Scientific and Technical Information of China (English)
Sangmun SHIN; Byung Rae CHO
2006-01-01
Robust design (RD) has received much attention from researchers and practitioners for years, and a number of methodologies have been studied in the research community. The majority of existing RD models focus on the minimum variability with a zero bias. However, it is often the case that the customer may specify upper bounds on one of the two process parameters (i.e., the process mean and variance). In this situation, the existing RD models may not work efficiently in incorporating the customer's needs. To this end, we propose two simple RD models using the ε-constraint feasible region method - one with an upper bound of process bias specified and the other with an upper bound on process variability specified. We then conduct a case study to analyze the effects of upper bounds on each of the process parameters in terms of optimal operating conditions and mean squarederror.
Institute of Scientific and Technical Information of China (English)
Ding Jun YAO; Rong Ming WANG
2008-01-01
The authors consider two discrete-time insurance risk models. Two moving average risk models are introduced to model the surplus process, and the probabilities of ruin are examined in models with a constant interest force. Exponential bounds for ruin probabilities of an infinite time horizon are derived by the martingale method.
Error Bounds in the Phased Array Antenna. A statistical Model
Vellekoop, A.R.; Snoeij, P.; Koomen, P.J.
1991-01-01
Expressions are generated for the probabilistic analysis of phased-array antenna-pattern degradation subject to random errors in the excitation coefficients and angle measurement errors by means of a model based upon a statistical coefficient of variation model. The expressions are exercised and com
Computational and Game-Theoretic Approaches for Modeling Bounded Rationality
L. Waltman (Ludo)
2011-01-01
textabstractThis thesis studies various computational and game-theoretic approaches to economic modeling. Unlike traditional approaches to economic modeling, the approaches studied in this thesis do not rely on the assumption that economic agents behave in a fully rational way. Instead, economic age
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...... bounds within this class of composites. A comparison of the computational results with the globally optimal bounds given via rank-N layered composites illustrates the behaviour for tension and shear load situations, as well as the importance of considering the shape of the basic unit cell as part...
Surface-bounded growth modeling applied to human mandibles
DEFF Research Database (Denmark)
Andresen, Per Rønsholt
1999-01-01
This thesis presents mathematical and computational techniques for three dimensional growth modeling applied to human mandibles. The longitudinal shape changes make the mandible a complex bone. The teeth erupt and the condylar processes change direction, from pointing predominantly backward...
Model checking of time Petri nets using the state class timed automaton
DEFF Research Database (Denmark)
Lime, Didier; Roux, Olivier H.
2006-01-01
behavioral semantics of the TPN (the initial TPN and the obtained TA are proved timed-bisimilar). It allows us to check real-time properties on TPN by using the state class TA. This can be done efficiently thanks to a reduction of the number of clocks. We have implemented the method, and give some...... experimental results illustrating the efficiency of the translation algorithm in terms of number of clocks. Using the state class TA, we also give a framework for expressing and efficiently verifying TCTL properties on the initial TPN....
Hong, Sungwook E.; Park, Changbom; Kim, Juhan
2016-01-01
We develop a galaxy assignment scheme that populates dark matter halos with galaxies by tracing the most bound member particles (MBPs) of simulated halos. Several merger-timescale models based on analytic calculations and numerical simulations are adopted as the survival time of mock satellite galaxies. We build mock galaxy samples from halo merger data of the Horizon Run 4 $N$-body simulation from $z = 12-0$. We compare group properties and two-point correlation functions (2pCFs) of mock gal...
Dimer model for Tau proteins bound in microtubule bundles
Hall, Natalie; Kluber, Alexander; Hayre, N. Robert; Singh, Rajiv; Cox, Daniel
2013-03-01
The microtubule associated protein tau is important in nucleating and maintaining microtubule spacing and structure in neuronal axons. Modification of tau is implicated as a later stage process in Alzheimer's disease, but little is known about the structure of tau in microtubule bundles. We present preliminary work on a proposed model for tau dimers in microtubule bundles (dimers are the minimal units since there is one microtubule binding domain per tau). First, a model of tau monomer was created and its characteristics explored using implicit solvent molecular dynamics simulation. Multiple simulations yield a partially collapsed form with separate positively/negatively charged clumps, but which are a factor of two smaller than required by observed microtubule spacing. We argue that this will elongate in dimer form to lower electrostatic energy at a cost of entropic ``spring'' energy. We will present preliminary results on steered molecular dynamics runs on tau dimers to estimate the actual force constant. Supported by US NSF Grant DMR 1207624.
Lucani, Daniel E; Stojanovic, Milica
2008-01-01
The goal of this paper is two-fold. First, to establish a tractable model for the underwater acoustic channel useful for network optimization in terms of convexity. Second, to propose a network coding based lower bound for transmission power in underwater acoustic networks, and compare this bound to the performance of several network layer schemes. The underwater acoustic channel is characterized by a path loss that depends strongly on transmission distance and signal frequency. The exact relationship among power, transmission band, distance and capacity for the Gaussian noise scenario is a complicated one. We provide a closed-form approximate model for 1) transmission power and 2) optimal frequency band to use, as functions of distance and capacity. The model is obtained through numerical evaluation of analytical results that take into account physical models of acoustic propagation loss and ambient noise. Network coding is applied to determine a lower bound to transmission power for a multicast scenario, fo...
QQqq Four-Quark Bound States in Chiral SU(3) Quark Model
Institute of Scientific and Technical Information of China (English)
ZHANG Ming; ZHANG Hai-Xia; ZHANG Zong-Ye
2008-01-01
The possibility of QQqq heavy-light four-quark bound states has been analyzed by means of the chiral SU(3) quark model, where Q is the heavy quark (c or b) and q is the light quark (u, d, or s). We obtain a bound state for the bbnn configuration with quantum number JP=1+, I=0 and for the ccnn (JP=1+, I=0) configuration, which is not bound but slightly above the D*D* threshold (n is u or d quark). Meanwhile, we also conclude that a weakly bound state in bbnn system can also be found without considering the chiral quark interactions between the two light quarks, yet its binding energy is weaker than that with the chiral quark interactions.
Gutiérrez-Rodríguez, A
2003-01-01
A bound on the nu /sup tau / magnetic moment is calculated through the reaction e/sup +/e/sup -/ to nu nu gamma at the Z/sub 1/-pole, and in the framework of a left-right symmetric model at LEP energies. We find that the bound is almost independent of the mixing angle phi of the model in the allowed experimental range for this parameter. (31 refs).
Chen, S.; Al-Muntasheri, G.; Abousleiman, Y. N.
2014-12-01
The critical state concept based bounding surface model is one of the most widely used elastoplastic constitutive models for geomaterials, attributed mainly to its essential feature of allowing plastic deformation to occur for stress points within the bounding surface and thus the capability to represent the realistic non-recoverable behaviour of soils and rocks observed under the cyclic loading. This paper develops an implicit integration algorithm for the bounding surface model, using the standard return mapping approach (elastic predictor-plastic corrector), to obtain the updated stresses for the given strain increments. The formulation of the constitutive integration requires the derivation of a supplementary differential equation to describe the evolution of a key variable, i.e., the ratio between the image stress and the current stress quantities. It is essentially an extension of the integration scheme presented in an earlier work used for the simple bounding surface version of modified Cam Clay associated with a substantially simplified hardening rule. The integration algorithm for the bounding surface model is implemented into the finite element analysis commercial program, ABAQUS, through the material interface of UMAT (user defined material subroutine), and then used for the analysis of wellbore stability problem. The predictions from the ABAQUS simulations are generally in excellent agreement with the available analytical solutions, thus demonstrating the accuracy and robustness of the proposed integration scheme.
Take it NP-easy: Bounded model construction for duration calculus
DEFF Research Database (Denmark)
Fränzle, Martin
2002-01-01
constrained to bounded length. As a corollary we obtain that model construction is in NP for the formulae actually encountered in case studies using Duration Calculus, as these have a certain small-model property. First experiments with a prototype implementation of the procedures demonstrate a competitive...
Hong, Sungwook E; Kim, Juhan
2016-01-01
We develop a galaxy assignment scheme that populates dark matter halos with galaxies by tracing the most bound member particles (MBPs) of simulated halos. Several merger-timescale models based on analytic calculations and numerical simulations are adopted as the survival time of mock satellite galaxies. We build mock galaxy samples from halo merger data of the Horizon Run 4 $N$-body simulation from $z = 12-0$. We compare group properties and two-point correlation functions (2pCFs) of mock galaxies with those of volume-limited SDSS galaxies, with $r$-band absolute magnitudes of $\\mathcal{M}_r - 5 \\log h 10^{14} h^{-1} M_{\\odot}$) and the small-scale 2pCF ($r_{\\rm p} < 10 h^{-1} {\\rm Mpc}$) quite well for the majority of the merger timescale models adopted. The new scheme outperforms the previous subhalo-galaxy correspondence scheme by more than $2\\sigma$.
Dima, Cuatualin; Guelev, Dimitar; 10.4204/EPTCS.25.12
2010-01-01
We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of cooperation between members of the coalition in which agents issue their actions based on the distributed knowledge, for that coalition, of the system history. We show that model-checking is decidable for this logic. The technique utilizes two variants of games with imperfect information and partially observable objectives, as well as a subset construction for identifying states whose histories are indistinguishable to the considered coalition.
Directory of Open Access Journals (Sweden)
Cătălin Dima
2010-06-01
Full Text Available We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of cooperation between members of the coalition in which agents issue their actions based on the distributed knowledge, for that coalition, of the system history. We show that model-checking is decidable for this logic. The technique utilizes two variants of games with imperfect information and partially observable objectives, as well as a subset construction for identifying states whose histories are indistinguishable to the considered coalition.
Two-phase bounded acceleration traffic flow model: Analytical solutions and applications
LEBACQUE, JP
2003-01-01
The present paper describes a two phase traffic flow model. One phase is traffic equilibrium: flow and speed are functions of density, and traffic acceleration is low. The second phase is characterized by constant acceleration. This model extends first order traffic flow models and recaptures the fact that traffic acceleration is bounded. The paper show how to calculate analytical solutions of the two-phase model for dynamic traffic situations, provides a set of calculation rules, and analyze...
Song, Yunquan; Lin, Lu; Jian, Ling
2016-07-01
Single-index varying-coefficient model is an important mathematical modeling method to model nonlinear phenomena in science and engineering. In this paper, we develop a variable selection method for high-dimensional single-index varying-coefficient models using a shrinkage idea. The proposed procedure can simultaneously select significant nonparametric components and parametric components. Under defined regularity conditions, with appropriate selection of tuning parameters, the consistency of the variable selection procedure and the oracle property of the estimators are established. Moreover, due to the robustness of the check loss function to outliers in the finite samples, our proposed variable selection method is more robust than the ones based on the least squares criterion. Finally, the method is illustrated with numerical simulations.
Widths of $\\bar K$-nuclear deeply bound states in a dynamical model
Mares, J; Gal, A
2004-01-01
The relativistic mean field (RMF) model is applied to a system of nucleons and a $\\bar K$ meson, interacting via scalar and vector boson fields. The model incorporates the standard RMF phenomenology for bound nucleons and, for the $\\bar K$ meson, it relates to low-energy ${\\bar K}N$ and $K^-$ atom phenomenology. Deeply bound $\\bar K$ nuclear states are generated dynamically across the periodic table and are exhibited for $^{12}$C and $^{16}$O over a wide range of binding energies. Substantial polarization of the core nucleus is found for these light nuclei. Absorption modes are also included dynamically, considering explicitly the reduced phase space for $\\bar K$ absorption from deeply bound states. The behavior of the calculated width as function of the $\\bar K$ binding energy is studied in order to explore limits on the possible existence of narrow $\\bar K$ nuclear states.
Widths of K¯-nuclear deeply bound states in a dynamical model
Mareš, J.; Friedman, E.; Gal, A.
2005-01-01
The relativistic mean field (RMF) model is applied to a system of nucleons and a Kbar meson, interacting via scalar and vector boson fields. The model incorporates the standard RMF phenomenology for bound nucleons and, for the Kbar meson, it relates to low-energy Kbar N and K- atom phenomenology. Deeply bound Kbar nuclear states are generated dynamically across the periodic table and are exhibited for 12C and 16O over a wide range of binding energies. Substantial polarization of the core nucleus is found for these light nuclei. Absorption modes are also included dynamically, considering explicitly both the resulting compressed nuclear density and the reduced phase space for Kbar absorption from deeply bound states. The behavior of the calculated width as function of the Kbar binding energy is studied in order to explore limits on the possible existence of narrow Kbar nuclear states.
Higgs mass bounds from renormalization flow for a Higgs-top-bottom model
Energy Technology Data Exchange (ETDEWEB)
Gies, Holger; Sondenheimer, Rene [Friedrich-Schiller-Universitaet Jena, Theoretisch-Physikalisches Institut, Jena (Germany)
2015-02-01
We study a chiral Yukawa model mimicking the Higgs-top-bottom sector of the standard model. We reanalyze the conventional arguments that relate a lower bound for the Higgs mass with vacuum stability in the light of exact results for the regularized fermion determinant as well as in the framework of the functional renormalization group. In both cases, we find no indication for vacuum instability nor meta-stability induced by top fluctuations if the cutoff is kept finite but arbitrary. A lower bound for the Higgs mass arises for the class of standard bare potentials of φ{sup 4} type from the requirement of a well-defined functional integral (i.e., stability of the bare potential). This consistency bound can, however, be relaxed considerably by more general forms of the bare potential without necessarily introducing new metastable minima. (orig.)
Tang, Tie-Qiao; Luo, Xiao-Feng; Liu, Kai
2016-09-01
The driver's bounded rationality has significant influences on the micro driving behavior and researchers proposed some traffic flow models with the driver's bounded rationality. However, little effort has been made to explore the effects of the driver's bounded rationality on the trip cost. In this paper, we use our recently proposed car-following model to study the effects of the driver's bounded rationality on his running cost and the system's total cost under three traffic running costs. The numerical results show that considering the driver's bounded rationality will enhance his each running cost and the system's total cost under the three traffic running costs.
Frequency Weighted Model Order Reduction Technique and Error Bounds for Discrete Time Systems
Directory of Open Access Journals (Sweden)
Muhammad Imran
2014-01-01
for whole frequency range. However, certain applications (like controller reduction require frequency weighted approximation, which introduce the concept of using frequency weights in model reduction techniques. Limitations of some existing frequency weighted model reduction techniques include lack of stability of reduced order models (for two sided weighting case and frequency response error bounds. A new frequency weighted technique for balanced model reduction for discrete time systems is proposed. The proposed technique guarantees stable reduced order models even for the case when two sided weightings are present. Efficient technique for frequency weighted Gramians is also proposed. Results are compared with other existing frequency weighted model reduction techniques for discrete time systems. Moreover, the proposed technique yields frequency response error bounds.
DEFF Research Database (Denmark)
Odgaard, Peter Fogh; Stoustrup, Jakob; Mataji, B.
2007-01-01
Predicting the performance of large scale plants can be difficult due to model uncertainties etc, meaning that one can be almost certain that the prediction will diverge from the plant performance with time. In this paper output multiplicative uncertainty models are used as dynamical models of th...... models, is applied to two different sets of measured plant data. The computed uncertainty bounds cover the measured plant output, while the nominal prediction is outside these uncertainty bounds for some samples in these examples. ......Predicting the performance of large scale plants can be difficult due to model uncertainties etc, meaning that one can be almost certain that the prediction will diverge from the plant performance with time. In this paper output multiplicative uncertainty models are used as dynamical models...... of the prediction error. These proposed dynamical uncertainty models result in an upper and lower bound on the predicted performance of the plant. The dynamical uncertainty models are used to estimate the uncertainty of the predicted performance of a coal-fired power plant. The proposed scheme, which uses dynamical...
Boundedly rational learning and heterogeneous trading strategies with hybrid neuro-fuzzy models
S.D. Bekiros
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 se
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.
Improved Frechet bounds and model-free pricing of multi-asset options
Tankov, Peter
2010-01-01
We compute the improved bounds on the copula of a bivariate random vector when partial information is available, such as the values of the copula on the subset of $[0,1]^2$, or the value of a functional of the copula, monotone with respect to the concordance order. These results are then used to compute model-free bounds on the prices of two-asset options which make use of extra information about the dependence structure, such as the price of another two-asset option.
Propagators for Scalar Bound States at Finite Temperature in an NJL Model
Institute of Scientific and Technical Information of China (English)
ZHOU BangRong
2002-01-01
We re-examine physical causal propagators for scalar and pseudoscalar bound states at finite temperaturein a chiral Ut(1) x UR(1) NJL model, defined by four-point amputated fimctions subtracted through the gap equation,and prove that they are completely equivalent in the imaginary-time and real-time formalisms by separating carefiullythe imaginary part of the zero-temperature loop integral. It is shown that the same thermal transformation matrix ofthe matrix propagators for these bound states in the real-time formalism is precisely the one of the matrix propagatorfor an elementary scalar particle and this fact shows the similarity of thermodynamic property between a composite andelementary scalar particle. The retarded and advanced propagators for these bound states are also given explicitly fromthe imaginary-time formalism.
A method for model checking UML statecharts%一种UML状态图模型检测方法
Institute of Scientific and Technical Information of China (English)
张涛; 黄少滨; 黄宏涛; 吕天阳; 刘刚
2011-01-01
The aim of this paper is to find various errors and inconsistencies of system design in the early stages of the development process. A method for model checking UML statecharts was proposed, and was used to verify the consistency of the design model and the requirement specifications. The elements of UML statecharts were defined by a tuple system, and the middle representation of the UML statecharts - SC - was given. Based on the definition of operational semantics of SC, the statechart was converted into a state transition system with KRIPKE semantics, and the property which the system must meet was expressed as a linear temporal logic formula. Finally, a model checking method was given to verify whether the state transition system could meet the conditions of the linear temporal logic formula. This method can convert more elements of statecharts, it can also reduce the state space of transition system of statecharts and improve the efficiency of the model checking.%为在开发过程早期发现系统设计的各种错误与不一致,提出一种UML状态图模型检测方法,用于验证设计模型与需求规约间的一致性.该方法通过元组定义UML状态图的主要元素,给出状态图的中间表示形式SC.基于SC上定义的操作语义,该方法将状态图转换为具有KRIPKE语义结构的状态迁移系统,并将系统需满足的性质表示为线性时序逻辑公式,用模型检测技术验证状态迁移系统对线性时序逻辑公式的满足性.该方法可以转换更多的状态图元素,缩减状态图迁移系统的状态空间及提高模型检测效率.
Invariant Measures and Asymptotic Gaussian Bounds for Normal Forms of Stochastic Climate Model
Institute of Scientific and Technical Information of China (English)
Yuan YUAN; Andrew J.MAJDA
2011-01-01
The systematic development of reduced low-dimensional stochastic climate models from observations or comprehensive high dimensional climate models is an important topic for atmospheric low-frequency variability, climate sensitivity, and improved extended range forecasting. Recently, techniques from applied mathematics have been utilized to systematically derive normal forms for reduced stochastic climate models for low-frequency variables. It was shown that dyad and multiplicative triad interactions combine with the climatological linear operator interactions to produce a normal form with both strong nonlinear cubic dissipation and Correlated Additive and Multiplicative (CAM) stochastic noise. The probability distribution functions (PDFs) of low frequency climate variables exhibit small but significant departure from Gaussianity but have asymptotic tails which decay at most like a Gaussian. Here, rigorous upper bounds with Gaussian decay are proved for the invariant measure of general normal form stochastic models. Asymptotic Gaussian lower bounds are also established under suitable hypotheses.
Towards automated software model checking using graph transformation systems and Bogor
Institute of Scientific and Technical Information of China (English)
Vahid RAFE; Adel T.RAHMANI
2009-01-01
Graph transformation systems have become a general formal modeling language to describe many models in software development process. Behavioral modeling of dynamic systems and model-to-model transformations are only a few examples in which graphs have been used to software development. But even the perfect graph transformation system must be equipped with automated analysis capabilities to let users understand whether such a formal specification fulfills their requirements. In this paper,we present a new solution to verify graph transformation systems using the Bogor model checker. The attributed graph grammars (AGG)-Iike graph transformation systems are translated to Bandera intermediate representation (BIR), the input language of Bogor,and Bogor verifies the model against some interesting properties defined by combining linear temporal logic (LTL) and special-purpose graph rules. Experimental results are encouraging, showing that in most cases oar solution improves existing approaches in terms of both performance and expressiveness.
BERRY-ESSEEN BOUNDS OF ERROR VARIANCE ESTIMATION IN PARTLY LINEAR MODELS
Institute of Scientific and Technical Information of China (English)
GAOJITI; HONGSHENGYAN; LIANGHUA
1996-01-01
Consider the regression model Yi =xriβ + g(ti) + εi for i =11… , n. Here (xi, ii ) are known and nonrandom design points and εi are i.i.d, random errors. The family of nonparametricestimates gn(·) of g(-) including some known estimates is proposed. Based on the model Yi=xriβ+gn(ti)+εi, the Berry-Esseen bounds of the distribution of the least-squares estimator of are investigated.
Sato, Kimiko; ODA, MEGUMI
2011-01-01
A questionnaire survey was administered to 317 parents who attended infant health check-ups in City B, Okayama Prefecture between October, 2008 and March, 2009. The questionnaire survey studied 7 factors based on the PRECEDE-PROCEED Model. We analysed factors that affected oral health behaviour and attendance at scheduled dental health check-ups. The survey containing 22 items concerning matters such as 'QOL' and 'health problems' was posted to parents and guardians in advance, and then colle...
THE EXPERIMENTAL CHECK OF RELIABILITY OF MATHEMATICAL MODELS OF FRICTION JOINTS
Directory of Open Access Journals (Sweden)
A. Yu. Klyukin
2011-07-01
Full Text Available Problem statement. Up to now, there has been no model describing work of friction joints on high-strength bolts in elastic stage. All previous models describe the structure after macrodis-placement when bolt was subjected to shearing and crushing. There also has been no model of complex joint with gusset and linings.Results and conclusions. The bolted joint model involving substitution of the friction rigidity for elastic links is presented. Stresses in complex joints of metal bridge are determined experimentally. The results obtained with the use of the model are compared with experimental results. Stresses at the points of joint beyond the reach of experiment are calculated. Experimental results supported the validity of the model.
Logic Model Checking of Time-Periodic Real-Time Systems
Florian, Mihai; Gamble, Ed; Holzmann, Gerard
2012-01-01
In this paper we report on the work we performed to extend the logic model checker SPIN with built-in support for the verification of periodic, real-time embedded software systems, as commonly used in aircraft, automobiles, and spacecraft. We first extended the SPIN verification algorithms to model priority based scheduling policies. Next, we added a library to support the modeling of periodic tasks. This library was used in a recent application of the SPIN model checker to verify the engine control software of an automobile, to study the feasibility of software triggers for unintended acceleration events.
Modelling light-cone distribution amplitudes from non-relativistic bound states
International Nuclear Information System (INIS)
We calculate light-cone distribution amplitudes for non-relativistic bound states, including radiative corrections from relativistic gluon exchange to first order in the strong coupling constant. We distinguish between bound states of quarks with equal (or similar) mass, m1 ∼ m2, and between bound states where the quark masses are hierarchical, m1 >> m2. For both cases we calculate the distribution amplitudes at the non-relativistic scale and discuss the renormalization-group evolution for the leading-twist and 2-particle distributions. Our results apply to hard exclusive reactions with non-relativistic bound states in the QCD factorization approach like, for instance, Bc → ηclν or e+e- → J/ψηc. They also serve as a toy model for light-cone distribution amplitudes of light mesons or heavy B and D mesons, for which certain model-independent properties can be derived. In particular, we calculate the anomalous dimension for the B meson distribution amplitude φB-(ω) in the Wandzura-Wilczek approximation and derive the according solution of the evolution equation at leading logarithmic accuracy
Automated evolutionary restructuring of workflows to minimise errors via stochastic model checking
DEFF Research Database (Denmark)
Herbert, Luke Thomas; Hansen, Zaza Nadja Lee; Jacobsen, Peter
2014-01-01
This paper presents a framework for the automated restructuring of workflows that allows one to minimise the impact of errors on a production workflow. The framework allows for the modelling of workflows by means of a formalised subset of the Business Process Modelling and Notation (BPMN) languag...... of the production workflows and the expression of the goals require manual input....
Bounded Rational Managers Struggle with Talent Management - An Agent-based Modelling Approach
DEFF Research Database (Denmark)
Adamsen, Billy; Thomsen, Svend Erik
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...... of past success will provide failure rather than success in the future (Capelli.2008). Finally, we model the talent selection process either as a collective decision making process made by a group of managers or a decision process made by a single manager.It is argued that agent-based modeling is a useful....... The considered variables were: (a) decision makers’ attributes (capabilities and degree of bounded rationality), (b) characteristics of the sample where individuals are selected from (the level of capabilities and the dispersion thereof), (c) path-dependency of the organization’s success, and (d) the decision...
Tevatron Higgs Mass Bounds: Projecting U(1)' Models to LHC Domain
Sert, Hale; Demir, Durmus A; Solmaz, Levent
2010-01-01
We study Higgs boson masses in supersymmetric models with an extra U(1) symmetry to be called U(1)$^{\\prime}$. Such extra gauge symmetries are urged by the $\\mu$ problem of the MSSM, and they also arise frequently in low-energy supersymmetric models stemming from GUTs and strings. We analyze mass of the lightest Higgs boson and various other particle masses and couplings by taking into account the LEP bounds as well as the recent bounds from Tevatron experiments. We find that the $\\mu$-problem motivated generic low-energy U(1)$^{\\prime}$ model yields Higgs masses as large as $\\sim 200\\ {\\rm GeV}$ and violate the Tevatron bounds for certain ranges of parameters. We analyze correlations among various model parameters, and determine excluded regions by both scanning the parameter space and by examining certain likely parameter values. We also make educated projections for LHC measurements in light of the Tevatron restrictions on the parameter space. We further analyze certain benchmark models stemming from E(6) ...
DEFF Research Database (Denmark)
Herbert, Luke Thomas; Hansen, Zaza Nadja Lee
2016-01-01
This article presents a framework for the automated restructuring of stochastic workflows to reduce the impact of faults. The framework allows for the modelling of workflows by means of a formalised subset of the BPMN workflow language. We extend this modelling formalism to describe faults...... to model resources, associated with a workflow. The approach is fully automated and only the modelling of the production workflows, potential faults and the expression of the goals require manual input. We present the design of a software tool implementing this framework and explore the practical utility...... of this approach through an industrial case study in which the risk of production failures and their impact are reduced by restructuring the workflow....
Kick, Alexander
2007-01-01
We present a reduction algorithm which reduces Kripke structures by eliminating transitions from the model which do not affect the visible components of the model. These are exactly the variables contained in the specification formula. The reduction algorithm preserves the truth of special CTL formulae. In contrast to formula-dependent reduction algorithms presented so far, which are mostly computationally expensive, our algorithm needs only one pass through the reachable ...
Brat, Guillaume P.; Martinie, Celia; Palanque, Philippe
2013-01-01
During early phases of the development of an interactive system, future system properties are identified (through interaction with end users in the brainstorming and prototyping phase of the application, or by other stakehold-ers) imposing requirements on the final system. They can be specific to the application under development or generic to all applications such as usability principles. Instances of specific properties include visibility of the aircraft altitude, speed… in the cockpit and the continuous possibility of disengaging the autopilot in whatever state the aircraft is. Instances of generic properties include availability of undo (for undoable functions) and availability of a progression bar for functions lasting more than four seconds. While behavioral models of interactive systems using formal description techniques provide complete and unambiguous descriptions of states and state changes, it does not provide explicit representation of the absence or presence of properties. Assessing that the system that has been built is the right system remains a challenge usually met through extensive use and acceptance tests. By the explicit representation of properties and the availability of tools to support checking these properties, it becomes possible to provide developers with means for systematic exploration of the behavioral models and assessment of the presence or absence of these properties. This paper proposes the synergistic use two tools for checking both generic and specific properties of interactive applications: Petshop and Java PathFinder. Petshop is dedicated to the description of interactive system behavior. Java PathFinder is dedicated to the runtime verification of Java applications and as an extension dedicated to User Interfaces. This approach is exemplified on a safety critical application in the area of interactive cockpits for large civil aircrafts.
Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?
DEFF Research Database (Denmark)
Arrahman, Yehia Abd; Andric, Marina; Beggiato, Alessandro;
2014-01-01
to the state space explosion. Several techniques have been proposed to mitigate those problems so to make verification under relaxed memory models feasible. We discuss how to adopt some of those techniques in a Maude-based approach to language prototyping, and suggest the use of other techniques that have been......Relaxed memory models offer suitable abstractions of the actual optimizations offered by multi-core architectures and by compilers of concurrent programming languages. Using such abstractions for verification purposes is challenging in part due to their inherent non-determinism which contributes...
Institute of Scientific and Technical Information of China (English)
Chun-Zheng CAO; Jin-Guan LIN
2012-01-01
The aim of this paper is to study the tests for variance heterogeneity and/or autocorrelation in nonlinear regression models with elliptical and AR(1) errors.The elliptical class includes several symmetric multivariate distributions such as normal,Student-t,power exponential,among others.Several diagnostic tests using score statistics and their adjustment are constructed.The asymptotic properties,including asymptotic chi-square and approximate powers under local alternatives of the score statistics,are studied.The properties of test statistics are investigated through Monte Carlo simulations.A data set previously analyzed under normal errors is reanalyzed under elliptical models to illustrate our test methods.
Upper bound on the gluino mass in supersymmetric models with extra matters
Moroi, Takeo; Yanagida, Tsutomu T.; Yokozaki, Norimi
2016-09-01
We discuss the upper bound on the gluino mass in supersymmetric models with vector-like extra matters. In order to realize the observed Higgs mass of 125 GeV, the gluino mass is bounded from above in supersymmetric models. With the existence of the vector-like extra matters at around TeV, we show that such an upper bound on the gluino mass is significantly reduced compared to the case of minimal supersymmetric standard model. This is due to the fact that radiatively generated stop masses as well the stop trilinear coupling are enhanced in the presence of the vector-like multiplets. In a wide range of parameter space of the model with extra matters, particularly with sizable tan β (which is the ratio of the vacuum expectation values of the two Higgs bosons), the gluino is required to be lighter than ∼ 3 TeV, which is likely to be within the reach of forthcoming LHC experiment.
Learning and Model-checking Networks of I/O Automata
DEFF Research Database (Denmark)
Mao, Hua; Jaeger, Manfred
2012-01-01
We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can le...
Model checking a cache coherence protocol for a Java DSM implementation
Pang, J.; Fokkink, W.J.; Hofman, R.; Veldema, R.
2007-01-01
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java's memory model and allows multithreaded Java programs to run unmodified on a distributed memory system. It employs a multiple-writer cache coherence protocol. In this paper,
Fluid-structure interaction model to check up discharging pipe system
International Nuclear Information System (INIS)
Within phenomena group that occur in a pipelines system that lead some fluid in stationary state, the loss of lateral stability is which one of the more common and important of them since it is showed in periodic vibrations or aleatories, way against whose effects it will have to be designed the piping to avoid catastrophic failures. The present work is a part of the realized effort for incorporating to the programs of digital computers used for the structural analysis of piping systems based in the finite element method. It is a model that includes the lateral effect that induces the fluid on the pipes. For this effect was planted and obtained a model or element for straight pipes segments. It was through the use of analytical variational methods and polynomial approximations (typical techniques using in finite elements). When were effected the calculations of characteristic frequencies in straight pipe sections configurations. It was obtained concordance with the analytical predictions. There fore it was demonstrated that the model is correct. A continuation of this work will be to obtain the models for curved segments of piping. (Author)
International Nuclear Information System (INIS)
We calculate upper and lower bounds on the modulus of the pion electromagnetic form factor on the unitarity cut below the ωπ inelastic threshold, using as input the phase in the elastic region known via the Fermi-Watson theorem from the ππ P-wave phase shift, and a suitably weighted integral of the modulus squared above the inelastic threshold. The normalization at t=0, the pion charge radius and experimental values at spacelike momenta are used as additional input information. The bounds are model independent, in the sense that they do not rely on specific parametrizations and do not require assumptions on the phase of the form factor above the inelastic threshold. The results provide nontrivial consistency checks on the recent experimental data on the modulus available below the ωπ threshold from e + e - annihilation and τ-decay experiments. In particular, at low energies the calculated bounds offer a more precise description of the modulus than the experimental data. (orig.)
Directory of Open Access Journals (Sweden)
Jörg Becker
2012-11-01
Full Text Available With a steady increase of regulatory requirements for business processes, automation support of compliance management is a field garnering increasing attention in Information Systems research. Several approaches have been developed to support compliance checking of process models. One major challenge for such approaches is their ability to handle different modeling techniques and compliance rules in order to enable widespread adoption and application. Applying a structured literature search strategy, we reflect and discuss compliance-checking approaches in order to provide an insight into their generalizability and evaluation. The results imply that current approaches mainly focus on special modeling techniques and/or a restricted set of types of compliance rules. Most approaches abstain from real-world evaluation which raises the question of their practical applicability. Referring to the search results, we propose a roadmap for further research in model-based business process compliance checking.
A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints
Kothari, Sunil; 10.4204/EPTCS.42.3
2010-01-01
We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover. Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints. The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints. For us, constraints are equalities between terms in the language of simple types. Substitutions are formally modeled as finite maps using the Coq library Coq.FSets.FMapInterface. Coq's method of functional induction is the main proof technique used in proving many of the axioms.
A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints
Directory of Open Access Journals (Sweden)
Sunil Kothari
2010-12-01
Full Text Available We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU, which also happens to be idempotent. All of our proofs have been formalized in the Coq theorem prover. Our proofs show that finite maps produced by the unification algorithm provide a model of the axioms characterizing idempotent MGUs of lists of constraints. The axioms that serve as the basis for our verification are derived from a standard set by extending them to lists of constraints. For us, constraints are equalities between terms in the language of simple types. Substitutions are formally modeled as finite maps using the Coq library Coq.FSets.FMapInterface. Coq's method of functional induction is the main proof technique used in proving many of the axioms.
On decidability and model checking for a first order modal logic for value-passing processes
Institute of Scientific and Technical Information of China (English)
薛锐; 林惠民
2003-01-01
A semantic interpretation of a first order extension of Hennessy-Milner logic for value-passing processes, named HML(FO), is presented. The semantics is based on symbolic transitiongraphs with assignment. It is shown that the satisfiability of the two-variable sub-logic HML(FO2) ofHML(FO) is decidable, and the complexity discussed. Finally, a decision procedure for model checkingthe value-passing processes with respect to HML(FO2) is obtained.
Model-Independent Analysis of B -> pi K Decays and Bounds on the Weak Phase gamma
Neubert, Matthias(PRISMA Cluster of Excellence & Mainz Institut for Theoretical Physics, Johannes Gutenberg University, D-55099, Mainz, Germany)
1998-01-01
A general parametrization of the amplitudes for the rare two-body decays B -> pi K is introduced, which makes maximal use of theoretical constraints arising from flavour symmetries of the strong interactions and the structure of the low-energy effective weak Hamiltonian. With the help of this parametrization, a model-independent analysis of the branching ratios and direct CP asymmetries in the various B -> pi K decay modes is performed, and the impact of hadronic uncertainties on bounds on th...
A relativistic gauge model describing N particles bound by harmonic forces
International Nuclear Information System (INIS)
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 T1xU1xSUN-1. A model for the relativistic discrete string (a chain of N particles) is also discussed. All these gauge theories of particles can be quantized by standard methods. (orig.)
Bounds for avalanche critical values of the Bak-Sneppen model
Gillett, Alexis; Meester, Ronald; Nuyens, Misja
2005-01-01
We study the Bak-Sneppen model on locally finite transitive graphs $G$, in particular on Z^d and on T_Delta, the regular tree with common degree Delta. We show that the avalanches of the Bak-Sneppen model dominate independent site percolation, in a sense to be made precise. Since avalanches of the Bak-Sneppen model are dominated by a simple branching process, this yields upper and lower bounds for the so-called avalanche critical value $p_c^{BS}(G)$. Our main results imply that 1/(Delta+1)
Directory of Open Access Journals (Sweden)
Saeid Mokhtarian
2014-01-01
Full Text Available Despite extensive area of applications, simulation of complex wall bounded problems or any deformable boundary is still a challenge in a Dissipative Particle Dynamics simulation. This limitation is rooted in the soft force nature of DPD and the fact that we need to use an antipenetration model for escaped particles. In the present paper, we propose a new model of antipenetration which preserves the conservation of linear momentum on the boundaries and enables us to simulate complex and flexible boundaries. Finally by performing numerical simulations, we demonstrate the validity of our new model.
Vacuum stability bounds in Anomaly and Gaugino Mediated SUSY breaking models
Gabrielli, E; Roy, S; 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(beta). The implications of these results on the g-2 of the muon are also analyzed.
International Nuclear Information System (INIS)
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
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.
Quantitative modeling of reflected ultrasonic bounded beams and a new estimate of the Schoch shift.
Bouzidi, Youcef; Schmitt, Douglas R
2008-12-01
The wavefields of bounded acoustic beams and pulses reflected from water-loaded plates are fully modeled with the phase advance technique. The wavefield produced at the source is propagated at any incidence angle using phase shift modeling that incorporates the full analytic solution for the acoustic reflectivity at the interface. This approach provides for the ready visualization of both the stationary monofrequency beam wavefield and animation of the temporally bounded pulse. The model images are reminiscent of the classic Schlieren photographs that first illustrated the nonspecular behavior of the reflected beams incident near critical angles. Various phenomena such as the lateral displacement and the null zone at the Rayleigh critical angle are recreated. A new approximation for this shift agrees well with that of the peak energy of the reflected beam. Similar effects are observed during the reflection of a bounded pulse. Although more computationally costly than existing analytic approximations, the phase advance technique can facilitate the interpretation of reflectivity measurements obtained in laboratory experiments. In particular, the full visualization allows for a better understanding of the behavior of reflected waves at any angle of incidence. PMID:19126490
Kang, Soo Hoon; Lim, Yaeji; Lee, Hyuk; Kim, Joungyoun; Chi, Sangah; Min, Yang Won; Min, Byung-Hoon; Lee, Jun Haeng; Son, Hee Jung; Ryu, Seungho; Rhee, Poong-Lyul; Kim, Jae J
2016-01-01
Erosive esophagitis is a major risk factor for Barrett esophagus and esophageal adenocarcinoma. Information regarding the putative risk factors for developing erosive esophagitis is considerably heterogeneous; thus, a risk model is required to clinically predict the incidence of erosive esophagitis. This study was to derive and validate a predictive model for the incidence of developing erosive esophagitis after negative index endoscopy in a population subjected to routine health check-ups. This retrospective cohort study of health check-ups included 11,535 patients who underwent repeated screening endoscopy after >3 years from a negative index endoscopy. We used logistic regression analysis to predict the incidence of erosive esophagitis, and a Simple Prediction of Erosive Esophagitis Development score for risk assessment was developed and internally validated using the split-sample approach. The development and validation cohorts included 5765 patients (675 with erosive esophagitis [11.7%]) and 5770 patients (670 with erosive esophagitis [11.6%]), respectively. The final model included sex, smoking behavior, body mass index, hypertension, and the triglyceride level as variables. This model predicted 667 cases of erosive esophagitis, yielding an expected-to-observed ratio of 1.00 (95% confidence interval [CI], 0.92-1.07). A simplified 5-item risk scoring system based on coefficients was developed, with a risk of erosive esophagitis of 6.2% (95% CI, 5.2-7.1) for the low-risk group (score ≤2), 15.1% (95% CI, 13.5-16.6) for the intermediate-risk group (score ≤3, 4), and 18.2% (95% CI, 15.2-21.3) for the high-risk group (score ≥5). The discriminative performance of the risk-prediction score was consistent in the derivation cohort and validation cohort (c-statistics 0.68 and 0.64, respectively); the calibration was good (Brier score 0.099 and 0.1, respectively). In conclusion, a simple risk-scoring model using putative risk factors can predict the future
Faria, J. M.; Mahomad, S.; Silva, N.
2009-05-01
The deployment of complex safety-critical applications requires rigorous techniques and powerful tools both for the development and V&V stages. Model-based technologies are increasingly being used to develop safety-critical software, and arguably, turning to them can bring significant benefits to such processes, however, along with new challenges. This paper presents the results of a research project where we tried to extend current V&V methodologies to be applied on UML/SysML models and aiming at answering the demands related to validation issues. Two quite different but complementary approaches were investigated: (i) model checking and the (ii) extraction of robustness test-cases from the same models. These two approaches don't overlap and when combined provide a wider reaching model/design validation ability than each one alone thus offering improved safety assurance. Results are very encouraging, even though they either fell short of the desired outcome as shown for model checking, or still appear as not fully matured as shown for robustness test case extraction. In the case of model checking, it was verified that the automatic model validation process can become fully operational and even expanded in scope once tool vendors help (inevitably) to improve the XMI standard interoperability situation. For the robustness test case extraction methodology, the early approach produced interesting results but need further systematisation and consolidation effort in order to produce results in a more predictable fashion and reduce reliance on expert's heuristics. Finally, further improvements and innovation research projects were immediately apparent for both investigated approaches, which point to either circumventing current limitations in XMI interoperability on one hand and bringing test case specification onto the same graphical level as the models themselves and then attempting to automate the generation of executable test cases from its standard UML notation.
Directory of Open Access Journals (Sweden)
Wanda Vrasti
2012-03-01
Full Text Available Over the past couple of months history has been unfolding with dizzying speed. The #occupy model of leaderless, demandless direct action, which in the beginning no one with only a slim understanding of how capitalism works thought could become anything more than a facile if charming jab at anti-corporate activism, has gone viral. Every morning we wake up to new reports about ‘occupying X’, where X can be anything from cities, campuses, boardrooms, buildings, highways, and public events, all the way to academic disciplines. What originally seemed like a romantic fantasy about temporary autonomous zones now feels like history. And no one likes to find themselves on thewrong side of history, especially not intellectuals, let alone intellectuals in the business of explaining global politics.
Directory of Open Access Journals (Sweden)
Bonura Carlo A
2001-04-01
Full Text Available Abstract Background A previous report showed that the open field behavior of rats sensitized to the dopamine agonist quinpirole satisfies 5 performance criteria for compulsive checking behavior. In an effort to extend the parallel between the drug-induced phenomenon and human obsessive-compulsive disorder (OCD, the present study investigated whether the checking behavior of quinpirole rats is subject to interruption, which is an attribute characteristic of OCD compulsions. For this purpose, the rat's home-cage was placed into the open field at the beginning or the middle of a 2-hr test. Results Introduction of the home-cage reduced checking behavior, as rats stayed inside the cage. After 40 min, checking resurfaced, as quinpirole rats exited the home-cage often. An unfamiliar cage had no such effects on quinpirole rats or saline controls. Conclusions Checking behavior induced by quinpirole is not irrepressible but can be suspended. Results strengthen the quinpirole preparation as an animal model of OCD compulsive checking.
Model Checking of Credit Setting in AFDX Traffic Policing%AFDX流量管制信用量设置的模型检查
Institute of Scientific and Technical Information of China (English)
高宇; 李峭; 熊华钢
2011-01-01
航空电子全双工交换式以太网(AFDX)实时通信中,交换节点采用信用量令牌桶(creditedtoken bucket)进行流量管制.分别对基于帧和基于字节的信用量令牌桶流量管制进行时间自动机建模,并构建模型的并发交互场景;采用测试自动机,进行有界活性(bounded liveness)模型检查.通过形式化验证,发现流量管制通过约束突发度限制多路复用输出排队的时延抖动,但信用量值的设置必须考虑输入虚拟链路(VL)的时延抖动,否则可能导致已经聚合的流量中属于不同VL的帧的先后次序被破坏,反而造成更大的时延抖动.通过分析时延抖动对信用量设置的影响,归纳并给出流量管制信用量设置的注意事项.%In the Avionics Full Duplex Switchsd Ethernet (AFDX) real- time communications,credited token buckets are applied in switched nodes for traffic policing. Test antomata are designed for bounded liveness nodel checking under concurrent interaction scenarios with the thme automata models,which are.built for the frame- based and byte- based credited token buckets respectively. According to the formal verification ,it's shown that latency jitters in multiplexer output queuing are limited by traffic policing with burstiness constraints. However,jitters of input virtual links (VL) should also be considered when setting the credit values ;otherwise,the greater jitter values may be caused by disturbing aggregated frames belong to different VLs. By analyzing the inter- relations of credit setting and jitters,some notes are summarized for traffic policing configurations.
Quintana, César; Ramos, Gonzalo; Moral, Andoni; Rodriguez, Jose Antonio; Pérez, Carlos; Hutchinson, Ian; INGLEY, Richard; Rull, Fernando
2016-10-01
Raman Laser Spectrometer (RLS) is one of the Pasteur payload instruments located at the Rover of the ExoMars mission and within the ESA's Aurora Exploration Programme. RLS will explore the Mars surface composition through the Raman spectroscopy technique. The instrument is divided into several units: a laser for Raman emission stimulation, an internal optical head (iOH) for sample excitation and for Raman emission recovering, a spectrometer with a CCD located at its output (SPU), the optical harness (OH) for the units connection, from the laser to the excitation path of the iOH and from the iOH reception path to the spectrometer, and the corresponding electronics for the CCD operation.Due to the variability of the samples to be analyzed on Mars, a radiometry prediction for the instrument performance results to be of the critical importance. In such a framework, and taking into account the SNR (signal to noise ratio) required for the achievement of successful results from the scientific point of view (a proper information about the Mars surface composition), a radiometric model has been developed to provide the requirements for the different units, i.e. the laser irradiance, the iOH, OH, and SPU throughputs, and the samples that will be possible to be analyzed in terms of its Raman emission and the relationship of the Raman signal with respect to fluorescence emission, among others.The radiometric model fundamentals (calculations and approximations), as well as the first results obtained during the bread board characterization campaign are here reported on.
Automatic Verification of Biochemical Network Using Model Checking Method%基于模型校核的生化网络自动辨别方法
Institute of Scientific and Technical Information of China (English)
Jinkyung Kim; Younghee Lee; Il Moon
2008-01-01
This study focuses on automatic searching and verifying methods for the reachability, transition logics and hierarchical structure in all possible paths of biological processes using model checking. The automatic search and verification for alternative paths within complex and large networks in biological process can provide a consid-erable amount of solutions, which is difficult to handle manually. Model checking is an automatic method for veri-fying if a circuit or a condition, expressed as a concurrent transition system, satisfies a set of properties expressed ina temporal logic, such as computational tree logic (CTL). This article represents that model checking is feasible in biochemical network verification and it shows certain advantages over simulation for querying and searching of special behavioral properties in biochemical processes.
Krause, Christian; 10.4204/EPTCS.73.8
2011-01-01
The assurance of quality of service properties is an important aspect of service-oriented software engineering. Notations for so-called service level agreements (SLAs), such as the Web Service Level Agreement (WSLA) language, provide a formal syntax to specify such assurances in terms of (legally binding) contracts between a service provider and a customer. On the other hand, formal methods for verification of probabilistic real-time behavior have reached a level of expressiveness and efficiency which allows to apply them in real-world scenarios. In this paper, we suggest to employ the recently introduced model of Interval Probabilistic Timed Automata (IPTA) for formal verification of QoS properties of service-oriented systems. Specifically, we show that IPTA in contrast to Probabilistic Timed Automata (PTA) are able to capture the guarantees specified in SLAs directly. A particular challenge in the analysis of IPTA is the fact that their naive semantics usually yields an infinite set of states and infinitely...
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.
Models of atoms in plasmas based on common formalism for bound and free electrons
Blenski, T.; Piron, R.; Caizergues, C.; Cichocki, B.
2013-12-01
Atom-in-plasma models: Thomas-Fermi (TF) and INFERNO, AJCI and VAAQP, that use the same formalism for all electrons are briefly described and analyzed from the point of view of their thermodynamic consistence. While the TF and VAAQP models may be derived from variational principle and respect the virial theorem, it appears that two earlier quantum extensions of the quasi-classical TF model, INFERNO and AJCI, are not fully variational. The problems of the two latter approaches are analyzed from the point of view of the VAAQP model. However all quantum models seem to give unrealistic description of atoms in plasma at low temperature and high plasma densities. These difficulties are connected with the Wigner-Seitz cavity approach to non-central ions that is present in all considered models. Comparison of some equation-of-state data from TF, INFERNO and VAAQP models are shown on a chosen example. We report also on the status of our research on the frequency-dependent linear-response theory of atoms in plasma. A new Ehrenfest-type sum rule, originally proposed in the quantum VAAQP model, was proven in the case of the response of the TF atom with the Bloch hydrodynamics (TFB) and checked by numerical example. The TFB case allows one to have a direct insight into the rather involved mathematics of the self-consistent linear response calculations in situations when both the central atom and its plasma vicinity are perturbed by an electric field.
Atmospheric inverse modeling with known physical bounds: an example from trace gas emissions
Directory of Open Access Journals (Sweden)
S. M. Miller
2013-09-01
Full Text Available Many inverse problems in the atmospheric sciences involve parameters with known physical constraints. Examples include non-negativity (e.g., emissions of some urban air pollutants or upward limits implied by reaction or solubility constants. However, probabilistic inverse modeling approaches based on Gaussian assumptions cannot incorporate such bounds and thus often produce unrealistic results. The atmospheric literature lacks consensus on the best means to overcome this problem, and existing atmospheric studies rely on a limited number of the possible methods with little examination of the relative merits of each. This paper investigates the applicability of several approaches to bounded inverse problems and is also the first application of Markov chain Monte Carlo (MCMC to estimation of atmospheric trace gas fluxes. The approaches discussed here are broadly applicable. A common method of data transformations is found to unrealistically skew estimates for the examined example application. The method of Lagrange multipliers and two MCMC methods yield more realistic and accurate results. In general, the examined MCMC approaches produce the most realistic result but can require substantial computational time. Lagrange multipliers offer an appealing alternative for large, computationally intensive problems when exact uncertainty bounds are less central to the analysis. A synthetic data inversion of US anthropogenic methane emissions illustrates the strengths and weaknesses of each approach.
Schneider, F.
1999-01-01
UML use cases conceptually identify function points or major requirements that a software system must satisfy. Sequence diagrams expand each use case to show in temporal sequence a more detailed notion of intended system behavior.
Model checking for survivability!
Cloth, Lucia; Haverkort, Boudewijn R.
2005-01-01
Business and social life have become increasingly dependent on large-scale communication and information systems. A partial or complete breakdown as a consequence of natural disasters or purposeful attacks might have severe impacts. Survivability refers to the ability of a system to recover from suc
Preferential Attachment Model with Degree Bound and its Application to Key Predistribution in WSN
Ruj, Sushmita
2016-01-01
Preferential attachment models have been widely studied in complex networks, because they can explain the formation of many networks like social networks, citation networks, power grids, and biological networks, to name a few. Motivated by the application of key predistribution in wireless sensor networks (WSN), we initiate the study of preferential attachment with degree bound. Our paper has two important contributions to two different areas. The first is a contribution in the study of complex networks. We propose preferential attachment model with degree bound for the first time. In the normal preferential attachment model, the degree distribution follows a power law, with many nodes of low degree and a few nodes of high degree. In our scheme, the nodes can have a maximum degree $d_{\\max}$, where $d_{\\max}$ is an integer chosen according to the application. The second is in the security of wireless sensor networks. We propose a new key predistribution scheme based on the above model. The important features ...
The Cramer-Rao Bound and DMT Signal Optimisation for the Identification of a Wiener-Type Model
Directory of Open Access Journals (Sweden)
H. Koeppl
2004-09-01
Full Text Available In linear system identification, optimal excitation signals can be determined using the Cramer-Rao bound. This problem has not been thoroughly studied for the nonlinear case. In this work, the Cramer-Rao bound for a factorisable Volterra model is derived. The analytical result is supported with simulation examples. The bound is then used to find the optimal excitation signal out of the class of discrete multitone signals. As the model is nonlinear in the parameters, the bound depends on the model parameters themselves. On this basis, a three-step identification procedure is proposed. To illustrate the procedure, signal optimisation is explicitly performed for a third-order nonlinear model. Methods of nonlinear optimisation are applied for the parameter estimation of the model. As a baseline, the problem of optimal discrete multitone signals for linear FIR filter estimation is reviewed.
Bound and unbound nuclear systems at the drip lines: a one-dimensional model
Moschini, L.; Pérez-Bernal, F.; Vitturi, A.
2016-08-01
We construct a one-dimensional toy model to describe the main features of Borromean nuclei at the continuum threshold. The model consists of a core and two valence neutrons, unbound in the mean potential, that are bound by a residual point contact density-dependent interaction. Different discretization procedures are used (harmonic oscillator and transformed harmonic oscillator bases, or use of large rigid wall box). Resulting energies and wave functions, as well as inelastic transition intensities, are compared within the different discretization techniques, as well as with the exact results in the case of one particle and with the results of the di-neutron cluster model in the two particles case. Despite its simplicity, this model includes the main physical features of the structure of Borromean nuclei in an intuitive and computationally affordable framework, and will be extended to direct reaction calculations.
Directory of Open Access Journals (Sweden)
Sato,Kimiko
2011-04-01
Full Text Available A questionnaire survey was administered to 317 parents who attended infant health check-ups in City B, Okayama Prefecture between October, 2008 and March, 2009. The questionnaire survey studied 7 factors based on the PRECEDE-PROCEED Model. We analysed factors that affected oral health behaviour and attendance at scheduled dental health check-ups. The survey containing 22 items concerning matters such as 'QOL' and 'health problems' was posted to parents and guardians in advance, and then collected on the day of the medical check-up. The collected data was analysed using the t-test and Pearson's correlation coefficient, following which we conducted a covariance structure analysis. The results showed that dental health behaviour was directly affected by reinforcing factors, and indirectly associated with enabling and predisposing factors influenced by reinforcing factors. It was also shown that predisposing factors and oral health behaviour were associated with attendance at scheduled oral health check-ups. The results indicated that strengthening oral health education by sharing knowledge that acts as predisposing factors and introducing adaptations of oral health behaviour that that fit individual lives will lead to improved attendance at scheduled dental health check-ups.
Sato, Kimiko; Oda, Megumi
2011-04-01
A questionnaire survey was administered to 317 parents who attended infant health check-ups in City B, Okayama Prefecture between October, 2008 and March, 2009. The questionnaire survey studied 7 factors based on the PRECEDE-PROCEED Model. We analysed factors that affected oral health behaviour and attendance at scheduled dental health check-ups. The survey containing 22 items concerning matters such as 'QOL' and 'health problems' was posted to parents and guardians in advance, and then collected on the day of the medical check-up. The collected data was analysed using the t-test and Pearson's correlation coefficient, following which we conducted a covariance structure analysis. The results showed that dental health behaviour was directly affected by reinforcing factors, and indirectly associated with enabling and predisposing factors influenced by reinforcing factors. It was also shown that predisposing factors and oral health behaviour were associated with attendance at scheduled oral health check-ups. The results indicated that strengthening oral health education by sharing knowledge that acts as predisposing factors and introducing adaptations of oral health behaviour that that fit individual lives will lead to improved attendance at scheduled dental health check-ups. PMID:21519364
A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model
Institute of Scientific and Technical Information of China (English)
Mao Chen; Wen-Qi Huang
2005-01-01
A branch and bound algorithm is proposed for the two-dimensional protein folding problem in the HP lattice model. In this algorithm, the benefit of each possible location of hydrophobic monomers is evaluated and only promising nodes are kept for further branching at each level. The proposed algorithm is compared with other well-known methods for 10 benchmark sequences with lengths ranging from 20 to 100 monomers. The results indicate that our method is a very efficient and promising tool for the protein folding problem.
What is a leader of opinion formation in bounded confidence models?
Kurmyshev, E
2013-01-01
Taking a decision in democratic social groups is based on the opinion of the majority or on the consensus. So, the study of opinion dynamics is of great interest in analyzing social phenomena. Among the different models of opinion dynamics, bounded confidence models have been studied in different contexts and shown interesting dynamics [1-3]. In [E. Kurmyshev, H.A. Ju\\'arez, and R.A. Gonz\\'alez-Silva, Phys. A 390, 16 (2011)] we proposed a new bounded confidence model and studied the self-formation of opinion in heterogeneous societies composed by agents of two psychological types, concord (C-) and partial antagonism (PA-) agents. In this work we study the influence of "leaders" on the clustering of opinions. Mixed C/PA-societies along with the pure C- and PA-society are studied. The influence of the leader's connectivity in the network, his toughness or tolerance and his opinion on the opinion dynamics is studied as a function of the initial opinion uncertainty (tolerance) of the population. Numerical results...
A new bounding-surface plasticity model for cyclic behaviors of saturated clay
Hu, Cun; Liu, Haixiao
2015-05-01
A new combined isotropic-kinematic hardening rule is proposed based on the concept of the generalized homological center and the generalization of Masing's rule. The key point of the new hardening rule is that the unloading event can be treated as if it were virgin loading through taking the stress reversal point as the new generalized homological center of the bounding surface. Therefore, a new simple bounding-surface plasticity model with three important features for the cyclic behaviors of saturated clay is developed. Firstly, according to the movement of the generalized homological center, the model can harden not only isotropically but also kinematically to account for the anisotropy and memory the particular loading events. Secondly, the continuous cyclic loading is divided into the first loading, unloading and reloading processes and they are treated differently when calculating the hardening modulus to describe the soil responses accurately. The third feature is taking the generalized homological center as the mapping origin in the mapping rule to reflect the plastic flow in the unloading event. The behaviors of saturated clay for the monotonic and cyclic stress-controlled and strain-controlled triaxial tests are simulated by the model. The prediction results show an encouraging agreement with the experimental data.
Directory of Open Access Journals (Sweden)
Zhili Liang
2016-04-01
Full Text Available Peptide-bound advanced glycation end-products (peptide-bound AGEs can be formed when peptides are heated with reducing saccharides. Pyrraline is the one of most commonly studied AGEs in foods, but the relative importance of the precursor peptide structure is uncertain. In the present study, model systems were prepared by heating peptides with glucose from 60 °C to 220 °C for up to 65 min, and the amounts of peptide-bound pyrraline formed were monitored to evaluate the effect of the neighboring amino acids on the peptide-bound pyrraline formation. The physico-chemical properties were introduced to explore the quantitative structure-reactivity relationships between physicochemical properties and peptide bound formation. 3-DG content in dipeptide-glucose model system was higher than that in the corresponding tripeptide-glucose model systems. Dipeptides produced higher amounts of peptide-bound pyrraline than the corresponding tripeptides. The peptide-bound pyrraline and 3-DG production were influenced by the physico-chemical properties of the side chain of amino acids adjacent to Lys in the following order: Lys-Leu/glucose > Lys-Ile/glucose > Lys-Val/ glucose > Lys-Thr/glucose > Lys-Ser/glucose > Lys-Ala/ glucose > Lys-Gly/glucose; Lys-Leu-Gly/glucose > Lys-Ile-Gly/glucose > Lys-Val-Gly/glucose > Lys-Thr-Gly/glucose > Lys-Ser-Gly/glucose > Lys-Ala-Gly/glucose > Lys-Gly-Gly/glucose. For the side chain of amino acids adjacent to Lys in dipeptides, residue volume, polarizability, molecular volume and localized electrical effect were positively related to the yield of peptide bound pyrraline, while hydrophobicity and pKb were negatively related to the yield of peptide bound pyrraline. In terms of side chain of amino acid adjacent to Lys in tripeptides, a similar result was observed, except hydrophobicity was positively related to the yield of peptide bound pyrraline.
... Medical Conditions Nutrition & Fitness Emotional Health Annual Check-Up Posted under Health Guides . Updated 7 January 2015. + ... I get ready for my annual medical check-up? If this is your first visit to your ...
Checking a Conceptual Model for Groundwater Flow in the Fractured Rock at Äspö, Sweden
Kröhn, K. P.
2015-12-01
The underground Hard Rock Laboratory (HRL) at Äspö, Sweden, is located in granitic rock and dedicated to investigations concerning deep geological disposal of radioactive waste. Several in-situ experiments have been performed in the HRL, among them the recent Buffer-Rock Interaction Experiment (BRIE) and, on a much larger scale, the long-term Prototype Repository (PR) experiment.Interpretation of such experiments requires a profound understanding of the groundwater flow system. Often assumed is a conceptual model where the so-called "intact rock" is interspersed with stochastically distributed fractures. It is also a common assumption, though, that fractures in granite exist on all length-scales implying that the hydraulically relevant rock porosity is basically made up of micro fractures. The conceptual approach of GRS' groundwater flow code d3f thus appeared to be fitting where large fractures are represented discretely by lower-dimensional features while the remaining set of smaller fractures - also called "background fractures" - is assumed to act like an additional homogeneous continuum besides what is believed to be the undisturbed matrix. This approach was applied to a hydraulic model of the BRIE in a cube-like domain of 40 m side length including drifts, boreholes and three intersecting large fractures. According to observations at the underground rock laboratories Stripa and the HRL a narrow zone of reduced permeability - called "skin" - was additionally arranged around all geotechnical openings. Calibration of the model resulted in a considerable increase of matrix permeability due to adding the effect of the background fractures. To check the validity of this approach the calibrated data for the BRIE were applied to a model for the PR which is also located in the HRL but at quite some distance. The related brick-shaped model domain has a size of 200 m x 150 m x 50 m. Fitting the calculated outflow from the rock to the measured outflow distribution
Systematic model-dependent behaviour of fusion involving weakly bound projectiles 6,7Li
International Nuclear Information System (INIS)
Many measurements on complete fusion (CF) cross section at above barrier energies involving weakly bound stable projectiles (e.g., 6Li, 7Li and 9Be) show suppression by various degrees compared to theoretical estimates as well as experimental CF cross sections of reactions involving strongly bound projectiles. However, there is no concrete picture at sub-barrier energies. The conclusions based on coupled-channels (CC) calculations using different codes (e.g., FRESCO or CCFULL) may differ as the theoretical models used to calculate fusion are not same. In a recent paper on complete fusion in 7Li+152Sm system, the fusion cross sections calculated by CCFULL and FRESCO have been shown to be different despite using same bare potential. It was observed that with the inclusion of only inelastic couplings, the results of FRESCO were much closer to the experimental data in the above barrier region, while the CCFULL results overpredict the data over the entire range. To explore the above observation in different systems involving 6,7Li as projectile, in the present work, a systematic and detailed study has been carried out by means of CC calculations using both FRESCO and CCFULL. The aim is to analyze the differences between the two models of calculations
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
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.)
Bolton, Matthew L; Bass, Ellen J
2010-09-01
Breakdowns in complex systems often occur as a result of system elements interacting in ways unanticipated by analysts or designers. In systems with human operators, human-automation interaction associated with both normative and erroneous human behavior can contribute to such failures. This paper presents a method for automatically generating task analytic models encompassing both erroneous and normative human behavior from normative task models. The resulting model can be integrated into a formal system model so that system safety properties can be formally verified with a model checker. This allows analysts to prove that a human automation-interactive system (as represented by the model) will or will not satisfy safety properties with both normative and generated erroneous human behavior. This method is illustrated with a case study: the operation of a radiation therapy machine. In this example, a problem resulting from a generated erroneous human action is discovered. Future extensions of our method are discussed.
Hahn, Y. K.
2016-09-01
A statistical density model for composite system scattering is formulated, by incorporating the ensemble density functional approach in describing the correlation dynamics during the collision. The principal difficulty of non-integrable propagating waves is first resolved by treating the open and closed channels separately; only the closed channel part does allow a density description. The unique open/closed channel separation adopted here allows not only the closed channel Hamiltonian MQ to support integrable densities, but also to establish the important bounds on the scattering amplitude. A modified ensemble energy functional for the MQ is constructed, and the statistical densities ρmtQ for the closed channels are generated. The scattering amplitude is then formulated in terms of the ρmtQ and the coefficients of variation that connect the closed channels to the asymptotic source. Evaluation of the amplitude integrals requires the determinantal functions deduced from the ρmtQ, which also leads to a coupled channel approach. The bound property of the amplitude allows variational optimization of the coefficients. Approximate procedures for securing the orthogonality of the MQ and for evaluation of the source term itself are discussed, including a judicious choice of configurations with zero and one inner-shell holes. Validity of the several critical modifications introduced is assessed.
Microbial bioavailability of covalently bound polymer coatings on model engineered nanomaterials.
Kirschling, Teresa L; Golas, Patricia L; Unrine, Jason M; Matyjaszewski, Krzysztof; Gregory, Kelvin B; Lowry, Gregory V; Tilton, Robert D
2011-06-15
By controlling nanoparticle flocculation and deposition, polymer coatings strongly affect nanoparticle fate, transport, and subsequent biological impact in the environment. Biodegradation is a potential route to coating breakdown, but it is unknown whether surface-bound polymers are bioavailable. Here we demonstrate, for the first time, that polymer coatings covalently bound to nanomaterials are bioavailable. Model poly(ethylene oxide) (PEO) brush-coated nanoparticles (densely cross-linked bottle brush copolymers) with hydrophobic divinyl benzene cross-linked cores and hydrophilic PEO brush shells, having ~ 30 nm hydrodynamic radii, were synthesized to obtain a nanomaterial in which biodegradation was the only available coating breakdown mechanism. PEO-degrading enrichment cultures were supplied with either PEO homopolymer or PEO brush nanoparticles as the sole carbon source, and protein and CO₂ production were monitored as a measure of biological conversion. Protein production after 90 h corresponded to 14% and 8% of the total carbon available in the PEO homopolymer and PEO brush nanoparticle cultures, respectively, and CO₂ production corresponded to 37% and 3.8% of the carbon added to the respective system. These results indicate that the PEO in the brush is bioavailable. Brush biodegradation resulted in particle aggregation, pointing to the need to understand biologically mediated transformations of nanoparticle coatings in order to understand the fate and transport of nanoparticles in the environment. PMID:21609011
Self-bound quark matter in the NJL model revisited: from schematic droplets to solitonic lasagne
Buballa, Michael
2012-01-01
The existence and the properties of self-bound quark matter in the NJL model at zero temperature are investigated in mean-field approximation, focusing on inhomogeneous structures with one-dimensional spatial modulations. It is found that the most stable homogeneous solutions which have previously been interpreted as schematic quark droplets are unstable against formation of a one-dimensional soliton-antisoliton lattice. The solitons repel each other, so that the minimal energy per quark is realized in the single-soliton limit. The properties of the solitons and their interactions are discussed in detail, and the effect of vector interactions is estimated. The results may be relevant for the dynamics of expanding quark matter.
Pattern Selection and Super-patterns in the Bounded Confidence Model
Ben-Naim, E
2015-01-01
We study pattern formation in the bounded confidence model of opinion dynamics. In this random process, opinion is quantified by a single variable. Two agents may interact and reach a fair compromise, but only if their difference of opinion falls below a fixed threshold. Starting from a uniform distribution of opinions with compact support, a traveling wave forms and it propagates from the domain boundary into the unstable uniform state. Consequently, the system reaches a steady state with isolated clusters that are separated by distance larger than the interaction range. These clusters form a quasi-periodic pattern where the sizes of the clusters and the separations between them are nearly constant. We obtain analytically the average separation between clusters L. Interestingly, there are also very small quasi-periodic modulations in the size of the clusters. The spatial periods of these modulations are a series of integers that follow from the continued fraction representation of the irrational average sepa...
Variational Worldline Approximation for the Relativistic Two-Body Bound State in a Scalar Model
Barro-Bergfl"odt, K; Stingl, M
2006-01-01
We use the worldline representation of field theory together with a variational approximation to determine the lowest bound state in the scalar Wick-Cutkosky model where two equal-mass constituents interact via the exchange of mesons. Self-energy and vertex corrections are included approximately in a consistent way as well as crossed diagrams. Only vacuum-polarization effects of the heavy particles are neglected. In a path integral description of an appropriate current-current correlator an effective, retarded action is obtained by integrating out the meson field. As in the polaron problem we employ a quadratic trial action with variational functions to describe retardation and binding effects through multiple meson exchange.The variational equations for these functions are derived, discussed qualitatively and solved numerically. We compare our results with the ones from traditional approaches based on the Bethe-Salpeter equation and find an enhanced binding. For weak coupling this is worked out analytically ...
模型检测网络传播干预策略%Model Checking Network Transmission Intervention Policies
Institute of Scientific and Technical Information of China (English)
余鹏; 魏欧; 韩兰胜; 牛耘
2014-01-01
Network exists widely in nature and human society. The spread of infections, such as computer viruses, diseases and rumors, poses great challenges to economic and societal system. It is an important issue in the network transmission control to protect individuals by finding effective intervention policies. This paper focuses on the net-work transmission model affected by time and adjacent nodes. Based on existing static protection work, a further study on dynamic protection cases is conducted, and four kinds of analyses of intervention policies are summarized. The intervention goals are expressed as logical properties and an effective approach of searching for intervention policies via model checking is proposed. Furthermore, experiments on random and small-world networks are con-ducted, demonstrating the advantages and disadvantages of model checkers NuSMV and SPIN on solving intervention problems. The results indicate that NuSMV needs less memory, but more time to complete searching, for example three times are unfinished in total six trails because of time exceeding in the dynamic recoverable problem;SPIN needs less time, but more memory, for example one time is unfinished in total six trails because of memory exceeding in the static unrecoverable problem.%网络广泛存在于自然界和人类生活中，计算机病毒、传染疾病、森林火灾和社会流言等在网络中的传播给经济、社会带来巨大挑战，寻找有效的干预策略实现对网络传播的控制是一个重要的研究问题。对受时间和邻接点影响的网络传播模型进行了重点关注，在已有静态保护工作的基础上，进一步研究了动态保护情况，总结了4类相关的干预策略分析问题；通过将干预目标描述为相应的时序逻辑属性，给出了通过模型检测找出有效的干预策略以抑制传播的方法。针对随机和小世界两种网络，比较分析了NuSMV和SPIN两种模型检测工具在解决具体网
Analysis of Video Stream Buffer Checking Model in AVS%AVS标准中的视频码流缓冲区校验模型分析
Institute of Scientific and Technical Information of China (English)
王小根; 赵海武; 李国平; 滕国伟; 王国中
2012-01-01
分析了AVS标准和MPEG-2标准中的视频码流缓冲区校验模型,阐述了视频码流缓冲区校验模型的原理,对标准中的相关规定进行了整理和总结,对标准中晦涩难懂的部分进行了解释,对标准中没有明确规定的部分提出了建议.将码流缓冲区模式分成3类,并提出了高延迟模式的概念.通过对编解码过程的分析,推导出编码器维持缓冲区不溢出的条件.%In this paper, the video stream buffer checking model in AVS and MPEG-2 standard is analyzed, the principle of video stream buffer checking model is described,the relevant provisions of these standards are summarized, some parts are eaplained which are difficult to understand, and suggestions to the ambiguous part are given. The video stream buffer checking model is divided into three classes, the concept of high-delay mode is proposed ,the condition is derived which keep the buffer do not overflow in the encoder after analyzing the encoding and decoding process.
Bioavailability of organically bound Fe to model phytoplankton of the Southern Ocean
Directory of Open Access Journals (Sweden)
C. S. Hassler
2009-10-01
Full Text Available Iron (Fe is known to be mostly bound to organic ligands and to limit primary productivity in the Southern Ocean. It is thus important to investigate the bioavailability of organically bound Fe. In this study, we used four phytoplankton species of the Southern Ocean (Phaeocystis sp., Chaetoceros sp., Fragilariopsis kerguelensis and Thalassiosira antarctica Comber to measure the influence of various organic ligands on Fe solubility and bioavailability. Short-term uptake Fe:C ratios were inversely related to the surface area to volume ratios of the phytoplankton. The ratio of extracellular to intracellular Fe is used to discuss the relative importance of diffusive supply and uptake to control Fe bioavailability. The effect of excess organic ligands on Fe bioavailability cannot be solely explained by their effect on Fe solubility. For most strains studied, the bioavailability of Fe can be enhanced relative to inorganic Fe in the presence of porphyrin, catecholate siderophore and saccharides whereas it was decreased in presence of hydroxamate siderophore and organic amine. For Thalassiosira, iron bioavailability was not affected by the presence of porphyrin, catecholate siderophore and saccharides. The enhancement of Fe bioavailability in presence of saccharides is presented as the result from both the formation of bioavailable (or chemically labile organic form of Fe and the stabilisation of Fe within the dissolved phase. Given the ubiquitous presence of saccharides in the ocean, these compounds might represent an important factor to control the basal level of soluble and bioavailable Fe. Results show that the use of model phytoplankton is promising to improve mechanistic understanding of Fe bioavailability and primary productivity in HNLC regions of the ocean.
Das, Arindam; Oda, Satsuki; Okada, Nobuchika; Takahashi, Dai-suke
2016-06-01
We consider the minimal U(1 ) ' extension of the standard model (SM) with the classically conformal invariance, where an anomaly-free U(1 ) ' gauge symmetry is introduced along with three generations of right-handed neutrinos and a U(1 ) ' Higgs field. Since the classically conformal symmetry forbids all dimensional parameters in the model, the U(1 ) ' gauge symmetry is broken by the Coleman-Weinberg mechanism, generating the mass terms of the U(1 ) ' gauge boson (Z' boson) and the right-handed neutrinos. Through a mixing quartic coupling between the U(1 ) ' Higgs field and the SM Higgs doublet field, the radiative U(1 ) ' gauge symmetry breaking also triggers the breaking of the electroweak symmetry. In this model context, we first investigate the electroweak vacuum instability problem in the SM. Employing the renormalization group equations at the two-loop level and the central values for the world average masses of the top quark (mt=173.34 GeV ) and the Higgs boson (mh=125.09 GeV ), we perform parameter scans to identify the parameter region for resolving the electroweak vacuum instability problem. Next we interpret the recent ATLAS and CMS search limits at the LHC Run-2 for the sequential Z' boson to constrain the parameter region in our model. Combining the constraints from the electroweak vacuum stability and the LHC Run-2 results, we find a bound on the Z' boson mass as mZ'≳3.5 TeV . We also calculate self-energy corrections to the SM Higgs doublet field through the heavy states, the right-handed neutrinos and the Z' boson, and find the naturalness bound as mZ'≲7 TeV , in order to reproduce the right electroweak scale for the fine-tuning level better than 10%. The resultant mass range of 3.5 TeV ≲mZ'≲7 TeV will be explored at the LHC Run-2 in the near future.
Calvert, S.C.; Snelder, M.; Taale, H.; Wageningen-Kessels, F.L.M. van; Hoogendoorn, S.P.
2015-01-01
In this contribution a model-based analysis of the application of bounded acceleration in traffic flow is considered as a cause for the capacity drop. This is performed in a Lagrangian formulation of the kinematic wave model with general vehicle specific characteristics. Unconstrained overtaking is
Binswanger, J.
2010-01-01
This paper develops a new life cycle model that aims to describe the savings and asset allocation choices of boundedly rational agents. In this model, agents make forward-looking decisions without the requirement of anticipating their actual future decisions. Instead, agents pursue two simple so-cal
On Possible S-Wave Bound States for an N-(N) System Within a Constituent Quark Model
Institute of Scientific and Technical Information of China (English)
CHANG Chao-Hsi; PANG Hou-Rong
2005-01-01
We try to apply a constituent quark model (a variety chiral constituent quark model) and the resonating group approach for the multi-quark problems to compute the effective potential between the NN- in S-wave (the quarks in the nucleons N and N-, and the two nucleons relatively as well, are in S wave) so as to see the possibility if there may be a tight bound state of six quarks as indicated by a strong enhancement at threshold of pp- in J/ψ and B decays. The effective potential which we obtain in terms of the model and approach shows if the experimental enhancement is really caused by a tight S-wave bound state of six quarks, then the quantum number of the bound state is very likely to be I = 1, JPC= 0-+.
Bound states in the 3d Ising model and implications for QCD at finite temperature and density
Caselle, M; Provero, P; Zarembo, K
2002-01-01
We study the spectrum of bound states of the three dimensional Ising model in the (h,beta) plane near the critical point. We show the existence of an unbinding line, defined as the boundary of the region where bound states exist. Numerical evidence suggests that this line coincides with the beta=beta_c axis. When the 3D Ising model is considered as an effective description of hot QCD at finite density, we conjecture the correspondence between the unbinding line and the line that separates the quark-gluon plasma phase from the superconducting phase. The bound states of the Ising model are conjectured to correspond to the diquarks of the latter phase of QCD.
Leung, Ming Lam; Zhang, Shengyu
2011-01-01
We study the communication complexity of symmetric XOR functions, namely functions $f: \\{0,1\\}^n \\times \\{0,1\\}^n \\rightarrow \\{0,1\\}$ that can be formulated as $f(x,y)=D(|x\\oplus y|)$ for some predicate $D: \\{0,1,...,n\\} \\rightarrow \\{0,1\\}$, where $|x\\oplus y|$ is the Hamming weight of the bitwise XOR of $x$ and $y$. We give a public-coin randomized protocol in the Simultaneous Message Passing (SMP) model, with the communication cost matching the known lower bound for the \\emph{quantum} and \\emph{two-way} model up to a logarithm factor. As a corollary, this closes a quadratic gap between quantum lower bound and randomized upper bound for the one-way model, answering an open question raised in Shi and Zhang \\cite{SZ09}.
Saric, Dragomir
2006-01-01
We give a short proof of the fact that bounded earthquakes of the unit disk induce quasisymmetric maps of the unit circle. By a similar method, we show that symmetric maps are induced by bounded earthquakes with asymptotically trivial measures.
McNicholl, Patrick J.; Crabtree, Peter N.
2014-09-01
Applications of stellar occultation by solar system objects have a long history for determining universal time, detecting binary stars, and providing estimates of sizes of asteroids and minor planets. More recently, extension of this last application has been proposed as a technique to provide information (if not complete shadow images) of geosynchronous satellites. Diffraction has long been recognized as a source of distortion for such occultation measurements, and models subsequently developed to compensate for this degradation. Typically these models employ a knife-edge assumption for the obscuring body. In this preliminary study, we report on the fundamental limitations of knife-edge position estimates due to shot noise in an otherwise idealized measurement. In particular, we address the statistical bounds, both Cramér- Rao and Hammersley-Chapman-Robbins, on the uncertainty in the knife-edge position measurement, as well as the performance of the maximum-likelihood estimator. Results are presented as a function of both stellar magnitude and sensor passband; the limiting case of infinite resolving power is also explored.
Structural ensemble dynamics based closure model for wall-bounded turbulent flow
Institute of Scientific and Technical Information of China (English)
Zhen-Su She; Ning Hu; You Wu
2009-01-01
Wall-bounded turbulent flow involves the development of multi-scale turbulent eddies, as well as a sharply varying boundary layer. Its theoretical descriptions are yet phenomenological. We present here a new framework called structural ensemble dynamics (SED), which aims at using systematically all relevant statistical properties of turbulent structures for a quantitative description of ensemble means. A new set of closure equations based on the SED approach for a turbulent channel flow is presented. SED order functions are defined, and numerically determined from data of direct numerical simulations (DNS). Computational results show that the new closure model reproduces accurately the solution of the original Navier-Stokes simulation, including the mean velocity profile, the kinetic energy of the stream-wise velocity component, and every term in the energy budget equation. It is suggested that the SED-based studies of turbulent structure builds a bridge between the studies of physical mechanisms of turbulence and the development of accurate model equations for engineering predictions.
The Dynamic Checking of Complex Real Time System
Institute of Scientific and Technical Information of China (English)
YU Chao; HUANG Benwen; WU Guoqing
2006-01-01
The paper presents an dynamic execution model of complex real-time software based on requirement description model RTRSM, and then propose a checking method based on configuration covering and its corresponding algorithm. This checking method can check the execution situations between parallel elements in a dynamic execution step of real-time software systems. It also can check all the states and transitions which assure the completeness of checking. In the end, related theorem is proofed.
40 CFR 86.327-79 - Quench checks; NOX analyzer.
2010-07-01
... 40 Protection of Environment 18 2010-07-01 2010-07-01 false Quench checks; NOX analyzer. 86.327-79... Quench checks; NOX analyzer. (a) Perform the reaction chamber quench check for each model of high vacuum... capillary, and if used, dilution capillary. (c) Quench check as follows: (1) Calibrate the NOX analyzer...
Bound entanglement and entanglement bounds
Energy Technology Data Exchange (ETDEWEB)
Sauer, Simeon [Physikalisch-Astronomische Fakultaet, Friedrich-Schiller-Univesitaet Jena (Germany)]|[Physikalisches Institut, Albert-Ludwigs-Universitaet Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg (Germany); Melo, Fernando de; Mintert, Florian; Buchleitner, Andreas [Physikalisches Institut, Albert-Ludwigs-Universitaet Freiburg, Hermann-Herder-Strasse 3, D-79104 Freiburg (Germany)]|[Max-Planck-Institut fuer Physik komplexer Systeme, Noethnitzer Str.38, D-01187 Dresden (Germany); Bae, Joonwoo [School of Computational Sciences, Korea Institute for Advanced Study, Seoul 130-012 (Korea); Hiesmayr, Beatrix [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)
2008-07-01
We investigate the separability of Bell-diagonal states of two qutrits. By using lower bounds to algebraically estimate concurrence, we find convex regions of bound entangled states. Some of these regions exactly coincide with the obtained results when employing optimal entanglement witnesses, what shows that the lower bound can serve as a precise detector of entanglement. Some hitherto unknown regions of bound entangled states were discovered with this approach, and delimited efficiently.
Energy Technology Data Exchange (ETDEWEB)
Royo, B.; Valdes, R.
2012-11-01
This report contains the description and the results of the dynamic simulation model that has been developed to predict the behaviour of one of our lift check valve design. The aim of the model is not only to simulate the closing process of the valve and to product the magnitude of the water hammer effect that may appear immediately after the valve closing, but also to simulate several design version until obtain the optimum which further minimizes such effect. the input data used for this study ensure reliable results since they represent a real system. (Author)
Anonymity control in electronic check systems
Institute of Scientific and Technical Information of China (English)
Ma Chunguang; Yang Yixian; Hu Zhengming
2005-01-01
Electronic check systems, as one of electronic payment systems, are more desirable than other electronic cash systems. In the system, only a single check is used to pay any price that is not more than the face value. The main problem in check systems is to design an efficient refund mechanism that makes refund checks undistinguished from initial checks during payment and deposit. The problem of anonymity control also called fairness is also an important issue in check systems. All check systems yet are unconditional anonymity that opens the door to misuse for crime such as laundering and blackmailing. In this paper, the notion of anonymity revocation is introduced to electronic check system for the first time, and a model of fair electronic check system is proposed. An efficient fair online electronic check system with reusable refund is presented. In the system, a passive trustee is employed to revoke the anonymity of un-honest users. Moreover, the system solves the reusability problem of refunds thanks to the RSA-based partially signature. The system is efficient and meets all basic security requirements.
Super-Grid Modeling of the Elastic Wave Equation in Semi-Bounded Domains
Energy Technology Data Exchange (ETDEWEB)
Petersson, N. Anders; Sjögreen, Björn
2014-10-01
We develop a super-grid modeling technique for solving the elastic wave equation in semi-bounded two- and three-dimensional spatial domains. In this method, waves are slowed down and dissipated in sponge layers near the far-field boundaries. Mathematically, this is equivalent to a coordinate mapping that transforms a very large physical domain to a significantly smaller computational domain, where the elastic wave equation is solved numerically on a regular grid. To damp out waves that become poorly resolved because of the coordinate mapping, a high order artificial dissipation operator is added in layers near the boundaries of the computational domain. We prove by energy estimates that the super-grid modeling leads to a stable numerical method with decreasing energy, which is valid for heterogeneous material properties and a free surface boundary condition on one side of the domain. Our spatial discretization is based on a fourth order accurate finite difference method, which satisfies the principle of summation by parts. We show that the discrete energy estimate holds also when a centered finite difference stencil is combined with homogeneous Dirichlet conditions at several ghost points outside of the far-field boundaries. Therefore, the coefficients in the finite difference stencils need only be boundary modified near the free surface. This allows for improved computational efficiency and significant simplifications of the implementation of the proposed method in multi-dimensional domains. Numerical experiments in three space dimensions show that the modeling error from truncating the domain can be made very small by choosing a sufficiently wide super-grid damping layer. The numerical accuracy is first evaluated against analytical solutions of Lamb’s problem, where fourth order accuracy is observed with a sixth order artificial dissipation. We then use successive grid refinements to study the numerical accuracy in the more
Lower Bounds for Sorted Geometric Queries in the I/O Model
DEFF Research Database (Denmark)
Afshani, Peyman; Zeh, Norbert
2012-01-01
asks us to preprocess an input point set S in the plane so that, given a query point q, the clockwise ordering of the points in S around q can be computed efficiently. In the latter problem, the output is the list of K points in S closest to q, sorted by increasing distance from q. The goal in both...... problems is to construct a small data structure that can answer queries efficiently. We study sorted geometric query problems in the I/O model and prove that, when limited to linear space, the naïve approach of sorting the elements in S in the desired output order from scratch is the best possible....... 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...
THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL,METAHEURISTIC AND LOWER BOUNDS
Institute of Scientific and Technical Information of China (English)
Feng CHU; Nacima LABADI; Christian PRINS
2004-01-01
The Periodic Capacitated Arc Routing Problem (PCARP) generalizes the well known NP-hard Capacitated Arc Routing Problem (CARP) by extending the single period to multi-period horizon.The Capacitated Arc Routing Problem (CARP) is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, called tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips in each period, to minimize the total cost on the whole horizon. This new problem arises in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and preliminary lower bounds based on graph transformation are proposed. A meta-heuristic approach - Scatter Search (SS) is developed for the PCARP and evaluated on a large variety of instances.
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.
对象角色模型局部语义冲突即时检查方法研究%Research on local semantic conflicts instantly check methods for ORM model
Institute of Scientific and Technical Information of China (English)
潘文林
2015-01-01
The object of existing ORM model checking methods for semantic conflict is global model. Each check will take a long time, can’t meet the needs of modeling tools to instant check. 10 kinds of local semantic conflict check pattern and algorithm have been proposed to instantly check ORM model. The basic idea is:limiting the scope of the semantic conflict check, abstracting a series of local model check pattern based on the characteristic of local model structure, and then local semantic conflicts which are caused by the new model elements can be instantly checked based on local model check patterns.%现有的ORM模型语义冲突检查方法针对的是全局模型，检查时间长，不能支持建模工具即时检查的需要。为满足即时检查ORM模型的要求，提出了10种局部语义冲突检查模式和算法。基本思想是：通过限定语义冲突检查范围，将局部模型结构抽象为各种模式来检查新增模型元素可能引起的局部语义冲突。该方法能有效提升建模工具的可用性和模型质量。
Han, Hyojung; Rojewski, Jay W.
2015-01-01
A Korean national database, the High School Graduates Occupational Mobility Survey, was used to examine the influence of perceived social supports (family and school) and career adaptability on the subsequent job satisfaction of work-bound adolescents 4 months after their transition from high school to work. Structural equation modeling analysis…
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. PMID:24807443
... Materials The Healthy Heart Handbook for Women Check it Out Tests That Can Help Protect Your Heart ... years, or more often if your doctor recommends it. Other Tests There also are several tests that ...
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....
Abdalrahman, Bayad; Soljak, Michael
2014-01-01
Cardiovascular disease is the leading cause of mortality and morbidity worldwide. In England, the government has adopted a population-wide prevention program for cardiovascular disease, the NHS Health Check program. The program has sparked controversies over the evidence base and feasibility of implementation. We aim to provide an update on the debate and program implementation. In conclusion, the evidence base for the NHS Health Check program has a number of uncertainties and program deliver...
MODEL CHECKING FOR CONCURRENT AND REAL-TIME SYSTEMS%并发和实时系统的模型检验技术
Institute of Scientific and Technical Information of China (English)
董威; 王戟; 齐治昌
2001-01-01
Model checking is an important technology of automatic verification. It verifies the modal/proposition properties of concurrent or real-time systems through explicit state exploration or implicit fixpoint computation. It can ensure the correctness of critical application such as communication protocol and digital circuit. In this paper, the development and state-of-art of model checking are expatiated. Two main tactics separately based on automata theory and symbolic structure for concurrent systems are described and the methods to solve state explosion problem are given. Then the methods of model checking for real-time systems and object-oriented designs are introduced. The corresponding known tools for every method are also presented. Finally, the difficulties faced by model checking and its developing trend are analyzed.%模型检验是一种重要的自动验证技术，通过显式状态搜索或隐式不动点计算来验证并发或实时系统的模态/命题性质，以保证通信协议、数字电路等设计的正确性.详细阐述了模型检验技术的发展与研究现状.首先描述了并发系统分别基于自动机理论和符号化的两种主要模型检验策略，并给出解决状态爆炸问题的主要方法；然后介绍了针对实时系统以及面向对象设计的模型检验方法；对每种方法都介绍了相应的典型工具.最后分析了模型检验面临的困难以及今后发展趋势.
Hoyer, Paul
2016-01-01
Even a first approximation of bound states requires contributions of all powers in the coupling. This means that the concept of "lowest order bound state" needs to be defined. In these lectures I discuss the "Born" (no loop, lowest order in $\\hbar$) approximation. Born level states are bound by gauge fields which satisfy the classical field equations. As a check of the method, Positronium states of any momentum are determined as eigenstates of the QED Hamiltonian, quantized at equal time. Analogously, states bound by a strong external field $A^\\mu(\\xv)$ are found as eigenstates of the Dirac Hamiltonian. Their Fock states have dynamically created $e^+e^-$ pairs, whose distribution is determined by the Dirac wave function. The linear potential of $D=1+1$ dimensions confines electrons but repels positrons. As a result, the mass spectrum is continuous and the wave functions have features of both bound states and plane waves. The classical solutions of Gauss' law are explored for hadrons in QCD. A non-vanishing bo...
Wishart, Justin Rory
2011-01-01
In this paper, a lower bound is determined in the minimax sense for change point estimators of the first derivative of a regression function in the fractional white noise model. Similar minimax results presented previously in the area focus on change points in the derivatives of a regression function in the white noise model or consider estimation of the regression function in the presence of correlated errors.
Directory of Open Access Journals (Sweden)
Hylander Ingrid
2010-07-01
Full Text Available Abstract Background Worldwide, multicultural interaction within health care seems to be challenging and problematic. This is also true among Primary Child Health Care nurses (PCHC nurses in the Swedish Primary Child Health Care services (PCHC services. Therefore, there was a need to investigate the parents' perspective in-depth. Aim The aim of the study was to construct a theoretical model that could promote further understanding of the variety of experiences of parents of foreign origin regarding their interaction with the PCHC nurses at PCHC services. Method The study used Grounded Theory Methodology. Twenty-one parents of foreign origin in contact with PCHC servicies were interviewed. Results In our study parents were watchfully checking rapport, i.e. if they could perceive sympathy and understanding from the PCHC nurses. This was done by checking the nurse's demeanour and signs of judgement. From these interviews we created a theoretical model illustrating the interactive process between parents and PCHC nurses. Conclusion We found it to be of utmost importance for parents to be certain that it was possible to establish rapport with the PCHC nurse. If not, disruptions in the child's attendance at PCHC services could result. PCHC nurses can use the theoretical model resulting from this study as a basis for understanding parents, avoiding a demeanour and judgements that may cause misunderstandings thus promoting high-quality interaction in PCHC services.
Ackermann error checking method based on CATIA Parametric-modeling%基于 CATIA 参数化建模校核 Ackermann误差的方法
Institute of Scientific and Technical Information of China (English)
杨洪云; 胡伟; 陈琪; 施正生
2016-01-01
This article presents the concept of Ackermann error and the defects of traditional checking method , building full-geometrical steering hard-point model by the parametric- modeling method to obtain the precise Ackermann error with the function of parameter-driven, realized the goal of checking Ackermann error of a mount of vehicles with high efficiency and precision utilizing the Design table to build the skeleton model of steering system of all vehicles.%介绍了 Ackermann 误差概念和传统校核方法的局限性，提出采用 CATIA 参数化建模方式，建立全空间转向机构硬点-骨架模型，依靠 CATIA 参数化驱动功能，通过改变参数得到非常精确的 Ackermann 误差，并且利用参数与设计表关联，快速得到所有车型转向系统的骨架模型，实现了高效、准确校核大量车型 Ackermann 误差的目的。
Ackermann error checking method based on CATIA Parametric-modeling%基于 CATIA 参数化建模校核 Ackermann误差的方法
Institute of Scientific and Technical Information of China (English)
杨洪云; 胡伟; 陈琪; 施正生
2016-01-01
介绍了 Ackermann 误差概念和传统校核方法的局限性，提出采用 CATIA 参数化建模方式，建立全空间转向机构硬点-骨架模型，依靠 CATIA 参数化驱动功能，通过改变参数得到非常精确的 Ackermann 误差，并且利用参数与设计表关联，快速得到所有车型转向系统的骨架模型，实现了高效、准确校核大量车型 Ackermann 误差的目的。%This article presents the concept of Ackermann error and the defects of traditional checking method , building full-geometrical steering hard-point model by the parametric- modeling method to obtain the precise Ackermann error with the function of parameter-driven, realized the goal of checking Ackermann error of a mount of vehicles with high efficiency and precision utilizing the Design table to build the skeleton model of steering system of all vehicles.
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.
Atmospheric inverse modeling with known physical bounds: an example from trace gas emissions
Directory of Open Access Journals (Sweden)
S. M. Miller
2014-02-01
the relative merits of each. This paper investigates the applicability of several approaches to bounded inverse problems. A common method of data transformations is found to unrealistically skew estimates for the examined example application. The method of Lagrange multipliers and two Markov chain Monte Carlo (MCMC methods yield more realistic and accurate results. In general, the examined MCMC approaches produce the most realistic result but can require substantial computational time. Lagrange multipliers offer an appealing option for large, computationally intensive problems when exact uncertainty bounds are less central to the analysis. A synthetic data inversion of US anthropogenic methane emissions illustrates the strengths and weaknesses of each approach.
On devising Boussinesq-type models with bounded eigenspectra: One horizontal dimension
DEFF Research Database (Denmark)
Eskilsson, Claes; Engsig-Karup, Allan Peter
2014-01-01
The propagation of water waves in the nearshore region can be described by depth-integrated Boussinesq-type equations. The dispersive and nonlinear characteristics of the equations are governed by tuneable parameters. We examine the associated linear eigenproblem both analytically and numerically...... 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) are...
Bound states of the $\\phi^4$ model via the Non-Perturbative Renormalization Group
Rose, F; Leonard, F; Delamotte, B
2016-01-01
Using the nonperturbative renormalization group, we study the existence of bound states in the symmetry-broken phase of the scalar $\\phi^4$ theory in all dimensions between two and four and as a function of the temperature. The accurate description of the momentum dependence of the two-point function, required to get the spectrum of the theory, is provided by means of the Blaizot--M\\'endez-Galain--Wschebor approximation scheme. We confirm the existence of a bound state in dimension three, with a mass within 1% of previous Monte-Carlo and numerical diagonalization values.
Sociable interface-based model checking for Web applications%基于交际接口的Web应用模型检验
Institute of Scientific and Technical Information of China (English)
李决龙; 李亮; 邢建春; 杨启亮
2011-01-01
为了验证Web应用的质量,首次采用了基于交际接口及其工具TICC的建筑智能化系统Web应用验证方法,通过一个简单的能源管理Web应用系统实例说明了整个建模、构件模块组合验证和系统性质验证过程.结果表明验证能够顺利实现,因而该方法是一种合适的Web应用验证方法.%In order to verify Web applications' quality, the paper firstly adopted the methodology based on sociable interface and its tool TICC to check Web applications in the intelligent building systems, used a simple case of energy sources management Web application system to illustrate the whole process of modeling, component composing verification and characteristic model checking.The result shows that verification is done successfully, so it is an appropriate verification method for Web applications.
Prediction Interval Development for Wind-Tunnel Balance Check-Loading
Landman, Drew; Toro, Kenneth G.; Commo, Sean A.; Lynn, Keith C.
2014-01-01
Results from the Facility Analysis Verification and Operational Reliability project revealed a critical gap in capability in ground-based aeronautics research applications. Without a standardized process for check-loading the wind-tunnel balance or the model system, the quality of the aerodynamic force data collected varied significantly between facilities. A prediction interval is required in order to confirm a check-loading. The prediction interval provides an expected upper and lower bound on balance load prediction at a given confidence level. A method has been developed which accounts for sources of variability due to calibration and check-load application. The prediction interval method of calculation and a case study demonstrating its use is provided. Validation of the methods is demonstrated for the case study based on the probability of capture of confirmation points.
Energy Technology Data Exchange (ETDEWEB)
Montano, Joshua Daniel [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-03-23
Coordinate Measuring Machines (CMM) are widely used in industry, throughout the Nuclear Weapons Complex and at Los Alamos National Laboratory (LANL) to verify part conformance to design definition. Calibration cycles for CMMs at LANL are predominantly one year in length. Unfortunately, several nonconformance reports have been generated to document the discovery of a certified machine found out of tolerance during a calibration closeout. In an effort to reduce risk to product quality two solutions were proposed – shorten the calibration cycle which could be costly, or perform an interim check to monitor the machine’s performance between cycles. The CMM interim check discussed makes use of Renishaw’s Machine Checking Gauge. This off-the-shelf product simulates a large sphere within a CMM’s measurement volume and allows for error estimation. Data was gathered, analyzed, and simulated from seven machines in seventeen different configurations to create statistical process control run charts for on-the-floor monitoring.
Charged Higgs Mass Bounds from $b \\to s \\gamma $in a Bilinear R-Parity Violating Model
Díaz, M A; Valle, José W F; Diaz, Marco A.
1999-01-01
The experimental measurement of the branching ratio $B(b\\to s\\gamma)$ imposes important constraints on the charged Higgs boson mass within the MSSM. We show that by adding bilinear R--Parity violation (BRpV) in the tau sector, these bounds are relaxed. In this model, a non--zero tau neutrino mass is induced. If squark masses are of a few TeV, the charged Higgs boson mass in the MSSM has to satisfy $m_{H^{\\pm}}\\gsim 570$ GeV. This bound on $m_{H^{\\pm}}$ is $\\sim 100$ GeV smaller in MSSM--BRpV. If squarks are lighter, then light charged Higgs bosons can be reconciled with $B(b\\to s\\gamma)$ only if there is also a light chargino. In the MSSM if we impose $m_{\\chi^{\\pm}_1}>90$ GeV then we need $m_{H^{\\pm}}\\gsim 110$ GeV. This bound on $m_{H^{\\pm}}$ is $\\sim 30$ GeV smaller in MSSM--BRpV. The relaxation of the bounds is due to the fact that charged Higgs bosons mix with staus and they contribute importantly to $B(b\\to contribution to $B(b\\to s\\gamma)$ can be safely neglected.
QoS-enhanced TNPOSS Network Model and its E2E Delay Bound for Multimedia Flows
Directory of Open Access Journals (Sweden)
Ke Xiong
2009-10-01
Full Text Available In our previous work, we proposed the TNPOSS (To Next-hop Port Sequence Switch network which can achieve scalable fast forwarding and is suitable for delivering multimedia flows. However, TNPOSS network has no Quality of Service (QoS tools to provide better QoS guarantee for multimedia flows which often have long-range dependence (LRD property. To enhance the QoS ability of TNPOSS network, this paper proposes a QoS-enhanced TNPOSS (QTNPOSS network model by introducing Fractal Leak Bucket (FLB shaper and Weighted Fair Queuing (WFQ scheduler into the original TNPOSS network. In the new QTNPOSS network, each packet of multimedia flows is shaped by the FLB when arriving at a node and is scheduled by the WFQ before being outputted. Based on study above, we further analyze the end-to-end (E2E delay bound of QTNPOSS network by means of the network calculus theory which is an effective mathematical tool on analyzing the worst-case QoS performances of networks. The service curve and the formulation of E2E delay bound of QTNPOSS network are presented and proved. Extensive numerical experiments show that both the LRD property of multimedia flows and the WFQ weight have influences on the E2E delay bound, and the WFQ weight influences the E2E delay bound more greatly than the LRD property does.
A case study to quantify prediction bounds caused by model-form uncertainty of a portal frame
Van Buren, Kendra L.; Hall, Thomas M.; Gonzales, Lindsey M.; Hemez, François M.; Anton, Steven R.
2015-01-01
Numerical simulations, irrespective of the discipline or application, are often plagued by arbitrary numerical and modeling choices. Arbitrary choices can originate from kinematic assumptions, for example the use of 1D beam, 2D shell, or 3D continuum elements, mesh discretization choices, boundary condition models, and the representation of contact and friction in the simulation. This work takes a step toward understanding the effect of arbitrary choices and model-form assumptions on the accuracy of numerical predictions. The application is the simulation of the first four resonant frequencies of a one-story aluminum portal frame structure under free-free boundary conditions. The main challenge of the portal frame structure resides in modeling the joint connections, for which different modeling assumptions are available. To study this model-form uncertainty, and compare it to other types of uncertainty, two finite element models are developed using solid elements, and with differing representations of the beam-to-column and column-to-base plate connections: (i) contact stiffness coefficients or (ii) tied nodes. Test-analysis correlation is performed to compare the lower and upper bounds of numerical predictions obtained from parametric studies of the joint modeling strategies to the range of experimentally obtained natural frequencies. The approach proposed is, first, to characterize the experimental variability of the joints by varying the bolt torque, method of bolt tightening, and the sequence in which the bolts are tightened. The second step is to convert what is learned from these experimental studies to models that "envelope" the range of observed bolt behavior. We show that this approach, that combines small-scale experiments, sensitivity analysis studies, and bounding-case models, successfully produces lower and upper bounds of resonant frequency predictions that match those measured experimentally on the frame structure. (Approved for unlimited, public
Directory of Open Access Journals (Sweden)
Ballester Pla, Coralio
2012-03-01
Full Text Available The observation of the actual behavior by economic decision makers in the lab and in the field justifies that bounded rationality has been a generally accepted assumption in many socio-economic models. The goal of this paper is to illustrate the difficulties involved in providing a correct definition of what a rational (or irrational agent is. In this paper we describe two frameworks that employ different approaches for analyzing bounded rationality. The first is a spatial segregation set-up that encompasses two optimization methodologies: backward induction and forward induction. The main result is that, even under the same state of knowledge, rational and non-rational agents may match their actions. The second framework elaborates on the relationship between irrationality and informational restrictions. We use the beauty contest (Nagel, 1995 as a device to explain this relationship.
La observación del comportamiento de los agentes económicos tanto en el laboratorio como en la vida real justifica que la racionalidad acotada sea un supuesto aceptado en numerosos modelos socio-económicos. El objetivo de este artículo es ilustrar las dificultades que conlleva una correcta definición de qué es un agente racional (irracional. En este artículo se describen dos marcos que emplean diferentes metodologías para analizar la racionalidad acotada. El primero es un modelo de segregación espacial donde se contrastan dos metodologías de optimización: inducción hacia atrás y hacia adelante. El resultado principal es que, incluso con el mismo nivel de conocimiento, tanto agentes racionales como irracionales podrían coincidir en sus acciones. El segundo marco trabaja sobre la relación entre irracionalidad y restricción de información. Se utiliza el juego llamado “beauty contest” (Nagel 1995 como mecanismo para explicar dicha relación.
Semantic rule-checking for regulation compliance checking: an overview of strategies and approaches
Pauwels, Pieter; Zhang, Sijie
2015-01-01
As more and more architectural design and construction data is represented in the Resource Description Framework (RDF) data model, it makes sense to take advantage of the underlying logical basis of RDF and realise a semantic rule-checking process as it is currently not available in architectural design and construction industry. Such a semantic rule-checking process would be of considerable value to regulation compliance checking procedures, because the additional logical basis would (1) all...
Ground-State Entanglement Bound for Quantum Energy Teleportation of General Spin-Chain Models
Hotta, Masahiro
2013-01-01
In protocols of quantum energy teleportation (QET), ground-state entanglement of many-body systems plays a crucial role. For a general class of spin-chain systems, we show analytically that the entanglement entropy is lower bounded by a positive quadratic function of the teleported energy between the regions of a QET protocol. This supports a general conjecture that ground-state entanglement is an evident physical resource for energy transportation in the context of QET
Quantization of the Closed Mini-Superspace Models as Bound States
Kung, J H
1995-01-01
Wheeler-DeWitt equation is applied to $k > 0$ Friedmann Robertson Walker metric with various types of matter. It is shown that if the Universe ends in the matter dominated era (e.g., radiation or pressureless gas) with zero cosmological constant, then the resulting Wheeler-DeWitt equation describes a bound state problem. As solutions of a non-degenerate bound state system, the eigen-wave functions are real (Hartle-Hawking) and the usual issue associated with the ambiguity in the boundary conditions for the wave functions is resolved. Furthermore, as a bound state problem, there exists a quantization condition that relates the curvature of the three space with the energy density of the Universe. Incorporating a cosmological constant in the early Universe (inflation) is given as a natural explanation for the large quantum number associated with our Universe, which resulted from the quantization condition. It is also shown that if there is a cosmological constant $\\Lambda > 0$ in our Universe that persists for a...
SHKABATUR, Jennifer
2012-01-01
Check My School (CMS) is a community monitoring project that aims to promote transparency and social accountability in the Philippine education sector by tracking the provision of services in public schools. The project uses a blended approach, which combines on-the-ground community monitoring with the use of information and communication technology (ICT). CMS had been initiated and design...
Checking BEBC superconducting magnet
1974-01-01
The superconducting coils of the magnet for the 3.7 m Big European Bubble Chamber (BEBC) had to be checked, see Annual Report 1974, p. 60. The photo shows a dismantled pancake. By December 1974 the magnet reached again the field design value of 3.5 T.
... by Mail Close www.diabetes.org > Living With Diabetes > Treatment and Care > Blood Glucose Testing Share: Print Page Text Size: ... glucose-and-a1c, In this section Living With Diabetes Treatment and Care Blood Glucose Testing Checking Your Blood Glucose A1C ...
Directory of Open Access Journals (Sweden)
Ümit Baran Metin
2015-07-01
Full Text Available Soldiering is defined as engaging behaviourally or cognitively into non-work-related activities during working hours with no intention of harming the employer, co-workers, and/or clients. The present study will investigate this phenomenon using the Job-Demands Resources Model. The proposed model will consider the influence of job demands and resources on soldiering, as well as the relationship of soldiering with employee wellbeing and performance. The data, collected via online questionnaires across seven European countries, will be analysed using structural equation modelling in order to explore the goodness-of-fit of the proposed model as well as its potential cross cultural variations.
Model independent bounds on tensor modes and stringy parameters from CMB
Mazumdar, Anupam
2014-01-01
In this paper we will derive bounds on tensor-to-scalar ratio, $r$, string coupling, $g_s$ and compactification volume, ${\\cal V}_E$, by demanding the validity of an effective field theory - the inflationary scale and the Hubble parameter during inflation must be well below the Kaluza-Klein (KK) mass scale, string scale, and $4$ dimensional Planck mass. Within type IIB orientifold compactifications, we can put further constraints on the parameters by invoking the hierarchy between gravitino mass in $4$ dimensions and inflationary scale.
Check Verbraucherpolitik und Verbraucherbeteiligung
DEFF Research Database (Denmark)
Hagen, Kornelia; Micklitz, Hans-W.; Oehler, Andreas;
2013-01-01
The paper discusses the opportunities for an empirically grounded decision support system as an instrument for independent and scientifically based consumer policy consulting. To date, consumer policy is dominated by the information paradigm and the leitbild of the rational, sovereign...... and information-seeking consumer. Yet, both everyday practice and research in behavioural economics show that this view lacks empirical ground. In fact, there are different consumer types and different forms of rationalities at work. Effective consumer policy making should be based on the empirically revealed...... an empirically based “Check Consumer Policy and Consumer Participation” as a systematic decision and evaluation tool for policy makers. This check should be independent from the government and should be grounded on an empirical view of the consumer. Consumer policy tools should be tested with real consumers...
A Reduced Nonlinear Model of Wall-Bounded Shear Flow Turbulence
Farrell, Brian; Ioannou, Petros; Nikolaidis, Marios; Lozano-Duran, Adrian; Jimenez, Javier; Gayme, Dennice; Thomas, Vaughan
2015-11-01
The roll/streak is the dominant structure in the dynamics of wall-bounded shear flow turbulence. It appears that this structure arises from a nonlinear instability, the various proposed mechanisms for which are referred to as self-sustaining processes. However, even once the nonlinear instability is identified there remains the problem of understanding how this instability is regulated to maintain the observed turbulent state. Here both of these questions will be addressed by adopting the perspective of statistical state dynamics (SSD), specifically its reduced nonlinear (RNL) implementation. RNL comprises the joint evolution of the streamwise constant mean flow (first cumulant) and second order perturbation statistics (second cumulant). This restriction greatly reduces the complexity of the dynamics while retaining a realistic SSP. The perturbations supporting the SSP in RNL arise from parametric instability of the time-dependence streak the statistical stability of these perturbations being enforced by a feedback mediated control process operating between the mean flow and the perturbations. In this talk it will be shown how the maintenance and regulation of RNL turbulence allows insight into the mechanism of turbulence in wall-bounded shear flow.
Search for an upper bound of the renormalized Yukawa coupling in a lattice fermion-Higgs model
International Nuclear Information System (INIS)
We study the scaling laws for the fermion mass and the scalar field expectation value in the weak coupling region of the broken phase of a lattice regularized chiral-invariant SU(2)LxSU(2)R fermion-Higgs model with bare Yukawa coupling y and Wilson-Yukawa coupling w. In particular we concentrate on the region in the vicinity of the line A, which is the line of maximal values of y+4w on the critical surface containing the gaussian fixed point. We have not found any indication for the existence of a nontrivial fixed point on that line or anywhere else in the weak coupling region. The renormalized Yukawa coupling yR as a function of the fermionic correlation length appears to be bounded from above. The upper bound obtained from the numerical data at w=0 is compatible with the perturbation unitarity bound. Furthermore, in the weak coupling region, including the line A, it is not possible to choose w such that the unwanted fermion doublers would be removed from the physical particle spectrum. (orig.)
Asokan, Shilpa M.; Destouni, Georgia
2014-05-01
The future of water resources in a region invariably depends on its historic as well as present water use management policy. In order to understand the past hydro-climatic conditions and changes, one needs to analyze observation data and their implications for climate and hydrology, such as Temperature, Precipitation, Runoff and Evapotranspiration in the region. In addition to the changes in climate, human re-distribution of water through land- and wateruse changes is found to significantly alter the water transfer from land to atmosphere through an increase or decrease in evapotranspiration. The Aral region in Central Asia, comprising the Aral Sea Drainage Basin and the Aral Sea, is an example case where the human induced changes in water-use have led to one of the worst environmental disasters of our time, the desiccation of the Aral Sea. Identification of the historical hydro-climatic changes that have happened in this region and their drivers is required before one can project future changes to water and its availability in the landscape. Knowledge of the future of water resources in the Aral region is needed for planning to meet increasing water and food demands of the growing population in conjunction with ecosystem sustainability. In order to project future scenarios of water on land, the Global Climate Model (GCM) ensemble of the Coupled Model Intercomparison Project, Phase 5 (CMIP5) was analyzed for their performance against hydrologically important, basin-scale observational climate and hydrological datasets. We found that the ensemble mean of 22 GCMs over-estimated the observed temperature by about 1°C for the historic period of 1961-1990. For the future extreme climate scenario RCP8.5 the increase in temperature was projected to be about 5°C by 2070-2099, the accuracy of which is questionable from identified biases of GCMs and their ensemble results compared with observations for the period 1961-1990. In particular, the water balance components
Energy Technology Data Exchange (ETDEWEB)
Murad, Mohammad Hassan [BRAC University, Department of Mathematics and Natural Sciences, Dhaka (Bangladesh); Fatema, Saba [Daffodil International University, Department of Natural Sciences, Dhaka (Bangladesh)
2015-11-15
In this work some families of relativistic anisotropic charged fluid spheres have been obtained by solving the Einstein-Maxwell field equations with a preferred form of one of the metric potentials, and suitable forms of electric charge distribution and pressure anisotropy functions. The resulting equation of state (EOS) of the matter distribution has been obtained. Physical analysis shows that the relativistic stellar structure for the matter distribution considered in this work may reasonably model an electrically charged compact star whose energy density associated with the electric fields is on the same order of magnitude as the energy density of fluid matter itself (e.g., electrically charged bare strange stars). Furthermore these models permit a simple method of systematically fixing bounds on the maximum possible mass of cold compact electrically charged self-bound stars. It has been demonstrated, numerically, that the maximum compactness and mass increase in the presence of an electric field and anisotropic pressures. Based on the analytic models developed in this present work, the values of some relevant physical quantities have been calculated by assuming the estimated masses and radii of some well-known potential strange star candidates like PSR J1614-2230, PSR J1903+327, Vela X-1, and 4U 1820-30. (orig.)
Requirements Specifications Checking of Embedded Real-Time Software
Institute of Scientific and Technical Information of China (English)
WU Guoqing(毋国庆); SHU Fengdi(舒风笛); WANG Min(王敏); CHEN Weiqing(陈伟清)
2002-01-01
After introducing the overview of our requirements description model HRFSM,the paper presents a dynamic software execution model (DERTS) of embedded real-time software, which can integrate control flow, data flow and time. Based on DERTS, a checking method is also presented. It consists of three kinds of checking and can check the consistency and completeness of the requirement specifications of embedded real-time software. Besides providing information helpful to improve the efficiency of analyzing and checking specifications,the checking method is flexible, and easy to understand and to use for the analyst.
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)
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 in
Call, Jared A.; Kwok, John H.; Fisher, Forest W.
2013-01-01
This innovation is a tool used to verify and validate spacecraft sequences at the predicted events file (PEF) level for the GRAIL (Gravity Recovery and Interior Laboratory, see http://www.nasa. gov/mission_pages/grail/main/index. html) mission as part of the Multi-Mission Planning and Sequencing Team (MPST) operations process to reduce the possibility for errors. This tool is used to catch any sequence related errors or issues immediately after the seqgen modeling to streamline downstream processes. This script verifies and validates the seqgen modeling for the GRAIL MPST process. A PEF is provided as input, and dozens of checks are performed on it to verify and validate the command products including command content, command ordering, flight-rule violations, modeling boundary consistency, resource limits, and ground commanding consistency. By performing as many checks as early in the process as possible, grl_pef_check streamlines the MPST task of generating GRAIL command and modeled products on an aggressive schedule. By enumerating each check being performed, and clearly stating the criteria and assumptions made at each step, grl_pef_check can be used as a manual checklist as well as an automated tool. This helper script was written with a focus on enabling the user with the information they need in order to evaluate a sequence quickly and efficiently, while still keeping them informed and active in the overall sequencing process. grl_pef_check verifies and validates the modeling and sequence content prior to investing any more effort into the build. There are dozens of various items in the modeling run that need to be checked, which is a time-consuming and errorprone task. Currently, no software exists that provides this functionality. Compared to a manual process, this script reduces human error and saves considerable man-hours by automating and streamlining the mission planning and sequencing task for the GRAIL mission.
Bounding the ντ magnetic moment the process e+e- → ν ν-bar γ in a left-right symmetric model
International Nuclear Information System (INIS)
A bound on the ντ magnetic moment is calculated through the reaction e+e- → ν ν-bar γ at the Z1-pole, and in the framework of a left-right symmetric model at LEP energies. We find that the bound is almost independent of the mixing angle φ of the model in the allowed experimental range for this parameter (Authors)
Ground-state-entanglement bound for quantum energy teleportation of general spin-chain models
Hotta, Masahiro
2013-03-01
Many-body quantum systems in the ground states have zero-point energy due to the uncertainty relation. In many cases, the system in the ground state accompanies spatially entangled energy density fluctuation via the noncommutativity of the energy density operators, though the total energy takes a fixed value, i.e., the lowest eigenvalue of the Hamiltonian. Quantum energy teleportation (QET) is a protocol for the extraction of the zero-point energy out of one subsystem using information of a remote measurement of another subsystem. From an operational viewpoint of protocol users, QET can be regarded as an effective rapid energy transportation without breaking all physical laws, including causality and local energy conservation. In the protocol, the ground-state entanglement plays a crucial role. In this paper, we show analytically for a general class of spin-chain systems that the entanglement entropy is lower bounded by a positive quadratic function of the teleported energy between the regions of a QET protocol. This supports a general conjecture that ground-state entanglement is an evident physical resource for energy transportation in the context of QET. The result may also deepen our understanding of the energy density fluctuation in condensed-matter systems from a perspective of quantum information theory.
Online treatment compliance checking for clinical pathways.
Huang, Zhengxing; Bao, Yurong; Dong, Wei; Lu, Xudong; Duan, Huilong
2014-10-01
Compliance checking for clinical pathways (CPs) is getting increasing attention in health-care organizations due to stricter requirements for cost control and treatment excellence. Many compliance measures have been proposed for treatment behavior inspection in CPs. However, most of them look at aggregated data seen from an external perspective, e.g. length of stay, cost, infection rate, etc., which may provide only a posterior impression of the overall conformance with the established CPs such that in-depth and in near real time checking on the compliance of the essential/critical treatment behaviors of CPs is limited. To provide clinicians real time insights into violations of the established CP specification and support online compliance checking, this article presents a semantic rule-based CP compliance checking system. In detail, we construct a CP ontology (CPO) model to provide a formal grounding of CP compliance checking. Using the proposed CPO, domain treatment constraints are modeled into Semantic Web Rule Language (SWRL) rules to specify the underlying treatment behaviors and their quantified temporal structure in a CP. The established SWRL rules are integrated with the CP workflow such that a series of applicable compliance checking and evaluation can be reminded and recommended during the pathway execution. The proposed approach can, therefore, provides a comprehensive compliance checking service as a paralleling activity to the patient treatment journey of a CP rather than an afterthought. The proposed approach is illustrated with a case study on the unstable angina clinical pathway implemented in the Cardiology Department of a Chinese hospital. The results demonstrate that the approach, as a feasible solution to provide near real time conformance checking of CPs, not only enables clinicians to uncover non-compliant treatment behaviors, but also empowers clinicians with the capability to make informed decisions when dealing with treatment compliance
Online treatment compliance checking for clinical pathways.
Huang, Zhengxing; Bao, Yurong; Dong, Wei; Lu, Xudong; Duan, Huilong
2014-10-01
Compliance checking for clinical pathways (CPs) is getting increasing attention in health-care organizations due to stricter requirements for cost control and treatment excellence. Many compliance measures have been proposed for treatment behavior inspection in CPs. However, most of them look at aggregated data seen from an external perspective, e.g. length of stay, cost, infection rate, etc., which may provide only a posterior impression of the overall conformance with the established CPs such that in-depth and in near real time checking on the compliance of the essential/critical treatment behaviors of CPs is limited. To provide clinicians real time insights into violations of the established CP specification and support online compliance checking, this article presents a semantic rule-based CP compliance checking system. In detail, we construct a CP ontology (CPO) model to provide a formal grounding of CP compliance checking. Using the proposed CPO, domain treatment constraints are modeled into Semantic Web Rule Language (SWRL) rules to specify the underlying treatment behaviors and their quantified temporal structure in a CP. The established SWRL rules are integrated with the CP workflow such that a series of applicable compliance checking and evaluation can be reminded and recommended during the pathway execution. The proposed approach can, therefore, provides a comprehensive compliance checking service as a paralleling activity to the patient treatment journey of a CP rather than an afterthought. The proposed approach is illustrated with a case study on the unstable angina clinical pathway implemented in the Cardiology Department of a Chinese hospital. The results demonstrate that the approach, as a feasible solution to provide near real time conformance checking of CPs, not only enables clinicians to uncover non-compliant treatment behaviors, but also empowers clinicians with the capability to make informed decisions when dealing with treatment compliance
NLO+NLL Collider Bounds, Dirac Fermion and Scalar Dark Matter in the B-L Model
Klasen, Michael; Queiroz, Farinaldo S
2016-01-01
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)_{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_{Z^{\\prime}}/g_{BL} \\gtrsim 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_{Z^{\\prime}}/g_{BL} > 8.7$ TeV f...
Feasibility Checking for Dial-a-Ride Problems
DEFF Research Database (Denmark)
Haugland, Dag; Ho, Sin C.
Hunsaker and Savelsbergh have proposed an algorithm for testing feasibility of a route in the solution to the dial-a-ride problem. The constraints that are checked are load capacity constraints, time windows, ride time bounds and wait time bounds. The algorithm has linear running time. By virtue ...... of a simple example, we show in this work that their algorithm is incorrect. We also prove that by increasing the time complexity by only a logarithmic factor, a correct algorithm is obtained....
Research on Model Checking Formal Language Object-Z%形式语言Object-Z的模型检测研究
Institute of Scientific and Technical Information of China (English)
吴彩燕
2015-01-01
Object-Z是一种用于表示面向对象系统规约的高层抽象语言，由于缺乏自动验证工具的支持，很难建立直接证明由Object-Z表示的面向对象系统规约正确性，成为Object-Z被广泛采用的最大障碍。模型检测是一种验证系统规约正确性的自动化技术。使用模型检测工具SPIN验证Object-Z描述的正确性，把Object-Z的规约转换成标记转换系统，然后把标记转换系统转换为SPIN的输入语言Promela，使用线性时序逻辑刻画Object-Z中的历史不变式。通过对订票系统类的Object-Z描述的验证，结果表明该方案具有可行性。%Object-Z is a high-level abstract language used to represent the specification of the object-oriented system.For lack of support of automatic verification tools,it is difficult to verify the correctness of the specification of the object-oriented system represented by Object-Z.Model checking is such an automatic verification technique.This paper verifies the correctness of the Object-Z specification using model checking tool-SPIN,which translates the Object-Z specification into label transition system (LTS)firstly,and then converts the LTS format into the input language Promelaof SPIN.Subsequently,the history invariant in Object-Z is described by Linear Temporal Logic (LTL).Through verifying the Object-Z specification of the booking system class,the results show that this method is feasible.
Program Analysis as Model Checking
DEFF Research Database (Denmark)
Olesen, Mads Chr.
Software programs are proliferating throughout modern life, to a point where even the simplest appliances such as lightbulbs contain software, in addition to the software embedded in cars and airplanes. The correct functioning of these programs is therefore of the utmost importance, for the quality...
Model checking mobile stochastic logic.
De Nicola, Rocco; Katoen, Joost-Pieter; Latella, Diego; Loreti, Michele; Massink, Mieke
2007-01-01
The Temporal Mobile Stochastic Logic (MOSL) has been introduced in previous work by the authors for formulating properties of systems specified in STOKLAIM, a Markovian extension of KLAIM. The main purpose of MOSL is to address key functional aspects of global computing such as distribution awarenes
Model Checking Multivariate State Rewards
DEFF Research Database (Denmark)
Nielsen, Bo Friis; Nielson, Flemming; Nielson, Hanne Riis
2010-01-01
We consider continuous stochastic logics with state rewards that are interpreted over continuous time Markov chains. We show how results from multivariate phase type distributions can be used to obtain higher-order moments for multivariate state rewards (including covariance). We also generalise...
Bonura Carlo A; Boersma Jonathan T; Tse Wai S; Eckert Michael J; Szechtman Henry; McClelland Jessica Z; Culver Kirsten E; Eilam David
2001-01-01
Abstract Background A previous report showed that the open field behavior of rats sensitized to the dopamine agonist quinpirole satisfies 5 performance criteria for compulsive checking behavior. In an effort to extend the parallel between the drug-induced phenomenon and human obsessive-compulsive disorder (OCD), the present study investigated whether the checking behavior of quinpirole rats is subject to interruption, which is an attribute characteristic of OCD compulsions. For this purpose, ...
Connolly, Joseph W.; Kopasakis, George
2010-01-01
This paper covers the propulsion system component modeling and controls development of an integrated mixed compression inlet and turbojet engine that will be used for an overall vehicle Aero-Propulso-Servo-Elastic (APSE) model. Using previously created nonlinear component-level propulsion system models, a linear integrated propulsion system model and loop shaping control design have been developed. The design includes both inlet normal shock position control and jet engine rotor speed control for a potential supersonic commercial transport. A preliminary investigation of the impacts of the aero-elastic effects on the incoming flow field to the propulsion system are discussed, however, the focus here is on developing a methodology for the propulsion controls design that prevents unstart in the inlet and minimizes the thrust oscillation experienced by the vehicle. Quantitative Feedback Theory (QFT) specifications and bounds, and aspects of classical loop shaping are used in the control design process. Model uncertainty is incorporated in the design to address possible error in the system identification mapping of the nonlinear component models into the integrated linear model.
Large-time behaviour of some fully discrete kinetic models in bounded domains
Directory of Open Access Journals (Sweden)
Ester Gabetta
1991-05-01
Full Text Available We investigate the large-time behaviour of the fully discretized version both of the three velocity Broadwell model and of the four velocity model in a strip. We analyze the different behaviours on the light of some recent results by M. Slemrod [7] and C. Cercignani [3].
Butera, P; Pernici, M
2015-01-01
Using a relation between the virial expansion coefficients of the pressure and the entropy expansion coefficients in the case of the monomer-dimer model on infinite regular lattices, we have shown that, on hypercubic lattices of any dimension, the virial coefficients are positive through the 20th order. We have observed that all virial coefficients so far known for this system are positive also on infinite regular lattices with different structure. We are thus led to conjecture that the virial expansion coefficients $m_k $ are always positive. These considerations can be extended to the study of related bounds on finite graphs generalizing the infinite regular lattices, namely the finite grids and the regular biconnected graphs. The validity of the bounds $\\Delta^k {\\rm ln}(i! N(i)) \\le 0$ for $k \\ge 2$, where $N(i)$ is the number of configurations of $i$ dimers on the graph and $\\Delta$ is the forward difference operator, is shown to correspond to the positivity of the virial coefficients. Our tests on many ...
Phase separation in random cluster models I: uniform upper bounds on local deviation
Hammond, Alan
2010-01-01
This is the first in a series of three papers that addresses the behaviour of the droplet that results, in the percolating phase, from conditioning the Fortuin-Kasteleyn planar random cluster model on the presence of an open dual circuit Gamma_0 encircling the origin and enclosing an area of at least (or exactly) n^2. (By the Fortuin-Kasteleyn representation, the model is a close relative of the droplet formed by conditioning the Potts model on an excess of spins of a given type.) We consider...
Pusey, Jason L.; Yoo, Jin-Hyeong
2014-06-01
We document the design and preliminary numerical simulation study of a high fidelity model of Canid, a recently introduced bounding robot. Canid is a free-standing, power-autonomous quadrupedal machine constructed from standard commercially available electromechanical and structural elements, incorporating compliant C-shaped legs like those of the decade old RHex design, but departing from that standard (and, to the best of our knowledge, from any prior) robot platform in its parallel actuated elastic spine. We have used a commercial modeling package to develop a finite-element model of the actuated, cable-driven, rigid-plate-reinforced harness for the carbon-fiber spring that joins the robot's fore- and hind-quarters. We compare a numerical model of this parallel actuated elastic spine with empirical data from preliminary physical experiments with the most important component of the spine assembly: the composite leaf spring. Specifically, we report our progress in tuning the mechanical properties of a standard modal approximation to a conventional compliant beam model whose boundary conditions represent constraints imposed by the actuated cable driven vertebral plates that comprise the active control affordance over the spine. We conclude with a brief look ahead at near-term future experiments that will compare predictions of this fitted composite spring model with data taken from the physical spine flexed in isolation from the actuated harness.
Bounds on Higgs-Portal models from the LHC Higgs data
Cheung, Kingman; Lee, Jae Sik; Tseng, Po-Yan
2015-01-01
In a number of Higgs-portal models, an $SU(2)$ isospin-singlet scalar boson generically appears at the electroweak scale and can mix with the Standard Model (SM) Higgs boson with a mixing angle $\\alpha$. This singlet scalar boson can have renormalizable couplings to a pair of dark matter particles, vectorlike leptons or quarks, or new gauge bosons, thereby modifying the Higgs signal strengths in a nontrivial way. In this work, we perform global fits to such models using the most updated LHC Higgs-boson data and discuss the corresponding implications on Higgs-portal-type models. In particular we find that the current LHC Higgs-boson data slightly favors the SM over the Higgs-portal singlet-scalar models, which has to be further examined using the upcoming LHC Higgs-boson data. Finally the Higgs-portal models are constrained as follows: $\\cos\\alpha \\gtrsim 0.86$ and $\\Delta \\Gamma_{\\rm tot} \\lesssim 1.9$ MeV at 95 \\% CL.
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…
Formal verification of SDG diagnosability via symbolic model checking%基于符号模型检测的SDG模型可诊断性验证
Institute of Scientific and Technical Information of China (English)
宁宁; 张骏; 高向阳; 薛静
2011-01-01
由于定量信息和非线性因果关系的丢失,符号有向图(signed directed graph,SDG)模型的可诊断性需要进一步地进行校核与验证.为此,提出了基于符号模型检测的SDG模型可诊断性形式化验证方法.首先定义了SDG模型的有限状态变迁系统形式化描述,建立了符号模型验证器(symbolic model verifier,SMV)模型;其次利用SDG的深层知识,构造了可诊断性函数,设定了可诊断性上下文,给出了可诊断性定义.然后,构造了SDG耦合孪生SMV模型,定义了可诊断性的计算树时态逻辑公式,提出了验证算法SDGD-CSMV.最后,通过一个实例验证了可诊断性的判定和算法的有效性.%Because of quantitative and nonlinear causal information, diagosability of the signed directed graph(SDG) model needs to be further verified and validated. A formal verification approach to diagnosability via symbolic model checking is proposed. A formal characterization of SDG, as a finite state transition system,is transformed firstly, and a symbolic model verifier (SMV) module is modeled. In the framework of the finite state transition system, a diagnosis function is established, and then the diagnosable definition of a diagnosis condition is defined using the idea of diagnosis context. By means of NuSMV, a coupled SMV module is constructed, and then the SDGD_CSMV algorithm is designed with the computation temporal logic (CTL) definition of diagnosable property. Finally, the practical applicability within a simple water tank SDG model is demonstrated, which proves the validation of the diagnosable definition and SDGD_CSMV.
Social Rationality as a Unified Model of Man (Including Bounded Rationality)
Lindenberg, Siegwart
2001-01-01
In 1957, Simon published a collection of his essays under the title of “Models of Man: Social and Rational”. In the preface, he explains the choice for this title: All of the essays “are concerned with laying foundations for a science of man that will comfortably accommodate his dual nature as a social and as a rational animal.” (p. vii) Observe that the title of the book refers to two models of man, one social and one rational. Throughout his life, Simon kept contributing to this science of ...
Social Rationality as a Unified Model of Man (Including Bounded Rationality)
Lindenberg, Siegwart
2001-01-01
In 1957, Simon published a collection of his essays under the title of “Models of Man: Social and Rational”. In the preface, he explains the choice for this title: All of the essays “are concerned with laying foundations for a science of man that will comfortably accommodate his dual nature as a soc
Numerical Model of Turbulence, Sediment Transport, and Sediment Cover in a Large Canyon-Bound River
Alvarez, L. V.; Schmeeckle, M. W.
2013-12-01
The Colorado River in Grand Canyon is confined by bedrock and coarse-grained sediments. Finer grain sizes are supply limited, and sandbars primarily occur in lateral separation eddies downstream of coarse-grained tributary debris fans. These sandbars are important resources for native fish, recreational boaters, and as a source of aeolian transport preventing the erosion of archaeological resources by gully extension. Relatively accurate prediction of deposition and, especially, erosion of these sandbar beaches has proven difficult using two- and three-dimensional, time-averaged morphodynamic models. We present a parallelized, three-dimensional, turbulence-resolving model using the Detached-Eddy Simulation (DES) technique. DES is a hybrid large eddy simulation (LES) and Reynolds-averaged Navier Stokes (RANS). RANS is applied to the near-bed grid cells, where grid resolution is not sufficient to fully resolve wall turbulence. LES is applied further from the bed and banks. We utilize the Spalart-Allmaras one equation turbulence closure with a rough wall extension. The model resolves large-scale turbulence using DES and simultaneously integrates the suspended sediment advection-diffusion equation. The Smith and McLean suspended sediment boundary condition is used to calculate the upward and downward settling of sediment fluxes in the grid cells attached to the bed. The model calculates the entrainment of five grain sizes at every time step using a mixing layer model. Where the mixing layer depth becomes zero, the net entrainment is zero or negative. As such, the model is able to predict the exposure and burial of bedrock and coarse-grained surfaces by fine-grained sediments. A separate program was written to automatically construct the computational domain between the water surface and a triangulated surface of a digital elevation model of the given river reach. Model results compare favorably with ADCP measurements of flow taken on the Colorado River in Grand Canyon
Institute of Scientific and Technical Information of China (English)
丁国兴; 王宏彦; 邱建斌; 高伟
2014-01-01
According to non-standardized modeling in the system integration of smart substation, a standardized model checking software which checks model files of relay devices is developed to improve the efficiency of system integration. The checking is firstly based on IEC 61850 SCL schema to determine if there are mistakes to lead to analysis fault. A rules bank is built based on relay applying model published by SGCC. The checking also compares the model and rules bank to determine if the definition of logic objects follows the standard of SGCC, such as naming regular, mandatory existing, etc. The checking software is developed using Java/Netbeans and can be compatible to Win32 or Linux platform. The checking software runs quickly and accurately which nicely meets the needs of system integration. An application example is introduced finally, which proves the design of the model checking software is effective.%针对智能变电站系统集成中保护装置建模不规范的情况，开发一种保护模型规范化测试软件对装置模型进行规范化检测，以提高智能变电站系统集成效率。软件基于IEC 61850 SCL schema对模型进行语法检查，以确定其中是否存在导致解析错误的定义；并根据国网公司《IEC 61850工程继电保护应用模型》创建规则库，比对检查模型中各种逻辑对象的建模，如命名要求、强制包含性要求等，以确定模型是否遵循国网公司标准。软件采用Java/Netbeans工具开发，兼容Win32/Linux平台，检测准确迅速，满足智能变电站系统集成中模型检测的需要。最后提供了对实际保护模型文件进行检测的实例。
Bound to bounce: a coupled scalar-tachyon model for a smooth cyclic universe
Li, Changhong; Cheung, Yeuk-Kwan E
2011-01-01
We introduce a string-inspired model for a cyclic universe, utilizing the tachyon-scalar coupling as well as contribution from curvature in a closed universe. The universe undergoes a locked inflation stage after each bounce. Cycles of inflation, decelerating expansion, followed by contraction are made possible because of the negative contribution to effective energy density by the curvature term. No ghosts are ever generated at any point in the entire evolution of the universe. The minimum size of the universe is nonzero for generic initial values of the scalar field. The Null, Weak, and Dominant Energy Conditions are not violated at the bounce points, contrary to many bounce models previously proposed. And the Strong Energy Condition is satisfied in periods with tachyon matter domination.
Configurational entropy as a bounding of Gauss-Bonnet braneworld models
Correa, R A C; Dutra, A de Souza; de Paula, W; Frederico, T
2016-01-01
Configurational entropy has been revealed as a reliable method for constraining some parameters of a given model [Phys. Rev. D \\textbf{92} (2015) 126005, Eur. Phys. J. C \\textbf{76} (2016) 100]. In this letter we calculate the configurational entropy in Gauss-Bonnet braneworld models. Our results restrict the range of acceptability of the Gauss-Bonnet scalar values. In this way, the information theoretical measure in Gauss-Bonnet scenarios opens a new window to probe situations where the additional parameters, responsible for the Gauss-Bonnet sector, are arbitrary. We also show that such an approach is very important in applications that include p and Dp-branes and various superstring-motivated theories.
Variational bounds for a dyadic model of the bilinear Hilbert transform
Do, Yen; Palsson, Eyvindur Ari
2012-01-01
We prove variation-norm estimates for the Walsh model of the truncated bilinear Hilbert transform, extending related results of Lacey, Thiele, and Demeter. The proof uses analysis on the Walsh phase plane and two new ingredients: (i) a variational extension of a lemma of Bourgain by Nazarov-Oberlin-Thiele, and (ii) a variation-norm Rademacher-Menshov theorem of Lewko-Lewko.
Cluster Model for Near-barrier Fusion Induced by Weakly Bound and Halo Nuclei
Beck, C; Keeley, N.; Diaz-Torres, A.
2007-01-01
The influence on the fusion process of coupling transfer/breakup channels is investigated for the medium weight $^{6,7}$Li+$^{59}$Co systems in the vicinity of the Coulomb barrier. Coupling effects are discussed within a comparison of predictions of the Continuum Discretized Coupled-Channels model. Applications to $^{6}$He+$^{59}$Co induced by the borromean halo nucleus $^{6}$He are also proposed.
Das, Arindam; Okada, Nobuchika; Takahashi, Dai-suke
2016-01-01
We consider the minimal U(1)' extension of the Standard Model (SM) with the classically conformal invariance, where an anomaly free U(1)' gauge symmetry is introduced along with three generations of right-handed neutrinos and a U(1)' Higgs field. Since the classically conformal symmetry forbids all dimensional parameters in the model, the U(1)' gauge symmetry is broken through the Coleman-Weinberg mechanism, generating the mass terms of the U(1)' gauge boson (Z' boson) and the right-handed neutrinos. Through a mixing quartic coupling between the U(1)' Higgs field and the SM Higgs doublet field, the radiative U(1)' gauge symmetry breaking also triggers the breaking of the electroweak symmetry. In this model context, we first investigate the electroweak vacuum instability problem in the SM. Employing the renormalization group equations at the two-loop level and the central values for the world average masses of the top quark ($m_t=173.34$ GeV) and the Higgs boson ($m_h=125.09$ GeV), we perform parameter scans t...
Phase separation in random cluster models I: uniform upper bounds on local deviation
Hammond, Alan
2010-01-01
This is the first in a series of three papers that addresses the behaviour of the droplet that results, in the percolating phase, from conditioning the Fortuin-Kasteleyn random cluster model on the presence of an open dual circuit Gamma_0 encircling the origin and enclosing an area of at least (or exactly) n^2. (By the Fortuin-Kasteleyn representation, the model is a close relative of the droplet formed by conditioning the Potts model on an excess of spins of a given type.) We consider local deviation of the droplet boundary, measured in a radial sense by the maximum local roughness, MLR(Gamma_0), this being the maximum distance from a point in the circuit Gamma_0 to the boundary of the circuit's convex hull; and in a longitudinal sense by what we term maximum facet length, MFL(Gamma_0), namely, the length of the longest line segment of which the boundary of the convex hull is formed. The principal conclusion of the series of papers is the following uniform control on local deviation: that there are positive ...
2010-01-01
... checking: Check airmen (aircraft), check airmen (simulator). 135.339 Section 135.339 Aeronautics and Space... and checking: Check airmen (aircraft), check airmen (simulator). (a) No certificate holder may use a... an aircraft, in a flight simulator, or in a flight training device. This paragraph applies...
Regressions by leaps and bounds and biased estimation techniques in yield modeling
Marquina, N. E. (Principal Investigator)
1979-01-01
The author has identified the following significant results. It was observed that OLS was not adequate as an estimation procedure when the independent or regressor variables were involved in multicollinearities. This was shown to cause the presence of small eigenvalues of the extended correlation matrix A'A. It was demonstrated that the biased estimation techniques and the all-possible subset regression could help in finding a suitable model for predicting yield. Latent root regression was an excellent tool that found how many predictive and nonpredictive multicollinearities there were.
Laminar-turbulent patterning in wall-bounded shear flows: a Galerkin model
Seshasayanan, K
2015-01-01
On its way to turbulence, plane Couette flow - the flow between counter-translating parallel plates - displays a puzzling steady oblique laminar-turbulent pattern. We approach this problem via Galerkin modelling of the Navier-Stokes equations. The wall-normal dependence of the hydrodynamic field is treated by means of expansions on functional bases fitting the boundary conditions exactly. This yields a set of partial differential equations for the spatiotemporal dynamics in the plane of the flow. Truncating this set beyond lowest nontrivial order is numerically shown to produce the expected pattern, therefore improving over what was obtained at cruder effective wall-normal resolution. Perspectives opened by the approach are discussed.
Plasma Processes : A self-consistent kinetic modeling of a 1-D, bounded, plasma in equilibrium
Indian Academy of Sciences (India)
Monojoy Goswami; H Ramachandran
2000-11-01
A self-consistent kinetic treatment is presented here, where the Boltzmann equation is solved for a particle conserving Krook collision operator. The resulting equations have been implemented numerically. The treatment solves for the entire quasineutral column, making no assumptions about mfp/, where mfp is the ion-neutral collision mean free path and the size of the device. Coulomb collisions are neglected in favour of collisions with neutrals, and the particle source is modeled as a uniform Maxwellian. Electrons are treated as an inertialess but collisional ﬂuid. The ion distribution function for the trapped and the transiting orbits is obtained. Interesting ﬁndings include the anomalous heating of ions as they approach the presheath, the development of strongly non-Maxwellian features near the last mfp, and strong modiﬁcations of the sheath criterion.
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Faust, Sebastian; Mukherjee, Pratyay;
2013-01-01
a public tamper-proof common reference string. Finally, we explain how to boost bounded tampering and leakage resilience (as in 1. and 2. above) to continuous tampering and leakage resilience, in the so-called floppy model where each user has a personal hardware token (containing leak- and tamper...
Parameterized Expectations Algorithm and the Moving Bounds: a comment on convergence properties
Pérez, Javier J.; A. Jesús Sánchez
2005-01-01
In this paper we analyze the convergence properties of the moving bounds algorithm to initialize the Parameterized Expectations Algorithm suggested by Maliar and Maliar (2003) [Journal of Business and Economic Statistics 1, pp. 88-92]. We carry out a Monte Carlo experiment to check its performance against some initialization alternatives based on homotopy principles. We do so within the framework of two standard neoclassical growth models. We show that: (i) speed of convergence is poor as com...
Rodríguez, David; Ranganathan, Anirudh; Carlsson, Jens
2014-07-28
The recent increase in the number of atomic-resolution structures of G protein-coupled receptors (GPCRs) has contributed to a deeper understanding of ligand binding to several important drug targets. However, reliable modeling of GPCR-ligand complexes for the vast majority of receptors with unknown structure remains to be one of the most challenging goals for computer-aided drug design. The GPCR Dock 2013 assessment, in which researchers were challenged to predict the crystallographic structures of serotonin 5-HT(1B) and 5-HT(2B) receptors bound to ergotamine, provided an excellent opportunity to benchmark the current state of this field. Our contributions to GPCR Dock 2013 accurately predicted the binding mode of ergotamine with RMSDs below 1.8 Å for both receptors, which included the best submissions for the 5-HT(1B) complex. Our models also had the most accurate description of the binding sites and receptor-ligand contacts. These results were obtained using a ligand-guided homology modeling approach, which combines extensive molecular docking screening with incorporation of information from multiple crystal structures and experimentally derived restraints. In this work, we retrospectively analyzed thousands of structures that were generated during the assessment to evaluate our modeling strategies. Major contributors to accuracy were found to be improved modeling of extracellular loop two in combination with the use of molecular docking to optimize the binding site for ligand recognition. Our results suggest that modeling of GPCR-drug complexes has reached a level of accuracy at which structure-based drug design could be applied to a large number of pharmaceutically relevant targets. PMID:25030302
Bounds on quantum gravity parameter from the $SU(2)$ NJL effective model of QCD
Nozari, K; Gorji, M A
2015-01-01
Existence of a minimal measurable length, as an effective cutoff in the ultraviolet regime, is a common feature of all approaches to the quantum gravity proposal. It is widely believed that this length scale will be of the order of the Planck length $\\lambda=\\lambda_0\\,l_{_{\\rm Pl}}$, where $\\lambda_0\\sim{\\mathcal O}(1)$ is a dimensionless parameter that should be fixed only by the experiments. This issue can be taken into account through the deformed momentum spaces with compact topologies. In this paper, we consider minimum length effects on the physical quantities related to three parameters of the $SU(2)$ Nambu-Jona-Lasinio effective model of QCD by means of the deformed measure which is defined on compact momentum space with ${\\mathbf S}^3$ topology. This measure is suggested by the doubly special relativity theories, Snyder deformed spaces, and the deformed algebra that is obtained in the light of the stability theory of Lie algebras. Using the current experimental data of the particle physics collabora...
Interference checking approach with tolerance based on assembly dimension chain
Institute of Scientific and Technical Information of China (English)
Wang Lei; Li Yingguang; Wang Wei; and Liao Wenhe
2012-01-01
CAD model with nominal dimension is implemented in interference checking of assembly simulation of aircraft complex parts at present, which causes inadequate availability. In order to address this challenging issue, interference checking method with tolerance based on assembly dimension chain was proposed. Worst case and maximum error probability of tolerance of composing loop were used, and CAD models were respectively re-constructed and inserted into simulation system. Before dynamic interference checking, engineering semantic interference condition was set to assembly requirements. Finally, the interface checking result was a basis for reasonability of assembly process and tolerance. A prototype system was developed based on the above research.
Transaction management with integrity checking
DEFF Research Database (Denmark)
Martinenghi, Davide; Christiansen, Henning
2005-01-01
, which are difficult to maintain and error prone. Two important aspects must be taken care of. 1.~It is too time consuming to check integrity constraints from scratch after each update, so simplified checks before each update should be used relying on the assumption that the current state is consistent...
Checks and Controls in Spreadsheets
O'Beirne, Patrick
2009-01-01
Spreadsheets that are informally created are harder to test than they should be. Simple cross-foot checks or being easily readable are modest but attainable goals for every spreadsheet developer. This paper lists some tips on building self-checking into a spreadsheet in order to provide more confidence to the reader that a spreadsheet is robust.
A model of charmed baryon-nucleon potential and 2- and 3-body bound states with charmed baryon
Maeda, Saori; Yokota, Akira; Hiyama, Emiko; Liu, Yan-Rui
2015-01-01
Potential models of the interaction between a charmed baryon ($Y_c$) and the nucleon ($N$) are constructed on the basis of a long-range meson ($\\pi$ and $\\sigma$) exchange potential as well as a short-distance quark exchange interaction. The quark cluster model is used to evaluate the short-range repulsion between $Y_c$ and $N$, while the meson exchange potentials are modified by a form factor at short distances. We determine the cutoff parameters of the form factors so as to fit the $NN$ scattering data with the same approach. The ground state charmed baryons, $\\Lambda_c$, $\\Sigma_c$ and $\\Sigma_c^*$, are included as $Y_c$, and channel couplings of relevant $Y_c N$ channels are taken into account. We propose four sets of parameters (a -- d), among which the most attractive potential (d) predicts bound $\\Lambda_c N$ $J^\\pi= 0^+$ and $1^+$ states. In order to apply the potential to a many-body problem, we construct an effective $\\Lambda_c N$ one-channel potential for the parameter set (d). It is applied to the...
Institute of Scientific and Technical Information of China (English)
沈云付; 解晓方
2011-01-01
Petri网是一种应用非常广泛的建模工具,它能深刻、简洁地描述控制系统,特别是能较好地描述并发系统的结构,并能对系统的动态性质进行分析.在探讨了Petri网的模型检查的基础上,采用双DFS算法,对基于Petri网的模型检查的算法进行了改进,提出了针对Petri网的on-the-fly算法,同时给出了基于on-the-fly的Petri网模型检查的实现和测试,从而可以有效地对Petri网表示的系统模型进行模型检查.%Petri net is a very widely used modelling tool ,which can describe the control system in a profound and brief way.In particular,it can better describe the structure of concurrent system,and can analyse the dynamic property of a system.In this paper, based on the discussion of model checking of the Petri net,we adopt double DFS algorithm to improve the Petri net-based model checking algorithm,put forward the on-the-fly algorithm in light to the Petri net.Meanwhile,we also present the realisation and test of model checking of Petri net based on on-the-fly algorithm,so that the model checking on the system model expressed by Petri net can be applied effectively.
Towards Secure Distance Bounding
Boureanu, Ioana; Mitrokotsa, Aikaterini; Vaudenay, Serge
2013-01-01
Relay attacks (and, more generally, man-in-the-middle attacks) are a serious threat against many access control and payment schemes. In this work, we present distance-bounding protocols, how these can deter relay attacks, and the security models formalizing these protocols. We show several pitfalls making existing protocols insecure (or at least, vulnerable, in some cases). Then, we introduce the SKI protocol which enjoys resistance to all popular attack-models and features provable security....
基于有限理性智能体的生态经济模型%The Ecological Economic Model Based on Bounded Rational Agents
Institute of Scientific and Technical Information of China (English)
姜继娇
2005-01-01
From the view of hominine bounded rationalities, this paper analyzes the important relationships between ecology and economics with behavioral finance. With a different focus, this paper adopts a new conceptualization of stock to show how this conceptualization leads to a new measure of the interaction between ecology and economics, based on bounded rational agents. The hierarchical structure of ecological economic system is described with a multi-agent simulation program. This paper also develops an ecological economic model, in which behavioral finance theories are applied to simulating the dynamics system. With the model, this paper confirms that macro-level indicators of sustainability are predictably influenced by behaviors of bounded rational agents at the micro-level. We discuss the significance of these findings in order to better understand the ecological-economic system based on behavioral finance.
New methods of concurrent checking
Goessel, Michael; Sogomonyan, Egor; Marienfeld, Daniel
2008-01-01
Written by a team of two leading experts and two very successful young former PhD students, New Methods of Concurrent Checking describes new methods of concurrent checking, such as partial duplication, use of output dependencies, complementary circuits, self-dual parity, self-dual duplication and others. A special chapter demonstrates how the new general methods of concurrent checking can be more specifically applied to regular structures to obtain optimum results. This is exemplified for all types of adders up to 64 bits with a level of detail never before presented in the literature. The cle
International Nuclear Information System (INIS)
We present high-precision trap loss spectroscopy of excited Na2 molecules obtained by the photoassociation of ultracold sodium atoms. Near the 3 2S+3 2P3/2 dissociation limit, hyperfine and rotational (Coriolis-type) interactions cause significant mixing of states of different nominal Hund's case (c) symmetry resulting in a complex pattern of spectral lines. We construct a theoretical model of the large, slowly rotating molecule starting from a long-range, atomic viewpoint. Interaction potentials are derived from the known long-range resonant dipole and van der Waals forces between atoms, supplemented at short range by the results of ab initio electronic-structure calculations. Spin-dependent interactions coupling the various angular momenta--nuclear spin, electron spin, electron orbit, and the mechanical rotation of the molecule as a whole--are derived from known atomic parameters. We avoid imposing approximate symmetries or coupling schemes and consequently include all nonadiabatic mixing of different degrees of freedom. Quantitative agreement between experiment and theory for both line positions and intensities is found. Specifically, we observe and calculate mixing of levels of 0g-, 0u+, and 1g symmetry bound by 2S+3 2P3/2 asymptote
Institute of Scientific and Technical Information of China (English)
张瑰; 项杰
2002-01-01
On the basis of the nonlinear stability theorem in the context of Arnol' d's second theorem for the generalized Phillips model, nonlinear saturation of baroclinic instability in the generalized Phillips model is investigated. The lower bound on the disturbance energy and potential enstrophy to the nonlinearly unstable basic flow in the generalized Phillips model is presented, which indicates that there may exist an allocation between a nonlinearly unstable basic flow and a growing disturbance.
Yang, Kuo-Shu
2003-01-01
Maslow's theory of basic human needs is criticized with respect to two of its major aspects, unidimensional linearity and cross-cultural validity. To replace Maslow's linear theory, a revised Y model is proposed on the base of Y. Yu's original Y model. Arranged on the stem of the Y are Maslow's physiological needs (excluding sexual needs) and safety needs. Satisfaction of these needs is indispensable to genetic survival. On the left arm of the Y are interpersonal and belongingness needs, esteem needs, and the self-actualization need. The thoughts and behaviors required for the fulfillment of these needs lead to genetic expression. Lastly, on the right arm of the Y are sexual needs, childbearing needs, and parenting needs. The thoughts and behaviors entailed in the satisfaction of these needs result in genetic transmission. I contend that needs for genetic survival and transmission are universal and that needs for genetic expression are culture-bound. Two major varieties of culture-specific expression needs are distinguished for each of the three levels of needs on the left arm of the Y model. Collectivistic needs for interpersonal affiliation and belongingness, esteem, and self-actualization prevail in collectivist cultures like those found in East Asian countries. Individualistic needs are dominant in individualist cultures like those in North America and certain European nations. I construct two separate Y models, one for people in collectivist cultures and the other for those in individualist ones. In the first (the Yc model), the three levels of expression needs on the left arm are collectivistic in nature, whereas in the second (the Yi model), the three levels of needs on the left arm are individualistic in nature. Various forms of the double-Y model are formulated by conceptually combining the Yc and Yi models at the cross-cultural, crossgroup, and intra-individual levels. Research directions for testing the various aspects of the double-Y model are
Yang, Kuo-Shu
2003-01-01
Maslow's theory of basic human needs is criticized with respect to two of its major aspects, unidimensional linearity and cross-cultural validity. To replace Maslow's linear theory, a revised Y model is proposed on the base of Y. Yu's original Y model. Arranged on the stem of the Y are Maslow's physiological needs (excluding sexual needs) and safety needs. Satisfaction of these needs is indispensable to genetic survival. On the left arm of the Y are interpersonal and belongingness needs, esteem needs, and the self-actualization need. The thoughts and behaviors required for the fulfillment of these needs lead to genetic expression. Lastly, on the right arm of the Y are sexual needs, childbearing needs, and parenting needs. The thoughts and behaviors entailed in the satisfaction of these needs result in genetic transmission. I contend that needs for genetic survival and transmission are universal and that needs for genetic expression are culture-bound. Two major varieties of culture-specific expression needs are distinguished for each of the three levels of needs on the left arm of the Y model. Collectivistic needs for interpersonal affiliation and belongingness, esteem, and self-actualization prevail in collectivist cultures like those found in East Asian countries. Individualistic needs are dominant in individualist cultures like those in North America and certain European nations. I construct two separate Y models, one for people in collectivist cultures and the other for those in individualist ones. In the first (the Yc model), the three levels of expression needs on the left arm are collectivistic in nature, whereas in the second (the Yi model), the three levels of needs on the left arm are individualistic in nature. Various forms of the double-Y model are formulated by conceptually combining the Yc and Yi models at the cross-cultural, crossgroup, and intra-individual levels. Research directions for testing the various aspects of the double-Y model are
Binswanger, J.
2008-01-01
This paper develops a new life cycle model that aims to describe the savings and asset allocation decisions of boundedly rational agents. The paper’s main theoretical contribution is the provision of a simple, tractable and parsimonious framework within which agents make forward looking decisions in
Body checking behaviors in men.
Walker, D Catherine; Anderson, Drew A; Hildebrandt, Thomas
2009-06-01
Males have been facing increasing pressure from the media to attain a lean, muscular physique, and are at risk for body dissatisfaction, disturbed eating and exercise behaviors, and abuse of appearance- and performance-enhancing drugs (APEDs). The aim of the current study was to examine the relationship between body checking and mood, symptoms of muscle dysmorphia, importance of shape and weight, and APED use in undergraduate males. Body checking in males was correlated with weight and shape concern, symptoms of muscle dysmorphia, depression, negative affect, and APED use. Body checking predicted APED use and uniquely accounted for the largest amount of variance in Muscle Dysmorphic Disorder Inventory (MDDI) scores (16%). Findings support the view that body checking is an important construct in male body image, muscle dysmorphia, and body change strategies and suggest a need for further research. PMID:19482568
Treasury Check Verification Query (TCVQ)
Social Security Administration — The TCVQ system determines the SSN of an individual whose check has been returned to a local field office. The FO is able to request this information via the TCVQ...
Matthews, Edward; Sen, Ananya; Yoshikawa, Naruo; Bergström, Ed; Dessent, Caroline E H
2016-06-01
Isolated molecular clusters of adenine, cytosine, thymine and uracil bound to hexachloroplatinate, PtCl6(2-), have been studied using laser electronic photodissociation spectroscopy to investigate photoactivation of a platinum complex in the vicinity of a nucleobase. These metal complex-nucleobase clusters represent model systems for identifying the fundamental photochemical processes occurring in photodynamic platinum drug therapies that target DNA. This is the first study to explore the specific role of a strongly photoactive platinum compound in the aggregate complex. Each of the clusters studied displays a broadly similar absorption spectra, with a strong λmax ∼ 4.6 eV absorption band and a subsequent increase in the absorption intensity towards higher spectral-energy. The absorption bands are traced to ligand-to-metal-charge-transfer excitations on the PtCl6(2-) moiety within the cluster, and result in Cl(-)·nucleobase and PtCl5(-) as primary photofragments. These results demonstrate how selective photoexcitation can drive distinctive photodecay channels for a model photo-pharmaceutical. In addition, cluster absorption due to excitation of nucleobase-centred chromophores is observed in the region around 5 eV. For the uracil cluster, photofragments consistent with ultrafast decay of the excited state and vibrational predissociation on the ground-state surface are observed. However, this decay channel becomes successively weaker on going from thymine to cytosine to adenine, due to differential coupling of the excited states to the electron detachment continuum. These effects demonstrate the distinctive photophysical characteristics of the different nucleobases, and are discussed in the context of the recently recorded photoelectron spectra of theses clusters. PMID:27198464
Body checking behaviors in men
Walker, D. Catherine; Anderson, Drew A.; Hildebrandt, Thomas
2009-01-01
Males have been facing increasing pressure from the media to attain a lean, muscular physique, and are at risk for body dissatisfaction, disturbed eating and exercise behaviors, and abuse of appearance- and performance-enhancing drugs (APEDs). The aim of the current study was to examine the relationship between body checking and mood, symptoms of muscle dysmorphia, importance of shape and weight, and APED use in undergraduate males. Body checking in males was correlated with weight and shape ...
Static Checking of Interrupt-driven Software
DEFF Research Database (Denmark)
Brylow, Dennis; Damgaard, Niels; Palsberg, Jens
2001-01-01
in a few seconds on a standard PC. Our tool is one of the first to give an efficient and useful static analysis of assembly code. It enables increased confidence in correctness, significantly reduced testing requirements, and support for maintenance throughout the system life-cycle....... require extensive brute-force testing, making development and maintenance costly. This is particularly true for system components that are written in assembly language. Static checking has the potential of alleviating these problems, but until now there has been little tool support for programming...... at the assembly level. In this paper we present the design and implementation of a static checker for interrupt-driven Z86-based software with hard real-time requirements. For six commercial microcontrollers, our checker has produced upper bounds on interrupt latencies and stack sizes, as well as verified...
Upper Bounds on Numerical Approximation Errors
DEFF Research Database (Denmark)
Raahauge, Peter
2004-01-01
This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function...... to approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...
Institute of Scientific and Technical Information of China (English)
曾振东
2013-01-01
Bounding Box algorithm is a typical node localisation algorithm based on discrete network model in wireless sensor network (WSN).To overcome its disadvantages in low localisation accuracy and coverage rate , we propose an improved localisation algorithm which employs the virtual anchor nodes strategy .First, the unknown nodes will calculate their own coordinates by making use of the anchor nodes within their communication range .Secondly , the located unknown nodes will upgrade themselves as the virtual anchor nodes according to the promotion strategy selectively .Finally, those nodes which are unable to locate themselves will use the virtual anchor nodes to get their own location.Besides, the establishment of the network node model with double radius based on discrete network model further restrict the location of the unknown nodes .Theoretical analysis and simulation result all show that the proposed algorithm can effectively improve the localisation accuracy while significantly raise the coverage rate of localisation .%Bounding Box算法是一种典型的基于离散网络模型的无线传感器网络节点定位算法。针对Bounding Box算法定位误差大、覆盖率低的缺点，提出一种采用虚拟锚节点策略的改进定位算法。首先未知节点利用其通信范围内的锚节点进行定位；其次，已定位的节点根据升级策略有选择性的升级为虚拟锚节点；最后，无法定位的节点利用虚拟锚节点实现定位。另外，在离散网络模型的基础上，通过建立双半径网络节点模型从而进一步约束了未知节点的位置。理论分析及仿真结果均表明，该算法在显著提高定位覆盖率的同时，有效地提高了定位精度。
International Nuclear Information System (INIS)
We obtain bounds on the anomalous magnetic and electric dipole moments of the tau-neutrino through the reaction e+e-→ννγ at the Z1-pole in the framework of a Left-Right symmetric model and a class of E6 inspired models with an additional neutral vector boson Zθ. We use the data collected by the L3 Collaboration at LEP. For the parameters of the E6 model we consider the mixing angle θE6=37.8 deg. and MZθ=7MZ1. We find that our bounds are of the same order of magnitude as those obtained in other extensions of the standard model
An Exponential Bound for Cox Regression☆
Kosorok, M. R.
2012-01-01
We present an asymptotic exponential bound for the deviation of the survival function estimator of the Cox model. We show that the bound holds even when the proportional hazards assumption does not hold. PMID:23565013
An Exponential Bound for Cox Regression.
Goldberg, Y; Kosorok, M R
2012-07-01
We present an asymptotic exponential bound for the deviation of the survival function estimator of the Cox model. We show that the bound holds even when the proportional hazards assumption does not hold.
Keilani, Serene; Lun, Yi; Stevens, Anthony C; Williams, Hadis N; Sjoberg, Eric R; Khanna, Richie; Valenzano, Kenneth J; Checler, Frederic; Buxbaum, Joseph D; Yanagisawa, Katsuhiko; Lockhart, David J; Wustman, Brandon A; Gandy, Sam
2012-04-11
Alterations in the lipid composition of endosomal-lysosomal membranes may constitute an early event in Alzheimer's disease (AD) pathogenesis. In this study, we investigated the possibility that GM2 ganglioside accumulation in a mouse model of Sandhoff disease might be associated with the accumulation of intraneuronal and extracellular proteins commonly observed in AD. Our results show intraneuronal accumulation of amyloid-β peptide (Aβ)-like, α-synuclein-like, and phospho-tau-like immunoreactivity in the brains of β-hexosaminidase knock-out (HEXB KO) mice. Biochemical and immunohistochemical analyses confirmed that at least some of the intraneuronal Aβ-like immunoreactivity (iAβ-LIR) represents amyloid precursor protein C-terminal fragments (APP-CTFs) and/or Aβ. In addition, we observed increased levels of Aβ40 and Aβ42 peptides in the lipid-associated fraction of HEXB KO mouse brains, and intraneuronal accumulation of ganglioside-bound Aβ (GAβ) immunoreactivity in a brain region-specific manner. Furthermore, α-synuclein and APP-CTFs and/or Aβ were found to accumulate in different regions of the substantia nigra, indicating different mechanisms of accumulation or turnover pathways. Based on the localization of the accumulated iAβ-LIR to endosomes, lysosomes, and autophagosomes, we conclude that a significant accumulation of iAβ-LIR may be associated with the lysosomal-autophagic turnover of Aβ and fragments of APP-containing Aβ epitopes. Importantly, intraneuronal GAβ immunoreactivity, a proposed prefibrillar aggregate found in AD, was found to accumulate throughout the frontal cortices of postmortem human GM1 gangliosidosis, Sandhoff disease, and Tay-Sachs disease brains. Together, these results establish an association between the accumulation of gangliosides, autophagic vacuoles, and the intraneuronal accumulation of proteins associated with AD. PMID:22496568
Automatization and familiarity in repeated checking
Dek, Eliane C P; van den Hout, Marcel A.; Giele, Catharina L.; Engelhard, Iris M.
2014-01-01
Repeated checking paradoxically increases memory uncertainty. This study investigated the underlying mechanism of this effect. We hypothesized that as a result of repeated checking, familiarity with stimuli increases, and automatization of the checking procedure occurs, which should result in decrea
边界面模型在FLAC3D中的开发及验证%Development and verification of bounding surface model in FLAC3D
Institute of Scientific and Technical Information of China (English)
雷小芹; 杨果林
2012-01-01
By using the further developing platform UDM, a simplified bounding surface model based on modified Cam-clay model is developed in the FLAC3D program in the VC++ debug environment. The bounding surface model's basic principles are introduced, and the key technologies and the concrete methods of implementation are explained. Numerical simulations of loading and unloading triaxial tests, undrained triaxial shear tests are performed to study the difference between bounding surface model and modified Cam-clay model. The computed results show that the newly developed bounding surface model is reasonable and reliable, and has great advantages compared with modified Cam-clay model.%利用FLAC3D程序提供的二次开发平台UDM在VC++编译环境下实现了一基于修正剑桥模型的简化边界面模型的开发.介绍了边界面模型的基本原理,并给出了开发关键技术和具体实施方法.通过三轴加卸载试验、不排水静三轴试验、不排水动三轴试验等几种数值试验与修正剑桥模型进行了对比研究.计算结果验证了所开发的边界面模型的正确性及相对修正剑桥模型的优越性.
Energy Technology Data Exchange (ETDEWEB)
Craven, C.M.; Alexander, J.; Eldridge, M.; Kushner, J.P.; Bernstein, S.; Kaplan, J.
1987-05-01
Genetically hypotransferrinemic mice accumulate iron in the liver and pancreas. A similar pattern of tissue iron accumulation occurs in humans with hereditary hemochromatosis. In both disorders, there is a decrease plasma concentration of apotransferrin. To test the hypothesis that nontransferrin-bound iron exists and is clear by the parenchymal tissues, the tissue distribution of /sup 59/Fe was studied in animals lacking apotransferrin. Two groups of animals were used: normal rats and mice whose transferrin had been saturated by an intravenous injection of nonradiolabeled iron, and mice with congential hypotransferrinemia. In control animals, injected /sup 59/Fe was found primarily in the bone marrow and spleen. In the transferrin iron-saturated animals, injected /sup 59/Fe accumulated in the liver and pancreas. Gastrointestinally absorbed iron in hypotransferrinemic or transferrin iron-saturated mice was deposited in the liver. This indicates that newly absorbed iron is released from mucosal cells not bound to transferrin. Clearance studies demonstrated that transferrin-bound /sup 59/Fe was removed from the circulation of rats with a half-time of 50 min. In transferrin iron-saturated animals, injected /sup 59/Fe was removed with a half-time of <30 s. Analysis of the distribution of /sup 59/Fe in serum samples by polyacrylamide gel electrophoresis demonstrated the presence of /sup 59/Fe not bound to transferrin. These results demonstrate the existence of and uptake system for non-transferrin-bound iron. These observations support the hypothesis that parenchymal iron overload is consequence of reduced concentrations of apotransferrin.
Pouya, E. Ahmadi; Rajabi, A. A.
2016-09-01
A recently developed three-Dimensional (3D) approach, without Partial-Wave (PW) decomposition is considered to investigate solutions of Faddeev-Yakubovsky (F-Y) integral equations in momentum space representation. The F-Y formulation for six-nucleon bound-state problem leads to five coupled equations in terms of five independent structures, which can be reduced to two coupled ones for considering the effective interactions of the two loosely bound nucleons with respect to the α-core nucleus. In order to study, the effective structure of six-nucleon bound-state in 3D representation, the coupled equations are represented in momentum space as a two coupled 3D integral equations. This is the first step to approach the calculations, of six-nucleon bound-state problem in 3D approach. In our calculations, we considered simple potential models, namely spin-independent two-body (2B) interactions. Our numerical results are fair compatible with results of other methods.
Advanced techniques for efficient data integrity checking
DEFF Research Database (Denmark)
Martinenghi, Davide
Integrity constraint checking, understood as the verification of data correctness and well-formedness conditions that must be satisfied in any state of a database, is not fully supported by current database technology. In a typical scenario, a database is required to comply with given semantic cr...... contexts, such as recursive databases, concurrent database systems, data integration systems and XML document collections, and provide a performance evaluation of the proposed model.......Integrity constraint checking, understood as the verification of data correctness and well-formedness conditions that must be satisfied in any state of a database, is not fully supported by current database technology. In a typical scenario, a database is required to comply with given semantic...... criteria (the integrity constraints) and to maintain the compliance each time data are updated. Since the introduction of the SQL2 standard, the SQL language started supporting assertions, which allow one to define general data consistency requirements expressing arbitrarily complex “business rules” that...
Bounds on Integrals of the Wigner Function
Bracken, A J; Wood, J G
1999-01-01
The integral of the Wigner function over a subregion of the phase-space of a quantum system may be less than zero or greater than one. It is shown that for systems with one degree of freedom, the problem of determining the best possible upper and lower bounds on such an integral, over all possible states, reduces to the problem of finding the greatest and least eigenvalues of an hermitian operator corresponding to the subregion. The problem is solved exactly in the case of an arbitrary elliptical region. These bounds provide checks on experimentally measured quasiprobability distributions.
Rathsam, C; Giffard, P M; Jacques, N A
1993-01-01
The ftf gene, coding for the cell-bound beta-D-fructosyltransferase (FTF) of Streptococcus salivarius ATCC 25975, has been analyzed, and its deduced amino acid sequence has been compared with that of the secreted FTF of Streptococcus mutans and the levansucrases (SacBs) of Bacillus species. A unique proline-rich region detected at the C terminus of the FTF of S. salivarius preceded a hydrophobic terminal domain. This proline-rich region was shown to possess strong homology to the product of the prgC gene from pCF10 in Enterococcus faecalis, which encodes a pheromone-responsive protein of unknown function, as well as homology to the human proline-rich salivary protein PRP-4. A series of 3'-OH deletions of the S. salivarius ftf gene expressed in Streptococcus gordonii Challis LGR2 showed that the C terminus was required for cell surface attachment in this heterologous organism, as only the complete gene product was cell bound. This cell-bound activity was released in the presence of sucrose, suggesting that the mode of attachment and release of the S. salivarius FTF in S. gordonii was similar to that in its native host. PMID:8331080
DEFF Research Database (Denmark)
Faupin, Jeremy; Møller, Jacob Schach; Skibsted, Erik
2011-01-01
We study regularity of bound states pertaining to embedded eigenvalues of a self-adjoint operator H, with respect to an auxiliary operator A that is conjugate to H in the sense of Mourre. We work within the framework of singular Mourre theory which enables us to deal with confined massless Pauli......–Fierz models, our primary example, and many-body AC-Stark Hamiltonians. In the simpler context of regular Mourre theory, our results boil down to an improvement of results obtained recently in [8, 9]....
Cohen, E A K; Kim, D; Ober, R J
2015-12-01
The Cramér-Rao lower bound for the estimation of the affine transformation parameters in a multivariate heteroscedastic errors-in-variables model is derived. The model is suitable for feature-based image registration in which both sets of control points are localized with errors whose covariance matrices vary from point to point. With focus given to the registration of fluorescence microscopy images, the Cramér-Rao lower bound for the estimation of a feature's position (e.g., of a single molecule) in a registered image is also derived. In the particular case where all covariance matrices for the localization errors are scalar multiples of a common positive definite matrix (e.g., the identity matrix), as can be assumed in fluorescence microscopy, then simplified expressions for the Cramér-Rao lower bound are given. Under certain simplifying assumptions these expressions are shown to match asymptotic distributions for a previously presented set of estimators. Theoretical results are verified with simulations and experimental data.
生长曲线模型中参数估计误差的上界%Upper Bound on the Estimation Error in a Growth Curve Model
Institute of Scientific and Technical Information of China (English)
左卫兵; 时文芳
2015-01-01
研究了生长曲线模型中利用lasso所得到的参数估计B^ L 的误差。在设计矩阵X1分别满足RE条件、兼容性条件和UDP条件时，依次得到估计误差‖^B L -B‖1的上界，并且该上界与协调参数成正比。%The upper bound of the estimation error in a growth curve model was discussed. Based on the lasso in the linear regression, the lasso estimation was obtained in the growth curve model. When the de-sign matrix X1 satisfies RE condition ( restricted eigenvalue condition) , compatibility condition, and UDP ( universal distortion property ) condition, the corresponding upper bound on estimation error‖B^L-B‖1 was successively identified. And the upper bounds were proportion to the tuning parameter.
Cohen, E A K; Kim, D; Ober, R J
2015-12-01
The Cramér-Rao lower bound for the estimation of the affine transformation parameters in a multivariate heteroscedastic errors-in-variables model is derived. The model is suitable for feature-based image registration in which both sets of control points are localized with errors whose covariance matrices vary from point to point. With focus given to the registration of fluorescence microscopy images, the Cramér-Rao lower bound for the estimation of a feature's position (e.g., of a single molecule) in a registered image is also derived. In the particular case where all covariance matrices for the localization errors are scalar multiples of a common positive definite matrix (e.g., the identity matrix), as can be assumed in fluorescence microscopy, then simplified expressions for the Cramér-Rao lower bound are given. Under certain simplifying assumptions these expressions are shown to match asymptotic distributions for a previously presented set of estimators. Theoretical results are verified with simulations and experimental data. PMID:26641728
Formal Checking of Multiple Firewalls
Directory of Open Access Journals (Sweden)
Nihel Ben Youssef
2012-05-01
Full Text Available When enterprises deploy multiple firewalls, a packet may be examined by different sets of firewalls. It has been observed that the resulting complex firewall network is highly error prone and causes serious security holes. Hence, automated solutions are needed in order to check its correctness. In this paper, we propose a formal and automatic method for checking whether multiple firewalls react correctly with respect to a security policy given in a high level declarative language. When errors are detected, some useful feedback is returned in order to correct the firewall configurations. Furthermore, we propose a priority-based approach to ensure that no incoherencies exist within the security policy. We show that our method is both correct and complete. Finally, it has been implemented in a prototype of verifier based on a satisfiability solver modulo theories. Experiment conducted on relevant case studies demonstrates the efficiency of our approach.
Checking modes of HAL programs
de la Banda, MG; Harvey, W; Marriott, K.; Stuckey, PJ; Demoen, Bart
2005-01-01
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generation of efficient target code and the detection of many errors at compile-time. Unfortunately, mode checking in such languages is difficult. One of the main reasons is that, for each predicate mode declaration, the compiler is required to appropriately re-order literals in the predicate's definition. The task is further...
International Nuclear Information System (INIS)
The parameters of separable coupled channels s-wave potentials for the strong /bar K/N interaction are determined from low energy K-p scattering data with additional constraints from π-p → πΣK0 production data. The shifts and widths of the Coulomb bound states in kaonic hydrogen are calculated with these potentials and compared with experiment. Optical potentials are constructed from /bar K/N t-matrices derived from the separable potentials, and these optical potentials are used to calculate kaonic helium and kaonic carbon shifts and widths which are also compared with experiment. 68 refs., 50 figs., 9 tabs
Improving the Hadron Physics of Non-Standard-Model Decays: Example Bounds on R-parity Violation
Daub, J T; Hanhart, C; Kubis, B; Meißner, U -G
2012-01-01
Using the example of selected decays driven by R-parity-violating supersymmetric operators, we demonstrate how strong final-state interactions can be controlled quantitatively with high precision, thus allowing for a more accurate extraction of effective parameters from data. In our examples we focus on the lepton-flavor-violating decays tau --> mu pi+ pi-. In R-parity violation these can arise due to the product of two couplings. We find bounds that are an order of magnitude stronger than previous ones.
Bounded rationality and learning in market competition
Tuinstra, J.; Hommes, C.H.; Kopányi, D.
2015-01-01
This thesis promotes the use of bounded rationality in economic models. The assumption of perfect rationality often imposes high informational and computational burden on economic agents and predictions based on this assumption are not in line with observed behavior in some cases. Models of bounded rationality may better explain actual behavior in such situations. In the thesis we consider market models where firms are boundedly rational: they do not know the demand for their product and they...
International Nuclear Information System (INIS)
Scattering of a particle by bound nucleons is discussed. Effects of nucleons that are bound in a nucleus are taken as a structure function. The way how to calculate the structure function is given. (author)
Variance bounding Markov chains
Roberts, Gareth O.; Jeffrey S. Rosenthal
2008-01-01
We introduce a new property of Markov chains, called variance bounding. We prove that, for reversible chains at least, variance bounding is weaker than, but closely related to, geometric ergodicity. Furthermore, variance bounding is equivalent to the existence of usual central limit theorems for all L2 functionals. Also, variance bounding (unlike geometric ergodicity) is preserved under the Peskun order. We close with some applications to Metropolis–Hastings algorithms.
Towards a Certified Lightweight Array Bound Checker for Java Bytecode
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.
Infeasibility of Quantum Cryptography Without Eavesdropping Check
Yang, Wei; Huang, Liusheng; Song, Fang; Wang, Qiyan
Secure key distribution is impossible in pure classical environment. Unconditional secure key distribution is available when quantum means are introduced, assisted by a classical communication channel. What is possible when a quantum key distribution scheme is without classical communication? We present a general model with this constraint and show that quantum key distribution without classical eavesdropping check is in principle impossible. For an adversary can always succeed in obtaining the secret key via a special case of man-in-the-middle attack, namely intercept-and-forward attack without any risk of being captured.
Higgs mass bounds from the functional RG
International Nuclear Information System (INIS)
We investigate a Top-Yukawa toy model to study Higgs mass bounds in the framework of the functional renormalization group (RG). Starting the calculations with a quartic ultraviolet (UV) potential we get a finite range of values for the Higgs mass in the infrared for a given cutoff. The bounds appear in a natural way as a consequence of the RG flow. The lower mass bound is approached for a vanishing UV quartic coupling. Furthermore, we study the influence of higher-dimensional operators on the lower Higgs mass bound. We find that even seemingly RG irrelevant interactions can take a substantial influence on the lower bound for the Higgs mass.
Institute of Scientific and Technical Information of China (English)
罗光成; 张丹
2011-01-01
Submarine is difficult to be found under the water for its hidden capability. This paper provided an algorithm which bases on the application of dipping sonar on anti-submarine helicopter to search the submarine in the suspicious areas, and established a model of multi-round reentry searching for which using the single helicopter check search,and combined with the submarine underwater navigation,simulated the search process,at last it analyzed the efficient of dipping sonar probe space and detect probability. It provided a reference to give anti-submarine tactics for the areas check searching.%潜艇因其隐身性,在水下很难被发现.本文根据反潜直升机利用吊放声呐搜潜的战术应用,对可疑区域进行快速有效地检查搜索.建立了应用于单机检查搜潜的多段往返搜潜模型.并结合水下潜艇的航行,对搜索过程进行仿真,分析了吊放声呐探测点间隔系数对模型搜潜概率的影响,为区域检查搜潜战术制定提供了参考.
Indian Academy of Sciences (India)
S H Patil; K D Sen
2012-01-01
Using dimensional analyses, the scaling properties of the Heisenberg uncertainty relationship as well as the various information theoretical uncertainty-like relationships are derived for the bound states corresponding to the superposition of the power potential of the form () = + $^{n_{i}}, where , , , are parameters, in the free state as well as in the additional presence of a spherical penetrable boundary wall located at radius The uncertainty product and all other net information measures are shown here to depend only on the parameters [] defined by the ratios /$^{(n_{i}+2)/(n+2)}$. Introduction of a finite potential, V at the radial distance ≥ results in a complete set of scaling parameters given by [, 1, 2], where 1 is given by 1/(n+2) and 2 = V/()2/(+2).
Eta nuclear bound states revisited
Friedman, E; Mareš, J
2013-01-01
The strong energy dependence of the s-wave eta-N scattering amplitude at and below threshold, as evident in coupled-channels K-matrix fits and chiral models that incorporate the S11 N*(1535) resonance, is included self consistently in eta-nuclear bound state calculations. This approach, applied recently in calculations of kaonic atoms and Kbar-nuclear bound states, is found to impose stronger constraints than ever on the onset of eta-nuclear binding, with a minimum value of Re a_{eta N} approximately 0.9 fm required to accommodate an eta-4He bound state. Binding energies and widths of eta-nuclear states are calculated within several underlying eta-N models for nuclei across the periodic table, including eta-25Mg for which some evidence was proposed in a recent COSY experiment.
Improved Range Searching Lower Bounds
DEFF Research Database (Denmark)
Larsen, Kasper Green; Nguyen, Huy L.
2012-01-01
range reporting problem. In approximate simplex range reporting, points that lie within a distance of ε ⋅ Diam(s) from the border of a query simplex s, are free to be included or excluded from the output, where ε ≥ 0 is an input parameter to the range searching problem. We prove our lower bounds......Table of Contents -------------------------------------------------------------------------------- In this paper we present a number of improved lower bounds for range searching in the pointer machine and the group model. In the pointer machine, we prove lower bounds for the approximate simplex...... 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...
Simulation bounds for system availability
International Nuclear Information System (INIS)
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