A Hidden Semi-Markov Model-Based Speech Synthesis System. Recently, a statistical speech synthesis system based on the hidden Markov model (HMM) has been proposed. In this system, spectrum, excitation, and duration of human speech are modeled simultaneously by context-dependent HMMs and speech parameter vector sequences are generated from the HMMs themselves. This system defines a speech synthesis problem in a generative model framework and solves it using the maximum likelihood (ML) criterion. However, there is an inconsistency: although state duration models are explicitly used in the synthesis part of the system, they have not been incorporated in its training part. This inconsistency may degrade the naturalness of synthesized speech. In the present paper, a statistical speech synthesis system based on a hidden semi-Markov model (HSMM), which can be viewed as an HMM with explicit state duration models, is developed and evaluated. The use of HSMMs allows us to incorporate the state duration models explicitly not only in the synthesis part but also in the training part of the system and resolves the inconsistency in the HMM-based speech synthesis system. Subjective listening test results show that the use of HSMMs improves the reported naturalness of synthesized speech. key words: hidden Markov model, hidden semi-Markov model, HMMbased speech synthesis

Question: What is a hidden semi-Markov model?


Language Learning in Virtual Reality Environments: Past, Present, and Future. This study investigated the research trends in language learning in a virtual reality environment by conducting a content analysis of findings published in the literature from 2004 to 2013 in four top ranked computer-assisted language learning journals: Language Learning & Technology, CALICO Journal, Computer Assisted Language Learning, and ReCALL. Data from 29 articles were cross-analyzed in terms of research topics, technologies used, language learning settings, sample groups, and methodological approaches. It was found that the three most popular research topics for learners were interactive communication; behaviors, affections, and beliefs; and task-based instruction. However, the analysis results highlight the need for the inclusion of the impact of teacher. The data also revealed that more studies are utilizing triangulation of measurement processes to enable in-depth analysis. A trend of gathering data through informal learning procedures was also observed. This article concludes by highlighting particular fields related to VR in which further research is urgently needed.

Question: What is the impact of teacher?


Time-Elastic Generative Model for Acceleration Time Series in Human Activity Recognition. Body-worn sensors in general and accelerometers in particular have been widely used in order to detect human movements and activities. The execution of each type of movement by each particular individual generates sequences of time series of sensed data from which specific movement related patterns can be assessed. Several machine learning algorithms have been used over windowed segments of sensed data in order to detect such patterns in activity recognition based on intermediate features (either hand-crafted or automatically learned from data). The underlying assumption is that the computed features will capture statistical differences that can properly classify different movements and activities after a training phase based on sensed data. In order to achieve high accuracy and recall rates (and guarantee the generalization of the system to new users), the training data have to contain enough information to characterize all possible ways of executing the activity or movement to be detected. This could imply large amounts of data and a complex and time-consuming training phase, which has been shown to be even more relevant when automatically learning the optimal features to be used. In this paper, we present a novel generative model that is able to generate sequences of time series for characterizing a particular movement based on the time elasticity properties of the sensed data. The model is used to train a stack of auto-encoders in order to learn the particular features able to detect human movements. The results of movement detection using a newly generated database with information on five users performing six different movements are presented. The generalization of results using an existing database is also presented in the paper. The results show that the proposed mechanism is able to obtain acceptable recognition rates (F = 0.77) even in the case of using different peop

Question: What is the time elasticity of human activity?


Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. We present a rule-based system for computer-aided circuit analysis. The set of rules, called EL, is written in a rule language called ARS. Rules are implemented by ARS as pattern-directed invocation demons monitoring an associative data base. Deductions are performed in an antecedent manner, giving EL's analysis a catch-as-catch-can flavour suggestive of the behavior of expert circuit analyzers. We call this style of circuit analysis propagation of constraints. The system threads deduced fact~ with justifications which mention the antecedent facts attd the rule used. These justifications may be examined by the user to gain in right into the operation of the set of rules as they apply to a problem. ~q~e same justifications are used by the system to determine the currently active dat~-base context Jor reasoning in hypothetical situations. They are also used by the system in the at~alysis of failures to reduce the search space. This leads to effective control of combinatorial search which we call dependency-directed backtracking.

Question: What is the name of the rule language?


The brain's conversation with itself: neural substrates of dialogic inner speech.. Inner speech has been implicated in important aspects of normal and atypical cognition, including the development of auditory hallucinations. Studies to date have focused on covert speech elicited by simple word or sentence repetition, while ignoring richer and arguably more psychologically significant varieties of inner speech. This study compared neural activation for inner speech involving conversations ('dialogic inner speech') with single-speaker scenarios ('monologic inner speech'). Inner speech-related activation differences were then compared with activations relating to Theory-of-Mind (ToM) reasoning and visual perspective-taking in a conjunction design. Generation of dialogic (compared with monologic) scenarios was associated with a widespread bilateral network including left and right superior temporal gyri, precuneus, posterior cingulate and left inferior and medial frontal gyri. Activation associated with dialogic scenarios and ToM reasoning overlapped in areas of right posterior temporal cortex previously linked to mental state representation. Implications for understanding verbal cognition in typical and atypical populations are discussed.

Question: What is the difference between monologic and dialogic inner speech?


Effective Identification of Similar Patients Through Sequential Matching over ICD Code Embedding. Evidence-based medicine often involves the identification of patients with similar conditions, which are often captured in ICD (International Classification of Diseases (World Health Organization 2013)) code sequences. With no satisfying prior solutions for matching ICD-10 code sequences, this paper presents a method which effectively captures the clinical similarity among routine patients who have multiple comorbidities and complex care needs. Our method leverages the recent progress in representation learning of individual ICD-10 codes, and it explicitly uses the sequential order of codes for matching. Empirical evaluation on a state-wide cancer data collection shows that our proposed method achieves significantly higher matching performance compared with state-of-the-art methods ignoring the sequential order. Our method better identifies similar patients in a number of clinical outcomes including readmission and mortality outlook. Although this paper focuses on ICD-10 diagnosis code sequences, our method can be adapted to work with other codified sequence data.

Question: How to identify similar patients?


An efficient method of license plate location. License plate location is an important stage in vehicle license plate recognition for automated transport system. This paper presents a real time and robust method of license plate location. License plate area contains rich edge and texture information. We first extract out the vertical edges of the car image using image enhancement and Sobel operator, then remove most of the background and noise edges by an effective algorithm, and finally search the plate region by a rectangle window in the residual edge image and segment the plate out from the original car image. Experimental results demonstrate the great robustness and efficiency of our method. 2005 Elsevier B.V. All rights reserved.

Question: What is license plate recognition?


Large Language Models in Machine Translation. This paper reports on the benefits of largescale statistical language modeling in machine translation. A distributed infrastructure is proposed which we use to train on up to 2 trillion tokens, resulting in language models having up to 300 billion n-grams. It is capable of providing smoothed probabilities for fast, single-pass decoding. We introduce a new smoothing method, dubbed Stupid Backoff, that is inexpensive to train on large data sets and approaches the quality of Kneser-Ney Smoothing as the amount of training data increases.

Question: What is the size of the language model?


The GUM corpus: creating multilayer resources in the classroom. This paper presents the methodology, design principles and detailed evaluation of a new freely available multilayer corpus, collected and edited via classroom annotation using collaborative software. After briefly discussing corpus design for open, extensible corpora, five classroom annotation projects are presented, covering structural markup in TEI XML, multiple part of speech tagging, constituent and dependency parsing, information structural and coreference annotation, and Rhetorical Structure Theory analysis. Layers are inspected for annotation quality and together they coalesce to form a richly annotated corpus that can be used to study the interactions between different levels of linguistic description. The evaluation gives an indication of the expected quality of a corpus created by students with relatively little training. A multifactorial example study on lexical NP coreference likelihood is also presented, which illustrates some applications of the corpus. The results of this project show that high quality, richly annotated resources can be created effectively as part of a linguistics curriculum, opening new possibilities not just for research, but also for corpora in linguistics pedagogy.

Question: What is a multilayer corpus?


Audio-based context recognition. The aim of this paper is to investigate the feasibility of an audio-based context recognition system. Here, context recognition refers to the automatic classification of the context or an environment around a device. A system is developed and compared to the accuracy of human listeners in the same task. Particular emphasis is placed on the computational complexity of the methods, since the application is of particular interest in resource-constrained portable devices. Simplistic low-dimensional feature vectors are evaluated against more standard spectral features. Using discriminative training, competitive recognition accuracies are achieved with very low-order hidden Markov models (1-3 Gaussian components). Slight improvement in recognition accuracy is observed when linear data-driven feature transformations are applied to mel-cepstral features. The recognition rate of the system as a function of the test sequence length appears to converge only after about 30 to 60 s. Some degree of accuracy can be achieved even with less than 1-s test sequence lengths. The average reaction time of the human listeners was 14 s, i.e., somewhat smaller, but of the same order as that of the system. The average recognition accuracy of the system was 58% against 69%, obtained in the listening tests in recognizing between 24 everyday contexts. The accuracies in recognizing six high-level classes were 82% for the system and 88% for the subjects.

Question: What is the average reaction time of a human listener?


