http://sedici.unlp.edu.ar:80/handle/10915/386 2013-05-22T22:22:13Z 2013-05-22T22:22:13Z Abbas, Ash Mohammad http://sedici.unlp.edu.ar:80/handle/10915/9556 2012-05-08T22:00:33Z 2007-01-01T00:00:00Z

Revision Journal of Computer Science & Technology; vol. 7, no. 2

2007-01-01T00:00:00Z López, Ricardo A. http://sedici.unlp.edu.ar:80/handle/10915/9555 2012-05-03T13:13:42Z 2007-01-01T00:00:00Z

Revision Journal of Computer Science & Technology; vol. 7, no. 2

2007-01-01T00:00:00Z Rueda, Sonia Vivian García, Alejandro Javier Simari, Guillermo Ricardo http://sedici.unlp.edu.ar:80/handle/10915/9554 2012-05-03T13:13:42Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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 behavior of a collaborative BDI agent.

2007-01-01T00:00:00Z 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 behavior of a collaborative BDI agent. Boubetra, Abdelhak Belouadah, Hocine Mouhoub, Nassreddine http://sedici.unlp.edu.ar:80/handle/10915/9553 2012-05-03T13:13:43Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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.

2007-01-01T00:00:00Z 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. Palaniappan, Ramaswamy http://sedici.unlp.edu.ar:80/handle/10915/9552 2012-05-03T13:13:43Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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. Leave one out cross validation strategy reveals that alcoholics could be discriminated from non-alcoholics with accuracy of 94.55%. This pilot study has shown the potential of the method which could be further developed for use in automatic alcoholic screening procedures.

2007-01-01T00:00:00Z 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. Leave one out cross validation strategy reveals that alcoholics could be discriminated from non-alcoholics with accuracy of 94.55%. This pilot study has shown the potential of the method which could be further developed for use in automatic alcoholic screening procedures. Guezouri, Mustapha Mellouk, Abdelhamid http://sedici.unlp.edu.ar:80/handle/10915/9551 2012-05-03T13:13:43Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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.

2007-01-01T00:00:00Z 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 http://sedici.unlp.edu.ar:80/handle/10915/9550 2012-05-03T13:13:43Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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 O-GEHL predictor using the space saved from the sharing of hysteresis bits. Experimental results have confirmed that both schemes improve the accuracy of two different predictor configurations, leading to two promising research directions for future explorations.

2007-01-01T00:00:00Z 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 O-GEHL predictor using the space saved from the sharing of hysteresis bits. Experimental results have confirmed that both schemes improve the accuracy of two different predictor configurations, leading to two promising research directions for future explorations. Zegour, D. E. Hidouci, W. K. http://sedici.unlp.edu.ar:80/handle/10915/9549 2012-05-03T13:13:43Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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.

2007-01-01T00:00:00Z 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 http://sedici.unlp.edu.ar:80/handle/10915/9548 2012-05-03T13:13:44Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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 than TC, using SPECint2000 integer benchmarks.

2007-01-01T00:00:00Z 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 than TC, using SPECint2000 integer benchmarks. Chang, Kuei-Chung Hsieh, Tsung-Ming Chen, Tien-Fu http://sedici.unlp.edu.ar:80/handle/10915/9547 2012-05-03T13:13:44Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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 reconstructs these interlaced streams with these strides. Instead of sending the full address, the encoder may only send partial ad- dress or stride by using either one-hot or binary-inversion encoding. To exploit the locality and dynamically adjust the value of stride of active address streams, we partially compare the previous addresses of existing streams with the current address. Hence, the data transmitted on the bus can be minimally encoded. Experiments with several MediaBench benchmarks show that the scheme can achieve an average of 60% reduction in bus switching activity.

2007-01-01T00:00:00Z 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 reconstructs these interlaced streams with these strides. Instead of sending the full address, the encoder may only send partial ad- dress or stride by using either one-hot or binary-inversion encoding. To exploit the locality and dynamically adjust the value of stride of active address streams, we partially compare the previous addresses of existing streams with the current address. Hence, the data transmitted on the bus can be minimally encoded. Experiments with several MediaBench benchmarks show that the scheme can achieve an average of 60% reduction in bus switching activity. Assi, Ali Beg, Prasad Beg, Azam Prasad, V. C. http://sedici.unlp.edu.ar:80/handle/10915/9546 2012-05-03T13:13:44Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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 about the complexity of the circuit to be implemented. It also proves the computational capabilities of NNs in providing reliable classification of the complexity of Boolean functions.

2007-01-01T00:00:00Z 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 about the complexity of the circuit to be implemented. It also proves the computational capabilities of NNs in providing reliable classification of the complexity of Boolean functions. Foudil, Cherif Noureddine, Djedi http://sedici.unlp.edu.ar:80/handle/10915/9545 2012-05-03T13:13:44Z 2007-01-01T00:00:00Z

Articulo Journal of Computer Science & Technology; vol. 7, no. 2 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 intelligence to the agent. By providing an external control to guide crowd behaviors, this control is done by the user or by an autonomous agent called the guide. The main contribution of our approach is to combine these two ways of behaviors (autonomous, guide) in order to simulate the evacuation of a crowd in emergency situations. Many strategies of evacuation have been implemented and we will demonstrate that in most situations, the guided method decrease the average escape time and increase the chance of survival in emergency situations.

2007-01-01T00:00:00Z 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 intelligence to the agent. By providing an external control to guide crowd behaviors, this control is done by the user or by an autonomous agent called the guide. The main contribution of our approach is to combine these two ways of behaviors (autonomous, guide) in order to simulate the evacuation of a crowd in emergency situations. Many strategies of evacuation have been implemented and we will demonstrate that in most situations, the guided method decrease the average escape time and increase the chance of survival in emergency situations.