Search results for "Programming Language"
showing 10 items of 624 documents
The PCHIP subdivision scheme
2016
In this paper we propose and analyze a nonlinear subdivision scheme based on the monotononicity-preserving third order Hermite-type interpolatory technique implemented in the PCHIP package in Matlab. We prove the convergence and the stability of the PCHIP nonlinear subdivision process by employing a novel technique based on the study of the generalized Jacobian of the first difference scheme. MTM2011-22741
Tarski’s t-scheme as an alleged basis of Montague semantics
2007
My point in this paper is to focus on some details of Alfred Tarski’s writing that in my opinion have not been aptly represented — or aptly rejected — in Richard Montague’s grammar and to agree with those who share Tarski’s view that human language is something uncapturable. The paper consists of two parts, concerning 1) some attempts to formalize the non-declarative utterances, and 2) the limitations of T-scheme and of Montague grammar.
Controlling and learning motor functions
2018
Effective and adaptive motor functions are important for living beings and developing computational and learning mechanisms for roving robots is a crucial aspect in biorobotics. In this chapter we report a new architecture for motor learning to be applied in insect-like walking robots. The proposed model is based on the MB structure previously introduced able to memorize time evolutions of key parameters of the neural motor controller to improve existing motor primitives. The adopted control scheme enables the structure to efficiently cope with goal-oriented behavioural motor tasks. The problem of body-size evaluation is also considered and a model for the parallax-based estimation is provi…
Resource Allocation for Edge Computing-Based Blockchain: A Game Theoretic Approach
2020
Blockchain has been progressively applied to various Internet of Things (IoT) platforms. As the efficiency of the blockchain depends on its computing capability, how to make sure the acquisition of the computational resources and participation of the devices would be the driving force. In this work, an edge computing-based blockchain network is considered, where the edge service provider (ESP) offers computational resources for the miners. The focus is to investigate an efficient incentive mechanism for the miners to purchase the computational resources. Accordingly, a two-stage Stackelberg game is formulated between the miners and ESP. By exploring the Stackelberg equilibrium of the optima…
“Anti-Bayesian” flat and hierarchical clustering using symmetric quantiloids
2017
A myriad of works has been published for achieving data clustering based on the Bayesian paradigm, where the clustering sometimes resorts to Naive-Bayes decisions. Within the domain of clustering, the Bayesian principle corresponds to assigning the unlabelled samples to the cluster whose mean (or centroid) is the closest. Recently, Oommen and his co-authors have proposed a novel, counter-intuitive and pioneering PR scheme that is radically opposed to the Bayesian principle. The rational for this paradigm, referred to as the “Anti-Bayesian” (AB) paradigm, involves classification based on the non-central quantiles of the distributions. The first-reported work to achieve clustering using the A…
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.