Research on the Information Fusion Method of Oil Diagnosis and Vibration Diagnosis Based on the Rough Sets Theory

The improved method has been presented for knowledge reduction in rough sets （R-S） theory, when R-S is used to model the information expression of oil and vibration diagnosis. Therefore, the typical fault simulation tests of rolling bearings have been made, and the application method of R-S has been also analysed in this paper. The diagnosis model of holding rack fault in rolling bearing was presented based on the improved reduction method. It is suited to information fusion to combine information when oil analysis and vibration analysis are combined for fault diagnosis.

New judging model of fuzzy cluster optimal dividing based on rough sets theory

To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory： information system discrete algorithm （algorithm 1） and samples representatives judging algorithm （algorithm 2）. On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.

Granularity of Knowledge Computed by Genetic Algorithms Based on Rough Sets Theory

Rough set philosophy hinges on the granularity of data, which is used to build all its basic concepts, like approximations, dependencies, reduction etc. Genetic Algorithms provides a general frame to optimize problem solution of complex system without depending on the domain of problem.It is robust to many kinds of problems.The paper combines Genetic Algorithms and rough sets theory to compute granular of knowledge through an example of information table. The combination enable us to compute granular of knowledge effectively.It is also useful for computer auto-computing and information processing.

On the Proof of the Contradiction of Set Theory

The article is devoted to proving the inconsistency of set theory arising from the existence of strange trees. All steps of the proof rely on common informal set-theoretic reasoning, but they take into account the prohibitions that were introduced into axiomatic set theories in order to overcome the difficulties encountered by the naive Cantor set theory. Therefore, in fact, the article is about proving the inconsistency of existing axiomatic set theories, in particular, the ZFC theory.

New Image Recognition Method Based on Rough-Sets and Fuzzy Theory

A new image recognition method based on fuzzy rough sets theory is proposed, and its implementation discussed. The performance of this method as applied to ferrography image recognition is evaluated. It is shown that the new method gives better results than fuzzy or rough sets method when used alone.

New Configurations of the Fuzzy Fractional Differential Boussinesq Model with Application in Ocean Engineering and Their Analysis in Statistical Theory

The fractional-order Boussinesq equations(FBSQe)are investigated in this work to see if they can effectively improve the situation where the shallow water equation cannot directly handle the dispersion wave.The fuzzy forms of analytical FBSQe solutions are first derived using the Adomian decomposition method.It also occurs on the sea floor as opposed to at the functionality.A set of dynamical partial differential equations(PDEs)in this article exemplify an unconfined aquifer flow implication.Thismethodology can accurately simulate climatological intrinsic waves,so the ripples are spread across a large demographic zone.The Aboodh transform merged with the mechanism of Adomian decomposition is implemented to obtain the fuzzified FBSQe in R,R^(n) and(2nth)-order involving generalized Hukuhara differentiability.According to the system parameter,we classify the qualitative features of the Aboodh transform in the fuzzified Caputo and Atangana-Baleanu-Caputo fractional derivative formulations,which are addressed in detail.The illustrations depict a comparison analysis between the both fractional operators under gH-differentiability,as well as the appropriate attributes for the fractional-order and unpredictability factorsσ∈[0,1].A statistical experiment is conducted between the findings of both fractional derivatives to prevent changing the hypothesis after the results are known.Based on the suggested analyses,hydrodynamic technicians,as irrigation or aquifer quality experts,may be capable of obtaining an appropriate storage intensity amount,including an unpredictability threshold.

Mathematical Morphology View of Topological Rough Sets and Its Applications

This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological procedures and set approximations in rough set theory have some clear parallels.Numerous initiatives have been made to connect rough sets with mathematical morphology.Numerous significant publications have been written in this field.Others attempt to show a direct connection between mathematical morphology and rough sets through relations,a pair of dual operations,and neighborhood systems.Rough sets are used to suggest a strategy to approximatemathematicalmorphology within the general paradigm of soft computing.A single framework is defined using a different technique that incorporates the key ideas of both rough sets and mathematical morphology.This paper examines rough set theory from the viewpoint of mathematical morphology to derive rough forms of themorphological structures of dilation,erosion,opening,and closing.These newly defined structures are applied to develop algorithm for the differential analysis of chest X-ray images from a COVID-19 patient with acute pneumonia and a health subject.The algorithm and rough morphological operations show promise for the delineation of lung occlusion in COVID-19 patients from chest X-rays.The foundations of mathematical morphology are covered in this article.After that,rough set theory ideas are taken into account,and their connections are examined.Finally,a suggested image retrieval application of the concepts from these two fields is provided.

