Search results for "Abstract data type"
showing 10 items of 1140 documents
Relativistic Positioning Systems in Flat Space-Time: The Location Problem
2013
The location problem in relativistic positioning is considered in flat space-time. When two formal solutions are possible for a user (receiver) of the system, its true location may be obtained from a standard set of emission data extended with an observational rule. The covariant expression giving the location of the user in inertial coordinates is decomposed with respect to an inertial observer.
Comparing multicriteria methods in the context of environmental problems
1998
Abstract The present paper gives an analysis of the use of ELECTRE III, PROMETHEE I, II, and SMART decision-aids in the context of four different real applications to environmental problems in Finland. These methods are widely used decision-aids in the real planning processes. The purpose of this study is to define the differences of these methods and the results obtained with them, and in this way also to consider their applicability in aiding environmental decision-making. Furthermore, a comparison of the methods based on a set of randomly generated problems is carried out. The choice in practice will not be easy; PROMETHEE does not differ much from SMART with linear value functions, and …
Finding Tours for a Set of Interests
2018
This paper addresses a novel tour discovery problem in the domain of travel search. We create a ranking of tours for a set of travel interests, where a tour is a group of city documents and a travel interest is a query. While generating and ranking tours, it is aimed that each interest (from the interest set) is satisfied by at least one city in a tour and the distance traveled to cover the tour is not too large. Firstly, we generate tours for the interest set, by utilizing the available ranking of cities for the individual interests and the distances between the cities. Then, in absence of existing methods directly related to our problem, we devise our novel techniques to calculate ranking…
Interactive Gradually Generating Relevance Query Refinement Under the Human-Mediated Scenario in Multilingual Settings
2016
As opposed to query modelling, relevance generating interactive query refinement (QR) is a technique aimed at exploiting syntax variations of gradually extended, being removed or replaced with some other keywords query, which depending on the factors like e.g. the information resource, the database structure, or the keyword alignment, facilitates significantly the searching process. Therefore our motivation is to explore the dynamism of the precision trend depended upon the factors analyzed. For a couple of language pairs which constitute multilingual settings, we develop a user-centred framework that imposes distributed search optimization. Our data set contains variety of query types subm…
Input-output finite-time stability of positive switched linear systems with state delays
2013
This paper is concerned with the problem of input-output finite-time stability (IO-FTS) for a class of discrete-time positive switched systems with time-varying delays. Two sufficient conditions for the existence of IO-FTS of such systems with respect to two different input signals are presented, respectively. All the results obtained are formulated in a set of linear inequalities. Two numerical examples are given to illustrate the effectiveness of the proposed results.
Formation of real, orthoscopic integral images by smart pixel mapping.
2005
Integral imaging systems are imaging devices that provide 3D images of 3D objects. When integral imaging systems work in their standard configuration the provided reconstructed images are pseudoscopic; that is, are reversed in depth. In this paper we present, for the first time we believe, a technique for formation of real, undistorted, orthoscopic integral images by direct pickup. The technique is based on a smart mapping of pixels of an elemental-images set. Simulated imaging experiments are presented to support our proposal.
Fully programmable display parameters in integral imaging by smart pseudoscopic-to-orthoscopic conversion
2011
Previously, we reported a digital technique for formation of real, non-distorted, orthoscopic integral images by direct pickup. However the technique was constrained to the case of symmetric image capture and display systems. Here, we report a more general algorithm which allows the pseudoscopic to orthoscopic transformation with full control over the display parameters so that one can generates a set of synthetic elemental images that suits the characteristics of the Integral-Imaging monitor and permits control over the depth and size of the reconstructed 3D scene.
Review of High Resolution Thermal Infrared Applications and Requirements: The Fuegosat Synthesis Study
2013
High resolution thermal infrared remote sensing can have a wide range of applications. In this chapter we describe the different applications and requirements identified after a revision study in the framework of the Fuegosat Synthesis Study (FSS). This project was funded by the European Space Agency (ESA), and the three main objectives were: (i) review of applications and analyses for user requirements, (ii) consolidation of user requirements over a broad range of applications, and (iii) matching of user requirements and industry concepts to identify and outline a set of potential mission scenarios and their corresponding requirements. This chapter focuses on issues (i) and (ii). These obj…
A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Sampling
2009
We consider the problem of allocating limited sampling resources in a "real-time" manner with the purpose of estimating multiple binomial proportions. More specifically, the user is presented with `n ' sets of data points, S 1 , S 2 , ..., S n , where the set S i has N i points drawn from two classes {*** 1 , *** 2 }. A random sample in set S i belongs to *** 1 with probability u i and to *** 2 with probability 1 *** u i , with {u i }. i = 1, 2, ...n , being the quantities to be learnt. The problem is both interesting and non-trivial because while both n and each N i are large, the number of samples that can be drawn is bounded by a constant, c . We solve the problem by first modelling it a…
Fast solution of radial distribution networks with automated compensation and reconfiguration
2000
Abstract Optimal operation of radial distribution networks with automated compensation and reconfiguration requires the solution of a combinatorial optimisation problem, since the variables are the on/off status of capacitor banks and the open/close status of tie-switches. The solution approaches recently proposed use iterative algorithms such as genetic algorithms, simulated annealing and tabu search, for which the network needs to be solved in different configurations and at different compensation levels. The aim of this evaluation is that of attributing a quality index to each solution so that all the solutions can be suitably ordered. In an automated network, any configuration can be ob…