Electrocardiogram (ECG) is an important physiological signal for cardiac disease diagnosis. With the increasing use of modern electrocardiogram monitoring devices that generate vast amount of data requiring huge storage capacity. In order to decrease storage costs or make ECG signals suitable and ready for transmission through common communication channels, the ECG data
volume must be reduced. So an effective data compression method is required. This paper presents an efficient technique for the compression of ECG signals. In this technique, different transforms have been used to compress the ECG signals. At first, a 1-D ECG data was segmented and aligned to a 2-D data array, then 2-D mixed transform was implemented to compress the

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an

For the graph ⁠, the behavior associated with to the majority of the graphical properties of this graph is covered in this article. The reflection of the capabilities of on the Ly constructions is one of the key ideas addressed throughout this paper. For instance, by this technique we can comprehend the mechanism via which groups of relatively tiny structure are exist within Ly.

In This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.

A significant challenge arises in the characterization of urban systems, especially regarding the intricate structures of Central Business Districts (CBDs). Conventional models seem insufficient, failing to comprehend the non-linear, network-oriented structure of the city's economic and social dynamics. This creates a disparity between the city's physical, geographical structure and the unseen processes occurring within it. The fundamental inquiry is thus configurational: how can we systematically examine the inherent spatial logic of the CBD to develop a more efficient and predictive planning model? This paper presents a theoretical and methodological model to explore this inquiry, which focuses on Lower Manhattan as the primary su

An intuitionistic fuzzy set was exhibited by Atanassov in 1986 as a generalization of the fuzzy set. So, we introduce cubic intuitionistic structures on a KU-semigroup as a generalization of the fuzzy set of a KU-semigroup. A cubic intuitionistic k-ideal and some related properties are introduced. Also, a few characterizations of a cubic intuitionistic k-ideal are discussed and new cubic intuitionistic fuzzy sets in a KU-semigroup are defined.

The Al-Shishtary is considered one of the well-known Andalus poets. His poetry represents a flood of kind emotions, springs from the sincere sources of Divine Love, and this is what we felt in his life and his literary prestige. He was a poet who was familiar withthe art of his timeknowsthe oldand popularintellectual assets ofIslamicSciencesof Sharee'a. This wide culture, which he had, is available to him through his many travels between the coasts of Syria, Egypt and others ... to become Imam of the religion way known as(Al-Shishtariyah)resonatedin the hearts ofthe general publicespecially the poor people. This showshis smoothand influential styleand his humanitarian andsimple words which resonate in the hearts of his followers, therefo

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to

The main idea of this research is to consider fibrewise pairwise versions of the more important separation axioms of ordinary bitopology named fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise -Hausdorff spaces, fibrewise pairwise functionally -Hausdorff spaces, fibrewise pairwise -regular spaces, fibrewise pairwise completely -regular spaces, fibrewise pairwise -normal spaces and fibrewise pairwise functionally -normal spaces. In addition we offer some results concerning it.