Ali Ibrahim Awada

Full professor
Computer Science - Statistics department - Section I - Hadath
Speciality: Computer Science
Specific Speciality: Informatique

Publications 15 publications
Antoun Yaacoub and Ali Awada Inference Control on Information Flow in Logic Programming International Journal of Computer Science: Theory and Application 2015

This paper proposes a formal representation of inference control on information flow theory in logic programming. In order to control the fact that the result returned by a query can convey confidential information, we propose the notion of indistinguishability of flow and elaborate definitions of protection mechanisms, secure mechanisms, precise mechanisms and confidentiality policies based on this notion. We give a secure and precise protection mechanism that prohibits any undesirable inferences and minimizes the number of denials of legitimate actions.

Antoun Yaacoub, Ali Awada, Habib Kobeissi Information Flow in Concurrent Logic Programming British Journal of Mathematics & Computer Science 2015

This paper presents a new formalization of information flow detection in concurrent logic programming and applies it to the problem of deadlock detection. This work is based on a recent study of the detection of information flow in Datalog programs. Firstly, we define the concept of information flow in concurrent logic programming. Then, we propose a set of definitions of flow based on observation and transition systems while solving goals. Finally, we formalize a mechanism for deadlock detection in concurrent logic programs.

Philippe Saade, Philippe Joly, Ali Awada Simulating actions for learning 2013

This paper presents a novel approach for generating new actions to learn supervised algorithms such as the Adaboost in the context of human action recognition. Indeed, the learning process requires a large amount and variety of data. Our motivation in this work is to reduce the dependency on public databases and allow learning with small sets of actions. We overcome the problem of nondiscriminatory action datasets for action recognition by enlarging a set of actions performed by different persons in different ways and captured by a Kinect. We present a way to enlarge the originally captured dataset from a Kinect device or from simply annotated data. This is done by combining the extrema of the action sequences into intervals, creating random points within them, and adding certain variables to discriminate the samples. These actions are learned and tested with a late fusion Adaboost using simple features and a strong classifier for each joint. Finally, a confidence coefficient is calculated and used as input of a higher level Adaboost classifier.

Ali Awada, Philippe Balbiani, Antoun Yaacoub Information flow in logic programming 2011

This paper proposes a theoretical foundation of what could be an information flow in logic programming. Several information flow definitions (based on success/failure, substitution answers, bisimulation between resolution trees of goals) are stated and compared. Decision procedures are given for each definition and complexity is studied for specific classes of logic programs.

Ali Awada, May Dehayni, Antoun Yaacoub An ATMS-based tool for locating honor cards in Rubber Bridge 2011

This paper deals with the problem of providing assistance to a Bridge player using Artificial Intelligence techniques. In order to achieve this goal, we propose an approach that consists in making assumptions about the honor cards location, then to gradually eliminating the inconsistent assumptions until locating all honor cards. Based on the bids, assumptions about honor cards distribution are made using abduction reasoning. The consistency of these assumptions is managed by an Assumption-based Truth Maintenance System (ATMS). As the game progresses, playing a card generates facts, thereby invalidating some assumptions that cause contradiction and transforming some others into facts corresponding to the location of honor cards.

Antoun Yaacoub, Ali Awada, May Dehayni Visualizing relationships in Hierarchical Small World Networks 2010

This research provides a method for studying and visualizing different types of relationships in various worlds such as dictionaries and Web pages. As a first step, we identify different types of relationships between objects of the universes previously mentioned. The second step consists in developing a method to quantify the relationship to study. The constituents of the universe (Web pages, items associated with entries in a dictionary ...) form a HSWN graph (hierarchical small world network) whose nodes are entities and edges reflect a direct link (hypertext, definitional ...) between two nodes. This leads to introduce a method for studying the structure of large graphs of hierarchical small world type. Our approach is based on the use of Markovian matrices. A matrix is multiplied k times in order to quantify the relationship between all the nodes of the graph. To illustrate this approach, examples and results on Web and linguistic graphs are given.

May Dehayni, Kablan Barbar, Ali Awada, Mohamed Smaili Some model transformation approaches: a Qualitative Critical Review 2009

Model-to-model transformation is a critical activity in Model Driven Engineering. In this paper, we will classify the existing model transformation approaches and propose a set of criteria characterizing different approaches. We will discuss the criteria according to their transformation expressivity power and implementation and parsing strategy techniques. We have proposed in a system for the transformation [1] of information system models based on the formalism of attribute grammars. This formalism has been developed by Knuth for the specification and implementation of static semantic aspects of [2,3] programming languages. Since then, it has matured into a recognized field of study with many applications . The goal of this contribution is to guide the model transformer when it comes to undertaking a [4,5] transformation, while taking into account some existing facilities and constraints.

