Spatial Partitioning Techniques in Spatial Hadoop. SpatialHadoop is an extended MapReduce framework that supp orts global indexing that spatial partitions the data across machines providing orders of magnitude speedup, compared to traditi onal Hadoop. In this paper, we describe seven alternative partit ioning techniques and experimentally study their effect on the qua lity of the generated index and the performance of range and spatial join queries. We found that using a 1% sample is enough to produce high quality partitions. Also, we found that the total area o f partitions is a reasonable measure of the quality of indexes when r unning spatial join. This study will assist researchers in cho osing a good spatial partitioning technique in distributed enviro nments. 1. INDEXING IN SPATIALHADOOP SpatialHadoop [2, 3] provides a generic indexing algorithm which was used to implement grid, R-tree, and R+-tree based p artitioning. This paper extends our previous study by introduci ng four new partitioning techniques, Z-curve, Hilbert curve, Quad tree, and K-d tree, and experimentally evaluate all of the seven techn iques. The partitioning phase of the indexing algorithm runs in thr ee steps, where the first step is fixed and the last two steps are customiz ed for each partitioning technique. The first step computes number of desired partitionsn based on file size and HDFS block capacity which are both fixed for all partitioning techniques. The second st ep reads a random sample, with a sampling ratio ρ, from the input file and uses this sample to partition the space into cells such that number of sample points in each cell is at most ⌊k/n⌋, wherek is the sample size. The third step actually partitions the file by as signing each record to one or more cells. Boundary objects are handle d using either thedistribution or replication methods. Thedistribution method assigns an object to exactly one overlapping cell and the cell has to be expanded to enclose all contained recor

Question: What is the difference between a Hilbert curve and a Z-curve?


A RFID case-based logistics resource management system for managing order-picking operations in warehouses. In the supply chain, a warehouse is an essential component for linking the chain partners. It is necessary to allocate warehouse resources efficiently and effectively to enhance the productivity and reduce the operation costs of the warehouse. Therefore, warehouse management systems (WMSs) have been developed for handling warehouse resources and monitoring warehouse operations. However, it is difficult to update daily operations of inventory level, locations of forklifts and stock keeping units (SKUs) in realtime by using the bar-code-based or manual-based warehouse management systems. In this paper, RFID technology is adopted to facilitate the collection and sharing of data in a warehouse. Tests are performed for evaluating the reading performance of both the active and passive RFID apparatus. With the help of the testing results, the efficient radio frequency cover ranges of the readers are examined for formulating a radio frequency identification case-based logistics resource management system (R-LRMS). The capabilities of R-LRMS are demonstrated in GSL Limited. Three objectives are achieved: (i) a simplification of RFID adoption procedure, (ii) an improvement in the visibility of warehouse operations and (iii) an enhancement of the productivity of the warehouse. The successful case example proved the feasibility of R-LRMS in real working practice. 2008 Elsevier Ltd. All rights reserved.

Question: What is the difference between a bar-code-based and a RFID-based warehouse management system?


Social-Aware Movie Recommendation via Multimodal Network Learning. With the rapid development of Internet movie industry social-aware movie recommendation systems (SMRs) have become a popular online web service that provide relevant movie recommendations to users. In this effort many existing movie recommendation approaches learn a user ranking model from user feedback with respect to the movie's content. Unfortunately this approach suffers from the sparsity problem inherent in SMR data. In the present work we address the sparsity problem by learning a multimodal network representation for ranking movie recommendations. We develop a heterogeneous SMR network for movie recommendation that exploits the textual description and movie-poster image of each movie as well as user ratings and social relationships. With this multimodal data we then present a heterogeneous information network learning framework called SMR-multimodal network representation learning (MNRL) for movie recommendation. To learn a ranking metric from the heterogeneous information network we also developed a multimodal neural network model. We evaluated this model on a large-scale dataset from a real world SMR Web site and we find that SMR-MNRL achieves better performance than other state-of-the-art solutions to the problem.

Question: How does the social-aware movie recommendation work?


Supervised Bilingual Lexicon Induction with Multiple Monolingual Signals. Prior research into learning translations from source and target language monolingual texts has treated the task as an unsupervised learning problem. Although many techniques take advantage of a seed bilingual lexicon, this work is the first to use that data for supervised learning to combine a diverse set of signals derived from a pair of monolingual corpora into a single discriminative model. Even in a low resource machine translation setting, where induced translations have the potential to improve performance substantially, it is reasonable to assume access to some amount of data to perform this kind of optimization. Our work shows that only a few hundred translation pairs are needed to achieve strong performance on the bilingual lexicon induction task, and our approach yields an average relative gain in accuracy of nearly 50% over an unsupervised baseline. Large gains in accuracy hold for all 22 languages (low and high resource) that we investigate.

Question: How many bilingual lexicons are needed to achieve good performance on the bilingual lexicon induction task?


Topic-Oriented Exploratory Search Based on an Indexing Network. An exploratory search may be driven by a user's curiosity or desire for specific information. When users investigate unfamiliar fields, they may want to learn more about a particular subject area to increase their knowledge rather than solve a specific problem. This work proposes a topic-oriented exploratory search method that provides browse guidance to users. It allows them to discover new associations and knowledge, and helps them find their interested information and knowledge. Since an exploratory search needs to judge the ability to discover new knowledge, the existing commonly used metrics fail to capture it. This paper thus defines a new set of criteria containing clarity, relevance, novelty, and diversity to analyze the effectiveness of an exploratory search. Experiments are designed to compare results from the proposed method and Google's "search related to ...." The results show that the proposed one is more suitable for learning new associations and discovering new knowledge with highly likely relevance to a query. This work concludes that it is more suitable than Google for an exploratory search.

Question: What is the difference between topic-oriented exploratory search and exploratory search?


A Wavelet Tour of Signal Processing, 2nd Edition. Bargaining with reading habit is no need. Reading is not kind of something sold that you can take or not. It is a thing that will change your life to life better. It is the thing that will give you many things around the world and this universe, in the real world and here after. As what will be given by this a wavelet tour of signal processing 2nd edition, how can you bargain with the thing that has many benefits for you?

Question: What is a wavelet tour of signal processing 2nd edition?


A Flexible Fabrication Approach Toward the Shape Engineering of Microscale Soft Pneumatic Actuators. The recent developments of soft robots have inspired a variety of applications that require compliance for safety and softness for biomimetics. With such prevalence and advantages of soft robots, researchers are diverting their interests toward applications like micromanipulation of biological tissue. However, the progress has been thwarted by the difficulty in producing soft robots in miniature scale. In this paper, we present a new kind of microscale soft pneumatic actuators (SPA) made from streamlined and standardized fabrication procedure with customizable bending modalities inspired by shape engineering. Preliminary mathematical models are given to interpret width-based shape engineering for customization and to compare the bending angle and radius of curvature measured from the characterization experiments. The fabricated SPA was tested on the sciatic nerve of a rat in order to show its future potentials in biomedical field. Ultimately, this paper will contribute to the diversification of SPA fabrication and customization, as well as biomedical applications that demand smaller dimensions and higher precision.

Question: What is the difference between a soft robot and a soft pneumatic actuator?


Model-based object tracking in monocular image sequences of road traffic scenes. Moving vehicles are detected and tracked automatically in monocular image sequences from road traffic scenes recorded by a stationary camera. In order to exploit the a priori knowledge about shape and motion of vehicles in traffic scenes, a parameterized vehicle model is used for an intraframe matching process and a recursive estimator based on a motion model is used for motion estimation. An interpretation cycle supports the intraframe matching process with a state MAP-update step. Initial model hypotheses are generated using an image segmentation component which clusters coherently moving image features into candidate representations of images of a moving vehicle. The inclusion of an illumination model allows taking shadow edges of the vehicle into account during the matching process. Only such an elaborate combination of various techniques has enabled us to track vehicles under complex illumination conditions and over long (over 400 frames) monocular image sequences. Results on various real-world road traffic scenes are presented and open problems as well as future work are outlined.

Question: How to track vehicles in monocular image sequences?


Who Invented the Reverse Mode of Differentiation ?. Nick Trefethen [13] listed automatic differentiation as one of the 30 great numerical algorithms of the last century. He kindly credited the present author with facilitating the rebirth of the key idea, namely the reverse mode. In fact, there have been many incarnations of this reversal technique, which has been suggested by several people from various fields since the late 1960s, if not earlier. Seppo Linnainmaa (Lin76) of Helsinki says the idea came to him on a sunny afternoon in a Copenhagen park in 1970. He used it as a tool for estimating the effects of arithmetic rounding errors on the results of complex expressions. Gerardi Ostrowski (OVB71) discovered and used it some five years earlier in the context of certain process models in chemical engineering. Here and throughout references that are not listed in the present bibliography are noted in parentheses and can be found in the book [7]. Also in the sixties Hachtel et al. [6] considered the optimization of electronic circuits using the costate equation of initial value problems and its discretizations to compute gradients in the reverse mode for explicitly time-dependent problems. Here we see, possibly for the first time, the close connection between the reverse mode of discrete evaluation procedures and continuous adjoints of differential equations. In the 1970s Iri analyzed the properties of dual and adjoint networks. In the 1980s he became one of the key researchers on the reverse mode. From a memory and numerical stability point of view the most difficult aspect of the reverse mode is the reversal of a program. This problem was discussed in the context of Turing Machines by Benett (Ben73), who foreshadowed the use of checkpointing as a tradeoff between numerical computational effort and memory requirement.

