Least-Squares Fitting of Circles and Ellipses ∗. Fitting circles and ellipses to given points in the plane is a problem that arises in many application areas, e.g. computer graphics [1], coordinate metrology [2], petroleum engineering [11], statistics [7]. In the past, algorithms have been given which fit circles and ellipses in some least squares sense without minimizing the geometric distance to the given points [1], [6]. In this paper we present several algorithms which compute the ellipse for which the sum of the squares of the distances to the given points is minimal. These algorithms are compared with classical simple and iterative methods. Circles and ellipses may be represented algebraically i.e. by an equation of the form F (x) = 0. If a point is on the curve then its coordinates x are a zero of the function F . Alternatively, curves may be represented in parametric form, which is well suited for minimizing the sum of the squares of the distances. 1 Preliminaries and Introduction Ellipses, for which the sum of the squares of the distances to the given points is minimal will be referred to as "best fit" or "geometric fit", and the algorithms will be called "geometric". Determining the parameters of the algebraic equation F (x) = 0 in the least squares sense will be denoted by "algebraic fit" and the algorithms will be called "algebraic". We will use the well known Gauss-Newton method to solve the nonlinear least squares problem (cf. [15]). Let u = (u1, . . . , un) T be a vector of unknowns and consider the nonlinear system of m equations f(u) = 0. If m > n, then we want to minimize

Question: What is the least squares fit of circles and ellipses?


Challenges of using homomorphic encryption to secure cloud computing. With the emergence of cloud computing, the concept of information security has become a major issue. Indeed, the security of such a system is the greatest concern of computer scientists, providers of cloud and organizations who want to adopt and benefit from these services. Cloud computing providers must implement concepts ensuring network security, hardware, data storage and strategies of control and access to services. All these elements help to preserve data security and ensuring the availability of services associated with the Cloud, to better satisfy clients and acquire and build their trust. However, even if the data storage security in cloud servers is assured, reluctance remain when it comes to process the confidential data. Indeed, the fear that sensitive data is being used is a major obstacle in the adoption of cloud services by enterprises. To overcome this obstacle, the use of methods that can perform operations on encrypted data without knowing the secret key, seems to be an effective way to strengthen the confidentiality of information. In this paper we will examine the challenges facing Homomorphic Encryption methods to allow suppliers of cloud to perform operations on encrypted data, and provide the same results after treatment, as if they were performing calculations on raw data.

Question: What is homomorphic encryption?


Performance of Store Brands: A Cross-Country Analysis of Consumer Store Brand Preferences, Perceptions, and Risk. This paper empirically studies consumer choice behavior in regard to store brands in the US, UK and Spain. Store brand market shares differ by country and they are usually much higher in Europe than in the US. However, there is surprisingly little work in marketing that empirically studies the reasons that underlie higher market shares associated with store brands in Europe over the US. In this paper, we empirically study the notion that the differential success of store brands in the US versus in Europe is the higher brand equity that store brands command in Europe over the US. We use a framework based on previous work to conduct our analysis: consumer brand choice under uncertainty, and brands as signals of product positions. More specifically, we examine whether uncertainty about quality (or, the positioning of the brand in the product space), perceived quality of store brands versus national brands, consistency in store brand offerings over time, as well as consumer attitudes towards risk, quality and price underlie the differential success of store brands at least partially in the US versus Europe. We propose and estimate a model that explicitly incorporates the impact of uncertainty on consumer behavior. We compare 1) levels of uncertainty associated with store brands versus national brands, 2) consistency in product positions over time for both national and store brands, 3) relative quality levels of national versus store brands, and 4) consumer sensitivity to price, quality and risk across the three countries we study. The model is estimated on scanner panel data on detergent in the US, UK and Spanish markets, and on toilet paper and margarine in the US and Spain. We find that consumer learning and perceived risk (and the associated brand equity), as well as consumer attitude towards risk, quality and price, play an important role in consumers' s

Question: What is the difference between store brands and national brands?


Realistic image composite with best-buddy prior of natural image patches. Realistic image composite requires the appearance of foreground and background layers to be consistent. This is difficult to achieve because the foreground and the background may be taken from very different environments. This paper proposes a novel composite adjustment method that can harmonize appearance of different composite layers. We introduce the Best-Buddy Prior (BBP), which is a novel compact representations of the joint co-occurrence distribution of natural image patches. BBP can be learned from unlabelled images given only the unsupervised regional segmentation. The most-probable adjustment of foreground can be estimated efficiently in the BBP space as the shift vector to the local maximum of density function. Both qualitative and quantitative evaluations show that our method outperforms previous composite adjustment methods.

Question: How to harmonize the appearance of different composite layers?


Less is more ? How demographic sample weights can improve public opinion estimates based on Twitter data. Twitter data is widely acknowledged to hold great promise for the study of political behavior and public opinion. However, a key limitation in previous studies is the lack of information about the sociodemographic characteristics of individual users, which raises concerns about the validity of inferences based on this source of data. This paper addresses this challenge by employing supervised machine learning methods to estimate the age, gender, race, party affiliation, propensity to vote, and income of any Twitter user in the U.S. The training dataset for these classifiers was obtained by matching a large dataset of 1 billion geolocated Twitter messages with voting registration records and estimates of home values across 15 different states, resulting in a sample of nearly 250,000 Twitter users whose sociodemographic traits are known. To illustrate the value of this approach, I offer three applications that use information about the predicted demographic composition of a random sample of 500,000 U.S. Twitter users. First, I explore how attention to politics varies across demographics groups. Then, I apply multilevel regression and postratification methods to recover valid estimate of presidential and candidate approval that can serve as early indicators of public opinion changes and thus complement traditional surveys. Finally, I demonstrate the value of Twitter data to study questions that may suffer from social desirability bias. Working paper. This version: September 21, 2016. I would like to thank John Ahlquist, Drew Dimmery, Pat Egan, Martin Elff, Mik Laver, Jeff Lewis, Thomas Leeper, Jonathan Nagler, Molly Roberts, Arthur Spirling, David Sontag for helpful comments and discussions. I also gratefully acknowledges financial support from the Gordon and Betty Moore Foundation and the Alfred P. Sloan Foundation.

Question: How demographic sample weights can improve public opinion estimates based on Twitter data. Twitter data is widely acknowledged to hold great promise for the study of political behavior and public opinion. However, a key limitation in previous studies is the lack of information about the sociodemographic characteristics of individual users, which raises concerns about the validity of


Combining Text and Linguistic Document Representations for Authorship Attribution. In this paper, we provide several alternatives to the classical Bag-Of-Words model for automatic authorship attribution. To this end, we consider linguistic and writing style information such as grammatical structures to construct different document representations. Furthermore we describe two techniques to combine the obtained representations: combination vectors and ensemble based meta classification. Our experiments show the viability of our approach.

Question: How to combine text and linguistic document representations for authorship attribution?


Omnidirectional Circularly Polarized Antenna Combining Monopole and Loop Radiators. In this letter, a new omnidirectional circularly polarized (CP) antenna is proposed. By adopting a coaxial probe, in which a metal sleeve acts as a monopole, and printed spoke-like metal strips fabricated on two substrates, which act as a loop, this antenna exhibits an omnidirectional circularly polarized radiation in the azimuthal plane. Theory, design, simulation, and experiment of the antenna are presented. Measurement results show that the proposed antenna can achieve a -10-dB impedance bandwidth of 13.8% (ranges from 1.55 to 1.78 GHz) and a 3-dB axial-ratio (AR) bandwidth of 17.5% (ranges from 1.46 to 1.74 GHz) in the azimuthal plane. At the frequency of 1.575 GHz, the measured average axial ratio and right-hand CP (RHCP) gain are 1.91 dB and 0.86 dBi, respectively, in the azimuthal plane.

Question: What is the difference between a monopole and a loop?


SPRINT: A Scalable Parallel Classifier for Data Mining. Classification is an important data mining problem. Although classification is a wellstudied problem, most of the current classification algorithms require that all or a portion of the the entire dataset remain permanently in memory. This limits their suitability for mining over large databases. We present a new decision-tree-based classification algorithm, called SPRINT that removes all of the memory restrictions, and is fast and scalable. The algorithm has also been designed to be easily parallelized, allowing many processors to work together to build a single consistent model. This parallelization, also presented here, exhibits excellent scalability as well. The combination of these characteristics makes the proposed algorithm an ideal tool for data mining.

Question: What is a decision tree?


Body Image and Personality in Aesthetic Plastic Surgery : A Case-Control Study. Introduction: The amount of research on the relationship between plastic surgery and psychological features, such as personality disorders and indexes of body image dissatisfaction, has increased significantly in the last years. Aim: The aim of the present study was to examine these psychological features among Italian patients who underwent aesthetic plastic surgery, testing the mediating role of the mass media influence on the relationship between them and the choice of aesthetic plastic surgery. The Personality Diagnostic Questionnaire 4+ (PDQ-4+) and the Body Uneasiness Test (BUT) were administered to patients who underwent aesthetic plastic surgery (N = 111) and participants who had no history of aesthetic plastic surgical procedures (N = 149). Results: Results showed that aesthetic patients reported higher indexes of body image disturbance than controls. No significant differences between aesthetic participants and controls were found in all three cluster B personality disorders. Moreover, the effect of body image dissatisfaction on the choice to undergo aesthetic plastic surgery was partially mediated by the influence of mass media. Conclusions: In conclusion, the present study confirmed the importance of body dissatisfaction as a predictor of the choice to undergo aesthetic surgery and highlighted the influence of media messages regarding physical appearance.

