A Kalman Filter-Based Algorithm for IMU-Camera Calibration: Observability Analysis and Performance Evaluation. Vision-aided inertial navigation systems (V-INSs) can provide precise state estimates for the 3-D motion of a vehicle when no external references (e.g., GPS) are available. This is achieved by combining inertial measurements from an inertial measurement unit (IMU) with visual observations from a camera under the assumption that the rigid transformation between the two sensors is known. Errors in the IMU-camera extrinsic calibration process cause biases that reduce the estimation accuracy and can even lead to divergence of any estimator processing the measurements from both sensors. In this paper, we present an extended Kalman filter for precisely determining the unknown transformation between a camera and an IMU. Contrary to previous approaches, we explicitly account for the time correlation of the IMU measurements and provide a figure of merit (covariance) for the estimated transformation. The proposed method does not require any special hardware (such as spin table or 3-D laser scanner) except a calibration target. Furthermore, we employ the observability rank criterion based on Lie derivatives and prove that the nonlinear system describing the IMU-camera calibration process is observable. Simulation and experimental results are presented that validate the proposed method and quantify its accuracy.

Question: What is the observability rank criterion?


Using Patterns to Capture Architectural Decisions. Throughout the software design process, developers must make decisions and reify them in code. The decisions made during software architecting are particularly significant in that they have system-wide implications, especially on the quality attributes. However, architects often fail to adequately document their decisions because they don't appreciate the benefits, don't know how to document decisions, or don't recognize that they're making decisions. This lack of thorough documentation. This paper provides information about a decision's rationale and consequences, architecture patterns can help architects better understand and more easily record their decisions.

Question: What is a decision?


Distributional Reinforcement Learning With Quantile Regression. In reinforcement learning an agent interacts with the environment by taking actions and observing the next state and reward. When sampled probabilistically, these state transitions, rewards, and actions can all induce randomness in the observed long-term return. Traditionally, reinforcement learning algorithms average over this randomness to estimate the value function. In this paper, we build on recent work advocating a distributional approach to reinforcement learning in which the distribution over returns is modeled explicitly instead of only estimating the mean. That is, we examine methods of learning the value distribution instead of the value function. We give results that close a number of gaps between the theoretical and algorithmic results given by Bellemare, Dabney, and Munos (2017). First, we extend existing results to the approximate distribution setting. Second, we present a novel distributional reinforcement learning algorithm consistent with our theoretical formulation. Finally, we evaluate this new algorithm on the Atari 2600 games, observing that it significantly outperforms many of the recent improvements on DQN, including the related distributional algorithm C51.

Question: What is the distributional reinforcement learning?


A Review of Classic Edge Detectors. In this paper some of the classic alternatives for edge detection in digital images are studied. The main idea of edge detection algorithms is to find where abrupt changes in the intensity of an image have occurred. The first family of algorithms reviewed in this work uses the first derivative to find the changes of intensity, such as Sobel, Prewitt and Roberts. In the second reviewed family, second derivatives are used, for example in algorithms like Marr-Hildreth and Haralick. The obtained results are analyzed from a qualitative point of view (perceptual) and from a quantitative point of view (number of operations, execution time), considering different ways to convolve an image with a kernel (step required in some of the algorithms). Source Code For all the reviewed algorithms, an open source C implementation is provided which can be downloaded from the IPOL web page of this article1. An online demonstration is also available, where the user can test and reproduce our results.

Question: What is the open source implementation of edge detection algorithms?


Transductive Multi-view Embedding for Zero-Shot Recognition and Annotation. Most existing zero-shot learning approaches exploit transfer learning via an intermediate-level semantic representation such as visual attributes or semantic word vectors. Such a semantic representation is shared between an annotated auxiliary dataset and a target dataset with no annotation. A projection from a low-level feature space to the semantic space is learned from the auxiliary dataset and is applied without adaptation to the target dataset. In this paper we identify an inherent limitation with this approach. That is, due to having disjoint and potentially unrelated classes, the projection functions learned from the auxiliary dataset/domain are biased when applied directly to the target dataset/domain. We call this problem the projection domain shift problem and propose a novel framework, transductive multi-view embedding, to solve it. It is 'transductive' in that unlabelled target data points are explored for projection adaptation, and 'multi-view' in that both lowlevel feature (view) and multiple semantic representations (views) are embedded to rectify the projection shift. We demonstrate through extensive experiments that our framework (1) rectifies the projection shift between the auxiliary and target domains, (2) exploits the complementarity of multiple semantic representations, (3) achieves state-of-the-art recognition results on image and video benchmark datasets, and (4) enables novel cross-view annotation tasks.

Question: What is the canadian military?


Sherpa : Hyperparameter Optimization for Machine Learning Models. Sherpa is a free open-source hyperparameter optimization library for machine learning models. It is designed for problems with computationally expensive iterative function evaluations, such as the hyperparameter tuning of deep neural networks. With Sherpa, scientists can quickly optimize hyperparameters using a variety of powerful and interchangeable algorithms. Additionally, the framework makes it easy to implement custom algorithms. Sherpa can be run on either a single machine or a cluster via a grid scheduler with minimal configuration. Finally, an interactive dashboard enables users to view the progress of models as they are trained, cancel trials, and explore which hyperparameter combinations are working best. Sherpa empowers machine learning researchers by automating the tedious aspects of model tuning and providing an extensible framework for developing automated hyperparameter-tuning strategies. Its source code and documentation are available at https://github.com/LarsHH/sherpa and https://parameter-sherpa.readthedocs.io/, respectively. A demo can be found at https://youtu.be/L95sasMLgP4. 1 Existing Hyperparameter Optimization Libraries Hyperparameter optimization algorithms for machine learning models have previously been implemented in software packages such as Spearmint [15], HyperOpt [2], Auto-Weka 2.0 [9], and Google Vizier [5] among others. Spearmint is a Python library based on Bayesian optimization using a Gaussian process. Hyperparameter exploration values are specified using the markup language YAML and run on a grid via SGE and MongoDB. Overall, it combines Bayesian optimization with the ability for distributed training. HyperOpt is a hyperparameter optimization framework that uses MongoDB to allow parallel computation. The user manually starts workers which receive tasks from the HyperOpt instance. It offers the use of Random Search and Bayesian optimization based on a Tree of Parz

Question: What is a hyperparameter optimization library?


Imitation and Mechanisms of Joint Attention : A Developmental Structure for Building Social Skills on a Humanoid Robot. Adults are extremely adept at recognizing social cues, such as eye direction or pointing gestures, that establish the basis of joint attention. These skills serve as the developmental basis for more complex forms of metaphor and analogy by allowing an infant to ground shared experiences and by assisting in the development of more complex communication skills. In this chapter, we review some of the evidence for the developmental course of these joint attention skills from developmental psychology, from disorders of social development such as autism, and from the evolutionary development of these social skills. We also describe an on-going research program aimed at testing existing models of joint attention development by building a human-like robot which communicates naturally with humans using joint attention. Our group has constructed an upper-torso humanoid robot, called Cog, in part to investigate how to build intelligent robotic systems by following a developmental progression of skills similar to that observed in human development. Just as a child learns social skills and conventions through interactions with its parents, our robot will learn to interact with people using natural social communication. We further consider the critical role that imitation plays in bootstrapping a system from simple visual behaviors to more complex social skills. We will present data from a face and eye finding system that serves as the basis of this developmental chain, and an example of how this system can imitate the head movements of an individual.

Question: What is the developmental course of joint attention?


Javalanche: efficient mutation testing for Java. To assess the quality of a test suite, one can use mutation testing - seeding artificial defects (mutations) into the program and checking whether the test suite finds them. Javalanche is an open source framework for mutation testing Java programs with a special focus on automation, efficiency, and effectiveness. In particular, Javalanche assesses the impact of individual mutations to effectively weed out equivalent mutants; it has been demonstrated to work on programs with up to 100,000 lines of code.

Question: What is a mutation testing framework?


Value Locality and Load Value Prediction. Since the introduction of virtual memory demand-paging and cache memories, computer systems have been exploiting spatial and temporal locality to reduce the average latency of a memory reference. In this paper, we introduce the notion of value locality, a third facet of locality that is frequently present in real-world programs, and describe how to effectively capture and exploit it in order to perform load value prediction. Temporal and spatial locality are attributes of storage locations, and describe the future likelihood of references to those locations or their close neighbors. In a similar vein, value locality describes the likelihood of the recurrence of a previously-seen value within a storage location. Modern processors already exploit value locality in a very restricted sense through the use of control speculation (i.e. branch prediction), which seeks to predict the future value of a single condition bit based on previously-seen values. Our work extends this to predict entire 32- and 64-bit register values based on previously-seen values. We find that, just as condition bits are fairly predictable on a per-static-branch basis, full register values being loaded from memory are frequently predictable as well. Furthermore, we show that simple microarchitectural enhancements to two modern microprocessor implementations (based on the PowerPC 620 and Alpha 21164) that enable load value prediction can effectively exploit value locality to collapse true dependencies, reduce average memory latency and bandwidth requirements, and provide measurable performance gains.

Question: What is the average latency of a memory reference?


