Abstract

In this paper, the intrinsic characteristics of speech modulations are estimated to propose the instant modulation spectral features for efficient emotion recognition. This feature representation is based on single frequency filtering (SFF) technique and higher order nonlinear energy operator. The speech signal is decomposed into frequency sub-bands using SFF, and associated nonlinear energies are estimated with higher order nonlinear energy operator. Then, the feature vector is realized using cepstral analysis. The high-resolution property of SFF technique is exploited to extract the amplitude envelope of the speech signal at a selected frequency with good time-frequency resolution. The fourth order nonlinear energy operator provides noise robustness in estimating the modulation components. The proposed feature set is tested for the emotion recognition task using the i-vector model with the probabilistic linear discriminant scoring scheme, support vector machine and random forest classifiers. The results demonstrate that the performance of this feature representation is better than the widely used spectral and prosody features, achieving detection accuracy of 85.75%, 59.88%, and 65.78% on three emotional databases, EMODB, FAUAIBO, and IEMOCAP, respectively. Further, the proposed features are found to be robust in the presence of additive white Gaussian and vehicular noises.

Abstract

The experience often described as feeling moved, understood chiefly as a social-relational emotion with social bonding functions, has gained significant research interest in recent years. Although listening to music often evokes what people describe as feeling moved, very little is known about the appraisals or musical features contributing to the experience. In the present study, we investigated experiences of feeling moved in response to music using a continuous rating paradigm. A total of 415 US participants completed an online experiment where they listened to seven moving musical excerpts and rated their experience while listening. Each excerpt was randomly coupled with one of seven rating scales (perceived sadness, perceived joy, feeling moved or touched, sense of connection, perceived beauty, warmth [in the chest], or chills) for each participant. The results revealed that musically evoked experiences of feeling moved are associated with a similar pattern of appraisals, physiological sensations, and trait correlations as feeling moved by videos depicting social scenarios (found in previous studies). Feeling moved or touched by both sadly and joyfully moving music was associated with experiencing a sense of connection and perceiving joy in the music, while perceived sadness was associated with feeling moved or touched only in the case of sadly moving music. Acoustic features related to arousal contributed to feeling moved only in the case of joyfully moving music. Finally, trait empathic concern was positively associated with feeling moved or touched by music. These findings support the role of social cognitive and empathic processes in music listening, and highlight the social-relational aspects of feeling moved or touched by music.

Abstract

Music listening is a great resource for mental well-being, pleasure, and self-regulation, but it may also be maladaptive. Depression, for instance, has been shown to relate to music use that is characterized by rumination, avoidance, and mood worsening. However, we know little of the role of individual differences in such maladaptive music use. Hence, this study focused on examining the role of personality, empathic traits, emotional contagion, and the types of musical reward as predictors of maladaptive music listening. Participants (N=318) answered an online survey comprising measures for the abovementioned traits in addition to the Healthy-Unhealthy Music Scale (HUMS) as a measure of maladaptive music use. Results demonstrated that Unhealthy musical engagement was predicted by a variety of traits representing general negative emotionality (e.g., Neuroticism, Personal Distress, contagion for negative emotions). Structural equation modeling highlighted the importance of the empathic trait Personal Distress in mediating Unhealthy musical engagement. Finally, we deliberate if maladaptive strategies are indeed “maladaptive” for such individuals or merely a coping mechanism, which is indeed adaptive for them, aiding to combat depressive and anxious states thereby preventing them from “tipping over” into depression.

Abstract

Social Media Platforms like Facebook, Twitter, Instagram, etc. have large user base all around the world that generates huge amounts of data every second. This includes a lot of posts by fake and spam users, typically used by many organizations around the globe to gain a competitive edge over others. In this work, we aim at detecting such user accounts on Twitter. We show how to distinguish between Genuine and Spam accounts in Twitter using a novel combination of feature engineering, network representation, and natural language processing techniques. Index Terms—social media, fake user, Twitter, spam detection, graph, natural language processing

Abstract

The increasing focus on Web 3.0 is leading to automated creation and enrichment of ontologies and other linked datasets. Alongside automation, quality evaluation of enriched ontologies can impact software reliability and reuse. Current quality evaluation approaches oftentimes seek to evaluate ontologies in either syntactic (degree of following ontology development guidelines) or semantic (degree of semantic validity of enriched concepts/relations) aspects. This paper proposes an ontology quality evaluation framework consisting of: (a) SynEvaluator and (b) SemValidator for evaluating syntactic and semantic aspects of ontologies respectively. SynEvaluator allows dynamic task-specific creation and updation of syntactic rules at run-time without any need for programming. SemValidator uses Twitter-based expertise of validators for semantic evaluation. The efficacy and validity of the framework is shown empirically on multiple ontologies

Abstract

