How to Train Your Browser: Preventing XSS Attacks Using Contextual Script Fingerprints. Cross-Site Scripting (XSS) is one of the most common web application vulnerabilities. It is therefore sometimes referred to as the "buffer overflow of the web." Drawing a parallel from the current state of practice in preventing unauthorized native code execution (the typical goal in a code injection), we propose a script whitelisting approach to tame JavaScript-driven XSS attacks. Our scheme involves a transparent script interception layer placed in the browser's JavaScript engine. This layer is designed to detect every script that reaches the browser, from every possible route, and compare it to a list of valid scripts for the site or page being accessed; scripts not on the list are prevented from executing. To avoid the false positives caused by minor syntactic changes (e.g., due to dynamic code generation), our layer uses the concept of contextual fingerprints when comparing scripts.  Contextual fingerprints are identifiers that represent specific elements of a script and its execution context. Fingerprints can be easily enriched with new elements, if needed, to enhance the proposed method's robustness. The list can be populated by the website's administrators or a trusted third party. To verify our approach, we have developed a prototype and tested it successfully against an extensive array of attacks that were performed on more than 50 real-world vulnerable web applications. We measured the browsing performance overhead of the proposed solution on eight websites that make heavy use of JavaScript. Our mechanism imposed an average overhead of 11.1% on the execution time of the JavaScript engine. When measured as part of a full browsing session, and for all tested websites, the overhead introduced by our layer was less than 0.05%. When script elements are altered or new scripts are added on the server side, a new fingerprint generation phase is required. To examine the tempora

Question: How to train your browser to prevent xss attacks?


DeepHTTP: Semantics-Structure Model with Attention for Anomalous HTTP Traffic Detection and Pattern Mining. In the Internet age, cyber-attacks occur frequently with complex types. Traffic generated by access activities can record website status and user request information, which brings a great opportunity for network attack detection. Among diverse network protocols, Hypertext Transfer Protocol (HTTP) is widely used in government, organizations and enterprises. In this work, we propose DeepHTTP, a semantics structure integration model utilizing Bidirectional Long Short-TermMemory (Bi-LSTM) with attention mechanism to model HTTP traffic as a natural language sequence. In addition to extracting traffic content information, we integrate structural information to enhance the generalization capabilities of the model. Moreover, the application of attention mechanism can assist in discovering critical parts of anomalous traffic and furthermining attack patterns. Additionally, we demonstrate how to incrementally update the data set and retrain model so that it can be adapted to new anomalous traffic. Extensive experimental evaluations over large traffic data have illustrated that DeepHTTP has outstanding performance in traffic detection and pattern discovery.

Question: What is the difference between a semantics structure and a natural language sequence?


Learning user-specific parameters in a multibiometric system. Biometric systems that use a single biometric trait have to contend with noisy data, restricted degrees of freedom, failureto-enroll problems, spoof attacks, and unacceptable error rates. Multibiometric systems that use multiple traits of an individual for authentication, alleviate some of these problems while improving verification performance. We demonstrate that the performance of multibiometric systems can be further improved by learning user-specific parameters. Two types of parameters are considered here. (i) Thresholds that are used to decide if a matching score indicates a genuine user or an impostor, and (ii) weights that are used to indicate the importance of matching scores output by each biometric trait. User-specific thresholds are computed using the cumulative histogram of impostor matching scores corresponding to each user. The user-specific weights associated with each biometric are estimated by searching for that set of weights which minimizes the total verification error. The tests were conducted on a database of 50 users who provided fingerprint, face and hand geometry data, with 10 of these users providing data over a period of two months. We observed that user-specific thresholds improved system performance by ∼ 2%, while user-specific weights improved performance by ∼ 3%.

Question: How to learn user-specific parameters in a multibiometric system?


Annual research review: re-thinking the classification of autism spectrum disorders.. BACKGROUND The nosology of autism spectrum disorders (ASD) is at a critical point in history as the field seeks to better define dimensions of social-communication deficits and restricted/repetitive behaviors on an individual level for both clinical and neurobiological purposes. These different dimensions also suggest an increasing need for quantitative measures that accurately map their differences, independent of developmental factors such as age, language level and IQ.   METHOD Psychometric measures, clinical observation as well as genetic, neurobiological and physiological research from toddlers, children and adults with ASD are reviewed.   RESULTS The question of how to conceptualize ASDs along dimensions versus categories is discussed within the nosology of autism and the proposed changes to the DSM-5 and ICD-11. Differences across development are incorporated into the new classification frameworks.   CONCLUSIONS It is crucial to balance the needs of clinical practice in ASD diagnostic systems, with neurobiologically based theories that address the associations between social-communication and restricted/repetitive dimensions in individuals. Clarifying terminology, improving description of the core features of ASD and other dimensions that interact with them and providing more valid and reliable ways to quantify them, both for research and clinical purposes, will move forward both practice and science.

Question: What is the difference between autism spectrum disorders and autism?


Mining geographic-temporal-semantic patterns in trajectories for location prediction. In recent years, research on location predictions by mining trajectories of users has attracted a lot of attention. Existing studies on this topic mostly treat such predictions as just a type of location recommendation, that is, they predict the next location of a user using location recommenders. However, an user usually visits somewhere for reasons other than interestingness. In this article, we propose a novel mining-based location prediction approach called Geographic-Temporal-Semantic-based Location Prediction (GTS-LP), which takes into account a user's geographic-triggered intentions, temporal-triggered intentions, and semantic-triggered intentions, to estimate the probability of the user in visiting a location. The core idea underlying our proposal is the discovery of trajectory patterns of users, namely GTS patterns, to capture frequent movements triggered by the three kinds of intentions. To achieve this goal, we define a new trajectory pattern to capture the key properties of the behaviors that are motivated by the three kinds of intentions from trajectories of users. In our GTS-LP approach, we propose a series of novel matching strategies to calculate the similarity between the current movement of a user and discovered GTS patterns based on various moving intentions. On the basis of similitude, we make an online prediction as to the location the user intends to visit. To the best of our knowledge, this is the first work on location prediction based on trajectory pattern mining that explores the geographic, temporal, and semantic properties simultaneously. By means of a comprehensive evaluation using various real trajectory datasets, we show that our proposed GTS-LP approach delivers excellent performance and significantly outperforms existing state-of-the-art location prediction methods.

Question: What is the first large-scale Canadian peacekeeping mission?


