Filters








14 Hits in 1.5 sec

Shape representation by zippables

Christian Schüller, Roi Poranne, Olga Sorkine-Hornung
2018 ACM Transactions on Graphics  
The work was supported in part by the European Research Council under Grant No.: StG-2012-306877 (ERC Starting Grant iModel).  ...  Shape Representation by Zippables CHRISTIAN SCHÜLLER, ROI PORANNE, and OLGA SORKINE-HORNUNG, ETH Zurich, Switzerland 3D model single spiraling curve segmentation developable shape zippable bunny Fig.  ...  Shape Representation by Zippables • 78:7 as Int( Fig. 11 .Fig. 12 . 1112 Fig. 11. The parameterization of the three topological cylinders of the T shape.  ... 
doi:10.1145/3197517.3201347 fatcat:i36l5253vbhoblpvbuv2axawby

Shape Representation by Zippable Ribbons [article]

Christian Schüller, Roi Poranne, Olga Sorkine-Hornung
2017 arXiv   pre-print
We propose an approach for shape representation through a single developable part that attaches to itself and requires no assembly instructions.  ...  We observe that the assembly of complex 3D shapes created by existing methods often requires first fabricating many small flat parts and then carefully following instructions to assemble them together.  ...  This work was supported in part by the ERC grant iModel (StG-2012-306877).  ... 
arXiv:1711.02450v1 fatcat:nztud3mopvg7bhjvqrwn3kbcce

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence [article]

Thorsten Wißmann, Stefan Milius, Lutz Schröder
2022 arXiv   pre-print
formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by  ...  In the base cases m = 0 and m = 1, there is nothing to show because every functor is 0-and 1-zippable, and for m = 2, the implication is trivial (zippability coincides with 2-zippability by definition)  ...  The signature of F 3-modalities for a functor F is Λ = { t /2 | t ∈ F 3}; that is, we write t for the syntactic representation of a binary modality for every t ∈ F 3.  ... 
arXiv:2203.11175v1 fatcat:7vrji4ojw5fmnclmollmwul35m

Efficient and Modular Coalgebraic Partition Refinement [article]

Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder
2020 arXiv   pre-print
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification.  ...  In this case, select(y, z) is thus essentially a characteristic function of the following shape: Definition 4.7.  ...  Of course, precise complexity bounds will then depend on the representation of nominal sets.  ... 
arXiv:1806.05654v5 fatcat:w3otus4ifraa5ml5uv4ulfsjke

Explaining Behavioural Inequivalence Generically in Quasilinear Time [article]

Thorsten Wißmann, Stefan Milius, Lutz Schröder
2021 arXiv   pre-print
formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by  ...  In the inductive step, given that F is 2-zippable, m-zippable (m ≥ 2), and cancellative, we show that F is (m + 1)-zippable.  ...  The signature of F 3-modalities for a functor F is Λ = {⌜t⌝/2 | t ∈ F 3}; that is, we write ⌜t⌝ for the syntactic representation of a binary modality for every t ∈ F 3.  ... 
arXiv:2105.00669v1 fatcat:ufeioqmq75dblcug2akrf67p6u

Efficient and Modular Coalgebraic Partition Refinement

Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder
2020 Logical Methods in Computer Science  
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification.  ...  In this case, select(y, z) is thus essentially a characteristic function of the following shape: Definition 4.7.  ...  Of course, precise complexity bounds will then depend on the representation of nominal sets.  ... 
doi:10.23638/lmcs-16(1:8)2020 fatcat:fty2as2kfzacjntpt3hqprtshu

Bidirectionalization for free! (Pearl)

Janis Voigtländer
2009 SIGPLAN notices  
Our solution is inspired by relational parametricity and uses free theorems for proving the consistency conditions. It works beautifully.  ...  bidirectional transformation consists of a function get that takes a source (document or value) to a view and a function put that takes an updated view and the original source back to an updated source, governed by  ...  I thank Joachim Breitner for his work on the automatic deriver for Zippable instances, the implementation of the online tool, his assistance with efficiency measurements, and general release support.  ... 
doi:10.1145/1594834.1480904 fatcat:n27zhhqhpbbyhgctk5jr3vpawe

From generic partition refinement to weighted tree automata minimization

Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder
2021 Formal Aspects of Computing  
Genericity is achieved by modelling transition types as functors on sets, and systems as coalgebras.  ...  We have implemented our algorithm in a generic tool that is easily instantiated to concrete system types by implementing a simple refinement interface.  ...  Internal representation of coalgebras New functors are added to the framework by implementing a refinement interface (Definition 3.5).  ... 
doi:10.1007/s00165-020-00526-z fatcat:fing7b2ibvcxhfpxs2nkutr2uy

From Generic Partition Refinement to Weighted Tree Automata Minimization [article]

Thorsten Wißmann, Hans-Peter Deifel, Stefan Milius, Lutz Schröder
2020 arXiv   pre-print
Genericity is achieved by modelling transition types as functors on sets, and systems as coalgebras.  ...  We have implemented our algorithm in a generic tool that is easily instantiated to concrete system types by implementing a simple refinement interface.  ...  Internal Representation of Coalgebras New functors are added to the framework by implementing a refinement interface (Definition 3.5).  ... 
arXiv:2004.01250v4 fatcat:4yooh6jlgjhinauj4gcvu7wtaq

Editors: Roland Meyer and Uwe Nestmann; Article No. 32

Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann, Ulrich Dorsch@fau, De, Lutz De, Thorsten De
2017 16 Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum für Informatik   unpublished
We present a generic partition refinement algorithm that quotients coalgebraic systems by be-havioural equivalence, an important task in reactive verification; coalgebraic generality implies in particular  ...  Since bisimilarity is a greatest fixpoint, it is more or less immediate that it can be calculated in polynomial time by approximating this fixpoint from above following Kleene's fixpoint theorem.  ...  Conclusions and Future Work We have presented a generic algorithm that quotients coalgebras by behavioural equivalence.  ... 
fatcat:3bludpylkzbvrc2qws7yya5itm

Letter to Matter and Various Incomprehensibilities—The Effective Ethicality of Scientific and Humanistic Interdisciplinarity

Gianfranco Minati
2021 Philosophies  
Such approaches more properly allow for effective philosophical representations of the world.  ...  Issues of incompleteness relate to the logical openness of complexity models in their nonequivalence and necessary non-zippable incompletable multiplicity.  ...  ., actions, behaviors, sensations, and shapes, such as through the effects of neurotransmitters such as dopamine.  ... 
doi:10.3390/philosophies6020026 fatcat:ergggioqwjb63iw4t6ghzqzbvq

On Theoretical Incomprehensibility

Gianfranco Minati
2019 Philosophies  
loop of incomprehensible–comprehensible, and by existential questions.  ...  We considered the theoretically incomprehensibility mostly in three main ways: as the inexhaustibility of the multiplicity of constructivist reality as given by the theoretically incomprehensible endless  ...  It is matter of non zippability in formal representations such as processes of emergence [26] and for representations and simulations carried out with sub-symbolic devices, such as neural networks for  ... 
doi:10.3390/philosophies4030049 fatcat:ml3rjty3pzhchob3zqvpuz4w2m

Geometric simple connectivity and finitely presented groups [article]

Valentin Poenaru
2014 arXiv   pre-print
Since our (1.1) is a REPRESENTATION, we have Ψ(f ) = Φ(f ) and then according to Lemma 2.4 in [29] our X 2 f −→ M (Γ) is zippable, i.e. the map f can be exhausted by a sequence of folding maps, more  ...  For given W ∞ , the M 2 (f ) ∩ W ∞ accumulates on tree-shaped figures ∞ = S 2 ∞ ∩ (S 1 × I) ∞ , (j) ≡ ∂H 1 i (γ j ) ⊂ X 2 | H 0 .  ...  Notice, also, that, with our trick of multiplying by [0, 1] and the quotienting at infinity ∂ ∞ × [0, 1] by the same [0, 1], the ∂ ∞ lives now at the infinity of S u (M (Γ) − H) II and/or ∂ S u (M (Γ)  ... 
arXiv:1404.4283v1 fatcat:mhggepbxobf37cfclwyogc5s2i

VAGABONDS AND THE VIRTUAL: IDENTITY, ECONOMICS AND ETHICS IN THE GENRE OF DIGITAL TRAVEL WRITING [article]

(:Unkn) Unknown, University, My, Eli Goldblatt
2020
Make sure you choose one with enough zippable pockets and storage spots for all your goodies."  ...  As should be obvious by now, Oneika has a very nuanced and reflective approach towards conceptions and representations of identity, certainly grown and developed over time with a life of travel.  ... 
doi:10.34944/dspace/302 fatcat:scv27brrmvgv7iyglae2l7ng3q