35,798 Hits in 4.2 sec

Efficient Multiple-Valued Model-Checking Using Lattice Representations [chapter]

Marsha Chechik, Benet Devereux, Steve Easterbrook, Albert Y. C. Lai, Victor Petrovykh
2001 Lecture Notes in Computer Science  
This allows us to partially reuse existing symbolic model-checking technology and improve efficiency over previous implementations that were based on multiple-valued decision diagrams.  ...  We specify multiple-valued logics using finite lattices.  ...  Acknowledgments We would like to thank Alasdair Urquhart for suggesting that distributive lattices can be represented by their join-irreducible elements.  ... 
doi:10.1007/3-540-44685-0_30 fatcat:ogdlloagpredzdqdmyccrogj3a

Consistent Partial Model Checking

Michael Huth, Shekhar Pradhan
2004 Electronical Notes in Theoretical Computer Science  
We classify those orders that are finite and distributive and apply them to design an efficient algorithm for multiple-viewpoint checking, where checks are delegated to single-viewpoint models -efficiently  ...  To validate the approach, we investigate multiple-valued models and their compositional property semantics over a finite distributive AC lattice.  ...  Glenn Bruns and, independently, Gordon Plotkin suggested to consider the possibility of embedding AC lattices into De Morgan lattices.  ... 
doi:10.1016/j.entcs.2004.08.003 fatcat:pyx7qj54tvbp5o4oscigibhf6e

Lattice representations of Penrose tilings of the plane [article]

Matthias W. Reinsch
2000 arXiv   pre-print
Two-, three- and four-dimensional representations of Penrose tilings of the plane are described. The vertices that occur in these representations lie on lattices.  ...  Symmetries and methods of visualizing these representations are discussed. The question of efficiently storing the information necessary to reconstruct a tiling is addressed.  ...  APPENDIX A: CHECKING FOR TILE OVERLAP USING INTEGER MATH The subject of this appendix is an algorithm for checking for tile overlap using calculations with integers.  ... 
arXiv:math-ph/9911024v2 fatcat:zpm4mcthprdndawa7laorf3vra

A Data Model for Distributed Multiresolution Multisource Scientific Data [chapter]

Philip J. Rhodes, R. Daniel Bergeron, Ted M. Sparr
2003 Mathematics and Visualization  
Using multiple resolutions of the data set (multiresolution), the scientist can identify potentially interesting regions with a coarse overview, followed by narrower views at higher resolutions.  ...  data based on functionality defined by the model.  ...  Lattice Model.  ... 
doi:10.1007/978-3-642-55787-3_18 fatcat:w4curtqqx5dcvjhqvirgfzrxdu

A Requirement-Centric Approach to Web Service Modeling, Discovery, and Selection [chapter]

Maha Driss, Naouel Moha, Yassine Jamoussi, Jean-Marc Jézéquel, Henda Hajjami Ben Ghézala
2010 Lecture Notes in Computer Science  
SOC is becoming broadly adopted as it offers the ability to build efficiently and effectively added-value Service-Based Applications (SBAs) by composing ready-made services.  ...  In this paper, we propose a requirement-centric approach which allows: (i) modeling users' requirements for SBAs with the MAP formalism and specifying required services using an Intentional Service Model  ...  Thus, we need to enhance our selection method with multiple QoS properties to identify more efficiently high QoS services.  ... 
doi:10.1007/978-3-642-17358-5_18 fatcat:yipcgeawf5bfdm26x5olt64drq

Hierarchical volumetric object representations for digital fabrication workflows

Matthew Keeter
2013 ACM SIGGRAPH 2013 Posters on - SIGGRAPH '13  
Adaptively sampled distance fields are used as a generic interchange format. Functional representations are used as a design representation, and we examine scaling behavior and efficient rendering.  ...  Replacing boundary representations with volumetric representations guarantees that models represent reasonable real-world solids.  ...  If using greyscale lattices, the required RAM becomes excessive: the lattice described above requires 3 GB for storage of intermediary and final distance values.  ... 
doi:10.1145/2503385.2503477 dblp:conf/siggraph/Keeter13 fatcat:hrythbafxrhe5kxmnlsf7t5cqq

Toward Lattice QCD On Billion Core Approximate Computers [article]

Alexandra Bates, Joseph Bates
2020 arXiv   pre-print
As a test of accuracy, a 32 x 32 x 32 U(1) sigma model yielded similar results using floating point and approximate representations for the spins.  ...  We show that, using massively parallel approximate hardware, at least some models can run with great speed and power efficiency without sacrificing accuracy.  ...  We tested the algorithm on a 32 x 32 x 32 point lattice to check its accuracy compared to the floating point model described in section 3.  ... 
arXiv:2010.15973v1 fatcat:tyjwl5wrszh5njj67d3nvjtwqi

Composing symbolic trajectory evaluation results [chapter]

