Search results for "Abstract data type"
showing 10 items of 1140 documents
Competition and cooperation for intermodal container transhipment: A network optimization approach
2018
Abstract This study presents an analysis of cross-border competition and cooperation between ports in Bangladesh and India. Nepal and Bhutan are countries without access to seaports — two landlocked countries in South Asia, depending solely on the Indian port of Kolkata for their international seaborne trade. Alternatives do exist in the Bangladeshi ports of Chittagong and Mongla but these are not exploited, in spite of trade agreements that allow access to a third country's port, and/or crossing the land of a third, intermediate, country. We formulate a mixed integer linear programming optimization model to find the optimum economic benefit of port users (serving Bhutan, Nepal and Northeas…
Miscellaneous Graph Preliminaries
2020
Summary This article contains many auxiliary theorems which were missing in the Mizar Mathematical Library [2] to the best of the author’s knowledge. Most of them regard graph theory as formalized in the GLIB series (cf. [8]) and most of them are preliminaries needed in [7] or other forthcoming articles.
Towards events ontology based on data sensors network for viticulture domain
2018
International audience; Wine Cloud project is the first "Big Data" platform on the french viticulture value chain. The aim of this platform is to provide a complete traceability of the life cycle of the wine, from the wine-grower to the consumer. In particular, Wine Cloud may qualify as an agricultural decision platform that will be used for vine life cycle management in order to predict the occurrence of major risks (vine diseases, grape vine pests, physiological risks, fermentation stoppage, oxidation of vine, etc...). Also to make wine production more rational by offering winegrower a set of recommendation regarding their strategy's of production development. The proposed platform "Wine …
Space-filling vs. Luzin's condition (N)
2013
Let us assume that we are given two metric spaces, where the Hausdorff dimension of the first space is strictly smaller than the one of the second space. Suppose further that the first space has sigma-finite measure with respect to the Hausdorff measure of the corresponding dimension. We show for quite general metric spaces that for any measurable surjection from the first onto the second space, there is a set of measure zero that is mapped to a set of positive measure (both measures are the Hausdorff measures corresponding to the Hausdorff dimension of the first space). We also study more general situations where the measures on the two metric spaces are not necessarily the same and not ne…
Ahlfors-regular distances on the Heisenberg group without biLipschitz pieces
2015
We show that the Heisenberg group is not minimal in looking down. This answers Problem 11.15 in `Fractured fractals and broken dreams' by David and Semmes, or equivalently, Question 22 and hence also Question 24 in `Thirty-three yes or no questions about mappings, measures, and metrics' by Heinonen and Semmes. The non-minimality of the Heisenberg group is shown by giving an example of an Ahlfors $4$-regular metric space $X$ having big pieces of itself such that no Lipschitz map from a subset of $X$ to the Heisenberg group has image with positive measure, and by providing a Lipschitz map from the Heisenberg group to the space $X$ having as image the whole $X$. As part of proving the above re…
Information content of data and variables and types of weighting in least-squares regression methods
1990
Abstract Algorithms are given for evaluating the relative amount of useful information related to a particular parameter which is carried by individual data points and intervals of the variables. The algorithms provide an efficient means of using the information contained in a set of data. Applications to the optimization of weighting in regression methods are described. Several informational and combined informational-statistical types of weighting are studied as a means of improving the accuracy and precision of the parameters obtained by non-linear regression.
Accurate estimation of retinal vessel width using bagged decision trees and an extended multiresolution Hermite model.
2012
We present an algorithm estimating the width of retinal vessels in fundus camera images. The algorithm uses a novel parametric surface model of the cross-sectional intensities of vessels, and ensembles of bagged decision trees to estimate the local width from the parameters of the best-fit surface. We report comparative tests with REVIEW, currently the public database of reference for retinal width estimation, containing 16 images with 193 annotated vessel segments and 5066 profile points annotated manually by three independent experts. Comparative tests are reported also with our own set of 378 vessel widths selected sparsely in 38 images from the Tayside Scotland diabetic retinopathy scre…
Estimation of fibre orientation from digital images
2001
In this paper, estimation of fibre orientation is studied for fibre systems observable as a blurred greyscale image. The estimation method is based on scaled variograms observed along a set of sampling lines in different directions. The parameters of the orientation distribution are obtained numerically. Simulated data are used to study the statistical properties of the method.
Active learning strategies for the deduplication of electronic patient data using classification trees.
2012
Graphical abstractDisplay Omitted Highlights? Active learning for medical record linkage is used on a large data set. ? We compare a simple active learning strategy with a more sophisticated variant. ? The active learning method of Sarawagi and Bhamidipaty (2002) 6] is extended. ? We deliver insights into the variations of the results due to random sampling in the active learning strategies. IntroductionSupervised record linkage methods often require a clerical review to gain informative training data. Active learning means to actively prompt the user to label data with special characteristics in order to minimise the review costs. We conducted an empirical evaluation to investigate whether…
Adaptive memory programing for the robust capacitated international sourcing problem
2008
The International Sourcing Problem consists of selecting a subset from an available set of potential suppliers internationally located. The selected suppliers must meet the demand for items from a set of plants, which are also located worldwide. Since the costs are affected by macroeconomic conditions in the countries where the supplier and the plant are located, the formulation considers the uncertainty associated with changes in these conditions. We formulate the robust capacitated international sourcing problem by means of a scenario-optimization approach. When dealing with uncertainty, one of the most common approaches in the literature is to formulate the problem via a set of possible …