Query: Hierarchical Text Generation and Planning for Strategic Dialogue

Relevant passages:
Building End-To-End Dialogue Systems Using Generative Hierarchical Neural Network Models <=SEP=> We investigate the task of building open domain, conversational dialogue systems based on large dialogue corpora using generative models. Generative models produce system responses that are autonomously generated word-by-word, opening up the possibility for realistic, flexible interactions. In support of this goal, we extend the recently proposed hierarchical recurrent encoder-decoder neural network to the dialogue domain, and demonstrate that this model is competitive with state-of-the-art neural language models and backoff n-gram models. We investigate the limitations of this and similar approaches, and show how its performance can be improved by bootstrapping the learning from a larger questionanswer pair corpus and from pretrained word embeddings.

The Dialog State Tracking Challenge <=SEP=> In a spoken dialog system, dialog state tracking deduces information about the user’s goal as the dialog progresses, synthesizing evidence such as dialog acts over multiple turns with external data sources. Recent approaches have been shown to overcome ASR and SLU errors in some applications. However, there are currently no common testbeds or evaluation measures for this task, hampering progress. The dialog state tracking challenge seeks to address this by providing a heterogeneous corpus of 15K human-computer dialogs in a standard format, along with a suite of 11 evaluation metrics. The challenge received a total of 27 entries from 9 research groups. The results show that the suite of performance metrics cluster into 4 natural groups. Moreover, the dialog systems that benefit most from dialog state tracking are those with less discriminative speech recognition confidence scores. Finally, generalization is a key problem: in 2 of the 4 test sets, fewer than half of the entries out-performed simple baselines. 1 Overview and motivation Spoken dialog systems interact with users via natural language to help them achieve a goal. As the interaction progresses, the dialog manager maintains a representation of the state of the dialog in a process called dialog state tracking (DST). For example, in a bus schedule information system, the dialog state might indicate the user’s desired bus route, origin, and destination. Dialog state tracking is difficult because automatic speech ∗Most of the work for the challenge was performed when the second and third authors were with Honda Research Institute, Mountain View, CA, USA recognition (ASR) and spoken language understanding (SLU) errors are common, and can cause the system to misunderstand the user’s needs. At the same time, state tracking is crucial because the system relies on the estimated dialog state to choose actions – for example, which bus schedule information to present to the user. Most commercial systems use hand-crafted heuristics for state tracking, selecting the SLU result with the highest confidence score, and discarding alternatives. In contrast, statistical approaches compute scores for many hypotheses for the dialog state (Figure 1). By exploiting correlations between turns and information from external data sources – such as maps, bus timetables, or models of past dialogs – statistical approaches can overcome some SLU errors. Numerous techniques for dialog state tracking have been proposed, including heuristic scores (Higashinaka et al., 2003), Bayesian networks (Paek and Horvitz, 2000; Williams and Young, 2007), kernel density estimators (Ma et al., 2012), and discriminative models (Bohus and Rudnicky, 2006). Techniques have been fielded which scale to realistically sized dialog problems and operate in real time (Young et al., 2010; Thomson and Young, 2010; Williams, 2010; Mehta et al., 2010). In end-to-end dialog systems, dialog state tracking has been shown to improve overall system performance (Young et al., 2010; Thomson and Young, 2010). Despite this progress, direct comparisons between methods have not been possible because past studies use different domains and system components, for speech recognition, spoken language understanding, dialog control, etc. Moreover, there is little agreement on how to evaluate dialog state tracking. Together these issues limit progress in this research area. The Dialog State Tracking Challenge (DSTC) provides a first common testbed and evaluation

Latent Variable Dialogue Models and their Diversity <=SEP=> We present a dialogue generation model that directly captures the variability in possible responses to a given input, which reduces the ‘boring output’ issue of deterministic dialogue models. Experiments show that our model generates more diverse outputs than baseline models, and also generates more consistently acceptable output than sampling from a deterministic encoder-decoder model.