Question: Who invented the reverse mode of differentiation?


Experimental study of desalination using direct contact membrane distillation : a new approach to flux enhancement. New membrane distillation configurations and a new membrane module were investigated to improve water desalination. The performances of three hydrophobic microporous membranes were evaluated under vacuum enhanced direct contact membrane distillation (DCMD) with a turbulent flow regime and with a feed water temperature of only 40 ◦C. The new configurations provide reduced temperature polarization effects due to better mixing and increased mass transport of water due to higher permeability through the membrane and due to a total pressure gradient across the membrane. Comparison with previously reported results in the literature reveals that mass transport of water vapors is substantially improved with the new approach. The performance of the new configuration was investigated with both NaCl and synthetic sea salt feed solutions. Salt rejection was greater than 99.9% in almost all cases. Salt concentrations in the feed stream had only a minor effect on water flux. The economic aspects of the enhanced DCMD process are briefly discussed and comparisons are made with the reverse osmosis (RO) process for desalination. © 2003 Elsevier B.V. All rights reserved.

Question: What is the difference between desalination and water desalination?


Adaptive resource allocation for wildlife protection against illegal poachers. Illegal poaching is an international problem that leads to the extinction of species and the destruction of ecosystems. As evidenced by dangerously dwindling populations of endangered species, existing anti-poaching mechanisms are insufficient. This paper introduces the Protection Assistant for Wildlife Security (PAWS) application a joint deployment effort done with researchers at Uganda's Queen Elizabeth National Park (QENP) with the goal of improving wildlife ranger patrols. While previous works have deployed applications with a game-theoretic approach (specifically Stackelberg Games) for counter-terrorism, wildlife crime is an important domain that promotes a wide range of new deployments. Additionally, this domain presents new research challenges and opportunities related to learning behavioral models from collected poaching data. In addressing these challenges, our first contribution is a behavioral model extension that captures the heterogeneity of poachers' decision making processes. Second, we provide a novel framework, PAWS-Learn, that incrementally improves the behavioral model of the poacher population with more data. Third, we develop a new algorithm, PAWS-Adapt, that adaptively improves the resource allocation strategy against the learned model of poachers. Fourth, we demonstrate PAWS's potential effectiveness when applied to patrols in QENP, where PAWS will be deployed.

Question: What is the difference between a game-theoretic approach and a behavioral model approach?


Intrinsic Motivation Systems for Autonomous Mental Development. Exploratory activities seem to be intrinsically rewarding for children and crucial for their cognitive development. Can a machine be endowed with such an intrinsic motivation system? This is the question we study in this paper, presenting a number of computational systems that try to capture this drive towards novel or curious situations. After discussing related research coming from developmental psychology, neuroscience, developmental robotics, and active learning, this paper presents the mechanism of Intelligent Adaptive Curiosity, an intrinsic motivation system which pushes a robot towards situations in which it maximizes its learning progress. This drive makes the robot focus on situations which are neither too predictable nor too unpredictable, thus permitting autonomous mental development. The complexity of the robot's activities autonomously increases and complex developmental sequences self-organize without being constructed in a supervised manner. Two experiments are presented illustrating the stage-like organization emerging with this mechanism. In one of them, a physical robot is placed on a baby play mat with objects that it can learn to manipulate. Experimental results show that the robot first spends time in situations which are easy to learn, then shifts its attention progressively to situations of increasing difficulty, avoiding situations in which nothing can be learned. Finally, these various results are discussed in relation to more complex forms of behavioral organization and data coming from developmental psychology

Question: What is the complexity of the robot's activities autonomously increasing and complex developmental sequences self-organizing without being constructed in a supervised manner?


A knowledge-based approach for duplicate elimination in data cleaning. Existing duplicate elimination methods for data cleaning work on the basis of computing the degree of similarity between nearby records in a sorted database. High recall can be achieved by accepting records with low degrees of similarity as duplicates, at the cost of lower precision. High precision can be achieved analogously at the cost of lower recall. This is the recall–precision dilemma. We develop a generic knowledge-based framework for effective data cleaning that can implement any existing data cleaning strategies and more. We propose a new method for computing transitive closure under uncertainty for dealing with the merging of groups of inexact duplicate records and explain why small changes to window sizes has little effect on the results of the sorted neighborhood method. Experimental study with two real-world datasets show that this approach can accurately identify duplicates and anomalies with high recall and precision, thus effectively resolving the recall–precision dilemma. r 2001 Published by Elsevier Science Ltd.

Question: What is a knowledge-based approach for duplicate elimination in data cleaning?


Automated Assessment of Surgical Skills Using Frequency Analysis. We present an automated framework for visual assessment of the expertise level of surgeons using the OSATS (Objective Structured Assessment of Technical Skills) criteria. Video analysis techniques for extracting motion quality via frequency coefficients are introduced. The framework is tested on videos of medical students with different expertise levels performing basic surgical tasks in a surgical training lab setting. We demonstrate that transforming the sequential time data into frequency components effectively extracts the useful information differentiating between different skill levels of the surgeons. The results show significant performance improvements using DFT and DCT coefficients over known state-of-the-art techniques.

Question: How to extract useful information from a video?


Auditing and Assessment of Data Traffic Flows in an IoT Architecture. Recent advances in the development of the Internet of Things and ICT have completely changed the way citizens interact with Smart City environments increasing the demand of more services and infrastructures in many different contexts. Furthermore, citizens require to be active users in a flexible smart living lab, with the possibility to access Smart City data, analyze them, perform actions and receive notifications based on automated decision-making processes. Critical problems could arise if the continuity of data flows and communication among connected IoT devices and data-driven applications is interrupted or lost, due to some devices or system malfunction or unexpected behavior. The proposed solution is a set of instruments, aimed at real-time collecting and storing IoT and Smart City data (data shadow), as well as auditing data traffic flows in an IoT Smart City Architecture, with the purpose of quantitatively monitoring the status and detecting potential anomalies and malfunctions at level of single IoT device and/or service. These instruments are the DevDash and AMMA tools, designed and realized within the Snap4City framework. Specific use cases have been provided to highlight the capabilities of these instruments in terms of data indexing, monitoring and analysis.

Question: What is the purpose of the DevDash and AMMA tools?


Algorithms for Quantum Computation: Discrete Log and Factoring Extended Abstract. This paper gives algorithms for the discrete log and the factoring problems that take random polynomial time on a quantum computer (thus giving the rst examples of quantum cryptanalysis).

Question: What is quantum cryptanalysis?


An Edge Based Smart Parking Solution Using Camera Networks and Deep Learning. The smart parking industry continues to evolve as an increasing number of cities struggle with traffic congestion and inadequate parking availability. For urban dwellers, few things are more irritating than anxiously searching for a parking space. Research results show that as much as 30% of traffic is caused by drivers driving around looking for parking spaces in congested city areas. There has been considerable activity among researchers to develop smart technologies that can help drivers find a parking spot with greater ease, not only reducing traffic congestion but also the subsequent air pollution. Many existing solutions deploy sensors in every parking spot to address the automatic parking spot detection problems. However, the device and deployment costs are very high, especially for some large and old parking structures. A wide variety of other technological innovations are beginning to enable more adaptable systems—including license plate number detection, smart parking meter, and vision-based parking spot detection. In this paper, we propose to design a more adaptable and affordable smart parking system via distributed cameras, edge computing, data analytics, and advanced deep learning algorithms. Specifically, we deploy cameras with zoom-lens and motorized head to capture license plate numbers by tracking the vehicles when they enter or leave the parking lot; cameras with wide angle fish-eye lens will monitor the large parking lot via our custom designed deep neural network. We further optimize the algorithm and enable the real-time deep learning inference in an edge device. Through the intelligent algorithm, we can significantly reduce the cost of existing systems, while achieving a more adaptable solution. For example, our system can automatically detect when a car enters the parking space, the location of the parking spot, and precisely charge the parking fee and associate thi

Question: What is the edge based smart parking solution?


Device analyzer: largescale mobile data collection. We collected usage information from 12,500 Android devices in the wild over the course of nearly 2 years. Our dataset contains 53 billion data points from 894 models of devices running 687 versions of Android. Processing the collected data presents a number of challenges ranging from scalability to consistency and privacy considerations. We present our system architecture for collection and analysis of this highly-distributed dataset, discuss how our system can reliably collect time-series data in the presence of unreliable timing information, and discuss issues and lessons learned that we believe apply to many other big data collection projects.

Question: What is the largest dataset of mobile data?


Needs, affect, and interactive products - Facets of user experience. Subsumed under the umbrella of User Experience (UX), practitioners and academics of Human–Computer Interaction look for ways to broaden their understanding of what constitutes ''pleasurable experiences" with technology. The present study considered the fulfilment of universal psychological needs, such as competence, relatedness, popularity, stimulation, meaning, security, or autonomy, to be the major source of positive experience with interactive technologies. To explore this, we collected over 500 positive experiences with interactive products (e.g., mobile phones, computers). As expected, we found a clear relationship between need fulfilment and positive affect, with stimulation, relatedness, competence and popularity being especially salient needs. Experiences could be further categorized by the primary need they fulfil, with apparent qualitative differences among some of the categories in terms of the emotions involved. Need fulfilment was clearly linked to hedonic quality perceptions, but not as strongly to pragmatic quality (i.e., perceived usability), which supports the notion of hedonic quality as ''motivator" and pragmatic quality as ''hygiene factor." Whether hedonic quality ratings reflected need fulfilment depended on the belief that the product was responsible for the experience (i.e., attribution). 2010 Elsevier B.V. All rights reserved.