Attentive Explanations: Justifying Decisions and Pointing to the Evidence. Deep models are the defacto standard in visual decision problems due to their impressive performance on a wide array of visual tasks. However, they are frequently seen as opaque and are unable to explain their decisions. In contrast, humans can justify their decisions with natural language and point to the evidence in the visual world which supports their decisions. We propose a method which incorporates a novel explanation attention mechanism; our model is trained using textual rationals, and infers latent attention to visually ground explanations. We collect two novel datasets in domains where it is interesting and challenging to explain decisions. First, we extend the visual question answering task to not only provide an answer but also visual and natural language explanations for the answer. Second, we focus on explaining human activities in a contemporary activity recognition dataset. We extensively evaluate our model, both on the justification and pointing tasks, by comparing it to prior models and ablations using both automatic and human evaluations.

Question: What is the difference between a deep model and a human?


Generative Attention Model with Adversarial Self-learning for Visual Question Answering. Visual question answering (VQA) is arguably one of the most challenging multimodal understanding problems as it requires reasoning and deep understanding of the image, the question, and their semantic relationship. Existing VQA methods heavily rely on attention mechanisms to semantically relate the question words with the image contents for answering the related questions. However, most of the attention models are simplified as a linear transformation, over the multimodal representation, which we argue is insufficient for capturing the complex nature of the multimodal data. In this paper we propose a novel generative attention model obtained by adversarial self-learning. The proposed adversarial attention produces more diverse visual attention maps and it is able to generalize the attention better to new questions. The experiments show the proposed adversarial attention leads to a state-of-the-art VQA model on the two VQA benchmark datasets, VQA v1.0 and v2.0.

Question: What is the state-of-the-art VQA model?


Hemispheric asymmetry reduction in older adults: the HAROLD model.. A model of the effects of aging on brain activity during cognitive performance is introduced. The model is called HAROLD (hemispheric asymmetry reduction in older adults), and it states that, under similar circumstances, prefrontal activity during cognitive performances tends to be less lateralized in older adults than in younger adults. The model is supported by functional neuroimaging and other evidence in the domains of episodic memory, semantic memory, working memory, perception, and inhibitory control. Age-related hemispheric asymmetry reductions may have a compensatory function or they may reflect a dedifferentiation process. They may have a cognitive or neural origin, and they may reflect regional or network mechanisms. The HAROLD model is a cognitive neuroscience model that integrates ideas and findings from psychology and neuroscience of aging.

Question: What is the HAROLD model?


A Bottom-Up Approach to Sentence Ordering for Multi-Document Summarization. Ordering information is a difficult but important task for applications generating naturallanguage texts such as multi-document summarization, question answering, and conceptto-text generation. In multi-document summarization, information is selected from a set of source documents. However, improper ordering of information in a summary can confuse the reader and deteriorate the readability of the summary. Therefore, it is vital to properly order the information in multi-document summarization. We present a bottom-up approach to arrange sentences extracted for multi-document summarization. To capture the association and order of two textual segments (e.g. sentences), we define four criteria: chronology, topical-closeness, precedence, and succession. These criteria are integrated into a criterion by a supervised learning approach. We repeatedly concatenate two textual segments into one segment based on the criterion, until we obtain the overall segment with all sentences arranged. We evaluate the sentence orderings produced by the proposed method and numerous baselines using subjective gradings as well as automatic evaluation measures. We introduce the average continuity, an automatic evaluation measure of sentence ordering in a summary, and investigate its appropriateness for this task.

Question: How to order sentences in a summary?


Control of VSC connected to the grid through LCL-filter to achieve balanced currents. Grid-connected voltage source converters (VSCs) are the heart of many applications with power quality concerns due to their reactive power controllability. However, the major drawback is their sensitivity to grid disturbances. Moreover, when VSCs are used in DG applications, voltage unbalance may be intolerant. The current protection may trip due to current unbalance or due to overcurrent. In this paper, a vector current controller for VSC connected to the grid through LCL-filter is developed with the main focus on producing symmetrical and balanced currents in case of unbalanced voltage dips. Implementing this controller helps the VSC system not to trip during voltage dips.

Question: How to control the current of a VSC connected to the grid through LCL-filter?


Learning Structured Natural Language Representations for Semantic Parsing. We introduce a neural semantic parser which is interpretable and scalable. Our model converts natural language utterances to intermediate, domain-general natural language representations in the form of predicate-argument structures, which are induced with a transition system and subsequently mapped to target domains. The semantic parser is trained end-to-end using annotated logical forms or their denotations. We achieve the state of the art on SPADES and GRAPHQUESTIONS and obtain competitive results on GEOQUERY and WEBQUESTIONS. The induced predicate-argument structures shed light on the types of representations useful for semantic parsing and how these are different from linguistically motivated ones.1

Question: What is the state of the art on SPADES and GRAPHQUESTIONS?


Improving privacy and security in multi-authority attribute-based encryption. Attribute based encryption (ABE) [13] determines decryption ability based on a user's attributes. In a multi-authority ABE scheme, multiple attribute-authorities monitor different sets of attributes and issue corresponding decryption keys to users, and encryptors can require that a user obtain keys for appropriate attributes from each authority before decrypting a message. Chase [5] gave a multi-authority ABE scheme using the concepts of a trusted central authority (CA) and global identifiers (GID). However, the CA in that construction has the power to decrypt every ciphertext, which seems somehow contradictory to the original goal of distributing control over many potentially untrusted authorities. Moreover, in that construction, the use of a consistent GID allowed the authorities to combine their information to build a full profile with all of a user's attributes, which unnecessarily compromises the privacy of the user. In this paper, we propose a solution which removes the trusted central authority, and protects the users' privacy by preventing the authorities from pooling their information on particular users, thus making ABE more usable in practice.

Question: What is the difference between a trusted central authority and a global identifier?


The ASTOOT Approach to Testing Object-Oriented Programs. This article describes a new approach to the unit testing of object-oriented programs, a set of tools based on this approach, and two case studies. In this approach, each test case consists of a tuple of sequences of messages, along with tags indicating whether these sequences should put objects of the class under test into equivalent states and/or return objects that are in equivalent states. Tests are executed by sending the sequences to objects of the class under test, then invoking a user-supplied equivalence-checking mechanism. This approach allows for substantial automation of many aspects of testing, including test case generation, test driver generation, test execution, and test checking. Experimental prototypes of tools for test generation and test execution are described. The test generation tool requires the availability of an algebraic specification of the abstract data type being tested, but the test execution tool can be used when no formal specification is available. Using the test execution tools, case studies involving execution of tens of thousands of test cases, with various sequence lengths, parameters, and combinations of operations were performed. The relationships among likelihood of detecting an error and sequence length, range of parameters, and relative frequency of various operations were investigated for priority queue and sorted-list implementations having subtle errors. In each case, long sequences tended to be more likely to detect the error, provided that the range of parameters was sufficiently large and likelihood of detecting an error tended to increase up to a threshold value as the parameter range increased.

Question: What is the ASTOOT approach to testing object-oriented programs?


Structured Prediction of Sequences and Trees using Infinite Contexts. Linguistic structures exhibit a rich array of global phenomena, however commonly used Markov models are unable to adequately describe these phenomena due to their strong locality assumptions. We propose a novel hierarchical model for structured prediction over sequences and trees which exploits global context by conditioning each generation decision on an unbounded context of prior decisions. This builds on the success of Markov models but without imposing a fixed bound in order to better represent global phenomena. To facilitate learning of this large and unbounded model, we use a hierarchical PitmanYor process prior which provides a recursive form of smoothing. We propose prediction algorithms based on A* and Markov Chain Monte Carlo sampling. Empirical results demonstrate the potential of our model compared to baseline finite-context Markov models on part-of-speech tagging and syntactic parsing.

Question: What is a Markov model?


Defining clusters from a hierarchical cluster tree: the Dynamic Tree Cut package for R. SUMMARY Hierarchical clustering is a widely used method for detecting clusters in genomic data. Clusters are defined by cutting branches off the dendrogram. A common but inflexible method uses a constant height cutoff value; this method exhibits suboptimal performance on complicated dendrograms. We present the Dynamic Tree Cut R package that implements novel dynamic branch cutting methods for detecting clusters in a dendrogram depending on their shape. Compared to the constant height cutoff method, our techniques offer the following advantages: (1) they are capable of identifying nested clusters; (2) they are flexible-cluster shape parameters can be tuned to suit the application at hand; (3) they are suitable for automation; and (4) they can optionally combine the advantages of hierarchical clustering and partitioning around medoids, giving better detection of outliers. We illustrate the use of these methods by applying them to protein-protein interaction network data and to a simulated gene expression data set.   AVAILABILITY The Dynamic Tree Cut method is implemented in an R package available at http://www.genetics.ucla.edu/labs/horvath/CoexpressionNetwork/BranchCutting.

Question: How to define clusters from a hierarchical cluster tree?


