Beating the adaptive bandit with high probability. We provide a principled way of proving Õ(√T) high-probability guarantees for partial-information (bandit) problems over arbitrary convex decision sets. First, we prove a regret guarantee for the full-information problem in terms of "local" norms, both for entropy and self-concordant barrier regularization, unifying these methods. Given one of such algorithms as a black-box, we can convert a bandit problem into a full-information problem using a sampling scheme. The main result states that a high-probability Õ(√T) bound holds whenever the black-box, the sampling scheme, and the estimates of missing information satisfy a number of conditions, which are relatively easy to check. At the heart of the method is a construction of linear upper bounds on confidence intervals. As applications of the main result, we provide the first known efficient algorithm for the sphere with an Õ(√T) high-probability bound. We also derive the result for the n-simplex, improving the O(√nT log(nT)) bound of Auer et al [3] by replacing the log T term with log log T and closing the gap to the lower bound of Ω(√nT). While Õ(√T) high-probability bounds should hold for general decision sets through our main result, construction of linear upper bounds depends on the particular geometry of the set; we believe that the sphere example already exhibits the necessary ingredients. The guarantees we obtain hold for adaptive adversaries (unlike the in-expectation results of [1]) and the algorithms are efficient, given that the linear upper bounds on confidence can be computed.

Question: What is the difference between the full-information and the bandit problem?


An implementation of the FP-growth algorithm. The FP-growth algorithm is currently one of the fastest approaches to frequent item set mining. In this paper I describe a C implementation of this algorithm, which contains two variants of the core operation of computing a projection of an FP-tree (the fundamental data structure of the FP-growth algorithm). In addition, projected FP-trees are (optionally) pruned by removing items that have become infrequent due to the projection (an approach that has been called FP-Bonsai). I report experimental results comparing this implementation of the FP-growth algorithm with three other frequent item set mining algorithms I implemented (Apriori, Eclat, and Relim).

Question: What is the fastest frequent item set mining algorithm?


Labelled data collection for anomaly detection in wireless sensor networks. Security of wireless sensor networks (WSN) is an important research area in computer and communications sciences. Anomaly detection is a key challenge in ensuring the security of WSN. Several anomaly detection algorithms have been proposed and validated recently using labeled datasets that are not publicly available. Our group proposed an ellipsoid-based anomaly detection algorithm but demonstrated its performance using synthetic datasets and real Intel Berkeley Research Laboratory and Grand St. Bernard datasets which are not labeled with anomalies. This approach requires manual assignment of the anomalies' positions based on visual estimates for performance evaluation. In this paper, we have implemented a single-hop and multi-hop sensor-data collection network. In both scenarios we generated real labeled data for anomaly detection and identified different types of anomalies. These labeled sensor data and types of anomalies are useful for research, such as machine learning, and this information will be disseminated to the research community.

Question: What is the difference between a single-hop and multi-hop sensor-data collection network?


2D diffuse optical imaging using clustered sparsity. Diffuse optical imaging (DOI) is a non-invasive technique which measures hemodynamic changes in the tissue with near infrared light, and has been increasingly used to study brain functions. Due to the nature of light propagation in the tissue, the reconstruction problem is severely ill-posed. Sparsity-regularization has achieved promising results in recent works for linearized DOI problem. In this paper, we exploit more prior information to improve DOI besides sparsity. Based on the functional specialization of the brain, the in vivo absorption changes caused by specific brain function can be clustered in certain region(s) and not randomly distributed. Thus, a new algorithm is proposed to utilize this prior in reconstruction. Results of numerical simulations and phantom experiments have demonstrated the superiority of the proposed method over the state-of-the-art.

Question: What is the difference between the state-of-the-art and the proposed method?


Accidental displacement and migration of endosseous implants into  adjacent craniofacial structures: A review and update. OBJECTIVES Accidental displacement of endosseous implants into the maxillary sinus is an unusual but potential complication in implantology procedures due to the special features of the posterior aspect of the maxillary bone; there is also a possibility of migration throughout the upper paranasal sinuses and adjacent structures. The aim of this paper is to review the published literature about accidental displacement and migration of dental implants into the maxillary sinus and other adjacent structures.   STUDY DESIGN A review has been done based on a search in the main on-line medical databases looking for papers about migration of dental implants published in major oral surgery, periodontal, dental implant and ear-nose-throat journals, using the keywords "implant," "migration," "complication," "foreign body" and "sinus."   RESULTS 24 articles showing displacement or migration to maxillary, ethmoid and sphenoid sinuses, orbit and cranial fossae, with different degrees of associated symptoms, were identified. Techniques found to solve these clinical issues include Cadwell-Luc approach, transoral endoscopy approach via canine fossae and transnasal functional endoscopy surgery.   CONCLUSION Before removing the foreign body, a correct diagnosis should be done in order to evaluate the functional status of the ostiomeatal complex and the degree of affectation of paranasal sinuses and other involved structures, determining the size and the exact location of the foreign body. After a complete diagnosis, an indicated procedure for every case would be decided.

Question: What is the size of the canadian military?


Probabilistic Latent Semantic Analysis. Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, ma chine learning from text, and in related ar eas. Compared to standard Latent Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occurrence tables, the proposed method is based on a mixture decomposition derived from a latent class model. This results. in a more principled approach which has a solid foundation in statistics. In order to avoid overfitting, we propose a widely applicable generalization of maximum likelihood model fitting by tempered EM. Our approach yields substantial and consistent improvements over Latent Semantic Analysis in a number of ex periments.

Question: What is probabilistic latent semantic analysis?


LSTM-Based ECG Classification for Continuous Monitoring on Personal Wearable Devices. A novel ECG classification algorithm is proposed for continuous cardiac monitoring on wearable devices with limited processing capacity. The proposed solution employs a novel architecture consisting of wavelet transform and multiple LSTM recurrent neural networks (Fig. 1). Experimental evaluations show superior ECG classification performance compared to previous works. Measurements on different hardware platforms show the proposed algorithm meets timing requirements for continuous and real-time execution on wearable devices. In contrast to many compute-intensive deep-learning based approaches, the proposed algorithm is lightweight, and therefore, brings continuous monitoring with accurate LSTM-based ECG classification to wearable devices. The source code is available online [1].

Question: What is the source code?


Human model evaluation in interactive supervised learning. Model evaluation plays a special role in interactive machine learning (IML) systems in which users rely on their assessment of a model's performance in order to determine how to improve it. A better understanding of what model criteria are important to users can therefore inform the design of user interfaces for model evaluation as well as the choice and design of learning algorithms. We present work studying the evaluation practices of end users interactively building supervised learning systems for real-world gesture analysis problems. We examine users' model evaluation criteria, which span conventionally relevant criteria such as accuracy and cost, as well as novel criteria such as unexpectedness. We observed that users employed evaluation techniques---including cross-validation and direct, real-time evaluation---not only to make relevant judgments of algorithms' performance and interactively improve the trained models, but also to learn to provide more effective training data. Furthermore, we observed that evaluation taught users about what types of models were easy or possible to build, and users sometimes used this information to modify the learning problem definition or their plans for using the trained models in practice. We discuss the implications of these findings with regard to the role of generalization accuracy in IML, the design of new algorithms and interfaces, and the scope of potential benefits of incorporating human interaction in the design of supervised learning systems.

Question: What is the difference between a model and a model evaluation?


Learning to Pinpoint Singing Voice from Weakly Labeled Examples. Building an instrument detector usually requires temporally accurate ground truth that is expensive to create. However, song-wise information on the presence of instruments is often easily available. In this work, we investigate how well we can train a singing voice detection system merely from song-wise annotations of vocal presence. Using convolutional neural networks, multipleinstance learning and saliency maps, we can not only detect singing voice in a test signal with a temporal accuracy close to the state-of-the-art, but also localize the spectral bins with precision and recall close to a recent source separation method. Our recipe may provide a basis for other sequence labeling tasks, for improving source separation or for inspecting neural networks trained on auditory spectrograms.

Question: How to train a singing voice detector?


Forecasting seasonal time series with computational intelligence: On recent methods and the potential of their combinations. Accurate time series forecasting is a key issue to support individual and organizational decision making. In this paper, we introduce novel methods for multi-step seasonal time series forecasting. All the presented methods stem from computational intelligence techniques: evolutionary artificial neural networks, support vector machines and genuine linguistic fuzzy rules. Performance of the suggested methods is experimentally justified on seasonal time series from distinct domains on three forecasting horizons. The most important contribution is the introduction of a new hybrid combination using linguistic fuzzy rules and the other computational intelligence methods. This hybrid combination presents competitive forecasts, when compared with the popular ARIMA method. Moreover, such hybrid model is more easy to interpret by decision-makers when modeling trended series. 2012 Elsevier Ltd. All rights reserved.

Question: What is the forecast of the next season?


