A framework and theory for cyber security assessments. Information system security risk, defined as the product of the monetary losses associated with security incidents and the probability that they occur, is a suitable decision criterion when considering different information system architectures. This paper describes how probabilistic relational models can be used to specify architecture metamodels so that security risk can be inferred from metamodel-instantiations. A probabilistic relational model contains classes, attributes, and class-relationships. It can be used to specify architectural metamodels similar to class diagrams in the Unified Modeling Language. In addition, a probabilistic relational model makes it possible to associate a probabilistic dependency model to the attributes of classes in the architectural metamodel. This paper proposes a set of abstract classes that can be used to create probabilistic relational models so that they enable inference of security risk from instantiated architecture models. If an architecture metamodel is created by specializing the abstract classes proposed in this paper, the instantiations of the metamodel will generate a probabilistic dependency model that can be used to calculate the security risk associated with these instantiations. The abstract classes make it possible to derive the dependency model and calculate security risk from an instance model that only specifies assets and their relationships to each other. Hence, the person instantiating the architecture metamodel is not required to assess complex security attributes to quantify security risk using the instance model. Paper A: A probabilistic relational model for security risk analysis

Question: What is the difference between a probabilistic relational model and a probabilistic dependency model?


Giving voice to office customers: Best practices in how office handles verbatim text feedback. Microsoft Office users submit hundreds of thousands of pieces of verbatim feedback per month. How can an engineer or manager in Office find the signal in this data to make business decisions? This paper presents an overview of the Office Customer Voice (OCV) system. OCV combines classification, on-demand clustering and other machine learning techniques with a rich web UI to solve this problem. In this paper, we describe the different types of feedback received. Next, we outline the architecture used to build OCV. We then detail the text processing, classification and clustering done to reason on the data. Finally, we present challenges, future plans, and best practices that may be relevant to other teams analyzing customer feedback. We argue that this multi-pronged approach to handling customer feedback presents a pattern that other organizations can use to mature their handling of customer feedback.

Question: How can an engineer or manager in Office find the signal in this data to make business decisions?


Natural Image Stitching with the Global Similarity Prior. This paper proposes a method for stitching multiple images together so that the stitched image looks as natural as possible. Our method adopts the local warp model and guides the warping of each image with a grid mesh. An objective function is designed for specifying the desired characteristics of the warps. In addition to good alignment and minimal local distortion, we add a global similarity prior in the objective function. This prior constrains the warp of each image so that it resembles a similarity transformation as a whole. The selection of the similarity transformation is crucial to the naturalness of the results. We propose methods for selecting the proper scale and rotation for each image. The warps of all images are solved together for minimizing the distortion globally. A comprehensive evaluation shows that the proposed method consistently outperforms several state-of-the-art methods, including AutoStitch, APAP, SPHP and ANNAP.

Question: How to stitch multiple images together?


Vehicle control system for automatic valet parking with infrastructure sensors. This paper presents vehicle control system for automatic valet parking with infrastructure sensors. First, we describe the automatic valet parking service system. In the service, vehicle moves autonomously based on sensing data generated by infrastructure sensors. Second, we implement vehicle control system for automatic valet parking. We design hardware and software components focusing on minimizing the add-on devices and maximizing data integration. Finally, we do a feasibility test for verification of the system.

Question: What is the feasibility test for verification of the system?


"Green" electronics: biodegradable and biocompatible materials and devices for sustainable future.. "Green" electronics represents not only a novel scientific term but also an emerging area of research aimed at identifying compounds of natural origin and establishing economically efficient routes for the production of synthetic materials that have applicability in environmentally safe (biodegradable) and/or biocompatible devices. The ultimate goal of this research is to create paths for the production of human- and environmentally friendly electronics in general and the integration of such electronic circuits with living tissue in particular. Researching into the emerging class of "green" electronics may help fulfill not only the original promise of organic electronics that is to deliver low-cost and energy efficient materials and devices but also achieve unimaginable functionalities for electronics, for example benign integration into life and environment. This Review will highlight recent research advancements in this emerging group of materials and their integration in unconventional organic electronic devices.

Question: What is the green electronics?


Explaining and Predicting the Impact of Branding Alliances and Web Site Quality on Initial Consumer Trust of E-Commerce Web Sites. Trust is a crucial factor in e-commerce. However, consumers are less likely to trust unknown Web sites. This study explores how less-familiar e-commerce Web sites can use branding alliances and Web site quality to increase the likelihood of initial consumer trust. We use the associative network model of memory to explain brand knowledge and to show how the mere exposure effect can be leveraged to improve a Web site's brand image. We also extend information integration theory to explain how branding alliances are able to increase initial trust and transfer positive effects to Web sites. Testing of our model shows that the most important constructs for increasing initial trust in our experimental context are branding and Web site quality. Finally, we discuss future research ideas, limitations, implications, and ideas for practitioners.

Question: How can we increase initial trust in e-commerce?


Mean Shift, Mode Seeking, and Clustering. Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking process on a surface constructed with a "shadow" kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications in clustering and Hough transform are demonstrated. Mean shift is also considered as an evolutionary strategy that performs multistart global optimization.

Question: What is mean shift?


The differences in motivations of online game players and offline game players: A combined analysis of three studies at higher education level. Computer games have become a highly popular form of entertainment and have had a large impact on how University students spend their leisure time. Due to their highly motivating properties computer games have come to the attention of educationalists who wish to exploit these highly desirable properties for educational purposes. Several studies have been performed looking at motivations for playing computer games in a general context and in a Higher Education (HE) context. These studies did not focus on the differences in motivations between online and offline game players. Equally the studies did not look at the differences in motivations of people who prefer single player games and people who prefer multiplayer games. If games-based learning is to become a recognised teaching approach then such motivations for playing computer games must be better understood. This paper presents the combined analysis of three studies at HE level, performed over a four year period from 2005 to 2009. The paper focuses on differences of motivations in relation to single player/multiplayer preference and online/ offline game participation. The study found that challenge is the top ranking motivation and recognition is the lowest ranking motivation for playing computer games in general. Challenge is also the top ranking motivation for playing games in HE while fantasy and recognition are the lowest ranking motivations for playing games in HE. Multiplayer gamers derive more competition, cooperation, recognition, fantasy and curiosity from playing games and online gamers derive more challenge, cooperation, recognition and control from playing games. Multiplayer gamers and online gamers ranked competition, cooperation and recognition significantly more important for playing games in HE than single players and offline participants. 2011 Elsevier Ltd

Question: What are the differences in motivations of online and offline game players?


Personal Attributes Extraction in Chinese Text Based on Recurrent Neural Network. Personal Attributes Extraction in Chinese Text Task is designed to extract person specific attributes, for example, spouse/husband, children, education, title etc. from unstructured Chinese texts. According to the characteristics of the personal attributes extraction, we propose a new method based on deep learning to extract attributes from the documents in this paper. Experiments show that this method can improve the accuracy of personal attributes extraction effectively.

Question: What is the new method based on deep learning?


Code quality analysis in open source software development. Proponents of open source style software development claim that better software is produced using this model compared with the traditional closed model. However, there is little empirical evidence in support of these claims. In this paper, we present the results of a pilot case study aiming: (a) to understand the implications of structural quality; and (b) to figure out the benefits of structural quality analysis of the code delivered by open source style development. To this end, we have measured quality characteristics of 100 applications written for Linux, using a software measurement tool, and compared the results with the industrial standard that is proposed by the tool. Another target of this case study was to investigate the issue of modularity in open source as this characteristic is being considered crucial by the proponents of open source for this type of software development. We have empirically assessed the relationship between the size of the application components and the delivered quality measured through user satisfaction. We have determined that, up to a certain extent, the average component size of an application is negatively related to the user satisfaction for this application.

Question: What is the relationship between the size of the application components and the delivered quality measured through user satisfaction?


A Proposal for a Set of Level 3 Basic Linear Algebra Subprograms. This paper describes a proposal for Level 3 Basic Linear Algebra Subprograms (Level 3 BLAS). The Level 3 BLAS are targeted at matrix-matrix operations with the aim of providing more efficient, but portable, implementations of algorithms on high-performance computers, especially those with hierarchical memory and parallel processing capability.

Question: What is a level 3 BLAS?


Houston, we have a problem...: a survey of actual problems in computer games development. This paper presents a survey of problems found in the development process of electronic games. These problems were collected mainly from game postmortems and specialized litterature on game development, allowing a comparison with respect to well-known problems in the traditional software industry.

Question: What is a postmortem?


Learning Bayesian Networks is NP-Complete. Algorithms for learning Bayesian networks from data have two components: a scoring metric and a search procedure. The scoring metric computes a score reeecting the goodness-of-t of the structure to the data. The search procedure tries to identify network structures with high scores. Heckerman et al. (1995) introduce a Bayesian metric, called the BDe metric, that computes the relative posterior probability of a network structure given data. In this paper, we show that the search problem of identifying a Bayesian network|among those where each node has at most K parents|that has a relative posterior probability greater than a given constant is NP-complete, when the BDe metric is used. 12.1 Introduction Recently, many researchers have begun to investigate methods for learning Bayesian networks. Many of these approaches have the same basic components: a scoring metric and a search procedure. The scoring metric takes a database of observed cases D and a network structure B S , and returns a score reeecting the goodness-of-t of the data to the structure. A search procedure generates networks for evaluation by the scoring metric. These approaches use the two components to identify a network structure or set of structures that can be used to predict future events or infer causal relationships. Cooper and Herskovits (1992)|herein referred to as CH|derive a Bayesian metric, which we call the BD metric, from a set of reasonable assumptions about learning Bayesian networks containing only discrete variables. Heckerman et al. (1995)|herein referred to as HGC|expand upon the work of CH to derive a new metric, which we call the BDe metric, which has the desirable property of likelihood equivalence. Likelihood equivalence says that the data cannot help to discriminate equivalent structures. We now present the BD metric derived by CH. We use B h S to denote the hypothesis that B S is an I-map of the distribution that generated the database.

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