A novel wavelet transform technique for on-line partial discharge measurements. 1. WT de-noising algorithm. Medium and high voltage power cables are widely used in the electrical industry with substantial growth over the last 20-30 years ago, particular in the use of XLPE insulated systems. Ageing of the cable insulation is becoming an increasing problem that requires development of reliable methods for on-line condition assessment. For insulation condition assessment of MV and HV cables, partial discharge (PD) monitoring is one of the most effective techniques. However on-site and on-line PD measurements are affected by electromagnetic interference (EMI) that makes sensitive PD detection very difficult, if not impossible. This paper describes implementation of wavelet transform techniques to reject noise from on-line partial discharge measurements on cables. A new wavelet threshold determination method is proposed with the technique. With implementation of this novel de-noising method, PD measurement sensitivity has been greatly improved. In addition, a full AC cycle data recovery can be achieved instead of focusing only on recovering individual PD pulses. Other wavelet threshold de-noising methods are discussed and examined under a noisy environment to compare their performance with the new method proposed here. The method described here has been found to be superior to the other wavelet-based methods

Question: What is a wavelet transform?


Server virtualization architecture and implementation. Virtual machine technology, or virtualization, is gaining momentum in the information technology community. While virtual machines are not a new concept, recent advances in hardware and software technology have brought virtualization to the forefront of IT management. Stability, cost savings, and manageability are among the reasons for the recent rise of virtualization. Virtual machine solutions can be classified by hardware, software, and operating system/containers. From its inception on the mainframe to distributed servers on x86, the virtual machine has matured and will play an increasing role in systems management.

Question: What is the difference between virtualization and virtual machine?


Fields of Experts: a framework for learning image priors. We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The approach extends traditional Markov random field (MRF) models by learning potential functions over extended pixel neighborhoods. Field potentials are modeled using a Products-of-Experts framework that exploits nonlinear functions of many linear filter responses. In contrast to previous MRF approaches all parameters, including the linear filters themselves, are learned from training data. We demonstrate the capabilities of this Field of Experts model with two example applications, image denoising and image inpainting, which are implemented using a simple, approximate inference scheme. While the model is trained on a generic image database and is not tuned toward a specific application, we obtain results that compete with and even outperform specialized techniques.

Question: What is a field of experts?


New Fast and Accurate Jacobi SVD Algorithm. I. This paper is the result of contrived efforts to break the barrier between numerical accuracy and run time efficiency in computing the fundamental decomposition of numerical linear algebra – the singular value decomposition (SVD) of a general dense matrix. It is an unfortunate fact that the numerically most accurate one–sided Jacobi SVD algorithm is several times slower than generally less accurate bidiagonalization based methods such as the QR or the divide and conquer algorithm. Despite its sound numerical qualities, the Jacobi SVD is not included in the state of the art matrix computation libraries and it is even considered obsolete by some leading researches. Our quest for a highly accurate and efficient SVD algorithm has led us to a new, superior variant of the Jacobi algorithm. The new algorithm has inherited all good high accuracy properties, and it outperforms not only the best implementations of the one–sided Jacobi algorithm but also the QR algorithm. Moreover, it seems that the potential of the new approach is yet to be fully exploited.

Question: What is the new fast and accurate Jacobi SVD algorithm?


Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit. This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal. This is a massive improvement over previous results, which require O(m2) measurements. The new results for OMP are comparable with recent results for another approach called basis pursuit (BP). In some settings, the OMP algorithm is faster and easier to implement, so it is an attractive alternative to BP for signal recovery problems.

Question: What is the difference between OMP and BP?


Imbalanced Protein Data Classification Using Ensemble FTM-SVM. Classification of protein sequences into functional and structural families based on machine learning methods is a hot research topic in machine learning and Bioinformatics. In fact, the underlying protein classification problem is a huge multiclass problem. Generally, the multiclass problem can be reduced to a set of binary classification problems. The protein in one class are seen as positive examples while those outside the class are seen as negative examples. However, the class imbalance problem will arise in this case because the number of protein in one class is usually much smaller than that of the protein outside the class. To handle the challenge, we propose a novel framework to classify the protein. We firstly use free scores (FS) to perform feature extraction for protein; then, the inverse random under sampling (IRUS) is used to create a large number of distinct training sets; next, we use a new ensemble approach to combine these distinct training sets with a new fuzzy total margin support vector machine (FTM-SVM) that we have constructed. we call the novel ensemble classifier as ensemble fuzzy total margin support vector machine (EnFTM-SVM). We then give a full description of our method, including the details of its derivation. Finally, experimental results on fourteen benchmark protein data sets indicate that the proposed method outperforms many state-of-the-art protein classifying methods.

Question: How to classify protein sequences into functional and structural families based on machine learning methods?


SIGNet: Scalable Embeddings for Signed Networks. Recent successes in word embedding and document embedding have motivated researchers to explore similar representations for networks and to use such representations for tasks such as edge prediction, node label prediction, and community detection. Existing methods are largely focused on finding distributed representations for unsigned networks and are unable to discover embeddings that respect polarities inherent in edges. We propose SIGNet, a fast scalable embedding method suitable for signed networks. Our proposed objective function aims to carefully model the social structure implicit in signed networks by reinforcing the principles of social balance theory. Our method builds upon the traditional word2vec family of embedding approaches but we propose a new targeted node sampling strategy to maintain structural balance in higher-order neighborhoods. We demonstrate the superiority of SIGNet over state-of-the-art methods proposed for both signed and unsigned networks on several real world datasets from different domains. In particular, SIGNet offers an approach to generate a richer vocabulary of features of signed networks to support representation and reasoning.

Question: What is the difference between a word embedding and a document embedding?


Influence of emotional engagement and habituation on exposure therapy for PTSD.. This study examined 2 process variables, emotional engagement and habituation, and outcome of exposure therapy for posttraumatic stress disorder. Thirty-seven female assault victims received treatment that involved repeated imaginal reliving of their trauma, and rated their distress at 10-min intervals. The average distress levels during each of 6 exposure sessions were submitted to a cluster analysis. Three distinct groups of clients with different patterns of distress were found: high initial engagement and gradual habituation between sessions, high initial engagement without habituation, and moderate initial engagement without habituation. Clients with the 1st distress pattern improved more in treatment than the other clients. The results are discussed within the framework of emotional processing theory, emphasizing the crucial role of emotional engagement and habituation in exposure therapy.

Question: What is the difference between emotional engagement and habituation?


An examination of the celebrity endorsements and online customer reviews influence female consumers' shopping behavior. 0747-5632/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.chb.2012.08.005 ⇑ Corresponding author. Tel.: +886 2 2737 6764; fa E-mail address: melodyps@gmail.com (P.-S. Wei). The goal of this study is to compare the influence of celebrity endorsements to online customer reviews on female shopping behavior. Based on AIDMA and AISAS models, we design an experiment to investigate consumer responses to search good and experience good respectively. The results revealed that search good (shoes) endorsed by a celebrity in an advertisement evoked significantly more attention, desire, and action from the consumer than did an online customer review. We also found that online customer reviews emerged higher than the celebrity endorsement on the scale of participants' memory, search and share attitudes toward the experience good (toner). Implications for marketers as well as suggestions for future research are discussed. 2012 Elsevier Ltd. All rights reserved.

Question: How to compare the influence of celebrity endorsements to online customer reviews on female shopping behavior?


Deep Biaffine Attention for Neural Dependency Parsing. Andor, D., Alberti, C., Weiss, D., Severyn, A., Presta, A., Ganchev, K., Petrov, S., and Collins, M. (2016). Globally normalized transition-based neural networks. In Association for Computational Linguistics. Ballesteros, M., Goldberg, Y., Dyer, C., and Smith, N. A. (2016). Training with exploration improves a greedy stack-LSTM parser. Proceedings of the conference on empirical methods in natural language processing. Chen, D. and Manning, C. D. (2014). A fast and accurate dependency parser using neural networks. In Proceedings of the conference on empirical methods in natural language processing, pages 740–750. Cheng, H., Fang, H., He, X., Gao, J., and Deng, L. (2016). Bi-directional attention with agreement for dependency parsing. arXiv preprint arXiv:1608.02076. Hashimoto, K., Xiong, C., Tsuruoka, Y., and Socher, R. (2016). A joint many-task model: Growing a neural network for multiple nlp tasks. arXiv preprint arXiv:1611.01587. Kiperwasser, E. and Goldberg, Y. (2016). Simple and accurate dependency parsing using bidirectional LSTM feature representations. Transactions of the Association for Computational Linguistics, 4:313–327. Kuncoro, A., Ballesteros, M., Kong, L., Dyer, C., Neubig, G., and Smith, N. A. (2016). What do recurrent neural network grammars learn about syntax? CoRR, abs/1611.05774. McDonald, R. T. and Pereira, F. C. (2006). Online learning of approximate dependency parsing algorithms. In EACL. Nivre, J., Hall, J., and Nilsson, J. (2006). Maltparser: A data-driven parser-generator for dependency parsing. In Proceedings of LREC, volume 6, pages 2216–2219.

Question: What is the difference between a neural network grammar and a recurrent neural network grammar?


Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study. Influence maximization (IM) on social networks is one of the most active areas of research in computer science. While various IM techniques proposed over the last decade have definitely enriched the field, unfortunately, experimental reports on existing techniques fall short in validity and integrity since many comparisons are not based on a common platform or merely discussed in theory. In this paper, we perform an in-depth benchmarking study of IM techniques on social networks. Specifically, we design a benchmarking platform, which enables us to evaluate and compare the existing techniques systematically and thoroughly under identical experimental conditions. Our benchmarking results analyze and diagnose the inherent deficiencies of the existing approaches and surface the open challenges in IM even after a decade of research. More fundamentally, we unearth and debunk a series of myths and establish that there is no single state-of-the-art technique in IM. At best, a technique is the state of the art in only one aspect.

