1,670 research outputs found

    Rhythm-Flexible Voice Conversion without Parallel Data Using Cycle-GAN over Phoneme Posteriorgram Sequences

    Full text link
    Speaking rate refers to the average number of phonemes within some unit time, while the rhythmic patterns refer to duration distributions for realizations of different phonemes within different phonetic structures. Both are key components of prosody in speech, which is different for different speakers. Models like cycle-consistent adversarial network (Cycle-GAN) and variational auto-encoder (VAE) have been successfully applied to voice conversion tasks without parallel data. However, due to the neural network architectures and feature vectors chosen for these approaches, the length of the predicted utterance has to be fixed to that of the input utterance, which limits the flexibility in mimicking the speaking rates and rhythmic patterns for the target speaker. On the other hand, sequence-to-sequence learning model was used to remove the above length constraint, but parallel training data are needed. In this paper, we propose an approach utilizing sequence-to-sequence model trained with unsupervised Cycle-GAN to perform the transformation between the phoneme posteriorgram sequences for different speakers. In this way, the length constraint mentioned above is removed to offer rhythm-flexible voice conversion without requiring parallel data. Preliminary evaluation on two datasets showed very encouraging results.Comment: 8 pages, 6 figures, Submitted to SLT 201

    THE INFLUENCE OF DIFFERENT STRIKE PAITERNS ON ENERGY CONTIBUTION DURING RUNNING

    Get PDF
    Purpose: The purpose of this study was to determine the differences of joint power and work between forefoot strike (FFS) and rear-foot strike (RFS) during the stance phase of running. Methods: A 10-camera Vicon system and two force plates were used to collect the kinematics and kinetics data of 15 healthy male triathletes with different foot strike strategies during running. Results: The joint power and positive work at hip and ankle were increased in FFS during the stance phase. FFS also showed decreased knee negative work. Conclusion: Running with FFS would consume more energy than running with RFS at the same speed. The lack of ankle pint shock absorption in RFS might cause higher injury risk in knee

    MECHANISM OF LANDING STRATERGY DURING STEP AEROBICS WITH DIFFERENT BENCH HEIGHTS AND LOADS

    Get PDF
    The purpose of this study was to investigate effects of different heights (6inch, 8inch, 10inch) and external loads (0% BW, 10% BW, 15% BW) on lower extremity during step aerobics. Ten college physical education students (age: 23.8 ± 2.1 years, height: 173.5 ± 6.1 cm, weight: 68.5 ± 8.0 kg) participated in this study. A Mega high-speed camera (100 Hz) and an ATMI force plate (1000Hz) were used to record kinematic and kinetic data respectively during step aerobics. Increased vertical ground reaction force, ankle movement, and decreased leg stiffness and ankle joint stiffness were found as the bench height increased to 10 inches which were considered to a high loading rates and shock to the lower extremity, especially at ankle joint. Therefore, people should avoid doing step aerobics at 10-inch bench height for a long time to protect ankle joint and soft tissue from injury

    THE INFLUENCE OF TAI-CHI EXERCISE ON DYNAMICS OF LOWER EXTREMITY FOR THE ELDERLY DURING SIT-TO-STAND

    Get PDF
    The purpose of this study was to investigate the influence of Tai Chi exercise on sit-tostand in the elderly. Ten healthy female elders (normal group) and nine healthy Tai-Chi female practitioner (Tai-Chi group) participated in this study. The results indicated: (1) During the forward flexion phase, normal group showed significantly greater hip flexion angle and moment than Tai-Chi group (

    On the Efficiency of An Election Game of Two or More Parties: How Bad Can It Be?

    Full text link
    We extend our previous work on two-party election competition [Lin, Lu & Chen 2021] to the setting of three or more parties. An election campaign among two or more parties is viewed as a game of two or more players. Each of them has its own candidates as the pure strategies to play. People, as voters, comprise supporters for each party, and a candidate brings utility for the the supporters of each party. Each player nominates exactly one of its candidates to compete against the other party's. A candidate is assumed to win the election with higher odds if it brings more utility for all the people. The payoff of each player is the expected utility its supporters get. The game is egoistic if every candidate benefits her party's supporters more than any candidate from the competing party does. In this work, we first argue that the election game always has a pure Nash equilibrium when the winner is chosen by the hardmax function, while there exist game instances in the three-party election game such that no pure Nash equilibrium exists even the game is egoistic. Next, we propose two sufficient conditions for the egoistic election game to have a pure Nash equilibrium. Based on these conditions, we propose a fixed-parameter tractable algorithm to compute a pure Nash equilibrium of the egoistic election game. Finally, perhaps surprisingly, we show that the price of anarchy of the egoistic election game is upper bounded by the number of parties. Our findings suggest that the election becomes unpredictable when more than two parties are involved and, moreover, the social welfare deteriorates with the number of participating parties in terms of possibly increasing price of anarchy. This work alternatively explains why the two-party system is prevalent in democratic countries

    Novel CMOS RFIC Layout Generation with Concurrent Device Placement and Fixed-Length Microstrip Routing

    Full text link
    With advancing process technologies and booming IoT markets, millimeter-wave CMOS RFICs have been widely developed in re- cent years. Since the performance of CMOS RFICs is very sensi- tive to the precision of the layout, precise placement of devices and precisely matched microstrip lengths to given values have been a labor-intensive and time-consuming task, and thus become a major bottleneck for time to market. This paper introduces a progressive integer-linear-programming-based method to gener- ate high-quality RFIC layouts satisfying very stringent routing requirements of microstrip lines, including spacing/non-crossing rules, precise length, and bend number minimization, within a given layout area. The resulting RFIC layouts excel in both per- formance and area with much fewer bends compared with the simulation-tuning based manual layout, while the layout gener- ation time is significantly reduced from weeks to half an hour.Comment: ACM/IEEE Design Automation Conference (DAC), 201
    • …
    corecore