About the Strange Tree Paradox and Possible Inconsistency of Set Theory

The existence of “strange trees” is proven and their paradoxical nature is discussed, due to which set theory is suspected of being contradictory. All proofs rely on informal set-theoretic reasoning, but without using elements that were prohibited in axiomatic set theories in order to overcome the difficulties encountered by Cantor’s naive set theory. Therefore, in fact, the article deals with the possible inconsistency of existing axiomatic set theories, in particular, the ZFC theory. Strange trees appear when uncountable cardinals appear.

Attribute Reduction of Hybrid Decision Information Systems Based on Fuzzy Conditional Information Entropy

The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attribute importance,Skowron discernibility matrix,and information entropy,struggle to effectively manages multiple uncertainties simultaneously in HDISs like the precise measurement of disparities between nominal attribute values,and attributes with fuzzy boundaries and abnormal values.In order to address the aforementioned issues,this paper delves into the study of attribute reduction withinHDISs.First of all,a novel metric based on the decision attribute is introduced to solve the problem of accurately measuring the differences between nominal attribute values.The newly introduced distance metric has been christened the supervised distance that can effectively quantify the differences between the nominal attribute values.Then,based on the newly developed metric,a novel fuzzy relationship is defined from the perspective of“feedback on parity of attribute values to attribute sets”.This new fuzzy relationship serves as a valuable tool in addressing the challenges posed by abnormal attribute values.Furthermore,leveraging the newly introduced fuzzy relationship,the fuzzy conditional information entropy is defined as a solution to the challenges posed by fuzzy attributes.It effectively quantifies the uncertainty associated with fuzzy attribute values,thereby providing a robust framework for handling fuzzy information in hybrid information systems.Finally,an algorithm for attribute reduction utilizing the fuzzy conditional information entropy is presented.The experimental results on 12 datasets show that the average reduction rate of our algorithm reaches 84.04%,and the classification accuracy is improved by 3.91%compared to the original dataset,and by an average of 11.25%compared to the other 9 state-of-the-art reduction algorithms.The comprehensive analysis of these research results clearly indicates that our algorithm is highly effective in managing the intricate uncertainties inherent in hybrid data.

Two kinds of average approximation accuracy

Rough set theory places great importance on approximation accuracy,which is used to gauge how well a rough set model describes a target concept.However,traditional approximation accuracy has limitations since it varies with changes in the target concept and cannot evaluate the overall descriptive ability of a rough set model.To overcome this,two types of average approximation accuracy that objectively assess a rough set model’s ability to approximate all information granules is proposed.The first is the relative average approximation accuracy,which is based on all sets in the universe and has several basic properties.The second is the absolute average approximation accuracy,which is based on undefinable sets and has yielded significant conclusions.We also explore the relationship between these two types of average approximation accuracy.Finally,the average approximation accuracy has practical applications in addressing missing attribute values in incomplete information tables.

The Quantum Microverse: A Prime Number Framework for Understanding the Universe

This study aims to demonstrate a proof of concept for a novel theory of the universe based on the Fine Structure Constant (α), derived from n-dimensional prime number property sets, specifically α = 137 and α = 139. The FSC Model introduces a new perspective on the fundamental nature of our universe, showing that α = 137.036 can be calculated from these prime property sets. The Fine Structure Constant, a cornerstone in Quantum Electrodynamics (QED) and Quantum Chromodynamics (QCD), implies an underlying structure. This study identifies this mathematical framework and demonstrates how the FSC model theory aligns with our current understanding of physics and cosmology. The results unveil a hierarchy of α values for twin prime pairs U{3/2} through U{199/197}. These values, represented by their fraction parts α♊ (e.g., 0.036), define the relative electromagnetic forces driving quantum energy systems. The lower twin prime pairs, such as U{3/2}, exhibit higher EM forces that decrease as the twin pairs increase, turning dark when they drop below the α♊ for light. The results provide classical definitions for Baryonic Matter/Energy, Dark Matter, Dark Energy, and Antimatter but mostly illustrate how the combined α♊ values for three adjacent twin primes, U{7/5/3/2} mirrors the strong nuclear force of gluons holding quarks together.