Asirra: a CAPTCHA that exploits interest-aligned manual image categorization. The typical CAPTCHA GUI consists of two parts: a character image with noise, and an and J. Saul, "Asirra: a CAPTCHA that exploits interest-aligned manual image categorization," in 14th ACM conference on Computer and Communications. CAPTCHAs (short for "Completely Automated Public Turing test to tell Asirra: A CAPTCHA that Exploits Interest-Aligned Manual Image Categorization. (30)J. Elson, J. R. Douceur, J. Howell, and J. Saul, "Asirra: A CAPTCHA that exploits interest-aligned manual image categorization," in Proc. ACM CCS, 2007, pp.

Question: What is the name of the CAPTCHA?


GISMO: a Graphical Interactive Student Monitoring Tool for Course Management Systems. This paper presents GISMO, a graphical interactive student monitoring and tracking system tool that extracts tracking data from an on-line course maintained with a Course Management System, and generates graphical representations that can be explored by course instructors to examine various aspects of distance students. GISMO uses techniques from Information Visualisation to render into an appropriate graphical manner the complex multidimensional student tracking data provided by the Course Management System. GISMO aims to help instructors to become aware of what is happening in their classes and provide a better support to their learners.

Question: What is a course management system?


Generic and Scalable Framework for Automated Time-series Anomaly Detection. This paper introduces a generic and scalable framework for automated anomaly detection on large scale time-series data. Early detection of anomalies plays a key role in maintaining consistency of person's data and protects corporations against malicious attackers. Current state of the art anomaly detection approaches suffer from scalability, use-case restrictions, difficulty of use and a large number of false positives. Our system at Yahoo, EGADS, uses a collection of anomaly detection and forecasting models with an anomaly filtering layer for accurate and scalable anomaly detection on time-series. We compare our approach against other anomaly detection systems on real and synthetic data with varying time-series characteristics. We found that our framework allows for 50-60% improvement in precision and recall for a variety of use-cases. Both the data and the framework are being open-sourced. The open-sourcing of the data, in particular, represents the first of its kind effort to establish the standard benchmark for anomaly detection.

Question: What is the name of the framework?


Predictors of Computer Use in Community-Dwelling, Ethnically Diverse Older Adults. OBJECTIVE In this study, we analyzed self-reported computer use, demographic variables, psychosocial variables, and health and well-being variables collected from 460 ethnically diverse, community-dwelling elders to investigate the relationship computer use has with demographics, well-being, and other key psychosocial variables in older adults.   BACKGROUND Although younger elders with more education, those who employ active coping strategies, or those who are low in anxiety levels are thought to use computers at higher rates than do others, previous research has produced mixed or inconclusive results regarding ethnic, gender, and psychological factors or has concentrated on computer-specific psychological factors only (e.g., computer anxiety). Few such studies have employed large sample sizes or have focused on ethnically diverse populations of community-dwelling elders.   METHOD With a large number of overlapping predictors, zero-order analysis alone is poorly equipped to identify variables that are independently associated with computer use. Accordingly, both zero-order and stepwise logistic regression analyses were conducted to determine the correlates of two types of computer use: e-mail and general computer use.   RESULTS Results indicate that younger age, greater level of education, non-Hispanic ethnicity, behaviorally active coping style, general physical health, and role-related emotional health each independently predicted computer usage.   CONCLUSION Study findings highlight differences in computer usage, especially in regard to Hispanic ethnicity and specific health and well-being factors.   APPLICATION Potential applications of this research include future intervention studies, individualized computer-based activity programming, or customizable software and user interface design for older adults responsive to a variety of personal characteristics and capabilities.

Question: What are the predictors of computer use in older adults?


SUIT: A Supervised User-Item Based Topic Model for Sentiment Analysis. Probabilistic topic models have been widely used for sentiment analysis. However, most of existing topic methods only model the sentiment text, but do not consider the user, who expresses the sentiment, and the item, which the sentiment is expressed on. Since different users may use different sentiment expressions for different items, we argue that it is better to incorporate the user and item information into the topic model for sentiment analysis. In this paper, we propose a new Supervised User-Item based Topic model, called SUIT model, for sentiment analysis. It can simultaneously utilize the textual topic and latent user-item factors. Our proposed method uses the tensor outer product of text topic proportion vector, user latent factor and item latent factor to model the sentiment label generalization. Extensive experiments are conducted on two datasets: review dataset and microblog dataset. The results demonstrate the advantages of our model. It shows significant improvement compared with supervised topic models and collaborative filtering methods.

Question: What is the difference between a supervised topic model and a supervised user-item based topic model?


Evaluating the influence of YouTube advertising for attraction of young customers. Nowadays, we have been faced with an increasing number of people who are spending tremendous amounts of time all around the world on YouTube. To date, the factors that persuade customers to accept YouTube advertising as an advertising medium are not yet fully understood. The present paper identified four dimensions towards YouTube advertising (i.e., entertainment, Informativeness, Customization and irritation) which may be affected on advertising value as well as brand awareness, and accordingly on purchase intention of consumers. The conceptual model hypothesizes that ad value strategies are positively associated with brand awareness, which in turn influence perceived usefulness of You Tube and continued purchase behavior. For this study, data were collected from students studying at the Sapienza University of Rome. In total, 315 usable questionnaires were chosen in order to analysis of data for the variables. The results show that entertainment, informativeness and customization are the strongest positive drivers, while irritation is negatively related to YouTube advertising. On the other hand, advertising value through YouTube affects both brand awareness and purchase intention of con-

Question: How to evaluate the influence of YouTube advertising for attraction of young customers?


GPTIPS 2: an open-source software platform for symbolic data mining. GPTIPS is a free, open source MATLAB based software platform for symbolic data mining (SDM). It uses a 'multigene' variant of the biologically inspired machine learning method of genetic programming (MGGP) as the engine that drives the automatic model discovery process. Symbolic data mining is the process of extracting hidden, meaningful relationships from data in the form of symbolic equations. In contrast to other data-mining methods, the structural transparency of the generated predictive equations can give new insights into the physical systems or processes that generated the data. Furthermore – this transparency makes the models very easy to deploy outside of MATLAB. The rationale behind GPTIPS is to reduce the technical barriers to using, understanding, visualising and deploying GP based symbolic models of data, whilst at the same time remaining highly customisable and delivering robust numerical performance for 'power users'. In this chapter, notable new features of the latest version of the software GPTIPS 2 are discussed with these aims in mind. Additionally, a simplified variant of the MGGP high level gene crossover mechanism is proposed. It is demonstrated that the new functionality of GPTIPS 2 (a) facilitates the discovery of compact symbolic relationships from data using multiple approaches, e.g. using novel 'gene-centric' visualisation analysis to mitigate horizontal bloat and reduce complexity in multigene symbolic regression models (b) provides numerous methods for visualising the properties of symbolic models (c) emphasises the generation of graphically navigable 'libraries' of models that are optimal in terms of the Pareto trade off surface of model performance and complexity and (d) expedites 'real world' applications by the simple, rapid and robust deployment of symbolic models outside the software environment they were developed in.

Question: What is the difference between a symbolic model and a numerical model?


Question: What is the relative advantage of diffusion of innovation theory?


TensorLog: Deep Learning Meets Probabilistic DBs. We present an implementation of a probabilistic first-order logic called TensorLog, in which classes of logical queries are compiled into differentiable functions in a neuralnetwork infrastructure such as Tensorflow or Theano. This leads to a close integration of probabilistic logical reasoning with deep-learning infrastructure: in particular, it enables high-performance deep learning frameworks to be used for tuning the parameters of a probabilistic logic. Experimental results show that TensorLog scales to problems involving hundreds of thousands of knowledge-base triples and tens of thousands of examples.

Question: What is a probabilistic first-order logic?


Robust Cell Detection and Segmentation in Histopathological Images Using Sparse Reconstruction and Stacked Denoising Autoencoders. Computer-aided diagnosis (CAD) is a promising tool for accurate and consistent diagnosis and prognosis. Cell detection and segmentation are essential steps for CAD. These tasks are challenging due to variations in cell shapes, touching cells, and cluttered background. In this paper, we present a cell detection and segmentation algorithm using the sparse reconstruction with trivial templates and a stacked denoising autoencoder (sDAE). The sparse reconstruction handles the shape variations by representing a testing patch as a linear combination of shapes in the learned dictionary. Trivial templates are used to model the touching parts. The sDAE, trained with the original data and their structured labels, is used for cell segmentation. To the best of our knowledge, this is the first study to apply sparse reconstruction and sDAE with structured labels for cell detection and segmentation. The proposed method is extensively tested on two data sets containing more than 3000 cells obtained from brain tumor and lung cancer images. Our algorithm achieves the best performance compared with other state of the arts.

Question: What is the first large-scale Canadian peacekeeping mission?


Front-End Factor Analysis for Speaker Verification. This paper presents an extension of our previous work which proposes a new speaker representation for speaker verification. In this modeling, a new low-dimensional speaker- and channel-dependent space is defined using a simple factor analysis. This space is named the total variability space because it models both speaker and channel variabilities. Two speaker verification systems are proposed which use this new representation. The first system is a support vector machine-based system that uses the cosine kernel to estimate the similarity between the input data. The second system directly uses the cosine similarity as the final decision score. We tested three channel compensation techniques in the total variability space, which are within-class covariance normalization (WCCN), linear discriminate analysis (LDA), and nuisance attribute projection (NAP). We found that the best results are obtained when LDA is followed by WCCN. We achieved an equal error rate (EER) of 1.12% and MinDCF of 0.0094 using the cosine distance scoring on the male English trials of the core condition of the NIST 2008 Speaker Recognition Evaluation dataset. We also obtained 4% absolute EER improvement for both-gender trials on the 10 s-10 s condition compared to the classical joint factor analysis scoring.

Question: What is the speaker verification system?


Linked data on the web (LDOW2008). The Web is increasingly understood as a global information space consisting not just of linked documents, but also of Linked Data. More than just a vision, the resulting Web of Data has been brought into being by the maturing of the Semantic Web technology stack, and by the publication of an increasing number of datasets according to the principles of Linked Data.  The Linked Data on the Web (LDOW2008) workshop brings together researchers and practitioners working on all aspects of Linked Data. The workshop provides a forum to present the state of the art in the field and to discuss ongoing and future research challenges. In this workshop summary we will outline the technical context in which Linked Data is situated, describe developments in the past year through initiatives such as the Linking Open Data community project, and look ahead to the workshop itself.

Question: What is the Linked Data on the Web (LDOW2008) workshop?


Procedural Embedding of knowledge in Planner. Since the l a s t I JCAI , the PLANNER problem s o l v i n g fo rma l i sm has con t i nued to deve lop . Our ep ls temo lgy f o r the f ounda t i ons f o r problem s o l v i n g has been ex tended . An overv iew of the f o rma l i sm Is g iven from an I n f o r m a t i o n p rocess ing v i e w p o i n t . A s imp le example Is e x p l a i n e d us ing snapshots of the s t a t e of the problem s o l v i n g as the example I s worked, f i n a l l y , c u r r e n t a p p l i c a t i o n s f o r the fo rma l i sm are I i s ted . 1 . The S t r u c t u r a l Foundat ions o f Problem S o l v i n g We would l i k e to develop a f o u n d a t i o n f o r problem s o l v i n g analogous In some ways to the c u r r e n t l y e x i s t i n g f ounda t i ons f o r mathemat ics . Thus we need to analyze the s t r u c t u r e of f o u n d a t i o n s f o r mathemat ics . A f o u n d a t i o n f o r mathematics must p rov ide a d e f i n i t i o n a l f o rma l i sm In which mathemat ica l o b j e c t s can be d e f i n e d and t h e i r e x i s t e n c e p roved . For example set t heo ry as a f o u n d a t i o n p rov ides t h a t o b j e c t s must be b u i l t out o f s e t s . Then the re must be a deduc t i ve f o r m a l i s m In which fundamental t r u t h s can be s t a t e d and the means p rov ided to deduce a d d i t i o n a l t r u t h s f rom those a l r e a d y e s t a b l i s h e d . Cur rent mathemat ica l f ounda t i ons such as set theo ry seem q u i t e n a t u r a l and adequate f o r the vas t body o f c l a s s i c a l mathemat ics . The o b j e c t s and reason ing of most mathemat ica l domains such as a n a l y s i s and a lgebra can be e a s i l y founded on set t h e o r y . The e x i s t e n c e o f c e r t a i n a s t r o n o m i c a l l y l a r g e c a r d i n a l s poses some problems f o r set t h e o r e t i c f o u n d a t i o n s . However, the problems posed seem to be of p r a c t i c a l Importanc

Question: What is the difference between a f o u n d a t i o n and a f o u n d a t i o n f o r mathematics?


Reinforcement Learning: A Review from a Machine Learning Perspective. Machine Learning is the study of methods for programming computers to learn. Reinforcement Learning is a type of Machine Learning and refers to learning problem which allows machines and software agents to automatically determine the ideal behaviour within a specific context, in order to maximize its performance. RL is inspired by behaviourist psychology based on the mechanism of learning from rewards and does not require prior knowledge and automatically get optimal policy with the help of knowledge obtained by trial-and-error and continuous interaction with the dynamic environment. This paper provides the overview of Reinforcement Learning from Machine learning perspective. It discusses the fundamental principles and techniques used to solve RL problems. It presents nature of RL problems, with focus on some influential model free RL algorithms, challenges and recent trends in theory and practice of RL. It concludes with the future scope of RL.

Question: What is reinforcement learning?


ANCESTRY-CONSTRAINED PHYLOGENETIC ANALYSIS SUPPORTS THE INDO-EUROPEAN STEPPE HYPOTHESIS. Discussion of Indo-European origins and dispersal focuses on two hypotheses. Qualitative evidence from reconstructed vocabulary and correlations with archaeological data suggest that IndoEuropean languages originated in the Pontic-Caspian steppe and spread together with cultural innovations associated with pastoralism, beginning c. 6500–5500 bp. An alternative hypothesis, according to which Indo-European languages spread with the diffusion of farming from Anatolia, beginning c. 9500–8000 bp, is supported by statistical phylogenetic and phylogeographic analyses of lexical traits. The time and place of the Indo-European ancestor language therefore remain disputed. Here we present a phylogenetic analysis in which ancestry constraints permit more accurate inference of rates of change, based on observed changes between ancient or medieval languages and their modern descendants, and we show that the result strongly supports the steppe hypothesis. Positing ancestry constraints also reveals that homoplasy is common in lexical traits, contrary to the assumptions of previous work. We show that lexical traits undergo recurrent evolution due to recurring patterns of semantic and morphological change.*

Question: What is the Indo-European ancestor language?


An improved k-medoids clustering algorithm. In this paper, we present an improved k-medoids clustering algorithm based on CF-Tree. The algorithm based on the clustering features of BIRCH algorithm, the concept of k-medoids algorithm has been improved. We preserve all the training sample data in an CF-Tree, then use k-medoids method to cluster the CF in leaf nodes of CF-Tree. Eventually, we can get k clusters from the root of the CF-Tree. This algorithm improves obviously the drawbacks of the k-medoids algorithm, such as the time complexity, scalability on large dataset, and can't find the clusters of sizes different very much and the convex shapes. Experiments show that this algorithm enhances the quality and scalability of clustering.

Question: What is the time complexity of the k-medoids clustering algorithm?


Cloudlet deployment in local wireless networks: Motivation, architectures, applications, and open challenges. In past few years, advancement in mobile applications and their integration with Cloud computing services has introduced a new computing paradigm known as Mobile Cloud Computing. Although Cloud services support a wide range of mobile applications, access to these services suffers from several performance issues such as WAN latency, jitter, and packet losses. Cloudlet frameworks are proposed to overcome these performance issues. More specifically, Cloudlets aim to bring the Cloud or a specific part of the Cloud closer to the mobile device by utilizing proximate computing resources to perform compute-intensive tasks. This paper presents a comprehensive survey on the state-of-the-art mobile Cloudlet architectures. We also classify the state-of-the-art Cloudlet solutions by presenting a hierarchical taxonomy. Moreover, the areas of Cloudlet applications are also identified and presented. Cloudlet discovery, resource management, data security, mobility, application offloading, and most importantly incentives to deploy a Cloudlet are areas that still needs to be investigated by the research community. The critical aspects of the current Cloudlet frameworks in Mobile Cloud Computing are analyzed to determine the strengths and weaknesses of the frameworks. The similarities and differences of the frameworks based on the important parameters, such as scalability, mobility support, Internet dependency, dynamic configuration, energy savings, and execution cost, are also investigated. The requirements for deploying the Cloudlet in a Local Wireless Network are also highlighted and presented. We also discuss open research challenges that Cloudlet deployments face in Local Wireless Networks. & 2015 Elsevier Ltd. All rights reserved.

Question: What is the difference between cloudlet and cloud computing?


Free-form deformation of solid geometric models. A technique is presented for deforming solid geometric models in a free-form manner. The technique can be used with any solid modeling system, such as CSG or B-rep. It can deform surface primitives of any type or degree: planes, quadrics, parametric surface patches, or implicitly defined surfaces, for example. The deformation can be applied either globally or locally. Local deformations can be imposed with any desired degree of derivative continuity. It is also possible to deform a solid model in such a way that its volume is preserved.The scheme is based on trivariate Bernstein polynomials, and provides the designer with an intuitive appreciation for its effects.

Question: What is a trivariate Bernstein polynomial?


Impact Selective Incivility as Modern Discrimination in Organizations : Evidence and.

Question: What is the impact of selective incivility?


Perceptual category mapping between English and Korean obstruents in non-CV positions: Prosodic location effects in second language identification skills. This study examines the degree to which mapping patterns between native language (L1) and second language (L2) categories for one prosodic context will generalize to other prosodic contexts, and how position-specific neutralization in the L1 influences the category mappings. Forty L1-Korean learners of English listened to English nonsense words consisting of /p b t d f v h ð/ and /ɑ/, with the consonants appearing in pre-stressed intervocalic, poststressed intervocalic, or coda context, and were asked to identify the consonant with both Korean and English labeling and to give gradient evaluations of the goodness of each label to the stimuli. Results show that the mapping patterns differ extensively from those found previously with the same subjects for consonants in initial, onset context. The mapping patterns for the intervocalic context also differed by position with respect to stress location. Coda consonants elicited poor goodness-of-fit and noisier mapping patterns for all segments, suggesting that an L1 coda neutralization process put all L2-English sounds in codas as "new" sounds under the Speech Learning Model (SLM) framework (Flege, 1995). Taken together, the results indicate that consonant learning needs to be evaluated in terms of position-by-position variants, rather than just being a general property of the overall

Question: What is the difference between the L1 and L2 mapping patterns?


An LLCL Power Filter for Single-Phase Grid-Tied Inverter. This paper presents a new topology of higher order power filter for grid-tied voltage-source inverters, named the LLCL filter, which inserts a small inductor in the branch loop of the capacitor in the traditional LCL filter to compose a series resonant circuit at the switching frequency. Particularly, it can attenuate the switching-frequency current ripple components much better than an LCL filter, leading to a decrease in the total inductance and volume. Furthermore, by decreasing the inductance of a grid-side inductor, it raises the characteristic resonance frequency, which is beneficial to the inverter system control. The parameter design criteria of the proposed LLCL filter is also introduced. The comparative analysis and discussions regarding the traditional LCL filter and the proposed LLCL filter have been presented and evaluated through experiment on a 1.8-kW-single-phase grid-tied inverter prototype.

Question: What is the difference between the LLCL filter and the LCL filter?


Semisupervised and Weakly Supervised Road Detection Based on Generative Adversarial Networks. Road detection is a key component of autonomous driving; however, most fully supervised learning road detection methods suffer from either insufficient training data or high costs of manual annotation. To overcome these problems, we propose a semisupervised learning (SSL) road detection method based on generative adversarial networks (GANs) and a weakly supervised learning (WSL) method based on conditional GANs. Specifically, in our SSL method, the generator generates the road detection results of labeled and unlabeled images, and then they are fed into the discriminator, which assigns a label on each input to judge whether it is labeled. Additionally, in WSL method we add another network to predict road shapes of input images and use them in both generator and discriminator to constrain the learning progress. By training under these frameworks, the discriminators can guide a latent annotation process on the unlabeled data; therefore, the networks can learn better representations of road areas and leverage the feature distributions on both labeled and unlabeled data. The experiments are carried out on KITTI ROAD benchmark, and the results show our methods achieve the state-of-the-art performances.

Question: What is a generative adversarial network?


Predicting and Improving Memory Retention : Psychological Theory Matters in the Big Data Era. Cognitive psychology has long had the aim of understanding mechanisms of human memory, with the expectation that such an understanding will yield practical techniques that support learning and retention. Although research insights have given rise to qualitative advice for students and educators, we present a complementary approach that offers quantitative, individualized guidance. Our approach synthesizes theory-driven and data-driven methodologies. Psychological theory characterizes basic mechanisms of human memory shared among members of a population, whereas machine-learning techniques use observations from a population to make inferences about individuals. We argue that despite the power of big data, psychological theory provides essential constraints on models. We present models of forgetting and spaced practice that predict the dynamic time-varying knowledge state of an individual student for specific material. We incorporate these models into retrieval-practice software to assist students in reviewing previously mastered material. In an ambitious year-long intervention in a middle-school foreign language course, we demonstrate the value of systematic review on long-term educational outcomes, but more specifically, the value of adaptive review that leverages data from a population of learners to personalize recommendations based on an individual's study history and past performance.

Question: How can we predict and improve memory retention?


A human parietal face area contains aligned head-centered visual and tactile maps. Visually guided eating, biting and kissing, and avoiding objects moving toward the face and toward which the face moves require prompt, coordinated processing of spatial visual and somatosensory information in order to protect the face and the brain. Single-cell recordings in parietal cortex have identified multisensory neurons with spatially restricted, aligned visual and somatosensory receptive fields, but so far, there has been no evidence for a topographic map in this area. Here we mapped the organization of a multisensory parietal face area in humans by acquiring functional magnetic resonance images while varying the polar angle of facial air puffs and close-up visual stimuli. We found aligned maps of tactile and near-face visual stimuli at the highest level of human association cortex—namely, in the superior part of the postcentral sulcus. We show that this area may code the location of visual stimuli with respect to the face, not with respect to the retina.*NOTE: In the version of this article initially published online, there was an error in the affiliation in the html version. The first affiliation should read Department of Cognitive Science, University of California San Diego, La Jolla, California 92093, USA. The error has been corrected online.

Question: What is the function of the parietal face area?


Exploring Customer Reviews for Music Genre Classification and Evolutionary Studies. In this paper, we explore a large multimodal dataset of about 65k albums constructed from a combination of Amazon customer reviews, MusicBrainz metadata and AcousticBrainz audio descriptors. Review texts are further enriched with named entity disambiguation along with polarity information derived from an aspect-based sentiment analysis framework. This dataset constitutes the cornerstone of two main contributions: First, we perform experiments on music genre classification, exploring a variety of feature types, including semantic, sentimental and acoustic features. These experiments show that modeling semantic information contributes to outperforming strong bag-of-words baselines. Second, we provide a diachronic study of the criticism of music genres via a quantitative analysis of the polarity associated to musical aspects over time. Our analysis hints at a potential correlation between key cultural and geopolitical events and the language and evolving sentiments found in music reviews.

Question: What is the diachronic study of the criticism of music genres?


Hand detection using multiple proposals. We describe a two-stage method for detecting hands and their orientation in unconstrained images. The first stage uses three complementary detectors to propose hand bounding boxes. Each bounding box is then scored by the three detectors independently, and a second stage classifier learnt to compute a final confidence score for the proposals using these features. We make the following contributions: (i) we add context-based and skin-based proposals to a sliding window shape based detector to increase recall; (ii) we develop a new method of non-maximum suppression based on super-pixels; and (iii) we introduce a fully annotated hand dataset for training and testing. We show that the hand detector exceeds the state of the art on two public datasets, including the PASCAL VOC 2010 human layout challenge.

Question: How many proposals are there?


Graph2Seq: Scalable Learning Dynamics for Graphs. Neural networks have been shown to be an effective tool for learning algorithms over graph-structured data. However, graph representation techniques—that convert graphs to real-valued vectors for use with neural networks—are still in their infancy. Recent works have proposed several approaches (e.g., graph convolutional networks), but these methods have difficulty scaling and generalizing to graphs with different sizes and shapes. We present GRAPH2SEQ, a new technique that represents vertices of graphs as infinite time-series. By not limiting the representation to a fixed dimension, GRAPH2SEQ scales naturally to graphs of arbitrary sizes and shapes. GRAPH2SEQ is also reversible, allowing full recovery of the graph structure from the sequences. By analyzing a formal computational model for graph representation, we show that an unbounded sequence is necessary for scalability. Our experimental results with GRAPH2SEQ show strong generalization and new state-of-the-art performance on a variety of graph combinatorial optimization problems.

Question: What is the graph representation technique called?


Reflections on craft: probing the creative process of everyday knitters. Crafters today blend age-old techniques such as weaving and pottery with new information and communication technologies such as podcasts, online instructions, and blogs. This intersection of tradition and modernity provides an interesting site for understanding the adoption of new technology. We present a qualitative study of seven knitters introduced to Spyn - a system that enables the association of digitally recorded messages with physical locations on knit fabric. We gave knitters Spyn in order to elicit their reflections on their craft practices and learn from their interactions with material, people, and technology. While creating artifacts for friends and loved ones, knitters expanded the creative and communicative potential of their craftwork: knitters envisioned travel journals in knitted potholders and sung lullabies in knitted hats. We describe how these unusual craft activities provide a useful lens onto contemporary technological appropriation.

Question: How do knitters use technology to create?


Obstruction-Free Synchronization: Double-Ended Queues as an Example. We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties—specifically lock-freedom and wait-freedom— allowing greater flexibility in the design of efficient implementations. Obstruction-freedom admits substantially simpler implementations, and we believe that in practice it provides the benefits of wait-free and lock-free implementations. To illustrate the benefits of obstruction-freedom, we present two obstruction-free CAS-based implementations of double-ended queues (deques); the first is implemented on a linear array, the second on a circular array. To our knowledge, all previous nonblocking deque implementations are based on unrealistic assumptions about hardware support for synchronization, have restricted functionality, or have operations that interfere with operations at the opposite end of the deque even when the deque has many elements in it. Our obstruction-free implementations have none of these drawbacks, and thus suggest that it is much easier to design obstruction-free implementations than lock-free and waitfree ones. We also briefly discuss other obstruction-free data structures and operations that we have implemented.

Question: What is obstruction-free synchronization?


Graph databases: A survey. In the era of big data, data analytics, business intelligence database management plays a vital role from technical business management and research point of view. Over many decades, database management has been a topic of active research. There are different type of database management system have been proposed over a period of time but Relational Database Management System (RDBMS) is the one which has been most popularly used in academic research as well as industrial setup[1]. In recent years, graph databases regained interest among the researchers for certain obvious reasons. One of the most important reasons for such an interest in a graph database is because of the inherent property of graphs as a graph structure. Graphs are present everywhere in the data structure, which represents the strong connectivity within the data. Most of the graph database models are defined in which data-structure for schema and instances are modeled as graph or generalization of a graph. In such graph database models, data manipulations are expressed by graph-oriented operations and type constructors [9]. Now days, most of the real world applications can be modeled as a graph and one of the best real world examples is social or biological network. This paper gives an overview of the different type of graph databases, applications, and comparison between their models based on some properties.

Question: What is a graph database?


A Broadband Dual Circularly Polarized Patch Antenna With Wide Beamwidth. A broadband dual circularly polarized patch antenna with wide beamwidth is presented. The patch is excited by four cross slots via a microstrip line with multiple matching segments underneath the ground plane. The four cross slots and the multiple matching segments are optimized simultaneously to obtain the best performance. Measurements show that the antenna has 10-dB return-loss bandwidth of 24%, 10-dB isolation bandwidth of 19%, 3-dB axial-ratio bandwidth of 16%, and beamwidth of 110 °. Moreover, the single feed makes it a good candidate for array design.

Question: What is a broadband dual circularly polarized patch antenna with wide beamwidth?


A survey on skin detection in colored images. Color is an efficient feature for object detection as it has the advantage of being invariant to changes in scaling, rotation, and partial occlusion. Skin color detection is an essential required step in various applications related to computer vision. The rapidly-growing research in human skin detection is based on the premise that information about individuals, intent, mode, and image contents can be extracted from colored images, and computers can then respond in an appropriate manner. Detecting human skin in complex images has proven to be a challenging problem because skin color can vary dramatically in its appearance due to many factors such as illumination, race, aging, imaging conditions, and complex background. However, many methods have been developed to deal with skin detection problem in color images. The purpose of this study is to provide an up-to-date survey on skin color modeling and detection methods. We also discuss relevant issues such as color spaces, cost and risks, databases, testing, and benchmarking. After investigating these methods and identifying their strengths and limitations, we conclude with several implications for future direction.

Question: What is the purpose of this study?


Collaborative Online Examinations: Impacts on Interaction, Learning, and Student Satisfaction. This paper presents the results of a field experiment on online examinations facilitated by collaboration support systems. In particular, it examines collaborative learning and virtual teams through online examinations as an assessment procedure, compared to traditional examinations. Assessment is increasingly regarded as an important part of the learning process. Applying constructivism and collaborative-learning theories, the collaborative examination process features students' active participation in various phases of the exam process through small group activities online. A 1 times 3 field experiment evaluated the collaborative online exam compared with the traditional in-class exam, and the participatory exam, where students participated in the online exam processes without groups. Data analysis using results from 485 students indicates that collaborative examinations significantly enhance interactions and the sense of an online learning community and result in significantly higher levels of perceived learning

Question: What is the difference between a collaborative exam and a traditional exam?


SecMANO: Towards Network Functions Virtualization (NFV) Based Security MANagement and Orchestration. Network Functions Virtualization (NFV) has recently emerged as one of the major technological driving forces that significantly accelerate the evolution of today's computer and communication networks. Despite the advantages of NFV, e.g., saving investment cost, optimizing resource consumption, improving operational efficiency, simplifying network service lifecycle management, lots of novel security threats and vulnerabilities will be introduced, thereby impeding its further development and deployment in practice. In this paper, we briefly report our threat analysis in the context of NFV, and identify the corresponding security requirements. The purpose is to establish a comprehensive threat taxonomy and provide a guideline to develop effective security countermeasures. Furthermore, a conceptual design framework for NFV based security management and service orchestration is presented, with an objective to dynamically and adaptively deploy and manage security functions on the demands of users and customers. A use case about NFV based access control is also developed, illustrating the feasibility and advantages of implementing NFV based security management and orchestration.

Question: What is the purpose of this paper?


Tracking down software bugs using automatic anomaly detection. This paper introduces DIDUCE, a practical and effective tool that aids programmers in detecting complex program errors and identifying their root causes. By instrumenting a program and observing its behavior as it runs, DIDUCE dynamically formulates hypotheses of invariants obeyed by the program. DIDUCE hypothesizes the strictest invariants at the beginning, and gradually relaxes the hypothesis as violations are detected to allow for new behavior. The violations reported help users to catch software bugs as soon as they occur. They also give programmers new visibility into the behavior of the programs such as identifying rare corner cases in the program logic or even locating hidden errors that corrupt the program's results.We implemented the DIDUCE system for Java programs and applied it to four programs of significant size and complexity. DIDUCE succeeded in identifying the root causes of programming errors in each of the programs quickly and automatically. In particular, DIDUCE is effective in isolating a timing-dependent bug in a released JSSE (Java Secure Socket Extension) library, which would have taken an experienced programmer days to find. Our experience suggests that detecting and checking program invariants dynamically is a simple and effective methodology for debugging many different kinds of program errors across a wide variety of application domains.

Question: What is the difference between a bug and a programming error?


FPGA vs. GPU for sparse matrix vector multiply. Sparse matrix-vector multiplication (SpMV) is a common operation in numerical linear algebra and is the computational kernel of many scientific applications. It is one of the original and perhaps most studied targets for FPGA acceleration. Despite this, GPUs, which have only recently gained both general-purpose programmability and native support for double precision floating-point arithmetic, are viewed by some as a more effective platform for SpMV and similar linear algebra computations. In this paper, we present an analysis comparing an existing GPU SpMV implementation to our own, novel FPGA implementation. In this analysis, we describe the challenges faced by any SpMV implementation, the unique approaches to these challenges taken by both FPGA and GPU implementations, and their relative performance for SpMV.

Question: What is the difference between FPGA and GPU for sparse matrix vector multiply?


Convolutional auto-encoder for image denoising of ultra-low-dose CT. OBJECTIVES The purpose of this study was to validate a patch-based image denoising method for ultra-low-dose CT images. Neural network with convolutional auto-encoder and pairs of standard-dose CT and ultra-low-dose CT image patches were used for image denoising. The performance of the proposed method was measured by using a chest phantom.   MATERIALS AND METHODS Standard-dose and ultra-low-dose CT images of the chest phantom were acquired. The tube currents for standard-dose and ultra-low-dose CT were 300 and 10 mA, respectively. Ultra-low-dose CT images were denoised with our proposed method using neural network, large-scale nonlocal mean, and block-matching and 3D filtering. Five radiologists and three technologists assessed the denoised ultra-low-dose CT images visually and recorded their subjective impressions of streak artifacts, noise other than streak artifacts, visualization of pulmonary vessels, and overall image quality.   RESULTS For the streak artifacts, noise other than streak artifacts, and visualization of pulmonary vessels, the results of our proposed method were statistically better than those of block-matching and 3D filtering (p-values < 0.05). On the other hand, the difference in the overall image quality between our proposed method and block-matching and 3D filtering was not statistically significant (p-value = 0.07272). The p-values obtained between our proposed method and large-scale nonlocal mean were all less than 0.05.   CONCLUSION Neural network with convolutional auto-encoder could be trained using pairs of standard-dose and ultra-low-dose CT image patches. According to the visual assessment by radiologists and technologists, the performance of our proposed method was superior to that of large-scale nonlocal mean and block-matching and 3D filtering.

Question: How does the convolutional auto-encoder work?


WordNet : an electronic lexical database. WordNet is perhaps the most important and widely used lexical resource for natural language processing systems up to now. WordNet: An Electronic Lexical Database, edited by Christiane Fellbaum, discusses the design of WordNet from both theoretical and historical perspectives, provides an up-to-date description of the lexical database, and presents a set of applications of WordNet. The book contains a foreword by George Miller, an introduction by Christiane Fellbaum, seven chapters from the Cognitive Sciences Laboratory of Princeton University, where WordNet was produced, and nine chapters contributed by scientists from elsewhere. Miller's foreword offers a fascinating account of the history of WordNet. He discusses the presuppositions of such a lexical database, how the top-level noun categories were determined, and the sources of the words in WordNet. He also writes about the evolution of WordNet from its original incarnation as a dictionary browser to a broad-coverage lexicon, and the involvement of different people during its various stages of development over a decade. It makes very interesting reading for casual and serious users of WordNet and anyone who is grateful for the existence of WordNet. The book is organized in three parts. Part I is about WordNet itself and consists of four chapters: "Nouns in WordNet" by George Miller, "Modifiers in WordNet" by Katherine Miller, "A semantic network of English verbs" by Christiane Fellbaum, and "Design and implementation of the WordNet lexical database and search software" by Randee Tengi. These chapters are essentially updated versions of four papers from Miller (1990). Compared with the earlier papers, the chapters in this book focus more on the underlying assumptions and rationales behind the design decisions. The description of the information contained in WordNet, however, is not as detailed as in Miller (1990). The main new additions in these chapters include an explana

Question: What is the difference between a lexical database and a dictionary?


Search-Free DOD, DOA and Range Estimation for Bistatic FDA-MIMO Radar. Frequency diverse array (FDA) is an emerging technology, the hybrid of FDA and multiple-input-multiple-output (FDA-MIMO) under monostatic scenarios has received much attention in recent years. However, little work have been done for bistatic FDA-MIMO radar. In this paper, we investigate strategies on estimating direction-of-departure (DOD), direction-of-arrival and range for bistatic FDA-MIMO radar. Our strategies have two aspects. First, nonlinear frequency increments including both subarray and random modes are employed to overcome the problem that the DOD and range parameters of FDA transmitting steering vectors are coupled. Second, in order to reduce the computational complexity associated with the 3-D spectral peak searching algorithms, estimation of signal parameters via rotational invariance technique and parallel factor algorithms with their corresponding phase ambiguity resolving methods, are proposed for subarray and random modes, respectively. Both of the two algorithms perform well while the range parameter of targets satisfy a range constraint criterion. This criterion can also be used for designing frequency increments of bistatic FDA-MIMO radar. Additionally, the Cramér-Rao bound of bistatic FDA-MIMO radar and the algorithm performance analysis consist of identifiability and complexity are derived. All the proposed methods are verified by both theoretical analysis and numerical simulations. And satisfactory results are achieved.

Question: How to estimate DOD, DOA and range for bistatic FDA-MIMO radar?


Automatic Classification of Power Quality Events Using Balanced Neural Tree. This paper proposes an empirical-mode decomposition (EMD) and Hilbert transform (HT)-based method for the classification of power quality (PQ) events. Nonstationary power signal disturbance waveforms are considered as the superimposition of various undulating modes, and EMD is used to separate out these intrinsic modes known as intrinsic mode functions (IMFs). The HT is applied on all the IMFs to extract instantaneous amplitude and frequency components. This time-frequency analysis results in the clear visual detection, localization, and classification of the different power signal disturbances. The required feature vectors are extracted from the time-frequency distribution to perform the classification. A balanced neural tree is constructed to classify the power signal patterns. Finally, the proposed method is compared with an S-transform-based classifier to show the efficacy of the proposed technique in classifying the PQ disturbances.

Question: How to classify power quality events?


Ensemble Methods for Multi-label Classification. Ensemble methods have been shown to be an effectiv e tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the en semble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of elements in the subset. In this paper we adopt a similar approach, however, instead of rando mly choosing subsets, we select the minimum required su bsets of k labels that cover all labels and meet additional constraints such as coverage of inter-label correla tions. Construction of the cover is achieved by form ulating the subset selection as a minimum set covering prob lem (SCP) and solving it by using approximation algo rithms. Every cover needs only to be prepared once by offline algorithms. Once prepared, a cover may b e applied to the classification of any given multi-la bel dataset whose properties conform with those of the cover. The contribution of this paper is two-fold. Fir st, we introduce SCP as a general framework for con structing label covers while allowing the user to incorpo rate cover construction constraints. We demonstrate he effectiveness of this framework by proposing two co nstruction constraints whose enforcement produces c overs that improve the prediction performance of ran dom selection. Second, we provide theoretical bound s that quantify the probabilities of random selection t produce covers that meet the proposed construct ion riteria. The experimental results indicate that the p roposed methods improve multi-label classification accuracy and stability compared with the RAKEL algorithm a nd to other state-of-the-art algorithms.

Question: What is the difference between ensemble methods and multi-label classification?


How do software engineers understand code changes?: an exploratory study in industry. Software evolves with continuous source-code changes. These code changes usually need to be understood by software engineers when performing their daily development and maintenance tasks. However, despite its high importance, such change-understanding practice has not been systematically studied. Such lack of empirical knowledge hinders attempts to evaluate this fundamental practice and improve the corresponding tool support.  To address this issue, in this paper, we present a large-scale quantitative and qualitative study at Microsoft. The study investigates the role of understanding code changes during software-development process, explores engineers' information needs for understanding changes and their requirements for the corresponding tool support. The study results reinforce our beliefs that understanding code changes is an indispensable task performed by engineers in software-development process. A number of insufficiencies in the current practice also emerge from the study results. For example, it is difficult to acquire important information needs such as a change's completeness, consistency, and especially the risk imposed by it on other software components. In addition, for understanding a composite change, it is valuable to decompose it into sub-changes that are aligned with individual development issues; however, currently such decomposition lacks tool support.

Question: How do software engineers understand code changes?


Design of the Artificial: lessons from the biological roots of general intelligence. Our desire and fascination with intelligent machines dates back to the antiquity's mythical automaton Talos, Aristotle's mode of mechanical thought (syllogism) and Heron of Alexandria's mechanical machines and automata. However, the quest for Artificial General Intelligence (AGI) is troubled with repeated failures of strategies and approaches throughout the history. This decade has seen a shift in interest towards bio-inspired software and hardware, with the assumption that such mimicry entails intelligence. Though these steps are fruitful in certain directions and have advanced automation, their singular design focus renders them highly inefficient in achieving AGI. Which set of requirements have to be met in the design of AGI? What are the limits in the design of the artificial? Here, a careful examination of computation in biological systems hints that evolutionary tinkering of contextual processing of information enabled by a hierarchical architecture is the key to build AGI.

Question: What are the limits in the design of the artificial?


Mental balance and well-being: building bridges between Buddhism and Western psychology.. Clinical psychology has focused primarily on the diagnosis and treatment of mental disease, and only recently has scientific attention turned to understanding and cultivating positive mental health. The Buddhist tradition, on the other hand, has focused for over 2,500 years on cultivating exceptional states of mental well-being as well as identifying and treating psychological problems. This article attempts to draw on centuries of Buddhist experiential and theoretical inquiry as well as current Western experimental research to highlight specific themes that are particularly relevant to exploring the nature of mental health. Specifically, the authors discuss the nature of mental well-being and then present an innovative model of how to attain such well-being through the cultivation of four types of mental balance: conative, attentional, cognitive, and affective.

Question: What is mental balance?


Phone-aware LSTM-RNN for voice conversion. This paper investigates a new voice conversion technique using phone-aware Long Short-Term Memory Recurrent Neural Networks (LSTM-RNNs). Most existing voice conversion methods, including Joint Density Gaussian Mixture Models (JDGMMs), Deep Neural Networks (DNNs) and Bidirectional Long Short-Term Memory Recurrent Neural Networks (BLSTM-RNNs), only take acoustic information of speech as features to train models. We propose to incorporate linguistic information to build voice conversion system by using monophones generated by a speech recognizer as linguistic features. The monophones and spectral features are combined together to train LSTM-RNN based voice conversion models, reinforcing the context-dependency modelling of LSTM-RNNs. The results of the 1st voice conversion challenge shows our system achieves significantly higher performance than baseline (GMM method) and was found among the most competitive scores in similarity test. Meanwhile, the experimental results show phone-aware LSTM-RNN method obtains lower Mel-cepstral distortion and higher MOS scores than the baseline LSTM-RNNs.

Question: What is the phone-aware LSTM-RNN for voice conversion?


Thinking Positively - Explanatory Feedback for Conversational Recommender Systems. When it comes to buying expensive goods people expect to be skillfully steered through the options by well-informed sales assistants that are capable of balancing the user's many and varied requirements. In addition users often need to be educated about the product-space, especially if they are to come to understand what is available and why certain options are being recommended by the sales-assistant. The same issues arise in interactive recommender systems, our online equivalent of a sales assistant and explanation in recommender systems, as a means to educate users and justify recommendations, is now well accepted. In this paper we focus on a novel approach to explanation. Instead of attempting to justify a particular recommendation we focus on how explanations can help users to understand the recommendation opportunities that remain if the current recommendation should not meet their requirements. We describe how this approach to explanation is tightly coupled with the generation of compound critiques, which act as a form of feedback for the users. And we argue that these explanation-rich critiques have the potential to dramatically improve recommender performance and usability.

Question: How can we explain recommendations?


Orchestrating a mixed reality performance. A study of a professional touring mixed reality performance called Desert Rain yields insights into how performers orchestrate players' engagement in an interactive experience. Six players at a time journey through an extended physical and virtual set. Each sees a virtual world projected onto a screen made from a fine water spray. This acts as a traversable interface, supporting the illusion that performers physically pass between real and virtual worlds. Live and video-based observations of Desert Rain, coupled with interviews with players and the production team, have revealed how the performers create conditions for the willing suspension of disbelief, and how they monitor and intervene in the players experience without breaking their engagement. This involves carefully timed performances and "off-face" and "virtual" interventions. In turn, these are supported by the ability to monitor players' physical and virtual activity through asymmetric interfaces.

Question: How do performers orchestrate players' engagement in an interactive experience?


Simple to complex cross-modal learning to rank. The heterogeneity-gap between different modalities brings a significant challenge to multimedia information retrieval. Some studies formalize the cross-modal retrieval tasks as a ranking problem and learn a shared multi-modal embedding space to measure the cross-modality similarity. However, previous methods often establish the shared embedding space based on linear mapping functions which might not be sophisticated enough to reveal more complicated inter-modal correspondences. Additionally, current studies assume that the rankings are of equal importance, and thus all rankings are used simultaneously, or a small number of rankings are selected randomly to train the embedding space at each iteration. Such strategies, however, always suffer from outliers as well as reduced generalization capability due to their lack of insightful understanding of procedure of human cognition. In this paper, we involve the self-paced learning theory with diversity into the cross-modal learning to rank and learn an optimal multi-modal embedding space based on non-linear mapping functions. This strategy enhances the model's robustness to outliers and achieves better generalization via training the model gradually from easy rankings by diverse queries to more complex ones. An efficient alternative algorithm is exploited to solve the proposed challenging problem with fast convergence in practice. Extensive experimental results on several benchmark datasets indicate that the proposed method achieves significant improvements over the stateof-the-arts in this literature. © 2017 Elsevier Inc. All rights reserved.

Question: What is the difference between cross-modal learning to rank and learning to rank?


Network intrusion detection. Intrusion detection is a new, retrofit approach for providing a sense of security in existing computers and data networks, while allowing them to operate in their current "open" mode. The goal of intrusion detection is to identify unauthorized use, misuse, and abuse of computer systems by both system insiders and external penetrators. The intrusion detection problem is becoming a challenging task due to the proliferation of heterogeneous computer networks since the increased connectivity of computer systems gives greater access to outsiders and makes it easier for intruders to avoid identification. Intrusion detection systems (IDSs) are based on the beliefs that an intruder's behavior will be noticeably different from that of a legitimate user and that many unauthorized actions are detectable. Typically, IDSs employ statistical anomaly and rulebased misuse models in order to detect intrusions. A number of prototype IDSs have been developed at several institutions, and some of them have also been deployed on an experimental basis in operational systems. In the present paper, several host-based and network-based IDSs are surveyed, and the characteristics of the corresponding systems are identified. The host-based systems employ the host operating system's audit trails as the main source of input to detect intrusive activity, while most of the network-based IDSs build their detection mechanism on monitored network traffic, and some employ host audit trails as well. An outline of a statistical anomaly detection algorithm employed in a typical IDS is also included.<<ETX>>

Question: What is ETX?


Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories. This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingly fine sub-regions and computing histograms of local features found inside each sub-region. The resulting "spatial pyramid" is a simple and computationally efficient extension of an orderless bag-of-features image representation, and it shows significantly improved performance on challenging scene categorization tasks. Specifically, our proposed method exceeds the state of the art on the Caltech-101 database and achieves high accuracy on a large database of fifteen natural scene categories. The spatial pyramid framework also offers insights into the success of several recently proposed image descriptions, including Torralba's "gist" and Lowe's SIFT descriptors.

Question: What is the state of the art on scene categorization?


Design of a compact high power phased array for 5G FD-MIMO system at 29 GHz. This paper presents a new design concept of a beam steerable high gain phased array antenna based on WR28 waveguide at 29 GHz frequency for fifth generation (5G) full dimension multiple input multiple output (FD-MIMO) system. The 8×8 planar phased array is fed by a three dimensional beamformer to obtain volumetric beam scanning ranging from −60 to +60 degrees both in azimuth and elevation direction. Beamforming network (BFN) is designed using 16 set of 8×8 Butler matrix beamformer to get 64 beam states, which control the horizontal and vertical angle. This is a new concept to design waveguide based high power three-dimensional beamformer for volumetric multibeam in Ka band for 5G application. The maximum gain of phased array is 28.5 dBi that covers 28.9 GHz to 29.4 GHz frequency band.

Question: What is a beamformer?


Dark vs. Dim Silicon and Near-Threshold Computing. Due to limited scaling of supply voltage, power density is expected to grow in future technology nodes. This increasing power density potentially limits the number of transistors switching at full speed in the future. Near-threshold operation can increase the number of simultaneously active cores, at the expense of much lower operating frequency ("dim silicon"). Although promising to increase overall throughput, dim cores suffer from diminishing returns as the number of cores increases. At this point, hardware accelerators become more efficient alternatives. To explore such a broad design space, we have developed a framework called Lumos to analytically quantify the performance limits of many-core, heterogeneous systems operating at near-threshold voltage. Lumos augments Amdahl's Law with detailed scaling of frequency and power, calibrated by circuit-level simulations using a modified Predictive Technology Model (PTM) and factors in effects of process variations. While our results show that dim cores do indeed boost throughput, even in the presence of process variations, significant benefits are only achieved in applications with very high parallelism or with novel architectures to mitigate variation. A more beneficial 1 and scalable approach is to use accelerators. However, reconfigurable logic that supports a variety of accelerators is more beneficial than a dedicated, fixed-logic accelerator, unless 1) the dedicated kernel has overwhelming coverage across applications (e.g. twice as large as the total of all others), or 2) the speedup of the dedicated accelerator over the reconfigurable equivalent is significant (e.g. 10x-50x).

Question: What is the difference between dim silicon and near-threshold computing?


Autonomous Self-Assembly in Swarm-Bots. In this paper, we discuss the self-assembling capabilities of the swarm-bot, a distributed robotics concept that lies at the intersection between collective and self-reconfigurable robotics. A swarm-bot is comprised of autonomous mobile robots called s-bots. S-bots can either act independently or self-assemble into a swarm-bot by using their grippers. We report on experiments in which we study the process that leads a group of s-bots to self-assemble. In particular, we present results of experiments in which we vary the number of s-bots (up to 16 physical robots), their starting configurations, and the properties of the terrain on which self-assembly takes place. In view of the very successful experimental results, swarm-bot qualifies as the current state of the art in autonomous self-assembly

Question: How many robots are needed to self-assemble?


High Performance Transactions via Early Write Visibility. In order to guarantee recoverable transaction execution, database systems permit a transaction's writes to be observable only at the end of its execution. As a consequence, there is generally a delay between the time a transaction performs a write and the time later transactions are permitted to read it. This delayed write visibility can significantly impact the performance of serializable database systems by reducing concurrency among conflicting transactions. This paper makes the observation that delayed write visibility stems from the fact that database systems can arbitrarily abort transactions at any point during their execution. Accordingly, we make the case for database systems which only abort transactions under a restricted set of conditions, thereby enabling a new recoverability mechanism, early write visibility, which safely makes transactions' writes visible prior to the end of their execution. We design a new serializable concurrency control protocol, piece-wise visibility (PWV), with the explicit goal of enabling early write visibility. We evaluate PWV against state-of-the-art serializable protocols and a highly optimized implementation of read committed, and find that PWV can outperform serializable protocols by an order of magnitude and read committed by 3X on high contention workloads.

Question: What is the difference between a serializable and a non-serializable database system?


CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY. Executive Summary Confidentiality, integrity, and authentication services are critical to preventing an adversary from compromising the security of a distributed sensor network. Key management is likewise critical to establishing the keys necessary to provide this protection. However, providing key management is difficult due to the ad hoc nature, intermittent connectivity, and resource limitations of the sensor network environment. As part of the SensIT program, NAI Labs is addressing this problem by identifying and developing cryptographic protocols and mechanisms that efficiently provide key management security support services. This document describes our sensor network constraints and key management approaches research for FY 2000. As a first step, NAI Labs has researched battlefield sensor and sensor network technology and the unique communications environment in which it will be deployed. We have identified the requirements specific to our problem of providing key management for confidentiality and group-level authentication. We have also identified constraints, particularly energy consumption, that render this problem difficult. NAI Labs has developed novel key management protocols specifically designed for the distributed sensor network environment, including Identity-Based Symmetric Keying and Rich Uncle. We have analyzed both existing and NAI Labs-developed keying protocols for their suitability at satisfying identified requirements while overcoming battlefield energy constraints. Our research has focused heavily on key management energy consumption, evaluating protocols based on total system, average sensor node, and individual sensor node energy consumption. We examined a number of secret-key-based protocols, determining some to be suitable for sensor networks but all of the protocols have flexibility limitations. Secret-key-based protocols are generally energy-efficient, using encrypti

Question: What is the total system energy consumption of a distributed sensor network?


Measuring semantic similarity between Gene Ontology terms. Many bioinformatics applications would benefit from comparing proteins based on their biological role rather than their sequence. This manuscript adds two new contributions. First, a study of the correlation between Gene Ontology (GO) terms and family similarity demonstrates that protein families constitute an appropriate baseline for validating GO similarity. Secondly, we introduce GraSM, a novel method that uses all the information in the graph structure of the Gene Ontology, instead of considering it as a hierarchical tree. GraSM gives a consistently higher family similarity correlation on all aspects of GO than the original semantic similarity measures.

Question: What is the correlation between gene ontology and family similarity?


Progress on a cognitive-motivational-relational theory of emotion.. The 2 main tasks of this article are 1st, to examine what a theory of emotion must do and basic issues that it must address. These include definitional issues, whether or not physiological activity should be a defining attribute, categorical versus dimensional strategies, the reconciliation of biological universals with sociocultural sources of variability, and a classification of the emotions. The 2nd main task is to apply an analysis of appraisal patterns and the core relational themes that they produce to a number of commonly identified emotions. Anger, anxiety, sadness, and pride (to include 1 positive emotion) are used as illustrations. The purpose is to show the capability of a cognitive-motivational-relational theory to explain and predict the emotions. The role of coping in emotion is also discussed, and the article ends with a response to criticisms of a phenomenological, folk-theory outlook.

Question: What is a cognitive-motivational-relational theory of emotion?


Surgical management of cloacal malformations: a review of 339 patients.. BACKGROUND/PURPOSE The aim of this study was to describe lessons learned from the authors' series of patients with cloaca and convey the improved understanding and surgical treatment of the condition's wide spectrum of complexity.   METHODS The medical records of 339 patients with cloaca operated on by the authors were retrospectively reviewed.   RESULTS A total of 265 patients underwent primary operations, and 74 were secondary. All patients were approached posterior sagittally; 111 of them also required a laparotomy. The average length of the common channel was 4.7 cm for patients that required a laparotomy and 2.3 cm for those that did not. Vaginal reconstruction involved a vaginal pull-through in 196 patients, a vaginal flap in 38, vaginal switch in 30, and vaginal replacement in 75 (36 with rectum, 31 with ileum, and 8 with colon). One hundred twenty-two patients underwent a total urogenital mobilization. Complications included vaginal stricture or atresia in 17, urethral strictures in 6, and urethro-vaginal fistula in 19, all of which occurred before the introduction of the total urogenital mobilization. A total of 54% of all evaluated patients were continent of urine and 24% remain dry with intermittent catheterization through their native urethra and 22% through a Mitrofanoff-type of conduit. Seventy-eight percent of the patients with a common channel longer than 3 cm require intermittent catheterization compared with 28% when their common channel was shorter than 3 cm. Sixty percent of all cases have voluntary bowel movements (28% of them never soiled, and 72% soiled occasionally). Forty percent are fecally incontinent but remain clean when subjected to a bowel management program. Forty-eight patients born at other institutions with hydrocolpos were not treated correctly during the neonatal period. The surgeons failed to drain the dilated vaginas, which interfered with the drainage of

Question: What is cloacal malformation?


Real-Time Tracking via On-line Boosting. Very recently tracking was approached using classification techniques such as support vector machines. The object to be tracked is discriminated by a classifier from the background. In a similar spirit we propose a novel on-line AdaBoost feature selection algorithm for tracking. The distinct advantage of our method is its capability of on-line training. This allows to adapt the classifier while tracking the object. Therefore appearance changes of the object (e.g. out of plane rotations, illumination changes) are handled quite naturally. Moreover, depending on the background the algorithm selects the most discriminating features for tracking resulting in stable tracking results. By using fast computable features (e.g. Haar-like wavelets, orientation histograms, local binary patterns) the algorithm runs in real-time. We demonstrate the performance of the algorithm on several (publically available) video sequences.

Question: What is the difference between AdaBoost and SVM?


A comparative review of tone-mapping algorithms for high dynamic range video. Tone-mapping constitutes a key component within the field of high dynamic range (HDR) imaging. Its importance is manifested in the vast amount of tone-mapping methods that can be found in the literature, which are the result of an active development in the area for more than two decades. Although these can accommodate most requirements for display of HDR images, new challenges arose with the advent of HDR video, calling for additional considerations in the design of tone-mapping operators (TMOs). Today, a range of TMOs exist that do support video material. We are now reaching a point where most camera captured HDR videos can be prepared in high quality without visible artifacts, for the constraints of a standard display device. In this report, we set out to summarize and categorize the research in tone-mapping as of today, distilling the most important trends and characteristics of the tone reproduction pipeline. While this gives a wide overview over the area, we then specifically focus on tone-mapping of HDR video and the problems this medium entails. First, we formulate the major challenges a video TMO needs to address. Then, we provide a description and categorization of each of the existing video TMOs. Finally, by constructing a set of quantitative measures, we evaluate the performance of a number of the operators, in order to give a hint on which can be expected to render the least amount of artifacts. This serves as a comprehensive reference, categorization and comparative assessment of the state-of-the-art in tone-mapping for HDR video.

Question: What is the state of the art in tone-mapping for HDR video?


Task-Oriented Query Reformulation with Reinforcement Learning. Search engines play an important role in our everyday lives by assisting us in finding the information we need. When we input a complex query, however, results are often far from satisfactory. In this work, we introduce a query reformulation system based on a neural network that rewrites a query to maximize the number of relevant documents returned. We train this neural network with reinforcement learning. The actions correspond to selecting terms to build a reformulated query, and the reward is the document recall. We evaluate our approach on three datasets against strong baselines and show a relative improvement of 5-20% in terms of recall. Furthermore, we present a simple method to estimate a conservative upperbound performance of a model in a particular environment and verify that there is still large room for improvements.

Question: What is the canadian military?


B2B E-commerce: Frameworks for e-readiness assessment. This paper looks into the development of e- readiness model for B2B e-commerce of Small and Medium Enterprises (SMEs). Drawing on existing research on e-readiness models of ICT (information, Communications Technology) specifically B2B e-commerce technologies, this paper formulates a conceptual framework of B2B e-commerce assessment constructs together with the specific research approach towards the development of a more robust e-readiness model. The research presents a conceptual model and framework that highlight the key factors in B2B e-commerce implementation, index score formulations, focus group evaluations and the recommendation approaches to improve B2B e-commerce readiness.

Question: What is the difference between a conceptual framework and a conceptual model?


Build-to-order supply chain management : a literature review and framework for development. The build-to-order supply chain management (BOSC) strategy has recently attracted the attention of both researchers and practitioners, given its successful implementation in many companies including Dell computers, Compaq, and BMW. The growing number of articles on BOSC in the literature is an indication of the importance of the strategy and of its role in improving the competitiveness of an organization. The objective of a BOSC strategy is to meet the requirements of individual customers by leveraging the advantages of outsourcing and information technology. There are not many research articles that provide an overview of BOSC, despite the fact that this strategy is being promoted as the operations paradigm of the future. The main objective of this research is to (i) review the concepts of BOSC, (ii) develop definitions of BOSC, (iii) classify the literature based on a suitable classification scheme, leading to some useful insights into BOSC and some future research directions, (iv) review the selected articles on BOSC for their contribution to the development and operations of BOSC, (v) develop a framework for BOSC, and (vi) suggest some future research directions. The literature has been reviewed based on the following four major areas of decision-making: organizational competitiveness, the development and implementation of BOSC, the operations of BOSC, and information technology in BOSC. Some of the important observations are: (a) there is a lack of adequate research on the design and control of BOSC, (b) there is a need for further research on the implementation of BOSC, (c) human resource issues in BOSC have been ignored, (d) issues of product commonality and modularity from the perspective of partnership or supplier development require further attention and (e) the trade-off between responsiveness and the cost of logistics needs further study. The paper ends with concl

Question: What is the build-to-order supply chain management?


Side Channels in Deduplication: Trade-offs between Leakage and Efficiency. Deduplication removes redundant copies of files or data blocks stored on the cloud. Client-side deduplication, where the client only uploads the file upon the request of the server, provides major storage and bandwidth savings, but introduces a number of security concerns. Harnik et al. (2010) showed how cross-user client-side deduplication inherently gives the adversary access to a (noisy) side-channel that may divulge whether or not a particular file is stored on the server, leading to leakage of user information. We provide formal definitions for deduplication strategies and their security in terms of adversarial advantage. Using these definitions, we provide a criterion for designing good strategies and then prove a bound characterizing the necessary trade-off between security and efficiency.

Question: What is a side channel?


Detecting Malware for Android Platform: An SVM-Based Approach. In recent years, Android has become one of the most popular mobile operating systems because of numerous mobile applications (apps) it provides. However, the malicious Android applications (malware) downloaded from third-party markets have significantly threatened users' security and privacy, and most of them remain undetected due to the lack of efficient and accurate malware detection techniques. In this paper, we study a malware detection scheme for Android platform using an SVM-based approach, which integrates both risky permission combinations and vulnerable API calls and use them as features in the SVM algorithm. To validate the performance of the proposed approach, extensive experiments have been conducted, which show that the proposed malware detection scheme is able to identify malicious Android applications effectively and efficiently.

Question: How to detect malware for android platform?


Semi-supervised Named Entity Recognition in noisy-text. Many of the existing Named Entity Recognition (NER) solutions are built based on news corpus data with proper syntax. These solutions might not lead to highly accurate results when being applied to noisy, user generated data, e.g., tweets, which can feature sloppy spelling, concept drift, and limited contextualization of terms and concepts due to length constraints. The models described in this paper are based on linear chain conditional random fields (CRFs), use the BIEOU encoding scheme, and leverage random feature dropout for up-sampling the training data. The considered features include word clusters and pre-trained distributed word representations, updated gazetteer features, and global context predictions. The latter feature allows for ingesting the meaning of new or rare tokens into the system via unsupervised learning and for alleviating the need to learn lexicon based features, which usually tend to be high dimensional. In this paper, we report on the solution [ST] we submitted to the WNUT 2016 NER shared task. We also present an improvement over our original submission [SI], which we built by using semi-supervised learning on labelled training data and pre-trained resourced constructed from unlabelled tweet data. Our ST solution achieved an F1 score of 1.2% higher than the baseline (35.1% F1) for the task of extracting 10 entity types. The SI resulted in an increase of 8.2% in F1 score over the baseline (7.08% over ST). Finally, the SI model's evaluation on the test data achieved a F1 score of 47.3% (~1.15% increase over the 2 best submitted solution). Our experimental setup and results are available as a standalone twitter NER tool at https://github.com/napsternxg/TwitterNER.

Question: What is the difference between semi-supervised learning and supervised learning?


The ethics of representation and action in virtual reality. This essay addresses ethical aspects of the design and use of virtual reality (VR) systems, focusing on the behavioral options made available in such systems and the manner in which reality is represented or simulated in them. An assessment is made of the morality of 'immoral' behavior in virtual reality, and of the virtual modeling of such behavior. Thereafter, the ethical aspects of misrepresentation and biased representation in VR applications are discussed.

Question: What is the morality of virtual reality?


Proximal Splitting Methods in Signal Processing ∗. The proximity operator of a convex function is a natural exte nsion of the notion of a projection operator onto a convex set. This tool, which plays a central role in the analysis and the numerical solution of convex opt imization problems, has recently been introduced in the arena of inverse problems an d, especially, in signal processing, where it has become increasingly important. In this paper, we review the basic properties of proximity operators which are relevant to signal processing and present optimization methods based on these operators. The e proximal splitting methods are shown to capture and extend several well-known a lgorithms in a unifying framework. Applications of proximal methods in signal r ecovery and synthesis are discussed.

Question: What is the proximity operator of a convex function?


Integrating perceived playfulness into expectation-confirmation model for web portal context. This paper investigated the value of including "playfulness" in expectation-confirmation theory (ECT) when studying continued use of a web site. Original models examined cognitive beliefs and effects that influence a person's intention to continue to use an information system. Here, an extended ECT model (with an additional relationship between perceived playfulness and satisfaction) was shown to provide a better fit than a simple path from perceived usefulness to satisfaction. The results indicated that perceived playfulness, confirmation to satisfaction, and perceived usefulness all contributed significantly to the users' intent to reuse a web site. Thus, we believe that the extended ECT model is an appropriate tool for the study of web site effects.

Question: What is the value of including playfulness in expectation-confirmation theory?


Adaptive Laplace Mechanism: Differential Privacy Preservation in Deep Learning. In this paper, we focus on developing a novel mechanism to preserve differential privacy in deep neural networks, such that: (1) The privacy budget consumption is totally independent of the number of training steps; (2) It has the ability to adaptively inject noise into features based on the contribution of each to the output; and (3) It could be applied in a variety of different deep neural networks. To achieve this, we figure out a way to perturb affine transformations of neurons, and loss functions used in deep neural networks. In addition, our mechanism intentionally adds "more noise" into features which are "less relevant" to the model output, and vice-versa. Our theoretical analysis further derives the sensitivities and error bounds of our mechanism. Rigorous experiments conducted on MNIST and CIFAR-10 datasets show that our mechanism is highly effective and outperforms existing solutions.

Question: What is the adaptive laplace mechanism?


Automated Training of Deep Convolutional Neural Networks for Cell Segmentation. Deep Convolutional Neural Networks (DCNN) have recently emerged as superior for many image segmentation tasks. The DCNN performance is however heavily dependent on the availability of large amounts of problem-specific training samples. Here we show that DCNNs trained on ground truth created automatically using fluorescently labeled cells, perform similar to manual annotations.

Question: How do you train a deep convolutional neural network?


Functional Neuroanatomy of Emotion: A Meta-Analysis of Emotion Activation Studies in PET and fMRI. Neuroimagingstudies with positron emission tomography (PET) and functional magnetic resonance imaging (fMRI) have begun to describe the functional neuroanatomy of emotion. Taken separately, specific studies vary in task dimensions and in type(s) of emotion studied and are limited by statistical power and sensitivity. By examining findings across studies, we sought to determine if common or segregated patterns of activations exist across various emotional tasks. We reviewed 55 PET and fMRI activation studies (yielding 761 individual peaks) which investigated emotion in healthy subjects. Peak activation coordinates were transformed into a standard space and plotted onto canonical 3-D brain renderings. We divided the brain into 20 nonoverlapping regions, and characterized each region by its responsiveness across individual emotions (positive, negative, happiness, fear, anger, sadness, disgust), to different induction methods (visual, auditory, recall/imagery), and in emotional tasks with and without cognitive demand. Our review yielded the following summary observations: (1) The medial prefrontal cortex had a general role in emotional processing; (2) fear specifically engaged the amygdala; (3) sadness was associated with activity in the subcallosal cingulate; (4) emotional induction by visual stimuli activated the occipital cortex and the amygdala; (5) induction by emotional recall/imagery recruited the anterior cingulate and insula; (6) emotional tasks with cognitive demand also involved the anterior cingulate and insula. This review provides a critical comparison of findings across individual studies and suggests that separate brain regions are involved in different aspects of emotion.

Question: What is the functional neuroanatomy of emotion?