Question: What is the difference between aesthetic plastic surgery and cosmetic surgery?


Radiation Search Operations using Scene Understanding with Autonomous UAV and UGV. Autonomously searching for hazardous radiation sources requires the ability of the aerial and ground systems to understand the scene they are scouting. In this paper, we present systems, algorithms, and experiments to perform radiation search using unmanned aerial vehicles (UAV) and unmanned ground vehicles (UGV) by employing semantic scene segmentation. The aerial data is used to identify radiological points of interest, generate an orthophoto along with a digital elevation model (DEM) of the scene, and perform semantic segmentation to assign a category (e.g . road, grass) to each pixel in the orthophoto. We perform semantic segmentation by training a model on a dataset of images we collected and annotated, using the model to perform inference on images of the test area unseen to the model, and then refining the results with the DEM to better reason about category predictions at each pixel. We then use all of these outputs to plan a path for a UGV carrying a LiDAR to map the environment and avoid obstacles not present during the flight, and a radiation detector to collect more precise radiation measurements from the ground. Results of the analysis for each scenario tested favorably. We also note that our approach is general and has the potential to work for a variety of different sensing tasks.

Question: How to perform radiation search using unmanned aerial vehicles and unmanned ground vehicles?


Revenue : 229 B Revenue : ? Birth Year : ? Height : ? Weight : 70. Knowledge bases (KB) are often represented as a collection of facts in the form (head, predicate, tail), where head and tail are entities while predicate is a binary relationship that links the two. It is a well-known fact that knowledge bases are far from complete, and hence the plethora of research on KB completion methods, specifically on link prediction. However, though frequently ignored, these repositories also contain numerical facts. Numerical facts link entities to numerical values via numerical predicates; e.g., (Paris, latitude, 48.8). Likewise, numerical facts also suffer from the incompleteness problem. To address this issue, we introduce the numerical attribute prediction problem. This problem involves a new type of query where the relationship is a numerical predicate. Consequently, and contrary to link prediction, the answer to this query is a numerical value. We argue that the numerical values associated with entities explain, to some extent, the relational structure of the knowledge base. Therefore, we leverage knowledge base embedding methods to learn representations that are useful predictors for the numerical attributes. An extensive set of experiments on benchmark versions of Freebase and Yago show that our approaches largely outperform sensible baselines. We make the datasets available under a permissive BSD-3 license.

Question: What is the average height of a Canadian?


A Context-Based Detection Framework for Advanced Persistent Threats. Besides a large set of malware categories such as worms and Trojan horses, Advanced Persistent Threat (APT) is another more sophisticated attack entity emerging in the cyber threats environment. In this paper we propose a model of the APT detection problem as well as a methodology to implement it on a generic organization network. From our knowledge, the proposed method is the first to address the problem of modeling an APT and to provide a possible detection framework.

Question: What is an APT?


EVS 25 Shenzhen , China , Nov . 5-9 , 2010 Control of A high-Performance Z-Source Inverter for Fuel Cell / Supercapacitor Hybrid Electric Vehicles. This paper presents a supercapacitor (SC) module connected in parallel with fuel cell (FC) stack to supply a high-performance Z-Source Inverter (HP-ZSI) feeding a three phase induction motor for hybrid electric vehicles applications. The supercapacitor is connected between the input diode and the bidirectional switch of the highperformance ZSI topology. The indirect field-oriented control (IFOC) method is used to control an induction motor speed during motoring and regenerative braking operations to produce the modulation index and a dual loop controller is used to control the Z-network capacitor voltage to produce the shoot-through duty ratio. MATLAB simulation results verified the validity of the proposed control strategy during motoring and regenerative braking operations.

Question: How to control a supercapacitor connected in parallel with a fuel cell stack to supply a high-performance Z-Source Inverter feeding a three phase induction motor for hybrid electric vehicles applications?


An Application of Inverse Reinforcement Learning to Medical Records of Diabetes Treatment. It is an important issue to utilize large amount of medical records which are being accumulated on medical information systems to improve the quality of medical treatment. The process of medical treatment can be considered as a sequential interaction process between doctors and patients. From this viewpoint, we have been modeling medical records using Markov decision processes (MDPs). Using our model, we can simulate the future of each patient and evaluate each treatment. In order to do so, the reward function of the MDP should be specified. However, there is no explicit information regarding the reward value in medical records. In this study we report our results of applying an inverse reinforcement learning (IRL) algorithm to medical records of diabetes treatment to explore the reward function that doctors have in mind during their treatments.

Question: What is the reward function of the medical records of diabetes treatment?


Transparent, lightweight application execution replay on commodity multiprocessor operating systems. We present Scribe, the first system to provide transparent, low-overhead application record-replay and the ability to go live from replayed execution. Scribe introduces new lightweight operating system mechanisms, rendezvous and sync points, to efficiently record nondeterministic interactions such as related system calls, signals, and shared memory accesses. Rendezvous points make a partial ordering of execution based on system call dependencies sufficient for replay, avoiding the recording overhead of maintaining an exact execution ordering. Sync points convert asynchronous interactions that can occur at arbitrary times into synchronous events that are much easier to record and replay.  We have implemented Scribe without changing, relinking, or recompiling applications, libraries, or operating system kernels, and without any specialized hardware support such as hardware performance counters. It works on commodity Linux operating systems, and commodity multi-core and multiprocessor hardware. Our results show for the first time that an operating system mechanism can correctly and transparently record and replay multi-process and multi-threaded applications on commodity multiprocessors. Scribe recording overhead is less than 2.5% for server applications including Apache and MySQL, and less than 15% for desktop applications including Firefox, Acrobat, OpenOffice, parallel kernel compilation, and movie playback.

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


An overview of gradient descent optimization algorithms. Gradient descent optimization algorithms, while increasingly popular, are often used as black-box optimizers, as practical explanations of their strengths and weaknesses are hard to come by. This article aims to provide the reader with intuitions with regard to the behaviour of different algorithms that will allow her to put them to use. In the course of this overview, we look at different variants of gradient descent, summarize challenges, introduce the most common optimization algorithms, review architectures in a parallel and distributed setting, and investigate additional strategies for optimizing gradient descent.

Question: What is gradient descent optimization?


SRILM - an extensible language modeling toolkit. SRILM is a collection of C++ libraries, executable programs, and helper scripts designed to allow both production of and experimentation with statistical language models for speech recognition and other applications. SRILM is freely available for noncommercial purposes. The toolkit supports creation and evaluation of a variety of language model types based on N-gram statistics, as well as several related tasks, such as statistical tagging and manipulation of N-best lists and word lattices. This paper summarizes the functionality of the toolkit and discusses its design and implementation, highlighting ease of rapid prototyping, reusability, and combinability of tools.

Question: What is the srilm toolkit?


Classification of Defect Clusters on Semiconductor Wafers Via the Hough Transformation. The Hough transformation employing a normal line-to-point parameterization is widely applied in digital image processing for feature detection. In this paper, we demonstrate how this same transformation can be adapted to classify defect signatures on semiconductor wafers as an aid to visual defect metrology. Given a rectilinear grid of die centers on a wafer, we demonstrate an efficient and effective procedure for classifying defect clusters composed of lines at angles of 0deg, 45deg, 90deg, and 135deg from the horizontal, as well as adjacent compositions of such lines. Included are defect clusters representing stripes, scratches at arbitrary angles, and center and edge defects. The principle advantage of the procedure over current industrial practice is that it can be fully automated to screen wafers for further engineering analysis.

Question: What is the Hough transformation?


Observing Human-Object Interactions: Using Spatial and Functional Compatibility for Recognition. Interpretation of images and videos containing humans interacting with different objects is a daunting task. It involves understanding scene or event, analyzing human movements, recognizing manipulable objects, and observing the effect of the human movement on those objects. While each of these perceptual tasks can be conducted independently, recognition rate improves when interactions between them are considered. Motivated by psychological studies of human perception, we present a Bayesian approach which integrates various perceptual tasks involved in understanding human-object interactions. Previous approaches to object and action recognition rely on static shape or appearance feature matching and motion analysis, respectively. Our approach goes beyond these traditional approaches and applies spatial and functional constraints on each of the perceptual elements for coherent semantic interpretation. Such constraints allow us to recognize objects and actions when the appearances are not discriminative enough. We also demonstrate the use of such constraints in recognition of actions from static images without using any motion information.

Question: What is the Bayesian approach?


A robust adaptive mixing control for improved forward flight of a tilt-rotor UAV. This work presents the modeling and control of a tilt-rotor UAV, with tail controlled surfaces, for path tracking with improved forward flight. The dynamic model is obtained using the Euler-Lagrange formulation considering the aerodynamic forces and torques exerted on the horizontal and vertical stabilizers, and fuselage. For control design purposes, the equations of motion are linearized around different operation points to cover a large range of forward velocity. Based on these linearized dynamic models, a mixed H2/H∞ robust controller is designed for each operation point. Therefore, an adaptive mixing scheme is used to perform an on-line smooth gain-scheduling between them. Simulation results show the control strategy efficiency when the UAV is designated to have a forward acceleration and perform a circular trajectory subject to a wind disturbance.

Question: How to design a robust adaptive mixing control for a tilt-rotor UAV?