Question: What are the different types of needs?


LEARNING USING A SIAMESE CONVOLUTIONAL NEURAL NETWORK. In this paper we describe learning of a descriptor based on the Siamese Convolutional Neural Network (CNN) architecture and evaluate our results on a standard patch comparison dataset. The descriptor learning architecture is composed of an input module, a Siamese CNN descriptor module and a cost computation module that is based on the L2 Norm. The cost function we use pulls the descriptors of matching patches close to each other in feature space while pushing the descriptors for non-matching pairs away from each other. Compared to related work, we optimize the training parameters by combining a moving average strategy for gradients and Nesterov's Accelerated Gradient. Experiments show that our learned descriptor reaches a good performance and achieves stateof-art results in terms of the false positive rate at a 95% recall rate on standard benchmark datasets. * Corresponding author

Question: What is the state of the art in descriptor learning?


Proliferation, cell cycle and apoptosis in cancer. Beneath the complexity and idiopathy of every cancer lies a limited number of 'mission critical' events that have propelled the tumour cell and its progeny into uncontrolled expansion and invasion. One of these is deregulated cell proliferation, which, together with the obligate compensatory suppression of apoptosis needed to support it, provides a minimal 'platform' necessary to support further neoplastic progression. Adroit targeting of these critical events should have potent and specific therapeutic consequences.

Question: What is the mission critical event in cancer?


FCM : THE FUZZY c-MEANS CLUSTERING ALGORITHM. nThis paper transmits a FORTRAN-IV coding of the fuzzy c-means (FCM) clustering program. The FCM program is applicable to a wide variety of geostatistical data analysis problems. This program generates fuzzy partitions and prototypes for any set of numerical data. These partitions are useful for corroborating known substructures or suggesting substructure in unexplored data. The clustering criterion used to aggregate subsets is a generalized least-squares objective function. Features of this program include a choice of three norms (Euclidean, Diagonal, or Mahalonobis), an adjustable weighting factor that essentially controls sensitivity to noise, acceptance of variable numbers of clusters, and outputs that include several measures of cluster validity.

Question: What is the fuzzy c-means clustering algorithm?


Fast Global Registration. We present an algorithm for fast global registration of partially overlapping 3D surfaces. The algorithm operates on candidate matches that cover the surfaces. A single objective is optimized to align the surfaces and disable false matches. The objective is defined densely over the surfaces and the optimization achieves tight alignment with no initialization. No correspondence updates or closest-point queries are performed in the inner loop. An extension of the algorithm can perform joint global registration of many partially overlapping surfaces. Extensive experiments demonstrate that the presented approach matches or exceeds the accuracy of state-of-the-art global registration pipelines, while being at least an order of magnitude faster. Remarkably, the presented approach is also faster than local refinement algorithms such as ICP. It provides the accuracy achieved by well-initialized local refinement algorithms, without requiring an initialization and at lower computational cost.

Question: How fast is the algorithm?


Technologies for Augmented Reality Systems: Realizing Ultrasound-Guided Needle Biopsies. We present a real-time stereoscopic video-see-through augmented reality (AR) system applied to the medical procedure known as ultrasound-guided needle biopsy of the breast. The AR system was used by a physician during procedures on breast models and during non-invasive examinations of human subjects. The system merges rendered live ultrasound data and geometric elements with stereo images of the patient acquired through head-mounted video cameras and presents these merged images to the physician in a head-mounted display. The physician sees a volume visualization of the ultrasound data directly under the ultrasound probe, properly registered within the patient and with the biopsy needle. Using this system, a physician successfully guided a needle into an artificial tumor within a training phantom of a human breast. We discuss the construction of the AR system and the issues and decisions which led to the system architecture and the design of the video see-through head-mounted display. We designed methods to properly resolve occlusion of the real and synthetic image elements. We developed techniques for realtime volume visualization of timeand position-varying ultrasound data. We devised a hybrid tracking system which achieves improved registration of synthetic and real imagery and we improved on previous techniques for calibration of a magnetic tracker. CR

Question: How to build an augmented reality system for ultrasound guided needle biopsies?


Exploration of adaptive gait patterns with a reconfigurable linkage mechanism. Legged robots are able to move across irregular terrains and some can be energy efficient, but are often constrained by a limited range of gaits which can limit their locomotion capabilities considerably. This paper reports a reconfigurable design approach to robotic legged locomotion that produces a wide variety of gait cycles, opening new possibilities for innovative applications. In this paper, we present a distance-based formulation and its application to solve the position analysis problem of a standard Theo Jansen mechanism. By changing the configuration of a linkage, our objective in this study is to identify novel gait patterns of interest for a walking platform. The exemplary gait variations presented in this work demonstrate the feasibility of our approach, and considerably extend the capabilities of the original design to not only produce novel cum useful gait patterns but also to realize behaviors beyond locomotion.

Question: What is a Theo Jansen mechanism?


A stretchable PIFA antenna. This paper presents a stretchable Planar Inverted-F Antenna (PIFA) based on a new metallization technique of depositing nanoscale thin (50/100nm) Au film on elastomer Polydimethylsiloxane (PDMS). The thin metal films can be reversibly stretched up to 20% without losing electrical conduction. The PIFA antenna made of new materials can work under a 10% strain and return to its original state after removal of an applied stress. Simulation and measurement results for the antenna performance are given.

Question: What is a PIFA antenna?


Is FLIP enough? Or should we use the FLIPPED model instead?. Yunglung Chen, Yuping Wang, Kinshuk, Nian-Shing Chen Department of Information Management, National Sun Yat-sen University, No. 70, Lienhai Rd., Kaohsiung 80424, Taiwan School of Languages and Linguistics, Griffith University, Nathan, 4111, Australia School of Computing and Information System, Athabasca University, Athabasca, Canada henryylchen@gmail.com, y.wang@griffith.edu.au, kinshuk@athabascau.ca, nschen@mis.nsysu.edu.tw

Question: What is the difference between FLIP and FLIPPED?


Exploring the Regularity of Sparse Structure in Convolutional Neural Networks. Sparsity helps reduce the computational complexity of deep neural networks by skipping zeros. Taking advantage of sparsity is listed as a high priority in next generation DNN accelerators such as TPU[1]. The structure of sparsity, i.e., the granularity of pruning, affects the efficiency of hardware accelerator design as well as the prediction accuracy. Coarse-grained pruning creates regular sparsity patterns, making it more amenable for hardware acceleration but more challenging to maintain the same accuracy. In this paper we quantitatively measure the trade-off between sparsity regularity and prediction accuracy, providing insights in how to maintain accuracy while having more a more structured sparsity pattern. Our experimental results show that coarse-grained pruning can achieve a sparsity ratio similar to unstructured pruning without loss of accuracy. Moreover, due to the index saving effect, coarse-grained pruning is able to obtain a better compression ratio than fine-grained sparsity at the same accuracy threshold. Based on the recent sparse convolutional neural network accelerator (SCNN), our experiments further demonstrate that coarse-grained sparsity saves∼ 2× the memory references compared to fine-grained sparsity. Since memory reference is more than two orders of magnitude more expensive than arithmetic operations, the regularity of sparse structure leads to more efficient hardware design.

Question: What is the trade-off between sparsity regularity and prediction accuracy?


Blockchain beyond bitcoin. Blockchain technology has the potential to revolutionize applications and redefine the digital economy.

Question: What is blockchain?


A Framework for Passengers Demand Prediction and Recommendation. With the rapid development of mobile internet and wireless network technologies, more and more people use the mobile app to call a taxicab to pick them up. Therefore, understanding the passengers' travel demand becomes crucial to improve the utilization of the taxicabs and reduce their cost. In this paper, based on spatio-temporal clustering, we propose a demand hotspots prediction framework to generate recommendation for taxi drivers. Specially, an adaptive prediction approach is presented to demand hotspots and their hotness, and then combing the driver's location and the hotness, top candidates are recommended and visually presented to drivers. Based on the dataset provided by CAR INC., the experiment shows that our approach gains a significant improvement in hotspots prediction and recommendation, with 15.21% improvement on average f-measure for prediction and 79.6% hit ratio for recommendation.

Question: What is the framework for passengers demand prediction and recommendation?


Multibiometric Cryptosystems Based on Feature-Level Fusion. Multibiometric systems are being increasingly de- ployed in many large-scale biometric applications (e.g., FBI-IAFIS, UIDAI system in India) because they have several advantages such as lower error rates and larger population coverage compared to unibiometric systems. However, multibiometric systems require storage of multiple biometric templates (e.g., fingerprint, iris, and face) for each user, which results in increased risk to user privacy and system security. One method to protect individual templates is to store only the secure sketch generated from the corresponding template using a biometric cryptosystem. This requires storage of multiple sketches. In this paper, we propose a feature-level fusion framework to simultaneously protect multiple templates of a user as a single secure sketch. Our main contributions include: (1) practical implementation of the proposed feature-level fusion framework using two well-known biometric cryptosystems, namery,fuzzy vault and fuzzy commitment, and (2) detailed analysis of the trade-off between matching accuracy and security in the proposed multibiometric cryptosystems based on two different databases (one real and one virtual multimodal database), each containing the three most popular biometric modalities, namely, fingerprint, iris, and face. Experimental results show that both the multibiometric cryptosystems proposed here have higher security and matching performance compared to their unibiometric counterparts.