Generating Sentence Planning Variations for Story Telling. There has been a recent explosion in applications for dialogue interaction ranging from direction-giving and tourist information to interactive story systems. Yet the natural language generation (NLG) component for many of these systems remains largely handcrafted. This limitation greatly restricts the range of applications; it also means that it is impossible to take advantage of recent work in expressive and statistical language generation that can dynamically and automatically produce a large number of variations of given content. We propose that a solution to this problem lies in new methods for developing language generation resources. We describe the ES-TRANSLATOR, a computational language generator that has previously been applied only to fables, and quantitatively evaluate the domain independence of the EST by applying it to personal narratives from weblogs. We then take advantage of recent work on language generation to create a parameterized sentence planner for story generation that provides aggregation operations, variations in discourse and in point of view. Finally, we present a user evaluation of different personal narrative retellings.

Question: How can we generate a large number of variations of a given content?


Scientific and Pragmatic Challenges for Bridging Education and Neuroscience. Neuroscience has experienced rapid growth in recent years, spurred in part by the U.S. government's designation of the 1990s as "The Decade of the Brain" (Jones & Mendell, 1999). The rapid development of functional neuroimaging techniques has given researchers unprecedented access to the behaving brains of healthy children and adults. The result has been a wave of new insights into thinking, emotion, motivation, learning, and development. As these insights suffuse the social sciences, they sometimes inspire reconsideration of existing explanations. This is most true in psychology, as marked by the births of cognitive neuroscience (Gazzaniga, Ivry, & Mangun, 2002), developmental neuroscience (Johnson, Munakata, & Gilmore, 2001), and social neuroscience (Cacioppo, Visser, & Pickett, 2005). It is increasingly true in economics, where the rapid rise of neuroeconomics (Camerer, Loewenstein, & Prelec, 2005) has caught the attention of the popular press (Cassidy, 2006). Other social sciences, including communication (Anderson et al., 2006), political science (McDermott, 2004), and sociology (Wexler, 2006), are just beginning to confront the question of whether their research can be informed by neuroscience. Education is somewhere between the two poles of early adopters and tentative newcomers. A decade ago, in this journal, Bruer (1997) forcefully considered the relevance of neuroscience to education. His conclusion—that neuroscience is "a bridge too far"—was noteworthy because Bruer was then director of the McDonnell Foundation, which was actively funding research in both disciplines. Although it was in his best interests to find connections between the disciplines, he found instead poorly drawn extrapolations that inflated neuroscience findings into educational neuromyths. Since Bruer's cautionary evaluation, a number of commentators have considered the prospects for educational neuroscience. Ma

Question: What is the difference between education and neuroscience?


Smarter Cities and Their Innovation Challenges. The transformation to smarter cities will require innovation in planning, management, and operations. Several ongoing projects around the world illustrate the opportunities and challenges of this transformation. Cities must get smarter to address an array of emerging urbanization challenges, and as the projects highlighted in this article show, several distinct paths are available. The number of cities worldwide pursuing smarter transformation is growing rapidly. However, these efforts face many political, socioeconomic, and technical hurdles. Changing the status quo is always difficult for city administrators, and smarter city initiatives often require extensive coordination, sponsorship, and support across multiple functional silos. The need to visibly demonstrate a continuous return on investment also presents a challenge. The technical obstacles will center on achieving system interoperability, ensuring security and privacy, accommodating a proliferation of sensors and devices, and adopting a new closed-loop human-computer interaction paradigm.

Question: What are the challenges of transforming cities?


Path integral guided policy search. 3Sergey Levine is with Google Brain, Mountain View, CA 94043, USA. We present a policy search method for learning complex feedback control policies that map from high-dimensional sensory inputs to motor torques, for manipulation tasks with discontinuous contact dynamics. We build on a prior technique called guided policy search (GPS), which iteratively optimizes a set of local policies for specific instances of a task, and uses these to train a complex, high-dimensional global policy that generalizes across task instances. We extend GPS in the following ways: (1) we propose the use of a model-free local optimizer based on path integral stochastic optimal control (PI2), which enables us to learn local policies for tasks with highly discontinuous contact dynamics; and (2) we enable GPS to train on a new set of task instances in every iteration by using on-policy sampling: this increases the diversity of the instances that the policy is trained on, and is crucial for achieving good generalization. We show that these contributions enable us to learn deep neural network policies that can directly perform torque control from visual input. We validate the method on a challenging door opening task and a pick-and-place task, and we demonstrate that our approach substantially outperforms the prior LQR-based local policy optimizer on these tasks. Furthermore, we show that on-policy sampling significantly increases the generalization ability of these policies.

Question: What is the path integral guided policy search?


Priming and human memory systems.. Priming is a nonconscious form of human memory, which is concerned with perceptual identification of words and objects and which has only recently been recognized as separate from other forms of memory or memory systems. It is currently under intense experimental scrutiny. Evidence is converging for the proposition that priming is an expression of a perceptual representation system that operates at a pre-semantic level; it emerges early in development, and access to it lacks the kind of flexibility characteristic of other cognitive memory systems. Conceptual priming, however, seems to be based on the operations of semantic memory.

Question: What is the difference between priming and semantic memory?


Digital control of a half-bridge LLC resonant converter. Recently, LLC resonant converters are gaining more and more interest in DC/DC conversion due to their high efficiency and power density. Usually, they are used in low power applications, i.e. in the range of few hundred Watt and with constant output load, however they are very appealing in high power and renewable energy applications as well as in many other applications affected by wide variations of the load and/or the source voltage. This paper presents and discusses a novel half bridge DC/DC resonant converter with digital control and fuzzy logic. The proposed system is compared with a more traditional PID controller. A variable frequency control algorithms are implemented using a low cost, high performance Texas Instrument TMS320F28069 DSP for the regulation of the output voltage. Simulation results using MATLAB are presented to evaluate the quality of the obtained result. A laboratory prototype has been realized and experimental results obtained using both PID and Fuzzy controllers are shown and discussed.

Question: What is a half-bridge LLC resonant converter?


WHY AGENTS? ON THE VARIED MOTIVATIONS FOR AGENT COMPUTING IN THE SOCIAL SCIENCES. The many motivations for employing agent-based computation in the social sciences are reviewed. It is argued that there exist three distinct uses of agent modeling techniques. One such use — the simplest — is conceptually quite close to traditional simulation in operations research. This use arises when equations can be formulated that completely describe a social process, and these equations are explicitly soluble, either analytically or numerically. In the former case, the agent model is merely a tool for presenting results, while in the latter it is a novel kind of Monte Carlo analysis. A second, more commonplace usage of computational agent models arises when mathematical models can be written down but not completely solved. In this case the agent-based model can shed significant light on the solution structure, illustrate dynamical properties of the model, serve to test the dependence of results on parameters and assumptions, and be a source of counter-examples. Finally, there are important classes of problems for which writing down equations is not a useful activity. In such circumstances, resort to agent-based computational models may be the only way available to explore such processes systematically, and constitute a third distinct usage of such models. ∗ Corresponding author address: Robert Axtell, Center on Social and Economic Dynamics, The Brookings Institution, 1775 Massachusetts Ave. NW, Washington, DC 20036; e-mail: raxtell@brook.edu; web: http://www.brook.edu/es/dynamics.

Question: What is the difference between agent-based modeling and traditional simulation?


Malware detection by text and data mining. Cyber frauds are a major security threat to the banking industry worldwide. Malware is one of the manifestations of cyber frauds. Malware authors use Application Programming Interface (API) calls to perpetrate these crimes. In this paper, we propose a static analysis method to detect Malware based on API call sequences using text and data mining in tandem. We analyzed the dataset available at CSMINING group. First, we employed text mining to extract features from the dataset consisting a series of API calls. Further, mutual information is invoked for feature selection. Then, we resorted to over-sampling to balance the data set. Finally, we employed various data mining techniques such as Decision Tree (DT), Multi Layer Perceptron (MLP), Support Vector Machine (SVM), Probabilistic Neural Network (PNN) and Group Method for Data Handling (GMDH). We also applied One Class SVM (OCSVM). Throughout the paper, we used 10-fold cross validation technique for testing the techniques. We observed that SVM and OCSVM achieved 100% sensitivity after balancing the dataset.

Question: What is the difference between malware and malware detection?