Realtime FPGA-based processing unit for a high-resolution automotive MIMO radar platform. Next generations of high-resolution automotive radar sensors rely on powerful, real-time capable processing units. High sampling rates, large antenna arrays as well as hard real-time constraints require the use of both parallel architectures and high-bandwidth memory interfaces. This paper presents a novel architecture of a FPGA-based multiple-input multiple-output (MIMO) radar sensor processing unit. Sampling rates up to 250 MSPS and a maximum of 16 parallel receiving channels can be used, resulting in a maximum data rate of 56GBit/s. The processing chain consists of a flexible FIR filter, a range-Doppler processing unit using windowed FFTs and an ordered statistics constant-false-alarm-rate (OS-CFAR) unit for optimal target detection and data reduction. The realized target system is composed of a Virtex7-FPGA and a 1GByte SDRAM memory. The resource usage of the FPGA implementation is analyzed in order to provide estimations for future system designs. Finally, the resulting performance of the system is verified in connection with a prototype MIMO radar front-end. High-resolution measurements of moving scenes have been carried out to validate the correct operation of the system.

Question: What is a MIMO radar sensor?


Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach. Observed in many real applications, a top-k query often consists of two components to reflect a user's preference: a selection condition and a ranking function. A user may not only propose ad hoc ranking functions, but also use different interesting subsets of the data. In many cases, a user may want to have a thorough study of the data by initiating a multi-dimensional analysis of the top-k query results. Previous work on top-k query processing mainly focuses on optimizing data access according to the ranking function only. The problem of efficient answering top-k queries with multi-dimensional selections has not been well addressed yet.This paper proposes a new computational model, called ranking cube, for efficient answering top-k queries with multi-dimensional selections. We define a rank-aware measure for the cube, capturing our goal of responding to multi-dimensional ranking analysis. Based on the ranking cube, an efficient query algorithm is developed which progressively retrieves data blocks until the top-k results are found. The curse of dimensionality is a well-known challenge for the data cube and we cope with this difficulty by introducing a new technique of ranking fragments. Our experiments on Microsoft's SQL Server 2005 show that our proposed approaches have significant improvement over the previous methods.

Question: What is the curse of dimensionality?


WebQual: An Exploration of Web-Site Quality. The issue of web-site quality is tackled from the perspective of the 'voice of the customer'. Quality function deployment (QFD) is adopted as a framework for identifying web-site qualities demanded by users, which are gathered through a quality workshop. From the workshop an instrument for assessing web-site quality is developed (WebQual) and tested in the domain of UK business schools. The results of the WebQual survey are presented and analyzed, leading to the generation of a WebQual Index of web-site quality. Work under way to extend and refine the WebQual instrument includes electronic commerce evaluation, where web-site service quality is proposed as a key issue.

Question: What is the quality of a web site?


Language as a Latent Variable: Discrete Generative Models for Sentence Compression. In this work we explore deep generative models of text in which the latent representation of a document is itself drawn from a discrete language model distribution. We formulate a variational auto-encoder for inference in this model and apply it to the task of compressing sentences. In this application the generative model first draws a latent summary sentence from a background language model, and then subsequently draws the observed sentence conditioned on this latent summary. In our empirical evaluation we show that generative formulations of both abstractive and extractive compression yield state-of-the-art results when trained on a large amount of supervised data. Further, we explore semi-supervised compression scenarios where we show that it is possible to achieve performance competitive with previously proposed supervised models while training on a fraction of the supervised data.

Question: What is a latent variable?


Lane detection using Fourier-based line detector. In this paper a new approach to lane marker detection problem is introduced as a significant complement for a semi/fully autonomous driver assistance system. The method incorporates advance line detection using multilayer fractional Fourier transform (MLFRFT) and the state-of-the-art advance lane detector (ALD). Experimental results have shown a considerable reduction in computational complexity.

Question: What is the computational complexity of the lane detection using Fourier-based line detector?


Comparative study of different methods of social network analysis and visualization. A Social Network is a social structure made of individuals or organizations that are linked by one or more specific types of interdependency, such as friends, kinship, terrorist relation, conflict, financial exchange, disease transmission (epidemiology), airline routes etc. Social Network Analysis is an approach to the study of human or organization social interactions. It can be used to investigate kinship patterns, community structure or the organization of other formal and informal social networks. Recently, email networks have been popular source of data for both analysis and visualization of social network of a person or organization. In this paper, three types of visualization technique to analyze social networks have been considered - Force directed layout, Spherical layout and Clustered layout. Each method was evaluated with various data sets from an organization. Force directed layout is used to view the total network structure (Overview). Spherical layout is a 3D method to reveal communication patterns and relationships between different groups. Clustered graph layout visualizes a large amount of data in an efficient and compact form. It gives a hierarchical view of the network. Among the three methods, Clustered layout is the best to handle large network and group relationship. Finally, the comparative study of these three methods has been given.

Question: What is social network analysis?


Toward Scalable Verification for Safety-Critical Deep Networks. The increasing use of deep neural networks for safety-critical applications, such as autonomous driving and flight control, raises concerns about their safety and reliability. Formal verification can address these concerns by guaranteeing that a deep learning system operates as intended, but the state-of-the-art is limited to small systems. In this work-in-progress report we give an overview of our work on mitigating this difficulty, by pursuing two complementary directions: devising scalable verification techniques, and identifying design choices that result in deep learning systems that are more amenable to verification. ACM Reference Format: Lindsey Kuper, Guy Katz, Justin Gottschlich, Kyle Julian, Clark Barrett, and Mykel J. Kochenderfer. 2018. Toward Scalable Verification for SafetyCritical Deep Networks. In Proceedings of SysML Conference (SysML). ACM, New York, NY, USA, 3 pages.

Question: How scalable is the verification of deep networks?


Energy-Aware Autonomic Resource Allocation in Multitier Virtualized Environments. With the increase of energy consumption associated with IT infrastructures, energy management is becoming a priority in the design and operation of complex service-based systems. At the same time, service providers need to comply with Service Level Agreement (SLA) contracts which determine the revenues and penalties on the basis of the achieved performance level. This paper focuses on the resource allocation problem in multitier virtualized systems with the goal of maximizing the SLAs revenue while minimizing energy costs. The main novelty of our approach is to address-in a unifying framework-service centers resource management by exploiting as actuation mechanisms allocation of virtual machines (VMs) to servers, load balancing, capacity allocation, server power state tuning, and dynamic voltage/frequency scaling. Resource management is modeled as an NP-hard mixed integer nonlinear programming problem, and solved by a local search procedure. To validate its effectiveness, the proposed model is compared to top-performing state-of-the-art techniques. The evaluation is based on simulation and on real experiments performed in a prototype environment. Synthetic as well as realistic workloads and a number of different scenarios of interest are considered. Results show that we are able to yield significant revenue gains for the provider when compared to alternative methods (up to 45 percent). Moreover, solutions are robust to service time and workload variations.

Question: What is the revenue of a service provider?


A new vector evaluated PBIL algorithm for reinsurance analytics. The purpose of this paper is to evaluate the performance of a new multiobjective algorithm called Vector Evaluated Population Based Incremental Learning (VEPBIL). The new algorithm was applied in solving a real world application named Reinsurance Contract Optimization (RCO), which is a multiobjective problem consisting of maximizing two conflicting functions: expected return and risk. The VEPBIL was tested on two instances of the problem composed by 7 and 15 layers of real anonymized data. In order to evaluate the algorithm, metrics such as hyper volume, number of solutions and coverage were used. A comparisons against Vector Evaluated Differential evolution (VEDE) is also carried out. The comparison has shown that VEPBIL can dominate about 70% and 50% of solutions from VEDE using 7 and 15 layers respectively, whereas VEDE dominates about 10% and 30% of solutions in the way around.

Question: What is the purpose of this paper?


Recent advances on active noise control : open issues and innovative applications. Yoshinobu Kajikawa, WoonSeng Gan and Sen M. Kuo APSIPA Transactions on Signal and Information Processing / Volume 1 / August 2012 / e3 DOI: 10.1017/ATSIP.2012.4, Published online: Link to this article: http://journals.cambridge.org/abstract_S2048770312000042 How to cite this article: Yoshinobu Kajikawa, WoonSeng Gan and Sen M. Kuo (2012). Recent advances on active noise control: open issues and innovative applications. APSIPA Transactions on Signal and Information Processing,1, e3 doi:10.1017/ATSIP.2012.4 Request Permissions : Click here

Question: How to cite this article: Yoshinobu Kajikawa, WoonSeng Gan and Sen M. Kuo (2012). Recent advances on active noise control: open issues and innovative applications. APSIPA Transactions on Signal and Information Processing,1, e3 doi:10.1017/


Probabilistic models in noisy environments : and their application to a visual prosthesis for the blind/. In recent years, probabilistic models have become fundamental techniques in machine learning. They are successfully applied in various engineering problems, such as robotics, biometrics, brain-computer interfaces or artificial vision, and will gain in importance in the near future. This work deals with the difficult, but common situation where the data is, either very noisy, or scarce compared to the complexity of the process to model. We focus on latent variable models, which can be formalized as probabilistic graphical models and learned by the expectation-maximization algorithm or its variants (e.g., variational Bayes). After having carefully studied a non-exhaustive list of multivariate kernel density estimators, we established that in most applications locally adaptive estimators should be preferred. Unfortunately, these methods are usually sensitive to outliers and have often too many parameters to set. Therefore, we focus on finite mixture models, which do not suffer from these drawbacks provided some structural modifications. Two questions are central in this dissertation: (i) how to make mixture models robust to noise, i.e. deal efficiently with outliers, and (ii) how to exploit side-channel information, i.e. additional information intrinsic to the data. In order to tackle the first question, we extend the training algorithms of the popular Gaussian mixture models to the Student-t mixture models. The Student-t distribution can be viewed as a heavy-tailed alternative to the Gaussian distribution, the robustness being tuned by an extra parameter, the degrees of freedom. Furthermore, we introduce a new variational Bayesian algorithm for learning Bayesian Student-t mixture models. This algorithm leads to very robust density estimators and clustering. To address the second question, we introduce manifold constrained mixture models. This new technique exploit

