Query: Exploring Vector Spaces for Semantic Relations

Relevant passages:
Entailment above the word level in distributional semantics <=SEP=> We introduce two ways to detect entailment using distributional semantic representations of phrases. Our first experiment shows that the entailment relation between adjective-noun constructions and their head nouns (big cat |= cat), once represented as semantic vector pairs, generalizes to lexical entailment among nouns (dog |= animal). Our second experiment shows that a classifier fed semantic vector pairs can similarly generalize the entailment relation among quantifier phrases (many dogs|=some dogs) to entailment involving unseen quantifiers (all cats|=several cats). Moreover, nominal and quantifier phrase entailment appears to be cued by different distributional correlates, as predicted by the type-based view of entailment in formal semantics.

Don't count, predict! A systematic comparison of context-counting vs. context-predicting semantic vectors <=SEP=> Context-predicting models (more commonly known as embeddings or neural language models) are the new kids on the distributional semantics block. Despite the buzz surrounding these models, the literature is still lacking a systematic comparison of the predictive models with classic, count-vector-based distributional semantic approaches. In this paper, we perform such an extensive evaluation, on a wide range of lexical semantics tasks and across many parameter settings. The results, to our own surprise, show that the buzz is fully justified, as the context-predicting models obtain a thorough and resounding victory against their count-based counterparts.

Do Supervised Distributional Methods Really Learn Lexical Inference Relations? <=SEP=> Distributional representations of words have been recently used in supervised settings for recognizing lexical inference relations between word pairs, such as hypernymy and entailment. We investigate a collection of these state-of-the-art methods, and show that they do not actually learn a relation between two words. Instead, they learn an independent property of a single word in the pair: whether that word is a “prototypical hypernym”.

Hierarchical Clustering Algorithms for Document Datasets <=SEP=> Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In particular, clustering algorithms that build meaningful hierarchies out of large document collections are ideal tools for their interactive visualization and exploration as they provide data-views that are consistent, predictable, and at different levels of granularity. This paper focuses on document clustering algorithms that build such hierarchical solutions and (i) presents a comprehensive study of partitional and agglomerative algorithms that use different criterion functions and merging schemes, and (ii) presents a new class of clustering algorithms called constrained agglomerative algorithms, which combine features from both partitional and agglomerative approaches that allows them to reduce the early-stage errors made by agglomerative methods and hence improve the quality of clustering solutions. The experimental evaluation shows that, contrary to the common belief, partitional algorithms always lead to better solutions than agglomerative algorithms; making them ideal for clustering large document collections due to not only their relatively low computational requirements, but also higher clustering quality. Furthermore, the constrained agglomerative methods consistently lead to better solutions than agglomerative methods alone and for many cases they outperform partitional methods, as well.

Exploring Various Knowledge in Relation Extraction <=SEP=> Extracting semantic relationships between entities is challenging. This paper investigates the incorporation of diverse lexical, syntactic and semantic knowledge in feature-based relation extraction using SVM. Our study illustrates that the base phrase chunking information is very effective for relation extraction and contributes to most of the performance improvement from syntactic aspect while additional information from full parsing gives limited further enhancement. This suggests that most of useful information in full parse trees for relation extraction is shallow and can be captured by chunking. We also demonstrate how semantic information such as WordNet and Name List, can be used in feature-based relation extraction to further improve the performance. Evaluation on the ACE corpus shows that effective incorporation of diverse features enables our system outperform previously best-reported systems on the 24 ACE relation subtypes and significantly outperforms tree kernel-based systems by over 20 in F-measure on the 5 ACE relation types.

Learning concepts and categories: is spacing the "enemy of induction"? <=SEP=> Inductive learning -- that is, learning a new concept or category by observing exemplars -- happens constantly, for example, when a baby learns a new word or a doctor classifies x-rays. What influence does the spacing of exemplars have on induction? Compared with massing, spacing enhances long-term recall, but we expected spacing to hamper induction by making the commonalities that define a concept or category less apparent. We asked participants to study multiple paintings by different artists, with a given artist's paintings presented consecutively (massed) or interleaved with other artists' paintings (spaced). We then tested induction by asking participants to indicate which studied artist (Experiments 1a and 1b) or whether any studied artist (Experiment 2) painted each of a series of new paintings. Surprisingly, induction profited from spacing, even though massing apparently created a sense of fluent learning: Participants rated massing as more effective than spacing, even after their own test performance had demonstrated the opposite.

