Miracle-dz/UniFAR-FTUs huggingface dataset:
Programming Distributed Computing Systems: A Foundational Approach

Starting from the premise that understanding the foundations of concurrent programming is key to developing distributed computing systems, this book first presents the fundamental theories of concurrent computing and then introduces the programming languages that help develop distributed computing systems at a high level of abstraction. The major theories of concurrent computation -- including the p-calculus, the actor model, the join calculus, and mobile ambients -- are explained with a focus on how they help design and reason about distributed and mobile computing systems. The book then presents programming languages that follow the theoretical models already described, including Pict, SALSA, and JoCaml. The parallel structure of the chapters in both part one (theory) and part two (practice) enable the reader not only to compare the different theories but also to see clearly how a programming language supports a theoretical model. The book is unique in bridging the gap between the theory and the practice of programming distributed computing systems. It can be used as a textbook for graduate and advanced undergraduate students in computer science or as a reference for researchers in the area of programming technology for distributed computing. By presenting theory first, the book allows readers to focus on the essential components of concurrency, distribution, and mobility without getting bogged down in syntactic details of specific programming languages. Once the theory is understood, the practical part of implementing a system in an actual programming language becomes much easier.
EMOTION DETECTION IN TASK-ORIENTED SPOKEN DIALOGS

Detecting emotions in the context of automated call center services can be helpful for following the evolution of the human-computer dialogs, enabling dynamic modification of the dialog strategies and influencing the final outcome. The emotion detection work reported here is a part of larger study aiming to model user behavior in real interactions. We make use of a corpus of real agent-client spoken dialogs in which the manifestation of emotion is quite complex, and it is common to have shaded emotions since the interlocutors attempt to control the expression of their internal attitude. Our aims are to define appropriate emotions for call center services, to annotate the dialogs and to validate the presence of emotions via perceptual tests and to find robust cues for emotion detection. In contrast to research carried out with artificial data with simulated emotions, for real-life corpora the set of appropriate emotion labels must be determined. Two studies are reported: the first investigates automatic emotion detection using linguistic information, whereas the second concerns perceptual tests for identifying emotions as well as the prosodic and textual cues which signal them. About 11% of the utterances are annotated with non-neutral emotion labels. Preliminary experiments using lexical cues detect about 70% of these labels.
Computing the smallest eigenpairs of the graph Laplacian

The graph Laplacian, a typical representation of a network, is an important matrix that can tell us much about the network structure. In particular its eigenpairs (eigenvalues and eigenvectors) incubate precious topological information about the network at hand, including connectivity, partitioning, node distance and centrality. Real networks might be very large in number of nodes (actors); luckily, most real networks are sparse, meaning that the number of edges (binary connections among actors) are few with respect to the maximum number of possible edges. In this paper we experimentally compare three state-of-the-art algorithms for computation of a few among the smallest eigenpairs of large and sparse matrices: the Implicitly Restarted Lanczos Method, which is the current implementation in the most popular scientific computing environments (Matlab \R), the Jacobi-Davidson method, and the Deflation Accelerated Conjugate Gradient method. We implemented the algorithms in a uniform programming setting and tested them over diverse real-world networks including biological, technological, information, and social networks. It turns out that the Jacobi-Davidson method displays the best performance in terms of number of matrix-vector products and CPU time.
Time Synchronization for Wireless Sensor Networks

With the help of recent technological advances in micro-electro-mechanical systems (MEMS) and wireless communications, low-cost, low-power, and multifunctional wireless sensing devices have been developed. When these devices are deployed over a wide geographical region, they can collect information about the environment and efficiently collaborate to process such information by forming a distributed communication network, called the wireless sensor network (WSN). WSN is a special case of wireless ad hoc network, and assumes a multihop communication framework with no common infrastructure, where the sensors spontaneously cooperate to deliver information by 13
Project-Team Dolphin ParadisEO-MO : From Fitness Landscape Analysis to Efficient Local Search Algorithms

