Handwritten-Digit Recognition by Hybrid Convolutional Neural Network based on HfO2 Memristive Spiking-Neuron. Although there is a huge progress in complementary-metal-oxide-semiconductor (CMOS) technology, construction of an artificial neural network using CMOS technology to realize the functionality comparable with that of human cerebral cortex containing 1010–1011 neurons is still of great challenge. Recently, phase change memristor neuron has been proposed to realize a human-brain level neural network operating at a high speed while consuming a small amount of power and having a high integration density. Although memristor neuron can be scaled down to nanometer, integration of 1010–1011 neurons still faces many problems in circuit complexity, chip area, power consumption, etc. In this work, we propose a CMOS compatible HfO2 memristor neuron that can be well integrated with silicon circuits. A hybrid Convolutional Neural Network (CNN) based on the HfO2 memristor neuron is proposed and constructed. In the hybrid CNN, one memristive neuron can behave as multiple physical neurons based on the Time Division Multiplexing Access (TDMA) technique. Handwritten digit recognition is demonstrated in the hybrid CNN with a memristive neuron acting as 784 physical neurons. This work paves the way towards substantially shrinking the amount of neurons required in hardware and realization of more complex or even human cerebral cortex level memristive neural networks.

Question: How many neurons are required to recognize handwritten digits?


Feedforward neural network and ANFIS-based approaches to forecasting the off-cam energy characteristics of Kaplan turbine. The determination of the energy characteristics of a Kaplan hydraulic turbine is based on numerous measuring points during extensive and expensive experimental model tests in laboratory and on-site prototype tests at the hydropower plant. The results of those experimental researches are valuable insofar as they are detailed and comprehensive. In order to reduce the number of modes, in which the double-regulated turbine has to be tested with the aim of obtaining the off-cam energy characteristics in unknown operating modes, the application of contemporary artificial neural networks models is presented in the paper. The rationalization of the turbine test conditions may not be at the expense of the quality of the obtained characteristics. Two types of neural networks, feedforward neural networks and adaptive network-based fuzzy inference system with different partitioning methods, were used. The reliability of applied method was considered by analyzing and validating the predicted turbine energy parameters with the results obtained in the highly sophisticated laboratory.

Question: What is the off-cam energy characteristics of a Kaplan turbine?


A Reverse Approach to Named Entity Extraction and Linking in Microposts. In this paper, we present a pipeline for named entity extraction and linking that is designed specifically for noisy, grammatically inconsistent domains where traditional named entity techniques perform poorly. Our approach leverages a large knowledge base to improve entity recognition, while maintaining the use of traditional NER to identify mentions that are not co-referent with any entities in the knowledge base.

Question: What is a pipeline for named entity extraction and linking?


Modeling Botnet Propagation Using Time Zones. Time zones play an important and unexplored role in malware epidemics. To understand how time and location affect malware spread dynamics, we studied botnets, or large coordinated collections of victim machines (zombies) controlled by attackers. Over a six month period we observed dozens of botnets representing millions of victims. We noted diurnal properties in botnet activity, which we suspect occurs because victims turn their computers off at night. Through binary analysis, we also confirmed that some botnets demonstrated a bias in infecting regional populations. Clearly, computers that are offline are not infectious, and any regional bias in infections will affect the overall growth of the botnet. We therefore created a diurnal propagation model. The model uses diurnal shaping functions to capture regional variations in online vulnerable populations. The diurnal model also lets one compare propagation rates for different botnets, and prioritize response. Because of variations in release times and diurnal shaping functions particular to an infection, botnets released later in time may actually surpass other botnets that have an advanced start. Since response times for malware outbreaks is now measured in hours, being able to predict short-term propagation dynamics lets us allocate resources more intelligently. We used empirical data from botnets to evaluate the analytical model.

Question: What is the diurnal propagation model?


Generation of Panoramic View from 360 Degree Fisheye Images Based on Angular Fisheye Projection. this paper proposes a algorithm to generate the panoramic view from 360 ¡ãfisheye images based on angular fisheye projection model. Firstly, the image plane will be mapped to the view plane, the sphere plane, to obtain the coordinates of spherical points. Then use the angular fisheye projection model to get fisheye images' radius. Secondly, calculate the coordinates of fisheye images' points with the radius of fisheye images and the coordinates of spherical points. Finally, map the points of fisheye images to the target plane by the way of backward mapping. Experiments show that this algorithm is simple and fast, and can obtain the ideal images.

Question: How to generate panoramic view from 360 degree fisheye images based on angular fisheye projection model?


The turing test track of the 2012 Mario AI Championship: Entries and evaluation. The Turing Test Track of the Mario AI Championship focused on developing human-like controllers for a clone of the popular game Super Mario Bros. Competitors participated by submitting AI agents that imitate human playing style. This paper presents the rules of the competition, the software used, the voting interface, the scoring procedure, the submitted controllers and the recent results of the competition for the year 2012. We also discuss what can be learnt from this competition in terms of believability in platform games. The discussion is supported by a statistical analysis of behavioural similarities and differences among the agents, and between agents and humans. The paper is co-authored by the organizers of the competition (the first three authors) and the competitors.

Question: What is the turing test track of the 2012 Mario AI Championship?


Judo strategy. The competitive dynamics of Internet time.. Competition on the Internet is creating fierce battles between industry giants and small-scale start-ups. Smart start-ups can avoid those conflicts by moving quickly to uncontested ground and, when that's no longer possible, turning dominant players' strengths against them. The authors call this competitive approach judo strategy. They use the Netscape-Microsoft battles to illustrate the three main principles of judo strategy: rapid movement, flexibility, and leverage. In the early part of the browser wars, for instance, Netscape applied the principle of rapid movement by being the first company to offer a free stand-alone browser. This allowed Netscape to build market share fast and to set the market standard. Flexibility became a critical factor later in the browser wars. In December 1995, when Microsoft announced that it would "embrace and extend" competitors' Internet successes, Netscape failed to give way in the face of superior strength. Instead it squared off against Microsoft and even turned down numerous opportunities to craft deep partnerships with other companies. The result was that Netscape lost deal after deal when competing with Microsoft for common distribution channels. Netscape applied the principle of leverage by using Microsoft's strengths against it. Taking advantage of Microsoft's determination to convert the world to Windows or Windows NT, Netscape made its software compatible with existing UNIX systems. While it is true that these principles can't replace basic execution, say the authors, without speed, flexibility, and leverage, very few companies can compete successfully on Internet time.

Question: What is the competitive dynamics of Internet time?


Android Malware Detection Using Feature Fusion and Artificial Data. For the Android malware detection / classification anti-malware community has relied on traditional malware detection methods as a countermeasure. However, traditional detection methods are developed for detecting the computer malware, which is different from Android malware in structure and characteristics. Thus, they may not be useful for Android malware detection. Moreover, majority of suggested detection approaches may not be generalized and are incapable of detecting zero-day malware due to different reasons such as available data set with specific set of examples. Thus, their detection accuracy may be questionable. To address this problem, this paper presents a malware classification approach with a reliable detection accuracy and evaluate the approach using artificially generated examples. The suggested approach generates the signature profiles and behavior profiles of each application in the data set, which are further used as input for the classification task. For improving the detection accuracy, feature fusion of features from filter methods and wrapper method and algorithm fusion is investigated. Without affecting the detection accuracy, the optimal balance between real world examples and synthetic examples is also investigated. The experimental results suggest that both AUC and F1 can be obtained up to 0.94 for both known and unknown malware using original examples and synthetic examples.

Question: What is the difference between a filter and a wrapper?


Balancing traffic load in wireless networks with curveball routing. We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink pairs. When routing along shortest paths, the nodes that are centrally located forward a disproportionate amount of traffic. This translates into increased congestion and energy consumption. However, the maximum load can be decreased if the packets follow curved paths. We show that the optimum such routing scheme can be expressed in terms of geometric optics and computed by linear programming. We then propose a practical solution, which we call Curveball Routing which achieves results not much worse than the optimum.  We evaluate our solution at three levels of fidelity: a Java high-level simulator, the ns2 simulator, and the Intel Mirage Sensor Network Testbed. Simulation results using the high-level simulator show that our solution successfully avoids the crowded center of the network, and reduces the maximum load by up to 40%. At the same time, the increase of the expected path length is minimal, i.e., only 8% on average. Simulation results using the ns2 simulator show that our solution can increase throughput on moderately loaded networks by up to 15%, while testbed results show a reduction in peak energy usage by up to 25%. Our prototype suggests that our solution is easily deployable.

Question: How to balance traffic load in wireless networks?


Simple and Effective Multi-Paragraph Reading Comprehension. We introduce a method of adapting neural paragraph-level question answering models to the case where entire documents are given as input. Most current question answering models cannot scale to document or multi-document input, and naively applying these models to each paragraph independently often results in them being distracted by irrelevant text. We show that it is possible to significantly improve performance by using a modified training scheme that teaches the model to ignore non-answer containing paragraphs. Our method involves sampling multiple paragraphs from each document, and using an objective function that requires the model to produce globally correct output. We additionally identify and improve upon a number of other design decisions that arise when working with document-level data. Experiments on TriviaQA and SQuAD shows our method advances the state of the art, including a 10 point gain on TriviaQA.