Half-global discretization algorithm based on rough set theory

It is being widely studied how to extract knowledge from a decision table based on rough set theory. The novel problem is how to discretize a decision table having continuous attribute. In order to obtain more reasonable discretization results, a discretization algorithm is proposed, which arranges half-global discretization based on the correlational coefficient of each continuous attribute while considering the uniqueness of rough set theory. When choosing heuristic information, stability is combined with rough entropy. In terms of stability, the possibility of classifying objects belonging to certain sub-interval of a given attribute into neighbor sub-intervals is minimized. By doing this, rational discrete intervals can be determined. Rough entropy is employed to decide the optimal cut-points while guaranteeing the consistency of the decision table after discretization. Thought of this algorithm is elaborated through Iris data and then some experiments by comparing outcomes of four discritized datasets are also given, which are calculated by the proposed algorithm and four other typical algorithras for discritization respectively. After that, classification rules are deduced and summarized through rough set based classifiers. Results show that the proposed discretization algorithm is able to generate optimal classification accuracy while minimizing the number of discrete intervals. It displays superiority especially when dealing with a decision table having a large attribute number.

Research on knowledge acquisition method about the IF/THEN rules based on rough set theory

The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.

Autonomous Clustering Using Rough Set Theory

This paper proposes a clustering technique that minimizes the need for subjective human intervention and is based on elements of rough set theory （RST）. The proposed algorithm is unified in its approach to clustering and makes use of both local and global data properties to obtain clustering solutions. It handles single-type and mixed attribute data sets with ease. The results from three data sets of single and mixed attribute types are used to illustrate the technique and establish its efficiency.

Seismic vulnerability assessment of urban buildings using the rough set theory and weighted linear combination

Seismic vulnerability assessment of urban buildings is among the most crucial procedures to post-disaster response and recovery of infrastructure systems.The present study proceeds to estimate the seismic vulnerability of urban buildings and proposes a new framework training on the two objectives.First,a comprehensive interpretation of the effective parameters of this phenomenon including physical and human factors is done.Second,the Rough Set theory is used to reduce the integration uncertainties,as there are numerous quantitative and qualitative data.Both objectives were conducted on seven distinct earthquake scenarios with different intensities based on distance from the fault line and the epicenter.The proposed method was implemented by measuring seismic vulnerability for the seven specified seismic scenarios.The final results indicated that among the entire studied buildings,71.5%were highly vulnerable as concerning the highest earthquake scenario(intensity=7 MM and acceleration calculated based on the epicenter),while in the lowest earthquake scenario(intensity=5 MM),the percentage of vulnerable buildings decreased to approximately 57%.Also,the findings proved that the distance from the fault line rather than the earthquake center(epicenter)has a significant effect on the seismic vulnerability of urban buildings.The model was evaluated by comparing the results with the weighted linear combination(WLC)method.The accuracy of the proposed model was substantiated according to evaluation reports.Vulnerability assessment based on the distance from the epicenter and its comparison with the distance from the fault shows significant reliable results.

Matrix-based method for solving decision domains of neighbourhood multigranulation decision-theoretic rough sets

