In this paper,we summarize recent progresses made in deep learning based acoustic models and the motivation and insights behind the surveyed techniques.We first discuss models such as recurrent neural networks(RNNs) a...In this paper,we summarize recent progresses made in deep learning based acoustic models and the motivation and insights behind the surveyed techniques.We first discuss models such as recurrent neural networks(RNNs) and convolutional neural networks(CNNs) that can effectively exploit variablelength contextual information,and their various combination with other models.We then describe models that are optimized end-to-end and emphasize on feature representations learned jointly with the rest of the system,the connectionist temporal classification(CTC) criterion,and the attention-based sequenceto-sequence translation model.We further illustrate robustness issues in speech recognition systems,and discuss acoustic model adaptation,speech enhancement and separation,and robust training strategies.We also cover modeling techniques that lead to more efficient decoding and discuss possible future directions in acoustic model research.展开更多
Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But t...Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But there are also orthogonal arrays which cannot be obtained by the usual difference matrices, such as mixed orthogonal arrays of run size 60. In order to construct these mixed orthogonal arrays, a class of special so-called generalized difference matrices were discovered by Zhang (1989,1990,1993,2006) from the orthogonal decompositions of projection matrices. In this article, an interesting equivalent relationship between orthogonal arrays and the generalized difference matrices is presented and proved. As an application, a lot of new orthogonal arrays of run size 60 have been constructed.展开更多
Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation pol...Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over F33m are presented. These polynomials have simple shapes, and they are related to planar functions.展开更多
To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we inv...To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times.To solve DPFSPs,significant developments of some metaheuristic algorithms are necessary.In this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in DPFSPs.According to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm.We compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.展开更多
We introduce two new types of tensors called the strictly semimonotone tensor and the range column sufficient tensor and explore their structure properties. Based on the obtained results, we make a characterization to...We introduce two new types of tensors called the strictly semimonotone tensor and the range column sufficient tensor and explore their structure properties. Based on the obtained results, we make a characterization to the solution of tensor complementarity problem.展开更多
In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be obtained by this m...In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be obtained by this method.展开更多
The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are supe...The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.展开更多
We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger (GHZ) states and , an equal superposition of W and o...We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger (GHZ) states and , an equal superposition of W and obverse W states. Along with a comparison of pairwise entanglement and monogamy properties, we explore the geometric information contained in them by constructing their canonical steering ellipsoids. We obtain the volume monogamy relations satisfied by states as a function of number of qubits and compare with the maximal monogamy property of GHZ states.展开更多
文摘In this paper,we summarize recent progresses made in deep learning based acoustic models and the motivation and insights behind the surveyed techniques.We first discuss models such as recurrent neural networks(RNNs) and convolutional neural networks(CNNs) that can effectively exploit variablelength contextual information,and their various combination with other models.We then describe models that are optimized end-to-end and emphasize on feature representations learned jointly with the rest of the system,the connectionist temporal classification(CTC) criterion,and the attention-based sequenceto-sequence translation model.We further illustrate robustness issues in speech recognition systems,and discuss acoustic model adaptation,speech enhancement and separation,and robust training strategies.We also cover modeling techniques that lead to more efficient decoding and discuss possible future directions in acoustic model research.
基金supported by Visiting Scholar Foundation of Key Lab in University and by National Natural Science Foundation of China (Grant No. 10571045)Specialized Research Fund for the Doctoral Program of Higher Education of Ministry of Education of China (Grant No. 44k55050)
文摘Nowadays orthogonal arrays play important roles in statistics, computer science, coding theory and cryptography. The usual difference matrices are essential for the construction for many mixed orthogonal arrays. But there are also orthogonal arrays which cannot be obtained by the usual difference matrices, such as mixed orthogonal arrays of run size 60. In order to construct these mixed orthogonal arrays, a class of special so-called generalized difference matrices were discovered by Zhang (1989,1990,1993,2006) from the orthogonal decompositions of projection matrices. In this article, an interesting equivalent relationship between orthogonal arrays and the generalized difference matrices is presented and proved. As an application, a lot of new orthogonal arrays of run size 60 have been constructed.
基金supported by Australian Research Council (Grant No. DP0558773)National Natural Science Foundation of China (Grant No. 10571180)the Research Grants Council of the Hong Kong Special Admin-istrative Region of China (Grant No. 612405)
文摘Permutation polynomials have been an interesting subject of study for a long time and have applications in many areas of mathematics and engineering. However, only a small number of specific classes of permutation polynomials are known so far. In this paper, six classes of linearized permutation polynomials and six classes of nonlinearized permutation polynomials over F33m are presented. These polynomials have simple shapes, and they are related to planar functions.
基金This work was jointly supported by the National Natural Science Foundation of China(Nos.61803192,61973203,61966012,61773192,61603169,61773246,and 71533001)Thanks for the support of Shandong province colleges and universities youth innovation talent introduction and education program.
文摘To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times.To solve DPFSPs,significant developments of some metaheuristic algorithms are necessary.In this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in DPFSPs.According to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm.We compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms.
基金The authors wish to give their sincere thanks to the anonymous referees for their valuable suggestions and helpful comments, which help improve the presentation of the paper. This research was done during Xueyong Wang＇s postdoctoral period in Qufu Normal University. This work was supported by the National Natural Science Foundation of China （Grants Nos. 11671228, 11601261, 11401058）, the Natural Science Foundation of Shandong Province （Grant No. ZR2016AQ12）, and the Science ＆ Technology Planning Project of Qufu Normal University （XKJ201623）.
文摘We introduce two new types of tensors called the strictly semimonotone tensor and the range column sufficient tensor and explore their structure properties. Based on the obtained results, we make a characterization to the solution of tensor complementarity problem.
基金The work was supported by Visiting Scholar Foundation of Key Lab in Universityby Natural Science Foundation No.10571045,No.0224370051(Henan)and No.0211063100(Henan)in China.
文摘In this article, we propose a new general approach to constructing asymmetrical orthogonal arrays, namely the Kronecker sum. It is interesting since a lot of new mixed-level orthogonal arrays can be obtained by this method.
基金Partially supported by Faculty-Research Grant,Hong Kong Baptist University
文摘The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in 1994.However, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-graceful. A conjecture is proposed.
文摘We explore the entanglement features of pure symmetric N-qubit states characterized by N-distinct spinors with a particular focus on the Greenberger-Horne-Zeilinger (GHZ) states and , an equal superposition of W and obverse W states. Along with a comparison of pairwise entanglement and monogamy properties, we explore the geometric information contained in them by constructing their canonical steering ellipsoids. We obtain the volume monogamy relations satisfied by states as a function of number of qubits and compare with the maximal monogamy property of GHZ states.
