Building fast and compact convolutional neural networks for offline handwritten Chinese character recognition. Like other problems in computer vision, offline handwritten Chinese character recognition (HCCR) has achieved impressive results using convolutional neural network (CNN)-based methods. However, larger and deeper networks are needed to deliver state-of-the-art results in this domain. Such networks intuitively appear to incur high computational cost, and require the storage of a large number of parameters, which render them unfeasible for deployment in portable devices. To solve this problem, we propose a Global Supervised Low-rank Expansion (GSLRE) method and an Adaptive Drop-weight (ADW) technique to solve the problems of speed and storage capacity. We design a nine-layer CNN for HCCR consisting of 3,755 classes, and devise an algorithm that can reduce the network's computational cost by nine times and compress the network to 1/18 of the original size of the baseline model, with only a 0.21% drop in accuracy. In tests, the proposed algorithm can still surpass the best single-network performance reported thus far in the literature while requiring only 2.3 MB for storage. Furthermore, when integrated with our effective forward implementation, the recognition of an offline character image takes only 9.7 ms on a CPU. Compared with the state-of-the-art CNN model for HCCR, ∗Corresponding author Email addresses: xiaoxuefengchina@gmail.com (Xuefeng Xiao), lianwen.jin@gmail.com (Lianwen Jin) Preprint submitted to Pattern Recognition June 30, 2017

Question: How to build a convolutional neural network for offline handwritten Chinese character recognition?


Similarity estimation techniques from rounding algorithms. (MATH) A locality sensitive hashing scheme is a distribution on a family $\F$ of hash functions operating on a collection of objects, such that for two objects x,y, PrhεF[h(x) = h(y)] = sim(x,y), where sim(x,y) ε [0,1] is some similarity function defined on the collection of objects. Such a scheme leads to a compact representation of objects so that similarity of objects can be estimated from their compact sketches, and also leads to efficient algorithms for approximate nearest neighbor search and clustering. Min-wise independent permutations provide an elegant construction of such a locality sensitive hashing scheme for a collection of subsets with the set similarity measure sim(A,B) = \frac{|A &Pgr; B|}{|A &Pgr B|}.(MATH) We show that rounding algorithms for LPs and SDPs used in the context of approximation algorithms can be viewed as locality sensitive hashing schemes for several interesting collections of objects. Based on this insight, we construct new locality sensitive hashing schemes for:

A collection of vectors with the distance between → \over u and → \over v measured by Ø(→ \over u, → \over v)/π, where Ø(→ \over u, → \over v) is the angle between → \over u) and → \over v). This yields a sketching scheme for estimating the cosine similarity measure between two vectors, as well as a simple alternative to minwise independent permutations for estimating set similarity.

A collection of distributions on n points in a metric space, with distance between distributions measured by the Earth Mover Distance (EMD), (a popular distance measure in graphics and vision). Our hash functions map distributions to points in the metric space such that, for distributions P and Q, EMD(P,Q) &xie; Ehε\F</s

Question: What is the earth mover distance?


Top-Down Induction of First-Order Logical Decision Trees.

Question: What is the top-down induction of first-order logical decision trees?


Query Optimization Techniques In Graph Databases. Graph databases (GDB) have recently been arisen to overcome the limits of traditional databases for storing and managing data with graph-like structure. Today, they represent a requirementfor many applications that manage graph-like data,like social networks.Most of the techniques, applied to optimize queries in graph databases, have been used in traditional databases, distribution systems,... or they are inspired from graph theory. However, their reuse in graph databases should take care of the main characteristics of graph databases, such as dynamic structure, highly interconnected data, and ability to efficiently access data relationships. In this paper, we survey the query optimization techniques in graph databases. In particular,we focus on the features they have introduced to improve querying graph-like data.

Question: What are the main features of graph databases?


Latent factor models with additive and hierarchically-smoothed user preferences. Items in recommender systems are usually associated with annotated attributes: for e.g., brand and price for products; agency for news articles, etc. Such attributes are highly informative and must be exploited for accurate recommendation. While learning a user preference model over these attributes can result in an interpretable recommender system and can hands the cold start problem, it suffers from two major drawbacks: data sparsity and the inability to model random effects. On the other hand, latent-factor collaborative filtering models have shown great promise in recommender systems; however, its performance on rare items is poor. In this paper we propose a novel model LFUM, which provides the advantages of both of the above models. We learn user preferences (over the attributes) using a personalized Bayesian hierarchical model that uses a combination(additive model) of a globally learned preference model along with user-specific preferences. To combat data-sparsity, we smooth these preferences over the item-taxonomy using an efficient forward-filtering and backward-smoothing inference algorithm. Our inference algorithms can handle both discrete attributes (e.g., item brands) and continuous attributes (e.g., item prices). We combine the user preferences with the latent-factor models and train the resulting collaborative filtering system end-to-end using the successful BPR ranking algorithm. In our extensive experimental analysis, we show that our proposed model outperforms several commonly used baselines and we carry out an ablation study showing the benefits of each component of our model.

Question: What is the difference between latent factor models and latent factor models with additive and hierarchically-smoothed user preferences?


A Boosted Bayesian Multiresolution Classifier for Prostate Cancer Detection From Digitized Needle Biopsies. Diagnosis of prostate cancer (CaP) currently involves examining tissue samples for CaP presence and extent via a microscope, a time-consuming and subjective process. With the advent of digital pathology, computer-aided algorithms can now be applied to disease detection on digitized glass slides. The size of these digitized histology images (hundreds of millions of pixels) presents a formidable challenge for any computerized image analysis program. In this paper, we present a boosted Bayesian multiresolution (BBMR) system to identify regions of CaP on digital biopsy slides. Such a system would serve as an important preceding step to a Gleason grading algorithm, where the objective would be to score the invasiveness and severity of the disease. In the first step, our algorithm decomposes the whole-slide image into an image pyramid comprising multiple resolution levels. Regions identified as cancer via a Bayesian classifier at lower resolution levels are subsequently examined in greater detail at higher resolution levels, thereby allowing for rapid and efficient analysis of large images. At each resolution level, ten image features are chosen from a pool of over 900 first-order statistical, second-order co-occurrence, and Gabor filter features using an AdaBoost ensemble method. The BBMR scheme, operating on 100 images obtained from 58 patients, yielded: 1) areas under the receiver operating characteristic curve (AUC) of 0.84, 0.83, and 0.76, respectively, at the lowest, intermediate, and highest resolution levels and 2) an eightfold savings in terms of computational time compared to running the algorithm directly at full (highest) resolution. The BBMR model outperformed (in terms of AUC): 1) individual features (no ensemble) and 2) a random forest classifier ensemble obtained by bagging multiple decision tree classifiers. The apparent drop-off in AUC at higher im

Question: What is the difference between a Bayesian classifier and a random forest classifier?


The Language of Deceivers: Linguistic Features of Crowdfunding Scams. Crowdfunding sites with recent explosive growth are equally attractive platforms for swindlers or scammers. Though the growing number of articles on crowdfunding scams indicate that the fraud threats are accelerating, there has been little knowledge on the scamming practices and patterns. The key contribution of this research is to discover the hidden clues in the text by exploring linguistic features to distinguish scam campaigns from non-scams. Our results indicate that by providing less information and writing more carefully (and less informally), scammers deliberately try to deceive people; (i) they use less number of words, verbs, and sentences in their campaign pages. (ii) scammers make less typographical errors, 4.5-4.7 times lower than non-scammers.(iii) Expressivity of scams is 2.6-8.5 times lower as well.

Question: What is the difference between a scam and a non-scam?


Ternary CAM Power and Delay Model: Extensions and Uses. Applications in computer networks often require high throughput access to large data structures for lookup and classification. While advanced algorithms exist to speed these search primitives on network processors and even custom application-specific integrated circuits (ASICs), achieving tight bounds on worst case performance with standard memories often requires a very careful analysis of all possible access patterns. An alternative, and often times more simple solution, is possible if a ternary CAM (TCAM) is used to perform a fully parallel search across the entire data set. Unfortunately, this parallelism means that large portions of the chip are switching during each cycle, causing large amounts of power to be consumed. While researchers at all levels of design (from algorithms to circuits) have begun to explore new ways of managing the power consumption, quantifying design alternatives is difficult due to a lack of available models. In this paper, we examine the structure of a modern TCAM and present a simple, yet accurate, power and delay model. We present techniques to estimate the dynamic power consumption and leakage power of a TCAM structure and validate the model using a combination of industrial TCAM datasheets and prior published works. Such a model is a critical first step in bridging the intellectual divide between circuit-level and algorithm-level optimizations. To demonstrate the utility of our model, we present an extensive analysis of the model by varying various architectural parameters and describe how our model can be easily extended to handle several circuit optimizations in the TCAM structure. In addition, we present a comparative study of SRAM and TCAM energy consumption to directly quantify the many design options which will be very useful for network designers to explore various power management schemes.

Question: What is the power consumption of a ternary CAM?


ESPRIT-estimation of signal parameters via rotational invariance techniques. High-resolution signal parameter estimation is a problem of significance in many signal processing applications. Such applications include direction-of-arrival (DOA) estimation, system identification, and time series analysis. A novel approach to the general problem of signal parameter estimation is described. Although discussed in the context of direction-of-arrival estimation, ESPRIT can be applied to a wide variety of problems including accurate detection and estimation of sinusoids in noise. It exploits an underlying rotational invariance among signal subspaces induced by an array of sensors with a translational invariance structure. The technique, when applicable, manifests significant performance and computational advantages over previous algorithms such as MEM, Capon's MLM, and MUSIC.

