In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

The co-elementary hierarchy is a nested ordinalindexed sequence of classes of mappings between compacta, with each successor level being defined inductively from the previous one using the topological ultracopower construction. The lowest level is the class of continuous surjections; and the next level up, the co-existential maps, is already a much more restricted class. Co-existential maps are...

The paper analyses different techniques that might be employed in order to solve various problems of combinatorial optimization and argues that the best results can be achieved by the use of software, running on a general-purpose computer, together with an FPGAbased reconfigurable co-processor. It suggests architecture of combinatorial co-processor, which is based on hardware templates and cons...

We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of “typical” covering maps, and use graph Galois theory to “symmetrize” the conjecture. The conjecture is then related to certain kernel of a morphism of sheaves, and is implied provided these kernels are co-acyclic in the covering cohomology theory. This allows us t...

in the paper a model to predict the concentrations of particulate matter pm10, pm2.5, so2, no, co and o3 for a chosen number of hours forward is proposed. the method requires historical data for a large number of points in time, particularly weather forecast data, actual weather data and pollution data. the idea is that by matching forecast data with similar forecast data in the historical data...

Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...