A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Filters
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
[chapter]
2004
Lecture Notes in Computer Science
is equally expressive to the variant with parametric definitions. (2) The CCS variant with replication is equally expressive to that with recursive expressions and static scoping. ...
From (1) and the well-known fact that parametric definitions can replace injective relabelings, we show that injective relabelings are redundant (i.e., derived) in CCS (which has constant definitions only ...
We are indebted to Maurizio Gabbrielli, Jean-Jacques Lévy, Sergio Maffeis, Catuscia Palamidessi, Joachim Parrow, Rosario Pugliese and Davide Sangiorgi, for insightful discussions on the topics of this ...
doi:10.1007/978-3-540-24727-2_17
fatcat:bwkthpjjaneorddmyhazpqrv44
Decidability of Behavioral Equivalences in Process Calculi with Name Scoping
[chapter]
2012
Lecture Notes in Computer Science
The first class contains CCS Pdef , the full CCS with parametric definition (but without relabeling), which is known to be Turing complete. ...
an explicit operation such as parametric definition or relabeling, or by an implicit dynamic-scoping recursion. ...
The first class contains CCS Pdef , the full CCS with parametric definition (but without relabeling), which is known to be Turing complete. ...
doi:10.1007/978-3-642-29320-7_19
fatcat:itbbqzaci5eg3mwh4rkzhnztp4
Parametric channels via label expressions in CCS
1984
Theoretical Computer Science
Nevertheless, as it stands, it suffe*s from a limitation: it is impossible to determine at run time the channel on which to send or receive a communication. ...
There are various possibihties for giving CCS such ability, but the price can be a drastic change in the language and the thzoq of ccs. ...
Acknowledgment We are grateful to all the referees, both of the Conference paper and of the present one, for their careful comments, which have been of great help in making the presentation more readable ...
doi:10.1016/0304-3975(84)90102-6
fatcat:vtrgccv4qrcdbngt34jmwjwmve
Neutrino mass ordering and μ-τ reflection symmetry breaking
2017
Chinese Physics C, High Energy Physics & Nuclear Physics
If the neutrino mass spectrum turns out to be m^_3 < m^_1 < m^_2, one may choose to relabel it as m^'_1 < m^'_2 < m^'_3 such that all the masses of fundamental fermions with the same electrical charges ...
In this case the columns of the 3× 3 lepton flavor mixing matrix U should be reordered accordingly, and the resulting pattern U^' may involve one or two large mixing angles in the standard parametrization ...
conflict with previous studies based on very preliminary neutrino oscillation data [26] . ...
doi:10.1088/1674-1137/41/12/123103
fatcat:wudkqvmrszhotmaahpxdb7veoy
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
2009
International Journal of Computer Vision
[263][264][265][266][267][268][269][270][271] 1995), and show how the corresponding problems can be solved with sub-pixel accuracy using Parametric Maximum Flow techniques. ...
This provides interesting algorithms for computing crystalline curvature motion, possibly with a forcing term. ...
The first one relies on the push-relabel (PR) approach with the highest label strategy, a gap strategy and a global relabeling heuristics (that we implemented, see for instance Cormen et al. 2001 and ...
doi:10.1007/s11263-009-0238-9
fatcat:iix3k7f4srcbfooonsah5f3bty
Non-interleaving semantics for mobile processes
1999
Theoretical Computer Science
The presentation takes advantage of a parametric definition of process behaviour given in SOS style that permits us to take almost for free the interleaving theory and tools. ...
Finally, we extend our approach to higherorder n-calculus, enriched with a spurn operation. ...
The next one shows that [7,0c coincides with the relation introduced in [5] for pure CCS that has no value or name passing. . .
Proposltlon 5.2. CIOc c g.
Proof. ...
doi:10.1016/s0304-3975(99)80003-6
fatcat:krbt2aootjfsji234p6j3z625a
Page 3960 of Mathematical Reviews Vol. , Issue 91G
[page]
1991
Mathematical Reviews
There- fore the author considers C‘, the largest relation included in C which is a precongruence relation with respect to all the operators of CCS. ...
This relation, which is properly contained in the previous one, is preserved by the com- position, restriction, and relabelling operators, but not by prefixing and summation. ...
Extended transition systems for parametric bisimulation
[chapter]
1993
Lecture Notes in Computer Science
Theorem 3.1 (Soundness of Parametric BisimuLation on PTS) Given two CCS tenns l and t'. ...
U 1 (t 1 t) 1 (t + t) 1 t\a 1 t[$]1 rcc X.t with thc rcstriction that the term t in rcc X.t is well-guarded, and wherc $ is a relabelling function preserving -r and -. ...
,nk-I' nk> 01' T with 1«11;, ni+I» = 1:, O::; i::; k-1. AIso, no =1-1=> nk denotes no ~ ni <ni, ni+l> l1i+1 ~ n k , with l(,n;, l1i+I» = Jl.. Finally, we use no =s=> nk, with s = ÀIÀ2 ... ...
doi:10.1007/3-540-56939-1_102
fatcat:em36idztibgxznn7rwxuacihse
Programming with behaviors in an ML framework — The syntax and semantics of LCS
[chapter]
1994
Lecture Notes in Computer Science
LCS settled for a more conservative approach based on parametric channels as introduced in [1]; this permits to retain most of the underlying theory of CCS. ...
The language extends Standard ML with primitives for concurrency and communication based upon a higher order extension of the CCS formalism. Typechecking enforces consistency of communications. ...
Acknowledgments Didier Giraltt and Jean-Paul Gouyon worked intensively on the project in its early stages. ...
doi:10.1007/3-540-57880-3_6
fatcat:girobv6ucnh5bdzl5x75l2flxi
Contextual Imagined Goals for Self-Supervised Robotic Learning
[article]
2019
arXiv
pre-print
When the robot's environment and available objects vary, as they do in most open-world settings, the robot must propose to itself only those goals that it can accomplish in its present setting with the ...
We demonstrate that this enables self-supervised goal-conditioned off-policy learning with raw image observations in the real world, enabling a robot to manipulate a variety of objects and generalize to ...
It is trained by reconstructing states s with a parametrized encoder that converts the state into a normal random distribution q φ (z|s) with a parametrized decoder that converts the latent variable z ...
arXiv:1910.11670v1
fatcat:ph3y6vxupjdkvp7pjqof3p4uhu
Geometric morphometrics of nested symmetries: Hierarchical inter- and intra-individual variation in biological shapes
[article]
2018
bioRxiv
pre-print
The method therefore widens the research scope on developmental instability, canalization, developmental modularity and morphological integration. ...
Our results highlight the importance of characterising the full symmetry of a structure with nested symmetries. ...
Thereafter, a GPA is performed on the 181 full dataset which contains all original configurations and their respective transformed and 182 relabelled copies. ...
doi:10.1101/306712
fatcat:zbiyapdfsjfw5espdzqvjxjhg4
Algebraic calculi of processes and net expressions
1985
Theoretical Computer Science
A relabelling will be identified with the morphism it induces, so 2~, c Z,. ...
sorted on S (e.g., h, ---~bh.,, with tpu'= u and u'~ Z(S)). ...
doi:10.1016/0304-3975(85)90176-8
fatcat:l2ycfsyyindzdnqy6ooj2bkaxi
Toward an automatic segmentation of mitral valve chordae
2019
Medical Imaging 2019: Biomedical Applications in Molecular, Structural, and Functional Imaging
Examples of segmentation are provided on three porcine datasets. The reliability of the segmentation is proved with a dataset where the ground truth is available. ...
Simulating the procedure with a computer-based tool can greatly improve valve repair. ...
Blue ones have one CC and are equivalent to a disk, red ones have 2 CC and are equivalent to a tube, green ones have 3 CC and are equivalent to a bifurcation, black ones have 4 CC. ...
doi:10.1117/12.2511943
dblp:conf/mibam/PanichevaVB19
fatcat:g4oxd4kh6fdihjceijhyltcl7m
Insight does not come at random: Individual gray matter networks relate to clinical and cognitive insight in schizophrenia
2021
Progress in Neuro-psychopharmacology and Biological Psychiatry
The ability to take a critical perspective on one's symptoms (clinical insight) or views (cognitive insight) might depend especially on segregated specialized processing within distinct subnetworks. ...
Good insight has been suggested to depend on social cognitive and metacognitive abilities requiring global integration of brain signals. ...
Remco Renken for advice on data analysis, and the Center for Information Technology of the University of Groningen for their support and for providing access to the Peregrine high-performance computing ...
doi:10.1016/j.pnpbp.2021.110251
pmid:33493651
fatcat:gu3e67si5jc6pcnumkdcicvwuq
Corpus Callosum Subdivision Based on a Probabilistic Model of Inter-hemispheric Connectivity
[chapter]
2005
Lecture Notes in Computer Science
Its results are more stable than the Witelson subdivision scheme or other commonly applied schemes based on the CC bounding box. ...
The probabilistic subdivision is based on the distances of arc-length parameterized corpus callosum contour points to trans-callosal DTI fibers associated with an automatic lobe subdivision. ...
Correspondence via Fourier Descriptors (arc-length parametrization): The segmentation procedure yields Fourier coefficients with an inherent correspondence based on its arc-length parametrization. ...
doi:10.1007/11566489_94
fatcat:uxircjoelbd7hljsfghakpltam
« Previous
Showing results 1 — 15 out of 1,925 results