Applying PCA for Traffic Anomaly Detection: Problems and Solutions. Spatial Principal Component Analysis (PCA) has been proposed for network-wide anomaly detection. A recent work has shown that PCA is very sensitive to calibration settings, unfortunately, the authors did not provide further explanations for this observation. In this paper, we fill this gap and provide the reasoning behind the found discrepancies. First, we revisit PCA for anomaly detection and evaluate its performance on our data. We develop a slightly modified version of PCA that uses only data from a single router. Instead of correlating data across different spatial measurement points, we correlate the data across different metrics. With the help of the analyzed data, we explain the pitfalls of PCA and underline our argumentation with measurement results. We show that the main problems that make PCA difficult to apply are (i) the temporal correlation in the data; (ii) the non-stationarity of the data; and (iii) the difficulty about choosing the right number of components. Moreover, we propose a solution to deal with the most dominant problem, the temporal correlation in data. We find that when we consider temporal correlation, PCA detection results are significantly improved.

Question: What is the difference between PCA and PCA?


Marketing in hypermedia computer-mediated environment: Conceptual foundations. This paper addresses the role of marketing in hypermedia computer-mediated environments (CMEs). Our approach considers hypermedia CMEs to be large-scale (i.e. national or global) networked environments, of which the World Wide Web on the Internet is the first and current global implementation. We introduce marketers to this revolutionary new medium, and propose two structural models of consumer behavior in a CME. Then we examine the set of consequent testable research propositions and marketing implications that flow from the models. Marketing in Hypermedia Computer-Mediated Environments: Conceptual Foundations 1) Introduction Firms communicate with their customers through various media. Traditionally, these media follow a passive one-to-many communication model whereby a firm reaches many current and potential customers, segmented or not, through marketing efforts that allow only limited forms of feedback on the part of the customer. For several years now, a revolution has been developing that is dramatically altering this traditional view of advertising and communication media. This revolution is the Internet, the massive global network of interconnected packet-switched computer networks, and as a new marketing medium, has the potential to radically change the way firms do business with their customers. The Internet operationalizes a model of distributed computing that facilitates interactive multimedia many-to-many communication. As such, the Internet supports discussion groups (e.g. USENET news and moderated and unmoderated mailing lists), multi-player games and communications systems (e.g. MUDs, irc, chat, MUSEs), file transfer, electronic mail, and global information access and retrieval systems (e.g. archie, gopher, and the World Wide Web). The business implications of this model "[where] the engine of democratization sitting on so many desktops is already out of control, is alread

Question: What is the business implications of the Internet?


Distributed Denial-of-Service (DDoS) Threat in Collaborative Environment - A Survey on DDoS Attack Tools and Traceback Mechanisms. Collaborative applications are feasible nowadays and are becoming more popular due to the advancement in internetworking technology. The typical collaborative applications, in India include the Space research, Military applications, Higher learning in Universities and Satellite campuses, State and Central government sponsored projects, e-governance, e-healthcare systems, etc. In such applications, computing resources for a particular institution/organization spread across districts and states and communication is achieved through internetworking. Therefore the computing and communication resources must be protected against security attacks as any compromise on these resources would jeopardize the entire application/mission. Collaborative environment is prone for various threats, of which Distributed Denial of Service (DDoS) attacks are of major concern. DDoS attack prevents legitimate access to critical resources. A survey by Arbor networks reveals that approximately 1,200 DDoS attacks occur per day. As the DDoS attack is coordinated, the defense for the same has to be a collaborative one. To counter DDoS attacks in a collaborative environment, all the routers need to work collaboratively by exchanging their caveat messages with their neighbors. This paper analyses the security measures in a collaborative environment, identifles the popular DDoS attack tools, and surveys the existing traceback mechanisms to trace the real attacker.

Question: What is a collaborative environment?


Advertising and Consumers' Communications. U recently, brand identities were built by firms via brand image advertising. However, the flourishing consumer communication weakened the firms' grip on their brands. The interaction between advertising and consumer communications and their joint impact on brand identity is the focal point of this paper. We present a model in which consumer preference for functional attributes may correlate with the identity they desire to project of themselves. This correlation is known to the firm but not to the consumers. Both the firm and the consumers can communicate their desired brand identity, although the actual brand identity is determined endogeneously by the composition of consumers who purchase it (i.e., what types of people consume the brand). We find that sometimes the firm can strengthen the identity of its brand by refraining from advertising. This result is based on the following intermediate finding: advertising can diminish the endogeneous informativeness of consumer communications by making it one-sided. Furthermore, it turns out that refraining from brand image advertising may be optimal for the firm when the product is especially well positioned to create a strong identity—i.e., when consumer preferences for functional and self-expressive attributes are highly correlated.

Question: What is the optimal advertising strategy for a brand?


Identify Online Store Review Spammers via Social Review Graph. Online shopping reviews provide valuable information for customers to compare the quality of products, store services, and many other aspects of future purchases. However, spammers are joining this community trying to mislead consumers by writing fake or unfair reviews to confuse the consumers. Previous attempts have used reviewers' behaviors such as text similarity and rating patterns, to detect spammers. These studies are able to identify certain types of spammers, for instance, those who post many similar reviews about one target. However, in reality, there are other kinds of spammers who can manipulate their behaviors to act just like normal reviewers, and thus cannot be detected by the available techniques.  In this article, we propose a novel concept of review graph to capture the relationships among all reviewers, reviews and stores that the reviewers have reviewed as a heterogeneous graph. We explore how interactions between nodes in this graph could reveal the cause of spam and propose an iterative computation model to identify suspicious reviewers. In the review graph, we have three kinds of nodes, namely, reviewer, review, and store. We capture their relationships by introducing three fundamental concepts, the trustiness of reviewers, the honesty of reviews, and the reliability of stores, and identifying their interrelationships: a reviewer is more trustworthy if the person has written more honesty reviews; a store is more reliable if it has more positive reviews from trustworthy reviewers; and a review is more honest if many other honest reviews support it. This is the first time such intricate relationships have been identified for spam detection and captured in a graph model. We further develop an effective computation method based on the proposed graph model. Different from any existing approaches, we do not use an review text information. Our model is thus complementary to existing approa

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


Accelerator-Aware Pruning for Convolutional Neural Networks. Convolutional neural networks have shown tremendous performance in computer vision tasks, but their excessive amount of weights and operations prevent them from being adopted in embedded environments. One of the solutions involves pruning, where some unimportant weights are forced to be zero. Many pruning schemes have been proposed, but have focused mainly on the number of pruned weights. The previous pruning schemes hardly considered ASIC or FPGA accelerator architectures. When the pruned networks are run on the accelerators, the lack of architecture consideration casues some inefficiency problems including internal buffer mis-alignment and load imbalance. This paper proposes a new pruning scheme that reflects accelerator architectures. In the proposed scheme, pruning is performed so that the same number of weights remain for each weight group corresponding to activations fetched simultaneously. In this way, the pruning scheme resolves the inefficiency problems. Even with the constraint, the proposed pruning scheme reached a pruning ratio similar to that of the previous unconstrained pruning schemes not only in AlexNet and VGG16 but also in the state-of-the-art very-deep networks like ResNet. Furthermore, the proposed scheme demonstrated a comparable pruning ratio in slimmed networks that were already pruned channel-wisely. In addition to improving the efficiency of previous sparse accelerators, it will be also shown that the proposed pruning scheme can be used to reduce the logic complexity of sparse accelerators.

Question: What is the difference between pruning and sparsification?


A di/dt Feedback-Based Active Gate Driver for Smart Switching and Fast Overcurrent Protection of IGBT Modules. This paper presents an active gate driver (AGD) for IGBT modules to improve their overall performance under normal condition as well as fault condition. Specifically, during normal switching transients, a di/dt feedback controlled current source and current sink is introduced together with a push-pull buffer for dynamic gate current control. Compared to a conventional gate drive strategy, the proposed one has the capability of reducing the switching loss, delay time, and Miller plateau duration during turn-on and turn-off transient without sacrificing current and voltage stress. Under overcurrent condition, it provides a fast protection function for IGBT modules based on the evaluation of fault current level through the di/dt feedback signal. Moreover, the AGD features flexible protection modes, which overcomes the interruption of converter operation in the event of momentary short circuits. A step-down converter is built to evaluate the performance of the proposed driving schemes under various conditions, considering variation of turn-on/off gate resistance, current levels, and short-circuit fault types. Experimental results and detailed analysis are presented to verify the feasibility of the proposed approach.

Question: What is the di/dt feedback-based active gate driver?


An IQ-modulator based heterodyne 77-GHz FMCW colocated MIMO radar system. In this work the realization of a 77-GHz frequency-division multiple-access-based frequency-modulated continuous-wave multiple-input multiple-output radar with four transceiver channels in conjunction with a non-uniform linear antenna array is presented. The radar system, consisting of an RF-frontend utilizes transceiver chips with integrated inphase/quadrature-modulators to generate the frequency shifted transmit signals and a field programmable gate array-based baseband board, is used for test measurements to verify the system performance and to demonstrate the beamforming capability as well as the accuracy of the digital-beamforming method.

Question: What is a heterodyne radar?


