Search results for "Data type"
showing 10 items of 1183 documents
Measuring Semantic Coherence of a Conversation
2018
Conversational systems have become increasingly popular as a way for humans to interact with computers. To be able to provide intelligent responses, conversational systems must correctly model the structure and semantics of a conversation. We introduce the task of measuring semantic (in)coherence in a conversation with respect to background knowledge, which relies on the identification of semantic relations between concepts introduced during a conversation. We propose and evaluate graph-based and machine learning-based approaches for measuring semantic coherence using knowledge graphs, their vector space embeddings and word embedding models, as sources of background knowledge. We demonstrat…
Determinantal sets, singularities and application to optimal control in medical imagery
2016
International audience; Control theory has recently been involved in the field of nuclear magnetic resonance imagery. The goal is to control the magnetic field optimally in order to improve the contrast between two biological matters on the pictures. Geometric optimal control leads us here to analyze mero-morphic vector fields depending upon physical parameters , and having their singularities defined by a deter-minantal variety. The involved matrix has polynomial entries with respect to both the state variables and the parameters. Taking into account the physical constraints of the problem, one needs to classify, with respect to the parameters, the number of real singularities lying in som…
General framework for testing Poisson-Voronoi assumption for real microstructures
2020
Modeling microstructures is an interesting problem not just in Materials Science but also in Mathematics and Statistics. The most basic model for steel microstructure is the Poisson-Voronoi diagram. It has mathematically attractive properties and it has been used in the approximation of single phase steel microstructures. The aim of this paper is to develop methods that can be used to test whether a real steel microstructure can be approximated by such a model. Therefore, a general framework for testing the Poisson-Voronoi assumption based on images of 2D sections of real metals is set out. Following two different approaches, according to the use or not of periodic boundary conditions, thre…
On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
1990
This paper deals with multiobjective programming in which the objective functions are nonsymmetric distances (derived from different gauges) to the points of a fixed finite subset of ℝn. It emphasizes the case in which the gauges are polyhedral. In this framework the following result is known: if the gauges are polyhedral, then each Pareto optimum is the solution to a Fermat—Weber problem with strictly positive coefficients. We give a new proof of this result, and we show that it is useful in finding the whole set of efficient points of a location problem with polyhedral gauges. Also, we characterize polyhedral gauges in terms of a property of their subdifferential.
Minimal change list for Lucas strings and some graph theoretic consequences
2005
AbstractWe give a minimal change list for the set of order p length-n Lucas strings, i.e., the set of length-n binary strings with no p consecutive 1's nor a 1ℓ prefix and a 1m suffix with ℓ+m⩾p. The construction of this list proves also that the order p n-dimensional Lucas cube has a Hamiltonian path if and only if n is not a multiple of p+1, and its second power always has a Hamiltonian path.
Fast Distributed Subspace Projection via Graph Filters
2018
A significant number of linear inference problems in wireless sensor networks can be solved by projecting the observed signal onto a given subspace. Decentralized approaches avoid the need for performing such an operation at a central processor, thereby reducing congestion and increasing the robustness and the scalability of the network. Unfortunately, existing decentralized approaches either confine themselves to a reduced family of subspace projection tasks or need an infinite number of iterations to obtain the exact projection. To remedy these limitations, this paper develops a framework for computing a wide class of subspace projections in a decentralized fashion by relying on the notio…
FINITE TRIFACTORISED GROUPS AND -DECOMPOSABILITY
2018
We derive some structural properties of a trifactorised finite group $G=AB=AC=BC$, where $A$, $B$, and $C$ are subgroups of $G$, provided that $A=A_{\unicode[STIX]{x1D70B}}\times A_{\unicode[STIX]{x1D70B}^{\prime }}$ and $B=B_{\unicode[STIX]{x1D70B}}\times B_{\unicode[STIX]{x1D70B}^{\prime }}$ are $\unicode[STIX]{x1D70B}$-decomposable groups, for a set of primes $\unicode[STIX]{x1D70B}$.
A methodology to generate a synergetic land-cover map by fusion of different land-cover products
2012
Abstract The main goal of this study is to develop a general framework for building a hybrid land-cover map by the synergistic combination of a number of land-cover classifications with different legends and spatial resolutions. The proposed approach assesses class-specific accuracies of datasets and establishes affinity between thematic legends using a common land-cover language such as the UN Land-Cover Classification System (LCCS). The approach is illustrated over a large region in Europe using four land-cover datasets (CORINE, GLC2000, MODIS and GlobCover), but it can be applied to any set of existing products. The multi-classification map is expected to improve the performance of indiv…
A Feature Rich Distance-Based Many-Objective Visualisable Test Problem Generator
2019
In optimiser analysis and design it is informative to visualise how a search point/population moves through the design space over time. Visualisable distance-based many-objective optimisation problems have been developed whose design space is in two-dimensions with arbitrarily many objective dimensions. Previous work has shown how disconnected Pareto sets may be formed, how problems can be projected to and from arbitrarily many design dimensions, and how dominance resistant regions of design space may be defined. Most recently, a test suite has been proposed using distances to lines rather than points. However, active use of visualisable problems has been limited. This may be because the ty…
Modeling Requirements for Future CASE
1995
In this paper we discuss some requirements for future CASE Computer Aided Software/Systems Engineering environments. These requirements include increased modifiability and flexibility as well as support for process and agent models. We claim that they can only be addressed by developing more powerful representation and modeling techniques. As a possible basis for modeling various techniques, we outline a general information architecture for a future CASE environment. In addition, we propose primitive types for specifying techniques, the development process, and agent models, and use these types for modeling an example methodology and examine how the requirements are or can be supported in o…