Search results for "Linear"
showing 10 items of 7165 documents
Unbounded Linear Operators in Hilbert Spaces
2002
In order to make this monograph self-contained, we summarize in this chapter some basic definitions and results for unbounded linear operators in a Hilbert space. In Section 1.1, we recall the definitions of C*-algebras and von Neumann algebras. In Section 1.2, we define and investigate the notion of closedness, the closure and the adjoint of an unbounded linear operator in a Hilbert space. Section 1.3 is devoted to the Cayley transform approach to the self-adjointness of a symmetric operator. Section 1.4 deals with the self-adjoint extendability of a symmetric operator with help of the deficiency spaces. In Section 1.5, we extend to unbounded self-adjoint operators the spectral theorem and…
Fast Decentralized Linear Functions via Successive Graph Shift Operators
2019
Decentralized signal processing performs learning tasks on data distributed over a multi-node network which can be represented by a graph. Implementing linear transformations emerges as a key task in a number of applications of decentralized signal processing. Recently, some decentralized methods have been proposed to accomplish that task by leveraging the notion of graph shift operator, which captures the local structure of the graph. However, existing approaches have some drawbacks such as considering special instances of linear transformations, or reducing the family of transformations by assuming that a shift matrix is given such that a subset of its eigenvectors spans the subspace of i…
Random effects elliptically distributed in unbalanced linear models
2008
In linear mixed effects models, random effects are used for modelling the variance-covariance structure of the response variable. These models are based on the assumption that the random effects are normally distributed, but in literature alternative random effect distributions have been proposed and the consequences of misspecification are investigated. These studies consider only balanced designs. Aim of this paper is to study an unbalanced linear mixed model with random effects elliptically distributed.
Robust estimation of mean electricity consumption curves by sampling for small areas in presence of missing values
2017
In this thesis, we address the problem of robust estimation of mean or total electricity consumption curves by sampling in a finite population for the entire population and for small areas. We are also interested in estimating mean curves by sampling in presence of partially missing trajectories.Indeed, many studies carried out in the French electricity company EDF, for marketing or power grid management purposes, are based on the analysis of mean or total electricity consumption curves at a fine time scale, for different groups of clients sharing some common characteristics.Because of privacy issues and financial costs, it is not possible to measure the electricity consumption curve of eac…
Some properties and applications of local second-order characteristics for spatio-temporal point processes on networks
2021
Point processes on linear networks are increasingly being considered to analyse events occurring on particular network-based structures. In this work, we extend Local Indicators of Spatio-Temporal Association (LISTA) functions to the non-Euclidean space of linear networks, allowing to obtain information on how events relate to nearby events. In particular, we propose the local version of two inhomogeneous second-order statistics for spatio-temporal point processes on linear networks, the K- and the pair correlation functions. We also show that these LISTA functions are useful for diagnostics of models specified on the networks, and can be helpful to assess the goodness-of-fit of different s…
Estimates for the Differences of Positive Linear Operators
2018
Trunk Packing Revisited
2007
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.
Selectivity in Probabilistic Causality: Where Psychology Runs Into Quantum Physics
2011
Given a set of several inputs into a system (e.g., independent variables characterizing stimuli) and a set of several stochastically non-independent outputs (e.g., random variables describing different aspects of responses), how can one determine, for each of the outputs, which of the inputs it is influenced by? The problem has applications ranging from modeling pairwise comparisons to reconstructing mental processing architectures to conjoint testing. A necessary and sufficient condition for a given pattern of selective influences is provided by the Joint Distribution Criterion, according to which the problem of "what influences what" is equivalent to that of the existence of a joint distr…
Connected and Autonomous Vehicles cooperate with the pedestrian in industrial sites based on trajectory optimization and vehicle signalization system
2020
Connected and autonomous vehicles (CAV) is the development trend in the field of transportation systems. Recent studies show that the resources sharing between pedestrians and CAV is a big challenge. Considering traffic safety and efficiency at that sharing point not only requires a collision avoidance system but also more communicative behaviors of the CAV. More precisely, pedestrian needs to understand the intention of the incoming CAV whether it will cross first or not according to its speed profile. This paper uses the optimal trajectory control to provide CAV with a communicative behavior. A scenario where CAV and pedestrian cooperate together to cross a conflict zone is studied. A com…
A Linear Programming Method for Bounding Plastic Deformations
1988
A method for providing upper and lower bounds to plastic deformations is presented, which has the feature of being applicable both below and above the structure shakedown limit. The bounds provided are expressed in terms of some fictitious plastic strains obeying relaxed yielding laws, whose evaluation is made by means of a suitable LP-based algorithm.