Phylogenetic analysis in the anomaly zone.. The concatenation method has been widely used as a means of combining data to estimate phylogenetic trees (Huelsenbeck et al. 1996a, 1996b; Glazko and Nei 2003). However, simulation studies have shown that the maximum likelihood (ML) estimate of the species tree for concatenated sequences may be statistically inconsistent if the gene trees are highly heterogeneous (Kolaczkowski and Thornton 2004; Kubatko and Degnan 2007). Recently, Degnan and Rosenberg (2006) defined an "anomaly zone"—a set of short internal branches in species trees that will generate gene trees that are discordant with the species tree more often than gene trees that are concordant. Kubatko and Degnan (2007) went on to show that when DNA sequences are generated from gene trees simulated from species trees in the anomaly zone, as well as from species trees slightly outside this zone but still with short internal branches, the ML estimate of the species tree for the concatenated sequences can be inconsistent, resulting in increasing certainty in the wrong species tree. These studies were all performed with a molecular clock on rooted gene and species trees within the variation realized in stochastic simulations of DNA sequences under the Jukes and Cantor (1969) model of nucleotide substitution. They applied the ML method with a clock to recover phylogenetic trees from their simulated concatenated data sets. In this paper, we show that phylogenetic methods that solely utilize the relative order of divergences among a set of DNA sequences as a criterion for inferring phylogenies, such as the unweighted pair group method with arithmetic mean (UPGMA), are statistically consistent even when DNA sequences are generated from gene trees simulated from species trees in the anomaly zone. In addition, we use simulation to assess the performance of a variety of tree construction methods when analyzing concatenated sequences generated from 4 and 5-taxon species tree lo

Question: What is the anomaly zone?


Compact Design of a Hydraulic Driving Robot for Intraoperative MRI-Guided Bilateral Stereotactic Neurosurgery. In this letter, we present an intraoperative magnetic resonance imaging (MRI)-guided robot for bilateral stereotactic procedures. Its compact design enables robot's operation within the constrained space of standard imaging head coil. magnetic resonance (MR) safe and high-performance hydraulic transmissions are incorporated. A maximum stiffness coefficient of 24.35 N/mm can be achieved with transmission fluid preloaded at 2 bar. Sufficient targeting accuracy (average within ≤1.73 mm) has been demonstrated in a simulated needle insertion task of deep brain stimulation. A novel MR-based wireless tracking technique is adopted. It is capable of offering real-time and continuous (30–40 Hz) three-dimensional (3-D) localization of robotic instrument under the proper MR tracking sequence. It outperforms the conventional method of using low-contrast passive fiducials that can only be revealed in the MR image domain. Two wireless tracking units/markers are integrated with the robot, which are two miniaturized coil circuits in size of 1.5 × 5 × 0.2 mm3, fabricated on flexible thin films. A navigation test was performed under the standard MRI settings in order to visualize the 3-D localization of the robotic instrument. MRI compatibility test was also carried out to prove the minimal interference to MR images of the presented hydraulic robotic platform.

Question: What is the size of the robot?


GRID-CLUSTERING: A FAST HIERARCHICAL CLUSTERING METHOD FOR VERY LARGE DATA SETS. This paper presents a new approach to hierarchical clustering of very large data sets, named GridClustering. The method organizes unlike the conventional methods the space surrounding the patterns and not the patterns. It uses a multidimensional grid data structure. The resulting block partitioning of the value space is clustered via a topological neighbor search. The Grid-Clustering method is able to deliver structural pattern distribution information for very large data sets. It superceeds all conventional hierarchical algorithms in runtime behavior and memory space requirements. The algorithm was analyzed within a testbed and suitable values for the tunable parameters of the algorithm are proposed. A comparison of the executions times to other commonly used clustering algorithms and a heuristic runtime analysis is given.

Question: What is the grid clustering method?


A valid two-item food security questionnaire for screening HIV-1 infected patients in a clinical setting.. OBJECTIVE To validate a two-item food security questionnaire (FSQ) for use in a clinical setting to screen HIV-1 infected patients for food insecurity.   DESIGN The present study was a questionnaire-based survey of forty-nine subjects attending an HIV clinic. Subjects completed a two-item questionnaire and a six-item validated FSQ contemporaneously.   RESULTS A strong correlation was found between the two-item and six-item FSQ (rho = 0.895; 95 % CI 0.821, 0.940; P < 0.0001). Cronbach's alpha coefficient was found to be 0.94 and 0.90 for the two-item and six-item FSQ, respectively. The two-item FSQ yielded a sensitivity of 100 % (95 % CI 75, 100) and a specificity of 78 % (95 % CI 61, 90). The negative predictive value was found to be 100 % (95 % CI 88, 100).   CONCLUSIONS The results of the present study suggest that the two-item FSQ is a valid, reliable and sensitive screening tool of food insecurity in people living with HIV in a clinical setting.

Question: How do you validate a two-item food security questionnaire?


Neural embedding-based indices for semantic search. Traditional information retrieval techniques that primarily rely on keyword-based linking of the query and document spaces face challenges such as the vocabulary mismatch problem where relevant documents to a given query might not be retrieved simply due to the use of different terminology for describing the same concepts. As such, semantic search techniques aim to address such limitations of keyword-based retrieval models by incorporating semantic information from standard knowledge bases such as Freebase and DBpedia. The literature has already shown that while the sole consideration of semantic information might not lead to improved retrieval performance over keyword-based search, their consideration enables the retrieval of a set of relevant documents that cannot be retrieved by keyword-based methods. As such, building indices that store and provide access to semantic information during the retrieval process is important. While the process for building and querying keyword-based indices is quite well understood, the incorporation of semantic information within search indices is still an open challenge. Existing work have proposed to build one unified index encompassing both textual and semantic information or to build separate yet integrated indices for each information type but they face limitations such as increased query process time. In this paper, we propose to use neural embeddings-based representations of term, semantic entity, semantic type and documents within the same embedding space to facilitate the development of a unified search index that would consist of these four information types. We perform experiments on standard and widely used document collections including Clueweb09-B and Robust04 to evaluate our proposed indexing strategy from both effectiveness and efficiency perspectives. Based on our experiments, we find that when neural embeddings are used to build inverted indices; hence relaxing th

Question: What is the difference between neural embeddings and word embeddings?


Cruciform: Solving Crosswords with Natural Language Processing. Crossword puzzles are popular word games that require not only a large vocabulary, but also a broad knowledge of topics. Answering each clue is a natural language task on its own as many clues contain nuances, puns, or counter-intuitive word definitions. Additionally, it can be extremely difficult to ascertain definitive answers without the constraints of the crossword grid itself. This task is challenging for both humans and computers. We describe here a new crossword solving system, Cruciform. We employ a group of natural language components, each of which returns a list of candidate words with scores when given a clue. These lists are used in conjunction with the fill intersections in the puzzle grid to formulate a constraint satisfaction problem, in a manner similar to the one used in the Dr. Fill system[4]. We describe the results of several of our experiments with the system.

Question: What is a crossword solving system?


Integrating Reactive and Scripted Behaviors in a Life-Like Presentation Agent. 1. ABSTRACT Animated agents based either on real video, cartoon-style drawings or even model-based 3D graphics offer great promise for computer-based presentations as they make presentations more lively and appealing and allow for the emulation of conversation styles known from human-human communication. In this paper, we describe a life-like interface agent which presents multimedia material to the user following the directives of a script. The overall behavior of the presentation agent is partly determined by such a script, and partly by the agent's self-behavior. In our approach, the agent's behavior is defined in a declarative specification language. Behavior specifications are used to automatically generate a control module for an agent display system. The first part of the paper describes the generation process which involves AI planning and a two-step compilation. Since the manual creation of presentation scripts is tedious and error-prone, we also address the automated generation of presentation scripts which may be forwarded to the interface agent. The second part of the paper presents an approach for multimedia presentation design which combines hierarchical planning with temporal reasoning.

Question: How to integrate reactive and scripted behaviors in a life-like presentation agent?


Large gain linear series-fed microstrip antenna arrays at Ka and C bands. In this paper, the design of a series-fed microstrip antenna array is discussed and its design challenge of limited gain is explained. It discusses that the phase between the patches of the array plays a significant role in overcoming the challenge. A 23 element series fed linear array at Ka-band gives gain of 19dBi with beam in broadside direction and has SLL better than -15dB. A scaled down version at C-band has been designed and fabricated. A 7-element series fed antenna array yielded measured gain of 15.1 dBi at 5.79 GHz. This design can be extended for planar antenna arrays to obtain higher gain.

Question: How to design a microstrip antenna array?


Analysis of Audio-Visual Features for Unsupervised Speech Recognition. Research on "zero resource" speech processing focuses on learning linguistic information from unannotated, or raw, speech data, in order to bypass the expensive annotations required by current speech recognition systems. While most recent zero-resource work has made use of only speech recordings, here, we investigate the use of visual information as a source of weak supervision, to see whether grounding speech in a visual context can provide additional benefit for language learning. Specifically, we use a dataset of paired images and audio captions to supervise learning of low-level speech features that can be used for further "unsupervised" processing of any speech data. We analyze these features and evaluate their performance on the Zero Resource Challenge 2015 evaluation metrics, as well as standard keyword spotting and speech recognition tasks. We show that features generated with a joint audiovisual model contain more discriminative linguistic information and are less speaker-dependent than traditional speech features. Our results show that visual grounding can improve speech representations for a variety of zero-resource tasks.

