On the approximation by convolution operators in homogeneous Banach spaces on R^d

AMS Subject Classification 2010: 41A25, 41A35, 41A40, 41A63, 41A65, 42A38, 42A85, 42B10, 42B20

Averaging operators and set-valued maps

MSC 2010: 54C35, 54C60.

Linear Colligations and Dynamic System Corresponding to Operators in the Banach Space

2000 Mathematics Subject Classification: Primary 47A48, 93B28, 47A65; Secondary 34C94.

Pseudodifferential Operators and Weighted Normed Symbol Spaces

2000 Mathematics Subject Classification: 35S05.

On The Cauchy Problem for Non Effectively Hyperbolic Operators, The Ivrii-Petkov-Hörmander Condition and the Gevrey Well Posedness

2000 Mathematics Subject Classification: 35L15, Secondary 35L30.

Spectra of Ruelle Transfer Operators for Contact Flows

In this survey article we discuss some recent results concerning strong spectral estimates for Ruelle transfer operators for contact flows on basic sets similar to these of Dolgopyat obtained in the case of Anosov flows with C1 stable and unstable foliations. Some applications of Dolgopyat's results and the more recent ones are also described.

Spectral Shift Function for the Perturbations of Schrödinger Operators at High Energy

2000 Mathematics Subject Classification: 35P20, 35J10, 35Q40.

Generalized D-Symmetric Operators I

2000 Mathematics Subject Classification: Primary: 47B47, 47B10; secondary 47A30.

Potapov-Ginsburg Transformation and Functional Models of Non-Dissipative Operators

2000 Mathematics Subject Classification: Primary 47A20, 47A45; Secondary 47A48.

Weighted Approximation by a Class of Bernstein-Type Operators

AMS classification: 41A36, 41A10, 41A25, 41Al7.

On the Approximation by Convolution Operators in Homogeneous Banach Spaces of Periodic Functions

AMS Subject Classification 2010: 41A25, 41A27, 41A35, 41A36, 41A40, 42Al6, 42A85.

Wave Operators for Defocusing Matrix Zakharov-Shabat Systems with Pnonvanishing at Infinity

2000 Mathematics Subject Classification: Primary: 34L25; secondary: 47A40, 81Q10.

Improving energy efficiency in a wireless sensor network by combining cooperative MIMO with data aggregation

In wireless sensor networks where nodes are powered by batteries, it is critical to prolong the network lifetime by minimizing the energy consumption of each node. In this paper, the cooperative multiple-input-multiple-output (MIMO) and data-aggregation techniques are jointly adopted to reduce the energy consumption per bit in wireless sensor networks by reducing the amount of data for transmission and better using network resources through cooperative communication. For this purpose, we derive a new energy model that considers the correlation between data generated by nodes and the distance between them for a cluster-based sensor network by employing the combined techniques. Using this model, the effect of the cluster size on the average energy consumption per node can be analyzed. It is shown that the energy efficiency of the network can significantly be enhanced in cooperative MIMO systems with data aggregation, compared with either cooperative MIMO systems without data aggregation or data-aggregation systems without cooperative MIMO, if sensor nodes are properly clusterized. Both centralized and distributed data-aggregation schemes for the cooperating nodes to exchange and compress their data are also proposed and appraised, which lead to diverse impacts of data correlation on the energy performance of the integrated cooperative MIMO and data-aggregation systems.

Additive and multiplicative properties of scoring methods for preference aggregation

The paper reviews some additive and multiplicative properties of ranking procedures used for generalized tournaments with missing values and multiple comparisons. The methods analysed are the score, generalised row sum and least squares as well as fair bets and its variants. It is argued that generalised row sum should be applied not with a fixed parameter, but a variable one proportional to the number of known comparisons. It is shown that a natural additive property has strong links to independence of irrelevant matches, an axiom judged unfavourable when players have different opponents.

On the additivity of preference aggregation methods

The paper reviews some axioms of additivity concerning ranking methods used for generalized tournaments with possible missing values and multiple comparisons. It is shown that one of the most natural properties, called consistency, has strong links to independence of irrelevant comparisons, an axiom judged unfavourable when players have different opponents. Therefore some directions of weakening consistency are suggested, and several ranking methods, the score, generalized row sum and least squares as well as fair bets and its two variants (one of them entirely new) are analysed whether they satisfy the properties discussed. It turns out that least squares and generalized row sum with an appropriate parameter choice preserve the relative ranking of two objects if the ranking problems added have the same comparison structure.