Question: What is a biometric cryptosystem?


Prefrontal neuropsychological effects of sleep deprivation in young adults--a model for healthy aging?. Neuropsychological testing and brain imaging show that healthy aging leads to a preferential impairment of the prefrontal cortex (PFC). Interestingly, in young adults sleep deprivation (SD) has similar effects. Psychological tasks not so oriented to the PFC are less sensitive both to SD and aging. The PFC is a cortical region working particularly hard during wakefulness, which may make it more vulnerable to "deterioration," whether this is through aging or SD. In these respects SD in young adults may offer a model for aging. No study has directly compared aging with SD. We compared groups comprising (equal sexes): YOUNG (av. 23y), MIDDLE AGED (av. 60y) and OLD (av. 73y). Young were subdivided into SD and non-sleep deprived groups. All participants were carefully screened, were healthy, good sleepers and with a similar educational background. A battery of PFC-oriented, short and straightforward neuropsychological tests was used to compare the effects of 36h of SD in the young group, with findings from the healthy, alert, non-sleep deprived groups. Tests relied on accuracy rather than speed (which took into account the problem of "global slowing" in the older participants), and were administered once (i.e., were novel). Test outcomes were significantly affected by: (1) SD in the young groups, and (2) by age. A non-PFC component of one test was not affected by SD or by age. It was concluded that 36h SD in young adults produces effects on the PFC similar to those found in normal, alert people aged about 60 years. However, it can not be concluded that an aged brain is a sleep-deprived brain.

Question: What is the prefrontal cortex?


Fear bradycardia and activation of the human periaqueductal grey. Animal models of predator defense distinguish qualitatively different behavioral modes that are activated at increasing levels of predation threat. A defense mode observed at intermediate threat levels is freezing: a cessation of locomotion that is characterized by a parasympathetically dominated autonomic nervous system response that causes heart rate deceleration, or fear bradycardia. Studies in rodents have shown that freezing depends on amygdalar projections to the periaqueductal grey (PAG). In humans, freezing-like behaviors are implicated in development and maintenance of psychopathology, but neural mechanisms underlying freezing or its characteristic autonomic response profile have not been identified. Here, we combined event-related blood oxygenation level-dependent functional MRI (BOLD-fMRI) with autonomic response measures in a picture viewing paradigm to probe activity and interconnectivity within the amygdala-PAG pathway and test for an association with parasympathetic as opposed to sympathetic activation. In response to negatively arousing pictures, we observed parasympathetic (bradycardia) and sympathetic (pupil dilation) autonomic responses, BOLD responses in the amygdala and PAG, and effective connectivity between these regions. Critically, BOLD responses in the PAG to negative pictures correlated on a trial-by-trial basis with bradycardia but not pupil dilation. This correlation with bradycardia remained significant when partialling out pupil dilation. Additionally, activity in regions associated with motor planning and inhibition mirrored the PAG response. Thus, our findings implicate the human PAG in a parasympathetically dominated defense mode that subserves a state of attentive immobility. Mechanistic insight into this qualitatively distinct defense mode may importantly advance translational models of anxiety disorders.

Question: What is the periaqueductal grey?


Trending topic prediction on social network. The fast information sharing on social network services generates more than thousands of topics every day. It is extremely important for business organizations and administrative decision makers to learn the popularity of these topics as quickly as possible. In this paper, we propose a prediction mode based on SVM with features of three subsets: quantity specific features, quality and user specific features which supplement each other. Furthermore, we divide topic data into time slices which is used as a unit of feature construction. Our findings suggest that the capability of our prediction model outperforms previous methods and also reveals that subsets of features play different role in the prediction of trending topics.

Question: What is the prediction model based on SVM?


Usability evaluation considered harmful (some of the time). Current practice in Human Computer Interaction as encouraged by educational institutes, academic review processes, and institutions with usability groups advocate usability evaluation as a critical part of every design process. This is for good reason: usability evaluation has a significant role to play when conditions warrant it. Yet evaluation can be ineffective and even harmful if naively done 'by rule' rather than 'by thought'. If done during early stage design, it can mute creative ideas that do not conform to current interface norms. If done to test radical innovations, the many interface issues that would likely arise from an immature technology can quash what could have been an inspired vision. If done to validate an academic prototype, it may incorrectly suggest a design's scientific worthiness rather than offer a meaningful critique of how it would be adopted and used in everyday practice. If done without regard to how cultures adopt technology over time, then today's reluctant reactions by users will forestall tomorrow's eager acceptance. The choice of evaluation methodology - if any - must arise from and be appropriate for the actual problem or research question under consideration.

Question: What is usability evaluation?


A comprehensive and conservative approach for the restoration of abrasion and erosion. Part I: concepts and clinical rationale for early intervention using adhesive techniques.. Tooth wear represents a frequent pathology with multifactorial origins. Behavioral changes, unbalanced diet, various medical conditions and medications inducing acid regurgitation or influencing saliva composition and flow rate, trigger tooth erosion. Awake and sleep bruxism, which are widespread nowadays with functional disorders, induce attrition. It has become increasingly important to diagnose early signs of tooth wear so that proper preventive, and if needed, restorative measures are taken. Such disorders have biological, functional, and also esthetic consequences. Following a comprehensive clinical evaluation, treatment objectives, such as a proper occlusal and anatomical scheme as well as a pleasing smile line, are usually set on models with an anterior teeth full-mouth waxup, depending on the severity of tissue loss. Based on the new vertical dimension of occlusion (VDO), combinations of direct and indirect restorations can then help to reestablish anatomy and function. The use of adhesive techniques and resin composites has demonstrated its potential, in particular for the treatment of moderate tooth wear. Part I of this article reviews recent knowledge and clinical concepts dealing with the various forms of early restorative interventions and their potential to restrict ongoing tissue destruction.

Question: What is the difference between a comprehensive and conservative approach for the restoration of abrasion and erosion?


From learning models of natural image patches to whole image restoration. Learning good image priors is of utmost importance for the study of vision, computer vision and image processing applications. Learning priors and optimizing over whole images can lead to tremendous computational challenges. In contrast, when we work with small image patches, it is possible to learn priors and perform patch restoration very efficiently. This raises three questions - do priors that give high likelihood to the data also lead to good performance in restoration? Can we use such patch based priors to restore a full image? Can we learn better patch priors? In this work we answer these questions. We compare the likelihood of several patch models and show that priors that give high likelihood to data perform better in patch restoration. Motivated by this result, we propose a generic framework which allows for whole image restoration using any patch based prior for which a MAP (or approximate MAP) estimate can be calculated. We show how to derive an appropriate cost function, how to optimize it and how to use it to restore whole images. Finally, we present a generic, surprisingly simple Gaussian Mixture prior, learned from a set of natural images. When used with the proposed framework, this Gaussian Mixture Model outperforms all other generic prior methods for image denoising, deblurring and inpainting.

Question: How to learn priors for image restoration?


A probabilistic approach to spatiotemporal theme pattern mining on weblogs. Mining subtopics from weblogs and analyzing their spatiotemporal patterns have applications in multiple domains. In this paper, we define the novel problem of mining spatiotemporal theme patterns from weblogs and propose a novel probabilistic approach to model the subtopic themes and spatiotemporal theme patterns simultaneously. The proposed model discovers spatiotemporal theme patterns by (1) extracting common themes from weblogs; (2) generating theme life cycles for each given location; and (3) generating theme snapshots for each given time period. Evolution of patterns can be discovered by comparative analysis of theme life cycles and theme snapshots. Experiments on three different data sets show that the proposed approach can discover interesting spatiotemporal theme patterns effectively. The proposed probabilistic model is general and can be used for spatiotemporal text mining on any domain with time and location information.

Question: What is a probabilistic approach to spatiotemporal theme pattern mining on weblogs?


Loosely-Coupled Benchmark Framework Automates Performance Modeling on IaaS Clouds. Cloud computing is under rapid development, which brings the urgent need of evaluation and comparison of cloud systems. The performance testers often struggle in tedious manual operations, when carrying out lots of similar experiments on the cloud systems. However, few of current benchmark tools provide both flexible workflow controlling methodology and extensible workload abstraction at the same time. We present a modeling methodology to compare the performance from multiple aspects based on a loosely coupled benchmark framework, which automates experiments under agile workflow controlling and achieves broad cloud supports, as well as good workload extensibility. With several built-in workloads and scenario templates, we performed a series of tests on Amazon EC2 services and our private Open Stack-based cloud, and analyze the elasticity and scalability based on the performance models. Experiments show the robustness and compatibility of our framework, which makes remarkable guarantee that it can be leveraged in practice for researchers and testers to perform their further study.

Question: What is the performance of the cloud?