Fast and practical indexing and querying of very large graphs. Many applications work with graph-structured data. As graphs grow in size, indexing becomes essential to ensure sufficient query performance. We present the GRIPP index structure (GRaph Indexing based on Pre- and Postorder numbering) for answering reachability queries in graphs.  GRIPP requires only linear time and space. Using GRIPP, we can answer reachability queries on graphs with 5 million nodes on average in less than 5 milliseconds, which is unrivaled by previous methods. We evaluate the performance and scalability of our approach on real and synthetic random and scale-free graphs and compare our approach to existing indexing schemes. GRIPP is implemented as stored procedure inside a relational database management system and can therefore very easily be integrated into existing graph-oriented applications.

Question: What is the fastest way to index a graph?


Evolution for automatic assessment of the difficulty of sokoban boards. Many games have a collection of boards with the difficulty of an instance of the game determined by the starting configuration of the board. Correctly rating the difficulty of the boards is somewhat haphazard and required either a remarkable level of understanding of the game or a good deal of play-testing. In this study we explore evolutionary algorithms as a tool to automatically grade the difficulty of boards for a version of the game sokoban. Mean time-to-solution by an evolutionary algorithm and number of failures to solve a board are used as a surrogate for the difficulty of a board. Initial testing with a simple string-based representation, giving a sequence of moves for the sokoban agent, provided very little signal; it usually failed. Two other representations, based on a reactive linear genetic programming structure called an ISAc list, generated useful hardness-classification information for both hardness surrogates. These two representations differ in that one uses a randomly initialized population of ISAc lists while the other initializes populations with competent agents pre-trained on random collections of sokoban boards. The study encompasses four hardness surrogates: probability-of-failure and mean time-to-solution for each of these two representations. All four are found to generate similar information about board hardness, but probability-of-failure with pre-evolved agents is found to be faster to compute and to have a clearer meaning than the other three board-hardness surrogates.

Question: What is the difference between a genetic algorithm and a genetic programming algorithm?


Tunable VHF Miniaturized Helical Filters. In this paper, a miniaturization technique and a tuning concept that enable the realization of highly miniaturized and frequency reconfigurable helical filters are reported for the first time. The proposed filter design is based on tunable helical resonators with an internal volume of only 8.6 cm 3 and variable capacitive loading. A second-order bandpass filter was built and measured as a proof-of-concept demonstrator. The helical filter is manufactured with a CNC process and tuning is achieved through piezoelectrically actuated tuners, which are bonded over the helix apex. A measured center frequency tuning between 257-365 MHz was realized with an insertion loss between 0.3-3.2 dB including connector losses. The measured filter bandwidth varied between 6%-7.7%. Tunable resonators were also manufactured so as to extract the unloaded quality factor. It was measured between 392-639 for a center frequency tuning of 2.5:1 (156.5-395 MHz).

Question: What is a helical filter?


Transgender face recognition with off-the-shelf pre-trained CNNs: A comprehensive study. Face recognition has become a ubiquitous way of establishing identity in many applications. Gender transformation therapy induces changes to face on both for structural and textural features. A challenge for face recognition system is, therefore, to reliably identify the subjects after they undergo gender change while the enrolment images correspond to pre-change. In this work, we propose a new framework based on augmenting and fine-tuning deep Residual Network-50 (ResNet-50). We employ YouTube database with 37 subjects whose images are self-captured to evaluate the performance of state-of-the-schemes. Obtained results demonstrate the superiority of the proposed scheme over twelve different state-of-the-art schemes with an improved Rank — 1 recognition rate.

Question: How to fine-tune a pre-trained CNN?


Generative Single Image Reflection Separation. Single image reflection separation is an ill-posed problem since two scenes, a transmitted scene and a reflected scene, need to be inferred from a single observation. To make the problem tractable, in this work we assume that categories of two scenes are known. It allows us to address the problem by generating both scenes that belong to the categories while their contents are constrained to match with the observed image. A novel network architecture is proposed to render realistic images of both scenes based on adversarial learning. The network can be trained in a weakly supervised manner, i.e., it learns to separate an observed image without corresponding ground truth images of transmission and reflection scenes which are difficult to collect in practice. Experimental results on real and synthetic datasets demonstrate that the proposed algorithm performs favorably against existing methods.

Question: What is the generative single image reflection separation?


Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey. This paper provides a state-of-the-art literature review on economic analysis and pricing models for data collection and wireless communication in Internet of Things (IoT). Wireless sensor networks (WSNs) are the main components of IoT which collect data from the environment and transmit the data to the sink nodes. For long service time and low maintenance cost, WSNs require adaptive and robust designs to address many issues, e.g., data collection, topology formation, packet forwarding, resource and power optimization, coverage optimization, efficient task allocation, and security. For these issues, sensors have to make optimal decisions from current capabilities and available strategies to achieve desirable goals. This paper reviews numerous applications of the economic and pricing models, known as intelligent rational decision-making methods, to develop adaptive algorithms and protocols for WSNs. Besides, we survey a variety of pricing strategies in providing incentives for phone users in crowdsensing applications to contribute their sensing data. Furthermore, we consider the use of some pricing models in machine-to-machine (M2M) communication. Finally, we highlight some important open research issues as well as future research directions of applying economic and pricing models to IoT.

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


Be Quiet? Evaluating Proactive and Reactive User Interface Assistants. This research examined the ability of an anthropomorphic interface assistant to help people learn and use an unfamiliar text-editing tool, with a specific focus on assessing proactive assistant behavior. Participants in the study were introduced to a text editing system that used keypress combinations for invoking the different editing operations. Participants then were directed to make a set of prescribed changes to a document with the aid either of a paper manual, an interface assistant that would hear and respond to questions orally, or an assistant that responded to questions and additionally made proactive suggestions. Anecdotal evidence suggested that proactive assistant behavior would not enhance performance and would be viewed as intrusive. Our results showed that all three conditions performed similarly on objective editing performance (completion time, commands issued, and command recall), while the participants in the latter two conditions strongly felt that the assistant's help was valuable.

Question: How does an interface assistant help people learn and use an unfamiliar text editing tool?


Empirically Evaluating the Quality of Automatically Generated and Manually Written Test Suites. The creation, execution, and maintenance of tests are some of the most expensive tasks in software development. To help reduce the cost, automated test generation tools can be used to assist and guide developers in creating test cases. Yet, the tests that automated tools produce range from simple skeletons to fully executable test suites, hence their complexity and quality vary. This paper compares the complexity and quality of test suites created by sophisticated automated test generation tools to that of developer-written test suites. The empirical study in this paper examines ten real-world programs with existing test suites and applies two state-of-the-art automated test generation tools. The study measures the resulting test suite quality in terms of code coverage and fault-finding capability. On average, manual tests covered 31.5% of the branches while the automated tools covered 31.8% of the branches. In terms of mutation score, the tests generated by automated tools had an average mutation score of 39.8% compared to the average mutation score of 42.1% for manually written tests. Even though automatically created tests often contain more lines of source code than those written by developers, this paper's empirical results reveal that test generation tools can provide value by creating high quality test suites while reducing the cost and effort needed for testing.

Question: What is the average code coverage of test suites created by automated test generation tools?


Learning from the past: answering new questions with past answers. Community-based Question Answering sites, such as Yahoo! Answers or Baidu Zhidao, allow users to get answers to complex, detailed and personal questions from other users. However, since answering a question depends on the ability and willingness of users to address the asker's needs, a significant fraction of the questions remain unanswered. We measured that in Yahoo! Answers, this fraction represents 15% of all incoming English questions. At the same time, we discovered that around 25% of questions in certain categories are recurrent, at least at the question-title level, over a period of one year.  We attempt to reduce the rate of unanswered questions in Yahoo! Answers by reusing the large repository of past resolved questions, openly available on the site. More specifically, we estimate the probability whether certain new questions can be satisfactorily answered by a best answer from the past, using a statistical model specifically trained for this task. We leverage concepts and methods from query-performance prediction and natural language processing in order to extract a wide range of features for our model. The key challenge here is to achieve a level of quality similar to the one provided by the best human answerers.  We evaluated our algorithm on offline data extracted from Yahoo! Answers, but more interestingly, also on online data by using three "live" answering robots that automatically provide past answers to new questions when a certain degree of confidence is reached. We report the success rate of these robots in three active Yahoo! Answers categories in terms of both accuracy, coverage and askers' satisfaction. This work presents a first attempt, to the best of our knowledge, of automatic question answering to questions of social nature, by reusing past answers of high quality.

Question: What is the success rate of the robots in answering questions?


A Service-Oriented Architecture for Virtualizing Robots in Robot-as-a-Service Clouds. Exposing software and hardware computing resources as services through a cloud is increasingly emerging in the recent years. This comes as a result of extending the service-oriented architecture (SOA) paradigm to virtualize computing resources. In this paper, we extend the paradigm of the SOA approach to virtualize robotic hardware and software resources to expose them as services through the Web. This allows non-technical users to access, interact and manipulate robots simply through a Web browser. The proposed RoboWeb system is based on a SOAP-based Web service middleware that binds robots computing resources as services and publish them to the end-users. We consider robots that operates with the Robotic Operating System (ROS), as it provides hardware abstraction that makes easier applications development. We describe the implementation of RoboWeb and demonstrate how researchers can use it to interact remotely with the robots. We believe that this work consistently contributes to enabling remote robotic labs using the cloud paradigm.

Question: What is the robo web?


