Trust in school : a pathway to inhibit teacher burnout ?. Purpose – The purpose of this paper is to consider trust as an important relational source in schools by exploring whether trust lowers teacher burnout. The authors examine how trust relationships with different school parties such as the principal relate to distinct dimensions of teacher burnout. The authors further analyze whether school-level trust additionally influences burnout. In doing this, the authors account for other teacher and school characteristics. Design/methodology/approach – The authors use quantitative data gathered during the 2008-2009 school year from 673 teachers across 58 elementary schools in Flanders (i.e. the northern Dutch-speaking region of Belgium). Because teacher and school characteristics are simultaneously related to burnout, multilevel modeling is applied. Findings – Trust can act as a buffer against teacher burnout. Teachers' trust in students demonstrates the strongest association with burnout compared to trust in principals or colleagues. Exploring relationships of trust in distinct school parties with different burnout dimensions yield interesting additional insights such as the specific importance of teacher-principal trust for teachers' emotional exhaustion. Burnout is further an individual teacher matter to which school-level factors are mainly unrelated. Research limitations/implications – Principals fulfill an important role in inhibiting emotional exhaustion among teachers. They are advised to create a school atmosphere that is conducive for different kinds of trust relationships to develop. Actions to strengthen trust and inhibit teacher burnout are necessary, although further qualitative and longitudinal research is desirable. Originality/value – This paper offers a unique contribution by examining trust in different school parties as a relational buffer against teacher burnout. It indicates that principals can affect teacher burnout and prevent emotional exhausti

Question: What is the difference between trust and trustworthiness?


Tactical driver behavior prediction and intent inference: A review. Drawing upon fundamental research in human behavior prediction, recently there has been a research focus on how to predict driver behaviors. In this paper we review the field of driver behavior and intent prediction, with a specific focus on tactical maneuvers, as opposed to operational or strategic maneuvers. The aim of a driver behavior prediction system is to forecast the trajectory of the vehicle prior in real-time, which could allow a Driver Assistance System to compensate for dangerous or uncomfortable circumstances. This review provides insights into the scope of the problem, as well as the inputs, algorithms, performance metrics, and shortcomings in the state-of-the-art systems.

Question: What is the scope of the problem?


Plead or Pitch ? The Role of Language in Kickstarter Project Success. We present an analysis of over 26000 projects from Kickstarter, a popular crowdfunding platform. Specifically, we focus on the language used in project pitches, and how it impacts project success/failure. We train a series of discriminative models for binary success/failure prediction of projects with increasing complexity of linguistic features, and show that successful project pitches are, on average, more emotive, thoughtful and colloquial. In addition, we also present an analysis of pledge rewards in Kickstarter, and how these differ across categories and for successful versus unsuccessful projects.

Question: What is the average pledge reward for successful projects?


Big data framework for students' academic performance prediction: A systematic literature review. Big Data is becoming an integral part of education system worldwide, bringing in so much of prediction potential and therefore opportunities to improve learning and teaching methodologies. In fact, it has become the digital policy instrument for policy makers to make strategic decisions supported by big data analytics. This paper uses Systematic Literature Review (SLR) to establish a general overview and background in establishing gaps that need to be addressed in big data analytics for education landscape. A total of 59 research papers from 473 papers were chosen and analyzed. There is an increased trend in incorporating big data in education however, it is not sufficient and need more research in this area particularly predictive models and frameworks for educational settings.

Question: What is big data?


From Cloud to Fog Computing: A Review and a Conceptual Live VM Migration Framework. Fog computing, an extension of cloud computing services to the edge of the network to decrease latency and network congestion, is a relatively recent research trend. Although both cloud and fog offer similar resources and services, the latter is characterized by low latency with a wider spread and geographically distributed nodes to support mobility and real-time interaction. In this paper, we describe the fog computing architecture and review its different services and applications. We then discuss security and privacy issues in fog computing, focusing on service and resource availability. Virtualization is a vital technology in both fog and cloud computing that enables virtual machines (VMs) to coexist in a physical server (host) to share resources. These VMs could be subject to malicious attacks or the physical server hosting it could experience system failure, both of which result in unavailability of services and resources. Therefore, a conceptual smart pre-copy live migration approach is presented for VM migration. Using this approach, we can estimate the downtime after each iteration to determine whether to proceed to the stop-and-copy stage during a system failure or an attack on a fog computing node. This will minimize both the downtime and the migration time to guarantee resource and service availability to the end users of fog computing. Last, future research directions are outlined.

Question: What is a conceptual live migration approach?


Reduction of Fuzzy Rules and Membership Functions and Its Application to Fuzzy PI and PD Type Controllers. Fuzzy controller's design depends mainly on the rule base and membership functions over the controller's input and output ranges. This paper presents two different approaches to deal with these design issues. A simple and efficient approach; namely, Fuzzy Subtractive Clustering is used to identify the rule base needed to realize Fuzzy PI and PD type controllers. This technique provides a mechanism to obtain the reduced rule set covering the whole input/output space as well as membership functions for each input variable. But it is found that some membership functions projected from different clusters have high degree of similarity. The number of membership functions of each input variable is then reduced using a similarity measure. In this paper, the fuzzy subtractive clustering approach is shown to reduce 49 rules to 8 rules and number of membership functions to 4 and 6 for input variables (error and change in error) maintaining almost the same level of performance. Simulation on a wide range of linear and nonlinear processes is carried out and results are compared with fuzzy PI and PD type controllers without clustering in terms of several performance measures such as peak overshoot, settling time, rise time, integral absolute error (IAE) and integral-of-time multiplied absolute error (ITAE) and in each case the proposed schemes shows an identical performance.

Question: How to reduce fuzzy rules and membership functions?


Challenges of design and practical application of LTCC chip antennas. In this paper key challenges related to design, manufacturing and practical application of small LTCC antennas are described and discussed. A summary of the state of the art in LTCC antenna technology is presented and then the focus is put on limitations that have to be taken into account in the course of antenna design and manufacturing. Finally, some aspects related to practical application of LTCC antennas are discussed.

Question: What are the challenges of designing and manufacturing small LTCC antennas?


Norms for word lists that create false memories.. Roediger and McDermott (1995) induced false recall and false recognition for words that were not presented in lists. They had subjects study 24 lists of 15 words that were associates of a common word (called the critical target or critical lure) that was not presented in the list. False recall and false recognition of the critical target occurred frequently in response to these lists. The purpose of the current work was to provide a set of normative data for the lists Roediger and McDermott used and for 12 others developed more recently. We tested false recall and false recognition for critical targets from 36 lists. Despite the fact that all lists were constructed to produce false remembering, the diversity in their effectiveness was large--60% or more of subjects falsely recalled window and sleep following the appropriate lists, and false recognition for these items was greater than 80%. However, the list generated from king led to 10% false recall and 27% false recognition. Possible reasons for these wide differences in effectiveness of the lists are discussed. These norms serve as a useful benchmark for designing experiments about false recall and false recognition in this paradigm.

Question: What is the purpose of this study?


Current sensor in PCB technology. A novel DC/AC current sensor works on the fluxgate principle. The core in the form of a 7/10-mm ring made of electrodeposited permalloy is sandwiched in the middle of a printed circuit board (PCB), whereas the sensor excitation winding is also integrated in the copper layers of the PCB. To lower the sensor power consumption, the excitation winding was tuned by a parallel capacitor. The peak-peak/rms ratio of 5.2 was achieved for the excitation frequency of 25 kHz. The open-loop sensor has 100-mV/A sensitivity; the characteristics have a linearity error of 10% and hysteresis below 0.1% in the 1-A range.

Question: What is the current sensor in PCB technology?


A consensus-based approach for platooning with inter-vehicular communications. Automated and coordinated vehicles' driving (platooning) is gaining more and more attention today and it represents a challenging scenario heavily relying on wireless Inter-Vehicular Communication (IVC). In this paper, we propose a novel controller for vehicle platooning based on consensus. Opposed to current approaches where the logical control topology is fixed a priori and the control law designed consequently, we design a system whose control topology can be reconfigured depending on the actual network status. Moreover, the controller does not require the vehicles to be radar equipped and automatically compensates outdated information caused by network delays. We define the control law and analyze it in both analytical and simulative way, showing its robustness in different network scenarios. We consider three different wireless network settings: uncorrelated Bernoullian losses, correlated losses using a Gilbert-Elliott channel, and a realistic traffic scenario with interferences caused by other vehicles. Finally, we compare our strategy with another state of the art controller. The results show the ability of the proposed approach to maintain a stable string of vehicles even in the presence of strong interference, delays, and fading conditions, providing higher comfort and safety for platoon drivers.

Question: How to control a platoon of vehicles?


The Cultural Evolution of Religion. After almost a century of dwelling in two "non-overlapping magisteria," as Steven Jay Gould once put it, religion and science are coming together again. Long the exclusive province of the humanities and left outside of the mainstream of psychology and the behavioural sciences, religion is gaining scientific attention at a rapid pace. The dismantling of the taboos that have kept religion out of the scientific spotlight will take time (Dennett, 2006). Nevertheless, these are exciting times, and we can now safely say that religion—to paraphrase Chomsky about language—has been upgraded from scientific mystery to scientific puzzle (Boyer, 2001). This growing scientific interest promises to offer a naturalistic account for a deeply affecting aspect of human lives that is widespread in all known cultures in the world.