Question: What is the state of the art in influence maximization?


A Functional Dynamic Boltzmann Machine. Dynamic Boltzmann machines (DyBMs) are recently developed generative models of a time series. They are designed to learn a time series by efficient online learning algorithms, whilst taking long-term dependencies into account with help of eligibility traces, recursively updatable memory units storing descriptive statistics of all the past data. The current DyBMs assume a finitedimensional time series and cannot be applied to a functional time series, in which the dimension goes to infinity (e.g., spatiotemporal data on a continuous space). In this paper, we present a functional dynamic Boltzmann machine (F-DyBM) as a generative model of a functional time series. A technical challenge is to devise an online learning algorithm with which F-DyBM, consisting of functions and integrals, can learn a functional time series using only finite observations of it. We rise to the above challenge by combining a kernel-based function approximation method along with a statistical interpolation method and finally derive closed-form update rules. We design numerical experiments to empirically confirm the effectiveness of our solutions. The experimental results demonstrate consistent error reductions as compared to baseline methods, from which we conclude the effectiveness of F-DyBM for functional time series prediction.

Question: What is a functional dynamic Boltzmann machine?


AmbiguityVis: Visualization of Ambiguity in Graph Layouts. Node-link diagrams provide an intuitive way to explore networks and have inspired a large number of automated graph layout strategies that optimize aesthetic criteria. However, any particular drawing approach cannot fully satisfy all these criteria simultaneously, producing drawings with visual ambiguities that can impede the understanding of network structure. To bring attention to these potentially problematic areas present in the drawing, this paper presents a technique that highlights common types of visual ambiguities: ambiguous spatial relationships between nodes and edges, visual overlap between community structures, and ambiguity in edge bundling and metanodes. Metrics, including newly proposed metrics for abnormal edge lengths, visual overlap in community structures and node/edge aggregation, are proposed to quantify areas of ambiguity in the drawing. These metrics and others are then displayed using a heatmap-based visualization that provides visual feedback to developers of graph drawing and visualization approaches, allowing them to quickly identify misleading areas. The novel metrics and the heatmap-based visualization allow a user to explore ambiguities in graph layouts from multiple perspectives in order to make reasonable graph layout choices. The effectiveness of the technique is demonstrated through case studies and expert reviews.

Question: What is a node-link diagram?


Handwritten document image segmentation into text lines and words. Article history: Received 22 July 2008 Received in revised form 23 February 2009 Accepted 14 May 2009

Question: How to segment handwritten document into text lines and words?


Efficient frame-sequential label propagation for video object segmentation. In this work, we present an approach for segmenting objects in videos taken in complex scenes. It propagates initial object label through the entire video by a frame-sequential manner where the initial label is usually given by the user. The proposed method has several contributions which make the propagation much more robust and accurate than other methods. First, a novel supervised motion estimation algorithm is employed between each pair of neighboring frames, by which a predicted shape model can be warped in order to segment the similar color around object boundary. Second, unlike previous methods with fixed modeling range, we design a novel range-adaptive appearance model to handle the tough problem of occlusion. Last, the paper gives a reasonable framework based on GraphCut algorithm for obtaining the final label of the object by combining the clues from both appearance and motion. In the experiments, the proposed approach is evaluated qualitatively and quantitatively with some recent methods to show it achieves state-of-art results on multiple videos from benchmark data sets.

Question: What is the difference between the proposed method and other methods?


Development of Self Balance Transporter : A Segway. This paper deals with constructing the vehicle which is fully functional to transport the one person only and movement of it is achieve by naturally. Forward and backwards motion is achieved by leaning forwards and backwards. Segway uses handlebar for turning purpose. In Segway technique uses principle of inverted pendulum in which it keeps an angle of Zero degrees with vertical at all times. The rider motion enables this technique to accelerate, brake or steer the vehicle, for this it uses Gyroscopic Sensor and it is Eco-friendly and non polluting.

Question: How does the Segway work?


Object Constraint Language (OCL): A Definitive Guide. The Object Constraint Language (OCL) started as a complement of the UML notation with the goal to overcome the limitations of UML (and in general, any graphical notation) in terms of precisely specifying detailed aspects of a system design. Since then, OCL has become a key component of any model-driven engineering (MDE) technique as the default language for expressing all kinds of (meta)model query, manipulation and specification requirements. Among many other applications, OCL is frequently used to express model transformations (as part of the source and target patterns of transformation rules), well-formedness rules (as part of the definition of new domain-specific languages), or code-generation templates (as a way to express the generation patterns and rules). This chapter pretends to provide a comprehensive view of this language, its many applications and available tool support as well as the latest research developments and open challenges around it.

Question: What is the object constraint language?


Creating Social Contagion Through Viral Product Design: A Randomized Trial of Peer Influence in Networks. We examine how firms can create word-of-mouth peer influence and social contagion by designing viral features into their products and marketing campaigns. Word-of-mouth (WOM) is generally considered to be more effective at promoting product contagion when it is personalized and active. Unfortunately, the relative effectiveness of different viral features has not been quantified, nor has their effectiveness been definitively established, largely because of difficulties surrounding econometric identification of endogenous peer effects. We therefore designed a randomized field experiment on a popular social networking website to test the effectiveness of a range of viral messaging capabilities in creating peer influence and social contagion among the 1.4 million friends of 9,687 experimental users. Overall, we find that viral product design features can indeed generate econometrically identifiable peer influence and social contagion effects. More surprisingly, we find that passive-broadcast viral messaging generates a 246% increase in local peer influence and social contagion effects, while adding active-personalized viral messaging only generates an additional 98% increase in contagion. Although active-personalized messaging is more effective in encouraging adoption per message and is correlated with more user engagement and sustained product use, passivebroadcast messaging is used more often enough to eclipse those benefits, generating more total peer adoption in the network. In addition to estimating the effects of viral product design on social contagion and product diffusion, our work also provides a model for how randomized trials can be used to identify peer influence effects in networks.

Question: How can we create social contagion through viral product design?


Unifying Logical and Statistical AI. Intelligent agents must be able to handle the complexity and uncertainty of the real world. Logical AI has focused mainly on the former, and statistical AI on the latter. Markov logic combines the two by attaching weights to first-order formulas and viewing them as templates for features of Markov networks. Inference algorithms for Markov logic draw on ideas from satisfiability, Markov chain Monte Carlo and knowledge-based model construction. Learning algorithms are based on the voted perceptron, pseudo-likelihood and inductive logic programming. Markov logic has been successfully applied to a wide variety of problems in natural language understanding, vision, computational biology, social networks and others, and is the basis of the open-source Alchemy system.

Question: What is Markov logic?


Apple disease classification using color, texture and shape features from images. The presence of diseases in several kinds of fruits is the major factor of production and the economic degradation of the agricultural industry worldwide. An approach for the apple disease classification using color, texture and shape based features is investigated and experimentally verified in this paper. The primary steps of the introduced image processing based method is as follows; 1) infected fruit part detection is done with the help of K-Means clustering method, 2) color, texture and shape based features are computed over the segmented image and combined to form the single descriptor, and 3) multi-class Support Vector Machine is used to classify the apples into one of the infected or healthy categories. Apple fruit is taken as the test case in this study with 3 categories of diseases, namely blotch, rot and scab as well as healthy apples. The experimentation points out that the introduced method based is better as compared to the individual features. It also point out that shape feature is not better suited for this purpose.

Question: What is the apple disease classification using color, texture and shape based features?


What a Nasty Day: Exploring Mood-Weather Relationship from Twitter. While it has long been believed in psychology that weather somehow influences human's mood, the debates have been going on for decades about how they are correlated. In this paper, we try to study this long-lasting topic by harnessing a new source of data compared from traditional psychological researches: Twitter. We analyze 2 years' twitter data collected by twitter API which amounts to 10% of all postings and try to reveal the correlations between multiple dimensional structure of human mood with meteorological effects. Some of our findings confirm existing hypotheses, while others contradict them. We are hopeful that our approach, along with the new data source, can shed on the long-going debates on weather-mood correlation.

Question: What is the relationship between weather and mood?


A Novel CPW Fed Multiband Circular Microstrip Patch Antenna for Wireless Applications. In this paper, a novel design of coplanar micro strip patch antenna is presented for ultra wideband (UWB) and smart grid applications. It is designed on a dielectric substrate and fed by a coplanar wave guide (CPW). Micro strip patch antenna consists of a circular patch with an elliptical shaped eye opening in the center to provide multiband operations. The antenna has wide bandwidth of 5 GHz between 10.8-15.8 GHz and 3 GHz between 5.8-8.8 GHz, high return loss of -34 dB at 3.9 GHz and -29 dB at 6.8 GHz with satisfactory radiation properties. The parameters that affect the performance of the antenna in terms of its frequency domain characteristics are investigated. The antenna design has been simulated on Ansoft's High Frequency Structure Simulator (HFSS). It is a compact design of 47 × 47 mm2 area on Rogers RO3003 (tm) substrate with dielectric constant of 3 and thickness of 1.6 mm. The simulated antenna has three operating frequency bands at 2.82, 5.82-8.8, 10.8-15.8 GHz and shows the band-notch characteristic in the UWB band to avoid interferences, which is caused by WLAN at 5.15-5.825 GHz and Wi-MAX at 5.25-5.85 GHz. The designed antenna structure with 5.68 dBi gain is planar, simple and compact, hence it can be easily embedded in wireless communication systems and integrated with microwave circuitry for low manufacturing cost.