Question: What is the state of the art in multi-paragraph reading comprehension?


Future trends of electrical propulsion and implications to ship design. Over the last 10 years the electrical propulsion fleet grew three times faster than the world fleet. This paper provides an overlook of the main drivers supporting this impressive growth and explores supporting drivers for future growth. The paper also explores two emerging technologies in electrical propulsion and distribution and how these influence ship design: DC distribution and energy storage. with a considerable level of accuracy which led to development of Dynamic Positioning (DP). Since electric propulsion is the most suitable solution to cope with the power fluctuation and redundancy requirements from DP systems, the development of offshore segment was the biggest driver for the development of electrical propulsion, reaching more than 50% of the units in 2013. Figure 2 Distribution of electrical propulsion fleet Dredgers – Dredging equipment requires a considerable amount of power and consequently the auxiliary power tends to be quite high, very often higher than the propulsion power. Therefore, the merit of electric propulsion is to reduce the overall installed power on board. Cruise – The main driver for electrical propulsion is space saving and space optimization. By shifting into electrical propulsion it is possible to reduce the space occupied by main propulsion systems and above all to place the different equipment in a way that the spaces reserved for passengers are maximized in terms of volume and quality. Nevertheless, the redundancy levels offered by electrical propulsion and its ability to meet the regulations on this segment have also contributed significantly for the adoption of this technology. Survey vessels – These vessels are often used to tow underwater survey devices for different applications, e.g. hydrographic, seismic, etc. Therefore, the lower underwater noise offered by electrical propulsion is very attractive. In addition, the load requirements of the different

Question: What is the main driver for the development of electrical propulsion?


Blur detection for digital images using wavelet transform. With the prevalence of digital cameras, the number of digital images increases quickly, which raises the demand for image quality assessment in terms of blur. Based on the edge type and sharpness analysis, using the Harr wavelet transform, a new blur detection scheme is proposed in this paper, which can determine whether an image is blurred or not and to what extent an image is blurred. Experimental results demonstrate the effectiveness of the proposed scheme.

Question: How to detect blur in digital images?


Pseudo random number generator and Hash function for embedded microprocessors. Embedded microprocessors are commonly used for future technologies such as Internet of Things(IoT), RFID and Wireless Sensor Networks(WSN). However, the microprocessors have limited computing power and storages so straight-forward implementation of traditional services on resource constrained devices is not recommenced. To overcome this problem, lightweight implementation techniques should be concerned for practical implementations. Among various requirements, security applications should be conducted on microprocessors for secure and robust service environments. In this paper, we presented a light weight implementation techniques for efficient Pseudo Random Number Generator(PRNG) and Hash function. To reduce memory consumption and accelerate performance, we adopted AES accelerator based implementation. This technique is firstly introduced in INDOCRYPT'12, whose idea exploits peripheral devices for efficient hash computations. With this technique, we presented block cipher based light-weight pseudo random number generator and simple hash function on embedded microprocessors.

Question: What is the idea of INDOCRYPT'12?


MANUFACTURE OF ARBITRARY CROSS-SECTION COMPOSITE HONEYCOMB CORES BASED ON ORIGAMI TECHNIQUES. In recent years, as space structures have become large and require higher accuracy, composite honeycombs, which can reduce weight and have low thermal expansion, are in increasing demand. As observed in the design of antenna reflectors and rocket bodies, both flat and 3D-shaped cores are used in this field. However, these special honeycombs have high manufacturing costs and limited applications. This study illustrates a new strategy to fabricate arbitrary cross-section honeycombs with applications of advanced composite materials. These types of honeycombs are usually manufactured from normal flat honeycombs by curving or carving, but the proposed method enables us to construct objective shaped honeycombs directly. The authors first introduce the concept of the kirigami honeycomb, which is made from single flat sheets and has periodical slits resembling origami. In previous studies, honeycombs having various shapes were made using this method, and were realized by only changing folding line diagrams (FLDs). In this study, these 3D kirigami honeycombs are generalized by numerical parameters and fabricated using a newly proposed FLD design method, which enables us to draw the FLD of arbitrary cross-section honeycombs. Next, the authors describe a method of applying this technique to advanced composite materials. Applying the partially soft composite techniques, folding lines are materialized by silicon rubber hinges on carbon fiber reinforced plastic. Complex FLD patterns are then printed using masks on carbon fabrics. Finally, these foldable composites that are cured in corrugated shapes in autoclaves are folded into honeycomb shapes, and some typical samples are shown with their FLDs. INTRODUCTION In the construction of aerospace components, lightweight, rigid, and strong honeycomb sandwich panels are required. In recent years, the use of composite materials has drastically

Question: What is the difference between a honeycomb and a honeycomb sandwich?


Impact of Corpora Quality on Neural Machine Translation. Large parallel corpora that are automatically obtained from the web, documents or elsewhere often exhibit many corrupted parts that are bound to negatively affect the quality of the systems and models that learn from these corpora. This paper describes frequent problems found in data and such data affects neural machine translation systems, as well as how to identify and deal with them. The solutions are summarised in a set of scripts that remove problematic sentences from input corpora.

Question: How to deal with corrupted corpora?


Automatic music transcription: challenges and future directions. Automatic music transcription is considered by many to be a key enabling technology in music signal processing. However, the performance of transcription systems is still significantly below that of a human expert, and accuracies reported in recent years seem to have reached a limit, although the field is still very active. In this paper we analyse limitations of current methods and identify promising directions for future research. Current transcription methods use general purpose models which are unable to capture the rich diversity found in music signals. One way to overcome the limited performance of transcription systems is to tailor algorithms to specific use-cases. Semi-automatic approaches are another way of achieving a more reliable transcription. Also, the wealth of musical scores and corresponding audio data now available are a rich potential source of training data, via forced alignment of audio to scores, but large scale utilisation of such data has yet to be attempted. Other promising approaches include the integration of information from multiple algorithms and different musical aspects.

Question: What is the canadian military?


A longitudinal study of the social and emotional predictors and consequences of cyber and traditional bullying victimisation. Few longitudinal studies have investigated how cyberbullying interacts with traditional bullying among young people, who are increasingly using online environments to seek information, entertainment and to socialise. This study aimed to identify the associations between the relative contribution of cyberbullying victimisation and traditional bullying victimisation on social and emotional antecedents and outcomes among adolescents. Participants were a cohort of 1,504 adolescents from 16 Australian schools followed from age 13 to 15 years. Adolescents experiencing social and emotional difficulties were more likely to be cyberbullied and traditionally bullied, than traditionally bullied only. Those targeted in both ways experienced more harm and stayed away from school more often than those traditionally bullied only. These findings suggest a high coexistence of cyber and traditional bullying behaviours and their antecedents, and higher levels of harm from a combination of these behaviours for adolescents over time. Future research should engage students as co-researchers to enhance school and parent strategies to support adolescents experiencing difficulties, and to reduce the likelihood of both cyber and traditional bullying.

Question: What is the difference between cyberbullying and traditional bullying?


Question: What is the name of the bridge management system?


Best basis-based wavelet packet entropy feature extraction and hierarchical EEG classification for epileptic detection. In this study, a hierarchical electroencephalogram (EEG) classification system for epileptic seizure detection is proposed. The system includes the following three stages: (i) original EEG signals representation by wavelet packet coefficients and feature extraction using the best basis-based wavelet packet entropy method, (ii) cross-validation (CV) method together with k-Nearest Neighbor (k-NN) classifier used in the training stage to hierarchical knowledge base (HKB) construction, and (iii) in the testing stage, computing classification accuracy and rejection rate using the top-ranked discriminative rules from the HKB. The data set is taken from a publicly available EEG database which aims to differentiate healthy subjects and subjects suffering from epilepsy diseases. Experimental results show the efficiency of our proposed system. The best classification accuracy is about 100% via 2-, 5-, and 10-fold cross-validation, which indicates the proposed method has potential in designing a new intelligent EEG-based assistance diagnosis system for early detection of the electroencephalographic changes. 2011 Elsevier Ltd. All rights reserved.

Question: How to classify epileptic seizures?


Use of Network Latency Profiling and Redundancy for Cloud Server Selection. As servers are placed in diverse locations in networked services today, it becomes vital to direct a client's request to the best server(s) to achieve both high performance and reliability. In this distributed setting, non-negligible latency and server availability become two major concerns, especially for highly-interactive applications. Profiling latencies and sending redundant data have been investigated as solutions to these issues. The notion of a cloudlet in mobile-cloud computing is also relevant in this context, as the cloudlet can supply these solution approaches on behalf of the mobile. In this paper, we investigate the effects of profiling and redundancy on latency when a client has a choice of multiple servers to connect to, using measurements from real experiments and simulations. We devise and test different server selection and data partitioning strategies in terms of profiling and redundancy. Our key findings are summarized as follows. First, intelligent server selection algorithms help find the optimal group of servers that minimize latency with profiling. Second, we can achieve good performance with relatively simple approaches using redundancy. Our analysis of profiling and redundancy provides insight to help designers determine how many servers and which servers to select to reduce latency.

Question: How to select the best server for a client?