Partially observable Markov decision processes for spoken dialog systems <=SEP=> In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence the state of the conversation can never be known with certainty. Much of the research in spoken dialog systems centres on mitigating this uncertainty and recent work has focussed on three largely disparate techniques: parallel dialog state hypotheses, local use of confidence scores, and automated planning. While in isolation each of these approaches can improve action selection, taken together they currently lack a unified statistical framework that admits global optimization. In this paper we cast a spoken dialog system as a partially observable Markov decision process (POMDP). We show how this formulation unifies and extends existing techniques to form a single principled framework. A number of illustrations are used to show qualitatively the potential benefits of POMDPs compared to existing techniques, and empirical results from dialog simulations are presented which demonstrate significant quantitative gains. Finally, some of the key challenges to advancing this method – in particular scalability – are briefly outlined. 2006 Elsevier Ltd. All rights reserved.

Ask Me Anything: Dynamic Memory Networks for Natural Language Processing <=SEP=> Most tasks in natural language processing can be cast into question answering (QA) problems over language input. We introduce the dynamic memory network (DMN), a unified neural network framework which processes input sequences and questions, forms semantic and episodic memories, and generates relevant answers. Questions trigger an iterative attention process which allows the model to condition its attention on the result of previous iterations. These results are then reasoned over in a hierarchical recurrent sequence model to generate answers. The DMN can be trained end-to-end and obtains state of the art results on several types of tasks and datasets: question answering (Facebook’s bAbI dataset), sequence modeling for part of speech tagging (WSJ-PTB), coreference resolution (Quizbowl dataset) and text classification for sentiment analysis (Stanford Sentiment Treebank). The model relies exclusively on trained word vector representations and requires no string matching or manually engineered features.

Human balance and posture control during standing and walking <=SEP=> The fact that we as humans are bipeds and locomote over the ground with one foot in contact (walking), no feet in contact (running), or both feet in contact (standing) creates a major challenge to our balance control system. Because two-thirds of our body mass is located two-thirds of body height above the ground we are an inherently unstable system unless a control system is continuously acting. The purpose of this review is to introduce the reader to the basic anatomy, mechanics, and neuromuscular control that is seen in the current literature related to balance control. The degeneration of the balance control system in the elderly and in many pathologies has forced researchers and clinicians to understand more about how the system works and how to quantify its status at any point in time. With the increase in our ageing population and with increased life expectancy of our elderly the importance of maintaining mobility is becoming ever more critical. Injuries and loss of life due to falls in the elderly is a very major factor facing them. Table 1 compares the deaths due to falls with the deaths due to motor vehicle accidents (MVA) as a function of age as reported by Statistics Canada in 1991. The startling fact is that the deaths due to falls in the SO+ population is almost as high as the MVA deaths in the accident-prone l5-29-year group. However, when we look at the deaths per 100 000 for these two causes the figures are even more startling. The young 15-29-year-old group had 21.5 MVA deaths per 100 000 while the elderly deaths

ViP-CNN: A Visual Phrase Reasoning Convolutional Neural Network for Visual Relationship Detection <=SEP=> As the intermediate level task connecting image captioning and object detection, visual relationship detection started to catch researchers’ attention because of its descriptive power and clear structure. It localizes the objects and captures their interactions with a subject-predicateobject triplet, e.g. 〈person-ride-horse〉. In this paper, the visual relationship is considered as a phrase with three components. So we formulate the visual relationship detection as three inter-connected recognition problems and propose a Visual Phrase reasoning Convolutional Neural Network (ViP-CNN) to address them simultaneously. In ViP-CNN, we present a Visual Phrase Reasoning Structure (VPRS) to set up the connection among the relationship components and help the model consider the three problems jointly. Corresponding non-maximum suppression method and model training strategy are also proposed. Experimental results show that our ViP-CNN outperforms the stateof-art method both in speed and accuracy. We further pretrain our model on our cleansed Visual Genome Relationship dataset, which is found to perform better than the pretraining on the ImageNet for this task.