Question: What is the difference between ESPRIT and MUSIC?


WAVES: A Wearable Asymmetric Vibration Excitation System for Presenting Three-Dimensional Translation and Rotation Cues. WAVES, a Wearable Asymmetric Vibration Excitation System, is a novel wearable haptic device for presenting three dimensions of translation and rotation guidance cues. In contrast to traditional vibration feedback, which usually requires that users learn to interpret a binary cue, asymmetric vibrations have been shown to induce a pulling sensation in a desired direction. When attached to the fingers, a single voicecoil actuator presents a translation guidance cue and a pair of voicecoil actuators presents a rotation guidance cue. The directionality of mechanoreceptors in the skin led to our choice of the location and orientation of the actuators in order to elicit very strong sensations in certain directions. For example, users distinguished a "left" cue versus a "right" cue 94.5% of the time. When presented with one of six possible direction cues, users on average correctly identified the direction of translation cues 86.1% of the time and rotation cues 69.0% of the time.

Question: What is the name of the wearable haptic device?


Containers and Virtual Machines at Scale: A Comparative Study. Virtualization is used in data center and cloud environments to decouple applications from the hardware they run on. Hardware virtualization and operating system level virtualization are two prominent technologies that enable this. Containers, which use OS virtualization, have recently surged in interest and deployment. In this paper, we study the differences between the two virtualization technologies. We compare containers and virtual machines in large data center environments along the dimensions of performance, manageability and software development.  We evaluate the performance differences caused by the different virtualization technologies in data center environments where multiple applications are running on the same servers (multi-tenancy). Our results show that co-located applications can cause performance interference, and the degree of interference is higher in the case of containers for certain types of workloads. We also evaluate differences in the management frameworks which control deployment and orchestration of containers and VMs. We show how the different capabilities exposed by the two virtualization technologies can affect the management and development of applications. Lastly, we evaluate novel approaches which combine hardware and OS virtualization.

Question: What is the difference between containers and virtual machines?


SASI: a generic texture descriptor for image retrieval. In this paper, a generic texture descriptor, namely, Statistical Analysis of Structural Information (SASI) is introduced as a representation of texture. SASI is based on statistics of clique autocorrelation coefficients, calculated over structuring windows. SASI defines a set of clique windows to extract and measure various structural properties of texture by using a spatial multi-resolution method. Experimental results, performed on various image databases, indicate that SASI is more successful then the Gabor Filter descriptors in capturing small granularities and discontinuities such as sharp corners and abrupt changes. Due to the flexibility in designing the clique windows, SASI reaches higher average retrieval rates compared to Gabor Filter descriptors. However, the price of this performance is increased computational complexity.

Question: What is the average retrieval rate of the Gabor Filter descriptors?


Explaining Inconsistencies in OWL Ontologies. Justifications play a central role as the basis for explaining entailments in OWL ontologies. While techniques for computing justifications for entailments in consistent ontologies are theoretically and practically well-understood, little is known about the practicalities of computing justifications for inconsistent ontologies. This is despite the fact that justifications are important for repairing inconsistent ontologies, and can be used as a basis for paraconsistent reasoning. This paper presents algorithms, optimisations, and experiments in this area. Surprisingly, it turns out that justifications for inconsistent ontologies are more "difficult" to compute and are often more "numerous" than justifications for entailments in consistent ontologies: whereas it is always possible to compute some justifications, it is often not possible to compute all justifications for real world inconsistent ontologies.

Question: What is the difference between consistent and inconsistent ontologies?


Snort: Lightweight Intrusion Detection for Networks. Network intrusion detection systems (NIDS) are an important part of any network security architecture. They provide a layer of defense which monitors network traffic for predefined suspicious activity or patterns, and alert system administrators when potential hostile traffic is detected. Commercial NIDS have many differences, but Information Systems departments must face the commonalities that they share such as significant system footprint, complex deployment and high monetary cost. Snort was designed to address these issues.

Question: What is the difference between commercial and open source NIDS?


Perceptual Losses for Real-Time Style Transfer and Super-Resolution. We consider image transformation problems, where an input image is transformed into an output image. Recent methods for such problems typically train feed-forward convolutional neural networks using a per-pixel loss between the output and ground-truth images. Parallel work has shown that high-quality images can be generated by defining and optimizing perceptual loss functions based on high-level features extracted from pretrained networks. We combine the benefits of both approaches, and propose the use of perceptual loss functions for training feed-forward networks for image transformation tasks. We show results on image style transfer, where a feed-forward network is trained to solve the optimization problem proposed by Gatys et al in real-time. Compared to the optimization-based method, our network gives similar qualitative results but is three orders of magnitude faster. We also experiment with single-image super-resolution, where replacing a per-pixel loss with a perceptual loss gives visually pleasing results.

Question: How to train a feed-forward network for image transformation tasks?


Proceedings of the ACL-2012 Special Workshop on Rediscovering 50 Years of Discoveries. The ACL Anthology Network (AAN)1 is a comprehensive manually curated networked database of citations and collaborations in the field of Computational Linguistics. Each citation edge in AAN is associated with one or more citing sentences. A citing sentence is one that appears in a scientific article and contains an explicit reference to another article. In this paper, we shed the light on the usefulness of AAN citing sentences for understanding research trends and summarizing previous discoveries and contributions. We also propose and motivate several different uses and applications of citing sentences.

Question: What is the ACL Anthology Network?


Software Defined Networking Meets Information Centric Networking: A Survey. Information centric networking (ICN) and software-defined networking (SDN) are two emerging networking paradigms that promise to solve different aspects of networking problems. ICN is a clean-slate design for accommodating the ever increasing growth of the Internet traffic by regarding content as the network primitive, adopting in-network caching, and name-based routing, while SDN focuses on agile and flexible network management by decoupling network control logic from data forwarding. ICN and SDN have gained significant research attention separately in the most of the previous work. However, the features of ICN have profound impacts on the design and operation of SDN, such as in-network caching and data-centric security. Conversely, SDN provides a powerful tool for experimenting and deploying ICN architectures and can greatly facilitate ICN functionality and management. In this paper, we point out the necessity of surveying the scattered works on integrating SDN and ICN (SD-ICN) for improving operational networks. Specifically, we analyze the points of SD-ICN strengths and opportunities, and discuss the SDN enablers for deploying ICN architectures. In addition, we review and classify the recent work on improving the network management by SD-ICN and discuss the potential security benefits of SD-ICN. Finally, a number of open issues and future trends are highlighted.

Question: What is the difference between ICN and SDN?


Determining the informational, navigational, and transactional intent of Web queries. In this paper, we define and present a comprehensive classification of user intent for Web searching. The classification consists of three hierarchical levels of informational, navigational, and transactional intent. After deriving attributes of each, we then developed a software application that automatically classified queries using a Web search engine log of over a million and a half queries submitted by several hundred thousand users. Our findings show that more than 80% of Web queries are informational in nature, with about 10% each being navigational and transactional. In order to validate the accuracy of our algorithm, we manually coded 400 queries and compared the results from this manual classification to the results determined by the automated method. This comparison showed that the automatic classification has an accuracy of 74%. Of the remaining 25% of the queries, the user intent is vague or multi-faceted, pointing to the need for probabilistic classification. We discuss how search engines can use knowledge of user intent to provide more targeted and relevant results in Web searching. 2007 Elsevier Ltd. All rights reserved.

Question: What is the accuracy of the algorithm?


A Feature-Based Approach for Group-Wise Grid Map Registration. For autonomous vehicles and advanced driver assistance systems, information on the actual state of the environment is fundamental for localization and mapping tasks. Localization benefits from multiple observations of the same location at different times as these may provide important information on static and mobile objects. For efficient mapping, the environment may be explored in parallel. For these purposes, multiple observations represented by grid maps have to be aligned into one mutual frame. This paper addresses the problem of group-wise grid map registration using an image processing approach. For registration, a rotational-invariant descriptor is proposed in order to provide the correspondences of points of interest in radar-based occupancy grid maps. As pairwise registration of multiple grid maps suffers from bias, this paper proposes a graph-based approach for robust registration of multiple grid maps. This will facilitate highly accurate range sensor maps for the aforementioned purposes. Large-scale experiments show the benefit of the proposed methods and compare it to state-of-the-art algorithms on radar measurements.

Question: How to align multiple grid maps?


Meta-awareness, perceptual decoupling and the wandering mind. Mind wandering (i.e. engaging in cognitions unrelated to the current demands of the external environment) reflects the cyclic activity of two core processes: the capacity to disengage attention from perception (known as perceptual decoupling) and the ability to take explicit note of the current contents of consciousness (known as meta-awareness). Research on perceptual decoupling demonstrates that mental events that arise without any external precedent (known as stimulus independent thoughts) often interfere with the online processing of sensory information. Findings regarding meta-awareness reveal that the mind is only intermittently aware of engaging in mind wandering. These basic aspects of mind wandering are considered with respect to the activity of the default network, the role of executive processes, the contributions of meta-awareness and the functionality of mind wandering.

Question: What is the default network?