A survey on Vehicular Cloud Computing and its security <=SEP=> Vehicular networking has a significant advantages in the today era. It provides desirable features and some specific applications such as efficient traffic management, road safety and infotainment. The vehicle consists of comparatively more communication systems such as on-board computing device, storage and computing power, GPS etc. to provide Intelligent Transportation System (ITS). The new hybrid technology known as Vehicular Cloud Computing (VCC) has great impact on the ITS by using the resources of vehicles such as GPS, storage, internet and computing power for instant decision making and sharing information on the cloud. Moreover, the paper not only present the concept of vehicular cloud but also provide a brief overview on the applications, security issues, threats and security solution for the VCC.

Using Lexical Resources for Irony and Sarcasm Classification <=SEP=> The paper presents a language dependent model for classification of statements into ironic and non-ironic. The model uses various language resources: morphological dictionaries, sentiment lexicon, lexicon of markers and a WordNet based ontology. This approach uses various features: antonymous pairs obtained using the reasoning rules over the Serbian WordNet ontology (R), antonymous pairs in which one member has positive sentiment polarity (PPR), polarity of positive sentiment words (PSP), ordered sequence of sentiment tags (OSA), Part-of-Speech tags of words (POS) and irony markers (M). The evaluation was performed on two collections of tweets that had been manually annotated according to irony. These collections of tweets as well as the used language resources are in the Serbian language (or one of closely related languages --Bosnian/Croatian/Montenegrin). The best accuracy of the developed classifier was achieved for irony with a set of 5 features -- (PPR, PSP, POS, OSA, M) -- acc = 86.1%, while for sarcasm the best results were achieved with the set (R, PSP, POS, OSA, M) -- acc = 72.8.

Robust Non-Rigid Motion Tracking and Surface Reconstruction Using $L_0$ Regularization <=SEP=> We present a new motion tracking technique to robustly reconstruct non-rigid geometries and motions from a single view depth input recorded by a consumer depth sensor. The idea is based on the observation that most non-rigid motions (especially human-related motions) are intrinsically involved in articulate motion subspace. To take this advantage, we propose a novel <inline-formula><tex-math notation="LaTeX">$L_0$</tex-math><alternatives> <inline-graphic xlink:href="xu-ieq2-2688331.gif"/></alternatives></inline-formula> based motion regularizer with an iterative solver that implicitly constrains local deformations with articulate structures, leading to reduced solution space and physical plausible deformations. The <inline-formula><tex-math notation="LaTeX">$L_0$</tex-math> <alternatives><inline-graphic xlink:href="xu-ieq3-2688331.gif"/></alternatives></inline-formula> strategy is integrated into the available non-rigid motion tracking pipeline, and gradually extracts articulate joints information online with the tracking, which corrects the tracking errors in the results. The information of the articulate joints is used in the following tracking procedure to further improve the tracking accuracy and prevent tracking failures. Extensive experiments over complex human body motions with occlusions, facial and hand motions demonstrate that our approach substantially improves the robustness and accuracy in motion tracking.

SimSensei Demonstration: A Perceptive Virtual Human Interviewer for Healthcare Applications <=SEP=> We present the SimSensei system, a fully automatic virtual agent that conducts interviews to assess indicators of psychological distress. We emphasize on the perception part of the system, a multimodal framework which captures and analyzes user state for both behavioral understanding and interactional purposes.

Grid interfaced solar PV based water pumping using brushless DC motor drive <=SEP=> This paper proposes a solar photovoltaic (PV) fed water pumping system driven by a brushless DC (BLDC) motor. A promising case of interruption in the water pumping due to the intermittency of PV power generation is resolved by using a power grid as an external power backup. The power is drawn from the grid in case the PV array is unable to meet the required power demand, otherwise the PV array is preferably used. A unidirectional power flow control for the same is developed and realized through a power factor corrected (PFC) boost converter. The proposed system and control enable a consumer to get a full volume of water delivery throughout the day and night regardless of the climatic condition. The utilization of motor-pump at best is thus made possible in addition to an enhanced reliability of the pumping system. The power quality standards required at the utility grid are met by the developed control. The MATLAB/Simulink based simulations and the performance analysis are carried out to demonstrate the applicability of the system.