Question: What is the zero resource challenge?


1 Text Mining Systems for Predicting Market Response to News : A Survey. Several prototypes for predicting the short-term market reaction to news based on text mining techniques have been developed. However, no detailed comparison of the systems and their performances is available thus far. This paper describes the main systems developed and presents a framework for comparing the approaches. The prototypes differ in the text mining methods applied and the data sets used for performance evaluation. Some (mostly implicit) assumptions of these evaluations are rather unrealistic with respect to properties of financial markets and the performance results cannot be achieved in reality. Furthermore, the adequacy of applying text mining techniques for predicting stock price movements in general and approaches for dealing with existing problems are discussed.

Question: What is the difference between text mining and text classification?


Estimating Data Integration and Cleaning Effort. Data cleaning and data integration have been the topic of intensive research for at least the past thirty years, resulting in a multitude of specialized methods and integrated tool suites. All of them require at least some and in most cases significant human input in their configuration, during processing, and for evaluation. For managers (and for developers and scientists) it would be therefore of great value to be able to estimate the effort of cleaning and integrating some given data sets and to know the pitfalls of such an integration project in advance. This helps deciding about an integration project using cost/benefit analysis, budgeting a team with funds and manpower, and monitoring its progress. Further, knowledge of how well a data source fits into a given data ecosystem improves source selection. We present an extensible framework for the automatic effort estimation for mapping and cleaning activities in data integration projects with multiple sources. It comprises a set of measures and methods for estimating integration complexity and ultimately effort, taking into account heterogeneities of both schemas and instances and regarding both integration and cleaning operations. Experiments on two real-world scenarios show that our proposal is two to four times more accurate than a current approach in estimating the time duration of an integration process, and provides a meaningful breakdown of the integration problems as well as the required integration activities. 1. COMPLEXITY OF INTEGRATION AND CLEANING Data integration and data cleaning remain among the most human-work-intensive tasks in data management. Both require a clear understanding of the semantics of schema and data – a notoriously difficult task for machines. Despite much research and development of supporting tools and algorithms, state-of-the-art integration projects involve significant human resource cost. In fact, Gartner reports that 10% of al

Question: How much does it cost to integrate data?


Real-time Incremental Speech-to-Speech Translation of Dialogs. In a conventional telephone conversation between two speakers of the same language, the interaction is real-time and the speakers process the information stream incrementally. In this work, we address the problem of incremental speech-to-speech translation (S2S) that enables cross-lingual communication between two remote participants over a telephone. We investigate the problem in a novel real-time Session Initiation Protocol (SIP) based S2S framework. The speech translation is performed incrementally based on generation of partial hypotheses from speech recognition. We describe the statistical models comprising the S2S system and the SIP architecture for enabling real-time two-way cross-lingual dialog. We present dialog experiments performed in this framework and study the tradeoff in accuracy versus latency in incremental speech translation. Experimental results demonstrate that high quality translations can be generated with the incremental approach with approximately half the latency associated with nonincremental approach.

Question: How to perform speech translation incrementally?


Knowledge Graph Embedding with Numeric Attributes of Entities. Knowledge Graph (KG) embedding projects entities and relations into low dimensional vector space, which has been successfully applied in KG completion task. The previous embedding approaches only model entities and their relations, ignoring a large number of entities' numeric attributes in KGs. In this paper, we propose a new KG embedding model which jointly model entity relations and numeric attributes. Our approach combines an attribute embedding model with a translation-based structure embedding model, which learns the embeddings of entities, relations, and attributes simultaneously. Experiments of link prediction on YAGO and Freebase show that the performance is effectively improved by adding entities' numeric attributes in the embedding model.

Question: What is the difference between knowledge graph embedding and knowledge graph completion?


The Three Layers Evaluation Model for Computer-Generated Plots. This paper describes a model for evaluating a computer-generated plot. The main motivation of this project is to provide MEXICA, our plot generator, with the capacity of evaluating its own outputs as well as assessing narratives generated by other agents that can be employed to enrich its knowledge base. We present a description of our computer model as well as an explanation of our first prototype. Then, we show the results of assessing three computergenerated narratives. The outcome suggests that we are in the right direction, although much more work

Question: What is the three layers evaluation model for computer-generated plots?


Provisioning Software-Defined IoT Cloud Systems. Cloud computing is ever stronger converging with the Internet of Things (IoT) offering novel techniques for IoT infrastructure virtualization and its management on the cloud. However, system designers and operations managers face numerous challenges to realize IoT cloud systems in practice, mainly due to the complexity involved with provisioning large-scale IoT cloud systems and diversity of their requirements in terms of IoT resources consumption, customization of IoT capabilities and runtime governance. In this paper, we introduce the concept of software-defined IoT units - a novel approach to IoT cloud computing that encapsulates fine-grained IoT resources and IoT capabilities in well-defined APIs in order to provide a unified view on accessing, configuring and operating IoT cloud systems. Our software-defined IoT units are the fundamental building blocks of software-defined IoT cloud systems. We present our framework for dynamic, on-demand provisioning and deploying such software-defined IoT cloud systems. By automating provisioning processes and supporting managed configuration models, our framework simplifies provisioning and enables flexible runtime customizations of software-defined IoT cloud systems. We demonstrate its advantages on a real-world IoT cloud system for managing electric fleet vehicles.

Question: What is the difference between software-defined IoT units and software-defined IoT cloud systems?


The architecture of virtual machines. A virtual machine can support individual processes or a complete system depending on the abstraction level where virtualization occurs. Some VMs support flexible hardware usage and software isolation, while others translate from one instruction set to another. Virtualizing a system or component -such as a processor, memory, or an I/O device - at a given abstraction level maps its interface and visible resources onto the interface and resources of an underlying, possibly different, real system. Consequently, the real system appears as a different virtual system or even as multiple virtual systems. Interjecting virtualizing software between abstraction layers near the HW/SW interface forms a virtual machine that allows otherwise incompatible subsystems to work together. Further, replication by virtualization enables more flexible and efficient and efficient use of hardware resources.

Question: What is the architecture of virtual machines?


Ways of Asking and Replying in Duplicate Question Detection. This paper presents the results of systematic experimentation on the impact in duplicate question detection of different types of questions across both a number of established approaches and a novel, superior one used to address this language processing task. This study permits to gain a novel insight on the different levels of robustness of the diverse detection methods with respect to different conditions of their application, including the ones that approximate real usage scenarios.

Question: What is the impact of different types of questions on duplicate question detection?


Adversarial synthesis learning enables segmentation without target modality ground truth. A lack of generalizability is one key limitation of deep learning based segmentation. Typically, one manually labels new training images when segmenting organs in different imaging modalities or segmenting abnormal organs from distinct disease cohorts. The manual efforts can be alleviated if one is able to reuse manual labels from one modality (e.g., MRI) to train a segmentation network for a new modality (e.g., CT). Previously, two stage methods have been proposed to use cycle generative adversarial networks (CycleGAN) to synthesize training images for a target modality. Then, these efforts trained a segmentation network independently using synthetic images. However, these two independent stages did not use the complementary information between synthesis and segmentation. Herein, we proposed a novel end-to-end synthesis and segmentation network (EssNet) to achieve the unpaired MRI to CT image synthesis and CT splenomegaly segmentation simultaneously without using manual labels on CT. The end-to-end EssNet achieved significantly higher median Dice similarity coefficient (0.9188) than the two stages strategy (0.8801), and even higher than canonical multi-atlas segmentation (0.9125) and ResNet method (0.9107), which used the CT manual labels.

Question: How does adversarial synthesis learning enable segmentation without target modality ground truth?


Collective annotation of Wikipedia entities in web text. To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world entities from an entity catalog. Several systems have been proposed to link spots on Web pages to entities in Wikipedia. They are largely based on local compatibility between the text around the spot and textual metadata associated with the entity. Two recent systems exploit inter-label dependencies, but in limited ways. We propose a general collective disambiguation approach. Our premise is that coherent documents refer to entities from one or a few related topics or domains. We give formulations for the trade-off between local spot-to-entity compatibility and measures of global coherence between entities. Optimizing the overall entity assignment is NP-hard. We investigate practical solutions based on local hill-climbing, rounding integer linear programs, and pre-clustering entities followed by local optimization within clusters. In experiments involving over a hundred manually-annotated Web pages and tens of thousands of spots, our approaches significantly outperform recently-proposed algorithms.

Question: What is the collective annotation of Wikipedia entities in web text?


User activities outlier detection system using principal component analysis and fuzzy rule-based system. In this paper, a user activities outlier detection system is introduced. The proposed system is implemented in a smart home environment equipped with appropriate sensory devices. An activity outlier detection system consist of a two-stage integration of Principal Component Analysis (PCA) and Fuzzy Rule-Based System (FRBS). In the first stage, the Hamming distance is used to measure the distances between the activities. PCA is then applied to the distance measures to find two indices of Hotelling's T2 and Squared Prediction Error (SPE). In the second stage of the process, the calculated indices are provided as inputs to FRBSs to model them heuristically. They are used to identify the outliers and classify them. Three case studies are reported to demonstrate the effectiveness of the proposed system. The proposed system successfully identifies the outliers and helps in distinguishing between the normal and abnormal behaviour patterns of the Activities of Daily Living (ADL).