USim: a user behavior simulation framework for training and testing IDSes in GUI based systems. Anomaly detection systems largely depend on user profile data to be able to detect deviations from normal activity. Most of this profile data is currently based on command-line instructions/directives executed by users on a system. With the advent and extensive usage of graphical user interfaces (GUIs), command-line data can no longer fully represent user's complete behavior which is essential for effectively detecting the anomalies in these GUI based systems. Collection of user behavior data is a slow and time consuming process. In this paper, we present a new approach to automate the generation of user data by parameterizing user behavior in terms of user intention (malicious/normal), user skill level, set of applications installed on a machine, mouse movement and keyboard activity. The user behavior parameters are used to generate templates, which can be further customized. The framework is called USim which can achieve rapid generation of user behavior data based on these templates for GUI based systems. The data thus generated can be utilized for rapidly training and testing intrusion detection systems (IDSes) and improving their detection precision.

Question: What is a user behavior simulation framework?


You can't always get what you want: educational attainment, agency, and choice.. Using educational attainment to indicate socioeconomic status, the authors examined models of agency and effects of choice among European American adults of different educational backgrounds in 3 studies. Whereas college-educated (BA) participants and their preferred cultural products (i.e., rock music lyrics) emphasized expressing uniqueness, controlling environments, and influencing others, less educated (HS) participants and their preferred cultural products (i.e., country music lyrics) emphasized maintaining integrity, adjusting selves, and resisting influence. Reflecting these models of agency, HS and BA participants differently responded to choice in dissonance and reactance paradigms: BA participants liked chosen objects more than unchosen objects, but choice did not affect HS participants' preferences. Results suggest that HS and BA models of agency qualitatively differ, despite overlap between HS and BA worlds.

Question: How do you define agency?


Through the eyes of love: reality and illusion in intimate relationships.. This article reviews the research literature and theory concerned with accuracy of judgments in romantic relationships. We initially propose a model of cognition in (romantic) relationships that distinguishes between 2 forms of accuracy: mean-level bias and tracking accuracy. We then report the results of meta-analyses of research on heterosexual, romantic relationships, which used external benchmarks and reported levels of tracking accuracy (98 studies) and/or mean-level bias (48 studies). The results revealed robust overall effect sizes for both tracking accuracy (r = .47) and positive mean-level bias (r = .09). As expected, the effects were substantial and positive for tracking accuracy across 6 judgmental categories, whereas signed mean-level bias was negative for the interaction attributions (e.g., love, communication). The results showed, as expected, that these 2 forms of accuracy were independent-the 2 kinds of effect size derived from the same set of 38 studies were uncorrelated. As expected, gender, relationship length, and relationship evaluations moderated mean-level bias across studies but (unexpectedly) not for tracking accuracy. In the Discussion we evaluate the prior model in light of the findings, other research, moderating variables (such as self-esteem), the role of projection, the early stages of mate selection, metacognition, and the rationality and nature of motivated cognition. We conclude that our model, findings, and analyses help to resolve the apparent paradox that love is both riven with illusions and rooted in reality, and support both evolutionary and social psychological approaches to understanding cognition in romantic relationships.

Question: What is the difference between accuracy and bias?


The dynamics of innovation : from National Systems and ' ' Mode 2 ' ' to a Triple Helix of university – industry – government relations. The Triple Helix of university–industry–government relations is compared with alternative models for explaining the current research system in its social contexts. Communications and negotiations between institutional partners generate an overlay that increasingly reorganizes the underlying arrangements. The institutional layer can be considered as the retention mechanism of a developing system. For example, the national organization of the system of innovation has historically been important in determining competition. Reorganizations across industrial sectors and nation states, however, are induced by Ž . Ž . new technologies biotechnology, ICT . The consequent transformations can be analyzed in terms of neoevolutionary mechanisms. University research may function increasingly as a locus in the ''laboratory'' of such knowledge-intensive network transitions. q 2000 Elsevier Science B.V. All rights reserved.

Question: What is the dynamics of innovation?


VMHunt: A Verifiable Approach to Partially-Virtualized Binary Code Simplification. Code virtualization is a highly sophisticated obfuscation technique adopted by malware authors to stay under the radar. However, the increasing complexity of code virtualization also becomes a "double-edged sword" for practical application. Due to its performance limitations and compatibility problems, code virtualization is seldom used on an entire program. Rather, it is mainly used only to safeguard the key parts of code such as security checks and encryption keys. Many techniques have been proposed to reverse engineer the virtualized code, but they share some common limitations. They assume the scope of virtualized code is known in advance and mainly focus on the classic structure of code emulator. Also, few work verifies the correctness of their deobfuscation results. In this paper, with fewer assumptions on the type and scope of code virtualization, we present a verifiable method to address the challenge of partially-virtualized binary code simplification. Our key insight is that code virtualization is a kind of process-level virtual machine (VM), and the context switch patterns when entering and exiting the VM can be used to detect the VM boundaries. Based on the scope of VM boundary, we simplify the virtualized code. We first ignore all the instructions in a given virtualized snippet that do not affect the final result of that snippet. To better revert the data obfuscation effect that encodes a variable through bitwise operations, we then run a new symbolic execution called multiple granularity symbolic execution to further simplify the trace snippet. The generated concise symbolic formulas facilitate the correctness testing of our simplification results. We have implemented our idea as an open source tool, VMHunt, and evaluated it with real-world applications and malware. The encouraging experimental results demonstrate that VMHunt is a significant improvement over the state o

Question: What is a verifiable approach to partially-virtualized binary code simplification?


It's worth the hassle!: the added value of evaluating the usability of mobile systems in the field. The distinction between field and laboratory is classical in research methodology. In human-computer interaction, and in usability evaluation in particular, it has been a controversial topic for several years. The advent of mobile devices has revived this topic. Empirical studies that compare evaluations in the two settings are beginning to appear, but they provide very different results. This paper presents results from an experimental comparison of a field-based and a lab-based usability evaluation of a mobile system. The two evaluations were conducted in exactly the same way. The conclusion is that it is definitely worth the hassle to conduct usability evaluations in the field. In the field-based evaluation we identified significantly more usability problems and this setting revealed problems with interaction style and cognitive load that were not identified in the laboratory.

Question: What is the difference between field and lab usability evaluation?


Chapter 3 Recent Developments in Auxiliary Particle Filtering. State space models (SSMs; sometimes termed hidden Markov models, particularly in the discrete case) are very popular statistical models for time series. Such models describe the trajectory of some system of interest as an unobserved E-valued Markov chain, known as the signal process. Let X1 ∼ ν and Xn|(Xn−1 = xn−1) ∼ f(·|xn−1) denote this process. Indirect observations are available via an observation process, {Yn}n∈N. Conditional upon Xn, Yn is independent of the remainder of the observation and signal processes, with Yn|(Xn = xn) ∼ g(·|xn). For any sequence {zn}n∈N, we write zi:j = (zi, zi+1, ..., zj). In numerous applications, we are interested in estimating, recursively in time, an analytically intractable sequence of posterior distributions {p (x1:n| y1:n)}n∈N, of the form:

Question: What is the difference between a state space model and a hidden Markov model?


Web-based 3D Reconstruction Service. The use of 3D information in the field of cultural heritage is increasing year by year. From this field comes a large demand for cheaper and more flexible ways of 3D reconstruction. This paper describes a web-based 3D reconstruction service, developed to relieve those needs of the cultural heritage field. This service consists of a pipeline that starts with the user uploading images of an object or scene(s) he wants to reconstruct in 3D. The automatic reconstruction process, running on a server connected to a cluster of computers, computes the camera calibration, as well as dense depth (or range-) maps for the images. This result can be downloaded from an ftp server and visualized with a specific tool running on the user's PC.

Question: What is a web-based 3D reconstruction service?


Microscopy cell segmentation via adversarial neural networks. We present a novel method for cell segmentation in microscopy images which is inspired by the Generative Adversarial Neural Network (GAN) approach. Our framework is built on a pair of two competitive artificial neural networks, with a unique architecture, termed Rib Cage, which are trained simultaneously and together define a min-max game resulting in an accurate segmentation of a given image. Our approach has two main strengths, similar to the GAN, the method does not require a formulation of a loss function for the optimization process. This allows training on a limited amount of annotated data in a weakly supervised manner. Promising segmentation results on real fluorescent microscopy data are presented. The code is freely available at: https://github.com/arbellea/DeepCellSeg.git

Question: What is a min-max game?


Generating narrative variation in interactive fiction. GENERATING NARRATIVE VARIATION IN INTERACTIVE FICTION Nick Montfort Mitchell P. Marcus and Gerald Prince A general method for the generation of natural language narrative is described. It allows the expression, or narrative discourse, to vary independently of the underlying events and existents that are the narrative's content. Specifically, this variation is accomplished in an interactive fiction (IF) system which replies to typed input by narrating what has happened in a simulated world. IF works have existed for about 30 years as forms of text-based computer simulation, instances of dialog systems, and examples of literary art. Theorists of narrative have carefully distinguished between the level of underlying content (corresponding to the simulated world in interactive fiction) and that of expression (corresponding to the textual exchange between computer arnd user) since the mid-1960s, when the field of narratology began to develop, but IF systems have not yet made use of this distinction. The current project contributes new techniques for automatic narration by building on work done in computational linguistics, specifically natural language generation, and in narratology. First, types of narrative variation that are possible in IF are identified and formalized in a way that is suitable for a natural language generation system. An architecture for an IF system is then described and implemented; the result allows multiple works of interactive fiction to be realized and, using a general plan for narrating, allows them to be narrated in different ways during interaction. The system's ability to generate text is considered in a pilot evaluation. Plans for future work are also discussed. They include publicly released systems for IF development and narratology education, adding a planning capability that uses actors' individual perspectives, and adapting automatic narration to different sorts of interactive sys