Thompson Sampling for Dynamic Pricing. In this paper we apply active learning algorithms for dynamic pricing in a prominent e-commerce website. Dynamic pricing involves changing the price of items on a regular basis, and uses the feedback from the pricing decisions to update prices of the items. Most popular approaches to dynamic pricing use a passive learning approach, where the algorithm uses historical data to learn various parameters of the pricing problem, and uses the updated parameters to generate a new set of prices. We show that one can use active learning algorithms such as Thompson sampling to more efficiently learn the underlying parameters in a pricing problem. We apply our algorithms to a real e-commerce system and show that the algorithms indeed improve revenue compared to pricing algorithms that use passive learning.

Question: What is Thompson sampling?


A Survey of Context-Aware Mobile Computing Research. Context-aware computing is a mobile computing paradigm in which applications can discover and take advantage of contextual information (such as user location, time of day, nearby people and devices, and user activity). Since it was proposed about a decade ago, many researchers have studied this topic and built several context-aware applications to demonstrate the usefulness of this new technology. Context-aware applications (or the system infrastructure to support them), however, have never been widely available to everyday users. In this survey of research on context-aware systems and applications, we looked in depth at the types of context used and models of context information, at systems that support collecting and disseminating context, and at applications that adapt to the changing context. Through this survey, it is clear that context-aware research is an old but rich area for research. The difficulties and possible solutions we outline serve as guidance for researchers hoping to make context-aware computing a reality.

Question: What is context-aware computing?


FilterReg: Robust and Efficient Probabilistic Point-Set Registration using Gaussian Filter and Twist Parameterization. Probabilistic point-set registration methods have been gaining more attention for their robustness to noise, outliers and occlusions. However, these methods tend to be much slower than the popular iterative closest point (ICP) algorithms, which severely limits their usability. In this paper, we contribute a novel probabilistic registration method that achieves state-of-the-art robustness as well as substantially faster computational performance than modern ICP implementations. This is achieved using a rigorous yet computationally-efficient probabilistic formulation. Pointset registration is cast as a maximum likelihood estimation and solved using the EM algorithm. We show that with a simple augmentation, the E step can be formulated as a filtering problem, allowing us to leverage advances in efficient Gaussian filtering methods. We also propose a customized permutohedral filter [1] for improved efficiency while retaining sufficient accuracy for our task. Additionally, we present a simple and efficient twist parameterization that generalizes our method to the registration of articulated and deformable objects. For articulated objects, the complexity of our method is almost independent of the Degrees Of Freedom (DOFs), which makes it highly efficient even for high DOF systems. The results demonstrate the proposed method consistently outperforms many competitive baselines on a variety of registration tasks. The video demo and source code are available on our project page.

Question: What is the name of the filter?


VisComplete: Automating Suggestions for Visualization Pipelines. Building visualization and analysis pipelines is a large hurdle in the adoption of visualization and workflow systems by domain scientists. In this paper, we propose techniques to help users construct pipelines by consensus-automatically suggesting completions based on a database of previously created pipelines. In particular, we compute correspondences between existing pipeline subgraphs from the database, and use these to predict sets of likely pipeline additions to a given partial pipeline. By presenting these predictions in a carefully designed interface, users can create visualizations and other data products more efficiently because they can augment their normal work patterns with the suggested completions. We present an implementation of our technique in a publicly-available, open-source scientific workflow system and demonstrate efficiency gains in real-world situations.

Question: How can we build a visualization pipeline?


Arc-Length Parameterized Spline Curves for Real-Time Simulation. Parametric curves are frequently used in computer animation and virtual environments to control the movements of synthetic objects. In many of these applications it is essential to efficiently relate parameter values to the arc length of the curve. Current approaches to compute arc length or to construct an arc-length parameterized curve are impractical to use in real-time applications. This paper presents a simple and efficient technique to generate approximately arc-length parameterized spline curves that closely match spline curves typically used to model roads in high-fidelity driving simulators.

Question: How to generate an arc-length parameterized spline curve?


Multilinear Sparse Principal Component Analysis. In this brief, multilinear sparse principal component analysis (MSPCA) is proposed for feature extraction from the tensor data. MSPCA can be viewed as a further extension of the classical principal component analysis (PCA), sparse PCA (SPCA) and the recently proposed multilinear PCA (MPCA). The key operation of MSPCA is to rewrite the MPCA into multilinear regression forms and relax it for sparse regression. Differing from the recently proposed MPCA, MSPCA inherits the sparsity from the SPCA and iteratively learns a series of sparse projections that capture most of the variation of the tensor data. Each nonzero element in the sparse projections is selected from the most important variables/factors using the elastic net. Extensive experiments on Yale, Face Recognition Technology face databases, and COIL-20 object database encoded the object images as second-order tensors, and Weizmann action database as third-order tensors demonstrate that the proposed MSPCA algorithm has the potential to outperform the existing PCA-based subspace learning algorithms.

Question: What is the difference between multilinear PCA and multilinear sparse PCA?


Loneliness, social contacts and Internet addiction: A cross-lagged panel study. This study aims to examine the causal priority in the observed empirical relationships between Internet addiction and other psychological problems. A cross-lagged panel survey of 361 college students in Hong Kong was conducted. Results show that excessive and unhealthy Internet use would increase feelings of loneliness over time. Although depression had a moderate and positive bivariate relationship with Internet addiction at each time point, such a relationship was not significant in the cross-lagged analyses. This study also found that online social contacts with friends and family were not an effective alternative for offline social interactions in reducing feelings of loneliness. Furthermore, while an increase in face-to-face contacts could help to reduce symptoms of Internet addiction, this effect may be neutralized by the increase in online social contacts as a result of excessive Internet use. Taken as a whole, findings from the study show a worrisome vicious cycle between loneliness and Internet addiction. 2013 Elsevier Ltd. All rights reserved.

Question: How does loneliness affect Internet addiction?


: Android Deobfuscation via " Big Code ". This work presents a new approach for deobfuscating Android APKs based on probabilistic learning of large code bases (termed "Big Code"). The key idea is to learn a probabilistic model over thousands of non-obfuscated Android applications and to use this probabilistic model to deobfuscate new, unseen Android APKs. The concrete focus of the paper is on reversing layout obfuscation, a popular transformation which renames key program elements such as classes, packages and methods, thus making it difficult to understand what the program does. Concretely, the paper: (i) phrases the layout deobfuscation problem of Android APKs as structured prediction in a probabilistic graphical model, (ii) instantiates this model with a rich set of features and constraints that capture the Android setting, ensuring both semantic equivalence and high prediction accuracy, and (iii) shows how to leverage powerful inference and learning algorithms to achieve overall precision and scalability of the probabilistic predictions. We implemented our approach in a tool called DeGuard and used it to: (i) reverse the layout obfuscation performed by the popular ProGuard system on benign, open-source applications, (ii) predict third-party libraries imported by benign APKs (also obfuscated by ProGuard), and (iii) rename obfuscated program elements of Android malware. The experimental results indicate that DeGuard is practically effective: it recovers 79.1% of the program element names obfuscated with ProGuard, it predicts third-party libraries with accuracy of 91.3%, and it reveals string decoders and classes that handle sensitive data in Android malware.

Question: What is the name of the tool?


Discovering Temporal Retweeting Patterns for Social Media Marketing Campaigns. Social media has become one of the most popular marketing channels for many companies, which aims at maximizing their influence by various marketing campaigns conducted from their official accounts on social networks. However, most of these marketing accounts merely focus on the contents of their tweets. Less effort has been made on understanding tweeting time, which is a major contributing factor in terms of attracting customers' attention and maximizing the influence of a social marketing campaign. To that end, in this paper, we provide a focused study of temporal retweeting patterns and their influence on social media marketing campaigns. Specifically, we investigate the users' retweeting patterns by modeling their retweeting behaviors as a generative process, which considers temporal, social, and topical factors. Moreover, we validate the predictive power of the model on the dataset collected from Sina Weibo, the most popular micro blog platform in China. By discovering the temporal retweeting patterns, we analyze the temporal popular topics and recommend tweets to users in a time-aware manner. Finally, experimental results show that the proposed algorithm outperforms other baseline methods. This model is applicable for companies to conduct their marketing campaigns at the right time on social media.

Question: What is the most popular micro blog platform in China?


An Expressive (Zero-Knowledge) Set Accumulator. We present a new construction of an expressive set accumulator. Unlike existing cryptographic accumulators, ours provides succinct proofs for a large collection of operations over accumulated sets, including intersection, union, set difference, SUM, COUNT, MIN, MAX, and RANGE, as well as arbitrary nestings of the above. We also show how to extend our accumulator to be zero-knowledge. The security of our accumulator is based on extractability assumptions and other assumptions that hold in the generic group model. Our construction has asymptotically optimal verification complexity and proof size, constant update complexity, and public verifiability/updatability—namely, any client who knows the public key and the last accumulator value can verify the supported operations and update the accumulator. The expressiveness of our accumulator comes at the cost of quadratic prover time. However, we show that the cryptographic operations involved are cheap compared to those incurred by generic approaches (e.g., SNARKs) that are equally expressive: our prover runs faster for sets of up to 5 million items. Our accumulator serves as a powerful cryptographic tool with many applications. For example, it can be applied to efficiently support verification of a rich collection of SQL queries when used as a drop-in replacement in existing verifiable database systems (e.g., IntegriDB, CCS 2015).

