Results 31 to 40 of about 1,184,149 (273)
Coalgebraic trace semantics via forgetful logics [PDF]
Logical Methods in Computer Science, 2017 We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative ...
Bartek Klin, Jurriaan Rot
doaj +1 more source
Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories [PDF]
Logical Methods in Computer Science, 2017 Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. This paper presents an investigation of categorical, algebraic, and computational foundations of cyclic datatypes.
Makoto Hamana
doaj +1 more source
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [PDF]
Logical Methods in Computer Science, 2021 We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
James Laird
doaj +1 more source
Polynomial Chaos Helps Assessing Parameters Variations of PCB Lines [PDF]
, 2011 This paper presents an effective solution for the analysis of long PCB interconnects with the inclusion of uncertainties resulting from different sources of variation, like temperature or fabrication process, on both the structure and loading conditions.
Canavero, Flavio +2 more
core +1 more source
Models of Type Theory Based on Moore Paths [PDF]
Logical Methods in Computer Science, 2019 This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path.
Ian Orton, Andrew M. Pitts
doaj +1 more source
Rooted Divergence-Preserving Branching Bisimilarity is a Congruence [PDF]
Logical Methods in Computer Science, 2020 We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.
Rob van Glabbeek +2 more
doaj +1 more source
Advanced Engineering Materials, EarlyView., 2023 This study aims to explore the feasibility of using a structure inspired by the features of horsetail and human spine as the potential helmet liner, targeting at mitigation of acceleration‐induced injuries. A parametric study is conducted to investigate the effect of individual geometrical variables in the design, indicating its capability to reduce ...
Bing Leng +3 more
wiley +1 more source
Exhaustible sets in higher-type computation [PDF]
Logical Methods in Computer Science, 2008 We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which the predicate ...
Martin Escardo
doaj +1 more source
A Variational Beam Model for Failure of Cellular and Truss‐Based Architected Materials
Advanced Engineering Materials, EarlyView., 2023 Herein, a versatile and efficient beam modeling framework is developed to predict the nonlinear response and failure of cellular, truss‐based, and woven architected materials. It enables the exploration of their design space and the optimization of their mechanical behavior in the nonlinear regime. A variational formulation of a beam model is presented
Konstantinos Karapiperis +3 more
wiley +1 more source
Wireless Accelerometer for Neonatal MRI Motion Artifact Correction [PDF]
, 2017 A wireless accelerometer has been used in conjunction with a dedicated 3T neonatal MRI system installed on a Neonatal Intensive Care Unit to measure in-plane rotation which is a common problem with neonatal MRI.
Griffiths, Paul +5 more
core +3 more sources