Search results for "Data_FILES"
showing 10 items of 197 documents
Additional file 1 of Ethnobotany of dye plants in Southern Italy, Mediterranean Basin: floristic catalog and two centuries of analysis of traditional…
2020
Additional file 1: Supplementary File 1. A wider and more complete database and the currently available data.
MOESM5 of Global mapping of randomised trials related articles published in high-impact-factor medical journals: a cross-sectional analysis
2020
Additional file 5. List of excluded articles.
MOESM5 of Global mapping of randomised trials related articles published in high-impact-factor medical journals: a cross-sectional analysis
2020
Additional file 5. List of excluded articles.
Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs
2017
Parity RAIDs are used to protect storage systems against disk failures. The idea is to add redundancy to the system by storing the parity of subsets of disks on extra parity disks. A simple two-dimensional scheme is the one in which the data disks are arranged in a rectangular grid, and every row and column is extended by one disk which stores the parity of it.In this paper we describe several two-dimensional parity RAIDs and analyse, for each of them, the probability for dataloss given that f random disks fail. This probability can be used to determine the overall probability using the model of Hafner and Rao. We reduce subsets of the forest counting problem to the different cases and show…
Rearrangement and convergence in spaces of measurable functions
2007
We prove that the convergence of a sequence of functions in the space of measurable functions, with respect to the topology of convergence in measure, implies the convergence -almost everywhere ( denotes the Lebesgue measure) of the sequence of rearrangements. We obtain nonexpansivity of rearrangement on the space , and also on Orlicz spaces with respect to a finitely additive extended real-valued set function. In the space and in the space , of finite elements of an Orlicz space of a -additive set function, we introduce some parameters which estimate the Hausdorff measure of noncompactness. We obtain some relations involving these parameters when passing from a bounded set of , or , to th…
GAMS files for the multi-objective models to locate temporary distribution centers after sudden-onset disasters
2019
These are the GAMS file with some a sample dataset that model locating temporary distribution centers after sudden-onset disasters. Required input data should be changed in the front.
Place à une gestion managériale dans les écoles : Le collège apprenant Ou l'introduction d'innovations managériales dans une structure publique dans …
2019
Thème du colloque : «Territoires intelligents et management public durable (smart cities and sustainable public management)»; International audience
Design of an exact data deduplication cluster
2012
Data deduplication is an important component of enterprise storage environments. The throughput and capacity limitations of single node solutions have led to the development of clustered deduplication systems. Most implemented clustered inline solutions are trading deduplication ratio versus performance and are willing to miss opportunities to detect redundant data, which a single node system would detect. We present an inline deduplication cluster with a joint distributed chunk index, which is able to detect as much redundancy as a single node solution. The use of locality and load balancing paradigms enables the nodes to minimize information exchange. Therefore, we are able to show that, …
A characterization of the n-ary many-sorted closure operators and a many-sorted Tarski irredundant basis theorem
2018
A theorem of single-sorted algebra states that, for a closure space (A, J ) and a natural number n, the closure operator J on the set A is n-ary if and only if there exists a single-sorted signature Σ and a Σ-algebra A such that every operation of A is of an arity ≤ n and J = SgA, where SgA is the subalgebra generating operator on A determined by A. On the other hand, a theorem of Tarski asserts that if J is an n-ary closure operator on a set A with n ≥ 2, then, for every i, j ∈ IrB(A, J ), where IrB(A, J ) is the set of all natural numbers which have the property of being the cardinality of an irredundant basis (≡ minimal generating set) of A with respect to J , if i < j and {i + 1, . . . …
Inducing the Lyndon Array
2019
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n)$ time using $\sigma + O(1)$ words of working space, where $n$ is the length of the text and $\sigma$ is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use $O(n)$ words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not onl…