Hard Drive Failure Prediction Using Big Data. We design a general framework named Hdoctor for hard drive failure prediction. Hdoctor leverages the power of big data to achieve a significant improvement comparing to all previous researches that used sophisticated machine learning algorithms. Hdoctor exhibits a series of engineering innovations: (1) constructing time dependent features to characterize the Self-Monitoring, Analysis and Reporting Technology (SMART) value transitions during disk failures, (2) combining features to enable the model to learn the correlation among different SMART attributes, (3) regarding circumstance data such as cluster workload, temperature, humidity, location as related features. Meanwhile, Hdoctor collects/labels samples and updates model automatically, and works well for all kinds of disk failure prediction in our intelligent data center. In this work, we use Hdoctor to collect 74,477,717 training records from our clusters involving 220,022 disks. By training a simple and scalable model, our system achieves a detection rate of 97.82%, with a false alarm rate (FAR) of 0.3%, which hugely outperforms all previous algorithms. In addition, Hdoctor is an excellent indicator for how to predict different hardware failures efficiently under various circumstances.

Question: How to predict hard drive failure?


Accurate Whole Human Genome Sequencing using Reversible Terminator Chemistry. DNA sequence information underpins genetic research, enabling discoveries of important biological or medical benefit. Sequencing projects have traditionally used long (400–800 base pair) reads, but the existence of reference sequences for the human and many other genomes makes it possible to develop new, fast approaches to re-sequencing, whereby shorter reads are compared to a reference to identify intraspecies genetic variation. Here we report an approach that generates several billion bases of accurate nucleotide sequence per experiment at low cost. Single molecules of DNA are attached to a flat surface, amplified in situ and used as templates for synthetic sequencing with fluorescent reversible terminator deoxyribonucleotides. Images of the surface are analysed to generate high-quality sequence. We demonstrate application of this approach to human genome sequencing on flow-sorted X chromosomes and then scale the approach to determine the genome sequence of a male Yoruba from Ibadan, Nigeria. We build an accurate consensus sequence from >30× average depth of paired 35-base reads. We characterize four million single-nucleotide polymorphisms and four hundred thousand structural variants, many of which were previously unknown. Our approach is effective for accurate, rapid and economical whole-genome re-sequencing and many other biomedical applications.

Question: What is the cost of sequencing a human genome?


Video retargeting: automating pan and scan. When a video is displayed on a smaller display than originally intended, some of the information in the video is necessarily lost. In this paper, we introduce Video Retargeting that adapts video to better suit the target display, minimizing the important information lost. We define a framework that measures the preservation of the source material, and methods for estimating the important information in the video. Video retargeting crops each frame and scales it to fit the target display. An optimization process minimizes information loss by balancing the loss of detail due to scaling with the loss of content and composition due to cropping. The cropping window can be moved during a shot to introduce virtual pans and cuts, subject to constraints that ensure cinematic plausibility. We demonstrate results of adapting a variety of source videos to small display sizes.

Question: How to retarget a video?


Multi-modal human-machine communication for instructing robot grasping tasks. A major challenge for the realization of intelligent robots is to supply them with cognitive abilities in order to allow ordinary users to program them easily and intuitively. One way of such programming is teaching work tasks by interactive demonstration. To make this effective and convenient for the user, the machine must be capable to establish a common focus of attention and be able to use and integrate spoken instructions, visual perceptions, and non-verbal clues like gestural commands. We report progress in building a hybrid architecture that combines statistical methods, neural networks, and finite state machines into an integrated system for instructing grasping tasks by man-machine interaction. The system combines the GRAVIS-robot for visual attention and gestural instruction with an intelligent interface for speech recognition and linguistic interpretation, and an modality fusion module to allow multi-modal task-oriented man-machine communication with respect to dextrous robot manipulation of objects.

Question: How to teach a robot to grasp objects?


Co-Design for Low Warpage and High Reliability in Advanced Package with TSV-Free Interposer (TFI). TSV-Free Interposer (TFI) technology eliminates TSV fabrication and reduces manufacturing and material cost. Co-design modelling methodology is established for TFI technology with considering wafer process, package assembly and package/board level reliability and thermal performance to optimize structure design, wafer process, assembly process and material selection. Experimental results are used for validating warpage modelling results. Through wafer level modelling, suitable carrier wafer and EMC materials are recommended to control wafer warpage less than 2mm. Effects of package substrate coefficient of thermal expansion (CTE) and stiffener on assembly induced package warpage are simulated to reduce package warpage. The recommended materials and geometry design based on reliability are aligned with that from wafer and package warpage simulation results. The final test vehicle (TV) design and material selection are determined based on co-design modelling results for achieving successful TFI wafer process and package assembly process and long term package/board level reliability.

Question: What is the co-design methodology for TFI?


A Simple and Accurate Syntax-Agnostic Neural Model for Dependency-based Semantic Role Labeling. We introduce a simple and accurate neural model for dependency-based semantic role labeling. Our model predicts predicate-argument dependencies relying on states of a bidirectional LSTM encoder. The semantic role labeler achieves competitive performance on English, even without any kind of syntactic information and only using local inference. However, when automatically predicted partof-speech tags are provided as input, it substantially outperforms all previous local models and approaches the best reported results on the English CoNLL2009 dataset. We also consider Chinese, Czech and Spanish where our approach also achieves competitive results. Syntactic parsers are unreliable on out-of-domain data, so standard (i.e., syntactically-informed) SRL models are hindered when tested in this setting. Our syntax-agnostic model appears more robust, resulting in the best reported results on standard out-of-domain test sets.

Question: What is the best reported results on the English CoNLL2009 dataset?


EventRiver: Visually Exploring Text Collections with Temporal References. Many text collections with temporal references, such as news corpora and weblogs, are generated to report and discuss real life events. Thus, event-related tasks, such as detecting real life events that drive the generation of the text documents, tracking event evolutions, and investigating reports and commentaries about events of interest, are important when exploring such text collections. To incorporate and leverage human efforts in conducting such tasks, we propose a novel visual analytics approach named EventRiver. EventRiver integrates event-based automated text analysis and visualization to reveal the events motivating the text generation and the long term stories they construct. On the visualization, users can interactively conduct tasks such as event browsing, tracking, association, and investigation. A working prototype of EventRiver has been implemented for exploring news corpora. A set of case studies, experiments, and a preliminary user test have been conducted to evaluate its effectiveness and efficiency.

Question: What is the event river?


Approximate Reverse Carry Propagate Adder for Energy-Efficient DSP Applications. In this paper, a reverse carry propagate adder (RCPA) is presented. In the RCPA structure, the carry signal propagates in a counter-flow manner from the most significant bit to the least significant bit; hence, the carry input signal has higher significance than the output carry. This method of carry propagation leads to higher stability in the presence of delay variations. Three implementations of the reverse carry propagate full-adder (RCPFA) cell with different delay, power, energy, and accuracy levels are introduced. The proposed structure may be combined with an exact (forward) carry adder to form hybrid adders with tunable levels of accuracy. The design parameters of the proposed RCPA implementations and some hybrid adders realized utilizing these structures are studied and compared with those of the state-of-the-art approximate adders using HSPICE simulations in a 45-nm CMOS technology. The results indicate that employing the proposed RCPAs in the hybrid adders may provide, on average, 27%, 6%, and 31% improvements in delay, energy, and energy-delay-product while providing higher levels of accuracy. In addition, the structure is more resilient to delay variation compared to the conventional approximate adder. Finally, the efficacy of the proposed RCPAs is investigated in the discrete cosine transform (DCT) block of the JPEG compression and finite-impulse response (FIR) filter applications. The investigation reveals 60% and 39% energy saving in the DCT of JPEG and FIR filter, respectively, for the proposed RCPAs.

Question: What is the approximate reverse carry propagate adder?


Decentralized Edge Clouds. Cloud computing services are traditionally deployed on centralized computing infrastructures confined to a few data centers, while cloud applications run in a single data center. However, the cloud's centralized nature can be limiting in terms of performance and cost for applications where users, data, and computation are distributed. The authors present an overview of distributed clouds that might be better suited for such applications. They briefly describe the distributed cloud landscape and introduce Nebula, a highly decentralized cloud that uses volunteer edge resources. The authors provide insights into some of its key properties and design issues, and describe a distributed MapReduce application scenario to illustrate the benefits and trade-offs of using distributed and decentralized clouds for distributed data-intensive computing applications.

Question: What is a decentralized cloud?


Grammar Variational Autoencoder. s m i l e s ! c h a i n atom ! b r a c k e t _ a t o m | a l i p h a t i c _ o r g a n i c | a r o m a t i c _ o r g a n i c a l i p h a t i c _ o r g a n i c ! 'B' | 'C' | 'N' | 'O' | 'S ' | 'P ' | 'F ' | ' I ' | ' Cl ' | ' Br ' a r o m a t i c _ o r g a n i c ! ' c ' | ' n ' | ' o ' | ' s ' b r a c k e t _ a t o m ! ' [ ' BAI ' ] ' BAI ! i s o t o p e symbol BAC | symbol BAC | i s o t o p e symbol | symbol BAC ! c h i r a l BAH | BAH | c h i r a l BAH ! hc ou n t BACH | BACH | h co u n t BACH ! c h a r g e c l a s s | c h a r g e | c l a s s symbol ! a l i p h a t i c _ o r g a n i c | a r o m a t i c _ o r g a n i c i s o t o p e ! DIGIT | DIGIT DIGIT | DIGIT DIGIT DIGIT DIGIT ! '1 ' | '2 ' | '3 ' | '4 ' | '5 ' | '6 ' | '7 ' | '8 ' c h i r a l ! '@' | '@@' hc ou n t ! 'H' | 'H' DIGIT c h a r g e ! ' ' | ' ' DIGIT | ' ' DIGIT DIGIT | '+ ' | '+ ' DIGIT | '+ ' DIGIT DIGIT bond ! ' ' | '= ' | '# ' | ' / ' | ' \ ' r i n g b o n d ! DIGIT | bond DIGIT branched_a tom ! atom | atom RB | atom BB | atom RB BB RB ! RB r i n g b o n d | r i n g b o n d BB ! BB b ra n ch | b r a n ch b ra nc h ! ' ( ' c h a i n ' ) ' | ' ( ' bond c h a i n ' ) ' c h a i n ! branched_a tom | c h a i n branched_a tom | c h a i n bond branched_a tom