This document presents a general-purpose software framework dedicated to the design, the analysis and the implementation of local search algorithms: ParadisEO-MO. A substantial number of single-solution based local search metaheuristics has been proposed so far, and an attempt of unifying existing approaches is here presented. Based on a fine-grained decomposition, a conceptual model is proposed and is validated by regarding a number of state-of-the-art methodologies as simple variants of the same structure. This model is then incorporated into the ParadisEO-MO software framework. This framework has proven its efficiency and high flexibility by enabling the resolution of many academic and real-world optimization problems from science and industry. Key-words: local search; metaheuristic; fitness landscapes; conceptual unified model; algorithm design, analysis and implementation; software framework ∗ École des Mines de Douai, département IA, 941 rue Charles Bourseul, BP 10838, 59508 Douai, France (jeremie.humeau@mines-douai.fr) † Université Lille 1, Laboratoire LIFL, UMR CNRS 8022, Cité scientifique, Bât. M3, 59655 Villeneuve d’Ascq cedex, France (arnaud.liefooghe@univ-lille1.fr) ‡ Université Lille 1, Laboratoire LIFL, UMR CNRS 8022, Cité scientifique, Bât. M3, 59655 Villeneuve d’Ascq cedex, France (talbi@lifl.fr) § Université Nice Sophia Antipolis, Laboratoire I3S, UMR CNRS 6070, 2000 route des Lucioles, BP 121, 06903 Sophia Antipolis cedex, France (verel@i3s.unice.fr) ha l-0 06 65 42 1, v er si on 1 1 Fe b 20 12 ParadisEO-MO: De l’analyse du paysage de fitness à des algorithmes de recherche locale efficaces Résumé : Ce document présente une plateforme logicielle polyvalente dédiée à la conception, l’analyse et l’implémentation d’algorithmes de recherche locale: ParadisEO-MO. Un nombre substantiel de métaheuristiques basées sur une solution unique a été proposé jusqu’à présent, et une tentative d’unifier les approches existantes est ici présentée. Basé sur une décomposition fine, un modèle conceptuel est proposé et validé par l’instantiation d’un grand nombre de méthodologies classiques comme des variantes simples de la même structure. Ce modèle est ensuite incorporé dans la plateforme logicielle ParadisEO-MO. Cette plateforme a prouvé son efficacité et sa grande flexibilité en permettant la résolution de nombreux problèmes d’optimisation académiques et du monde réel, des domaines de la science et de l’industrie. Mots-clés : recherche locale; métaheuristique; paysages de fitness; modèle conceptuel unifié; conception, analyse et implémentation d’algorithmes; plateforme logicielle ha l-0 06 65 42 1, v er si on 1 1 Fe b 20 12
Large scale terrain visualization using the restricted quadtree

Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale terrain data is still a problem for virtual reality systems. The graphics load has to be controlled by an adaptive surface triangulation and by taking advantage of different levels of detail. Furthermore, the dynamic management of the visible scene requires efficient access to the terrain database. All components must interact smoothly and efficiently to arrive at a high-performance visualization system. We describe triangulation, scene management and data handling that overcome all problems. The triangulation model is based on the restricted quadtree triangulation and extended to meet the different requirements. Moreover, we present new details of the restricted quadtree triangulation not mentioned previously in the literature. These include among others exact error calculation, progressive meshing, performance enhancements and spatial access. Index terms visualization, multiresolution triangulation, terrain database, geoinformation system
Direct Geometrico-static Problem of Underconstrained Cable-Driven Parallel Robots With  $n$ Cables

This paper studies the direct geometrico-static problem of underconstrained cable-driven parallel robots supported by n cables, with n ≤ 6. The task consists in identifying the equilibrium poses of the end-effector when cable lengths are specified. The problem is challenging, because the end-effector preserves some freedoms after cable lengths are assigned by motors. Hence, kinematics and statics are coupled, and they must be tackled simultaneously. A general method is presented to model the problem by a set of algebraic equations, and a least-degree univariate polynomial in the corresponding ideal is numerically found for any value of n. For the efficient computation of the solution set, a software package is developed, which implements an algorithm based on homotopy continuation. Distinctive features of the code are that it finds all problem solutions, including those with slack cables, and stability analysis is integrated in order to identify feasible configurations.
Customer-Centric Decision Support A Benchmarking Study of Novel Versus Established Classification Models Classification

Classification analysis contributes to the support of several corporate decision making tasks. In particular, the domain of customer relationship management comprises a variety of respective applications, which involve estimating some aspects of customer behavior. Whereas classical statistical techniques as well as decision tree models are routinely employed to approach such tasks, the use of modern techniques is still in its infancy. A major obstacle prohibiting a wider adoption of novel methods may be seen in the fact that their potential to improve decision quality in customer-centric settings has not yet been investigated. Therefore, this paper contributes to the literature by conducting an empirical study that compares the performance of modern to that of established classifiers as to their predictive accuracy and economic consequences. The observed results provide strong evidence for the value of modern techniques and identify one approach which appears to be particularly well suited for solving customer-centric classification problems.
The EU's Capacity to Lead the Transatlantic Alliance in AI Regulation