Preventing Cell Phone Intrusion and Theft using Biometrics. Most cell phones use a password, PIN, or visual pattern to secure the phone. With these types of security methods being used, there is much vulnerability. Another alternative is biometric authentication. Biometric security systems have been researched for many years. Some mobile manufacturers have implemented fingerprint scanners into their phones, such as the old Fujitsu F505i [7] and the current Motorola Atrix. Since theft of cell phones is becoming more common every day, there is a real need for a security system that not only protects the data, but the phone itself. It is proposed through this research that a biometric security system be the alternative to knowledge-based and password-based authentication. Furthermore, a device dongle must be implemented into this infrastructure to establish a reliable security system that deters theft for the majority; biometrics alone is not sufficient. Cell phones need power and must be charged almost daily. A biometric phone charger that acts as a dongle with a solid state relay, will be presented as a viable solution to theft in this research. Additionally, it will be shown through the results of this research that a system dependant only on biometrics is unreliable and unsecure. Essentially, a mobile security system that combines biometrics with dongle technology is believed to be the ideal solution for limiting the black market of stolen cell phones; without the biometric charger/dongle, the stolen cell phone would be rendered useless.

Question: How to prevent cell phone theft?


Chapter 6: Models of Process Variations in Device and Interconnect. Variation is the deviation from intended or designed values for a structure or circuit parameter of concern. The electrical performance of microprocessors or other integrated circuits are impacted by two sources of variation. Environmental factors are those which arise during the operation of a circuit, and include variations in power supply, switching activity, and temperature of the chip or across the chip. Physical factors during manufacture result in structural device and interconnect variations which are essentially permanent. These variations arise due to processing and masking limitations, and result in random or spatially varying deviations from designed parameter values. in this chapter we will focus on parametric variation due to continuously varying structural or electrical parameters, as these can signi cantly impact not only yield but also performance in high speed microprocessor and other digital circuits. Such parametric variation is becoming a larger concern, as variation and margins for device and

Question: What is the difference between parametric variation and structural variation?


Chip and Skim: Cloning EMV Cards with the Pre-play Attack. EMV, also known as "Chip and PIN", is the leading system for card payments worldwide. It is used throughout Europe and much of Asia, and is starting to be introduced in North America too. Payment cards contain a chip so they can execute an authentication protocol. This protocol requires point-of-sale (POS) terminals or ATMs to generate a nonce, called the unpredictable number, for each transaction to ensure it is fresh. We have discovered two serious problems: a widespread implementation flaw and a deeper, more difficult to fix flaw with the EMV protocol itself. The first flaw is that some EMV implementers have merely used counters, timestamps or home-grown algorithms to supply this nonce. This exposes them to a "pre-play" attack which is indistinguishable from card cloning from the standpoint of the logs available to the card-issuing bank, and can be carried out even if it is impossible to clone a card physically. Card cloning is the very type of fraud that EMV was supposed to prevent. We describe how we detected the vulnerability, a survey methodology we developed to chart the scope of the weakness, evidence from ATM and terminal experiments in the field, and our implementation of proof-of-concept attacks. We found flaws in widely-used ATMs from the largest manufacturers. We can now explain at least some of the increasing number of frauds in which victims are refused refunds by banks which claim that EMV cards cannot be cloned and that a customer involved in a dispute must therefore be mistaken or complicit. The second problem was exposed by the above work. Independent of the random number quality, there is a protocol failure: the actual random number generated by the terminal can simply be replaced by one the attacker used earlier when capturing an authentication code from the card. This variant of the pre-play attack may be carried out by malware in an ATM or POS terminal, or by a man-in-the-middle betwe

Question: What is the difference between chip and pin and chip and signature?


Non-Local Patch-Based Image Inpainting. Image inpainting is the process of filling in missing regions in an image in a plausible way. In this contribution, we propose and describe an implementation of a patch-based image inpainting algorithm. The method is actually a two-dimensional version of our video inpainting algorithm proposed in [16]. The algorithm attempts to minimise a highly non-convex functional, first introducted by Wexler et al. in [18]. The functional specifies that a good solution to the inpainting problem should be an image where each patch is very similar to its nearest neighbour in the unoccluded area. Iterations are performed in a multi-scale framework which yields globally coherent results. In this manner two of the major goals of image inpainting, the correct reconstruction of textures and structures, are addressed. We address a series of important practical issues which arise when using such an approach. In particular, we reduce execution times by using the PatchMatch [3] algorithm for nearest neighbour searches, and we propose a modified patch distance which improves the comparison of textured patches. We address the crucial issue of initialisation and the choice of the number of pyramid levels, two points which are rarely discussed in such approaches. We provide several examples which illustrate the advantages of our algorithm, and compare our results with those of state-of-the-art methods.

Question: What is the difference between a patch-based image inpainting algorithm and a patch-based video inpainting algorithm?


Fast Point Feature Histograms (FPFH) for 3D registration. In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point cloud datasets. In this paper, we modify their mathematical expressions and perform a rigorous analysis on their robustness and complexity for the problem of 3D registration for overlapping point cloud views. More concretely, we present several optimizations that reduce their computation times drastically by either caching previously computed values or by revising their theoretical formulations. The latter results in a new type of local features, called Fast Point Feature Histograms (FPFH), which retain most of the discriminative power of the PFH. Moreover, we propose an algorithm for the online computation of FPFH features for realtime applications. To validate our results we demonstrate their efficiency for 3D registration and propose a new sample consensus based method for bringing two datasets into the convergence basin of a local non-linear optimizer: SAC-IA (SAmple Consensus Initial Alignment).

Question: What is the difference between the fast point feature histograms and the point feature histograms?


A Multi-Cloud Framework for Measuring and Describing Performance Aspects of Cloud Services Across Different Application Types. Cloud services have emerged as an innovative IT provisioning model in the recent years. However, after their usage severe considerations have emerged with regard to their varying performance due to multitenancy and resource sharing issues. These issues make it very difficult to provide any kind of performance estimation during application design or deployment time. The aim of this paper is to present a mechanism and process for measuring the performance of various Cloud services and describing this information in machine understandable format. The framework is responsible for organizing the execution and can support multiple Cloud providers. Furthermore we present approaches for measuring service performance with the usage of specialized metrics for ranking the services according to a weighted combination of cost, performance and workload.

Question: What is a multi-cloud framework?


CEET: A Compressed Encrypted & Embedded Technique for Digital Image Steganography. In this information era, digital information sharing and transfer plays a vital role and their use has increased exponentially with the development of technology. Thus providing security of data is a topic of concern. Data hiding is a powerful tool that provides mechanism for securing data over insecure channel by concealing information within information. Steganography inherits data hiding concept and passes information through host files in such a way that the existence of the embedded secret is unknown. This paper presents a joint application of compression, encryption and embedding techniques for implementing digital image steganography. Compression technique generates noise in the image. Inorder to retain the noise distortion to a minimum level, LSB insertion method is used for embedding purpose where the bits are inserted at the last 2 LSB's of the image. In this proposed technique the secret information is initially compressed and then the resultant bits are encrypted. Finally these encrypted bits are embedded into an image. The main objective is to develop an application that increases the steganographic capacity and enhances the stego image quality while keeping the security intact.

Question: What is steganography?


Aesthetics and Entropy III . Aesthetic measures 2. 1 Consultant, Maplewood, MN USA 4 * Correspondence: sahyun@infionline.net; 1-(651)-927-9686 5 6 Abstract: We examined a series of real-world, pictorial photographs with varying 7 characteristics, along with their modification by noise addition and unsharp masking. As 8 response metrics we used three different versions of the aesthetic measure originally 9 proposed by Birkhoff. The first aesthetic measure, which has been used in other studies, 10 and which we used in our previous work as well, showed a preference for the least 11 complex of the images. It provided no justification for noise addition, but did reveal 12 enhancement on unsharp masking. Optimum level of unsharp masking varied with the 13 image, but was predictable from the individual image's GIF compressibility. We expect this 14 result to be useful for guiding the processing of pictorial photographic imagery. The 15 second aesthetic measure, that of informational aesthetics based on entropy alone failed 16 to provide useful discrimination among the images or the conditions of their modification. 17 A third measure, derived from the concepts of entropy maximization, as well as the 18 hypothesized preference of observers for "simpler", i.e., more compressible, images, 19 yielded qualitatively the same results as the more traditional version of the measure. 20 Differences among the photographs and the conditions of their modification were more 21 clearly defined with this metric, however. 22

Question: What is the difference between the aesthetic measure and the second aesthetic measure?


Theorizing Language Teacher Identity : Three Perspectives and Beyond.

Question: What is theorizing language teacher identity?


Frequency-Reconfigurable Low-Profile Circular Monopolar Patch Antenna. A novel frequency-reconfigurable antenna is presented based on a circular monopolar patch antenna. The antenna comprises of a center-fed circular patch surrounded by four sector-shaped patches. Eight varactor diodes are introduced to bridge the gaps between the circular patch and the sector-shaped patches. By changing the reverse bias voltage of the varactor diodes, the antenna can be switched in the operating frequency. A fully functional prototype is developed and tested, which exhibits a continuously tunable frequency band from 1.64 GHz to 2.12 GHz. The measured efficiency rises from about 45% to about 85% as the operating frequency increases from 1.64 GHz to 2.12 GHz. Stable monopole like radiation patterns are achieved at all operating frequencies. In addition, the antenna owns a low-profile structure (0.04 free-space wavelengths at 1.9 GHz). The frequency selective feature and stable radiation patterns make the antenna potentially suitable for future wireless communication systems, such as cognitive radio.

Question: What is a frequency-reconfigurable antenna?