Question: How to make mixture models robust to noise?


Deep Learning for Video Classification and Captioning. Accelerated by the tremendous increase in Internet bandwidth and storage space, video data has been generated, published and spread explosively, becoming an indispensable part of today's big data. In this paper, we focus on reviewing two lines of research aiming to stimulate the comprehension of videos with deep learning: video classification and video captioning. While video classification concentrates on automatically labeling video clips based on their semantic contents like human actions or complex events, video captioning attempts to generate a complete and natural sentence, enriching the single label as in video classification, to capture the most informative dynamics in videos. In addition, we also provide a review of popular benchmarks and competitions, which are critical for evaluating the technical progress of this vibrant field.

Question: What is deep learning?


Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learning. In distributed training of deep neural networks, parallel minibatch SGD is widely used to speed up the training process by using multiple workers. It uses multiple workers to sample local stochastic gradient in parallel, aggregates all gradients in a single server to obtain the average, and update each worker's local model using a SGD update with the averaged gradient. Ideally, parallel mini-batch SGD can achieve a linear speed-up of the training time (with respect to the number of workers) compared with SGD over a single worker. However, such linear scalability in practice is significantly limited by the growing demand for gradient communication as more workers are involved. Model averaging, which periodically averages individual models trained over parallel workers, is another common practice used for distributed training of deep neural networks since (Zinkevich et al. 2010) (McDonald, Hall, and Mann 2010). Compared with parallel mini-batch SGD, the communication overhead of model averaging is significantly reduced. Impressively, tremendous experimental works have verified that model averaging can still achieve a good speed-up of the training time as long as the averaging interval is carefully controlled. However, it remains a mystery in theory why such a simple heuristic works so well. This paper provides a thorough and rigorous theoretical study on why model averaging can work as well as parallel mini-batch SGD with significantly less communication overhead. Introduction Consider the distributed training of deep neural networks over multiple workers (Dean et al. 2012), where all workers can access all or partial training data and aim to find a common model that yields the minimum training loss. Such a scenario can be modeled as the following distributed parallel non-convex optimization min x∈Rm f(x) ∆ = 1 N N ∑

Question: How many workers are there in the canadian military?


Predicting conversion from MCI to AD with FDG-PET brain images at different prodromal stages. Early diagnosis of Alzheimer disease (AD), while still at the stage known as mild cognitive impairment (MCI), is important for the development of new treatments. However, brain degeneration in MCI evolves with time and differs from patient to patient, making early diagnosis a very challenging task. Despite these difficulties, many machine learning techniques have already been used for the diagnosis of MCI and for predicting MCI to AD conversion, but the MCI group used in previous works is usually very heterogeneous containing subjects at different stages. The goal of this paper is to investigate how the disease stage impacts on the ability of machine learning methodologies to predict conversion. After identifying the converters and estimating the time of conversion (TC) (using neuropsychological test scores), we devised 5 subgroups of MCI converters (MCI-C) based on their temporal distance to the conversion instant (0, 6, 12, 18 and 24 months before conversion). Next, we used the FDG-PET images of these subgroups and trained classifiers to distinguish between the MCI-C at different stages and stable non-converters (MCI-NC). Our results show that MCI to AD conversion can be predicted as early as 24 months prior to conversion and that the discriminative power of the machine learning methods decreases with the increasing temporal distance to the TC, as expected. These findings were consistent for all the tested classifiers. Our results also show that this decrease arises from a reduction in the information contained in the regions used for classification and by a decrease in the stability of the automatic selection procedure.

Question: How can we predict conversion from MCI to AD?


MFCC and VQ voice recognition based ATM security for the visually disabled. A biometrie based automatic teller machine which works with a two-tier security using voice and fingerprint recognition can help users which are visually challenged, allowing them to use the machine using only their biometric characteristics. An automated teller machine (ATM) requires a user to pass an identity test using their PIN before doing any financial transactions. The current method available for access control in ATM is based on cards and pins which increases the issues of unauthorized access on accounts via card skimming. It is eminently difficult to avoid another person from attaining and using someone else's card also regular smartcards can be lost, duplicated, stolen or falsified with accuracy. Another concern is the accessibility of ATM to differently abled people. These concerns can be overcome by using fingerprint recognition for authentication, as discussed from the researchers' previous study, and by adding up an additional voice recognition system feature as discussed on this paper. The four fingerprint sample patterns of an individual are completely separate and uncorrelated. The action of fingerprint recognition involves pre-processing, feature extraction and minutiae matching. Matching is done by comparing the user's fingerprint with the existing fingerprint database, images which were acquired at the time of opening an account in the bank account. Once the fingerprint of the user passes the authentication procedures of the system the user is now able to carry out further transactions using voice-based commands by speaking through a microphone. This model not only provides security but also accessibility to certain sections of the population like people with visual impairment and eye disabilities. The system uses biometric based user recognition. The authenticity of the account will be checked by the input of the user's fingerprint, this will then allow further transact

Question: What is the difference between biometrics and biometrics?


Gamification of Clinical Routine: The Dr. Fill Approach. Gamification is used in clinical context in the health care education. Furthermore, it has shown great promises to improve the performance of the health care staff in their daily routine. In this work we focus on the medication sorting task, which is performed manually in hospitals. This task is very error prone and needs to be performed daily. Nevertheless, errors in the medication are crucial and lead to serious complications. In this work we present a real world gamification approach of the medication sorting task in a patient's daily pill organizer. The player of the game needs to sort the correct medication into the correct dispenser slots and is rewarded or punished in real time. At the end of the game, a score is given and the user can register in a leaderboard.

Question: What is gamification?


Semantic Segmentation of Mixed Crops using Deep Convolutional Neural Network. Estimation of in-field biomass and crop composition is important for both farmers and researchers. Using close-up high resolution images of the crops, crop species can be distinguished using image processing. In the current study, deep convolutional neural networks for semantic segmentation (or pixel-wise classification) of cluttered classes in RGB images was explored in case of catch crops and volunteer barley cereal. The dataset consisted of RGB images from a plot trial using oil radish as catch crops in barley. The images were captured using a high-end consumer camera mounted on a tractor. The images were manually annotated in 7 classes: oil radish, barley, weed, stump, soil, equipment and unknown. Data argumentation was used to artificially increase the dataset by transposing and flipping the images. A modified version of VGG-16 deep neural network was used. First, the last fully-connected layers were converted to convolutional layer and the depth was modified to cope with our number of classes. Secondly, a deconvolutional layer with a 32 stride was added between the last fully-connected layer and the softmax classification layer to ensure that the output layer has the same size as the input. Preliminary results using this network show a pixel accuracy of 79% and a frequency weighted intersection over union of 66%. These preliminary results indicate great potential in deep convolutional networks for segmentation of plant species in cluttered RGB images.

Question: What is the crop composition of a plot trial?


Region growing method for the analysis of functional MRI data. Existing analytical techniques for functional magnetic resonance imaging (fMRI) data always need some specific assumptions on the time series. In this article, we present a new approach for fMRI activation detection, which can be implemented without any assumptions on the time series. Our method is based on a region growing method, which is very popular for image segmentation. A comparison of performance on fMRI activation detection is made between the proposed method and the deconvolution method and the fuzzy clustering method with receiver operating characteristic (ROC) methodology. In addition, we examine the effectiveness and usefulness of our method on real experimental data. Experimental results show that our method outperforms over the deconvolution method and the fuzzy clustering method on a number of aspects. These results suggest that our region growing method can serve as a reliable analysis of fMRI data.

Question: What is the region growing method?


One Sentence One Model for Neural Machine Translation. Neural machine translation (NMT) becomes a new state-ofthe-art and achieves promising translation results using a simple encoder-decoder neural network. This neural network is trained once on the parallel corpus and the fixed network is used to translate all the test sentences. We argue that the general fixed network cannot best fit the specific test sentences. In this paper, we propose the dynamic NMT which learns a general network as usual, and then fine-tunes the network for each test sentence. The fine-tune work is done on a small set of the bilingual training data that is obtained through similarity search according to the test sentence. Extensive experiments demonstrate that this method can significantly improve the translation performance, especially when highly similar sentences are available.

Question: What is the neural machine translation?


Stochastic Neighbor Embedding. We describe a probabilistic approach to the task of placing objects, described by high-dimensional vectors or by pairwise dissimilarities, in a low-dimensional space in a way that preserves neighbor identities. A Gaussian is centered on each object in the high-dimensional space and the densities under this Gaussian (or the given dissimilarities) are used to define a probability distribution over all the potential neighbors of the object. The aim of the embedding is to approximate this distribution as well as possible when the same operation is performed on the low-dimensional "images" of the objects. A natural cost function is a sum of Kullback-Leibler divergences, one per object, which leads to a simple gradient for adjusting the positions of the low-dimensional images. Unlike other dimensionality reduction methods, this probabilistic framework makes it easy to represent each object by a mixture of widely separated low-dimensional images. This allows ambiguous objects, like the document count vector for the word "bank", to have versions close to the images of both "river" and "finance" without forcing the images of outdoor concepts to be located close to those of corporate concepts.

