Miracle-dz/UniFAR-FTUs huggingface dataset:
Enhanced Markovian Model for Image Retrieval Using Synonymous Keywords

Image indexing and retrieval has been an active research area for more than a decade. Even if many achievements have been made in this region, it is a challenging issue and mile from being solved. Classical content-based approaches make use of queries based on image examples or image attributes like color and structure, and images are retrieved according to the similarity of each target image with the query image. Despite, image query based retrieval systems do not really capture the semantics or meanings of images well. Furthermore, image queries are difficult and inconvenient to form for most users. Annotation based image retrieval is one of the promising image retrieval technique because of its power to represent user queries and semantic substance of images. There are many way presented for annotation-based retrieval as well as automatic annotation indexing of images. Currently Markov chain based process, Markovian Semantic Indexing is popularized which is efficient as compared to all previous methods. In this the user propose a unique methodology for classification and annotation-based retrieval of pictures. The new technique is also applicative in the context of an online image retrieval system. The new process is shown to possess bound theoretical blessings and additionally to attain higher precision versus Recall results compared to existing technique of Markovian Semantic Indexing in Annotation Based Image Retrieval. The proposed system extends
Pipeline Orchestration for Test Automation using Extended Buildbot Architecture

Whenever developers do any changes into code base of software, they want to see effect of changes quickly, Continuous Integration can solve this problem. In recent software development where agile methodology is followed turnaround time for software is less, this leads to availability of less time to develop, build and test processes. Test Orchestration methodology can be used to reduce testing efforts and time. Test Orchestration in broad sense is a tests execution step by step in automated fashion, where different type of tests will executes like Junit tests, Integration tests, Sniff tests, Acceptance tests and so on. Here tests are selected dynamically based on developer’s check-ins. For Junit tests, we have extended Buildbot architecture which is a master/slave architecture, with a single central server and multiple build slaves. The objective of this paper is to develop distributed architecture for test orchestration. All higher level tests like functional tests, sniff tests and performance tests will execute in pipeline, finally result of all tests will send to developer through email.
Modelos y métricas para evaluar calidad de software

Estayno, Marcelo(1); Dapozo, Gladys (2); Cuenca Pletch Liliana (3), Greiner, Cristina (2) (1) Departamento de Informática. Facultad de Ingeniería. Universidad Nacional de Lomas de Zamora mestayno@fibertel.com. ar (2)Departamento de Informática. Facultad de Ciencias Exactas y Naturales y Agrimensura Universidad Nacional del Nordeste {gndapozo, cgreiner}@exa.unne. edu.ar (3)Departamento de Ingeniería en Sistemas de Información. Facultad Regional Resistencia Universidad Tecnológica Nacional cplr@frre.utn. edu.ar
Proceedings of the 2015 International Conference on Compilers, Architecture and Synthesis for Embedded Systems

Welcome to the 2015 Conference on Compilers, Architectures and Synthesis for Embedded Systems -- CASES'15! We are very proud to continue the CASES tradition of bringing a unique focus on the intersection of architecture and compilers to Embedded Systems Week (ESWEEK). CASES has served this purpose since 2006 when it first formed part of the three core conferences that comprise ESWEEK.
SNOMED CT Implementation

Summary Clinical practice as well as research and quality-assurance benefit from unambiguous clinical information resulting from the use of a common terminology like the Systematized Nomenclature of Medicine – Clinical Terms (SNOMED CT). A common terminology is a necessity to enable consistent reuse of data, and supporting semantic interoperability. Managing use of terminology for large cross specialty Electronic Health Record systems (EHR systems) or just beyond the level of single EHR systems requires that mappings are kept consistent. The objective of this study is to provide a clear methodology for SNOMED CT mapping to enhance applicability of SNOMED CT despite incompleteness and redundancy. Such mapping guidelines are presented based on an in depth analysis of 14 different EHR templates retrieved from five Danish and Swedish EHR systems. Each mapping is assessed against defined quality criteria and mapping guidelines are specified. Future work will include guideline validation.
OPTIMIZATION TECHNIQUES AND NEW METHODS FOR BROADCAST ENCRYPTION AND TRAITOR TRACING SCHEMES