In the face of Chinese advances in AI in terms of technological prowess and influence, there has been a call for collaboration between the EU and the US to create a foundation for AI governance based on shared democratic beliefs. This paper maps out the EU, US, and Chinese approaches to AI development and regulation as we analyze the capacity of the US and EU to establish international standards for AI regulation through channels such as the TTC. As the EU rolled out a proportionate and risk-based approach to ensure stricter regulation for high-risk AI technologies, it laid the foundation for international rule-shaping in the AI domain. The important question is whether the EU can effectively collaborate with the US in response to China’s aggressive AI initiative and, more importantly, lead the transatlantic effort to become the “world-leading region on developing and deploying cutting-edge, ethical and secure AI. ”
A SPRank : Semantic Path-based Ranking for Top-N Recommendations using Linked Open Data

In most real world scenarios the ultimate goal of recommender system (RS) applications is to suggest a short ranked list of items, namely top-N recommendations, supposed to be the most appealing for the end user. Often, the problem of computing top-N recommendations is mainly tackled with a two steps approach. The system focuses first on predicting the unknown ratings which are eventually used to generated a ranked recommendation list. Actually, the top-N recommendation task can be directly seen as a ranking problem where the main goal is not to accurately predict ratings but directly find the best ranked list of items to recommend. In this paper, we present SPrank, a novel hybrid recommendation algorithm able to compute top-N recommendations exploiting freely available knowledge in the Web of Data. In particular we employ DBpedia, a well-known encyclopedic knowledge base in the Linked Open Data cloud, to extract semantic path-based features and to eventually compute top-N recommendations in a learning to rank fashion. Experiments with three datasets related to different domains (books, music and movies) prove the effectiveness of our approach compared to state-of-the-art recommendation algorithms.
Sixth International Joint Conference on Natural Language Processing Proceedings of the 11th Workshop on Asian Language Resources

Bilingual corpora play an important role as resources not only for machine translation research and development but also for studying tasks in comparative linguistics. Manual annotation of word alignments is of significance to provide a gold-standard for developing and evaluating machine translation models and comparative linguistics tasks. This paper presents research on building an English-Vietnamese parallel corpus, which is constructed for building a Vietnamese-English machine translation system. We describe the specification of collecting data for the corpus, linguistic tagging, bilingual annotation, and the tools specially developed for the manual annotation. An English-Vietnamese bilingual corpus of over 800,000 sentence pairs and 10,000,000 English words as well as Vietnamese words has been collected and aligned at the sentence level, and over 45,000 sentence pairs of this corpus have been aligned at the word level. Moreover, the 45,000 sentence pairs have been tagged using other linguistics tags, including word segmentation for Vietnamese text, chunker and named entity tags.
Synchronous grammars as tree transducers

Tree transducer formalisms were developed in the formal language theory community as generalizations of finite-state transducers from strings to trees. Independently, synchronous tree-substitution and -adjoining grammars arose in the computational linguistics community as a means to augment strictly syntactic formalisms to provide for parallel semantics. We present the first synthesis of these two independently developed approaches to specifying tree relations, unifying their respective literatures for the first time, by using the framework of bimorphisms as the generalizing formalism in which all can be embedded. The central result is that synchronous tree-substitution grammars are equivalent to bimorphisms where the component homomorphisms are linear and complete.
Friendship Prediction and Homophily in Social Media

(Article begins on next page) Anyone can freely access the full text of works made available as "Open Access". Works made available under a Creative Commons license can be used according to the terms and conditions of said license. Use of all other works requires consent of the right holder (author or publisher) if not exempted from copyright protection by the applicable law. Availability: This is the author's manuscript
A COMPARISON OF THE EXTENDED FINITE ELEMENT METHOD WITH THE IMMERSED INTERFACE METHOD FOR ELLIPTIC EQUATIONS WITH DISCONTINUOUS COEFFICIENTS AND SINGULAR SOURCES

reported numerical results for three examples using the immersed interface method (IIM) and the extended finite element method (X-FEM). The results presented for the IIM showed first-order accuracy for the solution and inaccurate values of the normal derivative at the interface. This was due to an error in the implementation. The purpose of this note is to present correct results using the IIM for the same examples used in that paper, which demonstrate the expected second-order accuracy in the maximum norm over all grid points. Results now indicate that on these problems the IIM and X-FEM methods give comparable accuracy in solution values. With appropriate interpolation it is also possible to obtain nearly second order accurate values of the solution and normal derivative at the interface with the IIM.
Stereo correspondence using an assisted discrete cosine transform method.