Question: What is the difference between principal component analysis and fuzzy rule-based system?


Visual secret sharing scheme for (k, n) threshold based on QR code with multiple decryptions. In this paper, a novel visual secret sharing (VSS) scheme based on QR code (VSSQR) with (k, n) threshold is investigated. Our VSSQR exploits the error correction mechanism in the QR code structure, to generate the bits corresponding to shares (shadow images) by VSS from a secret bit in the processing of encoding QR. Each output share is a valid QR code that can be scanned and decoded utilizing a QR code reader, which may reduce the likelihood of attracting the attention of potential attackers. Due to different application scenarios, two different recovered ways of the secret image are given. The proposed VSS scheme based on QR code can visually reveal secret image with the abilities of stacking and XOR decryptions as well as scan every shadow image, i.e., a QR code, by a QR code reader. The secret image could be revealed by human visual system without any computation based on stacking when no lightweight computation device. On the other hand, if the lightweight computation device is available, the secret image can be revealed with better visual quality based on XOR operation and could be lossless revealed when sufficient shares are collected. In addition, it can assist alignment for VSS recovery. The experiment results show the effectiveness of our scheme.

Question: What is the visual secret sharing scheme based on QR code?


View-Independent Recognition of Hand Postures. In Proc. of IEEE Conf. on CVPR'2000, Vol.II, pp.88-94, Hilton Head Island, SC, 2000 Since human hand is highly articulated and deformable, hand posture recognition is a challenging example in the research of view-independent object recognition. Due to the difficulties of the modelbased approach, the appearance-based learning approach is promising to handle large variation in visual inputs. However, the generalization of many proposed supervised learning methods to this problem often suffers from the insufficiency of labeled training data. This paper describes an approach to alleviate this difficulty by adding a large unlabeled training set. Combining supervised and unsupervised learning paradigms, a novel and powerful learning approach, the Discriminant-EM (D-EM) algorithm, is proposed in this paper to handle the case of small labeled training set. Experiments show that D-EM outperforms many other learning methods. Based on this approach, we implement a gesture interface to recognize a set of predefined gesture commands, and it is also extended to hand detection. This algorithm can also apply to other object recognition tasks.

Question: What is the difference between supervised and unsupervised learning?


Robust motion detection using histogram of oriented gradients for illumination variations. This paper proposes a robust motion detection method for illumination variations which uses histogram of oriented gradients. The detection process is divided into two phases: coarse detection and refinement. In the coarse detection phase, first, a texture-based background model is built which implements a group of adaptive histograms of oriented gradients; then, by comparing the histogram of oriented gradients of each pixel between current frame and background model, a foreground is segmented based on texture feature which is not susceptible to illumination variations, whereas some missing foreground regions exist; finally, the result based on texture is optimized by combining the pixel-wise detection result produced by Gaussian Mixture Model (GMM) algorithm, which greatly improves the detection performance by incorporating efficient morphological operations. In the refinement phase, the above detection result is refined based on the distinction in color feature to eliminate errors like shadows, noises, redundant contour, etc. Experimental results show the effectiveness and robustness of our approach in detecting moving objects in varying illumination conditions.

Question: How to detect moving objects in varying illumination conditions?


Modelling consumer credit risk via survival analysis. Credit risk models are used by financial companies to evaluate in advance the insolvency risk caused by credits that enter into default. Many models for credit risk have been developed over the past few decades. In this paper, we focus on those models that can be formulated in terms of the probability of default by using survival analysis techniques. With this objective three different mechanisms are proposed based on the key idea of writing the default probability in terms of the conditional distribution function of the time to default. The first method is based on a Cox's regression model, the second approach uses generalized linear models under censoring and the third one is based on nonparametric kernel estimation, using the product-limit conditional distribution function estimator by Beran. The resulting nonparametric estimator of the default probability is proved to be consistent and asymptotically normal. An empirical study, based on modified real data, illustrates the three methods. MSC: 62P20, 91B30, 62G05, 62N01

Question: What is the difference between a Cox's regression model and a generalized linear model under censoring?


Multi-Scale DenseNet-Based Electricity Theft Detection. 1. Beijing University of Posts and Telecommunications, Beijing, 100876, China deepblue.lb@gmail.com 2. School of Computer, National University of Defense Technology, Changsha, 410073, China kelele.xu@gmail.com 3. School of Information Communication, National University of Defense Technology, Wuhan, 430015, China 4. The University of Melbourne, Parkville, 3010, Australia yihengw1@student.unimelb.edu.au 5. China Minsheng Bank, Beijing 100031, China wangyanbo@cmbc.com.cn

Question: What is the name of the university in Australia?


Data Preparation for Data Mining. Senior Editor: Diane D. Cerra Director of Production & Manufacturing: Yonie Overton Production Editor: Edward Wade Editorial Assistant: Belinda Breyer Cover Design: Wall-To-Wall Studios Cover Photograph: © 1999 PhotoDisc, Inc. Text Design & Composition: Rebecca Evans & Associates Technical Illustration: Dartmouth Publishing, Inc. Copyeditor: Gary Morris Proofreader: Ken DellaPenta Indexer: Steve Rath Printer: Courier Corp.

Question: What is the difference between a data mining and a data analysis?


Sampling-oscilloscope measurement of a microwave mixer with single-digit phase accuracy. We describe a straightforward method of separately characterizing up- and down-conversion in microwave mixers using a sampling oscilloscope. The method mismatch-corrects the results, determines both magnitude and phase, and uses a novel time-base correction scheme to improve the accuracy of the measurements. We estimate our measurement accuracy to be on the order of a tenth of a decibel in magnitude and a few degrees in phase. We use the method to characterize the magnitude and phase reciprocity of a microwave mixer.

Question: How accurate is the measurement of a microwave mixer?


Investigation on perceptual and robustness of LSB digital watermarking scheme on Halal Logo authentication. In Malaysia, Halal Certificate can only be issued by Jakim. For the time being, there is no specific method to verify authentication of Halal Certificate displayed at food or service premises. Watermarking technique however, offered a solution for authenticity of the data and copyright protection. In this paper, an investigation on perceptual and robustness of least significant bit (LSB) digital watermarking scheme on Halal Logo authentication is implemented using MATLAB software. LSB digital watermarking scheme allows pixel value modification by dividing its entire bit leaving most significant bit (contains most information) and least significant bit (contains less information). These small modifications offer a high perceptual transparency to the watermarked image. A Quick response (QR) code with message is generated as an embedded watermark image for Halal Logo. The watermarked image quality is measured based on Peak signal-to-noise (PSNR), mean square error (MSE), and Normalized Cross-Correlation (NC). The investigation shows the scheme provided high PSNR performance which is between 12-22 dB with Gaussian noise added. The scheme successfully shows the ability to retrieve the embed watermark even though the cover image visual quality is degraded with 50 % Gaussian noise variance. The reliability of the scheme is proven when it successfully to produce an acceptable 0.8442 NC value. The observation on perceptibility shows 51 dB of PSNR with 0.4714 MSE.

Question: How to authenticate Halal Logo?


EEG-GAN: Generative adversarial networks for electroencephalograhic (EEG) brain signals. Generative adversarial networks (GANs) are recently highly successful in generative applications involving images and start being applied to time series data. Here we describe EEG-GAN as a framework to generate electroencephalographic (EEG) brain signals. We introduce a modification to the improved training of Wasserstein GANs to stabilize training and investigate a range of architectural choices critical for time series generation (most notably upand down-sampling). For evaluation we consider and compare different metrics such as Inception score, Frechet inception distance and sliced Wasserstein distance, together showing that our EEG-GAN framework generated naturalistic EEG examples. It thus opens up a range of new generative application scenarios in the neuroscientific and neurological context, such as data augmentation in brain-computer interfacing tasks, EEG super-sampling, or restoration of corrupted data segments. The possibility to generate signals of a certain class and/or with specific properties may also open a new avenue for research into the underlying structure of brain signals.

Question: What is the difference between a generative adversarial network and a generative model?


High-Impedance Electromagnetic Surfaces with a Forbidden Frequency Band. A new type of metallic electromagnetic structure has been developed that is characterized by having high surface impedance. Although it is made of continuous metal, and conducts dc currents, it does not conduct ac currents within a forbidden frequency band. Unlike normal conductors, this new surface does not support propagating surface waves, and its image currents are not phase reversed. The geometry is analogous to a corrugated metal surface in which the corrugations have been folded up into lumped-circuit elements, and distributed in a two-dimensional lattice. The surface can be described using solid-state band theory concepts, even though the periodicity is much less than the free-space wavelength. This unique material is applicable to a variety of electromagnetic problems, including new kinds of low-profile antennas.

Question: What is a forbidden frequency band?


To See or not to See – Innovative Display Technologies as Enablers for Ergonomic Cockpit Concepts Ergonomic requirements future mobility future functionality. Introduction Given the fact that the driving task will remarkably change by the increase of assistance and information systems in the future innovative display technologies play a central role for the ergonomic realization of the driver vehicle interaction. Increasing assistance and even automation of the driving task do not lead to a decrease or disappearance of visual information but instead request new and in some cases revolutionary concepts to close the loop between driver, vehicle and traffic environment. Augmenting information in contact analog head-up-displays for navigation and driver assistance is a very promising approach. Replacement of mirrors via camera monitor systems is a further example. Free programmable cluster instruments in combination with HUD promise to resolve the problem of information density produced by an increasing amount of ADAS and IVIS functionality.