Question: What is the cultural evolution of religion?


Exploring Models and Data for Remote Sensing Image Caption Generation. Inspired by recent development of artificial satellite, remote sensing images have attracted extensive attention. Recently, notable progress has been made in scene classification and target detection. However, it is still not clear how to describe the remote sensing image content with accurate and concise sentences. In this paper, we investigate to describe the remote sensing images with accurate and flexible sentences. First, some annotated instructions are presented to better describe the remote sensing images considering the special characteristics of remote sensing images. Second, in order to exhaustively exploit the contents of remote sensing images, a large-scale aerial image data set is constructed for remote sensing image caption. Finally, a comprehensive review is presented on the proposed data set to fully advance the task of remote sensing caption. Extensive experiments on the proposed data set demonstrate that the content of the remote sensing image can be completely described by generating language descriptions. The data set is available at https://github.com/201528014227051/RSICD_optimal.

Question: What is the size of the data set?


A survey of information-centric networking. The information-centric networking (ICN) concept is a significant common approach of several future Internet research activities. The approach leverages in-network caching, multiparty communication through replication, and interaction models decoupling senders and receivers. The goal is to provide a network infrastructure service that is better suited to today¿s use (in particular. content distribution and mobility) and more resilient to disruptions and failures. The ICN approach is being explored by a number of research projects. We compare and discuss design choices and features of proposed ICN architectures, focusing on the following main components: named data objects, naming and security, API, routing and transport, and caching. We also discuss the advantages of the ICN approach in general.

Question: What is the difference between the ICN and the IP?


Implementing & Improvisation of K-means Clustering Algorithm. The clustering techniques are the most important part of the data analysis and k-means is the oldest and popular clustering technique used. The paper discusses the traditional K-means algorithm with advantages and disadvantages of it. It also includes researched on enhanced k-means proposed by various authors and it also includes the techniques to improve traditional K-means for better accuracy and efficiency. There are two area of concern for improving K-means; 1) is to select initial centroids and 2) by assigning data points to nearest cluster by using equations for calculating mean and distance between two data points. The time complexity of the proposed K-means technique will be lesser that then the traditional one with increase in accuracy and efficiency. The main purpose of the article is to proposed techniques to enhance the techniques for deriving initial centroids and the assigning of the data points to its nearest clusters. The clustering technique proposed in this paper is enhancing the accuracy and time complexity but it still needs some further improvements and in future it is also viable to include efficient techniques for selecting value for initial clusters(k). Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means. Introduction Clustering is a process of grouping data objects into disjointed clusters so that the data in the same cluster are similar, but data belonging to different cluster differ. A cluster is a collection of data object that are similar to one another are in same cluster and dissimilar to the objects are in other clusters [k-4]. At present the applications of computer technology in increasing rapidly which Unnati R. Raval et al, International Journal of Computer Science and Mobile Computing, Vol.5 Issue.5, May2016, pg. 191-203 © 2016, IJCSMC All Rights Reserved 1

Question: How to implement k-means clustering algorithm?


Evaluative Language Beyond Bags of Words: Linguistic Insights and Computational Applications. The study of evaluation, affect, and subjectivity is a multidisciplinary enterprise, including sociology, psychology, economics, linguistics, and computer science. A number of excellent computational linguistics and linguistic surveys of the field exist. Most surveys, however, do not bring the two disciplines together to show how methods from linguistics can benefit computational sentiment analysis systems. In this survey, we show how incorporating linguistic insights, discourse information, and other contextual phenomena, in combination with the statistical exploitation of data, can result in an improvement over approaches that take advantage of only one of these perspectives. We first provide a comprehensive introduction to evaluative language from both a linguistic and computational perspective. We then argue that the standard computational definition of the concept of evaluative language neglects the dynamic nature of evaluation, in which the interpretation of a given evaluation depends on linguistic and extra-linguistic contextual factors. We thus propose a dynamic definition that incorporates update functions. The update functions allow for different contextual aspects to be incorporated into the calculation of sentiment for evaluative words or expressions, and can be applied at all levels of discourse. We explore each level and highlight which linguistic aspects contribute to accurate extraction of sentiment. We end the review by outlining what we believe the future directions of sentiment analysis are, and the role that discourse and contextual information need to play.

Question: What is the future of sentiment analysis?


BERDS-BERkeley EneRgy Disaggregation Data Set. We first review some of the suggested methods for energy disaggregation. We then provide a real-life data set for researchers to help developing novel energy disaggregation algorithms. We also present a publicly available experimental data set captured from a typical building on the University of California, Berkeley campus.

Question: What is the energy disaggregation?


Pressure characteristics at the stump/socket interface in transtibial amputees using an adaptive prosthetic foot.. BACKGROUND The technological advances that have been made in developing highly functional prostheses are promising for very active patients but we do not yet know whether they cause an increase in biomechanical load along with possibly negative consequences for pressure conditions in the socket. Therefore, this study monitored the socket pressure at specific locations of the stump when using a microprocessor-controlled adaptive prosthetic ankle under different walking conditions.   METHODS Twelve unilateral transtibial amputees between 43 and 59 years of age were provided with the Proprio-Foot (Ossur) and underwent an instrumented 3D gait analysis in level, stair, and incline walking, including synchronous data capturing of socket pressure. Peak pressures and pressure time integrals (PTI) at three different locations were compared for five walking conditions with and without using the device's ankle adaptation mode.   FINDINGS Highest peak pressures of 2.4 k Pa/kg were found for incline ascent at the calf muscle as compared to 2.1 k Pa/kg in level walking with large inter-individual variance. In stair ascent a strong correlation was found between maximum knee moment and socket pressure. The most significant pressure changes relative to level walking were seen in ramp descent anteriorly towards the stump end, with PTI values being almost twice as high as those in level walking. Adapting the angle of the prosthesis on stairs and ramps modified the pressure data such that they were closer to those in level walking.   INTERPRETATION Pressure at the stump depends on the knee moments involved in each walking condition. Adapting the prosthetic ankle angle is a valuable means of modifying joint kinetics and thereby the pressure distribution at the stump. However, large inter-individual differences in local pressures underline the importance of individual socket

Question: What is the pressure distribution at the stump?


SketchInsight: Natural data exploration on interactive whiteboards leveraging pen and touch interaction. In this work, we advance research efforts in combining the casual sketching approach of whiteboards with the machine's computing power. We present SketchInsight, a system that applies the familiar and collaborative features of a whiteboard interface to the accurate data exploration capabilities of interactive visualizations. SketchInsight enables data analysis with more fluid interaction, allowing people to visually explore their data by drawing simple charts and directly manipulating them. In addition, we report results from a qualitative study conducted to evaluate user experience in exploring data with SketchInsight, expanding our understanding on how people use a pen- and touch-enabled digital whiteboard for data exploration. We also discuss the challenges in building a working system that supports data analytic capabilities with pen and touch interaction and freeform annotation.

Question: What is the size of the canadian military?


Full-wave design of H-plane contiguous manifold output multiplexers using the fictitious reactive load concept. In this paper, a new procedure for the design of contiguous band manifold output multiplexers in H-plane configuration is presented. Such a configuration eliminates the slots between the T-junctions and the filters allowing high power handling, as well as dramatically reducing the risk of multipactor. This paper pursues the division of the design into tasks with low computational effort. The approach comprises: 1) the singly terminated synthesis of the channel filters and their corresponding full-wave responses; 2) the manifold design using fictitious reactive loads simulating the phase response of every channel out of its corresponding band; and 3) the final full-wave optimization of the whole structure using the simulated-annealing method. In order to validate the above procedure, a five-channel Ku-band multiplexer has been designed, manufactured, and measured.

Question: What is the fictitious reactive load?


Current Methods in the Automatic Tissue Segmentation of 3D Magnetic Resonance Brain Images. Accurate segmentation of magnetic resonance (MR) images of the brain is of interest in the study of many brain disorders. In this paper, we provide a review of some of the current approaches in the tissue segmentation of MR brain images. We broadly divided current MR brain image segmentation algorithms into three categories: classificationbased, region-based, and contour-based, and discuss the advantages and disadvantages of these approaches. We also briefly review our recent work in this area. We show that by incorporating two key ideas into the conventional fuzzy cmeans clustering algorithm, we are able to take into account the local spatial context and compensate for the intensity nonuniformity (INU) artifact during the clustering process. We conclude this review by pointing to some possible future directions in this area.

Question: What is the difference between classification, region, and contour based segmentation?