Question: What is stochastic neighbor embedding?


Closing the learning-planning loop with predictive state representations. A central problem in artificial intelligence is that of planning to maximize future reward under uncertainty in a partially observable environment. In this paper we propose and demonstrate a novel algorithm which accurately learns a model of such an environment directly from sequences of action-observation pairs. We then close the loop from observations to actions by planning in the learned model and recovering a policy which is near-optimal in the original environment. Specifically, we present an efficient and statistically consistent spectral algorithm for learning the parameters of a Predictive State Representation (PSR). We demonstrate the algorithm by learning a model of a simulated high-dimensional, vision-based mobile robot planning task, and then perform approximate point-based planning in the learned PSR. Analysis of our results shows that the algorithm learns a state space which efficiently captures the essential features of the environment. This representation allows accurate prediction with a small number of parameters, and enables successful and efficient planning.

Question: How do we learn a model of a high-dimensional, vision-based mobile robot planning task?


AMEE Guide No. 14: Outcome-based education: Part 1-An introduction to outcome-based education. SUMM AR Y Outcome-based education, a performance-based approach at the cutting edge of curr iculum development, offers a powerful and appealing way of reforming and managing medical education. The emphasis is on the productÐ what sort of doctor will be producedÐ rather than on the educational process. In outcome-based education the educational outcomes are clearly and unambiguously speci ® ed. These determine the curr iculum content and its organisation, the teaching methods and strategies, the courses offered, the assessment process, the educational environment and the curriculum timetable.They also provide a framework for curr iculum evaluation. A doctor is a unique combination of different kinds of abilities. A three-circle model can be used to present the learning outcomes in medical education, with the tasks to be performed by the doctor in the inner core, the approaches to the performance of the tasks in the middle area, and the growth of the individual and his or her role in the practice of medicine in the outer area. Medical schools need to prepare young doctors to practise in an increasingly complex healthcare scene with changing patient and public expectations, and increasing demands from employing authorities. Outcome-based education offers many advantages as a way of achieving this. It emphasises relevance in the curriculum and accountability, and can provide a clear and unambiguous framework for curr iculum planning which has an intuitive appeal. It encourages the teacher and the student to share responsibility for learning and it can guide student assessment and course evaluation. What sort of outcomes should be covered in a curriculum, how should they be assessed and how should outcome-based education be implemented are issues that need to be addressed.

Question: What is outcome-based education?


Performance of elasticsearch in cloud environment with nGram and non-nGram indexing. The fact that technology have changed the lives of human beings cannot be denied. It has drastically reduced the effort needed to perform a particular task and has increased the productivity and efficiency. Computers especially have been playing a very important role in almost all fields in today's world. They are used to store large amount of data in almost all sectors, be it business and industrial sectors, personal lives or any other. The research areas of science and technology uses computers to solve complex and critical problems. Information is the most important requirement of each individual. In this era of quick-growing and huge data, it has become increasingly illogical to analyse it with the help of traditional techniques or relational databases. New big data instruments, architectures and designs have come into existence to give better support to the requirements of organizations/institutions in analysing large data. Specifically, Elasticsearch, a full-text java based search engine, designed keeping cloud environment in mind solves issues of scalability, search in real time, and efficiency that relational databases were not able to address. In this paper, we present our own experience with Elasticsearch an open source, Apache Lucene based, full-text search engine that provides near real-time search ability, as well as a RESTful API for the ease of user in the field of research.

Question: What is the difference between Elasticsearch and Lucene?


Stealthy Dopant-Level Hardware Trojans. In recent years, hardware Trojans have drawn the attention of governments and industry as well as the scientific community. One of the main concerns is that integrated circuits, e.g., for military or criticalinfrastructure applications, could be maliciously manipulated during the manufacturing process, which often takes place abroad. However, since there have been no reported hardware Trojans in practice yet, little is known about how such a Trojan would look like, and how difficult it would be in practice to implement one. In this paper we propose an extremely stealthy approach for implementing hardware Trojans below the gate level, and we evaluate their impact on the security of the target device. Instead of adding additional circuitry to the target design, we insert our hardware Trojans by changing the dopant polarity of existing transistors. Since the modified circuit appears legitimate on all wiring layers (including all metal and polysilicon), our family of Trojans is resistant to most detection techniques, including fine-grain optical inspection and checking against "golden chips". We demonstrate the effectiveness of our approach by inserting Trojans into two designs — a digital post-processing derived from Intel's cryptographically secure RNG design used in the Ivy Bridge processors and a side-channel resistant SBox implementation — and by exploring their detectability and their effects on security.

Question: What is a stealthy hardware Trojan?


Options for Control of Reactive Power by Distributed Photovoltaic Generators. High-penetration levels of distributed photovoltaic (PV) generation on an electrical distribution circuit present several challenges and opportunities for distribution utilities. Rapidly varying irradiance conditions may cause voltage sags and swells that cannot be compensated by slowly responding utility equipment resulting in a degradation of power quality. Although not permitted under current standards for interconnection of distributed generation, fast-reacting, VAR-capable PV inverters may provide the necessary reactive power injection or consumption to maintain voltage regulation under difficult transient conditions. As side benefit, the control of reactive power injection at each PV inverter provides an opportunity and a new tool for distribution utilities to optimize the performance of distribution circuits, e.g., by minimizing thermal losses. We discuss and compare via simulation various design options for control systems to manage the reactive power generated by these inverters. An important design decision that weighs on the speed and quality of communication required is whether the control should be centralized or distributed (i.e., local). In general, we find that local control schemes are able to maintain voltage within acceptable bounds. We consider the benefits of choosing different local variables on which to control and how the control system can be continuously tuned between robust voltage control, suitable for daytime operation when circuit conditions can change rapidly, and loss minimization better suited for nighttime operation.

Question: What is the difference between a centralized and a distributed control system?


From Few to Many: Generative Models for Recognition Under Variable Pose and Illumination. Image variability due to changes in pose and illumination can seriously impair object recognition. This paper presents appearance-based methods which, unlike previous appearance-based approaches, require only a small set of training images to generate a rich representation that models this variability. Speci cally, from as few as three images of an object in xed pose seen under slightly varying but unknown lighting, a surface and an albedo map are reconstructed. These are then used to generate synthetic images with large variations in pose and illumination and thus build a representation useful for object recognition. Our methods have been tested within the domain of face recognition on a subset of the Yale Face Database B containing 4050 images of 10 faces seen under variable pose and illumination. This database was speci cally gathered for testing these generative methods. Their performance is shown to exceed that of popular existing methods.

Question: What is the yale face database?


ValueCharts: analyzing linear models expressing preferences and evaluations. In this paper we propose ValueCharts, a set of visualizations and interactive techniques intended to support decision-makers in inspecting linear models of preferences and evaluation. Linear models are popular decision-making tools for individuals, groups and organizations. In Decision Analysis, they help the decision-maker analyze preferential choices under conflicting objectives. In Economics and the Social Sciences, similar models are devised to rank entities according to an evaluative index of interest. The fundamental goal of building models expressing preferences and evaluations is to help the decision-maker organize all the information relevant to a decision into a structure that can be effectively analyzed. However, as models and their domain of application grow in complexity, model analysis can become a very challenging task. We claim that ValueCharts will make the inspection and application of these models more natural and effective. We support our claim by showing how ValueCharts effectively enable a set of basic tasks that we argue are at the core of analyzing and understanding linear models of preferences and evaluation.

Question: What is a linear model of preferences and evaluation?


Attention Deficit Hyperactivity Disorder: Is There an App for That? Suitability Assessment of Apps for Children and Young People With ADHD. BACKGROUND Attention-deficit/hyperactivity disorder (ADHD) is a complex highly comorbid disorder, which can have a huge impact on those with ADHD, their family, and the community around them. ADHD is currently managed using pharmacological and nonpharmacological interventions. However, with advances in technology and an increase in the use of mobile apps, managing ADHD can be augmented using apps specifically designed for this population. However, little is known regarding the suitability and usability of currently available apps.   OBJECTIVE The aim of this study was to explore the suitability of the top 10 listed apps for children and young people with ADHD and clinicians who work with them. It is hypothesized that mobile apps designed for this population could be more suitably designed for this population.   METHODS The top 10 listed apps that are specifically targeted toward children and young people with ADHD in the United Kingdom were identified via the Google Play (n=5) and iTunes store (n=5). Interviews were then undertaken with 5 clinicians who specialize in treating this population and 5 children and young people with ADHD themselves, to explore their opinions of the 10 apps identified and what they believe the key components are for apps to be suitable for this population.   RESULTS Five themes emerged from clinician and young people interviews: the accessibility of the technology, the importance of relating to apps, addressing ADHD symptoms and related difficulties, age appropriateness, and app interaction. Three additional themes emerged from the clinician interviews alone: monitoring symptoms, side effects and app effect on relationships, and the impact of common comorbid conditions. The characteristics of the apps did not appear to match well with the views of our sample.   CONCLUSIONS These findings suggest that

Question: What is the canadian military?