2D electronics - opportunities and limitations. 2D materials (2Ds), in particular the 2Ds beyond graphene, have attracted considerable attention in the transistor community. While rapid progress on 2D transistors has been achieved recently, the prospects of 2D electronics is still under debate. In the present paper we discuss our view of the potential of 2D transistors for digital CMOS and for flexible electronics. We show that 2D MOSFETs show promise for ultimately scaled CMOS due their excellent electrostatic integrity and their ability to suppress source-drain tunneling. Moreover, the 2Ds represent a promising option for radio frequency (RF) flexible electronics since they offer an attractive combination of mechanical (bendability, stretchability), and electrical (reasonable mobility) properties.

Question: What is the future of 2D electronics?


Facile one-pot solvothermal method to synthesize sheet-on-sheet reduced graphene oxide (RGO)/ZnIn2S4 nanocomposites with superior photocatalytic performance.. Highly reductive RGO (reduced graphene oxide)/ZnIn2S4 nanocomposites with a sheet-on-sheet morphology have been prepared via a facile one-pot solvothermal method in a mixture of N,N-dimethylformamide (DMF) and ethylene glycol (EG) as solvent. A reduction of GO (graphene oxide) to RGO and the formation of ZnIn2S4 nanosheets on highly reductive RGO has been simultaneously achieved. The effect of the solvents on the morphology of final products has been investigated and the formation mechanism was proposed. The as-prepared RGO/ZnIn2S4 nanoscomposites were characterized by powder X-ray diffraction (XRD), Fourier transform infrared spectroscopy (FT-IR), Raman spectroscopy, X-ray photoelectron spectroscopy (XPS), N2-adsorption BET surface area, UV-vis diffuse reflectance spectroscopy (DRS), scanning electron microscopy (SEM), transmission electron microscopy (TEM), high-resolution transmission electron microscopy (HRTEM). The photocatalytic activity for hydrogen evolution under visible light irradiations over the as-prepared RGO/ZnIn2S4 nanocomposites has been investigated. The as-prepared RGO/ZnIn2S4 nanocomposites show enhanced photocatalytic activity for hydrogen evolution under visible light irradiations and an optimum photocatalytic activity is observed over 1.0 wt % RGO incorporated ZnIn2S4 nanocomposite. The superior photocatalytic performance observed over RGO/ZnIn2S4 nanocomposites can be ascribed to the existence of highly reductive RGO which has strong interactions with ZnIn2S4 nanosheets. The existence of the strong interaction between ZnIn2S4 nanosheets and RGO in the nancomposites facilitates the electron transfer from ZnIn2S4 to RGO, with the latter serving as a good electron acceptor, mediator as well as the co-catalyst for hydrogen evolution. This study can provide some guidance for us in the develo

Question: What is the difference between the solvothermal method and the hydrothermal method?


Using Ontology and Data Provenance to Improve Software Processes. Provenance refers to the origin of a particular object. In computational terms, provenance is a historical record of the derivation of data that can help to understand the current record. In this context, this work presents a proposal for software processes improvement using a provenance data model and an ontology. This improvement can be obtained by process data execution analysis with an approach called PROV-Process, which uses a layer for storing process provenance and an ontology based on PROV-O.

Question: What is the provenance of this document?


Impact of IEEE 802.11n/ac PHY/MAC High Throughput Enhancements over Transport/Application Layer Protocols - A Survey. Since the inception of Wireless Local Area Networks (WLANs) in the year 1997, it has tremendously grown in the last few years. IEEE 802.11 is popularly known as WLAN. To provide the last mile wireless broadband connectivity to users, IEEE 802.11 is enriched with IEEE 802.11a, IEEE 802.11b and IEEE 802.11g. More recently, IEEE 802.11n, IEEE 802.11ac and IEEE 802.11ad are introduced with enhancements to the physical (PHY) layer and medium access control (MAC) sublayer to provide much higher data rates and thus these amendments are called High Throughput WLANs (HT-WLANs). In IEEE 802.11n, the data rate has increased up to 600 Mbps, whereas IEEE 802.11ac/ad is expected to support a maximum throughput of 1 to 7 Gbps over wireless media. For both standards, PHY is enhanced with multiple-input multiple-output (MIMO) antenna technologies, channel bonding, short guard intervals (SGI), enhanced modulation and coding schemes (MCS). At the same time, MAC layer overhead is reduced by introducing frame aggregation and block acknowledgement technologies. However, existing studies reveal that although PHY and MAC enhancements promise to improve physical data rate significantly, they yield negative impact over upper layer protocols – mainly for reliable end-to-end transport/application layer protocols. As a consequence, a large number of schools have focused researches on HT-WLANs to improve the coordination among PHY/MAC and upper layer protocols and thus, boost up the performance benefit. In this survey, we discuss the impact of enhancements of PHY/MAC layer in HT-WLANs over transport/application layer protocols. Several measures have been reported in the literature that boost up data rate of WLANs and use aforesaid enhancements effectively for performance benefit of end-to-end protocols. We also point out limitations of existing researches and list down different

Question: What is the impact of IEEE 802.11n/ac PHY/MAC High Throughput Enhancements over Transport/Application Layer Protocols - A Survey?


Individual ball possession in soccer. This paper describes models for detecting individual and team ball possession in soccer based on position data. The types of ball possession are classified as Individual Ball Possession (IBC), Individual Ball Action (IBA), Individual Ball Control (IBC), Team Ball Possession (TBP), Team Ball Control (TBC) und Team Playmaking (TPM) according to different starting points and endpoints and the type of ball control involved. The machine learning approach used is able to determine how long the ball spends in the sphere of influence of a player based on the distance between the players and the ball together with their direction of motion, speed and the acceleration of the ball. The degree of ball control exhibited during this phase is classified based on the spatio-temporal configuration of the player controlling the ball, the ball itself and opposing players using a Bayesian network. The evaluation and application of this approach uses data from 60 matches in the German Bundesliga season of 2013/14, including 69,667 IBA intervals. The identification rate was F = .88 for IBA and F = .83 for IBP, and the classification rate for IBC was κ = .67. Match analysis showed the following mean values per match: TBP 56:04 ± 5:12 min, TPM 50:01 ± 7:05 min and TBC 17:49 ± 8:13 min. There were 836 ± 424 IBC intervals per match and their number was significantly reduced by -5.1% from the 1st to 2nd half. The analysis of ball possession at the player level indicates shortest accumulated IBC times for the central forwards (0:49 ± 0:43 min) and the longest for goalkeepers (1:38 ± 0:58 min), central defenders (1:38 ± 1:09 min) and central midfielders (1:27 ± 1:08 min). The results could improve performance analysis in soccer, help to detect match events automatically, and allow discernment of higher value tactical structures, which is based on individual ball possession.

Question: What is the difference between individual ball possession and individual ball action?


Clonogenic assay of cells in vitro. Clonogenic assay or colony formation assay is an in vitro cell survival assay based on the ability of a single cell to grow into a colony. The colony is defined to consist of at least 50 cells. The assay essentially tests every cell in the population for its ability to undergo "unlimited" division. Clonogenic assay is the method of choice to determine cell reproductive death after treatment with ionizing radiation, but can also be used to determine the effectiveness of other cytotoxic agents. Only a fraction of seeded cells retains the capacity to produce colonies. Before or after treatment, cells are seeded out in appropriate dilutions to form colonies in 1–3 weeks. Colonies are fixed with glutaraldehyde (6.0% v/v), stained with crystal violet (0.5% w/v) and counted using a stereomicroscope. A method for the analysis of radiation dose–survival curves is included.

Question: What is the clonogenic assay?


Map-reduce based parallel support vector machine for risk analysis. Now a days people are enjoying the world of data because size and amount of the data has tremendously increased which acts like an invitation to Big data. But some of the classifier techniques like Support Vector Machine (SVM) is not able to handle the huge amount of data due to it's excessive memory requirement and unreasonable complexity in algorithm tough it is one of the most popularly used classifier in machine learning field. Hence a new technique comes into picture which performs parallel algorithm in a efficient way to work data having large scale called as PSVM. In this paper we are going to discuss a PSVM model for risk analysis which is based on map-reduce, and can easily handle a huge amount of data in a distributed manner.

Question: What is map-reduce?


Mining Local Process Models. In this paper we describe a method to discover frequent behavioral patterns in event logs. We express these patterns as local process models. Local process model mining can be positioned in-between process discovery and episode / sequential pattern mining. The technique presented in this paper is able to learn behavioral patterns involving sequential composition, concurrency, choice and loop, like in process mining. However, we do not look at start-to-end models, which distinguishes our approach from process discovery and creates a link to episode / sequential pattern mining. We propose an incremental procedure for building local process models capturing frequent patterns based on so-called process trees. We propose five quality dimensions and corresponding metrics for local process models, given an event log. We show monotonicity properties for some quality dimensions, enabling a speedup of local process model discovery through pruning. We demonstrate through a real life case study that mining local patterns allows us to get insights in processes where regular start-to-end process discovery techniques are only able to learn unstructured, flower-like, models.

Question: What is a local process model?


A Neural Algorithm of Artistic Style. Werner Reichardt Centre for Integrative Neuroscience and Institute of Theoretical Physics, University of Tübingen, Germany Bernstein Center for Computational Neuroscience, Tübingen, Germany Graduate School for Neural Information Processing, Tübingen, Germany Max Planck Institute for Biological Cybernetics, Tübingen, Germany Department of Neuroscience, Baylor College of Medicine, Houston, TX, USA ∗To whom correspondence should be addressed; E-mail: leon.gatys@bethgelab.org