Spatially Sparse Precoding in Millimeter Wave MIMO Systems. Millimeter wave (mmWave) signals experience orders-of-magnitude more pathloss than the microwave signals currently used in most wireless applications and all cellular systems. MmWave systems must therefore leverage large antenna arrays, made possible by the decrease in wavelength, to combat pathloss with beamforming gain. Beamforming with multiple data streams, known as precoding, can be used to further improve mmWave spectral efficiency. Both beamforming and precoding are done digitally at baseband in traditional multi-antenna systems. The high cost and power consumption of mixed-signal devices in mmWave systems, however, make analog processing in the RF domain more attractive. This hardware limitation restricts the feasible set of precoders and combiners that can be applied by practical mmWave transceivers. In this paper, we consider transmit precoding and receiver combining in mmWave systems with large antenna arrays. We exploit the spatial structure of mmWave channels to formulate the precoding/combining problem as a sparse reconstruction problem. Using the principle of basis pursuit, we develop algorithms that accurately approximate optimal unconstrained precoders and combiners such that they can be implemented in low-cost RF hardware. We present numerical results on the performance of the proposed algorithms and show that they allow mmWave systems to approach their unconstrained performance limits, even when transceiver hardware constraints are considered.

Question: What is the difference between a precoder and a combiner?


Experts ' Views on Digital Parenting Strategies. American teenagers are spending much of their time online. Online communities offer teens perspective, acceptance, connection, and education that were once more limited by geography. However, the online world also opens teens to risks. Adults must decide how to guide teen online behavior in a space that they may not understand. We interviewed 16 experts about teen online behavior, related benefits and risks, and risk mitigation methods. We found that experts agree on certain mitigation methods, especially communication and education about online behavior, but are divided over monitoring. We propose a set of possible solutions that promote online safety while preserving teens' privacy.

Question: What are the risks of online behavior?


Driving Hotzenplotz: A Hybrid Interface for Vehicle Control Aiming to Maximize Pleasure in Highway Driving. A prerequisite to foster proliferation of automated driving is common system acceptance. However, different users groups (novice, enthusiasts) decline automation, which could be, in turn, problematic for a successful market launch. We see a feasible solution in the combination of the advantages of manual (autonomy) and automated (increased safety) driving. Hence, we've developed the Hotzenplotz interface, combining possibility-driven design with psychological user needs. A simulator study (N=30) was carried-out to assess user experience with subjective criteria (Need Scale, PANAS/-X, HEMA, AttrakDiff) and quantitative measures (driving behavior, HR/HRV) in different conditions. Our results confirm that pure AD is significantly less able to satisfy user needs compared to manual driving and make people feeling bored/out of control. In contrast, the Hotzenplotz interface has proven to reduce the negative effects of AD. Our implication is that drivers should be provided with different control options to secure acceptance and avoid deskilling.

Question: How do I make people feel bored/out of control?


The building blocks of economic complexity.. For Adam Smith, wealth was related to the division of labor. As people and firms specialize in different activities, economic efficiency increases, suggesting that development is associated with an increase in the number of individual activities and with the complexity that emerges from the interactions between them. Here we develop a view of economic growth and development that gives a central role to the complexity of a country's economy by interpreting trade data as a bipartite network in which countries are connected to the products they export, and show that it is possible to quantify the complexity of a country's economy by characterizing the structure of this network. Furthermore, we show that the measures of complexity we derive are correlated with a country's level of income, and that deviations from this relationship are predictive of future growth. This suggests that countries tend to converge to the level of income dictated by the complexity of their productive structures, indicating that development efforts should focus on generating the conditions that would allow complexity to emerge to generate sustained growth and prosperity.

Question: What is the relationship between economic complexity and economic growth?


Trojan data layouts: right shoes for a running elephant. MapReduce is becoming ubiquitous in large-scale data analysis. Several recent works have shown that the performance of Hadoop MapReduce could be improved, for instance, by creating indexes in a non-invasive manner. However, they ignore the impact of the data layout used inside data blocks of Hadoop Distributed File System (HDFS). In this paper, we analyze different data layouts in detail in the context of MapReduce and argue that Row, Column, and PAX layouts can lead to poor system performance. We propose a new data layout, coined Trojan Layout, that internally organizes data blocks into attribute groups according to the workload in order to improve data access times. A salient feature of Trojan Layout is that it fully preserves the fault-tolerance properties of MapReduce. We implement our Trojan Layout idea in HDFS 0.20.3 and call the resulting system Trojan HDFS. We exploit the fact that HDFS stores multiple replicas of each data block on different computing nodes. Trojan HDFS automatically creates a different Trojan Layout per replica to better fit the workload. As a result, we are able to schedule incoming MapReduce jobs to data block replicas with the most suitable Trojan Layout. We evaluate our approach using three real-world workloads. We compare Trojan Layouts against Hadoop using Row and PAX layouts. The results demonstrate that Trojan Layout allows MapReduce jobs to read their input data up to 4.8 times faster than Row layout and up to 3.5 times faster than PAX layout.

Question: What is the difference between a Trojan and a Trojan horse?


BRAINIAC: Bringing reliable accuracy into neurally-implemented approximate computing. Applications with large amounts of data, real-time constraints, ultra-low power requirements, and heavy computational complexity present significant challenges for modern computing systems, and often fall within the category of high performance computing (HPC). As such, computer architects have looked to high performance single instruction multiple data (SIMD) architectures, such as accelerator-rich platforms, for handling these workloads. However, since the results of these applications do not always require exact precision, approximate computing may also be leveraged. In this work, we introduce BRAINIAC, a heterogeneous platform that combines precise accelerators with neural-network-based approximate accelerators. These reconfigurable accelerators are leveraged in a multi-stage flow that begins with simple approximations and resorts to more complex ones as needed. We employ high-level, application-specific light-weight checks (LWCs) to throttle this multi-stage acceleration flow and reliably ensure user-specified accuracy at runtime. Evaluation of the performance and energy of our heterogeneous platform for error tolerance thresholds of 5%-25% demonstrates an average of 3× gain over computation that only includes precise acceleration, and 15×-35× gain over software-based computation.

Question: What is a heterogeneous platform?


ntology matching with semantic verification ves. Automated Semantic Matching of Ontologies with Verification (ASMOV) is a novel algorithm that uses lexical and structural characteristics of two ontologies to iteratively calculate a similarity measure between them, derives an alignment, and then verifies it to ensure that it does not contain semantic inconsistencies. In this paper, we describe the ASMOV algorithm, and then present experimental results that measure vailable online xxx eywords: ntology ntology alignment ntology matching its accuracy using the OAEI 2008 tests, and that evaluate its use with two different thesauri: WordNet, and the Unified Medical Language System (UMLS). These results show the increased accuracy obtained by combining lexical, structural and extensional matchers with semantic verification, and demonstrate the advantage of using a domain-specific thesaurus for the alignment of specialized ontologies. © 2009 Elsevier B.V. All rights reserved.

Question: What is the difference between ontology alignment and ontology matching?


High speed network traffic analysis with commodity multi-core systems. Multi-core systems are the current dominant trend in computer processors. However, kernel network layers often do not fully exploit multi-core architectures. This is due to issues such as legacy code, resource competition of the RX-queues in network interfaces, as well as unnecessary memory copies between the OS layers. The result is that packet capture, the core operation in every network monitoring application, may even experience performance penalties when adapted to multi-core architectures. This work presents common pitfalls of network monitoring applications when used with multi-core systems, and presents solutions to these issues. We describe the design and implementation of a novel multi-core aware packet capture kernel module that enables monitoring applications to scale with the number of cores. We showcase that we can achieve high packet capture performance on modern commodity hardware.

Question: What is the difference between a multi-core aware packet capture kernel module and a multi-core aware packet capture kernel module?


Brain MRI analysis for Alzheimer's disease diagnosis using an ensemble system of deep convolutional neural networks. Alzheimer's disease is an incurable, progressive neurological brain disorder. Earlier detection of Alzheimer's disease can help with proper treatment and prevent brain tissue damage. Several statistical and machine learning models have been exploited by researchers for Alzheimer's disease diagnosis. Analyzing magnetic resonance imaging (MRI) is a common practice for Alzheimer's disease diagnosis in clinical research. Detection of Alzheimer's disease is exacting due to the similarity in Alzheimer's disease MRI data and standard healthy MRI data of older people. Recently, advanced deep learning techniques have successfully demonstrated human-level performance in numerous fields including medical image analysis. We propose a deep convolutional neural network for Alzheimer's disease diagnosis using brain MRI data analysis. While most of the existing approaches perform binary classification, our model can identify different stages of Alzheimer's disease and obtains superior performance for early-stage diagnosis. We conducted ample experiments to demonstrate that our proposed model outperformed comparative baselines on the Open Access Series of Imaging Studies dataset.

Question: What is the difference between Alzheimer's disease and normal brain MRI data?