Self-disclosure on Facebook among female users and its relationship to feelings of loneliness. URLs: Self-disclosure on Facebook among female users and its relationship to feelings of loneliness Author(s): Al-Saggaf, Y.M. ; Nielsen, S.G. Computers in Human Behavior

Question: How to self-disclose on Facebook?


Fast Computation of Wasserstein Barycenters. We present new algorithms to compute the mean of a set of empirical probability measures under the optimal transport metric. This mean, known as the Wasserstein barycenter, is the measure that minimizes the sum of its Wasserstein distances to each element in that set. We propose two original algorithms to compute Wasserstein barycenters that build upon the subgradient method. A direct implementation of these algorithms is, however, too costly because it would require the repeated resolution of large primal and dual optimal transport problems to compute subgradients. Extending the work of Cuturi (2013), we propose to smooth the Wasserstein distance used in the definition of Wasserstein barycenters with an entropic regularizer and recover in doing so a strictly convex objective whose gradients can be computed for a considerably cheaper computational cost using matrix scaling algorithms. We use these algorithms to visualize a large family of images and to solve a constrained clustering problem.

Question: How to compute the Wasserstein barycenter of a set of empirical probability measures?


How Much Is Enough? Choosing ε for Differential Privacy. Differential privacy is a recent notion, and while it is nice conceptually it has been difficult to apply in practice. The parameters of differential privacy have an intuitive theoretical interpretation, but the implications and impacts on the risk of disclosure in practice have not yet been studied, and choosing appropriate values for them is non-trivial. Although the privacy parameter in differential privacy is used to quantify the privacy risk posed by releasing statistics computed on sensitive data, is not an absolute measure of privacy but rather a relative measure. In effect, even for the same value of , the privacy guarantees enforced by differential privacy are different based on the domain of attribute in question and the query supported. We consider the probability of identifying any particular individual as being in the database, and demonstrate the challenge of setting the proper value of given the goal of protecting individuals in the database with some fixed probability.

Question: How much is enough?


A Planning based Framework for Essay Generation. Generating an article automatically with computer program is a challenging task in artificial intelligence and natural language processing. In this paper, we target at essay generation, which takes as input a topic word in mind and generates an organized article under the theme of the topic. We follow the idea of text planning (Reiter and Dale, 1997) and develop an essay generation framework. The framework consists of three components, including topic understanding, sentence extraction and sentence reordering. For each component, we studied several statistical algorithms and empirically compared between them in terms of qualitative or quantitative analysis. Although we run experiments on Chinese corpus, the method is language independent and can be easily adapted to other language. We lay out the remaining challenges and suggest avenues for future research.

Question: What is the topic of the document?


Diagnosability of discrete-event systems. Abstruct-Fault detection and isolation is a crucial and challenging task in the automatic control of large complex systems. We propose a discrete-event system (DES) approach to the problem of failure diagnosis. We introduce two related notions of diagnosability of DES's in the framework of formal languages and compare diagnosability with the related notions of observability and invertibility. We present a systematic procedure for detection and isolation of failure events using diagnosers and provide necessary and sufficient conditions for a language to be diagnosable. The diagnoser performs diagnostics using online observations of the system behavior; it is also used to state and verify off-line the necessary and sufficient conditions for diagnosability. These conditions are stated on the diagnoser or variations thereof. The approach to failure diagnosis presented in this paper is applicable to systems that fall naturally in the class of DES's; moreover, for the purpose of diagnosis, most continuous variable dynamic systems can be viewed as DES's at a higher level of abstraction. In a companion paper [20], we provide a methodology for building DES models for the purpose of failure diagnosis and present applications of the theory developed in this paper.

Question: What is a discrete-event system?


Recurrent Capsule Network for Relations Extraction: A Practical Application to the Severity Classification of Coronary Artery Disease. Coronary artery disease (CAD) is one of the leading causes of cardiovascular disease deaths. CAD condition progresses rapidly, if not diagnosed and treated at an early stage may eventually lead to an irreversible state of the heart muscle death. Invasive coronary arteriography is the gold standard technique for CAD diagnosis. Coronary arteriography texts describe which part has stenosis and how much stenosis is in details. It is crucial to conduct the severity classification of CAD. In this paper, we propose a recurrent capsule network (RCN) to extract semantic relations between clinical named entities in Chinese coronary arteriography texts, through which we can automatically find out the maximal stenosis for each lumen to inference how severe CAD is according to the improved method of Gensini. Experimental results on the corpus collected from Shanghai Shuguang Hospital show that our proposed RCN model achieves a F1-score of 0.9641 in relation extraction, which outperforms the baseline methods.

Question: How severe is coronary artery disease?


Development of a Danish Language Version of the Manchester Foot Pain and Disability Index: Reproducibility and Construct Validity Testing. Introduction. The Manchester Foot Pain and Disability Index (MFPDI) is a 19-item questionnaire for the assessment of disability caused by foot pain. The aim was to develop a Danish language version of the MFPDI (MFPDI-DK) and evaluate its reproducibility and construct validity. Methods. A Danish version was created, following a forward-backward translation procedure. A sample of 84 adult patients with foot pain was recruited. Participants completed two copies of the MFPDI-DK within a 24- to 48-hour interval, along with the Medical Outcomes Study Short Form 36 (SF-36), and a pain Visual Analog Scale (VAS). Reproducibility was assessed using the intraclass correlation coefficient (ICC) and 95% limits of agreement (Bland-Altman plot). Construct validity was evaluated with Pearson's Rho, using a priori hypothesized correlations with SF-36 subscales and VASmean. Results. The MFPDI-DK showed very good reliability with an ICC of 0.92 (0.88-0.95). The 95% limits of agreement ranged from -6.03 to 6.03 points. Construct validity was supported by moderate to very strong correlations with the SF-36 physical subscales and VASmean. Conclusion. The MFPDI-DK appears to be a valid and reproducible instrument in evaluating foot-pain-related disability in Danish adult patients in cross-sectional samples. Further research is needed to test the responsiveness of the MFPDI-DK.

Question: What is the difference between a Danish language version of the Manchester Foot Pain and Disability Index and the original Manchester Foot Pain and Disability Index?


A Novel Anomaly Detection Scheme Based on Principal Component Classifier. This paper proposes a novel scheme that uses robust principal component classifier in intrusion detection problems where the training data may be unsupervised. Assuming that anomalies can be treated as outliers, an intrusion predictive model is constructed from the major and minor principal components of the normal instances. A measure of the difference of an anomaly from the normal instance is the distance in the principal component space. The distance based on the major components that account for 50% of the total variation and the minor components whose eigenvalues less than 0.20 is shown to work well. The experiments with KDD Cup 1999 data demonstrate that the proposed method achieves 98.94% in recall and 97.89% in precision with the false alarm rate 0.92% and outperforms the nearest neighbor method, density-based local outliers (LOF) approach, and the outlier detection algorithm based on Canberra metric.

Question: What is the distance in the principal component space?


Comparison of Leaf Recognition by Moments and Fourier Descriptors. We test various features for recognition of leaves of wooden species. We compare Fourier descriptors, Zernike moments, Legendre moments and Chebyshev moments. All the features are computed from the leaf boundary only. Experimental evaluation on real data indicates that Fourier descriptors slightly outperform the other tested features.

Question: What is the difference between Fourier descriptors and Zernike moments?


Vehicle detection with sub-class training using R-CNN for the UA-DETRAC benchmark. Different types of vehicles, such as buses and cars, can be quite different in shapes and details. This makes it more difficult to try to learn a single feature vector that can detect all types of vehicles using a single object class. We proposed an approach to perform vehicle detection with Sub-Classes categories learning using R-CNN in order to improve the performance of vehicle detection. Instead of using a single object class, which is a vehicle in this experiment, to train on the R-CNN, we used multiple sub-classes of vehicles so that the network can better learn the features of each individual type. In the experiment, we also evaluated the result of using a transfer learning approach to use a pre-trained weights on a new dataset.

Question: What is a pre-trained weights?


Cyber Security Resource Allocation: A Markov Decision Process Approach. An effective defense-in-depth in cyber security applies multiple layers of defense throughout a system. The goalis to defend a system against cyber-attack using severalindependent methods. Therefore, a cyber-attack that is able to penetrate one layer of defense may be unsuccessful in other layers. Common layers of cyber defense include: attack avoidance, prevention, detection, survivability and recovery. It follows that in security-conscious organizations, the cyber security investment portfolio is divided into different layers of defense. For instance, a two-way division is agility and recovery. Cyber agility pursues attack avoidance techniques such that cyber-attacks are rendered as ineffective, whereas cyber recovery seeks to fight-through successful attacks. We show that even when the primary focus is on the agility of a system, recovery should be an essential point during implementation because the frequency of attacks will degrade the system and a quick and fast recovery is necessary. However, there is not yet an optimum mechanism to allocate limited cyber security resourcesinto the different layers. We propose an approach using theMarkov Decision Process (MDP) framework for resourcesallocation between the two end layers: agility and recovery.

Question: How to allocate cyber security resources?


