In a recent paper entitled ‘Influences of Resource Limitations and Transmission Costs on Epidemic Simulations and Critical Thresholds in Scale-Free Networks’ by Huang et al., the authors attempted to establish a key characteristic of epidemic dynamics in a scale-free network when properly accounting for the cost of transmitting the infection at each node and the resources available for transmis...

The generation of a pleasant pitch contour is an important issue for the naturalness of each TTS system. Till now the results are far from being satisfactory. In this paper we present a speakerand task specific approach realized by a neural network. Personal and task specific characteristics are maintained and the demand of gcneralization decreases. So the results in application can signilicant...

For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption JxK with x of bit length `x and a public ‘modulus’ a of bit length `a outputs an encryption Jx mod aK. As a result, a protocol for computing an encrypted integer division Jxdiv aK is obtained. Surprisingly, efficiency of the protocol is independent of `x: the broadcast c...

Bottleneck analysis using queueing network models is an important technique for the performance analysis and capacity planning of computer and communication systems. Conventional single class as well as multiclass queueing network models use single mean values as input parameters. However, uncertainties and variabilities in service demands may exist in many models. This paper proposes to use ex...

Currently known basic anonymity techniques depend on identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a general lack of information (e.g. on the Internet), an adversary can participate several times in a communication relationship and observe the honest users. In this paper we focus on the problem of providing anonymity without id...

Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...

The important distinction between parameterized specifications and specifications of parameterized programs has been originally pointed out in [12]. An important difference concerns the objects which the two kinds of parameterization allow one to reuse. A parameterized specification, “PSP”, e.g., of stacks parameterized by elements, Stack(El), allows one, under some conditions, to instantiate t...

The development of new hydrological simulation tools allows for the modelling of large hydrological catchments, with the aim of comprehensive management of the water resources, control of diffuse pollution processes, such as the fate of agricultural fertilizants and finally, with purposes of economical optimization of the crop yields as a function of the expected climate, the watershed characte...

Combination strategies are test methods that generate test cases based on input parameter models. This paper suggests a structured modeling method used to translate requirements expressed in a general format into an input parameter model suitable for combination strategies. This paper also describes results from two initial experiments exploring the efficiency and effectiveness of the modeling ...

In this paper, we investigate the notion of transformation modules as a structuring principle for the speciication of graph transformation systems which provide a collection of operations on graphs. Based on the notion of transformation units, a concept that allows to specify binary relations on graphs, a transformation module consists of a set of transformation units. To be able to distinguish...