Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem. In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymmetric instances of the traveling salesman problem (TSP). Ant-Q algorithms were inspired by work on the ant system (AS), a distributed algorithm for combinatorial optimization based on the metaphor of ant colonies which was recently proposed in (Dorigo, 1992; Dorigo, Maniezzo and Colorni, 1996). We show that AS is a particular instance of the Ant-Q family, and that there are instances of this family which perform better than AS. We experimentally investigate the functioning of Ant-Q and we show that the results obtained by Ant-Q on symmetric TSP's are competitive with those obtained by other heuristic approaches based on neural networks or local search. Finally, we apply Ant-Q to some difficult asymmetric TSP's obtaining very good results: Ant-Q was able to find solutions of a quality which usually can be found only by very specialized algorithms.

Question: Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem.


Development of an Electromagnetic Actuated Microdisplacement Module. This paper presents the mechanical design and control system design of an electromagnetic actuator-based microdisplacement module. The microdisplacement module composed of a symmetrical leaf-spring parallelogram mechanism and an electromagnetic actuator. The characteristics of the mechanism in terms of stiffness and natural frequencies are derived and verified. Both leakage flux and core inductance are taken into consideration during modeling the mathematic model of the electromagnetic actuator, and based on which, the system dynamic model is established. Due to the nonlinearity characteristics of the system, a dynamic sliding-mode controller is designed without linearizing the system dynamics. A prototype of the microdisplacement module is fabricated, and the parameters of the system are identified and calibrated. Finally, the designed dynamic sliding-mode controller is applied; step response and tracking performance are studied. Experimental results demonstrate that a submicrometer accuracy can be achieved by the module, which validate the effectiveness of the proposed mechanism and controller design as well. The research results show that the electromagnetic actuator-based module can be extended to wide applications in the field of micro/nanopositioning and manipulation.

Question: How does the electromagnetic actuator-based microdisplacement module work?


User Preference Modeling and Exploitation in IoT Scenarios. Recommender Systems are commonly used in web applications to support users in finding items of their interest. We here propose to use Recommender Systems in Internet of Things scenarios to support human decision making in the physical world. For instance, users' choices (visit actions) for points of interests (POIs) while they explore a sensor enabled city can be tracked and used to generate recommendations for not yet visited POIs. In this PhD research, we propose a novel learning approach for generating an explainable human behaviour model and relevant recommendations in sensor enabled areas. Moreover, we propose techniques for simulating user behaviour and analyse the collective dynamics of a population of users.

Question: What is a recommender system?


Feature Extraction Based on Co-occurrence of Adjacent Local Binary Patterns. In this paper, we propose a new image feature based on spatial co-occurrence among micropatterns, where each micropattern is represented by a Local Binary Pattern (LBP). In conventional LBP-based features such as LBP histograms, all the LBPs of micropatterns in the image are packed into a single histogram. Doing so discards important information concerning spatial relations among the LBPs, even though they may contain information about the image's global structure. To consider such spatial relations, we measure their co-occurrence among multiple LBPs. The proposed feature is robust against variations in illumination, a feature inherited from the original LBP, and simultaneously retains more detail of image. The significant advantage of the proposed method versus conventional LBP-based features is demonstrated through experimental results of face and texture recognition using public databases.

Question: What is the advantage of the proposed method?


Cookieless Monster: Exploring the Ecosystem of Web-Based Device Fingerprinting. The web has become an essential part of our society and is currently the main medium of information delivery. Billions of users browse the web on a daily basis, and there are single websites that have reached over one billion user accounts. In this environment, the ability to track users and their online habits can be very lucrative for advertising companies, yet very intrusive for the privacy of users. In this paper, we examine how web-based device fingerprinting currently works on the Internet. By analyzing the code of three popular browser-fingerprinting code providers, we reveal the techniques that allow websites to track users without the need of client-side identifiers. Among these techniques, we show how current commercial fingerprinting approaches use questionable practices, such as the circumvention of HTTP proxies to discover a user's real IP address and the installation of intrusive browser plugins. At the same time, we show how fragile the browser ecosystem is against fingerprinting through the use of novel browser-identifying techniques. With so many different vendors involved in browser development, we demonstrate how one can use diversions in the browsers' implementation to distinguish successfully not only the browser-family, but also specific major and minor versions. Browser extensions that help users spoof the user-agent of their browsers are also evaluated. We show that current commercial approaches can bypass the extensions, and, in addition, take advantage of their shortcomings by using them as additional fingerprinting features.

Question: How does the browser ecosystem work?


Channel selection based on multichannel cross-correlation coefficients for distant speech recognition. In theory, beamforming performance can be improved by using as many microphones as possible, but in practice it has been shown that using all possible channels does not always improve speech recognition performance [1, 2, 3, 4, 5]. In this work, we present a new channel selection method in order to increase the computational efficiency of beamforming for distant speech recognition (DSR) without sacrficing performance.

Question: How to improve speech recognition performance?


Factor graphs and the sum-product algorithm. Algorithms that must deal with complicated global functions of many variables often exploit the manner in which the given functions factor as a product of "local" functions, each of which depends on a subset of the variables. Such a factorization can be visualized with a bipartite graph that we call afactor graph. In this tutorial paper, we present a generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph. Following a single, simple computational rule, the sum-product algorithm computes—either exactly or approximately—various marginal functions derived from the global function. A wide variety of algorithms developed in artificial intelligence, signal processing, and digital communications can be derived as specific instances of the sum-product algorithm, including the forward/backward algorithm, the Viterbi algorithm, the iterative "turbo" decoding algorithm, Pearl's belief propagation algorithm for Bayesian networks, the Kalman filter, and certain fast Fourier transform (FFT) algorithms.

Question: What is the sum-product algorithm?


Small and fast moving object detection and tracking in sports video sequences. We propose an algorithm for detection and tracking of small and fast moving objects, like a ping pong ball or a cricket ball, in sports video sequences. For detection, the proposed method uses only motion as a cue; moreover it does not use any texture information. Our method is able to detect the object with very low contrast and negligible texture content. Along with detection, we also propose a tracking algorithm using the multiple filter bank approach. Thus we provide a complete solution. The tracking algorithm is able to track maneuvering as well as non-maneuvering movements of the object without using any a priori information about the target dynamics

Question: What is a ping pong ball?


SCUC With Hourly Demand Response Considering Intertemporal Load Characteristics. In this paper, the hourly demand response (DR) is incorporated into security-constrained unit commitment (SCUC) for economic and security purposes. SCUC considers fixed and responsive loads. Unlike fixed hourly loads, responsive loads are modeled with their intertemporal characteristics. The responsive loads linked to hourly market prices can be curtailed or shifted to other operating hours. The study results show that DR could shave the peak load, reduce the system operating cost, reduce fuel consumptions and carbon footprints, and reduce the transmission congestion by reshaping the hourly load profile. Numerical simulations in this paper exhibit the effectiveness of the proposed approach.

Question: How can DR be incorporated into SCUC?


