Weak and strong stabilization of linear systems

We study the problem of stabilizing a distributed linear system on a subregion of its geometrical domain. We are concerned with two methods： the first approach enables us to characterize a stabilizing control via the steady state Riccati equation, and the second one is based on decomposing the state space into two suitable subspaces and studying the projections of the initial system onto such subspaces. The obtained results are performed through various examples.     

Agent-based time delay margin in consensus of multi-agent systems by an event-triggered control method: Concept and computation

This paper deals with defining the concept of agent-based time delay margin and computing its value in multi-agent systems controlled by event-triggered based controllers. The agent-based time delay margin specifying the time delay tolerance of each agent for ensuring consensus in event-triggered controlled multi-agent systems can be considered as complementary for the concept of (network) time delay margin, which has been previously introduced in some literature. In this paper, an event-triggered control method for achieving consensus in multi-agent systems with time delay is considered. It is shown that the Zeno behavior is excluded by applying this method. Then, in a multi-agent system controlled by the considered event-triggered method, the concept of agent-based time delay margin in the presence of a fixed network delay is defined. Moreover, an algorithm for computing the value of the time delay margin for each agent is proposed. Numerical simulation results are also provided to verify the obtained theoretical results.     

Modulation Based Combination of High Level Features Generated from SCCF & Contourlet Transforms for CBIR Applications

The need for suitable and cost-effective technologies rise with the growth of the internet of things (IoT) applications. These aim at handling voluminous data transmission in addition to minimum energy and latency cost constraints. LoRa networks are recommended for applications in confined spaces, long ranges, and less battery consumption requirements. However, the end devices in these networks communicate to all gateways in their ranges, thereby expediting energy unproductively in redundant transmissions. In our article, we explore the possibilities of whether LoRa networks could employ the advantages of clustering and propose two algorithms, path-based and data-centric, for such networks. We suggest that LoRaWAN technology with clustering can be apt for long-range, low power consumption IoT applications in the future. We study the impact of network density, node range, and cluster range on the energy consumption in data transmissions. The algorithms are compared with the inherent star-based communication of LoRa networks based on energy consumed, and our results show that, for dense deployments, clustering becomes advantageous.

     

An Improvement Energy Consumption Policy Using Communication Reduction in Wireless Body Sensor Network

Dedicated short-range communications (DSRC) is an important wireless technology for current and future automotive safety and mitigation of traffic jams. In this work, we have designed a Coplanar waveguide microstrip patch antenna with linear, upper and bottom and side slots for application in DSRC. The patch antenna was designed using glass epoxy substrate (FR4). Various parametric analyses such as the current distribution, reflection coefficient, radiation pattern on E- and H-plane as well as the realized gain (dB) were performed. The results were obtained by simulation using high-frequency structure simulator tool. The proposed antenna covers a frequency band of 5.8–5.9 GHz which is highly dedicated to the DSRC wireless communication technology for enhancement of safety of the automotive transport system. The designed antenna shows a good return loss of ??19 dB at 5.9 GHz.The designed antenna shows a promising gain, return loss and radiation pattern for use in DSRC for automotive transport systems.

     

Effect of Ag‐NPs synthesised by Chamaemelum nobile extract on the inflammation and oxidative stress induced by carrageenan in mice paw