Ali Awada, May Dehayni Grouping dictionary synonyms in sense components 2009

In this paper, a study of the synonymy in a dictionary of verbs is presented and a new approach to solve the polysemy problem is proposed. More precisely, it is about dispatching verb synonyms in groups called “sense components”, each corresponding to a verb meaning. The dictionary is represented as a graph and the sense component is obtained by studying circuits in this graph. This study is based on the following idea: verbs on a circuit may/must belong to the same component of sense. Our study has resulted in a graphical interface for automatic dictionary exploitation.

Fadia Nemer, Hugues Cassé, Pascal Sainrat, Ali Awada Improving the Worst-Case Execution Time Accuracy by Inter-Task Instruction Cache Analysis 2007

In hard real-time applications, WCET is used to check time constraints of the whole system but is only computed at the task level. While most WCET computation methods assume a conservative approach to handle the processor state before the execution of a task, the inter-task analysis of long effect hardware facilities should improve the accuracy of the result. As an example, we developed an analysis of a direct-mapped instruction cache behavior, that combines inter-and intra-task instruction cache analysis to estimate more accurately the number of cache misses due to task chaining by considering task entry and exit states along the inter-task analysis. The initial tasks WCET can be computed by any existing single-task approach that models the instruction cache behavior.

Ali Awada An approach to classify synonyms in a dictionary of verbs 2005

Several works in computational linguistics try to study the relationships among dictionary entries. These works consider the dictionary as a graph where words are represented by vertices and relationships between two words by an arrow between the corresponding vertices. Several kinds of relationships exist between two words such as synonymy, antonymy, hyperonymy, hyponymy … We define the proximity of meaning between two words as the power of synonymy between them. In order to characterize this proximity, we focus our study on path length, circuits, and connected components in the dictionary graph. However, this study encounters frequently the polysemy problem that puts together different word acceptations. The aim of this paper is to solve this problem and proposes an algorithm to measure this proximity.

Ali Awada, Bilal Chebaro Etude de la synonymie par l’extraction de composantes N-connexes dans les graphes de dictionnaires 2004

Résumé La synonymie est l'un des aspects fondamentaux de l'informatique linguistique. Elle se ramène en général à étudier les dictionnaires de langues. Cependant, son étude se heurte très souvent au problème de la polysémie qui a pour effet de rapprocher les synonymes de différentes acceptions d'un même verbe. Cet article tente de résoudre ce problème en définissant la N-connexité comme nouveau critère de regroupement des verbes synonymes ainsi que la synonymétrie comme notion de mesure de la proximité de sens et propose un algorithme de mesure de cette proximité.

Ali Awada, Fabrice Evrard Copilote électronique pour la conduite automobile Editions Octarès 1994

Ali Awada, Fabrice Evrard, Eric Jacoboni Pilot - Copilot communication acts 1991

Ali Awada, Fabrice Evrard, Eric Jacoboni Communication management in computerized copiloting 1991

Marc Blaquiere, Fabrice Evrard, Ali Awada A real time interpretation model Springer 1991

The monitoring of a real time process generally implies a reasoning on temporal events where time, duration, order, long term dependancies etc… have to be modelled.[4] Monitoring a process does not only mean to reason on what has been collected in a facts database, but also to follow dynamically what is happening through a set of axioms. Indeed it should be possible to describe what is in action, as well as what could possibly occur in the future resulting from these actions. For a given axiomatic, including inference rules like modus ponens and necessitation, we think that the time dependent management of these inference rules, applied on formulas, is not neutral for a demonstration result. This means that this management will have an effect on the validity of the formula which is being evaluated. We first show how a certain reasoning on temporal events can be more or less handled by different demonstration methods. Grammars, classical, temporal or default logics demonstrators are reviewed to point out the importance of the demonstration itself towards the logic used. Based on the aspect of controlling a certain order of evaluation, we propose a formalism in which the inference control is clearly syntaxically expressed in rules. In consequence, contrary to usual resolution, the plan of a formula demonstration is specifically constructed from the formula itself. This planning approach explicitly gives the method to assemble elementary stages of demonstration.


Professional working proficiency


Native or bilingual proficiency