Preprint
Article

Modeling Analysis of COVID-19 in View Point of Rough Topology

This version is not peer-reviewed.

Submitted:

26 May 2023

Posted:

31 May 2023

You are already at the latest version

A peer-reviewed article of this preprint also exists.

Abstract
Work done by us shows that rough topology is a good tool for dealing with things that happen in the real world. The concept of ”basis” has been used to show out the deciding elements of the recent outbreak of COVID-19 that was reported all over the world.
Keywords: 
Subject: 
Computer Science and Mathematics  -   Mathematics
Preprints on COVID-19 and SARS-CoV-2

1. Introduction and Preliminaries

Rough set is a novel mathematical technique for dealing with ambiguity in knowledge-based systems, market research, and information systems [1]. This concept has several applications in domains such as medical diagnosis and economics. Other rough sets models were shown in [1,2,3,4, 5,6,7, 11, 16, 25, 26, 35, 38, 39, 44, 45, 49, 50, 51].
There was no human event that was able to restrict the face of life on the earth in a significant and continuous manner. But if we look at the emerging corona virus (Covid-19) which hardly has any weight, as specialists said that the weight of all corona viruses that infected millions in the world does not reach only two grams, so it had a stronger effect than atomic weapons, and then the Talking about Corona, which killed and infected millions in the world does not stop at just looking for a cure, but also about the aftershocks and effects that it leaves sooner or later, the signs of which appeared since the virus began to spread in all countries of the world most of which raised the slogan of myself. With the increasing information available now about the Corona virus, scientists are now working on using modern tools and techniques to be able to analyze the numbers, as a laboratory at the University of California, in cooperation with the Energy Lab, creates new algorithms using mathematical programming tools and computers so that the analysis process at the present time for the Corona virus epidemic is more feasible and effective. Scientists’ efforts and response to the Corona pandemic: Clear fingerprints made by scientists and researchers in virology from all over the world in the face of the emerging Covid-19, which the world has joined together with all its capabilities to reach a treatment or vaccine for it since its appearance in December 2019 in Wuhan, China, and its spread throughout the world, causing deaths and injuries by millions. The current research is conducted on several axes: The first axis: related to vaccine research, which sets the end points for this nightmare, and healthy people will have to prevent it. As for the parallel axis, it is the discovery of the medicine that the patient takes to recover from the virus, and in this regard, some recommended medicines have been authorized for the treatment of other diseases. Currently , the appearance of a new human COVID-19, has become a major public health concern due to its ability to cause many respiratory tract infections in people. Human-to-human transmissions have been reported with incubation times ranging from 2 to 10 days, making it easier for the virus to transmit through droplets, contaminated hands, or contaminated surfaces. From a research [9], Human corona viruses can survive for up to 9 days on nonliving surfaces. Most two impact factors for infections transmission namely Contact with infected surfaces and Interactions with infected people of the virus. In the present section, we introduce an application to show how our approaches are the best tools in decision making about the infection of COVID-19. Accordingly, numerous researchers have published numerous articles on this pernicious virus (for instance, see the references [8,9,10,11,12,13][13, 24, 27, 28, 40, 41]) and their literatures.
COVID-19 has emerged as a deadly virus. This lethal virus has engulfed the entire world, and many individuals have accepted death as a result of this unstoppable bug. With each passing second, the death toll rises. This article seeks to assist in identifying the symptoms that have the most impact on the disease’s spread. COVID-19 affects people differently, and some people who get it have mild to moderate symptoms and recover without needing to go to the hospital. A Topology is a subfield of geometry known as rubber sheet geometry. Topology has numerous real-world applications and resolves several issues relating to continuity, either directly or indirectly. Its study does not depend on the dimension, i.e. increasing or decreasing can happen without cutting. Using the neighborhood system, graphs are represented topologically and vice versa for some types of topologies. Recently, graphs, multisets and rough sets are used to represent structures such as the human heart [22], DNA [23] and medicine [24,25,26]which are useful in medicine, physics, and biology.
Topological concepts play a vital role in rough set may be useful in determining the causes of disease outbreaks and how to treat them. Also studying mutations that occur in genes and diseases and help in finding solutions We use the data set as an information system, mathematical tools and studies to help the expert in decision making. The information systems of people and patients with COVID-19 can be classified via rough set theory and some topological structures. The significance of our paper in studying the critical factors influencing the spread of COVID-19.
In this paper, we have shown that rough topology can be used to solve problems in the real world. The notion of basis has been employed in order to determine the determinants of a recent outbreak of the virus "COVID-19," which has been reported widely throughout the world. In this study, the rough topological model matches up well with medical specialists in terms of clinical use.