Question: What is the difference between a coplanar waveguide and a microstrip?


Static and Moving Object Detection Using Flux Tensor with Split Gaussian Models. In this paper, we present a moving object detection system named Flux Tensor with Split Gaussian models (FTSG) that exploits the benefits of fusing a motion computation method based on spatio-temporal tensor formulation, a novel foreground and background modeling scheme, and a multi-cue appearance comparison. This hybrid system can handle challenges such as shadows, illumination changes, dynamic background, stopped and removed objects. Extensive testing performed on the CVPR 2014 Change Detection benchmark dataset shows that FTSG outperforms state-of-the-art methods.

Question: What is a hybrid system?


HMAC: Keyed-Hashing for Message Authentication. This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. Abstract This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative cryptographic hash function, e.g., MD5, SHA-1, in combination with a secret shared key. The cryptographic strength of HMAC depends on the properties of the underlying hash function.

Question: What is HMAC?


Cloud Computing: A Review. Cloud computing is a development of parallel, distributed and grid computing which provides computing potential as a service to clients rather than a product. Clients can access software resources, valuable information and hardware devices as a subscribed and monitored service over a network through cloud computing.Due to large number of requests for access to resources and service level agreements between cloud service providers and clients, few burning issues in cloud environment like QoS, Power, Privacy and Security, VM Migration, Resource Allocation and Scheduling need attention of research community.Resource allocation among multiple clients has to be ensured as per service level agreements. Several techniques have been invented and tested by research community for generation of optimal schedules in cloud computing. A few promising approaches like Metaheuristics, Greedy, Heuristic technique and Genetic are applied for task scheduling in several parallel and distributed systems. This paper presents a review on scheduling proposals in cloud environment.

Question: What is cloud computing?


PhoneyC: A Virtual Client Honeypot. The number of client-side attacks has grown significantly in the past few years, shifting focus away from defendable positions to a broad, poorly defended space filled with vulnerable clients. Just as honeypots enabled deep research into server-side attacks, honeyclients can permit the deep study of client-side attacks. A complement to honeypots, a honeyclient is a tool designed to mimic the behavior of a userdriven network client application, such as a web browser, and be exploited by an attacker's content. These systems are instrumented to discover what happened and how. This paper presents PhoneyC, a honeyclient tool that can provide visibility into new and complex client-side attacks. PhoneyC is a virtual honeyclient, meaning it is not a real application but rather an emulated client. By using dynamic analysis, PhoneyC is able to remove the obfuscation from many malicious pages. Furthermore, PhoneyC emulates specific vulnerabilities to pinpoint the attack vector. PhoneyC is a modular framework that enables the study of malicious HTTP pages and understands modern vulnerabilities and attacker techniques.

Question: What is a honeyclient?


Interworking of DSRC and Cellular Network Technologies for V2X Communications: A Survey. Vehicle-to-anything (V2X) communications refer to information exchange between a vehicle and various elements of the intelligent transportation system (ITS), including other vehicles, pedestrians, Internet gateways, and transport infrastructure (such as traffic lights and signs). The technology has a great potential of enabling a variety of novel applications for road safety, passenger infotainment, car manufacturer services, and vehicle traffic optimization. Today, V2X communications is based on one of two main technologies: dedicated short-range communications (DSRC) and cellular networks. However, in the near future, it is not expected that a single technology can support such a variety of expected V2X applications for a large number of vehicles. Hence, interworking between DSRC and cellular network technologies for efficient V2X communications is proposed. This paper surveys potential DSRC and cellular interworking solutions for efficient V2X communications. First, we highlight the limitations of each technology in supporting V2X applications. Then, we review potential DSRC-cellular hybrid architectures, together with the main interworking challenges resulting from vehicle mobility, such as vertical handover and network selection issues. In addition, we provide an overview of the global DSRC standards, the existing V2X research and development platforms, and the V2X products already adopted and deployed in vehicles by car manufactures, as an attempt to align academic research with automotive industrial activities. Finally, we suggest some open research issues for future V2X communications based on the interworking of DSRC and cellular network technologies.

Question: What is the difference between DSRC and cellular network technologies?


The minds of gods: A comparative study of supernatural agency. The present work is the first study to systematically compare the minds of gods by examining some of the intuitive processes that guide how people reason about them. By examining the Christian god and the spirit-masters of the Tyva Republic, it first confirms that the consensus view of the Christian god's mind is one of omniscience with acute concern for interpersonal social behavior (i.e., moral behaviors) and that Tyvan spirit-masters are not as readily attributed with knowledge or concern of moral information. Then, it reports evidence of a moralization bias of gods' minds; American Christians who believe that God is omniscient rate God as more knowledgeable of moral behaviors than nonmoral information. Additionally, Tyvans who do not readily report pro- or antisocial behavior among the things that spirit-masters care about will nevertheless rate spirit-masters' knowledge and concern of moral information higher than nonmoral information. However, this knowledge is distributed spatially; the farther away from spirits' place of governance a moral behavior takes place, the less they know and care about it. Finally, the wider the breadth of knowledge Tyvans attribute to spirit-masters, the more they attribute moral concern for behaviors that transpire beyond their jurisdiction. These results further demonstrate that there is a significant gulf between expressed beliefs and intuitive religious cognition and provides evidence for a moralization bias of gods' minds.

Question: What is the difference between omniscience and moral concern?


Domain Adaptation for Statistical Classifiers. The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applications, the "in-domain" test data is drawn from a distribution that is related, but not identical, to the "out-of-domain" distribution of the training data. We consider the common case in which labeled out-of-domain data is plentiful, but labeled in-domain data is scarce. We introduce a statistical formulation of this problem in terms of a simple mixture model and present an instantiation of this framework to maximum entropy classifiers and their linear chain counterparts. We present efficient inference algorithms for this special case based on the technique of conditional expectation maximization. Our experimental results show that our approach leads to improved performance on three real world tasks on four different data sets from the natural language processing domain.

Question: What is the difference between maximum entropy classifiers and linear chain classifiers?


Calf stretching in correct alignment. An important consideration in plantar fasciopathies.. Stretching of the calf muscles is important in the treatment of plantar fasciopathy. In order to correctly stretch the calf muscles without strain on the plantar fascia the correct alignment of the lower limb should be maintained. A clinical method of achieving this is presented along with a practical guide to assisting the patient to become familiar with correct lower limb alignment.

Question: How to stretch calf muscles


Efficient Computation of PageRank. This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Running-time measurements on various memory configurations are presented for PageRank computation over the 24-million-page Stanford WebBase archive. We discuss several methods for analyzing the convergence of PageRank based on the induced ordering of the pages. We present convergence results helpful for determining the number of iterations necessary to achieve a useful PageRank assignment, both in the absence and presence of search queries.

Question: How to compute PageRank?


IoT in Agriculture: Designing a Europe-Wide Large-Scale Pilot. The technologies associated with the Internet of Things have great potential for application in the domain of food and agriculture, especially in view of the societal and environmental challenges faced by this sector. From farm to fork, IoT technologies could transform the sector, contributing to food safety, and the reduction of agricultural inputs and food waste. A major step toward greater uptake of these technologies will be the execution of IoT-based large-scale pilots (LSPs) in the entire supply chain. This article outlines the challenges and constraints that an LSP deployment of IoT in this domain must consider. Sectoral and technological challenges are described in order to identify a set of technological and agrifood requirements. An architecture based on a system of systems approach is briefly presented, the importance of addressing the interoperability challenges faced by this sector is highlighted, and we elaborate on requirements for new business models, security, privacy, and data governance. A description of the technologies and solutions involved in designing pilots for four agrifood domains (dairy, fruit, arable, meat and vegetable supply chain) is eventually provided. In conclusion, it is noted that for IoT to be successful in this domain, a significant change of culture is needed.

Question: What is the largest food company in the world?


Impact of mosquito gene drive on malaria elimination in a computational model with explicit spatial and temporal dynamics.. The renewed effort to eliminate malaria and permanently remove its tremendous burden highlights questions of what combination of tools would be sufficient in various settings and what new tools need to be developed. Gene drive mosquitoes constitute a promising set of tools, with multiple different possible approaches including population replacement with introduced genes limiting malaria transmission, driving-Y chromosomes to collapse a mosquito population, and gene drive disrupting a fertility gene and thereby achieving population suppression or collapse. Each of these approaches has had recent success and advances under laboratory conditions, raising the urgency for understanding how each could be deployed in the real world and the potential impacts of each. New analyses are needed as existing models of gene drive primarily focus on nonseasonal or nonspatial dynamics. We use a mechanistic, spatially explicit, stochastic, individual-based mathematical model to simulate each gene drive approach in a variety of sub-Saharan African settings. Each approach exhibits a broad region of gene construct parameter space with successful elimination of malaria transmission due to the targeted vector species. The introduction of realistic seasonality in vector population dynamics facilitates gene drive success compared with nonseasonal analyses. Spatial simulations illustrate constraints on release timing, frequency, and spatial density in the most challenging settings for construct success. Within its parameter space for success, each gene drive approach provides a tool for malaria elimination unlike anything presently available. Provided potential barriers to success are surmounted, each achieves high efficacy at reducing transmission potential and lower delivery requirements in logistically challenged settings.