Computational Models of Reading: A Primer <=SEP=> This article brief ly reviews four computational models of reading and the types of empirical findings that they are designed to explain: (1) theDual-Route model of word identification (Coltheart et al., 2001); (2) the SimpleRecurrent Network model of sentence processing (Elman, 1990); (3) the Construction–Integration model of discourse representation (Kintsch, 1988); and (4) the E-Z Reader model of eye-movement control in reading (Reichle et al., 2012). These particular models are reviewed because they provide comprehensive accounts of a large number of empirical findings in each of their respective domains, and because they have advanced our understanding of the cognitive processes involved in reading by motivating new empirical studies. Future models of reading will build upon the success of their predecessors by integrating models from two or more of the aforementioned domains, thereby providing a means to examine the compatibility of their theoretical assumptions and more comprehensive accounts of the cognitive processes involved in reading. The perceptual, cognitive, and motor processes that support skilled reading are numerous, extremely complex, and work together in a highly coordinated manner. For those reasons, any deep understanding of what happens in the mind during reading requires the use of computational models that describe those processes and how they jointly determine both the on-line behavior that is observed during reading (e.g., the patterns of eye movements that readers make) and the products of that behavior (e.g., the mental representations that readers generate to understand the text). As will be discussed in this article, such models provide theoretical frameworks for understanding the mental processes involved in reading, but also advance our understanding by generating novel predictions that can be tested with experiments. In the remainder of this article, I will describe four existing models that have already played important roles in furthering our understanding of the psychology of reading. These models were selected for inclusion in this article because they account for a wide range of empirical phenomena within a broad area of reading research, and because they have motivated a large number of new empirical studies. The models were also selected because they collectively span the range of topics that have traditionally been studied by reading researchers: (1) word identification; (2) sentence processing; (3) the representation of discourse; and (4) how these different processes interact with other cognitive processes (e.g., attention) to determine the patterns of eye movements that are observed during reading. Because one goal of this article is to introduce the models in a way that is accessible to a broad audience, I will describe the models using schematic diagrams rather than their equations; for a more formal description of the models, see either the original articles or Reichle’s review of the models. Word-Identification Models Word-identification models describe how the visual features corresponding to a word on a printed page are used to access that word’s pronunciation and meaning, as well as behavioral deficits that result from impairment of these processes due to developmental delay or brain © 2015 The Author Language and Linguistics Compass © 2015 John Wiley & Sons Ltd

Math Anxiety : Personal , Educational , and Cognitive Consequences <=SEP=> Highly math-anxious individuals are characterized by a strong tendency to avoid math, which ultimately undercuts their math competence and forecloses important career paths. But timed, on-line tests reveal math-anxiety effects on w h o l e-n u m b e r a r i t h m e t i c p r o b l e m s (e. g. , 4 6 ϩ 2 7) , whereas achievement tests show no competence differences. Math anxiety disrupts cognitive processing by compromising ongoing activity in working memory. Although the causes of math anxiety are undetermined, some teaching styles are implicated as risk factors. We need research on the origins of math anxiety and on its " signature " in brain activity , to examine both its emo-t i o n a l a n d i t s c o g n i t i v e components. My graduate assistant recently told me about a participant he had tested in the lab. She exhibited increasing discomfort and nervousness as the testing session progressed , eventually becoming so distraught that she burst into tears. My assistant remarked that many of our participants show some un-ease or apprehension during test-ing—trembling hands, nervous laughter, and so forth. Many ask, defensively, if their performance says anything about their overall intelligence. These occasionally extreme emotional reactions are not triggered by deliberately provocative procedures—there are no personally sensitive questions or intentional manipulations of stress. Instead, we merely ask college adults to solve elementary-school arithmetic problems, such as 46 ϩ 18 ϭ ? and 34 Ϫ 19 ϭ ? The reactions are obvious symptoms of anxiety, in this case math anxiety induced by ordinary arithmetic problems presented in timed tasks. On the one hand, it is almost unbelievable that tests on such fundamental topics can be so upsetting ; knowing that 15 Ϫ 8 ϭ 7 ought to be as basic as knowing how to spell " cat. " On the other hand, U.S. culture abounds with attitudes that foster math anxiety: Math is thought to be inherently difficult (as Barbie dolls used to say, " Math class is hard "), aptitude is considered far more important than effort (Geary, 1994, chap. 7), and being good at math is considered relatively unimportant, or even optional. In this article, I discuss what has been learned about math anxiety across the past 30 years or so, and suggest …

