Model Based Coding is an idea from the early ages of video telephony. This idea was conceptually as follows: To achieve very low bitrate coding a model of a speaking person was encoded only once and for the remaining telephone call single motion parameters were update only. As network capacities increased the use case of video telephony for video transmission under tough bandwidth constraints c...

A positive real interval, [a, b] can be partitioned into sub-intervals such that sub-interval widths divided by sub-interval ”‘average”’ values remains constant. That both Arithmetic Mean and Geometric Mean ”‘average”’ values produce constant ratios for the same log scale is the stated invariance proved in this short note. The continuous analog is briefly considered and shown to have similar pr...

OBJECTIVES In order to measure occupational exposure concentrations of ethyl tertiary-butyl ether (ETBE), we developed a diffusive sampling method for monitoring ETBE and performed an ETBE exposure assessment. METHODS The applicability of diffusive samplers was examined by exposing the samplers to ETBE vapor in test chambers. The personal exposure levels of workers and airborne concentrations...

We propose a distributed algorithm for allocating bandwidth in stable ad hoc networks. After having discussed the problem of bandwidth allocation in such networks, we define a sequence of feasible solutions to this problem. This sequence has the property to be an increasing sequence in terms of overall used bandwidth. After a theoretical analysis of the sequence, we design a distributed algorit...

This paper proposes a robust design optimization methodology under design uncertainties of an aerospace vehicle propulsion system. The approach consists of 3D geometric design coupled with complex internal ballistics, hybrid optimization, worst-case deviation, and efficient statistical approach. The uncertainties are propagated through worst-case deviation using first-order orthogonal designmat...

In combinatorial optimization, and particularly in location problems, the most used robustness criteria rely either on maximal cost or on maximal regret. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-robustness, which compensates for the drawbacks of the criteria based on the worst case. We apply t...

We continue the study of communication cost of computing functions when inputs are distributed amongk processors, each of which is located at one vertex of a network/graph called a terminal. Every other node ofthe network also has a processor, with no input. The communication is point-to-point and the cost is the totalnumber of bits exchanged by the protocol, in the worst case, ...

We present Ω(n) lower bounds on the worst case time to perform a single instance of an operation in any non-blocking implementation of a large class of concurrent data structures shared by n processes. Time is measured by the number of stalls a process incurs as a result of contention with other processes. For standard data structures such as counters, stacks, and queues, our bounds are tight. ...

In the last decade, several robustness approaches have been developed to deal with uncertainty. In decision problems, and particularly in location problems, the most used robustness approach rely either on maximal cost or on maximal regret criteria. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called lexicographic α-rob...

Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...