Question: What is the expressive power of the zero-knowledge accumulator?


Container Port Performance Measurement and Comparison Leveraging Ship GPS Traces and Maritime Open Data. Container ports are generally measured and compared using performance indicators such as container throughput and facility productivity. Being able to measure the performance of container ports quantitatively is of great importance for researchers to design models for port operation and container logistics. Instead of relying on the manually collected statistical information from different port authorities and shipping companies, we propose to leverage the pervasive ship GPS traces and maritime open data to derive port performance indicators, including ship traffic, container throughput, berth utilization, and terminal productivity. These performance indicators are found to be directly related to the number of container ships arriving at the terminals and the number of containers handled at each ship. Therefore, we propose a framework that takes the ships' container-handling events at terminals as the basis for port performance measurement. With the inferred port performance indicators, we further compare the strengths and weaknesses of different container ports at the terminal level, port level, and region level, which can potentially benefit terminal productivity improvement, liner schedule optimization, and regional economic development planning. In order to evaluate the proposed framework, we conduct extensive studies on large-scale real-world GPS traces of container ships collected from major container ports worldwide through the year, as well as various maritime open data sources concerning ships and ports. Evaluation results confirm that the proposed framework not only can accurately estimate various port performance indicators but also effectively produces port comparison results such as port performance ranking and port region comparison.

Question: How many container ships are there in the world?


Elementary Siphons of Petri Nets and Deadlock Control in FMS. For responsiveness, in the Petri nets theory framework deadlock prevention policies based elementary siphons control are often utilized to deal with deadlocks caused by the sharing of resources in flexible manufacturing system (FMS) which is developing the theory of efficient strict minimal siphons of an S3PR. Analyzer of Petri net models and their P-invariant analysis, and deadlock control are presented as tools for modelling, efficiency structure analysis, control, and investigation of the FMSs when different policies can be implemented for the deadlock prevention. We are to show an effective deadlock prevention policy of a special class of Petri nets namely elementary siphons. As well, both structural analysis and reachability graph analysis and simulation are used for analysis and control of Petri nets. This work is successfully applied Petri nets to deadlock analysis using the concept of elementary siphons, for design of supervisors of some supervisory control problems of FMS and simulation of Petri net tool with MATLAB.

Question: What is the difference between a siphon and a deadlock?


A hyper-heuristic evolutionary algorithm for automatically designing decision-tree algorithms. Decision tree induction is one of the most employed methods to extract knowledge from data, since the representation of knowledge is very intuitive and easily understandable by humans. The most successful strategy for inducing decision trees, the greedy top-down approach, has been continuously improved by researchers over the years. This work, following recent breakthroughs in the automatic design of machine learning algorithms, proposes a hyper-heuristic evolutionary algorithm for automatically generating decision-tree induction algorithms, named HEAD-DT. We perform extensive experiments in 20 public data sets to assess the performance of HEAD-DT, and we compare it to traditional decision-tree algorithms such as C4.5 and CART. Results show that HEAD-DT can generate algorithms that significantly outperform C4.5 and CART regarding predictive accuracy and F-Measure.

Question: What is a hyper-heuristic evolutionary algorithm?


An Efficient Character-Level Neural Machine Translation. Neural machine translation aims at building a single large neural network that can be trained to maximize translation performance. The encoder-decoder architecture with an attention mechanism achieves a translation performance comparable to the existing state-of-the-art phrase-based systems on the task of English-to-French translation. However, the use of large vocabulary becomes the bottleneck in both training and improving the performance. In this paper, we propose an efficient architecture to train a deep character-level neural machine translation by introducing a decimator and an interpolator. The decimator is used to sample the source sequence before encoding while the interpolator is used to resample after decoding. Such a deep model has two major advantages. It avoids the large vocabulary issue radically; at the same time, it is much faster and more memory-efficient in training than conventional character-based models. More interestingly, our model is able to translate the misspelled word like human beings.

Question: What is the architecture of neural machine translation?


Developing a data quality framework for asset management in engineering organisations. Data Quality (DQ) is seen as critical to effective business decision-making. However, maintaining DQ is often acknowledged as problematic. Asset data is the key enabler in gaining control of assets. The quality asset data provides the foundation for effective Asset Management (AM). Researches have indicated that achieving AM DQ is the key challenge engineering organisations face today. This paper investigates the DQ issues emerging from the unique nature of engineering AM data. It presents an exploratory research of a large scale national-wide DQ survey on how Australian engineering organisations address DQ issues, and proposes an AM specific DQ framework.

Question: What is the key challenge engineering organisations face today?


A comparative study of differential evolution variants for global optimization. In this paper, we present an empirical comparison of some Differential Evolution variants to solve global optimization problems. The aim is to identify which one of them is more suitable to solve an optimization problem, depending on the problem's features and also to identify the variant with the best performance, regardless of the features of the problem to be solved. Eight variants were implemented and tested on 13 benchmark problems taken from the specialized literature. These variants vary in the type of recombination operator used and also in the way in which the mutation is computed. A set of statistical tests were performed in order to obtain more confidence on the validity of the results and to reinforce our discussion. The main aim is that this study can help both researchers and practitioners interested in using differential evolution as a global optimizer, since we expect that our conclusions can provide some insights regarding the advantages or limitations of each of the variants studied.

Question: Which variant is the best?


Autonomous Indoor Robot Navigation Using Sketched Maps and Routes. Hand drawn sketches are natural means by which a high level description of an environment can be provided. They can be exploited to impart coarse prior information about the scene to a robot, thereby enabling it to perform autonomous navigation and exploration when a full metrical description of the scene is not available beforehand. In this paper, we present a navigation system supplemented by a tablet interface that allows a user to sketch a rough map of an indoor environment and a desired trajectory for the robot to follow. We propose a novel theoretical framework for sketch interpretation based upon the manifold formalism in which associations between the sketch and the real world are modeled as local deformation of a suitable metric manifold. We also present empirical results from experimental evaluations of our approach in real world scenarios both from the perspective of the navigation capability and the usability of the interface.

Question: How to interpret a sketch?


Understanding the determinants of business intelligence system adoption stages: An empirical study of SMEs. Although business intelligence systems (BIS) adoption research has progressed considerably since its early inceptions, our understanding of the influence of BIS determinants across different adoption stages remains limited. In response, we develop and empirically test a conceptual model for assessing the determinants of BIS diffusion on the evaluation, adoption, and use stages. The model is based on two prominent, firm-level adoption concepts: the diffusion of innovation (DOI) and the technology, organization, environment (TOE) framework, extended with our previous research findings. Drawing on data from 181 small and medium enterprises (SMEs), we identify seven distinct determinants (i.e. cost, BIS is part of ERP, management support, rational decision-making culture, project champion, organizational data environment, organizational readiness) as statistically significant for different adoption stages.

Question: What are the determinants of business intelligence system adoption stages?


SGD-QN: Careful Quasi-Newton Stochastic Gradient Descent. TheSGD-QN algorithm is a stochastic gradient descent algorithm that m akes careful use of secondorder information and splits the parameter update into inde pendently scheduled components. Thanks to this design, SGD-QN iterates nearly as fast as a first-order stochastic gradient escent but requires less iterations to achieve the same accuracy. This algorith m won the "Wild Track" of the first PASCAL Large Scale Learning Challenge (Sonnenburg et al., 2008 ).

Question: What is the first PASCAL Large Scale Learning Challenge?


Muscle simulation for facial animation in Kong: Skull Island. For Kong: Skull Island, Industrial Light & Magic created an anatomically motivated facial simulation model for Kong that includes the facial skeleton and musculature. We applied a muscle simulation framework that allowed us to target facial shapes while maintaining desirable physical properties to ensure that the simulations stayed on-model. This allowed muscle simulations to be used as a powerful tool for adding physical detail to and improving the anatomical validity of both blendshapes and blendshape animations in order to achieve more realistic facial animation with less hand sculpting.

Question: How do you simulate muscle?


Distance Metric Learning for Large Margin Nearest Neighbor Classification.

Question: What is the nearest neighbor classification?


Using heuristics to estimate an appropriate number of latent topics in source code analysis. Latent Dirichlet Allocation (LDA) is a data clustering algorithm that performs especially well for text documents. In natural-language applications it automatically finds groups of related words (called "latent topics") and clusters the documents into sets that are about the same "topic". LDA has also been applied to source code, where the documents are natural source code units such as methods or classes, and the words are the keywords, operators, and programmer-defined names in the code. The problem of determining a topic count that most appropriately describes a set of source code documents is an open problem. We address this empirically by constructing clusterings with different numbers of topics for a large number of software systems, and then use a pair of measures based on source code locality and topic model similarity to assess how well the topic structure identifies related source code units. Results suggest that the topic count required can be closely approximated using the number of software code fragments in the system. We extend these results to recommend appropriate topic counts for arbitrary software systems based on an analysis of a set of open source systems.

Question: How many topics should I use for source code analysis?