Machine Learning to Balance the Load in Parallel Branch-and-Bound. We describe in this paper a new approach to parallelize branchand-bound on a certain number of processors. We propose to split the optimization of the original problem into the optimization of several subproblems that can be optimized separately with the goal that the amount of work that each processor carries out is balanced between the processors, while achieving interesting speedups. The main innovation of our approach consists in the use of machine learning to create a function able to estimate the difficulty (number of nodes) of a subproblem of the original problem. We also present a set of features that we developed in order to characterize the encountered subproblems. These features are used as input of the function learned with machine learning in order to estimate the difficulty of a subproblem. The estimates of the numbers of nodes are then used to decide how to partition the original optimization tree into a given number of subproblems, and to decide how to distribute them among the available processors. The experiments that we carry out show that our approach succeeds in balancing the amount of work between the processors, and that interesting speedups can be achieved with little effort.

Question: How to balance the load in parallel branch-and-bound?


X10: an object-oriented approach to non-uniform cluster computing. It is now well established that the device scaling predicted by Moore's Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the rate that had been sustained during the last two decades. As a result, future systems are rapidly moving from uniprocessor to multiprocessor configurations, so as to use parallelism instead of frequency scaling as the foundation for increased compute capacity. The dominant emerging multiprocessor structure for the future is a Non-Uniform Cluster Computing (NUCC) system with nodes that are built out of multi-core SMP chips with non-uniform memory hierarchies, and interconnected in horizontally scalable cluster configurations such as blade servers. Unlike previous generations of hardware evolution, this shift will have a major impact on existing software. Current OO language facilities for concurrent and distributed programming are inadequate for addressing the needs of NUCC systems because they do not support the notions of non-uniform data access within a node, or of tight coupling of distributed nodes.We have designed a modern object-oriented programming language, X10, for high performance, high productivity programming of NUCC systems. A member of the partitioned global address space family of languages, X10 highlights the explicit reification of locality in the form of places}; lightweight activities embodied in async, future, foreach, and ateach constructs; a construct for termination detection (finish); the use of lock-free synchronization (atomic blocks); and the manipulation of cluster-wide global data structures. We present an overview of the X10 programming model and language, experience with our reference implementation, and results from some initial productivity comparisons between the X10 and Java™ languages.

Question: What is a partitioned global address space?


Bayesian Neural Networks for Internet Traffic Classification. Internet traffic identification is an important tool for network management. It allows operators to better predict future traffic matrices and demands, security personnel to detect anomalous behavior, and researchers to develop more realistic traffic models. We present here a traffic classifier that can achieve a high accuracy across a range of application types without any source or destination host-address or port information. We use supervised machine learning based on a Bayesian trained neural network. Though our technique uses training data with categories derived from packet content, training and testing were done using features derived from packet streams consisting of one or more packet headers. By providing classification without access to the contents of packets, our technique offers wider application than methods that require full packet/payloads for classification. This is a powerful advantage, using samples of classified traffic to permit the categorization of traffic based only upon commonly available information

Question: What is a Bayesian neural network?


Design and development of a mobile crawling robot with novel halbach array based magnetic wheels. Higher efficiency and the safety of hull inspection can be achieved by replacing the conventional methods with modern crawling robots. This paper consists of detailed study of the design and development of a crawling robot with a novel permanent magnetic wheel based on Halbach magnetic array. The magnetic array and the wheel assembly were designed based on the magnetic simulation results. Maintaining the adequate adhesion force as well as the friction force of the wheels were considered in designing the wheels. The crawling robot is equipped with a steering system based on Ackermann steering method hence the steering angles are controlled by an algorithm and actuated using servo motors. The driving system of the robot is equipped with four geared stepper motors and they are controlled separately by the algorithm according to the inputs of the controller. The control architecture and the components used for the robot control system are explained. The operator can remotely control the robot and inspect the hull surface via the camera feed available in the HMI (Human Machine Interface) of the robot. The prototype of the crawling robot was tested in a similar environment and the test results are included in the paper.

Question: How to design a crawling robot?


Neural Message Passing for Quantum Chemistry. Supervised learning on molecules has incredible potential to be useful in chemistry, drug discovery, and materials science. Luckily, several promising and closely related neural network models invariant to molecular symmetries have already been described in the literature. These models learn a message passing algorithm and aggregation procedure to compute a function of their entire input graph. At this point, the next step is to find a particularly effective variant of this general approach and apply it to chemical prediction benchmarks until we either solve them or reach the limits of the approach. In this paper, we reformulate existing models into a single common framework we call Message Passing Neural Networks (MPNNs) and explore additional novel variations within this framework. Using MPNNs we demonstrate state of the art results on an important molecular property prediction benchmark; these results are strong enough that we believe future work should focus on datasets with larger molecules or more accurate ground truth labels.

Question: What is the best neural network for quantum chemistry?


Exploiting users' social relations to forward data in opportunistic networks: The HiBOp solution. Opportunistic networks, in which nodes opportunistically exploit any pair-wise contact to identify next hops towards the destination, are one of the most interesting technologies to support the pervasive networking vision. Opportunistic networks allow content sharing between mobile users without requiring any pre-existing Internet infrastructure, and tolerate partitions, long disconnections, and topology instability in general. In this paperwe propose a context-aware framework for routing and forwarding in opportunistic networks. The framework is general, and able to host various flavors of context-aware routing. In this work we also present a particular protocol, HiBOp, which, by exploiting the framework, learns and represents through context information, the users' behavior and their social relations, and uses this knowledge to drive the forwarding process. The comparison of HiBOp with reference to alternative solutions shows that a context-aware approach based on users' social relations turns out to be a very efficient solution for forwarding in opportunistic networks.We showperformance improvements over the reference solutions both in terms of resource utilization and in terms of user perceived QoS. © 2008 Elsevier B.V. All rights reserved.

Question: What is HiBOp?


Analyzing Sentiments Expressed on Twitter by UK Energy Company Consumers. Automatic sentiment analysis provides an effective way to gauge public opinion on any topic of interest. However, most sentiment analysis tools require a general sentiment lexicon to automatically classify sentiments or opinion in a text. One of the challenges presented by using a general sentiment lexicon is that it is insensitive to the domain since the scores assigned to the words are fixed. As a result, while one general sentiment lexicon might perform well in one domain, the same lexicon might perform poorly in another domain. Most sentiment lexica will need to be adjusted to suit the specific domain to which it is applied. In this paper, we present results of sentiment analysis expressed on Twitter by UK energy consumers. We optimised the accuracy of the sentiment analysis results by combining functions from two sentiment lexica. We used the first lexicon to extract the sentiment-bearing terms and negative sentiments since it performed well in detecting these. We then used a second lexicon to classify the rest of the data. Experimental results show that this method improved the accuracy of the results compared to the common practice of using only one lexicon.

Question: How to improve the accuracy of sentiment analysis?


Traffic engineering techniques for data center networks. Traffic engineering consists in improving the performance of the teleco-munication networks which is evaluated by a large number of criteria. The ultimate objective is to avoid congestion in the network by keeping its links from being overloaded. In large Ethernet networks with thousands of servers, such as data centers, improving the performance of the traditional switching protocols is a crucial but very challenging task due to an exploration in the size of solution space and the complexity. Thus, exact methods are inappropriate even for reasonable size networks. Local Search (LS) is a powerful method for solving computational optimization problems such as the Vertex Cover, Traveling Salesman, or Boolean Satisfiability. The advantage of LS for these problems is its ability to find an intelligent path from a low quality solution to a high quality one in a huge search space. In this thesis, we propose different approximate methods based on Local Search for solving the class of traffic engineering problems in data center networks that implement Spanning Tree Protocol and Multiple Spanning Tree Protocol. First, we tackle the minimization of the maximal link utilization in the Ethernet networks with one spanning tree. Next, we cope with data center networks containing many spanning trees. We then deal with the minimization of service disruption and the worst-case maximal link utilization in data center networks with many spanning trees. Last, we develop a novel design of multi-objective algorithms for solving the traffic engineering problems in large data centers by taking into account three objectives to be minimized: maximal link utilization, network total load and number of used links. Our schemes reduce significantly the size of the search space by releasing the dependence of the solutions from the link cost computation iii iv in order to obtain an intended spanning tree. We propose efficient in-cremental tec

Question: What is the difference between a spanning tree and a spanning tree protocol?


A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Over the last decade many metaheuristics have been applied t o the flowshop scheduling problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques. Some of these methods provide excellent effectiveness and e fficiency at the expense of being utterly complicated. In fact, several published meth ods require substantial implementation efforts, exploit problem specific speed-up techniqu es that cannot be applied to slight variations of the original problem, and often re-implement ations of these methods by other researchers produce results that are quite different from t he original ones. In this work we present a new iterated greedy algorithm that applies two pha ses iteratively, namedestruction, were some jobs are eliminated from the incumbent solution, andconstruction, where the eliminated jobs are reinserted into the sequence using t he well known NEH construction Corresponding author

Question: What is the well known NEH construction?