Scott Hazelhurst, Carl-Johan H. Seger
1994 Lecture Notes in Computer Science  
This proof is done using Voss, and, crucially for the efficiency of the checking, is done for arbitrary input values rather than the actual values the circuit will use when executing.  ...  The results generated by model-checking are combined using the LAMBDA theorem-prover.  ... 
doi:10.1007/3-540-58179-0_61 fatcat:y6vpfsuthrbd3mho3qj5uwxcc4

The design and application of structured types in Ptolemy II

Yuhong Xiong, E. Leet, Xiaojun Liu, Yang Zhao, L.C. Zhong
2005 2005 IEEE International Conference on Granular Computing  
This model makes extensive use of record types to represent the protocol messages in the system.  ...  In the base type system, all the types are organized into a type lattice, and type constraints in the form of inequalities can be solved efficiently over the lattice.  ...  They can be used to bundle multiple pieces of information in one token and transfer them in one round of communication, making the execution more efficient.  ... 
doi:10.1109/grc.2005.1547378 dblp:conf/grc/XiongLLZZ05 fatcat:fzcvuz5gh5bcrgijcwauptpqcm

The design and application of structured types in Ptolemy II

Yang Zhao, Yuhong Xiong, Edward A. Lee, Xiaojun Liu, Lizhi C. Zhong
2009 International Journal of Intelligent Systems  
This model makes extensive use of record types to represent the protocol messages in the system.  ...  In the base type system, all the types are organized into a type lattice, and type constraints in the form of inequalities can be solved efficiently over the lattice.  ...  They can be used to bundle multiple pieces of information in one token and transfer them in one round of communication, making the execution more efficient.  ... 
doi:10.1002/int.20391 fatcat:4frazsb4kffeljmvy2xkfywhae

Surface worm algorithm for abelian Gauge–Higgs systems on the lattice

Ydalia Delgado Mercado, Christof Gattringer, Alexander Schmidt
2013 Computer Physics Communications  
Using Gauge-Higgs models with gauge groups Z(3) and U(1) we compare the SWA to the conventional approach and to a local update in the dual representation.  ...  In this work we present the surface worm algorithm (SWA) which is a generalization of the worm algorithm concept to abelian Gauge-Higgs models on a lattice which can be mapped to systems of surfaces and  ...  Acknowledgments We thank Hans Gerd Evertz for numerous discussions that helped to shape this project and for providing us with the software to compute the autocorrelation times.  ... 
doi:10.1016/j.cpc.2013.02.001 fatcat:phtla25x2vf3npmtjskrzvthqi

kmos: A lattice kinetic Monte Carlo framework

Max J. Hoffmann, Sebastian Matera, Karsten Reuter
2014 Computer Physics Communications  
lattice systems, involving multiple active sites in periodic or aperiodic arrangements, as well as site-resolved pairwise and higher-order lateral interactions.  ...  Systems, where site-specificity of all elementary reactions allows a mapping onto a lattice of discrete active sites, can be addressed within the particularly efficient lattice kMC approach.  ...  (x, y, z) lattice representation to a one-dimensional representation, which simply enumerates all lattice points. This mapping can be cached in 1D and 4D arrays which makes it very efficient.  ... 
doi:10.1016/j.cpc.2014.04.003 fatcat:5hkfcavr3rcyvmyfyz5tll3fua

Lattice-based SMT for program verification

Karine Even-Mendoza, Antti E. J. Hyvärinen, Hana Chockler, Natasha Sharygina
2019 Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design - MEMOCODE '19  
Our lightweight theory uses lattices for efficient representation of library functions by a subset of guarded literals.  ...  of guarded literals from all lattices does not lead to contradictory values of their variables.  ...  Our approach uses the concept of subset lattices to construct an efficient representation of known properties of these functions.  ... 
doi:10.1145/3359986.3361214 dblp:conf/memocode/Even-MendozaHCS19 fatcat:tgyvmy6pgncdha7rhrdvjpb46e

Genarris 2.0: A Random Structure Generator for Molecular Crystals [article]

Rithwik Tom, Timothy Rose, Imanuel Bier, Harriet O'Brien, Alvaro Vazquez-Mayagoitia, Noa Marom
2019 arXiv   pre-print
A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately.  ...  A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures.  ...  To improve the efficiency, Genarris 2.0 performs a series of three hierarchical structure checks.  ... 
arXiv:1909.10629v1 fatcat:e2kvvqyllzdzlorfjbwhm4vesq

Ontology-based interoperation model of collaborative product development

Hongbo Sun, Wenhui Fan, Weiming Shen, Tianyuan Xiao
2012 Journal of Network and Computer Applications  
As a human-friendly modeling method, compared with existing interoperation modeling methods, the proposed method is more flexible, efficient and reliable.  ...  Model).  ...  Time representation table: describe the representation of time value. Transportation type table: describe the transportation mechanism used.  ... 
doi:10.1016/j.jnca.2011.02.012 fatcat:w4u7typx2zapjo4dk522vf7n5q
« Previous Showing results 1 — 15 out of 35,798 results