Sciweavers

TCS
2008
13 years 3 months ago
Swept regions and surfaces: Modeling and volumetric properties
We consider "swept regions" and "swept hypersurfaces"B in Rn+1 (and especially R3) which are a disjoint union of subspaces t = t or Bt = Bt obtained from a va...
James N. Damon
TCS
2008
13 years 3 months ago
Curves and surfaces represented by polynomial support functions
This paper studies shapes (curves and surfaces) which can be described by (piecewise) polynomial support functions. The class of these shapes is closed under convolutions, offsett...
Zbynek Sír, Jens Gravesen, Bert Jüttle...
TCS
2008
13 years 3 months ago
Making the use of maximal ideals constructive
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...
Ihsen Yengui
TCS
2008
13 years 3 months ago
On process rate semantics
We provide translations between process algebra and systems of chemical reactions. We show that the translations preserve discrete-state (stochastic) and continuous-state (concent...
Luca Cardelli
TCS
2008
13 years 3 months ago
Temporal constraints in the logical analysis of regulatory networks
Starting from the logical description of gene regulatory networks developed by R. Thomas, we introduce an enhanced modelling approach based on timed automata. We obtain a refined ...
Heike Siebert, Alexander Bockmayr
TCS
2008
13 years 3 months ago
GemCell: A generic platform for modeling multi-cellular biological systems
The mass and complexity of biological information requires computer-aided simulation and analysis to help scientists achieve understanding and guide experimentation. Although livi...
Hila Amir-Kroll, Avital Sadot, Irun R. Cohen, Davi...
TCS
2008
13 years 3 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum
TCS
2008
13 years 3 months ago
A characterization of fine words over a finite alphabet
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smalle...
Amy Glen