Question: What is the name of the institute?


Dependency Grammar and Dependency Parsing. Despite a long and venerable tradition in descriptive lingu stics, dependency grammar has until recently played a fairly marginal role both in t heoretical linguistics and in natural language processing. The increasing interes t in dependency-based representations in natural language parsing in recent year s appears to be motivated both by the potential usefulness of bilexical relations in d isambiguation and by the gains in efficiency that result from the more constrained par sing problem for these representations. In this paper, we will review the state of the art in dependenc y-based parsing, starting with the theoretical foundations of dependency gr ammar and moving on to consider both grammar-driven and data-driven methods fo r dependency parsing. We will limit our attention to systems for dependency parsin g i a narrow sense, i.e. systems where the analysis assigned to an input sentenc akes the form of a dependency structure. This means that we will not discuss sy tems that exploit dependency relations for the construction of another type o f r presentation, such as the head-driven parsing models of Collins (1997, 1999). M oreover, we will restrict ourselves to systems for full parsing, which means that we will not deal with systems that produce a partial or underspecified repres ntation of dependency structure, such as Constraint Grammar parsers (Karlsson, 1 990; Karlsson et al., 1995).

Question: What is dependency grammar?


A Logic-based Approach for Recognizing Textual Entailment Supported by Ontological Background Knowledge. We present the architecture and the evaluation of a new system for recognizing textual entailment (RTE). In RTE we want to identify automatically the type of a logical relation between two input texts. In particular, we are interested in proving the existence of an entailment between them. We conceive our system as a modular environment allowing for a high-coverage syntactic and semantic text analysis combined with logical inference. For the syntactic and semantic analysis we combine a deep semantic analysis with a shallow one supported by statistical models in order to increase the quality and the accuracy of results. For RTE we use logical inference of first-order employing model-theoretic techniques and automated reasoning tools. The inference is supported with problem-relevant background knowledge extracted automatically and on demand from external sources like, e.g., WordNet, YAGO, and OpenCyc, or other, more experimental sources with, e.g., manually defined presupposition resolutions, or with axiomatized general and common sense knowledge. The results show that fine-grained and consistent knowledge coming from diverse sources is a necessary condition determining the correctness and traceability of results.

Question: What is the architecture of a logic-based approach for recognizing textual entailment?


Mean-shift Blob Tracking through Scale Space. The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although the scale of the mean-shift kernel is a crucial parameter, there is presently no clean mechanism for choosing or updating scale while tracking blobs that are changing in size. We adapt Lindeberg's theory of feature scale selection based on local maxima of differential scale-space filters to the problem of selecting kernel scale for mean-shift blob tracking. We show that a difference of Gaussian (DOG) mean-shift kernel enables efficient tracking of blobs through scale space. Using this kernel requires generalizing the mean-shift algorithm to handle images that contain negative sample weights.

Question: How to track blobs through scale space?


Exploitation of Dual-Polarization Diversity for 5G Millimeter-Wave MIMO Beamforming Systems. For the first time, to the best of our knowledge, this paper reports a complete millimeter wave (mmWave) wireless system, which coherently utilizes polarization diversity, multi-input multioutput (MIMO), and beamforming technologies applicable for upcoming fifth generation wireless mobile terminals. Using an interdisciplinary approach across the entire layers constituting of antennas, RF architecture, and digital modem, the polarization of the presented mmWave beamforming antenna system dynamically adapts to the channel environments and MIMO transmission modes. Empirical investigations, which are taken under real-life environments, ascertain that implementing switchable dual-polarized array antennas can alleviate the complexity of the beam searching procedure and MIMO channelization. In addition, experimental results acquired from intensive system level tests indicate more than 22 dB averaged cross-polarization discrimination under polarized MIMO channel conditions at the 60 GHz band. The beam selection algorithm that can be easily implemented based on power metric is confirmed to feature a 99.5% accuracy in comparison with the optimal selection algorithm derived from the theoretical maximal capacity.

Question: What is the difference between dual-polarization and single-polarization?


Depth Selective Camera: A Direct, On-Chip, Programmable Technique for Depth Selectivity in Photography. Time of flight (ToF) cameras use a temporally modulated light source and measure correlation between the reflected light and a sensor modulation pattern, in order to infer scene depth. In this paper, we show that such correlational sensors can also be used to selectively accept or reject light rays from certain scene depths. The basic idea is to carefully select illumination and sensor modulation patterns such that the correlation is non-zero only in the selected depth range - thus light reflected from objects outside this depth range do not affect the correlational measurements. We demonstrate a prototype depth-selective camera and highlight two potential applications: imaging through scattering media and virtual blue screening. This depth-selectivity can be used to reject back-scattering and reflection from media in front of the subjects of interest, thereby significantly enhancing the ability to image through scattering media-critical for applications such as car navigation in fog and rain. Similarly, such depth selectivity can also be utilized as a virtual blue-screen in cinematography by rejecting light reflecting from background, while selectively retaining light contributions from the foreground subject.

Question: What is a depth selective camera?


Phrase-based Machine Translation is State-of-the-Art for Automatic Grammatical Error Correction. In this work, we study parameter tuning towards the M2 metric, the standard metric for automatic grammar error correction (GEC) tasks. After implementing M2 as a scorer in the Moses tuning framework, we investigate interactions of dense and sparse features, different optimizers, and tuning strategies for the CoNLL-2014 shared task. We notice erratic behavior when optimizing sparse feature weights with M2 and offer partial solutions. To our surprise, we find that a bare-bones phrase-based SMT setup with task-specific parameter-tuning outperforms all previously published results for the CoNLL-2014 test set by a large margin (46.37% M2 over previously 40.56%, by a neural encoder-decoder model) while being trained on the same data. Our newly introduced dense and sparse features widen that gap, and we improve the state-ofthe-art to 49.49% M2.

Question: What is the state-of-the-art for automatic grammar error correction?


The contagious leader: impact of the leader's mood on the mood of group members, group affective tone, and group processes.. The present study examined the effects of leaders' mood on (a) the mood of individual group members, (b) the affective tone of groups, and (c) 3 group processes: coordination, effort expenditure, and task strategy. On the basis of a mood contagion model, the authors found that when leaders were in a positive mood, in comparison to a negative mood, (a) individual group members experienced more positive and less negative mood, and (b) groups had a more positive and a less negative affective tone. The authors also found that groups with leaders in a positive mood exhibited more coordination and expended less effort than did groups with leaders in a negative mood. Applied implications of the results are discussed.

Question: What is the contagious leader?


DropConnected neural network trained with diverse features for classifying heart sounds. A fully-connected, two-hidden-layer neural network trained by error backpropagation, and regularized with DropConnect is used to classify heart sounds as normal or abnormal. The heart sounds are segmented using an open-source algorithm based on a hidden semi-Markov model. Features are extracted from the heart sounds using a wavelet transform, mel-frequency cepstral coefficients, inter-beat properties, and signal complexity. Features are normalized by subtracting by their means and dividing by their standard deviations across the whole training set. Any feature which is not significantly different between normal and abnormal recordings in the training data is removed, as are highly-correlated features. The dimensionality of the features vector is reduced by projecting it onto its first 70 principal components. A 10 fold cross-validation study gives a mean classification score of 84.1% with a variance of 2.9%. The final score on the test data was 85.2%.

Question: What is a neural network?


Question: What is a recurrent net?


Building and evaluating web corpora representing national varieties of English. Corpora are essential resources for language studies, as well as for training statistical natural language processing systems. Although very large English corpora have been built, only relatively small corpora are available for many varieties of English. National top-level domains (e.g., .au, .ca) could be exploited to automatically build web corpora, but it is unclear whether such corpora would reflect the corresponding national varieties of English; i.e., would a web corpus built from the .ca domain correspond to Canadian English? In this article we build web corpora from national top-level domains corresponding to countries in which English is widely spoken. We then carry out statistical analyses of these corpora in terms of keywords, measures of corpus comparison based on the Chi-square test and spelling variants, and the frequencies of words known to be marked in particular varieties of English. We find evidence that the web corpora indeed reflect the corresponding national varieties of English. We then demonstrate, through a case study on the analysis of Canadianisms, that these corpora could be valuable lexicographical resources.

Question: How do you build a web corpus?


An Error-Oriented Approach to Word Embedding Pre-Training. We propose a novel word embedding pretraining approach that exploits writing errors in learners' scripts. We compare our method to previous models that tune the embeddings based on script scores and the discrimination between correct and corrupt word contexts in addition to the generic commonly-used embeddings pre-trained on large corpora. The comparison is achieved by using the aforementioned models to bootstrap a neural network that learns to predict a holistic score for scripts. Furthermore, we investigate augmenting our model with error corrections and monitor the impact on performance. Our results show that our error-oriented approach outperforms other comparable ones which is further demonstrated when training on more data. Additionally, extending the model with corrections provides further performance gains when data sparsity is an issue.

Question: What is the difference between the word embedding pre-training approach and the error-oriented approach?