Question: What is the future of the cockpit?


Design and performance analysis of radial flux C-core switched reluctance motor for in-wheel electrical vehicle application. A 12/15 pole dual air-gap single rotor configuration with C-core radial flux switched reluctance motor (RFSRM) is proposed as a potential candidate for in-wheel electrical vehicle application with removable wheel/rotor, without disturbing the stator or stator winding. The proposed topology offers effective stator and rotor contact area without increasing the diameter of electrical motor and has smaller flux path compared to the conventional RFSRM. This arrangement offers good torque with low excitation current. It is easy to wound the winding at stator core compared to toothed or segmented type axial field SRM. In this paper phase inductance and torque are calculated analytically and compared with finite element analysis (FEA) results.

Question: What is the difference between a toothed and segmented axial field switched reluctance motor?


Clash of the Contagions: Cooperation and Competition in Information Diffusion. In networks, contagions such as information, purchasing behaviors, and diseases, spread and diffuse from node to node over the edges of the network. Moreover, in real-world scenarios multiple contagions spread through the network simultaneously. These contagions not only propagate at the same time but they also interact and compete with each other as they spread over the network. While traditional empirical studies and models of diffusion consider individual contagions as independent and thus spreading in isolation, we study how different contagions interact with each other as they spread through the network. We develop a statistical model that allows for competition as well as cooperation of different contagions in information diffusion. Competing contagions decrease each other's probability of spreading, while cooperating contagions help each other in being adopted throughout the network. We evaluate our model on 18,000 contagions simultaneously spreading through the Twitter network. Our model learns how different contagions interact with each other and then uses these interactions to more accurately predict the diffusion of a contagion through the network. Moreover, the model also provides a compelling hypothesis for the principles that govern content interaction in information diffusion. Most importantly, we find very strong effects of interactions between contagions. Interactions cause a relative change in the spreading probability of a contagion by 71% on the average.

Question: How do different contagions interact with each other?


Learning Multi-level Features For Sensor-based Human Action Recognition. This paper proposes amulti-level feature learning framework for human action recognition using a single body-worn inertial sensor. The framework consists of three phases, respectively designed to analyze signal-based (low-level), components (mid-level) and semantic (high-level) information. Low-level features capture the time and frequency domain property while mid-level representations learn the composition of the action. The Maxmargin Latent Pattern Learning (MLPL) method is proposed to learn high-level semantic descriptions of latent action patterns as the output of our framework. The proposedmethod achieves the state-of-the-art performances, 88.7%, 98.8% and 72.6% (weighted F1 score) respectively, on Skoda, WISDM and OPP datasets. © 2017 Elsevier B.V. All rights reserved.

Question: What is the state-of-the-art performances on Skoda, WISDM and OPP datasets?


Image Alignment and Stitching : A Tutorial 1. This tutorial reviews image alignment and image stitching algorithms. Image alignment algorithms can discover the correspondence relationships among images with varying degrees of overlap. They are ideally suited for applications such as video stabilization, summarization, and the creation of panoramic mosaics. Image stitching algorithms take the alignment estimates produced by such registration algorithms and blend the images in a seamless manner, taking care to deal with potential problems such as blurring or ghosting caused by parallax and scene movement as well as varying image exposures. This tutorial reviews the basic motion models underlying alignment and stitching algorithms, describes effective direct (pixel-based) and feature-based alignment algorithms, and describes blending algorithms used to produce seamless mosaics. It closes with a discussion of open research problems in the area.

Question: What is the difference between image alignment and image stitching?


Cortical hubs revealed by intrinsic functional connectivity: mapping, assessment of stability, and relation to Alzheimer's disease.. Recent evidence suggests that some brain areas act as hubs interconnecting distinct, functionally specialized systems. These nexuses are intriguing because of their potential role in integration and also because they may augment metabolic cascades relevant to brain disease. To identify regions of high connectivity in the human cerebral cortex, we applied a computationally efficient approach to map the degree of intrinsic functional connectivity across the brain. Analysis of two separate functional magnetic resonance imaging datasets (each n = 24) demonstrated hubs throughout heteromodal areas of association cortex. Prominent hubs were located within posterior cingulate, lateral temporal, lateral parietal, and medial/lateral prefrontal cortices. Network analysis revealed that many, but not all, hubs were located within regions previously implicated as components of the default network. A third dataset (n = 12) demonstrated that the locations of hubs were present across passive and active task states, suggesting that they reflect a stable property of cortical network architecture. To obtain an accurate reference map, data were combined across 127 participants to yield a consensus estimate of cortical hubs. Using this consensus estimate, we explored whether the topography of hubs could explain the pattern of vulnerability in Alzheimer's disease (AD) because some models suggest that regions of high activity and metabolism accelerate pathology. Positron emission tomography amyloid imaging in AD (n = 10) compared with older controls (n = 29) showed high amyloid-beta deposition in the locations of cortical hubs consistent with the possibility that hubs, while acting as critical way stations for information processing, may also augment the underlying pathological cascade in AD.

Question: What is the difference between a hub and a node?


Boosted Regression Active Shape Models. We present an efficient method of fitting a set of local feature models to an image within the popular Active Shape Model (ASM) framework [3]. We compare two different types of non-linear boosted feature models trained using GentleBoost [9]. The first type is a conventional feature detector classifier, which learns a discrimination function between the appearance of a feature and the local neighbourhood. The second local model type is a boosted regression predictor which learns the relationship between the local neighbourhood appearance and the displacement from the true feature location. At run-time the second regression model is much more efficient as only the current feature patch needs to be processed. We show that within the local iterative search of the ASM the local feature regression provides improved localisation on two publicly available human face test sets as well as increasing the search speed by a factor of eight.

Question: Boosted Regression Active Shape Models


Real-time detection of students' emotional states in the classroom. Today, as social media sharing increases, the instant emotional state of the students changes frequently. This situation is greatly affecting the learning process as well as the motivation of the students in the classroom. Sometimes, it is insufficient for the educator to observe the emotional states of students. Therefore, an automatic system is needed that can detect and analyze the emotional states of students in the classroom. In this study, an auxiliary information system, which uses image processing and human-computer interaction, has been developed that would be used in the field of education. In this system, the dataset obtained from the students' faces was tested using various machine learning algorithms. As a result, the accuracy of this system was found as 97.15% using support vector machine. This system is aimed to direct the educator to communicate with the students and to increase their motivation when necessary.

Question: What is the accuracy of the system?


Curvature-controlled curve editing using piecewise clothoid curves. Two-dimensional curves are conventionally designed using splines or Bézier curves. Although formally they are C or higher, the variation of the curvature of (piecewise) polynomial curves is difficult to control; in some cases it is practically impossible to obtain the desired curvature. As an alternative we propose piecewise clothoid curves (PCCs). We show that from the design point of view they have many advantages: control points are interpolated, curvature extrema lie in the control points, and adding control points does not change the curve. We present a fast localized clothoid interpolation algorithm that can also be used for curvature smoothing, for curve fitting, for curvature blending, and even for directly editing the curvature. We give a physical interpretation of variational curvature minimization, from which we derive our scheme. Finally, we demonstrate the achievable quality with a range of examples. & 2013 Elsevier Ltd. All rights reserved.

Question: How do you edit the curvature of a curve?


Clinical and radiological pictures of two newborn babies with manifestations of chondrodysplasia punctata and review of available literature. BACKGROUND Chondrodysplasia punctata (CDP) is a rare, heterogeneous congenital skeletal dysplasia, characterized by punctate or dot-like calcium deposits in cartilage observed on neonatal radiograms. A number of inborn metabolic diseases are associated with CDP, including peroxisomal and cholesterol biosynthesis dysfunction and other inborn errors of metabolism such as: mucolipidosis type II, mucopolysacharidosis type III, GM1 gangliosidosis. CDP is also related to disruption of vitamin K-dependent metabolism, causing secondary effects on the embryo, as well as fetal alcohol syndrome (FAS), chromosomal abnormalities that include trisomies 18 and 21, Turner syndrome.   CASE REPORT This article presents clinical data and diagnostic imaging findings of two newborn babies with chondrodysplasia punctata. Children presented with skeletal and cartilage anomalies, dysmorphic facial feature, muscles tone abnormalities, skin changes and breathing difficulties. One of the patients demonstrated critical stenosis of spinal canal with anterior subluxation of C1 vertebra relative to C2. The aim of this article is to present cases and briefly describe current knowledge on etiopathogenesis as well as radiological and clinical symptoms of diseases coexisting with CDP.   CONCLUSIONS Radiological diagnostic imaging allows for visualization of punctate focal mineralization in bone epiphyses during neonatal age and infancy. Determining the etiology of chondrodysplasia punctata requires performing various basic as well as additional examinations, including genetic studies.

Question: What is the etiology of chondrodysplasia punctata?