Real-time Action Recognition with Dissimilarity-based Training of Specialized Module Networks. This paper addresses the problem of real-time action recognition in trimmed videos, for which deep neural networks have defined the state-of-the-art performance in the recent literature. For attaining higher recognition accuracies with efficient computations, researchers have addressed the various aspects of limitations in the recognition pipeline. This includes network architecture, the number of input streams (where additional streams augment the color information), the cost function to be optimized, in addition to others. The literature has always aimed, though, at assigning the adopted network (or networks, in case of multiple streams) the task of recognizing the whole number of action classes in the dataset at hand. We propose to train multiple specialized module networks instead. Each module is trained to recognize a subset of the action classes. Towards this goal, we present a dissimilarity-based optimized procedure for distributing the action classes over the modules, which can be trained simultaneously offline. On two standard datasets–UCF-101 and HMDB-51–the proposed method demonstrates a comparable performance, that is superior in some aspects, to the state-of-the-art, and that satisfies the real-time constraint. We achieved 72.5% accuracy on the challenging HMDB-51 dataset. By assigning fewer and unalike classes to each module network, this research paves the way to benefit from light-weight architectures without compromising recognition accuracy1.

Question: What is the real-time constraint?


FindingHuMo: Real-Time Tracking of Motion Trajectories from Anonymous Binary Sensing in Smart Environments. In this paper we have proposed and designed FindingHuMo (Finding Human Motion), a real-time user tracking system for Smart Environments. FindingHuMo can perform device-free tracking of multiple (unknown and variable number of) users in the Hallway Environments, just from non-invasive and anonymous (not user specific) binary motion sensor data stream. The significance of our designed system are as follows: (a) fast tracking of individual targets from binary motion data stream from a static wireless sensor network in the infrastructure. This needs to resolve unreliable node sequences, system noise and path ambiguity, (b) Scaling for multi-user tracking where user motion trajectories may crossover with each other in all possible ways. This needs to resolve path ambiguity to isolate overlapping trajectories, FindingHumo applies the following techniques on the collected motion data stream: (i) a proposed motion data driven adaptive order Hidden Markov Model with Viterbi decoding (called Adaptive-HMM), and then (ii) an innovative path disambiguation algorithm (called CPDA). Using this methodology the system accurately detects and isolates motion trajectories of individual users. The system performance is illustrated with results from real-time system deployment experience in a Smart Environment.

Question: How to find the motion trajectories of multiple users in a Smart Environment?


The expansion of Google Scholar versus Web of Science: a longitudinal study. Web of Science (WoS) and Google Scholar (GS) are prominent citation services with distinct indexing mechanisms. Comprehensive knowledge about the growth patterns of these two citation services is lacking. We analyzed the development of citation counts in WoS and GS for two classic articles and 56 articles from diverse research fields, making a distinction between retroactive growth (i.e., the relative difference between citation counts up to mid-2005 measured in mid-2005 and citation counts up to mid-2005 measured in April 2013) and actual growth (i.e., the relative difference between citation counts up to mid-2005 measured in April 2013 and citation counts up to April 2013 measured in April 2013). One of the classic articles was used for a citation-by-citation analysis. Results showed that GS has substantially grown in a retroactive manner (median of 170 % across articles), especially for articles that initially had low citations counts in GS as compared to WoS. Retroactive growth of WoS was small, with a median of 2 % across articles. Actual growth percentages were moderately higher for GS than for WoS (medians of 54 vs. 41 %). The citation-by-citation analysis showed that the percentage of citations being unique in WoS was lower for more recent citations (6.8 % for citations from 1995 and later vs. 41 % for citations from before 1995), whereas the opposite was noted for GS (57 vs. 33 %). It is concluded that, since its inception, GS has shown substantial expansion, and that the majority of recent works indexed in WoS are now also retrievable via GS. A discussion is provided on quantity versus quality of citations, threats for WoS, weaknesses of GS, and implications for literature research and research evaluation.

Question: What is the difference between the web of science and google scholar?


Development of a continuum robot using pneumatic artificial muscles. This paper presents the design concept of an intrinsic spatial continuum robot, of which arm segments are actuated by pneumatic artificial muscles. Since pneumatic artificial muscles supported the arm segments of the robot instead of a passive spring, the developed continuum robot was not only capable of following a given trajectory, but also varying its stiffness according to given external environment. Experiment results revealed that the proposed continuum robot showed versatile movements by controlling the pressure of supply air to pneumatic artificial muscles, and the well-coordinated pattern matching scheme based on low-cost webcams gave good performance in estimating the position and orientation of the end-effector of the spatial continuum robot.

Question: How does the robot move?


The Role of the Gut Microbiota in Childhood Obesity.. BACKGROUND Childhood and adolescent obesity has reached epidemic proportions worldwide. The pathogenesis of obesity is complex and multifactorial, in which genetic and environmental contributions seem important. The gut microbiota is increasingly documented to be involved in the dysmetabolism associated with obesity.   METHODS We conducted a systematic search for literature available before October 2015 in the PubMed and Scopus databases, focusing on the interplay between the gut microbiota, childhood obesity, and metabolism.   RESULTS The review discusses the potential role of the bacterial component of the human gut microbiota in childhood and adolescent-onset obesity, with a special focus on the factors involved in the early development of the gut bacterial ecosystem, and how modulation of this microbial community might serve as a basis for new therapeutic strategies in combating childhood obesity. A vast number of variables are influencing the gut microbial ecology (e.g., the host genetics, delivery method, diet, age, environment, and the use of pre-, pro-, and antibiotics); but the exact physiological processes behind these relationships need to be clarified.   CONCLUSIONS Exploring the role of the gut microbiota in the development of childhood obesity may potentially reveal new strategies for obesity prevention and treatment.

Question: What is the role of the gut microbiota in childhood obesity?


Dynamo: amazon's highly available key-value store. Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives the reliability and scalability of the software systems.  This paper presents the design and implementation of Dynamo, a highly available key-value storage system that some of Amazon's core services use to provide an "always-on" experience. To achieve this level of availability, Dynamo sacrifices consistency under certain failure scenarios. It makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.

Question: What is Dynamo?


A Hardware Framework for Yield and Reliability Enhancement in Chip Multiprocessors. Device reliability and manufacturability have emerged as dominant concerns in end-of-road CMOS devices. An increasing number of hardware failures are attributed to manufacturability or reliability problems. Maintaining an acceptable manufacturing yield for chips containing tens of billions of transistors with wide variations in device parameters has been identified as a great challenge. Additionally, today's nanometer scale devices suffer from accelerated aging effects because of the extreme operating temperature and electric fields they are subjected to. Unless addressed in design, aging-related defects can significantly reduce the lifetime of a product. In this article, we investigate a micro-architectural scheme for improving yield and reliability of homogeneous chip multiprocessors (CMPs). The proposed solution involves a hardware framework that enables us to utilize the redundancies inherent in a multicore system to keep the system operational in the face of partial failures. A micro-architectural modification allows a faulty core in a CMP to use another core's resources to service any instruction that the former cannot execute correctly by itself. This service improves yield and reliability but may cause loss of performance. The target platform for quantitative evaluation of performance under degradation is a dual-core and a quad-core chip multiprocessor with one or more cores sustaining partial failure. Simulation studies indicate that when a large, high-latency, and sparingly used unit such as a floating-point unit fails in a core, correct execution may be sustained through outsourcing with at most a 16% impact on performance for a floating-point intensive application. For applications with moderate floating-point load, the degradation is insignificant. The performance impact may be mitigated even further by judicious selection of the cores to commandeer depending on the curr

Question: What is the impact of outsourcing on performance?


A genomic perspective on protein families.. In order to extract the maximum amount of information from the rapidly accumulating genome sequences, all conserved genes need to be classified according to their homologous relationships. Comparison of proteins encoded in seven complete genomes from five major phylogenetic lineages and elucidation of consistent patterns of sequence similarities allowed the delineation of 720 clusters of orthologous groups (COGs). Each COG consists of individual orthologous proteins or orthologous sets of paralogs from at least three lineages. Orthologs typically have the same function, allowing transfer of functional information from one member to an entire COG. This relation automatically yields a number of functional predictions for poorly characterized genomes. The COGs comprise a framework for functional and evolutionary genome analysis.

Question: What is the function of the COGs?


A Four-Plate Compact Capacitive Coupler Design and LCL-Compensated Topology for Capacitive Power Transfer in Electric Vehicle Charging Application. This paper proposes a four-plate compact capacitive coupler and its circuit model for large air-gap distance capacitive power transfer (CPT). The four plates are arranged vertically, instead of horizontally, to save space in the electric vehicle charging application. The two plates that are on the same side are placed close to each other to maintain a large coupling capacitance, and they are of different sizes to maintain the coupling between the primary and secondary sides. The circuit model of the coupler is presented, considering all six coupling capacitors. The LCL compensation topology is used to resonate with the coupler and provide high voltage on the plates to transfer high power. The circuit model of the coupler is simplified to design the parameters of the compensation circuit. Finite-element analysis is employed to simulate the coupling capacitance and design the dimensions of the coupler. The circuit performance is simulated in LTspice to design the specific parameter values. A prototype of the CPT system was designed and constructed with the proposed vertical plate structure. The prototype achieved an efficiency of 85.87% at 1.88-kW output power with a 150-mm air-gap distance.