Applying a flexible microactuator to robotic mechanisms. A flexible microactuator (FMA) driven by an electropneumatic (or electrohydraulic) system has been developed. It has three degrees of freedom-pitch, yaw, and stretch-making it suitable for robotic mechanisms such as fingers, arms, or legs. It is made of fiber-reinforced rubber, and the mechanism is very simple, enabling miniature robots without conventional link mechanisms to be designed. Serially connected FMAs act as a miniature robot manipulator. The kinematics and control algorithm for this type of robot are presented. FMAs combined in parallel act as a multifingered robot hand, with each FMA representing a finger. An algorithm for the cooperative control for such FMAs, the stable region for holding, and its performance have been developed.<<ETX>>

Question: What is the ETX?


Human Activity Recognition and Pattern Discovery. In principle, activity recognition can be exploited to great societal benefits, especially in real-life, human centric applications such as elder care and healthcare. This article focused on recognizing simple human activities. Recognizing complex activities remains a challenging and active area of research and the nature of human activities poses different challenges. Human activity understanding encompasses activity recognition and activity pattern discovery. The first focuses on accurate detection of human activities based on a predefined activity model. An activity pattern discovery researcher builds a pervasive system first and then analyzes the sensor data to discover activity patterns.

Question: What is the difference between activity recognition and activity pattern discovery?


Fingerprinting Information in JavaScript Implementations. To date, many attempts have been made to fingerprint users on the web. These fingerprints allow browsing sessions to be linked together and possibly even tied to a user's identity. They can be used constructively by sites to supplement traditional means of user authentication such as passwords; and they can be used destructively to counter attempts to stay anonymous online. In this paper, we identify two new avenues for browser fingerprinting. The new fingerprints arise from the browser's JavaScript execution characteristics, making them difficult to simulate or mitigate in practice. The first uses the innate performance signature of each browser's JavaScript engine, allowing the detection of browser version, operating system and microarchitecture, even when traditional forms of system identification (such as the user-agent header) are modified or hidden. The second subverts the whitelist mechanism of the popular NoScript Firefox extension, which selectively enables web pages' scripting privileges to increase privacy by allowing a site to determine if particular domains exist in a user's NoScript whitelist. We have experimentally verified the effectiveness of our system fingerprinting technique using a 1,015-person study on Amazon's Mechanical Turk platform.

Question: How to fingerprint users in JavaScript?


A SURVEY OF DISTRIBUTED FILE SYSTEMS. This paper is a survey of the current state of the art in the design and implementation of distributed file systems. It consists of four major parts: an overview of background material, case studies of a number of contemporary file systems, identification of key design techniques, and an examination of current research issues. The systems surveyed are Sun NFS, Apollo Domain, Andrew, IBM AIX DS, AT&T RFS, and Sprite. The coverage of background material includes a taxonomy of file system issues, a brief history of distributed file systems, and a summary of empirical research on file properties. A comprehensive bibliography forms an important of the paper.

Question: What is a distributed file system?


How Does Disagreement Benefit Co-teaching?. Learning with noisy labels is one of the most important question in weakly-supervised learning domain. Classical approaches focus on adding the regularization or estimating the noise transition matrix. However, either a regularization bias is permanently introduced, or the noise transition matrix is hard to be estimated accurately. In this paper, following a novel path to train on small-loss samples, we propose a robust learning paradigm called Co-teaching+. This paradigm naturally bridges "Update by Disagreement" strategy with Co-teaching that trains two deep neural networks, thus consists of disagreement-update step and cross-update step. In disagreement-update step, two networks predicts all data first, and feeds forward prediction disagreement data only. Then, in cross-update step, each network selects its small-loss data from such disagreement data, but back propagates the small-loss data by its peer network and updates itself parameters. Empirical results on noisy versions of MNIST, CIFAR10 and NEWS demonstrate that Co-teaching+ is much superior to the state-of-the-art methods in the robustness of trained deep models.

Question: How does disagreement benefit co-teaching?


Engineering Quality and Reliability in Technology-Assisted Review. The objective of technology-assisted review ("TAR") is to find as much relevant information as possible with reasonable effort. Quality is a measure of the extent to which a TAR method achieves this objective, while reliability is a measure of how consistently it achieves an acceptable result. We are concerned with how to define, measure, and achieve high quality and high reliability in TAR. When quality is defined using the traditional goal-post method of specifying a minimum acceptable recall threshold, the quality and reliability of a TAR method are both, by definition, equal to the probability of achieving the threshold. Assuming this definition of quality and reliability, we show how to augment any TAR method to achieve guaranteed reliability, for a quantifiable level of additional review effort. We demonstrate this result by augmenting the TAR method supplied as the baseline model implementation for the TREC 2015 Total Recall Track, measuring reliability and effort for 555 topics from eight test collections. While our empirical results corroborate our claim of guaranteed reliability, we observe that the augmentation strategy may entail disproportionate effort, especially when the number of relevant documents is low. To address this limitation, we propose stopping criteria for the model implementation that may be applied with no additional review effort, while achieving empirical reliability that compares favorably to the provably reliable method. We further argue that optimizing reliability according to the traditional goal-post method is inconsistent with certain subjective aspects of quality, and that optimizing a Taguchi quality loss function may be more apt.

Question: What is the quality of a TAR method?


Research on Credit Card Fraud Detection Model Based on Class Weighted Support Vector Machine. To deal with credit card fraud, a detection model based on Class Weighted Support Vector Machine was established. Due to large-scale and high dimensions of data, Principal Component Analysis (PCA) was adopted firstly to screen out the main factors from a great deal of indicative attributes in order to reduce the training dimension of SVM effectively. Then according to the characteristics of credit card transactions data which are imbalance, an improved SVM--Imbalance Class Weighted SVM (ICW-SVM) was adopted. With the application and verification in real dataset from bank, it is demonstrated that this model is more suitable for solving credit card fraud detection problem with higher precision and effective than others.

Question: What is the difference between SVM and SVM--Imbalance Class Weighted SVM?


Multi-document Summarization Using Support Vector Regression. Most multi-document summarization systems follow the extractive framework based on various features. While more and more sophisticated features are designed, the reasonable combination of features becomes a challenge. Usually the features are combined by a linear function whose weights are tuned manually. In this task, Support Vector Regression (SVR) model is used for automatically combining the features and scoring the sentences. Two important problems are inevitably involved. The first one is how to acquire the training data. Several automatic generation methods are introduced based on the standard reference summaries generated by human. Another indispensable problem in SVR application is feature selection, where various features will be picked out and combined into different feature sets to be tested. With the aid of DUC 2005 and 2006 data sets, comprehensive experiments are conducted with consideration of various SVR kernels and feature sets. Then the trained SVR model is used in the main task of DUC 2007 to get the extractive summaries.

Question: How to automatically generate training data?


Hierarchical interpretations for neural network predictions. Deep neural networks (DNNs) have achieved impressive predictive performance due to their ability to learn complex, non-linear relationships between variables. However, the inability to effectively visualize these relationships has led to DNNs being characterized as black boxes and consequently limited their applications. To ameliorate this problem, we introduce the use of hierarchical interpretations to explain DNN predictions through our proposed method, agglomerative contextual decomposition (ACD). Given a prediction from a trained DNN, ACD produces a hierarchical clustering of the input features, along with the contribution of each cluster to the final prediction. This hierarchy is optimized to identify clusters of features that the DNN learned are predictive. Using examples from Stanford Sentiment Treebank and ImageNet, we show that ACD is effective at diagnosing incorrect predictions and identifying dataset bias. Through human experiments, we demonstrate that ACD enables users both to identify the more accurate of two DNNs and to better trust a DNN's outputs. We also find that ACD's hierarchy is largely robust to adversarial perturbations, implying that it captures fundamental aspects of the input and ignores spurious noise.

Question: How to interpret a neural network?


Measuring the perceived quality of an AR-based learning application: a multidimensional model. Augmented reality (AR) technologies could enhance learning in several ways. The quality of an AR-based educational platform is a combination of key features that manifests in usability, usefulness, and enjoyment for the learner. In this paper, we present a multidimensional model to measure the quality of an AR-based application as perceived by students. The model is specified by a second-order factor (perceived quality) and three dimensions: ergonomic quality, learning quality, and hedonic quality. The purpose of this model is to embody previous research into a coherent framework for the evaluation of AR-based educational platforms and to provide guidance for researchers and practitioners. The model was empirically validated on a Chemistry learning scenario and the results confirm the importance of both the learning and hedonic quality. ARTICLE HISTORY Received 23 July 2014 Revised 2 December 2015 Accepted 9 December 2015

Question: How can we measure the quality of an AR-based learning application?


Comparing memory systems for chip multiprocessors. There are two basic models for the on-chip memory in CMP systems:hardware-managed coherent caches and software-managed streaming memory. This paper performs a direct comparison of the two modelsunder the same set of assumptions about technology, area, and computational capabilities. The goal is to quantify how and when they differ in terms of performance, energy consumption, bandwidth requirements, and latency tolerance for general-purpose CMPs. We demonstrate that for data-parallel applications, the cache-based and streaming models perform and scale equally well. For certain applications with little data reuse, streaming scales better due to better bandwidth use and macroscopic software prefetching. However, the introduction of techniques such as hardware prefetching and non-allocating stores to the cache-based model eliminates the streaming advantage. Overall, our results indicate that there is not sufficient advantage in building streaming memory systems where all on-chip memory structures are explicitly managed. On the other hand, we show that streaming at the programming model level is particularly beneficial, even with the cache-based model, as it enhances locality and creates opportunities for bandwidth optimizations. Moreover, we observe that stream programming is actually easier with the cache-based model because the hardware guarantees correct, best-effort execution even when the programmer cannot fully regularize an application's code.