Empirical Analysis of Denial-of-Service Attacks in the Bitcoin Ecosystem. We present an empirical investigation into the prevalence and impact of distributed denial-of-service (DDoS) attacks on operators in the Bitcoin economy. To that end, we gather and analyze posts mentioning "DDoS" on the popular Bitcoin forum bitcointalk.org. Starting from around 3 000 different posts made between May 2011 and October 2013, we document 142 unique DDoS attacks on 40 Bitcoin services. We find that 7% of all known operators have been attacked, but that currency exchanges, mining pools, gambling operators, eWallets, and financial services are much more likely to be attacked than other services. Not coincidentally, we find currency exchanges and mining pools are much more likely to have DDoS protection such as CloudFlare, Incapsula, or Amazon Cloud. We show that those services that have been attacked are more than three times as likely to buy anti-DDoS services than operators who have not been attacked. We find that big mining pools (those with historical hashrate shares of at least 5%) are much more likely to be DDoSed than small pools. We investigate Mt. Gox as a case study for DDoS attacks on currency exchanges and find a disproportionate amount of DDoS reports made during the large spike in trading volume and exchange rates in spring 2013. We conclude by outlining future opportunities for researching DDoS attacks on Bitcoin.

Question: What is the prevalence of DDoS attacks on Bitcoin?


Activity Forecasting. We address the task of inferring the future actions of people from noisy visual input. We denote this task activity forecasting. To achieve accurate activity forecasting, our approach models the effect of the physical environment on the choice of human actions. This is accomplished by the use of state-of-the-art semantic scene understanding combined with ideas from optimal control theory. Our unified model also integrates several other key elements of activity analysis, namely, destination forecasting, sequence smoothing and transfer learning. As proof-of-concept, we focus on the domain of trajectory-based activity analysis from visual input. Experimental results demonstrate that our model accurately predicts distributions over future actions of individuals. We show how the same techniques can improve the results of tracking algorithms by leveraging information about likely goals and trajectories.

Question: What is activity forecasting?


Fingerstroke time estimates for touchscreen-based mobile gaming interaction.. The growing popularity of gaming applications and ever-faster mobile carrier networks have called attention to an intriguing issue that is closely related to command input performance. A challenging mirroring game service, which simultaneously provides game service to both PC and mobile phone users, allows them to play games against each other with very different control interfaces. Thus, for efficient mobile game design, it is essential to apply a new predictive model for measuring how potential touch input compares to the PC interfaces. The present study empirically tests the keystroke-level model (KLM) for predicting the time performance of basic interaction controls on the touch-sensitive smartphone interface (i.e., tapping, pointing, dragging, and flicking). A modified KLM, tentatively called the fingerstroke-level model (FLM), is proposed using time estimates on regression models.

Question: How to measure the time performance of touchscreen-based mobile gaming interaction?


From wireless sensor networks towards cyber physical systems. In the past two decades, a lot of research activities have been dedicated to the fields of mobile ad hoc network (MANET) and wireless sensor networks (WSN). More recently, the cyber physical system (CPS) has emerged as a promising direction to enrich the interactions between physical and virtual worlds. In this article, we first review some research activities inWSN, including networking issues and coverage and deployment issues. Then,we review some CPS platforms and systems that have been developed recently, including health care, navigation, rescue, intelligent transportation, social networking, and gaming applications. Through these reviews, we hope to demonstrate how CPS applications exploit the physical information collected by WSNs to bridge real and cyber spaces and identify important research challenges related to CPS designs. © 2011 Elsevier B.V. All rights reserved.

Question: What is a cyber physical system?


Predicting Learning by Analyzing Eye-Gaze Data of Reading Behavior. Researchers have highlighted how tracking learners' eye-gaze can reveal their reading behaviors and strategies, and this provides a framework for developing personalized feedback to improve learning and problem solving skills. In this paper, we describe analyses of eye-gaze data collected from 16 middle school students who worked with Betty's Brain, an open-ended learning environment, where students learn science by building causal models to teach a virtual agent. Our goal was to test whether newly available consumer-level eye trackers could provide the data that would allow us to probe further into the relations between students' reading of hypertext resources and building of graphical causal maps. We collected substantial amounts of gaze data and then constructed classifier models to predict whether students would be successful in constructing correct causal links. These models predicted correct map-building actions with an accuracy of 80% (F1 = 0.82; Cohen's kappa κ = 0.62). The proportions of correct link additions are in turn directly related to learners' performance in Betty's Brain. Therefore, students' gaze patterns when reading the resources may be good indicators of their overall performance. These findings can be used to support the development of a real-time eye gaze analysis system, which can detect students reading patterns, and when necessary provide support to help them become better readers.

Question: How can eye-gaze data be used to predict learning?


Investigating Causal Relations by Econometric Models and Cross-spectral Methods. Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/journals/econosoc.html. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Question: How to use JSTOR?


Facial Expression Recognition Using a Large Out-of-Context Dataset. We develop a method for emotion recognition from facial imagery. This problem is challenging in part because of the subjectivity of ground truth labels and in part because of the relatively small size of existing labeled datasets. We use the FER+ dataset [8], a dataset with multiple emotion labels per image, in order to build an emotion recognition model that encompasses a full range of emotions. Since the amount of data in the FER+ dataset is limited, we explore the use of a much larger face dataset, MS-Celeb-1M [41], in conjunction with the FER+ dataset. Specific layers within an Inception-ResNet-v1 [13, 38] model trained for facial recognition are used for the emotion recognition problem. Thus, we leverage the MS-Celeb-1M dataset in addition to the FER+ dataset and experiment with different architectures to assess the overall performance of neural networks to recognize emotion using facial imagery.

Question: How to recognize emotions from facial imagery?


Multi-image matching using multi-scale oriented patches. This paper describes a novel multi-view matching framework based on a new type of invariant feature. Our features are located at Harris corners in discrete scale-space and oriented using a blurred local gradient. This defines a rotationally invariant frame in which we sample a feature descriptor, which consists of an 8 /spl times/ 8 patch of bias/gain normalised intensity values. The density of features in the image is controlled using a novel adaptive non-maximal suppression algorithm, which gives a better spatial distribution of features than previous approaches. Matching is achieved using a fast nearest neighbour algorithm that indexes features based on their low frequency Haar wavelet coefficients. We also introduce a novel outlier rejection procedure that verifies a pairwise feature match based on a background distribution of incorrect feature matches. Feature matches are refined using RANSAC and used in an automatic 2D panorama stitcher that has been extensively tested on hundreds of sample inputs.

Question: How to match images using multi-scale oriented patches?


Single‐cell sequencing maps gene expression to mutational phylogenies in PDGF‐ and EGF‐driven gliomas. Glioblastoma multiforme (GBM) is the most common and aggressive type of primary brain tumor. Epidermal growth factor (EGF) and platelet-derived growth factor (PDGF) receptors are frequently amplified and/or possess gain-of-function mutations in GBM However, clinical trials of tyrosine-kinase inhibitors have shown disappointing efficacy, in part due to intra-tumor heterogeneity. To assess the effect of clonal heterogeneity on gene expression, we derived an approach to map single-cell expression profiles to sequentially acquired mutations identified from exome sequencing. Using 288 single cells, we constructed high-resolution phylogenies of EGF-driven and PDGF-driven GBMs, modeling transcriptional kinetics during tumor evolution. Descending the phylogenetic tree of a PDGF-driven tumor corresponded to a progressive induction of an oligodendrocyte progenitor-like cell type, expressing pro-angiogenic factors. In contrast, phylogenetic analysis of an EGFR-amplified tumor showed an up-regulation of pro-invasive genes. An in-frame deletion in a specific dimerization domain of PDGF receptor correlates with an up-regulation of growth pathways in a proneural GBM and enhances proliferation when ectopically expressed in glioma cell lines. In-frame deletions in this domain are frequent in public GBM data.

Question: What is the difference between proneural and mesenchymal gliomas?


SLANGZY: a fuzzy logic-based algorithm for English slang meaning selection. The text present on online forums and social media platforms conventionally does not follow a standard sentence structure and uses words that are commonly termed as slang or Internet language. Online text mining involves a surfeit of slang words; however, there is a distinct lack of reliable resources available to find accurate meanings of these words. We aim to bridge this gap by introducing SLANGZY, a fuzzy logic-based algorithm for English slang meaning selection which uses a mathematical factor termed as "slang factor" to judge the accuracy of slang word definitions found in Urban Dictionary, the largest Slang Dictionary on the Internet. This slang factor is used to rank definitions of English slang words retrieved from over 4 million unique words on popular social media platforms such as Twitter, YouTube and Reddit. We investigate the usefulness of SLANGZY over Urban Dictionary to find meanings of slang words in social media text and achieve encouraging results due to recognizing the importance of multiple criteria in the calculation of slang factor in the algorithm over successive experiments. The performance of SLANGZY with optimum weights for each criterion is further assessed using the accuracy, error rate, F-Score as well as a difference factor for English slang word definitions. To further illustrate the results, a web portal is created to display the contents of the Slang Dictionary consisting of definitions ranked according to the calculated slang factors.

Question: What is a fuzzy logic-based algorithm for English slang meaning selection?


A Blind Navigation System Using RFID for Indoor Environments. A location and tracking system becomes very important to our future world of pervasive computing, where information is all around us. Location is one of the most needed information for emerging and future applications. Since the public use of GPS satellite is allowed, several state-of-the-art devices become part of our life, e.g. a car navigator and a mobile phone with a built-in GPS receiver. However, location information for indoor environments is still very limited as mentioned in paper. Several techniques are proposed to get location information in buildings such as using a radio signal triangulation. Using Radio Frequency Identification (RFID) tags is a new way of giving location information to users. Due to its passive communication circuit, RFID tags can be embedded almost anywhere without an energy source. The tags stores location information and give it to any reader that is within a proximity range which can be up to 7-10 centimeters. In this paper RFID-based system for navigation in a building for blind people or visually impaired