Octree-based decimation of marching cubes surfaces. The marching cubes (MC) algorithm is a method for generating isosurfaces. It also generates an excessively large number of triangles to represent an isosurface; this increases the rendering time. This paper presents a decimation method to reduce the number of triangles generated. Decimation is carried out before creating a large number of triangles. Four major steps comprise the algorithm: surface tracking, merging, crack patching and triangulation. Surface tracking is an enhanced implementation of the MC algorithm. Starting from a seed point, the surface tracker visits only those cells likely to compose part of the desired isosurface. The cells making up the extracted surface are stored in an octree that is further processed. A bottom-up approach is taken in merging the cells containing a relatively flat approximating surface. The finer surface details are maintained. Cells are merged as long as the error due to such an operation is within a user-specified error parameter, or a cell acquires more than one connected surface component in it. A crack patching method is described that forces edges of smaller cells to lie along those of the larger neighboring cells. The overall saving in the number of triangles depends both on the specified error value and the nature of the data. Use of the hierarchical octree data structure also presents the potential of incremental representation of surfaces. We can generate a highly smoothed surface representation which can be progressively refined as the user-specified error value is decreased.

Question: How to generate a marching cubes surface?


Going deeper with convolutions. We propose a deep convolutional neural network architecture codenamed Inception that achieves the new state of the art for classification and detection in the ImageNet Large-Scale Visual Recognition Challenge 2014 (ILSVRC14). The main hallmark of this architecture is the improved utilization of the computing resources inside the network. By a carefully crafted design, we increased the depth and width of the network while keeping the computational budget constant. To optimize quality, the architectural decisions were based on the Hebbian principle and the intuition of multi-scale processing. One particular incarnation used in our submission for ILSVRC14 is called GoogLeNet, a 22 layers deep network, the quality of which is assessed in the context of classification and detection.

Question: What is the state of the art for classification and detection in the ImageNet Large-Scale Visual Recognition Challenge 2014 (ILSVRC14)?


Strong Injection Locking in Low- $Q$ LC Oscillators: Modeling and Application in a Forwarded-Clock I/O Receiver. A general model for injection-locked LC oscillators (LC-ILOs) is presented that is valid for any tank quality factor and injection strength. Important properties of an ILO such as lock-range, phase shift, bandwidth and response to input jitter are described. An LC-ILO together with a half-rate data sampler is implemented as a forwarded-clock I/O receiver in 45-nm CMOS. A strongly-injected low-Q LC oscillator enables clock deskew across 1UI and rejects high-frequency clock jitter. The complete 27 Gb/s ILO-based data receiver has an overall power efficiency of 1.6 mW/Gb/s.

Question: What is the power efficiency of the oscillator?


Selecting image pairs for SfM by introducing Jaccard similarity. We present a new approach for selecting image pairs that are more likely to match in Structure from Motion (SfM). We propose to use Jaccard Similarity (JacS) which shows how many different visual words is shared by an image pair. In our method, the similarity between images is evaluated using JacS of bag-of-visual-words in addition to tf-idf, which is popular for this purpose. To evaluate the efficiency of our method, we carry out experiments on our original datasets as well as on "Pantheon" dataset, which is derived from Flickr. The result of our method using both JacS and tf-idf is better than the results of a standard method using tf-idf only.

Question: How to select image pairs for SfM?


Dual Policy Iteration. A novel class of Approximate Policy Iteration (API) algorithms have recently demonstrated impressive practical performance (e.g., ExIt [1], AlphaGo-Zero [2]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at test time, and a slow, non-reactive policy (e.g., Tree Search), that can plan multiple steps ahead. The reactive policy is updated under supervision from the non-reactive policy, while the non-reactive policy is improved via guidance from the reactive policy. In this work we study this class of Dual Policy Iteration (DPI) strategy in an alternating optimization framework and provide a convergence analysis that extends existing API theory. We also develop a special instance of this framework which reduces the update of non-reactive policies to model-based optimal control using learned local models, and provides a theoretically sound way of unifying model-free and model-based RL approaches with unknown dynamics. We demonstrate the efficacy of our approach on various continuous control Markov Decision Processes.

Question: What is the difference between model-free and model-based reinforcement learning?


Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. This paper explores the possibility of using multiplicative random projection matrices for privacy preserving distributed data mining. It specifically considers the problem of computing statistical aggregates like the inner product matrix, correlation coefficient matrix, and Euclidean distance matrix from distributed privacy sensitive data possibly owned by multiple parties. This class of problems is directly related to many other data-mining problems such as clustering, principal component analysis, and classification. This paper makes primary contributions on two different grounds. First, it explores independent component analysis as a possible tool for breaching privacy in deterministic multiplicative perturbation-based models such as random orthogonal transformation and random rotation. Then, it proposes an approximate random projection-based technique to improve the level of privacy protection while still preserving certain statistical characteristics of the data. The paper presents extensive theoretical analysis and experimental results. Experiments demonstrate that the proposed technique is effective and can be successfully used for different types of privacy-preserving data mining applications.

Question: What is the difference between the inner product matrix and the correlation coefficient matrix?


Explaining International Migration in the Skype Network: The Role of Social Network Features. In recent years, several new ways have appeared for quantifying human migration such as location based smartphone applications and tracking user activity from websites. To show usefulness of these new approaches, we present the results of a study of cross-country migration as observed via login events in the Skype network. We explore possibility to extract human migration and correlate it with institutional statistics. The study demonstrates that a number of social network features are strongly related to net migration from and to a given country, as well as net migration between pairs of countries. Specifically, we find that percentage of international calls, percentage of international links and foreign logins in a country, complemented by gross domestic product, can be used as relatively accurate proxies for estimating migration.

Question: What is the gross domestic product of canada?


Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. The problem of nonpreemptively scheduling a set of rn partially ordered tasks on n identical processors subject to interprocessor communication delays is studied in an effort to minimize the makespan. A new heuristic, called Earliest Task First (ETF), is designed and analyzed. It is shown that the makespan wEx-generated by ETF always satisfies to Eq.. (2 1/n wopti) + C, where Wopti) is the optimal makespan without considering communication delays and C is the communication requirements over some immediate predecessor-immediate successor pairs along one chain. An algorithm is also provided to calculate C. The time complexity of Algorithm ETF is O(nm2).

Question: What is the time complexity of the algorithm?


A Prolog Framework for Integrating Business Rules into Java Applications. Business specifications – that formerly only supported IT development – increasingly become business configurations in the form of rules that can be loaded directly into IT solutions. PROLOG is well–known for its qualities in the development of sophisticated rule systems. It is desirable to combine the advantages of PROLOG with JAVA, since JAVA has become one of the most used programming languages in industry. However, experts of both programming languages are rare. To overcome the resulting interoperability problems, we have developed a framework which generates a JAVA archive that provides methods to query a given set of PROLOG rules; it ensures that valid knowledge bases are transmitted between JAVA and PROLOG. We use XML Schema for describing the format for exchanging a knowledge base between PROLOG and JAVA. From the XML Schema desciption, we scaffold JAVA classes; the JAVA programmer can use them and fill in the open slots by statements accessing other JAVA data structures. The data structure on the JAVA side reflects the complex structured knowledge base, with which the PROLOG rules work, in an object–oriented way. We can to some extend verify the correctness of the data set / knowledge base sent from JAVA to PROLOG using standard methods for XML Schema. Moreover, we can add constraints that go beyond XML. For instance, we can specify standard integrity constraints known from relational databases, such as primary key, foreign key, and not–null constraints. Since we are dealing with complex structured XML data, however, there can be far more general integrity constraints. These can be expressed by standard PROLOG rules, which can be evaluated on the PROLOG side; they could also be compiled to JAVA by available PROLOG to JAVA converters such as Prolog Cafe – since they will usually be written in a supported subset of PROLOG. We have used our framework for integrating PROLOG business rules

Question: What is the size of the canadian military?


Design and Vlsi Implementation of Anti- Collision Enabled Robot Processor Using Rfid Technology. RFID is a low power wireless emerging technology which has given rise to highly promising applications in real life. It can be employed for robot navigation. In multi-robot environment, when many robots are moving in the same workspace, there is a possibility of their physical collision with themselves as well as with physical objects. In the present work, we have proposed and developed a processor incorporating smart algorithm for avoiding such collisions with the help of RFID technology and implemented it by using VHDL. The design procedure and the simulated results are very useful in designing and implementing a practical RFID system. The RTL schematic view of the processor is achieved by successfully synthesizing the proposed design.

Question: What is the difference between RFID and RFID technology?


Know Your Body Through Intrinsic Goals. The first "object" that newborn children play with is their own body. This activity allows them to autonomously form a sensorimotor map of their own body and a repertoire of actions supporting future cognitive and motor development. Here we propose the theoretical hypothesis, operationalized as a computational model, that this acquisition of body knowledge is not guided by random motor-babbling, but rather by autonomously generated goals formed on the basis of intrinsic motivations. Motor exploration leads the agent to discover and form representations of the possible sensory events it can cause with its own actions. When the agent realizes the possibility of improving the competence to re-activate those representations, it is intrinsically motivated to select and pursue them as goals. The model is based on four components: (1) a self-organizing neural network, modulated by competence-based intrinsic motivations, that acquires abstract representations of experienced sensory (touch) changes; (2) a selector that selects the goal to pursue, and the motor resources to train to pursue it, on the basis of competence improvement; (3) an echo-state neural network that controls and learns, through goal-accomplishment and competence, the agent's motor skills; (4) a predictor of the accomplishment of the selected goals generating the competence-based intrinsic motivation signals. The model is tested as the controller of a simulated simple planar robot composed of a torso and two kinematic 3-DoF 2D arms. The robot explores its body covered by touch sensors by moving its arms. The results, which might be used to guide future empirical experiments, show how the system converges to goals and motor skills allowing it to touch the different parts of own body and how the morphology of the body affects the formed goals. The convergence is strongly dependent on competence-based intrinsic motivations affecting not only skill learning and the selec