Viewpoint Invariant Pedestrian Recognition with an Ensemble of Localized Features <=SEP=> Viewpoint invariant pedestrian recognition is an important yet under-addressed problem in computer vision. This is likely due to the difficulty in matching two objects with unknown viewpoint and pose. This paper presents a method of performing viewpoint invariant pedestrian recognition using an efficiently and intelligently designed object representation, the ensemble of localized features (ELF). Instead of designing a specific feature by hand to solve the problem, we define a feature space using our intuition about the problem and let a machine learning algorithm find the best representation. We show how both an object class specific representation and a discriminative recognition model can be learned using the AdaBoost algorithm. This approach allows many different kinds of simple features to be combined into a single similarity function. The method is evaluated using a viewpoint invariant pedestrian recognition dataset and the results are shown to be superior to all previous benchmarks for both recognition and reacquisition of pedestrians.

OpenCV on TI ’ s DSP + ARM ® platforms : Mitigating the challenges of porting OpenCV to embedded platforms Introduction <=SEP=> In today’s advancing market, the growing performance and decreasing price of embedded processors are opening many doors for developers to design highly sophisticated solutions for different end applications. The complexities of these systems can create bottlenecks for developers in the form of longer development times, more complicated development environments and issues with application stability and quality. Developers can address these problems using sophisticated software packages such as OpenCV, but migrating this software to embedded platforms poses its own set of challenges. This paper will review how to mitigate some of these issues, including C++ implementation, memory constraints, floating-point support and opportunities to maximize performance using vendor-optimized libraries and integrated accelerators or co-processors. Finally, we will introduce a new effort by Texas Instruments (TI) to optimize vision systems by running OpenCV on the C6000TM digital signal processor (DSP) architecture. Benchmarks will show the advantage of using the DSP by comparing the performance of a DSP+ARM® system-on-chip (SoC) processor against an ARM-only device. OpenCV on TI’s DSP+ARM platforms: Mitigating the challenges of porting OpenCV to embedded platforms Introduction OpenCV is a free and open-source computer vision library that offers a broad range of functionality under the permissive Berkeley Software Distribution (BSD) license. The library itself is written in C++ and is also usable through C or Python language applications. Thousands of developers use OpenCV to power their own specialized applications, making it the most widely-used library of its kind. The OpenCV project is under active development, with regular updates to eliminate bugs and add new functionality. The mainline development effort targets the x86 architecture and supports acceleration via Intel’s proprietary Integrated Performance Primitives (IPP) library. A recent release also added support for graphics processing unit (GPU) acceleration using NVIDIA’s Compute Unifi ed Device Architecture (CUDA) standard. OpenCV’s greatest asset is the sheer breadth of algorithms included in its standard distribution. Figure 1 on page 2 shows an incomplete list of some of the key function categories included in OpenCV. These range from low-level image fi ltering and transformation to sophisticated feature analysis and machine learning functionality. A complete listing of every function and use case is beyond the scope of this article, but we will consider the unique requirements of developers in the embedded vision space. For these developers, OpenCV represents an attractively comprehensive toolbox of useful, well-tested algorithms that can serve as building blocks for their own specialized applications. The question then becomes whether or not OpenCV can be used directly in their embedded systems. Despite its original development focus for use with PC workstations, OpenCV can also be a useful tool for embedded development. There are vendor-specifi c libraries that offer OpenCV-like capabilities on various embedded systems, but few can match OpenCV’s ubiquity in the computer vision fi eld or the sheer breadth of its included algorithms. It should come as no surprise that OpenCV has already been ported to the ARM® architecture, a popular CPU choice for embedded processors. It’s certainly possible to cross-compile the OpenCV source code as-is and use the result with embedded devices, but memory constraints and other architectural considerations may pose a problem. This white paper will examine some of the specifi c obstacles that must be overcome for OpenCV to achieve acceptable performance on Joseph Coombs, Applications engineering, Texas Instruments Rahul Prabhu, Applications engineering, Texas Instruments W H I T E P A P E R

Active learning: theory and applications to automatic speech recognition <=SEP=> We are interested in the problem of adaptive learning in the context of automatic speech recognition (ASR). In this paper, we propose an active learning algorithm for ASR. Automatic speech recognition systems are trained using human supervision to provide transcriptions of speech utterances. The goal of Active Learning is to minimize the human supervision for training acoustic and language models and to maximize the performance given the transcribed and untranscribed data. Active learning aims at reducing the number of training examples to be labeled by automatically processing the unlabeled examples, and then selecting the most informative ones with respect to a given cost function for a human to label. In this paper we describe how to estimate the confidence score for each utterance through an on-line algorithm using the lattice output of a speech recognizer. The utterance scores are filtered through the informativeness function and an optimal subset of training samples is selected. The active learning algorithm has been applied to both batch and on-line learning scheme and we have experimented with different selective sampling algorithms. Our experiments show that by using active learning the amount of labeled data needed for a given word accuracy can be reduced by more than 60% with respect to random sampling.

