Access point selection in the network of Internet of things (IoT) considering the strategic behavior of the things and users

The Journal of Supercomputing - With the expansion in the use of IoT, increasing the efficiency of these networks has become even more significant. Objects need reliable communications at suitable...     

Transparent autonomization in CORBA

Increasingly, software systems are constructed by integrating and composing multiple existing applications. The resulting complexity increases the need for self-management of the system. However, adding autonomic behavior to composite systems is difficult, especially when the constituent components are heterogeneous and they were not originally designed to support such interactions. Moreover, entangling the code for self-management with the code for the business logic of the original applications may actually increase the complexity of the systems, counter to the desired goal. In this paper, we address autonomization of composite systems that use CORBA, one of the first widely used middleware platforms introduced more than 17 years ago that is still commonly used in numerous systems. We propose a model, called Adaptive CORBA Template (ACT), that enables autonomic behavior to be added to CORBA applications automatically and transparently, that is, without requiring any modifications to the code implementing the business logic of the original applications. To do so, ACT uses “generic” interceptors, which are added to CORBA applications at startup time and enable autonomic behavior to be introduced later at runtime. We have developed ACT/J, a prototype of ACT in Java. We describe a case study in which ACT/J is used to introduce three types of autonomic behavior (self-healing, self-optimization, and self-configuration) to a distributed surveillance application.     

Sparse representation based facial image compression via multiple dictionaries and separated ROI

Multimedia Tools and Applications - Constant increasing of visual information necessitates most efficient image compression schemes for saving storage space or reducing required transmission...     

On the stability issues of switched singular time‐delay systems with slow switching based on average dwell‐time

The issue of exponential stability analysis of continuous‐time switched singular systems consisting of a family of stable and unstable subsystems with time‐varying delay is investigated in this paper. It is very difficult to analyze the stability of such systems because of the existence of time‐delay and unstable subsystems. In this regard, on the basis of the free‐weighting matrix approach, by constructing the new Lyapunov‐like Krasovskii functional, and using the average dwell‐time approach, delay‐dependent sufficient conditions are derived and formulated in terms of LMIs to check the exponential stability of such systems. This paper also highlights the relationship between the average dwell‐time of the switched singular time‐delay system, its stability, exponential convergence rate of differential states, and algebraic states. Finally, a numerical example is given to confirm the analytical results and illustrate the effectiveness of the proposed strategy. Copyright © 2012 John Wiley & Sons, Ltd.     

Using mobile node speed changes for movement direction change prediction in a realistic category of mobility models

In order to evaluate performance of protocols for ad hoc networks, the protocols have to be tested under realistic conditions. These conditions may include a reasonable transmission range, a limited buffer size, and realistic movement of mobile users (mobility models). In this paper, we propose a new and realistic type of random mobility models in which the mobile node has to decelerate to reach the point of direction change and accelerates with a defined acceleration to reach its intended speed. This realistic mobility model is proposed based on random mobility models. In reality, mobile objects tend to change their speed when they are going to change their direction, i.e. decelerate when approaching a direction change point and accelerate when they start their movement in a new direction. Therefore, in this paper, we implement this behavior in random mobility models which lack such specification. In fact, this paper represents our effort to use this accelerated movement to anticipate a probable direction change of a mobile node with reasonable confidence. The simulation type of this paper is based on traces produced by a mobility trace generator tool. We use a data mining concept called association rule mining to find any possible correlations between accelerated movement of mobile node and the probability that mobile node wants to change its direction. We calculate confidence and lift parameters for this matter, and simulate this mobility model based on random mobility models. These simulations show a meaningful correlation between occurrence of an accelerated movement and event of mobile node's direction change.     

Correction to: Automatic COVID-19 detection mechanisms and approaches from medical images: a systematic review

Multimedia Tools and Applications -     

Lack of associative filters in lattice implication algebras

Jun et al. (Bull Korean Math Soc 35(1):53–61, 1998) introduced the notion of associative filters in lattice implication algebra and studied some of its properties. In this paper, we show that there is no associative filter in lattice implication algebra.     

Formal process algebraic modeling,verification, and analysis of an abstract Fuzzy Inference Cloud Service

In cloud computing, services play key roles. Services are well defined and autonomous components. Nowadays, the demand of using Fuzzy inference as a service is increasing in the domain of complex and critical systems. In such systems, along with the development of the software, the cost of detecting and fixing software defects increases. Therefore, using formal methods, which provide clear, concise, and mathematical interpretation of the system, is crucial for the design of these Fuzzy systems. To obtain this goal, we introduce the Fuzzy Inference Cloud Service (FICS) and propose a novel discipline for formal modeling of the FICS. The FICS provides the service of Fuzzy inference to the consumers. We also introduce four novel formal verification tests, which allow strict analysis of certain behavioral disciplines in the FICS as follows: (1) Internal consistency, which analyzes the service in a strict and delicate manner; (2) Deadlock freeness; (3) Divergence freeness; and (4) Goal reach ability. The four tests are discussed and the FICS is verified to ensure that it can pass all these tests.     

A Combinational Perspective in Stimulating Cooperation in Mobile Ad Hoc Networks

In wireless ad hoc networks cooperation among nodes cannot always be assumed since nodes with limited resources and different owners are capable of making independent decisions. Cooperation problems in topology control and packet forwarding tasks have been mostly studied separately but these two tasks are not independent. Considering a joint cooperation problem by taking into account dependencies between tasks will result in more reliable and efficient networks. In this paper topology control definition is extended to cover cooperation problem in both packet forwarding and topology control in a single problem. In this definition nodes have to adjust their transmission power and decide on their relay role. This paper models the interactions of nodes as a potential game with two-dimensional utility function. The presented model, named TCFORCE (Topology Control packet FORwarding Cooperation Enforcement), preserves the network connectivity and reduces the energy consumption by providing cooperative paths between all pairs of nodes in the network.