An environmentally friendly and rapid procedure was developed to synthesise silver nanoparticles (Ag‐NPs) by Chamaemelum nobile extract and to evaluate its in vivo anti‐inflammatory and antioxidant activities. The ultraviolet–visible absorption spectrum of the synthesised Ag‐NPs showed an absorbance peak at 422. The average size of spherical nanoparticles was 24 nm as revealed by transmission electron microscopy. Fourier transform infra‐red spectroscopy analysis supported the presence of biological active compounds involved in the reduction of Ag ion and X‐ray diffraction confirmed the crystalline structure of the metallic Ag. The anti‐inflammatory and antioxidant activity of the Ag‐NPs was investigated against carrageenan‐induced paw oedema in mice. The levels of malondialdehyde (MDA) and antioxidant enzymes superoxide dismutase, catalase, glutathione peroxidase and inflammatory cytokines tumour necrosis factor (TNF‐α), interferon gamma and interleukin (IL)‐6, IL‐1β were assessed in this respect. The results demonstrated that anti‐inflammatory activity of the Ag‐NPs might be due to the ability of the nanoparticles to reduce IL‐1β, IL‐6 and TNF‐α. Moreover, reduction of antioxidant enzymes along with an increase in MDA level shows that the anti‐inflammatory activity of the synthesised Ag‐NPs by C. nobile is attributed to its ameliorating effect on the oxidative damage.Inspec keywords: silver, nanoparticles, nanofabrication, ultraviolet spectra, visible spectra, particle size, transmission electron microscopy, Fourier transform infrared spectra, X‐ray diffraction, crystal structure, enzymes, molecular biophysics, tumours, biomedical materials, nanomedicineOther keywords: Chamaemelum nobile extract, oxidative stress, mice paw, silver nanoparticles, antiinflammatory activity, antioxidant activity, ultraviolet‐visible absorption spectrum, spherical nanoparticle size, transmission electron microscopy, Fourier transform infrared spectroscopy, biological active compounds, X‐ray diffraction, crystalline structure, carrageenan‐induced paw oedema, malondialdehyde, antioxidant enzymes, superoxide dismutase, catalase, glutathione peroxidase, inflammatory cytokines, tumour necrosis factor, interferon gamma, interleukin, IL‐1β, IL‐6, TNF‐α, MDA level, Ag     

On the performance of different capability indices under normal and non-normal distributions

In this article, we have examined the performance of some useful capability indices using normal and non-normal distributions. The confidence intervals are calculated and mean coverage rates are observed for different capability indices. The effects of symmetry and kurtosis of parent distributions are examined on the mean coverage rates of different capability indices. Moreover, we have investigated the robustness (of confidence interval) using the median and percentile-based indices. We have considered the well-known distributions including normal, gamma, t, Weibull, and chi-squared. For these process scenarios, we have observed that some indices resist disturbance only in symmetry of the parent distribution, some resist the disturbance in symmetry and kurtosis of the distribution, and some indices don’t resist against either type of disturbance.     

Adaptive sliding mode control of chaotic dynamical systems with application to synchronization

We address the problem of control and synchronization of a class of uncertain chaotic systems. Our approach follows techniques of sliding mode control and adaptive estimation law. The adaptive algorithm is constructed based on the sliding mode control to ensure perfect tracking and synchronization in presence of system uncertainty and external disturbance. Stability of the closed-loop system is proved using Lyapunov stability theory. Our theoretical findings are supported by simulation results.     

Task migration in three-dimensional meshes

As a result of the emerging use of mesh-based multicomputers (and recently mesh-based multiprocessor systems-on-chip), issues related to processor management have attracted much attention. In a mesh-based multiprocessor, after repeated submesh allocations and de-allocations, the system network may be fragmented, i.e. there might be unallocated nodes in the network. As a result, in a system with contiguous processor allocation, no new tasks can start running due to the lack of enough free adjacent processors to form a suitable submesh. Although there might be enough free processors available, they remain idle until the allocator can find a set of adjacent free nodes forming a submesh to be used for the new task. This can lead to low system performance. Task migration was introduced as a solution to this problem through migration of tasks running on some submeshes to other free areas in order to reduce fragmentation by chaining the newly freed areas and disengaging nodes to form larger submeshes. In this paper, we propose a novel structured and formulated way to code task migration, which is helpful for congestion detection in different steps of task migration algorithms. Moreover, considering the fact that the 3D mesh-based multicomputers are now very popular, a new task migration algorithm in 3D meshes is proposed. We also address the special case of the 2D migration in a 3D mesh multicomputer.     

An efficient optimal algorithm for the quantity discount problem in material requirement planning

An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various environments has been developed. Experimental results show that the performance of our optimal algorithm is much better than the performance of other existing optimal algorithms. Considering computational time as the performance measure, this algorithm is considered the best among the existing optimal algorithms for real problems with large dimensions (i.e. large number of periods and discount levels).