Question: What is the difference between a radio signal triangulation and an RFID system?


Accelerating CNN inference on FPGAs: A Survey. Convolutional Neural Networks (CNNs) are currently adopted to solve an ever greater number of problems, ranging from speech recognition to image classi cation and segmentation. The large amount of processing required by CNNs calls for dedicated and tailored hardware support methods. Moreover, CNN workloads have a streaming nature, well suited to recon gurable hardware architectures such as FPGAs. The amount and diversity of research on the subject of CNN FPGA acceleration within the last 3 years demonstrates the tremendous industrial and academic interest. This paper presents a state-of-the-art of CNN inference accelerators over FPGAs. The computational workloads, their parallelism and the involved memory accesses are analyzed. At the level of neurons, optimizations of the convolutional and fully connected layers are explained and the performances of the di erent methods compared. At the network level, approximate computing and datapath optimization methods are covered and state-of-the-art approaches compared. The methods and tools investigated in this survey represent the recent trends in FPGA CNN inference accelerators and will fuel the future advances on e cient hardware deep learning.

Question: What is the state of the art of CNN inference on FPGAs?


Hypothalamic Orexin Neurons Regulate Arousal According to Energy Balance in Mice. Mammals respond to reduced food availability by becoming more wakeful and active, yet the central pathways regulating arousal and instinctual motor programs (such as food seeking) according to homeostatic need are not well understood. We demonstrate that hypothalamic orexin neurons monitor indicators of energy balance and mediate adaptive augmentation of arousal in response to fasting. Activity of isolated orexin neurons is inhibited by glucose and leptin and stimulated by ghrelin. Orexin expression of normal and ob/ob mice correlates negatively with changes in blood glucose, leptin, and food intake. Transgenic mice, in which orexin neurons are ablated, fail to respond to fasting with increased wakefulness and activity. These findings indicate that orexin neurons provide a crucial link between energy balance and arousal.

Question: What is the function of orexin neurons?


Boosting Alzheimer Disease Diagnosis Using PET Images. Alzheimer's disease (AD) is one of the most frequent type of dementia. Currently there is no cure for AD and early diagnosis is crucial to the development of treatments that can delay the disease progression. Brain imaging can be a biomarker for Alzheimer's disease. This has been shown in several works with MR Images, but in the case of functional imaging such as PET, further investigation is still needed to determine their ability to diagnose AD, especially at the early stage of Mild Cognitive Impairment (MCI). In this paper we study the use of PET images of the ADNI database for the diagnosis of AD and MCI. We adopt a Boosting classification method, a technique based on a mixture of simple classifiers, which performs feature selection concurrently with the segmentation thus is well suited to high dimensional problems. The Boosting classifier achieved an accuracy of 90.97% in the detection of AD and 79.63% in the detection of MCI.

Question: What is the accuracy of the boosting classifier?


Experience in System Design for Human-Robot Teaming in Urban Search and Rescue. The paper describes experience with applying a user-centric design methodology in developing systems for human-robot teaming in Urban Search & Rescue. A human-robot team consists of several semi-autonomous robots (rovers/UGVs, microcopter/UAVs), several humans at an off-site command post (mission commander, UGV operators) and one on-site human (UAV operator). This system has been developed in close cooperation with several rescue organizations, and has been deployed in a real-life tunnel accident use case. The human-robot team jointly explores an accident site, communicating using a multi-modal team interface, and spoken dialogue. The paper describes the development of this complex socio-technical system per se, as well as recent experience in evaluating the performance of this system.

Question: What is a human-robot team?


The LaHave House Project: Towards an Automated Architectural Design Service. The LaHave House Project explores the creation of an automated architectural design service based on an industrial design approach to architecture in which Architects design families of similarly structured objects, rather than individual ones. Our current system consists of three software components: 1) A design engine that uses shape grammars to generate a library of preliminary level house designs, 2) A design development tool that permits end-users to selected, customize and visualize designs drawn from the library and 3) A building systems configuration tool that transforms customized designs into working/assembly drawings. Our aim is to generate modern realizable houses that combine beautiful forms with a modern approach to space planning. We are currently completing an integrated online prototype that allows end-users to select, customize and visualization generated house designs over the Internet in 3D, using a Java/VRML based design development tool.

Question: What is the aim of the LaHave House Project?


Semi-Supervised Learning for Relation Extraction. This paper proposes a semi-supervised learning method for relation extraction. Given a small amount of labeled data and a large amount of unlabeled data, it first bootstraps a moderate number of weighted support vectors via SVM through a co-training procedure with random feature projection and then applies a label propagation (LP) algorithm via the bootstrapped support vectors. Evaluation on the ACE RDC 2003 corpus shows that our method outperforms the normal LP algorithm via all the available labeled data without SVM bootstrapping. Moreover, our method can largely reduce the computational burden. This suggests that our proposed method can integrate the advantages of both SVM bootstrapping and label propagation.

Question: What is the ACE RDC 2003 corpus?


A machine learning approach for filtering Monte Carlo noise. The most successful approaches for filtering Monte Carlo noise use feature-based filters (e.g., cross-bilateral and cross non-local means filters) that exploit additional scene features such as world positions and shading normals. However, their main challenge is finding the optimal weights for each feature in the filter to reduce noise but preserve scene detail. In this paper, we observe there is a complex relationship between the noisy scene data and the ideal filter parameters, and propose to learn this relationship using a nonlinear regression model. To do this, we use a multilayer perceptron neural network and combine it with a matching filter during both training and testing. To use our framework, we first train it in an offline process on a set of noisy images of scenes with a variety of distributed effects. Then at run-time, the trained network can be used to drive the filter parameters for new scenes to produce filtered images that approximate the ground truth. We demonstrate that our trained network can generate filtered images in only a few seconds that are superior to previous approaches on a wide range of distributed effects such as depth of field, motion blur, area lighting, glossy reflections, and global illumination.

Question: What is a multilayer perceptron neural network?


Narrative Schema Stability in News Text. We investigate the stability of narrative schemas (Chambers & Jurafsky, 2009) automatically induced from a news corpus, representing recurring narratives in a corpus. If such techniques produce meaningful results, we should expect that small changes to the corpus will result in only small changes to the induced schemas. We describe experiments involving successive ablation of a corpus and cross-validation at each stage of ablation, on schemas generated by three different techniques over a general news corpus and topically-specific subcorpora. We also develop a method for evaluating the similarity between sets of narrative schemas, and thus the stability of the schema induction algorithms. This stability analysis affirms the heterogeneous/homogeneous document category hypothesis first presented in Simonson & Davis (2016), whose technique is problematically limited. Additionally, increased ablation leads to increasing stability, so the smaller the remaining corpus, the more stable schema generation appears to be. We surmise that as a corpus grows larger, novel and more varied narratives continue to appear and stability declines, though at some point this decline levels off as new additions to the corpus consist essentially of "more of the same."

Question: How stable are narrative schemas?


Unsupervised document classification using sequential information maximization. We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential (sIB) approach is guaranteed to converge to a local maximum of the information with time and space complexity typically linear in the data size. information, as required by the original IB principle. Moreover, the time and space complexity are significantly improved. We apply this algorithm to unsupervised document classification. In our evaluation, on small and medium size corpora, the sIB is found to be consistently superior to all the other clustering methods we examine, typically by a significant margin. Moreover, the sIB results are comparable to those obtained by a supervised Naive Bayes classifier. Finally, we propose a simple procedure for trading cluster's recall to gain higher precision, and show how this approach can extract clusters which match the existing topics of the corpus almost perfectly.

Question: How to classify documents?


Towards The Deep Model: Understanding Visual Recognition Through Computational Models. Introduction Vision, due to its significance in surviving and socializing, is one of the most important and  extensively studied sensory functions in the human brain. In order to fully understand visual  information processing, or more specifically, visual recognition, David Marr proposed the  Tri-level Hypothesis [29], in that three levels of the system should be studied: the computational  goal of the system, the internal representation or the algorithm the system uses to achieve the  goal, and the neural substrates that implement the system. It is well-known that visual  recognition in the human brain is implemented by the ventral visual pathway [32], which  receives visual information from the retina and goes through a layered structure including V1  (also known as the primary visual cortex), V2, V4, before reaching the inferior temporal cortex  (IT). The topographic mapping between the retina and the human visual cortex follows a  log-polar transformation, in which the Cartesian coordinates of the retina are transformed to  polar coordinates (polar angle and eccentricity) in the human visual cortex. From V1 to V4, each  of the visual areas contains a complete polar angle and eccentricity map, and have a increasing  receptive field (RF) size and respond to increasing complex visual features [12,22]. In higher  level visual areas such as the ventral temporal cortex (VTC), studies using functional magnetic  resonance imaging (fMRI) and diffusion tensor imaging (DTI) have found there exists visual  category-selective regions, such as the Fusiform Face Area (FFA, [26]) for face processing, the  Parahippocampal Place Area (PPA, [13]) for scene perception, and the Lateral Occipital  Complex (LOC, [19]) for general object recognition. Grill-Spector and Malach [20] proposed that  layer-based hierarchical processing, together with the functional specialization, are the two  organizing

Question: What is the difference between the ventral and dorsal visual pathways?