PCS/W-CDMA dual-band MMIC power amplifier with a newly proposed linearizing bias circuit. A personal communications service/wide-band code division multiple access (PCS/W-CDMA) dual-band monolithic microwave integrated circuit (MMIC) power amplifier with a single-chip MMIC and a single-path output matching network is demonstrated by adopting a newly proposed on-chip linearizer. The linearizer is composed of the base–emitter diode of an active bias transistor and a capacitor to provide an RF short at the base node of the active bias transistor. The linearizer enhances the linearity of the power amplifier effectively for both PCS and W-CDMA bands with no additional dc power consumption, and has negligible insertion power loss with almost no increase in die area. It improves the input 1-dB gain compression point by 18.5 (20) dB and phase distortion by 6.1 (12.42 ) at an output power of 28 (28) dBm for the PCS (W-CDMA) band while keeping the base bias voltage of the power amplifier as designed. A PCS and W-CDMA dual-band InGaP heterojunction bipolar transistor MMIC power amplifier with single input and output and no switch for band selection is embodied by implementing the linearizer and by designing the amplifier to have broad-band characteristics. The dual-band power amplifier exhibits an output power of 30 (28.5) dBm, power-added efficiency of 39.5% (36%), and adjacent channel power ratio of 46 ( 50) dBc at the output power of 28 (28) dBm under 3.4-V operation voltage for PCS (W-CDMA) applications.

Question: What is the difference between a PCS and W-CDMA dual-band MMIC power amplifier?


Organic Computing – Technical Systems for Survival in the Real World. ion is the selection and (possibly) coarsening (i.e. quantisation) of certain system characteristics (attributes, performance indicators, parameters) from the total set of system characteristics. The abstraction process comprises: • A simplification (Example: The colour Red is an abstraction, which neglects the different possible shades of Red, the wavelengths, the intensity etc.), • an aggregation (Example: 'Temperature' condenses the myriad of individual molecule movements in a gas volume into a single number.), • and consequently: loss of information. The opposite of abstraction is concretisation. It comprises: • gain of information, • detailing, • refinement, • disaggregation, • in engineering: the design process. 3.2.2 System Boundary Systems are defined by their system boundary, which makes a distinction between inside and outside possible (i.e. between self and non-self, see Sect. 4.1). When 3.2 What is a System? 87 Fig. 3.3 Trade-off between initial development cost and later adaptation cost systems are designed, we must choose where to place the boundary. This involves a consideration of cost (Fig. 3.3): A narrow boundary will reduce the cost for planning and development in the first place but bears the risk of a high effort in case a subsequent adaptation and extension of the system should be necessary. A wide system boundary reverses the cost curves. Apparently, the total cost minimum lies somewhere in the middle. 3.2.3 Some System Types and Properties Most systems are transient, i.e. they change over time. They are developed, assembled, modified, destroyed. Reactive systems react on inputs (events, signals, sensor data) by applying outputs (events, control signals, commands) to the environment. All open systems are reactive! In a more focused definition: Only systems reacting in real time (within a predefined time) are reactive systems. Such real-time systems are characterised by (1) t

Question: What is a reactive system?


Quantum-inspired evolutionary algorithm for a class of combinatorial optimization. This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principles of quantum computing, such as a quantum bit and superposition of states. Like other evolutionary algorithms, QEA is also characterized by the representation of the individual, the evaluation function, and the population dynamics. However, instead of binary, numeric, or symbolic representation, QEA uses a Q-bit, defined as the smallest unit of information, for the probabilistic representation and a Q-bit individual as a string of Q-bits. A Q-gate is introduced as a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, experiments are carried out on the knapsack problem, which is a well-known combinatorial optimization problem. The results show that QEA performs well, even with a small population, without premature convergence as compared to the conventional genetic algorithm.

Question: What is a quantum-inspired evolutionary algorithm?


A flexible unmanned aerial vehicle for precision agriculture. An unmanned aerial vehicle ("VIPtero") was assembled and tested with the aim of developing a flexible and powerful tool for site-specific vineyard management. The system comprised a six-rotor aerial platform capable of flying autonomously to a predetermined point in space, and of a pitch and roll compensated multi-spectral camera for vegetation canopy reflectance recording. Before the flight campaign, the camera accuracy was evaluated against high resolution ground-based measurements, made with a field spectrometer. Then, "VIPtero" performed the flight in an experimental vineyard in Central Italy, acquiring 63 multi-spectral images during 10 min of flight completed almost autonomously. Images were analysed and classified vigour maps were produced based on normalized difference vegetation index. The resulting vigour maps showed clearly crop heterogeneity conditions, in good agreement with ground-based observations. The system provided very promising results that encourage its development as a tool for precision agriculture application in small crops.

Question: What is a flexible unmanned aerial vehicle for precision agriculture?


Chord-PKI: A distributed trust infrastructure based on P2P networks. Many P2P applications require security services such as privacy, anonymity, authentication, and non-repudiation. Such services could be provided through a hierarchical Public Key Infrastructure. However, P2P networks are usually Internet-scale distributed systems comprised of nodes with undetermined trust level, thus making hierarchical solutions unrealistic. In this paper, we propose Chord-PKI, a distributed PKI architecture which is build upon the Chord overlay network, in order to provide security services for P2P applications. Our solution distributes the functionality of a PKI across the peers, by using threshold cryptography and proactive updating. We analyze the security of the proposed infrastructure and through simulations, we evaluate its performance for various scenarios of untrusted node distributions.

Question: What is the difference between a hierarchical PKI and a distributed PKI?


IoT Security: Ongoing Challenges and Research Opportunities. The Internet of Things (IoT) opens opportunities for wearable devices, home appliances, and software to share and communicate information on the Internet. Given that the shared data contains a large amount of private information, preserving information security on the shared data is an important issue that cannot be neglected. In this paper, we begin with general information security background of IoT and continue on with information security related challenges that IoT will encountered. Finally, we will also point out research directions that could be the future work for the solutions to the security challenges that IoT encounters.

Question: What is the background of IoT?


"Put-that-there": Voice and gesture at the graphics interface. Recent technological advances in connected-speech recognition and position sensing in space have encouraged the notion that voice and gesture inputs at the graphics interface can converge to provide a concerted, natural user modality.  The work described herein involves the user commanding simple shapes about a large-screen graphics display surface. Because voice can be augmented with simultaneous pointing, the free usage of pronouns becomes possible, with a corresponding gain in naturalness and economy of expression. Conversely, gesture aided by voice gains precision in its power to reference.

Question: How can voice and gesture be used to command graphics?


Disease Trajectory Maps. Medical researchers are coming to appreciate that many diseases are in fact complex, heterogeneous syndromes composed of subpopulations that express different variants of a related complication. Longitudinal data extracted from individual electronic health records (EHR) offer an exciting new way to study subtle differences in the way these diseases progress over time. In this paper, we focus on answering two questions that can be asked using these databases of longitudinal EHR data. First, we want to understand whether there are individuals with similar disease trajectories and whether there are a small number of degrees of freedom that account for differences in trajectories across the population. Second, we want to understand how important clinical outcomes are associated with disease trajectories. To answer these questions, we propose the Disease Trajectory Map (DTM), a novel probabilistic model that learns low-dimensional representations of sparse and irregularly sampled longitudinal data. We propose a stochastic variational inference algorithm for learning the DTM that allows the model to scale to large modern medical datasets. To demonstrate the DTM, we analyze data collected on patients with the complex autoimmune disease, scleroderma. We find that DTM learns meaningful representations of disease trajectories and that the representations are significantly associated with important clinical outcomes.

Question: What is a disease trajectory map?


Assessing attractiveness in online dating profiles. Online dating systems play a prominent role in the social lives of millions of their users, but little research has considered how users perceive one another through their personal profiles. We examined how users perceive attractiveness in online dating profiles, which provide their first exposure to a potential partner. Participants rated whole profiles and profile components on such qualities as how attractive, extraverted, and genuine and trustworthy they appeared. As past research in the psychology of attraction would suggest, the attractiveness and other qualities of the photograph were the strongest predictors of whole profile attractiveness, but they were not alone: the free-text component also played an important role in predicting overall attractiveness. In turn, numerous other qualities predicted the attractiveness ratings of photos and free-text components, albeit in different ways for men and women. The fixed-choice elements of a profile, however, were unrelated to attractiveness.

Question: How do people perceive attractiveness in online dating profiles?


Small Spherical Antennas Using Arrays of Electromagnetically Coupled Planar Elements. This letter presents the design, fabrication, and experimental characterization of small spherical antennas fabricated using arrays of non-interconnected planar conductor elements. The antennas are based upon spherical resonator structures with radiation Q-factors approaching $1.5\times$ the fundamental lower limit. The antennas are formed by coupling these resonators to an impedance-matched coplanar strip transmission line. Direct electrical connection between the feed and the antenna are made only to conductor elements coplanar with the transmission line, simplifying the fabrication process. The incident energy excites a collective resonant mode of the entire sphere (an electric dipole resonance), thereby inducing currents in each of the rings of the structure. The presence of the conductor elements outside of the feed plane is critical towards achieving the excellent bandwidth behavior observed here. The fabricated antennas have a normalized size $ka=0.54$ (where $k$ is the wavenumber and $a$ is the radius of the sphere) and exhibit high radiative efficiencies ($>$ 90%) and bandwidth performance near the fundamental limit for their size.

Question: What is the size of the antenna?