The MagicBook - Moving Seamlessly between Reality and Virtuality. or more than a decade researchers have tried to create intuitive computer interfaces by blending reality and virtual reality. The goal is for people to interact with the digital domain as easily as with the real world. Various approaches help us achieve this—in the area of tangible interfaces, we use real objects as interface widgets; in augmented reality, researchers overlay 3D virtual imagery onto the real world; and in VR interfaces , we entirely replace the real world with a computer generated environment. As Milgram pointed out, 1 these types of computer interfaces can be placed along a continuum according to how much of the user's environment is computer generated (Figure 1). Tangible interfaces lie far to the left on this reality–virtuality line, while immersive virtual environments are at the right extremity. Most current user interfaces exist as discrete points along this continuum. However, human activity can't always be broken into discrete components and for many tasks users may prefer to move seamlessly along the reality–virtuality continuum. This proves true when interacting with 3D graphical content, either creating virtual models or viewing them. For example, if people want to experience a virtual scene from different scales, then immer-sive virtual reality may be ideal. If they want to have a face-to-face discussion while viewing the virtual scene, an augmented reality interface may be best. 2 The MagicBook project is an early attempt to explore how we can use a physical object to smoothly transport users between reality and virtuality. Young children often fantasize about flying into the pages of a fairy tale and becoming part of the story. The MagicBook project makes this fantasy a reality using a normal book as the main interface object. People can turn the pages of the book, look at the pictures, and read the text without any additional technology (Figure 2a). However, if a person

Question: What is the magicbook project?


Bandwidth formula for Linear FMCW radar waveforms. The International Telecommunications Union provides recommendations regarding spectral emission bounds for primary radar systems. These bounds are currently in review and are defined in terms of spectral occupancy, necessary bandwidth, 40dB bandwidth and out-of-band roll-off rates. Here we derive out-of-band domain spectral envelopes, bandwidth formula and roll-off rates, for various Linear FMCW radar waveforms including sawtooth (LFMCW), Quadratic Phase Coded LFMCW, LFM Pulse Train, and Hann amplitude tapered LFMCW.

Question: What is the bandwidth formula for linear fmcw radar waveforms?


Intelligent Maze Solving Robot Based on Image Processing and Graph Theory Algorithms. The most important task for maze solving robots is the fast and reliable finding of its shortest path from its initial point to its final destination point. This paper proposes an intelligent maze solving robot that can determine its shortest path on a line maze based on image processing and artificial intelligence algorithms. The image of the line maze is captured by a camera and sent to the computer to be analyzed and processed by a program developed using Visual C++ and OpenCV libraries and based on graph theory algorithms. The developed program solves the captured maze by examining all possible paths exist in the maze that could convey the robot to the required destination point. After that, the best shortest path is determined and then the instructions that guide the car-like robot to reach its desired destination point are sent to the robot through Bluetooth. The robot follows the received guide path to reach its destination. The proposed approach works faster than the traditional methods which push the robot to move through the maze cell by cell in order to find its destination point. Moreover, the proposed method allows the maze solving robot to avoid trapping and falling in infinity loops. Applications of maze solving systems include intelligent traffic control that helps ambulances, fire fighters, or rescuing robots to find their shortest path to their destination.

Question: What is the shortest path between two points?


Applying Deep Learning to Enhance Momentum Trading Strategies in Stocks. We use an autoencoder composed of stacked restricted Boltzmann machines to extract features from the history of individual stock prices. Our model is able to discover an enhanced version of the momentum effect in stocks without extensive hand-engineering of input features and deliver an annualized return of 45.93% over the 1990-2009 test period versus 10.53% for basic momentum.

Question: How does deep learning enhance momentum trading strategies?


Routing Around Congestion: Defeating DDoS Attacks and Adverse Network Conditions via Reactive BGP Routing. In this paper, we present Nyx, the first system to both effectively mitigate modern Distributed Denial of Service (DDoS) attacks regardless of the amount of traffic under adversarial control and function without outside cooperation or an Internet redesign. Nyx approaches the problem of DDoS mitigation as a routing problem rather than a filtering problem. This conceptual shift allows Nyx to avoid many of the common shortcomings of existing academic and commercial DDoS mitigation systems. By leveraging how Autonomous Systems (ASes) handle route advertisement in the existing Border Gateway Protocol (BGP), Nyx allows the deploying AS to achieve isolation of traffic from a critical upstream AS off of attacked links and onto alternative, uncongested, paths. This isolation removes the need for filtering or de-prioritizing attack traffic. Nyx controls outbound paths through normal BGP path selection, while return paths from critical ASes are controlled through the use of specific techniques we developed using existing traffic engineering principles and require no outside coordination. Using our own realistic Internet-scale simulator, we find that in more than 98% of cases our system can successfully route critical traf?c around network segments under transit-link DDoS attacks; a new form of DDoS attack where the attack traf?c never reaches the victim AS, thus invaliding defensive filtering, throttling, or prioritization strategies. More significantly, in over 95% of those cases, the alternate path provides complete congestion relief from transit-link DDoS. Nyx additionally provides complete congestion relief in over 75% of cases when the deployer is being directly attacked.

Question: How does Nyx work?


Real-time techniques for 3D flow visualization. Visualization of three-dimensional steady flow has to overcome a lot of problems to be effective. Among them are occlusion of distant details, lack of directional and depth hints and occlusion. We present methods which address these problems for real-time graphic representations applicable in virtual environments. We use dashtubes, i.e., animated, opacity-mapped streamlines, as a visualization icon for 3D-flow visualization. We present a texture mapping technique to keep the level of texture detail along a streamline nearly constant even when the velocity of the flow varies considerably. An algorithm is described which distributes the dashtubes evenly in space. We apply magic lenses and magic boxes as interaction techniques for investigating densely filled areas without overwhelming the observer with visual detail. Implementation details of these methods and their integration in our virtual environment conclude the paper.

Question: How to visualize 3D flow?


Towards a sustainable e-Participation implementation model. A great majority of the existing frameworks are inadequate to address their universal applicability in countries with certain socio-economic and technological settings. Though there is so far no "one size fits all" strategy in implementing eGovernment, there are some essential common elements in the transformation. Therefore, this paper attempts to develop a singular sustainable model based on some theories and the lessons learned from existing e-Participation initiatives of developing and developed countries, so that the benefits of ICT can be maximized and greater participation be ensured.

Question: What is a sustainable e-participation model?


Wordnet Enhanced Automatic Crossword Generation. We report on a system for automatically generating and displaying crosswords from a system manager supplied database of potential clues and corresponding words that index those clues. The system relies on the lexical relations encoded in WordNet to enhance the aesthetics of the resulting crossword by making it easier to automatically identify a grid that may be populated with words and clues that have a thematic focus. The system architecture is provided in overview, as is empirical evaluation.

Question: How do you generate a crossword?


A survey on human activity recognition from videos. Understanding the activities of human from videos is demanding task in Computer Vision. Identifying the actions being accomplished by the human in the video sequence automatically and tagging their actions is the prime functionality of intelligent video systems. The goal of activity recognition is to identify the actions and objectives of one or more objects from a series of examination on the action of object and their environmental condition. The major applications of Human Activity Recognition varies from Content-based Video Analytics, Robotics, Human-Computer Interaction, Human fall detection, Ambient Intelligence, Visual Surveillance, Video Indexing etc. This paper collectively summarizes and deciphers the various methodologies, challenges and issues of Human Activity Recognition systems. Variants of Human Activity Recognition systems such as Human Object Interactions and Human-Human Interactions are also explored. Various benchmarking datasets and their properties are being explored. The Experimental Evaluation of various papers are analyzed efficiently with the various performance metrics like Precision, Recall, and Accuracy.

Question: What is the goal of human activity recognition?


Enabling the IoT Paradigm in E-health Solutions through the VIRTUS Middleware. In Europe, in a context of growing population and decreasing resources, ageing related diseases represent one of the most relevant challenges in terms of healthcare organization complexity, plus care levels and system financing balancing. Nowadays there are several researches that are studying the application of the IoT (Internet of Things) paradigm in the e-health field. This paper explains how a solution, built on the top of the VIRTUS IoT middleware, provides a valid alternative to current IoT solutions, which are mainly based on SOA (Service Oriented Architecture). VIRTUS leverage an Instant Messaging protocol (XMPP) to guarantee a (near) real-time, secure and reliable communication channel among heterogeneous devices. The presented development has been exploited in a healthcare case study: an implementation of a cost-savvy remote body movement monitoring system, aimed at classify daily patients' activities, designed as a modular architecture and deployed in a large scale scenario. The paper analyzes the features offered by the VIRTUS middleware, if used within a e-health solution, providing a comparison with other well-known systems.

Question: What is the difference between IoT and e-health?


Multi-scale retinex for color image enhancement. The retinex is a human perception-based image processing algorithm which provides color constancy and dynamic range compression. We have previously reported on a single-scale retinex (SSR) and shown that it can either achieve color/lightness rendition or dynamic range compression, but not both simultaneously. We now present a multi-scale retinex (MSR) which overcomes this limitation for most scenes. Both color rendition and dynamic range compression are successfully accomplished except for some \patho-logical" scenes that have very strong spectral characteristics in a single band.

Question: How does the multi-scale retinex work?