Question: What is the difference between the cache-based and streaming memory models?


Effects of energy drinks on the cardiovascular system. Throughout the last decade, the use of energy drinks has been increasingly looked upon with caution as potentially dangerous due to their perceived strong concentration of caffeine aside from other substances such as taurine, guarana, and L-carnitine that are largely unknown to the general public. In addition, a large number of energy drink intoxications have been reported all over the world including cases of seizures and arrhythmias. In this paper, we focus on the effect of energy drinks on the cardiovascular system and whether the current ongoing call for the products' sales and regulation of their contents should continue.

Question: What is the effect of energy drinks on the cardiovascular system?


OPRM1 and EGFR contribute to skin pigmentation differences between Indigenous Americans and Europeans. Contemporary variation in skin pigmentation is the result of hundreds of thousands years of human evolution in new and changing environments. Previous studies have identified several genes involved in skin pigmentation differences among African, Asian, and European populations. However, none have examined skin pigmentation variation among Indigenous American populations, creating a critical gap in our understanding of skin pigmentation variation. This study investigates signatures of selection at 76 pigmentation candidate genes that may contribute to skin pigmentation differences between Indigenous Americans and Europeans. Analysis was performed on two samples of Indigenous Americans genotyped on genome-wide SNP arrays. Using four tests for natural selection—locus-specific branch length (LSBL), ratio of heterozygosities (lnRH), Tajima's D difference, and extended haplotype homozygosity (EHH)—we identified 14 selection-nominated candidate genes (SNCGs). SNPs in each of the SNCGs were tested for association with skin pigmentation in 515 admixed Indigenous American and European individuals from regions of the Americas with high ground-level ultraviolet radiation. In addition to SLC24A5 and SLC45A2, genes previously associated with European/non-European differences in skin pigmentation, OPRM1 and EGFR were associated with variation in skin pigmentation in New World populations for the first time.

Question: What genes are associated with skin pigmentation differences between Indigenous Americans and Europeans?


Comparing Clusterings - An Overview. As the amount of data we nowadays have to deal with becomes larger and larger, the methods that help us to detect structures in the data and to identify interesting subsets in the data become more and more important. One of these methods is clustering, i.e. segmenting a set of elements into subsets such that the elements in each subset are somehow "similiar" to each other and elements of different subsets are "unsimilar". In the literature we can find a large variety of clustering algorithms, each having certain advantages but also certain drawbacks. Typical questions that arise in this context comprise:

Question: What is a clustering algorithm?


Statecharts: A Visual Formalism for Complex Systems. We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we call statecharts, extend conventional state-transition diagrams with essentially three elements, dealing, respectively, with the notions of hierarchy, concurrency and communication. These transform the language of state diagrams into a highly structured and economical description language. Statecharts are thus compact and expressiv-small diagrams can express complex behavior-as well as compositional and modular. When coupled with the capabilities of computerized graphics, statecharts enable viewing the description at different levels of detail, and make even very large specifications manageable and comprehensible. In fact, we intend to demonstrate here that statecharts counter many of the objections raised against conventional state diagrams, and thus appear to render specification by diagrams an attractive and plausible approach. Statecharts can be used either as a stand-alone behavioral description or as part of a more general design methodology that deals also with the system's other aspects, such as functional decomposition and data-flow specification. We also discuss some practical experience that was gained over the last three years in applying the statechart formalism to the specification of a particularly complex system.

Question: What is a statechart?


Iterative unified clustering in big data. We propose a novel iterative unified clustering algorithm for data with both continuous and categorical variables, in the big data environment. Clustering is a well-studied problem and finds several applications. However, none of the big data clustering works discuss the challenge of mixed attribute datasets, with both categorical and continuous attributes. We study an application in the health care domain namely Case Based Reasoning (CBR), which refers to solving new problems based on solutions to similar past problems. This is particularly useful when there is a large set of clinical records with several types of attributes, from which similar patients need to be identified. We go one step further and include the genomic components of patient records to enhance the CBR discovery. Thus, our contributions in this paper spans across the big data algorithmic research and a key contribution to the domain of heath care information technology research. First, our clustering algorithm deals with both continuous and categorical variables in the data; second, our clustering algorithm is iterative where it finds the clusters which are not well formed and iteratively drills down to form well defined clusters at the end of the process; third we provide a novel approach to CBR across clinical and genomic data. Our research has implications for clinical trials and facilitating precision diagnostics in large and heterogeneous patient records. We present extensive experimental results to show the efficacy or our approach.

Question: What is the difference between a clustering algorithm and a clustering method?


Lightweight, High-Force Gripper Inspired by Chuck Clamping Devices. In this letter, we present a novel gripper, whose design was inspired by chuck clamping devices, for transferring heavy objects and assembling parts precisely in industrial applications. The developed gripper is lightweight (0.9 kg), can manipulate heavy payloads (over 23 kgf), and can automatically align its position and posture via a grasping motion. A fingertip design criterion is presented for the position alignment, while a control strategy is presented for the posture alignment. With one actuator, this gripper realized the above features. This letter describes the mathematical analyses and experiments used to validate these key metrics.

Question: How does this gripper work?


Conducting a meta-ethnography of qualitative literature: Lessons learnt. BACKGROUND Qualitative synthesis has become more commonplace in recent years. Meta-ethnography is one of several methods for synthesising qualitative research and is being used increasingly within health care research. However, many aspects of the steps in the process remain ill-defined.   DISCUSSION We utilized the seven stages of the synthesis process to synthesise qualitative research on adherence to tuberculosis treatment. In this paper we discuss the methodological and practical challenges faced; of particular note are the methods used in our synthesis, the additional steps that we found useful in clarifying the process, and the key methodological challenges encountered in implementing the meta-ethnographic approach. The challenges included shaping an appropriate question for the synthesis; identifying relevant studies; assessing the quality of the studies; and synthesising findings across a very large number of primary studies from different contexts and research traditions. We offer suggestions that may assist in undertaking meta-ethnographies in the future.   SUMMARY Meta-ethnography is a useful method for synthesising qualitative research and for developing models that interpret findings across multiple studies. Despite its growing use in health research, further research is needed to address the wide range of methodological and epistemological questions raised by the approach.

Question: What is meta-ethnography?


Survey of review spam detection using machine learning techniques. Online reviews are often the primary factor in a customer's decision to purchase a product or service, and are a valuable source of information that can be used to determine public opinion on these products or services. Because of their impact, manufacturers and retailers are highly concerned with customer feedback and reviews. Reliance on online reviews gives rise to the potential concern that wrongdoers may create false reviews to artificially promote or devalue products and services. This practice is known as Opinion (Review) Spam, where spammers manipulate and poison reviews (i.e., making fake, untruthful, or deceptive reviews) for profit or gain. Since not all online reviews are truthful and trustworthy, it is important to develop techniques for detecting review spam. By extracting meaningful features from the text using Natural Language Processing (NLP), it is possible to conduct review spam detection using various machine learning techniques. Additionally, reviewer information, apart from the text itself, can be used to aid in this process. In this paper, we survey the prominent machine learning techniques that have been proposed to solve the problem of review spam detection and the performance of different approaches for classification and detection of review spam. The majority of current research has focused on supervised learning methods, which require labeled data, a scarcity when it comes to online review spam. Research on methods for Big Data are of interest, since there are millions of online reviews, with many more being generated daily. To date, we have not found any papers that study the effects of Big Data analytics for review spam detection. The primary goal of this paper is to provide a strong and comprehensive comparative study of current research on detecting review spam using various machine learning techniques and to devise methodology for conducting further investigation.

Question: What is the difference between a spammer and a reviewer?


On Data Clustering Analysis: Scalability, Constraints, and Validation. Clustering is the problem of grouping data based on similarity. While this problem has attracted the attention of many researchers for many years, we are witnessing a resurgence of interest in new clustering techniques. In this paper we discuss some very recent clustering approaches and recount our experience with some of these algorithms. We also present the problem of clustering in the presence of constraints and discuss the issue of clustering validation.

Question: What is the problem of clustering in the presence of constraints?


Hybrid digital and analog beamforming design for large-scale MIMO systems. Large-scale multiple-input multiple-output (MIMO) systems enable high spectral efficiency by employing large antenna arrays at both the transmitter and the receiver of a wireless communication link. In traditional MIMO systems, full digital beamforming is done at the baseband; one distinct radio-frequency (RF) chain is required for each antenna, which for large-scale MIMO systems can be prohibitive from either cost or power consumption point of view. This paper considers a two-stage hybrid beamforming structure to reduce the number of RF chains for large-scale MIMO systems. The overall beamforming matrix consists of analog RF beamforming implemented using phase shifters and baseband digital beamforming of much smaller dimension. This paper considers precoder and receiver design for maximizing the spectral efficiency when the hybrid structure is used at both the transmitter and the receiver. On the theoretical front, bounds on the minimum number of transmit and receive RF chains that are required to realize the theoretical capacity of the large-scale MIMO system are presented. It is shown that the hybrid structure can achieve the same performance as the fully-digital beamforming scheme if the number of RF chains at each end is greater than or equal to twice the number of data streams. On the practical design front, this paper proposes a heuristic hybrid beamforming design strategy for the critical case where the number of RF chains is equal to the number of data streams, and shows that the performance of the proposed hybrid beamforming design can achieve spectral efficiency close to that of the fully-digital solution.