Alternative activation of macrophages. The classical pathway of interferon-γ-dependent activation of macrophages by T helper 1 (TH1)-type responses is a well-established feature of cellular immunity to infection with intracellular pathogens, such as Mycobacterium tuberculosis and HIV. The concept of an alternative pathway of macrophage activation by the TH2-type cytokines interleukin-4 (IL-4) and IL-13 has gained credence in the past decade, to account for a distinctive macrophage phenotype that is consistent with a different role in humoral immunity and repair. In this review, I assess the evidence in favour of alternative macrophage activation in the light of macrophage heterogeneity, and define its limits and relevance to a range of immune and inflammatory conditions.

Question: What is the alternative activation of macrophages?


Acoustical Sound Database in Real Environments for Sound Scene Understanding and Hands-Free Speech Recognition. This paper reports on a project for collection of the sound scene data. The sound scene data is necessary for studies such as sound source localization, sound retrieval, sound recognition and hands-free speech recognition in real acoustical environments. There are many kinds of sound scenes in real environments. The sound scene is denoted by sound sources and room acoustics. The number of combination of the sound sources, source positions and rooms is huge in real acoustical environments. However, the sound in the environments can be simulated by convolution of the isolated sound sources and impulse responses. As an isolated sound source, a hundred kinds of non-speech sounds and speech sounds are collected. The impulse responses are collected in various acoustical environments. In this paper, progress of our sound scene database project and application to environment sound recognition are described.

Question: What is the sound scene database?


Predicting the Structure of Cooking Recipes. Cooking recipes exist in abundance; but due to their unstructured text format, they are hard to study quantitatively beyond treating them as simple bags of words. In this paper, we propose an ingredientinstruction dependency tree data structure to represent recipes. The proposed representation allows for more refined comparison of recipes and recipe-parts, and is a step towards semantic representation of recipes. Furthermore, we build a parser that maps recipes into the proposed representation. The parser's edge prediction accuracy of 93.5% improves over a strong baseline of 85.7% (54.5% error reduction).

Question: How to predict the structure of cooking recipes?


Fundamental Limits of Wideband Localization— Part I: A General Framework. The availability of position information is of great importance in many commercial, public safety, and military applications. The coming years will see the emergence of location-aware networks with submeter accuracy, relying on accurate range measurements provided by wide bandwidth transmissions. In this two-part paper, we determine the fundamental limits of localization accuracy of wideband wireless networks in harsh multipath environments. We first develop a general framework to characterize the localization accuracy of a given node here and then extend our analysis to cooperative location-aware networks in Part II. In this paper, we characterize localization accuracy in terms of a performance measure called the squared position error bound (SPEB), and introduce the notion of equivalent Fisher information (EFI) to derive the SPEB in a succinct expression. This methodology provides insights into the essence of the localization problem by unifying localization information from individual anchors and that from a priori knowledge of the agent's position in a canonical form. Our analysis begins with the received waveforms themselves rather than utilizing only the signal metrics extracted from these waveforms, such as time-of-arrival and received signal strength. Hence, our framework exploits all the information inherent in the received waveforms, and the resulting SPEB serves as a fundamental limit of localization accuracy.

Question: What is the fundamental limits of localization accuracy?


Kernel Region ( a ) Top Level ( b ) Compute Unit Level ( c ) Processing Element Level. OpenCL FPGA has recently gained great popularity with emerging needs for workload acceleration such as Convolutional Neural Network (CNN), which is the most popular deep learning architecture in the domain of computer vision. While OpenCL enhances the code portability and programmability of FPGA, it comes at the expense of performance. The key challenge is to optimize the OpenCL kernels to efficiently utilize the flexible hardware resources in FPGA. Simply optimizing the OpenCL kernel code through various compiler options turns out insufficient to achieve desirable performance for both compute-intensive and data-intensive workloads such as convolutional neural networks . In this paper, we first propose an analytical performance model and apply it to perform an in-depth analysis on the resource requirement of CNN classifier kernels and available resources on modern FPGAs. We identify that the key performance bottleneck is the onchip memory bandwidth. We propose a new kernel design to effectively address such bandwidth limitation and to provide an optimal balance between computation, on-chip, and off-chip memory access. As a case study, we further apply these techniques to design a CNN accelerator based on the VGG model. Finally, we evaluate the performance of our CNN accelerator using an Altera Arria 10 GX1150 board. We achieve 866 Gop/s floating point performance at 370MHz working frequency and 1.79 Top/s 16-bit fixed-point performance at 385MHz. To the best of our knowledge, our implementation achieves the best power efficiency and performance density compared to existing work.

Question: What is the kernel design?


Pre-clinical antigenicity studies of an innovative multivalent vaccine for human visceral leishmaniasis. The notion that previous infection by Leishmania spp. in endemic areas leads to robust anti-Leishmania immunity, supports vaccination as a potentially effective approach to prevent disease development. Nevertheless, to date there is no vaccine available for human leishmaniasis. We optimized and assessed in vivo the safety and immunogenicity of an innovative vaccine candidate against human visceral leishmaniasis (VL), consisting of Virus-Like Particles (VLP) loaded with three different recombinant proteins (LJL143 from Lutzomyia longipalpis saliva as the vector-derived (VD) component, and KMP11 and LeishF3+, as parasite-derived (PD) antigens) and adjuvanted with GLA-SE, a TLR4 agonist. No apparent adverse reactions were observed during the experimental time-frame, which together with the normal hematological parameters detected seems to point to the safety of the formulation. Furthermore, measurements of antigen-specific cellular and humoral responses, generally higher in immunized versus control groups, confirmed the immunogenicity of the vaccine formulation. Interestingly, the immune responses against the VD protein were reproducibly more robust than those elicited against leishmanial antigens, and were apparently not caused by immunodominance of the VD antigen. Remarkably, priming with the VD protein alone and boosting with the complete vaccine candidate contributed towards an increase of the immune responses to the PD antigens, assessed in the form of increased ex vivo CD4+ and CD8+ T cell proliferation against both the PD antigens and total Leishmania antigen (TLA). Overall, our immunogenicity data indicate that this innovative vaccine formulation represents a promising anti-Leishmania vaccine whose efficacy deserves to be tested in the context of the "natural infection".

Question: What is the difference between a vaccine and a drug?


Commonsense Causal Reasoning Using Millions of Personal Stories. The personal stories that people write in their Internet weblogs include a substantial amount of information about the causal relationships between everyday events. In this paper we describe our efforts to use millions of these stories for automated commonsense causal reasoning. Casting the commonsense causal reasoning problem as a Choice of Plausible Alternatives, we describe four experiments that compare various statistical and information retrieval approaches to exploit causal information in story corpora. The top performing system in these experiments uses a simple co-occurrence statistic between words in the causal antecedent and consequent, calculated as the Pointwise Mutual Information between words in a corpus of millions of personal stories.

Question: How do we use millions of personal stories to do commonsense causal reasoning?


Singularity detection and processing with wavelets. Most of a signal information is often carried by irregular structures and transient phenomena. The mathematical characterization of singularities with Lipschitz exponents is explained. Theorems are reviewed that estimate local Lipschitz exponents of functions from the evolution across scales of their wavelet transform. It is then proven that the local maxima of the wavelet transform modulus detect the locations of irregular structures and provide numerical procedures to compute their Lipschitz exponents. The wavelet transform of singularities with fast oscillations have a particular behavior that is studied separately. The local frequency of such oscillations are measured from the wavelet transform modulus maxima. It has been shown numerically that oneand two-dimensional signals can be reconstructed, with a good approximation, from the local maxima of their wavelet transform modulus. As an application, an algorithm is developed that removes white noises from signals by analyzing the evolution of the wavelet transform maxima across scales. In two-dimensions, the wavelet transform maxima indicate the location of edges in images. The denoising algorithm is extended for image enhancement.

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


The Jalview Java alignment editor. Multiple sequence alignment remains a crucial method for understanding the function of groups of related nucleic acid and protein sequences. However, it is known that automatic multiple sequence alignments can often be improved by manual editing. Therefore, tools are needed to view and edit multiple sequence alignments. Due to growth in the sequence databases, multiple sequence alignments can often be large and difficult to view efficiently. The Jalview Java alignment editor is presented here, which enables fast viewing and editing of large multiple sequence alignments.

Question: What is the Jalview Java alignment editor?


An X-band to Ka-band SPDT switch using 200 nm SiGe HBTs. This paper presents the design and measured performance of an X-band to Ka-band SiGe HBT SPDT switch. The proposed SPDT switch was fabricated using a 200 nm, 150 GHz peak fT silicon-germanium (SiGe) heterojunction bipolar transistor (HBT) BiCMOS technology. The SPDT switch design uses diode-connected SiGe HBTs in a series-shunt configuration to improve the switch bandwidth and isolation. Between 8 and 40 GHz, this SPDT switch achieves an insertion loss of less than 4.3 dB, an isolation of more than 20.3 dB, and a return loss of more than 9 dB.

Question: What is the difference between an X-band and a Ka-band?