Statistical Learning Algorithms Applied to Automobile Insurance. We recently conducted a research project for a large North American automobile insurer. This study was the most exhaustive ever undertaken by this particular insurer and lasted over an entire year. We analyzed the discriminating power of each variable used for ratemaking. We analyzed the performance of several models within five broad categories: linear regressions, generalized linear models, decision trees, neural networks and support vector machines. In this paper, we present the main results of this study. We qualitatively compare models and show how neural networks can represent high-order nonlinear dependencies with a small number of parameters, each of which is estimated on a large proportion of the data, thus yielding low variance. We thoroughly explain the purpose of the nonlinear sigmoidal transforms which are at the very heart of neural networks' performances. The main numerical result is a statistically significant reduction in the out-of-sample meansquared error using the neural network model and our ability to substantially reduce the median premium by charging more to the highest risks. This in turn can translate into substantial savings and financial benefits for an insurer. We hope this paper goes a long way in convincing actuaries to include neural networks within their set of modeling tools for ratemaking.

Question: What is the purpose of the nonlinear sigmoidal transforms?


Service Migration Patterns -- Decision Support and Best Practices for the Migration of Existing Service-Based Applications to Cloud Environments. In many ways cloud computing is an extension of the service-oriented computing (SOC) approach to create resilient and elastic hosting environments and applications. Service-oriented Architectures (SOA), thus, share many architectural properties with cloud environments and cloud applications, such as the distribution of application functionality among multiple application components (services) and their loosely coupled integration to form a distributed application. Existing service-based applications are, therefore, ideal candidates to be moved to cloud environments in order to benefit from the cloud properties, such as elasticity or pay-per-use pricing models. In order for such an application migration and the overall restructuring of an IT application landscape to be successful, decisions have to be made regarding (i) the portion of the application stack to be migrated and (ii) the process to follow during the migration in order to guarantee an acceptable service level to application users. In this paper, we present best practices how we addressed these challenges in form of service migration patterns as well as a methodology how these patterns should be applied during the migration of a service-based application or multiples thereof. Also, we present an implementation of the approach, which has been used to migrate a web-application stack from Amazon Web Services to the T-Systems cloud offering Dynamic Services for Infrastructure (DSI).

Question: What is the difference between service-oriented computing and cloud computing?


Towards Modelling Pedestrian-Vehicle Interactions: Empirical Study on Urban Unsignalized Intersection. The modelling and simulation of the interaction among vehicles and pedestrians during crosswalking is an open challenge for both research and practical computational solutions supporting urban/traffic decision makers and managers. The social cost of pedestrians' risky behaviour pushes the development of a new generation of computational models integrating analytical knowledge, data and experience about the complex dynamics occurring in pedestrian/vehicle interactions, which are not completely understood despite recent efforts. This paper presents the results of a significant data gathering campaign realised at an unsignalized zebra crossing. The selected area of the city of Milan (Italy) is characterised by a significant presence of elderly inhabitants and pedestrian-vehicle risky interactions, testified by a high number of accidents involving pedestrians in the past years. The results concern the analysis of: (i) vehicular and pedestrian traffic volumes; (ii) level of service; (iii) pedestrian-vehicle interactions, considering the impact of ageing on crossing behaviour. Results showed that the phenomenon is characterised by three main phases: approaching, appraising (evaluation of the distance and speed of oncoming vehicles) and crossing. The final objective of the research is to support the development of a microscopic agent-based tool for simulating pedestrian behaviour at unsignalized crosswalks, focusing on the specific needs of the elderly pedestrians.

Question: What is the purpose of the paper?


Toward Open Set Recognition. To date, almost all experimental evaluations of machine learning-based recognition algorithms in computer vision have taken the form of "closed set" recognition, whereby all testing classes are known at training time. A more realistic scenario for vision applications is "open set" recognition, where incomplete knowledge of the world is present at training time, and unknown classes can be submitted to an algorithm during testing. This paper explores the nature of open set recognition and formalizes its definition as a constrained minimization problem. The open set recognition problem is not well addressed by existing algorithms because it requires strong generalization. As a step toward a solution, we introduce a novel "1-vs-set machine," which sculpts a decision space from the marginal distances of a 1-class or binary SVM with a linear kernel. This methodology applies to several different applications in computer vision where open set recognition is a challenging problem, including object recognition and face verification. We consider both in this work, with large scale cross-dataset experiments performed over the Caltech 256 and ImageNet sets, as well as face matching experiments performed over the Labeled Faces in the Wild set. The experiments highlight the effectiveness of machines adapted for open set evaluation compared to existing 1-class and binary SVMs for the same tasks.

Question: What is the difference between open set and closed set recognition?


Tap water versus sterile saline solution in the colonisation of skin wounds.. Irrigating wounds with tap water does not increase colonisation, but controlled studies are required for further evidence. Microbial colonisation was assessed in skin wounds, before and after irrigation with tap water, and was compared with irrigation using 0·9% sodium chloride sterile solution. The study included 120 subjects with chronic, traumatic, vascular, pressure or neuropathic wounds. A total of 60 wounds were randomly assigned to be irrigated with tap water (tap water group) and another 60 to be irrigated with 0·9% sodium chloride sterile solution (saline group), at a pressure of 0·46-0·54 PSI. Samples were collected from the centre of each wound using Levine's technique, before and after irrigation, and cultivated in thioglycollate, hypertonic mannitol agar, eosin methylene blue (EMB) agar, blood agar and Sabouraud agar at 37°C for 72 hours. There was concordance (kappa test) and discordance (McNemar test) regarding the count of positive and/or negative samples before and after irrigation in each group. The proportion of reduction of positive samples was similar for both groups in all cultures. Colony-forming unit count before and after irrigation was similar in both groups and in all cultures, except for the culture in hypertonic mannitol agar from the tap water group, for which the count was lower after irrigation (Wilcoxon z = 2·05, P = 0·041). It is concluded that skin wound irrigation with tap water leads to further reduction of Gram-positive bacteria compared with 0·9% sodium chloride sterile solution, with no difference in colonisation of haemolytic bacteria, Gram-negative bacteria and fungi.

Question: What is the difference between tap water and sterile saline solution in the colonisation of skin wounds?


Satellite Image Classification Methods and Techniques: A Review. Satellite image classification process involves grouping the image pixel values into meaningful categories. Several satellite image classification methods and techniques are available. Satellite image classification methods can be broadly classified into three categories 1) automatic 2) manual and 3) hybrid. All three methods have their own advantages and disadvantages. Majority of the satellite image classification methods fall under first category. Satellite image classification needs selection of appropriate classification method based on the requirements. The current research work is a study on satellite image classification methods and techniques. The research work also compares various researcher's comparative results on satellite image classification methods.

Question: What is the satellite image classification methods and techniques?


Automatic semantic classification of scientific literature according to the hallmarks of cancer. MOTIVATION The hallmarks of cancer have become highly influential in cancer research. They reduce the complexity of cancer into 10 principles (e.g. resisting cell death and sustaining proliferative signaling) that explain the biological capabilities acquired during the development of human tumors. Since new research depends crucially on existing knowledge, technology for semantic classification of scientific literature according to the hallmarks of cancer could greatly support literature review, knowledge discovery and applications in cancer research.   RESULTS We present the first step toward the development of such technology. We introduce a corpus of 1499 PubMed abstracts annotated according to the scientific evidence they provide for the 10 currently known hallmarks of cancer. We use this corpus to train a system that classifies PubMed literature according to the hallmarks. The system uses supervised machine learning and rich features largely based on biomedical text mining. We report good performance in both intrinsic and extrinsic evaluations, demonstrating both the accuracy of the methodology and its potential in supporting practical cancer research. We discuss how this approach could be developed and applied further in the future.   AVAILABILITY AND IMPLEMENTATION The corpus of hallmark-annotated PubMed abstracts and the software for classification are available at: http://www.cl.cam.ac.uk/∼sb895/HoC.html.   CONTACT simon.baker@cl.cam.ac.uk.

Question: What is the hallmarks of cancer?


Controlling tensegrity robots through evolution. Tensegrity structures (built from interconnected rods and cables) have the potential to offer a revolutionary new robotic design that is light-weight, energy-efficient, robust to failures, capable of unique modes of locomotion, impact tolerant, and compliant (reducing damage between the robot and its environment). Unfortunately robots built from tensegrity structures are difficult to control with traditional methods due to their oscillatory nature, nonlinear coupling between components and overall complexity. Fortunately this formidable control challenge can be overcome through the use of evolutionary algorithms. In this paper we show that evolutionary algorithms can be used to efficiently control a ball shaped tensegrity robot. Experimental results performed with a variety of evolutionary algorithms in a detailed soft-body physics simulator show that a centralized evolutionary algorithm performs 400% better than a hand-coded solution, while the multiagent evolution performs 800% better. In addition, evolution is able to discover diverse control solutions (both crawling and rolling) that are robust against structural failures and can be adapted to a wide range of energy and actuation constraints. These successful controls will form the basis for building high-performance tensegrity robots in the near future.

Question: How can evolutionary algorithms be used to control tensegrity robots?