Question: What is the minimum number of RF chains required to realize the theoretical capacity of a large-scale MIMO system?


Intelligent accident identification system using GPS , GSM modem. Recently technological and population development, the usage of vehicles are rapidly increasing and at the same time the occurrence accident is also increased. Hence, the value of human life is ignored. No one can prevent the accident, but can save their life by expediting the ambulance to the hospital in time. A new vivid scheme called Intelligent Transportation System (ITS) is introduced. The objective of this scheme is to minimize the delay caused by traffic congestion and to provide the smooth flow of emergency vehicles. The concept of this scheme is to green the traffic signal in the path of ambulance automatically with the help of RF module. So that the ambulance can reach the spot in time and human life can be saved and the accident location is identified sends the accident location immediately to the main server. The main server finds the nearest ambulance to the accident zone and sends the exact accident location to the emergency vehicle. The control unit monitors the ambulance and provides the shortest path to the ambulance at the same time it controls the traffic light according to the ambulance location and thus arriving at the hospital safely. This scheme is fully automated, thus it locates the accident spot accurately, controls the traffic lights, provide the shortest path to reach the location and to the hospital in time.

Question: What is the objective of this scheme?


Unbiased scalable softmax optimization. Recent neural network and language models rely on softmax distributions with an extremely large number of categories. Since calculating the softmax normalizing constant in this context is prohibitively expensive, there is a growing literature of efficiently computable but biased estimates of the softmax. In this paper we propose the first unbiased algorithms for maximizing the softmax likelihood whose work per iteration is independent of the number of classes and datapoints (and no extra work is required at the end of each epoch). We show that our proposed unbiased methods comprehensively outperform the state-of-the-art on seven real world datasets.

Question: How to make a neural network unbiased?


The Role of Requirements Engineering Practices in Agile Development: An Empirical Study.

Question: What is the role of requirements engineering practices in agile development?


Multi-label Deep Regression and Unordered Pooling for Holistic Interstitial Lung Disease Pattern Detection. Holistically detecting interstitial lung disease (ILD) patterns from CT images is challenging yet clinically important. Unfortunately, most existing solutions rely on manually provided regions of interest, limiting their clinical usefulness. In addition, no work has yet focused on predicting more than one ILD from the same CT slice, despite the frequency of such occurrences. To address these limitations, we propose two variations of multi-label deep convolutional neural networks (CNNs). The first uses a deep CNN to detect the presence of multiple ILDs using a regression-based loss function. Our second variant further improves performance, using spatially invariant Fisher Vector encoding of the CNN feature activations. We test our algorithms on a dataset of 533 patients using five-fold cross-validation, achieving high area-under-curve (AUC) scores of 0.982, 0.972, 0.893 and 0.993 for Ground Glass, Reticular, Honeycomb and Emphysema, respectively. As such, our work represents an important step forward in providing clinically effective ILD detection.

Question: How does the deep CNN work?


Intrinsic frames of reference and egocentric viewpoints in scene recognition. Three experiments investigated the roles of intrinsic directions of a scene and observer's viewing direction in recognizing the scene. Participants learned the locations of seven objects along an intrinsic direction that was different from their viewing direction and then recognized spatial arrangements of three or six of these objects from different viewpoints. The results showed that triplets with two objects along the intrinsic direction (intrinsic triplets) were easier to recognize than triplets with two objects along the study viewing direction (non-intrinsic triplets), even when the intrinsic triplets were presented at a novel test viewpoint and the non-intrinsic triplets were presented at the familiar test viewpoint. The results also showed that configurations with the same three or six objects were easier to recognize at the familiar test viewpoint than other viewpoints. These results support and develop the model of spatial memory and navigation proposed by Mou, McNamara, Valiquette, and Rump [Mou, W., McNamara, T. P., Valiquiette C. M., & Rump, B. (2004). Allocentric and egocentric updating of spatial memories. Journal of Experimental Psychology: Learning, Memory, and Cognition, 30, 142-157].

Question: How do you recognize a scene?


Progressive muscle relaxation reduces migraine frequency and normalizes amplitudes of contingent negative variation (CNV). Central information processing, visible in evoked potentials like the contingent negative variation (CNV) is altered in migraine patients who exhibit higher CNV amplitudes and a reduced habituation. Both characteristics were shown to be normalized under different prophylactic migraine treatment options whereas Progressive Muscle Relaxation (PMR) has not yet been examined. We investigated the effect of PMR on clinical course and CNV in migraineurs in a quasi-randomized, controlled trial. Thirty-five migraine patients and 46 healthy controls were examined. Sixteen migraineurs and 21 healthy participants conducted a 6-week PMR-training with CNV-measures before and after as well as three months after PMR-training completion. The remaining participants served as controls. The clinical course was analyzed with two-way analyses of variance (ANOVA) with repeated measures. Pre-treatment CNV differences between migraine patients and healthy controls were examined with t-tests for independent measures. The course of the CNV-parameters was examined with three-way ANOVAs with repeated measures. After PMR-training, migraine patients showed a significant reduction of migraine frequency. Preliminary to the PMR-training, migraine patients exhibited higher amplitudes in the early component of the CNV (iCNV) and the overall CNV (oCNV) than healthy controls, but no differences regarding habituation. After completion of the PMR-training, migraineurs showed a normalization of the iCNV amplitude, but neither of the oCNV nor of the habituation coefficient. The results confirm clinical efficacy of PMR for migraine prophylaxis. The pre-treatment measure confirms altered cortical information processing in migraine patients. Regarding the changes in the iCNV after PMR-training, central nervous mechanisms of the PMR-effect are supposed which may be mediated by the serotonin

Question: What is the effect of PMR on migraine?


An approach for the economical evaluation of solar irrigation in Bangladesh. This paper represents a comparative picture of irrigation cost of different Bangladeshi crops for diesel, grid electricity and solar power based irrigation systems. The study has been conducted on 27 types of crops. All the data were collected about volume of water for those crops. Then three different types of pump (solar, diesel, electric) have been chosen with same power rating i.e. 5hp. Specific area covered for different crops are calculated furthermore from the attained water volumes. Then finally it has been calculated the 10 years cost in taka. The study found for the entire crops grid powered irrigation cost is minimum than solar powered irrigation cost because the later one is associated with huge primary investment.[12] The study also discovered irrigation with solar power for most of the crops such as onion, carrot, chill, tomato, maize, garlic, gourd, ginger, turmeric, pumpkin, cabbage, cauliflower, lady finger, banana, papaya and groundnut are not beneficial at all rather it costs very high among all the three types of irrigation system.[5] It is also evident that irrigation with solar power of certain crops like potato, cotton, soybean, sunflower, strawberry, lentil, mustard are very much lucrative compared to diesel powered irrigation.

Question: What is the cost of solar powered irrigation?


Using Recurrent Neural Networks for Slot Filling in Spoken Language Understanding. Semantic slot filling is one of the most challenging problems in spoken language understanding (SLU). In this paper, we propose to use recurrent neural networks (RNNs) for this task, and present several novel architectures designed to efficiently model past and future temporal dependencies. Specifically, we implemented and compared several important RNN architectures, including Elman, Jordan, and hybrid variants. To facilitate reproducibility, we implemented these networks with the publicly available Theano neural network toolkit and completed experiments on the well-known airline travel information system (ATIS) benchmark. In addition, we compared the approaches on two custom SLU data sets from the entertainment and movies domains. Our results show that the RNN-based models outperform the conditional random field (CRF) baseline by 2% in absolute error reduction on the ATIS benchmark. We improve the state-of-the-art by 0.5% in the Entertainment domain, and 6.7% for the movies domain.

Question: What is the state-of-the-art in spoken language understanding?


Automatic feature extraction for multiview 3D face recognition. Current 2D face recognition systems encounter difficulties in recognizing faces with large pose variations. Utilizing the pose-invariant features of 3D face data has the potential to handle multiview face matching. A feature extractor based on the directional maximum is proposed to estimate the nose tip location and the pose angle simultaneously. A nose profile model represented by subspaces is used to select the best candidates for the nose tip. Assisted by a statistical feature location model, a multimodal scheme is presented to extract eye and mouth corners. Using the automatic feature extractor, a fully automatic 3D face recognition system is developed. The system is evaluated on two databases, the MSU database (300 multiview test scans from 100 subjects) and the UND database (953 near frontal scans from 277 subjects). The automatic system provides recognition accuracy that is comparable to the accuracy of a system with manually labeled feature points

Question: How to extract features from 3D face data?


A comparative analysis of data center network architectures. Advances in data intensive computing and high performance computing facilitate rapid scaling of data center networks, resulting in a growing body of research exploring new network architectures that enhance scalability, cost effectiveness and performance. Understanding the tradeoffs between these different network architectures could not only help data center operators improve deployments, but also assist system designers to optimize applications running on top of them. In this paper, we present a comparative analysis of several well known data center network architectures using important metrics, and present our results on different network topologies. We show the tradeoffs between these topologies and present implications on practical data center implementations.

Question: What is a data center network?