TCP Ordo: The cost of ordered processing in TCP servers. To achieve scalable, high-throughput, low-latency packet processing, TCP implementations are parallelized across cores in multicore platforms. This, however, significantly affects the order in which packets from different flows are delivered to application processing. Our measurements record up to 75% of the packets are delivered to applications in a way that does not match the order in which they are received on the network interface. For many important classes of applications, such as financial services, bidding and trading engines, game engines, this cross-flow packet reordering affects their ability to provide fairness guarantees. To address this gap, we propose TCP-Ordo - a TCP stack which provides strict ordering of packets across multiple flows, as well as flexibility to control the degree to which ordering is enforced. TCP-Ordo outperforms existing TCP implementations in both latency and throughput. The current prototype is implemented as a user-level TCP stack for Mellanox Connectx3 NICs with 40Gbps Ethernet interfaces. Without ordering guarantees TCP-Ordo delivers one way latency of 4.75usec (a 5x improvement over the Linux kernel) for 150B packets and throughput of 22Gbps (a 2x improvement over mTCP) for 1500B packets. Furthermore, with TCP-Ordo applications are provided with strict packet order delivery, with performance that continues to be superior to the state-of-the-art, even when enforcing packet order across 800,000 connections on a 12-core platform. Finally, TCP-Ordo supports the notion of `ordered domains' that offer flexibility in the degree of ordering that an application will experience, and pay for.

Question: What is the cost of ordered processing in TCP servers?


The wisdom of the few: a collaborative filtering approach based on expert opinions from the web. Nearest-neighbor collaborative filtering provides a successful means of generating recommendations for web users. However, this approach suffers from several shortcomings, including data sparsity and noise, the cold-start problem, and scalability. In this work, we present a novel method for recommending items to users based on expert opinions. Our method is a variation of traditional collaborative filtering: rather than applying a nearest neighbor algorithm to the user-rating data, predictions are computed using a set of expert neighbors from an independent dataset, whose opinions are weighted according to their similarity to the user. This method promises to address some of the weaknesses in traditional collaborative filtering, while maintaining comparable accuracy. We validate our approach by predicting a subset of the Netflix data set. We use ratings crawled from a web portal of expert reviews, measuring results both in terms of prediction accuracy and recommendation list precision. Finally, we explore the ability of our method to generate useful recommendations, by reporting the results of a user-study where users prefer the recommendations generated by our approach.

Question: What is the nearest neighbor collaborative filtering?


Ontologically Grounded Multi-sense Representation Learning for Semantic Vector Space Models. Words are polysemous. However, most approaches to representation learning for lexical semantics assign a single vector to every surface word type. Meanwhile, lexical ontologies such as WordNet provide a source of complementary knowledge to distributional information, including a word sense inventory. In this paper we propose two novel and general approaches for generating sense-specific word embeddings that are grounded in an ontology. The first applies graph smoothing as a postprocessing step to tease the vectors of different senses apart, and is applicable to any vector space model. The second adapts predictive maximum likelihood models that learn word embeddings with latent variables representing senses grounded in an specified ontology. Empirical results on lexical semantic tasks show that our approaches effectively captures information from both the ontology and distributional statistics. Moreover, in most cases our sense-specific models outperform other models we compare against.

Question: What is the ontology of wordnet?


Risk indicators and psychopathology in traumatised children and adolescents with a history of sexual abuse. Childhood sexual abuse (CSA) is widespread amongst South African (SA) children, yet data on risk factors and psychiatric consequences are limited and mixed. Traumatised children and adolescents referred to our Youth Stress Clinic were interviewed to obtain demographic, sexual abuse, lifetime trauma and psychiatric histories. Data for 94 participants (59 female, 35 male; mean age 14.25 [8.25–19] years) exposed to at least one lifetime trauma were analysed. Sexual abuse was reported in 53% of participants (42.56% females, 10.63% males) with 64% of violations committed by perpetrators known to them. Multinomial logistic regression analysis revealed female gender (P = 0.002) and single-parent families (P = 0.01) to be significant predictors of CSA (62.5%). CSA did not predict exposure to other traumas. Sexually abused children had significantly higher physical and emotional abuse subscale scores and total CTQ scores than non-abused children. Depression (33%, X 2 = 10.89, P = 0.001) and PTSD (63.8%, X 2 = 4.79, P = 0.034) were the most prevalent psychological consequences of trauma and both were significantly associated with CSA. High rates of CSA predicted high rates of PTSD in this traumatised sample. Associations we found appear consistent with international studies of CSA and, should be used to focus future social awareness, prevention and treatment strategies in developing countries.

Question: What is the prevalence of sexual abuse in South Africa?


Binary codes capable of correcting deletions, insertions and reversals.

Question: What is a binary code?


A Research on Iron Loss of IPMSM With a Fractional Number of Slot Per Pole. In this paper, we investigated rotor iron loss of interior permanent magnet synchronous machine (IPMSM), which has distributed armature windings. In order to study the iron loss with the effect of slot-pole combination, two machines for high-speed operation such as electric vehicle were designed. One is fractional slot winding and the other is conventional one. In the analysis, we developed a new iron loss model of electrical machines for high-speed operation. The calculated iron loss was compared with the experimental data. It was clarified that the proposed method can estimate iron loss effectively at high-speed operation. Based on this newly proposed method, we analyzed iron loss of the two machines according to their driving conditions. From the analysis results, it was shown that rotor iron loss of machine employing fractional slot-winding is definitely large at load condition. In addition, it is interesting that the ratio (rotor iron loss/stator iron loss) becomes larger as the speed of the machines increase if the number of slot per pole is fractional.

Question: What is the fractional number of slot per pole?


Enabling internet banking adoption: An empirical examination with an augmented technology acceptance model (TAM). Purpose – The integration of relevant antecedents into TAM would lead to better understanding of the decision factors which act as enablers for the adoption of internet banking. The purpose of the paper is to determine the influence of the antecedents subjective norm, image, banks initiative, internet banking self-efficacy, internet usage efficacy, trust, perceived risk, trialability and government support on the existing constructs of the technology acceptance model (TAM) and to test measurement invariance and the moderating effect of the demographic variables on the relationship between the latent constructs used in this augmented TAM. Design/methodology/approach – A survey questionnaire was administered on internet banking users and a total of 300 responses were collected. A two-step approach suggested by Hair et al. (2006) and Schumacker and Lomax (2004) was used in this study. The proposed model was assessed using the confirmatory factor analysis approach. The structural model was then tested in order to establish nomological validity. The data based on four demographic dimensions gender, age, income, education were divided into two groups for each of these demographic dimensions. The invariance test was first performed on the measurement model and then on the structural model. The measurement model and structural model were subjected to tests of equivalence of parameters across groups. Findings – To a large extent the results of the study supports the proposed model and thereby contributes to understand the influence of subjective norm, image, banks initiative, internet banking self-efficacy, internet usage efficacy, trust, perceived risk and government support on internet banking adoption. The predictor variables in the augmented TAM were able to explain 29.9 per cent of the variance in the actual usage of internet banking as compared to the TAM w

Question: What is the difference between the augmented technology acceptance model and the technology acceptance model?


Drug Treatment of Sleep Disorders. Sleep is a complex behavior that cyclically alternates with wakefulness and is fundamental for both mental and physical wellness. During normal sleep the body acquires a specific posture; any active behavior is absent and mental activity typically oscillates between a state of "loss of consciousness" and the experience of dreaming. Sleep is, by itself, a cyclical process characterized by the alternation of two phases, non-REM (NREM) sleep and "rapid eye movement" (REM) sleep, during which the typical synchronized electroencephalographic (EEG) pattern of NREM sleep is substituted by a "paradoxical" EEG desynchronization. NREM sleep is a state of minimal energy expenditure and motor activity, during which cardiorespiratory and thermoregulatory variables are driven by the autonomic nervous system at a lower and more stable level compared to wakefulness. During REM sleep, beyond the occurrence of REMs, posture control is lost and dreams become more vivid. Furthermore, autonomic activity is highly unstable leading to centrally driven surges in heart rate and blood pressure, breathing becomes irregular, and thermoregulation is suspended or depressed, suggesting a derangement of the integrative regulation of physiological functions. Overall sleep quality is one of the most important parameters considered for the subjective assessment of quality of life and general health status. However, although sleep function(s) is intuitively associated with some kind of rest that seems to be mostly required by the central nervous system, and many theories on sleep function have been proposed, a full comprehension of sleep function has not yet been achieved and is probably not imminent. C. Berteotti • M. Cerri • M. Luppi • A. Silvani • R. Amici (*) Department of Biomedical and Neuromotor Sciences—Physiology, Alma Mater Studiorum-University of Bologna, Piazza P.ta S. Donato, 2, 40126 Bologna, Italy e-mail: chiara.berteotti@unibo.it; matteo.cerri@unibo.i

Question: What is the function of sleep?


Mixed Type Audio Classification with Support Vector Machine. Content-based classification of audio data is an important problem for various applications such as overall analysis of audio-visual streams, boundary detection of video story segment, extraction of speech segments from video, and content-based video retrieval. Though the classification of audio into single type such as music, speech, environmental sound and silence is well studied, classification of mixed type audio data, such as clips having speech with music as background, is still considered a difficult problem. In this paper, we present a mixed type audio classification system based on support vector machine (SVM). In order to capture characteristics of different types of audio data, besides selecting audio features, we also design four different representation formats for each feature. Our SVM-based audio classifier can classify audio data into five types: music, speech, environment sound, speech mixed with music, and music mixed with environment sound. The experimental results show that our system outperforms other classification systems using k nearest neighbor (k-NN), neural network (NN), and Naive Bayes (NB)

Question: What is the difference between a mixed type audio classification system and a single type audio classification system?


Deep Learning Approach for Secondary Structure Protein Prediction based on First Level Features Extraction using a Latent CNN Structure. In Bioinformatics, Protein Secondary Structure Prediction (PSSP) has been considered as one of the main challenging tasks in this field. Today, secondary structure protein prediction approaches have been categorized into three groups (Neighbor-based, model-based, and meta predicator-based model). The main purpose of the model-based approaches is to detect the protein sequence-structure by utilizing machine learning techniques to train and learn a predictive model for that. In this model, different supervised learning approaches have been proposed such as neural networks, hidden Markov chain, and support vector machines have been proposed. In this paper, our proposed approach which is a Latent Deep Learning approach relies on detecting the first level features based on using Stacked Sparse Autoencoder. This approach allows us to detect new features out of the set of training data using the sparse autoencoder which will have used later as convolved filters in the Convolutional Neural Network (CNN) structure. The experimental results show that the highest accuracy of the prediction is 86.719% in the testing set of our approach when the backpropagation framework has been used to pre-trained techniques by relying on the unsupervised fashion where the whole network can be fine-tuned in a supervised learning fashion. Keywords—Secondary structure protein prediction; secondary structure; fine-tuning; Stacked Sparse; Deep Learning; CNN

Question: What is the difference between a neural network and a convolutional neural network?


Marginal structural models for estimating effect modification.. PURPOSE The use of marginal structural models (MSMs) to adjust for measured confounding factors is becoming increasingly common in observational studies. Here, we propose MSMs for estimating effect modification in observational cohort and case-control studies.   METHODS MSMs for estimating effect modification were derived by the use of the potential outcome model. The proposed methods were applied to a cohort study and a case-control study.   RESULTS In cohort studies, effect modification can be estimated by the application of a logistic MSM to individuals who experienced the event in question. In case-control studies, effect modification can be estimated by the ratio between the estimate from the model applied to case data and that applied to control data. The application of the model to real data from a cohort study indicated that the estimate from the proposed method was close to that from standard regression analysis. In a case-control study, the estimate from the proposed method may be biased.   CONCLUSIONS Epidemiological researchers can use MSMs to estimate effect modification. In case-control studies, it should be determined whether the estimated effect modification is biased by applying a logistic MSM of control data.

Question: How to estimate effect modification in a case-control study?


Mining Contextual Preference Rules for Building User Profiles. The emerging of ubiquitous computing technologies in recent years has given rise to a new field of research consisting in incorporating context-aware preference querying facilities in database systems. One important step in this setting is the Preference Elicitation task which consists in providing the user ways to inform his/her choice on pairs of objects with a minimal effort. In this paper we propose an automatic preference elicitation method based on mining techniques. The method consists in extracting a user profile from a set of user preference samples. In our setting, a profile is specified by a set of contextual preference rules verifying some important properties (soundness and conciseness). We evaluate the efficacy of the proposed method in a series of experiments executed on a real-world database of user preferences about movies.

Question: What is a user profile?


Smart clothing: Perceived benefits vs. perceived fears. Smart textile technologies integrate computer functionality into textiles. Since a few years, smart clothing has been coming up in the sport and health sector and is increasingly implemented in everyday objects within private spaces. Especially the use of textiles for medical reasons and their potential use within Ambient Assisted Living-Concepts (AAL) make it necessary to understand users' perspectives on these technologies and the willingness to use them. Today, the understanding in which way individual attitudes and emotional and cognitive abilities, may impact the acceptance of pervasive health care technologies, is restricted. This research is focused on the users' hopes and fears towards smart clothing and examines perceived benefits and barriers. As women have a higher life expectancy and will dominate the group of old people in the future - gender was chosen as one central factor of interest. As the second factor we examined technical experience in order to learn if the acceptance for smart clothing is connected to the degree of users previous experience with technology. Outcomes revealed both factors - gender and technical experience - to be decisive factors for the acceptance of smart clothing. Generally, women and persons with low technical experience show considerable caveats towards the usage of smart clothing technologies what becomes most evident in the perceived barriers and fears connected to the usage of this new technology.

Question: What are the benefits of smart clothing?


Efficient Architecture Search by Network Transformation. Techniques for automatically designing deep neural network architectures such as reinforcement learning based approaches have recently shown promising results. However, their success is based on vast computational resources (e.g. hundreds of GPUs), making them difficult to be widely used. A noticeable limitation is that they still design and train each network from scratch during the exploration of the architecture space, which is highly inefficient. In this paper, we propose a new framework toward efficient architecture search by exploring the architecture space based on the current network and reusing its weights. We employ a reinforcement learning agent as the meta-controller, whose action is to grow the network depth or layer width with function-preserving transformations. As such, the previously validated networks can be reused for further exploration, thus saves a large amount of computational cost. We apply our method to explore the architecture space of the plain convolutional neural networks (no skip-connections, branching etc.) on image benchmark datasets (CIFAR-10, SVHN) with restricted computational resources (5 GPUs). Our method can design highly competitive networks that outperform existing networks using the same design scheme. On CIFAR-10, our model without skip-connections achieves 4.23% test error rate, exceeding a vast majority of modern architectures and approaching DenseNet. Furthermore, by applying our method to explore the DenseNet architecture space, we are able to achieve more accurate networks with fewer parameters.

Question: What is the architecture space of plain convolutional neural networks?


Qualitative comparison of graph-based and logic-based multi-relational data mining: a case study. The goal of this paper is to generate insights about the differences between graph-based and logic-based approaches to multi-relational data mining by performing a case study of graph-based system, Subdue and the inductive logic programming system, CProgol. We identify three key factors for comparing graph-based and logic-based multi-relational data mining; namely, the ability to discover structurally large concepts, the ability to discover semantically complicated concepts and the ability to effectively utilize background knowledge. We perform an experimental comparison of Subdue and CProgol on the Mutagenesis domain and various artificially generated Bongard problems. Experimental results indicate that Subdue can significantly outperform CProgol while discovering structurally large multi-relational concepts. It is also observed that CProgol is better at learning semantically complicated concepts and it tends to use background knowledge more effectively than Subdue.

Question: What is the difference between graph-based and logic-based multi-relational data mining?


Automatic Text Summarization System for Punjabi Language. This paper concentrates on single document multi news Punjabi extractive summarizer. Although lot of research is going on in field of multi document news summarization systems but not even a single paper was found in literature for single document multi news summarization for any language. It is first time that this system has been developed for Punjabi language and is available online at: http://pts.learnpunjabi.org/. Punjab is one of Indian states and Punjabi is its official language. Punjabi is under resourced language. Various linguistic resources for Punjabi were also developed first time as part of this project like Punjabi noun morph, Punjabi stemmer and Punjabi named entity recognition, Punjabi keywords identification, normalization of Punjabi nouns etc. A Punjabi document (like single page of Punjabi E-news paper) can have hundreds of multi news of varying length. Based on compression ratio selected by user, this system starts by extracting headlines of each news, lines just next to headlines and other important lines depending upon their importance. Selection of sentences is on the basis of statistical and linguistic features of sentences. This system comprises of two main steps: Pre Processing and Processing phase. Pre Processing phase represents the Punjabi text in structured way. In processing phase, different features deciding the importance of sentences are determined and calculated. Some of the statistical features are Punjabi keywords identification, relative sentence length feature and numbered data feature. Various linguistic features for selecting important sentences in summary are: Punjabiheadlines identification, identification of lines just next to headlines, identification of Punjabi-nouns, identification of Punjabi-proper-nouns, identification of common-EnglishPunjabi-nouns, identification of Punjabi-cue-phrases and identification of title-keywords in sentences. Scores of sentences ar

Question: What is the size of the canadian military?


Efficient mapping of quantum circuits to the IBM QX architectures. In March 2017, IBM launched the project IBM Q with the goal to provide access to quantum computers for a broad audience. This allowed users to conduct quantum experiments on a 5-qubit and, since June 2017, also on a 16-qubit quantum computer (called IBM QX2 and IBM QX3, respectively). In order to use these, the desired quantum functionality (e.g. provided in terms of a quantum circuit) has to properly be mapped so that the underlying physical constraints are satisfied — a complex task. This demands for solutions to automatically and efficiently conduct this mapping process. In this paper, we propose such an approach which satisfies all constraints given by the architecture and, at the same time, aims to keep the overhead in terms of additionally required quantum gates minimal. The proposed approach is generic and can easily be configured for future architectures. Experimental evaluations show that the proposed approach clearly outperforms IBM's own mapping solution with respect to runtime as well as resulting costs.

Question: How to map quantum circuits to IBM QX architectures?


Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networks. Large multilayer neural networks trained with backpropagation have recently achieved state-ofthe-art results in a wide range of problems. However, using backprop for neural net learning still has some disadvantages, e.g., having to tune a large number of hyperparameters to the data, lack of calibrated probabilistic predictions, and a tendency to overfit the training data. In principle, the Bayesian approach to learning neural networks does not have these problems. However, existing Bayesian techniques lack scalability to large dataset and network sizes. In this work we present a novel scalable method for learning Bayesian neural networks, called probabilistic backpropagation (PBP). Similar to classical backpropagation, PBP works by computing a forward propagation of probabilities through the network and then doing a backward computation of gradients. A series of experiments on ten real-world datasets show that PBP is significantly faster than other techniques, while offering competitive predictive abilities. Our experiments also show that PBP provides accurate estimates of the posterior variance on the network weights.

Question: What is the difference between a neural network and a Bayesian network?


Large-scale cluster management at Google with Borg. Google's Borg system is a cluster manager that runs hundreds of thousands of jobs, from many thousands of different applications, across a number of clusters each with up to tens of thousands of machines.  It achieves high utilization by combining admission control, efficient task-packing, over-commitment, and machine sharing with process-level performance isolation. It supports high-availability applications with runtime features that minimize fault-recovery time, and scheduling policies that reduce the probability of correlated failures. Borg simplifies life for its users by offering a declarative job specification language, name service integration, real-time job monitoring, and tools to analyze and simulate system behavior.  We present a summary of the Borg system architecture and features, important design decisions, a quantitative analysis of some of its policy decisions, and a qualitative examination of lessons learned from a decade of operational experience with it.

Question: What is the borg system?


Neural Temporal Relation Extraction. We experiment with neural architectures for temporal relation extraction and establish a new state-of-the-art for several scenarios. We find that neural models with only tokens as input outperform state-ofthe-art hand-engineered feature-based models, that convolutional neural networks outperform LSTM models, and that encoding relation arguments with XML tags outperforms a traditional position-based encoding.

Question: What is the state-of-the-art for neural temporal relation extraction?


Membrane-distillation desalination : status and potential. This paper presents an assessment of membrane distillation (MD) based on the available state of the art and on our preliminary analysis. The process has many desirable properties such as low energy consumption, ability to use low temperature beat, compactness, and perceivably more immunity to fouling than other membrane processes. Within the tested range, the operating parameters of conventional MD configurations have the following effects:(1) the permeate fluxes can significantly be improved by increasing the hot feed temperature (increasing the temperature from 50 to 70°C increases the flux by more than three-fold), and by reducing the vapor/air gap (reducing the vapor air gap thickness from 5 to 1 mm increase the flux 2.3-fold); (2) the mass flow rate of the feed solution has a smaller effect: increasing it three-fold increases the flux by about 1.3-fold; (3) the concentration of the solute has slight effect: increasing the concentration by more than five-fold decreases the flux by just 1.I 5-fold; (4) the cold side conditions have a lower effect (about half) on the flux than the hot side; (5) the coolant mass flow rate has a negligible effect; (6) the coolant temperature has a lower effect than the mass flow rate of the hot solution. Fouling effects, membranes used, energy consumption, system applications and configurations, and very approximate cost estimates are presented. The permeate fluxes obtained by the different researchers seem to disagree by an order of magnitude, and better experimental work is needed.

Question: What is the effect of the cold side conditions on the flux?


An Approach for Selecting Software-as-a-Service (SaaS) Product. Software-as-a-Service (SaaS) helps organizations avoid capital expenditure and pay for the functionality as an operational expenditure. Though enterprises are unlikely to use SaaS model for all their information systems needs, certain business functionalities such as Sales Force Automation (SFA), are more seen to be implemented using SaaS model. Such demand has prompted quite a few vendors to offer SFA functionality as SaaS. Enterprises need to adopt an objective approach to ensure they select the most appropriate SaaS product for their needs. This paper presents an approach that makes use of Analytic Hierarchy Process (AHP) technique for prioritizing the product features and also for expert-led scoring of the products.

Question: What is the difference between SaaS and on-premise?


SuperParsing: Scalable Nonparametric Image Parsing with Superpixels. This paper presents a simple and effective nonparametric approach to the problem of image parsing, or labeling image regions (in our case, superpixels produced by bottom-up segmentation) with their categories. This approach requires no training, and it can easily scale to datasets with tens of thousands of images and hundreds of labels. It works by scene-level matching with global image descriptors, followed by superpixel-level matching with local features and efficient Markov random field (MRF) optimization for incorporating neighborhood context. Our MRF setup can also compute a simultaneous labeling of image regions into semantic classes (e.g., tree, building, car) and geometric classes (sky, vertical, ground). Our system outperforms the state-of-the-art nonparametric method based on SIFT Flow on a dataset of 2,688 images and 33 labels. In addition, we report per-pixel rates on a larger dataset of 15,150 images and 170 labels. To our knowledge, this is the first complete evaluation of image parsing on a dataset of this size, and it establishes a new benchmark for the problem.

Question: What is the name of the dataset?


Probabilistic Extraction of Beat Positions from a Beat Activation Function. We present a probabilistic way to extract beat positions from the output (activations) of the neural network that is at the heart of an existing beat tracker. The method can serve as a replacement for the greedy search the beat tracker currently uses for this purpose. Our experiments show improvement upon the current method for a variety of data sets and quality measures, as well as better results compared to other state-of-the-art algorithms.

Question: How to extract beat positions from a beat activation function?


Iterative Adaptive Approaches to MIMO Radar Imaging. Multiple-input multiple-output (MIMO) radar can achieve superior performance through waveform diversity over conventional phased-array radar systems. When a MIMO radar transmits orthogonal waveforms, the reflected signals from scatterers are linearly independent of each other. Therefore, adaptive receive filters, such as Capon and amplitude and phase estimation (APES) filters, can be directly employed in MIMO radar applications. High levels of noise and strong clutter, however, significantly worsen detection performance of the data-dependent beamformers due to a shortage of snapshots. The iterative adaptive approach (IAA), a nonparametric and user parameter-free weighted least-squares algorithm, was recently shown to offer improved resolution and interference rejection performance in several passive and active sensing applications. In this paper, we show how IAA can be extended to MIMO radar imaging, in both the negligible and nonnegligible intrapulse Doppler cases, and we also establish some theoretical convergence properties of IAA. In addition, we propose a regularized IAA algorithm, referred to as IAA-R, which can perform better than IAA by accounting for unrepresented additive noise terms in the signal model. Numerical examples are presented to demonstrate the superior performance of MIMO radar over single-input multiple-output (SIMO) radar, and further highlight the improved performance achieved with the proposed IAA-R method for target imaging.

Question: What is the difference between a radar and a sonar?


Applying High-Resolution Visible Imagery to Satellite Melt Pond Fraction Retrieval: A Neural Network Approach. During summer, melt ponds have a significant influence on Arctic sea-ice albedo. The melt pond fraction (MPF) also has the ability to forecast the Arctic sea-ice in a certain period. It is important to retrieve accurate melt pond fraction (MPF) from satellite data for Arctic research. This paper proposes a satellite MPF retrieval model based on the multi-layer neural network, named MPF-NN. Our model uses multi-spectral satellite data as model input and MPF information from multi-site and multiperiod visible imagery as prior knowledge for modeling. It can effectively model melt ponds evolution of different regions and periods over the Arctic. Evaluation results show that the MPF retrieved from MODIS data using the proposed model has an RMSE of 3.91% and a correlation coefficient of 0.73. The seasonal distribution of MPF is also consistent with previous results.

Question: How to retrieve the melt pond fraction from satellite data?


High speed, Low power Approximate Multipliers. Adders and multipliers form the significant components in all kind of digital applications and has always been a thought-provoking topic for the researchers. Multiplication process will initially find out the set of partial products and then groups the partial products according to their respective bit positions and takes the summation. Among the phases of multiplication, partial product reduction tree consumes the maximum power and area as it is done using several adders. In this paper, a High Speed, Low Power Approximate Multiplier is proposed in which a new 4–2 compressor is being projected and is made use while performing vector merge addition after transforming the partial product terms to lead varying probability terms. Simulation results shows that the proposed Approximate Multiplier achieved 3.19% less Area, 53.74% less Delay, 3.79% less Power compared to Approximate Multiplier [6] and 31% less Area, 81.35% less Delay and 59.83% less Power compared to that of an Exact Multiplier. When we make use of Approximate Multipliers, there are likelihoods of error occurring in some cases. Hence approximate multipliers are suggested only for Error Resilient applications. Video compression, Digital Image processing and Test Data compression can be categorized as such applications. The proposed approximate multiplier takes less Power, Area and Time and also can be paralleled to the existing approximate multiplier algorithms. Hence for Error resilient application, it is always sagacious to use less power consuming constituents since power is a crucial one to save in the current scenario.

Question: What is approximate multiplier?


DeepLiDAR: Deep Surface Normal Guided Depth Prediction for Outdoor Scene from Sparse LiDAR Data and Single Color Image. In this paper, we propose a deep learning architecture that produces accurate dense depth for the outdoor scene from a single color image and a sparse depth. Inspired by the indoor depth completion, our network estimates surface normals as the intermediate representation to produce dense depth, and can be trained end-to-end. With a modified encoder-decoder structure, our network effectively fuses the dense color image and the sparse LiDAR depth. To address outdoor specific challenges, our network predicts a confidence mask to handle mixed LiDAR signals near foreground boundaries due to occlusion, and combines estimates from the color image and surface normals with learned attention maps to improve the depth accuracy especially for distant areas. Extensive experiments demonstrate that our model improves upon the state-of-the-art performance on KITTI depth completion benchmark. Ablation study shows the positive impact of each model components to the final performance, and comprehensive analysis shows that our model generalizes well to the input with higher sparsity or from indoor scenes.

Question: How does deep learning work?


Subspace clustering based on low rank representation and weighted nuclear norm minimization. Subspace clustering refers to the problem of segmenting a set of data points approximately drawn from a union of multiple linear subspaces. Aiming at the subspace clustering problem, various subspace clustering algorithms have been proposed and low rank representation based subspace clustering is a very promising and efficient subspace clustering algorithm. Low rank representation method seeks the lowest rank representation among all the candidates that can represent the data points as linear combinations of the bases in a given dictionary. Nuclear norm minimization is adopted to minimize the rank of the representation matrix. However, nuclear norm is not a very good approximation of the rank of a matrix and the representation matrix thus obtained can be of high rank which will affect the final clustering accuracy. Weighted nuclear norm (WNN) is a better approximation of the rank of a matrix and WNN is adopted in this paper to describe the rank of the representation matrix. The convex program is solved via conventional alternation direction method of multipliers (ADMM) and linearized alternating direction method of multipliers (LADMM) and they are respectively refer to as WNNM-LRR and WNNM-LRR(L). Experimental results show that, compared with low rank representation method and several other state-of-the-art subspace clustering methods, WNNM-LRR and WNNM-LRR(L) can get higher clustering accuracy.

Question: What is the nuclear norm?


Early prediction of scholar popularity. Prediction of scholar popularity has become an important research topic for a number of reasons. In this paper, we tackle the problem of predicting the popularity {\it trend} of scholars by concentrating on making predictions both as earlier and accurate as possible. In order to perform the prediction task, we first extract the popularity trends of scholars from a training set. To that end, we apply a time series clustering algorithm called K-Spectral Clustering (K-SC) to identify the popularity trends as cluster centroids. We then predict trends for scholars in a test set by solving a classification problem. Specifically, we first compute a set of measures for individual scholars based on the distance between earlier points in her particular popularity curve and the identified centroids. We then combine those distance measures with a set of academic features (e.g., number of publications, number of venues, etc) collected during the same monitoring period, and use them as input to a classification method. One aspect that distinguishes our method from other approaches is that the monitoring period, during which we gather information on each scholar popularity and academic features, is determined on a per scholar basis, as part of our approach. Using total citation count as measure of scientific popularity, we evaluate our solution on the popularity time series of more than 500,000 Computer Science scholars, gathered from Microsoft Azure Marketplace (https://datamarket.azure.com/dataset/mrc/microsoftacademic). The experimental results show that the our prediction method outperforms other alternative prediction methods. We also show how to apply our method jointly with regression models to improve the prediction of scholar popularity values (e.g., number of citations) at a given future time.

Question: How to predict scholar popularity?


Application of a LabVIEW for Real-Time Control of Ball and Beam System.

Question: How to control a ball and beam system?


A 180-mV subthreshold FFT processor using a minimum energy design methodology. In emerging embedded applications such as wireless sensor networks, the key metric is minimizing energy dissipation rather than processor speed. Minimum energy analysis of CMOS circuits estimates the optimal operating point of clock frequencies, supply voltage, and threshold voltage according to A. Chandrakasan et al. (see ibid., vol.27, no.4, p.473-84, Apr. 1992). The minimum energy analysis shows that the optimal power supply typically occurs in subthreshold (e.g., supply voltages that are below device thresholds). New subthreshold logic and memory design methodologies are developed and demonstrated on a fast Fourier transform (FFT) processor. The FFT processor uses an energy-aware architecture that allows for variable FFT length (128-1024 point), variable bit-precision (8 b and 16 b) and is designed to investigate the estimated minimum energy point. The FFT processor is fabricated using a standard 0.18-/spl mu/m CMOS logic process and operates down to 180 mV. The minimum energy point for the 16-b 1024-point FFT processor occurs at 350-mV supply voltage where it dissipates 155 nJ/FFT at a clock frequency of 10 kHz.

Question: What is the minimum energy point for a FFT processor?


Job Resources Boost Work Engagement , Particularly When Job Demands Are High. This study of 805 Finnish teachers working in elementary, secondary, and vocational schools tested 2 interaction hypotheses. On the basis of the job demands–resources model, the authors predicted that job resources act as buffers and diminish the negative relationship between pupil misbehavior and work engagement. In addition, using conservation of resources theory, the authors hypothesized that job resources particularly influence work engagement when teachers are confronted with high levels of pupil misconduct. In line with these hypotheses, moderated structural equation modeling analyses resulted in 14 out of 18 possible 2-way interaction effects. In particular, supervisor support, innovativeness, appreciation, and organizational climate were important job resources that helped teachers cope with demanding interactions with students.

Question: What is the relationship between job resources and work engagement?


Labeled Faces in the Wild: A Survey. In 2007, Labeled Faces in the Wild was released in an effort to spur research in face recognition, specifically for the problem of face verification with unconstrained images. Since that time, more than 50 papers have been published that improve upon this benchmark in some respect. A remarkably wide variety of innovative methods have been developed to overcome the challenges presented in this database. As performance on some aspects of the benchmark approaches 100% accuracy, it seems appropriate to review this progress, derive what general principles we can from these works, and identify key future challenges in face recognition. In this survey, we review the contributions to LFW for which the authors have provided results to the curators (results found on the LFW results web page). We also review the cross cutting topic of alignment and how it is used in various methods. We end with a brief discussion of recent databases designed to challenge the next generation of face recognition algorithms. Erik Learned-Miller University of Massachusetts, Amherst, Massachusetts, e-mail: elm@cs.umass.edu Gary B. Huang Howard Hughes Medical Institute, Janelia Research Campus, e-mail: gbhuang@cs.umass.edu Aruni RoyChowdhury University of Massachusetts, Amherst, Massachusetts, e-mail: aruni@cs.umass.edu Haoxiang Li Stevens Institute of Technology, Hoboken, New Jersey, e-mail: hli18@stevens.edu Gang Hua Stevens Institute of Technology, Hoboken, New Jersey, e-mail: ganghua@gmail.com

Question: What is the size of the LFW database?


Membrane Bioreactor (MBR) Technology for Wastewater Treatment and Reclamation: Membrane Fouling. The membrane bioreactor (MBR) has emerged as an efficient compact technology for municipal and industrial wastewater treatment. The major drawback impeding wider application of MBRs is membrane fouling, which significantly reduces membrane performance and lifespan, resulting in a significant increase in maintenance and operating costs. Finding sustainable membrane fouling mitigation strategies in MBRs has been one of the main concerns over the last two decades. This paper provides an overview of membrane fouling and studies conducted to identify mitigating strategies for fouling in MBRs. Classes of foulants, including biofoulants, organic foulants and inorganic foulants, as well as factors influencing membrane fouling are outlined. Recent research attempts on fouling control, including addition of coagulants and adsorbents, combination of aerobic granulation with MBRs, introduction of granular materials with air scouring in the MBR tank, and quorum quenching are presented. The addition of coagulants and adsorbents shows a significant membrane fouling reduction, but further research is needed to establish optimum dosages of the various coagulants/adsorbents. Similarly, the integration of aerobic granulation with MBRs, which targets biofoulants and organic foulants, shows outstanding filtration performance and a significant reduction in fouling rate, as well as excellent nutrients removal. However, further research is needed on the enhancement of long-term granule integrity. Quorum quenching also offers a strong potential for fouling control, but pilot-scale testing is required to explore the feasibility of full-scale application.

Question: What is the membrane fouling in MBR?


"In vivo" spam filtering: a challenge problem for KDD. Spam, also known as Unsolicited Commercial Email (UCE), is the bane of email communication. Many data mining researchers have addressed the problem of detecting spam, generally by treating it as a static text classification problem. True in vivo spam filtering has characteristics that make it a rich and challenging domain for data mining. Indeed, real-world datasets with these characteristics are typically difficult to acquire and to share. This paper demonstrates some of these characteristics and argues that researchers should pursue in vivo spam filtering as an accessible domain for investigating them.

Question: What is the bane of email communication?


Training Sources 3 D Normalized Pose Space 2 D Normalized Pose Space KD-Tree Input Image 2 D Pose Estimation 3 D Pose Reconstruction. In this work we address the challenging problem of 3D human pose estimation from single images. Recent approaches learn deep neural networks to regress 3D pose directly from images. One major challenge for such methods, however, is the collection of training data. Specifically, collecting large amounts of training data containing unconstrained images annotated with accurate 3D poses is infeasible. We therefore propose to use two independent training sources. The first source consists of accurate 3D motion capture data, and the second source consists of unconstrained images with annotated 2D poses. To integrate both sources, we propose a dual-source approach that combines 2D pose estimation with efficient 3D pose retrieval. To this end, we first convert the motion capture data into a normalized 2D pose space, and separately learn a 2D pose estimation model from the image data. During inference, we estimate the 2D pose and efficiently retrieve the nearest 3D poses. We then jointly estimate a mapping from the 3D pose space to the image and reconstruct the 3D pose. We provide a comprehensive evaluation of the proposed method and experimentally demonstrate the effectiveness of our approach, even when the skeleton structures of the two sources differ substantially.

Question: How do we combine two sources of training data?


A C-band microwave rectifier based on harmonic termination and with input filter removed. This paper presents a C-band rectifier employing a third harmonic termination which is realized by a λg/12 short-ended microstrip transmission line. The proposed harmonic termination balances the capacitive impedance of the diode at the fundamental frequency and blocks harmonic current of the diode. The input low-pass filter or matching circuit is removed and the bandwidth of rectifier is enhanced. Theoretical analysis and experiments are carried out. The results show that the proposed topology can realize high efficiency with a wide input frequency range. The fabricated rectifier has a compact dimension of 14mm by 22mm. A maximum RF-DC conversion efficiency of 75.6% at 13 dBm input power is observed. The measured efficiency remains above 70% with the operating frequency form 5.2 GHz to 6 GHz.

Question: What is the frequency range of the microwave rectifier?


Design and perceptual validation of performance measures for salient object segmentation. Empirical evaluation of salient object segmentation methods requires i) a dataset of ground truth object segmentations and ii) a performance measure to compare the output of the algorithm with the ground truth. In this paper, we provide such a dataset, and evaluate 5 distinct performance measures that have been used in the literature practically and psychophysically. Our results suggest that a measure based upon minimal contour mappings is most sensitive to shape irregularities and most consistent with human judgements. In fact, the contour mapping measure is as predictive of human judgements as human subjects are of each other. Region-based methods, and contour methods such as Hausdorff distances that do not respect the ordering of points on shape boundaries are significantly less consistent with human judgements. We also show that minimal contour mappings can be used as the correspondence paradigm for Precision-Recall analysis. Our findings can provide guidance in evaluating the results of segmentation algorithms in the future.

Question: What is the difference between a performance measure and a performance measure?


Hybrid algorithm for indoor positioning using wireless LAN. Locating an indoor mobile station based on a wireless communication infrastructure, has practical applications. The most widely employed methods today use an RF propagation loss (PL) model or location fingerprinting (LF). The PL method is known to perform poorly compared to LF. But LF requires an extensive training dataset and cannot adapt well to configuration changes or receiver breakdown. In this paper, we develop a hybrid method that combines the strength of these two methods. It first formulates the RF PL in a nonlinear, censored regression model and adjusts the regression function to the observed signal strength in the fingerprint dataset. In the absence of a training dataset, the hybrid method coincides with the PL method, and, as the spatial granularity of the training dataset increases, the result of the algorithm approaches the result of the LF method. It balances the flexibility and accuracy of the two traditional methods, makes intelligent use of missing values, produces error bounds, and can be made dynamic. We evaluate the performance of the algorithm by applying it to a real site and observe satisfactory positioning accuracy.

Question: What is the hybrid algorithm for indoor positioning using wireless LAN?


Multigranulation decision-theoretic rough sets. Article history: Available online 23 March 2013

Question: What is the history of rough sets?


Cortical demyelination and diffuse white matter injury in multiple sclerosis.. Focal demyelinated plaques in white matter, which are the hallmark of multiple sclerosis pathology, only partially explain the patient's clinical deficits. We thus analysed global brain pathology in multiple sclerosis, focusing on the normal-appearing white matter (NAWM) and the cortex. Autopsy tissue from 52 multiple sclerosis patients (acute, relapsing-remitting, primary and secondary progressive multiple sclerosis) and from 30 controls was analysed using quantitative morphological techniques. New and active focal inflammatory demyelinating lesions in the white matter were mainly present in patients with acute and relapsing multiple sclerosis, while diffuse injury of the NAWM and cortical demyelination were characteristic hallmarks of primary and secondary progressive multiple sclerosis. Cortical demyelination and injury of the NAWM, reflected by diffuse axonal injury with profound microglia activation, occurred on the background of a global inflammatory response in the whole brain and meninges. There was only a marginal correlation between focal lesion load in the white matter and diffuse white matter injury, or cortical pathology, respectively. Our data suggest that multiple sclerosis starts as a focal inflammatory disease of the CNS, which gives rise to circumscribed demyelinated plaques in the white matter. With chronicity, diffuse inflammation accumulates throughout the whole brain, and is associated with slowly progressive axonal injury in the NAWM and cortical demyelination.

Question: What is the difference between focal and diffuse white matter injury?


A PFC based BLDC motor drive using a Bridgeless Zeta converter. This paper deals with a PFC (Power Factor Corrected) Bridgeless Zeta converter based VSI (Voltage Source Inverter) fed BLDC (Brushless DC) motor drive. The speed control is achieved by controlling the voltage at the DC bus of VSI using a single voltage sensor. This facilitates the operation of VSI in fundamental frequency switching mode (Electronic Commutation of BLDC motor) in place of high frequency PWM (Pulse Width Modulation) switching for speed control. This leads to low switching losses in VSI and thus improves the efficiency of the drive. Moreover, a bridgeless configuration is used to reduce the conduction losses of DBR (Diode Bridge Rectifier). The bridgeless Zeta converter working in DCM (Discontinuous Conduction Mode) is used which utilizes a voltage follower approach thus requiring a single voltage sensor for speed control and PFC operation. The proposed drive is designed to operate over a wide range of speed control and under wide variation in supply voltages with high power factor and low harmonic distortion in the supply current at AC mains. An improved power quality is achieved with performance indices satisfying the international PQ (Power Quality) standards such as IEC-61000-3-2.

Question: What is a bridgeless Zeta converter?


Mobile marketing: the role of permission and acceptance. The escalation and convergence of distributed networks and wireless telecommunications has created a tremendous potential platform for providing business services. In consumer markets, mobile marketing is expected to be a key growth area. The immediacy, interactivity and mobility of wireless devices provide a novel platform for marketing. The personal and ubiquitous nature of devices means that interactivity can be provided anytime and anywhere. However, as experience has shown, it is important to keep the consumer in mind. Mobile marketing permission and acceptance are core issues that marketers have yet to fully explain or resolve. This paper provides direction in this area. After briefly discussing some background on mobile marketing, the paper conceptualises key characteristics for mobile marketing permission and acceptance. The paper concludes with predictions on the future of mobile marketing and some core areas of further research.

Question: What is the role of permission and acceptance in mobile marketing?


SEAME: a Mandarin-English code-switching speech corpus in south-east asia. In Singapore and Malaysia, people often speak a mixture of Mandarin and English within a single sentence. We call such sentences intra-sentential code-switch sentences. In this paper, we report on the development of a Mandarin-English codeswitching spontaneous speech corpus: SEAME. The corpus is developed as part of a multilingual speech recognition project and will be used to examine how Mandarin-English codeswitch speech occurs in the spoken language in South-East Asia. Additionally, it can provide insights into the development of large vocabulary continuous speech recognition (LVCSR) for code-switching speech. The corpus collected consists of intra-sentential code-switching utterances that are recorded under both interview and conversational settings. This paper describes the corpus design and the analysis of collected corpus.

Question: What is a code-switching speech corpus?


A Novel Antenna-in-Package With LTCC Technology for W-Band Application. In this letter, a novel antenna-in-package (AiP) technology at W-band has been proposed. This technology is presented for solving the special case that the metallic package should be used to accommodate high mechanical strength. By taking advantages of the multilayer low temperature co-fired ceramic (LTCC) technology, the radiation efficiency of the antenna can be maintained. Meanwhile, high mechanical strength and shielding performance are achieved. A prototype of AiP has been designed. The prototype constitutes integrated LTCC antenna, low-loss feeder, and metallic package with a tapered horn aperture. This LTCC feeder is realized by laminated waveguide (LWG). An LWG cavity that is buried in LTCC is employed to broaden the antenna impedance bandwidth. Electromagnetic (EM) simulations and measurements of antenna performances agree well over the whole frequency range of interest. The proposed prototype achieves a -10-dB impedance bandwidth of 10 GHz from 88 to 98 GHz and a peak gain of 12.3 dBi at 89 GHz.

Question: What is the novel antenna-in-package technology?


On Oblique Random Forests. Abstract. In his original paper on random forests, Breiman proposed two different decision tree ensembles: one generated from "orthogonal" trees with thresholds on individual features in every split, and one from "oblique" trees separating the feature space by randomly oriented hyperplanes. In spite of a rising interest in the random forest framework, however, ensembles built from orthogonal trees (RF) have gained most, if not all, attention so far. In the present work we propose to employ "oblique" random forests (oRF) built from multivariate trees which explicitly learn optimal split directions at internal nodes using linear discriminative models, rather than using random coefficients as the original oRF. This oRF outperforms RF, as well as other classifiers, on nearly all data sets but those with discrete factorial features. Learned node models perform distinctively better than random splits. An oRF feature importance score shows to be preferable over standard RF feature importance scores such as Gini or permutation importance. The topology of the oRF decision space appears to be smoother and better adapted to the data, resulting in improved generalization performance. Overall, the oRF propose here may be preferred over standard RF on most learning tasks involving numerical and spectral data.

Question: What is the difference between orthogonal and oblique random forests?


Nitroglycerin: a review of its use in the treatment of vascular occlusion after soft tissue augmentation.. BACKGROUND Skin necrosis after soft tissue augmentation with dermal fillers is a rare but potentially severe complication. Nitroglycerin paste may be an important treatment option for dermal and epidermal ischemia in cosmetic surgery.   OBJECTIVES To summarize the knowledge about nitroglycerin paste in cosmetic surgery and to understand its current use in the treatment of vascular compromise after soft tissue augmentation. To review the mechanism of action of nitroglycerin, examine its utility in the dermal vasculature in the setting of dermal filler-induced ischemia, and describe the facial anatomy danger zones in order to avoid vascular injury.   METHODS A literature review was conducted to examine the mechanism of action of nitroglycerin, and a treatment algorithm was proposed from clinical observations to define strategies for impending facial necrosis after filler injection.   RESULTS AND CONCLUSIONS Our experience with nitroglycerin paste and our review of the medical literature supports the use of nitroglycerin paste on the skin to help improve flow in the dermal vasculature because of its vasodilatory effect on small-caliber arterioles.

Question: What is the mechanism of action of nitroglycerin?


Blind Deconvolution Using Convex Programming. We consider the problem of recovering two unknown vectors, w and x, of length L from their circular convolution. We make the structural assumption that the two vectors are members of known subspaces, one with dimension N and the other with dimension K. Although the observed convolution is nonlinear in both w and x, it is linear in the rank-1 matrix formed by their outer product wx*. This observation allows us to recast the deconvolution problem as low-rank matrix recovery problem from linear measurements, whose natural convex relaxation is a nuclear norm minimization program. We prove the effectiveness of this relaxation by showing that, for "generic" signals, the program can deconvolve w and x exactly when the maximum of N and K is almost on the order of L. That is, we show that if x is drawn from a random subspace of dimension N, and w is a vector in a subspace of dimension K whose basis vectors are spread out in the frequency domain, then nuclear norm minimization recovers wx* without error. We discuss this result in the context of blind channel estimation in communications. If we have a message of length N, which we code using a random L x N coding matrix, and the encoded message travels through an unknown linear time-invariant channel of maximum length K, then the receiver can recover both the channel response and the message when L ≳ N + K, to within constant and log factors.

Question: How to recover a matrix from linear measurements?


Question: What is the journey to data quality?


Scattered data modeling. A variety of methods for modeling scattered data are discussed, with an emphasis on two types of data: volumetric and spherical. To demonstrate the performance of the various methods, results from an empirical study using trivariate scattered data are presented. The author's objective is to provide information to aid in selecting a type of method or to form the basis for customizing a method for a particular application.<<ETX>>

Question: What is a trivariate scattered data?


Obstacle Detection and Tracking for the Urban Challenge. This paper describes the obstacle detection and tracking algorithms developed for Boss, which is Carnegie Mellon University 's winning entry in the 2007 DARPA Urban Challenge. We describe the tracking subsystem and show how it functions in the context of the larger perception system. The tracking subsystem gives the robot the ability to understand complex scenarios of urban driving to safely operate in the proximity of other vehicles. The tracking system fuses sensor data from more than a dozen sensors with additional information about the environment to generate a coherent situational model. A novel multiple-model approach is used to track the objects based on the quality of the sensor data. Finally, the architecture of the tracking subsystem explicitly abstracts each of the levels of processing. The subsystem can easily be extended by adding new sensors and validation algorithms.

Question: What is the urban challenge?


A Kernel Between Sets of Vectors. In various application domains, including image recognition, it is natural to represent each example as a set of vectors. With a base kernel we can implicitly map these vectors to a Hilbert space and fit a Gaussian distribution to the whole set using Kernel PCA. We define our kernel between examples as Bhattacharyya's measure of affinity between such Gaussians. The resulting kernel is computable in closed form and enjoys many favorable properties, including graceful behavior under transformations, potentially justifying the vector set representation even in cases when more conventional representations also exist.

Question: What is kernel between sets of vectors?


CopyCatch: stopping group attacks by spotting lockstep behavior in social networks. How can web services that depend on user generated content discern fraudulent input by spammers from legitimate input? In this paper we focus on the social network Facebook and the problem of discerning ill-gotten Page Likes, made by spammers hoping to turn a profit, from legitimate Page Likes. Our method, which we refer to as CopyCatch, detects lockstep Page Like patterns on Facebook by analyzing only the social graph between users and Pages and the times at which the edges in the graph (the Likes) were created. We offer the following contributions: (1) We give a novel problem formulation, with a simple concrete definition of suspicious behavior in terms of graph structure and edge constraints. (2) We offer two algorithms to find such suspicious lockstep behavior - one provably-convergent iterative algorithm and one approximate, scalable MapReduce implementation. (3) We show that our method severely limits "greedy attacks" and analyze the bounds from the application of the Zarankiewicz problem to our setting. Finally, we demonstrate and discuss the effectiveness of CopyCatch at Facebook and on synthetic data, as well as potential extensions to anomaly detection problems in other domains. CopyCatch is actively in use at Facebook, searching for attacks on Facebook's social graph of over a billion users, many millions of Pages, and billions of Page Likes.

Question: How can web services that depend on user generated content discern fraudulent input by spammers from legitimate input?


Analyzing and predicting viral tweets. Twitter and other microblogging services have become indispensable sources of information in today's web. Understanding the main factors that make certain pieces of information spread quickly in these platforms can be decisive for the analysis of opinion formation and many other opinion mining tasks.  This paper addresses important questions concerning the spread of information on Twitter. What makes Twitter users retweet a tweet? Is it possible to predict whether a tweet will become "viral", i.e., will be frequently retweeted? To answer these questions we provide an extensive analysis of a wide range of tweet and user features regarding their influence on the spread of tweets. The most impactful features are chosen to build a learning model that predicts viral tweets with high accuracy. All experiments are performed on a real-world dataset, extracted through a public Twitter API based on user IDs from the TREC 2011 microblog corpus.

Question: What are the most important features for predicting viral tweets?


Investigation of a new GaN AC/DC topology for battery charging application. Switching losses are reduced by gallium nitride (GaN) technology, which allows faster device switching speeds. At the same time, the weight and size of converters utilizing these devices are greatly reduced in several applications by using high frequency (HF) transformers. A new, low voltage high current, GaN-based AC/DC topology for battery charging applications is simulated, modeled, and investigated in this paper. The proposed topology is designed to operate at 1 MHz for 120Vac to 48Vdc/60Vdc conversion for 1.4 kW load. The integration of GaN totem-pole power factor correction rectifier (TP-PFC), high-frequency series-resonant converter (SRC), and current doubler rectifier (CDR) presents an opportunity to further increase the efficiency and compactness of this GaN battery charging system. In this work, a new GaN topology to combine the advantages of TP-PFC and SRC with CDR in a battery charging converter is investigated, simulated, and modelled. Loss analysis of the proposed topology is addressed.

Question: What is the difference between a totem pole power factor correction rectifier and a series resonant converter?


Cross-modal Image-Graphics Retrieval by Neural Transfer Learning.

Question: How to retrieve images from a database?


Deep Learning of Semisupervised Process Data With Hierarchical Extreme Learning Machine and Soft Sensor Application. Data-driven soft sensors have been widely utilized in industrial processes to estimate the critical quality variables which are intractable to directly measure online through physical devices. Due to the low sampling rate of quality variables, most of the soft sensors are developed on small number of labeled samples and the large number of unlabeled process data is discarded. The loss of information greatly limits the improvement of quality prediction accuracy. One of the main issues of data-driven soft sensor is to furthest exploit the information contained in all available process data. This paper proposes a semisupervised deep learning model for soft sensor development based on the hierarchical extreme learning machine (HELM). First, the deep network structure of autoencoders is implemented for unsupervised feature extraction with all the process samples. Then, extreme learning machine is utilized for regression through appending the quality variable. Meanwhile, the manifold regularization method is introduced for semisupervised model training. The new method can not only deeply extract the information that the data contains, but learn more from the extra unlabeled samples as well. The proposed semisupervised HELM method is applied in a high–low transformer to estimate the carbon monoxide content, which shows a significant improvement of the prediction accuracy, compared to traditional methods.

Question: How to use extreme learning machine for regression?


Design and Sensitivity Analysis of Highly Compact Comparator for Ku-Band Monopulse Radar. This paper gives the design of a highly compact comparator at a Ku-band frequency and presents analysis results of the comparator for the fabrication inaccuracies. First an unconventional magic-t using a nonstandard waveguide is designed at 15.50 GHz. To reduce the volume occupied by the magic-t, its E-arm (or difference port) is kept parallel to the plane of two inputs of the magic-t instead of perpendicular to them as is done in a convention magic-t. The sum and the difference ports of the above folded magic-t are then matched using inductive windows at 15.50 GHz. Keeping the required location of the outputs of the comparator in mind, four of these matched folded magic-ts are suitably interconnected to design a highly compact comparator. The effects of the fabrication errors in the waveguide and matching elements dimensions on the centre frequency, magnitude and phase response of the comparator are also analyzed and presented.

Question: What is a magic-t?


THE EVOLUTION OF ACCOUNTING INFORMATION SYSTEMS. Technological evolution becomes more and more a daily reality for businesses and individuals who use information systems as for supporting their operational activities. This article focuses on the way technological evolution changes the accounting practices, starting from the analysis of the traditional model and trying to determine future trends and arising challenges to face. From data input to consolidation and reporting, accountants' function and operations are dissected in order to identify to what extent the development of new concepts, such as cloud computing, cloud accounting, real-time accounting or mobile accounting may affect the financial-accounting process, as well as the challenges that arise from the changing environment. SEA Practical Application of Science Volume III, Issue 1 (7) / 2015 92 Introduction Technology evolves rapidly as for responding to customers demand (Weiß and Leimeister, 2012). From a business perspective, more and more companies acknowledge the fact that technology may support process optimisation in terms of costs, lead time and involved resources. The actual market context is driving companies to continuously search for new ways to optimise their processes and increase their financial indicators (Christauskas and Miseviciene, 2012). The company's efficiency is in direct relation with the objective and timely financial information provided by the accounting system, the main purpose of which is to collect and record information regarding transactions or events with economic impact upon the company, as well as to process and provide relevant, fair information to stakeholders (both internal and external) (Girdzijauskas, et al., 2008; Kundeliene, 2011). The accounting system is thus essential in providing reliable, relevant, significant and useful information for the users of financial data (Kalcinskaite, 2009). From the deployment of basic accounting program or the use of large ERP sys

Question: What is the difference between the traditional model and the new model?


The Design and Analysis of Computer Algorithms. Addison-Wesley Pub. Co., 1974, , 470 pages. With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001.

Question: What is the name of the book?


Prevalence of kidney stones in the United States.. BACKGROUND The last nationally representative assessment of kidney stone prevalence in the United States occurred in 1994. After a 13-yr hiatus, the National Health and Nutrition Examination Survey (NHANES) reinitiated data collection regarding kidney stone history.   OBJECTIVE Describe the current prevalence of stone disease in the United States, and identify factors associated with a history of kidney stones.   DESIGN, SETTING, AND PARTICIPANTS A cross-sectional analysis of responses to the 2007-2010 NHANES (n=12 110).   OUTCOME MEASUREMENTS AND STATISTICAL ANALYSIS Self-reported history of kidney stones. Percent prevalence was calculated and multivariable models were used to identify factors associated with a history of kidney stones.   RESULTS AND LIMITATIONS The prevalence of kidney stones was 8.8% (95% confidence interval [CI], 8.1-9.5). Among men, the prevalence of stones was 10.6% (95% CI, 9.4-11.9), compared with 7.1% (95% CI, 6.4-7.8) among women. Kidney stones were more common among obese than normal-weight individuals (11.2% [95% CI, 10.0-12.3] compared with 6.1% [95% CI, 4.8-7.4], respectively; p<0.001). Black, non-Hispanic and Hispanic individuals were less likely to report a history of stone disease than were white, non-Hispanic individuals (black, non-Hispanic: odds ratio [OR]: 0.37 [95% CI, 0.28-0.49], p<0.001; Hispanic: OR: 0.60 [95% CI, 0.49-0.73], p<0.001). Obesity and diabetes were strongly associated with a history of kidney stones in multivariable models. The cross-sectional survey design limits causal inference regarding potential risk factors for kidney stones.   CONCLUSIONS Kidney stones affect approximately 1 in 11 people in the United States. These data represent a marked increase in stone disease compared with the NHANES III cohort, particularly in black, non-Hispanic and Hispanic individuals. Diet and lifestyle factors likely play an important role in the changing epidemiology of kidney

Question: What is the prevalence of kidney stones in the united states?


VOS-GAN: Adversarial Learning of Visual-Temporal Dynamics for Unsupervised Dense Prediction in Videos. Recent GAN-based video generation approaches model videos as the combination of a time-independent scene component and a time-varying motion component, thus factorizing the generation problem into generating background and foreground separately. One of the main limitations of current approaches is that both factors are learned by mapping one source latent space to videos, which complicates the generation task as a single data point must be informative of both background and foreground content. In this paper we propose a GAN framework for video generation that, instead, employs two latent spaces in order to structure the generative process in a more natural way: 1) a latent space to generate the static visual content of a scene (background), which remains the same for the whole video, and 2) a latent space where motion is encoded as a trajectory between sampled points and whose dynamics are modeled through an RNN encoder (jointly trained with the generator and the discriminator) and then mapped by the generator to visual objects' motion. Additionally, we extend current video discrimination approaches by incorporating in the learning procedure motion estimation and, leveraging the peculiarity of the generation process, unsupervised pixel-wise dense predictions. Extensive performance evaluation showed that our approach is able to a) synthesize more realistic videos than state-of-the-art methods, b) learn effectively both local and global video dynamics, as demonstrated by the results achieved on a video action recognition task over the UCF-101 dataset, and c) accurately perform unsupervised video object segmentation on standard video benchmarks, such as DAVIS, SegTrack and F4K-Fish.

Question: How large is the canadian military?


A Neural Representation of Sketch Drawings. We present sketch-rnn, a recurrent neural network (RNN) able to construct stroke-based drawings of common objects. The model is trained on thousands of crude human-drawn images representing hundreds of classes. We outline a framework for conditional and unconditional sketch generation, and describe new robust training methods for generating coherent sketch drawings in a vector format.

Question: How does the model work?


CRADLE: An Online Plan Recognition Algorithm for Exploratory Domains. In exploratory domains, agents' behaviors include switching between activities, extraneous actions, and mistakes. Such settings are prevalent in real world applications such as interaction with open-ended software, collaborative office assistants, and integrated development environments. Despite the prevalence of such settings in the real world, there is scarce work in formalizing the connection between high-level goals and low-level behavior and inferring the former from the latter in these settings. We present a formal grammar for describing users' activities in such domains. We describe a new top-down plan recognition algorithm called CRADLE (Cumulative Recognition of Activities and Decreasing Load of Explanations) that uses this grammar to recognize agents' interactions in exploratory domains. We compare the performance of CRADLE with state-of-the-art plan recognition algorithms in several experimental settings consisting of real and simulated data. Our results show that CRADLE was able to output plans exponentially more quickly than the state-of-the-art without compromising its correctness, as determined by domain experts. Our approach can form the basis of future systems that use plan recognition to provide real-time support to users in a growing class of interesting and challenging domains.

Question: What is a formal grammar for describing users' activities in exploratory domains?


Semantic File Systems. A semantic file system is an information storage system that provides flexible associative access to the system's contents by automatically extracting attributes from files with file type specific transducers. Associative access is provided by a conservative extension to existing tree-structured file system protocols, and by protocols that are designed specifically for content based access. Compatiblity with existing file system protocols is provided by introducing the concept of a virtual directory. Virtual directory names are interpreted as queries, and thus provide flexible associative access to files and directories in a manner compatible with existing software. Rapid attribute-based access to file system contents is implemented by automatic extraction and indexing of key properties of file system objects. The automatic indexing of files and directories is called "semantic" because user programmable transducers use information about the semantics of updated file system objects to extract the properties for indexing. Experimental results from a semantic file system implementation support the thesis that semantic file systems present a more effective storage abstraction than do traditional tree structured file systems for information sharing and command level programming.

Question: What is a semantic file system?


Salient Color Names for Person Re-identification.  A novel and effective salient color names (SCNCD) based color descriptor is proposed for person re-identification;  Background information is exploited to enrich the feature representation which is of good robustness against background interference and partial occlusions;  To tackle different types of illumination changes, color names distribution and color histograms are fused in four color spaces. Experimental Results

Question: What is a salient color name?


A voxel-based octree construction approach for procedural cave generation. Procedural content generation is becoming an increasingly popular research area as a means of algorithmically generating scene content for virtual environments. The automated generation of such content avoids the manual labour typically associated with creating scene content, and is extremely useful in application areas such as computer graphics, movie production and video games. While virtual 3D caves are commonly featured in these virtual environment applications, procedural cave generation is not an area that has received much attention among researchers to date. This paper presents a procedural approach to generating 3D cave structures. Other than the development of a method to effectively automate the generation of visually believable 3D cave models, this paper also investigates how to efficiently construct and store this spatial information using a voxel-based octree data structure. In addition, the proposed approach demonstrates that caves with different characteristics can be generated by adjusting certain parameters in order to facilitate the creation of diverse cave structures.

Question: How to generate a cave?


A survey and comparative study of data deduplication techniques. Increase in enormous amount of digital data needs more storage space, which in turn significantly increases the cost of backup and its performance. Traditional backup solutions do not provide any inherent capability to prevent duplicate data from being backed up. Backup of duplicate data significantly increases the backup time and unnecessary consumption of resources. Data Deduplication plays an important role in eliminating this redundant data and reducing the storage consumption. Its main intend is how to reduce more duplicates efficiently, removing them at high speed and to achieve good duplicate removal ratio. Many mechanisms have been proposed to meet these objectives. It has been observed that achieving one objective may affect the other. In this paper we classify and review the existing deduplication techniques. We also present evaluation of deduplication algorithms by measuring their performance in terms of complexity and efficiency with unstructured files. We propose an efficient means to achieve high deduplication ratio with minimum backup window. We also indicate some key issues need to focus in the future work.

Question: What is data deduplication?


Event-based social networks: linking the online and offline social worlds. Newly emerged event-based online social services, such as Meetup and Plancast, have experienced increased popularity and rapid growth. From these services, we observed a new type of social network - event-based social network (EBSN). An EBSN does not only contain online social interactions as in other conventional online social networks, but also includes valuable offline social interactions captured in offline activities. By analyzing real data collected from Meetup, we investigated EBSN properties and discovered many unique and interesting characteristics, such as heavy-tailed degree distributions and strong locality of social interactions.  We subsequently studied the heterogeneous nature (co-existence of both online and offline social interactions) of EBSNs on two challenging problems: community detection and information flow. We found that communities detected in EBSNs are more cohesive than those in other types of social networks (e.g. location-based social networks). In the context of information flow, we studied the event recommendation problem. By experimenting various information diffusion patterns, we found that a community-based diffusion model that takes into account of both online and offline interactions provides the best prediction power.  This paper is the first research to study EBSNs at scale and paves the way for future studies on this new type of social network. A sample dataset of this study can be downloaded from http://www.largenetwork.org/ebsn.

Question: What is the first large-scale Canadian peacekeeping mission?


Speech Synthesis of Code-Mixed Text. Most Text to Speech (TTS) systems today assume that the input text is in a single language and is written in the same language that the text needs to be synthesized in. However, in bilingual and multilingual communities, code mixing or code switching occurs in speech, in which speakers switch between languages in the same utterance. Due to the popularity of social media, we now see code-mixing even in text in these multilingual communities. TTS systems capable of synthesizing such text need to be able to handle text that is written in multiple languages and scripts. Code-mixed text poses many challenges to TTS systems, such as language identification, spelling normalization and pronunciation modeling. In this work, we describe a preliminary framework for synthesizing code-mixed text. We carry out experiments on synthesizing code-mixed Hindi and English text. We find that there is a significant user preference for TTS systems that can correctly identify and pronounce words in different languages.

Question: How to synthesize code-mixed text?


A Study on Evaluation of E-Government Service Quality. Service quality is the highest requirement by users, especially for the service in electronic government. During the past decades, it has become a major area of academic investigation. Considering this issue, there are a lot of researches that evaluated the dimensions and e-service contexts. This study also identified the dimensions of service quality, but focuses on a new concept and provides a new methodology in developing measurement scales of e-service quality such as information quality, service quality and organization quality. Finally, this study will suggest a key factor to evaluate e-government service quality better. Keywords—E-government, e-service, e-service quality, dimensionality.

Question: What is the key factor to evaluate e-government service quality better?


Decontaminating eukaryotic genome assemblies with machine learning. High-throughput sequencing has made it theoretically possible to obtain high-quality de novo assembled genome sequences but in practice DNA extracts are often contaminated with sequences from other organisms. Currently, there are few existing methods for rigorously decontaminating eukaryotic assemblies. Those that do exist filter sequences based on nucleotide similarity to contaminants and risk eliminating sequences from the target organism. We introduce a novel application of an established machine learning method, a decision tree, that can rigorously classify sequences. The major strength of the decision tree is that it can take any measured feature as input and does not require a priori identification of significant descriptors. We use the decision tree to classify de novo assembled sequences and compare the method to published protocols. A decision tree performs better than existing methods when classifying sequences in eukaryotic de novo assemblies. It is efficient, readily implemented, and accurately identifies target and contaminant sequences. Importantly, a decision tree can be used to classify sequences according to measured descriptors and has potentially many uses in distilling biological datasets.

Question: How can we decontaminate eukaryotic genome assemblies?