Search results for "programming."
showing 10 items of 3035 documents
A Pseudo-Supervised Approach to Improve a Recommender Based on Collaborative Filtering
2003
This PhD Thesis develops an optimal recommender. First of all, users accessing to a Web site are clustered. If a user belongs to a cluster, the system offers services which are usually accessed by users from the same cluster in a collaborative filtering scheme. A novel approach based on a users simulator and a dynamic recommendation system is proposed. The simulator is used to create the situations that one can find in a Web site. Introduction of dynamics in the recommender allows to change the clusters and in turn, the decisions which are taken. Since the system is based both on supervised and unsupervised learning whose borders are not too clear in our approach, we talk about a pseudo-sup…
A Fast Anchor Person Searching Scheme in News Sequences
2001
In this paper we address the problem of seeking anchor person shots in news sequences. This can be useful since usually this kind of scenes contain important and reusable information such as interviews. The proposed technique is based on our a priori knowledge of the editing techniques used in news sequences.
Indexing Multimedia Learning Materials in Ultimate Course Search
2016
International audience; Multimedia is the main support for online learning materials and the size of multimedia learning materials is growing with the popularity of online programs offered by Universities. Ultimate Course Search (UCS) is a tool that aims to provide efficient search of course materials. UCS integrates slides, lecture videos and textbook content into a single platform with search capabilities. The keywords extracted from the textbook index and the power-point slides are the basis of the indexing scheme. The slides are indexed on the keywords and the videos are indexed on the slides. The correspondence between the slides and video segments is established using the meta-data pr…
Upper bound on the communication complexity of private information retrieval
1997
We construct a scheme for private information retrieval with k databases and communication complexity O(n 1/(2k−1) ).
Dynamic routing-and-inventory problems: a review
1998
The paper presents a review of the available literature on a class of problems denoted as dynamic routing-and-inventory (DRAI) problems. They are characterized by the simultaneous relevance of routing and of inventory issues in a dynamic environment, within the framework of distribution logistics. A classification scheme is first proposed for these problems. Then the results obtained in this area are summarized. Finally, the papers available in the literature are clustered and discussed according to the proposed scheme.
Analyzing the Contextual Nature of Collaborative Activity
2010
This chapter discusses a methodology designed to explore the contextual nature of collaborative activity. The methods that can be generally considered to be based on ‘socio-cultural’ discourse analysis are discussed as a means to explore how different aspects of a situation mediate students’ shared meaning-making. First, an analysis is demonstrated, illustrating how different immediate and mediated contexts are embedded in students’ discourse as they are engaged in face-to-face collaborative activity in a computer-mediated context. Second, a multidimensional coding scheme is presented for analyzing the contextualized process of collaborative knowledge construction in an asynchronous web-ba…
On Using “Stochastic Learning on the Line” to Design Novel Distance Estimation Methods for Three-Dimensional Environments
2019
We consider the unsolved problem of Distance Estimation (DE) when the inputs are the x and y coordinates (i.e., the latitudinal and longitudinal positions) of the points under consideration, and the elevation/altitudes of the points specified, for example, in terms of their z coordinates (3DDE). The aim of the problem is to yield an accurate value for the real (road) distance between the points specified by all the three coordinates of the cities in question (This is a typical problem encountered in a GISs and GPSs.). In our setting, the distance between any pair of cities is assumed to be computed by merely having access to the coordinates and known inter-city distances of a small subset o…
Modelling Dependencies Between Classifiers in Mobile Masquerader Detection
2004
The unauthorised use of mobile terminals may result in an abuse of sensitive information kept locally on the terminals or accessible over the network. Therefore, there is a need for security means capable of detecting the cases when the legitimate user of the terminal is substituted. The problem of user substitution detection is considered in the paper as a problem of classifying the behaviour of the person interacting with the terminal as originating from the user or someone else. Different aspects of behaviour are analysed by designated one-class classifiers whose classifications are subsequently combined. A modification of majority voting that takes into account some of the dependencies …
Algorithmic differentiation for cloud schemes (IFS Cy43r3) using CoDiPack (v1.8.1)
2019
Abstract. Numerical models in atmospheric sciences not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes have been proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive. We il…
Algorithmic Differentiation for Cloud Schemes
2019
<p>Numerical models in atmospheric sciences do not only need to approximate the flow equations on a suitable computational grid, they also need to include subgrid effects of many non-resolved physical processes. Among others, the formation and evolution of cloud particles is an example of such subgrid processes. Moreover, to date there is no universal mathematical description of a cloud, hence many cloud schemes were proposed and these schemes typically contain several uncertain parameters. In this study, we propose the use of algorithmic differentiation (AD) as a method to identify parameters within the cloud scheme, to which the output of the cloud scheme is most sensitive.…