OPTIMIZATION TECHNIQUES AND NEW METHODS FOR BROADCAST ENCRYPTION AND TRAITOR TRACING SCHEMES Murat Ak Ph.D. in Computer Engineering Supervisor: Assist. Prof. Dr. Ali Aydin Selcuk December, 2012 In the last few decades, the use of digital content increased dramatically. Many forms of digital products in the form of CDs, DVDs, TV broadcasts, data over the Internet, entered our life. Classical cryptography, where encryption is done for only one recipient, was not able to handle this change, since its direct use leads to intolerably expensive transmissions. Moreover, new concerns regarding the commercial aspect arised. Since digital commercial contents are sold to various customers, unauthorized copying by malicious actors became a major concern and it needed to be prevented carefully. Therefore, a new research area called digital rights management (DRM) has emerged. Within the scope of DRM, new cryptographic primitives are proposed. In this thesis, we consider three of these: broadcast encryption (BE), traitor tracing (TT), and trace and revoke (T&R) schemes and propose methods to improve the performances and capabilities of these primitives. Particularly, we first consider profiling the recipient set in order to improve transmission size in the most popular BE schemes. We then investigate and solve the optimal free rider assignment problem for one of the most efficient BE schemes so far. Next, we attempt to close the non-trivial gap between BE and T&R schemes by proposing a generic method for adding traitor tracing capability to BE schemes and thus obtaining a T&R scheme. Finally, we investigate an overlooked problem: privacy of the recipient set in T&R schemes. Right now, most schemes do not keep the recipient set anonymous, and everybody can see who received a particular content. As a generic solution to this problem, we propose a method for obtaining anonymous T&R scheme by using anonymous BE schemes as a primitive.
A study on traffic modeling in ubiquitous cloud

The Ubiquitous Cloud is a concept of large-scale information service network as a social infra-structure. It is featured by real-world context information extraction, user information profiling and self-cofiguration/-control of network. The objective of the research is to evaluate the network traffic theoretically and thus give a guideline of network design. In this paper, we especially consider those traffic factors that are related to movement of mobile users and rea-time services, and thus discuss some necessary requirements for the network specification.
Distributed Arithmetic Adaptive Digital Filter Using FPGA

This paper proposes a design and implementation of transversal adaptive digital filter using LMS (Least Mean Squares) adaptive algorithm. The filter structure is based on Distributed Arithmetic (DA) which is able to calculate the inner product by shifting and accumulating of partial products and storing in look-up table, also the desired adaptive digital filter will be multiplierless filter. In addition, the hardware implementation uses VHDL (Very high speed integrated circuit Hardware Description Language) and synthesis using FLEX10K Altera FPGA (Field Programmable Gate Array) as target technology and uses Leonardo Spectrum and MAX+plusII program for overall development. The results of this design are shown that the speed performance and used area of FPGA. The experimental results are presented to demonstrate the feasibility of the desired adaptive digital filter.
The acquisition of agreement in four Mayan languages

This paper presents results of a comparative project documenting the development of verbal agreement inflections in children learning four different Mayan languages: K’iche’, Tzeltal, Tzotzil, and Yukatek. These languages have similar inflectional paradigms: they have a generally agglutinative morphology, with transitive verbs obligatorily marked with separate cross-referencing inflections for the two core arguments (‘ergative’ and ‘absolutive’). Verbs are also inflected for aspect and mood, and they carry a ‘status suffix’ which generally marks verb transitivity and mood. At a more detailed level, the four languages differ strikingly in the realization of cross-reference marking. For each language, we examined longitudinal language production data from two children at around 2;0, 2;6, 3;0, and 3;6 years of age. We relate differences in the acquisition patterns of verbal morphology in the languages to (1) the placement of affixes, (2) phonological and prosodic prominence, (3) language-specific constraints on the various forms of the affixes, and (4) consistent vs. split ergativity, and conclude that prosodic salience accounts provide the best explanation for the acquisition patterns in these four languages.
Walking Made Simple

It is possible to design robots that walk in a humanlike manner by providing them with motors to drive every joint and a computer that tells every joint what its angle should be. There are many successful robots of this ilk, but they are very complex and use far more energy than would a walking human. In his Perspective, Alexander discusses a different type of robot inspired by toys that walk passively downhill. These robots have much simpler control systems and use much less energy than conventional walking robots.
Guardians for Concurrent Systems

In this paper we survey the current state of the art on fundamental aspects of concurrent systems. We discuss the notion of concurrency and discuss a model of computation which unifies the lambda calculus model and the sequential stored program model. We develop the notion of a guardian as a module that regulates the use of shared resources by scheduling their access, providing protection, and implementing recovery from hardware failures. A shared checking account is an example of the kind of resource that needs a guardian. We introduce the notions of a customer and a transaction manager for a request and illustrate how to use them to implement arbitrary scheduling policies for a guardian. A proof methodology is presented for proving properties of guardians, such as guarantee of service for all requests received. A.I. Laboratory Working Papers are produced for internal circulation, and may contain information that is, for example, too preliminary or too detailed for formal publication. It is not intended that they should be considered papers to which reference can be made in the literature.
Analysis of Massive Networks