2. Preliminaries

Definition 2.1.
[14] Let U be a universe of discourse, and R an equivalence relation on U. Then, H = ( U , R ) is called an approximation structure. For any subset X 1 U , is called the lower approximations ( L a p p ) , upper approximations ( U a p p ) , are defined as:
L a p p ( X 1 ) = { x 1 U : [ x 1 ] R X 1 } ,
U a p p ( X 1 ) = { x 1 U : [ x 1 ] R X 1 ϕ } ,
B R ( X 1 ) = U a p p ( X 1 ) L a p p ( X 1 ) .
Proposition 2.2.
[14] If ( U ,R) is an approximation structure. and X 1 , Y 1 U , then:
( i ) L a p p ( X 1 ) X 1 U a p p ( X 1 ) .
( i i ) L a p p ( ϕ ) = U a p p ( ϕ ) = ϕ a n d L a p p ( U ) = U a p p U ( ϕ ) = U .
( i i i ) U a p p ( X 1 Y 1 ) = U a p p ( X 1 ) U a p p ( Y 1 ) .
( i v ) U a p p ( X 1 Y 1 ) U a p p ( X 1 ) U a p p ( Y 1 ) .
( v ) L a p p ( X 1 Y 1 ) L a p p ( X 1 ) L a p p ( Y 1 ) .
( v i ) L a p p ( X 1 Y 1 ) = L a p p ( X 1 ) L a p p ( Y 1 ) .
( v i i ) I f X 1 Y 1 then L a p p ( X 1 ) L a p p ( Y 1 ) and U a p p ( X 1 ) U a p p ( Y 1 ) .
( v i i i ) U a p p ( X 1 c ) = ( [ L a p p ( X 1 ) ] c ) and L a p p ( X 1 c ) = ( [ U a p p ( X 1 ) ] c ) .
( i x ) U a p p U a p p ( X 1 ) = L a p p U a p p ( X 1 ) = U a p p ( X 1 ) .
( x ) L a p p L a p p ( X 1 ) = U a p p L a p p ( X 1 ) = L a p p ( X 1 ) .
Definition 2.3.
Let ( U , τ ) be a topological structure. Then X 1 U is called:
i) 
α-open [18] if X 1 i n t ( c l ( i n t ( X 1 ) ) ) .
ii) 
γ-open [20] if X 1 c l ( i n t ( X 1 ) ) i n t ( c l ( X 1 ) ) .
ii) 
β-open [19] if X 1 c l ( i n t ( c l ( X 1 ) ) ) .

3. Topological near open sets approximation structure

