Related papers: On the weight distribution of linear sets with com…
We consider a finite mixture model with varying mixing probabilities. Linear regression models are assumed for observed variables with coefficients depending on the mixture component the observed subject belongs to. A modification of the…
The goal of confidence-set learning in the binary classification setting is to construct two sets, each with a specific probability guarantee to cover a class. An observation outside the overlap of the two sets is deemed to be from one of…
In this paper we prove that the weighted linear combination of products of the k-subsets of an n-set of positive real numbers with weight being the harmonic mean of their reciprocal sets is less than or equal to uniformly weighted sum of…
Sliding cable system with frictions is encountered in many engineering applications. Such system is typically characterized by existences of complex and varied motion states of different sliding nodes (pulleys), which leads to significant…
A vector composition of a vector $\mathbf{\ell}$ is a matrix $\mathbf{A}$ whose rows sum to $\mathbf{\ell}$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…
Hypothesis about the parallelism of the regression lines in R multivariate simple linear models are studied in this paper. Tests on common intercept and sets of lines intersected at a fixed value, are also developed. An application in an…
We consider a package assignment problem with multiple units of indivisible items. The seller can specify preferences over partitions of their supply between buyers as packaging costs. We propose incremental costs together with a graph that…
Extensions of previous linear regression models for interval data are presented. A more flexible simple linear model is formalized. The new model may express cross-relationships between mid-points and spreads of the interval data in a…
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
In this paper by using the measure of noncompactness concept, we present new fixed point theorems for multivalued maps. In further we introduce a new class of mappings which are general than Meir-Keeler mappings. Finally, we use these…
Let $S$ be a finite set of points in the plane and let $\mathcal{T}(S)$ be the set of intersection points between pairs of lines passing through any two points in $S$. We characterize all configurations of points $S$ such that iteration of…
Many data sources are naturally modeled by multiple weight assignments over a set of keys: snapshots of an evolving database at multiple points in time, measurements collected over multiple time periods, requests for resources served at…
We give a closed formula for the dimension of all linear systems in $\mathbb{P}^n$ with assigned multiplicity at arbitrary collections of points lying on a rational normal curve of degree $n$. In particular we give a purely geometric…
In this work we study a weak order ideal associated with the coset leaders of a non-binary linear code. This set allows the incrementally computation of the coset leaders and the definitions of the set of leader codewords. This set of…
Our goal is to compare two planar point sets by finding subsets of a given size such that a minimum-weight matching between them has the smallest weight. This can be done by a translation of one set that minimizes the weight of the…
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…
We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…
A new method for analyzing high-dimensional categorical data, Linear Latent Structure (LLS) analysis, is presented. LLS models belong to the family of latent structure models, which are mixture distribution models constrained to satisfy the…