Low-Cost Dual-Band Circularly Polarized Switched-Beam Array for Global Navigation Satellite System. This paper presents the design and development of a dual-band switched-beam microstrip array for global navigation satellite system (GNSS) applications such as ocean reflectometry and remote sensing. In contrast to the traditional Butler matrix, a simple, low cost, broadband and low insertion loss beam switching feed network is proposed, designed and integrated with a dual band antenna array to achieve continuous beam coverage of ±25° around the boresight at the L1 (1.575 GHz) and L2 (1.227 GHz) bands. To reduce the cost, microstrip lines and PIN diode based switches are employed. The proposed switched-beam network is then integrated with dual-band step-shorted annular ring (S-SAR) antenna elements in order to produce a fully integrated compact-sized switched-beam array. Antenna simulation results show that the switched-beam array achieves a maximum gain of 12 dBic at the L1 band and 10 dBic at the L2 band. In order to validate the concept, a scaled down prototype of the simulated design is fabricated and measured. The prototype operates at twice of the original design frequency, i.e., 3.15 GHz and 2.454 GHz and the measured results confirm that the integrated array achieves beam switching and good performance at both bands.

Question: What is the difference between a circularly polarized and a linearly polarized antenna?


A SEM-neural network approach for predicting antecedents of m-commerce acceptance. Higher penetration of powerful mobile devices – especially smartphones – and high-speed mobile internet access are leading to better offer and higher levels of usage of these devices in commercial activities, especially among young generations. The purpose of this paper is to determine the key factors that influence consumers' adoption of mobile commerce. The extended model incorporates basic TAM predictors, such as perceived usefulness and perceived ease of use, but also several external variables, such as trust, mobility, customization and customer involvement. Data was collected from 224 m-commerce consumers. First, structural equation modeling (SEM) was used to determine which variables had signif-

Question: What is the purpose of this paper?


Microscopic and Macroscopic Spatio-Temporal Topic Models for Check-in Data. Twitter, together with other online social networks, such as Facebook, and Gowalla have begun to collect hundreds of millions of check-ins. Check-in data captures the spatial and temporal information of user movements and interests. To model and analyze the spatio-temporal aspect of check-in data and discover temporal topics and regions, we first propose a spatio-temporal topic model, i.e., Upstream Spatio-Temporal Topic Model (USTTM). USTTM can discover temporal topics and regions, i.e., a user's choice of region and topic is affected by time in this model. We use continuous time to model check-in data, rather than discretized time, avoiding the loss of information through discretization. In addition, USTTM captures the property that user's interests and activity space will change over time, and users have different region and topic distributions at different times in USTTM. However, both USTTM and other related models capture "microscopic patterns" within a single city, where users share POIs, and cannot discover "macroscopic" patterns in a global area, where users check-in to different POIs. Therefore, we also propose a macroscopic spatio-temporal topic model, MSTTM, employing words of tweets that are shared between cities to learn the topics of user interests. We perform an experimental evaluation on Twitter and Gowalla data sets from New York City and on a Twitter US data set. In our qualitative analysis, we perform experiments with USTTM to discover temporal topics, e.g., how topic "tourist destinations" changes over time, and to demonstrate that MSTTM indeed discovers macroscopic, generic topics. In our quantitative analysis, we evaluate the effectiveness of USTTM in terms of perplexity, accuracy of POI recommendation, and accuracy of user and time prediction. Our results show that the proposed USTTM achieves better performance than the state-of-the-art models, confirming that it is m

Question: What is the difference between microscopic and macroscopic spatio-temporal topic models?


