All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 11 Next

Displaying 201 – 220 of 235

Showing per page

Steady state and scaling limit for a traffic congestion model

Ilie Grigorescu, Min Kang (2010)

ESAIM: Probability and Statistics

In a general model (AIMD) of transmission control protocol (TCP) used in internet traffic congestion management, the time dependent data flow vector x(t) > 0 undergoes a biased random walk on two distinct scales. The amount of data of each component xi(t) goes up to xi(t)+a with probability 1-ζi(x) on a unit scale or down to γxi(t), 0 < γ < 1 with probability ζi(x) on a logarithmic scale, where ζi depends on the joint state of the system x. We investigate the long time behavior, mean field...

String distances and intrusion detection: Bridging the gap between formal languages and computer security

Danilo Bruschi, Giovanni Pighizzini (2006)

RAIRO - Theoretical Informatics and Applications

In this paper we analyze some intrusion detection strategies proposed in the literature and we show that they represent the various facets of a well known formal languages problem: computing the distance between a string x and a language L. In particular, the main differences among the various approaches adopted for building intrusion detection systems can be reduced to the characteristics of the language L and to the notion of distance adopted. As a further contribution we will also show that from...

Study of Queuing Systems with a Generalized Departure Process

Mirtchev, Seferin, Statev, Stanimir (2008)

Serdica Journal of Computing

This work was supported by the Bulgarian National Science Fund under grant BY-TH-105/2005.This paper deals with a full accessibility loss system and a single server delay system with a Poisson arrival process and state dependent exponentially distributed service time. We use the generalized service flow with nonlinear state dependence mean service time. The idea is based on the analytical continuation of the Binomial distribution and the classic M/M/n/0 and M/M/1/k system. We apply techniques based...

Synthesis of finite state machines for CPLDs

Robert Czerwiński, Dariusz Kania (2009)

International Journal of Applied Mathematics and Computer Science

The paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of twolevel minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach...

The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks

Krzysztof Walkowiak (2002)

International Journal of Applied Mathematics and Computer Science

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination...

The complexity of short schedules for uet bipartite graphs

Evripidis Bampis (2010)

RAIRO - Operations Research

We show that the problem of deciding if there is a schedule of length three for the multiprocessor scheduling problem on identical machines and unit execution time tasks in -complete even for bipartite graphs, i.e. for precedence graphs of depth one. This complexity result extends a classical result of Lenstra and Rinnoy Kan [5].

The MX/M/1 queue with working breakdown

Zaiming Liu, Yang Song (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, we consider a batch arrival MX/M/1 queue model with working breakdown. The server may be subject to a service breakdown when it is busy, rather than completely stoping service, it will decrease its service rate. For this model, we analyze a two-dimensional Markov chain and give its quasi upper triangle transition probability matrix. Under the system stability condition, we derive the probability generating function (PGF) of the stationary queue length, and then obtain its stochastic...

The Value of Knowing that You Do Not Know

Greenstein, Gil, Ahituv, Niv (2009)

Serdica Journal of Computing

The value of knowing about data availability and system accessibility is analyzed through theoretical models of Information Economics. When a user places an inquiry for information, it is important for the user to learn whether the system is not accessible or the data is not available, rather than not have any response. In reality, various outcomes can be provided by the system: nothing will be displayed to the user (e.g., a traffic light that does not operate, a browser that keeps browsing, a telephone...

Currently displaying 201 – 220 of 235