Human Behaviour and the Principle of Least Effort: an Introduction to Human Ecology. Some people may be laughing when looking at you reading in your spare time. Some may be admired of you. And some may want be like you who have reading hobby. What about your own feel? Have you felt right? Reading is a need and a hobby at once. This condition is the on that will make you feel that you must read. If you know are looking for the book enPDFd human behavior and the principle of least effort an introduction to human ecology as the choice of reading, you can find here.

Question: What is the book about?


LinkedIn skills: large-scale topic extraction and inference. "Skills and Expertise" is a data-driven feature on LinkedIn, the world's largest professional online social network, which allows members to tag themselves with topics representing their areas of expertise. In this work, we present our experiences developing this large-scale topic extraction pipeline, which includes constructing a folksonomy of skills and expertise and implementing an inference and recommender system for skills. We also discuss a consequent set of applications, such as Endorsements, which allows members to tag themselves with topics representing their areas of expertise and for their connections to provide social proof, via an "endorse" action, of that member's competence in that topic.

Question: What is a folksonomy?


Deep Sparse Subspace Clustering. In this paper, we present a deep extension of Sparse Subspace Clustering, termed Deep Sparse Subspace Clustering (DSSC). Regularized by the unit sphere distribution assumption for the learned deep features, DSSC can infer a new data affinity matrix by simultaneously satisfying the sparsity principle of SSC and the nonlinearity given by neural networks. One of the appealing advantages brought by DSSC is: when original real-world data do not meet the class-specific linear subspace distribution assumption, DSSC can employ neural networks to make the assumption valid with its hierarchical nonlinear transformations. To the best of our knowledge, this is among the first deep learning based subspace clustering methods. Extensive experiments are conducted on four real-world datasets to show the proposed DSSC is significantly superior to 12 existing methods for subspace clustering.

Question: What is the difference between deep sparse subspace clustering and sparse subspace clustering?


An Algorithmic Approach to Concept Exploration in a Large Knowledge Network (Automatic Thesaurus Consultation): Symbolic Branch-and-Bound Search vs. Connectionist Hopfield Net Activation. This paper presents a framework for knowledge discovery and concept exploration. In order to enhance the concept exploration capability of knowledge-based systems and to alleviate the limitations of the manual browsing approach, we have developed two spreading activation-based algorithms for concept exploration in large, heterogeneous networks of concepts (e.g., multiple thesauri). One algorithm, which is based on the symbolic Al paradigm, performs a conventional branch-and-bound search on a semantic net representation to identify other highly relevant concepts (a serial, optimal search process). The second algorithm, which is based on the neural network approach, executes the Hopfield net parallel relaxation and convergence process to identify "convergent" concepts for some initial queries (a parallel, heuristic search process). Both algorithms can be adopted for automatic, multiple-thesauri consultation. We tested these two algorithms on a large text-based knowledge network of about 13,000 nodes (terms) and 80,000 directed links in the area of computing technologies. This knowledge network was created from two external thesauri and one automatically generated thesaurus. We conducted experiments to compare the behaviors and performances of the two algorithms with the hypertext-like browsing process. Our experiment revealed that manual browsing achieved higher-term recall but lower-term precision in comparison to the algorithmic systems. However, it was also a much more laborious and cognitively demanding process. In document retrieval, there were no statistically significant differences in document recall and precision between the algorithms and the manual browsing process. In light of the effort required by the manual browsing process, our proposed algorithmic approach presents a

Question: What is the difference between the symbolic and neural network approaches?


iPinYou Global RTB Bidding Algorithm Competition Dataset. RTB (Real Time Bidding) is one of the most exciting developments in computational advertising in recent years. It drives transparency and efficiency in the display advertising ecosystem and facilitates the healthy growth of the display advertising industry. It enables advertisers to deliver the right message to the right person at the right time, publishers to better monetize their content by leveraging their website audience, and consumers to view relevant information through personalized ads. However, researchers in computational advertising area have been suffering from lack of publicly available datasets. iPinYou organizes a three-season global RTB algorithm competition in 2013. For each season, there is offline stage and online stage. On the offline stage, iPinYou releases a dataset for model training and reserves a dataset for testing. The dataset includes logs of ad biddings, impressions, clicks, and final conversions. After the whole competition ends, iPinYou organizes and releases all these three datasets for public use. These datasets can support experiments of some important research problems such as bid optimization and CTR estimation. To the best of our knowledge, this is the first publicly available dataset on RTB display advertising. In this paper, we give descriptions of these datasets to further boost the interests of computational advertising research community using this dataset.

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


Question: What is cp?


Synthesizing Programs for Images using Reinforced Adversarial Learning. Advances in deep generative networks have led to impressive results in recent years. Nevertheless, such models can often waste their capacity on the minutiae of datasets, presumably due to weak inductive biases in their decoders. This is where graphics engines may come in handy since they abstract away low-level details and represent images as high-level programs. Current methods that combine deep learning and renderers are limited by hand-crafted likelihood or distance functions, a need for large amounts of supervision, or difficulties in scaling their inference algorithms to richer datasets. To mitigate these issues, we present SPIRAL, an adversarially trained agent that generates a program which is executed by a graphics engine to interpret and sample images. The goal of this agent is to fool a discriminator network that distinguishes between real and rendered data, trained with a distributed reinforcement learning setup without any supervision. A surprising finding is that using the discriminator's output as a reward signal is the key to allow the agent to make meaningful progress at matching the desired output rendering. To the best of our knowledge, this is the first demonstration of an end-to-end, unsupervised and adversarial inverse graphics agent on challenging real world (MNIST, OMNIGLOT, CELEBA) and synthetic 3D datasets. A video of the agent can be found at https://youtu.be/iSyvwAwa7vk.

Question: How to synthesize images using reinforcement learning?


A comparison of spotlight synthetic aperture radar image formation techniques. Spotlight synthetic aperture radar images can be formed from the complex phase history data using two main techniques: 1) polar-to-Cartesian interpolation followed by twodimensional inverse Fourier transform (2DFFT) , and 2) convolution backprojection (CBP) . CBP has been widely used to reconstruct medical images in computer aided tomography, and only recently has been applied to form synthetic aperture radar imagery. It is alleged that CBP yields higher quality images because 1) all the Fourier data are used and 2) the polar formatted data is used directly to form a 2D Cartesian image and therefore 2D interpolation is not required. This report compares the quality of images formed by CBP and several modified versions of the 2DFFT method. We show from an image quality point of view that CBP is equivalent to first windowing the phase history data and then interpolating to an exscribed rectangle. From a mathematical perspective, we should expect this conclusion since the same Fourier data are used to form the SAR image. We next address the issue of parallel implementation of each algorithm. We dispute previous claims that CBP is more readily parallelizable than the 2DFFT method. Our conclusions are supported by comparing execution times between massively parallel implementations of both algorithms, showing that both experience similar decreases in computation time, but that CBP takes significantly longer to form an image. This page intentionally left blank

Question: What is the difference between spotlight synthetic aperture radar image formation techniques?


Greedy Attribute Selection. Many real-world domains bless us with a wealth of attributes to use for learning. This blessing is often a curse: most inductive methods generalize worse given too many attributes than if given a good subset of those attributes. We examine this problem for two learning tasks taken from a calendar scheduling domain. We show that ID3/C4.5 generalizes poorly on these tasks if allowed to use all available attributes. We examine five greedy hillclimbing procedures that search for attribute sets that generalize well with ID3/C4.5. Experiments suggest hillclimbing in attribute space can yield substantial improvements in generalization performance. We present a caching scheme that makes attribute hillclimbing more practical computationally. We also compare the results of hillclimbing in attribute space with FOCUS and RELIEF on the two tasks.

Question: What is the difference between hill climbing and hill climbing in attribute space?


Machine Learning with World Knowledge: The Position and Survey. Machine learning has become pervasive in multiple domains, impacting a wide variety of applications, such as knowledge discovery and data mining, natural language processing, information retrieval, computer vision, social and health informatics, ubiquitous computing, etc. Two essential problems of machine learning are how to generate features and how to acquire labels for machines to learn. Particularly, labeling large amount of data for each domain-specific problem can be very time consuming and costly. It has become a key obstacle in making learning protocols realistic in applications. In this paper, we will discuss how to use the existing general-purpose world knowledge to enhance machine learning processes, by enriching the features or reducing the labeling work. We start from the comparison of world knowledge with domain-specific knowledge, and then introduce three key problems in using world knowledge in learning processes, i.e., explicit and implicit feature representation, inference for knowledge linking and disambiguation, and learning with direct or indirect supervision. Finally we discuss the future directions of this research topic.

Question: What is machine learning?


Less guilty by reason of adolescence: developmental immaturity, diminished responsibility, and the juvenile death penalty.. The authors use a developmental perspective to examine questions about the criminal culpability of juveniles and the juvenile death penalty. Under principles of criminal law, culpability is mitigated when the actor's decision-making capacity is diminished, when the criminal act was coerced, or when the act was out of character. The authors argue that juveniles should not be held to the same standards of criminal responsibility as adults, because adolescents' decision-making capacity is diminished, they are less able to resist coercive influence, and their character is still undergoing change. The uniqueness of immaturity as a mitigating condition argues for a commitment to a legal environment under which most youths are dealt with in a separate justice system and none are eligible for capital punishment.