Many approaches have been taken towards the development of a compliant stereo correspondence algorithm that is capable of producing accurate disparity maps within a short period of time. There has been great progress over the past decade due to the vast increase in optimization techniques. Currently, the most successful algorithms contain explicit assumptions of the real world such as definitive differences in disparity among objects and constant textures within objects. This thesis starts by giving a brief description of disparity, along with descriptions of some common applications. Next, it explores various methods used in common stereo correspondence algorithms, as well as gives an in depth description and analysis of top performing algorithms. These algorithms are later used to compare with the proposed algorithm. In the proposed algorithm, frequency stereo correspondence in parallel with the traditional color intensity stereo correspondence is used to develop an initial disparity map. Frequency stereo correspondence is achieved using a winner-take-all block based Discrete Cosine Transform (DCT) to find the largest frequency components as well as their positions to use in disparity estimation. The proposed algorithm uses methods that are computationally inexpensive to reduce the computational time that plagues many of the common stereo correspondence algorithms. The proposed algorithm achieves an average correct disparity rate of 95.3%. This results in a disparity error rate of 4.07% compared to the top performing algorithms in the Middlebury website [1]; the DoubleBP, CoopRegion, AdaptingBP, and ADCensus algorithms that have error rates of 4.19%, 4.41%, 4.23%, and 3.97%, respectively. Additionally, experimental results demonstrate that the proposed algorithm is computationally efficient and significantly reduces the processing time that plagues many of the common stereo correspondence algorithms.
The Influence Of Bank Product Socialization And Electronic Payment System Quality On Intention To Use E-Money In Indonesia

This research aims to provide empirical evidence that bank product socialization and electronic payment system quality positively influence intention to use e-money. This research is important to be done for the sake of The Bank of Indonesia and all of Indonesian people because there are a lot of benefits would be acquired by a massive using of e-money. The population of this research is all of Indonesian people and the sample that taken for this research are 209 respondents from the college/ university students in Indonesia. The independent variables which are used in this research are bank product socialization and electronic payment system quality . Meanwhile, the dependent variable which is used in this research is intention to use e-money. The survey result which showed that the using level of e-money is very low which only 26% from all of the respondents indicates that The Bank of Indonesia have to increase the effort of bank product socialization and control the quality of electronic payment system.
ABSTRACT PAPER

In this paper a 5 to 9 GHz Low Noise Amplifier (LNA) with good gain and band pass property for Ultra Wide Band (UWB) applications designed using 0.18 μm CMOS technology . Therefore, we proposed a wideband input network with band pass capability UWB LNA . It uses a CMOS amplifier with 0.18 μm technology. We have achieved A good power gain and minimum noise figure for the core LNA.
ABSTRACT PAPER

In this paper Over the past few decades, world has witness significant progress in the area of wireless networking. Wireless networking is gradually replacing the wired networks. This paper surveys about IEEE 802.11 Wireless Local Area Networks in detail. Keywords— Wireless Local Area Network, IEEE802.11. ISSN: 2395 2180 Available online at http:// www.ijemmr. co.in International Journal of Engineering, Management & Medical Research (IJEMMR) Vol1 , Issue3, MARCH -2015
Statistical Relational Learning : Four Claims and a Survey

made significant progress over the last 5 years. We have successfully demonstrated the feasibility of a number of probabilistic models for rela-tional data, including probabilistic relational models, Bayesian logic programs, and relational probability trees, and the interest in SRL is growing. However, in order to sustain and nurture the growth of SRL as a subfield we need to refocus our efforts on the science of machine learning — moving from demonstrations to comparative and ablation studies. We will outline four assertions that are implicit to SRL research but which have been only minimally evaluated. We hope to stimulate discussion as to how, as a community, these claims can be addressed in future research.
Supporting application development in the Semantic Web

The Semantic Web augments the current WWW by giving information a well-de ned meaning, better enabling computers and people to work in cooperation. This is done by adding machine understandable content to web resources. Such added content is called metadata whose semantics is provided by referring to an ontology a domain's conceptualization agreed upon by a community. The Semantic Web relies on the complex interaction of several technologies involving ontologies. Therefore, sophisticated Semantic Web applications typically comprise more than one software module. Instead of coming up with proprietary solutions, developers should be able to rely on a generic infrastructure for application development in this context. We call such an infrastructure Application Server for the Semantic Web. The article discusses requirements and design issues of such a server. We also present our implementation KAON SERVER and demonstrate its usefulness by a detailed scenario.
Chapter 1 Resource-Based Web Applications

We present an approach to write web applications in the functional logic language Curry. Logic features are employed to provide type based conversion combinators for arbitrary datatypes. With a restricted version of these combinators our library can also be implemented in a purely functional language. The web applications we propose are directly based on the Hypertext Transfer Protocol (HTTP) – no additional protocol on top of HTTP is necessary. We provide a typed interface to HTTP that abstracts from the format used to transfer the data. Hence, we decouple a resource from its representation on the network.