The present paper develops a novel way of reducing a protein sequence of any length to a real symmetric condensed 20 × 20 matrix. This condensed matrix can be nicely applied as a protein sequence descriptor. In f...The present paper develops a novel way of reducing a protein sequence of any length to a real symmetric condensed 20 × 20 matrix. This condensed matrix can be nicely applied as a protein sequence descriptor. In fact, with such a condensed representation, comparison of two protein sequences is reduced to a comparison of two such 20 × 20 matrices. As each square matrix has a unique Alley Index/normalized Alley Index, such index is conveniently used in getting distance matrix to construct Phylogenetic trees of different protein sequences. Finally protein sequence comparison is made based on these Phylogenetic trees. In this paper three types viz., NADH dehydrogenase subunit 3 (ND3), subunit 4 (ND4) and subunit 5 (ND5) of protein sequences of nine species, Human, Gorilla, Common Chimpanzee, Pygmy Chimpanzee, Fin Whale, Blue Whale, Rat, Mouse and Opossum are used for comparison.展开更多
The cocktail party problem,i.e.,tracing and recognizing the speech of a specific speaker when multiple speakers talk simultaneously,is one of the critical problems yet to be solved to enable the wide application of au...The cocktail party problem,i.e.,tracing and recognizing the speech of a specific speaker when multiple speakers talk simultaneously,is one of the critical problems yet to be solved to enable the wide application of automatic speech recognition(ASR) systems.In this overview paper,we review the techniques proposed in the last two decades in attacking this problem.We focus our discussions on the speech separation problem given its central role in the cocktail party environment,and describe the conventional single-channel techniques such as computational auditory scene analysis(CASA),non-negative matrix factorization(NMF) and generative models,the conventional multi-channel techniques such as beamforming and multi-channel blind source separation,and the newly developed deep learning-based techniques,such as deep clustering(DPCL),the deep attractor network(DANet),and permutation invariant training(PIT).We also present techniques developed to improve ASR accuracy and speaker identification in the cocktail party environment.We argue effectively exploiting information in the microphone array,the acoustic training set,and the language itself using a more powerful model.Better optimization ob jective and techniques will be the approach to solving the cocktail party problem.展开更多
Kerov[16,17] proved that Wigner＇s semi-circular law in Gauss[an unitary ensembles is the transition distribution of the omega curve discovered by Vershik and Kerov[34] for the limit shape of random partitions under t...Kerov[16,17] proved that Wigner＇s semi-circular law in Gauss[an unitary ensembles is the transition distribution of the omega curve discovered by Vershik and Kerov[34] for the limit shape of random partitions under the Plancherel measure. This establishes a close link between random Plancherel partitions and Gauss[an unitary ensembles, In this paper we aim to consider a general problem, namely, to characterize the transition distribution of the limit shape of random Young diagrams under Poissonized Plancherel measures in a periodic potential, which naturally arises in Nekrasov＇s partition functions and is further studied by Nekrasov and Okounkov[25] and Okounkov[28,29]. We also find an associated matrix mode[ for this transition distribution. Our argument is based on a purely geometric analysis on the relation between matrix models and SeibergWitten differentials.展开更多
文摘The present paper develops a novel way of reducing a protein sequence of any length to a real symmetric condensed 20 × 20 matrix. This condensed matrix can be nicely applied as a protein sequence descriptor. In fact, with such a condensed representation, comparison of two protein sequences is reduced to a comparison of two such 20 × 20 matrices. As each square matrix has a unique Alley Index/normalized Alley Index, such index is conveniently used in getting distance matrix to construct Phylogenetic trees of different protein sequences. Finally protein sequence comparison is made based on these Phylogenetic trees. In this paper three types viz., NADH dehydrogenase subunit 3 (ND3), subunit 4 (ND4) and subunit 5 (ND5) of protein sequences of nine species, Human, Gorilla, Common Chimpanzee, Pygmy Chimpanzee, Fin Whale, Blue Whale, Rat, Mouse and Opossum are used for comparison.
基金supported by the Tencent and Shanghai Jiao Tong University Joint Project
文摘The cocktail party problem,i.e.,tracing and recognizing the speech of a specific speaker when multiple speakers talk simultaneously,is one of the critical problems yet to be solved to enable the wide application of automatic speech recognition(ASR) systems.In this overview paper,we review the techniques proposed in the last two decades in attacking this problem.We focus our discussions on the speech separation problem given its central role in the cocktail party environment,and describe the conventional single-channel techniques such as computational auditory scene analysis(CASA),non-negative matrix factorization(NMF) and generative models,the conventional multi-channel techniques such as beamforming and multi-channel blind source separation,and the newly developed deep learning-based techniques,such as deep clustering(DPCL),the deep attractor network(DANet),and permutation invariant training(PIT).We also present techniques developed to improve ASR accuracy and speaker identification in the cocktail party environment.We argue effectively exploiting information in the microphone array,the acoustic training set,and the language itself using a more powerful model.Better optimization ob jective and techniques will be the approach to solving the cocktail party problem.
基金Supported by the National Natural Science Foundation of China(No.10671176)
文摘Kerov[16,17] proved that Wigner＇s semi-circular law in Gauss[an unitary ensembles is the transition distribution of the omega curve discovered by Vershik and Kerov[34] for the limit shape of random partitions under the Plancherel measure. This establishes a close link between random Plancherel partitions and Gauss[an unitary ensembles, In this paper we aim to consider a general problem, namely, to characterize the transition distribution of the limit shape of random Young diagrams under Poissonized Plancherel measures in a periodic potential, which naturally arises in Nekrasov＇s partition functions and is further studied by Nekrasov and Okounkov[25] and Okounkov[28,29]. We also find an associated matrix mode[ for this transition distribution. Our argument is based on a purely geometric analysis on the relation between matrix models and SeibergWitten differentials.