Question: What is the difference between a bond and a c h a i n?


Knowledge management , flexibility and firm performance : The effects of family involvement.

Question: What is knowledge management?


For a social network analysis of computer networks: a sociological perspective on collaborative work and virtual community. When computer networks link people as well as machines, they become social networks. Social network analysis provides a useful approach to moving beyond the concept of "group" in studying virtual communities and computer supported cooperative work and telework. Such computer supported social networks (CSSNS) sustain strong, intermediate and weak ties that provide information and social support in both specialized and broadly-based relationships. They foster informal workplace communities that are usually partial and narrowly-focused, although some do become encompassing and broadly-based. CSSNS connect workers within and between organizations who often are physically dispersed. The nature of the medium both constrains and facilitates management control. Although many relationships function offline as well as online, CSSNS have developed their own norms and structures. They have strong societal implications, fostering situations that combine global connectivity, the fragmentation of solidarities and the de-emphasis of local organization, and the importance of home bases.

Question: What is a social network analysis of computer networks?


Design of Novel Reconfigurable Reflectarrays With Single-Bit Phase Resolution for Ku-Band Satellite Antenna Applications. Reconfigurable reflectarray antennas operating in Ku-band are presented in this paper. First, a novel multilayer unit-cell based on polarization turning concept is proposed to achieve the single-bit phase shift required for reconfigurable reflectarray applications. The principle of the unit-cell is discussed using the current model and the space match condition, along with simulations to corroborate the design and performance criteria. Then, an offset-fed configuration is developed to verify performance of the unit-cell in antenna application, and its polarization transformation property is elaborated. Finally, an offset-fed reflectarray with 10 × 10 elements is developed and fabricated. The dual-polarized antenna utilizes the control code matrices to accomplish a wide angle beam-scanning. A full-wave analysis is applied to the reflectarray, and detailed results are presented and discussed. This electronically steerable reflectarray antenna has significant potential for satellite applications, due to its wide operating band, simple control and beam-scanning capability.

Question: What is the difference between a reflectarray and a phased array?


Combinatorial Bounds for Broadcast Encryption. Abst rac t . A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broad~ cast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds.

Question: What is the trade-off between the number of establishment keys and the number of transmissions needed to establish a new broadcast key?


Majority Is Not Enough: Bitcoin Mining Is Vulnerable.

Question: What is the majority?


IUI workshop on interactive machine learning. Many applications of Machine Learning (ML) involve interactions with humans. Humans may provide input to a learning algorithm (in the form of labels, demonstrations, corrections, rankings or evaluations) while observing its outputs (in the form of feedback, predictions or executions). Although humans are an integral part of the learning process, traditional ML systems used in these applications are agnostic to the fact that inputs/outputs are from/for humans.  However, a growing community of researchers at the intersection of ML and human-computer interaction are making interaction with humans a central part of developing ML systems. These efforts include applying interaction design principles to ML systems, using human-subject testing to evaluate ML systems and inspire new methods, and changing the input and output channels of ML systems to better leverage human capabilities. With this Interactive Machine Learning (IML) workshop at IUI 2013 we aim to bring this community together to share ideas, get up-to-date on recent advances, progress towards a common framework and terminology for the field, and discuss the open questions and challenges of IML.

Question: What is the difference between interactive machine learning and machine learning?


Seq2seq Fingerprint: An Unsupervised Deep Molecular Embedding for Drug Discovery. Many of today's drug discoveries require expertise knowledge and insanely expensive biological experiments for identifying the chemical molecular properties. However, despite the growing interests of using supervised machine learning algorithms to automatically identify those chemical molecular properties, there is little advancement of the performance and accuracy due to the limited amount of training data. In this paper, we propose a novel unsupervised molecular embedding method, providing a continuous feature vector for each molecule to perform further tasks, e.g., solubility classification. In the proposed method, a multi-layered Gated Recurrent Unit (GRU) network is used to map the input molecule into a continuous feature vector of fixed dimensionality, and then another deep GRU network is employed to decode the continuous vector back to the original molecule. As a result, the continuous encoding vector is expected to contain rigorous and enough information to recover the original molecule and predict its chemical properties. The proposed embedding method could utilize almost unlimited molecule data for the training phase. With sufficient information encoded in the vector, the proposed method is also robust and task-insensitive. The performance and robustness are confirmed and interpreted in our extensive experiments.

Question: What is the chemical molecular properties of caffeine?


Adtranz: A Mobile Computing System for Maintenance and Collaboration. The paper describes the mobile information and communication aspects of a next generation train maintenance and diagnosis system, discusses the working prototype features, and research results. Wearable/ Mobile computers combined with the wireless technology improve efficiency and accuracy of the maintenance work. This technology enables maintenance personnel at the site to communicate with a remote helpdesk / expertise center through digital data, audio, and image.

Question: What is the working prototype of the next generation train maintenance and diagnosis system?


Attention-based Belief or Disbelief Feature Extraction for Dependency Parsing. Existing neural dependency parsers usually encode each word in a sentence with bi-directional LSTMs, and estimate the score of an arc from the LSTM representations of the head and the modifier, possibly missing relevant context information for the arc being considered. In this study, we propose a neural feature extraction method that learns to extract arcspecific features. We apply a neural network-based attention method to collect evidences for and against each possible head-modifier pair, with which our model computes certainty scores of belief and disbelief, and determines the final arc score by subtracting the score of disbelief from the one of belief. By explicitly introducing two kinds of evidences, the arc candidates can compete against each other based on more relevant information, especially for the cases where they share the same head or modifier. It makes possible to better discriminate two or more competing arcs by presenting their rivals (disbelief evidence). Experiments on various datasets show that our arc-specific feature extraction mechanism significantly improves the performance of bi-directional LSTMbased models by explicitly modeling long-distance dependencies. For both English and Chinese, the proposed model achieve a higher accuracy on dependency parsing task than most existing neural attention-based models.

Question: What is the difference between a neural dependency parser and a neural attention-based dependency parser?


Modeling WiFi Active Power/Energy Consumption in Smartphones. We conduct the first detailed measurement study of the properties of a class of WiFi active power/energy consumption models based on parameters readily available to smartphone app developers. We first consider a number of parameters used by previous models and show their limitations. We then focus on a recent approach modeling the active power consumption as a function of the application layer throughput. Using a large dataset and an 802.11n-equipped smartphone, we build four versions of a previously proposed linear power-throughput model, which allow us to explore the fundamental trade off between accuracy and simplicity. We study the properties of the model in relation to other parameters such as the packet size and/or the transport layer protocol, and we evaluate its accuracy under a variety of scenarios which have not been considered in previous studies. Our study shows that the model works well in a number of scenarios but its accuracy drops with high throughput values or when tested on different hardware. We further show that a non-linear model can greatly improve the accuracy in these two cases.

Question: What is the accuracy of the linear model?


A clustering algorithm based on graph connectivity.

Question: What is a clustering algorithm?


Time Series Data Classification Using Recurrent Neural Network with Ensemble Learning. In statistics and signal processing, a time series is a sequence of data points, measured typically at successive times, spaced apart at uniform time intervals. Time series prediction is the use of a model to predict future events based on known past events; to predict future data points before they are measured. Solutions in such cases can be provided by non-parametric regression methods, of which each neural network based predictor is a class. As a learning method of time series data with neural network, Elman type Recurrent Neural Network has been known. In this paper, we propose the multi RNN. In order to verify the effectiveness of our proposed method, we experimented by the simple artificial data and the heart pulse wave data.

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


Improving speech recognition by revising gated recurrent units. Speech recognition is largely taking advantage of deep learning, showing that substantial benefits can be obtained by modern Recurrent Neural Networks (RNNs). The most popular RNNs are Long Short-Term Memory (LSTMs), which typically reach state-of-the-art performance in many tasks thanks to their ability to learn long-term dependencies and robustness to vanishing gradients. Nevertheless, LSTMs have a rather complex design with three multiplicative gates, that might impair their efficient implementation. An attempt to simplify LSTMs has recently led to Gated Recurrent Units (GRUs), which are based on just two multiplicative gates. This paper builds on these efforts by further revising GRUs and proposing a simplified architecture potentially more suitable for speech recognition. The contribution of this work is two-fold. First, we suggest to remove the reset gate in the GRU design, resulting in a more efficient single-gate architecture. Second, we propose to replace tanh with ReLU activations in the state update equations. Results show that, in our implementation, the revised architecture reduces the per-epoch training time with more than 30% and consistently improves recognition performance across different tasks, input features, and noisy conditions when compared to a standard GRU.

Question: How to improve speech recognition by revising gated recurrent units?