vSlicer: latency-aware virtual machine scheduling via differentiated-frequency CPU slicing. Recent advances in virtualization technologies have made it feasible to host multiple virtual machines (VMs) in the same physical host and even the same CPU core, with fair share of the physical resources among the VMs. However, as more VMs share the same core/CPU, the CPU access latency experienced by each VM increases substantially, which translates into longer I/O processing latency perceived by I/O-bound applications. To mitigate such impact while retaining the benefit of CPU sharing, we introduce a new class of VMs called latency-sensitive VMs (LSVMs), which achieve better performance for I/O-bound applications while maintaining the same resource share (and thus cost) as other CPU-sharing VMs. LSVMs are enabled by vSlicer, a hypervisor-level technique that schedules each LSVM more frequently but with a smaller micro time slice. vSlicer enables more timely processing of I/O events by LSVMs, without violating the CPU share fairness among all sharing VMs. Our evaluation of a vSlicer prototype in Xen shows that vSlicer substantially reduces network packet round-trip times and jitter and improves application-level performance. For example, vSlicer doubles both the connection rate and request processing throughput of an Apache web server; reduces a VoIP server's upstream jitter by 62%; and shortens the execution times of Intel MPI benchmark programs by half or more.

Question: What is the latency-aware virtual machine scheduling via differentiated-frequency CPU slicing?


Phase noise modelling and mitigation techniques in ofdm communications systems. This paper addresses the analysis and mitigation of the signal distortion caused by oscillator phase noise (PN) in OFDM communications systems. Two new PN mitigation techniques are proposed, especially targeted for reducing the intercarrier interference (ICI) effects due to PN. The first proposed method is a fairly simple one, stemming from the idea of linearly interpolating between two consecutive common phase error (CPE) estimates to obtain a linearized estimate of the time-varying phase characteristics. The second technique, in turn, is an extension to the existing state-of-the-art ICI estimation methods. Here the idea is to use an additional interpolation stage to improve the phase estimation performance around the boundaries of two consecutive OFDM symbols. The paper also verifies the performance improvement of these new PN estimation techniques by comparing them to the existing state-of-the-art techniques using extensive computer simulations. To emphasize practicality, the simulations are carried out in 3GPP-LTE downlink -like system context, covering both additive white Gaussian noise (AWGN) and extended ITU-R Vehicular A multipath channel types.

Question: What is the difference between the two proposed PN mitigation techniques?


Interactive Entity Resolution in Relational Data: A Visual Analytic Tool and Its Evaluation. Databases often contain uncertain and imprecise references to real-world entities. Entity resolution, the process of reconciling multiple references to underlying real-world entities, is an important data cleaning process required before accurate visualization or analysis of the data is possible. In many cases, in addition to noisy data describing entities, there is data describing the relationships among the entities. This relational data is important during the entity resolution process; it is useful both for the algorithms which determine likely database references to be resolved and for visual analytic tools which support the entity resolution process. In this paper, we introduce a novel user interface, D-Dupe, for interactive entity resolution in relational data. D-Dupe effectively combines relational entity resolution algorithms with a novel network visualization that enables users to make use of an entity's relational context for making resolution decisions. Since resolution decisions often are interdependent, D-Dupe facilitates understanding this complex process through animations which highlight combined inferences and a history mechanism which allows users to inspect chains of resolution decisions. An empirical study with 12 users confirmed the benefits of the relational context visualization on the performance of entity resolution tasks in relational data in terms of time as well as users' confidence and satisfaction.

Question: What is the largest database in the world?


Extracting Aspect-Evaluation and Aspect-Of Relations in Opinion Mining. The technology of opinion extraction allows users to retrieve and analyze people's opinions scattered over Web documents. We define an opinion unit as a quadruple consisting of the opinion holder, the subject being evaluated, the part or the attribute in which the subject is evaluated, and the value of the evaluation that expresses a positive or negative assessment. We use this definition as the basis for our opinion extraction task. We focus on two important subtasks of opinion extraction: (a) extracting aspect-evaluation relations, and (b) extracting aspect-of relations, and we approach each task using methods which combine contextual and statistical clues. Our experiments on Japanese weblog posts show that the use of contextual clues improve the performance for both tasks.

Question: What is the difference between opinion extraction and opinion mining?


Rigor in Information Systems Positivist Case Research: Current Practices. Case research has commanded respect in the information systems (IS) discipline for at least a decade. Notwithstanding the relevance and potential value of case studies, this methodological approach was once considered to be one of the least systematic. Toward the end of the 1980s, the issue of whether IS case research was rigorously conducted was first raised. Researchers from our field (e.g., Benbasat et al. 1987; Lee 1989) and from other disciplines (e.g., Eisenhardt 1989; Yin 1994) called for more rigor in case research and, through theirrecommendations, contributed to the advancement of the case study methodology. Considering these contributions, the present study seeks to determine the extent to which the field of IS has advanced in its operational use of case study method. Precisely, it investigates the level of methodological rigor in positivist IS case research conducted over the past decade. To fulfill this objective, we identified and coded 183 case articles from seven major IS journals. Evaluation attributes or criteria considered in the present review focus on three main areas, namely, design issues, data collection, and data analysis. While the level of methodological rigor has experienced modest progress with respect to some specific attributes, the overall assessed rigor is somewhat equivocal and there are still significant areas for improvement. One of the keys is to include better documentation particularly regarding issues related to the data collection and

Question: What is the level of methodological rigor in positivist IS case research?


Semantic Space: an infrastructure for smart spaces. Semantic Space is a pervasive computing infrastructure that exploits semantic Web technologies to support explicit representation, expressive querying, and flexible reasoning of contexts in smart spaces.

Question: What is a pervasive computing infrastructure?


NB-IoT and LoRA connectivity analysis for M2M/IoT smart grids applications. The evolution of the new M2M/IoT paradigm suggests new applications in several fields. However, the unique characteristics of M2M communications pose different challenges in terms of connectivity and capacity with respect to the conventional telecommunications networks. In particular, the harmful locations where IoT devices could be deployed and the massive number of the devices to be connected require a different approach with respect the traditional wireless communication. In this paper, we analyzed two different technologies expressly devoted the M2M communication: the Long Term Evolution (LTE) based solution, NB-IoT (Narrow Band — Internet of Things), and the LPWAN (Low Power Wide Area Network) based solution, LoRa (Low Range). The analysis has been provided taking into account different propagation scenarios and geographical information of the real MNOs (Mobile Network Operators) sites operating in the territory under test. The aim of this work is to check wireless access method of both cellular and proprietary technologies for the novel IoT Smart Grid applications requirements.

Question: What is the difference between NB-IoT and LoRa?


Mood Detection : Implementing a facial expression recognition system. Facial expressions play a significant role in human dialogue. As a result, there has been considerable work done on the recognition of emotional expressions and the application of this research will be beneficial in improving human-machine dialogue. One can imagine the improvements to computer interfaces, automated clinical (psychological) research or even interactions between humans and autonomous robots.

Question: How can facial expressions be detected?


A taxonomy of sequential pattern mining algorithms. Owing to important applications such as mining web page traversal sequences, many algorithms have been introduced in the area of sequential pattern mining over the last decade, most of which have also been modified to support concise representations like closed, maximal, incremental or hierarchical sequences. This article presents a taxonomy of sequential pattern-mining techniques in the literature with web usage mining as an application. This article investigates these algorithms by introducing a taxonomy for classifying sequential pattern-mining algorithms based on important key features supported by the techniques. This classification aims at enhancing understanding of sequential pattern-mining problems, current status of provided solutions, and direction of research in this area. This article also attempts to provide a comparative performance analysis of many of the key techniques and discusses theoretical aspects of the categories in the taxonomy.

Question: What is a taxonomy of sequential pattern mining algorithms?


Internet of Things: A Comprehensive Study of Security Issues and Defense Mechanisms. The Internet of Things (IoT) is an evolving global trend in Web-based information architecture aiding in the exchange of services and goods over a network without necessitating human-to-human or human-to-computer interaction. It has the potential to revolutionize physical world interaction of individuals and the organizations. The application of IoT can be recognized significantly in many areas such as in healthcare, resource management, learning, knowledge processing, and many more. The practical realization of IoT is met with a plethora of security and privacy challenges that need to be tackled for IoT's successful deployment on a commercially viable large scale. This paper analyzes the security issues related to IoT networks through an analysis of the existing empirical researches to get an insight on the security requirements of the IoT networks. The findings of the study revealed that security threats are one of the biggest and ever-growing challenges for IoT, and it is essential to substantially mitigate them for the success of this platform.

Question: What is the Internet of Things?


Technology , globalization , and international competitiveness : Challenges for developing countries. This paper traces the role of technology in economic growth and competitiveness, summarizes the strategies of the fastest growing economies over the last 50 years from the perspective of their technology strategy, summarizes some of the key global trends which are making it more difficult for developing countries to replicate the fast growth experience of the countries mentioned, and traces the impact of the rise of China on developing countries. The main argument of this paper is that technology is an increasingly important element of globalisation and of competitiveness and that the acceleration in the rate of technological change and the pre-requisites necessary to participate effectively in globalisation are making it more difficult for many developing countries to compete. Section 2 gives a long-term perspective on technology and economic growth. Section 3 presents a global overview of changes in regional competitiveness as revealed by economic growth. Section 4 identifies some of the high performers in the last 50 years and reviews the strategies of the high performing East Asian economies comprising the well known "gang of four", plus three South East Asian countries. Section 5 reviews the strategies of the BRICM countries, the largest developing country economies (Brazil, Russia, India, China and Mexico). It also argues that it is harder for developing countries to replicate the success of the high performing East Asian countries for two main reasons. One relates to new elements in the global competitive environment. These are summarized in section 6. The other is the rapid rise of China (and to a lesser extent India). This is covered in Section 7, which also includes a preliminary analysis of the effects of the rapid rise of China on the rest of the world. Finally, Section 8 draws some conclusions. Developing countries must develop more technological capabi