Question: What is the juvenile death penalty?


Spectral Clustering Based on Local PCA. We propose a spectral clustering method based on local principal components analysis (PCA). After performing local PCA in selected neighborhoods, the algorithm builds a nearest neighbor graph weighted according to a discrepancy between the principal subspaces in the neighborhoods, and then applies spectral clustering. As opposed to standard spectral methods based solely on pairwise distances between points, our algorithm is able to resolve intersections. We establish theoretical guarantees for simpler variants within a prototypical mathematical framework for multi-manifold clustering, and evaluate our algorithm on various simulated data sets.

Question: What is a prototypical mathematical framework for multi-manifold clustering?


Tracing Data Lineage Using Schema Transformation Pathways. With the increasing amount and diversity of information available on the Internet, there has been a huge growth in information systems that need to integrate data from distributed, heterogeneous data sources. Tracing the lineage of the integrated data is one of the current problems being addressed in data warehouse research. In this paper, we propose a new approach for tracing data linage based on schema transformation pathways. We show how the individual transformation steps in a transformation pathway can be used to trace the derivation of the integrated data in a step-wise fashion, thus simplifying the lineage tracing process.

Question: How to trace data lineage?


Efficient Authentication and Signing of Multicast Streams over Lossy Channels. Multicast stream authentication and signing is an important and challenging problem. Applications include the continuous authentication of radio and TV Internet broadcasts, and authenticated data distribution by satellite. The main challenges are fourfold. First, authenticity must be guaranteed even when only the sender of the data is trusted. Second, the scheme needs to scale to potentially millions of receivers. Third, streamed media distribution can have high packet loss. Finally, the system needs to be efficient to support fast packet rates. We propose two efficient schemes, TESLA and EMSS, for secure lossy multicast streams. TESLA, short for Timed Efficient Stream Loss-tolerant Authentication, offers sender authentication, strong loss robustness, high scalability, and minimal overhead, at the cost of loose initial time synchronization and slightly delayed authentication. EMSS, short for Efficient Multi-chained Stream Signature, provides nonrepudiation of origin, high loss resistance, and low overhead, at the cost of slightly delayed verification. This work began in Summer 1999 when Adrian Perrig and Dawn Song were visiting the IBM T. J. Watson research lab. Initial research on stream authentication was done during Summer 1999 by Ran Canetti, Adrian Perrig, and Dawn Song at IBM. Additional improvements were suggested by J. D. Tygar in Fall 1999 at UC Berkeley. Implementation was done in Fall 1999 by Adrian Perrig at UC Berkeley. The work on stream signatures was done by J. D. Tygar, Adrian Perrig, and Dawn Song at UC Berkeley. Additional work was performed by Ran Canetti in Spring 2000. Ran Canetti is at IBM T. J. Watson Research Center, and Adrian Perrig, Dawn Song, and J. D. Tygar are at the Computer Science Division, UC Berkeley. This research was suported in part by the Defense Advanced Research Projects Agency under DARPA contract N6601-99-28913 (under supervision of the Space an

Question: What is the difference between authentication and nonrepudiation?


Designing an Indonesian part of speech tagset and manually tagged Indonesian corpus. We describe our work on designing a linguistically principled part of speech (POS) tagset for the Indonesian language. The process involves a detailed study and analysis of existing tagsets and the manual tagging of an Indonesian corpus. The results of this work are an Indonesian POS tagset consisting of 23 tags and an Indonesian corpus of over 250.000 lexical tokens that have been manually tagged using this tagset.

Question: How to design a linguistically principled part of speech tagset?


Extraction of high confidence minutiae points from fingerprint images. Fingerprint is one of the well accepted biometric traits for building automatic human recognition system. These systems mainly involves matching of two fingerprints based on their minutiae points. Therefore, extraction of reliable or true minutiae from the fingerprint image is critically important. This paper proposed an novel algorithm for automatic extraction of highly reliable minutiae points from a fingerprint image. It utilizes frequency domain image enhancement and heuristics. Experiments have been conducted on two databases. FVC2002 which is a publicly available fingerprint database containing 800 fingerprint images of 100 persons and IITK-Sel500FP which is an in-house database containing 1000 fingerprint images of 500 persons. Minutiae points extracted by the proposed algorithm are benchmarked against the manually marked ones and the comparison is done with an open source minutiae extractor mindtct of NIST. Experimental results have shown that the proposed algorithm has significantly higher confidence of extracted minutiae points being true.

Question: How to extract minutiae points from a fingerprint image?


Complete Analytical Forward and Inverse Kinematics for the NAO Humanoid Robot. Articulated robots with multiple degrees of freedom, such as humanoid robots, have become popular research platforms in robotics and artificial intelligence. Such robots can perform complex motions, including the balancing, walking, and kicking skills required in the RoboCup robot soccer competition. The design of complex dynamic motions is achievable only through the use of robot kinematics, which is an application of geometry to the study of arbitrary robotic chains. This thesis studies the problems of forward and inverse kinematics for the Aldebaran NAO humanoid robot and presents for the first time a complete analytical solution to both problems with no approximations, including an implementation of a software library for real-time execution. The forward kinematics allow NAO developers to map any configuration of the robot from its own joint space to the three-dimensional physical space, whereas the inverse kinematics provide closedform solutions to finding joint configurations that drive the end effectors of the robot to desired points in the three-dimensional space. The proposed solution was made feasible through a decomposition into five independent problems (head, two arms, two legs), the use of the Denavit-Hartenberg method, and the analytical solution of a non-linear system of equations. The main advantage of the proposed inverse kinematics compared to existing numerical approaches is its accuracy, its efficiency, and the elimination of singularities. The implemented NAO kinematics library, which additionally offers centerof-mass calculation, is demonstrated in two motion design tasks: pointing to the ball and basic balancing. The library has been integrated into the software architecture of the RoboCup team "Kouretes" and is currently being used in various motion design problems, such as dynamic balancing, trajectory following, dynamic kicking, and omnidirectional walking.

Question: What is the denavit-hartenberg method?


A model of neuronal responses in visual area MT. Electrophysiological studies indicate that neurons in the middle temporal (MT) area of the primate brain are selective for the velocity of visual stimuli. This paper describes a computational model of MT physiology, in which local image velocities are represented via the distribution of MT neuronal responses. The computation is performed in two stages, corresponding to neurons in cortical areas V1 and MT. Each stage computes a weighted linear sum of inputs, followed by rectification and divisive normalization. V1 receptive field weights are designed for orientation and direction selectivity. MT receptive field weights are designed for velocity (both speed and direction) selectivity. The paper includes computational simulations accounting for a wide range of physiological data, and describes experiments that could be used to further test and refine the model.

Question: What is the velocity of visual stimuli?


CLASSIFICATION USING NAÏVE BAYES , VSM AND POS TAGGER. This research focuses on Text Classification. Text classification is the task of automatically sorting a set of documents into categories from a predefined set. The domain of this research is the combination of information ret rieval (IR) technology, Data mining and machine learning (ML) technology. This research will outline the fundamental traits of the technologies involved. This research uses three text classification algorithms (Naive Bayes, VSM for text classificatio n and the new technique -Use of Stanford Tagger for text classific ation) to classify documents into different categories, which is trained on two different datasets (20 Newsgroups and New news dataset for five categories).In regards to the above classifica tion strategies, Naïve Bayes is potentially good at serving as a tex classification model due to its simplicity.

Question: What is the difference between naive bayes and VSM?


Childhood Adversity and Factors Determining Resilience among Undergraduate Students. Childhood adversity experiences, when not properly managed may result to anti-social behaviour, health risk or psychological problems like severe depression, suicidal behavior in undergraduate students. Hence the study examined childhood adversity experiences and its factors determining resilience among undergraduate students in Oyo State. The study adopted a descriptive survey research; multi-stage random sampling technique was used to select 341 undergraduate students of Ladoke Akintola University of Technology, Ogbomosho and Oyo State. Two research instruments were used to test childhood adversity scale and factors determining resilience (protective family, birth order, community protective factors). The study formulated four research hypotheses which were tested with Pearson Product moment correlation analysis and multiple regression analysis at coefficient level of 0.05. The result of the analysis revealed that level of Adverse Childhood Experience (ACE) among respondents is slightly low with half of the respondents between the ages of 18 years to 20 years. The prominent ACE identified by respondents is physical assaults, home with incidence of substance abuse, victim of sexual abuse, and humiliation from parents. The level of resilience among the respondents is moderate. There was a positive significant relationship between childhood adversity and lifetime resilience undergraduate student in Oyo State (r = 0.272), protective family factor was also associated with lifetime resilience undergraduate student in Oyo State (r = 0.018) there was a significant relationship between birth order and lifetime resilience undergraduate student in Oyo State. (r = 0.794) there was a significant relationship between community protective factor and lifetime resilience undergraduate student o in Oyo State (r = 0.835). The magnitude of relative contribution showed protective family factor (β = 0.

Question: What is the magnitude of relative contribution of protective family factor?


An Approach to Capture Role-Based Access Control Models from Spring Web Applications. To mitigate potential misinterpretation and security violations, software developers should use tools that reflect the state of web applications and visualise them as graphical models. Modelling helps to ensure that functionality and access control mechanisms are consistently interconnected. In this paper, we propose an approach to support Web application development using the Spring platform. Our proposal is supported by the Eclipse IDE plugin tool, which recognises Spring Security configuration captures, its notations, and visualises them in the role-based access control (RBAC) models. The RBAC models are represented using SecureUML modelling language. The plugin is validated through survey taken by software developers.

Question: How to model spring security in secureuml?


Clinical narrative classification using discriminant word embeddings with ELM. Clinical texts are inherently complex due to the medical domain expertise required for content comprehension. In addition, the unstructured nature of these narratives poses a challenge for automatically extracting information. In natural language processing, the use of word embeddings are an effective approach to generate word representations (vectors) in a low dimensional space. In this paper we use a log-linear model (a type of neural language model) and Linear Discriminant Analysis with a kernel-based Extreme Learning Machine (ELM) to map the clinical texts to the medical code. Experimental results on clinical texts indicate improvement with ELM in comparison to SVM and neural network approaches.

Question: How to classify clinical texts?


Multi-clip video editing from a single viewpoint. We propose a framework for automatically generating multiple clips suitable for video editing by simulating pan-tilt-zoom camera movements within the frame of a single static camera. Assuming important actors and objects can be localized using computer vision techniques, our method requires only minimal user input to define the subject matter of each sub-clip. The composition of each sub-clip is automatically computed in a novel L1-norm optimization framework. Our approach encodes several common cinematographic practices into a single convex cost function minimization problem, resulting in aesthetically pleasing sub-clips which can easily be edited together using off-the-shelf multi-clip video editing software. We demonstrate our approach on five video sequences of a live theatre performance by generating multiple synchronized subclips for each sequence.

Question: How to automatically generate multiple clips suitable for video editing?


Hierarchical Attention Networks. We propose a novel attention network, which accurately attends to target objects of various scales and shapes in images through multiple stages. The proposed network enables multiple layers to estimate attention in a convolutional neural network (CNN). The hierarchical attention model gradually suppresses irrelevant regions in an input image using a progressive attentive process over multiple CNN layers. The attentive process in each layer determines whether to pass or suppress feature maps for use in the next convolution. We employ local contexts to estimate attention probability at each location since it is difficult to infer accurate attention by observing a feature vector from a single location only. The experiments on synthetic and real datasets show that the proposed attention network outperforms traditional attention methods in various attribute prediction tasks.

Question: What is a hierarchical attention network?


BabyTalk: Understanding and Generating Simple Image Descriptions. We present a system to automatically generate natural language descriptions from images. This system consists of two parts. The first part, content planning, smooths the output of computer vision-based detection and recognition algorithms with statistics mined from large pools of visually descriptive text to determine the best content words to use to describe an image. The second step, surface realization, chooses words to construct natural language sentences based on the predicted content and general statistics from natural language. We present multiple approaches for the surface realization step and evaluate each using automatic measures of similarity to human generated reference descriptions. We also collect forced choice human evaluations between descriptions from the proposed generation system and descriptions from competing approaches. The proposed system is very effective at producing relevant sentences for images. It also generates descriptions that are notably more true to the specific image content than previous work.

Question: How does the system generate natural language descriptions?


Novelty detection for time series data analysis in water distribution systems using support vector machines. The sampling frequency and quantity of time series data collected from water distribution systems has been increasing in recent years, giving rise to the potential for improving system knowledge if suitable automated techniques can be applied, in particular, machine learning. Novelty (or anomaly) detection refers to the automatic identification of novel or abnormal patterns embedded in large amounts of ''normal'' data. When dealing with time series data (transformed into vectors), this means abnormal events embedded amongst many normal time series points. The support vector machine is a data-driven statistical technique that has been developed as a tool for classification and regression. The key features include statistical robustness with respect to non-Gaussian errors and outliers, the selection of the decision boundary in a principled way, and the introduction of nonlinearity in the feature space without explicitly requiring a nonlinear algorithm by means of kernel functions. In this research, support vector regression is used as a learning method for anomaly detection from water flow and pressure time series data. No use is made of past event histories collected through other information sources. The support vector regression methodology, whose robustness derives from the training error function, is applied

Question: What is a support vector machine?


Optimization of the internal grid of an offshore wind farm using Genetic algorithm. Offshore wind energy is a promising solution thanks to its best performance of production. However its development leads to many technical and especially economic challenges among them the electrical grid topology attracts a large investment. In this paper, our objective is to minimize a part of this total investment which represents the initial cost of the middle voltage cables in the internal network with different cross sections. An approach based on Genetic Algorithm is developed to find the best topology to connect all wind turbines and substations. The proposed model initially accepts all possible configurations: radial, star, ring, and tree. The results prove that the optimization model can be used for designing the electrical architecture of the internal network of an offshore wind farm.

Question: How to optimize the internal grid of an offshore wind farm?


Interventions shown to aid executive function development in children 4 to 12 years old.. To be successful takes creativity, flexibility, self-control, and discipline. Central to all those are executive functions, including mentally playing with ideas, giving a considered rather than an impulsive response, and staying focused. Diverse activities have been shown to improve children's executive functions: computerized training, noncomputerized games, aerobics, martial arts, yoga, mindfulness, and school curricula. All successful programs involve repeated practice and progressively increase the challenge to executive functions. Children with worse executive functions benefit most from these activities; thus, early executive-function training may avert widening achievement gaps later. To improve executive functions, focusing narrowly on them may not be as effective as also addressing emotional and social development (as do curricula that improve executive functions) and physical development (shown by positive effects of aerobics, martial arts, and yoga).

Question: What are executive functions?


Bayesian Methods for Mixtures of Experts. Tony Robinson Cambridge University Engineering Department Cambridge CB2 1PZ England. Tel: [+44] 1223 332815 ajr@eng.cam.ac.uk We present a Bayesian framework for inferring the parameters of a mixture of experts model based on ensemble learning by variational free energy minimisation. The Bayesian approach avoids the over-fitting and noise level under-estimation problems of traditional maximum likelihood inference. We demonstrate these methods on artificial problems and sunspot time series prediction.

Question: What is a Bayesian framework for inferring the parameters of a mixture of experts model?


Using temporal IDF for efficient novelty detection in text streams. Novelty detection in text streams is a challenging task that emerges in quite a few different scenarios, ranging from email thread filtering to RSS news feed recommendation on a smartphone. An efficient novelty detection algorithm can save the user a great deal of time and resources when browsing through relevant yet usually previously-seen content. Most of the recent research on detection of novel documents in text streams has been building upon either geometric distances or distributional similarities, with the former typically performing better but being much slower due to the need of comparing an incoming document with all the previously-seen ones. In this paper, we propose a new approach to novelty detection in text streams. We describe a resource-aware mechanism that is able to handle massive text streams such as the ones present today thanks to the burst of social media and the emergence of the Web as the main source of information. We capitalize on the historical Inverse Document Frequency (IDF) that was known for capturing well term specificity and we show that it can be used successfully at the document level as a measure of document novelty. This enables us to avoid similarity comparisons with previous documents in the text stream, thus scaling better and leading to faster execution times. Moreover, as the collection of documents evolves over time, we use a temporal variant of IDF not only to maintain an efficient representation of what has already been seen but also to decay the document frequencies as the time goes by. We evaluate the performance of the proposed approach on a real-world news articles dataset created for this task. We examine an exhaustive number of variants of the model and compare them to several commonly used baselines that rely on geometric distances. The results show that the proposed method outperforms all of the baselines while managing to operate efficiently in t

Question: What is the difference between a temporal and a geometric distance?


A Study of Various Feature Extraction Methods on a Motor Imagery Based Brain Computer Interface System. INTRODUCTION Brain Computer Interface (BCI) systems based on Movement Imagination (MI) are widely used in recent decades. Separate feature extraction methods are employed in the MI data sets and classified in Virtual Reality (VR) environments for real-time applications.   METHODS This study applied wide variety of features on the recorded data using Linear Discriminant Analysis (LDA) classifier to select the best feature sets in the offline mode. The data set was recorded in 3-class tasks of the left hand, the right hand, and the foot motor imagery.   RESULTS The experimental results showed that Auto-Regressive (AR), Mean Absolute Value (MAV), and Band Power (BP) features have higher accuracy values,75% more than those for the other features.   DISCUSSION These features were selected for the designed real-time navigation. The corresponding results revealed the subject-specific nature of the MI-based BCI system; however, the Power Spectral Density (PSD) based α-BP feature had the highest averaged accuracy.

Question: What is the difference between the features?


GUIDANCE LAW EVALUATION FOR MISSILE GUIDANCE SYSTEMS. In missile guidance system, to reduce the interception "miss distance," it is important to choose a suitable guidance law and navigation constant. This paper investigates and compares the system behavior of guidance laws under different navigation constants. Based on use of the adjoint technique, miss distance sensitivity analyses which consider the system noise, target step maneuver, initial heading error and system parameters for different guidance laws and navigation constants are presented. Based on these analyses, some suggestions for choosing a suitable guidance law and navigation constant are given for the design of missile guidance systems. Also, a suggestion for the optimal escape time for pilots of fighter planes is given.

Question: What is the optimal escape time for pilots of fighter planes?


DanQ: a hybrid convolutional and recurrent deep neural network for quantifying the function of DNA sequences. Modeling the properties and functions of DNA sequences is an important, but challenging task in the broad field of genomics. This task is particularly difficult for non-coding DNA, the vast majority of which is still poorly understood in terms of function. A powerful predictive model for the function of non-coding DNA can have enormous benefit for both basic science and translational research because over 98% of the human genome is non-coding and 93% of disease-associated variants lie in these regions. To address this need, we propose DanQ, a novel hybrid convolutional and bi-directional long short-term memory recurrent neural network framework for predicting non-coding function de novo from sequence. In the DanQ model, the convolution layer captures regulatory motifs, while the recurrent layer captures long-term dependencies between the motifs in order to learn a regulatory 'grammar' to improve predictions. DanQ improves considerably upon other models across several metrics. For some regulatory markers, DanQ can achieve over a 50% relative improvement in the area under the precision-recall curve metric compared to related models. We have made the source code available at the github repository http://github.com/uci-cbcl/DanQ.

Question: What is the area under the precision-recall curve metric?


Analyzing the performance differences between pattern matching and compressed pattern matching on texts. In this study the statistics of pattern matching on text data and the statistics of compressed pattern matching on compressed form of the same text data are compared. A new application has been developed to count the character matching numbers in compressed and uncompressed texts individually. Also a new text compression algorithm that allows compressed pattern matching by using classical pattern matching algorithms without any change is presented in this paper. In this paper while the presented compression algorithm based on digram and trigram substitution has been giving about 30-35% compression factor, the duration of compressed pattern matching on compressed text is calculated less than the duration of pattern matching on uncompressed text. Also it is confirmed that the number of character comparison on compressed texts while doing a compressed pattern matching is less than the number of character comparison on uncompressed texts. Thus the aim of the developed compression algorithm is to point out the difference in text processing between compressed and uncompressed text and to form opinions for another applications.

Question: What is the difference between compressed and uncompressed text?


Additive Quantization for Extreme Vector Compression. We introduce a new compression scheme for high-dimensional vectors that approximates the vectors using sums of M codewords coming from M different codebooks. We show that the proposed scheme permits efficient distance and scalar product computations between compressed and uncompressed vectors. We further suggest vector encoding and codebook learning algorithms that can minimize the coding error within the proposed scheme. In the experiments, we demonstrate that the proposed compression can be used instead of or together with product quantization. Compared to product quantization and its optimized versions, the proposed compression approach leads to lower coding approximation errors, higher accuracy of approximate nearest neighbor search in the datasets of visual descriptors, and lower image classification error, whenever the classifiers are learned on or applied to compressed vectors.

Question: What is the difference between product quantization and additive quantization?


Strategies for Evaluating Software Usability. This paper presents a usage analysis and taxonomy of methods which are used to evaluate the usability of computer systems. To accommodate the analysis and taxonomy, a matrix of strategies which can be used for effective usability evaluation is presented. Such an analysis, taxonomy and strategies support human-computer interaction (HCI) professionals who have the responsibility for ensuring computer system usability. The strategies outlined are named Virtual Engineering, Soft Modelling, Hard Review and Real World. This paper also uses a composite set of existing popular generic evaluation methods which can be used as part of these strategies. The methods used are observation, questionnaire, interview, empirical methods, user groups, cognitive walkthroughs, heuristic methods, review methods and model methods. The paper continues by presenting a Usage Analysis Table of these methods and concludes by grouping them into a Taxonomy of Usability Evaluation Methods. A key emphasis of this paper is the appropriateness of individual methods to lifecycle timing.

Question: What is the difference between usability and user interface?


A meta-analysis of human-system interfaces in unmanned aerial vehicle (UAV) swarm management.. A meta-analysis was conducted to systematically evaluate the current state of research on human-system interfaces for users controlling semi-autonomous swarms composed of groups of drones or unmanned aerial vehicles (UAVs). UAV swarms pose several human factors challenges, such as high cognitive demands, non-intuitive behavior, and serious consequences for errors. This article presents findings from a meta-analysis of 27 UAV swarm management papers focused on the human-system interface and human factors concerns, providing an overview of the advantages, challenges, and limitations of current UAV management interfaces, as well as information on how these interfaces are currently evaluated. In general allowing user and mission-specific customization to user interfaces and raising the swarm's level of autonomy to reduce operator cognitive workload are beneficial and improve situation awareness (SA). It is clear more research is needed in this rapidly evolving field.

Question: What is a meta-analysis?


Trends in extreme learning machines: A review. Extreme learning machine (ELM) has gained increasing interest from various research fields recently. In this review, we aim to report the current state of the theoretical research and practical advances on this subject. We first give an overview of ELM from the theoretical perspective, including the interpolation theory, universal approximation capability, and generalization ability. Then we focus on the various improvements made to ELM which further improve its stability, sparsity and accuracy under general or specific conditions. Apart from classification and regression, ELM has recently been extended for clustering, feature selection, representational learning and many other learning tasks. These newly emerging algorithms greatly expand the applications of ELM. From implementation aspect, hardware implementation and parallel computation techniques have substantially sped up the training of ELM, making it feasible for big data processing and real-time reasoning. Due to its remarkable efficiency, simplicity, and impressive generalization performance, ELM have been applied in a variety of domains, such as biomedical engineering, computer vision, system identification, and control and robotics. In this review, we try to provide a comprehensive view of these advances in ELM together with its future perspectives.

Question: What is the difference between ELM and neural networks?


Extracting 3D Vascular Structures from Microscopy Images using Convolutional Recurrent Networks. Vasculature is known to be of key biological significance, especially in the study of cancer. As such, considerable effort has been focused on the automated measurement and analysis of vasculature in medical and pre-clinical images. In tumors in particular, the vascular networks may be extremely irregular and the appearance of the individual vessels may not conform to classical descriptions of vascular appearance. Typically, vessels are extracted by either a segmentation and thinning pipeline, or by direct tracking. Neither of these methods are well suited to microscopy images of tumor vasculature. In order to address this we propose a method to directly extract a medial representation of the vessels using Convolutional Neural Networks. We then show that these two-dimensional centerlines can be meaningfully extended into 3D in anisotropic and complex microscopy images using the recently popularized Convolutional Long Short-Term Memory units (ConvLSTM). We demonstrate the effectiveness of this hybrid convolutional-recurrent architecture over both 2D and 3D convolutional comparators.

Question: How to extract 3D vascular structures from microscopy images?


Deep Generative Models with Learnable Knowledge Constraints. The broad set of deep generative models (DGMs) has achieved remarkable advances. However, it is often difficult to incorporate rich structured domain knowledge with the end-to-end DGMs. Posterior regularization (PR) offers a principled framework to impose structured constraints on probabilistic models, but has limited applicability to the diverse DGMs that can lack a Bayesian formulation or even explicit density evaluation. PR also requires constraints to be fully specified a priori, which is impractical or suboptimal for complex knowledge with learnable uncertain parts. In this paper, we establish mathematical correspondence between PR and reinforcement learning (RL), and, based on the connection, expand PR to learn constraints as the extrinsic reward in RL. The resulting algorithm is modelagnostic to apply to any DGMs, and is flexible to adapt arbitrary constraints with the model jointly. Experiments on human image generation and templated sentence generation show models with learned knowledge constraints by our algorithm greatly improve over base generative models.

Question: What is the mathematical correspondence between PR and RL?


An overview of substrate noise reduction techniques. This paper provides an overview of the recent circuit level and physical level substrate noise reduction techniques. Several of these techniques are compared for their advantages and disadvantages in "system-on-chip" applications.

Question: What is a substrate noise reduction technique?


Deep Generative Model using Unregularized Score for Anomaly Detection with Heterogeneous Complexity. Accurate and automated detection of anomalous samples in a natural image dataset can be accomplished with a probabilistic model for end-to-end modeling of images. Such images have heterogeneous complexity, however, and a probabilistic model overlooks simply shaped objects with small anomalies. This is because the probabilistic model assigns undesirably lower likelihoods to complexly shaped objects that are nevertheless consistent with set standards. To overcome this difficulty, we propose an unregularized score for deep generative models (DGMs), which are generative models leveraging deep neural networks. We found that the regularization terms of the DGMs considerably influence the anomaly score depending on the complexity of the samples. By removing these terms, we obtain an unregularized score, which we evaluated on a toy dataset and real-world manufacturing datasets. Empirical results demonstrate that the unregularized score is robust to the inherent complexity of samples and can be used to better detect anomalies.

Question: What is a toy dataset?


A New Iterative Secret Key Cryptosystem Based on Reversible and Irreversible Cellular Automata. Many cryptosystems have been released to secure electronic data on internet. Some data are very critical to be transmitted as plaintext. Thus, to ensure the data confidentiality and integrity, a list of cryptosystems have been elaborated. The most important ones are divided into two categories: symmetric algorithms encrypting and decrypting data in blocks using a single secret key; and asymmetric algorithms using public keys to cipher texts and secret keys to reconstruct plaintexts. The of the present work is the design and implement a new secret key cryptosystem encrypting and decrypting data in blocks according to a number of iterations. Each plaintext block is encrypted using cellular automata and a list of sub keys deduced from a secret key through cellular automata. To demonstrate the feasibility, the proposed scheme is compared with AES algorithm, the well-known symmetric block cipher. We prove that our algorithm resists against statistical attacks and it is faster than AES-256 achieving good confusion and diffusion tests.

Question: What is a cellular automata?


Adipose Hypertrophy Following Cryolipolysis.. Cryolipolysis has become a popular non-invasive treatment for unwanted fatty collections. The benefits are minimal down time, short recovery time, and decreased pain, although pain is the most frequent complaint. The author recently treated a patient who presented with an enlarging adipose collection on his lower abdomen following cryolipolysis with CoolSculpting(®) (ZELTIQ Aesthetics, Inc., Pleasanton, CA).

Question: What is the most common complaint following cryolipolysis?


OF A TUNABLE STIFFNESS COMPOSITE LEG FOR DYNAMIC LOCOMOTION. Passively compliant legs have been instrumental in the development of dynamically running legged robots. Having properly tuned leg springs is essential for stable, robust and energetically efficient running at high speeds. Recent simulation studies indicate that having variable stiffness legs, as animals do, can significantly improve the speed and stability of these robots in changing environmental conditions. However, to date, the mechanical complexities of designing usefully robust tunable passive compliance into legs has precluded their implementation on practical running robots. This paper describes a new design of a "structurally controlled variable stiffness" leg for a hexapedal running robot. This new leg improves on previous designs' performance and enables runtime modification of leg stiffness in a small, lightweight, and rugged package. Modeling and leg test experiments are presented that characterize the improvement in stiffness range, energy storage, and dynamic coupling properties of these legs. We conclude that this variable stiffness leg design is now ready for implementation and testing on a dynamical running robot.

Question: What is a dynamically running robot?


Geolocation and Assisted GPS. C urrently in development, numerous geolocation technologies can pinpoint a person's or ob-ject's position on the Earth. Knowledge of the spatial distribution of wireless callers will facilitate the planning, design, and operation of next-generation broadband wireless networks. Mobile users will gain the ability to get local traffic information and detailed directions to gas stations, restaurants, hotels, and other services. Police and rescue teams will be able to quickly and precisely locate people who are lost or injured but cannot give their precise location. Companies will use geolocation-based applications to track personnel, vehicles, and other assets. The driving force behind the development of this technology is a US Federal Communications Commission (FCC) mandate stating that by 1 October 2001 all wireless carriers must provide the geolocation of an emergency 911 caller to the appropriate public safety answering point (see http://www.fcc.gov/e911/). Location technologies requiring new, modified, or upgraded mobile stations must determine the caller's longitude and latitude within 50 meters for 67 percent of emergency calls, and within 150 meters for 95 percent of the calls. Otherwise, they must do so within 100 meters and 300 meters, respectively, for the same percentage of calls. Currently deployed wireless technology can locate 911 calls within an area no smaller than 10 to 15 square kilometers. An obvious way to satisfy the FCC requirement is to incorporate Global Positioning System (GPS) receivers into mobile phones. GPS consists of a constellation of 24 satellites, equally spaced in six orbital planes 20,200 kilometers above the Earth, that transmit two specially coded carrier signals: L1 frequency for civilian use, and L2 for military and government use. GPS receivers process the signals to compute position in 3D—latitude, longitude , and altitude—within a radius of 10 meters or better. Accuracy has increased substantiall

Question: What is the FCC mandate?


A Data Driven Approach for Algebraic Loop Invariants. We describe a new algorithm GUESS-AND-CHECK for computing algebraic equation invariants. These invariants are of the form ∧ifi(x1, . . . , xn) = 0, where each fi is a polynomial over the variables x1, . . . , xn of the program. Two novel features of our algorithm are:(1) it is data driven, that is, invariants are derived from data generated from concrete executions of the program, and (2) it is sound and complete, that is, the algorithm terminates with the correct invariant if it exists. The GUESS-AND-CHECK algorithm proceeds iteratively in two phases. The "guess" phase uses linear algebra techniques to efficiently derive a candidate invariant from data. This candidate invariant is subsequently validated in a "check" phase. If the check phase fails to validate the candidate invariant, then the proof of invalidity is used to generate more data and this is used to find better candidate invariants in a subsequent guess phase. Therefore, GUESS-AND-CHECK iteratively invokes the guess and check phases until it finds the desired invariant. In terms of implementation, off-the-shelf linear algebra solvers are used to implement the guess phase, and off-the-shelf decision procedures are used to implement the check phase. We have evaluated our technique on a number of benchmark programs from recent papers on invariant generation. Our results are encouraging – we are able to efficiently compute algebraic invariants in all cases.

Question: What is a data driven approach for algebraic loop invariants?


Combining Labeled and Unlabeled Data for MultiClass Text Categorization. Supervised learning techniques for text classi cation often require a large number of labeled examples to learn accurately. One way to reduce the amount of labeled data required is to develop algorithms that can learn e ectively from a small number of labeled examples augmented with a large number of unlabeled examples. Current text learning techniques for combining labeled and unlabeled, such as EM and Co-Training, are mostly applicable for classi cation tasks with a small number of classes and do not scale up well for large multiclass problems. In this paper, we develop a framework to incorporate unlabeled data in the Error-Correcting Output Coding (ECOC) setup by rst decomposing multiclass problems into multiple binary problems and then using Co-Training to learn the individual binary classi cation problems. We show that our method is especially useful for text classi cation tasks involving a large number of categories and outperforms other semi-supervised learning techniques such as EM and Co-Training. In addition to being highly accurate, this method utilizes the hamming distance from ECOC to provide high-precision results. We also present results with algorithms other than co-training in this framework and show that co-training is uniquely suited to work well within ECOC.

Question: How to combine labeled and unlabeled data for multi-class text categorization?


Semi-supervised On-Line Boosting for Robust Tracking. Recently, on-line adaptation of binary classifiers for tracking has been investigated. On-line learning allows for simple classifiers since only the current view of the object from its surrounding background needs to be discriminated. However, on-line adaptation faces one key problem: Each update of the tracker may introduce an error which, finally, can lead to tracking failure (drifting). The contribution of this paper is a novel on-line semi-supervised boosting method which significantly alleviates the drifting problem in tracking applications. This allows to limit the drifting problem while still staying adaptive to appearance changes. The main idea is to formulate the update process in a semi-supervised fashion as combined decision of a given prior and an on-line classifier. This comes without any parameter tuning. In the experiments, we demonstrate real-time tracking of our SemiBoost tracker on several challenging test sequences where our tracker outperforms other on-line tracking methods. Helmut Grabner1,2 Christian Leistner1 Horst Bischof1 1 Institute for Computer Graphics and Vision, Graz University of Technology, Austria 2 Computer Vision Laboratory, ETH-Zurich, Switzerland Motivation Robust Tracking Loop search Region actual object position create confidence map update classifier (tracker) evaluate classifier

Question: Semi-supervised On-Line Boosting for Robust Tracking


BlueSky: a cloud-backed file system for the enterprise. We present BlueSky, a network file system backed by cloud storage. BlueSky stores data persistently in a cloud storage provider such as Amazon S3 or Windows Azure, allowing users to take advantage of the reliability and large storage capacity of cloud providers and avoid the need for dedicated server hardware. Clients access the storage through a proxy running on-site, which caches data to provide lower-latency responses and additional opportunities for optimization. We describe some of the optimizations which are necessary to achieve good performance and low cost, including a log-structured design and a secure in-cloud log cleaner. BlueSky supports multiple protocols—both NFS and CIFS—and is portable to different providers.

Question: What is a file system?


An Integrated Microwave Imaging Radar With Planar Antennas for Breast Cancer Detection. The system design of an integrated microwave imaging radar for the diagnostic screening of breasts cancer is presented. A custom integrated circuit implemented in a 65-nm CMOS technology and a pair of patch antennas realized on a planar laminate are proposed as the basic module of the imaging antenna array. The radar operates on the broad frequency range from 2 to 16 GHz with a dynamic range of 107 dB. Imaging experiments carried out on a realistic breast phantom show that the system is capable of detecting tumor targets with a resolution of 3 mm.

Question: What is a realistic breast phantom?


Classical Statistics and Statistical Learning in Imaging Neuroscience. Brain-imaging research has predominantly generated insight by means of classical statistics, including regression-type analyses and null-hypothesis testing using t-test and ANOVA. Throughout recent years, statistical learning methods enjoy increasing popularity especially for applications in rich and complex data, including cross-validated out-of-sample prediction using pattern classification and sparsity-inducing regression. This concept paper discusses the implications of inferential justifications and algorithmic methodologies in common data analysis scenarios in neuroimaging. It is retraced how classical statistics and statistical learning originated from different historical contexts, build on different theoretical foundations, make different assumptions, and evaluate different outcome metrics to permit differently nuanced conclusions. The present considerations should help reduce current confusion between model-driven classical hypothesis testing and data-driven learning algorithms for investigating the brain with imaging techniques.

Question: What is the difference between classical statistics and statistical learning?


New reverse-conducting IGBT (1200V) with revolutionary compact package. Fuji Electric developed a 1200V class RC-IGBT based on our latest thin wafer process. The performance of this RC-IGBT shows the same relationship between conduction loss and switching loss as our 6th generation conventional IGBT and FWD. In addition its trade-off can be optimized for hard switching by lifetime killer. Calculations of the hard switching inverter loss and chip junction temperature (Tj) show that the optimized RC-IGBT can handle 35% larger current density per chip area. In order to utilize the high performance characteristics of the RC-IGBT, we assembled them in our newly developed compact package. This module can handle 58% higher current than conventional 100A modules at a 51% smaller footprint.

Question: What is the trade-off between conduction loss and switching loss?


Decision support for Cybersecurity risk planning. a r t i c l e i n f o Security countermeasures help ensure the confidentiality, availability, and integrity of information systems by preventing or mitigating asset losses from Cybersecurity attacks. Due to uncertainty, the financial impact of threats attacking assets is often difficult to measure quantitatively, and thus it is difficult to prescribe which countermeasures to employ. In this research, we describe a decision support system for calculating the uncertain risk faced by an organization under cyber attack as a function of uncertain threat rates, countermeasure costs, and impacts on its assets. The system uses a genetic algorithm to search for the best combination of countermeasures, allowing the user to determine the preferred tradeoff between the cost of the portfolio and resulting risk. Data collected from manufacturing firms provide an example of results under realistic input conditions. Assuring a secure information technology (IT) environment for the transaction of commerce is a major concern. The magnitude of the task is growing yearly, as attackers become more knowledgeable, more determined, and bolder in their efforts. According to a lead security expert at International Data Corporation, a global provider of market intelligence and advisory services for the IT community, " Emerging new attack vectors, more targeted campaigns, compliance, and the layering of new technologies on the corporate infrastructure are all factors having a tremendous impact on the overall risk to an organization " [21]. Given that corporate expenditures are usually a good indicator of the level of concern about an issue, security is obviously near the top of many IT executives' lists. According to IDC, the global market for providers of information security services is projected to exceed $32.5 billion in 2010 [21]. The New York Times recently noted that " the intrusion into Google's computers and related attacks from within

Question: What is the cost of cyber security?


A Dynamic Programming Algorithm for Computing N-gram Posteriors from Lattices. Efficient computation of n-gram posterior probabilities from lattices has applications in lattice-based minimum Bayes-risk decoding in statistical machine translation and the estimation of expected document frequencies from spoken corpora. In this paper, we present an algorithm for computing the posterior probabilities of all ngrams in a lattice and constructing a minimal deterministic weighted finite-state automaton associating each n-gram with its posterior for efficient storage and retrieval. Our algorithm builds upon the best known algorithm in literature for computing ngram posteriors from lattices and leverages the following observations to significantly improve the time and space requirements: i) the n-grams for which the posteriors will be computed typically comprises all n-grams in the lattice up to a certain length, ii) posterior is equivalent to expected count for an n-gram that do not repeat on any path, iii) there are efficient algorithms for computing n-gram expected counts from lattices. We present experimental results comparing our algorithm with the best known algorithm in literature as well as a baseline algorithm based on weighted finite-state automata operations.

