WLAN / WMAN Integration Architecture and Traffic Control for Voice Transmission

The popular technologies Wi-Fi and WiMAX for realization of WLAN and WMAN respectively are much different, but they could compliment each other providing competitive wireless access for voice traffic. The article develops the idea of WLAN/WMAN (Wi-Fi/WiMAX) integration. WiMAX is offering a backup for the traffic overflowing from Wi-Fi cells located into the WiMAX cell. Overflow process is improved by proposed rearrangement control algorithm applied to the Wi-Fi voice calls. There are also proposed analytical models for system throughput evaluation and verification of the effectiveness using WMAN as a backup for WLAN overflow traffic and the proposed call rearrangement algorithm as well.

VoIP Traffic Shaping Analyses in Metropolitan Area Networks

This paper represents VoIP shaping analyses in devices that apply the three Quality of Service techniques – IntServ, DiffServ and RSVP. The results show queue management and packet stream shaping based on simulation of the three mostly demanded services – VoIP, LAN emulation and transaction exchange. Special attention is paid to the VoIP as the most demanding service for real time communication.

Perturbed Proximal Point Algorithm with Nonquadratic Kernel

Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, developed by R. T. Rockafellar [16], for solving the problem (P) ”To find x ∈ H such that 0 ∈ T x” is the proximal point algorithm. Several generalizations have been considered by several authors: introduction of a perturbation, introduction of a variable metric in the perturbed algorithm, introduction of a pseudo-metric in place of the classical regularization, . . . We summarize some of these extensions by taking simultaneously into account a pseudo-metric as regularization and a perturbation in an inexact version of the algorithm.

On the Relationships Among Quantified Autoepistemic Logic, its Kernel, and Quantified Reflective Logic

A Quantified Autoepistemic Logic is axiomatized in a monotonic Modal Quantificational Logic whose modal laws are slightly stronger than S5. This Quantified Autoepistemic Logic obeys all the laws of First Order Logic and its L predicate obeys the laws of S5 Modal Logic in every fixed-point. It is proven that this Logic has a kernel not containing L such that L holds for a sentence if and only if that sentence is in the kernel. This result is important because it shows that L is superfluous thereby allowing the ori ginal equivalence to be simplified by eliminating L from it. It is also shown that the Kernel of Quantified Autoepistemic Logic is a generalization of Quantified Reflective Logic, which coincides with it in the propositional case.

An Abstract Second Kind Fredholm Integral Equation with Degenerated Kernel

Mathematics Subject Classification: 44A40, 45B05

Representations of Inverse Functions by the Integral Transform with the Sign Kernel

Mathematics Subject Classification: Primary 30C40

On the Range and the Kernel of Derivations

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

Large and Moderate Deviations Principles for Recursive Kernel Estimator of a Multivariate Density and its Partial Derivatives

2000 Mathematics Subject Classification: 62G07, 60F10.