Measure functions for frames

This paper addresses the natural question: “How should frames be compared?” We answer this question by quantifying the overcompleteness of all frames with the same index set. We introduce the concept of a frame measure function: a function which maps each frame to a continuous function. The comparison of these functions induces an equivalence and partial order that allows for a meaningful comparison of frames indexed by the same set. We define the ultrafilter measure function, an explicit frame measure function that we show is contained both algebraically and topologically inside all frame measure functions. We explore additional properties of frame measure functions, showing that they are additive on a large class of supersets—those that come from so called non-expansive frames. We apply our results to the Gabor setting, computing the frame measure function of Gabor frames and establishing a new result about supersets of Gabor frames.     

An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems

Structural redundancies in mathematical programming models are nothing uncommon and nonlinear programming problems are no exception. Over the past few decades numerous papers have been written on redundancy. Redundancy in constraints and variables are usually studied in a class of mathematical programming problems. However, main emphasis has so far been given only to linear programming problems. In this paper, an algorithm that identifies redundant objective function(s) and redundant constraint(s) simultaneously in multi-objective nonlinear stochastic fractional programming problems is provided. A solution procedure is also illustrated with numerical examples. The proposed algorithm reduces the number of nonlinear fractional objective functions and constraints in cases where redundancy exists.     

A redundant Klee–Minty construction with all the redundant constraints touching the feasible region

We have previously shown, by redundant Klee–Minty constructions, that the central path may arbitrarily closely visit every vertex of the Klee–Minty cube. In those constructions, the redundant constraints are far away from the feasible region. In this paper, we provide a construction in which all redundant constraints touch the feasible region.     

Multiblock redundancy analysis: interpretation tools and application in epidemiology

For the purpose of exploring and modeling the relationships between a dataset Y and several datasets () measured on the same individuals, multiblock Partial Least Squares is a regression technique which is widely used, particularly in process monitoring, chemometrics and sensometrics. In the same vein, a new multiblock method, called multiblock Redundancy Analysis, is proposed. It is introduced by maximizing a criterion that reflects the objectives to be addressed. The solution of this maximization problem is directly derived from the eigenanalysis of a matrix. In addition, this method is related to other multiblock methods. Multiblock modeling methods provide to the user a large spectrum of interpretation indices for the investigation of the relationships among variables and among datasets. They are related to the criterion to maximize and therefore directly derived from the maximization problem under consideration. The interest of multiblock Redundancy Analysis and the associated interpretation tools are illustrated using a dataset in the field of veterinary epidemiology. Copyright © 2011 John Wiley & Sons, Ltd.     

Some properties of cliques in 0–1 mixed integer programs

Summary In this note we present new properties of cliques induced constraints straintsX(C _r ⁺ )-X(C _r ^- ) ≤ 1 - |C _r ^- | for λ εS, whereS is the set of cliques that are implied by 0–1 mixed integer programs. These properties allow to further fixing of 0–1 variables, to detect instance's infeasibility and to imply new cliques.     

Power-of-two sampling in redundancy systems: The impact of assignment constraints

A classical sampling strategy for load balancing policies is power-of-two, where any server pair is sampled with equal probability. This does not cover practical settings with assignment constraints which force non-uniform sampling. While intuition suggests that non-uniform sampling adversely impacts performance, this was only supported through simulations, and rigorous statements have remained elusive. Building on product-form distributions for redundancy systems, we prove the stochastic dominance of uniform sampling for a four-server system as well as arbitrary-size systems in light traffic.     

SpaceWire冗余网络故障检测恢复技术实现

为提高SapceWire网络可靠性,基于SpaceWire-D提出了一种应用于SpaceWire冗余网络的故障检测恢复技术。网络节点通过比较主、备份端口收到的时间码来判断链路故障状态,在确认主链路发生故障后,节点自动启用备份端口工作。通过引入时间码抖动容限参数,提高了节点对故障判断的准确性,避免了故障误判。测试结果表明,即使故障链路未与节点直接连接,节点也能够在一个时间槽长度内检测到链路故障并自动切换至备份链路。此技术保证了网络故障情况下的数据正确传输,提高了SpaceWire网络的可靠性,是一种稳定可靠的故障检测恢复技术。     

Real-Time Multibody System Dynamic Simulation: Part I. A Modified Recursive Formulation and Topological Analysis

ABSTRACT

ABSTRACT With the advent of parallel computers and recursive dynamics formulations, multibody mechanical systems such as ground vehicles can be simulated in real time. This permits the engineer to rapidly modify design parameters, evaluate dynamic performance, and improve designs, prior to fabrication and testing. Perhaps more important, real-time simulation can be used for simulation with the operator-in-the-loop, permitting system design to be optimized for the capability of the human operator. To achieve the goal of real-time simulation, a modified recursive dynamics formulation and a topological analysis method for the formulation are presented in Part I. A parallel computational algorithm that exploits inherent parallelism in the modified recursive formulation and numerical results will be presented in Part II. By combining the topological analysis method and the parallel algorithm, an efficient general-purpose dynamic simulation method is developed for real-time simulation on shared memory parallel processors.     

A note for tightening 0–1 models

We describe two approaches for 0–1 program model tightening that are based on the coefficient increasing and reduction methods proposed in Dietrich, Escudero and Chance (1993). We present some characterizations for the new formulations to be tighter than the original model. It can be shown that tighter models can be obtained even when applying any of both approaches to a redundant constraint; see Escudero and Muñoz (1998). We also present some situations where these approaches cannot be applied.     

Interactions

Given a C^∗-algebra B, a closed ^*-subalgebra A⊆B, and a partial isometry S in B which interacts with A in the sense that S^∗aS=H(a)S^∗S and SaS^∗=V(a)SS^∗, where V and H are positive linear operators on A, we derive a few properties which V and H are forced to satisfy. Removing B and S from the picture we define an interaction as being a pair of maps (V,H) satisfying the derived properties. Starting with an abstract interaction (V,H) over a C^∗-algebra A we construct a C^∗-algebra B containing A and a partial isometry S whose interaction with A follows the above rules. We then discuss the possibility of constructing a covariance algebra from an interaction. This turns out to require a generalization of the notion of correspondences (also known as Pimsner bimodules) which we call a generalized correspondence. Such an object should be seen as an usual correspondence, except that the inner-products need not lie in the coefficient algebra. The covariance algebra is then defined using a natural generalization of Pimsner's construction of the celebrated Cuntz-Pimsner algebras.