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...

The concern in this study is the approach to evaluating the performance of the open-set speaker identification process. In essence, such a process involves first identifying the speaker model in the database that best matches the given test utterance, and then determining if the test utterance has actually been produced by the speaker associated with the best-matched model. Whilst, conventional...

1. Introduction ,(1.1) Let A, B be n x n matrices whose elements are functions holomorphic in a connected open subset V of the complex plane. The matrices A, Bare called pointwise similar on V if for each XE V there exists a non-singular n x n matrix C x with complex elements such that B(x) = C;;l A (x) Cx' They are holomorphically similar on V if there exists a matrix C of functions holomorphi...

Large-scale datasets possessing clean label annotations are crucial for training Convolutional Neural Networks (CNNs). However, labeling large-scale data can be very costly and error-prone, and even high-quality datasets are likely to contain noisy (incorrect) labels. Existing works usually employ a closed-set assumption, whereby the samples associated with noisy labels possess a true class con...

This paper is concerned with the verification effectiveness in open-set, text-independent speaker identification. The study includes an analysis of the characteristics of this mode of speaker recognition and the potential causes of errors. The use of well-known score normalisation techniques for the purpose enhancing the reliability of the process is described and their relative effectiveness i...

Automated Genre Identification (AGI) of web pages is a problem of increasing importance since web genre (e.g. blog, news, eshops, etc.) information can enhance modern Information Retrieval (IR) systems. The state-of-the-art in this field considers AGI as a closed-set classification problem where a variety of web page representation and machine learning models have intensively studied. In this p...

Monokines (i.e., interleukin [IL]-12, -18, and -15) induce natural killer (NK) cells to produce interferon-gamma (IFN-gamma), which is a critical factor for immune surveillance of cancer and monocyte clearance of infection. We show that SET, which is a potent inhibitor of protein phosphatase type 2A (PP2A) activity, is highly expressed in human CD56bright NK cells, which produce more IFN-gamma ...