It is more and more important to analyse and process complex data for gaining more valuable knowledge and making more accurate decisions.The multigranulation decision theory based on conditional probability and cost loss has the advantage of processing decision-making problems from multi-levels and multi-angles,and the neighbourhood rough set model(NRS)can facilitate the analysis and processing of numerical or mixed type data,and can address the limitation of multigranulation decision-theoretic rough sets(MG-DTRS),which is not easy to cope with complex data.Based on the in-depth study of hybrid-valued decision systems and MG-DTRS models,this study analysed neigh-bourhood MG-DTRS(NMG-DTRS)deeply by fusing MG-DTRS and NRS;a matrix-based approach for approximation sets of NMG-DTRS model was proposed on the basis of the matrix representations of concepts;the positive,boundary and negative domains were constructed from the matrix perspective,and the concept of positive decision recognition rate was introduced.Furthermore,the authors explored the related properties of NMG-DTRS model,and designed and described the corresponding solving algorithms in detail.Finally,some experimental results that were employed not only verified the effectiveness and feasibility of the proposed algorithm,but also showed the relationship between the decision recognition rate and the granularity and threshold.

Big Data Audit of Banks Based on Fuzzy Set Theory to Evaluate Risk Level

The arrival of big data era has brought new opportunities and challenges to the development of various industries in China.The explosive growth of commercial bank data has brought great pressure on internal audit.The key audit of key products limited to key business areas can no longer meet the needs.It is difficult to find abnormal and exceptional risks only by sampling analysis and static analysis.Exploring the organic integration and business processing methods between big data and bank internal audit,Internal audit work can protect the stable and sustainable development of banks under the new situation.Therefore,based on fuzzy set theory,this paper determines the membership degree of audit data through membership function,and judges the risk level of audit data,and builds a risk level evaluation system.The main features of this paper are as follows.First,it analyzes the necessity of transformation of the bank auditing in the big data environment.The second is to combine the determination of the membership function in the fuzzy set theory with the bank audit analysis,and use the model to calculate the corresponding parameters,thus establishing a risk level assessment system.The third is to propose audit risk assessment recommendations,hoping to help bank audit risk management in the big data environment.There are some shortcomings in this paper.First,the amount of data acquired is not large enough.Second,due to the lack of author’knowledge,there are still some deficiencies in the analysis of audit risk of commercial banks.

A BENCHMARK EXERCISE ON FUZZY SET THEORY BASED EXPERT JUDGEMENT TECHNIQUE

It is sometimes impossible to make a correct decision in a certain engineering task without the help from professional expert judgments. Even though there are different expert opinions available, however, they should be appropriately aggregated to a useful form for making an acceptable engineering decision. This paper proposed a technique which utilizes the fuzzy set theory in the aggregation of expert judgments. In the technique, two main key concepts are employed: linguistic variables and fuzzy numbers. Linguistic variables first represent the relative importance of evaluation criteria under consideration and the degree of confidence on each expert perceived by the decision maker, and then are replaced by suitable triangular fuzzy numbers for arithmetic manipulation. As a benchmark problem, the pressure increment in the containment of Sequoyah nuclear power plant due to reactor vessel breach was estimated to verify and validate the proposed technique.

La Shalle＇s invariant-set-theory based asymptotic synchronization of duffing system with unknown parameters

A novel La Shalle＇s invariant set theory （LSIST） based adaptive asymptotic synchronization （LSISAAS） method is proposed to asymptotically synchronize Duffing system with unknown parameters which also are considered as system states. The LSISASS strategy depends on the only information, i.e. one state of the master system. According to the LSIST, the LSISASS method can asymptotically synchronize fully the states of the master system and the unknown system parameters as well. Simulation results also validate that the LSISAAS approach can obtain asymptotic synchronization.

Two Hybrid Methods Based on Rough Set Theory for Network Intrusion Detection

In this paper,we propose two intrusion detection methods which combine rough set theory and Fuzzy C-Means for network intrusion detection.The first step consists of feature selection which is based on rough set theory.The next phase is clustering by using Fuzzy C-Means.Rough set theory is an efficient tool for further reducing redundancy.Fuzzy C-Means allows the objects to belong to several clusters simultaneously,with different degrees of membership.To evaluate the performance of the introduced approaches,we apply them to the international Knowledge Discovery and Data mining intrusion detection dataset.In the experimentations,we compare the performance of two rough set theory based hybrid methods for network intrusion detection.Experimental results illustrate that our algorithms are accurate models for handling complex attack patterns in large network.And these two methods can increase the efficiency and reduce the dataset by looking for overlapping categories.