Cache aware data laying for the Gauss-Seidel smoother.
Chaotic time series analysis.
Charge stationnaire d'une file d'attente à rejet. Application au cas indépendant
Classification Trees as a Technique for Creating Anomaly-Based Intrusion Detection Systems
Intrusion detection is a critical component of security information systems. The intrusion detection process attempts to detect malicious attacks by examining various data collected during processes on the protected system. This paper examines the anomaly-based intrusion detection based on sequences of system calls. The point is to construct a model that describes normal or acceptable system activity using the classification trees approach. The created database is utilized as a basis for distinguishing...
Collaborative power management in WPANs using rational controllers: a case study.
Combination of mobile agent and evolutionary algorithm to optimize the client transport services
This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it completely....
Communication Models: An Educational Framework for Parallel Programming
Computational aspects of lucidity-driven graph clustering.
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computational schemes for two exponential servers where the first has a finite buffer
We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...
Computer Network Design Problems
Concentration of measure and isoperimetric inequalities in product spaces
Congestion optimale du plongement de l’hypercube dans la chaîne
Cost analysis of a queueing system with two service facilities
Cutwidth of iterated caterpillars
The cutwidth is an important graph-invariant in circuit layout designs. The cutwidth of a graph G is the minimum value of the maximum number of overlap edges when G is embedded into a line. A caterpillar is a tree which yields a path when all its leaves are removed. An iterated caterpillar is a tree which yields a caterpillar when all its leaves are removed. In this paper we present an exact formula for the cutwidth of the iterated caterpillars.
Cutwidth of the -dimensional mesh of -ary trees
Cutwidth of the r-dimensional Mesh of d-ary Trees
We prove that the cutwidth of the r-dimensional mesh of d-ary trees is of order , which improves and generalizes previous results.