Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulatio...
—In this paper, we study a new family of carrier-hopping prime codes (CHPCs), so-called quadraticcongruence CHPC (QC-CHPC), with expanded code cardinality by relaxing the maximum...
Wing C. Kwong, Cheng-Yuan Chang, Hung-Ta Chen, Guu...
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
Many authors in the field of 3D human computer interaction have described the advantages of 3D user interfaces: Intuitive metaphors from daily life, immersive workspaces, virtual ...