An analysis of player affect transitions in survival horror games <=SEP=> The trend of multimodal interaction in interactive gaming has grown significantly as demonstrated for example by the wide acceptance of the Wii Remote and the Kinect as tools not just for commercial games but for game research as well. Furthermore, using the player’s affective state as an additional input for game manipulation has opened the realm of affective gaming. In this paper, we analyzed the affective states of players prior to and after witnessing a scary event in a survival horror game. Player affect data were collected through our own affect annotation tool that allows the player to report his affect labels while watching his recorded gameplay and facial expressions. The affect data were then used for training prediction models with the player’s brainwave and heart rate signals, as well as keyboard–mouse activities collected during gameplay. Our results show that (i) players are likely to get more fearful of a scary event when they are in the suspense state and that (ii) heart rate is a good candidate for detecting player affect. Using our results, game designers can maximize the fear level of the player by slowly building tension until the suspense state and showing a scary event after that. We believe that this approach can be applied to the analyses of different sets of emotions in other games as well.

Model-based control of a 6-dof electrohydraulic Stewart – Gough platform <=SEP=> In this paper, a novel model-based controller for a six Degree-of-Freedom (dof) electrohydraulic Stewart–Gough platform is developed. Dynamic models of low complexity are employed that describe the salient dynamics of the main electrohydraulic components. Rigid body equations of motion and hydraulics dynamics, including friction and servovalve models are used. The developed feedback controller uses the system dynamic and hydraulic model to yield servovalve currents, so that the error dynamics converge asymptotically to zero, independent of load variations. In this approach, force, pressure or acceleration feedback is not required. Simulations with typical desired trajectory inputs are presented and a good performance of the controller is obtained. The proposed methodology can be extended to electrohydraulic serial or closed-chain manipulators and simulators. 2007 Elsevier Ltd. All rights reserved.

Model Selection Management Systems: The Next Frontier of Advanced Analytics <=SEP=> John Boyd recognized in the 1960's the importance of situation awareness for military operations and introduced the notion of the OODA loop (Observe, Orient, Decide, and Act). Today we realize that many applications have to deal with situation awareness: Customer Relationship Management, Human Capital Management, Supply Chain Management, patient care, power grid management, and cloud services management, as well as any IoT (Internet of Things) related application; the list seems to be endless. Situation awareness requires applications to support the management of data, knowledge, processes, and other services such as social networking in an integrated way. These applications additionally require high personalization as well as rapid and continuous evolution. They must provide a wide variety of operational and functional requirements, including real time processing.
 Handcrafting these applications is an almost impossible task requiring exhaustive resources for development and maintenance. Due to the resources and time involved in their development, these applications typically fall way short of the desired functionality, operational characteristics, and ease and speed of evolution. We - the authors - have developed a model enabling the development and maintenance of situation-aware applications in a declarative and therefore economical manner; we call this model KIDS - Knowledge Intensive Data-processing System.

Training Sources 3 D Normalized Pose Space 2 D Normalized Pose Space KD-Tree Input Image 2 D Pose Estimation 3 D Pose Reconstruction <=SEP=> In this work we address the challenging problem of 3D human pose estimation from single images. Recent approaches learn deep neural networks to regress 3D pose directly from images. One major challenge for such methods, however, is the collection of training data. Specifically, collecting large amounts of training data containing unconstrained images annotated with accurate 3D poses is infeasible. We therefore propose to use two independent training sources. The first source consists of accurate 3D motion capture data, and the second source consists of unconstrained images with annotated 2D poses. To integrate both sources, we propose a dual-source approach that combines 2D pose estimation with efficient 3D pose retrieval. To this end, we first convert the motion capture data into a normalized 2D pose space, and separately learn a 2D pose estimation model from the image data. During inference, we estimate the 2D pose and efficiently retrieve the nearest 3D poses. We then jointly estimate a mapping from the 3D pose space to the image and reconstruct the 3D pose. We provide a comprehensive evaluation of the proposed method and experimentally demonstrate the effectiveness of our approach, even when the skeleton structures of the two sources differ substantially.