Anxiety disorders in primary care: prevalence, impairment, comorbidity, and detection.. Context Anxiety and depression are both common in primary care patients, but much less attention has been paid to anxiety. Contribution The authors administered a 7-item anxiety scale (Generalized Anxiety Disorder [GAD]-7) to 965 primary care patients, who also had a structured interview, to detect an anxiety disorder. Of these patients, 19.5% had at least 1 anxiety disorder. Patients with anxiety had worse functional status, more disability days, and more physician visits, but 41% were not being treated for any anxiety disorder. The GAD-7 had high sensitivity and good specificity for detecting a generalized anxiety disorder, panic disorder, social anxiety disorder, and posttraumatic stress disorder. Implications Anxiety disorders are common, underrecognized, and undertreated, but they are easy to detect with a brief questionnaire. The Editors Anxiety and depression are the 2 most common mental health problems seen in the general medical setting (15). Although increasing attention has been paid to anxiety, it still lags far behind depression in terms of research as well as clinical and public health efforts in screening, diagnosis, and treating affected individuals. This is unfortunate given the prevalence of anxiety and its substantial impact on patient functioning, work productivity, and health care costs (614). More than 30 million Americans have a lifetime history of anxiety (15), and anxiety disorders cost an estimated $42 billion dollars per year in the United States alone, counting direct and indirect costs (16). The 4 most common anxiety disorders (excluding simple phobias that seldom present clinically) are generalized anxiety disorder, panic disorder, social anxiety disorder, and posttraumatic stress disorder (PTSD) (1723). However, despite the substantial disability associated with each anxiety disorder and the availability of effective treatments, only a minority of p

Question: What is the prevalence of anxiety disorders in primary care?


Superneurons: dynamic GPU memory management for training deep neural networks. Going deeper and wider in neural architectures improves their accuracy, while the limited GPU DRAM places an undesired restriction on the network design domain. Deep Learning (DL) practitioners either need to change to less desired network architectures, or nontrivially dissect a network across multiGPUs. These distract DL practitioners from concentrating on their original machine learning tasks. We present SuperNeurons: a dynamic GPU memory scheduling runtime to enable the network training far beyond the GPU DRAM capacity. SuperNeurons features 3 memory optimizations, Liveness Analysis, Unified Tensor Pool, and Cost-Aware Recomputation; together they effectively reduce the network-wide peak memory usage down to the maximal memory usage among layers. We also address the performance issues in these memory-saving techniques. Given the limited GPU DRAM, SuperNeurons not only provisions the necessary memory for the training, but also dynamically allocates the memory for convolution workspaces to achieve the high performance. Evaluations against Caffe, Torch, MXNet and TensorFlow have demonstrated that SuperNeurons trains at least 3.2432 deeper network than current ones with the leading performance. Particularly, SuperNeurons can train ResNet2500 that has 104 basic network layers on a 12GB K40c.

Question: How deep can a neural network be trained?


Key performance indicators for traffic intensive web-enabled business processes. Purpose – Intensive traffic often occurs in web-enabled business processes hosted by travel industry and government portals. An extreme case for intensive traffic is flash crowd situations when the number of web users spike within a short time due to unexpected events caused by political unrest or extreme weather conditions. As a result, the servers hosting these business processes can no longer handle overwhelming service requests. To alleviate this problem, process engineers usually analyze audit trail data collected from the application server and reengineer their business processes to withstand unexpected surge in the visitors. However, such analysis can only reveal the performance of the application server from the internal perspective. This paper aims to investigate this issue. Design/methodology/approach – This paper proposes an approach for analyzing key performance indicators of traffic intensive web-enabled business processes from audit trail data, web server logs, and stress testing logs. Findings – The key performance indicators identified in the study's approach can be used to understand the behavior of traffic intensive web-enabled business processes and the underlying factors that affect the stability of the web server. Originality/value – The proposed analysis also provides an internal as well as an external view of the performance. Moreover, the calculated key performance indicators can be used by the process engineers for locating potential bottlenecks, reengineering business processes, and implementing contingency measures for traffic intensive situations.

Question: What is the difference between an internal and an external view of the performance?


Enhanced autonomous resource selection for LTE-based V2V communication. Vehicle-to-vehicle (V2V) communication has the potential to improve road safety significantly by providing connectivity between vehicles to exchange information messages. V2V has recently gained considerable attention in part due to the standardization work that has started for Long Term Evolution (LTE) under the Third Generation Partnership Project (3GPP). Efficient and reliable distributed allocation of time-frequency resources among different vehicle user equipments (VUEs) remains a challenge particularly in dense urban environments. In this work, a new autonomous resource selection scheme for urban V2V communication scenario is proposed. Specifically, the proposed scheme relies on resource partitioning based on VUE heading direction along with a sensing-based collision avoidance mechanism, which aims to alleviate the potential interference between VUEs due to resource collision and in-band emission (IBE). The performance of the two-stage autonomous resource selection scheme is evaluated by system-level simulations in urban scenarios, where the results show a significant performance gain in comparison to existing approaches.

Question: How to partition the time-frequency resources among the VUEs?


Building Caring Healthcare Systems in the Internet of Things. The nature of healthcare and the computational and physical technologies and constraints present a number of challenges to systems designers and implementers. In spite of the challenges, there is a significant market for systems and products to support caregivers in their tasks as the number of people needing assistance grows substantially. In this paper, we present a structured approach for describing Internet of Things (IoT) for healthcare systems. We illustrate the approach for three use cases and discuss relevant quality issues that arise, in particular, the need to consider caring as a requirement.

Question: What is the nature of healthcare and the computational and physical technologies and constraints present a number of challenges to systems designers and implementers?


Backtrack Programming Techniques. The purpose of this paper is twofold. First, a brief exposition of the general backtrack technique and its history is given. Second, it is shown how the use of macros can considerably shorten the computation time in many cases. In particular, this technique has allowed the solution of two previously open combinatorial problems, the computation of new terms in a well-known series, and the substantial reduction in computation time for the solution to another combinatorial problem.

Question: What is a macro?


Detecting Offensive Language in Social Media to Protect Adolescent Online Safety. Since the textual contents on online social media are highly unstructured, informal, and often misspelled, existing research on message-level offensive language detection cannot accurately detect offensive content. Meanwhile, user-level offensiveness detection seems a more feasible approach but it is an under researched area. To bridge this gap, we propose the Lexical Syntactic Feature (LSF) architecture to detect offensive content and identify potential offensive users in social media. We distinguish the contribution of pejoratives/profanities and obscenities in determining offensive content, and introduce hand-authoring syntactic rules in identifying name-calling harassments. In particular, we incorporate a user's writing style, structure and specific cyber bullying content as features to predict the user's potentiality to send out offensive content. Results from experiments showed that our LSF framework performed significantly better than existing methods in offensive content detection. It achieves precision of 98.24% and recall of 94.34% in sentence offensive detection, as well as precision of 77.9% and recall of 77.8% in user offensive detection. Meanwhile, the processing speed of LSF is approximately 10msec per sentence, suggesting the potential for effective deployment in social media.

Question: How to detect offensive language in social media?


Multi-scale Patch Aggregation (MPA) for Simultaneous Detection and Segmentation. Aiming at simultaneous detection and segmentation (SD-S), we propose a proposal-free framework, which detect and segment object instances via mid-level patches. We design a unified trainable network on patches, which is followed by a fast and effective patch aggregation algorithm to infer object instances. Our method benefits from end-to-end training. Without object proposal generation, computation time can also be reduced. In experiments, our method yields results 62.1% and 61.8% in terms of mAPr on VOC2012 segmentation val and VOC2012 SDS val, which are state-of-the-art at the time of submission. We also report results on Microsoft COCO test-std/test-dev dataset in this paper.

Question: What is the state-of-the-art in object detection and segmentation?


Workflow mining: discovering process models from event logs. Contemporary workflow management systems are driven by explicit process models, i.e., a completely specified workflow design is required in order to enact a given workflow process. Creating a workflow design is a complicated time-consuming process and, typically, there are discrepancies between the actual workflow processes and the processes as perceived by the management. Therefore, we have developed techniques for discovering workflow models. The starting point for such techniques is a so-called "workflow log" containing information about the workflow process as it is actually being executed. We present a new algorithm to extract a process model from such a log and represent it in terms of a Petri net. However, we also demonstrate that it is not possible to discover arbitrary workflow processes. We explore a class of workflow processes that can be discovered. We show that the /spl alpha/-algorithm can successfully mine any workflow represented by a so-called SWF-net.

Question: What is workflow mining?


Sentiment analysis of a document using deep learning approach and decision trees. The given paper describes modern approach to the task of sentiment analysis of movie reviews by using deep learning recurrent neural networks and decision trees. These methods are based on statistical models, which are in a nutshell of machine learning algorithms. The fertile area of research is the application of Google's algorithm Word2Vec presented by Tomas Mikolov, Kai Chen, Greg Corrado and Jeffrey Dean in 2013. The main idea of Word2Vec is the representations of words with the help of vectors in such manner that semantic relationships between words preserved as basic linear algebra operations. The extra advantage of the mentioned algorithm above the alternatives is computational efficiency. This paper focuses on using Word2Vec model for text classification by their sentiment type.

Question: What is the difference between deep learning and machine learning?


Entrapment of the sciatic nerve at the linea aspera: A case report and literature review. BACKGROUND Nontraumatic, non-neoplastic sciatic nerve entrapment at the level of the thigh is extremely rare. In its course, in proximity of the linea aspera, the nerve is exposed to unexpected neuropathic syndromes associated with bone disorders.   CASE DESCRIPTION A 67-year-old woman presented with a painful, neuropathic syndrome of the sciatic nerve, not resulting from any trauma and persisting for approximately 2 years. Imaging studies of the thigh showed a delimited zone of hyperostosis in the proximal third of the femoral diaphysis. The symptoms dramatically resolved after the patient underwent neurolysis of the tract of the nerve adjoining to the linea aspera. At the clinical checkup 2 years later, the patient remained free of pain.   CONCLUSION The diagnosis of sciatic nerve entrapment at the linea aspera may present considerable difficulties. The clinical history and physical examination sometimes motivate the exploration and neurolysis of the nerve at this site.