Question: What is the purpose of this paper?


Educational Data Mining: A Review of the State of the Art. Educational data mining (EDM) is an emerging interdisciplinary research area that deals with the development of methods to explore data originating in an educational context. EDM uses computational approaches to analyze educational data in order to study educational questions. This paper surveys the most relevant studies carried out in this field to date. First, it introduces EDM and describes the different groups of user, types of educational environments, and the data they provide. It then goes on to list the most typical/common tasks in the educational environment that have been resolved through data-mining techniques, and finally, some of the most promising future lines of research are discussed.

Question: What is the most common task in an educational environment?


CIVSched: A Communication-Aware Inter-VM Scheduling Technique for Decreased Network Latency between Co-Located VMs. Server consolidation in cloud computing environments makes it possible for multiple servers or desktops to run on a single physical server for high resource utilization, low cost, and reduced energy consumption. However, the scheduler in the virtual machine monitor (VMM), such as Xen credit scheduler, is agnostic about the communication behavior between the guest operating systems (OS). The aforementioned behavior leads to increased network communication latency in consolidated environments. In particular, the CPU resources management has a critical impact on the network latency between co-located virtual machines (VMs) when there are CPUand I/O-intensive workloads running simultaneously. This paper presents the design and implementation of a communication-aware inter-VM scheduling (CIVSched) technique that takes into account the communication behavior between inter-VMs running on the same virtualization platform. The CIVSched technique inspects the network packets transmitted between local co-resident domains to identify the target VM and process that will receive the packets. Thereafter, the target VM and process are preferentially scheduled by the VMM and the guest OS. The cooperation of these two schedulers makes the network packets to be timely received by the target application. Experimental results on the Xen virtualization platform depict that the CIVSched technique can reduce the average response time of network traffic by approximately 19 percent for the highly consolidated environment, while keeping the inherent fairness of the VMM scheduler.

Question: What is the average response time of network traffic?


A large-stroke flexure fast tool servo with new displacement amplifier. As the rapid progress of science and technology, the free-form surface optical component has played an important role in spaceflight, aviation, national defense, and other areas of the technology. While the technology of fast tool servo (FTS) is the most promising method for the machining of free-form surface optical component. However, the shortcomings of short-stroke of fast tool servo device have constrained the development of free-form surface optical component. To address this problem, a new large-stroke flexible FTS device is proposed in this paper. A series of mechanism modeling and optimal designs are carried out via compliance matrix theory, pseudo-rigid body theory, and Particle Swarm Optimization (PSO) algorithm, respectively. The mechanism performance of the large-stroke FTS device is verified by the Finite Element Analysis (FEA) method. For this study, a piezoelectric (PZT) actuator P-840.60 that can travel to 90 µm under open-loop control is employed, the results of experiment indicate that the maximum of output displacement can achieve 258.3µm, and the bandwidth can achieve around 316.84 Hz. Both theoretical analysis and the test results of prototype uniformly verify that the presented FTS device can meet the demand of the actual microstructure processing.

Question: What is the maximum output displacement of the large-stroke FTS device?


The Semantic Web Revisited. The article included many scenarios in which intelligent agents and bots undertook tasks on behalf of their human or corporate owners. Of course, shopbots and auction bots abound on the Web, but these are essentially handcrafted for particular tasks: they have little ability to interact with heterogeneous data and information types. Because we haven't yet delivered large-scale, agent-based mediation, some commentators argue that the semantic Web has failed to deliver. We argue that agents can only flourish when standards are well established and that the Web standards for expressing shared meaning have progressed steadily over the past five years

Question: What is the semantic web?


Comparison of human and computer performance across face recognition experiments. a r t i c l e i n f o Since 2005, human and computer performance has been systematically compared as part of face recognition competitions, with results being reported for both still and video imagery. The key results from these competitions are reviewed. To analyze performance across studies, the cross-modal performance analysis (CMPA) framework is introduced. The CMPA framework is applied to experiments that were part of face a recognition competition. The analysis shows that for matching frontal faces in still images, algorithms are consistently superior to humans. For video and difficult still face pairs, humans are superior. Finally, based on the CMPA framework and a face performance index, we outline a challenge problem for developing algorithms that are superior to humans for the general face recognition problem.

Question: What is the cross-modal performance analysis framework?


Data-driven Personas: Constructing Archetypal Users with Clickstreams and User Telemetry. User Experience (UX) research teams following a user centered design approach harness personas to better understand a user's workflow by examining that user's behavior, goals, needs, wants, and frustrations. To create target personas these researchers rely on workflow data from surveys, self-reports, interviews, and user observation. However, this data not directly related to user behavior, weakly reflects a user's actual workflow in the product, is costly to collect, is limited to a few hundred responses, and is outdated as soon as a persona's workflows evolve. To address these limitations we present a quantitative bottom-up data-driven approach to create personas. First, we directly incorporate user behavior via clicks gathered automatically from telemetry data related to the actual product use in the field; since the data collection is automatic it is also cost effective. Next, we aggregate 3.5 million clicks from 2400 users into 39,000 clickstreams and then structure them into 10 workflows via hierarchical clustering; we thus base our personas on a large data sample. Finally, we use mixed models, a statistical approach that incorporates these clustered workflows to create five representative personas; updating our mixed model ensures that these personas remain current. We also validated these personas with our product's user behavior experts to ensure that workflows and the persona goals represent actual product use.

Question: How do you create personas?


Full-body illusions and minimal phenomenal selfhood. We highlight the latest research on body perception and self-consciousness, but argue that despite these achievements, central aspects have remained unexplored, namely, global aspects of bodily self-consciousness. Researchers investigated central representations of body parts and actions involving these, but neglected the global and unitary character of self-consciousness, the 'I' of experience and behaviour. We ask, what are the minimally sufficient conditions for the appearance of a phenomenal self, that is, the fundamental conscious experience of being someone? What are necessary conditions for self-consciousness in any type of system? We offer conceptual clarifications, discuss recent empirical evidence from neurology and cognitive science and argue that these findings offer a new entry point for the systematic study of global and more fundamental aspects of self-consciousness.

Question: What is the minimally sufficient conditions for the appearance of a phenomenal self?


Design and optimisation of a voice coil motor (VCM) with a rotary actuator for an ultrasound scanner. IEEE Transactions on Industrial Electronics. This paper proposes a new application for the rotary VCM. In developing a low cost ultrasound scanner for the developing world an oscillating transducer is required to sweep over the skin. The ultrasound scanner must operate from a USB power supply in remote locations. The application requires a 3.3N force on the coils of the motor to overcome the inertia of the skin. A proof of concept prototype motor with electronics has been designed, simulated and tested. The VCM optimisation is discussed in detail with the unique separation of the magnets being critical to reduce the axial bearing forces for this application.

Question: How to design a voice coil motor?


INOCULANTS OF PLANT GROWTH-PROMOTING BACTERIA FOR USE IN AGRICULTURE. An assessment of the current state of bacterial inoculants for c ontemporary agriculture in developed and developing countries is critically evaluated from the point of view of their actual status and future use. Special emphasis is given to two new concepts of inoculation, as yet unavailable commercially: (i) synthetic inoculants under development for plant-growth promoting bacteria (PGPB) (Bashan and Holguin, 1998), and (ii) inoculation by groups of associated bacteria. This review contains: A brief historical overview of bacterial inoculants; the rationale for plant inoculation with emphasis on developing countries and semiarid agriculture, and the concept and application of mixed inoculant; discussion of microbial formulation including optimization of carrier-compound characteristics, types of existing carriers for in oculants, traditional formulations, future trends in formulations using unconventional materials, encapsulated synthetic formulations, macro and micro formulations of alginate, encapsulation of beneficial bacteria using other materials, regulation and contamination of commercial inoculants, and examples of modem commercial bacterial inoculants; and a consideration of time constraints and application methods for bacterial inoculants, commercial production, marketing, and the prospects of inoculants in modern agriculture. ® 1998 Elsevier Science Inc.

Question: What is the rationale for plant inoculation with emphasis on developing countries and semiarid agriculture?


Bleu: a Method for Automatic Evaluation of Machine Translation.

Question: What is the bleu score?


Design Optimal PID Controller for Quad Rotor System. Quad rotor aerial vehicles are one of the most flexible and adaptable platforms for undertaking aerial research. Quad rotor in simplicity is rotorcraft that has four lift-generation propellers (four rotors), two rotors rotate in clockwise and the other two rotate anticlockwise, the speed and direction of Quad rotor can be controlled by varying the speed of these rotors. This paper describes the PID controller has been used for controlling attitude, Roll, Pitch and Yaw direction. In addition, optimal PID controller has been achieving by using particle swarm optimization (PSO), Bacterial Foraging optimization (BFO) and the BF-PSO optimization. Finally, the Quad rotor model has been simulating for several scenarios of testing.

Question: How to design optimal PID controller for quad rotor system?