Maximum Entropy Inverse Reinforcement Learning. Recent research has shown the benefit of framing problems of imitation learning as solutions to Markov Decision Problems. This approach reduces learning to the problem of recovering a utility function that makes the behavior induced by a near-optimal policy closely mimic demonstrated behavior. In this work, we develop a probabilistic approach based on the principle of maximum entropy. Our approach provides a well-defined, globally normalized distribution over decision sequences, while providing the same performance guarantees as existing methods. We develop our technique in the context of modeling realworld navigation and driving behaviors where collected data is inherently noisy and imperfect. Our probabilistic approach enables modeling of route preferences as well as a powerful new approach to inferring destinations and routes based on partial trajectories.

Question: What is maximum entropy inverse reinforcement learning?


Light Stemming for Arabic Information Retrieval. Computational Morphology is an urgent problem for Arabic Natural Language Processing, because Arabic is a highly inflected language. We have found, however, that a full solution to this problem is not required for effective information retrieval. Light stemming allows remarkably good information retrieval without providing correct morphological analyses. We developed several light stemmers for Arabic, and assessed their effectiveness for information retrieval using standard TREC data. We have also compared light stemming with several stemmers based on morphological analysis.. The light stemmer, light10, outperformed the other approaches. It has been included in the Lemur toolkit, and is becoming widely used Arabic information retrieval.

Question: What is the light stemming algorithm?


Adversarial Discriminative Domain Adaptation. Adversarial learning methods are a promising approach to training robust deep networks, and can generate complex samples across diverse domains. They can also improve recognition despite the presence of domain shift or dataset bias: recent adversarial approaches to unsupervised domain adaptation reduce the difference between the training and test domain distributions and thus improve generalization performance. However, while generative adversarial networks (GANs) show compelling visualizations, they are not optimal on discriminative tasks and can be limited to smaller shifts. On the other hand, discriminative approaches can handle larger domain shifts, but impose tied weights on the model and do not exploit a GAN-based loss. In this work, we first outline a novel generalized framework for adversarial adaptation, which subsumes recent state-of-the-art approaches as special cases, and use this generalized view to better relate prior approaches. We then propose a previously unexplored instance of our general framework which combines discriminative modeling, untied weight sharing, and a GAN loss, which we call Adversarial Discriminative Domain Adaptation (ADDA). We show that ADDA is more effective yet considerably simpler than competing domain-adversarial methods, and demonstrate the promise of our approach by exceeding state-of-the-art unsupervised adaptation results on standard domain adaptation tasks as well as a difficult cross-modality object classification task.

Question: What is adversarial domain adaptation?


A Data-Clustering Algorithm on Distributed Memory Multiprocessors. To cluster increasingly massive data sets that are common today in data and text mining, we propose a parallel implementation of the k-means clustering algorithm based on the message passing model. The proposed algorithm exploits the inherent data-parallelism in the kmeans algorithm. We analytically show that the speedup and the scaleup of our algorithm approach the optimal as the number of data points increases. We implemented our algorithm on an IBM POWERparallel SP2 with a maximum of 16 nodes. On typical test data sets, we observe nearly linear relative speedups, for example, 15.62 on 16 nodes, and essentially linear scaleup in the size of the data set and in the number of clusters desired. For a 2 gigabyte test data set, our implementation drives the 16 node SP2 at more than 1.8 gigaflops.

Question: What is a data-clustering algorithm?


Exploring the factors associated with Web site success in the context of electronic commerce. Web sites are being widely deployed commercially. As the widespread use and dependency on Web technology increases, so does the need to assess factors associated with Web site success. The objective is to explore these factors in the context of electronic commerce (EC). The research framework was derived from information systems and marketing literature. Webmasters from Fortune 1000 companies were used as the target group for a survey. Four factors that are critical to Web site success in EC were identi®ed: (1) information and service quality, (2) system use, (3) playfulness, and (4) system design quality. An analysis of the data provides valuable managerial implications for Web site success in the context of electronic commerce. # 2000 Elsevier Science B.V. All rights reserved.

Question: What are the factors associated with Web site success in the context of electronic commerce?


3D hand tracking using Kalman filter in depth space. Hand gestures are an important type of natural language used in many research areas such as human-computer interaction and computer vision. Hand gestures recognition requires the prior determination of the hand position through detection and tracking. One of the most efficient strategies for hand tracking is to use 2D visual information such as color and shape. However, visual-sensor-based hand tracking methods are very sensitive when tracking is performed under variable light conditions. Also, as hand movements are made in 3D space, the recognition performance of hand gestures using 2D information is inherently limited. In this article, we propose a novel real-time 3D hand tracking method in depth space using a 3D depth sensor and employing Kalman filter. We detect hand candidates using motion clusters and predefined wave motion, and track hand locations using Kalman filter. To verify the effectiveness of the proposed method, we compare the performance of the proposed method with the visual-based method. Experimental results show that the performance of the proposed method out performs visual-based method.

Question: How to track hand gestures in depth space?


Drawing lithography for microneedles: a review of fundamentals and biomedical applications.. A microneedle is a three-dimensional (3D) micromechanical structure and has been in the spotlight recently as a drug delivery system (DDS). Because a microneedle delivers the target drug after penetrating the skin barrier, the therapeutic effects of microneedles proceed from its 3D structural geometry. Various types of microneedles have been fabricated using subtractive micromanufacturing methods which are based on the inherently planar two-dimensional (2D) geometries. However, traditional subtractive processes are limited for flexible structural microneedles and makes functional biomedical applications for efficient drug delivery difficult. The authors of the present study propose drawing lithography as a unique additive process for the fabrication of a microneedle directly from 2D planar substrates, thus overcoming a subtractive process shortcoming. The present article provides the first overview of the principal drawing lithography technology: fundamentals and biomedical applications. The continuous drawing technique for an ultrahigh-aspect ratio (UHAR) hollow microneedle, stepwise controlled drawing technique for a dissolving microneedle, and drawing technique with antidromic isolation for a hybrid electro-microneedle (HEM) are reviewed, and efficient biomedical applications by drawing lithography-mediated microneedles as an innovative drug and gene delivery system are described. Drawing lithography herein can provide a great breakthrough in the development of materials science and biotechnology.

Question: What is the difference between a microneedle and a needle?


Computational Sociolinguistics: A Survey. Language is a social phenomenon and variation is inherent to its social nature. Recently, there has been a surge of interest within the computational linguistics (CL) community in the social dimension of language. In this article we present a survey of the emerging field of "computational sociolinguistics" that reflects this increased interest. We aim to provide a comprehensive overview of CL research on sociolinguistic themes, featuring topics such as the relation between language and social identity, language use in social interaction, and multilingual communication. Moreover, we demonstrate the potential for synergy between the research communities involved, by showing how the large-scale data-driven methods that are widely used in CL can complement existing sociolinguistic studies, and how sociolinguistics can inform and challenge the methods and assumptions used in CL studies. We hope to convey the possible benefits of a closer collaboration between the two communities and conclude with a discussion of open challenges.

Question: What is computational sociolinguistics?


Color categories: Evidence for the cultural relativity hypothesis. The question of whether language affects our categorization of perceptual continua is of particular interest for the domain of color where constraints on categorization have been proposed both within the visual system and in the visual environment. Recent research (Roberson, Davies, & Davidoff, 2000; Roberson et al., in press) found substantial evidence of cognitive color differences between different language communities, but concerns remained as to how representative might be a tiny, extremely remote community. The present study replicates and extends previous findings using additional paradigms among a larger community in a different visual environment. Adult semi-nomadic tribesmen in Southern Africa carried out similarity judgments, short-term memory and long-term learning tasks. They showed different cognitive organization of color to both English and another language with the five color terms. Moreover, Categorical Perception effects were found to differ even between languages with broadly similar color categories. The results provide further evidence of the tight relationship between language and cognition.

Question: What is the difference between the color categories of the two languages?


A Dynamic Bayesian Network Model for Autonomous 3D Reconstruction from a Single Indoor Image. When we look at a picture, our prior knowledge about the world allows us to resolve some of the ambiguities that are inherent to monocular vision, and thereby infer 3d information about the scene. We also recognize different objects, decide on their orientations, and identify how they are connected to their environment. Focusing on the problem of autonomous 3d reconstruction of indoor scenes, in this paper we present a dynamic Bayesian network model capable of resolving some of these ambiguities and recovering 3d information for many images. Our model assumes a "floorwall" geometry on the scene and is trained to recognize the floor-wall boundary in each column of the image. When the image is produced under perspective geometry, we show that this model can be used for 3d reconstruction from a single image. To our knowledge, this was the first monocular approach to automatically recover 3d reconstructions from single indoor images.

Question: What is a dynamic Bayesian network?


Machine learning on sequential data using a recurrent weighted average. Recurrent Neural Networks (RNN) are a type of statistical model designed to handle sequential data. The model reads a sequence one symbol at a time. Each symbol is processed based on information collected from the previous symbols. With existing RNN architectures, each symbol is processed using only information from the previous processing step. To overcome this limitation, we propose a new kind of RNN model that computes a recurrent weighted average (RWA) over every past processing step. Because the RWA can be computed as a running average, the computational overhead scales like that of any other RNN architecture. The approach essentially reformulates the attention mechanism into a stand-alone model. The performance of the RWA model is assessed on the variable copy problem, the adding problem, classification of artificial grammar, classification of sequences by length, and classification of the MNIST images (where the pixels are read sequentially one at a time). On almost every task, the RWA model is found to fit the data significantly faster than a standard LSTM model.

Question: What is the adding problem?


