This paper describes the participation of the Research Institute for Artificial Intelligence, Romanian Academy

(TRD) [1] in the CBM experiment are on one hand the electron identification and on the other hand the tracking capabilities, which have to be fulfilled in an environment with a count rate of the order of 100 kHz/cm 2. Prototypes of single TRD layers which could fulfill the experimental requirements were developed by several groups [2,3,4]. Geometries Geometries of two of these prototypes were also implemented in the simulation of the CBM experiment, a single gap MWPC with a gas layer of 6 mm and a double-sided MWPC with two gas layers of 6 mm described in detail in another report of this book [5]. To study general properties of the TRD like energy loss, electron identification or tracking performance an idealized version of the geometries is used which is sensitive in the complete detector

This paper describes a question answering system and its various models handling the definition, factoid and list questions defined in the TREC12 Main task. Specially, we model the factoid QA task as QA entities or Events. Each QA event comprises of elements describing different facets of the event

In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable noise and uneven edges while retaining desirable geometric features. The problem arises mainly when creating high

Abstract. This article describes the participation of a group from the University of Évora in the CLEF2013 QA4MRE main task. Our system has a superficial text analysis based approach. The methodology starts with the preprocessing of background collection documents, whose texts are lemmatized

that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools

The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware acompelling platform for computationally demanding tasks in awide variety of application domains. In this report, we describe, summarize, and analyze

This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task

In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations

result of the work is a database in GIS environment with the following main components: administrative subdivision; forest fund (forest management plan, game breeding plan); property; road network; hydrographic network and watershed basins; forests (tree species composition, age classes and sylvicultural