Question: How do you generate narrative variation in interactive fiction?


Arrays in Blitz++. Numeric arrays in Blitz++ rival the eeciency of Fortran, but without any extensions to the C++ language. Blitz++ has features unavailable in Fortran 90/95, such as arbitrary transpose operations, array renaming, tensor notation, partial reductions, multicomponent arrays and stencil operators. The library handles parsing and analysis of array expressions on its own using the expression templates technique, and performs optimizations (such as loop transformations) which have until now been the responsibility of compilers.

Question: What is the size of the array?


The American Economic Review VOLUME XLV MARCH , 1955 NUMBER ONE ECONOMIC GROWTH AND INCOME INEQUALITY.

Question: What is the american economic review?


A Theory and Tools for Applying Sandboxes Effectively. It is more expensive and time consuming to build modern software without extensive supply chains. Supply chains decrease these development risks, but typically at the cost of increased security risk. In particular, it is often difficult to understand or verify what a software component delivered by a third party does or could do. Such a component could contain unwanted behaviors, vulnerabilities, or malicious code, many of which become incorporated in applications utilizing the component. Sandboxes provide relief by encapsulating a component and imposing a security policy on it. This limits the operations the component can perform without as much need to trust or verify the component. Instead, a component user must trust or verify the relatively simple sandbox. Given this appealing prospect, researchers have spent the last few decades developing new sandboxing techniques and sandboxes. However, while sandboxes have been adopted in practice, they are not as pervasive as they could be. Why are sandboxes not achieving ubiquity at the same rate as extensive supply chains? This thesis advances our understanding of and overcomes some barriers to sandbox adoption. We systematically analyze ten years (2004 – 2014) of sandboxing research from top-tier security and systems conferences. We uncover two barriers: (1) sandboxes are often validated using relatively subjective techniques and (2) usability for sandbox deployers is often ignored by the studied community. We then focus on the Java sandbox to empirically study its use within the open source community. We find features in the sandbox that benign applications do not use, which have promoted a thriving exploit landscape. We develop run time monitors for the Java Virtual Machine (JVM) to turn off these features, stopping all known sandbox escaping JVM exploits without breaking benign applications. Furthermore, we find that the sandbox contains a high degree of complexi

Question: What is the difference between a sandbox and a virtual machine?


A new classification of lip zones to customize injectable lip augmentation.. OBJECTIVES To present a new classification of 15 anatomical lip zones used to direct placement of injectable fillers during lip augmentation and to evaluate the new classification's ability to customize lip contour and size.   METHODS Study participants were consecutive patients presenting to a facial plastic and reconstructive surgery practice for injectable lip augmentation with a nonanimal-sourced stabilized hyaluronic acid (Restylane; Medicis Aesthetic Inc, Scottsdale, Arizona). A nonrandomized, prospective case series.   RESULTS A total of 137 treatments were performed on lips of 66 patients. The mean (SD) satisfaction score was 4.5 (0.6) on an integral scale of 1 (dissatisfied) to 5 (most satisfied). The mean (SD) persistence until lips returned to preoperative appearance based on patient subjective evaluation was 4.9 (1.5) months. Patients were free of adverse effects.   CONCLUSIONS Using a new classification of lip anatomical zones to direct the injection of a nonanimal-sourced stabilized hyaluronic acid has increased my ability to better control lip shape and size in lip augmentation. This technique was met with high patient satisfaction and no adverse effects. Persistence of injected nonanimal-sourced stabilized hyaluronic acid was similar to that seen in other studies.

Question: What is the difference between a lip zone and a lip line?


Taslihan Virtual Reconstruction - Interactive Digital Story or a Serious Game. During the Ottoman period, Taslihan was the largest accommodation complex in Sarajevo, Bosnia and Herzegovina. Today, only one wall remains as a memento of its existence. In this paper, we compare user appreciation of an interactive digital story about this building and of a serious game about Taslihan to see which application offers more knowledge and immersion while bringing this monument to life in the collective memory of the people.

Question: What is the largest accommodation complex in Sarajevo?


An Analysis of Transformations. In the analysis of data it is often assumed that observations y,, y,, ...,y, are independently normally distributed with constant variance and with expectations specified by a model linear in a set of parameters 0. In this paper we make the less restrictive assumption that such a normal, homoscedastic, linear model is appropriate after some suitable transformation has been applied to the y's. Inferences about the transformation and about the parameters of the linear model are made by computing the likelihood function and the relevant posterior distribution. The contributions of normality, homoscedasticity and additivity to the transformation are separated. The relation of the present methods to earlier procedures for finding transformations is discussed. The methods are illustrated with examples.

Question: What is the difference between a transformation and a transformation?


Geotagging Named Entities in News and Online Documents. News sources generate constant streams of text with many references to real world entities; understanding the content from such sources often requires effectively detecting the geographic foci of the entities. We study the problem of associating geography to named entities in online documents. More specifically, given a named entity and a page (or a set of pages) where the entity is mentioned, the problem being studied is how the geographic focus of the name can be resolved at a location granularity (e.g. city or country), assuming that the name has a geographic focus. We further study dispersion, and show that the dispersion of a name can be estimated with a good accuracy, allowing a geo-centre to be detected at an exact dispersion level. Two key features of our approach are: (i) minimal assumption is made on the structure of the mentions hence the approach can be applied to a diverse and heterogeneous set of web pages, and (ii) the approach is unsupervised, leveraging shallow English linguistic features and the large volume of location data in public domain.  We evaluate our methods under different task settings and with different categories of named entities. Our evaluation reveals that the geo-centre of a name can be estimated with a good accuracy based on some simple statistics of the mentions, and that the accuracy of the estimation varies with the categories of the names.

Question: What is the canadian military?


Multi-channel ECG classification using forests of randomized shapelet trees. Data series of multiple channels occur at high rates and in massive quantities in several application domains, such as healthcare. In this paper, we study the problem of multi-channel ECG classification. We map this problem to multivariate data series classification and propose five methods for solving it, using a split-and-combine approach. The proposed framework is evaluated using three base-classifiers on real-world data for detecting Myocardial Infarction. Extensive experiments are performed on real ECG data extracted from the Physiobank data repository. Our findings emphasize the importance of selecting an appropriate base-classifier for multivariate data series classification, while demonstrating the superiority of the Random Shapelet Forest (0.825 accuracy) against competitor methods (0.664 accuracy for 1-NN under cDTW).

Question: What is the best classifier for multi-channel ECG classification?


A Unified Theory of Underreaction , Momentum Trading , and Overreaction in Asset Markets. We model a market populated by two groups of boundedly rational agents: "newswatchers" and "momentum traders." Each newswatcher observes some private information, but fails to extract other newswatchers' information from prices. If information diffuses gradually across the population, prices underreact in the short run. The underreaction means that the momentum traders can profit by trendchasing. However, if they can only implement simple ~i.e., univariate! strategies, their attempts at arbitrage must inevitably lead to overreaction at long horizons. In addition to providing a unified account of underand overreactions, the model generates several other distinctive implications. OVER THE LAST SEVERAL YEARS, a large volume of empirical work has documented a variety of ways in which asset returns can be predicted based on publicly available information. Although different studies have used a host of different predictive variables, many of the results can be thought of as belonging to one of two broad categories of phenomena. On the one hand, returns appear to exhibit continuation, or momentum, in the short to medium run. On the other hand, there is also a tendency toward reversals, or fundamental reversion, in the long run.1 It is becoming increasingly clear that traditional asset-pricing models— such as the capital asset pricing model ~CAPM! of Sharpe ~1964! and Lintner ~1965!, Ross's ~1976! arbitrage pricing theory ~APT!, or Merton's ~1973! intertemporal capital asset pricing model ~ICAPM!—have a hard time explaining the growing set of stylized facts. In the context of these models, all of the predictable patterns in asset returns, at both short and long horizons, must ultimately be traced to differences in loadings on economically meaningful risk factors. And there is little affirmative evidence at this point to suggest that this can be done. * Stanford Business School and MIT

Question: What is the difference between the CAPM and APT?


Facial Expression Recognition with Convolutional Neural Networks. Facial expression recognition systems have attracted much research interest within the field of artificial intelligence. Many established facial expression recognition (FER) systems apply standard machine learning to extracted image features, and these methods generalize poorly to previously unseen data. This project builds upon recent research to classify images of human faces into discrete emotion categories using convolutional neural networks (CNNs). We experimented with different architectures and methods such as fractional max-pooling and finetuning, ultimately achieving an accuracy of 0.48 in a sevenclass classification task.

Question: What is the accuracy of facial expression recognition?