Question: What is the linea aspera?


Loihi: A Neuromorphic Manycore Processor with On-Chip Learning. Loihi is a 60-mm2 chip fabricated in Intels 14-nm process that advances the state-of-the-art modeling of spiking neural networks in silicon. It integrates a wide range of novel features for the field, such as hierarchical connectivity, dendritic compartments, synaptic delays, and, most importantly, programmable synaptic learning rules. Running a spiking convolutional form of the Locally Competitive Algorithm, Loihi can solve LASSO optimization problems with over three orders of magnitude superior energy-delay-product compared to conventional solvers running on a CPU iso-process/voltage/area. This provides an unambiguous example of spike-based computation, outperforming all known conventional solutions.

Question: What is the energy-delay-product of Loihi?


Distributed fair scheduling in a wireless LAN. Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weightsof the packet flows sharing the channel. This paper presents a fully distributed algorithm for fair scheduling in a wireless LAN. The algorithm can be implemented without using a centralized coordinator to arbitrate medium access. The proposed protocol is derived from the Distributed Coordination Function in the IEEE 802.11 standard. Simulation results show that the proposed algorithm is able to schedule transmission such that the bandwidth allocated to different flows is proportional to their weights. An attractive feature of the proposed approach is that it can be implemented with simple modifications to the IEEE 802.11 standard.

Question: How does fair scheduling work?


A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers. Structured-grid PDE solver frameworks parallelize over boxes, which are rectangular domains of cells or faces in a structured grid. In the Chombo framework, the box sizes are typically 163 or 323, but larger box sizes such as 1283 would result in less surface area and therefore less storage, copying, and/or ghost cells communication overhead. Unfortunately, current on-node parallelization schemes perform poorly for these larger box sizes. In this paper, we investigate 30 different inter-loop optimization strategies and demonstrate the parallel scaling advantages of some of these variants on NUMA multicore nodes. Shifted, fused, and communication-avoiding variants for 1283 boxes result in close to ideal parallel scaling and come close to matching the performance of 163 boxes on three different multicore systems for a benchmark that is a proxy for program idioms found in Computational Fluid Dynamic (CFD) codes.

Question: What is the best way to parallelize a structured grid?


A UWB Unidirectional Antenna With Dual-Polarization. A novel ±45° dual-polarized unidirectional antenna element is presented, consisting of two cross center-fed tapered mono-loops and two cross electric dipoles located against a reflector for ultrawideband applications. The operation principle of the antenna including the use of elliptically tapered transmission line for transiting the unbalanced energy to the balanced energy is described. Designs with different reflectors-planar or conical-are investigated. A measured overlapped impedance bandwidth of 126% (SWR <; 2) is demonstrated. Due to the complementary nature of the structure, the antenna has a relatively stable broadside radiation pattern with low cross polarization and low back lobe radiation over the operating band. The measured gain of the proposed antenna varies from 4 to 13 dBi and 7 to 14.5 dBi for port 1 and port 2, respectively, over the operating band, when mounted against a conical backed reflector. The measured coupling between the two ports is below -25 dB over the operating band.

Question: What is a unidirectional antenna?


Interactions between working memory, attention and eye movements.. This paper reviews the recent findings on working memory, attention and eye movements. We discuss the research that shows that many phenomena related to visual attention taking place when selecting relevant information from the environment are similar to processes needed to keep information active in working memory. We discuss new data that show that when retrieving information from working memory, people may allocate visual spatial attention to the empty location in space that used to contain the information that has to be retrieved. Moreover, we show that maintaining a location in working memory not only may involve attention rehearsal, but might also recruit the oculomotor system. Recent findings seem to suggest that remembering a location may involve attention-based rehearsal in higher brain areas, while at the same time there is inhibition of specific motor programs at lower brain areas. We discuss the possibility that working memory functions do not reside at a special area in the brain, but emerge from the selective recruitment of brain areas that are typically involved in spatial attention and motor control.

Question: What is the difference between working memory and attention?


Vital, Sophia, and Co. - The Quest for the Legal Personhood of Robots. The paper examines today's debate on the legal status of AI robots, and how often scholars and policy makers confuse the legal agenthood of these artificial agents with the status of legal personhood. By taking into account current trends in the field, the paper suggests a twofold stance. First, policy makers shall seriously mull over the possibility of establishing novel forms of accountability and liability for the activities of AI robots in contracts and business law, e.g., new forms of legal agenthood in cases of complex distributed responsibility. Second, any hypothesis of granting AI robots full legal personhood has to be discarded in the foreseeable future. However, how should we deal with Sophia, which became the first AI application to receive citizenship of any country, namely, Saudi Arabia, in October 2017? Admittedly, granting someone, or something, legal personhood is—as always has been—a highly sensitive political issue that does not simply hinge on rational choices and empirical evidence. Discretion, arbitrariness, and even bizarre decisions play a role in this context. However, the normative reasons why legal systems grant human and artificial entities, such as corporations, their status, help us taking sides in today's quest for the legal personhood of AI robots. Is citizen Sophia really conscious, or capable of suffering the slings and arrows of outrageous scholars?

Question: What is the legal status of AI robots?


A survey on content-centric technologies for the current Internet: CDN and P2P solutions. 0140-3664/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.comcom.2011.10.005 q This work was partially funded by the European AWARE RECOGNITION (257756), FIRE-SCAMPI (25841 ⇑ Tel.: +39 0503153269. E-mail address: a.passarella@iit.cnr.it One of the most striking properties of the Internet is its flexibility to accommodate features it was not conceived for. Among the most significant examples, in this survey we consider the transition of the Internet from a reliable fault-tolerant network for host-to-host communication to a content-centric network, i.e. a network mostly devoted to support efficient generation, sharing and access to content. We survey this research area according to a top-down approach. We present a conceptual framework that encompasses the key building blocks required to support content-centric networking in the Internet. Then we describe in detail the two most important types of content-centric Internet technologies, i.e., Content-Delivery Networks (CDNs) and P2P systems. For each of them, we show how they cover the key building blocks. We then identify the functional components of CDN and P2P content management solutions, and discuss the main solutions proposed in the literature for each of them. We consider different types of content (both real time and non real time), and different networking environments (fixed, mobile, . . .). Finally, we also discuss the main recent research trends focused on how to design the Future Internet as a native content-centric network. 2011 Elsevier B.V. All rights reserved.

Question: What is the future of the internet?


The Big Bang: Facial Trauma Caused by Recreational Fireworks.. In the Netherlands, it is a tradition of setting off fireworks to celebrate the turn of the year. In our medical facility, each year patients with severe skeletal maxillofacial trauma inflicted by recreational fireworks are encountered. We present two cases of patients with severe blast injury to the face, caused by direct impact of rockets, and thereby try to contribute to the limited literature on facial blast injuries, their treatment, and clinical outcome. These patients require multidisciplinary treatment, involving multiple reconstructive surgeries, and the overall recovery process is long. The severity of these traumas raises questions about the firework traditions and legislations not only in the Netherlands but also worldwide. Therefore, the authors support restrictive laws on personal use of fireworks in the Netherlands.

Question: What is the severity of facial blast injuries?


Characterizing 3D Floating Gate NAND Flash. In this paper, we characterize a state-of-the-art 3D floating gate NAND flash memory through comprehensive experiments on an FPGA platform. Then, we present distinct observations on performance and reliability, such as operation latencies and various error patterns. We believe that through our work, novel 3D NAND flash-oriented designs can be developed to achieve better performance and reliability.

Question: What is a floating gate?


DFT-based Transformation Invariant Pooling Layer for Visual Classification. We propose a novel discrete Fourier transform-based pooling layer for convolutional neural networks. The DFT magnitude pooling replaces the traditional max/average pooling layer between the convolution and fully-connected layers to retain translation invariance and shape preserving (aware of shape difference) properties based on the shift theorem of the Fourier transform. Thanks to the ability to handle image misalignment while keeping important structural information in the pooling stage, the DFT magnitude pooling improves the classification accuracy significantly. In addition, we propose the DFT method for ensemble networks using the middle convolution layer outputs. The proposed methods are extensively evaluated on various classification tasks using the ImageNet, CUB 2010-2011, MIT Indoors, Caltech 101, FMD and DTD datasets. The AlexNet, VGG-VD 16, Inception-v3, and ResNet are used as the base networks, upon which DFT and DFT methods are implemented. Experimental results show that the proposed methods improve the classification performance in all networks and datasets.

Question: What is the DFT method for ensemble networks using the middle convolution layer outputs?


FPGA Implementations of the Round Two SHA-3 Candidates. The second round of the NIST-run public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). This paper presents the full implementations of all of the second round candidates in hardware with all of their variants. In order to determine their computational efficiency, an important aspect in NIST's round two evaluation criteria, this paper gives an area/speed comparison of each design both with and without a hardware interface, thereby giving an overall impression of their performance in resource constrained and resource abundant environments. The implementation results are provided for a Virtex-5 FPGA device. The efficiency of the architectures for the hash functions are compared in terms of throughput per unit area.