Enabling Public Verifiability and Data Dynamics for Storage Security <=SEP=> Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. It moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. This unique paradigm brings about many new security challenges, which have not been well understood. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. In particular, we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of client through the auditing of whether his data stored in the cloud is indeed intact, which can be important in achieving economies of scale for Cloud Computing. The support for data dynamics via the most general forms of data operation, such as block modification, insertion and deletion, is also a significant step toward practicality, since services in Cloud Computing are not limited to archive or backup data only. While prior works on ensuring remote data integrity often lacks the support of either public verifiability or dynamic data operations, this paper achieves both. We first identify the difficulties and potential security problems of direct extensions with fully dynamic data updates from prior works and then show how to construct an elegant verification scheme for seamless integration of these two salient features in our protocol design. In particular, to achieve efficient data dynamics, we improve the Proof of Retrievability model [1] by manipulating the classic Merkle Hash Tree (MHT) construction for block tag authentication. Extensive security and performance analysis show that the proposed scheme is highly efficient and provably secure.

The Effect of Noise on Sofware Engineers' Performance <=SEP=> Background: Noise, dened as an unwanted sound, is one of the commonest factors that could aect people’s performance in their daily work activities. e soware engineering research community has marginally investigated the eects of noise on soware engineers’ performance. Aims: We studied if noise aects soware engineers’ performance in: (i) comprehending functional requirements and (ii) xing faults in source code. Method: We conducted two experiments with nal-year undergraduate students in Computer Science. In the rst experiment, we asked 55 students to comprehend functional requirements exposing them or not to noise, while in the second experiment 42 students were asked to x faults in Java code. Results: e participants in the second experiment, when exposed to noise, had signicantly worse performance in xing faults in source code. On the other hand, we did not observe any statistically signicant dierence in the rst experiment. Conclusions: Fixing faults in source code seems to be more vulnerable to noise than comprehending functional requirements.

Transcranial Direct Current Stimulation Modulates Neuronal Activity and Learning in Pilot Training <=SEP=> Skill acquisition requires distributed learning both within (online) and across (offline) days to consolidate experiences into newly learned abilities. In particular, piloting an aircraft requires skills developed from extensive training and practice. Here, we tested the hypothesis that transcranial direct current stimulation (tDCS) can modulate neuronal function to improve skill learning and performance during flight simulator training of aircraft landing procedures. Thirty-two right-handed participants consented to participate in four consecutive daily sessions of flight simulation training and received sham or anodal high-definition-tDCS to the right dorsolateral prefrontal cortex (DLPFC) or left motor cortex (M1) in a randomized, double-blind experiment. Continuous electroencephalography (EEG) and functional near infrared spectroscopy (fNIRS) were collected during flight simulation, n-back working memory, and resting-state assessments. tDCS of the right DLPFC increased midline-frontal theta-band activity in flight and n-back working memory training, confirming tDCS-related modulation of brain processes involved in executive function. This modulation corresponded to a significantly different online and offline learning rates for working memory accuracy and decreased inter-subject behavioral variability in flight and n-back tasks in the DLPFC stimulation group. Additionally, tDCS of left M1 increased parietal alpha power during flight tasks and tDCS to the right DLPFC increased midline frontal theta-band power during n-back and flight tasks. These results demonstrate a modulation of group variance in skill acquisition through an increasing in learned skill consistency in cognitive and real-world tasks with tDCS. Further, tDCS performance improvements corresponded to changes in electrophysiological and blood-oxygenation activity of the DLPFC and motor cortices, providing a stronger link between modulated neuronal function and behavior.

How to gamify software engineering <=SEP=> Software development, like any prolonged and intellectually demanding activity, can negatively affect the motivation of developers. This is especially true in specific areas of software engineering, such as requirements engineering, test-driven development, bug reporting and fixing, where the creative aspects of programming fall short. The developers' engagement might progressively degrade, potentially impacting their work's quality.

A multi-method simulation of a high-frequency bus line <=SEP=> A methodology to model high-frequency bus lines is proposed and a realistic event-simulation model for such a line in the Netherlands is presented. This simulation model helps policy makers to predict changes that have to be made to bus routes and planned travel times before problems occur. With this model, different passenger growth scenarios can be easily evaluated. The model is validated using different key performance indicators, showing that under some model assumptions, it can realistically simulate real-life scenarios. The simulations workings are illustrated by a case study of passenger growth.