Question: What is the difference between intrinsic and extrinsic motivation?


A Real Options Approach for the Valuation of Highway Concessions. T theory of real options offers an approach for the valuation of investments in real assets, based on the methodology developed for financial options. This approach is especially appropriate in the context of strategic decision making under conditions of uncertainty. This is the case for the valuation of highway concessions, where real options arise from certain clauses of the contracts, for example, a minimum traffic guarantee. The possible exercise of these kinds of rights means an added value for the project that cannot be easily captured using traditional procedures for investment valuation. In this paper, we develop a methodology to value these clauses of highway concessions and, for that purpose, we consider the traffic on the highway as the underlying asset in an option contract, taking into account that, when a nonfinancial asset is used, some adjustments have to be made to the options approach. This methodology is applied to the case of an already operating highway concession, using real data, and the authors obtain an estimate of the value of a minimum traffic guarantee, which depends on several parameters that are analyzed. The authors conclude that this methodology is an appropriate tool for the valuation of highway concessions that have operational flexibility.

Question: What is a minimum traffic guarantee?


IARPA Janus Benchmark-B Face Dataset. Despite the importance of rigorous testing data for evaluating face recognition algorithms, all major publicly available faces-in-the-wild datasets are constrained by the use of a commodity face detector, which limits, among other conditions, pose, occlusion, expression, and illumination variations. In 2015, the NIST IJB-A dataset, which consists of 500 subjects, was released to mitigate these constraints. However, the relatively low number of impostor and genuine matches per split in the IJB-A protocol limits the evaluation of an algorithm at operationally relevant assessment points. This paper builds upon IJB-A and introduces the IARPA Janus Benchmark-B (NIST IJB-B) dataset, a superset of IJB-A. IJB-B consists of 1,845 subjects with human-labeled ground truth face bounding boxes, eye/nose locations, and covariate metadata such as occlusion, facial hair, and skintone for 21,798 still images and 55,026 frames from 7,011 videos. IJB-B was also designed to have a more uniform geographic distribution of subjects across the globe than that of IJB-A. Test protocols for IJB-B represent operational use cases including access point identification, forensic quality media searches, surveillance video searches, and clustering. Finally, all images and videos in IJB-B are published under a Creative Commons distribution license and, therefore, can be freely distributed among the research community.

Question: What is the IARPA Janus Benchmark-B Face Dataset?


3GPP LTE Versus IEEE 802.11p/WAVE: Which Technology is Able to Support Cooperative Vehicular Safety Applications?. The concept of vehicular ad-hoc networks enables the design of emergent automotive safety applications, which are based on the awareness among vehicles. Recently, a suite of 802.11p/WAVE protocols aimed at supporting car-to-car communications was approved by IEEE. Existing cellular infrastructure and, above all 3GPP LTE, is being considered as another communication technology appropriate for vehicular applications. This letter provides a theoretical framework which compares the basic patterns of both the technologies in the context of safety-of-life vehicular scenarios. We present mathematical models for the evaluation of the considered protocols in terms of successful beacon delivery probability.

Question: Which technology is able to support cooperative vehicular safety applications?


Syntactic Simplification and Text Cohesion. Syntactic simplification is the process of reducing the grammatical complexity of a text, while retaining its information content and meaning. The aim of syntactic simplification is to make text easier to comprehend for human readers, or process by programs. In this thesis, I describe how syntactic simplification can be achieved using shallow robust analysis, a small set of hand-crafted simplification rules and a detailed analysis of the discourse-level aspects of syntactically rewriting text. I offer a treatment of relative clauses, apposition, coordination and subordination. I present novel techniques for relative clause and appositive attachment. I argue that these attachment decisions are not purely syntactic. My approaches rely on a shallow discourse model and on animacy information obtained from a lexical knowledge base. I also show how clause and appositive boundaries can be determined reliably using a decision procedure based on local context, represented by part-of-speech tags and noun chunks. I then formalise the interactions that take place between syntax and discourse during the simplification process. This is important because the usefulness of syntactic simplification in making a text accessible to a wider audience can be undermined if the rewritten text lacks cohesion. I describe how various generation issues like sentence ordering, cue-word selection, referring-expression generation, determiner choice and pronominal use can be resolved so as to preserve conjunctive and anaphoric cohesive-relations during syntactic simplification. In order to perform syntactic simplification, I have had to address various natural language processing problems, including clause and appositive identification and attachment, pronoun resolution and referring-expression generation. I evaluate my approaches to solving each problem individually, and also present a holistic evaluation of my syntactic simplification system.

Question: What is the canadian armed forces?


