Genetic approach for arabic part of speech tagging

With the growing number of textual resources available, the ability to understand them becomes critical. An essential first step in understanding these sources is the ability to identify the part of speech in each sentence. Arabic is a morphologically rich language, wich presents a challenge for part of speech tagging. In this paper, our goal is to propose, improve and implement a part of speech tagger based on a genetic alorithm. The accuracy obtained with this method is comparable to that of other probabilistic approaches.Comment: 12 pages, 8 figure

An Optimal Smart Market for the Pricing of Telecommunications Services

In [7], Mackie-Mason and Varian suggested the creation of a Smart market for the pricing of Internet services, based on the idea of having a Vickrey-ty- pe auction, at the packet level, at each node of the network. While this idea has attracted the attention of numerous researchers, in telecommunication- s and in economics, no optimization model has to date been proposed that captures this behavior. In this paper, we present such a mathematical model. We provide techniques for solving the model through an equivalent linear transformation, and present some numerical experience on sample networks

A BERT-GRU Model for Measuring the Similarity of Arabic Text

Semantic Textual Similarity (STS) aims to assess the semantic similarity between two pieces of text. As a challenging task in natural language processing, various approaches for STS in high-resource languages, such as English, have been proposed. In this paper, we are concerned with STS in low resource languages such as Arabic. A baseline approach for STS is based on vector embedding of the input text and application of similarity metric on the embedding space. In this contribution, we propose a cross-encoder neural network (Cross-BERT-GRU) to handle semantic similarity of Arabic sentences that benefits from both the strong contextual understanding of BERT and the sequential modeling capabilities of GRU. The architecture begins by inputting the BERT word embeddings for each word into a GRU cell to model long-term dependencies. Then, max pooling and average pooling are applied to the hidden outputs of the GRU cell, serving as the sentence -pair encoder. Finally, a softmax layer is utilized to predict the degree of similarity. The experiment results show a Spearman correlation coefficient of around 0.9 and that Cross-BERT-GRU outperforms the other BERT models in predicting the semantic textual similarity of Arabic sentences. The experimentation results also indicate that the performance improves by integrating data augmentation techniques

Multi-agent Adaptive Architecture for Flexible Distributed Real-time Systems

Recent critical embedded systems become more and more complex and usually react to their environment that requires to amend their behaviors by applying run-time reconfiguration scenarios. A system is defined in this paper as a set of networked devices, where each of which has its own operating system, a processor to execute related periodic software tasks, and a local battery. A reconfiguration is any operation allowing the addition-removal-update of tasks to adapt the device and the whole system to its environment. It may be a reaction to a fault or even optimization of the system functional behavior. Nevertheless, such scenario can cause the violation of real-time or energy constraints, which is considered as a critical run-time problem. We propose a multi-agent adaptive architecture to handle dynamic reconfigurations and ensure the correct execution of the concurrent real-time distributed tasks under energy constraints. The proposed architecture integrates a centralized scheduler agent (ScA) which is the common decision making element for the scheduling problem. It is able to carry out the required run-time solutions based on operation research techniques and mathematical tools for the system's feasibility. This architecture assigns also a reconfiguration agent (RA p ) to each device p to control and handle the local reconfiguration scenarios under the instructions of ScA. A token-based protocol is defined in this case for the coordination between the different distributed agents in order to guarantee the whole system's feasibility under energy constraints.info:eu-repo/semantics/publishedVersio

Programmation mathématique en tomographie discrète

La tomographie est un ensemble de techniques visant à reconstruirel intérieur d un objet sans toucher l objet lui même comme dans le casd un scanner. Les principes théoriques de la tomographie ont été énoncéspar Radon en 1917. On peut assimiler l objet à reconstruire à une image,matrice, etc.Le problème de reconstruction tomographique consiste à estimer l objet àpartir d un ensemble de projections obtenues par mesures expérimentalesautour de l objet à reconstruire. La tomographie discrète étudie le cas où lenombre de projections est limité et l objet est défini de façon discrète. Leschamps d applications de la tomographie discrète sont nombreux et variés.Citons par exemple les applications de type non destructif comme l imageriemédicale. Il existe d autres applications de la tomographie discrète, commeles problèmes d emplois du temps.La tomographie discrète peut être considérée comme un problème d optimisationcombinatoire car le domaine de reconstruction est discret et le nombrede projections est fini. La programmation mathématique en nombres entiersconstitue un outil pour traiter les problèmes d optimisation combinatoire.L objectif de cette thèse est d étudier et d utiliser les techniques d optimisationcombinatoire pour résoudre les problèmes de tomographie.The tomographic imaging problem deals with reconstructing an objectfrom a data called a projections and collected by illuminating the objectfrom many different directions. A projection means the information derivedfrom the transmitted energies, when an object is illuminated from a particularangle. The solution to the problem of how to reconstruct an object fromits projections dates to 1917 by Radon. The tomographic reconstructingis applicable in many interesting contexts such as nondestructive testing,image processing, electron microscopy, data security, industrial tomographyand material sciences.Discete tomography (DT) deals with the reconstruction of discret objectfrom limited number of projections. The projections are the sums along fewangles of the object to be reconstruct. One of the main problems in DTis the reconstruction of binary matrices from two projections. In general,the reconstruction of binary matrices from a small number of projections isundetermined and the number of solutions can be very large. Moreover, theprojections data and the prior knowledge about the object to reconstructare not sufficient to determine a unique solution. So DT is usually reducedto an optimization problem to select the best solution in a certain sense.In this thesis, we deal with the tomographic reconstruction of binaryand colored images. In particular, research objectives are to derive thecombinatorial optimization techniques in discrete tomography problems.PARIS-CNAM (751032301) / SudocSudocFranceF

A lagrangean-based heuristics for the target covering problem in wireless sensor network

-----------

A 4-day or a 3-day workweeks scheduling problem with a given workforce size

This paper presents an exact decomposition approach for an employee days-off schedulingproblem of an homogeneous workforce under serval realistic days-off scheduling constraints. These constraints includethe following: (1) each employee is assigned to three or four consecutive days-off per week, (2) each employee is assigned at least four consecutive days-offper month and (3) each employee is assigned at least a weekend off per month. A three-step decomposition method is used to obtain the work assignments while respecting thelabor demands and the stated constraints