The hyper-Wiener index of the generalized hierarchical product of graphs

AbstractThe hyper Wiener index of the connected graph G is WW(G)=12∑{u,v}⊆V(G)(d(u,v)+d(u,v)2), where d(u,v) is the distance between the vertices u and v of G. In this paper we compute the hyper-Wiener index of the generalized hierarchical product of two graphs and give some applications of this operation

Deep Sketch-Photo Face Recognition Assisted by Facial Attributes

In this paper, we present a deep coupled framework to address the problem of matching sketch image against a gallery of mugshots. Face sketches have the essential in- formation about the spatial topology and geometric details of faces while missing some important facial attributes such as ethnicity, hair, eye, and skin color. We propose a cou- pled deep neural network architecture which utilizes facial attributes in order to improve the sketch-photo recognition performance. The proposed Attribute-Assisted Deep Con- volutional Neural Network (AADCNN) method exploits the facial attributes and leverages the loss functions from the facial attributes identification and face verification tasks in order to learn rich discriminative features in a common em- bedding subspace. The facial attribute identification task increases the inter-personal variations by pushing apart the embedded features extracted from individuals with differ- ent facial attributes, while the verification task reduces the intra-personal variations by pulling together all the fea- tures that are related to one person. The learned discrim- inative features can be well generalized to new identities not seen in the training data. The proposed architecture is able to make full use of the sketch and complementary fa- cial attribute information to train a deep model compared to the conventional sketch-photo recognition methods. Exten- sive experiments are performed on composite (E-PRIP) and semi-forensic (IIIT-D semi-forensic) datasets. The results show the superiority of our method compared to the state- of-the-art models in sketch-photo recognition algorithm

THE STRUCTURE OF UNIT GRUOP OF F3nT39F_{3n} T_{39}

Let $RG$ be the gruop ring of the group $G$ over ring $R$ and $U(RG)$ be its unitgroup. In this paper, we obtain the structure of unit group of $F_{3n} T_{39}$

Prosodic-Enhanced Siamese Convolutional Neural Networks for Cross-Device Text-Independent Speaker Verification

In this paper a novel cross-device text-independent speaker verification architecture is proposed. Majority of the state-of-the-art deep architectures that are used for speaker verification tasks consider Mel-frequency cepstral coefficients. In contrast, our proposed Siamese convolutional neural network architecture uses Mel-frequency spectrogram coefficients to benefit from the dependency of the adjacent spectro-temporal features. Moreover, although spectro-temporal features have proved to be highly reliable in speaker verification models, they only represent some aspects of short-term acoustic level traits of the speaker's voice. However, the human voice consists of several linguistic levels such as acoustic, lexicon, prosody, and phonetics, that can be utilized in speaker verification models. To compensate for these inherited shortcomings in spectro-temporal features, we propose to enhance the proposed Siamese convolutional neural network architecture by deploying a multilayer perceptron network to incorporate the prosodic, jitter, and shimmer features. The proposed end-to-end verification architecture performs feature extraction and verification simultaneously. This proposed architecture displays significant improvement over classical signal processing approaches and deep algorithms for forensic cross-device speaker verification.Comment: Accepted in 9th IEEE International Conference on Biometrics: Theory, Applications, and Systems (BTAS 2018

A CHARACTERIZATION OF PSL(4,p) BY SOME CHARACTER DEGREE

‎Let G be a finite group and cd(G) be the set of irreducible character degree of G‎. ‎In this paper we prove that if  p is a prime number‎, ‎then the simple group PSL(4,p) is uniquely determined by its order and some its character degrees‎.

On the Narumi-Katayama Index of Composite Graphs

The Narumi-Katayama index of a graph G, denoted by N K(G), is equal to the product of degrees of vertices of G. In this paper we investigate its behavior under several binary operations on graphs. We present explicit formulas for its values for composite graphs in terms of its values for operands and some auxiliary invariants. We demonstrate applications of our results to several chemically relevant classes of graphs and show how the Narumi-Katayama index can be used as a measure of graph irregularity. (doi: 10.5562/cca2329

Computing the Szeged Index of Two Type Dendrimer Nanostars

In this paper we compute the szeged index of the first and second type of dendrimer nanostar