Question: What is the impact of mosquito gene drive on malaria elimination in a computational model with explicit spatial and temporal dynamics?


VMCTune: A Load Balancing Scheme for Virtual Machine Cluster Using Dynamic Resource Allocation. This paper designs and implements a load balancing scheme based on dynamic resource allocation policy for virtual machine cluster, which are running under para-virtualization mode on a cluster of physical machines (PM) in shared storage architecture. It monitors the real-time resources utilization of VMs and PMs, including CPU, memory and network, then uses instant resource reallocation for virtual machines (VM) running on same PM to achieve local VMs' load balancing, while uses live migration of VMs among PMs to achieve global VMs' load balancing. It optimize the resource allocation of VMs to achieve global load balancing of virtual machine cluster. The resource utilization of physical machines will be improved as well. Compared to traditional load balancing schemes based on task scheduling, it is application independent and works seamless on VMs hosting different kinds of applications.

Question: What is a load balancing scheme for virtual machine cluster?


Phialemoniopsis endophytica sp. nov., a new species of endophytic fungi from Luffa cylindrica in Henan, China. During a survey of endophytic fungi in the cucurbit plants collected from Henan, China, a new species, Phialemoniopsis endophytica was isolated from the lower stem of Luffa cylindrica. It differs from other Phialemoniopsis species by its cylindrical to flask-shaped phialides, falcate conidia with blunt ends, ostiolate pycnidium-like conidiomata without marginal setae and ellipsoidal chlamydospores. Multi-locus (ITS, LSU, ACT, and TUB) phylogenetic analysis confirmed that P. endophytica is distinct from other species. A synopsis of the morphological characters of the new species is provided.

Question: What is the difference between a phialide and a phialoconidium?


Usability and Design Guidelines of Smart Canes for Users with Visual Impairments. The percentage of the population with visual impairments is increasing rapidly. Every year, the number of visually impaired people grows by up to 2 million worldwide. The World Health Organization (WHO, 2011) estimates that there are 39 million blind people and 246 million visually impaired people internationally. In addition, visual impairments are closely associated with aging. About 65% of the visually impaired are 50 years of age or older, with about 20% of the world's population in this age group (WHO, 2011). In Europe, in particular, about 90% of visually impaired and partially sighted people are over the age of 60. One of the most severe difficulties for the visually impaired is safe independent mobility. Having independent mobility is a significant factor in ensuring that this aging group can perform simple daily tasks without depending on others. Clark-Carter (1985) indicates that visually impaired people have a low level of mobility. Further, a recent survey in France revealed that only 2% of the overall visually impaired population uses mobility aids (Sander, Lelievre, & Tallec, 2005). One model of an independent mobility aid for the visually impaired is the traditional white cane, which is inexpensive, lightweight and foldable. Unfortunately, white cane users have difficulty detecting protruding bars or moving vehicles until they are dangerously close, which can lead to collisions and falls. The limited capability of the white cane corresponds to its length and a user's maneuvering skills. As such, users rarely detect overhanging obstacles at head-level or ranges further than approximately 1 m from the user. Manduchi and Kurniawan (2011) report in a recent survey of 300 visually impaired people that over 40% of the respondents experienced head-level accidents at least once a month. Further, Clark-Carter (1985) found that visually impaired people were shown to be potentially

Question: What is the percentage of the population with visual impairments?


Hybrid cryptography mechanism for securing self-organized wireless networks. Nowadays use of wireless technologies tremendously increased due to the continuous development of these technologies in various applications. One of the development in wireless technologies leads to deployment of the networks in which all mobile nodes will communicate via wireless links directly without use of any base station or predefined infrastructural support. These networks are self-organized networks called mobile ad hoc networks (MANETs) and architecture used for these networks will be either stand alone with one or few nodes communicating with base station or distributed. As communication is done through wireless links, these types of networks are more prone to several kinds of attacks. Authentication and encryption acts as first line of defense while an intrusion detection system (IDS) acts as a second line of defense. One of the intrusion detection system used in MANET is Enhanced Adaptive Acknowledgement (EAACK) which is based on acknowledgement packets for detection of malicious activities. This system increases the overhead of network significantly relative to other system such as watchdog. So, in this paper we adopt the hybrid cryptography to reduce the network overhead and enhance the security of networks significantly.

Question: What is hybrid cryptography?


10-kV SiC MOSFET-Based Boost Converter. 10-kV silicon carbide (SiC) MOSFETs are currently being developed by a number of organizations in the U.S. with prospective applications in high-voltage and high-frequency power-electronic systems. The aim of this paper is to demonstrate the high-frequency and high-temperature capability of 10-kV SiC MOSFETs in the application of a dc/dc boost converter. In this study, 10-kV SiC MOSFET and junction barrier Schottky (JBS) diode were characterized and modeled in SPICE. Following this, a dc/dc boost converter based on a 10-kV 10-A MOSFET and a 10-kV 5-A JBS diode was designed and tested under continuous operation for frequencies up to 25 kHz. The boost converter had an output voltage of 4 kV, an output power of 4 kW, and operated with a junction temperature of 174degC for the SiC MOSFET. The fast-switching speed, low losses, and high-temperature operation capability of 10-kV SiC MOSFETs demonstrated in the dc/dc boost converter make them attractive for high-frequency and high-voltage power-conversion applications.

Question: What is the high-frequency and high-temperature capability of 10-kV SiC MOSFETs?


A New High-Temperature Superconducting Vernier Permanent-Magnet Machine for Wind Turbines. A vernier permanent magnet (VPM) machine using high-temperature superconducting (HTS) winding for dual excitation is proposed for wind power generation. The proposed VPM machine adopts the parallel hybrid excitation configuration, the stator consists of an identical tooth pair connected together by the stator yoke and the rotor contains two sets of consequent-pole permanent magnets joined together by the rotor yoke. The armature winding is located at the stator main slots while the field winding using HTS coils is wound on the stator yoke. With the benefit of the HTS field winding, the air-gap flux can be flexibly adjusted by controlling the magnitude of the dc current. Therefore, the machine performance is improved to cope with different operating conditions.

Question: What is a vernier permanent magnet?


A 3-$\mu\hbox{W}$  CMOS Glucose Sensor for Wireless Contact-Lens Tear Glucose Monitoring. This paper presents a noninvasive wireless sensor platform for continuous health monitoring. The sensor system integrates a loop antenna, wireless sensor interface chip, and glucose sensor on a polymer substrate. The IC consists of power management, readout circuitry, wireless communication interface, LED driver, and energy storage capacitors in a 0.36-mm2 CMOS chip with no external components. The sensitivity of our glucose sensor is 0.18 μA·mm-2·mM-1. The system is wirelessly powered and achieves a measured glucose range of 0.05-1 mM with a sensitivity of 400 Hz/mM while consuming 3 μW from a regulated 1.2-V supply.

Question: What is the sensitivity of the glucose sensor?


Reconstruction-Based Pairwise Depth Dataset for Depth Image Enhancement Using CNN. Raw depth images captured by consumer depth cameras suffer from noisy and missing values. Despite the success of CNN-based image processing on color image restoration, similar approaches for depth enhancement have not been much addressed yet because of the lack of raw-clean pairwise dataset. In this paper, we propose a pairwise depth image dataset generation method using dense 3D surface reconstruction with a filtering method to remove low quality pairs. We also present a multi-scale Laplacian pyramid based neural network and structure preserving loss functions to progressively reduce the noise and holes from coarse to fine scales. Experimental results show that our network trained with our pairwise dataset can enhance the input depth images to become comparable with 3D reconstructions obtained from depth streams, and can accelerate the convergence of dense 3D reconstruction results.

Question: How to generate a pairwise dataset for depth image enhancement?


Sentiment Identification in Code-Mixed Social Media Text. Sentiment analysis is the Natural Language Processing (NLP) task dealing with the detection and classification of sentiments in texts. While some tasks deal with identifying presence of sentiment in text (Subjectivity analysis), other tasks aim at determining the polarity of the text categorizing them as positive, negative and neutral. Whenever there is presence of sentiment in text, it has a source (people, group of people or any entity) and the sentiment is directed towards some entity, object, event or person. Sentiment analysis tasks aim to determine the subject, the target and the polarity or valence of the sentiment. In our work, we try to automatically extract sentiment (positive or negative) from Facebook posts using a machine learning approach. While some works have been done in code-mixed social media data and in sentiment analysis separately, our work is the first attempt (as of now) which aims at performing sentiment analysis of code-mixed social media text. We have used extensive pre-processing to remove noise from raw text. Multilayer Perceptron model has been used to determine the polarity of the sentiment. We have also developed the corpus for this task by manually labelling Facebook posts with their associated sentiments.