Beyond Power Calculations: Assessing Type S (Sign) and Type M (Magnitude) Errors.. Statistical power analysis provides the conventional approach to assess error rates when designing a research study. However, power analysis is flawed in that a narrow emphasis on statistical significance is placed as the primary focus of study design. In noisy, small-sample settings, statistically significant results can often be misleading. To help researchers address this problem in the context of their own studies, we recommend design calculations in which (a) the probability of an estimate being in the wrong direction (Type S [sign] error) and (b) the factor by which the magnitude of an effect might be overestimated (Type M [magnitude] error or exaggeration ratio) are estimated. We illustrate with examples from recent published research and discuss the largest challenge in a design calculation: coming up with reasonable estimates of plausible effect sizes based on external information.

Question: What is the largest challenge in a design calculation?


A 3.4 W Digital-In Class-D Audio Amplifier in 0.14 $\mu $m CMOS. In this paper a class-D audio amplifier for mobile applications is presented realized in a 0.14 μm CMOS technology tailored for mobile applications. The amplifier has a simple PDM-based digital interface for audio and control that requires only two pins and enables assembly in 9-bump WL-CSP. The complete audio path is discussed that consists of a Parser, Digital PWM controller, 1-bit DA-converters, analog feedback loop and the Class-D power stage. A reconfigurable gate driver is used that reduces quiescent current consumption and radiated emission.

Question: What is a class-D amplifier?


Analytic Performance Modeling and Optimization of Live VM Migration. Earlier virtual machine (VM) migration techniques consisted of stop-and-copy: the VM was stopped, its address space was copied to a different physical machine, and the VM was restarted at that machine. Recent VM hypervisors support live VM migration, which allows pages to be copied while the VM is running. If any copied page is dirtied (i.e., modified), it has to be copied again. The process stops when a fraction α of the pages need to be copied. Then, the VM is stopped and the remaining pages are copied. This paper derives a model to compute the downtime, total number of pages copied, and network utilization due to VM migration, as a function of α and other parameters under uniform and non-uniform dirtying rates. The paper also presents a non-linear optimization model to find the value of α that minimizes the downtime subject to network utilization constraints.

Question: What is the downtime of live VM migration?


Binary Rewriting of an Operating System Kernel ∗. This paper deals with some of the issues that arise in the context of binary rewriting and instrumentation of an operatin g system kernel. OS kernels are very different from ordinary application code in many ways, e.g., they contain a significant amount of hand-written assembly code. Binary rewriting is an attractive approach for processing OS kernel code for several reasons, e.g., it provides a uniform way to handl e heterogeneity in code due to a combination of source code, assembly code and legacy code such as in device drivers. However, because of the many differences between ordinary application code and OS kernel code, binary rewriting techniques that work for application code do not always carry over directly to kernel code. This paper describes some of the issues that arise in this context, and the approaches we have taken to address them. A key goal when developing our system was to deal in a systematic manner with the various peculiarities seen in low-level systems code, and reason about the safety and correctness of code transformation s, without requiring significant deviations from the regular d evelopmental path. For example, a precondition we assumed was that no compiler or linker modifications should be required to use it and the tool should be able to process kernel binaries in the same way as it does ordinary applications.

Question: What is the difference between binary rewriting and binary instrumentation?


SciPlore Xtract: Extracting Titles from Scientific PDF Documents by Analyzing Style Information (Font Size). Extracting titles from a PDF's full text is an important task in information retrieval to identify PDFs. Existing approaches apply complicated and expensive (in terms of calculating power) machine learning algorithms such as Support Vector Machines and Conditional Random Fields. In this paper we present a simple rule based heuristic, which considers style information (font size) to identify a PDF's title. In a first experiment we show that this heuristic delivers better results (77.9% accuracy) than a support vector machine by CiteSeer (69.4% accuracy) in an 'academic search engine' scenario and better run times (8:19 minutes vs. 57:26 minutes).

Question: How to extract titles from scientific pdf documents?


Performance evaluation of synchronous rectification in front-end full-bridge rectifiers. In this paper, performance evaluation of synchronous rectification in front-end full-bridge rectifiers is presented. Specifically, the implementation of the full-bridge rectifier with the two diode rectifiers connected to the negative output terminal replaced by two synchronous rectifiers (SRs) and the implementation with all four diode rectifiers replaced by four SRs are considered. In both implementations, the SRs are N-channel MOSFETs controlled by sensing the line voltage. Two methods of line-voltage sensing are presented. First, direct line-voltage sensing, and second, indirect line-voltage sensing, i.e., sensing the line voltage between an input terminal and the negative output terminal. The proposed implementations also include a protection method of preventing accidental short circuit between the input or output terminals. In addition, SR power-management methods such as turning off the SRs at light loads and at no load are provided. The protection of SRs at large inrush currents is also discussed. Experimental results obtained on a 90-W (19.5-V/4.6-A) laptop adapter for the universal line voltage range (90-264 Vrms) are given. In the experimental circuit with four SRs, the efficiency improvement at 90-Vrms line voltage and full load is 1.31%.

Question: How to protect the SRs from large inrush currents?


The exact bound in the Erdös - Ko - Rado theorem.

Question: What is the exact bound in the Erdös - Ko - Rado theorem?


Autoencoding beyond pixels using a learned similarity metric. We present an autoencoder that leverages learned representations to better measure similarities in data space. By combining a variational autoencoder with a generative adversarial network we can use learned feature representations in the GAN discriminator as basis for the VAE reconstruction objective. Thereby, we replace element-wise errors with feature-wise errors to better capture the data distribution while offering invariance towards e.g. translation. We apply our method to images of faces and show that it outperforms VAEs with element-wise similarity measures in terms of visual fidelity. Moreover, we show that the method learns an embedding in which high-level abstract visual features (e.g. wearing glasses) can be modified using simple arithmetic.

Question: How to measure similarity in data space?


Optimized Spatial Hashing for Collision Detection of Deformable Objects. We propose a new approach to collision and self– collision detection of dynamically deforming objects that consist of tetrahedrons. Tetrahedral meshes are commonly used to represent volumetric deformable models and the presented algorithm is integrated in a physically–based environment, which can be used in game engines and surgical simulators. The proposed algorithm employs a hash function for compressing a potentially infinite regular spatial grid. Although the hash function does not always provide a unique mapping of grid cells, it can be generated very efficiently and does not require complex data structures, such as octrees or BSPs. We have investigated and optimized the parameters of the collision detection algorithm, such as hash function, hash table size and spatial cell size. The algorithm can detect collisions and self– collisions in environments of up to 20k tetrahedrons in real–time. Although the algorithm works with tetrahedral meshes, it can be easily adapted to other object primitives, such as triangles. Figure 1: Environment with dynamically deforming objects, that consist of tetrahedrons.

Question: How to detect collisions and self–collisions of dynamically deforming objects?


A Review on the ESD Robustness of Drain-Extended MOS Devices. This paper reviews electrostatic discharge (ESD) investigations on laterally diffused MOS (LDMOS) and drain-extended MOS (DeMOS) devices. The limits of the safe operating area of LDMOS/DeMOS devices and device physics under ESD stress are discussed under various biasing conditions and layout schemes. Specifically, the root cause of early filament formation is highlighted. Differences in filamentary nature among various LDMOS/DeMOS devices are shown. Based on the physical understanding, device optimization guidelines are given. Finally, an outlook on technology scaling is presented.

Question: What is the root cause of early filament formation?


Exploring compassion: a meta-analysis of the association between self-compassion and psychopathology.. Compassion has emerged as an important construct in studies of mental health and psychological therapy. Although an increasing number of studies have explored relationships between compassion and different facets of psychopathology there has as yet been no systematic review or synthesis of the empirical literature. We conducted a systematic search of the literature on compassion and mental health. We identified 20 samples from 14 eligible studies. All studies used the Neff Self Compassion Scale (Neff, 2003b). We employed meta-analysis to explore associations between self-compassion and psychopathology using random effects analyses of Fisher's Z correcting for attenuation arising from scale reliability. We found a large effect size for the relationship between compassion and psychopathology of r=-0.54 (95% CI=-0.57 to -0.51; Z=-34.02; p<.0001). Heterogeneity was significant in the analysis. There was no evidence of significant publication bias. Compassion is an important explanatory variable in understanding mental health and resilience. Future work is needed to develop the evidence base for compassion in psychopathology, and explore correlates of compassion and psychopathology.

Question: What is the relationship between self-compassion and psychopathology?


Deconstructing the Ladder Network Architecture. The manual labeling of data is and will remain a costly endeavor. For this reason, semi-supervised learning remains a topic of practical importance. The recently proposed Ladder Network is one such approach that has proven to be very successful. In addition to the supervised objective, the Ladder Network also adds an unsupervised objective corresponding to the reconstruction costs of a stack of denoising autoencoders. Although the empirical results are impressive, the Ladder Network has many components intertwined, whose contributions are not obvious in such a complex architecture. In order to help elucidate and disentangle the different ingredients in the Ladder Network recipe, this paper presents an extensive experimental investigation of variants of the Ladder Network in which we replace or remove individual components to gain more insight into their relative importance. We find that all of the components are necessary for achieving optimal performance, but they do not contribute equally. For semi-supervised tasks, we conclude that the most important contribution is made by the lateral connection, followed by the application of noise, and finally the choice of what we refer to as the 'combinator function' in the decoder path. We also find that as the number of labeled training examples increases, the lateral connections and reconstruction criterion become less important, with most of the improvement in generalization being due to the injection of noise in each layer. Furthermore, we present a new type of combinator function that outperforms the original design in both fullyand semi-supervised tasks, reducing record test error rates on Permutation-Invariant MNIST to 0.57% for the supervised setting, and to 0.97% and 1.0% for semisupervised settings with 1000 and 100 labeled examples respectively.