Plan-Based Dialogue Management in a Physics Tutor. This paper describes an application of APE (the Atlas Planning Engine), an integrated planning and execution system at the heart of the Atlas dialogue management system. APE controls a mixedinitiative dialogue between a human user and a host system, where turns in the 'conversation' may include graphical actions and/or written text. APE has full unification and can handle arbitrarily nested discourse constructs, making it more powerful than dialogue managers based on finitestate machines. We illustrate this work by describing Atlas-Andes, an intelligent tutoring system built using APE with the Andes physics tutor as the host.

Question: What is the difference between a dialogue manager and a planning engine?


Facial soft-tissue spaces and retaining ligaments of the midcheek: defining the premaxillary space.. BACKGROUND This anatomical study was undertaken to define the soft-tissue spaces, retaining ligaments, and their relations in the midcheek.   METHODS Sixty fresh hemifaces were dissected. The retaining ligaments and facial spaces were defined and their dimensions recorded. The course of the key vessels and branches of the facial and infraorbital nerves were defined and their anatomical relations noted.   RESULTS The preseptal and prezygomatic spaces underlie the lid-cheek and malar segments of the midcheek. A previously undocumented soft-tissue space, the premaxillary space, was found to underlie the nasolabial segment. The retaining ligaments of the midcheek are the tear trough-orbicularis retaining ligament complex in the upper midcheek and the zygomatic and maxillary ligaments in the lower midcheek. The tear trough-orbicularis retaining ligament complex separates the preseptal space above from the prezygomatic and premaxillary spaces below. Facial nerve branches in the midcheek are closely associated with the zygomatic ligaments located outside the lower boundary of the prezygomatic space and are protected so long as the dissection is kept within this space. The infraorbital nerve is protected by the floor of the premaxillary space, formed by the levator labii superioris and, at the inferior boundary of the space, by the close relation with the maxillary ligaments.   CONCLUSIONS This study completely defined the spaces and retaining ligaments of the midcheek. Knowledge of this anatomy is key to safe and atraumatic suborbicular dissection for effective midcheek lifts.

Question: What is the premaxillary space?


The Microfinance Promise. Contributions to this research made by a member of The Financial Access Initiative.

Question: What is the financial access initiative?


An approach to finite-time controller design for a class of T-S fuzzy systems. This paper studies the finite-time stabilization problem for a class of nonlinear systems described by Takagi-Sugeno (T-S) fuzzy dynamic models with parametric uncertainties. A novel non-Lipschitz continuous state feedback control scheme with augmented dynamics is developed. It is shown that finite-time convergence of the closed loop system can be achieved, and the potential controller singularity problem can be avoided. Finally, one example is given to illustrate the effectiveness of the proposed control approach.

Question: How to design a finite-time controller for a class of T-S fuzzy systems?


Community detection and visualization in social networks: Integrating structural and semantic information. Due to the explosion of social networking and the information sharing among their users, the interest in analyzing social networks has increased over the recent years. Two general interests in this kind of studies are community detection and visualization. In the first case, most of the classic algorithms for community detection use only the structural information to identify groups, that is, how clusters are formed according to the topology of the relationships. However, these methods do not take into account any semantic information which could guide the clustering process, and which may add elements to conduct further analyses. In the second case most of the layout algorithms for clustered graphs have been designed to differentiate the groups within the graph, but they are not designed to analyze the interactions between such groups. Identifying these interactions gives an insight into the way different communities exchange messages or information, and allows the social network researcher to identify key actors, roles, and paths from one community to another.  This article presents a novel model to use, in a conjoint way, the semantic information from the social network and its structural information to, first, find structurally and semantically related groups of nodes, and second, a layout algorithm for clustered graphs which divides the nodes into two types, one for nodes with edges connecting other communities and another with nodes connecting nodes only within their own community. With this division the visualization tool focuses on the connections between groups facilitating deep studies of augmented social networks.

Question: What is the difference between community detection and visualization?


Spider: A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Task. We present Spider, a large-scale, complex and cross-domain semantic parsing and textto-SQL dataset annotated by 11 college students. It consists of 10,181 questions and 5,693 unique complex SQL queries on 200 databases with multiple tables, covering 138 different domains. We define a new complex and cross-domain semantic parsing and textto-SQL task where different complex SQL queries and databases appear in train and test sets. In this way, the task requires the model to generalize well to both new SQL queries and new database schemas. Spider is distinct from most of the previous semantic parsing tasks because they all use a single database and the exact same programs in the train set and the test set. We experiment with various state-of-the-art models and the best model achieves only 12.4% exact matching accuracy on a database split setting. This shows that Spider presents a strong challenge for future research. Our dataset and task are publicly available at https://yale-lily. github.io/spider.

Question: What is the name of the dataset?


Mitigating IoT security threats with a trusted Network element. Securing the growing amount of IoT devices is a challenge for both the end-users bringing IoT devices into their homes, as well as the corporates and industries exposing these devices into the Internet as part of their service or operations. The exposure of these devices, often poorly configured and secured, offers malicious actors an easy access to the private information of their users, or potential to utilize the devices in further activities, e.g., attacks on other devices via Distributed Denial of Service. This paper discusses the current security challenges of IoT devices and proposes a solution to secure these devices via a trusted Network Edge Device. NED offloads the security countermeasures of the individual devices into the trusted network elements. The major benefit of this approach is that the system can protect the IoT devices with user-defined policies, which can be applied to all devices regardless of the constraints of computing resources in the IoT tags. Additional benefit is the possibility to manage the countermeasures of multiple IoT devices/gateways at once, via a shared interface, thus largely avoiding the per-device maintenance operations.

Question: What is a trusted network element?


Constraint-based Round Robin Tournament Planning. Sport tournament planning becomes a complex task in the presence of heterogeneous requirements from teams, media, fans and other parties. Existing approaches to sport tournament planning often rely on precomputed tournament schemes which may be too rigid to cater for these requirements. Existing work on sport tournaments suggests a separation of the planning process into three phases. In this work, it is shown that all three phases can be solved using nite-domain constraint programming. The design of Friar Tuck, a generic constraint-based round robin planning tool, is outlined. New numerical results on round robin tournaments obtained with Friar Tuck underline the potential of constraints over nite domains in this area.

Question: What is a constraint-based round robin tournament planning?


Combining Generational and Conservative Garbage Collection: Framework and Implementations. Two key ideas in garbage collection are generational collection and conservative pointer-finding. Generational collection and conservative pointer-finding are hard to use together, because generational collection is usually expressed in terms of copying objects, while conservative pointer-finding precludes copying. We present a new framework for defining garbage collectors. When applied to generational collection, it generalizes the notion of younger/older to a partial order. It can describe traditional generational and conservative techniques, and lends itself to combining different techniques in novel ways. We study in particular two new garbage collectors inspired by this framework. Both these collectors use conservative pointer-finding. The first one is based on a rewrite of an existing trace-and-sweep collector to use one level of generation. The second one has a single parameter, which controls how objects are partitioned into generations: the value of this parameter can be changed dynamically with no overhead. We have implemented both collectors and present measurements of their performance in practice.

Question: What is a garbage collector?


An Inference Model for Semantic Entailment in Natural Language. Semantic entailment is the problem of determining if the meaning of a given sentence entails that of another. This is a fundamental problem in natural language understanding that provides a broad framework for studying language variability and has a large number of applications. We present a principled approach to this problem that builds on inducing rerepresentations of text snippets into a hierarchical knowledge representation along with a sound inferential mechanism that makes use of it to prove semantic entailment.

Question: What is a principled approach to semantic entailment?


Hierarchical Tree Long Short-Term Memory for Sentence Representations. A fixed-length feature vector is required for many machine learning algorithms in NLP field. Word embeddings have been very successful at learning lexical information. However, they can't capture the compositional meaning of sentences, which prevents them from a deeper understanding of language. In this paper, we introduce a novel hierarchical tree long short-term memory (HTLSTM) model that learns vector representations for sentences of arbitrary syntactic type and length. We propose to split one sentence into three hierarchies: short phrase, long phrase and full sentence level. The HTLSTM model gives our algorithm the potential to fully consider the hierarchical information and longterm dependencies of language. We design the experiments on both English and Chinese corpus to evaluate our model on sentiment analysis task. And the results show that our model outperforms several existing state of the art approaches significantly.

Question: What is the difference between a fixed-length feature vector and a word embedding?


Interpreting Semantic Relations in Noun Compounds via Verb Semantics. We propose a novel method for automatically interpreting compound nouns based on a predefined set of semantic relations. First we map verb tokens in sentential contexts to a fixed set of seed verbs using WordNet::Similarity and Moby's Thesaurus. We then match the sentences with semantic relations based on the semantics of the seed verbs and grammatical roles of the head noun and modifier. Based on the semantics of the matched sentences, we then build a classifier using TiMBL. The performance of our final system at interpreting NCs is 52.6%.

Question: What is the performance of our final system at interpreting NCs?


Adaptive Image Registration via Hierarchical Voronoi Subdivision. Advances in image acquisition systems have made it possible to capture high-resolution images of a scene, recording considerable scene details. With increased resolution comes increased image size and geometric difference between multiview images, complicating image registration. Through Voronoi subdivision, we subdivide large images into small corresponding regions, and by registering small regions, we register the images in a piecewise manner. Image subdivision reduces the geometric difference between regions that are registered and simplifies the correspondence process. The proposed method is a hierarchical one. While previous methods use the same block size and shape at a hierarchy, the proposed method adapts the block size and shape to the local image details and geometric difference between the images. This adaptation makes it possible to keep geometric difference between corresponding regions small and simplifies the correspondence process. Implementational details of the proposed image registration method are provided, and experimental results on various types of images are presented and analyzed.