Massive networks can be observed from various aspects of the world. Nowadays more massive networks have measurable and analyzable form: informational networks such as the WWW, networks of social interactions like call or SMS graphs can be captured. We give an overview of operations, representations and tools for modeling graphs. The intention is to build a basis for further development of a tool for analyzing massive graphs. Finally we introduce some introductory measured properties of a network of SMS communication.
A Visual Programming Environment for Autonomous Robots

The above library may make available or authorize another library to make available photo/microfilm copies of this thesis without restrictions. Abstract Until relatively recently computer programmers had to use machine-oriented programming languages owing to the fact that memory and processing power were insufficient for both computation and complex human-computer interaction. Computers today are equipped with larger memory capacity and offer much higher processing power. Visual programming is one of the many research fields that has emerged and become active as a result of this technological advancement. Recently, there has been considerable interest in applying visual programming languages to robot control. In this work, we will introduce the reader to our proposed visual language for programming autonomous robots. In this system the physical characteristics of a specific robot can be incorporated with the general syntax and semantics of the underlying control architecture to provide both generality and domain specificity. This has been accomplished by dividing the programming system into two major modules; Hardware Definition Module or HDM and Software Definition Module or SDM. This work focuses on the second module SDM and describes in detail how a control program is created by using the models previously generated in HDM. We also present a complete and precise reformulation of the subsumption architecture for robot control on
Distributed, adaptive deployment for nonholonomic mobile sensor networks : theory and experiments

In this work we show the Lyapunov stability and convergence of an adaptive and decentralized coverage control for a team of mobile sensors. This new approach assumes nonholonomic sensors rather than the usual holonomic sensors found in the literature. The kinematics of the unicycle model and a nonlinear control law in polar coordinates are used in order to prove the stability of the controller applied over a team of mobile sensors. This controller is adaptive, which means that the mobile sensors are able to estimate and map a density function in the sampling space without a previous knowledge of the environment. The controller is decentralized, which means that each mobile sensor has its own estimate and computes its own control input based on local information. In order to guarantee the estimate convergence, the mobile sensors im-
Controlling non-normative behaviors by anticipation for autonomous agents

One of the crucial issues in multi-agent systems is the coordination of agents' actions. A simple way to coordinate the agents is to define norms in the system. Most of the research related to norms and multi-agent systems focuses on designing normative agents to ensure a social order inside the system. To achieve this goal, these studies make the assumption that non-normative behavior must be controlled using sanction mechanisms. This paper discusses the relevance of this assumption in certain specific contexts, and presents an alternative for controlling non-normative behavior, thus ensuring the social order. To illustrate our proposal, we introduce a concrete application involving traffic simulation at a road junction. Based on the statistical traffic results, we show how our approach helps to improve the realism of the simulation.
Three cases in using concept maps

Much of traditional teaching in engineering focuses on procedural learning. However, future engineers will face a rapidly evolving and complex environment that will require reflexive learning and cognitive transfer skills which require a deep learning approach as opposed to surface or even strategic learning. Concept maps are powerful tools that encourage deep learning, expand students’ ability to generate and exchange knowledge. This paper presents three cases in which concept maps were used, first to develop students’ ability to analyse and synthesize information from multiple sources and enhance deep learning, second to facilitate the generation and sharing of collective knowledge. In the first two cases, students were asked to identify and organize key concepts from formal courses, presentations or texts within concept maps. It was found that students not only improved their ability to assimilate content from these sources, but also demonstrated better skills in analysing and communicating information. It was also found that they were more active in class, asked more questions and answered questions more frequently. In the last case, concept maps were used as boundary objects to mediate interactions and structuring collective knowledge in the design process of a sustainable house. The teaching in this last case was based on a socio-constructivist approach of situated learning, in which the students had to co-develop their understanding of sustainable construction within a design laboratory. Concept maps, used in combination with interactive boards and a knowledge portal proved to be quite effective in accelerating individual and collective learning of a complex topic, while also developing communication and transdisciplinary skills. The three cases demonstrate the power and value of using concept maps in engineering teaching, both from a cognitivist or a socio-constructivist perspective. Concept maps are powerful tools not only to learn how to learn individually and collectively, it increases students ability to structure their though and exchange knowledge.
Copyright and Multimedia Products: A Comparative Analysis

Acknowledgements List of abbreviations Introduction 1. Placing multimedia products within the scope of copyright 2. The scope of multimedia works 3. Traditional literary works 4. Collections and compilations 5. Databases 6. Audiovisual works 7. Computer programs 8. Video games as a test case 9. Multimedia products and existing categories of copyright works 10. A regime of protection for multimedia products 11. Conclusion Postscript Bibliography Index.
Dutch parallel corpus : a multilingual annotated corpus

