Localized eigenfunctions in the two-dimensional spectral problem containing a small parameter with higher derivatives are constructed on expected solution form. Localization this context means that exponentially decays both direc-tions starting from "weakest" point or line. The constructions based algo-rithm introduced by V.P. Maslov. A modification of algorithm for thin shell theory problems i...

In this paper, an algorithm based on penalty cost function for synthesizing flat-top patterns is proposed. A descent algorithm (DA) as its optimizing approach is proposed in this paper as well. Apparently, whole algorithm efficiency totally depends on the DA. Unlike traditional descent method, the DA defines step length by solving a inequality, instead of Wolf or Armijo-type search rule, stimul...

Interference and multipath is one of the current issues in a wireless communication system, with complicated scenarios of environment especially in urban areas with a high number of users. Introducing smart antenna systems at the base station can contribute to reducing interference and improve quality of service. This paper proposes and explores the application of artificial immune system and n...

Adaptive interaction is a new approach to introduce adaptability into man made systems In this approach a system is decomposed into interconnected subsystems that we call devices and adaptation occurs in the interactions More precisely interac tion weights among these devices will be adapted in order to achieve the objective of minimizing a given cost function The adaptation algorithm developed...

This paper presents an algorithm for distributed garbage collection and outlines its implementation within the Network Objects system The algorithm is based on a reference listing scheme which is augmented by partial tracing in order to collect distributed garbage cy cles Processes may be dynamically organised into groups according to appropriate heuristics to reclaim distributed garbage cycles...

Distributed video coding (DVC) reverses the traditional coding paradigm of complex encoders allied with basic decoding, to one where the computational cost is largely incurred by the decoder. This enables low-cost, resource-poor sensors to be used at the transmitter in various applications including multi-sensor surveillance. A key constraint governing DVC performance is the quality of side inf...

In this paper we present a.n efficient pa.ra.Ilel algorithm. for polygon tria.ngu.Ia.tion. The algo-rithm we present runs in O(logn) time using D(n) processors, which is optimal if the polygon is allowed to contain holes. This improves the previous parallel complexity bounds for this problem by a log n factor. If we are also given a trapezoidal decomposition of the polygon as input, then we can...

We explore the issue of re ning an exis tent Bayesian network structure using new data which might mention only a subset of the variables Most previous works have only considered the re nement of the net work s conditional probability parameters and have not addressed the issue of re n ing the network s structure We develop a new approach for re ning the network s structure Our approach is base...

Modern composite scientific applications, also called scientific work‐ flows, require large processing capacities. Cloud environments provide high performance and flexible infrastructure, which can be easily employed for work‐ flows execution. Since cloud resources are paid in the most cases, there is a need to utilize these resources with maximal efficiency. In this paper we propose dynamic re...

This work develops a fully decentralized variance-reduced learning algorithm foron-device intelligence where nodes store and process the data locally and are onlyallowed to communicate with their immediate neighbors. In the proposed algo-rithm, there is no need for a central or master unit while the objective is to enablethe dispersed nodes to learn the exact global model de...