In this paper, we procure the notions of neutrosophic simply b-open set, cover, and b-compactness via topological spaces. Then, establish some remarks, propositions, theorems on simply
 b-compactness. Further, furnish counter examples where result fails.

We consider the incremental connected facility location problem, in which we are given a set of potential facilities, a set of interconnection nodes, a set of customers with demands, and a planning horizon. For each time period, we have to select a set of facilities to open, a set of customers to be served, the assignment of these customers to the open facilities, and a network that connects th...

For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...

The SET payment protocol uses digital signatures to authenticate messages and authorize transactions. It is assumed that these digital signatures make authorizations non-repudiable, i.e., provable to a third-party veri er. This paper evaluates what can be proved with the digital signatures in SET. The analysis shows that even a successful and completed SET protocol run does not give the parties...

Online working of a government or providing its services online to its citizens at their door step is known as E-Governance. E-Governance is E-Commerce technology means online availability of government services. The technology and the methods used in E-Governance project provide a roadmap for efficient delivery of services at the door step. In today's time the development of any country d...

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...

In formal language theory the concept of simplifying words is considered in connection with the deciphering delay of codes (cf. BP, Section II.8], LP]). In this paper we show that transferring a deenition from the theory of iterated function systems (IFS) sheds some new light on simplifying words.: Formal languages may be considered as IFS in the Cantor space of innnite strings over a nite alph...

We propose a framework based on Generative Adversarial Networks to disentangle the identity and attributes of faces, such that we can conveniently recombine different identities and attributes for identity preserving face synthesis in open domains. Previous identity preserving face synthesis processes are largely confined to synthesizing faces with known identities that are already in the train...