The burden on healthcare services in the world has increased substantially in the past decades. The quality and quantity of care have to increase to meet surging demands, especially among patients with chronic heart diseases. The expansion of information and communication technologies has led to new models for the delivery healthcare services in telemedicine. Therefore, mHealth plays an imperative role in the sustainable delivery of healthcare services in telemedicine. This paper presents a comprehensive review of healthcare service provision. It highlights the open issues and challenges related to the use of the real-time fault-tolerant mHealth system in telemedicine. The methodological aspects of mHealth are examined, and three distinct and successive phases are presented. The first discusses the identification process for establishing a decision matrix based on a crossover of `time of arrival of patient at the hospital/multi-services' and `hospitals' within mHealth. The second phase discusses the development of a decision matrix for hospital selection based on the MAHP method. The third phase discusses the validation of the proposed system.

Real-Time Fault-Tolerant mHealth System: Comprehensive Review of Healthcare Services, Opens Issues, Challenges and Methodological Aspects

This work presents a new reference architecture for multilayer autonomic systems called context-controlled autonomic controllers (ConAC). Usually, the principle of multiple system layers contradicts the principle of a global adaptation strategy, because system layers are considered to be black boxes. The presented architecture relies on an explicit context model, so a simple change of contexts can consistently vary the adaptation strategies for all layers. This reveals that explicit context modeling enables consistent meta-adaptation in multi-layer autonomic systems. The paper presents two application areas for the ConAC architecture, robotic co-working and energy-adaptive servers, but many other multi-layered system designs should benefit from it.

SOFSEM 2006: Theory and Practice of Computer Science

Spam filtering for short messages in adversarial environment

We investigate the class of context-free insertion-deletion systems. It is known that such systems are universal if the length of the inserted/deleted string is at least three. We show that if this length is bounded to two, then the obtained systems are not universal. We characterise the obtained class and we introduce a new complexity measure for insertion-deletion systems, which permits a better explanation of the obtained results.

On Minimal Context-Free Insertion-Deletion Systems

Matrix insertion-deletion systems

Insertion and deletion are considered to be the basic operations in Biology, more specifically in DNA processing and RNA editing. Based on these evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. Since the biological macromolecules can be viewed as symbols, the gene sequences can be represented as strings. This suggests that the molecular representations can be theoretically analyzed if a biologically inspired computing model recognizes various bio-molecular structures like pseudoknot, hairpin, stem and loop, cloverleaf and dumbbell. In this paper, we introduce a simple grammar system that encompasses many bio-molecular structures including the above mentioned structures. This new grammar system is based on insertion-deletion and matrix grammar systems and is called Matrix insertion-deletion grammars. Finally, we discuss how the ambiguity levels defined for insertion-deletion grammar systems can be realized in bio-molecular structures, thus the ambiguity issues in gene sequences can be studied in terms of grammar systems.

Matrix insertion-deletion systems for bio-molecular structures

Abstract Insertion and deletion are operations that occur commonly in DNA processing and RNA editing. Since biological macromolecules can be viewed as symbols, gene sequences can be represented as strings and structures can be interpreted as languages. This suggests that the bio-molecular structures that occur at different levels can be theoretically studied by formal languages. In the literature, there is no unique grammar formalism that captures various bio-molecular structures. To overcome this deficiency, in this paper, we introduce a simple grammar model called the matrix insertion–deletion system, and using it we model several bio-molecular structures that occur at the intramolecular, intermolecular and RNA secondary levels.

/pdf/modelling-dna-and-rna-secondary-structures-using-matrix-1ytb99hlz7.pdf

Modelling DNA and RNA secondary structures using matrix insertion–deletion systems

https://doi.org/10.1016/j.scs.2022.103713

An efficient hardware architecture based on an ensemble of deep learning models for COVID -19 prediction

Cloud management organisation is an imperative part of cloud computing platform and serving as the resource manager for cloud platforms. The multifaceted nature of cloud-management base makes its high availability (HA), a standout amongst the most necessities. Different innovations have been produced to build a consistent quality and availability of cloud administration infrastructure. In any case, little work concentrated on quantitative examination of its accessibility. While this ability accomplishes a developed availability with small fault rates, corporate requests conveyed over the autonomous zones may encounter unique Quality of Service (QoS) because of various physical frameworks. The key target of this paper is to show how the Markov-based model can fulfil the client request. For this reason, a few scenarios of the failure rate of virtual machine's practices, for example, single system failure, multiple system failures, power outage are considered by applying the Markov model. The improved repair strategies of accessibility in various circumstances are also investigated. The Queuing models like Markovian and non-Markovian models are examined using phase type expansion and renewal theory keeping in mind the end goal to sufficiently speak to and to assess. The considered element unwavering quality perspectives if there should be an occurrence of the most part dispersed lifetimes and times to repair.

http://www.inass.org/share/2017022817.pdf

Availability Modelling of Fault Tolerant Cloud Computing System

In DNA processing and RNA editing, gene insertion and deletion are considered as the basic operations. Based on the above evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper we study about ambiguity and complexity measures of these systems. First, we define the various levels of ambiguity (i = 0,1,2,3,4,5) for insertion-deletion systems. Next, we show that there are inherently i-ambiguous insertion-deletion languages which are j-unambiguous for the combinations (i, j) ∈ {(5,4), (4,2), (3,1), (3,2), (2,1),(0,1)}. Further, We prove an important result that the ambiguity problem of insertion-deletion system is undecidable. Finally, we define three new complexity measures TLength − Con, TLength − Ins, TLength − Del for insertion-deletion systems and analyze the trade-off between the newly defined ambiguity levels and complexity measures.

/pdf/on-the-ambiguity-and-complexity-measures-of-insertion-5f831g9dl9.pdf

Anand Mahendran

Papers

Matrix insertion-deletion systems for bio-molecular structures

Modelling DNA and RNA secondary structures using matrix insertion–deletion systems

An efficient hardware architecture based on an ensemble of deep learning models for COVID -19 prediction

Availability Modelling of Fault Tolerant Cloud Computing System

On the ambiguity and complexity measures of insertion-deletion systems