Sex differences in the human olfactory system. The olfactory system (accessory) implicated in reproductive physiology and behavior in mammals is sexually dimorphic. These brain sex differences present two main characteristics: they are seen in neural circuits related to sexual behavior and sexual physiology and they take one of two opposite morphological patterns (male>female or female>male). The present work reports sex differences in the olfactory system in a large homogeneous sample of men (40) and women (51) using of voxel-based morphology. Gray matter concentration showed sexual dimorphism in several olfactory regions. Women have a higher concentration in the orbitofrontal cortex involving Brodmann's areas 10, 11 and 25 and temporomedial cortex (bilateral hippocampus and right amygdala), as well as their left basal insular cortex. In contrast, men show a higher gray matter concentration in the left entorhinal cortex (Brodmann's area 28), right ventral pallidum, dorsal left insular cortex and a region of the orbitofrontal cortex (Brodmann's area 25). This study supports the hypothesis that the mammalian olfactory system is a sexually dimorphic network and provides a theoretical framework for the morphofunctional approach to sex differences in the human brain.

Question: What is the difference between the male and female olfactory system?


Customer churn analysis : A case study on the telecommunication industry of Thailand. Customer churn creates a huge anxiety in highly competitive service sectors especially the telecommunications sector. The objective of this research was to develop a predictive churn model to predict the customers that will be to churn; this is the first step to construct a retention management plan. The dataset was extracted from the data warehouse of the mobile telecommunication company in Thailand. The system generated the customer list, to implement a retention campaign to manage the customers with tendency to leave the company. WEKA software was used to implement the followings techniques: C4.5 decision trees algorithm, the logistic regression algorithm and the neural network algorithm. The C4.5 algorithm of decision trees proved optimal among the models. The findings are unequivocally beneficial to industry and other partners.

Question: What is customer churn?


THRIVE: Threshold Homomorphic encryption based secure and privacy preserving bIometric VErification system. In this paper, we introduce a new biometric verification and template protection system which we call THRIVE. The system includes novel enrollment and authentication protocols based on threshold homomorphic encryption where a private key is shared between a user and a verifier. In the THRIVE system, only encrypted binary biometric templates are stored in a database and verification is performed via homomorphically randomized templates, thus, original templates are never revealed during authentication. Due to the underlying threshold homomorphic encryption scheme, a malicious database owner cannot perform full decryption on encrypted templates of the users in the database. In addition, security of the THRIVE system is enhanced using a two-factor authentication scheme involving user's private key and biometric data. Using simulation-based techniques, the proposed system is proven secure in the malicious model. The proposed system is suitable for applications where the user does not want to reveal her biometrics to the verifier in plain form, but needs to prove her identity by using biometrics. The system can be used with any biometric modality where a feature extraction method yields a fixed size binary template and a query template is verified when its Hamming distance to the database template is less than a threshold. The overall connection time for the proposed THRIVE system is estimated to be 336 ms on average for 256-bit biometric templates on a desktop PC running with quad core 3.2 GHz CPUs at 10 Mbit/s up/down link connection speed. Consequently, the proposed system can be efficiently used in real-life applications.

Question: What is the connection time for the proposed system?


Feature combination strategies for saliency-based visual attention systems. acin ral eais a000 Abstract. Bottom-up or saliency-based visual attention allows primates to detect nonspecific conspicuous targets in cluttered scenes. A classical metaphor, derived from electrophysiological and psychophysical studies, describes attention as a rapidly shiftable ''spotlight.'' We use a model that reproduces the attentional scan paths of this spotlight. Simple multi-scale ''feature maps'' detect local spatial discontinuities in intensity, color, and orientation, and are combined into a unique ''master'' or ''saliency'' map. The saliency map is sequentially scanned, in order of decreasing saliency, by the focus of attention. We here study the problem of combining feature maps, from different visual modalities (such as color and orientation), into a unique saliency map. Four combination strategies are compared using three databases of natural color images: (1) Simple normalized summation, (2) linear combination with learned weights, (3) global nonlinear normalization followed by summation, and (4) local nonlinear competition between salient locations followed by summation. Performance was measured as the number of false detections before the most salient target was found. Strategy (1) always yielded poorest performance and (2) best performance, with a threefold to eightfold improvement in time to find a salient target. However, (2) yielded specialized systems with poor generalization. Interestingly, strategy (4) and its simplified, computationally efficient approximation (3) yielded significantly better performance than (1), with up to fourfold improvement, while preserving generality. © 2001 SPIE and IS&T. [DOI: 10.1117/1.1333677]

Question: What is the difference between saliency and attention?


Attention Alignment Multimodal LSTM for Fine-Gained Common Space Learning. We address the problem common space learning approach that maps all related multimodal information into a common space for multimodal data. To establish a fine-grained common space, the aligned relevant local information of different modalities is used to learn a common subspace where the projected fragmented information is further integrated according to intra-modal semantic relationships. Specifically, we propose a novel multimodal LSTM with an attention alignment mechanism, namely attention alignment multimodal LSTM (AAM-LSTM), which mainly includes attentional alignment recurrent network (AA-R) and hierarchical multimodal LSTM (HM-LSTM). Different from the traditional methods which operate on the full modal data directly, the proposed model exploits the inter-modal and intra-modal semantic relationships of local information, to jointly establish a uniform representation of multi-modal data. Specifically, AA-R automatically captures semantic-aligned local information to learn common subspace without the need of supervised labels, then HM-LSTM leverages the potential relationships of these local information to learn a fine-grained common space. The experimental results on Filker30K, Filker8K, and Filker30K entities verify the performance and effectiveness of our model, which compares favorably with the state-of-the-art methods. In particular, the experiment of phrase localization on AA-R with Filker30K entities shows the expected accurate attention alignment. Moreover, from the experiment results of image-sentence retrieval tasks, it can be concluded that the proposed AAM-LSTM outperforms benchmark algorithms by a large margin.

Question: Attentional alignment multimodal LSTM


MODIFIED MULTILOOK CROSS CORRELATION ( MLCC ) ALGORITHM FOR DOPPLER CENTROID ESTIMATION IN SYNTHETIC APERTURE RADAR SIGNAL PROCESS -. The Multilook Cross Correlation (MLCC) is one of the most reliable algorithms used for Doppler ambiguity number estimation of the Doppler centroid parameter. However, the existing MLCC algorithm is only suitable for low contrast scenes. In high contrast scenes, the estimated result is not reliable, and the error is unacceptable. Besides, the Doppler centroid estimation processing time is long and can only be used in offline processing. In this paper, we introduce a modified MLCC algorithm that has better sensitivity which is suitable not only for low contrast scenes, but also for high contrast scenes. In addition, the modified MLCC algorithm can be implemented on parallel signal processing units for better time efficiency. Experiments with RADARSAT-1 data show that the modified algorithm works well in both high and low contrast scenes.

Question: What is the modified MLCC algorithm?


A Content-Adaptively Sparse Reconstruction Method for Abnormal Events Detection With Low-Rank Property. This paper presents a content-adaptively sparse reconstruction method for abnormal events detection by exploiting the low-rank property of video sequences. In dictionary learning phase, the bases which describe more important characteristics of the normal behavior patterns are assigned with lower reconstruction costs. Based on the low-rank property of the bases captured by the low-rank approximation, a weighted sparse reconstruction method is proposed to measure the abnormality of testing samples. Multiscale 3-D gradient features, which encode the spatiotemporal information, are adopted as the low level descriptors. The benefits of the proposed method are threefold: first, the low-rank property is utilized to learn the underlying normal dictionaries, which can represent groups of similar normal features effectively; second, the sparsity-based algorithm can adaptively determine the number of dictionary bases, which makes it a preferable choice for representing the dynamic scene semantics; and third, based on the weighted sparse reconstruction method, the proposed method is more efficient for detecting the abnormal events. Experimental results on the public datasets have shown that the proposed method yields competitive performance comparing with the state-of-the-art methods.

Question: What is the low-rank property?


Learning Ensembles of Convolutional Neural Networks. Ensemble learning is a method for generating multiple versions of a predictor network and using them to get an aggregated prediction. Given a learning set Ω consists of data {(yn, ~xn), n = 1, ..., N} where y is the class label and ~x is the inputing feature, we train a predictor φ(~x,Ω). With different initialization, we obtain a series of predictors {φk}. Our object is to use the {φk} to get a better predictor, φA.

Question: What is the difference between ensemble learning and multiple classifiers?


Application of CFD in building performance simulation for the outdoor environment : an overview. This paper provides an overview of the application of CFD in building performance simulation for the outdoor environment, focused on four topics: (1) pedestrian wind environment around buildings, (2) wind-driven rain on building facades, (3) convective heat transfer coefficients at exterior building surfaces, and (4) air pollutant dispersion around buildings. For each topic, its background, the need for CFD, an overview of some past CFD studies, a discussion about accuracy and some perspectives for practical application are provided. The paper indicates that for all four topics, CFD offers considerable advantages compared to wind tunnel modelling or (semi-)empirical formulae because it can provide detailed whole-flow field data under fully controlled conditions and without similarity constraints. The main limitations are the deficiencies of steady RANS modelling, the increased complexity and computational expense of LES and the requirement of systematic and time-consuming CFD solution verification and validation studies.

Question: What is the difference between CFD and wind tunnel modelling?


Censoring Representations with an Adversary. In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying information. We address these two related issues by learning flexible representations that minimize the capability of an adversarial critic. This adversary is trying to predict the relevant sensitive variable from the representation, and so minimizing the performance of the adversary ensures there is little or no information in the representation about the sensitive variable. We demonstrate this adversarial approach on two problems: making decisions free from discrimination and removing private information from images. We formulate the adversarial model as a minimax problem, and optimize that minimax objective using a stochastic gradient alternate min-max optimizer. We demonstrate the ability to provide discriminant free representations for standard test problems, and compare with previous state of the art methods for fairness, showing statistically significant improvement across most cases. The flexibility of this method is shown via a novel problem: removing annotations from images, from separate training examples of annotated and unannotated images, and with no a priori knowledge of the form of annotation provided to the model.

Question: How to remove sensitive information from images?


Age estimation via face images: a survey. Facial aging adversely impacts performance of face recognition and face verification and authentication using facial features. This stochastic personalized inevitable process poses dynamic theoretical and practical challenge to the computer vision and pattern recognition community. Age estimation is labeling a face image with exact real age or age group. How do humans recognize faces across ages? Do they learn the pattern or use age-invariant features? What are these age-invariant features that uniquely identify one across ages? These questions and others have attracted significant interest in the computer vision and pattern recognition research community. In this paper, we present a thorough analysis of recent research in aging and age estimation. We discuss popular algorithms used in age estimation, existing models, and how they compare with each other; we compare performance of various systems and how they are evaluated, age estimation challenges, and insights for future research.

Question: How do humans recognize faces across ages?


ANMPI-BASED PARALLEL AND DISTRIBUTED MACHINE LEARNING PLATFORM ON LARGE-SCALE HPC CLUSTERS. This paper presents the design of an MPI-based parallel and distributed machine learning platform on large-scale HPC clusters. Researchers and practitioners can implement easily a class of parallelizable machine learning algorithms on the platform, or port quickly an existing non-parallel implementation of a parallelizable algorithm to the platform with only minor modifications. Complicated functions in parallel programming such as scheduling, caching and load balancing are handled automatically by the platform. The platform performance was evaluated in a series of stress tests by using a k-means clustering task on 7,500 hours of speech data (about 2.7 billion 52dimensional feature vectors). Good scalability is demonstrated on an HPC cluster with thousands of CPU cores.

Question: What is the size of the canadian military?


Adoption of business continuity planning processes in IT service management. For any fault of the same severity level, traditional fault discovery and notification tools provide equal weighting from business points of view. To improve the fault correlation from business perspectives, we proposed a framework to automate network and system alerts with respect to its business service impact for proactive notification to IT operations management. This paper outlines the value of business continuity planning (BCP) during the course of service impact analysis, placing particular emphasis on the business perspective in the processes of IT service management. The framework explicitly employs BCP relevant processes in order to identify the relationships between business services and IT resources A practical case in IT operations to illustrate the concept was then conducted.

Question: What is the value of business continuity planning?


Detecting Anomalous Trajectories and Behavior Patterns Using Hierarchical Clustering from Taxi GPS Data. Anomalous taxi trajectories are those chosen by a small number of drivers that are different from the regular choices of other drivers. These anomalous driving trajectories provide us an opportunity to extract driver or passenger behaviors and monitor adverse urban traffic events. Because various trajectory clustering methods have previously proven to be an effective means to analyze similarities and anomalies within taxi GPS trajectory data, we focus on the problem of detecting anomalous taxi trajectories, and we develop our trajectory clustering method based on the edit distance and hierarchical clustering. To achieve this objective, first, we obtain all the taxi trajectories crossing the same source–destination pairs from taxi trajectories and take these trajectories as clustering objects. Second, an edit distance algorithm is modified to measure the similarity of the trajectories. Then, we distinguish regular trajectories and anomalous trajectories by applying adaptive hierarchical clustering based on an optimal number of clusters. Moreover, we further analyze these anomalous trajectories and discover four anomalous behavior patterns to speculate on the cause of an anomaly based on statistical indicators of time and length. The experimental results show that the proposed method can effectively detect anomalous trajectories and can be used to infer clearly fraudulent driving routes and the occurrence of adverse traffic events.

Question: How to detect anomalous trajectories?


Translation techniques in cross-language information retrieval. Cross-language information retrieval (CLIR) is an active sub-domain of information retrieval (IR). Like IR, CLIR is centered on the search for documents and for information contained within those documents. Unlike IR, CLIR must reconcile queries and documents that are written in different languages. The usual solution to this mismatch involves translating the query and/or the documents before performing the search. Translation is therefore a pivotal activity for CLIR engines. Over the last 15 years, the CLIR community has developed a wide range of techniques and models supporting free text translation. This article presents an overview of those techniques, with a special emphasis on recent developments.

Question: What is the difference between IR and CLIR?


Water content of latent fingerprints - Dispelling the myth.. Changing procedures in the handling of rare and precious documents in museums and elsewhere, based on assumptions about constituents of latent fingerprints, have led the author to an examination of available data. These changes appear to have been triggered by one paper using general biological data regarding eccrine sweat production to infer that deposited fingerprints are mostly water. Searching the fingerprint literature has revealed a number of reference works similarly quoting figures for average water content of deposited fingerprints of 98% or more. Whilst accurate estimation is difficult there is no evidence that the residue on fingers could be anything like 98% water, even if there were no contamination from sebaceous glands. Consideration of published analytical data of real fingerprints, and several theoretical considerations regarding evaporation and replenishment rates, indicates a probable initial average water content of a fingerprint, soon after deposition, of 20% or less.

Question: What is the average water content of a fingerprint?


LRAGE: Learning Latent Relationships With Adaptive Graph Embedding for Aerial Scene Classification. The performance of scene classification relies heavily on the spatial and structural features that are extracted from high spatial resolution remote-sensing images. Existing approaches, however, are limited in adequately exploiting latent relationships between scene images. Aiming to decrease the distances between intraclass images and increase the distances between interclass images, we propose a latent relationship learning framework that integrates an adaptive graph with the constraints of the feature space and label propagation for high-resolution aerial image classification. To describe the latent relationships among scene images in the framework, we construct an adaptive graph that is embedded into the constrained joint space for features and labels. To remove redundant information and improve the computational efficiency, subspace learning is introduced to assist in the latent relationship learning. To address out-of-sample data, linear regression is adopted to project the semisupervised classification results onto a linear classifier. Learning efficiency is improved by minimizing the objective function via the linearized alternating direction method with an adaptive penalty. We test our method on three widely used aerial scene image data sets. The experimental results demonstrate the superior performance of our method over the state-of-the-art algorithms in aerial scene image classification.

Question: What is the name of the method?


ANNarchy: a code generation approach to neural simulations on parallel hardware. Many modern neural simulators focus on the simulation of networks of spiking neurons on parallel hardware. Another important framework in computational neuroscience, rate-coded neural networks, is mostly difficult or impossible to implement using these simulators. We present here the ANNarchy (Artificial Neural Networks architect) neural simulator, which allows to easily define and simulate rate-coded and spiking networks, as well as combinations of both. The interface in Python has been designed to be close to the PyNN interface, while the definition of neuron and synapse models can be specified using an equation-oriented mathematical description similar to the Brian neural simulator. This information is used to generate C++ code that will efficiently perform the simulation on the chosen parallel hardware (multi-core system or graphical processing unit). Several numerical methods are available to transform ordinary differential equations into an efficient C++code. We compare the parallel performance of the simulator to existing solutions.

Question: What is a neural simulator?


Structurally-Sensitive Multi-Scale Deep Neural Network for Low-Dose CT Denoising. Computed tomography (CT) is a popular medical imaging modality and enjoys wide clinical applications. At the same time, the X-ray radiation dose associated with CT scannings raises a public concern due to its potential risks to the patients. Over the past years, major efforts have been dedicated to the development of low-dose CT (LDCT) methods. However, the radiation dose reduction compromises the signal-to-noise ratio, leading to strong noise and artifacts that down-grade the CT image quality. In this paper, we propose a novel 3-D noise reduction method, called structurally sensitive multi-scale generative adversarial net, to improve the LDCT image quality. Specifically, we incorporate 3-D volumetric information to improve the image quality. Also, different loss functions for training denoising models are investigated. Experiments show that the proposed method can effectively preserve the structural and textural information in reference to the normal-dose CT images and significantly suppress noise and artifacts. Qualitative visual assessments by three experienced radiologists demonstrate that the proposed method retrieves more information and outperforms competing methods.

Question: What is the difference between a generative adversarial net and a deep neural net?


Paternal filicide in Québec.. In this retrospective study, relevant demographic, social, and clinical variables were examined in 77 cases of paternal filicide. Between 1991 and 2001, all consecutive coroners' files on domestic homicide in Québec, Canada, were reviewed, and 77 child victims of 60 male parent perpetrators were identified. The results support data indicating that more fathers commit filicide than do mothers. A history of family abuse was characteristic of a substantial number of cases, and most of the cases involved violent means of homicide. Filicide was frequently (60%) followed by the suicide of the perpetrator and more so (86%) in cases involving multiple sibling victims. The abuse of drugs and alcohol was rare. At the time of the offense, most of the perpetrators were suffering from a psychiatric illness, usually depressive disorder. Nearly one-third were in a psychotic state. The proportion of fatal abuse cases was comparatively low. Many of the perpetrators had had contact with health professionals prior to the offense, although none had received treatment for a psychiatric illness.

Question: What is paternal filicide?


A Fuzzy logic controller for stabilization and control of Double Inverted Pendulum ( DIP ) using different Membership functions ( MF ' s ). Double Inverted Pendulum (DIP) on cart is a highly non-linear system widely used as a testing bed for verification of newly designed control laws and controllers. In this study control of DIP is obtained using fuzzy logic controllers having different Membership functions(MF's) i.e. triangular, trapezoidal and gbell. The effects of shape of MF's on various controlling parameters i.e. stabilization time, maximum degree of overshoot and steady state error is also illustrated. Simulation results are shown with the help of graphs and tables which proves the validity of proposed method. KeywordsDouble Inverted Pendulum, Fuzzy Logic, Membership function, Matlab-Simulink. 1.0 Introduction The DIP is a multi-variable, unstable system which is difficult to stabilize in upright position [1]. It represents a kinematic joint for robotic knee and arm. It can also be considered as a model of human and of other animal postural control [2]. In this paper fuzzy logic reasoning is used for stabilization and control of DIP. Fuzzy logic controller is able to stabilize the non-linear systems effectively and increases their flexibility to a great extent [3]. This study shows a comparison between three different Membership functions (MF's) namely triangular, trapezoidal and gbell in terms of stabilization time, maximum degree of overshoot and steady state error. The affect of a particular MF's on performance of Inverted Pendulum system is illustrated in this study. There are several studies which have been done recently for the stabilization and control of DIP. Jianqiang Yi, Naoyoshi Yubazaki and Kaoru Hizota [4] proposed a new fuzzy controller AMO Advanced Modeling and Optimization. ISSN: 1841-4311 547 Ashwani Kharola, Dr Pravin Patil, Punit Gupta having six inputs and one output based Single Input Rules Modules (SIRM). Ding Chengjun, Duan Ping, Zhang