Adaptive Neuro-Fuzzy Inference System (ANFIS) Based Software Evaluation. Software metric is a measure of some property of a piece of software or its specifications. The goal is to obtain reproducible and quantifiable measurements, which may have several valuable applications in schedule and budget planning, effort and cost evaluation, quality assurance testing, software debugging, software performance optimization, and optimal personnel task assignments. Software effort evaluation is one of the most essential and crucial part of software project planning for which efficient effort metrics is required. Software effort evaluation is followed by software cost evaluation which is helpful for both customers and developers. Thus, efficiency of effort component of software is very essential. The algorithmic models are weak in estimating early effort evaluation with regards to uncertainty and imprecision in software projects. To overcome this problem, there are various machine learning methods. One of the methods is soft computing in which there are various methodologies viz., Artificial Neural Network, Fuzzy Logic, Evolutionary computation based Genetic Algorithm and Metaheuristic based Particle Swarm Optimization. These methods are good at solving real-world ambiguities. This paper highlights the design of an efficient software effort evaluation model using Adaptive Neuro-Fuzzy Inference System (ANFIS) for uncertain datasets and it shows that this technique significantly outperforms with sufficient results.

Question: What is the difference between software metric and software metric?


Towards integrated safety analysis and design. There are currently many problems with the development and assessment of software intensive safety-critical systems. In this paper we describe the problems, and introduce a novel approach to their solution, based around goal-structuring concepts, which we believe will ameliorate some of the difficulties. We discuss the use of modified and new forms of safety assessment notations to provide evidence of safety, and the use of data derived from such notations as a means of providing quantified input into the design assessment process. We then show how the design assessment can be partially automated, and from this develop some ideas on how we might move from analytical to synthetic approaches, using safety criteria and evidence as a fitness function for comparing alternative automatically-generated designs.

Question: What is the difference between safety and security?


Learning to associate: HybridBoosted multi-target tracker for crowded scene. We propose a learning-based hierarchical approach of multi-target tracking from a single camera by progressively associating detection responses into longer and longer track fragments (tracklets) and finally the desired target trajectories. To define tracklet affinity for association, most previous work relies on heuristically selected parametric models; while our approach is able to automatically select among various features and corresponding non-parametric models, and combine them to maximize the discriminative power on training data by virtue of a HybridBoost algorithm. A hybrid loss function is used in this algorithm because the association of tracklet is formulated as a joint problem of ranking and classification: the ranking part aims to rank correct tracklet associations higher than other alternatives; the classification part is responsible to reject wrong associations when no further association should be done. Experiments are carried out by tracking pedestrians in challenging datasets. We compare our approach with state-of-the-art algorithms to show its improvement in terms of tracking accuracy.

Question: How to track pedestrians in crowded scenes?


Power reflection coefficient analysis for complex impedances in RFID tag design. Kurokawa's method of calculating the power reflection coefficient from the Smith chart in the situation when one complex impedance is directly connected to another is applied to passive RFID tag design, where power reflection is important, as it determines the tag characteristics. The performance analysis of a specific RFID tag is presented together with experimental data, which is in close agreement with the theory.

Question: What is the Smith chart?


Exploring specialized near-memory processing for data intensive operations. Emerging 3D stacked memory systems provide significantly more bandwidth than current DDR modules. However, general purpose processors do not take full advantage of these resources offered by the memory modules. Taking advantage of the increased bandwidth requires the use of specialized processing units. In this paper, we evaluate the benefits of placing hardware accelerators at the bottom layer of a 3D stacked memory system compared to accelerators that are placed external to the memory stack. Our evaluation of the design using cycle-accurate simulation and RTL synthesis shows that, for important data intensive kernels, near-memory accelerators inside a single 3D memory package provide 3x-13x speedup over a Quad-core Xeon processor. Most of the benefits are from the application of accelerators, as the near-memory configurations provide marginal benefits compared to the same number of accelerators placed on a die external to the memory package. This comparable performance for external accelerators is due to the high bandwidth afforded by the high-speed off-chip links. On the other hand, near-memory accelerators consume 7%-39% less energy than the external accelerators.

Question: What is the benefit of placing accelerators inside a 3D memory package?


Secure data deduplication. As the world moves to digital storage for archival purposes, there is an increasing demand for systems that can provide secure data storage in a cost-effective manner. By identifying common chunks of data both within and between files and storing them only once, deduplication can yield cost savings by increasing the utility of a given amount of storage. Unfortunately, deduplication exploits identical content, while encryption attempts to make all content appear random; the same content encrypted with two different keys results in very different ciphertext. Thus, combining the space efficiency of deduplication with the secrecy aspects of encryption is problematic.  We have developed a solution that provides both data security and space efficiency in single-server storage and distributed storage systems. Encryption keys are generated in a consistent manner from the chunk data; thus, identical chunks will always encrypt to the same ciphertext. Furthermore, the keys cannot be deduced from the encrypted chunk data. Since the information each user needs to access and decrypt the chunks that make up a file is encrypted using a key known only to the user, even a full compromise of the system cannot reveal which chunks are used by which users.

Question: What is a secure data deduplication system?


A survey of event detection techniques in online social networks. The online social networks (OSNs) have become an important platform for detecting real-world event in recent years. These real-world events are detected by analyzing huge social-stream data available on different OSN platforms. Event detection has become significant because it contains substantial information which describes different scenarios during events or crisis. This information further helps to enable contextual decision making, regarding the event location, content and the temporal specifications. Several studies exist, which offers plethora of frameworks and tools for detecting and analyzing events used for applications like crisis management, monitoring and predicting events in different OSN platforms. In this paper, a survey is done for event detection techniques in OSN based on social text streams—newswire, web forums, emails, blogs and microblogs, for natural disasters, trending or emerging topics and public opinion-based events. The work done and the open problems are explicitly mentioned for each social stream. Further, this paper elucidates the list of event detection tools available for the researchers.

Question: What is a social stream?


A novel approach to online social influence maximization. Online social networks are becoming a true growth point of Internet. As individuals constantly desire to interact with each other, the ability for Internet to deliver this networking influence becomes much stronger. In this paper, we study the online social influence maximization problem, which is to find a small group of influential users that maximizes the spread of influence through networks. After a thorough analysis of existing models, especially two classical ones, namely Independent cascade and linear thresholds, we argue that their idea that each user can only be activated by its active neighbors is not applicable to online social networks, since in many applications there is no clear concept for the issue of "activation". In our proposed influence model, if there is a social influence path linking two nonadjacent individuals, the value of influence between these two individuals can be evaluated along the existing social path based on the influence transitivity property under certain constraints. To compute influence probabilities between two neighbors, we also develop a new method which leverages both structure of networks and historical data. With reasonably learned influence probabilities, we recast the problem of online influence maximization to a weighted maximum cut problem which analyzes the influence flow among graph vertices. By running a semidefinite program-based (GW) algorithm on a complete influence graph, an optimal seed set can be identified effectively. We also provide experimental results on real online social networks, showing that our algorithm significantly outperforms greedy methods.

Question: What is the influence maximization problem?


Progressive Visual Analytics: User-Driven Visual Exploration of In-Progress Analytics. As datasets grow and analytic algorithms become more complex, the typical workflow of analysts launching an analytic, waiting for it to complete, inspecting the results, and then re-Iaunching the computation with adjusted parameters is not realistic for many real-world tasks. This paper presents an alternative workflow, progressive visual analytics, which enables an analyst to inspect partial results of an algorithm as they become available and interact with the algorithm to prioritize subspaces of interest. Progressive visual analytics depends on adapting analytical algorithms to produce meaningful partial results and enable analyst intervention without sacrificing computational speed. The paradigm also depends on adapting information visualization techniques to incorporate the constantly refining results without overwhelming analysts and provide interactions to support an analyst directing the analytic. The contributions of this paper include: a description of the progressive visual analytics paradigm; design goals for both the algorithms and visualizations in progressive visual analytics systems; an example progressive visual analytics system (Progressive Insights) for analyzing common patterns in a collection of event sequences; and an evaluation of Progressive Insights and the progressive visual analytics paradigm by clinical researchers analyzing electronic medical records.

Question: What is the canadian military?


Attacking an AES-Enabled NFC Tag: Implications from Design to a Real-World Scenario. Radio-frequency identification (RFID) technology is the enabler for applications like the future internet of things (IoT), where security plays an important role. When integrating security to RFID tags, not only the cryptographic algorithms need to be secure but also their implementation. In this work we present differential power analysis (DPA) and differential electromagnetic analysis (DEMA) attacks on a securityenabled RFID tag. The attacks are conducted on both an ASIC-chip version and on an FPGA-prototype version of the tag. The design of the ASIC version equals that of commercial RFID tags and has analog and digital part integrated on a single chip. Target of the attacks is an implementation of the Advanced Encryption Standard (AES) with 128-bit key length and DPA countermeasures. The countermeasures are shuffling of operations and insertion of dummy rounds. Our results illustrate that the effort for successfully attacking the ASIC chip in a real-world scenario is only 4.5 times higher than for the FPGA prototype in a laboratory environment. This let us come to the conclusion that the effort for attacking contactless devices like RFID tags is only slightly higher than that for contact-based devices. The results further underline that the design of countermeasures like the insertion of dummy rounds has to be done with great care, since the detection of patterns in power or electromagnetic traces can be used to significantly lower the attacking effort.

Question: How to attack an AES-enabled NFC tag?