Question: What is the best known algorithm for computing n-gram posteriors from lattices?


Facial reconstruction: soft tissue thickness values for South African black females.. In forensic science, investigators frequently have to deal with unidentified skeletonised remains. When conventional methods of identification are unsuccessful, forensic facial reconstruction (FFR) may be used, often as a last resort, to assist the process. FFR relies on the relationships between the facial features, subcutaneous soft tissues and underlying bony structure of the skull. The aim of this study was to develop soft tissue thickness (STT) values for South African black females for application to FFR, to compare these values to existing literature or databases and to add these values to existing population data. Computerised tomography scanning was used to determine average population-specific STT values at 28 facial landmarks of 154 black females. Descriptive statistics are provided for these STT values, which were also compared to those reported in three other comparable databases. Many of these STT values are significantly different from those reported for comparable groups, suggesting that individuals from different geographical areas have unique facial features thus requiring population-specific STT values. Repeatability tests indicated that most measurements could be recorded with a high degree of reliability.

Question: How many black females are there in South Africa?


Dynamic source routing in ad hoc wireless networks. An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host's wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

Question: What is dynamic source routing?


Creativity support for novice digital filmmaking. Machinima is a new form of creative digital filmmaking that leverages the real time graphics rendering of computer game engines. Because of the low barrier to entry, machinima has become a popular creative medium for hobbyists and novices while still retaining borrowed conventions from professional filmmaking. Can novice machinima creators benefit from creativity support tools? A preliminary study shows novices generally have difficulty adhering to cinematographic conventions. We identify and document four cinematic conventions novices typically violate. We report on a Wizard-of-Oz study showing a rule-based intelligent system that can reduce the frequency of errors that novices make by providing information about rule violations without prescribing solutions. We discuss the role of error reduction in creativity support tools.