Question: What is the ladder network?


Question: What is an efficient algorithm?


A large-scale evaluation of automatic pulmonary nodule detection in chest CT using local image features and k-nearest-neighbour classification. A scheme for the automatic detection of nodules in thoracic computed tomography scans is presented and extensively evaluated. The algorithm uses the local image features of shape index and curvedness in order to detect candidate structures in the lung volume and applies two successive k-nearest-neighbour classifiers in the reduction of false-positives. The nodule detection system is trained and tested on three databases extracted from a large-scale experimental screening study. The databases are constructed in order to evaluate the algorithm on both randomly chosen screening data as well as data containing higher proportions of nodules requiring follow-up. The system results are extensively evaluated including performance measurements on specific nodule types and sizes within the databases and on lesions which later proved to be malignant. In a random selection of 813 scans from the screening study a sensitivity of 80% with an average 4.2 false-positives per scan is achieved. The detection results presented are a realistic measure of a CAD system performance in a low-dose screening study which includes a diverse array of nodules of many varying sizes, types and textures.

Question: What is a CAD system?


Fast and robust Earth Mover's Distances. We present a new algorithm for a robust family of Earth Mover's Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that the number of edges is reduced by an order of magnitude. As a result, we compute the EMD by an order of magnitude faster than the original algorithm, which makes it possible to compute the EMD on large histograms and databases. In addition, we show that EMDs with thresholded ground distances have many desirable properties. First, they correspond to the way humans perceive distances. Second, they are robust to outlier noise and quantization effects. Third, they are metrics. Finally, experimental results on image retrieval show that thresholding the ground distance of the EMD improves both accuracy and speed.

Question: What is the earth mover's distance?


Expression Profiling of Developing Zebrafish Retinal Cells.. During retinal development, a variety of different types of neurons are produced. Understanding how each of these types of retinal nerve cells is generated is important from a developmental biology perspective. It is equally important if one is interested in how to regenerate cells after an injury or a disease. To gain more insight into how retinal neurons develop in the zebrafish, we performed single-cell mRNA profiling and in situ hybridizations (ISHs) on retinal sections and whole-mount zebrafish. Through the series of ISHs, designed and performed solely by undergraduate students in the laboratory, we were able to retrospectively identify our single-cell mRNA profiles as most likely coming from developing amacrine cells. Further analysis of these profiles will reveal genes that can be mutated using genome editing techniques. Together these studies increase our knowledge of the genes driving development of different cell types in the zebrafish retina.

Question: What is the difference between a zebrafish and a human?


Automation of Attendances in Classrooms using RFID. This paper automates the design and implementation of students' attendance management system, taken into consideration easy access and time saving. The system will be used in faculty of computing and information system (FCIT) at King Abdulaziz University (KAU). Radio Frequency Identification (RFID) and wireless technology are two technologies which will be applied as infrastructure in the indoor environment. University Based Services (UBS) and tag IDs of the RFID are being used in this paper, in order to determine the attendance list for academic staff. Once the academic staff enters a classroom, he will be able to register student's presence. Therefore, an academic system for identifying and tracking attendance at computing college at KAU will be described, and hybrid RFID and Wireless LAN (WLAN) technologies will be implemented in FCIT academic environment.

Question: What is the attendance management system?


Deep Speech: Scaling up end-to-end speech recognition. We present a state-of-the-art speech recognition system developed using end-toend deep learning. Our architecture is significantly simpler than traditional speech systems, which rely on laboriously engineered processing pipelines; these traditional systems also tend to perform poorly when used in noisy environments. In contrast, our system does not need hand-designed components to model background noise, reverberation, or speaker variation, but instead directly learns a function that is robust to such effects. We do not need a phoneme dictionary, nor even the concept of a "phoneme." Key to our approach is a well-optimized RNN training system that uses multiple GPUs, as well as a set of novel data synthesis techniques that allow us to efficiently obtain a large amount of varied data for training. Our system, called Deep Speech, outperforms previously published results on the widely studied Switchboard Hub5'00, achieving 16.0% error on the full test set. Deep Speech also handles challenging noisy environments better than widely used, state-of-the-art commercial speech systems.

Question: How does deep speech work?


Access control in the Internet of Things: Big challenges and new opportunities.

Question: What is the Internet of Things?


Channel estimation in millimeter wave MIMO systems with one-bit quantization. We develop channel estimation agorithms for millimeter wave (mmWave) multiple input multiple output (MIMO) systems with one-bit analog-to-digital converters (ADCs). Since the mmWave MIMO channel is sparse due to the propagation characteristics, the estimation problem is formulated as a one-bit compressed sensing problem. We propose a modified EM algorithm that exploits sparsity and has better performance than the conventional EM algorithm. We also present a second solution using the generalized approximate message passing (GAMP) algorithm to solve this optimization problem. The simulation results show that GAMP can reduce mean squared error in the important low and medium SNR regions.

Question: How to estimate a sparse channel?


Low-rank matrix factorization for Deep Neural Network training with high-dimensional output targets. While Deep Neural Networks (DNNs) have achieved tremendous success for large vocabulary continuous speech recognition (LVCSR) tasks, training of these networks is slow. One reason is that DNNs are trained with a large number of training parameters (i.e., 10-50 million). Because networks are trained with a large number of output targets to achieve good performance, the majority of these parameters are in the final weight layer. In this paper, we propose a low-rank matrix factorization of the final weight layer. We apply this low-rank technique to DNNs for both acoustic modeling and language modeling. We show on three different LVCSR tasks ranging between 50-400 hrs, that a low-rank factorization reduces the number of parameters of the network by 30-50%. This results in roughly an equivalent reduction in training time, without a significant loss in final recognition accuracy, compared to a full-rank representation.

Question: How to train a deep neural network for speech recognition?


Discoverer: Automatic Protocol Reverse Engineering from Network Traces. Application-level protocol specifications are useful for many security applications, including intrusion prevention and detection that performs deep packet inspection and traffic normalization, and penetration testing that generates network inputs to an application to uncover potential vulnerabilities. However, current practice in deriving protocol specifications is mostly manual. In this paper, we present Discoverer, a tool for automatically reverse engineering the protocol message formats of an application from its network trace. A key property of Discoverer is that it operates in a protocol-independent fashion by inferring protocol idioms commonly seen in message formats of many application-level protocols. We evaluated the efficacy of Discoverer over one text protocol (HTTP) and two binary protocols (RPC and CIFS/SMB) by comparing our inferred formats with true formats obtained from Ethereal [5]. For all three protocols, more than 90% of our inferred formats correspond to exactly one true format; one true format is reflected in five inferred formats on average; our inferred formats cover over 95% of messages, which belong to 30-40% of true formats observed in the trace.

Question: What is the difference between a protocol and a protocol idiom?


Exploring Social-Historical Ties on Location-Based Social Networks. Location-based social networks (LBSNs) have become a popular form of social media in recent years. They provide location related services that allow users to "check-in" at geographical locations and share such experiences with their friends. Millions of "check-in" records in LBSNs contain rich information of social and geographical context and provide a unique opportunity for researchers to study user's social behavior from a spatial-temporal aspect, which in turn enables a variety of services including place advertisement, traffic forecasting, and disaster relief. In this paper, we propose a social-historical model to explore user's check-in behavior on LBSNs. Our model integrates the social and historical effects and assesses the role of social correlation in user's check-in behavior. In particular, our model captures the property of user's check-in history in forms of power-law distribution and short-term effect, and helps in explaining user's check-in behavior. The experimental results on a real world LBSN demonstrate that our approach properly models user's checkins and shows how social and historical ties can help location prediction.

Question: What is a social-historical model?


Introducing Expected Returns into Risk Parity Portfolios : A New Framework for Tactical and Strategic Asset Allocation. Risk parity is an allocation method used to build diversified portfolios that does not rely on any assumptions of expected returns, thus placing risk management at the heart of the strategy. This explains why risk parity became a popular investment model after the global financial crisis in 2008. However, risk parity has also been criticized because it focuses on managing risk concentration rather than portfolio performance, and is therefore seen as being closer to passive management than active management. In this article, we show how to introduce assumptions of expected returns into risk parity portfolios. To do this, we consider a generalized risk measure that takes into account both the portfolio return and volatility. However, the trade-off between performance and volatility contributions creates some difficulty, while the risk budgeting problem must be clearly defined. After deriving the theoretical properties of such risk budgeting portfolios, we apply this new model to asset allocation. First, we consider long-term investment policy and the determination of strategic asset allocation. We then consider dynamic allocation and show how to build risk parity funds that depend on expected returns.

Question: How to introduce expected returns into risk parity portfolios?


