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

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

Paging and Location Management in IEEE 802.16j Multihop Relay Network

IEEE 802.16j is an emerging wireless broadband networking standard that integrates infrastructure base stations with multihop relay technology. Based on the idle mode operation in IEEE 802.16j, we propose a novel location management and paging scheme. It integrates the paging area-based and the timer-based location update mechanism. In paging area-based scheme, an idle mode mobile station updates when it moves to a new paging area. In timer-based scheme, an idle mode MS updates when the location update timer expires. In this work, we formulate the mathematical model to evaluate the performance of the proposed paging scheme. A new random walk mobility model that is suitable for modeling in multihop relay network is created. Optimization of location update timer is also investigated

A Systematic Hardware Sharing Method for Unified Architecture Design of H.264 Transforms

Multitransform techniques have been widely used in modern video coding and have better compression efficiency than the single transform technique that is used conventionally. However, every transform needs a corresponding hardware implementation, which results in a high hardware cost for multiple transforms. A novel method that includes a five-step operation sharing synthesis and architecture-unification techniques is proposed to systematically share the hardware and reduce the cost of multitransform coding. In order to demonstrate the effectiveness of the method, a unified architecture is designed using the method for all of the six transforms involved in the H.264 video codec: 2D 4 × 4 forward and inverse integer transforms, 2D 4 × 4 and 2 × 2 Hadamard transforms, and 1D 8 × 8 forward and inverse integer transforms. Firstly, the six H.264 transform architectures are designed at a low cost using the proposed five-step operation sharing synthesis technique. Secondly, the proposed architecture-unification technique further unifies these six transform architectures into a low cost hardware-unified architecture. The unified architecture requires only 28 adders, 16 subtractors, 40 shifters, and a proposed mux-based routing network, and the gate count is only 16308. The unified architecture processes 8 pixels/clock-cycle, up to 275 MHz, which is equal to 707 Full-HD 1080 p frames/second

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

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

Is deck B a disadvantageous deck in the Iowa Gambling Task?

BACKGROUND: The Iowa gambling task is a popular test for examining monetary decision behavior under uncertainty. According to Dunn et al. review article, the difficult-to-explain phenomenon of "prominent deck B" was revealed, namely that normal decision makers prefer bad final-outcome deck B to good final-outcome decks C or D. This phenomenon was demonstrated especially clearly by Wilder et al. and Toplak et al. The "prominent deck B" phenomenon is inconsistent with the basic assumption in the IGT; however, most IGT-related studies utilized the "summation" of bad decks A and B when presenting their data, thereby avoiding the problems associated with deck B. METHODS: To verify the "prominent deck B" phenomenon, this study launched a two-stage simple version IGT, namely, an AACC and BBDD version, which possesses a balanced gain-loss structure between advantageous and disadvantageous decks and facilitates monitoring of participant preferences after the first 100 trials. RESULTS: The experimental results suggested that the "prominent deck B" phenomenon exists in the IGT. Moreover, participants cannot suppress their preference for deck B under the uncertain condition, even during the second stage of the game. Although this result is incongruent with the basic assumption in IGT, an increasing number of studies are finding similar results. The results of the AACC and BBDD versions can be congruent with the decision literatures in terms of gain-loss frequency. CONCLUSION: Based on the experimental findings, participants can apply the "gain-stay, loss-shift" strategy to overcome situations involving uncertainty. This investigation found that the largest loss in the IGT did not inspire decision makers to avoid choosing bad deck B

INVESTIGATING THE INFLUENCE OF AUTHORITARIAN LEADERSHIP AND SUPERVISOR SATISFACTION ON TURNOVER INTENTION: THE MODERATING ROLE OF EMPLOYEE UPBRINGING

Authoritarian leadership is prevalent in the Asian region, and previous research has found a positive correlation between authoritarian leadership and employees' intention to leave their jobs. However, there are employees in the workplace who can adapt to such supervisors. Therefore, we approach this study from the perspective of "fit theory" to explore whether employees with authoritarian family upbringing can match with authoritarian leadership. This study aims to investigate the impact of authoritarian leadership on employees' intention to leave, with supervisor satisfaction as the mediator and employees' authoritarian family upbringing as the moderator. A total of 232 valid questionnaires were collected in this study. The results revealed that the level of authoritarian family upbringing among employees has a moderating effect on the relationship between authoritarian leadership and supervisor satisfaction