Question: What is machinima?


Bayesian artificial intelligence for tackling uncertainty in self-adaptive systems: The case of dynamic decision networks. In recent years, there has been a growing interest towards the application of artificial intelligence approaches in software engineering (SE) processes. In the specific area of SE for self-adaptive systems (SASs) there is a growing research awareness about the synergy between SE and AI. However, just few significant results have been published. This paper briefly studies uncertainty in SASs and surveys techniques that have been developed to engineer SASs in order to tackle uncertainty. In particular, we highlight techniques that use AI concepts. We also report and discuss our own experience using Dynamic Decision Networks (DDNs) to model and support decision-making in SASs while explicitly taking into account uncertainty. We think that Bayesian inference, and specifically DDNs, provide a useful formalism to engineer systems that dynamically adapt themselves at runtime as more information about the environment and the execution context is discovered during execution. We also discuss partial results, challenges and future research avenues.

Question: What is the difference between a self-adaptive system and an adaptive system?


Communication-optimal parallel algorithm for strassen's matrix multiplication. Parallel matrix multiplication is one of the most studied fundamental problems in distributed and high performance computing. We obtain a new parallel algorithm that is based on Strassen's fast matrix multiplication and minimizes communication. The algorithm outperforms all known parallel matrix multiplication algorithms, classical and Strassen-based, both asymptotically and in practice. A critical bottleneck in parallelizing Strassen's algorithm is the communication between the processors. Ballard, Demmel, Holtz, and Schwartz (SPAA '11) prove lower bounds on these communication costs, using expansion properties of the underlying computation graph. Our algorithm matches these lower bounds, and so is communication-optimal. It exhibits perfect strong scaling within the maximum possible range.  Benchmarking our implementation on a Cray XT4, we obtain speedups over classical and Strassen-based algorithms ranging from 24% to 184% for a fixed matrix dimension n=94080, where the number of processors ranges from 49 to 7203.  Our parallelization approach generalizes to other fast matrix multiplication algorithms.