Active Learning for Real Time Detection of Polyps in Videocolonoscopy. HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Active Learning For Real Time Detection Of Polyps In Videocolonoscopy Quentin Angermann, Aymeric Histace, Olivier Romain

Question: What is the name of the archive?


Analyzing Stability in Wide-Area Network Performance. The Internet is a very large scale, complex, dynamical system that is hard to model and analyze. In this paper, we develop and analyze statistical models for the observed end-to-end network performance based on extensive packet-level traces (consisting of approximately 1.5 billion packets) collected from the primary Web site for the Atlanta Summer Olympic Games in 1996. We find that observed mean throughputs for these transfers measured over 60 million complete connections vary widely as a function of end-host location and time of day, confirming that the Internet is characterized by a large degree of heterogeneity. Despite this heterogeneity, we find (using best-fit linear regression techniques) that we can express the throughput for Web transfers to most hosts as a random variable with a log-normal distribution. Then, using observed throughput as the control parameter, we attempt to quantify the spatial (statistical similarity across neighboring hosts) and temporal (persistence over time) stability of network performance. We find that Internet hosts that are close to each other often have almost identically distributed probability distributions of throughput. We also find that throughputs to individual hosts often do not change appreciably for several minutes. Overall, these results indicate that there is promise in protocol mechanisms that cache and share network characteristics both within a single host and amongst nearby hosts.

Question: What is the mean throughput for web transfers?


Chameleon: Hierarchical Clustering Using Dynamic Modeling. 68 Computer C lustering is a discovery process in data mining. 1 It groups a set of data in a way that maximizes the similarity within clusters and minimizes the similarity between two different clusters. 1,2 These discovered clusters can help explain the characteristics of the underlying data distribution and serve as the foundation for other data mining and analysis techniques. Clustering is useful in characterizing customer groups based on purchasing patterns, categorizing Web documents, 3 grouping genes and proteins that have similar func-tionality, 4 grouping spatial locations prone to earthquakes based on seismological data, and so on. Most existing clustering algorithms find clusters that fit some static model. Although effective in some cases, these algorithms can break down—that is, cluster the data incorrectly—if the user doesn't select appropriate static-model parameters. Or sometimes the model cannot adequately capture the clusters' characteristics. Most of these algorithms break down when the data contains clusters of diverse shapes, densities , and sizes. Existing algorithms use a static model of the clusters and do not use information about the nature of individual clusters as they are merged. Furthermore, one set of schemes (the CURE algorithm and related schemes) ignores the information about the aggregate interconnectivity of items in two clusters. The other set of schemes (the Rock algorithm, group averaging method, and related schemes) ignores information about the closeness of two clusters as defined by the similarity of the closest items across two clusters. (For more information, see the " Limitations of Traditional Clustering Algorithms " sidebar.) By only considering either interconnectivity or close-ness, these algorithms can easily select and merge the wrong pair of clusters. For instance, an algorithm that focuses only on the closeness of two clusters will incorrectly merge the cl

Question: What is the difference between hierarchical clustering and k-means clustering?


Supervised Topic Models. We introduce supervised latent Dirichlet allocation (sLDA), a statistical model of labelled documents. The model accommodates a variety of response types. We derive a maximum-likelihood procedure for parameter estimation, which relies on variational approximations to handle intractable posterior expectations. Prediction problems motivate this research: we use the fitted model to predict response values for new documents. We test sLDA on two real-world problems: movie ratings predicted from reviews, and web page popularity predicted from text descriptions. We illustrate the benefits of sLDA versus modern regularized regression, as well as versus an unsupervised LDA analysis followed by a separate regression.

Question: What is a supervised topic model?


Secure and anonymous decentralized Bitcoin mixing. The decentralized digital currency Bitcoin presents an anonymous alternative to the centralized banking system and indeed enjoys widespread and increasing adoption. Recent works, however, show how users can be reidentified and their payments linked based on Bitcoin's most central element, the blockchain, a public ledger of all transactions. Thus, many regard Bitcoin's central promise of financial privacy as broken. In this paper, we propose CoinParty, an efficient decentralized mixing service that allows users to reestablish their financial privacy in Bitcoin and related cryptocurrencies. CoinParty, through a novel combination of decryption mixnets with threshold signatures, takes a unique place in the design space of mixing services, combining the advantages of previously proposed centralized and decentralized mixing services in one system. Our prototype implementation of CoinParty scales to large numbers of users and achieves anonymity sets by orders of magnitude higher than related work as we quantify by analyzing transactions in the actual Bitcoin blockchain. CoinParty can easily be deployed by any individual group of users, i.e., independent of any third parties, or provided as a commercial or voluntary service, e.g., as a community service by privacy-aware organizations.

Question: How can I mix my bitcoins?


Inferring tumor progression from genomic heterogeneity.. Cancer progression in humans is difficult to infer because we do not routinely sample patients at multiple stages of their disease. However, heterogeneous breast tumors provide a unique opportunity to study human tumor progression because they still contain evidence of early and intermediate subpopulations in the form of the phylogenetic relationships. We have developed a method we call Sector-Ploidy-Profiling (SPP) to study the clonal composition of breast tumors. SPP involves macro-dissecting tumors, flow-sorting genomic subpopulations by DNA content, and profiling genomes using comparative genomic hybridization (CGH). Breast carcinomas display two classes of genomic structural variation: (1) monogenomic and (2) polygenomic. Monogenomic tumors appear to contain a single major clonal subpopulation with a highly stable chromosome structure. Polygenomic tumors contain multiple clonal tumor subpopulations, which may occupy the same sectors, or separate anatomic locations. In polygenomic tumors, we show that heterogeneity can be ascribed to a few clonal subpopulations, rather than a series of gradual intermediates. By comparing multiple subpopulations from different anatomic locations, we have inferred pathways of cancer progression and the organization of tumor growth.

Question: How do we infer tumor progression from genomic heterogeneity?


Information quality benchmarks: product and service performance. Information quality (IQ) is an inexact science in terms of assessment and benchmarks. Although various aspects of quality and information have been investigated [1, 4, 6, 7, 9, 12], there is still a critical need for a methodology that assesses how well organizations develop information products and deliver information services to consumers. Benchmarks developed from such a methodology can help compare information quality across organizations, and provide a baseline for assessing IQ improvements.

Question: What is the need for a methodology that assesses how well organizations develop information products and deliver information services to consumers?


Design patterns: elements of reuseable object-oriented software. Factory (87) Provide an interface for creating families of related or dependent objects without specifying their concrete classes. Adapter (139) Convert the interface of a class into another interface clients expect. Adapter lets classes work together that couldn't otherwise because of incompatible interfaces. Bridge (151) Decouple an abstraction from its implementation so that the two can vary independently. Builder (97) Separate the construction of a complex object from its representation so that the same construction process can create different representations. Chain of Responsibility (223) Avoid coupling the sender of a request to its receiver by giving more than one object a chance to handle the request. Chain the receiving objects and pass the request along the chain until an object handles it. Command (233) Encapsulate a request as an object, thereby letting you parameterize clients with different requests, queue or log requests, and support undoable operations. Composite (163) Compose objects into tree structures to represent part-whole hierarchies. Composite lets clients treat individual objects and compositions of objects uniformly. Decorator (175) Attach additional responsibilities to an object dynamically. Decorators provide a flexible alternative to subclassing for extending functionality. Facade (185) Provide a unified interface to a set of interfaces in a subsystem. Facade defines a higher-level interface that makes the subsystem easier to use. Factory Method (107) Define an interface for creating an object, but let subclasses decide which class to instantiate. Factory Method lets a class defer instantiation to subclasses. Flyweight (195) Use sharing to support large numbers of fine-grained objects efficiently. Interpreter (243) Given a language, define a represention for its grammar along with an interpreter that uses the representation to interpret sentences in the language. Iterator

Question: What is a facade?


Un-Crafting: De-Constructive Engagements with Interactive Artifacts. Crafting interactive artifacts is typically associated with synthesizing, making, constructing, putting things together. In this paper, we discuss how these activities can be contrasted with de-synthesizing activities that revolve around decomposition, dissection, and taking things apart. Based on framings that emphasize how related practices are valuable in engineering processes, we aim to unlock the potential of de-constructive engagements with interactive technologies as a material driven (design) practice. We propose un-crafting as a framework of four modes of taking interactive artifacts apart (i.e., un-crafting for material exposition, material inspiration, material inquiry, and material exploration) aiming to pinpoint de-constructive episodes inherent to design processes, as well as to encourage the refinement of respective techniques and methods.

Question: What is the difference between crafting and un-crafting?


Why Do Those With Long-Term Substance Use Disorders Stop Abusing Substances? A Qualitative Study. Although a significant proportion of adults recover from substance use disorders (SUDs), little is known about how they reach this turning point or why they stop using. The purpose of the study was to explore the factors that influence reasoning and decision making about quitting substance use after a long-term SUD. Semistructured interviews were conducted with 18 participants, each of whom had been diagnosed with a SUD and had been abstinent for at least 5 years. A resource group of peer consultants in long-term recovery from SUDs contributed to the study's planning, preparation, and initial analyses. Participants recalled harmful consequences and significant events during their years of substance use. Pressure and concern from close family members were important in their initial efforts to abstain from substance use. Being able to imagine a different life, and the awareness of existing treatment options, promoted hope and further reinforced their motivation to quit. Greater focus on why those with SUDs want to quit may help direct treatment matching; treatment completion may be more likely if the person's reasons for seeking help are addressed.