Question: What is the area of a fpga?


Cloaker: Hardware Supported Rootkit Concealment. Rootkits are used by malicious attackers who desire to run software on a compromised machine without being detected. They have become stealthier over the years as a consequence of the ongoing struggle between attackers and system defenders. In order to explore the next step in rootkit evolution and to build strong defenses, we look at this issue from the point of view of an attacker. We construct Cloaker, a proof-of-concept rootkit for the ARM platform that is non- persistent and only relies on hardware state modifications for concealment and operation. A primary goal in the design of Cloaker is to not alter any part of the host operating system (OS) code or data, thereby achieving immunity to all existing rootkit detection techniques which perform integrity, behavior and signature checks of the host OS. Cloaker also demonstrates that a self-contained execution environment for malicious code can be provided without relying on the host OS for any services. Integrity checks of hardware state in each of the machine's devices are required in order to detect rootkits such as Cloaker. We present a framework for the Linux kernel that incorporates integrity checks of hardware state performed by device drivers in order to counter the threat posed by rootkits such as Cloaker.

Question: What is a rootkit?


Deep Domain Confusion: Maximizing for Domain Invariance. Recent reports suggest that a generic supervised deep CNN model trained on a large-scale dataset reduces, but does not remove, dataset bias on a standard benchmark. Fine-tuning deep models in a new domain can require a significant amount of data, which for many applications is simply not available. We propose a new CNN architecture which introduces an adaptation layer and an additional domain confusion loss, to learn a representation that is both semantically meaningful and domain invariant. We additionally show that a domain confusion metric can be used for model selection to determine the dimension of an adaptation layer and the best position for the layer in the CNN architecture. Our proposed adaptation method offers empirical performance which exceeds previously published results on a standard benchmark visual domain adaptation task.

Question: How to remove dataset bias in a deep CNN model?


Optimization of 6Slots-7Poles & 12Slots-14Poles flux-switching permanent magnet machines for plug-in HEV. Plug-in hybrid electric vehicle (PHEV) is independent of the internal combustion engine but acts as the auxiliary unit mostly on the electric drive system. Main while, the Flux-switching permanent magnet machine (FSPMM) has been studied in terms of structure with its operation principle been analyzed. To achieve a higher torque with a corresponding high power density and lower torque ripple, FSPMM with 6Slots-7Poles and 12Slots-14Poles, according investigations, are optimized based on their objective functions. Moreover, it analyzes several typical performance curves, such as cogging torque, flux linkage and back-EMF. Finally, the torque and corresponding power, efficiency and rotor mechanical strength analysis of optimized designed are obtained. The results indicate that FSPMM is a viable candidate for PHEV and also has good mechanical robustness with strong flux-weakening ability.

Question: What is the objective function of the flux-switching permanent magnet machine?


A design of miniaturization LPDA antenna with ultra wideband. This paper designed a Log-periodic miniaturization antenna working in 8GHz to 18GHz. It satisfies the characteristic of high gain, good radiation pattern, and a large proportion of the size reduction which other antenna don't possess. The lengthwise is 80mm, it reduces more than 50% of the transverse dimension with the original specification. A "mountain" terminal loaded design is used to shrink size of antenna under the premise of guaranteeing directivity of antenna. By optimizing backward feeding structure and antenna array to improve antenna performance. The final result is superior to other same type antenna distinctly.

Question: What is the size of the antenna?


THE CONTROL OF THE FALSE DISCOVERY RATE IN MULTIPLE TESTING UNDER DEPENDENCY By. Benjamini and Hochberg suggest that the false discovery rate may be the appropriate error rate to control in many applied multiple testing problems. A simple procedure was given there as an FDR controlling procedure for independent test statistics and was shown to be much more powerful than comparable procedures which control the traditional familywise error rate. We prove that this same procedure also controls the false discovery rate when the test statistics have positive regression dependency on each of the test statistics corresponding to the true null hypotheses. This condition for positive dependency is general enough to cover many problems of practical interest, including the comparisons of many treatments with a single control, multivariate normal test statistics with positive correlation matrix and multivariate t. Furthermore, the test statistics may be discrete, and the tested hypotheses composite without posing special difficulties. For all other forms of dependency, a simple conservative modification of the procedure controls the false discovery rate. Thus the range of problems for which a procedure with proven FDR control can be offered is greatly increased.

Question: How to control the false discovery rate in multiple testing?


Discovering the invisible city: Location-based games for learning in smart cities. In this paper we discuss how location-based mobile games can be designed for learning in modern technology enhanced public spaces. We start with the description of the design process and we identify the main challenges faced. We elaborate the case of the game Invisible City: Rebels vs. Spies, a game to be played in a city centre using mobile devices. Through this case we highlight the adaptation of an original party game into a mobile form, the issues we faced and the key aspects conductive to learning in a smart city. It is claimed that creating mobile city games for learning is a new challenge, as our city landscapes are augmented with an increasing number of layers of digital information in which a new generation of city games are played.

Question: How can we design games for learning in smart cities?


Towards Multi-Agent Communication-Based Language Learning. We propose an interactive multimodal framework for language learning. Instead of being passively exposed to large amounts of natural text, our learners (implemented as feed-forward neural networks) engage in cooperative referential games starting from a tabula rasa setup, and thus develop their own language from the need to communicate in order to succeed at the game. Preliminary experiments provide promising results, but also suggest that it is important to ensure that agents trained in this way do not develop an adhoc communication code only effective for the game they are playing.

Question: How to ensure that agents trained in this way do not develop an adhoc communication code only effective for the game they are playing?


Valuating privacy. In several experimental auctions, participants put a dollar value on private information before revealing it to a group. An analysis of results show that a trait's desirability in relation to the group played a key role in the amount people demanded to publicize private information. Because people can easily obtain, aggregate, and disperse personal data electronically, privacy is a central concern in the information age. This concern is clear in relation to financial data and genetic information, both of which can lead to identity abuse and discrimination. However, other relatively harmless information can also be abused, including a person's gender, salary, age, marital status, or shopping preferences. What's unclear is whether it's the fear of such abuse that actually causes people's stated hesitance to reveal their data. Our hypothesis - and the motivation for our study - is that people reveal information when they feel that they're somewhat typical or positively atypical compared to the target group. To test this hypothesis, we conducted experiments that elicit the value people place on their private data. We found, with great significance (more than 95 percent statistical confidence) that a linear relationship exists between an individual's belief about a trait and the value he or she places on it. That is, the less desirable the trait, the greater the price a person demands for releasing the information. Furthermore, we found that small deviations in a socially positive direction are associated with a lower asking price.

Question: What is the value of privacy?


Optimizing F-Measure with Support Vector Machines. Support vector machines (SVMs) are regularly used for classification of unbalanced data by weighting more heavily the error contribution from the rare class. This heuristic technique is often used to learn classifiers with high F-measure, although this particular application of SVMs has not been rigorously examined. We provide significant and new theoretical results that support this popular heuristic. Specifically, we demonstrate that with the right parameter settings SVMs approximately optimize F-measure in the same way that SVMs have already been known to approximately optimize accuracy. This finding has a number of theoretical and practical implications for using SVMs in F-measure optimization.

Question: What is the difference between accuracy and F-measure?


Data mining techniques for customer relationship management. Advancements in technology have made relationship marketing a reality in recent years. Technologies such as data warehousing, data mining, and campaign management software have made customer relationship management a new area where firms can gain a competitive advantage. Particularly through data mining—the extraction of hidden predictive information from large databases—organizations can identify valuable customers, predict future behaviors, and enable firms to make proactive, knowledge-driven decisions. The automated, future-oriented analyses made possible by data mining move beyond the analyses of past events typically provided by history-oriented tools such as decision support systems. Data mining tools answer business questions that in the past were too time-consuming to pursue. Yet, it is the answers to these questions make customer relationship management possible. Various techniques exist among data mining software, each with their own advantages and challenges for different types of applications. A particular dichotomy exists between neural networks and chi-square automated interaction detection (CHAID). While differing approaches abound in the realm of data mining, the use of some type of data mining is necessary to accomplish the goals of today's customer relationship management philosophy.  2002 Elsevier Science Ltd. All rights reserved.

Question: What is the difference between neural networks and chi-square automated interaction detection?


The biology of interleukin-6.. B CELLS ARE the only eukaryotic cells that are able to produce antibody molecules. Their growth and differentiation into antibody producing cells require the presence of T cells and macrophages; the function of these cells was found to be replaced by soluble factors. 3 In the early i980s it was shown that at least two different kinds of factors were required in the regulation of B cell response, one for growth of activated B cells, B-cell growth factor (BCGF), and the other for antibody induction in B cells, B-cell differentiation factor (BCDF). 6 Since then, a variety of factors regulating the B cell response have been reported in the human and murine systems. Finally, in 1986 the cDNAs for three B-cell stimulatory factors have been cloned; interleukin-4 (IL-4) (BCGF1 /BSF1 ) for the early activation of resting B cells,7'8 IL-5 (BCGFII) for the growth ofactivated B cells,9 and IL-6 (BCDF/BSF2) for the final differentiation of B cells into antibody producing cells'#{176} (Fig 1). Human IL-6 (BSF2) was originally identified as a factor in the culture supernatants of mitogen or antigen-stimulated peripheral mononuclear cells, which induced immunoglobulin production in Epstein Barr virus (EBV) transformed B-cell lines or in Staphylococcus aureus Cowan 1 (SAC) stimulated normal B cells.t1 This molecule was found to be separable from other factors, such as IL-2 and BCGFs, and the establishment of human T cell hybridoma generating BSF2 activity confirmed that this is a distinct molecule from other cytokines.6 BSF2 was purified to homogeneity from the culture supernatant of a human T-cell leukemia virus type 1 (HTLV1 ) transformed T-cell line and its partial N-terminal amino acid sequence was determined.t2 Based on these findings, the cDNA encoding human BSF2 was cloned. #{176} Approximately at the same time, the molecular cloning and the nucleotide sequences of the molecules termed interferon / 2 (IFN 32)'3 and 26 Kd protein were reportedt4