Comparison of Internet addicts and non-addicts in Taiwanese high school. This study investigated the difference between Internet addicts and non-addicts in Taiwanese high schools, and focused specifically on their Internet usage patterns, and gratification and communication pleasures. A total of 1708 valid data samples of high school adolescents were collected. Among this sample, 236 subjects (13.8%) were identified as addicts using the eight-item Internet addiction Diagnostic Questionnaire designed by Young [Internet addiction survey [Online]. Available: http://www.pitt.edu/_ksy/survey.htm]. The analytical results revealed that Internet addicts spent almost twice as many hours on line on average than the non-addicts. Notably, surfing with a social/entertainment motivation and gratification was positively correlated with Internet addiction. Furthermore, Internet addicts obtained markedly higher overall PIUST scores and scored higher than non-addicts on four subscales (tolerance; compulsive use and withdrawal; related problems, including family, school, health, and other problems; interpersonal and financial problems). While Internet addicts perceived the Internet to have significantly more negative influences on daily routines, school performance, teacher and parental relation than non-addicts, both Internet addicts and non-addicts viewed Internet use as enhancing peer relations. Moreover, students with personalities characterized by dependence, shyness, depression and low self-esteem had a high tendency to become addicted. 2004 Elsevier Ltd. All rights reserved.

Question: What is the difference between Internet addicts and non-addicts?


Project Adam: Building an Efficient and Scalable Deep Learning Training System. Large deep neural network models have recently demonstrated state-of-the-art accuracy on hard visual recognition tasks. Unfortunately such models are extremely time consuming to train and require large amount of compute cycles. We describe the design and implementation of a distributed system called Adam comprised of commodity server machines to train such models that exhibits world-class performance, scaling and task accuracy on visual recognition tasks. Adam achieves high efficiency and scalability through whole system co-design that optimizes and balances workload computation and communication. We exploit asynchrony throughout the system to improve performance and show that it additionally improves the accuracy of trained models. Adam is significantly more efficient and scalable than was previously thought possible and used 30x fewer machines to train a large 2 billion connection model to 2x higher accuracy in comparable time on the ImageNet 22,000 category image classification task than the system that previously held the record for this benchmark. We also show that task accuracy improves with larger models. Our results provide compelling evidence that a distributed systems-driven approach to deep learning using current training algorithms is worth pursuing.

Question: How many machines are needed to train a large deep neural network?


True Inline Cross-Coupled Coaxial Cavity Filters. In this paper, a novel true inline configuration for cross-coupled coaxial cavity filters is presented, which is characterized by a simple and compact structure, improved performance, and good tunability. Instead of using folded structures, dedicated coupling probes, or extra cavities, as required by conventional techniques, cross coupling is realized by changing the orientation of selected resonators. Sequential coupling between adjacent resonators and cross coupling between nonadjacent resonators are effectively controlled by introducing small metal plates at different locations. A six-pole bandpass filter with two transmission zeros was built and tested. The measurement and simulation results agree very well, demonstrating feasibility of the inline filter configuration. It enables compact design with improved resonator Q compared to conventional combline filters. Furthermore, cross coupling can be readily adjusted using tuning elements.

Question: What is a true inline cross-coupled coaxial cavity filter?


Classification of plant leaf images with complicated background. Keywords: Image segmentation Plant leaf Complicated background Watershed segmentation Hu geometric moments Zernike moment Moving center hypersphere (MCH) classifier a b s t r a c t Classifying plant leaves has so far been an important and difficult task, especially for leaves with complicated background where some interferents and overlapping phenomena may exist. In this paper, an efficient classification framework for leaf images with complicated background is proposed. First, a so-called automatic marker-controlled watershed segmen-tation method combined with pre-segmentation and morphological operation is introduced to segment leaf images with complicated background based on the prior shape information. Then, seven Hu geometric moments and sixteen Zernike moments are extracted as shape features from segmented binary images after leafstalk removal. In addition , a moving center hypersphere (MCH) classifier which can efficiently compress feature data is designed to address obtained mass high-dimensional shape features. Finally, experimental results on some practical plant leaves show that proposed classification framework works well while classifying leaf images with complicated background. There are twenty classes of practical plant leaves successfully classified and the average correct classification rate is up to 92.6%. Plants play the most important part in the cycle of nature. They are the primary producers that sustain all other life forms including people. This is because plants are the only organisms that can convert light energy from the sun into food. Animals, incapable of making their own food, depend directly or indirectly on plants for their supply of food. Moreover, all of the oxygen available for living organisms comes from plants. Plants are also the primary habitat for thousands of other organisms. In addition, many of the fuel people use today, such as coal, natural gas and gasoline,

Question: What is the classification of plant leaf images with complicated background?


Schedulability Analysis Using Uppaal: Herschel-Planck Case Study. We propose a modeling framework for performing schedulability analysis by using Uppaal real-time model-checker [2]. The framework is inspired by a case study where schedulability analysis of a satellite system is performed. The framework assumes a single CPU hardware where a fixed priority preemptive scheduler is used in a combination with two resource sharing protocols and in addition voluntary task suspension is considered. The contributions include the modeling framework, its application on an industrial case study and a comparison of results with classical response time analysis.

Question: How to perform schedulability analysis using Uppaal?


On the Origin of CRISPR-Cas Technology: From Prokaryotes to Mammals.. Clustered regularly-interspaced short palindromic repeat (CRISPR) sequences cooperate with CRISPR-associated (Cas) proteins to form the basis of CRISPR-Cas adaptive immune systems in prokaryotes. For more than 20 years, these systems were of interest only to specialists, mainly molecular microbiologists, who tried to understand the properties of this unique defense mechanism. In 2012, the potential of CRISPR-Cas systems was uncovered and these were presented as genome-editing tools with an outstanding capacity to trigger targeted genetic modifications that can be applied to virtually any organism. Shortly thereafter, in early 2013, these tools were shown to efficiently drive specific modification of mammalian genomes. This review attempts to summarize, in a comprehensive manner, the key events and milestones that brought CRISPR-Cas technology from prokaryotes to mammals.

Question: What is the origin of CRISPR-Cas technology?


Wrappers for Feature Subset Selection. In the feature subset selection problem, a learning algorithm is faced with the problem of selecting a relevant subset of features upon which to focus its attention, while ignoring the rest. To achieve the best possible performance with a particular learning algorithm on a particular training set, a feature subset selection method should consider how the algorithm and the training set interact. We explore the relation between optimal feature subset selection and relevance. Our wrapper method searches for an optimal feature subset tailored to a particular algorithm and a domain. We study the strengths and weaknesses of the wrapper approach and show a series of improved designs. We compare the wrapper approach to induction without feature subset selection and to Relief, a filter approach to feature subset selection. Significant improvement in accuracy is achieved for some datasets for the two families of induction algorithms used: decision trees and Naive-Bayes. @ 1997 Elsevier Science B.V.

Question: Wrappers for feature subset selection


Coagulation and ablation patterns of high-intensity focused ultrasound on a tissue-mimicking phantom and cadaveric skin. High-intensity focused ultrasound (HIFU) can be applied noninvasively to create focused zones of tissue coagulation on various skin layers. We performed a comparative study of HIFU, evaluating patterns of focused tissue coagulation and ablation upon application thereof. A tissue-mimicking (TM) phantom was prepared with bovine serum albumin and polyacrylamide hydrogel to evaluate the geometric patterns of HIFU-induced thermal injury zones (TIZs) for five different HIFU devices. Additionally, for each device, we investigated histologic patterns of HIFU-induced coagulation and ablation in serial sections of cadaveric skin of the face and neck. All HIFU devices generated remarkable TIZs in the TM phantom, with different geometric values of coagulation for each device. Most of the TIZs seemed to be separated into two or more tiny parts. In cadaveric skin, characteristic patterns of HIFU-induced ablation and coagulation were noted along the mid to lower dermis at the focal penetration depth of 3 mm and along subcutaneous fat to the superficial musculoaponeurotic system or the platysma muscle of the neck at 4.5 mm. Additionally, remarkable pre-focal areas of tissue coagulation were observed in the upper and mid dermis at the focal penetration depth of 3 mm and mid to lower dermis at 4.5 mm. For five HIFU devices, we outlined various patterns of HIFU-induced TIZ formation along pre-focal, focal, and post-focal areas of TM phantom and cadaveric skin of the face and neck.

Question: What is the difference between a tissue-mimicking phantom and a cadaveric skin?


Nasal base reduction by alar release: a laboratory evaluation.. BACKGROUND When reducing the broad nasal base, there is a limit to the amount of soft tissue that can be resected, beyond which the anatomy distorts and the nostrils become stenotic (if resection enters the nostril). Alar mobilization by freeing soft-tissue attachments helps. This study purported to examine the nature of those attachments and the extent of medialization.   METHODS The supporting tissues of the ala were sequentially divided in 16 fresh hemifacial cadavers. Key structures included the following: (1) the soft tissues and pyriform ligament of the anterior maxilla, (2) the periosteum posterior to the pyriform rim (in the bony nasal vault), and (3) the soft tissues along the horizontal pyriform rim. After release of each tethering region, the ala-pyriform distance was measured.   RESULTS After releasing the anterior maxillary periosteum and pyriform ligament along the vertical pyriform rim, the ala-pyriform distance was reduced by a mean of 1.9 mm. After releasing the periosteum posterior to the pyriform rim (in the nasal vault), it was reduced by a mean of 1.7 mm. Releasing the soft tissues (which were thick medially) of the horizontal pyriform rim reduced the mean distance 1.0 mm for a total of 4.6 mm. Medialization resulting from anterior and posterior releases was significantly greater than that from the horizontal pyriform rim (p < 0.0006 and p < 0.015, respectively), but they were not significantly different from one another.   CONCLUSIONS This cadaver study confirmed the role of the stabilizing effect of the pyriform ligament and the periosteum lateral and posterior to the pyriform rim. The total release was substantial, suggesting a clinical means of achieving tension-free alar medialization.

Question: How much can the nose be reduced?


Agile distributed software development: enacting control through media and context. While face-to-face interaction is fundamental in agile software development, distributed environments must rely extensively on mediated interactions. Practicing agile principles in distributed environments therefore poses particular control challenges related to balancing fixed vs. evolving quality requirements and people vs. process-based collaboration. To investigate these challenges, we conducted an in-depth case study of a successful agile distributed software project with participants from a Russian firm and a Danish firm. Applying Kirsch's elements of control framework, we offer an analysis of how control was enacted through the project context and in the participants' mediated communication. The analysis reveals that formal measurement and evaluation control were persistently enacted through mediated communication. These formal control practices were, however, predominantly carried out in conjunction with informal roles and relationships such as clan-like control inherent in agile development. Overall, the study demonstrates that, if appropriately applied, communication technologies can significantly support distributed, agile practices by allowing concurrent enactment of both formal and informal controls. The paper discusses these findings as they relate to previous research and concludes with their implications for future research.

Question: How can we enact control in agile distributed software development?


Automatic Access Control Based on Face and Hand Biometrics in a Non-cooperative Context. Automatic access control systems (ACS) based on the human biometrics or physical tokens are widely employed in public and private areas. Yet these systems, in their conventional forms, are restricted to active interaction from the users. In scenarios where users are not cooperating with the system, these systems are challenged. Failure in cooperation with the biometric systems might be intentional or because the users are incapable of handling the interaction procedure with the biometric system or simply forget to cooperate with it, due to for example, illness like dementia. This work introduces a challenging bimodal database, including face and hand information of the users when they approach a door to open it by its handle in a noncooperative context. We have defined two (an easy and a challenging) protocols on how to use the database. We have reported results on many baseline methods, including deep learning techniques as well as conventional methods on the database. The obtained results show the merit of the proposed database and the challenging nature of access control with non-cooperative users.

Question: How to use a database of face and hand biometrics of non-cooperative users?


Learning Probabilistic Models of Link Structure. Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning methods work with "flat" data representations, forcing us to convert our data into a form that loses much of the link structure. The recently introduced framework of probabilistic relational models(PRMs) embraces the object-relational nature of structured data by capturing probabilistic interactions between attributes of related entities. In this paper, we extend this framework by modeling interactions between the attributes and the link structure itself. An advantage of our approach is a unified generative model for both content and relational structure. We propose two mechanisms for representing a probabilistic distribution over link structures: reference uncertaintyandexistence uncertainty . We describe the appropriate conditions for using each model and present learning algorithms for each. We present experimental results showing that the learned models can be used to predict link structure and, moreover, the observed link structure can be used to provide better predictions for the attributes in the model.

Question: What is the difference between a probabilistic relational model and a probabilistic relational model?


Wavelet analysis of EEG for seizure detection: Coherence and phasesynchrony estimation.. This paper deals with the wavelet analysis method f or seizure detection in EEG time series and coherence estimation. The main part of the paper pr esents the basic principles of signal decomposition in connection with the EEG frequency ba nds. Wavelet analysis method has been used for detection of seizure onset. The wavelet fi ltered signal is used for the computation of spectral power ratio. The results show that our met hod can identify pre seizure, seizure, post seizure and non seizure phases. When dealing with s eizure detection and prediction problems it is important to identify seizure precursor dynamics and necessary to identify information about onset and spread of seizures. Therefore in th e second part the coherence and phase synchrony during pre seizure, seizure, post seizure an d non seizure are computed. We expect this method to provide more insight into dynamic aspects of the seizure generating process.

Question: What is the wavelet analysis method for seizure detection?


A New High-Efficiency Single-Phase Transformerless PV Inverter Topology. There is a strong trend in the photovoltaic inverter technology to use transformerless topologies in order to acquire higher efficiencies combining with very low ground leakage current. In this paper, a new topology, based on the H-bridge with a new ac bypass circuit consisting of a diode rectifier and a switch with clamping to the dc midpoint, is proposed. The topology is simulated and experimentally validated, and a comparison with other existing topologies is performed. High conversion efficiency and low leakage current are demonstrated.

Question: What is the topology of a photovoltaic inverter?


A Simple Model for Intrinsic Image Decomposition with Depth Cues. We present a model for intrinsic decomposition of RGB-D images. Our approach analyzes a single RGB-D image and estimates albedo and shading fields that explain the input. To disambiguate the problem, our model estimates a number of components that jointly account for the reconstructed shading. By decomposing the shading field, we can build in assumptions about image formation that help distinguish reflectance variation from shading. These assumptions are expressed as simple nonlocal regularizers. We evaluate the model on real-world images and on a challenging synthetic dataset. The experimental results demonstrate that the presented approach outperforms prior models for intrinsic decomposition of RGB-D images.

Question: What is the name of the model?


Multi-Bias Non-linear Activation in Deep Neural Networks. As a widely used non-linear activation, Rectified Linear Unit (ReLU) separates noise and signal in a feature map by learning a threshold or bias. However, we argue that the classification of noise and signal not only depends on the magnitude of responses, but also the context of how the feature responses would be used to detect more abstract patterns in higher layers. In order to output multiple response maps with magnitude in different ranges for a particular visual pattern, existing networks employing ReLU and its variants have to learn a large number of redundant filters. In this paper, we propose a multi-bias non-linear activation (MBA) layer to explore the information hidden in the magnitudes of responses. It is placed after the convolution layer to decouple the responses to a convolution kernel into multiple maps by multi-thresholding magnitudes, thus generating more patterns in the feature space at a low computational cost. It provides great flexibility of selecting responses to different visual patterns in different magnitude ranges to form rich representations in higher layers. Such a simple and yet effective scheme achieves the stateof-the-art performance on several benchmarks.

Question: What is the state of the art in deep neural networks?


From "classic" child abuse and neglect to the new era of maltreatment. The evolution of the concept of child abuse leads to consider new types of maltreatment that in the future will certainly be taken into account with a new era of social pediatrics.Pediatric care has been based on the increased awareness of the importance of meeting the psychosocial and developmental needs of children and of the role of families in promoting the health.

Question: What is the new era of social pediatrics?


Violent Crime Rate Studies in Philosophical Context : A Destructive Testing Approach to Heat and Southern Culture ofViolence Effects. The logic behind the translation of conceptual hypotheses into testable propositions was illustrated with the heat hypothesis, The destructive testing philosophy was introduced and applied, This consists of first showing that a predicted empirical relation exists, then attempting to break that relation. by adding competitor variables. The key question in destructive testing is "How difficult was it to break the relation?'~ This approach was used to analyze the heat effect on violent crime rates (Study I ) and on White violent crime arrest rates (Study 2) in U.S. cities. One competitor variable was the particular focus of analysis: southern culture of violence. The heat hypothesis was supported by highly significant correlations between the warmth of a city and its violence rate. This heat effect survived multiple destructive tests. Some support for the southern culture effect was also found, but this effect was more easily broken.

Question: How difficult was it to break the relation?


Neural Sequence Learning Models for Word Sense Disambiguation. Word Sense Disambiguation models exist in many flavors. Even though supervised ones tend to perform best in terms of accuracy, they often lose ground to more flexible knowledge-based solutions, which do not require training by a word expert for every disambiguation target. To bridge this gap we adopt a different perspective and rely on sequence learning to frame the disambiguation problem: we propose and study in depth a series of end-to-end neural architectures directly tailored to the task, from bidirectional Long Short-Term Memory to encoder-decoder models. Our extensive evaluation over standard benchmarks and in multiple languages shows that sequence learning enables more versatile all-words models that consistently lead to state-of-the-art results, even against word experts with engineered features.

Question: What is the difference between supervised and unsupervised word sense disambiguation?


Challenges in automotive software engineering. The amount of software in cars grows exponentially. Driving forces of this development are cheaper and more powerful hardware and the demand for innovations by new functions. The rapid increase of software and software based functionality brings various challenges (see [21], [23], [25], [26]) for the automotive industries, for their organization, key competencies, processes, methods, tools, models, product structures, division of work, logistics, maintenance, and long term strategies. From a software engineering perspective, the automotive industry is an ideal and fascinating application domain for advanced techniques. Although the automotive industry may adopt general results and solutions from the software engineering body of knowledge gained in other domains, the specific constraints and domain specific requirements in the automotive industry ask for individual solutions and bring various challenges for automotive software engineering. In cars we find literally all interesting problems and challenging issues of software and systems engineering.

Question: What are the challenges in automotive software engineering?


Improved Style Transfer by Respecting Inter-layer Correlations. A popular series of style transfer methods apply a style to a content image by controlling mean and covariance of values in early layers of a feature stack. This is insufficient for transferring styles that have strong structure across spatial scales like, e.g., textures where dots lie on long curves. This paper demonstrates that controlling inter-layer correlations yields visible improvements in style transfer methods. We achieve this control by computing cross-layer, rather than within-layer, gram matrices. We find that (a) cross-layer gram matrices are sufficient to control within-layer statistics. Inter-layer correlations improves style transfer and texture synthesis. The paper shows numerous examples on "hard" real style transfer problems (e.g. long scale and hierarchical patterns); (b) a fast approximate style transfer method can control cross-layer gram matrices; (c) we demonstrate that multiplicative, rather than additive style and content loss, results in very good style transfer. Multiplicative loss produces a visible emphasis on boundaries, and means that one hyper-parameter can be eliminated. 1 ar X iv :1 80 1. 01 93 3v 1 [ cs .C V ] 5 J an 2 01 8

Question: How to control inter-layer correlations?


Parental vaccine safety concerns in 2009.. OBJECTIVE Vaccine safety concerns can diminish parents' willingness to vaccinate their children. The objective of this study was to characterize the current prevalence of parental vaccine refusal and specific vaccine safety concerns and to determine whether such concerns were more common in specific population groups.   METHODS In January 2009, as part of a larger study of parents and nonparents, 2521 online surveys were sent to a nationally representative sample of parents of children who were aged </=17 years. The main outcome measures were parental opinions on vaccine safety and whether the parent had ever refused a vaccine that a doctor recommended for his or her child.   RESULTS The response rate was 62%. Most parents agreed that vaccines protect their child(ren) from diseases; however, more than half of the respondents also expressed concerns regarding serious adverse effects. Overall, 11.5% of the parents had refused at least 1 recommended vaccine. Women were more likely to be concerned about serious adverse effects, to believe that some vaccines cause autism, and to have ever refused a vaccine for their child(ren). Hispanic parents were more likely than white or black parents to report that they generally follow their doctor's recommendations about vaccines for their children and less likely to have ever refused a vaccine. Hispanic parents were also more likely to be concerned about serious adverse effects of vaccines and to believe that some vaccines cause autism.   CONCLUSIONS Although parents overwhelmingly share the belief that vaccines are a good way to protect their children from disease, these same parents express concerns regarding the potential adverse effects and especially seem to question the safety of newer vaccines. Although information is available to address many vaccine safety concerns, such information is not reaching many parents in an effective or convincing manner.

Question: What are the most common vaccine safety concerns?


Data mining a diabetic data warehouse. Diabetes is a major health problem in the United States. There is a long history of diabetic registries and databases with systematically collected patient information. We examine one such diabetic data warehouse, showing a method of applying data mining techniques, and some of the data issues, analysis problems, and results. The diabetic data warehouse is from a large integrated health care system in the New Orleans area with 30,383 diabetic patients. Methods for translating a complex relational database with time series and sequencing information to a flat file suitable for data mining are challenging. We discuss two variables in detail, a comorbidity index and the HgbA1c, a measure of glycemic control related to outcomes. We used the classification tree approach in Classification and Regression Trees (CART) with a binary target variable of HgbA1c >9.5 and 10 predictors: age, sex, emergency department visits, office visits, comorbidity index, dyslipidemia, hypertension, cardiovascular disease, retinopathy, end-stage renal disease. Unexpectedly, the most important variable associated with bad glycemic control is younger age, not the comorbiditity index or whether patients have related diseases. If we want to target diabetics with bad HgbA1c values, the odds of finding them is 3.2 times as high in those <65 years of age than those older. Data mining can discover novel associations that are useful to clinicians and administrators [corrected].

Question: What is the most important variable associated with bad glycemic control?


A sock puppet detection algorithm on virtual spaces. On virtual spaces, some individuals use multiple usernames or copycat/forge other users (usually called ''sock puppet'') to communicate with others. Those sock puppets are fake identities through which members of Internet community praise or create the illusion of support for the product or one's work, pretending to be a different person. A fundamental problem is how to identify these sock puppets. In this paper, we propose a sock puppet detection algorithm which combines authorship-identification techniques and link analysis. Firstly, we propose an interesting social network model in which links between two IDs are built if they have similar attitudes to most topics that both of them participate in; then, the edges are pruned according a hypothesis test, which consider the impact of their writing styles; finally, the link-based community detection for pruned network is performed. Compared to traditional methods, our approach has three advantages: (1) it conforms to the practical meanings of sock puppet community; (2) it can be applied in online situation; (3) it increases the efficiency of link analysis. In the experimental work, we evaluate our method using real datasets and compared our approach with several previous methods; the results have proved above advantages. 2012 Elsevier B.V. All rights reserved.

Question: How to detect sock puppets?


Developing an intelligent data discriminating system of anti-money laundering based on SVM. Statistical learning theory (SLT) is introduced to improve the embarrassments of anti-money laundering (AML) intelligence collection. A set of unusual behavior detection algorithm is presented in this paper based on support vector machine (SVM) in order to take the place of traditional predefined-rule suspicious transaction data filtering system. It could efficiently surmount the worst forms of suspicious data analyzing and reporting mechanism among bank branches including enormous data volume, dimensionality disorder with massive variances and feature overload.

Question: What is SVM?


Person Re-identification by Discriminatively Selecting Parts and Features. This paper presents a novel appearance-based method for person re-identification. The core idea is to rank and select different body parts on the basis of the discriminating power of their characteristic features. In our approach, we first segment the pedestrian images into meaningful parts, then we extract features from such parts as well as from the whole body and finally, we perform a salience analysis based on regression coefficients. Given a set of individuals, our method is able to estimate the different importance (or salience) of each body part automatically. To prove the effectiveness of our approach, we considered two standard datasets and we demonstrated through an exhaustive experimental section how our method improves significantly upon existing approaches, especially in multiple-shot scenarios.

Question: How to re-identify a person?


Unsupervised Concept Categorization and Extraction from Scientific Document Titles. This paper studies the automated categorization and extraction of scientific concepts from titles of scientific articles, in order to gain a deeper understanding of their key contributions and facilitate the construction of a generic academic knowledgebase. Towards this goal, we propose an unsupervised, domain-independent, and scalable two-phase algorithm to type and extract key concept mentions into aspects of interest (e.g., Techniques, Applications, etc.). In the first phase of our algorithm we proposePhraseType, a probabilistic generative model which exploits textual features and limited POS tags to broadly segment text snippets into aspect-typed phrases. We extend this model to simultaneously learn aspect-specific features and identify academic domains in multi-domain corpora, since the two tasks mutually enhance each other. In the second phase, we propose an approach based on adaptor grammars to extract fine grained concept mentions from the aspect-typed phrases without the need for any external resources or human effort, in a purely data-driven manner. We apply our technique to study literature from diverse scientific domains and show significant gains over state-of-the-art concept extraction techniques. We also present a qualitative analysis of the results obtained.

Question: What is the difference between a generative model and an adaptor grammar?


Scalable Iterative Classification for Sanitizing Large-Scale Datasets. Cheap ubiquitous computing enables the collection of massive amounts of personal data in a wide variety of domains. Many organizations aim to share such data while obscuring features that could disclose personally identifiable information. Much of this data exhibits weak structure (e.g., text), such that machine learning approaches have been developed to detect and remove identifiers from it. While learning is never perfect, and relying on such approaches to sanitize data can leak sensitive information, a small risk is often acceptable. Our goal is to balance the value of published data and the risk of an adversary discovering leaked identifiers. We model data sanitization as a game between 1) a publisher who chooses a set of classifiers to apply to data and publishes only instances predicted as non-sensitive and 2) an attacker who combines machine learning and manual inspection to uncover leaked identifying information. We introduce a fast iterative greedy algorithm for the publisher that ensures a low utility for a resource-limited adversary. Moreover, using five text data sets we illustrate that our algorithm leaves virtually no automatically identifiable sensitive instances for a state-of-the-art learning algorithm, while sharing over 93 percent of the original data, and completes after at most five iterations.