Investigations on speaker adaptation of LSTM RNN models for speech recognition. Recently Long Short-Term Memory (LSTM) Recurrent Neural Networks (RNN) acoustic models have demonstrated superior performance over deep neural networks (DNN) models in speech recognition and many other tasks. Although a lot of work have been reported on DNN model adaptation, very little has been done on LSTM model adaptation. In this paper we present our extensive studies of speaker adaptation of LSTM-RNN models for speech recognition. We investigated different adaptation methods combined with KL-divergence based regularization, where and which network component to adapt, supervised versus unsupervised adaptation and asymptotic analysis. We made a few distinct and important observations. In a large vocabulary speech recognition task, by adapting only 2.5% of the LSTM model parameters using 50 utterances per speaker, we obtained 12.6% WERR on the dev set and 9.1% WERR on the evaluation set over a strong LSTM baseline model.

Question: What is the asymptotic analysis?


Neural Networks and the Bias/Variance Dilemma. Feedforward neural networks trained by error backpropagation are examples of nonparametric regression estimators. We present a tutorial on nonparametric inference and its relation to neural networks, and we use the statistical viewpoint to highlight strengths and weaknesses of neural models. We illustrate the main points with some recognition experiments involving artificial data as well as handwritten numerals. In way of conclusion, we suggest that current-generation feedforward neural networks are largely inadequate for difficult problems in machine perception and machine learning, regardless of parallel-versus-serial hardware or other implementation issues. Furthermore, we suggest that the fundamental challenges in neural modeling are about representation rather than learning per se. This last point is supported by additional experiments with handwritten numerals.

Question: What is the bias/variance dilemma?


Fast local search and guided local search and their application to British Telecom's workforce scheduling problem. This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom's workforce scheduling problem, which is a hard real life problem. The effectiveness of FLS and GLS are demonstrated by the fact that they both out-perform all the methods applied to this problem so far, which include simulated annealing, genetic algorithms and constraint logic programming.

Question: What is the workforce scheduling problem?


Nutritional support for wound healing.. Healing of wounds, whether from accidental injury or surgical intervention, involves the activity of an intricate network of blood cells, tissue types, cytokines, and growth factors. This results in increased cellular activity, which causes an intensified metabolic demand for nutrients. Nutritional deficiencies can impede wound healing, and several nutritional factors required for wound repair may improve healing time and wound outcome. Vitamin A is required for epithelial and bone formation, cellular differentiation, and immune function. Vitamin C is necessary for collagen formation, proper immune function, and as a tissue antioxidant. Vitamin E is the major lipid-soluble antioxidant in the skin; however, the effect of vitamin E on surgical wounds is inconclusive. Bromelain reduces edema, bruising, pain, and healing time following trauma and surgical procedures. Glucosamine appears to be the rate-limiting substrate for hyaluronic acid production in the wound. Adequate dietary protein is absolutely essential for proper wound healing, and tissue levels of the amino acids arginine and glutamine may influence wound repair and immune function. The botanical medicines Centella asiatica and Aloe vera have been used for decades, both topically and internally, to enhance wound repair, and scientific studies are now beginning to validate efficacy and explore mechanisms of action for these botanicals. To promote wound healing in the shortest time possible, with minimal pain, discomfort, and scarring to the patient, it is important to explore nutritional and botanical influences on wound outcome.

Question: What is the effect of nutritional support on wound healing?


The Development and Validation of a Measure of Student Attitudes Toward Science , Technology , Engineering , and Math ( S-STEM ). Using an iterative design along with multiple methodological approaches and a large representative sample, this study presents reliability, validity, and fairness evidence for two surveys measuring student attitudes toward science, technology, engineering, and math (S-STEM) and interest in STEM careers for (a) 4ththrough 5th-grade students (Upper Elementary S-STEM) and (b) 6ththrough 12th-grade students (Middle/High S-STEM). Findings from exploratory factor analysis (EFA) and confirmatory factor analysis (CFA) suggested the use of a four-factor structure to measure student attitudes toward science, math, engineering/technology, and 21st century skills. Subject matter experts and literature reviews provided evidence of content validity. Reliability levels were high for both versions. Furthermore, both the Upper Elementary S-STEM and Middle/High S-STEM Surveys demonstrated evidence of configural, metric, and scalar invariance across grade levels, races/ethnicities, and genders. The findings support the validity of interpretations and inferences made from scores on the instruments' items and subscales.

Question: What is the difference between science, technology, engineering, and math?


Quantifying immersion in virtual reality. Virtual Reality (VR) has generated much excitement but little formal proof that it is useful. Because VR interfaces are difficult and expensive to build, the computer graphics community needs to be able to predict which applications will benefit from VR. In this paper, we show that users with a VR interface complete a search task faster than users with a stationary monitor and a hand-based input device. We placed users in the center of the virtual room shown in Figure 1 and told them to look for camouflaged targets. VR users did not do significantly better than desktop users. However, when asked to search the room and conclude if a target existed, VR users were substantially better at determining when they had searched the entire room. Desktop users took 41% more time, re-examining areas they had already searched. We also found a positive transfer of training from VR to stationary displays and a negative transfer of training from stationary displays to VR.

Question: How do you quantify immersion in virtual reality?


A survey of RDF data management systems. RDF is increasingly being used to encode data for the semantic web and data exchange. There have been a large number of works that address RDF data management following different approaches. In this paper we provide an overview of these works. This review considers centralized solutions (what are referred to as warehousing approaches), distributed solutions, and the techniques that have been developed for querying linked data. In each category, further classifications are provided that would assist readers in understanding the identifying characteristics of different approaches.

Question: What is the difference between a warehousing approach and a distributed approach?


An Efficient Algorithm for Local Distance Metric Learning. Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area has focused on finding metrics that simultaneously optimize compactness and separability in a global sense. Specifically, such distance metrics attempt to keep all of the data points in each class close together while ensuring that data points from different classes are separated. However, particularly when classes exhibit multimodal data distributions, these goals conflict and thus cannot be simultaneously satisfied. This paper proposes a Local Distance Metric (LDM) that aims to optimize local compactness and local separability. We present an efficient algorithm that employs eigenvector analysis and bound optimization to learn the LDM from training data in a probabilistic framework. We demonstrate that LDM achieves significant improvements in both classification and retrieval accuracy compared to global distance learning and kernel-based KNN. Introduction Distance metric learning has played a significant role in both statistical classification and information retrieval. For instance, previous studies (Goldberger et al. 2005; Weinberger, Blitzer, & Saul 2006) have shown that appropriate distance metrics can significantly improve the classification accuracy of the K Nearest Neighbor (KNN) algorithm. In multimedia information retrieval, several papers (He et al. 2003; 2004; Muller, Pun, & Squire 2004) have shown that appropriate distance metrics, learned either from labeled or unlabeled data, usually result in substantial improvements in retrieval accuracy compared to the standard Euclidean distance. Most of the work in distance metrics learning can be organized into the following two categories: • Unsupervised distance metric learning, or manifold learning. The main idea is to learn a underlying low-dimensional manifold where geometri

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


Graph Data Management and Mining: A Survey of Algorithms and Applications. Graph mining and management has become a popular area of research in recent years because of its numerous applications in a wide variety of practical fields, including computational biology, software bug localization and computer networking. Different applications result in graphs of different sizes and complexities. Correspondingly, the applications have different requirements for the underlying mining algorithms. In this chapter, we will provide a survey of different kinds of graph mining and management algorithms. We will also discuss a number of applications, which are dependent upon graph representations. We will discuss how the different graph mining algorithms can be adapted for different applications. Finally, we will discuss important avenues of future research

Question: What is graph data management and mining?


Secure cloud computing: Benefits, risks and controls. Cloud computing presents a new model for IT service delivery and it typically involves over-a-network, on-demand, self-service access, which is dynamically scalable and elastic, utilising pools of often virtualized resources. Through these features, cloud computing has the potential to improve the way businesses and IT operate by offering fast start-up, flexibility, scalability and cost efficiency. Even though cloud computing provides compelling benefits and cost-effective options for IT hosting and expansion, new risks and opportunities for security exploits are introduced. Standards, policies and controls are therefore of the essence to assist management in protecting and safeguarding systems and data. Management should understand and analyse cloud computing risks in order to protect systems and data from security exploits. The focus of this paper is on mitigation for cloud computing security risks as a fundamental step towards ensuring secure cloud computing environments.

Question: What are the benefits of cloud computing?


How to Work a Crowd: Developing Crowd Capital Through Crowdsourcing. Traditionally, the term 'crowd' was used almost exclusively in the context of people who selforganized around a common purpose, emotion, or experience. Today, however, firms often refer to crowds in discussions of how collections of individuals can be engaged for organizational purposes. Crowdsourcing–defined here as the use of information technologies to outsource business responsibilities to crowds–can now significantly influence a firm's ability to leverage previously unattainable resources to build competitive advantage. Nonetheless, many managers are hesitant to consider crowdsourcing because they do not understand how its various types can add value to the firm. In response, we explain what crowdsourcing is, the advantages it offers, and how firms can pursue crowdsourcing. We begin by formulating a crowdsourcing typology and show how its four categories—crowd voting, micro-task, idea, and solution crowdsourcing—can help firms develop 'crowd capital,' an organizational-level resource harnessed from the crowd. We then present a three-step process model for generating crowd capital. Step one includes important considerations that shape how a crowd is to be constructed. Step two outlines the capabilities firms need to develop to acquire and assimilate resources (e.g., knowledge, labor, funds) from the crowd. Step three outlines key decision areas that executives need to address to effectively engage crowds. 1. Crowds and Crowdsourcing Not too long ago, the term 'crowd' was used almost exclusively in the context of people who selforganized around a common purpose, emotion, or experience. Crowds were sometimes seen as a positive occurrence– for instance, when they formed for political rallies or to support sports teams— but were more often associated negatively with riots, a mob mentality, or looting. Under today's lens, they are viewed more positively (Wexler, 2011). Crowds have become useful! It