Question: What are the factors that influence reasoning and decision making about quitting substance use after a long-term SUD?


Crafting Adversarial Examples For Speech Paralinguistics Applications. Computational paralinguistic analysis is increasingly being used in a wide range of applications, including securitysensitive applications such as speaker verification, deceptive speech detection, and medical diagnostics. While state-ofthe-art machine learning techniques, such as deep neural networks, can provide robust and accurate speech analysis, they are susceptible to adversarial attacks. In this work, we propose a novel end-to-end scheme to generate adversarial examples by perturbing directly the raw waveform of an audio recording rather than specific acoustic features. Our experiments show that the proposed adversarial perturbation can lead to a significant performance drop of state-of-the-art deep neural networks, while only minimally impairing the audio quality.

Question: How to generate adversarial examples for speech paralinguistics applications?


Concept Based Query Expansion. Query expansion methods have been studied for a long time - with debatable success in many instances. In this paper we present a probabilistic query expansion model based on a similarity thesaurus which was constructed automatically. A similarity thesaurus reflects domain knowledge about the particular collection from which it is constructed. We address the two important issues with query expansion: the selection and the weighting of additional search terms. In contrast to earlier methods, our queries are expanded by adding those terms that are most similar to the concept of the query, rather than selecting terms that are similar to the query terms. Our experiments show that this kind of query expansion results in a notable improvement in the retrieval effectiveness when measured using both recall-precision and usefulness.

Question: What is the concept based query expansion?


Motion tracking and gait feature estimation for recognising Parkinson's disease using MS Kinect.. BACKGROUND Analysis of gait features provides important information during the treatment of neurological disorders, including Parkinson's disease. It is also used to observe the effects of medication and rehabilitation. The methodology presented in this paper enables the detection of selected gait attributes by Microsoft (MS) Kinect image and depth sensors to track movements in three-dimensional space.   METHODS The experimental part of the paper is devoted to the study of three sets of individuals: 18 patients with Parkinson's disease, 18 healthy aged-matched individuals, and 15 students. The methodological part of the paper includes the use of digital signal-processing methods for rejecting gross data-acquisition errors, segmenting video frames, and extracting gait features. The proposed algorithm describes methods for estimating the leg length, normalised average stride length (SL), and gait velocity (GV) of the individuals in the given sets using MS Kinect data.   RESULTS The main objective of this work involves the recognition of selected gait disorders in both the clinical and everyday settings. The results obtained include an evaluation of leg lengths, with a mean difference of 0.004 m in the complete set of 51 individuals studied, and of the gait features of patients with Parkinson's disease (SL: 0.38 m, GV: 0.61 m/s) and an age-matched reference set (SL: 0.54 m, GV: 0.81 m/s). Combining both features allowed for the use of neural networks to classify and evaluate the selectivity, specificity, and accuracy. The achieved accuracy was 97.2 %, which suggests the potential use of MS Kinect image and depth sensors for these applications.   CONCLUSIONS Discussion points include the possibility of using the MS Kinect sensors as inexpensive replacements for complex multi-camera systems and treadmill walking in gait-feature detection for the recognition of selected gait

Question: What is the difference between gait and walking?


Fine-Grained Visual Comparisons with Local Learning. Given two images, we want to predict which exhibits a particular visual attribute more than the other-even when the two images are quite similar. Existing relative attribute methods rely on global ranking functions; yet rarely will the visual cues relevant to a comparison be constant for all data, nor will humans' perception of the attribute necessarily permit a global ordering. To address these issues, we propose a local learning approach for fine-grained visual comparisons. Given a novel pair of images, we learn a local ranking model on the fly, using only analogous training comparisons. We show how to identify these analogous pairs using learned metrics. With results on three challenging datasets-including a large newly curated dataset for fine-grained comparisons-our method outperforms stateof-the-art methods for relative attribute prediction.

Question: What is a fine-grained visual comparison?


Sequence of central nervous system myelination in human infancy. II. Patterns of myelination in autopsied infants.. The timing and synchronization of postnatal myelination in the human central nervous system (CNS) are complex. We found eight time-related patterns of CNS myelination during the first two postnatal years in autopsied infants. The intensity of myelination was graded in 162 infants with diverse diseases on an ordinal scale of degrees 0-4. The Ayer method for maximum likelihood estimates for censored data was utilized to generate curves of the temporal changes in the percent of infants with degrees 0 through 4 of myelin in 62 white matter sites. These sites fall into eight subgroups determined by the presence or absence of microscopic myelin (degree 1) at birth and the median age at which mature myelin (degree 3) is reached. There is variability in the timing of myelination within and across axonal systems, and early onset of myelination is not always followed by early myelin maturation. We reexamined general rules governing the timing of myelination proposed by previous investigators, and found that those rules are neither complete nor inviolate, and that there is a complex interplay among them. This study specifies distinct periods of maturation in which myelinating pathways are potentially vulnerable to insult during the first two postnatal years.

Question: What is the timing of myelination in the human central nervous system?


Improvasher: A Real-Time Mashup System for Live Musical Input. In this paper we present Improvasher a real-time musical accompaniment system which creates an automatic mashup to accompany live musical input. Improvasher is built around two music processing modules, the first, a performance following technique, makes beat-synchronous predictions of chroma features from a live musical input. The second, a music mashup system, determines the compatibility between beat-synchronous chromagrams from different pieces of music. Through the combination of these two techniques, a real-time predictive mashup can be generated towards a new form of automatic accompaniment for interactive musical performance.

Question: What is a real-time mashup?


A Novel Multi-Stack Device Structure and its Analysis for High Power CMOS Switch Design. A novel multi-stack CMOS device structure is proposed, the operation of the structure is fully analyzed for high power CMOS switch design. The structure is also implemented in a standard 0.18-um triple-well CMOS process, and its performance is fully characterized. The proposed switch device incorporates multi-stack NMOS switches, one of which has a switch at the bulk and the others of which have a connection between the bulk and the source in order to provide high power handling capability to the transmit switch side. In order to demonstrate the improvement of power handling capability, performance of the conventional structure and the proposed structure are fully analyzed, compared from various simulation results, and verified with measurement results in detail. Experimental data show that the isolation of the proposed test structure is 25 dB higher at 30 dBm input power level than that of conventional structures, which was caused by the significant reduction of leakage current of the switch device in OFF state. In addition, insertion loss of the Rx switch can be maintained as 1.5 dB by applying body switching technique in 900 MHz.

Question: What is the novel multi-stack CMOS device structure?


ERMIA: Fast Memory-Optimized Database System for Heterogeneous Workloads. Large main memories and massively parallel processors have triggered not only a resurgence of high-performance transaction processing systems optimized for large main-memory and massively parallel processors, but also an increasing demand for processing heterogeneous workloads that include read-mostly transactions. Many modern transaction processing systems adopt a lightweight optimistic concurrency control (OCC) scheme to leverage its low overhead in low contention workloads. However, we observe that the lightweight OCC is not suitable for heterogeneous workloads, causing significant starvation of read-mostly transactions and overall performance degradation.  In this paper, we present ERMIA, a memory-optimized database system built from scratch to cater the need of handling heterogeneous workloads. ERMIA adopts snapshot isolation concurrency control to coordinate heterogeneous transactions and provides serializability when desired. Its physical layer supports the concurrency control schemes in a scalable way. Experimental results show that ERMIA delivers comparable or superior performance and near-linear scalability in a variety of workloads, compared to a recent lightweight OCC-based system. At the same time, ERMIA maintains high throughput on read-mostly transactions when the performance of the OCC-based system drops by orders of magnitude.

Question: What is the name of the database system?


Unsupervised Anomaly Detection in Network Intrusion Detection Using Clusters. Most current network intrusion detection systems employ signature-based methods or data mining-based methods which rely on labelled training data. This training data is typically expensive to produce. Moreover, these methods have difficulty in detecting new types of attack. Using unsupervised anomaly detection techniques, however, the system can be trained with unlabelled data and is capable of detecting previously "unseen" attacks. In this paper, we present a new density-based and grid-based clustering algorithm that is suitable for unsupervised anomaly detection. We evaluated our methods using the 1999 KDD Cup data set. Our evaluation shows that the accuracy of our approach is close to that of existing techniques reported in the literature, and has several advantages in terms of computational complexity.

Question: What is the 1999 KDD Cup data set?


What's basic about basic emotions?. A widespread assumption in theories of emotion is that there exists a small set of basic emotions. From a biological perspective, this idea is manifested in the belief that there might be neurophysiological and anatomical substrates corresponding to the basic emotions. From a psychological perspective, basic emotions are often held to be the primitive building blocks of other, nonbasic emotions. The content of such claims is examined, and the results suggest that there is no coherent nontrivial notion of basic emotions as the elementary psychological primitives in terms of which other emotions can be explained. Thus, the view that there exist basic emotions out of which all other emotions are built, and in terms of which they can be explained, is questioned, raising the possibility that this position is an article of faith rather than an empirically or theoretically defensible basis for the conduct of emotion research. This suggests that perhaps the notion of basic emotions will not lead to significant progress in the field. An alternative approach to explaining the phenomena that appear to motivate the postulation of basic emotions is presented.