Question: What is the role of technology in economic growth and competitiveness?


Compact four-port MIMO antenna system at 3.5 GHz. This work proposed a compact multiple-input multiple-output (MIMO) antenna system having four antennas each fed by coplanar waveguide (CPW) operating for 3.5GHz band (3400–3600) MHz. The proposed MIMO antenna system is realized with two groups of printed Inverted L-monopole of size 5×4 mm2 placed orthogonally to each other to attain the diversity capability of polarization and pattern at the edge of non-ground portion of size 15 × 15 mm2 of mobile handset. The proposed MIMO antenna system consists of four monopole inverted-L shape radiator each with parasitic shorted stripe extending from the ground plane having same dimensions. The parasitic inverted-L shorted striped served as tuning element by reducing the resonating frequency of the monopole radiator and improving the impedance matching. The mutual coupling between the closely packed antennas is addressed by the neutralization line by feeding anti-phase current to the neighbor antenna. The simulation result showed that that the impedance bandwidth at S11 ≤ −10 dB is 200 MHz enough for 5G network communication channel. The diversity parameters of interest are envelop correlation coefficient and mean effective gain are also calculated.

Question: What is the size of the antenna?


Derive: a tool that automatically reverse-engineers instruction encodings. Many binary tools, such as disassemblers, dynamic code generation systems, and executable code rewriters, need to understand how machine instructions are encoded. Unfortunately, specifying such encodings is tedious and error-prone. Users must typically specify thousands of details of instruction layout, such as opcode and field locations values, legal operands, and jump offset encodings. We have built a tool called DERIVE that extracts these details from existing software: the system assembler. Users need only provide the assembly syntax for the instructions for which they want encodings. DERIVE automatically reverse-engineers instruction encoding knowledge from the assembler by feeding it permutations of instructions and doing equation solving on the output. DERIVE is robust and general. It derives instruction encodings for SPARC, MIPS, Alpha, PowerPC, ARM, and x86. In the last case, it handles variable-sized instructions, large instructions, instruction encodings determined by operand size, and other CISC features. DERIVE is also remarkably simple: it is a factor of 6 smaller than equivalent, more traditional systems. Finally, its declarative specifications eliminate the mis-specification errors that plague previous approaches, such as illegal registers used as operands or incorrect field offsets and sizes. This paper discusses our current DERIVE prototype, explains how it computes instruction encodings, and also discusses the more general implications of the ability to extract functionality from installed software.

Question: What is a factor of 6 smaller than equivalent, more traditional systems?


Evaluation of Features Detectors and Descriptors based on 3D Objects. We explore the performance of a number of popular feature detectors and descriptors in matching 3D object features across viewpoints and lighting conditions. To this end we design a method, based on intersecting epipolar constraints, for providing ground truth correspondence automatically. These correspondences are based purely on geometric information, and do not rely on the choice of a specific feature appearance descriptor. We test detector-descriptor combinations on a database of 100 objects viewed from 144 calibrated viewpoints under three different lighting conditions. We find that the combination of Hessian-affine feature finder and SIFT features is most robust to viewpoint change. Harris-affine combined with SIFT and Hessian-affine combined with shape context descriptors were best respectively for lighting change and change in camera focal length. We also find that no detector-descriptor combination performs well with viewpoint changes of more than 25–30∘.

Question: What is the best feature detector and descriptor combination for matching 3D objects?


Slot-Coupled Multisection Quadrature Hybrid for UWB Applications. We present a three-section quadrature hybrid based on slot-coupled directional couplers, which operates over a bandwidth from 3.1 to 10.6 GHz. A prototype has been fabricated which exhibits a return loss better than 20 dB, isolation around 20 dB, an amplitude imbalance between output ports of less than plusmn0.75 dB and a phase imbalance between +1deg and -3deg across the 3.1-10.6 GHz band. This design outperforms previously reported results for ultra wide band operation.

Question: What is a slot-coupled directional coupler?


System for the Measurement of Cathodic Currents in Electrorefining Processes That Employ Multicircuital Technology. This paper presents a measurement system of cathodic currents for copper electrorefining processes using multicircuital technology with optibar intercell bars. The proposed system is based on current estimation using 55 magnetic field sensors per intercell bar. Current values are sampled and stored every 5 min for seven days in a compatible SQL database. The method does not affect the normal operation of the process and does not require any structural modifications. The system for online measurement of 40 cells involving 2090 sensors is in operation in an electrorefinery site.

Question: How many sensors are in the system?


Wearable Electronics and Smart Textiles: A Critical Review. Electronic Textiles (e-textiles) are fabrics that feature electronics and interconnections woven into them, presenting physical flexibility and typical size that cannot be achieved with other existing electronic manufacturing techniques. Components and interconnections are intrinsic to the fabric and thus are less visible and not susceptible of becoming tangled or snagged by surrounding objects. E-textiles can also more easily adapt to fast changes in the computational and sensing requirements of any specific application, this one representing a useful feature for power management and context awareness. The vision behind wearable computing foresees future electronic systems to be an integral part of our everyday outfits. Such electronic devices have to meet special requirements concerning wearability. Wearable systems will be characterized by their ability to automatically recognize the activity and the behavioral status of their own user as well as of the situation around her/him, and to use this information to adjust the systems' configuration and functionality. This review focuses on recent advances in the field of Smart Textiles and pays particular attention to the materials and their manufacturing process. Each technique shows advantages and disadvantages and our aim is to highlight a possible trade-off between flexibility, ergonomics, low power consumption, integration and eventually autonomy.

Question: What is the difference between smart textiles and wearable electronics?


Comparing deep neural networks against humans: object recognition when the signal gets weaker. Human visual object recognition is typically rapid and seemingly effortless, as well as largely independent of viewpoint and object orientation. Until very recently, animate visual systems were the only ones capable of this remarkable computational feat. This has changed with the rise of a class of computer vision algorithms called deep neural networks (DNNs) that achieve human-level classification performance on object recognition tasks. Furthermore, a growing number of studies report similarities in the way DNNs and the human visual system process objects, suggesting that current DNNs may be good models of human visual object recognition. Yet there clearly exist important architectural and processing differences between stateof-the-art DNNs and the primate visual system. The potential behavioural consequences of these differences are not well understood. We aim to address this issue by comparing human and DNN generalisation abilities towards image degradations. We find the human visual system to be more robust to image manipulations like contrast reduction, additive noise or novel eidolon-distortions. In addition, we find progressively diverging classification error-patterns between man and DNNs when the signal gets weaker, indicating that there may still be marked differences in the way humans and current DNNs perform visual object recognition. We envision that our findings as well as our carefully measured and freely available behavioural datasets1 provide a new useful benchmark for the computer vision community to improve the robustness of DNNs and a motivation for neuroscientists to search for mechanisms in the brain that could facilitate this robustness. Data and materials available at https://github.com/rgeirhos/object-recognition 1 ar X iv :1 70 6. 06 96 9v 1 [ cs .C V ] 2 1 Ju n 20 17

Question: What is the difference between humans and deep neural networks?


A Survey of the Functional Splits Proposed for 5 G Mobile Crosshaul Networks Line. Pacing the way towards 5G has lead researchers and industry in the direction of centralized processing known from Cloud-Radio Access Networks (C-RAN). In C-RAN research, a variety of different functional splits is presented by different names and focusing on different directions. The functional split determines how many Base Station (BS) functions to leave locally, close to the user, with the benefit of relaxing fronthaul network bitrate and delay requirements, and how many functions to centralize with the possibility of achieving greater processing benefits. This work presents for the first time a comprehensive overview systematizing the different work directions for both research and industry, while providing a detailed description of each functional split option and an assessment of the advantages and disadvantages. This work gives an overview of where the most effort has been directed in terms of functional splits, and where there is room for further studies. The standardization currently taking place is also considered and mapped into the research directions. It is investigated how the fronthaul network will be affected by the choice of functional split, both in terms of bitrates and latency, and as the different functional splits provide different advantages and disadvantages, the option of flexible functional splits is also looked into. Keywords—Functional Split; Crosshaul; X-haul; C-RAN; Fronthaul; standardization; industry; network architecture; Please refer to the list of acronyms provided in the end of the paper, right before the references.

Question: What is the difference between a crosshaul and an X-haul?


Control of the power in induction heating systems with L-LC resonant voltage source inverters. This paper is a synthesis of the control circuit in an induction heating system with three-phase fully-controlled rectifier, single-phase voltage source inverter and L-LC resonant load. The attention is mainly directed on the control of the power transmitted to the induction coil. It is highlighted that the analytical design of a proportional integral derivative or proportional integral controller is practically impossible when the direct control of the current through inductor is desired. The two possibilities of power control taken into consideration are the inverter output current control and the inverter input voltage control. The design of the current and voltage controllers of proportional integral derivative type was carried out successfully based on Modulus Optimum criterion in Kessler variant. The performances of the control system in both variants of the power control were tested and validated by simulation under the Matlab-Simulink environment by using real parameters of induction coils and heated pipes from a leading Romanian manufacturer.

Question: How to control the power in induction heating systems with L-LC resonant voltage source inverters?