Question: What is crowdsourcing?


The Polar Parallel Coordinates Method for Time-Series Data Visualization. Parallel coordinates is a very important visualization method, but the dimensions it can express are limited by the length or width of the screen. In this paper, we present the polar parallel coordinates method. First, we define the polar parallel coordinates as the coordinate whose axes exist between the same degree and show the expression of the axis. We give the algorithms for the polar parallel coordinates generation and data shown in the polar parallel coordinates. Then we point out two feathers of the polar parallel coordinates. It can express more axes than parallel coordinates and reflect the characteristics of time-series data. Based on this, we compare the parallel coordinates with the polar parallel coordinates by the time-series data visualization.

Question: What is the polar parallel coordinates?


Analysis and modeling of bang-bang clock and data recovery circuits. A large-signal piecewise-linear model is proposed for bang-bang phase detectors that predicts characteristics of clock and data recovery circuits such as jitter transfer, jitter tolerance, and jitter generation. The results are validated by 1-Gb/s and 10-Gb/s CMOS prototypes using an Alexander phase detector and an LC oscillator.

Question: What is a bang-bang phase detector?


Experiences in Improving Risk Management Processes Using the Concepts of the Riskit Method. This paper describes experiences from two organizations that have used the Riskit method for risk management in their software projects. This paper presents the Riskit method, the organizations involved, case study designs, and findings from case studies. We focus on the experiences and insights gained through the application of the method in industrial context and propose some general conclusions based on the case studies.

Question: What is the riskit method?


Improving Storage System Reliability with Proactive Error Prediction. This paper proposes the use of machine learning techniques to make storage systems more reliable in the face of sector errors. Sector errors are partial drive failures, where individual sectors on a drive become unavailable, and occur at a high rate in both hard disk drives and solid state drives. The data in the affected sectors can only be recovered through redundancy in the system (e.g. another drive in the same RAID) and is lost if the error is encountered while the system operates in degraded mode, e.g. during RAID reconstruction. In this paper, we explore a range of different machine learning techniques and show that sector errors can be predicted ahead of time with high accuracy. Prediction is robust, even when only little training data or only training data for a different drive model is available. We also discuss a number of possible use cases for improving storage system reliability through the use of sector error predictors. We evaluate one such use case in detail: We show that the mean time to detecting errors (and hence the window of vulnerability to data loss) can be greatly reduced by adapting the speed of a scrubber based on error predictions.

Question: What is the difference between a hard disk drive and a solid state drive?


Paxos Made Simple. The Paxos algorithm, when presented in plain English, is very simple.

Question: What is the Paxos algorithm?


DIZK: A Distributed Zero Knowledge Proof System. Recently there has been much academic and industrial interest in practical implementations of zero knowledge proofs. These techniques allow a party to prove to another party that a given statement is true without revealing any additional information. In a Bitcoin-like system, this allows a payer to prove validity of a payment without disclosing the payment's details. Unfortunately, the existing systems for generating such proofs are very expensive, especially in terms of memory overhead. Worse yet, these systems are "monolithic", so they are limited by the memory resources of a single machine. This severely limits their practical applicability. We describe DIZK, a system that distributes the generation of a zero knowledge proof across machines in a compute cluster. Using a set of new techniques, we show that DIZK scales to computations of up to billions of logical gates (100× larger than prior art) at a cost of 10 μs per gate (100× faster than prior art). We then use DIZK to study various security applications.

Question: What is a distributed zero knowledge proof?


Guarded Commands, Nondeterminacy and Formal Derivation of Programs. So-called "guarded commands" are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown.

Question: What is a guarded command?


Learning to Doodle with Stroke Demonstrations and Deep Q-Networks. Doodling is a useful and common intelligent skill that people can learn and master. In this work, we propose a two-stage learning framework to teach a machine to doodle in a simulated painting environment via Stroke Demonstration and deep Q-learning (SDQ). The developed system, Doodle-SDQ, generates a sequence of pen actions to reproduce a reference drawing and mimics the behavior of human painters. In the first stage, it learns to draw simple strokes by imitating in supervised fashion from a set of strokeaction pairs collected from artist paintings. In the second stage, it is challenged to draw real and more complex doodles without ground truth actions; thus, it is trained with Qlearning. Our experiments confirm that (1) doodling can be learned without direct stepby-step action supervision and (2) pretraining with stroke demonstration via supervised learning is important to improve performance. We further show that Doodle-SDQ is effective at producing plausible drawings in different media types, including sketch and watercolor. A short video can be found at https://www.youtube.com/watch? v=-5FVUQFQTaE.

Question: How to learn to doodle?


Survey of fraud detection techniques. Due to the dramatic increase of fraud which results in loss of billions of dollars worldwide each year, several modern techniques in detecting fraud are continually developed and applied to many business fields. Fraud detection involves monitoring the behavior of populations of users in order to estimate, detect, or avoid undesirable behavior. Undesirable behavior is a broad term including delinquency, fraud, intrusion, and account defaulting. This paper presents a survey of current techniques used in credit card fraud detection, telecommunication fraud detection, and computer intrusion detection. The goal of this paper is to provide a comprehensive review of different techniques to detect frauds.

Question: What is the goal of this paper?


Emerging Principles of Gene Expression Programs and Their Regulation.. Many mechanisms contribute to regulation of gene expression to ensure coordinated cellular behaviors and fate decisions. Transcriptional responses to external signals can consist of many hundreds of genes that can be parsed into different categories based on kinetics of induction, cell-type and signal specificity, and duration of the response. Here we discuss the structure of transcription programs and suggest a basic framework to categorize gene expression programs based on characteristics related to their control mechanisms. We also discuss possible evolutionary implications of this framework.

Question: What is the basic framework of gene expression programs?


Vegetable price prediction using data mining classification technique. Each and every sector in this digital world is undergoing a dramatic change due to the influence of IT field. The agricultural sector needs more support for its development in developing countries like India. Price prediction helps the farmers and also Government to make effective decision. Based on the complexity of vegetable price prediction, making use of the characteristics of neural networks such as self-adapt, self-study and high fault tolerance, to build up the model of Back-propagation neural network to predict vegetable price. A prediction model was set up by applying the neural network. Taking tomato as an example, the parameters of the model are analyzed through experiment. At the end of the result of Back-propagation neural network shows absolute error percentage of monthly and weekly vegetable price prediction and analyze the accuracy percentage of the price prediction.

Question: What is the accuracy percentage of the price prediction?


A Rank-Switching, Open-Row DRAM Controller for Time-Predictable Systems. We introduce ROC, a Rank-switching, Open-row Controller for Double Data Rate Dynamic RAM (DDR DRAM). ROC is optimized for mixed-criticality multicore systems using modern DDR devices: compared to existing real-time memory controllers, it provides significantly lower worst case latency bounds for hard real-time tasks and supports throughput-oriented optimizations for soft real-time applications. The key to improved performance is an innovative rank-switching mechanism which hides the latency of write-read transitions in DRAM devices without requiring unpredictable request reordering. We further employ open row policy to take advantage of the data caching mechanism (row buffering) in each device. ROC provides complete timing isolation between hard and soft tasks and allows for compositional timing analysis over the number of cores and memory ranks in the system. We implemented and synthesized the ROC back end in Verilog RTL, and evaluated its performance on both synthetic tasks and a set of representative benchmarks.

Question: What is the difference between a rank-switching and a non-rank-switching controller?


Generating Haptic Textures with a Vibrotactile Actuator. Vibrotactile actuation is mainly used to deliver buzzing sensations. But if vibrotactile actuation is tightly coupled to users' actions, it can be used to create much richer haptic experiences. It is not well understood, however, how this coupling should be done or which vibrotactile parameters create which experiences. To investigate how actuation parameters relate to haptic experiences, we built a physical slider with minimal native friction, a vibrotactile actuator and an integrated position sensor. By vibrating the slider as it is moved, we create an experience of texture between the sliding element and its track. We conducted a magnitude estimation experiment to map how granularity, amplitude and timbre relate to the experiences of roughness, adhesiveness, sharpness and bumpiness. We found that amplitude influences the strength of the perceived texture, while variations in granularity and timbre create distinct experiences. Our study underlines the importance of action in haptic perception and suggests strategies for deploying such tightly coupled feedback in everyday devices.

Question: How do we create a haptic experience?