The paper looks into the ideological shifts in the Major political parties in India over the first two decades of this century. This is done by analysing the election manifestos published by Political parties for the general elections held in this period. The paper places Political parties in the left-right spectrum on social, economic and political dimensions. Also, it analyses the focus given by political parties on various topics to understand the priority focusing on Labour Vs Capital, Centre Vs Periphery, Rich Vs Poor and Urban Vs Rural debates. The political parties broadly maintain their ideological stand over different subjects. We observe a reduction in the space manifestos left for Labourers and their welfare while capital is given more importance over time. Similarly, Focus is slowly shifting to Urban areas from rural areas. We argue that the shift in demographics with the burgeoning middle class and increasing Urban population has led to this ideological shift in Indian political parties. We observe that the position on federalism has become a major dividing issue among major political parties, with a stark contrast between the views of ruling and opposition parties. The focus on Social welfare schemes remains the focus for all political parties, and a significant policy shift to the Middle class at the expense of the poor is not observed.

Abstract

One of the main reasons for query model’s prominence in quantum complexity is the presence of concrete lower bounding techniques: polynomial method and adversary method. There have been considerable efforts to not just give lower bounds using these methods but even to compare and relate them. We explore the value of these bounds on quantum query complexity for the class of symmetric functions, arguably one of the most natural and basic set of Boolean functions. We show (using the recently introduced spectral sensitivity) that both these bounds (positive adversary and approximate degree) give the same value for every total symmetric Boolean function. We also look at the quantum query complexity of Gap Majority, a partial symmetric function. It has gained importance recently in regard to understanding the composition of randomized query complexity. We characterize the quantum query complexity of Gap Majority and show a lower bound on noisy randomized query complexity (Ben-David and Blais, FOCS 2020) in terms of quantum query complexity. In addition, we study how large certificate complexity and block sensitivity can be as compared to sensitivity (even up to constant factors) for symmetric functions. We show tight separations, i.e., give upper bound on possible separations and construct functions achieving the same.

Abstract

Standard Model Predictive Control (MPC) or trajectory optimization approaches perform only a local search to solve a complex non-convex optimization problem. As a result, they cannot capture the multi-modal characteristic of human driving. A global optimizer can be a potential solution but is computationally intractable in a real-time setting. In this paper, we present a real-time MPC capable of searching over different driving modalities. Our basic idea is simple: we run several goal-directed parallel trajectory optimizations and score the resulting trajectories based on user-defined meta cost functions. This allows us to perform a global search over several locally optimal motion plans. Although conceptually straightforward, realizing this idea in real-time with existing optimizers is highly challenging from technical and computational standpoints. With this motivation, we present a novel batch nonholonomic trajectory optimization whose underlying matrix algebra is easily parallelizable across problem instances and reduces to computing large batch matrix-vector products. This structure, in turn, is achieved by deriving a linearization-free multi-convex reformulation of the non-holonomic kinematics and collision avoidance constraints. We extensively validate our approach using both synthetic and real data sets (NGSIM) of traffic scenarios. We highlight how our algorithm automatically takes lane-change and overtaking decisions based on the defined meta cost function. Our batch optimizer achieves trajectories with lower meta cost, up to 6x faster than competing baselines.

Abstract

The significance of negative quantum conditional entropy is underscored by its ubiquity in information processing tasks like dense coding, state merging and one-way entanglement distillation. Mere presence of entanglement is not sufficient for these tasks, a fact underpinned by the existence of entangled quantum states with non-negative conditional entropy. This stimulates one to go beyond the paradigm of entanglement theory and probe the hitherto unexplored area of operations influencing quantum conditional entropy. To this end, we introduce the class of A-unital channels. We characterize them and demonstrate that A-unital channels are to states having non-negative conditional entropy what separable channels are to separable states. We also show that A-unital channels form the largest class of channels that do not decrease the conditional entropy of any state, a relation analogous to unital channels and entropy. A comparative study between A-unital and other channels crucial to the resource theory of entanglement is done to further exemplify the distinction with entanglement theory. Non-local unitary operations can decrease conditional entropy to sub-zero levels. However, there exist states whose conditional entropy remains non-negative even under this action. Termed as states having absolute conditional entropy, they prove to be robust against non-local unitary action. In this work, the completely free operations for such states are also characterized. Finally, since von Neumann entropy is the mainspring of these discussions, the bounds on the conditional entropy of states having a given entropy are derived. The definition of A-unital channels naturally lends itself to a procedure for determining membership of channels in this class. Thus, we not only characterize completely free channels for quantum conditional entropy, but also show how resourceful channels can be detected.

Abstract

Quantum chemistry calculations such as the prediction of molecular properties and modeling of chemical reactions are a few of the critical areas where near-term quantum computers can showcase quantum advantage. We present a method to calculate energy derivatives for both ground state and excited state energies with respect to the parameters of a chemical system based on the framework of the variational quantum eigensolver (VQE). A low-depth implementation of quantum circuits within the hybrid variational paradigm is designed, and their computational costs are analyzed. We showcase the effectiveness of our method by incorporating it in some key quantum chemistry applications of energy derivatives, such as to perform minimum energy configuration search and estimate molecular response properties estimation of H2 molecule, and also to find the transition state of H2 + H ↔ H + H2 reaction. The obtained results are shown to be in complete agreement with their respective full configuration interaction (FCI) values. Keywords: Quantum Computing, Quantum Chemistry, Variational Quantum Eigensolver, Hybrid QuantumClassical Algorithms