Design of wideband printed rectangular monopole patch antenna with band notch. In this paper, a microstrip-line fed printed monopole rectangular microstrip patch antenna with wide bandwidth having frequency band-notch function for wireless communication have been proposed. Bandwidth enhancement is obtained by rounding the corners of rectangular patch and modifying the ground plane. By cutting rectangular slot on the radiating element, the frequency band-notch characteristic is obtained. FR-4 substrate having dielectric constant of 4.4 and thickness of 1.6 mm is used to simulate printed rectangular monopole antenna (PRMA) having an overall size of substrate 55 × 45 mm2. The designed antenna is simulated using CAD FEKO simulation software. The proposed antenna has impedance bandwidth of 6.61 GHz (2.11 GHz to 8.72 GHz) with a rejection band from 3.03 GHz to 3.48 GHz. The observed gain of proposed antenna is 2.42 dBi. The proposed microstrip patch antenna is fabricated, tested and measured result is presented in this paper.

Question: How to design a wideband antenna?


Multimodal Machine Learning: A Survey and Taxonomy. Our experience of the world is multimodal - we see objects, hear sounds, feel texture, smell odors, and taste flavors. Modality refers to the way in which something happens or is experienced and a research problem is characterized as multimodal when it includes multiple such modalities. In order for Artificial Intelligence to make progress in understanding the world around us, it needs to be able to interpret such multimodal signals together. Multimodal machine learning aims to build models that can process and relate information from multiple modalities. It is a vibrant multi-disciplinary field of increasing importance and with extraordinary potential. Instead of focusing on specific multimodal applications, this paper surveys the recent advances in multimodal machine learning itself and presents them in a common taxonomy. We go beyond the typical early and late fusion categorization and identify broader challenges that are faced by multimodal machine learning, namely: representation, translation, alignment, fusion, and co-learning. This new taxonomy will enable researchers to better understand the state of the field and identify directions for future research.

Question: What is the difference between early and late fusion?


Analysis of Bayesian Classification based Approaches for Android Malware Detection. Mobile malware has been growing in scale and complexity spurred by the unabated uptake of smartphones worldwide. Android is fast becoming the most popular mobile platform resulting in sharp increase in malware targeting the platform. Additionally, Android malware is evolving rapidly to evade detection by traditional signature-based scanning. Despite current detection measures in place, timely discovery of new malware is still a critical issue. This calls for novel approaches to mitigate the growing threat of zero-day Android malware. Hence, in this paper we develop and analyze proactive Machine Learning approaches based on Bayesian classification aimed at uncovering unknown Android malware via static analysis. The study, which is based on a large malware sample set of majority of the existing families, demonstrates detection capabilities with high accuracy. Empirical results and comparative analysis are presented offering useful insight towards development of effective static-analytic Bayesian classification based solutions for detecting unknown Android malware.

Question: What is the size of the canadian military?


Security and Privacy Issues in Wireless Sensor Networks for Healthcare Applications. The use of wireless sensor networks (WSN) in healthcare applications is growing in a fast pace. Numerous applications such as heart rate monitor, blood pressure monitor and endoscopic capsule are already in use. To address the growing use of sensor technology in this area, a new field known as wireless body area networks (WBAN or simply BAN) has emerged. As most devices and their applications are wireless in nature, security and privacy concerns are among major areas of concern. Due to direct involvement of humans also increases the sensitivity. Whether the data gathered from patients or individuals are obtained with the consent of the person or without it due to the need by the system, misuse or privacy concerns may restrict people from taking advantage of the full benefits from the system. People may not see these devices safe for daily use. There may also possibility of serious social unrest due to the fear that such devices may be used for monitoring and tracking individuals by government agencies or other private organizations. In this paper we discuss these issues and analyze in detail the problems and their possible measures.

Question: What is the difference between a wireless body area network and a wireless body area sensor network?


Use of RFID Based Real Time Location Tracking System to Curb Diversion of Transit Goods in East Africa. In this paper, RFID based Real Time Location Tracking System (RTLS) for tracking transit goods is discussed. The system was designed to address the problem of diversions of transit wet cargo destined for hinterland countries into the local markets, so as to evade payment of duties and taxes. Transit goods are currently tracked manually and by use of manual physical escorts. Reliance on manual methods has rendered the system open to abuse by unscrupulous traders and clearing agents; at times in collusion with government officers. To be effective in tracking wet cargo, the required solution was established to be one that not only provides information in real time but also with features for intervention when cargo is perceived to be at risk. This paper discusses the design and implementation of RTLS for tracking wet cargo, and points out the strenghts, benefits, weaknesses and limitations of the solution. The effectiveness of the solution was demonstrated in addressing the weaknesses of the current manual tracking system in curbing diversion for wet cargo. In addition, the use of RTLS led to a reduction in turn around times by between thirty to forty percent compared to those which are manualy tracked. KeywordsElectronic Seals, RFID, Transit goods, Tanker Tracking, Real Time Location Tracking Systems, Cargo Tracking

Question: What is the difference between a wet cargo and a dry cargo?


Prospect theory on the brain? Toward a cognitive neuroscience of decision under risk.. Most decisions must be made without advance knowledge of their consequences. Economists and psychologists have devoted much attention to modeling decisions made under conditions of risk in which options can be characterized by a known probability distribution over possible outcomes. The descriptive shortcomings of classical economic models motivated the development of prospect theory (D. Kahneman, A. Tversky, Prospect theory: An analysis of decision under risk. Econometrica, 4 (1979) 263-291; A. Tversky, D. Kahneman, Advances in prospect theory: Cumulative representation of uncertainty. Journal of Risk and Uncertainty, 5 (4) (1992) 297-323) the most successful behavioral model of decision under risk. In the prospect theory, subjective value is modeled by a value function that is concave for gains, convex for losses, and steeper for losses than for gains; the impact of probabilities are characterized by a weighting function that overweights low probabilities and underweights moderate to high probabilities. We outline the possible neural bases of the components of prospect theory, surveying evidence from human imaging, lesion, and neuropharmacology studies as well as animal neurophysiology studies. These results provide preliminary suggestions concerning the neural bases of prospect theory that include a broad set of brain regions and neuromodulatory systems. These data suggest that focused studies of decision making in the context of quantitative models may provide substantial leverage towards a fuller understanding of the cognitive neuroscience of decision making.

Question: What is the neural basis of prospect theory?


Incorporating Entity Correlation Knowledge into Topic Modeling. Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for exploring hidden topics in text corpora. Standard LDA model suffers the problem that the topic assignment of each word is independent and lacks the mechanism to utilize the rich prior background knowledge to learn semantically coherent topics. To address this problem, in this paper, we propose a model called Entity Correlation Latent Dirichlet Allocation (EC-LDA) by incorporating constraints derived from entity correlations as the prior knowledge into LDA topic model. Different from other knowledge-based topic models which extract the knowledge information directly from the train dataset itself or even from the human judgements, for our work, we take advantage of the prior knowledge from the external knowledge base (Freebase 1, in our experiment). Hence, our approach is more suitable to widely kinds of text corpora in different scenarios. We fit our proposed model using Gibbs sampling. Experiment results demonstrate the effectiveness of our model compared with standard LDA.

Question: How to incorporate entity correlation knowledge into topic modeling?


Larger-Context Language Modelling with Recurrent Neural Network. In this work, we propose a novel method to incorporate corpus-level discourse information into language modelling. We call this larger-context language model. We introduce a late fusion approach to a recurrent language model based on long short-term memory units (LSTM), which helps the LSTM unit keep intra-sentence dependencies and inter-sentence dependencies separate from each other. Through the evaluation on three corpora (IMDB, BBC, and PennTree Bank), we demonstrate that the proposed model improves perplexity significantly. In the experiments, we evaluate the proposed approach while varying the number of context sentences and observe that the proposed late fusion is superior to the usual way of incorporating additional inputs to the LSTM. By analyzing the trained largercontext language model, we discover that content words, including nouns, adjectives and verbs, benefit most from an increasing number of context sentences. This analysis suggests that larger-context language model improves the unconditional language model by capturing the theme of a document better and more easily.

Question: How does the proposed model improve perplexity?


Online Fault Detection and Diagnosis in Photovoltaic Systems Using Wavelet Packets. The nonlinear characteristics of a photovoltaic (PV) array, maximum power point tracking of the PV inverter, presence of blocking diodes, and lower irradiation prevent the conventional protection devices to trip under certain faults and lead to reduced system efficiency and fire hazards. Moreover, the PV characteristics under certain partial shading conditions are similar to that under fault conditions. Hence, it is imperative to detect faults and differentiate faults from the partial shading condition to avoid false tripping of the system. This paper proposes a simple fault detection method using the available data of array voltage and current by means of wavelet packets. The proposed scheme is simulated using MATLAB/Simulink and is experimentally tested on a 1.6-kW $\text{4}\,\times \,\text{4}$ PV array to validate its performance.

Question: What is the difference between a photovoltaic array and a photovoltaic inverter?


Encoder Semantic Decoder Input Image MultiTask Loss Instance Decoder Depth Decoder Semantic Task Uncertainty Instance Task Uncertainty Depth Task Uncertainty Σ. Numerous deep learning applications benefit from multi-task learning with multiple regression and classification objectives. In this paper we make the observation that the performance of such systems is strongly dependent on the relative weighting between each task's loss. Tuning these weights by hand is a difficult and expensive process, making multi-task learning prohibitive in practice. We propose a principled approach to multi-task deep learning which weighs multiple loss functions by considering the homoscedastic uncertainty of each task. This allows us to simultaneously learn various quantities with different units or scales in both classification and regression settings. We demonstrate our model learning per-pixel depth regression, semantic and instance segmentation from a monocular input image. Perhaps surprisingly, we show our model can learn multi-task weightings and outperform separate models trained individually on each task.