The role of mindfulness in a contextual cognitive-behavioral analysis of chronic pain-related suffering and disability <=SEP=> An increasing number of studies consider the specific processes by which distressing sensations, thoughts, and emotional experiences exert their influence on the daily functioning of those who suffer with chronic pain. Clinical methods of mindfulness and the processes that underlie them appear to have clear implications in this area, but have not been systematically investigated to this point in time. The purpose of the present study was to examine mindfulness in relation to the pain, emotional, physical, and social functioning of individuals with chronic pain. The present study included 105 consecutive patients attending a clinical assessment for treatment of chronic pain. Each completed a standardized battery of questionnaires, including a measure of mindfulness, the Mindful Attention Awareness Scale [Brown KW, Ryan RM. The benefits of being present: mindfulness and its role in psychological well-being. J Pers Soc Psychol 2003;84:822-48]. Correlation analyses indicated that mindfulness was unrelated to age, gender, education, or chronicity of pain, but was significantly related to multiple measures of patient functioning. In multiple regression analyses, after controlling for patient background variables, pain intensity, and pain-related acceptance, mindfulness accounted for significant variance in measures of depression, pain-related anxiety; physical, psychosocial, and "other" disability. In each instance greater mindfulness was associated with better functioning. The combined increments of variance explained from acceptance of pain and mindfulness were at least moderate and, in some cases, appeared potentially meaningful. The behavioral processes of mindfulness and their accessibility to scientific study are considered.