The necessity to represent subsets of a universe U as a base for topology τ motivates the use of topological rough set theory. So, if R is a binary relation on U , then K τ = ( U , R β ) is called near open ( No ) approximation structure, where β O ( U ) is generated by taking R β as a subbase for τ .
Definition 3.1.
Let ( U , R β ) be No approximation structure, X 1 U . Then, R ̲ β ( X 1 ) = { G β O ( U ) : G X 1 } , R ¯ β ( X 1 ) = { F β C ( U ) : X 1 F } are called No L a p p (resp. No U a p p ), where, G X 1 β β O ( U ) , X 1 G X 1 β .
Also, P O S β ( X 1 ) = R ̲ β ( X 1 ) is called the topological + region of X 1 , N E G β ( X 1 ) = U R ¯ β ( X 1 ) is called the topological - region of X 1 and B N D β ( X 1 ) = R ¯ β ( X 1 ) R ̲ β ( X 1 ) is called the topological boundary region of X 1 . The topological accuracy measure is defined as α β ( X 1 ) = R ̲ β ( X 1 ) R ¯ β ( X 1 ) , where represents the cardinality and X 1 ϕ .
Example 3.2.
Let U = { q 1 , q 2 , q 3 , q 4 } , R = { ( q 1 , q 1 ) , ( q 1 , q 2 ) , ( q 2 , q 4 ) , ( q 3 , q 4 ) , ( q 4 , q 1 ) , ( q 4 , q 2 ) , ( q 4 , q 4 ) } and X 1 = { q 1 , q 2 , q 3 } . Thus q 1 R = { q 1 , q 2 } , q 2 R = q 3 R = { q 4 } , q 4 R = { q 1 , q 2 , q 4 } and τ = { U , ϕ , { q 1 , q 2 } , { q 4 } , { q 1 , q 2 , q 4 } } . Therefore, β O ( U ) = { { q 1 } , { q 2 } , { q 3 } , { q 4 } , { q 1 , q 2 } , { q 1 , q 3 } , { q 1 , q 4 } , { q 2 , q 3 } , { q 2 , q 4 } , { q 3 , q 4 } , { q 1 , q 2 , q 3 } , { q 1 , q 2 , q 4 } , { q 1 , q 3 , q 4 } , { q 2 , q 3 , q 4 } } . Then, R ̲ β ( X 1 ) = { q 1 , q 2 , q 3 } and R ¯ β ( X 1 ) = U . The accuracy measure α β ( X 1 ) = 3 4 .
Proposition 3.3.
Let ( U , R β ) be No approximation structure, X 1 , Y 1 U . Then :
(i) 
X 1 is No roughly bottom included in Y 1 if R ̲ β ( X 1 ) R ̲ β ( Y 1 ) ,
(ii) 
X 1 is No roughly top included in Y 1 if R ¯ β ( X 1 ) R ¯ β ( Y 1 ) ,
(iii) 
X 1 is No roughly included in Y 1 if R ̲ β ( X 1 ) R ̲ β ( Y 1 ) and R ¯ β ( X 1 ) R ¯ β ( Y 1 ) .
Definition 3.4.
Let ( U , R β ) be No approximation structure, X 1 , Y 1 U . Then :
(i) 
R β -definable (β-exact) if R ̲ β ( X 1 ) = R ¯ β ( X 1 ) or B N D β ( X 1 ) = ϕ ,
(ii) 
No rough if R ̲ β ( X 1 ) R ¯ β ( X 1 ) or B N D β ( X 1 ) ϕ .
Definition 3.5.
Let ( U , R β ) be No approximation structure, X 1 , Y 1 U . Then, X 1 , Y 1 are :
(i) 
No roughly top equal if R ̲ β ( X 1 ) = R ̲ β ( Y 1 ) ,
(ii) 
No roughly bottom equal if R ¯ β ( X 1 ) = R ¯ β ( Y 1 ) ,
(iii) 
No roughly equal if R ̲ β ( X 1 ) = R ̲ β ( Y 1 ) and R ¯ β ( X 1 ) = R ¯ β ( Y 1 ) .
Proposition 3.6.
If ( U , R β ) is No approximation structure, X 1 , Y 1 U , then,
(i) 
Every exact set in U is No exact ,
(ii) 
Every No rough set in U is rough.
Proof. 
: Obvious. □
Definition 3.7
Let ( U , R β ) be No approximation structure, X 1 U . Then, X 1 is :
(i) 
Roughly R β -definable, if R ̲ β ( X 1 ) ϕ and R ¯ β ( X 1 ) U ,
(ii) 
Internally R β -undefinable, if R ̲ β ( X 1 ) = ϕ and R ¯ β ( X 1 ) U ,
(iii) 
Externally R β -undefinable, if R ̲ β ( X 1 ) ϕ and R ¯ β ( X 1 ) = U ,
(iv) 
Totally R β -undefinable, if R ̲ β ( X 1 ) = ϕ and R ¯ β ( X 1 ) = U ,.
Proposition 3.8
Let ( U , R β ) be No approximation structure, X 1 , Y 1 U . Then,
(i) 
R ̲ β ( X 1 ) X 1 R ¯ β ( X 1 ) ,
(ii) 
R ̲ β ( ϕ ) = R ¯ β ( ϕ ) = ϕ , R ̲ β ( X 1 ) = R ¯ β ( X 1 ) = X 1 ,
(iii) 
If X 1 Y 1 , then R ̲ β ( X 1 ) R ̲ β ( Y 1 ) and R ¯ β ( X 1 ) R ¯ β ( Y 1 ) ,
(iv) 
R ̲ β ( X 1 ) R ̲ β ( Y 1 ) = R ̲ β ( X 1 Y 1 ) ,
(v) 
R ¯ β ( X 1 Y 1 ) = R ¯ β ( X 1 ) R ¯ β ( Y 1 ) ,
(vi) 
R ̲ β ( X 1 c ) = ( R ¯ β ( X 1 ) ) c , R ¯ β ( X 1 c ) = ( R ̲ β ( X 1 ) ) c ,
(vii) 
R ̲ β ( R ̲ β ( X 1 ) ) = R ̲ β ( X 1 ) , R ¯ β ( R ¯ β ( X 1 ) ) = R ¯ β ( X 1 ) ,
Proof.
(i)
Suppose that x 1 R ̲ β ( X 1 ) . Then, x 1 { G β O ( U ) : G X 1 } and G 0 β O ( U ) where x 1 G 0 X 1 . Therefore, R ̲ β ( X 1 ) X 1 . Let x 1 X 1 . Then, x 1 F by the definition of No upper approximation F β C ( U ) . Thus, X 1 R ¯ β ( X 1 ) ,
(ii)
Obvious.
(iii)
Assume that, x 1 R ̲ β ( X 1 ) , X 1 Y 1 . Therefore x 1 R ̲ β ( Y 1 ) by the definition of No upper approximation. Also, let X 1 R ¯ β ( Y 1 ) , hence X 1 R ¯ β ( Y 1 ) = { F β C ( U ) : Y 1 F } , then there exists Y 1 F β C ( U ) and X 1 F . This leads to F β C ( U ) , X 1 Y 1 F and X 1 F and X 1 R ¯ β ( X 1 ) = { F β C ( U ) : X 1 F } . Hence , X 1 R ¯ β ( X 1 ) and R ¯ β ( X 1 ) R ¯ β ( Y 1 ) .
(iv)
Since X 1 X 1 Y 1 , Y 1 X 1 Y 1 , then R ̲ β ( X 1 ) R ̲ β ( X 1 Y 1 ) , R ̲ β ( Y 1 ) R ̲ β ( X 1 Y 1 ) . Thus, R ̲ β ( X 1 ) R ̲ β ( Y 1 ) R ̲ β ( X 1 Y 1 ) . Let x 1 R ̲ β ( X 1 Y 1 ) , then x 1 { G β O ( U ) : G X 1 Y 1 } . Thus, G 0 β O ( U ) where x 1 G 0 X 1 Y 1 . There exist three cases:
Case (1) If G 0 X 1 , X 1 X 1 , thus x 1 R ̲ β ( X 1 ) .
Case (2) if G 0 X 1 = ϕ , then G 0 Y and x 1 G 0 , so x 1 R ̲ β ( X 1 ) .
Case (3) if G 0 X 1 ϕ . where x 1 G 0 and G 0 is β -open set, therefore x 1 β C ( X 1 ) , and hence x 1 R ̲ β ( X 1 ) .
From three cases x 1 R ̲ β ( X 1 ) R ̲ β ( Y 1 ) .
(v)
Similar to (iv),
(vi)
Let x 1 R ̲ β ( X 1 c ) . Then, x 1 { G β O ( U ) : G X 1 c } . So, G 0 β O ( U ) such that x 1 G 0 X 1 c . Then, there exists G 0 c such that X 1 G 0 c and X 1 G 0 c , G 0 c β C ( U ) . Hence X 1 R ¯ β ( X 1 ) . Thus x 1 ( R ¯ β ( X 1 ) ) c and R ̲ β ( X 1 c ) = ( R ¯ β ( X 1 ) ) c . Also, we can prove that R ¯ β ( X 1 c ) = ( R ̲ β ( X 1 ) ) c .
(vii)
Since R ̲ β ( X 1 ) = { G β O ( U ) : G X 1 } . Therefore, R ̲ β ( R ̲ β ( X 1 ) ) = { { G β O ( U ) : G X 1 } } = { G β O ( U ) : G X 1 } = R ̲ β ( X 1 ) . R ¯ β ( R ¯ β ( X 1 ) ) = R ¯ β ( ( R ̲ β ( X 1 c ) ) c ) = ( R ̲ β ( ( R ̲ β ( X 1 c ) ) c ) ) c = ( R ̲ β ( X 1 c ) ) c = ( R ¯ β ( X 1 c ) ) c = R ¯ β ( X 1 ) .