Question: How to train a multi-task model?


Design of Compact Dual Band High Directive Electromagnetic Bandgap (EBG) Resonator Antenna Using Artificial Magnetic Conductor. A compact high directive EBG resonator antenna operating in two frequency bands is described. Two major contributions to this compact design are using single layer superstrate and using artificial surface as ground plane. To obtain only the lower operating frequency band using superstrate layer is enough, but to extract the upper operating frequency band both superstrate layer and artificial surface as ground plane are necessary. Therefore, design of a superstrate to work in two frequency bands is very important. Initially, using appropriate frequency selective surface (FSS) structure with square loop elements, we design an optimum superstrate layer for each frequency band separately to achieve maximum directivity. Also, to design an artificial surface to work in the upper frequency band we use a suitable FSS structure over dielectric layer backed by PEC. Next, by using the idea of FSS structure with double square loop elements we propose FSS structure with modified double square loop elements, so that it operates in both of the desired operating frequency bands simultaneously. Finally, the simulation results for two operating frequency bands are shown to have good agreement with measurements.

Question: How to design a superstrate to work in two frequency bands?


Motivations and Methods for Text Simplification. Long and complicated sentences prove to be a stumbling block for current systems relying on NL input. These systems stand to gain from methods that syntactically simplify such sentences. To simplify a sentence, we need an idea of the structure of the sentence, to identify the components to be separated out. Obviously a parser could be used to obtain the complete structure of the sentence. However, full parsing is slow and prone to failure, especially on complex sentences. In this paper, we consider two alternatives to full parsing which could be used for simpli cation. The rst approach uses a Finite State Grammar (FSG) to produce noun and verb groups while the second uses a Supertagging model to produce dependency linkages. We discuss the impact of these two input representations on the simpli cation process. 1 Reasons for Text Simpli cation Long and complicated sentences prove to be a stumbling block for current systems which rely on natural language input. These systems stand to gain from methods that preprocess such sentences so as to make them simpler. Consider, for example, the following sentence: (1) The embattled Major government survived a crucial vote on coal pits closure as its last-minute concessions curbed the extent of Tory revolt over an issue that generated unusual heat in the House of Commons and brought the miners to London streets. Such sentences are not uncommon in newswire texts. Compare this with the multi-sentence version which has been manually simpli ed: (2) The embattled Major government survived a crucial vote on coal pits closure. Its last-minute concessions curbed the extent of On leave from the National Centre for Software Technology, Gulmohar Cross Road No. 9, Juhu, Bombay 400 049, India Tory revolt over the coal-mine issue. This issue generated unusual heat in the House of Commons. It also brought the miners to

Question: What is the difference between the original and the simplified version of the sentence?


Effects of loneliness and differential usage of Facebook on college adjustment of first-year students. The popularity of social network sites (SNSs) among college students has stimulated scholarship examining the relationship between SNS use and college adjustment. The present research furthers our understanding of SNS use by studying the relationship between loneliness, varied dimensions of Facebook use, and college adjustment among first-year students. We looked at three facets of college adjustment: social adjustment, academic motivation, and perceived academic performance. Compulsive use of Facebook had a stronger association with academic motivation than habitual use of Facebook, but neither were directly correlated with academic performance. Too much time spent on Facebook was weakly but directly associated with poorer perceived academic performance. Loneliness was a stronger indicator of college adjustment than any dimension of Facebook usage. 2014 Elsevier Ltd. All rights reserved.

Question: What is the relationship between loneliness and academic performance?


FARMER: a novel approach to file access correlation mining and evaluation reference model for optimizing peta-scale file system performance. File correlation, which refers to a relationship among related files that can manifest in the form of their common access locality (temporal and/or spatial), has become an increasingly important consideration for performance enhancement in peta-scale storage systems. Previous studies on file correlations mainly concern with two aspects of files: file access sequence and semantic attribute. Based on mining with regard to these two aspects of file systems, various strategies have been proposed to optimize the overall system performance. Unfortunately, all of these studies consider either file access sequences or semantic attribute information separately and in isolation, thus unable to accurately and effectively mine file correlations, especially in large-scale distributed storage systems.  This paper introduces a novel File Access coRrelation Mining and Evaluation Reference model (FARMER) for optimizing petascale file system performance that judiciously considers both file access sequences and semantic attributes simultaneously to evaluate the degree of file correlations by leveraging the Vector Space Model (VSM) technique adopted from the Information Retrieval field. We extract the file correlation knowledge from some typical file system traces using FARMER, and incorporate FARMER into a real large-scale object-based storage system as a case study to dynamically infer file correlations and evaluate the benefits and costs of a FARMER-enabled prefetching algorithm for the metadata servers under real file system workloads. Experimental results show that FARMER can mine and evaluate file correlations more accurately and effectively. More significantly, the FARMER-enabled prefetching algorithm is shown to reduce the metadata operations latency by approximately 24-35% when compared to a state-of-the-art metadata prefetching algorithm

Question: What is the file correlation mining and evaluation reference model for optimizing peta-scale file system performance?


Adversarial Objectives for Text Generation. Language models can be used to generate text by iteratively sampling words conditioned on previously sampled words. In this work, we explore adversarial objectives to obtain good text generations by training a recurrent language model to keep its hidden state statistics during sampling similar to what it has sees during maximum likelihood estimation (MLE) training. We analyze the convergence of these models and discuss the effect of the adversarial objective on word-level and character-level language models. We find that using an adversarial objective assists the MLE objective and results in faster convergence and lower validation perplexities for character-level language models. We also collect sentence quality ratings from human participants and show that character-level language models with the adversarial objective generates qualitatively better sentences than the standard character-level recurrent language model.

Question: What is the adversarial objective?


Visual saliency based on multiscale deep features. Visual saliency is a fundamental problem in both cognitive and computational sciences, including computer vision. In this paper, we discover that a high-quality visual saliency model can be learned from multiscale features extracted using deep convolutional neural networks (CNNs), which have had many successes in visual recognition tasks. For learning such saliency models, we introduce a neural network architecture, which has fully connected layers on top of CNNs responsible for feature extraction at three different scales. We then propose a refinement method to enhance the spatial coherence of our saliency results. Finally, aggregating multiple saliency maps computed for different levels of image segmentation can further boost the performance, yielding saliency maps better than those generated from a single segmentation. To promote further research and evaluation of visual saliency models, we also construct a new large database of 4447 challenging images and their pixelwise saliency annotations. Experimental results demonstrate that our proposed method is capable of achieving state-of-the-art performance on all public benchmarks, improving the F-Measure by 5.0% and 13.2% respectively on the MSRA-B dataset and our new dataset (HKU-IS), and lowering the mean absolute error by 5.7% and 35.1% respectively on these two datasets.

Question: What is visual saliency?


Abnormal use of facial information in high-functioning autism.. Altered visual exploration of faces likely contributes to social cognition deficits seen in autism. To investigate the relationship between face gaze and social cognition in autism, we measured both face gaze and how facial regions were actually used during emotion judgments from faces. Compared to IQ-matched healthy controls, nine high-functioning adults with autism failed to make use of information from the eye region of faces, instead relying primarily on information from the mouth. Face gaze accounted for the increased reliance on the mouth, and partially accounted for the deficit in using information from the eyes. These findings provide a novel quantitative assessment of how people with autism utilize information in faces when making social judgments.

Question: How does autism affect face gaze?


gHull: A GPU algorithm for 3D convex hull. A novel algorithm is presented to compute the convex hull of a point set in ℝ3 using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull, the algorithm derives the approximation of the convex hull from the former. The other extreme vertices of the convex hull are then found by using a two-round checking in the digital and the continuous space successively. The algorithm does not need explicit locking or any other concurrency control mechanism, thus it can maximize the parallelism available on the modern GPU.  The implementation using the CUDA programming model on NVIDIA GPUs is exact and efficient. The experiments show that it is up to an order of magnitude faster than other sequential convex hull implementations running on the CPU for inputs of millions of points. The works demonstrate that the GPU can be used to solve nontrivial computational geometry problems with significant performance benefit.

Question: What is the convex hull of a point set?


CNN-based ranking for biomedical entity normalization. Most state-of-the-art biomedical entity normalization systems, such as rule-based systems, merely rely on morphological information of entity mentions, but rarely consider their semantic information. In this paper, we introduce a novel convolutional neural network (CNN) architecture that regards biomedical entity normalization as a ranking problem and benefits from semantic information of biomedical entities. The CNN-based ranking method first generates candidates using handcrafted rules, and then ranks the candidates according to their semantic information modeled by CNN as well as their morphological information. Experiments on two benchmark datasets for biomedical entity normalization show that our proposed CNN-based ranking method outperforms traditional rule-based method with state-of-the-art performance. We propose a CNN architecture that regards biomedical entity normalization as a ranking problem. Comparison results show that semantic information is beneficial to biomedical entity normalization and can be well combined with morphological information in our CNN architecture for further improvement.

Question: What is the cnn architecture for biomedical entity normalization?