Question: What is the name of the algorithm?


Design of Organic TFT Pixel Electrode Circuit for Active-Matrix OLED Displays. A new current-programming pixel circuit for active-matrix organic light-emitting diode (AM-OLED) displays, composed of four organic thin-film transistors (OTFTs) and one capacitor, has been designed, simulated and evaluated. The most critical issue in realizing AMOLED displays with OTFTs is the variation and aging of the driving-TFTs and degradation of OLEDs. This can cause image sticking or degradation of image quality. These problems require compensation methods for high-quality display applications, and pixel level approach is considered to be one of the most important factors for improving display image quality. Our design shows that the current OLED and OTFT technology can be implemented for AMOLED displays, compensating the degradation of OTFT device characteristics.

Question: What is the difference between a pixel circuit and a display?


A systematic review and comparative analysis of cross-document coreference resolution methods and tools. Information extraction (IE) is the task of automatically extracting structured information from unstructured/semi-structured machine-readable documents. Among various IE tasks, extracting actionable intelligence from an ever-increasing amount of data depends critically upon cross-document coreference resolution (CDCR) - the task of identifying entity mentions across information sources that refer to the same underlying entity. CDCR is the basis of knowledge acquisition and is at the heart of Web search, recommendations, and analytics. Real time processing of CDCR processes is very important and have various applications in discovering must-know information in real-time for clients in finance, public sector, news, and crisis management. Being an emerging area of research and practice, the reported literature on CDCR challenges and solutions is growing fast but is scattered due to the large space, various applications, and large datasets of the order of peta-/tera-bytes. In order to fill this gap, we provide a systematic review of the state of the art of challenges and solutions for a CDCR process. We identify a set of quality attributes, that have been frequently reported in the context of CDCR processes, to be used as a guide to identify important and outstanding issues for further investigations. Finally, we assess existing tools and techniques for CDCR subtasks and provide guidance on selection of tools and algorithms.