Question: What is the function of interleukin-6?


From basic network principles to neural architecture: emergence of orientation columns.. Orientation-selective cells--cells that are selectively responsive to bars and edges at particular orientations--are a salient feature of the architecture of mammalian visual cortex. In the previous paper of this series, I showed that such cells emerge spontaneously during the development of a simple multilayered network having local but initially random feedforward connections that mature, one layer at a time, according to a simple development rule (of Hebb type). In this paper, I show that, in the presence of lateral connections between developing orientation cells, these cells self-organize into banded patterns of cells of similar orientation. These patterns are similar to the "orientation columns" found in mammalian visual cortex. No orientation preference is specified to the system at any stage, none of the basic developmental rules is specific to visual processing, and the results emerge even in the absence of visual input to the system (as has been observed in macaque monkey).

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


Temporal Ensembling for Semi-Supervised Learning. In this paper, we present a simple and efficient method for training deep neural networks in a semi-supervised setting where only a small portion of training data is labeled. We introduce self-ensembling, where we form a consensus prediction of the unknown labels using the outputs of the network-in-training on different epochs, and most importantly, under different regularization and input augmentation conditions. This ensemble prediction can be expected to be a better predictor for the unknown labels than the output of the network at the most recent training epoch, and can thus be used as a target for training. Using our method, we set new records for two standard semi-supervised learning benchmarks, reducing the (non-augmented) classification error rate from 18.44% to 7.05% in SVHN with 500 labels and from 18.63% to 16.55% in CIFAR-10 with 4000 labels, and further to 5.12% and 12.16% by enabling the standard augmentations. We additionally obtain a clear improvement in CIFAR-100 classification accuracy by using random images from the Tiny Images dataset as unlabeled extra inputs during training. Finally, we demonstrate good tolerance to incorrect labels.

Question: What is a semi-supervised learning?


Enhancing perceptual and attentional skills requires common demands between the action video games and transfer tasks. Despite increasing evidence that shows action video game play improves perceptual and cognitive skills, the mechanisms of transfer are not well-understood. In line with previous work, we suggest that transfer is dependent upon common demands between the game and transfer task. In the current study, participants played one of four action games with varying speed, visual, and attentional demands for 20 h. We examined whether training enhanced performance for attentional blink, selective attention, attending to multiple items, visual search and auditory detection. Non-gamers who played the game (Modern Combat) with the highest demands showed transfer to tasks of attentional blink and attending to multiple items. The game (MGS Touch) with fewer attentional demands also decreased attentional blink, but to a lesser degree. Other games failed to show transfer, despite having many action game characteristics but at a reduced intensity. The results support the common demands hypothesis.

Question: What is the common demands hypothesis?


Design and Implementation of Energy Management System With Fuzzy Control for DC Microgrid Systems. This paper presents the design and implementation of an energy management system (EMS) with fuzzy control for a dc microgrid system. Modeling, analysis, and control of distributed power sources and energy storage devices with MATLAB/Simulink are proposed, and the integrated monitoring EMS is implemented with LabVIEW. To improve the life cycle of the battery, fuzzy control manages the desired state of charge. The RS-485/ZigBee network has been designed to control the operating mode and to monitor the values of all subsystems in the dc microgrid system.

Question: How to design an energy management system for a dc microgrid?


Explanation of Two Anomalous Results in Statistical Mediation Analysis.. Previous studies of different methods of testing mediation models have consistently found two anomalous results. The first result is elevated Type I error rates for the bias-corrected and accelerated bias-corrected bootstrap tests not found in nonresampling tests or in resampling tests that did not include a bias correction. This is of special concern as the bias-corrected bootstrap is often recommended and used due to its higher statistical power compared with other tests. The second result is statistical power reaching an asymptote far below 1.0 and in some conditions even declining slightly as the size of the relationship between X and M, a, increased. Two computer simulations were conducted to examine these findings in greater detail. Results from the first simulation found that the increased Type I error rates for the bias-corrected and accelerated bias-corrected bootstrap are a function of an interaction between the size of the individual paths making up the mediated effect and the sample size, such that elevated Type I error rates occur when the sample size is small and the effect size of the nonzero path is medium or larger. Results from the second simulation found that stagnation and decreases in statistical power as a function of the effect size of the a path occurred primarily when the path between M and Y, b, was small. Two empirical mediation examples are provided using data from a steroid prevention and health promotion program aimed at high school football players (Athletes Training and Learning to Avoid Steroids; Goldberg et al., 1996), one to illustrate a possible Type I error for the bias-corrected bootstrap test and a second to illustrate a loss in power related to the size of a. Implications of these findings are discussed.

Question: What is the bias-corrected bootstrap?


Autonomous Positioning of Eye Surgical Robot Using the Tool Shadow and Kalman Filtering. Vitreoretinal surgery is one of the most difficult surgical operations, even for experienced surgeons. Thus, a master-slave eye surgical robot has been developed to assist the surgeon in safely performing vitreoretinal surgeries; however, in the master-slave control, the robotic positioning accuracy depends on the surgeon's coordination skills. This paper proposes a new method of autonomous robotic positioning using the shadow of the surgical instrument. First, the microscope image is segmented into three regions—namely, a micropipette, its shadow, and the eye ground—using a Gaussian mixture model (GMM). The tips of the micropipette and its shadow are then extracted from the contour lines of the segmented regions. The micropipette is then autonomously moved down to the simulated eye ground until the distance between the tips of micropipette and its shadow in the microscopic image reaches a predefined threshold. To handle possible occlusions, the tip of the shadow is estimated using a Kalman filter. Experiments to evaluate the robotic positioning accuracy in the vertical direction were performed. The results show that the autonomous positioning using the Kalman filter enhanced the accuracy of robotic positioning.

Question: How to improve the accuracy of the robotic positioning?


G2G interaction among local agencies in developing countries based on diffusion of innovations theory. Technological advancement has allowed governments to meet the demands of its citizens electronically. Electronic government (e-Government) facilitates accurate and fast transactions and delivery of services and information to businesses, citizens, and government agencies. Moreover, e-Government helps enhance democracy. Agencies interact with one another electronically through the e-Government, which enhances efficiency. e-Government utilizes information and communication technology to provide the public access to various services. Leaders and information technology executives in the public sector have recognized the importance of sharing inter-organizational information to improve the efficiency of government agencies. Therefore, this study takes the diffusion of innovations theory as context to identify the most important factor affecting the electronic interaction between local agencies in developing countries.

Question: What is the most important factor affecting the electronic interaction between local agencies in developing countries?


Ridge gap waveguide antenna array using integrated coaxial power divider. A slot array antenna is designed using ridge gap waveguide technology in two sub arrays. Each sub array is fed through a power divider which is designed on a separate ridge- groove gap waveguide. The coupling between two gap waveguides is conducted using coaxial transmission lines. The power divider of ridge-groove gap is fed using coaxial line that can provide a bandwidth of 22% at 14 GHz. The integrated antenna operates within the frequency range of 13.5-15.6 GHz with a gain of 13.9-15.5 dB. Design of the transmission line, power divider and sub-array antenna is presented.

Question: What is the bandwidth of the antenna?


Selective harmonic elimination modulation technique applied on four-leg NPC. In this paper the selective harmonic elimination pulse width modulation (SHE-PWM) technique is proposed to control the three-level four-leg neutral point clamped (NPC) inverter in order to have both advantages of low switching frequency of SHE and neutral point of fourth leg in four wire systems. In this proposed method, the obtained switching angles of inverter phase legs are used to eliminate the non-triplen, 5th to 23th harmonics orders from the output voltage. As well, switching angles calculated for the fourth leg are considered to eliminate the triplen harmonics containing 3th, 9th, 15th, 21th and 27th orders from phase voltage. The efficiency of the proposed modulation technique is verified by simulations of a four leg NPC inverter as an UPS feeding different types of dynamic and unbalanced loads.

Question: What is the neutral point clamped inverter?


The Fog computing paradigm: Scenarios and security issues. Fog Computing is a paradigm that extends Cloud computing and services to the edge of the network. Similar to Cloud, Fog provides data, compute, storage, and application services to end-users. In this article, we elaborate the motivation and advantages of Fog computing, and analyse its applications in a series of real scenarios, such as Smart Grid, smart traffic lights in vehicular networks and software defined networks. We discuss the state-of-the-art of Fog computing and similar work under the same umbrella. Security and privacy issues are further disclosed according to current Fog computing paradigm. As an example, we study a typical attack, man-in-the-middle attack, for the discussion of security in Fog computing. We investigate the stealthy features of this attack by examining its CPU and memory consumption on Fog device.

Question: What is fog computing?