Accurate and dense wide-baseline stereo matching using SW-POC <=SEP=> This paper proposes an accurate and dense wide-baseline stereo matching method using Scaled Window Phase-Only Correlation (SW-POC). The wide-baseline setting of the stereo camera can improve the accuracy of the 3D reconstruction compared with the short-baseline setting. However, it is difficult to find accurate and dense correspondence from wide-baseline stereo images due to its large perspective distortion. Addressing this problem, we employ the SW-POC, which is a correspondence matching method using 1D POC with the concept of Scale Window Matching (SWM). The use of SW-POC makes it possible to find the accurate and dense correspondence from a wide-baseline stereo image pair with low computational cost. We also apply the proposed method to 3D reconstruction using a moving and uncalibrated consumer digital camera.

Assessment of chronic pain coping strategies <=SEP=> Introduction. We made an adaptation of the Coping Strategies Questionnaire (CSQ) to the Spanish population. This measure, the most used in its scope, was developed by Rosenstiel and Keefe in 1983. Method. 205 participants coming from Primary Health Care and pain clinics made up the sample. More than half suffered migraine and chronic tension-type headache; the rest, fibromyalgia, low back pain, arthrosis or arthritis. Results. Factor analyses explained 59% of the total variance, on an 8-factor structure that converged into a 2-factor structure. In the 8-factor solution the novelty was the diversification of mental-non-mental distraction strategies, and religious-non-religious hope strategies. In the 2-factor solution the novelty was the grouping according to the efficacy of the coping. All the CSQ factors showed inner consistency and construct validity. Thus, unadaptive coping strategies were related to negative, anxious and depressed self-talk, related to lack of control and perceived self-efficacy, and related to many pain behaviors. On the contrary it happened with adaptive coping strategies. In addition, the diagnosis of pain was related to the utilization and effectiveness of coping strategies. Conclussions. CSQ is shown to be a reliable and valid measure of coping strategies in chronic pain in the Spanish population, showing the difference between theoretical and empirical factor structures again.

Heart rate variability is associated with emotion recognition: direct evidence for a relationship between the autonomic nervous system and social cognition. <=SEP=> It is well established that heart rate variability (HRV) plays an important role in social communication. Polyvagal theory suggests that HRV may provide a sensitive marker of one's ability to respond and recognize social cues. The aim of the present study was to directly test this hypothesis. Resting-state HRV was collected and performance on the Reading the Mind in the Eyes Test was assessed in 65 volunteers. HRV was positively associated with performance on this emotion recognition task confirming our hypothesis and these findings were retained after controlling for a variety of confounding variables known to influence HRV - sex, BMI, smoking habits, physical activity levels, depression, anxiety, and stress. Our data suggests that increased HRV may provide a novel marker of one's ability to recognize emotions in humans. Implications for understanding the biological basis of emotion recognition, and social impairment in humans are discussed.

Medusa: a programming framework for crowd-sensing applications <=SEP=> The ubiquity of smartphones and their on-board sensing capabilities motivates crowd-sensing, a capability that harnesses the power of crowds to collect sensor data from a large number of mobile phone users. Unlike previous work on wireless sensing, crowd-sensing poses several novel requirements: support for humans-in-the-loop to trigger sensing actions or review results, the need for incentives, as well as privacy and security. Beyond existing crowd-sourcing systems, crowd-sensing exploits sensing and processing capabilities of mobile devices. In this paper, we design and implement Medusa, a novel programming framework for crowd-sensing that satisfies these requirements. Medusa provides high-level abstractions for specifying the steps required to complete a crowd-sensing task, and employs a distributed runtime system that coordinates the execution of these tasks between smartphones and a cluster on the cloud. We have implemented ten crowd-sensing tasks on a prototype of Medusa. We find that Medusa task descriptions are two orders of magnitude smaller than standalone systems required to implement those crowd-sensing tasks, and the runtime has low overhead and is robust to dynamics and resource attacks.

The Cultural Evolution of Religion <=SEP=> After almost a century of dwelling in two “non-overlapping magisteria,” as Steven Jay Gould once put it, religion and science are coming together again. Long the exclusive province of the humanities and left outside of the mainstream of psychology and the behavioural sciences, religion is gaining scientific attention at a rapid pace. The dismantling of the taboos that have kept religion out of the scientific spotlight will take time (Dennett, 2006). Nevertheless, these are exciting times, and we can now safely say that religion—to paraphrase Chomsky about language—has been upgraded from scientific mystery to scientific puzzle (Boyer, 2001). This growing scientific interest promises to offer a naturalistic account for a deeply affecting aspect of human lives that is widespread in all known cultures in the world.

