Search results for "Integer"
showing 10 items of 250 documents
Un Modello di Massima Copertura della Domanda per l’Allocazione Ottima delle Ciclostazioni di AMAT
2018
AMAT Palermo S.p.A. is the public transport company of the municipality of Palermo. AMAT manages the bike sharing system and within a sustainable mobility project has involved the DSEAS and four secondary schools to the research project “GoToSchool”, a project whose main aim is to foster the use of the bike by the students in getting to the school.The project developed in two phases: the first phase was devoted to the estimate of the demand of bike sharing service from the students; the second phase was committed to the study of an optimal facility allocation problem in order to maximize the demand of bike sharing service arising from students.The optimization model can be easily customized…
Approximation of W1, Sobolev homeomorphism by diffeomorphisms and the signs of the Jacobian
2018
Abstract Let Ω ⊂ R n , n ≥ 4 , be a domain and 1 ≤ p [ n / 2 ] , where [ a ] stands for the integer part of a. We construct a homeomorphism f ∈ W 1 , p ( ( − 1 , 1 ) n , R n ) such that J f = det D f > 0 on a set of positive measure and J f 0 on a set of positive measure. It follows that there are no diffeomorphisms (or piecewise affine homeomorphisms) f k such that f k → f in W 1 , p .
cuBool: Bit-Parallel Boolean Matrix Factorization on CUDA-Enabled Accelerators
2018
Boolean Matrix Factorization (BMF) is a commonly used technique in the field of unsupervised data analytics. The goal is to decompose a ground truth matrix C into a product of two matrices A and $B$ being either an exact or approximate rank k factorization of C. Both exact and approximate factorization are time-consuming tasks due to their combinatorial complexity. In this paper, we introduce a massively parallel implementation of BMF - namely cuBool - in order to significantly speed up factorization of huge Boolean matrices. Our approach is based on alternately adjusting rows and columns of A and B using thousands of lightweight CUDA threads. The massively parallel manipulation of entries …
Radio k-Labelings for Cartesian Products of Graphs
2005
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…
The rank of random regular digraphs of constant degree
2018
Abstract Let d be a (large) integer. Given n ≥ 2 d , let A n be the adjacency matrix of a random directed d -regular graph on n vertices, with the uniform distribution. We show that the rank of A n is at least n − 1 with probability going to one as n grows to infinity. The proof combines the well known method of simple switchings and a recent result of the authors on delocalization of eigenvectors of A n .
Cotas inferiores para el QAP-Arbol
1985
The Tree-QAP is a special case of the Quadratic Assignment Problem where the flows not equal zero form a tree. No condition is required for the distance matrix. In this paper we present an integer programming formulation for the Tree-QAP. We use this formulation to construct four Lagrangean relaxations that produce several lower bounds for this problem. To solve one of the relaxed problems we present a Dynamic Programming algorithm which is a generalization of the algorithm of this type that gives a lower bound for the Travelling Salesman Problem. A comparison is given between the lower bounds obtained by each ralaxation for examples with size from 12 to 25.
A Galton–Watson process with a threshold
2016
Abstract In this paper we study a special class of size dependent branching processes. We assume that for some positive integer K as long as the population size does not exceed level K, the process evolves as a discrete-time supercritical branching process, and when the population size exceeds level K, it evolves as a subcritical or critical branching process. It is shown that this process does die out in finite time T. The question of when the mean value E(T) is finite or infinite is also addressed.
Decomposable multiphase entropic descriptor
2013
To quantify degree of spatial inhomogeneity for multiphase materials we adapt the entropic descriptor (ED) of a pillar model developed to greyscale images. To uncover the contribution of each phase we introduce the suitable 'phase splitting' of the adapted descriptor. As a result, each of the phase descriptors (PDs) describes the spatial inhomogeneity attributed to each phase-component. Obviously, their sum equals to the value of the overall spatial inhomogeneity. We apply this approach to three-phase synthetic patterns. The black and grey components are aggregated or clustered while the white phase is the background one. The examples show how the valuable microstuctural information related…
Fractional calculus approach to the statistical characterization of random variables and vectors
2009
Fractional moments have been investigated by many authors to represent the density of univariate and bivariate random variables in different contexts. Fractional moments are indeed important when the density of the random variable has inverse power-law tails and, consequently, it lacks integer order moments. In this paper, starting from the Mellin transform of the characteristic function and by fractional calculus method we present a new perspective on the statistics of random variables. Introducing the class of complex moments, that include both integer and fractional moments, we show that every random variable can be represented within this approach, even if its integer moments diverge. A…
Moments for Some Kumaraswamy Generalized Distributions
2014
Explicit expansions for the moments of some Kumaraswamy generalized (Kw-G) distributions (Cordeiro and de Castro, 2011) are derived using special functions. We explore the Kw-normal, Kw-gamma, Kw-beta, Kw-t, and Kw-F distributions. These expressions are given as infinite weighted linear combinations of well-known special functions for which numerical routines are readily available.