Question: How to stabilize a double inverted pendulum?


Multi-View 3D Entangled Forest for Semantic Segmentation and Mapping. Applications that provide location related services need to understand the environment in which humans live such that verbal references and human interaction are possible. We formulate this semantic labelling task as the problem of learning the semantic labels from the perceived 3D structure. In this contribution we propose a batch approach and a novel multi-view frame fusion technique to exploit multiple views for improving the semantic labelling results. The batch approach works offline and is the direct application of an existing single-view method to scene reconstructions with multiple views. The multi-view frame fusion works in an incremental fashion accumulating the single-view results, hence allowing the online multi-view semantic segmentation of single frames and the offline reconstruction of semantic maps. Our experiments show the superiority of the approaches based on our fusion scheme, which leads to a more accurate semantic labelling.

Question: What is the difference between the batch and the incremental approach?


Challenges and business models for mobile location-based services and advertising. Mobile advertising will become more pervasive and profitable, but not before addressing key technical and business challenges.

Question: What are the challenges and business models for mobile location-based services and advertising?


Using Semantic Web Technologies for Exploratory OLAP: A Survey. This paper describes the convergence of some of the most influential technologies in the last few years, namely data warehousing (DW), on-line analytical processing (OLAP), and the Semantic Web (SW). OLAP is used by enterprises to derive important business-critical knowledge from data inside the company. However, the most interesting OLAP queries can no longer be answered on internal data alone, external data must also be discovered (most often on the web), acquired, integrated, and (analytically) queried, resulting in a new type of OLAP, exploratory OLAP. When using external data, an important issue is knowing the precise semantics of the data. Here, SW technologies come to the rescue, as they allow semantics (ranging from very simple to very complex) to be specified for web-available resources. SW technologies do not only support capturing the "passive" semantics, but also support active inference and reasoning on the data. The paper first presents a characterization of DW/OLAP environments, followed by an introduction to the relevant SW foundation concepts. Then, it describes the relationship of multidimensional (MD) models and SW technologies, including the relationship between MD models and SW formalisms. Next, the paper goes on to survey the use of SW technologies for data modeling and data provisioning, including semantic data annotation and semantic-aware extract, transform, and load (ETL) processes. Finally, all the findings are discussed and a number of directions for future research are outlined, including SW support for intelligent MD querying, using SW technologies for providing context to data warehouses, and scalability issues.

Question: What is the relationship between data warehousing and semantic web technologies?


BFC: High-performance distributed big-file cloud storage based on key-value store. Nowadays, cloud-based storage services are rapidly growing and becoming an emerging trend in data storage field. There are many problems when designing an efficient storage engine for cloud-based systems with some requirements such as big-file processing, lightweight meta-data, low latency, parallel I/O, deduplication, distributed, high scalability. Key-value stores played an important role and showed many advantages when solving those problems. This paper presents about Big File Cloud (BFC) with its algorithms and architecture to handle most of problems in a big-file cloud storage system based on key-value store. It is done by proposing low-complicated, fixed-size meta-data design, which supports fast and highly-concurrent, distributed file I/O, several algorithms for resumable upload, download and simple data deduplication method for static data. This research applied the advantages of ZDB - an in-house key-value store which was optimized with auto-increment integer keys for solving big-file storage problems efficiently. The results can be used for building scalable distributed data cloud storage that support big-file with size up to several terabytes.

Question: What is the difference between key-value store and key-value store?


Approximate image-based tree-modeling using particle flows. We present a method for producing 3D tree models from input photographs with only limited user intervention. An approximate voxel-based tree volume is estimated using image information. The density values of the voxels are used to produce initial positions for a set of particles. Performing a 3D flow simulation, the particles are traced downwards to the tree basis and are combined to form twigs and branches. If possible, the trunk and the first-order branches are determined in the input photographs and are used as attractors for particle simulation. The geometry of the tree skeleton is produced using botanical rules for branch thicknesses and branching angles. Finally, leaves are added. Different initial seeds for particle simulation lead to a variety, yet similar-looking branching structures for a single set of photographs.

Question: How to produce a tree model from a set of photographs?