Abbas, Ash Mohammad
In this thesis, we emphasized the need to use multiple node-disjoint paths between a given source and destination. The use of node-disjoint paths not only allows different paths to share the trafﬁc, but also provides fault-tolerance to some extent. However, design of a distributed protocol that relies on partial topology information to identify multiple node-disjoint paths between a given pair of nodes is a challenging task. In this thesis, our main focus is to discuss protocols to discover node-disjoint paths between a given pair of nodes. The contributions of the thesis are as follows.
López, Ricardo A.
The book is intended to be used in an introductory and intermediate level course on computer networks, both whitin Computer Science and Electric Engineering scopes. One of its characteristics is that the entire research software is presented in Java, but with such simplicity that a student with basic knowledge of C or C++, would not have any difficulty in the analysis of the presented examples. One of the main differences of this book with respect to those dealing with similar topics is its top-down approach. That is, the description of computer networks begins with the model application layer, descending towards...
Rueda, Sonia Vivian; García, Alejandro Javier; Simari, Guillermo Ricardo
In a multi-agent system, a group of individ- uals interact in a social context in order to boost their capabilities and enhance global per- formance. Each individual's action repertoire may be reduced, but it's social capability allows it to interact with other agents and obtain collab- oration. This work offers an alternative for knowledge representation in a system of collaborative BDI agents and presents an interaction protocol based on dialogues. The capacity to interact affects the behavioral model of a BDI agent that must consider the possibility of offering and soliciting collaboration. Thus, we propose an algorithm that models the...
Boubetra, Abdelhak; Belouadah, Hocine; Mouhoub, Nassreddine
This paper is an attempt to define how a specific data structure might be used to store, in a persistent manner, temporal information during a computer simulation. In particular, it considers the sort of temporal information generated during a discrete event simulation of a system to which a relational data base exists and considers the demands this data makes on data base design.
Electrophysiological impairments of alcoholism have been researched extensively. However, there is none or few reported research on screening methods for chronic alcoholic subjects. Since chronic alcoholics have serious brain dysfunction, a method to screen for them during specific job applications that require good memory, concentration and/or decision making would be useful. In this paper, a method is proposed to discriminate chronic alcoholic from non-alcoholic subjects while they are sober. Energies of electroencephalogram signals in multiple gamma bands recorded while the subjects performed a picture recognition task are used as features by a neural network to detect the chronic alcoholic subjects....
Guezouri, Mustapha; Mellouk, Abdelhamid
Voice communications on IP networks use owner protocols as well as standards like SIP, MGCP and H323. In this paper we propose a new method for transparent traversal of NATed (Network Address Translated) networks for the SIP (Session Initiation Protocol) protocol. Although SIP is an application layer protocol, its operation is affected by address translation. This is because SIP uses network layer information (source IP and source port) that is lost by the NAT operation. The suggested method adapts dynamically one of the three solutions: Connection-Oriented media STUN or TURN depending on the situation occurring during call initiation.
Tiamkaew, Ekkasit; Kongmunvattana, Angkul
The O-GEHL branch predictor has outperformed other prediction schemes using the same set of benchmarks in an international branch prediction contest, CBP-1. In this paper, we present the analysis results on each of the OGEHL branch predictor tables and also on the optimal number of predictor tables. Two methods are subsequently proposed to help increase the O-GEHL prediction accuracy. The first one aims to increase the space utilization of the first predictor table by dynamically adjusting the lengths of branch history regarding to the type of a benchmark currently in execution. The second one adds an extra table into the...
Zegour, D. E.; Hidouci, W. K.
The work described in this paper is related to three areas in the programming world : logic, functional and object
programming. The main objective is essentially pedagogical since it is question here to make a synthesis on non procedural languages. To achieve this, we have considered many construction types, each one represents the one of evoked programming. Many fully-documented environments have been developed for writing constructions of any type, transforming them in order to evaluate them by showing the work really accomplished in the least detail.
Beg, Azam; Chu, Yul
In the past, instruction fetch speeds have been improved by using cache schemes that capture the actual program flow. In this paper, we elaborate on the architecture and operation of an instruction cache named Variable-Sized Block Cache (VSBC) that also makes use of the dynamic behavior of a program. Current trace-based cache schemes usually have some instructions stored repeatedly; this redundancy is eliminated in VSBC. Our cache also allows storage of basic blocks of arbitrary sizes, in multiple-way cache structure. An overall comparison of trace miss rate and average trace length shows VSBC to be a better performing cache scheme...
Chang, Kuei-Chung; Hsieh, Tsung-Ming; Chen, Tien-Fu
With the rapid increase in the complexity of chips and the popularity of portable devices, the performance demand is not any more the only important constraint in the embedded system. In stead, energy consumption has become one of the main design issues for contemporary embedded systems, especially for I/O interface due to the high capacitance of bus transition. In this paper, we propose a bus encoding scheme, which may reduce transitions by reconstructing active address streams with variable cached strides. The key idea is to obtain the variable strides for dierent sets of active addressing streams such that the decoder...
Assi, Ali; Beg, Prasad; Beg, Azam; Prasad, V. C.
This paper proposes a model that predicts the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to Binary Decision Diagrams (BDDs). The BPNN model (BPNNM) is developed through the training process of experimental data already obtained for XOR/XNOR-based Boolean functions. The outcome of this model is a unique matrix for the complexity estimation over a set of BDDs derived from Boolean expressions with a given number of variables and XOR/XNOR min-terms. The comparison results of the experimental and BPNNM underline the efficiency of this approach, which is capable of providing some useful clues...
Foudil, Cherif; Noureddine, Djedi
This paper describes a model for simulating crowds in real time. We deal with the hierarchy of the crowd, groups and individuals. The groups are the most complex structure that can be controlled in different degrees of autonomy. The autonomy means that the virtual agents are independent of the user intervention. Depending on the complexity of the simulation, some simple behaviors can be sufficient to simulate crowds. Otherwise, more complicated behaviors rules can be necessary in order to improve the realism of the animation. We present two different ways for controlling crowd behaviors: - by defining behavior rules, to give...