Question: What is a systematic review?


Beyond Linguistic Equivalence. An Empirical Study of Translation Evaluation in a Translation Learner Corpus. The realisation that fully automatic translation in many settings is still far from producing output that is equal or superior to human translation has lead to an intense interest in translation evaluation in the MT community. However, research in this field, by now, has not only largely ignored the tremendous amount of relevant knowledge available in a closely related discipline, namely translation studies, but also failed to provide a deeper understanding of the nature of "translation errors" and "translation quality". This paper presents an empirical take on the latter concept, translation quality, by comparing human and automatic evaluations of learner translations in the KOPTE corpus. We will show that translation studies provide sophisticated concepts for translation quality estimation and error annotation. Moreover, by applying well-established MT evaluation scores, namely BLEU and Meteor, to KOPTE learner translations that were graded by a human expert, we hope to shed light on properties (and potential shortcomings) of these scores. 1 Translation quality assessment In recent years, researchers in the field of MT evaluation have proposed a large variety of methods for assessing the quality of automatically produced translations. Approaches range from fully automatic quality scoring to efforts aimed at the development of "human" evaluation scores that try to exploit the (often tacit) linguistic knowledge of human evaluators. The criteria according to which quality is estimated often include adequacy, the degree of meaning preservation, and fluency, target language correctness (Callison-Burch et al., 2007). The goals of both "human" evaluation and fully automatic quality scoring are manifold and cover system optimisation as well as benchmarking and comparison. In translation studies, the scientific (and prescientific) discussion on how to assess the qua

Question: What is the difference between translation quality and translation error?


User needs for location-aware mobile services. Mobile contexts of use vary a lot, and may even be continuously changing during use. The context is much more than location, but its other elements are still difficult to identify or measure. Location information is becoming an integral part of different mobile devices. Current mobile services can be enhanced with location-aware features, thus providing the user with a smooth transition towards context-aware services. Potential application fields can be found in areas such as travel information, shopping, entertainment, event information and different mobile professions. This paper studies location-aware mobile services from the user's point of view. The paper draws conclusions about key issues related to user needs, based on user interviews, laboratory and field evaluations with users, and expert evaluations of location-aware services. The user needs are presented under five main themes: topical and comprehensive contents, smooth user interaction, personal and user-generated contents, seamless service entities and privacy issues.

Question: What are the user needs for location-aware mobile services?


On-road vehicle detection: a review. Developing on-board automotive driver assistance systems aiming to alert drivers about driving environments, and possible collision with other vehicles has attracted a lot of attention lately. In these systems, robust and reliable vehicle detection is a critical step. This paper presents a review of recent vision-based on-road vehicle detection systems. Our focus is on systems where the camera is mounted on the vehicle rather than being fixed such as in traffic/driveway monitoring systems. First, we discuss the problem of on-road vehicle detection using optical sensors followed by a brief review of intelligent vehicle research worldwide. Then, we discuss active and passive sensors to set the stage for vision-based vehicle detection. Methods aiming to quickly hypothesize the location of vehicles in an image as well as to verify the hypothesized locations are reviewed next. Integrating detection with tracking is also reviewed to illustrate the benefits of exploiting temporal continuity for vehicle detection. Finally, we present a critical overview of the methods discussed, we assess their potential for future deployment, and we present directions for future research.

Question: What is the size of the canadian military?


The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication. Bitcoin cryptocurrency demonstrated the utility of global consensus across thousands of nodes, changing the world of digital transactions forever. In the early days of Bitcoin, the performance of its probabilistic proof-of-work (PoW) based consensus fabric, also known as blockchain, was not a major issue. Bitcoin became a success story, despite its consensus latencies on the order of an hour and the theoretical peak throughput of only up to 7 transactions per second. The situation today is radically different and the poor performance scalability of early PoW blockchains no longer makes sense. Specifically, the trend of modern cryptocurrency platforms, such as Ethereum, is to support execution of arbitrary distributed applications on blockchain fabric, needing much better performance. This approach, however, makes cryptocurrency platforms step away from their original purpose and enter the domain of database-replication protocols, notably, the classical state-machine replication, and in particular its Byzantine fault-tolerant (BFT) variants. In this paper, we contrast PoW-based blockchains to those based on BFT state machine replication, focusing on their scalability limits. We also discuss recent proposals to overcoming these scalability limits and outline key outstanding open problems in the quest for the "ultimate" blockchain fabric(s).

Question: What is the difference between PoW and BFT?