Question: What is basic about basic emotions?


Shifting the MIMO Paradigm. Multi-user MIMO (MU-MIMO) networks reveal the unique opportunities arising from a joint optimization of antenna combining techniques with resource allocation protocols. Furthermore, it brings robustness with respect to multipath richness, allowing for compact antenna spacing at the BS and, crucially, yielding the diversity and multiplexing gains without the need for multiple antenna user terminals. To realize these gains, however, the BS should be informed with the user's channel coefficients, which may limit practical application to TDD or low-mobility settings. To circumvent this problem and reduce feedback load, combining MU-MIMO with opportunistic scheduling seems a promising direction. The success for this type of scheduler is strongly traffic and QoS-dependent, however.

Question: What is the difference between TDD and FDD?


A Framework for Multiple-Instance Learning. Multiple-instance learning is a variation on supervised learning, where the task is to learn a concept given positive and negative bags of instances. Each bag may contain many instances, but a bag is labeled positive even if only one of the instances in it falls within the concept. A bag is labeled negative only if all the instances in it are negative. We describe a new general framework, called Diverse Density, for solving multiple-instance learning problems. We apply this framework to learn a simple description of a person from a series of images (bags) containing that person, to a stock selection problem, and to the drug activity prediction problem.

Question: What is a bag of instances?


The synchronous data flow programming language LUSTRE. This paper describes the language LUSTRE which is a data flow synchronous language, designed for programming reactive systems-uch as automatic control and monitoring sy s t emsas well as for describing hardware. The data flow aspect of LUSTRE makes it very close to usual description tools in these domains (blockdiagrams, networks of operators, dynamical sample-systems, etc.), and its synchronous interpretation makes it well suited for handling time in programs. Moreover, this synchronous interpretation allows it to be compiled into an efficient sequential program. Finally, the LUSTRE formalism is very similar to temporal logics. This allows the language to be used for both writing programs and expressing program properties, which results in an original program verification methodology.

Question: What is the LUSTRE language?


A Pose-Invariant Descriptor for Human Detection and Segmentation. We present a learning-based, sliding window-style approach for the problem of detecting humans in still images. Instead of traditional concatenation-style image location-based feature encoding, a global descriptor more invariant to pose variation is introduced. Specifically, we propose a principled approach to learning and classifying human/non-human image patterns by simultaneously segmenting human shapes and poses, and extracting articulation-insensitive features. The shapes and poses are segmented by an efficient, probabilistic hierarchical part-template matching algorithm, and the features are collected in the context of poses by tracing around the estimated shape boundaries. Histograms of oriented gradients are used as a source of low-level features from which our pose-invariant descriptors are computed, and kernel SVMs are adopted as the test classifiers. We evaluate our detection and segmentation approach on two public pedestrian datasets.

Question: How to detect humans in still images?


Toward a Maturity Model Development Process for Information Systems ( MMDePSI ). Maturity models are significant tools to ensure continuous improvement of systems and activities. They allow selfassessment and provide a means benchmark of these activities in relation to best practices. This article proposes the MMDePSI process for the development of new models of maturity in information systems. It begins by presenting the existing methods and approaches. Then he describes the MMDePSI process and the corresponding meta-model. Before concluding and presenting prospects of this work, it evaluates the proposed process.

Question: What is a maturity model?


Deep Learning Approaches to Semantic Relevance Modeling for Chinese Question-Answer Pairs. The human-generated question-answer pairs in the Web social communities are of great value for the research of automatic question-answering technique. Due to the large amount of noise information involved in such corpora, it is still a problem to detect the answers even though the questions are exactly located. Quantifying the semantic relevance between questions and their candidate answers is essential to answer detection in social media corpora. Since both the questions and their answers usually contain a small number of sentences, the relevance modeling methods have to overcome the problem of word feature sparsity. In this article, the deep learning principle is introduced to address the semantic relevance modeling task. Two deep belief networks with different architectures are proposed by us to model the semantic relevance for the question-answer pairs. According to the investigation of the textual similarity between the community-driven question-answering (cQA) dataset and the forum dataset, a learning strategy is adopted to promote our models' performance on the social community corpora without hand-annotating work. The experimental results show that our method outperforms the traditional approaches on both the cQA and the forum corpora.

Question: What is the deep learning principle?


Tailoring Continuous Word Representations for Dependency Parsing. Word representations have proven useful for many NLP tasks, e.g., Brown clusters as features in dependency parsing (Koo et al., 2008). In this paper, we investigate the use of continuous word representations as features for dependency parsing. We compare several popular embeddings to Brown clusters, via multiple types of features, in both news and web domains. We find that all embeddings yield significant parsing gains, including some recent ones that can be trained in a fraction of the time of others. Explicitly tailoring the representations for the task leads to further improvements. Moreover, an ensemble of all representations achieves the best results, suggesting their complementarity.

Question: What is the best way to represent words?


Review of Recent Advances in the Application of the Wavelet Transform to Diagnose Cracked Rotors. Wavelet transform (WT) has been used in the diagnosis of cracked rotors since the 1990s. At present, WT is one of the most commonly used tools to treat signals in several fields. Understandably, this has been an area of extensive scientific research, which is why this paper aims to summarize briefly the major advances in the field since 2008. The present review considers advances in the use and application of WT, the selection of the parameters used, and the key achievements in using WT for crack diagnosis.

Question: What is the wavelet transform?


Feature-based brain MRI retrieval for Alzheimer disease diagnosis. In this paper we consider the application of the feature-based approach to medical image retrieval, particularly brain MRI scans for early Alzheimer's disease diagnosis. The key idea is to provide the doctor with the images which have similar visual properties and have full case record, giving the ability to make more informed decision in the prodromal phase of the disease. With regard to the state-of-the art SIFT features in a Bag-of-Visual-Words approach we propose to use the Laguerre Circular Harmonic Functions coefficients as feature vectors. An additional pre-classification step based on estimation of Alzheimer's disease early image abnormalities is proposed to improve overall precision.

Question: What is the state of the art in medical image retrieval?


A Variational Principle for Graphical Models. Graphical models bring together graph theory and probability theory in a powerful formalism for multivariate statistical modeling. In statistical signal processing— as well as in related fields such as communication theory, control theory and bioinformatics—statistical models have long been formulated in terms of graphs, and algorithms for computing basic statistical quantities such as likelihoods and marginal probabilities have often been expressed in terms of recursions operating on these graphs. Examples include hidden Markov models, Markov random fields, the forward-backward algorithm and Kalman filtering [ Rabiner and Juang (1993); Pearl (1988); Kailath et al. (2000)]. These ideas can be understood, unified and generalized within the formalism of graphical models. Indeed, graphical models provide a natural framework for formulating variations on these classical architectures, and for exploring entirely new families of statistical models. The recursive algorithms cited above are all instances of a general recursive algorithm known as the junction tree algorithm [ Lauritzen and Spiegelhalter, 1988]. The junction tree algorithm takes advantage of factorization properties of the joint probability distribution that are encoded by the pattern of missing edges in a graphical model. For suitably sparse graphs, the junction tree algorithm provides a systematic and practical solution to the general problem of computing likelihoods and other statistical quantities associated with a graphical model. Unfortunately, many graphical models of practical interest are not " suitably sparse, " so that the junction tree algorithm no longer provides a viable computational solution to the problem of computing marginal probabilities and other expectations. One popular source of methods for attempting to cope with such cases is the Markov chain Monte Carlo (MCMC) framework, and indeed there is a significant literature on

Question: What is the junction tree algorithm?


Maintaining Integrity: How Nurses Navigate Boundaries in Pediatric Palliative Care.. PURPOSE To explore how nurses manage personal and professional boundaries in caring for seriously ill children and their families.   DESIGN AND METHODS Using a constructivist grounded theory approach, a convenience sample of 18 registered nurses from four practice sites was interviewed using a semi-structured interview guide.   RESULTS Nurses across the sites engaged in a process of maintaining integrity whereby they integrated two competing, yet essential, aspects of their nursing role - behaving professionally and connecting personally. When skillful in both aspects, nurses were satisfied that they provided high-quality, family-centered care to children and families within a clearly defined therapeutic relationship. At times, tension existed between these two aspects and nurses attempted to mitigate the tension. Unsuccessful mitigation attempts led to compromised integrity characterized by specific behavioral and emotional indicators. Successfully mitigating the tension with strategies that prioritized their own needs and healing, nurses eventually restored integrity. Maintaining integrity involved a continuous effort to preserve completeness of both oneself and one's nursing practice.   CONCLUSIONS Study findings provide a theoretical conceptualization to describe the process nurses use in navigating boundaries and contribute to an understanding for how this specialized area of care impacts health care providers.   PRACTICE IMPLICATIONS Work environments can better address the challenges of navigating boundaries through offering resources and support for nurses' emotional responses to caring for seriously ill children. Future research can further refine and expand the theoretical conceptualization of maintaining integrity presented in this paper and its potential applicability to other nursing specialties.

Question: How do nurses navigate boundaries in pediatric palliative care?