Ilham Kitouni - Academia.edu (original) (raw)

Papers by Ilham Kitouni

Applied Medical Informatics, 2020

We proposed in this paper an algorithm for fall detection using 2D RGB camera. Occlusion, fall, a... more We proposed in this paper an algorithm for fall detection using 2D RGB camera. Occlusion, fall, and common daily activities are separated from each other by machine learning algorithms, which were trained on features extracted by a deep learning-based computer vision algorithm. Person dection in videos is done using deep learing algorithm. The experimental validation of the proposed approach was conducted on two datasets, one public, and the second created localy. For evaluation, several assessment measures are computed. This evaluation shown effectiveness of the proposed solution.

Algeria. In this paper we present durational actions timed automata, DATA*, as a sub class of tim... more Algeria. In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA * is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is determinizable and closed under all Boolean operations. As result, the language inclusion problem is decidable. Then, we compare a durational actions timed automata to event recording automata, which is a determinizable sub class of the classical timed automata. Next, we propose a simple framework to aggregate region of DATA * for reducing its space state. This study is based on an aggregation region automata procedure to reduce the combinatorial explosion of regions. Finally, we discuss equivalence and validation of systems.

Timed automata with durational actions (daTA) are a form of timed automata that admit a more natu... more Timed automata with durational actions (daTA) are a form of timed automata that admit a more natural representation of durational actions and capturing true concurrency, with those additional benefits the kinds of properties to be verified on real-time systems will be enlarged. We present a novel approach to construct a region graph, based on the maximality semantics and preserving that specificity. More precisely, we renew the maximality capabilities on the region graph; we propose the MRG construction algorithm. We also describe an implementation of this construction (TaMaRG tool). The approach is illustrated by means a case study.

International Journal of Agricultural and Environmental Information Systems, 2016

Density in sensor networks often causes data redundancy, which is often the origin of high energy... more Density in sensor networks often causes data redundancy, which is often the origin of high energy consumption. Data collection techniques are proposed to avoid retransmission of the same data by several sensors. In this paper, the authors propose a new data collection strategy based on static agents and clustering nodes in wireless sensor network (WSN) for an efficient energy consumption called: Two-Level Data Collection Strategy (TLDC). It consists in two-level hierarchy of nodes grouping. The technique is based on an experience building to perform a reorganization of the groups. Cooperation between agents can be used to reduce the communication cost significantly, by managing the data collection smartly. In order to validate the proposed scheme, the authors use the timed automata (TA) model and UPPAAL engine to validate the proposed strategy; the results after and before reorganization are compared. They establish that the proposed approach reduces the cost of communication in the...

International Journal of Computer Applications, 2012

The increasing complexity of software is incessant, this phenomenon is even more accentuated when... more The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods. The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic) on real-time systems. The system behavior is expressed by temporal labeled systems; namely Durational Action Timed Automata model (DATA* model). This model supports the expression of the parallel behavior, the temporal and structural non-atomicity of actions and urgency. Our approach is to interpret the behavior described by DATA* to Timed Safety Automata. The environment UPPAAL allows us verifying quantitative temporal properties, especially the bounded liveliness.

International Journal of Agricultural and Environmental Information Systems, 2016

Applied Medical Informatics, 2020

We proposed in this paper an algorithm for fall detection using 2D RGB camera. Occlusion, fall, a... more We proposed in this paper an algorithm for fall detection using 2D RGB camera. Occlusion, fall, and common daily activities are separated from each other by machine learning algorithms, which were trained on features extracted by a deep learning-based computer vision algorithm. Person dection in videos is done using deep learing algorithm. The experimental validation of the proposed approach was conducted on two datasets, one public, and the second created localy. For evaluation, several assessment measures are computed. This evaluation shown effectiveness of the proposed solution.

Algeria. In this paper we present durational actions timed automata, DATA*, as a sub class of tim... more Algeria. In this paper we present durational actions timed automata, DATA*, as a sub class of timed automata. In the contrast of T.A, the underling semantic of DATA * is the maximality semantics which claim that actions have durations and true concurrency is captured differently from choice. DATA* model is in one hand useful for modeling and validating reel aspects of systems. In the other hand, it is determinizable and closed under all Boolean operations. As result, the language inclusion problem is decidable. Then, we compare a durational actions timed automata to event recording automata, which is a determinizable sub class of the classical timed automata. Next, we propose a simple framework to aggregate region of DATA * for reducing its space state. This study is based on an aggregation region automata procedure to reduce the combinatorial explosion of regions. Finally, we discuss equivalence and validation of systems.

Timed automata with durational actions (daTA) are a form of timed automata that admit a more natu... more Timed automata with durational actions (daTA) are a form of timed automata that admit a more natural representation of durational actions and capturing true concurrency, with those additional benefits the kinds of properties to be verified on real-time systems will be enlarged. We present a novel approach to construct a region graph, based on the maximality semantics and preserving that specificity. More precisely, we renew the maximality capabilities on the region graph; we propose the MRG construction algorithm. We also describe an implementation of this construction (TaMaRG tool). The approach is illustrated by means a case study.

International Journal of Agricultural and Environmental Information Systems, 2016

Density in sensor networks often causes data redundancy, which is often the origin of high energy... more Density in sensor networks often causes data redundancy, which is often the origin of high energy consumption. Data collection techniques are proposed to avoid retransmission of the same data by several sensors. In this paper, the authors propose a new data collection strategy based on static agents and clustering nodes in wireless sensor network (WSN) for an efficient energy consumption called: Two-Level Data Collection Strategy (TLDC). It consists in two-level hierarchy of nodes grouping. The technique is based on an experience building to perform a reorganization of the groups. Cooperation between agents can be used to reduce the communication cost significantly, by managing the data collection smartly. In order to validate the proposed scheme, the authors use the timed automata (TA) model and UPPAAL engine to validate the proposed strategy; the results after and before reorganization are compared. They establish that the proposed approach reduces the cost of communication in the...

International Journal of Computer Applications, 2012

The increasing complexity of software is incessant, this phenomenon is even more accentuated when... more The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods. The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic) on real-time systems. The system behavior is expressed by temporal labeled systems; namely Durational Action Timed Automata model (DATA* model). This model supports the expression of the parallel behavior, the temporal and structural non-atomicity of actions and urgency. Our approach is to interpret the behavior described by DATA* to Timed Safety Automata. The environment UPPAAL allows us verifying quantitative temporal properties, especially the bounded liveliness.

International Journal of Agricultural and Environmental Information Systems, 2016