4. COVID-19 in terms of topological No

Fever, fatigue, and dry hack are the most well-known symptoms of COVID-19 infection. Torment and throbs, nasal blockage, migraine, conjunctivitis, sore throat, the runs, loss of taste or smell, a rash, or discoloration of the fingers or toes are some of the less common adverse effects that a few people may experience. These manifestations are typically mellow and begin gradually. Only a few people are able to be contained without mild symptoms. Symptoms may vary from one country to another and change from common to mild or strong symptoms and may become a fleeting symptom. With the occurrence of mutations in Covid-19, new symptoms appear and differ from one country to another in their severity, and other symptoms disappear. But there are symptoms such as fever, fatigue and dehydration that persist despite these mutations.
In this application, we analyze the data of a group of patients. They showed a group of different symptoms. Their data was in the following Table 1 where; hight temperature, breathing difficulty, physical strain, sore throat and lack of smell are represented by the symbols; A 1 , A 2 , A 3 , A 4 , A 5 , respectively. 1 refers to "Yes" , 0 refers to "No",+ refers to "Positive" and − refers to "Negative"
Based on the information system of COVID-19 in Table 1 and the No approximation structure, we will discover and predict disease-causing factors, disease detection using a new algorithm .

4.1. Algorithm of the side effects of COVID-19 infection