Mr. Bennet, his coachman, and the Archbishop walk into a bar but only one of them gets recognized: On The Difficulty of Detecting Characters in Literary Texts. Characters are fundamental to literary analysis. Current approaches are heavily reliant on NER to identify characters, causing many to be overlooked. We propose a novel technique for character detection, achieving significant improvements over state of the art on multiple datasets.

Question: How to detect characters in literary texts?


How effective is the IEEE 802.11 RTS/CTS handshake in ad hoc networks. IEEE 802.11 MAC mainly relies on two techniques to combat interference: physical carrier sensing and RTS/CTS handshake (also known as "virtual carrier sensing"). Ideally, the RTS/CTS handshake can eliminate most interference. However, the effectiveness of RTS/CTS handshake is based on the assumption that hidden nodes are within transmission range of receivers. In this paper, we prove using analytic models that in ad hoc networks, such an assumption cannot hold due to the fact that power needed for interrupting a packet reception is much lower than that of delivering a packet successfully. Thus, the "virtual carrier sensing" implemented by RTS/CTS handshake cannot prevent all interference as we expect in theory. Physical carrier sensing can complement this in some degree. However, since interference happens at receivers, while physical carrier sensing is detecting transmitters (the same problem causing the hidden terminal situation), physical carrier sensing cannot help much, unless a very large carrier sensing range is adopted, which is limited by the antenna sensitivity. In this paper, we investigate how effective is the RTS/CTS handshake in terms of reducing interference. We show that in some situations, the interference range is much larger than transmission range, where RTS/CTS cannot function well. Then, a simple MAC layer scheme is proposed to solve this problem. Simulation results verify that our scheme can help IEEE 802.11 resolve most interference caused by large interference range.

Question: How effective is the IEEE 802.11 RTS/CTS handshake in ad hoc networks?


An Introductory Study on Time Series Modeling and Forecasting. ACKNOWLEDGEMENT The timely and successful completion of the book could hardly be possible without the helps and supports from a lot of individuals. I will take this opportunity to thank all of them who helped me either directly or indirectly during this important work. First of all I wish to express my sincere gratitude and due respect to my supervisor Dr. R.K. Agrawal, Associate Professor SC & SS, JNU. I am immensely grateful to him for his valuable guidance, continuous encouragements and positive supports which helped me a lot during the period of my work. I would like to appreciate him for always showing keen interest in my queries and providing important suggestions. I also express whole hearted thanks to my friends and classmates for their care and moral supports. The moments, I enjoyed with them during my M.Tech course will always remain as a happy memory throughout my life. I owe a lot to my mother for her constant love and support. She always encouraged me to have positive and independent thinking, which really matter in my life. I would like to thank her very much and share this moment of happiness with her. Last but not the least I am also thankful to entire faculty and staff of SC & SS for their unselfish help, I got whenever needed during the course of my work.ABSTRACT Time series modeling and forecasting has fundamental importance to various practical domains. Thus a lot of active research works is going on in this subject during several years. Many important models have been proposed in literature for improving the accuracy and effeciency of time series modeling and forecasting. The aim of this book is to present a concise description of some popular time series forecasting models used in practice, with their salient features. In this book, we have described three important classes of time series models, viz. the stochastic, neural networks and SVM based models, together with their inherent

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


The Distributed Dissimilar Redundancy Architecture of Fly-by-Wire Flight Control System. This article presents a distributed dissimilar redundancy architecture of fly-by-wire Flight Control System. It is based on many dissimilar flight control computer, redundancy structure which includes the cross arranged hydraulic and power supply, three types of data buses, lots of data correction monitors, a distributed control loop to avoid the correlated faults and achieve the rigid safety airworthiness requirements. A Fault Tree Analysis (FTA) is implemented to verify whether the system safety could meet system design targets.

Question: What is the fault tree analysis?


A Novel DC-Side Zero-Voltage Switching (ZVS) Three-Phase Boost PWM Rectifier Controlled by an Improved SVM Method. A novel active clamping zero-voltage switching three-phase boost pulsewidth modulation (PWM) rectifier is analyzed and a modified minimum-loss space vector modulation (SVM) strategy suitable for the novel zero-voltage switching (ZVS) rectifier is proposed in this paper. The topology of the novel ZVS rectifier only adds one auxiliary active switch, one resonant inductor, and one clamping capacitor to the traditional hard-switched three-phase boost PWM rectifier. With the proposed SVM strategy, the novel ZVS rectifier can achieve ZVS for all the main and auxiliary switches. In addition, the antiparallel diodes can be turned OFF softly, so the reverse recovery current is eliminated. Besides, the voltage stress of all the switches is equal to the dc-link voltage. The operation principle and soft-switching condition of the novel ZVS rectifier are analyzed. The design guidelines of the soft switched circuit parameters are described in detail. A DSP controlled 30 kW prototype is implemented to verify the theory.

Question: What is the novel ZVS three-phase boost PWM rectifier?


A framework for collaborative sensing and processing of mobile data streams: demo. Emerging mobile applications involve continuous sensing and complex computations on sensed data streams. Examples include cognitive apps (e.g., speech recognition, natural language translation, as well as face, object, or gesture detection and recognition) and anticipatory apps that proactively track and provide services when needed. Unfortunately, today's mobile devices cannot keep pace with such apps, despite advances in hardware capability. Traditional approaches address this problem by computation offloading. One approach offloads by sending sensed streams to remote cloud servers via cellular networks or to cloudlets via Wi-Fi, where a clone of the app runs [2, 3, 4]. However, cloudlets may not be widely deployed and access to cloud infrastructure may yield high network delays and can be intermittent due to mobility. Morever, users might hesitate to upload private sensing data to the cloud or cloudlet. A second approach offloads to accelerators by rewriting code to use DSP or GPU within mobile devices. However, using accelerators requires substantial programming effort and produces varied benefits for diverse codes on heterogeneous devices.

Question: What is the difference between cloudlets and cloud servers?


Music Cognition and the Cognitive Sciences. Why should music be of interest to cognitive scientists, and what role does it play in human cognition? We review three factors that make music an important topic for cognitive scientific research. First, music is a universal human trait fulfilling crucial roles in everyday life. Second, music has an important part to play in ontogenetic development and human evolution. Third, appreciating and producing music simultaneously engage many complex perceptual, cognitive, and emotional processes, rendering music an ideal object for studying the mind. We propose an integrated status for music cognition in the Cognitive Sciences and conclude by reviewing challenges and big questions in the field and the way in which these reflect recent developments.

Question: What is the cognitive science of music?


Genetics and Marker-assisted Selection of the Chemotype in Cannabis sativa L.. Cannabis sativa is an interesting crop for several industrial uses, but the legislations in Europe and USA require a tight control of cannabinoid type and content for cultivation and subsidies release. Therefore, cannabinoid survey by gas chromatography of materials under selection is an important step in hemp breeding. In this paper, a number of Cannabis accessions were examined for their cannabinoid composition. Their absolute and relative content was examined, and results are discussed in the light of both the current genetic model for cannabinoid's inheritance, and the legislation's requirements. In addition, the effectiveness of two different types of markers associated to the locus determining the chemotype in Cannabis was evaluated and discussed, as possible tools in marker-assisted selection in hemp, but also for possible applications in the forensic and pharmaceutical fields.

Question: What is the chemotype of cannabis sativa?


Feature Generation Using General Constructor Functions. Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creating an accurate, succinct and comprehensible representation of the target concept. To overcome this problem, researchers have proposed algorithms for automatic construction of features. The majority of these algorithms use a limited predefined set of operators for building new features. In this paper we propose a generalized and flexible framework that is capable of generating features from any given set of constructor functions. These can be domain-independent functions such as arithmetic and logic operators, or domain-dependent operators that rely on partial knowledge on the part of the user. The paper describes an algorithm which receives as input a set of classified objects, a set of attributes, and a specification for a set of constructor functions that contains their domains, ranges and properties. The algorithm produces as output a set of generated features that can be used by standard concept learners to create improved classifiers. The algorithm maintains a set of its best generated features and improves this set iteratively. During each iteration, the algorithm performs a beam search over its defined feature space and constructs new features by applying constructor functions to the members of its current feature set. The search is guided by general heuristic measures that are not confined to a specific feature representation. The algorithm was applied to a variety of classification problems and was able to generate features that were strongly related to the underlying target concepts. These features also significantly improved the accuracy achieved by standard concept learners, for a variety of classification problems.

Question: What is a feature generator?


Real-time large-scale dense RGB-D SLAM with volumetric fusion. We present a new SLAM system capable of producing high quality globally consistent surface reconstructions over hundreds of metres in real-time with only a low-cost commodity RGB-D sensor. By using a fused volumetric surface reconstruction we achieve a much higher quality map over what would be achieved using raw RGB-D point clouds. In this paper we highlight three key techniques associated with applying a volumetric fusion-based mapping system to the SLAM problem in real-time. First, the use of a GPU-based 3D cyclical buffer trick to efficiently extend dense every frame volumetric fusion of depth maps to function over an unbounded spatial region. Second, overcoming camera pose estimation limitations in a wide variety of environments by combining both dense geometric and photometric camera pose constraints. Third, efficiently updating the dense map according to place recognition and subsequent loop closure constraints by the use of an "as-rigid-as-possible" space deformation. We present results on a wide variety of aspects of the system and show through evaluation on de facto standard RGB-D benchmarks that our system performs strongly in terms of trajectory estimation, map quality and computational performance in comparison to other state-of-the-art systems.

Question: What is a dense volumetric fusion?