Aligned parallel corpora form an indispensable resource for a wide range of multilingual applications, including, among others, machine translation (MT), especially corpus-based MT like statistical MT (Koehn, 2005) and example-based MT (Carl and Way, 2003), computer-assisted translation tools (Hutchins, 2005), multilingual information extraction and computer-assisted language learning (Desmet and Paulussen, 2005). Apart from the more technological applications, parallel corpora can be used to conduct more fundamental research in the fields of contrastive linguistics and translation studies (Baker, 1995; Laviosa, 2002; Olohan, 2004). Since high-quality parallel corpora with Dutch as a central language do not exist or are not accessible for the research community due to copyright restrictions, the compilation of aligned parallel corpora with Dutch as a central language was one of the priorities of the STEVIN program (Odijk et al., 2004). The Dutch Parallel Corpus (DPC) project aims at fulfilling this need. Within the DPC project, a 10-million-word, high-quality, sentence-aligned parallel corpus for the language pairs Dutch-English and Dutch-French is being compiled. The corpus will be enriched with linguistic annotations: part-of-speech and lemmatization information for the whole corpus and syntactic analysis for a subpart of the corpus. As the corpus is bidirectional (Dutch as source and target language), the corpus can also be used as a comparable corpus (to compare texts originally written in Dutch with translated Dutch texts). A part of the corpus is trilingual and contains Dutch texts translated into both English and French. To guarantee the quality of the corpus and its multifunctional availability for the wide research community, each step in compiling, structuring and annotating the corpus is being validated by a user group of specialists in linguistics and language technology. In order to make the corpus accessible for the whole research community, a copyright clearance for all samples included in the corpus is being obtained. The DPC-project started in May 2006 and runs until March 2009. The remainder of the paper is organized as follows: Section 2 deals with the specific needs of the different intended users. Section 3 describes in detail the corpus design. Section 4 focuses on the more technical issues of text normalization, alignment and linguistic annotation. Section 5 elaborates on quality control and Section 6 concludes the paper.
Introduction

Throughout the history of computing, developments in human-computer interaction (HCI) have often been preceded by breakthroughs in display and input technologies. The first use of a cathode ray tube (CRT) to display computer-generated (radar) data, in the Canadian DATAR [6] and MIT’s Whirlwind projects of the early 1950s, led to the development of the trackball and light pen. That development, in turn, influenced Sutherland’s and Engelbart’s work on interactive computer graphics, the mouse, and the graphical user interface (GUI) during the early 1960s. According to Alan Kay [3], seeing the first liquid crystal display (LCD) had a similar disruptive effect on his thinking about interactivity at Xerox PARC during the early 1970s. His vision of Dynabook led to the development of Smalltalk, the Alto GUI (1973), and eventually, the Tablet PC [2]:
Counting Effective Number of Buttons: An Informational Analysis of Input Device Performance

A quantitative method to evaluate theoretical efficiency of input devices is proposed. Using informatics, the method answers effective degrees of freedom in input devices; it evaluates how many buttons are efficiently used for operation. Comparing traditional methods represented by “magical number of seven,” this method is versatile for general usability tests of any input devices, since the method requires only frequencies of stimuli and responses between machines and users.
Analysis of Multi-State Models with Mismeasured Covariates or Misclassified States

Multi-state models provide a useful framework for estimating the rate of transitions between defined disease states and understanding the influence of covariates on transitions in studies of the disease progression. Statistical analysis of data from studies of disease progression often involves a number of challenges. A particular challenge is that the classification of the disease state may be subject to error. Another common problem is that there are many sources of heterogeneity in the data in which situation the assumption of time-homogeneous for common Markov models is not valid. In addition, it is common for discrete covariates subject to misclassification and the panel data collected from disease progression studies is time-dependence in the covariates. In Chapter 2, the progressive multi-state model with misclassification is developed to simultaneously estimate transition rates and account for potential misclassification. The performance of the maximum likelihood and pairwise likelihood estimators is evaluated by simulation studies. The proposed progressive model is illustrated on coronary allograft vasculopathy data, in which the diagnosis based on the coronary angiography is subject to error. In Chapter 3, hidden mover-stayer models are proposed to provide a solution to a type of heterogeneity where the population consists of both movers and stayers in the presence of misclassification. The likelihood inference procedure based on the EM algorithm is developed for the proposed model. The performance of the likelihood method is investigated through simulation studies. The proposed method is applied to the Waterloo Smoking Prevention Project. In Chapter 4, we propose estimation procedures for Markov models with binary covariates subject to misclassification. We show that the model is not identifiable under covariate misclassification. Consequently, we develop likelihood inference methods based on known reclassification probabilities and the main/validation study design. Simulation studies are conducted to inves-