Step 1: Assume that U is the universe of discourse, R is the set of condition attributes and C is decision attribute.
Step 2: Find Pawlak’s L a p p , U a p p and the boundary of any set X 1 U .
Step 3: Remove any attribute A i R , take U / R A i as a base for topology and find the set β O ( U ) .
Step 4: Calculate β L a p p , β U a p p and the boundary of the set X 1 .
Step 5: If the boundary of X 1 in Step 2 and Step 4 are the same, then A i is superfluous attribute.
Step 6: Repeat Step 3, Step 4 and Step 5 for all condition attributes and find reduct(R).
Continued from Table 1:
Step 1: Let U = { p 1 , p 2 , p 3 , p 4 , p 5 , p 6 , p 7 , p 8 , p 9 } be the set of patients, R = { A 1 , A 2 , A 3 , A 4 , A 5 } be the condition attributes, C = { + , } be the condition attributes and X 1 = { p 1 , p 2 , p 17 , p 18 } be the set of patients having + results. Then U / R = { { p 1 } , { p 2 } , { p 3 } , { p 4 } , { p 5 } , { p 6 } , { p 7 } , { p 8 } , { p 9 } , { p 10 } , { p 11 } , { p 12 } , { p 13 } , { p 14 } , { p 15 } , { p 16 } , { p 17 } , { p 18 } , { p 19 } , { p 20 } , { p 21 } , { p 22 } , { p 23 } , { p 24 } , { p 25 } , { p 26 } , { p 27 } , { p 28 } , { p 29 } , { p 30 } , { p 31 } , { p 32 } } .
Step 2: pawlak’s L a p p and U a p p of X 1 is: R ̲ ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , R ¯ ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , B N R ( X 1 ) = ϕ .
Step 3: Case (i) Remove the attribute A 1 , then U / R ( A 1 ) = { { P 1 , p 17 } , { p 2 , p 18 } , { p 3 , p 19 } , { p 4 , p 20 } , { p 5 , p 21 } , { p 6 , p 22 } , { p 7 , p 23 } , { p 8 , p 24 } , { p 9 , p 25 } , { p 10 , p 26 } , { p 11 , p 27 } , { p 12 , p 28 } , { p 13 , p 29 } , { p 14 , p 30 } , { p 15 , p 31 } , { p 16 , p 32 } } is a base for topology and we can deduce the set β O ( U ) .
Step 4: The β L a p p , β U a p p and boundary of X 1 are: R ̲ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , R ¯ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } and B N β ( X 1 ) = ϕ .
Step 5: Since B N β ( X 1 ) = ϕ = B N R ( X 1 ) = ϕ , then A 1 is superfluous attribute which means it is not necessary for patients having + results.
Step 6:Case (ii) Remove the attribute A 2 , then U / R ( A 2 ) = { { p 1 , p 9 } , { p 2 , p 10 } , { p 3 , p 11 } , { p 6 , p 14 } , { p 7 , p 15 } , { p 6 , p 22 } , { p 7 , p 23 } , { p 8 , p 24 } , { p 9 , p 25 } , { p 9 , p 25 } , { p 10 , p 26 } , { p 11 , p 27 } , { p 4 , p 12 } , { p 5 , p 13 } { p 8 , p 16 } , { p 17 , p 25 } , { p 18 , p 26 } , { p 19 , p 27 } , { p 20 , p 28 } , { p 21 , p 29 } , { p 22 , p 30 } , { p 23 , p 31 } , { p 24 , p 32 } . Therefore, R ̲ β ( X 1 ) = ϕ , R ¯ β ( X 1 ) = { p 1 , p 2 , p 9 , p 10 , p 17 , p 18 , p 25 , p 26 } and B N β ( X 1 ) = { p 1 , p 2 , p 9 , p 10 , p 17 , p 18 , p 25 , p 26 } B N R ( X 1 ) .
Case (iii) Remove the attribute A 3 ,then U / R ( A 3 ) = { { p 1 , p 5 } , { p 2 , p 6 } , { p 3 , p 7 } , { p 4 , p 8 } , { p 9 , p 13 } , { p 10 , p 14 } , { p 11 , p 15 } , { p 12 , p 16 } , { p 17 , p 21 } , { p 18 , p 22 } , { p 19 , p 23 } , { p 20 , p 24 } , { p 25 , p 29 } , { p 26 , p 30 } , { p 27 , p 31 } , { p 28 , p 32 } } . Hence, R ̲ β ( X 1 ) = ϕ , R ¯ β ( X 1 ) = { p 1 , p 5 , p 2 , p 6 , p 17 , p 21 , p 18 , p 22 } and B N β ( X 1 ) = { p 1 , p 5 , p 2 , p 6 , p 17 , p 21 , p 18 , p 22 } B N R ( X 1 ) .
Case (iv) Remove the attribute A 4 ,then U / R ( A 4 ) = { { p 1 , p 3 } , { p 2 , p 4 } , { p 5 , p 7 } , { p 6 , p 8 } , { p 9 , p 11 } , { p 10 , p 12 } , { p 13 , p 15 } , { p 14 , p 16 } , { p 17 , p 19 } , { p 18 , p 20 } , { p 21 , p 23 } , { p 22 , p 24 } , { p 25 , p 27 } , { p 26 , p 28 } , { p 29 , p 31 } , { p 30 , p 32 } } . Hence, R ̲ β ( X 1 ) = ϕ , R ¯ β ( X 1 ) = { p 1 , p 3 , p 2 , p 4 , p 17 , p 19 , p 18 , p 20 } and B N β ( X 1 ) = { p 1 , p 3 , p 2 , p 4 , p 17 , p 19 , p 18 , p 20 } B N R ( X 1 ) .
Case (v) Remove the attribute A 5 , then U / R ( A 5 ) = { { p 1 , P 2 } , { p 3 , p 4 } , { p 5 , p 6 } , { p 7 , p 8 } , { p 9 , p 10 } , { p 11 , p 12 } , { p 13 , p 14 } , { p 15 , p 16 } , { p 17 , p 18 } , { p 19 , p 20 } , { p 21 , p 22 } , { p 23 , p 24 } , { p 25 , p 26 } , { p 27 , p 28 } , { p 29 , p 30 } , { p 31 , p 32 } } . Hence, R ̲ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } , R ¯ β ( X 1 ) = { p 1 , p 2 , p 17 , p 18 } and B N β ( X 1 ) = ϕ .
Therefore reduct( R ) = { A 2 , A 3 , A 4 } . Similarly, if Y is the set of patients having - result, then again reduct( R ) = { A 2 , A 3 , A 4 } .
Theorem 1.
From the previous application, we conclude that only the symptoms that make up the reduct confirm the presence of the disease, therefore appropriate preventive measures must be taken, given a + situation

