Automatic Geminate Insertion Algorithm for Japanese Audio Data

Generally, it is quite difficult for Japanese language learners to acquire Japanese special morae, namely, geminate, syllabic nasals and long vowels compared to independent morae. Among these three special morae, geminate is particularly difficult, and it takes much longer to fully acquire both production and perception of it. Especially for learners of Chinese native speakers, previous studies has shown that both production and perception of geminate are difficult in terms of the fact that not only no geminate is found in Chinese language, but also the phonological interaction between Japanese accent and Chinese tones. However, in the field of Japanese speech acquisition, research has not making progress because of a major problem, that is, researchers themselves manually create the acoustic experiment stimuli. Therefore, in this study, as a method to solve this problem, we propose an algorithm that automatically inserts geminate into the audio data used in Japanese speech acquisition research. This algorithm automates the insertion of geminate by performing three processes in order: mora extraction by noise removal, matching of original audio data and extracted mora, and insertion of soundless duration and geminate. The algorithm makes it possible to remove the noise, which is -50 dBFS and continues for 10ms or more, and replace it with soundless duration instead, allowing Japanese native speakers to percept it as geminate. The accuracy was equivalent as a result of comparing the data that was manually modified by a phonology researcher with the data that was generated by the algorithm. The result shows that the algorithm can be a practical solution for the automation of geminate insertion.

Back stable Schubert calculus

We study the back stable Schubert calculus of the infinite flag variety. Our main results are: – a formula for back stable (double) Schubert classes expressing them in terms of a symmetric function part and a finite part; – a novel definition of double and triple Stanley symmetric functions; – a proof of the positivity of double Edelman–Greene coefficients generalizing the results of Edelman–Greene and Lascoux–Schützenberger; – the definition of a new class of bumpless pipedreams, giving new formulae for double Schubert polynomials, back stable double Schubert polynomials, and a new form of the Edelman–Greene insertion algorithm; – the construction of the Peterson subalgebra of the infinite nilHecke algebra, extending work of Peterson in the affine case; – equivariant Pieri rules for the homology of the infinite Grassmannian; – homology divided difference operators that create the equivariant homology Schubert classes of the infinite Grassmannian.

The Effectiveness of Clarke Wright and Sequential Insertion Algorithm in Distribution Routing Aqua

With the Multiple Trips condition, the results obtained for the optimal distance route that starts and stops at PT. Tirta Investama Medan with Clarke Wright Algorithm at t = 1 is 22 km and at t = t + 1 is 15.2 km. While the optimal travel distance route with the Sequential Insertion Algorithm at t = 1 is 15.05 km, and at t = t + 1 is 22.9 km. Clarke Wright Algorithm looks for an optimal solution to get the best route, while Sequential Insertion Algorithm has an excess in the election of a customer by considering customer position with available insertion track location until all customer have been assigned. The Clarke Wright Algorithm obtained a total distance of 37.2 km. In comparison, the Sequential Insertion Algorithm solution obtained a total distance of 37.95 km. It can be concluded that the route formed using the Clarke Wright Algorithm in this case is more effective than using the Sequential Insertion Algorithm.

Multijob Associated Task Scheduling for Cloud Computing Based on Task Duplication and Insertion

With the emergence and development of various computer technologies, many jobs processed in cloud computing systems consist of multiple associated tasks which follow the constraint of execution order. The task of each job can be assigned to different nodes for execution, and the relevant data are transmitted between nodes to complete the job processing. The computing or communication capabilities of each node may be different due to processor heterogeneity, and hence, a task scheduling algorithm is of great significance for job processing performance. An efficient task scheduling algorithm can make full use of resources and improve the performance of job processing. The performance of existing research on associated task scheduling for multiple jobs needs to be improved. Therefore, this paper studies the problem of multijob associated task scheduling with the goal of minimizing the jobs’ makespan. This paper proposes a task Duplication and Insertion algorithm based on List Scheduling (DILS) which incorporates dynamic finish time prediction, task replication, and task insertion. The algorithm dynamically schedules tasks by predicting the completion time of tasks according to the scheduling of previously scheduled tasks, replicates tasks on different nodes, reduces transmission time, and inserts tasks into idle time slots to speed up task execution. Experimental results demonstrate that our algorithm can effectively reduce the jobs’ makespan.

A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem

This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). Quite unlike the symmetric Travelling Salesman Problem, there is a paucity of research studies on the asymmetric counterpart. This is quite disturbing because most real-life applications are actually asymmetric in nature. These six algorithms were chosen for their performance comparison because they have posted some of the best results in literature and they employ different search schemes in attempting solutions to the ATSP. The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. After a number of experiments on the popular but difficult 15 out of the 19 ATSP instances in TSPLIB, the results show that the African Buffalo Optimization algorithm slightly outperformed the other algorithms in obtaining the optimal results and at a much faster speed.

A charge-density-based general cation insertion algorithm for generating new Li-ion cathode materials

Future lithium (Li) energy storage technologies, in particular solid-state configurations with a Li metal anode, opens up the possibility of using cathode materials that do not necessarily contain Li in its as-made state. To accelerate the discovery and design of such materials, we develop a general, chemically, and structurally agnostic methodology for identifying the optimal Li sites in any crystalline material. For a given crystal structure, we attempt multiple Li insertions at symmetrically in-equivalent positions by analyzing the electronic charge density obtained from first-principles density functional theory. In this report, we demonstrate the effectiveness of this procedure in successfully identifying the positions of the Li ion in well-known cathode materials using only the empty host (charged) material as guidance. Furthermore, applying the algorithm to over 2000 candidate cathode empty host materials we obtain statistics of Li site preferences to guide future developments of novel Li-ion cathode materials, particularly for solid-state applications.