A recommender system using GA K-means clustering in an online shopping market. The Internet is emerging as a new marketing channel, so understanding the characteristics of online customers' needs and expectations is considered a prerequisite for activating the consumer-oriented electronic commerce market. In this study, we propose a novel clustering algorithm based on genetic algorithms (GAs) to effectively segment the online shopping market. In general, GAs are believed to be effective on NP-complete global optimization problems, and they can provide good near-optimal solutions in reasonable time. Thus, we believe that a clustering technique with GA can provide a way of finding the relevant clusters more effectively. The research in this paper applied K-means clustering whose initial seeds are optimized by GA, which is called GA K-means, to a real-world online shopping market segmentation case. In this study, we compared the results of GA K-means to those of a simple K-means algorithm and self-organizing maps (SOM). The results showed that GA K-means clustering may improve segmentation performance in comparison to other typical clustering algorithms. In addition, our study validated the usefulness of the proposed model as a preprocessing tool for recommendation systems. 2007 Elsevier Ltd. All rights reserved.

Question: What is a recommender system?


Monolithically Integrated Si Photonics Transmitters in 0.25 um BiCMOS Platform for High-Speed Optical Communications. Monolithically integrated electro-optical transmitters fabricated in a 0.25 μm SiGe:C BiCMOS electronic-photonic integrated circuit (EPIC) technology with fT =190 GHz are presented. The modules are based on the co-design and integration of a segmented depletion-type Si Mach-Zehnder modulator and multichannel driver amplifiers. Two driving approaches and their performance trade-offs are discussed: a linear one, with direct interface to an external digital-to-analog converter (DAC), as well as a more power efficient implementation featuring integrated 4-bit DAC functionality. High extinction ratios at high speed are demonstrated, enabled by the high breakdown voltages of the HBT transistors. The modules support several modulation formats among which pulse-amplitude-modulation (PAM)−4 eye diagrams up to 37 GBd are shown, for the first time.

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


Automatic Gloss Finding for a Knowledge Base using Ontological Constraints. While there has been much research on automatically constructing structured Knowledge Bases (KBs), most of it has focused on generating facts to populate a KB. However, a useful KB must go beyond facts. For example, glosses (short natural language definitions) have been found to be very useful in tasks such as Word Sense Disambiguation. However, the important problem of Automatic Gloss Finding, i.e., assigning glosses to entities in an initially gloss-free KB, is relatively unexplored. We address that gap in this paper. In particular, we propose GLOFIN, a hierarchical semi-supervised learning algorithm for this problem which makes effective use of limited amounts of supervision and available ontological constraints. To the best of our knowledge, GLOFIN is the first system for this task. Through extensive experiments on real-world datasets, we demonstrate GLOFIN's effectiveness. It is encouraging to see that GLOFIN outperforms other state-of-the-art SSL algorithms, especially in low supervision settings. We also demonstrate GLOFIN's robustness to noise through experiments on a wide variety of KBs, ranging from user contributed (e.g., Freebase) to automatically constructed (e.g., NELL). To facilitate further research in this area, we have made the datasets and code used in this paper publicly available.

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


Efficient mesh denoising via robust normal filtering and alternate vertex updating. The most challenging problem in mesh denoising is to distinguish features from noise. Based on the robust guided normal estimation and alternate vertex updating strategy, we investigate a new feature-preserving mesh denoising method. To accurately capture local structures around features, we propose a corner-aware neighborhood (CAN) scheme. By combining both overall normal distribution of all faces in a CAN and individual normal influence of the interested face, we give a new consistency measuring method, which greatly improves the reliability of the estimated guided normals. As the noise level lowers, we take as guidance the previous filtered normals, which coincides with the emerging rolling guidance idea. In the vertex updating process, we classify vertices according to filtered normals at each iteration and reposition vertices of distinct types alternately with individual regularization constraints. Experiments on a variety of synthetic and real data indicate that our method adapts to various noise, both Gaussian and impulsive, no matter in the normal direction or in a random direction, with few triangles flipped.

Question: How to denoise a mesh?


Situationally Aware In-Car Information Presentation Using Incremental Speech Generation: Safer, and More Effective. Holding non-co-located conversations while driving is dangerous (Horrey and Wickens, 2006; Strayer et al., 2006), much more so than conversations with physically present, "situated" interlocutors (Drews et al., 2004). In-car dialogue systems typically resemble non-co-located conversations more, and share their negative impact (Strayer et al., 2013). We implemented and tested a simple strategy for making in-car dialogue systems aware of the driving situation, by giving them the capability to interrupt themselves when a dangerous situation is detected, and resume when over. We show that this improves both driving performance and recall of system-presented information, compared to a non-adaptive strategy.

Question: How does a dialogue system know when it is safe to talk?


A simple hybrid 3-level buck-boost DC-DC converter with efficient PWM regulation scheme. This paper describes a 3-level buck-boost converter with an output voltage range up to double the input voltage. The proposed converter can be used for applications that require stepping up/down the input voltage depending on the operating conditions like solar power harvesting. The converter has a hybrid structure between inductor-based converters and capacitor-based converters by utilizing a one flying capacitor and an inductor in the charge transfer process. The converter features smaller inductor size and current ripples as compared to the traditional buck-boost inductor-based converter while offering a high efficiency as compared to SC converters making it suitable for efficient on-chip integration. A prototype circuit has been designed on a 65nm technology using a 5-nH parasitic bondwire inductor. Simulation results show that the proposed converter features up to 20% improvement in the efficiency over a conventional 1:2 SC converter for a wide range of output voltage values.

Question: What is a buck-boost converter?


Intrusion Detection in the RPL-connected 6LoWPAN Networks. The interconnectivity of 6LoWPAN networks with the Internet raises serious security concerns, as constrained 6LoWPAN devices are accessible anywhere from the untrusted global Internet. Also, 6LoWPAN devices are mostly deployed in unattended environments, hence easy to capture and clone. Despite that state of the art crypto solutions provide information security, IPv6 enabled smart objects are vulnerable to attacks from outside and inside 6LoWPAN networks that are aimed to disrupt networks. This paper attempts to identify intrusions aimed to disrupt the Routing Protocol for Low-Power and Lossy Networks (RPL).In order to improve the security within 6LoWPAN networks, we extend SVELTE, an intrusion detection system for the Internet of Things, with an intrusion detection module that uses the ETX (Expected Transmissions) metric. In RPL, ETX is a link reliability metric and monitoring the ETX value can prevent an intruder from actively engaging 6LoWPAN nodes in malicious activities. We also propose geographic hints to identify malicious nodes that conduct attacks against ETX-based networks. We implement these extensions in the Contiki OS and evaluate them using the Cooja simulator.

Question: What is the ETX metric?


An extension of the GQM+Strategies approach with formal causal reasoning. Context: Successful organizations need to manage and synchronize their strategic objectives with daily operations and activities. In general, achieving that requires a continuous process of organizational alignment. GQM + Strategies is an approach that helps software organizations with documenting and aligning organizational goals and strategies, and developing measurement programs. Objective: In this paper, the GQM + Strategies approach is further evolved and extended to include capabilities to evaluate the relationships of organizational goals and strategies through causal analysis. Method: We used an analytical paradigm to develop a formal causal model over the GQM + Strategies structure. In addition, an empirical pre-experimental study was designed to test practitioners' abilities to provide necessary input for the formal causal model. Results: A developed formal causal model over the GQM + Strategies structure allows the use of causal reasoning for the purpose of analyzing dependencies among chosen sets of goals. We illustrate this by showing how to analyze the impact of risky goals on other goals in the grid. The results of the empirical study showed that the practitioners had no difficulties providing their predictions, i.e. inputs into the causal model. Conclusion: The proposed solution extends the existing GQM + Strategies knowledge base by further elaborating and clarifying the process of creating grids by introducing causality theory. The use of causality theory allows experts to quantify their knowledge and beliefs regarding the effectiveness of organizational strategies. As a part of future work, formal causal models and causal reasoning can be implemented as a supporting software tool for the GQM + Strategies approach. © 2017 Elsevier B.V. All rights reserved.

Question: What is the difference between GQM and GQM+Strategies?


Design of EMG Acquisition Circuit to Control an Antagonistic Mechanism Actuated by Pneumatic Artificial Muscles PAMs. -A pneumatically actuated antagonistic pair of muscles with joint mechanism (APMM) is supported and developed to be essential for bionic and biomimetic applications to emulate the biological muscles by realizing various kinds of locomotion based on normal electrical activity of biological muscles. This Paper aims to compare the response of antagonistic pairs of muscles mechanism (APMM) based on the pneumatic artificial muscles (PAMs) to an EMG signal that was acquired throw a designed circuit and an EMG Laboratory acquisition kit. The response is represented as a joint rotary displacement generated by the contraction and extension of the pneumatic artificial muscles. A statistical study was done to prove the efficiency of the designed circuit the response of antagonistic pairs of muscles mechanism. The statistical result showed that there is no significant difference of voltage data in both EMG acquired signal between reference kit and designed circuit. An excellent correlation behavior between the EMG control signal and the response of APMM as an angular displacement has been discussed and statistically analyzed. Index Term-Pneumatic Artificial Muscles, Biomechatronics, Electromyogram EMG, Pneumatic Proportional Directional Control Valve, Signal Processing, Bionic.

Question: What is the difference between a pneumatic artificial muscle and a pneumatic proportional directional control valve?


Optimal Brain Damage. We have used information-theoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved speed of learning and/or classification. The basic idea is to use second-derivative information to make a tradeoff between network complexity and training set error. Experiments confirm the usefulness of the methods on a real-world application.