5. Conclusion

An algorithm is developed to find the core in an information system. The counter example is discussed to find the core of the systems. The paper concluded that breathing difficulty,physical strain and sore throat which are represented by the symbols A 2 , A 3 and A 4 respectively. These symptoms are closely connected to the disease (covid 19).

References

  1. Pawlak, Z. Rough sets. International Journal of Computing and Information Sciences 1998;. 11 (5): 341-356. [CrossRef]
  2. Abo Khadra AA, El-Bably MK. Topological approach to tolerance structure. Alexandria Engineering Journal 2008; 47: 575-580.
  3. Abo-Tabl, EA. A comparison of two kinds of definitions of rough approximations based on a similarity relation. Information Sciences 2011; 181 (12): 2587-2596. [CrossRef]
  4. Ali MI, Feng F,Liux, Min WK, Shabir M. On some new operations in soft set theory. Computers and Mathematics with Applications 2009; 57 (9): 1547-1553. [CrossRef]
  5. Bakier MY, Allam AA, Abd-Allah SS. Soft rough topology. Annals of Fuzzy Mathematics and Informatics 2018; 15 (1): 9-16.
  6. El-Bably, MK. Comparisons between near open sets and rough approximations. International Journal of Granular Computing, Rough Sets and Intelligent Systems 2015; 4 (1): 64-83. [CrossRef]
  7. Kondo, M. On the structure of generalized rough sets. Information Sciences 2006; 176 (5): 589-600. [CrossRef]
  8. Chen Y, Guo Y, Pan Y, Zhao ZJ. Structure analysis of the receptor binding of 2019-nCoV, Biochemical and Biophysical Research Communications 2020; 525 (1): 135-140. [CrossRef]
  9. Kampf G, Todt D, Pfaender S, Steinmann E. Persistence of coronaviruses on inanimate surfaces and their inactivation with biocidal agents. Journal of Hospital Infection 2020; 104 (3): 246-251. [CrossRef]
  10. Lai CC et al. Asymptomatic carrier state, acute respiratory disease, and pneumonia due to severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2): Facts and myths. Journal of Microbiology, Immunology and Infection 2020; 53 (3): 404-412. [CrossRef]
  11. et al. Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) and coronavirus disease-2019 (COVID-19): The epidemic and the challenges, International Journal of Antimicrobial Agents, International Journal of Antimicrobial Agents 2020; 55 (3): 105924. [CrossRef]
  12. Robson, B. Computers and viral diseases. Preliminary bioinformatics studies on the design of a synthetic vaccine and a preventative peptidomimetic antagonist against the SARS-CoV-2 (2019-nCoV, COVID-19) coronavirus. Computers in Biology and Medicine 2020. 2020. [Google Scholar] [CrossRef]
  13. Salman S, Salem ML. Routine childhood immunization may protect against COVID-19. Medical Hypotheses 2020;140: 109689. [CrossRef]
  14. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Date, Kluwer Academic Publishers, Boston, 1991.
  15. J.L. Kelly, General Topology, Graduate Texts in Mathematics, vol. 27, Springer-Verlag, 1955.
  16. N. Levine, Semi-open sets and semi-continuity in topological structures, Amer. Math. Monthly, 70 (1963), 36-41. [CrossRef]
  17. A.S. Mashhour, A.A. Allam, F.S. Mahmoud, F.H. Khedr, On supratopological structures, Indian J. Pure Appl. Math., 14(4)(1983), 502-510.
  18. O. Njastad, On some classes of nearly open sets, Pacific J. Math., 15(1965), 961-970.
  19. M.E. Abd El-Monsef, S.N. El-Deeb, R.A. Mahmoud, β-open sets and β-continuous mappings, Bull. Fac. Sc. Assuit Univ., 12(1983),77-90.
  20. A.A. El-Atik, A study of some types of mappings on topological structures, M.Sc. Thesis, Tanta Univ. (1997).
  21. M. Stone, Application of the theory of Boolian rings to general topology, Trans. Amer. Math. Soc., 41 (1937), 374-481. [CrossRef]
  22. Nada S., I. , El-Atik A. A. and Atef M., New types of topological structures via graphs, Mathematical methods in the applied sciences, 41(2018), 5801-5810. [CrossRef]
  23. El-Sharkasy, M. M. , and M. S. Badr., Modeling DNA & RNA mutation using mset and topology, International Journal of Biomathematics 11.04 (2018): 1850058. [CrossRef]
  24. Radwan Abu-Gdairi, Mostafa A. El-Gayar, Mostafa K. El-Bably and Kamel K. Fleifel, Two Different Views for Generalized Rough Sets with Applications, Mathematics 2021, 9, 2275. [CrossRef]
  25. Mostafa, K. El-Bably, Radwan Abu-Gdairi and Mostafa A. El-Gayar, Medical diagnosis for the problem of Chikungunya disease using soft rough sets, AIMS Mathematics, 8(4)(2023): 9082–9105. [CrossRef]
  26. Rodyna, A. Hosny, Radwan Abu-Gdairi and Mostafa K. El-Bably, Approximations by Ideal Minimal Structure with Chemical Application, Intelligent Automation and Soft Computing, vol. 36, no.3, pp. 3073–3085, 2023. [CrossRef]