Probabilistic routing in intermittently connected networks <=SEP=> We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at any time, rendering traditional routing protocols unable to deliver messages between hosts. We propose a probabilistic routing protocol for such networks.

DIAC+: a Professional Diacritics Recovering System <=SEP=> In languages that use diacritical characters, if these special signs are stripped-off from a word, the resulted string of characters may not exist in the language, and therefore its normative form is, in general, easy to recover. However, this is not always the case, as presence or absence of a diacritical sign attached to a base letter of a word which exists in both variants, may change its grammatical properties or even the meaning, making the recovery of the missing diacritics a difficult task, not only for a program but sometimes even for a human reader. We describe and evaluate an accurate knowledge-based system for automatic recovering the missing diacritics in MSOffice documents written in Romanian. For the rare cases when the system is not able to reliably make a decision, it either provides the user a list of words with their recovery suggestions, or probabilistically choose one of the possible changes, but leaves a trace (a highlighted comment) on each word the modification of which was uncertain.

A Performance Comparison of Open-Source Stream Processing Platforms <=SEP=> Distributed stream processing platforms is a new class of real-time monitoring systems that analyze and extracts knowledge from large continuous streams of data. This type of systems is crucial for providing high throughput and low latency required by Big Data or Internet of Things monitoring applications. This paper describes and analyzes three main open-source distributed stream- processing platforms: Storm Flink, and Spark Streaming. We analyze the system architectures and we compare their main features. We carry out two experiments concerning anomaly detection on network traffic to evaluate the throughput efficiency and the resilience to node failures. Results show that the performance of native stream processing systems, Storm and Flink, is up to 15 times higher than the micro-batch processing system, Spark Streaming. On the other hand, Spark Streaming is more robust to node failures and provides recovery without losses.

Challenges during the transition to Agile Methodologies : A Holistic Overview <=SEP=> 

An Introduction to Active Shape Models ∗ <=SEP=> Biomedical images usually contain complex objects, which will vary in appearance significantly from one image to another. Attempting to measure or detect the presence of particular structures in such images can be a daunting task. The inherent variability will thwart naive schemes. However, by using models which can cope with the variability it is possible to successfully analyse complex images. Here we will consider a number of methods where the model represents the expected shape and local grey-level structure of a target object in an image. Model-based methods make use of a prior model of what is expected in the image, and typically attempt to find the best match of the model to the data in a new image. Having matched the model, one can then make measurements or test whether the target is actually present. This approach is a ‘top-down’ strategy, and differs significantly from ‘bottomup’ methods. In the latter the image data is examined at a low level, looking for local structures such as edges or regions, which are assembled into groups in an attempt to identify objects of interest. Without a global model of what to expect, this approach is difficult and prone to failure. A wide variety of model based approaches have been explored (see the review below). This chapter will concentrate on a statistical approach, in which a model is built from analysing the appearance of a set of labelled examples. Where structures vary in shape or texture, it is possible to learn what are plausible variations and what are not. A new image can be interpreted by finding the best plausible match of the model to the image data. The advantages of such a method are that

Gated Recurrent Unit (GRU) for Emotion Classification from Noisy Speech <=SEP=> Despite the enormous interest in emotion classification from speech, the impact of noise on emotion classification is not well understood. This is important because, due to the tremendous advancement of the smartphone technology, it can be a powerful medium for speech emotion recognition in the outside laboratory natural environment, which is likely to incorporate background noise in the speech. We capitalize on the current breakthrough of Recurrent Neural Network (RNN) and seek to investigate its performance for emotion classification from noisy speech. We particularly focus on the recently proposed Gated Recurrent Unit (GRU), which is yet to be explored for emotion recognition from speech. Experiments conducted with speech compounded with eight different types of noises reveal that GRU incurs an 18.16% smaller run-time while performing quite comparably to the Long Short-Term Memory (LSTM), which is the most popular Recurrent Neural Network proposed to date. This result is promising for any embedded platform in general and will initiate further studies to utilize GRU to its full potential for emotion recognition on smartphones.

Class-Conditional Superresolution with GANs <=SEP=> ● Super resolution enhances the resolution of a low-res image. ● Many deep learning models today work fairly well with an upscaling factor of 4x but use only the downscaled image as input. ● We demonstrate two class-conditional GAN models that outperform state-of-the-art GANs for superresolution: ○ Explicitly passes in a known class parameter as input ○ Uses a separately trained classifier to inform a ResNet about character attributes ● Both improve the quality of the super-resolved output.