Question: What is the optimal brain damage?


Math modeling, neuropsychology, and category learning:: Response to B. Knowlton (1999). raising the issue of the implications of findings in neuropsychological subjects for category learning [Knowlton, B. (1999) What can neuropsychology tell us about category learning? Trends Cognit. Sci. 3, 123–124]1. Knowlton and Squire2,3 reported various dissociations between categorization and recognition in normal and amnesic subjects to support their view that multiple memory systems mediate these tasks. The multiple-system view is more complex than a single-system approach is to modeling categorization and recognition. On grounds of parsimony, a question of scientific interest is whether a single-system model can suffice to account for these data. In support of this possibility, we demonstrated that an extremely simple version of a single-system exemplar model accounted in quantitative detail for the bulk of the dissociation findings reported by Knowlton and Squire, as long as plausible assumptions were made regarding parameter differences in memory ability between groups4. At the same time, we acknowledged some remaining challenges for the exemplar model, and concluded our article by stating, 'Whether or not a full account of Knowlton and Squire's complete set of dissociation findings is available within the exemplar approach remains a subject for future research, but we feel that we have made an important start' (Ref. 4, p. 255). We also outlined various directions in which the exemplar model could be extended to meet these challenges. In the first part of her commentary1, Knowlton reiterates these acknowledged limitations of the simple exemplar model and argues against the possible lines of extension that we suggested. Her first point pertains to the dissociation exhibited by the severe amnesic E.P., who despite showing zero ability to discriminate between old and new exemplars in a recognition task, displayed normal performance in a classification task5. We had pointed o

Question: What is the difference between a classification and a recognition task?


Intelligent Conversational Bot for Massive Online Open Courses (MOOCs). Massive Online Open Courses (MOOCs) which were introduced in 2008 has since drawn attention around the world for both its advantages as well as criticism on its drawbacks. One of the issues in MOOCs which is the lack of interactivity with the instructor has brought conversational bot into the picture to fill in this gap. In this study, a prototype of MOOCs conversational bot, MOOC-bot is being developed and integrated into MOOCs website to respond to the learner's enquiries using text or speech input. MOOC-bot is using the popular Artificial Intelligence Markup Language (AIML) to develop its knowledge base, leverage from AIML's capability to deliver appropriate responses and can be quickly adapted to new knowledge domains. The system architecture of MOOC-bot consists of knowledge base along with AIML interpreter, chat interface, MOOCs website and Web Speech API to provide speech recognition and speech synthesis capability. The initial MOOC-bot prototype has the general knowledge from the past Loebner Prize winner ALICE, course's frequent asked questions, and a course's content offered by Universiti Teknikal Malaysia Melaka (UTeM). The evaluation of MOOC-bot based on the past competition questions from Chatterbox Challenge (CBC) and Loebner Prize has shown that it was able to provide correct answers most of the time during the test and demonstrated the capability to prolong the conversation. The advantages of MOOCbot such as able to provide 24-hour service that can serve different time zones, able to have knowledge in multiple domains, and can be shared by multiple sites simultaneously have outweighed its existing limitations.

Question: What is the advantage of MOOC-bot?


A 12-bit 1.6 GS/s interleaved SAR ADC with dual reference shifting and interpolation achieving 17.8 fJ/conv-step in 65nm CMOS. A 12-bit SAR ADC architecture with dual reference shifting and interpolation technique has been proposed and implemented with 8-way time interleaving in 65nm CMOS. The proposed technique converts 4 bits per SAR conversion cycle with reduced overhead, which is a key to achieve both high speed and resolution while maintaining low power consumption. The measured peak SNDR is 72dB and remains above 65.3dB at 1-GHz input frequency at sample rate of 1.6 GS/s. It achieves a record power efficiency of 17.8fJ/conv-step among the recently published high-speed/resolution ADCs.

Question: What is a SAR ADC?


Wireless underground sensor networks: Research challenges. This work introduces the concept of a Wireless Underground Sensor Network (WUSN). WUSNs can be used to monitor a variety of conditions, such as soil properties for agricultural applications and toxic substances for environmental monitoring. Unlike existing methods of monitoring underground conditions, which rely on buried sensors connected via wire to the surface, WUSN devices are deployed completely belowground and do not require any wired connections. Each device contains all necessary sensors, memory, a processor, a radio, an antenna, and a power source. This makes their deployment much simpler than existing underground sensing solutions. Wireless communication within a dense substance such as soil or rock is, however, significantly more challenging than through air. This factor, combined with the necessity to conserve energy due to the difficulty of unearthing and recharging WUSN devices, requires that communication protocols be redesigned to be as efficient as possible. This work provides an extensive overview of applications and design challenges for WUSNs, challenges for the underground communication channel including methods for predicting path losses in an underground link, and challenges at each layer of the communication protocol stack. 2006 Elsevier B.V. All rights reserved.

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


Deconfounded Lexicon Induction for Interpretable Social Science. NLP algorithms are increasingly used in computational social science to take linguistic observations and predict outcomes like human preferences or actions. Making these social models transparent and interpretable often requires identifying features in the input that predict outcomes while also controlling for potential confounds. We formalize this need as a new task: inducing a lexicon that is predictive of a set of target variables yet uncorrelated to a set of confounding variables. We introduce two deep learning algorithms for the task. The first uses a bifurcated architecture to separate the explanatory power of the text and confounds. The second uses an adversarial discriminator to force confound-invariant text encodings. Both elicit lexicons from learned weights and attentional scores. We use them to induce lexicons that are predictive of timely responses to consumer complaints (controlling for product), enrollment from course descriptions (controlling for subject), and sales from product descriptions (controlling for seller). In each domain our algorithms pick words that are associated with narrative persuasion; more predictive and less confound-related than those of standard feature weighting and lexicon induction techniques like regression and log odds.

Question: What is the difference between a lexicon and a dictionary?


Collaborative Filtering Service Recommendation Based on a Novel Similarity Computation Method. Recently, collaborative filtering-based methods are widely used for service recommendation. QoS attribute value-based collaborative filtering service recommendation mainly includes two important steps. One is the similarity computation, and the other is the prediction for QoS attribute value, which the user has not experienced. In previous studies, the performances of some methods need to be improved. In this paper, we propose a ratio-based method to calculate the similarity. We can get the similarity between users or between items by comparing the attribute values directly. Based on our similarity computation method, we propose a new method to predict the unknown value. By comparing the values of a similar service and the current service that are invoked by common users, we can obtain the final prediction result. The performance of the proposed method is evaluated through a large data set of real web services. Experimental results show that our method obtains better prediction precision, lower mean absolute error ( <inline-formula><tex-math notation="LaTeX">$MAE$</tex-math><alternatives> <inline-graphic xlink:href="wu-ieq1-2479228.gif"/></alternatives></inline-formula>) and faster computation time than various reference schemes considered.

Question: What is the difference between collaborative filtering and recommendation?


Question: What is the QAW and ADD method?


An embarrassingly simple approach to zero-shot learning. Zero-shot learning consists in learning how to recognise new concepts by just having a description of them. Many sophisticated approaches have been proposed to address the challenges this problem comprises. In this paper we describe a zero-shot learning approach that can be implemented in just one line of code, yet it is able to outperform state of the art approaches on standard datasets. The approach is based on a more general framework which models the relationships between features, attributes, and classes as a two linear layers network, where the weights of the top layer are not learned but are given by the environment. We further provide a learning bound on the generalisation error of this kind of approaches, by casting them as domain adaptation methods. In experiments carried out on three standard real datasets, we found that our approach is able to perform significantly better than the state of art on all of them, obtaining a ratio of improvement up to 17%.

Question: What is a simple approach to zero-shot learning?


From basic network principles to neural architecture: emergence of orientation-selective cells.. This is the second paper in a series of three that explores the emergence of several prominent features of the functional architecture of visual cortex, in a "modular self-adaptive network" containing several layers of cells with parallel feedforward connections whose strengths develop according to a Hebb-type correlation-rewarding rule. In the present paper I show that orientation-selective cells, similar to the "simple" cortical cells of Hubel and Wiesel [Hubel, D. H. & Wiesel, T. N. (1962) J. Physiol. 160, 106-154], emerge in such a network. No orientation preference is specified to the system at any stage, the orientation-selective cell layer emerges even in the absence of environmental input to the system, and none of the basic developmental rules is specific to visual processing.

Question: What is the emergence of orientation-selective cells?


A Multichannel Approach to Fingerprint Classification. Fingerprint classification provides an important indexing mechanism in a fingerprint database. An accurate and consistent classification can greatly reduce fingerprint matching time for a large database. We present a fingerprint classification algorithm which is able to achieve an accuracy better than previously reported in the literature. We classify fingerprints into five categories: whorl, right loop, left loop, arch, and tented arch. The algorithm uses a novel representation (FingerCode) and is based on a two-stage classifier to make a classification. It has been tested on 4,000 images in the NIST-4 database. For the five-class problem, a classification accuracy of 90 percent is achieved (with a 1.8 percent rejection during the feature extraction phase). For the four-class problem (arch and tented arch combined into one class), we are able to achieve a classification accuracy of 94.8 percent (with 1.8 percent rejection). By incorporating a reject option at the classifier, the classification accuracy can be increased to 96 percent for the five-class classification task, and to 97.8 percent for the four-class classification task after a total of 32.5 percent of the images are rejected.

Question: How to classify fingerprints?