Mode Regularized Generative Adversarial. Although Generative Adversarial Networks achieve state-of-the-art results on a variety of generative tasks, they are regarded as highly unstable and prone to miss modes. We argue that these bad behaviors of GANs are due to the very particular functional shape of the trained discriminators in high dimensional spaces, which can easily make training stuck or push probability mass in the wrong direction, towards that of higher concentration than that of the data generating distribution. We introduce several ways of regularizing the objective, which can dramatically stabilize the training of GAN models. We also show that our regularizers can help the fair distribution of probability mass across the modes of the data generating distribution, during the early phases of training and thus providing a unified solution to the missing modes problem.

Question: What is the mode regularized generative adversarial network?


A fast restoration method for atmospheric turbulence degraded images using non-rigid image registration. In this paper, a fast image restoration method is proposed to restore the true image from an atmospheric turbulence degraded video. A non-rigid image registration algorithm is employed to register all the frames of the video to a reference frame and determine the shift maps. The First Register Then Average And Subtract-variant (FRTAASv) method is applied to correct the geometric distortion of the reference frame. A performance comparison is presented between the proposed restoration method and the earlier Minimum Sum of Squared Differences (MSSD) image registration based FRTAASv method, in terms of processing time and accuracy. Simulation results show that the proposed method requires shorter processing time to achieve the same geometric accuracy.

Question: What is the difference between the proposed restoration method and the earlier Minimum Sum of Squared Differences (MSSD) image registration based FRTAASv method?


Planning With Agents : An Efficient Approach Using Hierarchical Dynamic Decision Networks. To be useful in solving real world problems, agents need to be able to act in environments in which it may not be possible to be completely aware of the current state and where actions do not always work as planned. Additional complexity is added to the problem when one considers groups of agents working together. By casting the agent planning problem as a partially observable Markov decision problem (POMDP), optimal policies can be generated for partially observable and stochastic environments. Exact solutions, however, are notoriously difficult to find for problems of a realistic nature. We introduce a hierarchical decision network-based planning algorithm that can generate high quality plans during execution while demonstrating significant time savings. We also discuss how this approach is particularly applicable to planning in a multiagent environment as compared to other POMDP-based planning algorithms. We present experimental results comparing our algorithm with results obtained by current POMDP and hierarchical POMDP (HPOMDP) methods.

Question: What is a hierarchical decision network?


An improved analytical IGBT model for loss calculation including junction temperature and stray inductance. An improved analytical model suitable for IGBT modules is proposed in this paper to calculate the power losses with high accuracy and short calculation time. In this model, the parameters varying with junction temperature of the modules, such as di/dt in the turn-on period and dv/dt in the turn-off period, are discussed and derived according to several equivalent models. In addition, the parasitic inductance in the circuit including the emitter and collector inductance in the power circuits and the gate inductance in the driving loop are considered in this model. Based on this proposed model, the simulation switching waveforms of collector currents and collector-emitter voltages are provided to verify the model. Meanwhile, the calculated power losses are confirmed to be precise by comparing with measurement results.

Question: What is the analytical model for loss calculation?


Data Quality and Data Cleaning: An Overview. Data quality is a serious concern in any data-driven enterprise, often creating misleading findings during data mining, and causing process disruptions in operational databases. The manifestations of data quality problems can be very expensive- "losing" customers, "misplacing" billions of dollars worth of equipment, misallocated resources due to glitched forecasts, and so on. Solving data quality problems typically requires a very large investment of time and energy -- often 80% to 90% of a data analysis project is spent in making the data reliable enough that the results can be trusted.In this tutorial, we present a multi disciplinary approach to data quality problems. We start by discussing the meaning of data quality and the sources of data quality problems. We show how these problems can be addressed by a multidisciplinary approach, combining techniques from management science, statistics, database research, and metadata management. Next, we present an updated definition of data quality metrics, and illustrate their application with a case study. We conclude with a survey of recent database research that is relevant to data quality problems, and suggest directions for future research.

Question: What is a data quality problem?


Multi-task Gaussian Process Prediction. In this paper we investigate multi-task learning in the context of Gaussian Processes (GP). We propose a model that learns a shared covariance function on input-dependent features and a "free-form" covariance matrix over tasks. This allows for good flexibility when modelling inter-task dependencies while avoiding the need for large amounts of data for training. We show that under the assumption of noise-free observations and a block design, predictions for a given task only depend on its target values and therefore a cancellation of inter-task transfer occurs. We evaluate the benefits of our model on two practical applications: a compiler performance prediction problem and an exam score prediction task. Additionally, we make use of GP approximations and properties of our model in order to provide scalability to large data sets.

Question: What is a multi-task Gaussian Process?


Exploring Ways To Mitigate Sensor-Based Smartphone Fingerprinting. Modern smartphones contain motion sensors, such as accelerometers and gyroscopes. These sensors have many useful applications; however, they can also be used to uniquely identify a phone by measuring anomalies in the signals, which are a result from manufacturing imperfections. Such measurements can be conducted surreptitiously in the browser and can be used to track users across applications, websites, and visits. We analyze techniques to mitigate such device fingerprinting either by calibrating the sensors to eliminate the signal anomalies, or by adding noise that obfuscates the anomalies. To do this, we first develop a highly accurate fingerprinting mechanism that combines multiple motion sensors and makes use of (inaudible) audio stimulation to improve detection. We then collect measurements from a large collection of smartphones and evaluate the impact of calibration and obfuscation techniques on the classifier accuracy.

Question: How to mitigate sensor-based smartphone fingerprinting?


Long-Time Exposure to Violent Video Games Does Not Show Desensitization on Empathy for Pain: An fMRI Study. As a typical form of empathy, empathy for pain refers to the perception and appraisal of others' pain, as well as the corresponding affective responses. Numerous studies investigated the factors affecting the empathy for pain, in which the exposure to violent video games (VVGs) could change players' empathic responses to painful situations. However, it remains unclear whether exposure to VVG influences the empathy for pain. In the present study, in terms of the exposure experience to VVG, two groups of participants (18 in VVG group, VG; 17 in non-VVG group, NG) were screened from nearly 200 video game experience questionnaires. And then, the functional magnetic resonance imaging data were recorded when they were viewing painful and non-painful stimuli. The results showed that the perception of others' pain were not significantly different in brain regions between groups, from which we could infer that the desensitization effect of VVGs was overrated.

Question: Does long-time exposure to violent video games desensitize people to pain?


Empowerment-driven Exploration using Mutual Information Estimation. Exploration is a difficult challenge in reinforcement learning and is of prime importance in sparse reward environments. However, many of the state of the art deep reinforcement learning algorithms, that reply on epsilon-greedy exploration, fail on these environments. In such environments, empowerment can serve as an intrinsic reward signal to enable the agent to explore by maximizing the influence it has over the near future. We formulate empowerment as the channel capacity between actions and states and is calculated by estimating the mutual information between the actions and the following states. The mutual information is estimated using a Mutual Information Neural Estimator and a forward dynamics model. We demonstrate that an empowerment driven agent is able to improve significantly the score of a baseline DQN agent on the game of Montezuma's Revenge.

Question: What is empowerment?


Planning and Control for Collision-Free Cooperative Aerial Transportation. This paper presents planning and control synthesis for multiple aerial manipulators to transport a common object. Each aerial manipulator that consists of a hexacopter and a two-degree-of-freedom robotic arm is controlled by an augmented adaptive sliding mode controller based on a closed-chain robot dynamics. We propose a motion planning algorithm by exploiting rapidly exploring random tree star (RRT*) and dynamic movement primitives (DMPs). The desired path for each aerial manipulator is obtained by using RRT* with Bezier curve, which is designed to handle environmental obstacles, such as buildings or equipments. During aerial transportation, to avoid unknown obstacle, DMPs modify the trajectory based on the virtual leader–follower structure. By the combination of RRT* and DMPs, the cooperative aerial manipulators can carry a common object to keep reducing the interaction force between multiple robots while avoiding an obstacle in the unstructured environment. To validate the proposed planning and control synthesis, two experiments with multiple custom-made aerial manipulators are presented, which involve user-guided trajectory and RRT*-planned trajectory tracking in unstructured environments.Note to Practitioners—This paper presents a viable approach to autonomous aerial transportation using multiple aerial manipulators equipped with a multidegree-of-freedom robotic arm. Existing approaches for cooperative manipulation based on force decomposition or impedance-based control often require a heavy or expensive force/torque sensor. However, this paper suggests a method without using a heavy or expensive force/torque sensor based on closed-chain dynamics in joint space and rapidly exploring random tree star (RRT*) that generates the desired trajectory of aerial manipulators. Unlike conventional RRT*, in this paper, our method can also avoid an unknown moving obstacle during aerial transportatio

Question: How to avoid an unknown moving obstacle during aerial transportation?


PACRR: A Position-Aware Neural IR Model for Relevance Matching. In order to adopt deep learning for information retrieval, models are needed that can capture all relevant information required to assess the relevance of a document to a given user query. While previous works have successfully captured unigram term matches, how to fully employ position-dependent information such as proximity and term dependencies has been insufficiently explored. In this work, we propose a novel neural IR model named PACRR aiming at better modeling position-dependent interactions between a query and a document. Extensive experiments on six years' TREC Web Track data confirm that the proposed model yields better results under multiple benchmarks.

Question: What is a neural IR model?