Integrative Neuromuscular Training in Youth Athletes. Part II <=SEP=> THE SECOND PART OF THIS REVIEW PROVIDES A FLEXIBLE APPROACH TO INTEGRATIVE NEUROMUSCULAR TRAINING (INT) WITH THE GOALS TO IMPROVE INJURY RESILIENCE AND TO ENHANCE SPORT AND MOTOR PERFORMANCE ABILITIES IN YOUTH POPULATIONS. THE PROPOSED MODEL OF INT IN THIS MANUSCRIPT PRESENTS 6 ESSENTIAL COMPONENTS: DYNAMIC STABILITY (LOWER LIMB AND CORE), STRENGTH, PLYOMETRICS, COORDINATION, SPEED AND AGILITY, AND FATIGUE RESISTANCE. THE DEVELOPMENT OF THESE 6 CAPACITIES ARE INTEGRAL IN ESTABLISHING AN IMPORTANT FOUNDATION BY INITIALLY DEVELOPING FUNDAMENTAL MOVEMENT SKILL COMPETENCY BEFORE BUILDING UPON THESE SKILLS TO ENRICH SPORTS-SPECIFIC AND ACTIVITY-SPECIFIC SKILL SETS. FOR A VIDEO ABSTRACT OF THIS ARTICLE, SEE SUPPLEMENTAL DIGITAL CONTENT 1 (SEE VIDEO, http://links.lww.com/SCJ/A190).

Coping theory and research: past, present, and future. <=SEP=> In this essay in honor of Donald Oken, I emphasize coping as a key concept for theory and research on adaptation and health. My focus will be the contrasts between two approaches to coping, one that emphasizes style—that is, it treats coping as a personality characteristic—and another that emphasizes process—that is, efforts to manage stress that change over time and are shaped by the adaptational context out of which it is generated. I begin with an account of the style and process approaches, discuss their history briefly, set forth the principles of a process approach, describe my own efforts at measurement, and define coping and its functions from a process standpoint. This is followed by a digest of major generalizations that resulted from coping process research. The essay concludes with a discussion of special issues of coping measurement, in particular, the limitations of both coping style and process approaches and how these limitations might be dealt with. There has been a prodigious volume of coping research in the last decade or two, which I can only touch on very selectively. In this essay, I also ignore a host of important developmental issues that have to do with the emergence of coping and its cognitive and motivational bases in infants, as well as a growing literature on whether, how, and why the coping process changes with aging.

Sentiment-specific word embedding for Indonesian sentiment analysis <=SEP=> Word embedding has been proven to improve performance of sentiment classification systems. A new proposed word embedding called sentiment-specific word embedding exploits sentiment information, in order to reach better performance of sentiment analysis systems using word embedding. In this paper, we build Indonesian sentiment-specific word embedding and apply it for sentiment analysis. We compare performance of sentiment classification based on sentiment-specific word embedding with other popular feature representations such as bag of words, Term Frequency-Inverse Document Frequency (TF-IDF), and also generic word embedding. Although our sentiment-specific word embedding models achieve a higher score than the Word2Vec embedding, the lexical representations, bag of words and TF-IDF still gained better performance.

The Airport Ground Movement Problem : Past and Current Research and Future Directions <=SEP=> Determining efficient airport operations is an important and critical problem for airports, airlines, passengers and other stakeholders. Moreover, it is likely to become even more so given the traffic increases which are expected over the next few years. The ground movement problem forms the link between other airside problems, such as arrival sequencing, departure sequencing and gate/stand allocation. This paper provides an overview, categorisation and critical examination of the previous research for ground movement and highlights various important open areas of research. Of particular importance is the question of the integration of various airport operations and their relationships which are considered in this paper.

An Organization Ontology for Enterprise Modelling <=SEP=> The paper presents our exploration into an organization ontology for the TOVE enterprise model. Its primary focus has been in linking structure and behavior through the concept of empowerment. Empowerment is the right of an organization agent to perform status changing actions. This linkage is critical to the unification of enterprise models and their executability.

VL2: a scalable and flexible data center network <=SEP=> To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL2, a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer-2 semantics. VL2 uses (1) flat addressing to allow service instances to be placed anywhere in the network, (2) Valiant Load Balancing to spread traffic uniformly across network paths, and (3) end-system based address resolution to scale to large server pools, without introducing complexity to the network control plane. VL2's design is driven by detailed measurements of traffic and fault data from a large operational cloud service provider. VL2's implementation leverages proven network technologies, already available at low cost in high-speed hardware implementations, to build a scalable and reliable network architecture. As a result, VL2 networks can be deployed today, and we have built a working prototype. We evaluate the merits of the VL2 design using measurement, analysis, and experiments. Our VL2 prototype shuffles 2.7 TB of data among 75 servers in 395 seconds - sustaining a rate that is 94% of the maximum possible.

Friendlink: Link prediction in social networks via bounded local path traversal <=SEP=> Online social networks (OSNs) like Facebook, Myspace, and Hi5 have become popular, because they allow users to easily share content or expand their social circle. OSNs recommend new friends to registered users based on local graph features (i.e. based on the number of common friends that two users share). However, OSNs do not exploit all different length paths of the network. Instead, they consider only pathways of maximum length 2 between a user and his candidate friends. On the other hand, there are global approaches, which detect the overall path structure in a network, being computationally prohibitive for huge-size social networks. In this paper, we provide friend recommendations, also known as the link prediction problem, by traversing all paths of a bounded length, based on the “algorithmic small world hypothesis”. As a result, we are able to provide more accurate and faster friend recommendations. We perform an extensive experimental comparison of the proposed method against existing link prediction algorithms, using two real data sets (Hi5 and Epinions). Our experimental results show that our FriendLink algorithm outperforms other approaches in terms of effectiveness and efficiency in both real data sets.

Planning-based prediction for pedestrians <=SEP=> We present a novel approach for determining robot movements that efficiently accomplish the robot's tasks while not hindering the movements of people within the environment. Our approach models the goal-directed trajectories of pedestrians using maximum entropy inverse optimal control. The advantage of this modeling approach is the generality of its learned cost function to changes in the environment and to entirely different environments. We employ the predictions of this model of pedestrian trajectories in a novel incremental planner and quantitatively show the improvement in hindrance-sensitive robot trajectory planning provided by our approach.

Fast local search and guided local search and their application to British Telecom's workforce scheduling problem <=SEP=> This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real life problem. The effectiveness of FLS and GLS are demonstrated by the fact that they both out-perform all the methods applied to this problem so far, which include simulated annealing, genetic algorithms and constraint logic programming.

A Partial Derandomization of PhaseLift using Spherical Designs <=SEP=> The problem of retrieving phase information from amplitude measurements alone has appeared in many scientific disciplines over the last century. PhaseLift is a recently introduced algorithm for phase recovery that is computationally efficient, numerically stable, and comes with rigorous performance guarantees. PhaseLift is optimal in the sense that the number of amplitude measurements required for phase reconstruction scales linearly with the dimension of the signal. However, it specifically demands Gaussian random measurement vectors — a limitation that restricts practical utility and obscures the specific properties of measurement ensembles that enable phase retrieval. Here we present a partial derandomization of PhaseLift that only requires sampling from certain polynomial size vector configurations, called t-designs. Such configurations have been studied in algebraic combinatorics, coding theory, and quantum information. We prove reconstruction guarantees for a number of measurements that depends on the degree t of the design. If the degree is allowed to to grow logarithmically with the dimension, the bounds become tight up to polylog-factors. Beyond the specific case of PhaseLift, this work highlights the utility of spherical designs for the derandomization of data recovery schemes.

Implementation and Optimization of the Accelerator Based on FPGA Hardware for LSTM Network <=SEP=> Today, artificial neural networks (ANNs) are important machine learning methods which are widely used in a variety of applications. As the emerging field of ANNs, recurrent neural networks (RNNs) are often used for sequencerelated applications. And Long Short-Term Memory (LSTM) is an improved RNN which contains complex computational logic. To achieve high accuracy, researchers always build largescale LSTM networks which are time-consuming and powerconsuming. Thus the acceleration of LSTM networks, low power & energy consumption become the hot issues in today's research. In this paper, we present a hardware accelerator for the LSTM neural network layer based on FPGA Zedboard and use pipeline methods to parallelize the forward computing process. To optimize our implementation, we also use multiple methods including tiled matrix-vector multiplication, binary adder tree, and overlap of computation and data access. Through the acceleration and optimization methods, our accelerator is power-efficient and has a better performance than ARM Cortex A9 processor and Intel Core i5 processor.

Demonstration of MOS capacitor measurement for wafer manufacturing using a Direct Charge Measurement <=SEP=> Direct Charge Measurement (DCM) has a capability to improve the capacitance measurement time in parametric test. Through an actual wafer measurement, we have successfully verified that DCM can measure MOS capacitor much faster than an LCR meter while keeping good correlations for wafer manufacturing.

NB-IoT and LoRA connectivity analysis for M2M/IoT smart grids applications <=SEP=> The evolution of the new M2M/IoT paradigm suggests new applications in several fields. However, the unique characteristics of M2M communications pose different challenges in terms of connectivity and capacity with respect to the conventional telecommunications networks. In particular, the harmful locations where IoT devices could be deployed and the massive number of the devices to be connected require a different approach with respect the traditional wireless communication. In this paper, we analyzed two different technologies expressly devoted the M2M communication: the Long Term Evolution (LTE) based solution, NB-IoT (Narrow Band — Internet of Things), and the LPWAN (Low Power Wide Area Network) based solution, LoRa (Low Range). The analysis has been provided taking into account different propagation scenarios and geographical information of the real MNOs (Mobile Network Operators) sites operating in the territory under test. The aim of this work is to check wireless access method of both cellular and proprietary technologies for the novel IoT Smart Grid applications requirements.

A Survey of Context-Aware Mobile Computing Research <=SEP=> Context-aware computing is a mobile computing paradigm in which applications can discover and take advantage of contextual information (such as user location, time of day, nearby people and devices, and user activity). Since it was proposed about a decade ago, many researchers have studied this topic and built several context-aware applications to demonstrate the usefulness of this new technology. Context-aware applications (or the system infrastructure to support them), however, have never been widely available to everyday users. In this survey of research on context-aware systems and applications, we looked in depth at the types of context used and models of context information, at systems that support collecting and disseminating context, and at applications that adapt to the changing context. Through this survey, it is clear that context-aware research is an old but rich area for research. The difficulties and possible solutions we outline serve as guidance for researchers hoping to make context-aware computing a reality.

Convolutional Neural Networks for Real-Time Beat Tracking: A Dancing Robot Application <=SEP=> In this paper a novel approach that adopts Convolutional Neural Networks (CNN) for the Beat Tracking task is proposed. The proposed architecture involves 2 convolutional layers with the CNN filter dimensions corresponding to time and band frequencies, in order to learn a Beat Activation Function (BAF) from a time-frequency representation. The output of each convolutional layer is computed only over the past values of the previous layer, to enable the computation of the BAF in an online fashion. The output of the CNN is post-processed by a dynamic programming algorithm in combination with a bank of resonators for calculating the salient rhythmic periodicities. The proposed method has been designed to be computational efficient in order to be embedded on a dancing NAO robot application, where the dance moves of the choreography are synchronized with the beat tracking output. The proposed system was submitted to the Signal Processing Cup Challenge 2017 and ranked among the top third algorithms.