Ring-Shaped Substrate Integrated Waveguide Wilkinson Power Dividers/Combiners. This paper proposes and presents a class of substrate integrated waveguide (SIW) power dividers/combiners based on a modified Wilkinson architecture. The proposed design consists of a ring-type circuit of 1.5 λg length with three waveguide ports. Impedance variation without affecting cutoff frequency and integration of isolation resistance are the two major limitations in connection with the design of SIW Wilkinson structures. Central ring part with different thickness ensures different impedance in the first proposed scheme while the half-mode SIW in the second option. As for the second limitation, the optimal configuration of integrating the isolation resistance is studied. A version without resistance is also examined using a broad-wall series slot. To validate the proposed concept, a bilayered circuit with standard Printed circuit board prototype was fabricated and measured. A table summarizing performances of all the proposed circuits shows a bandwidth of around 25% at the 10 dB reference. A negligible additional insertion loss is observed. The proposed design techniques are found useful at millimeter-wave frequencies where reduced physical dimensions make a circuit configuration suitable for low-cost implementation. This concept is also valid for rectangular waveguide counterparts.

Question: What is a substrate integrated waveguide?


Strength Training for Endurance Athletes: Theory to Practice. THE PURPOSE OF THIS REVIEW IS TWOFOLD: TO ELUCIDATE THE UTILITY OF RESISTANCE TRAINING FOR ENDURANCE ATHLETES, AND PROVIDE THE PRACTITIONER WITH EVIDENCED-BASED PERIODIZATION STRATEGIES FOR CONCURRENT STRENGTH AND ENDURANCE TRAINING IN ATHLETIC POPULATIONS. BOTH LOW-INTENSITY EXERCISE ENDURANCE (LIEE) AND HIGH-INTENSITY EXERCISE ENDURANCE (HIEE) HAVE BEEN SHOWN TO IMPROVE AS A RESULT OF MAXIMAL, HIGH FORCE, LOW VELOCITY (HFLV) AND EXPLOSIVE, LOW-FORCE, HIGH-VELOCITY STRENGTH TRAINING. HFLV STRENGTH TRAINING IS RECOMMENDED INITIALLY TO DEVELOP A NEUROMUSCULAR BASE FOR ENDURANCE ATHLETES WITH LIMITED STRENGTH TRAINING EXPERIENCE. A SEQUENCED APPROACH TOSTRENGTHTRAINING INVOLVING PHASES OF STRENGTHENDURANCE, BASIC STRENGTH, STRENGTH, AND POWER WILL PROVIDE FURTHER ENHANCEMENTS IN LIEE AND HIEE FOR HIGHLEVEL ENDURANCE ATHLETES.

Question: What is the purpose of this review?


TA-COS 2018 : 2 nd Workshop on Text Analytics for Cybersecurity and Online Safety. In this study, we present toxicity annotation for a Thai Twitter Corpus as a preliminary exploration for toxicity analysis in the Thai language. We construct a Thai toxic word dictionary and select 3,300 tweets for annotation using the 44 keywords from our dictionary. We obtained 2,027 and 1,273 toxic and non-toxic tweets, respectively; these were labeled by three annotators. The result of corpus analysis indicates that tweets that include toxic words are not always toxic. Further, it is more likely that a tweet is toxic, if it contains toxic words indicating their original meaning. Moreover, disagreements in annotation are primarily because of sarcasm, unclear existing target, and word sense ambiguity. Finally, we conducted supervised classification using our corpus as a dataset and obtained an accuracy of 0.80, which is comparable with the inter-annotator agreement of this dataset. Our dataset is available on GitHub.

Question: What is the size of the Thai toxic word dictionary?


The Evidence Framework Applied to Classification Networks. Three Bayesian ideas are presented for supervised adaptive classifiers. First, it is argued that the output of a classifier should be obtained by marginalizing over the posterior distribution of the parameters; a simple approximation to this integral is proposed and demonstrated. This involves a "moderation" of the most probable classifier's outputs, and yields improved performance. Second, it is demonstrated that the Bayesian framework for model comparison described for regression models in MacKay (1992a,b) can also be applied to classification problems. This framework successfully chooses the magnitude of weight decay terms, and ranks solutions found using different numbers of hidden units. Third, an information-based data selection criterion is derived and demonstrated within this framework.

Question: What is the evidence framework applied to classification networks?


Credit card incidents and control systems. Credit and debit cards have spread and skyrocketed all around the world to become the most popular means of payments in many countries. Despite their enormous popularity, cards are not free of risk. Technology development and e-commerce have exponentially increased internal credit card incidents. This paper identifies and quantifies the different types of credit card fraud and puts into question the effectiveness of the role assigned to cardholders in its detection. © 2012 Elsevier Ltd. All rights reserved.

Question: What is the role of the cardholder in credit card fraud?


Analysis of SDN Contributions for Cloud Computing Security. Cloud infrastructures are composed fundamentally of computing, storage, and networking resources. In regards to network, Software-Defined Networking (SDN) has become one of the most important architectures for the management of networks that require frequent re-policing or re-configurations. Considering the already known security issues of Cloud Computing, SDN helps to give fast answers to emerging threats, but also introduces new vulnerabilities related to its own architecture. In this paper, we analyze recent security proposals derived from the use of SDN, and elaborate on whether it helps to improve trust, security and privacy in Cloud Computing. Moreover, we discuss security concerns introduced by the SDN architecture and how they could compromise Cloud services. Finally, we explore future security perspectives with regard to leveraging SDN benefits and mitigating its security issues.

Question: What is the security of cloud computing?


Using Structured Events to Predict Stock Price Movement: An Empirical Investigation. It has been shown that news events influence the trends of stock price movements. However, previous work on news-driven stock market prediction rely on shallow features (such as bags-of-words, named entities and noun phrases), which do not capture structured entity-relation information, and hence cannot represent complete and exact events. Recent advances in Open Information Extraction (Open IE) techniques enable the extraction of structured events from web-scale data. We propose to adapt Open IE technology for event-based stock price movement prediction, extracting structured events from large-scale public news without manual efforts. Both linear and nonlinear models are employed to empirically investigate the hidden and complex relationships between events and the stock market. Largescale experiments show that the accuracy of S&P 500 index prediction is 60%, and that of individual stock prediction can be over 70%. Our event-based system outperforms bags-of-words-based baselines, and previously reported systems trained on S&P 500 stock historical data.

Question: What is the accuracy of stock price prediction?


The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.

Question: What is the granular tabu search?


Semantic Facial Expression Editing using Autoencoded Flow. High-level manipulation of facial expressions in images — such as changing a smile to a neutral expression — is challenging because facial expression changes are highly non-linear, and vary depending on the appearance of the face. We present a fully automatic approach to editing faces that combines the advantages of flow-based face manipulation with the more recent generative capabilities of Variational Autoencoders (VAEs). During training, our model learns to encode the flow from one expression to another over a low-dimensional latent space. At test time, expression editing can be done simply using latent vector arithmetic. We evaluate our methods on two applications: 1) single-image facial expression editing, and 2) facial expression interpolation between two images. We demonstrate that our method generates images of higher perceptual quality than previous VAE and flow-based methods.

Question: How to edit facial expressions?


A Survey of Incentive Mechanisms for Participatory Sensing. Participatory sensing is now becoming more popular and has shown its great potential in various applications. It was originally proposed to recruit ordinary citizens to collect and share massive amounts of sensory data using their portable smart devices. By attracting participants and paying rewards as a return, incentive mechanisms play an important role to guarantee a stable scale of participants and to improve the accuracy/coverage/timeliness of the sensing results. Along this direction, a considerable amount of research activities have been conducted recently, ranging from experimental studies to theoretical solutions and practical applications, aiming at providing more comprehensive incentive procedures and/or protecting benefits of different system stakeholders. To this end, this paper surveys the literature over the period of 2004-2014 from the state of the art of theoretical frameworks, applications and system implementations, and experimental studies of the incentive strategies used in participatory sensing by providing up-to-date research in the literature. We also point out future directions of incentive strategies used in participatory sensing.

Question: What is the state of the art of incentive mechanisms for participatory sensing?


Iris Recognition Based on Combined Feature of GLCM and Wavelet Transform. Iris biometric is considered to be one of the most efficient and trusted biometric method for authenticating users. This paper presents a method for iris recognition based on hybrid feature set of wavelet and GLCM features, a non-filter based technique, combined with Haar wavelet transform to increase the efficiency of the system. Here we combine frequency domain feature with spatial domain feature to increase overall efficiency of system. Probability neural Network is used to classify the features. Results show that the overall system efficiency is 94% with false rejection rate higher than false acceptance rate. The technique is tested on CASIA Iris database.

Question: What is the iris recognition based on?


Query segmentation revisited. We address the problem of query segmentation: given a keyword query, the task is to group the keywords into phrases, if possible. Previous approaches to the problem achieve reasonable segmentation performance but are tested only against a small corpus of manually segmented queries. In addition, many of the previous approaches are fairly intricate as they use expensive features and are difficult to be reimplemented.  The main contribution of this paper is a new method for query segmentation that is easy to implement, fast, and that comes with a segmentation accuracy comparable to current state-of-the-art techniques. Our method uses only raw web n-gram frequencies and Wikipedia titles that are stored in a hash table. At the same time, we introduce a new evaluation corpus for query segmentation. With about 50,000 human-annotated queries, it is two orders of magnitude larger than the corpus being used up to now.

Question: What is the new method for query segmentation?