Question: What is the difference between sentiment analysis and polarity analysis?


Forensic analysis of social networking applications on mobile devices. The increased use of social networking applications on smartphones makes these devices a goldmine for forensic investigators. Potential evidence can be held on these devices and recovered with the right tools and examination methods. This paper focuses on conducting forensic analyses on three widely used social networking applications on smartphones: Facebook, Twitter, and MySpace. The tests were conducted on three popular smartphones: BlackBerrys, iPhones, and Android phones. The tests consisted of installing the social networking applications on each device, conducting common user activities through each application, acquiring a forensically sound logical image of each device, and performing manual forensic analysis on each acquired logical image. The forensic analyses were aimed at determining whether activities conducted through these applications were stored on the device's internal memory. If so, the extent, significance, and location of the data that could be found and retrieved from the logical image of each device were determined. The results show that no traces could be recovered from BlackBerry devices. However, iPhones and Android phones store a significant amount of valuable data that could be recovered and used by forensic investigators. a 2012 A. Marrington, N. Al Mutawa & I. Baggili. Published by Elsevier Ltd. All rights

Question: What is the difference between a forensic analysis and a forensic examination?


A short literature review on reward-based crowdfunding. In this short article, we discuss about a popular online fundraising method, named crowdfunding. One of the most useful types is reward-based crowdfunding, where the return is tangible products. We review related researches from three streams, the conceptual research, the empirical research, and the modelling research. Some possible research directions are also discussed in the paper.

Question: What is reward-based crowdfunding?


COA: finding novel patents through text analysis. In recent years, the number of patents filed by the business enterprises in the technology industry are growing rapidly, thus providing unprecedented opportunities for knowledge discovery in patent data. One important task in this regard is to employ data mining techniques to rank patents in terms of their potential to earn money through licensing. Availability of such ranking can substantially reduce enterprise IP (Intellectual Property) management costs. Unfortunately, the existing software systems in the IP domain do not address this task directly. Through our research, we build a patent ranking software, named COA (Claim Originality Analysis) that rates a patent based on its value by measuring the recency and the impact of the important phrases that appear in the "claims" section of a patent. Experiments show that COA produces meaningful ranking when comparing it with other indirect patent evaluation metrics--citation count, patent status, and attorney's rating. In reallife settings, this tool was used by beta-testers in the IBM IP department. Lawyers found it very useful in patent rating, specifically, in highlighting potentially valuable patents in a patent cluster. In this article, we describe the ranking techniques and system architecture of COA. We also present the results that validate its effectiveness.

Question: How to rank patents?


Above the Clouds: A Berkeley View of Cloud Computing. Cloud Computing, the long-held dream of computing as a utility, has the potential to transform a large part of the IT industry, making software even more attractive as a service and shaping the way IT hardware is designed and purchased. Developers with innovative ideas for new Internet services no longer require the large capital outlays in hardware to deploy their service or the human expense to operate it. They need not be concerned about overprovisioning for a service whose popularity does not meet their predictions, thus wasting costly resources, or underprovisioning for one that becomes wildly popular, thus missing potential customers and revenue. Moreover, companies with large batch-oriented tasks can get results as quickly as their programs can scale, since using 1000 servers for one hour costs no more than using one server for 1000 hours. This elasticity of resources, without paying a premium for large scale, is unprecedented in the history of IT. Cloud Computing refers to both the applications delivered as services over the Internet and the hardware and systems software in the datacenters that provide those services. The services themselves have long been referred to as Software as a Service (SaaS). The datacenter hardware and software is what we will call a Cloud. When a Cloud is made available in a pay-as-you-go manner to the general public, we call it a Public Cloud; the service being sold is Utility Computing. We use the term Private Cloud to refer to internal datacenters of a business or other organization, not made available to the general public. Thus, Cloud Computing is the sum of SaaS and Utility Computing, but does not include Private Clouds. People can be users or providers of SaaS, or users or providers of Utility Computing. We focus on SaaS Providers (Cloud Users) and Cloud Providers, which have received less attention than SaaS Users. From a hardware point of view, three aspects are new in

Question: What is cloud computing?


Hate Source : White Supremacist Hate Groups and Hate Crime. The relationship between hate group activity and hate crime is theoretically ambiguous. Hate groups may incite criminal behavior in support of their beliefs. On the other hand, hate groups may reduce hate crime by serving as a forum for members to verbally vent their frustrations or as protection from future biased violence. I …nd that the presence of an active white supremacist hate group chapter is associated with an 18.7 percent higher hate crime rate. White supremacist groups are not associated with the level of anti-white hate crimes committed by non-whites, nor do they form in expectation of future hate crimes by non-whites. JEL Codes: K14, J15, D71

Question: What is the relationship between hate groups and hate crimes?


Reinforcement Learning of Cooperative Persuasive Dialogue Policies using Framing. In this paper, we apply reinforcement learning for automatically learning cooperative persuasive dialogue system policies using framing, the use of emotionally charged statements common in persuasive dialogue between humans. In order to apply reinforcement learning, we describe a method to construct user simulators and reward functions specifically tailored to persuasive dialogue based on a corpus of persuasive dialogues between human interlocutors. Then, we evaluate the learned policy and the effect of framing through experiments both with a user simulator and with real users. The experimental evaluation indicates that applying reinforcement learning is effective for construction of cooperative persuasive dialogue systems which use framing.

Question: How to apply reinforcement learning to persuasive dialogue?


Accelerating Stochastic Gradient Descent using Predictive Variance Reduction. Stochastic gradient descent is popular for large scale optimization but has slow convergence asymptotically due to the inherent variance. To remedy this problem, we introduce an explicit variance reduction method for stochastic gradient descent which we call stochastic variance reduced gradient (SVRG). For smooth and strongly convex functions, we prove that this method enjoys the same fast convergence rate as those of stochastic dual coordinate ascent (SDCA) and Stochastic Average Gradient (SAG). However, our analysis is significantly simpler and more intuitive. Moreover, unlike SDCA or SAG, our method does not require the storage of gradients, and thus is more easily applicable to complex problems such as some structured prediction problems and neural network learning.

Question: What is the convergence rate of stochastic gradient descent?


Semi-Supervised Ensemble Ranking. Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining multiple rankers in document retrieval. The proposed SSER algorithm is formulated as an SVM-like quadratic program (QP), and therefore can be solved efficiently by taking advantage of optimization techniques that were widely used in existing SVM solvers. We evaluated the proposed technique on a standard document retrieval testbed and observed encouraging results by comparing to a number of state-of-the-art techniques.

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


A dataset for activity recognition in an unmodified kitchen using smart-watch accelerometers. Activity recognition from smart devices and wearable sensors is an active area of research due to the widespread adoption of smart devices and the benefits it provide for supporting people in their daily lives. Many of the available datasets for fine-grained primitive activity recognition focus on locomotion or sports activities with less emphasis on real-world day-to-day behavior. This paper presents a new dataset for activity recognition in a realistic unmodified kitchen environment. Data was collected using only smart-watches from 10 lay participants while they prepared food in an unmodified rented kitchen. The paper also providing baseline performance measures for different classifiers on this dataset. Moreover, a deep feature learning system and more traditional statistical features based approaches are compared. This analysis shows that - for all evaluation criteria - data-driven feature learning allows the classifier to achieve best performance compared with hand-crafted features.

Question: What is a dataset for activity recognition in an unmodified kitchen using smart-watch accelerometers?


An Empirical Study on Modeling and Prediction of Bitcoin Prices With Bayesian Neural Networks Based on Blockchain Information. Bitcoin has recently attracted considerable attention in the fields of economics, cryptography, and computer science due to its inherent nature of combining encryption technology and monetary units. This paper reveals the effect of Bayesian neural networks (BNNs) by analyzing the time series of Bitcoin process. We also select the most relevant features from Blockchain information that is deeply involved in Bitcoin's supply and demand and use them to train models to improve the predictive performance of the latest Bitcoin pricing process. We conduct the empirical study that compares the Bayesian neural network with other linear and non-linear benchmark models on modeling and predicting the Bitcoin process. Our empirical studies show that BNN performs well in predicting Bitcoin price time series and explaining the high volatility of the recent Bitcoin price.

Question: What is the effect of Bayesian neural networks on Bitcoin price?


Quantifying the experience of immersion in games.. Games are undoubtedly the most successful computer application yet it is not easy to attribute their success to any one particular feature. Nonetheless, when talking about games, gamers and reviewers frequently refer to the immersive experience of the game as an important aspect to be attained. However, it is not clear what immersion is and even if it is a comparable experience between different players and different games. This paper aims to develop more quantifiable and therefore objective measures of immersion. We describe a study into switching from an immersive gaming experience to another task, not in the game world. Though the degree of immersion does seem to have an impact on the ability to perform the task, the experimental approach is complex and possibly quite fragile. We therefore set out hypotheses for a similar experiment with the aim of exploring whether eyetracking and body motion provide better indicators of the degree of immersion.

Question: What is the degree of immersion in games?