Table 1. The side effects of COVID-19 infection.
Table 1. The side effects of COVID-19 infection.
P a t i e n t s A 1 A 2 A 3 A 4 A 5 D e c i s i o n
p 1 1 1 1 1 1 +
p 2 1 1 1 1 0 +
p 3 1 1 1 0 1
p 4 1 1 1 0 0
p 5 1 1 0 1 1
p 6 1 1 0 1 0
p 7 1 1 0 0 1
p 8 1 1 0 0 0
p 9 1 0 1 1 1
p 10 1 0 1 1 0
p 11 1 0 1 0 1
p 12 1 0 1 0 0
p 13 1 0 0 1 1
p 14 1 0 0 1 0
p 15 1 0 0 0 1
p 16 1 0 0 0 0
p 17 0 1 1 1 1 +
p 18 0 1 1 1 0 +
p 19 0 1 1 0 1
p 20 0 1 1 0 0
p 21 0 1 0 1 1
p 22 0 1 0 1 0
p 23 0 1 0 0 1
p 24 0 1 0 0 0
p 25 0 0 1 1 1
p 26 0 0 1 1 0
p 27 0 0 1 0 1
p 15 1 0 0 0 1
p 28 0 0 1 0 0
p 29 0 0 0 1 1
p 30 0 0 0 1 0
p 31 0 0 0 0 1
p 32 0 0 0 0 0
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Alerts
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated