Flat-Region Detection and False Contour Removal in the Digital TV Display. Bit-depth reduction in digital displays results in false contours in the image. Moreover some of video enhancement processing in the digital TV display, such as histogram equalization, contrast enhancement, and increasing sharpness, etc., make false contours more visible. Bit-depth reduction comes from various display limitations such as video memory constraints, physical characteristics of the display, display drivers, and coarse MPEG quantization, etc. Daly, SJ et al., (2004). We present an efficient method for detecting and segmenting flat-region in the image, and a technique for bit-depth extension to effectively remove false contours. We have simulated bit-depth reduction followed by video enhancement processing that cause false contours with various video image sequences including simple patterns. Our result shows that false contours are effectively removed in the flat-region in the image while the sharpness of object edges is preserved

Question: How to detect flat-region in the image?


Path selection based on local terrain feature for unmanned ground vehicle in unknown rough terrain environment. In this paper, we propose an autonomous navigation for Unmanned Ground Vehicles (UGVs) by a path selection method based on local features of terrain in unknown outdoor rough terrain environment. The correlation between a local terrain feature obtained from a path and a value of the path obtained from the global path planning is extracted in advance. When UGV comes to a branch while it is running, the value of path is estimated using the correlation with local terrain feature. Thereby, UGV navigation is performed by path selection under the criterion of shortest time in unknown outdoor environment. We experimented on a simulator and confirmed that the proposed method can select more effective paths in comparison with a simple path selection method.

Question: How to select a path for an unmanned ground vehicle in an unknown outdoor environment?


Constraints in the IoT: The World in 2020 and Beyond. The Internet of Things (IoT), often referred as the future Internet; is a collection of interconnected devices integrated into the world-wide network that covers almost everything and could be available anywhere. IoT is an emerging technology and aims to play an important role in saving money, conserving energy, eliminating gap and better monitoring for intensive management on a routine basis. On the other hand, it is also facing certain design constraints such as technical challenges, social challenges, compromising privacy and performance tradeoffs. This paper surveys major technical limitations that are hindering the successful deployment of the IoT such as standardization, interoperability, networking issues, addressing and sensing issues, power and storage restrictions, privacy and security, etc. This paper categorizes the existing research on the technical constraints that have been published in the recent years. With this categorization, we aim to provide an easy and concise view of the technical aspects of the IoT. Furthermore, we forecast the changes influenced by the IoT. This paper predicts the future and provides an estimation of the world in year 2020 and beyond. Keywords—Internet of Things; Future Internet; Next generation network issues; World-wide network; 2020

Question: What are the technical challenges of the IoT?


On the use of windows for harmonic analysis with the discrete Fourier transform. This paper makes available a concise review of data windows and their affect on the detection of harmonic signals in the presence of broad-band noise, and in the presence of nearby strong harmonic interference. We also call attention to a number of common errors in the application of windows when used with the fast Fourier transform. This paper includes a comprehensive catalog of data windows along with their significant performance parameters from which the different windows can be compared. Finally, an example demonstrates the use and value of windows to resolve closely spaced harmonic signals characterized by large differences in amplitude.

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


Animating fluid sediment mixture in particle-laden flows. In this paper, we present a mixed explicit and semi-implicit Material Point Method for simulating particle-laden flows. We develop a Multigrid Preconditioned fluid solver for the Locally Averaged Navier Stokes equation. This is discretized purely on a semi-staggered standard MPM grid. Sedimentation is modeled with the Drucker-Prager elastoplasticity flow rule, enhanced by a novel particle density estimation method for converting particles between representations of either continuum or discrete points. Fluid and sediment are two-way coupled through a momentum exchange force that can be easily resolved with two MPM background grids. We present various results to demonstrate the efficacy of our method.

Question: How to animate fluid sediment mixture in particle-laden flows?


Person Re-Identification by Iterative Re-Weighted Sparse Ranking. In this paper we introduce a method for person re-identification based on discriminative, sparse basis expansions of targets in terms of a labeled gallery of known individuals. We propose an iterative extension to sparse discriminative classifiers capable of ranking many candidate targets. The approach makes use of soft- and hard- re-weighting to redistribute energy among the most relevant contributing elements and to ensure that the best candidates are ranked at each iteration. Our approach also leverages a novel visual descriptor which we show to be discriminative while remaining robust to pose and illumination variations. An extensive comparative evaluation is given demonstrating that our approach achieves state-of-the-art performance on single- and multi-shot person re-identification scenarios on the VIPeR, i-LIDS, ETHZ, and CAVIAR4REID datasets. The combination of our descriptor and iterative sparse basis expansion improves state-of-the-art rank-1 performance by six percentage points on VIPeR and by 20 on CAVIAR4REID compared to other methods with a single gallery image per person. With multiple gallery and probe images per person our approach improves by 17 percentage points the state-of-the-art on i-LIDS and by 72 on CAVIAR4REID at rank-1. The approach is also quite efficient, capable of single-shot person re-identification over galleries containing hundreds of individuals at about 30 re-identifications per second.

Question: How does the canadian military rank?


0 BLIS : A Framework for Rapid Instantiation of BLAS Functionality. The BLAS Libray Instantiation Software (BLIS) is a new framework for the rapid instantiation of Basic Linear Algebra Subprograms (BLAS) functionality. The fundamental innovation is the insight that virtually all computation within level-2 (matrix-vector) and level-3 (matrix-matrix) BLAS operations can be expressed in terms of very simple kernels. While others had made similar insights, BLIS brings this set down to what we believe is the simplest set that still supports the high performance that the computational science community demands. Higher-level framework code is generalized and implemented in standard C so that it can be reused and/or re-parameterized for different operations (as well as different architectures) with little to no modification. Inserting high-performance kernels into the framework facilitates the immediate optimization of any and all BLAS-like operations which are cast in terms of these kernels, and thus the framework acts as a productivity multiplier. Users of BLAS-dependent applications are given a choice of using the BLIS native interface (which is a C interface that corrects a few known idiosyncracies of the BLAS interface), the traditional Fortran BLAS interface, or through any other higher level interface that chooses to build upon the BLIS interface. Preliminary experimental performance of level-2 and level-3 operations is observed to be competitive with two mature open source libraries (OpenBLAS and ATLAS) as well as an established commercial product (Intel MKL).

Question: What is the BLIS framework?


Multilinear Discriminant Analysis for Higher-Order Tensor Data Classification. In the past decade, great efforts have been made to extend linear discriminant analysis for higher-order data classification, generally referred to as multilinear discriminant analysis (MDA). Existing examples include general tensor discriminant analysis (GTDA) and discriminant analysis with tensor representation (DATER). Both the two methods attempt to resolve the problem of tensor mode dependency by iterative approximation. GTDA is known to be the first MDA method that converges over iterations. However, its performance relies highly on the tuning of the parameter in the scatter difference criterion. Although DATER usually results in better classification performance, it does not converge, yet the number of iterations executed has a direct impact on DATER's performance. In this paper, we propose a closed-form solution to the scatter difference objective in GTDA, namely, direct GTDA (DGTDA) which also gets rid of parameter tuning. We demonstrate that DGTDA outperforms GTDA in terms of both efficiency and accuracy. In addition, we propose constrained multilinear discriminant analysis (CMDA) that learns the optimal tensor subspace by iteratively maximizing the scatter ratio criterion. We prove both theoretically and experimentally that the value of the scatter ratio criterion in CMDA approaches its extreme value, if it exists, with bounded error, leading to superior and more stable performance in comparison to DATER.

Question: What is the difference between GTDA and DATER?


The curvelet transform for fusion of very-high resolution multi-spectral and panchromatic images. This paper presents a novel image fusion method, suitable for pan-sharpening of multispectral (MS) bands, based on multi-resolution analysis (MRA). The low-resolution MS bands are sharpened by injecting high-pass directional details extracted from the high-resolution panchromatic (Pan) image by means of the curvelet transform, which is a non-separable MRA, whose basis function are directional edges with progressively increasing resolution. The advantage with respect to conventional separable MRA, either decimated or not, is twofold: directional detail coefficients matching image edges may be preliminarily soft-thresholded to achieve denoising better than in the separable wavelet domain; modeling of the relationships between high-resolution detail coefficients of MS bands and of the Pan image is more fitting, being carried out in a directional wavelet domain. Experiments carried out on a very-high resolution MS + Pan QuickBird image show that the proposed curvelet method quantitatively outperforms state-of-the art image fusion methods, in terms of geometric, radiometric, and spectral fidelity.

Question: What is the curvelet transform?


Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. D New algorithms for deciding whether a (propositional) Horn formula is satisfiable are presented. If the Horn formula A contains K distinct propositional letters and if it is assumed that they are exactly Pi,. . . , PK, the two algorithms presented in this paper run in time O(N), where N is the total number of occurrences of literals in A. By representing a Horn proposition as a graph, the satisfiability problem can be formulated as a data flow problem, a certain type of pebbling. The difference between the two algorithms presented here is the strategy used for pebbling the graph. The first algorithm is based on the principle used for finding the set of nonterminals of a context-free grammar from which the empty string can be derived. The second algorithm is a graph traversal and uses a "call-by-need" strategy. This algorithm uses an attribute grammar to translate a propositional Horn formula to its corresponding graph in linear time. Our formulation of the satisfiability problem as a data flow problem appears to be new and suggests the possibility of improving efficiency using parallel processors. a

Question: What is the difference between the two algorithms?


The Six Pillars for Building Big Data Analytics Ecosystems. With almost everything now online, organizations look at the Big Data collected to gain insights for improving their services. In the analytics process, derivation of such insights requires experimenting-with and integrating different analytics techniques, while handling the Big Data high arrival velocity and large volumes. Existing solutions cover bits-and-pieces of the analytics process, leaving it to organizations to assemble their own ecosystem or buy an off-the-shelf ecosystem that can have unnecessary components to them. We build on this point by dividing the Big Data Analytics problem into six main pillars. We characterize and show examples of solutions designed for each of these pillars. We then integrate these six pillars into a taxonomy to provide an overview of the possible state-of-the-art analytics ecosystems. In the process, we highlight a number of ecosystems to meet organizations different needs. Finally, we identify possible areas of research for building future Big Data Analytics Ecosystems.

Question: What is the six pillars for building big data analytics ecosystems?


Face detection using SURF cascade. We present a novel boosting cascade based face detection framework using SURF features. The framework is derived from the well-known Viola-Jones (VJ) framework but distinguished by two key contributions. First, the proposed framework deals with only several hundreds of multidimensional local SURF patches instead of hundreds of thousands of single dimensional haar features in the VJ framework. Second, it takes AUC as a single criterion for the convergence test of each cascade stage rather than the two conflicting criteria (false-positive-rate and detection-rate) in the VJ framework. These modifications yield much faster training convergence and much fewer stages in the final cascade. We made experiments on training face detector from large scale database. Results shows that the proposed method is able to train face detectors within one hour through scanning billions of negative samples on current personal computers. Furthermore, the built detector is comparable to the state-of-the-art algorithm not only on the accuracy but also on the processing speed.

Question: How to train a face detector?


An improved fuzzy clustering method using modified Fukuyama-Sugeno cluster validity index. The objective of clustering algorithms is to group similar patterns in one class and dissimilar patterns in disjoint classes. This article proposes a novel algorithm for fuzzy partitional clustering with an aim to minimize a composite objective function, defined using the Fukuyama-Sugeno cluster validity index. The optimization of this objective function tries to minimize the separation between clusters of a data set and maximize the compactness of a certain cluster. But in certain cases, such as a data set having overlapping clusters, this approach leads to poor clustering results. Thus we introduce a new parameter in the objective function which enables us to yield more accurate clustering results. The algorithm has been validated with some artificial and real world datasets.

Question: What is a fuzzy clustering algorithm?


Supply chain information systems strategy : Impacts on supply chain performance and firm performance. This paper examines the relationship between supply chain (SC) strategy and supply chain information systems (IS) strategy, and its impact on supply chain performance and firm performance. Theorizing from the supply chain and IS literatures within an overarching framework of the information processing theory (IPT), we develop hypotheses proposing a positive moderating effect of two supply chain IS strategies – IS for Efficiency and IS for Flexibility – on the respective relationships between two SC strategies – Lean and Agile, and supply chain performance. Based on confirmatory analysis and structural equation modeling of survey data from members of senior and executive management in the purchase/materials management/logistics/supply chain functions, from 205 firms, we validate these hypotheses and show that the IS for Efficiency (IS for Flexibility) IS strategy enhances the relationship between Lean (Agile) SC strategy and supply chain performance. We also show a positive association between supply chain performance and firm performance, and a full (partial) mediation effect of supply chain performance on the relation between Agile (Lean) SC strategy and firm performance. The paper contributes to the supply chain literature by providing theoretical understanding and empirical support of how SC strategies and IS strategies can work together to boost supply chain performance. In doing so, it identifies particular types of supply chain IS application portfolios that can enhance the benefits from specific SC strategies. The paper also develops and validates instruments for measuring two types of SC strategies and supply chain IS strategies. For practice, the paper offers guidance in making investment decisions for adopting and deploying IS appropriate to particular SC strategies and analyzing possible lack of alignment between applications that the firm deploys in its

Question: What is the relationship between supply chain strategy and supply chain information systems strategy?


The Cathedral and the Bazaar. Permission is granted to copy, distribute and/or modify this document under the terms of the Open Publication License, version 2.0. $Date: 2002/08/02 09:02:14 $ Revision History Revision 1.57 11 September 2000 esr New major section "How Many Eyeballs Tame Complexity". Revision 1.52 28 August 2000 esr MATLAB is a reinforcing parallel to Emacs. Corbatoó & Vyssotsky got it in 1965. Revision 1.51 24 August 2000 esr First DocBook version. Minor updates to Fall 2000 on the time-sensitive material. Revision 1.49 5 May 2000 esr Added the HBS note on deadlines and scheduling. Revision 1.51 31 August 1999 esr This the version that O'Reilly printed in the first edition of the book. Revision 1.45 8 August 1999 esr Added the endnotes on the Snafu Principle, (pre)historical examples of bazaar development, and originality in the bazaar. Revision 1.44 29 July 1999 esr Added the "On Management and the Maginot Line" section, some insights about the usefulness of bazaars for exploring design space, and substantially improved the Epilog. Revision 1.40 20 Nov 1998 esr Added a correction of Brooks based on the Halloween Documents. Revision 1.39 28 July 1998 esr I removed Paul Eggert's 'graph on GPL vs. bazaar in response to cogent aguments from RMS on Revision 1.31 February 1

Question: What is the difference between the GPL and the bazaar?


A FRAMEWORK FOR DETERMINING CRITICAL SUCCESS FACTORS INFLUENCING CONSTRUCTION BUSINESS PERFORMANCE. Recent reports by Latham (1994) and Egan (1998) have emphasized the need for the construction industry to increase its competitiveness, and have suggested the use of performance measurement as a tool for continuous improvement. Comprehensive measurement of a company's performance and subsequent feedback to its managers is vital for business transformation. Measurement also enables businesses to be compared with each other on the basis of standardized information, allowing best practices to be identified and applied more widely. Historically, business performance has been determined principally through the use of financial performance criteria, but recently, it has been established that performance measurement needs to go beyond this. This paper reviews the various financial and non-financial factors that influence construction business. A methodology for defining the critical success factors relevant to construction businesses is further outlined. The critical success factors associated with construction business are also reviewed. Finally, it is concluded that more important than presenting a list of critical success factors (which are bound to change) is the need to have a holistic framework for identifying and implementing the required success factors.

Question: What is the difference between a framework and a methodology?


Adaptive block truncation filter for MVC depth image enhancement. In Multiview Video plus Depth (MVD) format, virtual views are generated from decoded texture videos with decoded depth images through Depth Image based Rendering (DIBR). 3DV-ATM is a reference model for H.264/AVC based Multiview Video Coding (MVC) and aims at achieving high coding efficiency for 3D video in MVD format. Depth images are first downsampled then coded by 3DV-ATM. However, sharp object boundary characteristic of depth images does not well match with the transform coding of 3DV-ATM. Depth boundaries are often blurred with ringing artifacts in the decoded depth images that result in noticeable artifacts in synthesized views. This paper presents a low complexity adaptive block truncation filter to recover the sharp object boundaries of depth images using adaptive block repositioning and expansion for increasing the depth values refinement accuracy. This new approach is very efficient and can avoid false depth boundary refinement when block boundaries lie around the depth edge regions and ensure sufficient information within the processing block for depth layers classification. Experimental results show that sharp depth edges can be recovered using the proposed filter and boundary artifacts in the synthesized views can be removed. The proposed method can provide improvement up to 3.25dB in the depth map enhancement and bitrate reduction of 3.06% in the synthesized views.

Question: What is the adaptive block truncation filter?


AmphiBot I: an amphibious snake-like robot. This article presents a project that aims at constructing a biologically inspired amphibious snake-like robot. The robot is designed to be capable of anguilliform swimming like sea-snakes and lampreys in water and lateral undulatory locomotion like a snake on ground. Both the structure and the controller of the robot are inspired by elongate vertebrates. In particular, the locomotion of the robot is controlled by a central pattern generator (a system of coupled oscillators) that produces travelling waves of oscillations as limit cycle behavior. We present the design considerations behind the robot and its controller. Experiments are carried out to identify the types of travelling waves that optimize speed during lateral undulatory locomotion on ground. In particular, the optimal frequency, amplitude and wavelength are thus identified when the robot is crawling on a particular surface.

Question: What is a biologically inspired amphibious snake-like robot?


A Novel Connectionist System for Unconstrained Handwriting Recognition. Recognizing lines of unconstrained handwritten text is a challenging task. The difficulty of segmenting cursive or overlapping characters, combined with the need to exploit surrounding context, has led to low recognition rates for even the best current recognizers. Most recent progress in the field has been made either through improved preprocessing or through advances in language modeling. Relatively little work has been done on the basic recognition algorithms. Indeed, most systems rely on the same hidden Markov models that have been used for decades in speech and handwriting recognition, despite their well-known shortcomings. This paper proposes an alternative approach based on a novel type of recurrent neural network, specifically designed for sequence labeling tasks where the data is hard to segment and contains long-range bidirectional interdependencies. In experiments on two large unconstrained handwriting databases, our approach achieves word recognition accuracies of 79.7 percent on online data and 74.1 percent on offline data, significantly outperforming a state-of-the-art HMM-based system. In addition, we demonstrate the network's robustness to lexicon size, measure the individual influence of its hidden layers, and analyze its use of context. Last, we provide an in-depth discussion of the differences between the network and HMMs, suggesting reasons for the network's superior performance.

Question: What is a novel type of recurrent neural network?


Multiview Stereo via Volumetric Graph-Cuts and Occlusion Robust Photo-Consistency. This paper presents a volumetric formulation for the multiview stereo problem which is amenable to a computationally tractable global optimization using Graph-cuts. Our approach is to seek the optimal partitioning of 3D space into two regions labeled as "object" and "empty" under a cost functional consisting of the following two terms: 1) A term that forces the boundary between the two regions to pass through photo-consistent locations; and 2) a ballooning term that inflates the "object" region. To take account of the effect of occlusion on the first term, we use an occlusion robust photo-consistency metric based on normalized cross correlation, which does not assume any geometric knowledge about the reconstructed object. The globally optimal 3D partitioning can be obtained as the minimum cut solution of a weighted graph.

Question: How to solve the multiview stereo problem?


Generating Focused Molecule Libraries for Drug Discovery with Recurrent Neural Networks. In de novo drug design, computational strategies are used to generate novel molecules with good affinity to the desired biological target. In this work, we show that recurrent neural networks can be trained as generative models for molecular structures, similar to statistical language models in natural language processing. We demonstrate that the properties of the generated molecules correlate very well with the properties of the molecules used to train the model. In order to enrich libraries with molecules active toward a given biological target, we propose to fine-tune the model with small sets of molecules, which are known to be active against that target. Against Staphylococcus aureus, the model reproduced 14% of 6051 hold-out test molecules that medicinal chemists designed, whereas against Plasmodium falciparum (Malaria), it reproduced 28% of 1240 test molecules. When coupled with a scoring function, our model can perform the complete de novo drug design cycle to generate large sets of novel molecules for drug discovery.

Question: How can recurrent neural networks be used to generate molecules?


A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms. Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little work has been done on characterizing their performance. In this paper, we present a taxonomy of dense, two-frame stereo methods. Our taxonomy is designed to assess the different components and design decisions made in individual stereo algorithms. Using this taxonomy, we compare existing stereo methods and present experiments evaluating the performance of many different variants. In order to establish a common software platform and a collection of data sets for easy evaluation, we have designed a stand-alone, flexible C++ implementation that enables the evaluation of individual components and that can easily be extended to include new algorithms. We have also produced several new multi-frame stereo data sets with ground truth and are making both the code and data sets available on the Web. Finally, we include a comparative evaluation of a large set of today's best-performing stereo algorithms.

Question: What is a taxonomy of dense, two-frame stereo algorithms?


Normalized cuts in 3-D for spinal MRI segmentation. Segmentation of medical images has become an indispensable process to perform quantitative analysis of images of human organs and their functions. Normalized Cuts (NCut) is a spectral graph theoretic method that readily admits combinations of different features for image segmentation. The computational demand imposed by NCut has been successfully alleviated with the Nystro/spl uml/m approximation method for applications different than medical imaging. In this paper we discuss the application of NCut with the Nystro/spl uml/m approximation method to segment vertebral bodies from sagittal T1-weighted magnetic resonance images of the spine. The magnetic resonance images were preprocessed by the anisotropic diffusion algorithm, and three-dimensional local histograms of brightness was chosen as the segmentation feature. Results of the segmentation as well as limitations and challenges in this area are presented.

Question: What is the Nystro/spl uml/m approximation method?


Chapter 3 Semantic Web Service Description. The convergence of semantic Web with service oriented computing is manifested by Semantic Web Services (SWS) technology. It addresses the major challenge of automated, interoperable and meaningful coordination of Web Services to be carried out by intelligent software agents. In this chapter, we briefly discuss prominent SWS description frameworks, that are the standard SAWSDL, OWL-S and WSML. This is complemented by main critics of Semantic Web Services, and selected references to further readings on the subject.

Question: What is the convergence of semantic web and service oriented computing?


Thermal degradation of DRAM retention time: Characterization and improving techniques. Variation of DRAM retention time and reliability problem induced by thermal stress was investigated. Most of the DRAM cells revealed 2-state retention time with thermal stress. The effects of hydrogen annealing condition and fluorine implantation on the variation of retention time and reliability are discussed.

Question: What is the retention time of DRAM?


Basset: learning the regulatory code of the accessible genome with deep convolutional neural networks.. The complex language of eukaryotic gene expression remains incompletely understood. Despite the importance suggested by many noncoding variants statistically associated with human disease, nearly all such variants have unknown mechanisms. Here, we address this challenge using an approach based on a recent machine learning advance-deep convolutional neural networks (CNNs). We introduce the open source package Basset to apply CNNs to learn the functional activity of DNA sequences from genomics data. We trained Basset on a compendium of accessible genomic sites mapped in 164 cell types by DNase-seq, and demonstrate greater predictive accuracy than previous methods. Basset predictions for the change in accessibility between variant alleles were far greater for Genome-wide association study (GWAS) SNPs that are likely to be causal relative to nearby SNPs in linkage disequilibrium with them. With Basset, a researcher can perform a single sequencing assay in their cell type of interest and simultaneously learn that cell's chromatin accessibility code and annotate every mutation in the genome with its influence on present accessibility and latent potential for accessibility. Thus, Basset offers a powerful computational approach to annotate and interpret the noncoding genome.

Question: What is the difference between deep convolutional neural networks and other machine learning methods?


CATS: Collection and Analysis of Tweets Made Simple. Twitter presents an unparalleled opportunity for researchers from various fields to gather valuable and genuine textual data from millions of people. However, the collection pro-cess, as well as the analysis of these data require different kinds of skills (e.g. programing, data mining) which can be an obstacle for people who do not have this background. In this paper we present CATS, an open source, scalable, Web application designed to support researchers who want to carry out studies based on tweets. The purpose of CATS is twofold: (i) allow people to collect tweets (ii) enable them to analyze these tweets thanks to efficient tools (e.g. event detection, named-entity recognition, topic modeling, word-clouds). What is more, CATS relies on a distributed imple-mentation which can deal with massive data streams.

Question: What is the purpose of CATS?


Internal Uniplanar Antenna for LTE/GSM/UMTS Operation in a Tablet Computer. With the use of an internal printed loop matching circuit, a small-size uniplanar antenna with eight-band LTE/GSM/UMTS operation in the tablet computer is proposed. The obtained impedance bandwidth across the operating bands can reach about 262/1610 MHz for the LTE/GSM/UMTS bands, respectively. Only with the antenna size of $40\times 15\times 0.8\ {\rm mm}^{3}$, the proposed planar antenna has the compact operation with more than 30% antenna size reduction. Furthermore, the measured peak gains and antenna efficiencies are about 2.81/4.97 dBi and 79/87% for the LTE/GSM/UMTS bands, respectively.

Question: What is the size of the internal printed loop matching circuit?


Revisiting Complex Moments for 2-D Shape Representation and Image Normalization. When comparing 2-D shapes, a key issue is their normalization. Translation and scale are easily taken care of by removing the mean and normalizing the energy. However, defining and computing the orientation of a 2-D shape is not so simple. In fact, although for elongated shapes the principal axis can be used to define one of two possible orientations, there is no such tool for general shapes. As we show in the paper, previous approaches fail to compute the orientation of even noiseless observations of simple shapes. We address this problem and show how to uniquely define the orientation of an arbitrary 2-D shape, in terms of what we call its Principal Moments. We start by showing that a small subset of these moments suffices to describe the underlying 2-D shape, i.e., that they form a compact representation, which is particularly relevant when dealing with large databases. Then, we propose a new method to efficiently compute the shape orientation: Principal Moment Analysis. Finally, we discuss how this method can further be applied to normalize gray-level images. Besides the theoretical proof of correctness, we describe experiments demonstrating robustness to noise and illustrating with real images.

Question: How to normalize 2-D shapes?


Review and performance comparison of VANET protocols: AODV, DSR, OLSR, DYMO, DSDV & ZRP. In this paper a fast review and comparative study of the adhoc routing protocols used in VANET will be presented. The research filed in Vehicular adhoc network (VANET) is developing very fast. An extensive variety of utilizations has been served under various situation (Highway, urban, and Cities). Many protocols have been adopted to serve different topology and scenarios, these protocols faced various challenges. VANETs provide communication between vehicles moving on the roads. The routing protocols in VANET are affected by the vehicle high speed which leads to frequently link breaks between the communicated vehicles, so the adhoc routing protocols are adapted with the VANET characteristics to deliver the data between vehicles in short time. The main goal of VANET is to assemble a data system among vehicles that are moving on the roads, which enables the vehicles to communicate with each other for the safety manners. In this paper, an endeavor has been made to compare six surely understood protocols AODV, DSR, OLSR, DSDV, ZRP and DSDV. Used in VANET from the (packet deliver ratio, end to end delay, throughput, routing algorithm load, received packets, routing packets, dropped packets, ratio of packet loss, Average Jitter) point of view.

Question: What is the difference between AODV, DSR, OLSR, DSDV, ZRP and DSDV?


A review: Information extraction techniques from research papers. Text extraction is a crucial stage of analyzing Journal papers. Journal papers generally are in PDF format which is semi structured data. Journal papers are presented into different sections like Introduction, Methodology, Experimental setup, Result and analysis etc. so that it is easy to access information from any section as per the reader's interest. The main importance on section extraction is to find a representative subset of the data, which contains the information of the entire set. Various approaches to extract sections from research papers include stastical methods, NLP, Machine Learning etc. In this paper we present review of various extraction techniques from a PDF document.

Question: What is a PDF document?


An Implementation of Intrusion Detection System Using Genetic Algorithm. Nowadays it is very important to maintain a high level security to ensure safe and trusted communication of information between various organizations. But secured data communication over internet and any other network is always under threat of intrusions and misuses. So Intrusion Detection Systems have become a needful component in terms of computer and network security. There are various approaches being utilized in intrusion detections, but unfortunately any of the systems so far is not completely flawless. So, the quest of betterment continues. In this progression, here we present an Intrusion Detection System (IDS), by applying genetic algorithm (GA) to efficiently detect various types of network intrusions. Parameters and evolution processes for GA are discussed in details and implemented. This approach uses evolution theory to information evolution in order to filter the traffic data and thus reduce the complexity. To implement and measure the performance of our system we used the KDD99 benchmark dataset and obtained reasonable detection rate.

Question: What is the implementation of genetic algorithm?


Lightweight IPS for port scan in OpenFlow SDN networks. Security has been one of the major concerns for the computer network community due to resource abuse and malicious flows intrusion. Before a network or a system is attacked, a port scan is typically performed to discover vulnerabilities, like open ports, which may be used to access and control them. Several studies have addressed Intrusion Detection Systems (IDS) and Intrusion Prevention Systems (IPS) methods for detecting malicious activities, based on received flows or packet data analysis. However, those methods lead to an increase in switching latency, due to the need to analyze flows or packets before routing them. This may also increase network overhead when flows or packets are duplicated to be parsed by an external IDS. On the one hand, an IDS/IPS may be a bottleneck on the network and may not be useful. On the other hand, the new paradigm called Software Defined Networking (SDN) and the OpenFlow protocol provide some statistical information about the network that may be used for detecting malicious activities. Hence, this work presents a new port scan IPS for SDN based on the OpenFlow switch counters data. A non-intrusive and lightweight method was developed and implemented, with low network overhead, and low memory and processing power consumption. The results showed that our method is effective on detecting and preventing port scan attacks.

Question: What is the difference between an IDS and an IPS?


Computer- vs. paper-based tasks: are they equivalent?. In 1992, Dillon published his critical review of the empirical literature on reading from paper vs. screen. However, the debate concerning the equivalence of computer- and paper-based tasks continues, especially with the growing interest in online assessment. The current paper reviews the literature over the last 15 years and contrasts the results of these more recent studies with Dillon's findings. It is concluded that total equivalence is not possible to achieve, although developments in computer technology, more sophisticated comparative measures and more positive user attitudes have resulted in a continuing move towards achieving this goal. Many paper-based tasks used for assessment or evaluation have been transferred directly onto computers with little regard for any implications. This paper considers equivalence issues between the media by reviewing performance measures. While equivalence seems impossible, the importance of any differences appears specific to the task and required outcomes.

Question: Are computer-based tasks equivalent to paper-based tasks?


The FrameNet Database and Software Tools. The FrameNet Project is producing a lexicon of English for both human use and NLP applications, based on the principles of Frame Semantics, in which sentences are described on the basis of predicators which evoke semantic frames and other constituents which express the participants (frame elements) in these frames. Our lexicon contains detailed information about the possible syntactic realizations of frame elements, derived from annotated corpus examples. In the process, we have developed a suite of tools for the definition of semantic frames, for annotating sentences, for searching the results, and for creating a variety ofreports. We will discuss the conceptual basis ofour work and demonstrate the tools we work with, the results we produce, and how they may be ofuse to other NLP projects.

Question: What is the frameNet database?


Fastest Mixing Markov Chain on a Graph. We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between the two adjacent vertices. The associated Markov chain has a uniform equilibrium distribution; the rate of convergence to this distribution, i.e., the mixing rate of the Markov chain, is determined by the second largest (in magnitude) eigenvalue of the transition matrix. In this paper we address the problem of assigning probabilities to the edges of the graph in such a way as to minimize the second largest magnitude eigenvalue, i.e., the problem of finding the fastest mixing Markov chain on the graph. We show that this problem can be formulated as a convex optimization problem, which can in turn be expressed as a semidefinite program (SDP). This allows us to easily compute the (globally) fastest mixing Markov chain for any graph with a modest number of edges (say, 1000) using standard numerical methods for SDPs. Larger problems can be solved by exploiting various types of symmetry and structure in the problem, and far larger problems (say 100000 edges) can be solved using a subgradient method we describe. We compare the fastest mixing Markov chain to those obtained using two commonly used heuristics: the maximum-degree method, and the Metropolis-Hastings algorithm. For many of the examples considered, the fastest mixing Markov chain is substantially faster than those obtained using these heuristic methods. We derive the Lagrange dual of the fastest mixing Markov chain problem, which gives a sophisticated method for obtaining (arbitrarily good) bounds on the optimal mixing rate, as well the optimality conditions. Finally, we describe various extensions of the method, including a solution of the problem of finding the fastest mixing reversible Markov chain, on a fixed graph, with a given equilibrium distribution.

Question: What is the fastest mixing Markov chain on a graph?


Scalable and Secure Logistic Regression via Homomorphic Encryption. Logistic regression is a powerful machine learning tool to classify data. When dealing with sensitive data such as private or medical information, cares are necessary. In this paper, we propose a secure system for protecting the training data in logistic regression via homomorphic encryption. Perhaps surprisingly, despite the non-polynomial tasks of training in logistic regression, we show that only additively homomorphic encryption is needed to build our system. Our system is secure and scalable with the dataset size.

Question: What is a logistic regression?


Correctness By Construction: Better Can Also Be Cheaper. I n December 1999 CrossTalk [3], David Cook provided a well-reasoned historical analysis of programming language development and considered the role languages play in the software development process. The article was valuable because it showed that programming language developments are not sufficient to ensure success; however, it would be dangerous to conclude from this that they are not necessary for success. Cook rightly identifies other issues such as requirements capture, specifications, and verification and validation (V&V) that need to be addressed. Perhaps we need to look at programming languages not just in terms of their ability to code some particular design but in the influence the language has on some of these other vital aspects of the development process. The key notion is that of the benefit of a precise language or language subset. If the term subset has set anyone thinking " oh no, not another coding standard, " then read on, the topic is much more interesting and useful than that! Language Issues Programming languages have evolved in three main ways. First came improvements in structure; then attempts at improving compile-time error detection through such things as strong typing; and, most significantly , facilities to improve our ability to express abstractions. All of these have shaped the way we think about problem solving. However, programming languages have not evolved in their precision of expression. In fact, they may have actually gotten worse since the meaning of a sample of machine code is exact and unequivocal , whereas the meaning of the constructs of typical modern high-order languages are substantially less certain. The evolution of C into C++ certainly improved its ability to express design abstractions but, if anything, the predictability of the compiled code decreased. These ambiguities arise either from deficiencies in the original language definition or from implementation

Question: What is the difference between a programming language and a programming language subset?


Vision-based obstacle recognition system for automated lawn mower robot development. Digital image processing techniques (DIP) have been widely used in various types of application recently. Classification and recognition of a specific object using vision system require some challenging tasks in the field of image processing and artificial intelligence. The ability and efficiency of vision system to capture and process the images is very important for any intelligent system such as autonomous robot. This paper gives attention to the development of a vision system that could contribute to the development of an automated vision based lawn mower robot. The works involve on the implementation of DIP techniques to detect and recognize three different types of obstacles that usually exist on a football field. The focus was given on the study on different types and sizes of obstacles, the development of vision based obstacle recognition system and the evaluation of the system's performance. Image processing techniques such as image filtering, segmentation, enhancement and edge detection have been applied in the system. The results have shown that the developed system is able to detect and recognize various types of obstacles on a football field with recognition rate of more 80%.

Question: What is the vision based obstacle recognition system for automated lawn mower robot development?


Consensus-Driven Propagation in Massive Unlabeled Data for Face Recognition. Face recognition has witnessed great progress in recent years, mainly attributed to the high-capacity model designed and the abundant labeled data collected. However, it becomes more and more prohibitive to scale up the current million-level identity annotations. In this work, we show that unlabeled face data can be as effective as the labeled ones. Here, we consider a setting closely mimicking the real-world scenario, where the unlabeled data are collected from unconstrained environments and their identities are exclusive from the labeled ones. Our main insight is that although the class information is not available, we can still faithfully approximate these semantic relationships by constructing a relational graph in a bottom-up manner. We propose Consensus-Driven Propagation (CDP) to tackle this challenging problem with two modules, the "committee" and the "mediator", which select positive face pairs robustly by carefully aggregating multi-view information. Extensive experiments validate the effectiveness of both modules to discard outliers and mine hard positives. With CDP, we achieve a compelling accuracy of 78.18% on MegaFace identification challenge by using only 9% of the labels, comparing to 61.78% when no unlabeled data are used and 78.52% when all labels are employed.

Question: How to deal with the lack of labels?


Bidirectional Decoder Networks for Attention-Based End-to-End Offline Handwriting Recognition. Recurrent neural networks that can be trained end-to-end on sequence learning tasks provide promising benefits over traditional recognition systems. In this paper, we demonstrate the application of an attention-based long short-term memory decoder network for offline handwriting recognition and analyze the segmentation, classification and decoding errors produced by the model. We further extend the decoding network by a bidirectional topology together with an integrated length estimation procedure and show that it is superior to unidirectional decoder networks. Results are presented for the word and text line recognition tasks of the RIMES handwriting recognition database. The software used in the experiments is freely available for academic research purposes.

Question: What is the bidirectional decoder network?


Discriminative key-component models for interaction detection and recognition. Not all frames are equal – selecting a subset of discriminative frames from a video can improve performance at detecting and recognizing human interactions. In this paper we present models for categorizing a video into one of a number of predefined interactions or for detecting these interactions in a long video sequence. The models represent the interaction by a set of key temporal moments and the spatial structures they entail. For instance: two people approaching each other, then extending their hands before engaging in a "handshaking" interaction. Learning the model parameters requires only weak supervision in the form of an overall label for the interaction. Experimental results on the UT-Interaction and VIRAT datasets verify the efficacy of these structured models for human interactions.

Question: What is the difference between a discriminative key-component model and a discriminative key-frame model?


Semantic labeling of 3D point clouds with object affordance for robot manipulation. When a robot is deployed it needs to understand the nature of its surroundings. In this paper, we address the problem of semantic labeling 3D point clouds by object affordance (e.g., `pushable', `liftable'). We propose a technique to extract geometric features from point cloud segments and build a classifier to predict associated object affordances. With the classifier, we have developed an algorithm to enhance object segmentation and reduce manipulation uncertainty by iterative clustering, along with minimizing labeling entropy. Our incremental multiple view merging technique shows improved object segmentation. The novel feature of our approach is the semantic labeling that can be directly applied to manipulation planning. In our experiments with 6 affordance labels, an average of 81.8% accuracy of affordance prediction is achieved. We demonstrate refined object segmentation by applying the classifier to data from the PR2 robot using a Microsoft Kinect in an indoor office environment.

Question: What is the canadian military?


Financing Constraints and Corporate Investment. EMPIRICAL models of business investment rely generally on the assumption of a "representative firm" that responds to prices set in centralized securities markets. Indeed, if all firms have equal access to capital markets, firms' responses to changes in the cost of capital or tax-based investment incentives differ only because of differences in investment demand. A firm's financial structure is irrelevant to investment because external funds provide a perfect substitute for internal capital. In general, with perfect capital markets, a firm's investment decisions are independent of its financial condition. An alternative research agenda, however, has been based on the view that internal and external capital are not perfect substitutes. According to this view, investment may depend on financial factors, such as the availability of internal finance, access to new debt or equity finance, or the functioning of particular credit markets. For example, a firm's internal cash flow may affect investment spending because of a "financ-

Question: What is the difference between internal and external capital?


Fraud Detection From Taxis' Driving Behaviors. Taxi is a major transportation in the urban area, offering great benefits and convenience to our daily life. However, one of the major business fraud in taxis is the charging fraud, specifically overcharging for the actual distance. In practice, it is hard for us to always monitor taxis and detect such fraud. Due to the Global Positioning System (GPS) embedded in taxis, we can collect the GPS reports from the taxis' locations, and thus, it is possible for us to retrieve their traces. Intuitively, we can utilize such information to construct taxis' trajectories, compute the actual service distance on the city map, and detect fraudulent behaviors. However, in practice, due to the extremely limited reports, notable location errors, complex city map, and road networks, our task to detect taxi fraud faces significant challenges, and the previous methods cannot work well. In this paper, we have a critical and interesting observation that fraudulent taxis always play a secret trick, i.e., modifying the taximeter to a smaller scale. As a result, it not only makes the service distance larger but also makes the reported taxi speed larger. Fortunately, the speed information collected from the GPS reports is accurate. Hence, we utilize the speed information to design a system, which is called the Speed-based Fraud Detection System (SFDS), to model taxi behaviors and detect taxi fraud. Our method is robust to the location errors and independent of the map information and road networks. At the same time, the experiments on real-life data sets confirm that our method has better accuracy, scalability, and more efficient computation, compared with the previous related methods. Finally, interesting findings of our work and discussions on potential issues are provided in this paper for future city transportation and human behavior research.

Question: What is the speed of a taxi?


Handwriting difficulties in primary school children: a search for underlying mechanisms.. OBJECTIVE This study investigated the contribution of perceptual-motor dysfunction and cognitive planning problems to the quality or speed of handwriting in children with handwriting problems (HWP).   METHOD Twenty-nine children with HWP and 20 classroom peers attending regular schools (grade 2 and grade 3) were tested with regard to visual perception, visual-motor integration, fine motor coordination, and cognitive planning abilities.   RESULTS The HWP group scored significantly lower on visual perception, visual-motor integration, fine motor coordination, and cognitive planning in comparison with classroom controls. Regression analyses showed that visual-motor integration was the only significant predictor for quality of handwriting in the HWP group, whereas fine motor coordination (i.e., unimanual dexterity) was the only significant predictor of quality of handwriting in the control group.   CONCLUSIONS Results suggest that two different mechanisms underlie the quality of handwriting in children with and without handwriting problems. Poor quality of handwriting of children with HWP seems particularly related to a deficiency in visual-motor integration.

Question: What is the difference between the quality of handwriting in children with and without handwriting problems?


In-situ vehicular antenna integration and design aspects for vehicle-to-vehicle communications. Vehicle-to-vehicle (V2V) communications aim to enhance driver safety and traffic efficiency by using the recently designated frequency bands in the 5.9 GHz range in Europe. Due to the time-frequency selective fading behavior of the vehicular communication channel, multi-antenna techniques can provide enhanced link conditions by means of diversity processing. This paper highlights the integration of a four-element (N =4) linear array antenna into the roof-top compartment of a vehicle to conduct Multiple-Input Multiple-Output (MIMO) high-resolution mobile-to-mobile channel measurements.

Question: How to design a vehicle antenna?


Correlation Hashing Network for Efficient Cross-Modal Retrieval. Due to the storage and retrieval efficiency, hashing has been widely deployed to approximate nearest neighbor search for large-scale multimedia retrieval. Cross-modal hashing, which improves the quality of hash coding by exploiting the semantic correlation across different modalities, has received increasing attention recently. For most existing cross-modal hashing methods, an object is first represented as of vector of hand-crafted or machine-learned features, followed by another separate quantization step that generates binary codes. However, suboptimal hash coding may be produced, because the quantization error is not statistically minimized and the feature representation is not optimally compatible with the binary coding. In this paper, we propose a novel Correlation Hashing Network (CHN) architecture for cross-modal hashing, in which we jointly learn good data representation tailored to hash coding and formally control the quantization error. The CHN model is a hybrid deep architecture constituting four key components: (1) an image network with multiple convolution-pooling layers to extract good image representations, and a text network with several fully-connected layers to extract good text representations; (2) a fully-connected hashing layer to generate modality-specific compact hash codes; (3) a squared cosine loss layer for capturing both cross-modal correlation and within-modal correlation; and (4) a new cosine quantization loss for controlling the quality of the binarized hash codes. Extensive experiments on standard cross-modal retrieval datasets show the proposed CHN model yields substantial boosts over latest state-of-the-art hashing methods.

Question: What is the correlation between image and text?


DEEP-SEE FACE: A Mobile Face Recognition System Dedicated to Visually Impaired People. In this paper, we introduce the DEEP-SEE FACE framework, an assistive device designed to improve cognition, interaction, and communication of visually impaired (VI) people in social encounters. The proposed approach jointly exploits computer vision algorithms (region proposal networks, ATLAS tracking and global, and low-level image descriptors) and deep convolutional neural networks in order to detect, track, and recognize, in real-time, various persons existent in the video streams. The major contribution of the paper concerns a global, fixed-size face representation that takes into the account of various video frames while remaining independent of the length of the image sequence. To this purpose, we introduce an effective weight adaptation scheme that is able to determine the relevance assigned to each face instance, depending on the frame degree of motion/camera blur, scale variation, and compression artifacts. Another relevant contribution involves a hard negative mining stage that helps us differentiating between known and unknown face identities. The experimental results, carried out on a large-scale data set, validate the proposed methodology with an average accuracy and recognition rates superior to 92%. When tested in real life, indoor/outdoor scenarios, the DEEP-SEE FACE prototype proves to be effective and easy to use, allowing the VI people to access visual information during social events.

Question: How does the DEEP-SEE FACE work?


Comparative Study of Cloud Computing Data Security Methods. Cloud computing is the concept implemented to decipher the Daily Computing Problems. Cloud computing is basically virtual pool of resources and it provides these resources to users via internet. Cloud computing is the internet based development and used in computer technology. The prevalent problem associated with cloud computing is data privacy, security, anonymity and reliability etc. But the most important between them is security and how cloud provider assures it. The work plan here is to eliminate the concerns regarding data privacy using encryption algorithms to enhance the security in cloud. Have discussed about cloud computing security mechanisms and presented the comparative study of several algorithms.

Question: What is cloud computing?


A License Plate-Recognition Algorithm for Intelligent Transportation System Applications. In this paper, a new algorithm for vehicle license plate identification is proposed, on the basis of a novel adaptive image segmentation technique (sliding concentric windows) and connected component analysis in conjunction with a character recognition neural network. The algorithm was tested with 1334 natural-scene gray-level vehicle images of different backgrounds and ambient illumination. The camera focused in the plate, while the angle of view and the distance from the vehicle varied according to the experimental setup. The license plates properly segmented were 1287 over 1334 input images (96.5%). The optical character recognition system is a two-layer probabilistic neural network (PNN) with topology 108-180-36, whose performance for entire plate recognition reached 89.1%. The PNN is trained to identify alphanumeric characters from car license plates based on data obtained from algorithmic image processing. Combining the above two rates, the overall rate of success for the license-plate-recognition algorithm is 86.0%. A review in the related literature presented in this paper reveals that better performance (90% up to 95%) has been reported, when limitations in distance, angle of view, illumination conditions are set, and background complexity is low

Question: What is the license plate recognition algorithm?


Robust Speaker-Adaptive HMM-Based Text-to-Speech Synthesis. This paper describes a speaker-adaptive HMM-based speech synthesis system. The new system, called ldquoHTS-2007,rdquo employs speaker adaptation (CSMAPLR+MAP), feature-space adaptive training, mixed-gender modeling, and full-covariance modeling using CSMAPLR transforms, in addition to several other techniques that have proved effective in our previous systems. Subjective evaluation results show that the new system generates significantly better quality synthetic speech than speaker-dependent approaches with realistic amounts of speech data, and that it bears comparison with speaker-dependent approaches even when large amounts of speech data are available. In addition, a comparison study with several speech synthesis techniques shows the new system is very robust: It is able to build voices from less-than-ideal speech data and synthesize good-quality speech even for out-of-domain sentences.

Question: What is the speaker-adaptive HMM-based speech synthesis system?


Deep Learning Human Mind for Automated Visual Classification. What if we could effectively read the mind and transfer human visual capabilities to computer vision methods? In this paper, we aim at addressing this question by developing the first visual object classifier driven by human brain signals. In particular, we employ EEG data evoked by visual object stimuli combined with Recurrent Neural Networks (RNN) to learn a discriminative brain activity manifold of visual categories in a reading the mind effort. Afterward, we transfer the learned capabilities to machines by training a Convolutional Neural Network (CNN)–based regressor to project images onto the learned manifold, thus allowing machines to employ human brain–based features for automated visual classification. We use a 128-channel EEG with active electrodes to record brain activity of several subjects while looking at images of 40 ImageNet object classes. The proposed RNN-based approach for discriminating object classes using brain signals reaches an average accuracy of about 83%, which greatly outperforms existing methods attempting to learn EEG visual object representations. As for automated object categorization, our human brain–driven approach obtains competitive performance, comparable to those achieved by powerful CNN models and it is also able to generalize over different visual datasets.

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


On Challenges in Evaluating Malware Clustering. Malware clustering and classification are important tools that enable analysts to prioritize their malware analysis efforts. The recent emergence of fully automated methods for malware clustering and classification that report high accuracy suggests that this problem may largely be solved. In this paper, we report the results of our attempt to confirm our conjecture that the method of selecting ground-truth data in prior evaluations biases their results toward high accuracy. To examine this conjecture, we apply clustering algorithms from a different domain (plagiarism detection), first to the dataset used in a prior work's evaluation and then to a wholly new malware dataset, to see if clustering algorithms developed without attention to subtleties of malware obfuscation are nevertheless successful. While these studies provide conflicting signals as to the correctness of our conjecture, our investigation of possible reasons uncovers, we believe, a cautionary note regarding the significance of highly accurate clustering results, as can be impacted by testing on a dataset with a biased cluster-size distribution.

Question: What is the difference between clustering and classification?


Partitioning Well-Clustered Graphs with k-Means and Heat Kernel. We study a suitable class of well-clustered graphs that admit good k-way partitions and present the first almost-linear time algorithm for with almost-optimal approximation guarantees partitioning such graphs. A good k-way partition is a partition of the vertices of a graph into disjoint clusters (subsets) {Si}i=1, such that each cluster is better connected on the inside than towards the outside. This problem is a key building block in algorithm design, and has wide applications in community detection and network analysis. Key to our result is a theorem on the multi-cut and eigenvector structure of the graph Laplacians of these well-clustered graphs. Based on this theorem, we give the first rigorous guarantees on the approximation ratios of the widely used k-means clustering algorithms. We also give an almost-linear time algorithm based on heat kernel embeddings and approximate nearest neighbor data structures.

Question: What is the first almost-linear time algorithm for partitioning well-clustered graphs?


Sensor fusion for robot control through deep reinforcement learning. Deep reinforcement learning is becoming increasingly popular for robot control algorithms, with the aim for a robot to self-learn useful feature representations from unstructured sensory input leading to the optimal actuation policy. In addition to sensors mounted on the robot, sensors might also be deployed in the environment, although these might need to be accessed via an unreliable wireless connection. In this paper, we demonstrate deep neural network architectures that are able to fuse information generated by multiple sensors and are robust to sensor failures at runtime. We evaluate our method on a search and pick task for a robot both in simulation and the real world.

Question: What is deep reinforcement learning?


Improving bug triage with bug tossing graphs. bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" (reassigned) to other developers, for example because the bug has been assigned by accident or another developer with additional expertise is needed. In any case, tossing increases the time-to-correction for a bug.  In this paper, we introduce a graph model based on Markov chains, which captures bug tossing history. This model has several desirable qualities. First, it reveals developer networks which can be used to discover team structures and to find suitable experts for a new task. Second, it helps to better assign developers to bug reports. In our experiments with 445,000 bug reports, our model reduced tossing events, by up to 72%. In addition, the model increased the prediction accuracy by up to 23 percentage points compared to traditional bug triaging approaches.

Question: How to improve bug triage with bug tossing graphs?


Nurse Managers' Emotional Intelligence and Effective Leadership: A Review of the Current Evidence. Background Emotional Intelligence has made a significant contribution to effective leadership, becoming one of the key characteristics of leaders.Objective: The aim of the present study was to review qualitative and quantitative studies concerning Emotional Intelligence of nurse leaders and the evidence-based composition of their results.   Method A search was performed in the electronic databases (Pubmed, Scopus and CINAHL) for articles, which were published in the period 2000-2017 in English or Greek. Eleven studies met the inclusion criteria, of which 10 were quantitative and one was qualitative.   Results The results suggested that Emotional Intelligence is a useful tool for nurse leaders and contributes decisively to the achievement of effective management in healthcare.   Conclusion It is necessary for nurses to improve their social and emotional skills because of the particular nature of the nursing profession, which places the healthy or weak person at its center.

Question: What is the composition of the results of the study?


ZenCrowd: leveraging probabilistic reasoning and crowdsourcing techniques for large-scale entity linking. We tackle the problem of entity linking for large collections of online pages; Our system, ZenCrowd, identifies entities from natural language text using state of the art techniques and automatically connects them to the Linked Open Data cloud. We show how one can take advantage of human intelligence to improve the quality of the links by dynamically generating micro-tasks on an online crowdsourcing platform. We develop a probabilistic framework to make sensible decisions about candidate links and to identify unreliable human workers. We evaluate ZenCrowd in a real deployment and show how a combination of both probabilistic reasoning and crowdsourcing techniques can significantly improve the quality of the links, while limiting the amount of work performed by the crowd.

Question: What is the name of the entity linking system?


Increasing the breakdown capability of superjunction power MOSFETs at the edge of the active region. When superjunction power MOSFETs operate near the rim of the safe operating area, avalanche breakdown can occur in the transition region between the active cell array and the edge termination. Numerical device simulations confirmed this and revealed local charge imbalances, created by irregularities in the superjunction doping pattern, as major cause. Based on the simulation results, we proposed optimized transitions of the superjunction doping pattern from the active cell array to the edge termination. Numerical device simulations as well as experiments demonstrated the enhanced breakdown capability of these transition regions.

Question: What is the breakdown capability of superjunction power MOSFETs?


M-invariance: towards privacy preserving re-publication of dynamic datasets. The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-publication of the microdata, after it has been updated with insertions <u>and</u> deletions. This is a serious drawback, because currently a publisher cannot provide researchers with the most recent dataset continuously.  This paper remedies the drawback. First, we reveal the characteristics of the re-publication problem that invalidate the conventional approaches leveraging k-anonymity and l-diversity. Based on rigorous theoretical analysis, we develop a new generalization principle m-invariance that effectively limits the risk of privacy disclosure in re-publication. We accompany the principle with an algorithm, which computes privacy-guarded relations that permit retrieval of accurate aggregate information about the original microdata. Our theoretical results are confirmed by extensive experiments with real data.

Question: What is the difference between k-anonymity and l-diversity?


Failure Analysis of SGI XFS File System. Commodity file systems expect a fail stop disk. But todays disks fail in unexpected ways. Disks exhibit latent sector errors, silent corruption and transient failures to name a few. In this paper we study the behavior of SGI XFS to such errors. File systems play a key role in handling most data and hence the failure handling policy of the file system plays a major role in ensuring the integrity of the data. XFS is a highly scalable journaling file system developed by SGI. We analyze the failure handling policy of XFS file system. We fail reads and writes of various blocks that originate from the file system and analyze the file system behavior. Some such blocks include super block, journal header block, commit block, data block, index blocks. We classify our errors according to the extended IRON Taxonomy. We see that XFS is vulnerable to these failures and does not possess a uniform failure handling policy. Further the file system at times silently corrupts data. We also see that XFS has very little internal redundancy even for critical structures such as the super block and B+Tree root. Finally we see that XFS, like most commodity file systems, fails to recover from these failures putting the data at risk.

Question: What is the extended IRON taxonomy?


Large-signal-modulation of high-efficiency light-emitting diodes for optical communication. The dynamic behavior of high-efficiency light-emitting diodes (LEDs) is investigated theoretically and experimentally. A detailed theoretical description of the switch-on and switch-off transients of LEDs is derived. In the limit of small-signal modulation, the well-established exponential behavior is obtained. However, in the case of high injection, which is easily reached for thin active layer LEDs, the small-signal time constant is found to be up to a factor of two faster than the radiative recombination lifetime. Using such quantum-well LEDs, we have demonstrated optical data transfer with wide open eye diagrams at bit rates up to 2 Gbit/s. In addition, we have combined the use of thin active layers with the concept of surface-textured thin-film LEDs, which allow a significant improvement in the light extraction efficiency. With LEDs operating at 0.5 Gbit/s and 1 Gbit/s, we have achieved external quantum efficiencies of 36% and 29%, respectively.

Question: What is the difference between a thin-film LED and a thick-film LED?


Computational imaging with multi-camera time-of-flight systems. Depth cameras are a ubiquitous technology used in a wide range of applications, including robotic and machine vision, human-computer interaction, autonomous vehicles as well as augmented and virtual reality. In this paper, we explore the design and applications of phased multi-camera time-of-flight (ToF) systems. We develop a reproducible hardware system that allows for the exposure times and waveforms of up to three cameras to be synchronized. Using this system, we analyze waveform interference between multiple light sources in ToF applications and propose simple solutions to this problem. Building on the concept of orthogonal frequency design, we demonstrate state-of-the-art results for instantaneous radial velocity capture via Doppler time-of-flight imaging and we explore new directions for optically probing global illumination, for example by de-scattering dynamic scenes and by non-line-of-sight motion detection via frequency gating.

Question: What is the difference between a depth camera and a time-of-flight camera?


Feminism and interaction design. This workshop is aimed at exploring the issues at the intersection of feminist thinking and human computer interaction. Both feminism and HCI have made important contributions to social science in the past several decades, but though their potential for overlap seem high, they have not engaged each other directly until recently. In this workshop we will explore diverse--and contentious--ways that feminist perspectives can support user research, design ideation and problem framing, sketching and prototyping, and design criticism and evaluation. The workshop will include fast-moving mini-panels and hands-on group exercises emphasizing feminist interaction criticism and design ideation.

Question: What is feminist interaction design?


Regularization of Neural Networks using DropConnect. We introduce DropConnect, a generalization of Dropout (Hinton et al., 2012), for regularizing large fully-connected layers within neural networks. When training with Dropout, a randomly selected subset of activations are set to zero within each layer. DropConnect instead sets a randomly selected subset of weights within the network to zero. Each unit thus receives input from a random subset of units in the previous layer. We derive a bound on the generalization performance of both Dropout and DropConnect. We then evaluate DropConnect on a range of datasets, comparing to Dropout, and show state-of-the-art results on several image recognition benchmarks by aggregating multiple DropConnect-trained models.

Question: What is a neural network?


Vicious and virtuous cycles in ERP implementation: a case study of interrelations between critical success factors. • A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.

Question: What is the difference between the author version and the final published version?


Combining Machine Learning Techniques and Natural Language Processing to Infer Emotions Using Spanish Twitter Corpus. In the recent years, microblogging services, as Twitter, have become a popular tool for expressing feelings, opinions, broadcasting news, and communicating with friends. Twitter users produced more than 340 million tweets per day which may be consider a rich source of user information. We take a supervised approach to the problem, but leverage existing hashtags in Twitter for building our training data. Finally, we tested the Spanish emotional corpus applying two different machine learning algorithms for emotion identification reaching about 65% accuracy.

Question: What is the size of the spanish twitter corpus?


Flame detection in video using hidden Markov models. This paper proposes a novel method to detect flames in video by processing the data generated by an ordinary camera monitoring a scene. In addition to ordinary motion and color clues, flame flicker process is also detected by using a hidden Markov model. Markov models representing the flame and flame colored ordinary moving objects are used to distinguish flame flicker process from motion of flame colored moving objects. Spatial color variations in flame are also evaluated by the same Markov models, as well. These clues are combined to reach a final decision. False alarms due to ordinary motion of flame colored moving objects are greatly reduced when compared to the existing video based fire detection systems.

Question: How to detect flames in video using hidden Markov models?


Robot task planning using semantic maps. Task planning for mobile robots usually relies solely on spatial information and on shallow domain knowledge, like labels attached to objects and places. Although spatial information is necessary for performing basic robot operations (navigation, localization, and obstacle avoidance), the use of deeper domain knowledge is pivotal to endow a robot with higher degrees of autonomy and intelligence. In this paper, we focus on semantic knowlege, and show how this type of knowledge can be profitably used for robot task planning. We start by defining a specific type of semantic maps, which integrate hierarchical spatial information and semantic knowledge. We then proceed to describe how these semantic maps can improve task planning in three ways: enriching the planning domain, relaxing unachievable goals, and improving the efficiency of the planner in large domains. Finally, we show several exepriments that demonstrate the effectiveness of our solutions in a doman involving robot navigation in a domestic environment.

Question: What is the difference between spatial information and semantic knowledge?


Aspect identification and sentiment analysis based on NLP. This paper proposes method for aspect identification and sentiment analysis. This paper deals with the problem of sentence level. We use semantic syntax tree to extract NP nodes, a method based on slack to identify aspect and mini-support function to narrow aspect; to analyze the sentiment for the aspect we use dictionary-based method. Experimental results show that the proposed approach achieves the state-of-the-art.

Question: What is the state-of-the-art?


Direct Synthesis of Complex Loaded Chebyshev Filters in a Complex Filtering Network. In this paper, a direct synthesis approach is proposed for designing a Chebyshev filter that matches the frequency variant complex loads at both the ports. The approach is based on the power wave renormalization theory and two practical assumptions: 1) the prescribed transmission zeros are stationary and 2) the reflection zeros are located along an imaginary axis. Three conditions are derived to stipulate the characteristic polynomials of the filter's responses through the renormalization of reference load impedances. These conditions are sequentially applied to ensure that the filter is physically realizable and well matched to the complex loads. It has been shown that the optimally synthesized filtering network that consists of an ideal filter cascaded with a piece of transmission line of an optimal length at each port can match the complex loads over a given frequency band with the best effort. By incorporating with an adjustment of the junction parameters, the approach provides an analytical yet flexible way to synthesize advanced microwave circuits composed of multiple filters connected together through some generalized junctions. The effectiveness of the method is demonstrated through three synthesis examples.

Question: How to synthesize a complex filter?


Experiential Design of Shared Information Spaces. 5.

Question: What is the experiential design of shared information spaces?


Trainable Sentence Planning for Complex Information Presentations in Spoken Dialog Systems. A challenging problem for spoken dialog systems is the design of utterance generation modules that are fast, flexible and general, yet produce high quality output in particular domains. A promising approach is trainable generation, which uses general-purpose linguistic knowledge automatically adapted to the application domain. This paper presents a trainable sentence planner for the MATCH dialog system. We show that trainable sentence planning can produce output comparable to that of MATCH's template-based generator even for quite complex information presentations.

Question: What is a trainable sentence planner?


Contextual Phrase-Level Polarity Analysis Using Lexical Affect Scoring and Syntactic N-Grams. We present a classifier to predict contextual polarity of subjective phrases in a sentence. Our approach features lexical scoring derived from the Dictionary of Affect in Language (DAL) and extended through WordNet, allowing us to automatically score the vast majority of words in our input avoiding the need for manual labeling. We augment lexical scoring with n-gram analysis to capture the effect of context. We combine DAL scores with syntactic constituents and then extract ngrams of constituents from all sentences. We also use the polarity of all syntactic constituents within the sentence as features. Our results show significant improvement over a majority class baseline as well as a more difficult baseline consisting of lexical n-grams.

Question: What is the contextual polarity of the following sentence?


Natural Image Colorization. In this paper, we present an interactive system for users to easily colorize the natural images of complex scenes. In our system, colorization procedure is explicitly separated into two stages: Color labeling and Color mapping. Pixels that should roughly share similar colors are grouped into coherent regions in the color labeling stage, and the color mapping stage is then introduced to further fine-tune the colors in each coherent region. To handle textures commonly seen in natural images, we propose a new color labeling scheme that groups not only neighboring pixels with similar intensity but also remote pixels with similar texture. Motivated by the insight into the complementary nature possessed by the highly contrastive locations and the smooth locations, we employ a smoothness map to guide the incorporation of intensity-continuity and texture-similarity constraints in the design of our labeling algorithm. Within each coherent region obtained from the color labeling stage, the color mapping is applied to generate vivid colorization effect by assigning colors to a few pixels in the region. A set of intuitive interface tools is designed for labeling, coloring and modifying the result. We demonstrate compelling results of colorizing natural images using our system, with only a modest amount of user input.

Question: How to colorize natural images?


Neural interactions between motor cortical hemispheres during bimanual and unimanual arm movements.. Cortico-cortical connections through the corpus callosum are a major candidate for mediating bimanual coordination. However, aside from the deficits observed after lesioning this connection, little positive evidence indicates its function in bimanual tasks. In order to address this issue, we simultaneously recorded neuronal activity at multiple sites within the arm area of motor cortex in both hemispheres of awake primates performing different bimanual and unimanual movements. By employing an adapted form of the joint peri-stimulus time histogram technique, we discovered rapid movement-related correlation changes between the local field potentials (LFPs) of the two hemispheres that escaped detection by time-averaged cross-correlation methods. The frequency and amplitude of dynamic modifications in correlations between the hemispheres were similar to those within the same hemisphere. As in previous EEG studies, we found that, on average, correlation decreased during movements. However, a subset of recording site pairs did show transiently increased correlations around movement onset (57% of all pairs and conditions in monkey G, 39% in monkey P). In interhemispheric pairs, these increases were consistently related to the mode of coupling between the two arms. Both the correlations between the movements themselves and the interhemispheric LFP correlation increases were strongest during bimanual symmetric movements, and weaker during bimanual asymmetric and unimanual movements. Increased correlations occurred mainly around movement onset, whilst decreases in correlation dominated during movement execution. The task-specific way in which interhemispheric correlations are modulated is compatible with the notion that interactions between the hemispheres contribute to behavioural coupling between the arms.

Question: What is the function of the corpus callosum?


Design of Two-stage High Gain Operational Amplifier Using Current Buffer Compensation for Low Power Applications. i ii ACKNOWLEDGEMENT I wish to express my sincere appreciation to my thesis advisor, Mr. B. K. Hemant for his timely, informative feedback and support during this effort. It has been a great pleasure to learn from him during the process of expanding and refining my research. He has been a generous mentor. I also like to express my gratefulness to Dr. his perpetual encouragement, generous help and inspiring guidance. for their support and guidance. I am also very grateful for all the help I received from my classmates.

Question: What is the difference between a thesis advisor and a mentor?


OpenCL framework for ARM processors with NEON support. The state-of-the-art ARM processors provide multiple cores and SIMD instructions. OpenCL is a promising programming model for utilizing such parallel processing capability because of its SPMD programming model and built-in vector support. Moreover, it provides portability between multicore ARM processors and accelerators in embedded systems. In this paper, we introduce the design and implementation of an efficient OpenCL framework for multicore ARM processors. Computational tasks in a program are implemented as OpenCL kernels and run on all CPU cores in parallel by our OpenCL framework. Vector operations and built-in functions in OpenCL kernels are optimized using the NEON SIMD instruction set. We evaluate our OpenCL framework using 37 benchmark applications. The result shows that our approach is effective and promising.

Question: What is the state-of-the-art ARM processor?


Leveraging social media networks for classification. Social media has reshaped the way in which people interact with each other. The rapid development of participatory web and social networking sites like YouTube, Twitter, and Facebook, also brings about many data mining opportunities and novel challenges. In particular, we focus on classification tasks with user interaction information in a social network. Networks in social media are heterogeneous, consisting of various relations. Since the relation-type information may not be available in social media, most existing approaches treat these inhomogeneous connections homogeneously, leading to an unsatisfactory classification performance. In order to handle the network heterogeneity, we propose the concept of social dimension to represent actors' latent affiliations, and develop a classification framework based on that. The proposed framework, SocioDim, first extracts social dimensions based on the network structure to accurately capture prominent interaction patterns between actors, then learns a discriminative classifier to select relevant social dimensions. SocioDim, by differentiating different types of network connections, outperforms existing representative methods of classification in social media, and offers a simple yet effective approach to integrating two types of seemingly orthogonal information: the network of actors and their attributes.

Question: How to leverage social media networks for classification?


Post-Processing OCR Text using Web-Scale Corpora. We introduce a (semi-)automatic OCR post-processing system that utilizes web-scale linguistic corpora in providing high-quality correction. This paper is a comprehensive system overview with the focus on the computational procedures, applied linguistic analysis, and processing optimization.

Question: What is a web-scale corpus?


Locality-Sensitive Bloom Filter for Approximate Membership Query. In many network applications, Bloom filters are used to support exact-matching membership query for their randomized space-efficient data structure with a small probability of false answers. In this paper, we extend the standard Bloom filter to Locality-Sensitive Bloom Filter (LSBF) to provide Approximate Membership Query (AMQ) service. We achieve this by replacing uniform and independent hash functions with locality-sensitive hash functions. Such replacement makes the storage in LSBF to be locality sensitive. Meanwhile, LSBF is space efficient and query responsive by employing the Bloom filter design. In the design of the LSBF structure, we propose a bit vector to reduce False Positives (FP). The bit vector can verify multiple attributes belonging to one member. We also use an active overflowed scheme to significantly decrease False Negatives (FN). Rigorous theoretical analysis (e.g., on FP, FN, and space overhead) shows that the design of LSBF is space compact and can provide accurate response to approximate membership queries. We have implemented LSBF in a real distributed system to perform extensive experiments using real-world traces. Experimental results show that LSBF, compared with a baseline approach and other state-of-the-art work in the literature (SmartStore and LSB-tree), takes less time to respond AMQ and consumes much less storage space.

Question: What is the size of the canadian military?


Finding a Needle in Haystack: Facebook's Photo Storage. Facebook needed an architecture to address the need of storing metadata to find photos on storage machines efficiently in memory. They realized that storing a single photo in a single file would prevent them from achieving this goal; thus, they chose to store multiple photos in a single file, reducing the metadata overhead and making it more possible to store the metadata in memory. They ultimately came up with an architecture that consists of a Haystack Store (the persistent storage), Haystack Directory (used to locate photos and manage storage), and Haystack Cache (used to provide quick access to photos not found in the CDN but generating a large number of requests from users). Their architecture allowed them to choose whether to use a CDN or not, but in either case, the Cache was used to address the issue of the "long tail" problem, where less popular photos still generate requests, and does so by having any request from the user directly be stored in the Cache or by having photos fetched from a write-enabled machine to be stored in the Cache. Haystack addressed the potential of failures wiping inmemory data structures by storing these structures in index files. These index files are updated asynchronously of writes preventing performance decrease. To efficiently handle modifications, Haystack chose to append modified files to the end of the file as well as record file to delete the old version of the file. The old version of the file, along with any files marked deleted through delete requests are deleted through an operation called compaction, which takes files not marked deleted or only new versions of modified file and stores it in a new file on disk. This way, deletes and modifications are handled asynchronously of writes and thus is efficient.

Question: What is the haystack store?


Nearest prototype classifier designs: An experimental study. We compare eleven methods for finding prototypes upon which to base the nearest Ž prototype classifier. Four methods for prototype selection are discussed: Wilson Hart a . condensation error-editing method , and three types of combinatorial search random search, genetic algorithm, and tabu search. Seven methods for prototype extraction are discussed: unsupervised vector quantization, supervised learning vector quantization Ž . with and without training counters , decision surface mapping, a fuzzy version of vector quantization, c-means clustering, and bootstrap editing. These eleven methods can be usefully divided two other ways: by whether they employ preor postsupervision; and by whether the number of prototypes found is user-defined or ''automatic.'' Generalization error rates of the 11 methods are estimated on two synthetic and two real data sets. Offering the usual disclaimer that these are just a limited set of experiments, we feel confident in asserting that presupervised, extraction methods offer a better chance for success to the casual user than postsupervised, selection schemes. Finally, our calculations do not suggest that methods which find the ''best'' number of prototypes ''automatically'' are superior to methods for which the user simply specifies the number of prototypes. 2001 John Wiley & Sons, Inc.

Question: What is the nearest prototype classifier?


CMOS Outphasing Class-D Amplifier With Chireix Combiner. This letter presents a CMOS outphasing class-D power amplifier (PA) with a Chireix combiner. Two voltage-mode class-D amplifiers used in the outphasing system were designed and implemented with a 0.18-mum CMOS process. By applying the Chireix combiner technique, drain efficiency of the outphasing PA for CDMA signals was improved from 38.6% to 48% while output power was increased from 14.5 to 15.4 dBm with an adjacent channel power ratio of -45 dBc.

Question: What is a chireix combiner?


Stretchable Heater Using Ligand-Exchanged Silver Nanowire Nanocomposite for Wearable Articular Thermotherapy.. Thermal therapy is one of the most popular physiotherapies and it is particularly useful for treating joint injuries. Conventional devices adapted for thermal therapy including heat packs and wraps have often caused discomfort to their wearers because of their rigidity and heavy weight. In our study, we developed a soft, thin, and stretchable heater by using a nanocomposite of silver nanowires and a thermoplastic elastomer. A ligand exchange reaction enabled the formation of a highly conductive and homogeneous nanocomposite. By patterning the nanocomposite with serpentine-mesh structures, conformal lamination of devices on curvilinear joints and effective heat transfer even during motion were achieved. The combination of homogeneous conductive elastomer, stretchable design, and a custom-designed electronic band created a novel wearable system for long-term, continuous articular thermotherapy.

Question: How to make a stretchable heater?