Question: How to register images with different resolutions?


Development of a SiC JFET-Based Six-Pack Power Module for a Fully Integrated Inverter. In this paper, a fully integrated silicon carbide (SiC)-based six-pack power module is designed and developed. With 1200-V, 100-A module rating, each switching element is composed of four paralleled SiC junction gate field-effect transistors (JFETs) with two antiparallel SiC Schottky barrier diodes. The stability of the module assembly processes is confirmed with 1000 cycles of -40°C to +200°C thermal shock tests with 1.3°C/s temperature change. The static characteristics of the module are evaluated and the results show 55 mΩ on-state resistance of the phase leg at 200°C junction temperature. For switching performances, the experiments demonstrate that while utilizing a 650-V voltage and 60-A current, the module switching loss decreases as the junction temperature increases up to 150°C. The test setup over a large temperature range is also described. Meanwhile, the shoot-through influenced by the SiC JFET internal capacitance as well as package parasitic inductances are discussed. Additionally, a liquid cooled three-phase inverter with 22.9 cm × 22.4 cm × 7.1 cm volume and 3.53-kg weight, based on this power module, is designed and developed for electric vehicle and hybrid electric vehicle applications. A conversion efficiency of 98.5% is achieved at 10 kHz switching frequency at 5 kW output power. The inverter is evaluated with coolant temperature up to 95°C successfully.

Question: What is the volume of the inverter?


2 REINVENTING GROUNDED THEORY : SOME QUESTIONS ABOUT THEORY , GROUND AND DISCOVERY. Grounded theory‖s popularity persists after three decades of broad-ranging critique. We discuss here three problematic notions – "theory," "ground" and "discovery" – which linger in the continuing use and development of grounded theory procedures. We argue that far from providing the epistemic security promised by grounded theory, these notions – embodied in continuing reinventions of grounded theory – constrain and distort qualitative inquiry. We argue that what is contrived is not in fact theory in any meaningful sense, that "ground" is a misnomer when talking about interpretation and that what ultimately materializes following grounded theory procedures is less like discovery and more akin to invention. The procedures admittedly provide signposts for qualitative inquirers, but educational researchers should be wary, for the significance of interpretation, narrative and reflection can be undermined in the procedures of grounded theory.

Question: What is grounded theory?


Shape from periodic texture using the spectrogram. Texture has long been recognized in computer vision as an important monocular shape cue, with texture gradients yielding information on surface orientation. A more recent trend is the analysis of images in terms of local spatial frequencies, where each pixel has associated with it its own spatial frequency distribution. This has proven to be a successful method of reasoning about and exploiting many imaging phenomena. Thinking about both shape-from-texture and local spatial frequency, it seems that texture gradients would cause systematic changes in local frequency, and that these changes could be analyzed to extract shape information. However, there does not yet exist a theory that connects texture, shape, and the detailed behavior of local spatial frequency. We show in this paper how local spatial frequency is related to the surface normal of a textured surface. We find that the Fourier power spectra of any two similarly textured patches on a plane are approximately related to each other by an affine transformation. The transformation parameters are a function of the plane's surface normal. We use this relationship as the basis of a new algorithm for finding surface normals of textured shapes using the spectrogram, which is one type of local spatial frequency representation. We validate the relationship by testing the algorithm on real textures. By analyzing shape and texture in terms of the local spatial frequency representation, we can exploit the advantages of the representation for the shape-from-texture problem. Specifically, our algorithm requires no feature detection and can give correct results even when the texture is aliased.

Question: How to find the surface normal of a textured surface?


Siamese Neural Networks for One-Shot Image Recognition. The process of learning good features for machine learning applications can be very computationally expensive and may prove difficult in cases where little data is available. A prototypical example of this is the one-shot learning setting, in which we must correctly make predictions given only a single example of each new class. In this paper, we explore a method for learning siamese neural networks which employ a unique structure to naturally rank similarity between inputs. Once a network has been tuned, we can then capitalize on powerful discriminative features to generalize the predictive power of the network not just to new data, but to entirely new classes from unknown distributions. Using a convolutional architecture, we are able to achieve strong results which exceed those of other deep learning models with near state-of-the-art performance on one-shot classification tasks. Humans exhibit a strong ability to acquire and recognize new patterns. In particular, we observe that when presented with stimuli, people seem to be able to understand new concepts quickly and then recognize variations on these concepts in future percepts (Lake et al., 2011). Machine learning has been successfully used to achieve state-ofthe-art performance in a variety of applications such as web search, spam detection, caption generation, and speech and image recognition. However, these algorithms often break down when forced to make predictions about data for which little supervised information is available. We desire to generalize to these unfamiliar categories without necessitating extensive retraining which may be either expensive or impossible due to limited data or in an online prediction setting, such as web retrieval. Proceedings of the 32 International Conference on Machine Learning, Lille, France, 2015. JMLR: W&CP volume 37. Copyright 2015 by the author(s). Figure 1. Example of a 20-way one-shot classification task using t

Question: What is the one-shot classification task?


Original Loop-Closure Detection Algorithm for Monocular vSLAM. Vision-based simultaneous localization and mapping (vSLAM) is a well-established problem in mobile robotics and monocular vSLAM is one of the most challenging variations of that problem nowadays. In this work we study one of the core post-processing optimization mechanisms in vSLAM, e.g. loop-closure detection. We analyze the existing methods and propose original algorithm for loop-closure detection, which is suitable for dense, semi-dense and feature-based vSLAM methods. We evaluate the algorithm experimentally and show that it contribute to more accurate mapping while speeding up the monocular vSLAM pipeline to the extent the latter can be used in real-time for controlling small multirotor vehicle (drone).

Question: What is the loop-closure detection algorithm for monocular vSLAM?


The biology of cancer: metabolic reprogramming fuels cell growth and proliferation.. Cell proliferation requires nutrients, energy, and biosynthetic activity to duplicate all macromolecular components during each passage through the cell cycle. It is therefore not surprising that metabolic activities in proliferating cells are fundamentally different from those in nonproliferating cells. This review examines the idea that several core fluxes, including aerobic glycolysis, de novo lipid biosynthesis, and glutamine-dependent anaplerosis, form a stereotyped platform supporting proliferation of diverse cell types. We also consider regulation of these fluxes by cellular mediators of signal transduction and gene expression, including the phosphatidylinositol 3-kinase (PI3K)/Akt/mTOR system, hypoxia-inducible factor 1 (HIF-1), and Myc, during physiologic cell proliferation and tumorigenesis.

Question: What is the difference between proliferating and nonproliferating cells?


Character-level incremental speech recognition with recurrent neural networks. In real-time speech recognition applications, the latency is an important issue. We have developed a character-level incremental speech recognition (ISR) system that responds quickly even during the speech, where the hypotheses are gradually improved while the speaking proceeds. The algorithm employs a speech-to-character unidirectional recurrent neural network (RNN), which is end-to-end trained with connectionist temporal classification (CTC), and an RNN-based character-level language model (LM). The output values of the CTC-trained RNN are character-level probabilities, which are processed by beam search decoding. The RNN LM augments the decoding by providing long-term dependency information. We propose tree-based online beam search with additional depth-pruning, which enables the system to process infinitely long input speech with low latency. This system not only responds quickly on speech but also can dictate out-of-vocabulary (OOV) words according to pronunciation. The proposed model achieves the word error rate (WER) of 8.90% on the Wall Street Journal (WSJ) Nov'92 20K evaluation set when trained on the WSJ SI-284 training set.

Question: How does the system respond quickly on speech?


Integrating Conflicting Data: The Role of Source Dependence. Many data management applications, such as setting up Web portals, managing enterprise data, managing community data, and sharing scientific data, require integrating data from multiple sources. Each of these sources provides a set of values and different sourc es can often provide conflicting values. To present quality data to users, it is critical that data integration systems can resolve conflicts and discover true values. Typically, we expect a true value to be provided by more sources than any particular false one, so we can take the value provided by the majority of the sources as the truth. Unfortunately, a false value can be spread through copying and that makes truth discovery extremely tricky. In this paper, we consider how to find true values from conflicting information when there are a large number of sources, among which some may copy from others. We present a novel approach that considers pendencebetween data sources in truth discovery. Intuitively, if two data sources provide a large number of common values and many of these values are rarely provided by other sources ( e.g., particular false values), it is very likely that one copies from the other. We apply Bayesian analysis to decide dependence between sources and design an algorithm that iteratively detects dependence and discovers truth from conflicting information. We also extend our model by considering accuracyof data sources and similarity between values. Our experiments on synthetic data as well as real-world data show that our algorithm can significantly improve accuracy of truth discovery and is scalable when there are a large number of data sources.

Question: How to find true values from conflicting information when there are a large number of sources?


An overview of pricing models for revenue management. This publication contains reprint articles for which IEEE does not hold copyright. Full text is not available on IEEE Xplore for these articles.

Question: What is the price of this publication?