Learning to Remember Translation History with a Continuous Cache. Existing neural machine translation (NMT) models generally translate sentences in isolation, missing the opportunity to take advantage of document-level information. In this work, we propose to augment NMT models with a very light-weight cache-like memory network, which stores recent hidden representations as translation history. The probability distribution over generated words is updated online depending on the translation history retrieved from the memory, endowing NMT models with the capability to dynamically adapt over time. Experiments on multiple domains with different topics and styles show the effectiveness of the proposed approach with negligible impact on the computational cost.

Question: How to learn to remember translation history with a continuous cache?


Unsupervised models for morpheme segmentation and morphology learning.

Question: What is a supervised model for morpheme segmentation and morphology learning?


Supervised Hashing with Deep Neural Networks. In this paper, we propose training very deep neural networks (DNNs) for supervised learning of hash codes. Existing methods in this context train relatively "shallow" networks limited by the issues arising in back propagation (e.g. vanishing gradients) as well as computational efficiency. We propose a novel and efficient training algorithm inspired by alternating direction method of multipliers (ADMM) that overcomes some of these limitations. Our method decomposes the training process into independent layer-wise local updates through auxiliary variables. Empirically we observe that our training algorithm always converges and its computational complexity is linearly proportional to the number of edges in the networks. Empirically we manage to train DNNs with 64 hidden layers and 1024 nodes per layer for supervised hashing in about 3 hours using a single GPU. Our proposed very deep supervised hashing (VDSH) method significantly outperforms the state-of-theart on several benchmark datasets.

Question: What is supervised hashing?


A Survey on Anomalies Detection Techniques and Measurement Methods. Dynamic research area has been applied and researched on anomaly detection in various domains. And various techniques have been proposed to identify unexpected items or events in datasets which differ from the norm. This review tries to provide a basic and structured overview of the anomaly detection techniques. Also, this review discusses major anomaly detection techniques using statistical based and machine learning based techniques. The outcome of this review may facilitate a better understanding of the different techniques in which research has been done on this topic by comparing the pros and cons of the identified techniques. In addition, this review also discusses on the measurement methods used by other researchers in validating their anomalies detection techniques.

Question: What is the difference between a survey and a review?


An integrated approach of diet and exercise recommendations for diabetes patients. Diabetes is among one of the fastest growing disease all over the world. Controlled diet and proper exercise are considered as a treatment to control diabetes. However, food and exercise suggestions in existing solutions do not consider integrated knowledge from personal profile, preferences, current vital signs, diabetes domain, food domain and exercise domain. Furthermore, there is a strong correlation of diet and exercise. We have implemented an ontology based integrated approach to combine knowledge from various domains to generate diet and exercise suggestions for diabetics. The solution is developed as a Semantic Healthcare Assistant for Diet and Exercise (SHADE). For each domain (person, diabetes, food and exercise) we have defined separate ontology along with rules and then an integrated ontology combines these individual ontologies. Finally, diet recommendations are presented in the form of various alternative menus such that each menu is a healthy and balanced diet.

Question: What is an integrated approach of diet and exercise recommendations for diabetes patients?


VM Placement Strategies for Cloud Scenarios. The problem of Virtual Machine (VM) placement in a compute cloud infrastructure is well-studied in the literature. However, the majority of the existing works ignore the dynamic nature of the incoming stream of VM deployment requests that continuously arrive to the cloud provider infrastructure. In this paper we provide a practical model of cloud placement management under a stream of requests and present a novel technique called Backward Speculative Placement (BSP) that projects the past demand behavior of a VM to a candidate target host. We exploit the BSP technique in two algorithms, first for handling the stream of deployment requests, second in a periodic optimization, to handle the dynamic aspects of the demands. We show the benefits of our BSP technique by comparing the results on a simulation period with a strategy of choosing an optimal placement at each time instant, produced by a generic MIP solver.

Question: What is the difference between a VM placement and a VM placement strategy?


Coordinate Noun Phrase Disambiguation in a Generative Parsing Model. In this paper we present methods for improving the disambiguation of noun phrase (NP) coordination within the framework of a lexicalised history-based parsing model. As well as reducing noise in the data, we look at modelling two main sources of information for disambiguation: symmetry in conjunct structure, and the dependency between conjunct lexical heads. Our changes to the baseline model result in an increase in NP coordination dependency f-score from 69.9% to 73.8%, which represents a relative reduction in f-score error of 13%.

Question: How do you disambiguate noun phrases?


A State-of-the-Art of Semantic Change Computation. This paper reviews state-of-the-art of one emerging field in computational linguistics — semantic change computation, proposing a framework that summarizes the literature by identifying and expounding five essential components in the field: diachronic corpus, diachronic word sense characterization, change modelling, evaluation data and data visualization. Despite the potential of the field, the review shows that current studies are mainly focused on testifying hypotheses proposed in theoretical linguistics and that several core issues remain to be solved: the need for diachronic corpora of languages other than English, the need for comprehensive evaluation data for evaluation, the comparison and construction of approaches to diachronic word sense characterization and change modelling, and further exploration of data visualization techniques for hypothesis

Question: What is the state-of-the-art of semantic change computation?


IT governance in public organization based on ITBSC and cobit 5: The case of Kupang Municipality. IT Governance becomes a key component in corporative governance because of the influence of information systems and technologies that support every component of the organization. IT governance which is applied to government organizations can provide positive benefits and support the achievement of business objectives to increase the quality of public services. Application of a good IT Governance is used to apply it in accordance with institutional context. The method used is COBIT 5 combined with ITBSC, then mapping with institutional objectives. The process of collecting data using structured interview methods to the stakeholders in Kupang Municipality. This research found that capability level of Kupang Municipality is in position 0 (incomplete process) with target level of capability of 3, it means that IT Governance of Kupang Municipality not in a maximal condition to responding business process. This study also produced a recommendation for improvement in order to increase the value of capability levels that were set based on COBIT 5.

Question: What is the IT governance in public organization?


Reducing gender bias in word embeddings. Word embedding is a popular framework that represents text data as vectors of real numbers. These vectors capture semantics in language, and are used in a variety of natural language processing and machine learning applications. Despite these useful properties, word embeddings derived from ordinary language corpora necessarily exhibit human biases [6]. We measure direct and indirect gender bias for occupation word vectors produced by the GloVe word embedding algorithm [9], then modify this algorithm to produce an embedding with less bias to mitigate amplifying the bias in downstream applications utilizing this embedding.

Question: How to reduce gender bias in word embeddings?


ERP integration in a healthcare environment: a case study.

Question: What is the case study about?


Neural Network training model for weather forecasting using Fireworks Algorithm. Weather forecasting is the application of science and technology in order to predict the weather conditions. It is important for agricultural and industrial sectors. Models of Artificial Neural Networks with supervised learning paradigm are suitable for weather forecasting in complexity atmosphere. Training algorithm is required for providing weight and bias values to the model. This research proposed a weather forecasting method using Artificial Neural Networks trained by Fireworks Algorithm. Fireworks Algorithm is a recently developed Swarm Intelligence Algorithm for optimization. The main objective of the method is to predict daily mean temperature based on various measured parameters gained from the Meteorological Station, located in Bangkok. The experimental results indicate that the proposed method is advantageous for weather forecasting.

Question: What is the weather forecasting method?


Noise and sensitivity analysis of harmonic radar system for vital sign detection. Harmonic radar architectures present systems of wireless detection operating at multiple harmonic carrier frequencies. The noise and sensitivity of a harmonic radar system, which is developed at 12 GHz and 24 GHz for vital signs detection, are studied numerically and experimentally. The received signal power of the radar system is analyzed numerically as a function of the distance, taking into account the radar cross section (RCS) of the patient chest. The numerical data are compared with results obtained with single carrier frequency system. The total noise is a combination of thermal noise, residual phase noise, and flicker noise that presents the most elevated factor influencing the detection at baseband. Experimental results show that with the harmonic radar, the flicker noise can be reduced by 20dB at around 1Hz baseband frequency.

Question: What is harmonic radar?


Detecting Duplicate Posts in Programming QA Communities via Latent Semantics and Association Rules. Programming community-based question-answering (PCQA) websites such as Stack Overflow enable programmers to find working solutions to their questions. Despite detailed posting guidelines, duplicate questions that have been answered are frequently created. To tackle this problem, Stack Overflow provides a mechanism for reputable users to manually mark duplicate questions. This is a laborious effort, and leads to many duplicate questions remain undetected. Existing duplicate detection methodologies from traditional community based question-answering (CQA) websites are difficult to be adopted directly to PCQA, as PCQA posts often contain source code which is linguistically very different from natural languages. In this paper, we propose a methodology designed for the PCQA domain to detect duplicate questions. We model the detection as a classification problem over question pairs. To extract features for question pairs, our methodology leverages continuous word vectors from the deep learning literature, topic model features and phrases pairs that co-occur frequently in duplicate questions mined using machine translation systems. These features capture semantic similarities between questions and produce a strong performance for duplicate detection. Experiments on a range of real-world datasets demonstrate that our method works very well; in some cases over 30% improvement compared to state-of-the-art benchmarks. As a product of one of the proposed features, the association score feature, we have mined a set of associated phrases from duplicate questions on Stack Overflow and open the dataset to the public.

Question: What is the difference between a programming community and a programming QA community?