Question: What is the maximum possible range of speedups?


A High Efficiency Synchronous Buck VRM with Current Source Gate Driver. In this paper, a new current source gate drive circuit is proposed for high efficiency synchronous buck VRMs. The proposed circuit achieves quick turn-on and turn-off transition times to reduce switching loss and conduction loss in power MOSFETS. The driver circuit consists of two sets of four control switches and two very small inductors (typically 50 nH-300 nH each at 1 MHz). It drives both the control MOSFET and synchronous MOSFET in synchronous buck VRMs. An analysis, design procedure, optimization procedure and experimental results are presented for the proposed circuit. Experimental results demonstrate an efficiency of 86.6% at 15 A load and 81.9% at 30 A load for 12 V input and 1.3 V output at 1 MHz.

Question: What is a synchronous buck VRM?


Wheat glutenin subunits and dough elasticity: findings of the EUROWHEAT project. *IACR-Long Ashton Research Station, Department of Agricultural Sciences, University of Bristol, Long Ashton BS41 9AF, UK (tel: +1275-392181; fax: +1275-394299; e-mail: peter.shewry@bbsrc.ac.uk) {Institut National de la Recherche Agronomique, Centre de Recherches de Nantes, Laboratoire de BiochimieetdeTechnologiedesProtéines,B.P.71627, Ruede laGéraudière,Nantes 44316,Cedex03, France xDipartimento di Agrobiologia ed Agrochimica, Via San Camillo de Lellis, Viterbo 01100, Lazio, Italy {Institute of Food Research, Norwich Laboratory, Norwich Research Park, Colney Lane, Norwich NR4 7UA, UK

Question: What is the name of the institute?


A Guided Tour Puzzle for Denial of Service Prevention. Various cryptographic puzzle schemes are proposed as a defense mechanism against denial of service attack. But, all these puzzle schemes face a dilemma when there is a large disparity between the computational power of attackers and legitimate clients: increasing the difficulty of puzzles might unnecessarily restrict legitimate clients too much, and lower difficulty puzzles cannot sufficiently block attackers with large computational resources. In this paper, we introduce guided tour puzzle, a novel puzzle scheme that is not affected by such resource disparity. A guided tour puzzle requires a client to visit a predefined set of nodes, called tour guides, in a certain sequential order to retrieve an n piece answer, one piece from each tour guide that appears in the tour. This puzzle solving process is non-parallelizable, thus cheating by trying to solve the puzzle in parallel is not possible. Guided tour puzzle not only achieves all previously defined desired properties of a cryptographic puzzle scheme, but it also satisfies more important requirements, such as puzzle fairness and minimum interference, that we identified. The number of tour guides required by the scheme can be as few as two, and this extra cost can be amortized by sharing the same set of tour guides among multiple servers.

Question: What is a cryptographic puzzle scheme?


Analysing and improving the diagnosis of ischaemic heart disease with machine learning. Ischaemic heart disease is one of the world's most important causes of mortality, so improvements and rationalization of diagnostic procedures would be very useful. The four diagnostic levels consist of evaluation of signs and symptoms of the disease and ECG (electrocardiogram) at rest, sequential ECG testing during the controlled exercise, myocardial scintigraphy, and finally coronary angiography (which is considered to be the reference method). Machine learning methods may enable objective interpretation of all available results for the same patient and in this way may increase the diagnostic accuracy of each step. We conducted many experiments with various learning algorithms and achieved the performance level comparable to that of clinicians. We also extended the algorithms to deal with non-uniform misclassification costs in order to perform ROC analysis and control the trade-off between sensitivity and specificity. The ROC analysis shows significant improvements of sensitivity and specificity compared to the performance of the clinicians. We further compare the predictive power of standard tests with that of machine learning techniques and show that it can be significantly improved in this way.

Question: What is the difference between machine learning and artificial intelligence?


Sleep and autism spectrum disorders.. Sleep disorders are common in children with autism spectrum disorders and have a significant effect on daytime function and parental stress. The cornerstone of treatment is to establish the cause of the sleep concern, which is often multifactorial. Identifying and treating sleep disorders may result not only in more consolidated sleep, more rapid time to fall asleep, and avoidance of night waking but also favorably affect daytime behavior and parental stress. Targeting effective treatment strategies is dependent on understanding the underlying causes of sleep problems in children with Autism spectrum disorders, therefore further research is paramount.

Question: What is the cornerstone of treatment for sleep disorders in children with autism spectrum disorders?


Face Detection By Finding The Facial Features And The Angle of Inclination of Tilted Face. Face is a popular topic of research in computer vision, image analysis and understanding. This paper proposes a method to detect straight posed face as well as tilted face in colour images. Algorithm first detects skin colour region and then skin region is further processed by finding connected components and holes. Each connected components is tested to extract facial features and Y-value of each holes. If features exist in the connected component then the component is concluded as face. The Y-value of both eyes are compared to find whether the face is straight or tilted. For tilted face, the angle of tilt is determined and the input image is rotated by the angle of tilt to straighten up the face. After straightening the face, the rectangle is drawn to enclose the face. The dimension of drawn rectangle is obtained by using the distance parameter of the line between two eyes.

Question: How to detect face in an image?


Static hand gesture recognition using neural networks. This paper presents a novel technique for hand gesture recognition through human–computer interaction based on shape analysis. The main objective of this effort is to explore the utility of a neural network-based approach to the recognition of the hand gestures. A unique multi-layer perception of neural network is built for classification by using backpropagation learning algorithm. The goal of static hand gesture recognition is to classify the given hand gesture data represented by some features into some predefined finite number of gesture classes. The proposed system presents a recognition algorithm to recognize a set of six specific static hand gestures, namely: Open, Close, Cut, Paste, Maximize, and Minimize. The hand gesture image is passed through three stages, preprocessing, feature extraction, and classification. In preprocessing stage some operations are applied to extract the hand gesture from its background and prepare the hand gesture image for the feature extraction stage. In the first method, the hand contour is used as a feature which treats scaling and translation of problems (in some cases). The complex moment algorithm is, however, used to describe the hand gesture and treat the rotation problem in addition to the scaling and translation. The algorithm used in a multi-layer neural network classifier which uses back-propagation learning algorithm. The results show that the first method has a performance of 70.83% recognition, while the second method, proposed in this article, has a better performance of 86.38% recognition rate.

Question: What is the difference between the two methods?


Eavesdropping Attacks on High-Frequency RFID Tokens. RFID systems often use near-field magnetic coupling to implement communication channels. The advertised operational range of these channels is less than 10 cm and therefore several implemented systems assume that the communication channel is location limited and therefore relatively secure. Nevertheless, there have been repeated questions raised about the vulnerability of these near-field systems against eavesdropping and skimming attacks. In this paper I revisit the topic of RFID eavesdropping attacks, surveying previous work and explaining why the feasibility of practical attacks is still a relevant and novel research topic. I present a brief overview of the radio characteristics for popular HF RFID standards and present some practical results for eavesdropping experiments against tokens adhering to the ISO 14443 and ISO 15693 standards. Finally, I discuss how an attacker could construct a low-cost eavesdropping device using easy to obtain parts and reference designs.

Question: What is the operational range of RFID?


Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layers. Neural networks have great success in many machine learning applications, but the fundamental learning theory behind them remains largely unsolved. Learning neural networks is NP-hard, but in practice, simple algorithms like stochastic gradient descent (SGD) often produce good solutions. Moreover, it is observed that overparameterization (that is, designing networks whose number of parameters is larger than statistically needed to perfectly fit the data) improves both optimization and generalization, appearing to contradict traditional learning theory. In this work, we extend the theoretical understanding of two and three-layer neural networks in the overparameterized regime. We prove that, using overparameterized neural networks, one can (improperly) learn some notable hypothesis classes, including two and three-layer neural networks with fewer parameters. Moreover, the learning process can be simply done by SGD or its variants in polynomial time using polynomially many samples. We also show that for a fixed sample size, the generalization error of the solution found by some SGD variant can be made almost independent of the number of parameters in the overparameterized network. ∗V1 appears on this date and V2 polishes writing and tightens parameters. Authors sorted in alphabetical order.

Question: What is the difference between V1 and V2?


A Powered Leg Orthosis for Gait Rehabilitation of Motor-Impaired Patients. This paper describes a powered leg orthosis for gait rehabilitation of patients with walking disabilities. The paper proposes controllers which can apply suitable forces on the leg so that it moves on a desired trajectory. The description of the controllers, simulations and experimental results with the powered orthosis are presented in the paper. Currently, experiments have been performed with a dummy leg in the orthosis. In the coming months, this powered orthosis will be used on healthy subjects and stroke patients.

Question: What is a powered leg orthosis?


A Three-Step Vehicle Detection Framework for Range Estimation Using a Single Camera. This paper proposes and validates a real-time on-road vehicle detection system, which uses a single camera for the purpose of intelligent driver assistance. A three-step vehicle detection framework is presented to detect and track the target vehicle within an image. In the first step, probable vehicle locations are hypothesized using pattern recognition. The vehicle candidates are then verified in the hypothesis verification step. In this step, lane detection is used to filter vehicle candidates that are not within the lane region of interest. In the final step tracking and online learning are implemented to optimize the detection algorithm during misdetection and temporary occlusion. Good detection performance and accuracy was observed in highway driving environments with minimal shadows.

Question: What is a three-step vehicle detection framework?


Future Internet of Things: open issues and challenges. Internet of Things (IoT) and its relevant technologies have been attracting the attention of researchers from academia, industry, and government in recent years. However, since the requirements of the IoT are quite different from what the Internet today can offer, several innovative techniques have been gradually developed and incorporated into IoT, which is referred to as the Future Internet of Things (FIoT). Among them, how to extract ''data'' and transfer them into ''knowledge'' from sensing layer to application layer has become a vital issue. This paper begins with an overview of IoT and FIoT, followed by discussions on how to apply data mining and computational intelligence to FIoT. An intelligent data management framework inspired by swarm optimization will then given. Finally, open issues and future trends of this field

Question: What is the future of IoT?


Failure as a Service ( FaaS ) : A Cloud Service for Large-Scale , Online Failure Drills. Cloud computing is pervasive, but cloud service outages still take place. One might say that the computing forecast for tomorrow is "cloudy with a chance of failure." One main reason why major outages still occur is that there are many unknown large-scale failure scenarios in which recovery might fail. We propose a new type of cloud service, Failure as a Service (FaaS), which allows cloud services to routinely perform large-scale failure drills in real deployments.

Question: What is a cloud service?


Modeling and Mitigating Impact of False Data Injection Attacks on Automatic Generation Control. This paper studies the impact of false data injection (FDI) attacks on automatic generation control (AGC), a fundamental control system used in all power grids to maintain the grid frequency at a nominal value. Attacks on the sensor measurements for AGC can cause frequency excursion that triggers remedial actions, such as disconnecting customer loads or generators, leading to blackouts, and potentially costly equipment damage. We derive an attack impact model and analyze an optimal attack, consisting of a series of FDIs that minimizes the remaining time until the onset of disruptive remedial actions, leaving the shortest time for the grid to counteract. We show that, based on eavesdropped sensor data and a few feasible-to-obtain system constants, the attacker can learn the attack impact model and achieve the optimal attack in practice. This paper provides essential understanding on the limits of physical impact of the FDIs on power grids, and provides an analysis framework to guide the protection of sensor data links. For countermeasures, we develop efficient algorithms to detect the attack, estimate which sensor data links are under attack, and mitigate attack impact. Our analysis and algorithms are validated by experiments on a physical 16-bus power system test bed and extensive simulations based on a 37-bus power system model.

Question: What is the impact of false data injection attacks on automatic generation control?


Potassium and sodium transporters of Pseudomonas aeruginosa regulate virulence to barley. We investigated the role of three uncharacterized cation transporters of Pseudomonas aeruginosa PAO1 as virulence factors for barley: PA1207, PA5021, and PA2647. PAO1 displayed reduced barley virulence with inactivated PA1207, PA5021, and PA2647 as well as with one known Na+/H+ antiporter, PA1820. Using the Escherichia coli LB2003 mutant lacking three K+ uptake systems, the expression of the PA5021 gene repressed LB2003 growth with low K+, but the strain acquired tolerance to high K+. In contrast, the expression of the PA1207 gene enhanced growth of LB2003 with low K+ but repressed its growth with high K+; therefore, the PA5021 protein exports K+, while the PA1207 protein imports K+. The PA5021 mutant of P. aeruginosa also showed impaired growth at 400 mM KCl and at 400 mM NaCl; therefore, the PA5021 protein may also export Na+. The loss of the PA5021 protein also decreased production of the virulence factor pyocyanin; corroborating this result, pyocyanin production decreased in wild-type PAO1 under high salinity. Whole-genome transcriptome analysis showed that PAO1 induced more genes in barley upon infection compared to the PA5021 mutant. Additionally, PAO1 infection induced water stress-related genes in barley, which suggests that barley may undergo water deficit upon infection by this pathogen.

Question: What is the role of potassium and sodium transporters in Pseudomonas aeruginosa?


ECG-Cryptography and Authentication in Body Area Networks. Wireless body area networks (BANs) have drawn much attention from research community and industry in recent years. Multimedia healthcare services provided by BANs can be available to anyone, anywhere, and anytime seamlessly. A critical issue in BANs is how to preserve the integrity and privacy of a person's medical data over wireless environments in a resource efficient manner. This paper presents a novel key agreement scheme that allows neighboring nodes in BANs to share a common key generated by electrocardiogram (ECG) signals. The improved Jules Sudan (IJS) algorithm is proposed to set up the key agreement for the message authentication. The proposed ECG-IJS key agreement can secure data commnications over BANs in a plug-n-play manner without any key distribution overheads. Both the simulation and experimental results are presented, which demonstrate that the proposed ECG-IJS scheme can achieve better security performance in terms of serval performance metrics such as false acceptance rate (FAR) and false rejection rate (FRR) than other existing approaches. In addition, the power consumption analysis also shows that the proposed ECG-IJS scheme can achieve energy efficiency for BANs.

Question: What is the difference between the ECG-Cryptography and Authentication in Body Area Networks and the Jules Sudan algorithm?


Motivated Reinforcement Learning. The standard reinforcement learning view of the involvement of neuromodulatory systems in instrumental conditioning includes a rather straightforward conception of motivation as prediction of sum future reward. Competition between actions is based on the motivating characteristics of their consequent states in this sense. Substantial, careful, experiments reviewed in Dickinson & Balleine, 12,13 into the neurobiology and psychology of motivation shows that this view is incomplete. In many cases, animals are faced with the choice not between many different actions at a given state, but rather whether a single response is worth executing at all. Evidence suggests that the motivational process underlying this choice has different psychological and neural properties from that underlying action choice. We describe and model these motivational systems, and consider the way they interact.

Question: What is the difference between the standard reinforcement learning view of the involvement of neuromodulatory systems in instrumental conditioning and the view that motivation is based on the motivating characteristics of their consequent states?


Perceived aggressiveness predicts fighting performance in mixed-martial-arts fighters.. Accurate assessment of competitive ability is a critical component of contest behavior in animals, and it could be just as important in human competition, particularly in human ancestral populations. Here, we tested the role that facial perception plays in this assessment by investigating the association between both perceived aggressiveness and perceived fighting ability in fighters' faces and their actual fighting success. Perceived aggressiveness was positively associated with the proportion of fights won, after we controlled for the effect of weight, which also independently predicted perceived aggression. In contrast, perception of fighting ability was confounded by weight, and an association between perceived fighting ability and actual fighting success was restricted to heavyweight fighters. Shape regressions revealed that aggressive-looking faces are generally wider and have a broader chin, more prominent eyebrows, and a larger nose than less aggressive-looking faces. Our results indicate that perception of aggressiveness and fighting ability might cue different aspects of success in male-male physical confrontation.

Question: How do you predict the outcome of a fight?


Path-tracking of a tractor-trailer vehicle along rectilinear and circular paths: a Lyapunov-based approach. The problem of asymptotic stabilization for straight and circular forward/backward motions of a tractor-trailer system is addressed using Lyapunov techniques. Smooth, bounded, nonlinear control laws achieving asymptotic stability along the desired path are designed, and explicit bounds on the region of attraction are provided. The problem of asymptotic controllability with bounded control is also addressed.

Question: How to stabilize a tractor-trailer vehicle along a path?


Fraud : The Affinity of Classification Techniques to Insurance Fraud Detection. Quite a large number of data mining techniques employed in financial fraud detection (FFD) are seen to be classification techniques. In this paper, we developed an algorithm to find the features of classification techniques (or method) that so much place it (classification techniques) in the heart of researchers in their various efforts in the study of insurance frauds detection. We also got to know the characteristics of insurance frauds data that made data mining classification techniques so much attracted to it (insurance data).

Question: What is the difference between classification and clustering?


Electrocardiogram (ECG) Signal Processing. Signal processing today is performed in the vast majority of systems for ECG analysis and interpretation. The objective of ECG signal processing is manifold and comprises the improvement of measurement accuracy and reproducibility (when compared with manual measurements) and the extraction of information not readily available from the signal through visual assessment. In many situations, the ECG is recorded during ambulatory or strenuous conditions such that the signal is corrupted by different types of noise, sometimes originating from another physiological process of the body. Hence, noise reduction represents another important objective of ECG signal processing; in fact, the waveforms of interest are sometimes so heavily masked by noise that their presence can only be revealed once appropriate signal processing has first been applied. Electrocardiographic signals may be recorded on a long timescale (i.e., several days) for the purpose of identifying intermittently occurring disturbances in the heart rhythm. As a result, the produced ECG recording amounts to huge data sizes that quickly fill up available storage space. Transmission of signals across public telephone networks is another application in which large amounts of data are involved. For both situations, data compression is an essential operation and, consequently, represents yet another objective of ECG signal processing. Signal processing has contributed significantly to a new understanding of the ECG and its dynamic properties as expressed by changes in rhythm and beat morphology. For example, techniques have been developed that characterize oscillations related to the cardiovascular system and reflected by subtle variations in heart rate. The detection of low-level, alternating changes in T wave amplitude is another example of oscillatory behavior that has been established as an indicator of increased risk for sudden, life-threatening arrhythmias. Neither of t

Question: What is the objective of electrocardiogram signal processing?


Task constraints in visual working memory. This paper examines the nature of visual representations that direct ongoing performance in sensorimotor tasks. Performance of such natural tasks requires relating visual information from different gaze positions. To explore this we used the technique of making task relevant display changes during saccadic eye movements. Subjects copied a pattern of colored blocks on a computer monitor, using the mouse to drag the blocks across the screen. Eye position was monitored using a dual-purkinje eye tracker, and the color of blocks in the pattern was changed at different points in task performance. When the target of the saccade changed color during the saccade, the duration of fixations on the model pattern increased, depending on the point in the task that the change was made. Thus different fixations on the same visual stimulus served a different purpose. The results also indicated that the visual information that is retained across successive fixations depends on moment by moment task demands. This is consistent with previous suggestions that visual representations are limited and task dependent. Changes in blocks in addition to the saccade target led to greater increases in fixation duration. This indicated that some global aspect of the pattern was retained across different fixations. Fixation durations revealed effects of the display changes that were not revealed in perceptual report. This can be understood by distinguishing between processes that operate at different levels of description and different time scales. Our conscious experience of the world may reflect events over a longer time scale than those underlying the substructure of the perceptuo-motor machinery.

Question: What is the difference between a saccade and a fixation?


Behavioral activation and inhibition systems and the severity and course of depression.. Theorists have proposed that depression is associated with abnormalities in the behavioral activation (BAS) and behavioral inhibition (BIS) systems. In particular, depressed individuals are hypothesized to exhibit deficient BAS and overactive BIS functioning. Self-reported levels of BAS and BIS were examined in 62 depressed participants and 27 nondepressed controls. Clinical functioning was assessed at intake and at 8-month follow-up. Relative to nondepressed controls, depressed participants reported lower BAS levels and higher BIS levels. Within the depressed group, lower BAS levels were associated with greater concurrent depression severity and predicted worse 8-month outcome. Levels of both BIS and BAS showed considerable stability over time and clinical state. Overall, results suggest that BAS dysregulation exacerbates the presentation and course of depressive illness.

Question: What is the relationship between depression and behavioral inhibition?


Classification of basic footwork in fencing using accelerometer. Analysis and recognition of motion patterns from data acquired by body-worn inertial sensors is an emerging technology in sports. In this paper we propose an effective method for recognition of fencing footwork using a single body-worn accelerometer. We present a challenging dataset consisting of six actions, which were performed by ten persons and repeated ten times by each of them. We propose a segment-based SVM for time-series classification together with a set of informative features. We demonstrate that the method is competitive with 1-NN DTW in terms of classification accuracy. The proposed method achieves classification accuracy slightly better than 70% on the fencing footwork dataset.

Question: How to classify fencing footwork using accelerometer?