To Create What You Tell: Generating Videos from Captions. We are creating multimedia contents everyday and everywhere. While automatic content generation has played a fundamental challenge to multimedia community for decades, recent advances of deep learning have made this problem feasible. For example, the Generative Adversarial Networks (GANs) is a rewarding approach to synthesize images. Nevertheless, it is not trivial when capitalizing on GANs to generate videos. The difficulty originates from the intrinsic structure where a video is a sequence of visually coherent and semantically dependent frames. This motivates us to explore semantic and temporal coherence in designing GANs to generate videos. In this paper, we present a novel Temporal GANs conditioning on Captions, namely TGANs-C, in which the input to the generator network is a concatenation of a latent noise vector and caption embedding, and then is transformed into a frame sequence with 3D spatio-temporal convolutions. Unlike the naive discriminator which only judges pairs as fake or real, our discriminator additionally notes whether the video matches the correct caption. In particular, the discriminator network consists of three discriminators: video discriminator classifying realistic videos from generated ones and optimizes video-caption matching, frame discriminator discriminating between real and fake frames and aligning frames with the conditioning caption, and motion discriminator emphasizing the philosophy that the adjacent frames in the generated videos should be smoothly connected as in real ones. We qualitatively demonstrate the capability of our TGANs-C to generate plausible videos conditioning on the given captions on two synthetic datasets (SBMG and TBMG) and one real-world dataset (MSVD). Moreover, quantitative experiments on MSVD are performed to validate our proposal via Generative Adversarial Metric and human study.

Question: How to generate videos from captions?


HyperUAS - Imaging Spectroscopy from a Multirotor Unmanned Aircraft System. One of the key advantages of a low-flying unmanned aircraft system (UAS) is its ability to acquire digital images at an ultrahigh spatial resolution of a few centimeters. Remote sensing of quantitative biochemical and biophysical characteristics of small-sized spatially fragmented vegetation canopies requires, however, not only high spatial, but also high spectral (i.e., hyperspectral) resolution. In this paper, we describe the design, development, airborne operations, calibration, processing, and interpretation of image data collected with a new hyperspectral unmanned aircraft system (HyperUAS). HyperUAS is a remotely controlled multirotor prototype carrying onboard a lightweight pushbroom spectroradiometer coupled with a dual frequency GPS and an inertial movement unit. The prototype was built to remotely acquire imaging spectroscopy data of 324 spectral bands (162 bands in a spectrally binned mode) with bandwidths between 4 and 5 nm at an ultrahigh spatial resolution of 2–5 cm. Three field airborne experiments, conducted over agricultural crops and over natural ecosystems of Antarctic mosses, proved operability of the system in standard field conditions, but also in a remote and harsh, low-temperature environment of East Antarctica. Experimental results demonstrate that HyperUAS is capable of delivering georeferenced maps of quantitative biochemical and biophysical variables of vegetation and of actual vegetation health state at an unprecedented spatial resolution of 5 cm. C © 2014 Wiley Periodicals, Inc.

Question: What is the difference between a pushbroom and a pushbroom spectroradiometer?


Advanced automated SQL injection attacks and defensive mechanisms. SQL Injection vulnerabilities still exist even after almost two decades that it first appeared. In spite of numerous prevention methodologies being used today, web applications still tend to be vulnerable to SQL injection attacks. Technology has improved drastically over the past few years and computers have certainly brought a great impact on our lifestyle. The computer applications and their usage over the web are myriad. It is quite evident that the in the near future, the usage of computers would relatively be higher than what we are witnessing today. A wide variety of data such as credit information, military data, human communication data, and countless types of data is shared over the far-flung computer networks. As the usage and reliability on computers increase, the threat to sensitive data likewise increases. The challenges with the cyber security when dealing with sensitive information is now a nightmare. To help understand the threats and the severity of exploits deployed, the paper provides proof of concepts for exploits carried out to compromise web applications and how the databases are exploited using the SQL injection methodologies. The SQL injection vulnerabilities in the web applications are surprisingly very vast and this is definitely is a huge security threat to personal data of people that is stored on web. In this paper, the methods used in information gathering, how the security is breached, and how payloads are used to exploit web applications are explained using the Kali Linux. In addition, an analysis is carried out on how the websites are comprised. Advanced methods on how to defend SQL injections are briefly justified. For the readers to understand better, a real time scenario of a penetration tester and a database server is set up with a few suppositions, and the commands that dodge the security characteristics and manipulate the databases are explicated.

Question: What is the difference between a penetration tester and a hacker?


High speed locomotion for a quadrupedal microrobot. Research over the past several decades has elucidated some of the mechanisms behind high speed, highly efficient and robust locomotion in insects such as cockroaches. Roboticists have used this information to create biologically-inspired machines capable of running, jumping, and climbing robustly over a variety of terrains. To date, little work has been done to develop an at-scale insect-inspired robot capable of similar feats due to challenges in fabrication, actuation, and electronics integration for a centimeter-scale device. This paper addresses these challenges through the design, fabrication, and control of a 1.27g walking robot, the Harvard Ambulatory MicroRobot (HAMR). The current design is manufactured using a method inspired by pop-up books that enables fast and repeatable assembly of the miniature walking robot. Methods to drive HAMR at low and high speeds are presented, resulting in speeds up to 0.44m/s (10.1 body lengths per second) and the ability to maneuver and control the robot along desired trajectories.

Question: What is the smallest robot that can walk?


Leader Efficacy Linking Leadership to Student Learning : The Contributions of.

Question: What is the leader efficacy linking leadership to student learning?


Social neuroscience evidence for dehumanised perception.

Question: What is social neuroscience evidence for dehumanised perception?


An improved anomaly detection and diagnosis framework for mobile network operators. The ever increasing complexity of commercial mobile networks drives the need for methods capable of reducing human workload required for network troubleshooting. In order to address this issue, several attempts have been made to develop automatic anomaly detection and diagnosis frameworks for mobile network operators. In this paper, the latest improvements introduced to one of those frameworks are discussed, including more sophisticated profiling and detection capabilities. The new algorithms further reduce the need for human intervention related to the proper configuration of the profiling and anomaly detection apparatus. The main concepts of the new approach are described and illustrated with an explanatory showcase featuring performance data from a live 3 G network.

Question: What is the latest improvement in anomaly detection and diagnosis framework for mobile network operators?


Methodology for customer relationship management. Customer relationship management (CRM) is a customer-focused business strategy that dynamically integrates sales, marketing and customer care service in order to create and add value for the company and its customers. This change towards a customer-focused strategy is leading to a strong demand for CRM solutions by companies. However, in spite of companies interest in this new management model, many CRM implementations fail. One of the main reasons for this lack of success is that the existing methodologies being used to approach a CRM project are not adequate, since they do not satisfactorily integrate and complement the strategic and technological aspects of CRM. This paper describes a formal methodology for directing the process of developing and implementing a CRM System that considers and integrates various aspects, such as defining a customer strategy, re-engineering customer-oriented business processes, human resources management, the computer system, management of change and continuous improvement. 2005 Elsevier Inc. All rights reserved.

Question: What is a customer relationship management system?


Learning Kernels for Unsupervised Domain Adaptation with Applications to Visual Object Recognition. Domain adaptation aims to correct the mismatch in statistical properties between the source domain on which a classifier is trained and the target domain to which the classifier is to be applied. In this paper, we address the challenging scenario of unsupervised domain adaptation, where the target domain does not provide any annotated data to assist in adapting the classifier. Our strategy is to learn robust features which are resilient to the mismatch across domains and then use them to construct classifiers that will perform well on the target domain. To this end, we propose novel kernel learning approaches to infer such features for adaptation. Concretely, we explore two closely related directions. In the first direction, we propose unsupervised learning of a geodesic flow kernel (GFK). The GFK summarizes the inner products in an infinite sequence of feature subspaces that smoothly interpolates between the source and target domains. In the second direction, we propose supervised learning of a kernel that discriminatively combines multiple base GFKs. Those base kernels model the source and the target domains at fine-grained granularities. In particular, each base kernel pivots on a different set of landmarks—the most useful data instances that reveal the similarity between the source and the target domains, thus bridging them to achieve adaptation. Our approaches are computationally convenient, automatically infer important hyper-parameters, and are capable of learning features and classifiers discriminatively without demanding labeled data from the target domain. In extensive empirical studies on standard benchmark recognition datasets, our appraches yield state-of-the-art results compared to a variety of competing methods.

Question: What is the difference between unsupervised and supervised domain adaptation?


Visualizing patterns of student engagement and performance in MOOCs. In the last five years, the world has seen a remarkable level of interest in Massive Open Online Courses, or MOOCs. A consistent message from universities participating in MOOC delivery is their eagerness to understand students' online learning processes. This paper reports on an exploratory investigation of students' learning processes in two MOOCs which have different curriculum and assessment designs. When viewed through the lens of common MOOC learning analytics, the high level of initial student interest and, ultimately, the high level of attrition, makes these two courses appear very similar to each other, and to MOOCs in general. With the goal of developing a greater understanding of students' patterns of learning behavior in these courses, we investigated alternative learning analytic approaches and visual representations of the output of these analyses. Using these approaches we were able to meaningfully classify student types and visualize patterns of student engagement which were previously unclear. The findings from this research contribute to the educational community's understanding of students' engagement and performance in MOOCs, and also provide the broader learning analytics community with suggestions of new ways to approach learning analytic data analysis and visualization.

Question: What is a MOOC?


Kalman filtering over a packet-delaying network: A probabilistic approach. In this paper, we consider Kalman filtering over a packet-delaying network. Given the probability distribution of the delay, we can characterize the filter performance via a probabilistic approach. We assume that the estimator maintains a buffer of length D so that at each time k, the estimator is able to retrieve all available data packets up to time k−D+1. Both the cases of sensorwith andwithout necessary computation capability for filter updates are considered. When the sensor has no computation capability, for a givenD, we give lower and upper bounds on the probability forwhich the estimation error covariance is within a prescribed bound. When the sensor has computation capability, we show that the previously derived lower and upper bounds are equal to each other. An approach for determining the minimum buffer length for a required performance in probability is given and an evaluation on the number of expected filter updates is provided. Examples are provided to demonstrate the theory developed in the paper. © 2009 Elsevier Ltd. All rights reserved.

Question: What is the probability that the estimation error covariance is within a prescribed bound?


Stanford's Graph-based Neural Dependency Parser at the CoNLL 2017 Shared Task. This paper describes the neural dependency parser submitted by Stanford to the CoNLL 2017 Shared Task on parsing Universal Dependencies. Our system uses relatively simple LSTM networks to produce part of speech tags and labeled dependency parses from segmented and tokenized sequences of words. In order to address the rare word problem that abounds in languages with complex morphology, we include a character-based word representation that uses an LSTM to produce embeddings from sequences of characters. Our system was ranked first according to all five relevant metrics for the system: UPOS tagging (93.09%), XPOS tagging (82.27%), unlabeled attachment score (81.30%), labeled attachment score (76.30%), and content word labeled attachment score (72.57%).

Question: What is the neural dependency parser?


Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]. Natural language processing (NLP) is a theory-motivated range of computational techniques for the automatic analysis and representation of human language. NLP research has evolved from the era of punch cards and batch processing (in which the analysis of a sentence could take up to 7 minutes) to the era of Google and the likes of it (in which millions of webpages can be processed in less than a second). This review paper draws on recent developments in NLP research to look at the past, present, and future of NLP technology in a new light. Borrowing the paradigm of `jumping curves' from the field of business management and marketing prediction, this survey article reinterprets the evolution of NLP research as the intersection of three overlapping curves-namely Syntactics, Semantics, and Pragmatics Curveswhich will eventually lead NLP research to evolve into natural language understanding.

Question: What is the difference between natural language processing and natural language understanding?


Multiscale Markov Decision Problems: Compression, Solution, and Transfer Learning. Many problems in sequential decision making and stochastic control often have natural multiscale structure: sub-tasks are assembled together to accomplish complex goals. Systematically inferring and leveraging hierarchical structure, particularly beyond a single level of abstraction, has remained a longstanding challenge. We describe a fast multiscale procedure for repeatedly compressing, or homogenizing, Markov decision processes (MDPs), wherein a hierarchy of sub-problems at different scales is automatically determined. Coarsened MDPs are themselves independent, deterministic MDPs, and may be solved using existing algorithms. The multiscale representation delivered by this procedure decouples sub-tasks from each other and can lead to substantial improvements in convergence rates both locally within sub-problems and globally across sub-problems, yielding significant computational savings. A second fundamental aspect of this work is that these multiscale decompositions yield new transfer opportunities across different problems, where solutions of sub-tasks at different levels of the hierarchy may be amenable to transfer to new problems. Localized transfer of policies and potential operators at arbitrary scales is emphasized. Finally, we demonstrate compression and transfer in a collection of illustrative domains, including examples involving discrete and continuous statespaces.

Question: What is a Markov decision process?


Condensation methodologies for two-dimensional non-uniform constellations. Two-dimensional non-uniform constellations (2D-NUC) have been adopted for the most recent terrestrial broadcasting system called ATSC 3.0. They are known for being more efficient than one-dimensional non uniform constellations (1D-NUC) and uniform constellations (UC). They can be used in any communication system with the bit-interleaved coded modulation (BICM) structure. However, one of the main challenges of such constellations is their design for optimal behaviour in a wide range of cases and the design of a demapper that exploits their advantages. This paper presents two different condensation methodologies to design efficient 2D-NUCs simple in design and with limited demapping complexity. The proposal provides a complexity reduction of the design and demapping processes in the range from 13% to 94%. The demapping stage provides performance losses less than 0.1 dB if compared with standard 2D-NUC demapping.

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


A Novel Artificial Bee Colony Algorithm Based on Modified Search Equation and Orthogonal Learning. The artificial bee colony (ABC) algorithm is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, ABC has an insufficiency regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we first propose an improved ABC method called as CABC where a modified search equation is applied to generate a candidate solution to improve the search ability of ABC. Furthermore, we use the orthogonal experimental design (OED) to form an orthogonal learning (OL) strategy for variant ABCs to discover more useful information from the search experiences. Owing to OED's good character of sampling a small number of well representative combinations for testing, the OL strategy can construct a more promising and efficient candidate solution. In this paper, the OL strategy is applied to three versions of ABC, i.e., the standard ABC, global-best-guided ABC (GABC), and CABC, which yields OABC, OGABC, and OCABC, respectively. The experimental results on a set of 22 benchmark functions demonstrate the effectiveness and efficiency of the modified search equation and the OL strategy. The comparisons with some other ABCs and several state-of-the-art algorithms show that the proposed algorithms significantly improve the performance of ABC. Moreover, OCABC offers the highest solution quality, fastest global convergence, and strongest robustness among all the contenders on almost all the test functions.

Question: What is the modified search equation?


METAMEMORY : A THEORETICAL FRAMEWORK AND NEW FINDINGS. Although there has been excellent research by many investigators on the topic of metamemory, here we will focus on our own research program. This article will begin with a description of a theoretical framework that has evolved out of metamemory research, followed by a few remarks about our methodology, and will end with a review of our previously unpublished findings. (Our published findings will not be systematically reviewed here; instead, they will be mentioned only when necessary for continuity .)

Question: What is metamemory?


Degraded dot matrix character recognition using CSM-based feature extraction. This paper presents an OCR method for degraded character recognition applied to a reference number (RN) of 15 printed characters of an invoice document produced by dot-matrix printer. First, the paper deals with the problem of the reference number localization and extraction, in which the characters tops or bottoms are or not touched with a printed reference line of the electrical bill. In case of touched RN, the extracted characters are severely degraded leading to missing parts in the characters tops or bottoms. Secondly, a combined recognition method based on the complementary similarity measure (CSM) method and MLP-based classifier is used. The CSM is used to accept or reject an incoming character. In case of acceptation, the CSM acts as a feature extractor and produces a feature vector of ten component features. The MLP is then trained using these feature vectors. The use of the CSM as a feature extractor tends to make the MLP very powerful and very well suited for rejection. Experimental results on electrical bills show the ability of the model to yield relevant and robust recognition on severely degraded printed characters.

Question: How to recognize a number on an invoice?


Why Lurkers Lurk. The goal of this paper is to address the question: 'why do lurkers lurk?' Lurkers reportedly makeup the majority of members in online groups, yet little is known about them. Without insight into lurkers, our understanding of online groups is incomplete. Ignoring, dismissing, or misunderstanding lurking distorts knowledge of life online and may lead to inappropriate design of online environments. To investigate lurking, the authors carried out a study of lurking using in-depth, semi-structured interviews with ten members of online groups. 79 reasons for lurking and seven lurkers' needs are identified from the interview transcripts. The analysis reveals that lurking is a strategic activity involving more than just reading posts. Reasons for lurking are categorized and a gratification model is proposed to explain lurker behavior.

Question: Why do lurkers lurk?


Mood and Emotions in Small Groups and Work Teams. Affective influences abound in groups. In this article we propose an organizing model for understanding these affective influences and their effects on group life. We begin with individuallevel affective characteristics that members bring to their groups: moods, emotions, sentiments, and emotional intelligence. These affective characteristics then combine to form a group's affective composition. We discuss explicit and implicit processes through which this affective combination occurs by examining the research on emotional contagion, entrainment, modeling, and the manipulation of affect. We also explore how elements of the affective context, such as organizationwide emotion norms and the group's particular emotional history, may serve to constrain or amplify group members' emotions. The outcome, group emotion, results from the combination of the group's affective composition and the affective context in which the group is behaving. Last, we focus on the important interaction between nonaffective factors and affective factors in group life and suggest a possible agenda for future research. q 2001 Academic Press

Question: How do emotions affect groups?


A Survey on Semantic Web Search Engine. The tremendous growth in the volume of data and with the terrific growth of number of web pages, traditional search engines now a days are not appropriate and not suitable anymore. Search engine is the most important tool to discover any information in World Wide Web. Semantic Search Engine is born of traditional search engine to overcome the above problem. The Semantic Web is an extension of the current web in which information is given well-defined meaning. Semantic web technologies are playing a crucial role in enhancing traditional web search, as it is working to create machine readable data. but it will not replace traditional search engine. In this paper we made a brief survey on various promising features of some of the best semantic search engines developed so far and we have discussed the various approaches to semantic search. We have summarized the techniques, advantages of some important semantic web search engines that are developed so far.The most prominent part is that how the semantic search engines differ from the traditional searches and their results are shown by giving a sample query as input.

Question: What is the difference between semantic search engine and traditional search engine?


Cognitive Control Deficits in Schizophrenia: Mechanisms and Meaning. Although schizophrenia is an illness that has been historically characterized by the presence of positive symptomatology, decades of research highlight the importance of cognitive deficits in this disorder. This review proposes that the theoretical model of cognitive control, which is based on contemporary cognitive neuroscience, provides a unifying theory for the cognitive and neural abnormalities underlying higher cognitive dysfunction in schizophrenia. To support this model, we outline converging evidence from multiple modalities (eg, structural and functional neuroimaging, pharmacological data, and animal models) and samples (eg, clinical high risk, genetic high risk, first episode, and chronic subjects) to emphasize how dysfunction in cognitive control mechanisms supported by the prefrontal cortex contribute to the pathophysiology of higher cognitive deficits in schizophrenia. Our model provides a theoretical link between cellular abnormalities (eg, reductions in dentritic spines, interneuronal dysfunction), functional disturbances in local circuit function (eg, gamma abnormalities), altered inter-regional cortical connectivity, a range of higher cognitive deficits, and symptom presentation (eg, disorganization) in the disorder. Finally, we discuss recent advances in the neuropharmacology of cognition and how they can inform a targeted approach to the development of effective therapies for this disabling aspect of schizophrenia.

Question: What is the difference between cognitive control and executive function?


Mining Graphs for Understanding Time-Varying Volumetric Data. A notable recent trend in time-varying volumetric data analysis and visualization is to extract data relationships and represent them in a low-dimensional abstract graph view for visual understanding and making connections to the underlying data. Nevertheless, the ever-growing size and complexity of data demands novel techniques that go beyond standard brushing and linking to allow significant reduction of cognition overhead and interaction cost. In this paper, we present a mining approach that automatically extracts meaningful features from a graph-based representation for exploring time-varying volumetric data. This is achieved through the utilization of a series of graph analysis techniques including graph simplification, community detection, and visual recommendation. We investigate the most important transition relationships for time-varying data and evaluate our solution with several time-varying data sets of different sizes and characteristics. For gaining insights from the data, we show that our solution is more efficient and effective than simply asking users to extract relationships via standard interaction techniques, especially when the data set is large and the relationships are complex. We also collect expert feedback to confirm the usefulness of our approach.

Question: What is a graph-based representation for time-varying volumetric data?


Improvements to BM25 and Language Models Examined. Recent work on search engine ranking functions report improvements on BM25 and Language Models with Dirichlet Smoothing. In this investigation 9 recent ranking functions (BM25, BM25+, BM25T, BM25-adpt, BM25L, TF1°Δ°p×ID, LM-DS, LM-PYP, and LM-PYP-TFIDF) are compared by training on the INEX 2009 Wikipedia collection and testing on INEX 2010 and 9 TREC collections. We find that once trained (using particle swarm optimization) there is very little difference in performance between these functions, that relevance feedback is effective, that stemming is effective, and that it remains unclear which function is best over-all.

Question: What is the best ranking function?


Discovering space - Grounding spatial topology and metric regularity in a naive agent's sensorimotor experience. In line with the sensorimotor contingency theory, we investigate the problem of the perception of space from a fundamental sensorimotor perspective. Despite its pervasive nature in our perception of the world, the origin of the concept of space remains largely mysterious. For example in the context of artificial perception, this issue is usually circumvented by having engineers pre-define the spatial structure of the problem the agent has to face. We here show that the structure of space can be autonomously discovered by a naive agent in the form of sensorimotor regularities, that correspond to so called compensable sensory experiences: these are experiences that can be generated either by the agent or its environment. By detecting such compensable experiences the agent can infer the topological and metric structure of the external space in which its body is moving. We propose a theoretical description of the nature of these regularities and illustrate the approach on a simulated robotic arm equipped with an eye-like sensor, and which interacts with an object. Finally we show how these regularities can be used to build an internal representation of the sensor's external spatial configuration.

Question: How can a robot learn about the world?


Decision Making Under Uncertainty in Visualisation. Decision making under uncertainty can lead to irrational behaviour; such errors are often being referred to as cognitive biases. Related work in this area has tended to focus on the human's analytic and sensemaking processes. This paper puts forward a novel perspective on this, proposing that some cognitive biases can also occur in the process of viewing visualisations. Consequently, this source of error may have a negative impact on decision making. This paper presents examples of situations where cognitive biases in visualisation can occur and outlines a future user study to investigate the anchoring and adjustment cognitive biases in visualisation.

Question: What is the difference between cognitive biases and cognitive errors?


Geodesic weighted Bayesian model for salient object detection. In recent years, a variety of salient object detection methods under Bayesian framework have been proposed and many achieved state of the art. However, those ignore spatial relationships and thus background regions similar to the objects are also highlighted. In this paper, we propose a novel geodesic weighted Bayesian model to address this issue. We consider spatial relationships by attaching more importance to regions which are more likely to be parts of a salient object, thus suppressing background regions. First, we learn a combined similarity via multiple features to measure similarity of adjacent regions. Then, we apply the combined similarity as edge weight to construct an undirected weighted graph and compute geodesic distance. Last, we utilize the geodesic distance to weight the observation likelihood to infer a more precise saliency map. Experiments on several benchmark datasets demonstrate the effectiveness of our model.

Question: What is a geodesic weighted Bayesian model?


BEHIND ADVERTISING : THE LANGUAGE OF PERSUASION Kenechukwu. Advertising is a force that makes it possible to sell more merchandise due to its persuasive nature. As a tool of marketing communication, advertising is the structured and composed, non-personal communication of information. It is usually paid for and usually persuasive in nature. The language of persuasion is employed for successful advertising campaign thereby, boosting patronage of idea, product or service. The persuasive nature of advertising however, has generated criticisms and controversies. Advertising has been vigorously attacked on the ground that it is unnecessary and wasteful and that through it, people are induced to buy worthless products. It is further argued by the objectors that much advertising is misleading and untruthful. Thus, this paper examines how consumers can be persuaded to patronise goods and services advertised.

Question: How can advertising be persuasive?


GCap: Graph-based Automatic Image Captioning. Given an image, how do we automatically assign keywords to it? In this paper, we propose a novel, graph-based approach (GCap) which outperforms previously reported methods for automatic image captioning. Moreover, it is fast and scales well, with its training and testing time linear to the data set size. We report auto-captioning experiments on the "standard" Corel image database of 680 MBytes, where GCap outperforms recent, successful auto-captioning methods by up to 10 percentage points in captioning accuracy (50% relative improvement).

Question: How do we automatically assign keywords to an image?


Internet inter-domain traffic. In this paper, we examine changes in Internet inter-domain traffic demands and interconnection policies. We analyze more than 200 Exabytes of commercial Internet traffic over a two year period through the instrumentation of 110 large and geographically diverse cable operators, international transit backbones, regional networks and content providers. Our analysis shows significant changes in inter-AS traffic patterns and an evolution of provider peering strategies. Specifically, we find the majority of inter-domain traffic by volume now flows directly between large content providers, data center / CDNs and consumer networks. We also show significant changes in Internet application usage, including a global decline of P2P and a significant rise in video traffic. We conclude with estimates of the current size of the Internet by inter-domain traffic volume and rate of annualized inter-domain traffic growth.

Question: What is the size of the internet?


Semantic Sensor Data Search in a Large-Scale Federated Sensor Network. Sensor network deployments are a primary source of massive amounts of data about the real world that surrounds us, measuring a wide range of physical properties in real time. However, in large-scale deployments it becomes hard to effectively exploit the data captured by the sensors, since there is no precise information about what devices are available and what properties they measure. Even when metadata is available, users need to know low-level details such as database schemas or names of properties that are specific to a device or platform. Therefore the task of coherently searching, correlating and combining sensor data becomes very challenging. We propose an ontology-based approach, that consists in exposing sensor observations in terms of ontologies enriched with semantic metadata, providing information such as: which sensor recorded what, where, when, and in which conditions. For this, we allow defining virtual semantic streams, whose ontological terms are related to the underlying sensor data schemas through declarative mappings, and can be queried in terms of a high level sensor network ontology.

Question: What is a semantic sensor data search?


Optimal Cell Load and Throughput in Green Small Cell Networks With Generalized Cell Association. This paper thoroughly explores the fundamental interactions between cell association, cell load, and throughput in a green (energy-efficient) small cell network in which all base stations form a homogeneous Poisson point process (PPP) of intensity λB and all users form another independent PPP of intensity λ∪. Cell voidness, usually disregarded due to rarity in cellular network modeling, is first theoretically analyzed under generalized (channel-aware) cell association (GCA). We show that the void cell probability cannot be neglected any more since it is bounded above by exp(-λ∪/λB) that is typically not small in a small cell network. The accurate expression of the void cell probability for GCA is characterized and it is used to derive the average cell and user throughputs. We learn that cell association and cell load λ∪/λB significantly affect these two throughputs. According to the average cell and user throughputs, the green cell and user throughputs are defined respectively to reflect whether the energy of a base station is efficiently used to transmit information or not. In order to achieve satisfactory throughput with certain level of greenness, cell load should be properly determined. We present the theoretical solutions of the optimal cell loads that maximize the green cell and user throughputs, respectively, and verify their correctness by simulation.

Question: What is the optimal cell load?


High performance communication architecture for smart distribution power grid in developing nations. In a smart distribution power grid, cost efficient and reliable communication architecture plays a crucial role in achieving complete functionality. There are different sets of Quality of Services (QoS) requirements for different data packets transmitting inside the microgrid (a regionally limited smart distribution grid), making it challenging to derive optimal communication architecture. The objective of this research work is to determine the optimal communication technologies for each data packet based on its QoS requirement. In this paper, we have proposed an architecture for a smart distribution power grid with Cyber Physical System enabled microgrids, which accommodate almost all functional requirements of a smart distribution power grid. For easy transition towards optimal communication architecture, we have presented a six-tier communication topology, which is derived from the architecture for a smart distribution power grid. The optimization formulations for each packet structure presented in this paper minimize the overall cost and consider the QoS requirements for each packet. Based on the simulation results, we have made recommendations for optimal communication technologies for each packet and thereby developed a heterogeneous communication architecture for

Question: What is the optimal communication architecture for a smart distribution power grid?


A fuzzy K-nearest neighbor algorithm. Classification of objects is an important area of research and application in a variety of fields. In the presence of full knowledge of the underlying probabilities, Bayes decision theory gives optimal error rates. In those cases where this information is not present, many algorithms make use of distance or similarity among samples as a means of classification. The K-nearest neighbor decision rule has often been used in these pattern recognition problems. One of the difficulties that arises when utilizing this technique is that each of the labeled samples is given equal importance in deciding the class memberships of the pattern to be classified, regardless of their `typicalness'. The theory of fuzzy sets is introduced into the K-nearest neighbor technique to develop a fuzzy version of the algorithm. Three methods of assigning fuzzy memberships to the labeled samples are proposed, and experimental results and comparisons to the crisp version are presented.

Question: What is a fuzzy K-nearest neighbor algorithm?


An Empirical Evaluation of Thompson Sampling. Thompson sampling is one of oldest heuristic to address the e xploration / exploitation trade-off, but it is surprisingly unpopular in t he literature. We present here some empirical results using Thompson sampling on simu lated and real data, and show that it is highly competitive. And since this heuris tic is very easy to implement, we argue that it should be part of the standard bas eline to compare against.

Question: What is the empirical evaluation of Thompson sampling?


An Interleaved Boost Converter With Zero-Voltage Transition. This paper proposes a novel soft-switching interleaved boost converter composed of two shunted elementary boost conversion units and an auxiliary inductor. This converter is able to turn on both the active power switches at zero voltage to reduce their switching losses and evidently raise the conversion efficiency. Since the two parallel-operated elementary boost units are identical, operation analysis and design for the converter module becomes quite simple. A laboratory test circuit is built, and the circuit operation shows satisfactory agreement with the theoretical analysis. The experimental results show that this converter module performs very well with the output efficiency as high as 95%.

Question: How does this converter work?


Mapping Texts: Combining Text-Mining and Geo-Visualization To Unlock The Research Potential of Historical Newspapers. In this paper, we explore the task of automatic text processing applied to collections of historical newspapers, with the aim of assisting historical research. In particular, in this first stage of our project, we experiment with the use of topical models as a means to identify potential issues of interest for historians. 1 Newspapers in Historical Research Surviving newspapers are among the richest sources of information available to scholars studying peoples and cultures of the past 250 years, particularly for research on the history of the United States. Throughout the nineteenth and twentieth centuries, newspapers served as the central venues for nearly all substantive discussions and debates in American society. By the mid-nineteenth century, nearly every community (no matter how small) boasted at least one newspaper. Within these pages, Americans argued with one another over politics, advertised and conducted economic business, and published articles and commentary on virtually all aspects of society and daily life. Only here can scholars find editorials from the 1870s on the latest political controversies, advertisements for the latest fashions, articles on the latest sporting events, and languid poetry from a local artist, all within one source. Newspapers, in short, document more completely the full range of the human experience than nearly any other source available to modern scholars, providing windows into the past available nowhere else. Despite their remarkable value, newspapers have long remained among the most underutilized historical resources. The reason for this paradox is quite simple: the sheer volume and breadth of information available in historical newspapers has, ironically, made it extremely difficult for historians to go through them page-by-page for a given research project. A historian, for example, might need to wade thr

Question: What is the volume of historical newspapers?


Readings in information visualization - using vision to think. Visualization: The use of computer-supported, interactive, visual representations of data to amplify cognition. (6) Cognition is the acquisition or use of knowledge. This definition has the virtue of focusing as much on the purpose of visualization as the means. Hamming (1973) saud, "the purpose of computation is insight, not numbers." Likewise for visualization, "the purpose of visualization is insight not pictures." The main goals of this insight are discovery, decision  making, and explanation. (6)

Question: What is the purpose of visualization?


Nurses' response time to call lights and fall occurrences.. Nurses respond to fallers' call lights more quickly than they do to lights initiated by non-fallers. The nurses' responsiveness to call lights could be a compensatory mechanism in responding to the fall prevalence on the unit.

Question: What is the nurses' response time to call lights?


Cross Domain Regularization for Neural Ranking Models using Adversarial Learning. Unlike traditional learning to rank models that depend on hand-crafted features, neural representation learning models learn higher level features for the ranking task by training on large datasets. Their ability to learn new features directly from the data, however, may come at a price. Without any special supervision, these models learn relationships that may hold only in the domain from which the training data is sampled, and generalize poorly to domains not observed during training. We study the effectiveness of adversarial learning as a cross domain regularizer in the context of the ranking task. We use an adversarial discriminator and train our neural ranking model on a small set of domains. The discriminator provides a negative feedback signal to discourage the model from learning domain specific representations. Our experiments show consistently better performance on held out domains in the presence of the adversarial discriminator---sometimes up to 30% on precision$@1$.

Question: What is adversarial learning?


David J. Chalmers The Singularity A Philosophical Analysis. What happens when machines become more intelligent than humans? One view is that this event will be followed by an explosion to evergreater levels of intelligence, as each generation of machines creates more intelligent machines in turn. This intelligence explosion is now often known as the 'singularity'. The basic argument here was set out by the statistician I.J. Good in his 1965 article 'Speculations Concerning the First Ultraintelligent Machine':

Question: What is the basic argument here?


Device-to-device communications: The physical layer security advantage. In systems that allow device-to-device (D2D) communications, user pairs in close proximity communicate directly without using an access point (AP) as an intermediary. D2D communications leads to improved throughput, reduced power consumption and interference, and more flexible resource allocation. We show that the D2D paradigm also provides significantly improved security at the physical layer, by reducing exposure of the information to eavesdroppers from two relatively high-power transmissions to a single low-power hop. We derive the secrecy outage probability (SOP) for the D2D and cellular systems, and compare performance for D2D scenarios in the presence of a multi-antenna eavesdropper. The cellular approach is only seen to have an advantage in certain cases when the AP has a large number of antennas and perfect channel state information.

Question: What is the difference between D2D and cellular communications?


Client attachment, attachment to the therapist and client-therapist attachment match: how do they relate to change in psychodynamic psychotherapy?. OBJECTIVE We examined the associations between client attachment, client attachment to the therapist, and symptom change, as well as the effects of client-therapist attachment match on outcome. Clients (n = 67) and their therapists (n = 27) completed the ECR to assess attachment.   METHOD Clients completed also the Client Attachment to Therapist scale three times (early, middle, and late sessions) and the OQ-45 at intake and four times over the course of a year of psychodynamic psychotherapy.   RESULTS Clients characterized by avoidant attachment and by avoidant attachment to their therapist showed the least improvement. A low-avoidant client-therapist attachment match led to a greater decrease in symptom distress than when a low-avoidant therapist treated a high-avoidant client.   CONCLUSIONS These findings suggest the importance of considering client-therapist attachment matching and the need to pay attention to the special challenges involved in treating avoidant clients in order to facilitate progress in psychotherapy.

Question: How do attachment styles relate to change in psychodynamic psychotherapy?


Block diagonalization for multi-user MIMO with other-cell interference. Block diagonalization is one approach for linear preceding in the multiple-input multiple-output broadcast channel that sends multiple interference free data streams to different users in the same cell. Unfortunately, block diagonalization neglects other-cell interference (OCI), which limits the performance of users at the edge of the cell. This paper presents an OCI-aware enhancement to block diagonalization that uses a whitening filter for interference suppression at the receiver and a novel precoder using the interference-plus-noise covariance matrix for each user at the transmitter. For complex Gaussian matrix channels, the asymptotic sum rate of the proposed system is analyzed under a large antenna assumption for isotropic inputs and compared to conventional block diagonalization. The capacity loss due to OCI is quantified in terms of results from single-user MIMO capacity. Several numerical examples compare achievable sum rates, the proposed asymptotic rates, and the capacity loss, in low and high interference regimes.

Question: How to block diagonalize for multi-user MIMO with other-cell interference?


System Design for Geosynchronous Synthetic Aperture Radar Missions. Geosynchronous synthetic aperture radar (GEO SAR) has been studied for several decades but has not yet been implemented. This paper provides an overview of mission design, describing significant constraints (atmosphere, orbit, temporal stability of the surface and atmosphere, measurement physics, and radar performance) and then uses these to propose an approach to initial system design. The methodology encompasses all GEO SAR mission concepts proposed to date. Important classifications of missions are: 1) those that require atmospheric phase compensation to achieve their design spatial resolution; and 2) those that achieve full spatial resolution without phase compensation. Means of estimating the atmospheric phase screen are noted, including a novel measurement of the mean rate of change of the atmospheric phase delay, which GEO SAR enables. Candidate mission concepts are described. It seems likely that GEO SAR will be feasible in a wide range of situations, although extreme weather and unstable surfaces (e.g., water, tall vegetation) prevent 100% coverage. GEO SAR offers an exciting imaging capability that powerfully complements existing systems.

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


Visual analysis of self-organizing maps. Abstract. In the article, an additional visualization of self-organizing maps (SOM) has been investigated. The main objective of self-organizing maps is data clustering and their graphical presentation. Opportunities of SOM visualization in four systems (NeNet, SOM-Toolbox, Databionic ESOM and Viscovery SOMine) have been investigated. Each system has its additional tools for visualizing SOM. A comparative analysis has been made for two data sets: Fisher's iris data set and the economic indices of the European Union countries. A new SOM system is also introduced and researched. The system has a specific visualization tool. It is missing in other SOM systems. It helps to see the proportion of neurons, corresponding to the data items, belonging to the different classes, and fallen in the same SOM cell.

Question: What is a self-organizing map?


A Temporal Sequence Learning for Action Recognition and Prediction. In this work1, we present a method to represent a video with a sequence of words, and learn the temporal sequencing of such words as the key information for predicting and recognizing human actions. We leverage core concepts from the Natural Language Processing (NLP) literature used in sentence classification to solve the problems of action prediction and action recognition. Each frame is converted into a word that is represented as a vector using the Bag of Visual Words (BoW) encoding method. The words are then combined into a sentence to represent the video, as a sentence. The sequence of words in different actions are learned with a simple but effective Temporal Convolutional Neural Network (T-CNN) that captures the temporal sequencing of information in a video sentence. We demonstrate that a key characteristic of the proposed method is its low-latency, i.e. its ability to predict an action accurately with a partial sequence (sentence). Experiments on two datasets, UCF101 and HMDB51 show that the method on average reaches 95% of its accuracy within half the video frames. Results, also demonstrate that our method achieves compatible state-of-the-art performance in action recognition (i.e. at the completion of the sentence) in addition to action prediction.

Question: What is the name of the method?


Information theoretic MPC for model-based reinforcement learning. We introduce an information theoretic model predictive control (MPC) algorithm capable of handling complex cost criteria and general nonlinear dynamics. The generality of the approach makes it possible to use multi-layer neural networks as dynamics models, which we incorporate into our MPC algorithm in order to solve model-based reinforcement learning tasks. We test the algorithm in simulation on a cart-pole swing up and quadrotor navigation task, as well as on actual hardware in an aggressive driving task. Empirical results demonstrate that the algorithm is capable of achieving a high level of performance and does so only utilizing data collected from the system.

Question: What is model-based reinforcement learning?


Named Entity Recognition using an HMM-based Chunk Tagger. This paper proposes a Hidden Markov Model (HMM) and an HMM-based chunk tagger, from which a named entity (NE) recognition (NER) system is built to recognize and classify names, times and numerical quantities. Through the HMM, our system is able to apply and integrate four types of internal and external evidences: 1) simple deterministic internal feature of the words, such as capitalization and digitalization; 2) internal semantic feature of important triggers; 3) internal gazetteer feature; 4) external macro context feature. In this way, the NER problem can be resolved effectively. Evaluation of our system on MUC-6 and MUC-7 English NE tasks achieves F-measures of 96.6% and 94.1% respectively. It shows that the performance is significantly better than reported by any other machine-learning system. Moreover, the performance is even consistently better than those based on handcrafted rules.

Question: What is the name of the system?


Sudoku Squares and Chromatic Polynomials. T he Sudoku puzzle has become a very popular puzzle that many newspapers carry as a daily feature. The puzzle consists of a 9×9 grid in which some of the entries of the grid have a number from 1 to 9. One is then required to complete the grid in such a way that every row, every column, and every one of the nine 3× 3 sub-grids contain the digits from 1 to 9 exactly once. The sub-grids are shown in Figure 1.

Question: What is the chromatic polynomial of the sudoku puzzle?


A Social Network-Based Recommender System (SNRS). Social influence plays an important role in product marketing. However, it has rarely been considered in traditional recommender systems. In this paper we present a new paradigm of recommender systems which can utilize information in social networks, including user preferences, an item's general acceptance, and influence from social friends. A probabilistic model is developed to make personalized recommendations from such information. We extract data from a real online social network, and our analysis of this large dataset reveals that friends have a tendency to select the same items and give similar ratings. Experimental results on this dataset show that our proposed system not only improves the prediction accuracy of recommender systems but also remedies the data sparsity and cold-start issues inherent in collaborative filtering. Furthermore, we propose to improve the performance of our system by applying semantic filtering of social networks, and validate its improvement via a class project experiment. In this experiment we demonstrate how relevant friends can be selected for inference based on the semantics of friend relationships and finer-grained user ratings. Such technologies can be deployed by most

Question: What is a social network based recommender system?


Creating people-aware IoT applications by combining design thinking and user-centered design methods. This article presents a methodology based on design thinking and user experience design methods for creating what we call `people-aware' IoT applications, where user needs, not technological opportunities, drive the development. This methodology is divided into 7 steps: discovery, capturing, research, design, prototype, evaluate and refine. The tools used include conventional user experience procedures such as problem identification, group brainstorming, surveys, or interviews, mixed with more IoT-specific design specificities. The results of the methodology include well-described and user-oriented scenarios meeting user's needs and also a complete toolbox to assist the implementation and the testing of abovementioned scenarios in an IoT perspective. The article describes the methodology in detail with the help of a use case conducted in a business environment available for the project that leads to the identification and partial design of concrete people-aware IoT applications in the context of a smart meeting room.

Question: What is a smart meeting room?


Image registration methods: a survey. This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrically align two images (the reference and sensed images). The reviewed approaches are classified according to their nature (areabased and feature-based) and according to four basic steps of image registration procedure: feature detection, feature matching, mapping function design, and image transformation and resampling. Main contributions, advantages, and drawbacks of the methods are mentioned in the paper. Problematic issues of image registration and outlook for the future research are discussed too. The major goal of the paper is to provide a comprehensive reference source for the researchers involved in image registration, regardless of particular application areas. q 2003 Elsevier B.V. All rights reserved.

Question: What is the difference between feature-based and areabased image registration?


Large-scale visual sentiment ontology and detectors using adjective noun pairs. We address the challenge of sentiment analysis from visual content. In contrast to existing methods which infer sentiment or emotion directly from visual low-level features, we propose a novel approach based on understanding of the visual concepts that are strongly related to sentiments. Our key contribution is two-fold: first, we present a method built upon psychological theories and web mining to automatically construct a large-scale Visual Sentiment Ontology (VSO) consisting of more than 3,000 Adjective Noun Pairs (ANP). Second, we propose SentiBank, a novel visual concept detector library that can be used to detect the presence of 1,200 ANPs in an image. The VSO and SentiBank are distinct from existing work and will open a gate towards various applications enabled by automatic sentiment analysis. Experiments on detecting sentiment of image tweets demonstrate significant improvement in detection accuracy when comparing the proposed SentiBank based predictors with the text-based approaches. The effort also leads to a large publicly available resource consisting of a visual sentiment ontology, a large detector library, and the training/testing benchmark for visual sentiment analysis.

Question: What is the largest military in the world?


Validating a Deep Learning Framework by Metamorphic Testing. Deep learning has become an important tool for image classification and natural language processing. However, the effectiveness of deep learning is highly dependent on the quality of the training data as well as the net model for the learning. The training data set for deep learning normally is fairly large, and the net model is pretty complex. It is necessary to validate the deep learning framework including the net model, executing environment, and training data set before it is used for any applications. In this paper, we propose an approach for validating the classification accuracy of a deep learning framework that includes a convolutional neural network, a deep learning executing environment, and a massive image data set. The framework is first validated with a classifier built on support vector machine, and then it is tested using a metamorphic validation approach. The effectiveness of the approach is demonstrated by validating a deep learning classifier for automated classification of biology cell images. The proposed approach can be used for validating other deep learning framework for different applications.

Question: How to validate a deep learning framework?


Neither more nor less: Optimizing thread-level parallelism for GPGPUs. General-purpose graphics processing units (GPGPUs) are at their best in accelerating computation by exploiting abundant thread-level parallelism (TLP) offered by many classes of HPC applications. To facilitate such high TLP, emerging programming models like CUDA and OpenCL allow programmers to create work abstractions in terms of smaller work units, called cooperative thread arrays (CTAs). CTAs are groups of threads and can be executed in any order, thereby providing ample opportunities for TLP. The state-of-the-art GPGPU schedulers allocate maximum possible CTAs per-core (limited by available on-chip resources) to enhance performance by exploiting TLP. However, we demonstrate in this paper that executing the maximum possible number of CTAs on a core is not always the optimal choice from the performance perspective. High number of concurrently executing threads might cause more memory requests to be issued, and create contention in the caches, network and memory, leading to long stalls at the cores. To reduce resource contention, we propose a dynamic CTA scheduling mechanism, called DYNCTA, which modulates the TLP by allocating optimal number of CTAs, based on application characteristics. To minimize resource contention, DYNCTA allocates fewer CTAs for applications suffering from high contention in the memory sub-system, compared to applications demonstrating high throughput. Simulation results on a 30-core GPGPU platform with 31 applications show that the proposed CTA scheduler provides 28% average improvement in performance compared to the existing CTA scheduler.

Question: How many threads can be executed on a gpu?


Time Series Featurization via Topological Data Analysis: an Application to Cryptocurrency Trend Forecasting. We propose a novel methodology for feature extraction from time series data based on topological data analysis. The proposed procedure applies a dimensionality reduction technique via principal component analysis to the point cloud of the Takens' embedding from the observed time series and then evaluates the persistence landscape and silhouettes based on the corresponding Rips complex. We define a new notion of Rips distance function that is especially suited for persistence homologies built on Rips complexes and prove stability theorems for it. We use these results to demonstrate in turn some stability properties of the topological features extracted using our procedure with respect to additive noise and sampling. We further apply our method to the problem of trend forecasting for cryptocurrency prices, where we manage to achieve significantly lower error rates than more standard, non TDA-based methodologies in complex pattern classification tasks. We expect our method to provide a new insight on feature engineering for granular, noisy time series data.

Question: What is a time series?


Ultra Low Power Wake-Up Radios: A Hardware and Networking Survey. In wireless environments, transmission and reception costs dominate system power consumption, motivating research effort on new technologies capable of reducing the footprint of the radio, paving the way for the Internet of Things. The most important challenge is to reduce power consumption when receivers are idle, the so called idle-listening cost. One approach proposes switching off the main receiver, then introduces new wake-up circuitry capable of detecting an incoming transmission, optionally discriminating the packet destination using addressing, then switching on the main radio only when required. This wake-up receiver technology represents the ultimate frontier in low power radio communication. In this paper, we present a comprehensive literature review of the research progress in wake-up radio (WuR) hardware and relevant networking software. First, we present an overview of the WuR system architecture, including challenges to hardware design and a comparison of solutions presented throughout the last decade. Next, we present various medium access control and routing protocols as well as diverse ways to exploit WuRs, both as an extension of pre-existing systems and as a new concept to manage low-power networking.

Question: What is the idle listening cost?


Colour spaces: perceptual, historical and applicational background. Absnacr-In this paper we present an overview of colour spaces used In electrical engineering and image processing. We Streis the imparfance of the perceptual, historical and sppllcananal~hackgraund that led to a colour spare. The colour spaces presented are : RGB;opponentsolours rpsces, phenomenal colaur spscer, CMY, CMYK, TV colour s~aces (UW and YIQ), PhotoYCC, CIE XYZ, Lab and Luv colour spaces. Keywordr-colaur spaces, RGB, HSV, CIE

Question: What colour spaces are used in electrical engineering and image processing?


Enhancing Supervised Learning with Unlabeled Data. In many practical learning scenarios, there is a small amount of labeled data along with a large pool of unlabeled data. Many supervised learning algorithms have been developed and extensively studied. We present a new \co-training" strategy for using un-labeled data to improve the performance of standard supervised learning algorithms. Unlike much of the prior work, such as the co-training procedure of Blum and Mitchell (1998), we do not assume there are two redundant views both of which are suucient for classiication. The only requirement our co-training strategy places on each supervised learning algorithm is that its hypothesis partitions the example space into a set of equivalence classes (e.g. for a decision tree each leaf deenes an equivalence class). We evaluate our co-training strategy via experiments using data from the UCI repository.

Question: What is the difference between supervised learning and unsupervised learning?


Minimum Complexity Echo State Network. Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the reservoir) and an adaptable readout form the state space. The reservoir is supposed to be sufficiently complex so as to capture a large number of features of the input stream that can be exploited by the reservoir-to-output readout mapping. The field of RC has been growing rapidly with many successful applications. However, RC has been criticized for not being principled enough. Reservoir construction is largely driven by a series of randomized model-building stages, with both researchers and practitioners having to rely on a series of trials and errors. To initialize a systematic study of the field, we concentrate on one of the most popular classes of RC methods, namely echo state network, and ask: What is the minimal complexity of reservoir construction for obtaining competitive models and what is the memory capacity (MC) of such simplified reservoirs? On a number of widely used time series benchmarks of different origin and characteristics, as well as by conducting a theoretical analysis we show that a simple deterministically constructed cycle reservoir is comparable to the standard echo state network methodology. The (short-term) of linear cyclic reservoirs can be made arbitrarily close to the proved optimal value.

Question: What is the minimal complexity of reservoir construction for obtaining competitive models?


Marine debris in central California: quantifying type and abundance of beach litter in Monterey Bay, CA.. Monitoring beach litter is essential for reducing ecological threats towards humans and wildlife. In Monterey Bay, CA information on seasonal and spatial patterns is understudied. Central California's coastal managers require reliable information on debris abundance, distribution, and type, to support policy aimed at reducing litter. We developed a survey method that allowed for trained citizen scientists to quantify the types and abundance of beach litter. Sampling occurred from July 2009-June 2010. Litter abundance ranged from 0.03 to 17.1 items m(-2). Using a mixed model approach, we found season and location have the greatest effect on litter abundance. Styrofoam, the most numerically abundant item, made up 41% of the total amount of litter. Unexpected items included fertilizer pellets. The results of this study provide a baseline on the types and abundance of litter on the central coast and have directly supported policy banning Styrofoam take out containers from local municipalities.

Question: What is the most common type of litter on the central coast?


An Efficient & Secure Content Contribution and Retrieval content in Online Social Networks using Level-level Security Optimization & Content Visualization Algorithm. Received Nov 14, 2017 Revised Jan 26, 2018 Accepted Feb 11, 2018 Online Social Networks (OSNs) is currently popular interactive media to establish the communication, share and disseminate a considerable amount of human life data. Daily and continuous communications imply the exchange of several types of content, including free text, image, audio, and video data. Security is one of the friction points that emerge when communications get mediated in Online Social Networks (OSNs). However, there are no contentbased preferences supported, and therefore it is not possible to prevent undesired messages. Providing the service is not only a matter of using previously defined web content mining and security techniques. To overcome the issues, Level-level Security Optimization & Content Visualization Algorithm is proposed to avoid the privacy issues during content sharing and data visualization. It adopts level by level privacy based on user requirement in the social network. It evaluates the privacy compatibility in the online social network environment to avoid security complexities. The mechanism divided into three parts namely like online social network platform creation, social network privacy, social network within organizational privacy and network controlling and authentication. Based on the experimental evaluation, a proposed method improves the privacy retrieval accuracy (PRA) 9.13% and reduces content retrieval time (CRT) 7 milliseconds and information loss (IL) 5.33%.

Question: How to improve the privacy retrieval accuracy?


To recognize shapes, first learn to generate images.. The uniformity of the cortical architecture and the ability of functions to move to different areas of cortex following early damage strongly suggest that there is a single basic learning algorithm for extracting underlying structure from richly structured, high-dimensional sensory data. There have been many attempts to design such an algorithm, but until recently they all suffered from serious computational weaknesses. This chapter describes several of the proposed algorithms and shows how they can be combined to produce hybrid methods that work efficiently in networks with many layers and millions of adaptive connections.

Question: What is the basic learning algorithm for extracting underlying structure from richly structured, high-dimensional sensory data?


Supply Chain Management ( SCM ) and Organizational Key Factors for Successful Implementation of Enterprise Resource Planning ( ERP ) Systems. This paper reports some findings of an on-going research into ERP implementation issues. A part of the research, which this paper reports, consists of reviewing several cases of successful implementations of ERP systems. The analysis of all these cases revealed that the critical factors for successful implementation of ERP systems fall into two main categories: technological and organizational factors. However, the organizational factors seem to be more important than the technological ones as far as the successful implementation of ERP systems under SCM is concerned.

Question: What are the organizational factors for successful implementation of ERP systems?


A Parallel Proximal Algorithm for Anisotropic Total Variation Minimization. Total variation (TV) is a one of the most popular regularizers for stabilizing the solution of ill-posed inverse problems. This paper proposes a novel proximal-gradient algorithm for minimizing TV regularized least-squares cost functionals. Unlike traditional methods that require nested iterations for computing the proximal step of TV, our algorithm approximates the latter with several simple proximals that have closed form solutions. We theoretically prove that the proposed parallel proximal method achieves the TV solution with arbitrarily high precision at a global rate of converge that is equivalent to the fast proximal-gradient methods. The results in this paper have the potential to enhance the applicability of TV for solving very large-scale imaging inverse problems.

Question: What is a proximal algorithm?


Discontinuous-Current Mode Operation of a Two-Phase Interleaved Boost DC–DC Converter With Coupled Inductor. A two-phase interleaved boost dc–dc converter with an inversely coupled inductor in a discontinuous-current mode (DCM) is analyzed by the equivalent inductance method. Coupling effects on the circuit statuses are described, and a forced conduction of the power diode or reverse-paralleled diode of MOSFET is caused by coupling. As a result, three major circuit statuses are figured out according to the physical relationship between the input–output voltage ratio and the coupling coefficient, and their condition boundaries are used to classify the DCM operation modes. Then, considering the load (duty cycle) variation, ten DCM operation modes are comprehensively analyzed. The analysis can be used to make an easy prediction of operation modes, and extended to the analysis of an interleaved buck converter or buck/boost bidirectional converter with a coupled inductor in DCM. At last, a 300-W prototype is built and tested in the lab to verify the analysis.

Question: How to analyze the operation modes of a two-phase interleaved boost dc–dc converter with a coupled inductor in DCM?


Visfer: Camera-based visual data transfer for cross-device visualization. Going beyond the desktop to leverage novel devices—such as smartphones, tablets, or large displays—for visual sensemaking typically requires supporting extraneous operations for device discovery, interaction sharing, and view management. Such operations can be time-consuming and tedious, and distract the user from the actual analysis. Embodied interaction models in these multi-device environments can take advantage of the natural interaction and physicality afforded by multimodal devices and help effectively carry out these operations in visual sensemaking. In this paper, we present cross-device interaction models for visualization spaces, that are embodied in nature, by conducting a user study to elicit actions from participants that could trigger a portrayed effect of sharing visualizations (and therefore information) across devices. We then explore one common interaction style from this design elicitation called Visfer, a technique for effortlessly sharing visualizations across devices using the visual medium. More specifically, this technique involves taking pictures of visualizations, or rather the QR codes augmenting them, on a display using the built-in camera on a handheld device. Our contributions include a conceptual framework for cross-device interaction and the Visfer technique itself, as well as transformation guidelines to exploit the capabilities of each specific device and a web framework for encoding visualization components into animated QR codes, which capture multiple frames of QR codes to embed more information. Beyond this, we also present the results from a performance evaluation for the visual data transfer enabled by Visfer. We end the paper by presenting the application examples of our Visfer framework.

Question: How to transfer visualizations across devices?


Broadband Radial Waveguide Spatial Combiner. A broadband eight-way spatial combiner using coaxial probes and radial waveguides has been proposed and designed. The simple electromagnetic modeling for the radial waveguide power divider/combiner has been developed using equivalent-circuit method. The measured 10-dB return loss and 1-dB insertion loss bandwidth of this waveguide spatial combiner are all demonstrated to be about 8 GHz.

Question: What is a broadband radial waveguide spatial combiner?


Comparison of SVM and ANN for classification of eye events in EEG. The eye events (eye blink, eyes close and eyes open) are usually considered as biological artifacts in the electroencephalographic (EEG) signal. One can control his or her eye blink by proper training and hence can be used as a control signal in Brain Computer Interface (BCI) applications. Support vector machines (SVM) in recent years proved to be the best classification tool. A comparison of SVM with the Artificial Neural Network (ANN) always provides fruitful results. A one-against-all SVM and a multilayer ANN is trained to detect the eye events. A comparison of both is made in this paper.

Question: What is the best classification tool?


ShoeSoleSense: proof of concept for a wearable foot interface for virtual and real environments. ShoeSoleSense is a proof of concept, novel body worn interface - an insole that enables location independent hands-free interaction through the feet. Forgoing hand or finger interaction is especially beneficial when the user is engaged in real world tasks. In virtual environments as moving through safety training applications is often conducted via finger input, which is not very suitable. To enable a more intuitive interaction, alternative control concepts utilize gesture control, which is usually tracked by statically installed cameras in CAVE-like-installations. Since tracking coverage is limited, problems may also occur. The introduced prototype provides a novel control concept for virtual reality as well as real life applications. Demonstrated functions include movement control in a virtual reality installation such as moving straight, turning and jumping. Furthermore the prototype provides additional feedback by heating up the feet and vibrating in dedicated areas on the surface of the insole.

Question: What is a proof of concept?


High-Sensitivity Software-Configurable 5.8-GHz Radar Sensor Receiver Chip in 0.13-$\mu$ m CMOS for Noncontact Vital Sign Detection. In this paper, analyses on sensitivity and link budget have been presented to guide the design of high-sensitivity noncontact vital sign detector. Important design issues such as flicker noise, baseband bandwidth, and gain budget have been discussed with practical considerations of analog-to-digital interface and signal processing methods in noncontact vital sign detection. Based on the analyses, a direct-conversion 5.8-GHz radar sensor chip with 1-GHz bandwidth was designed and fabricated. This radar sensor chip is software configurable to set the operation point and detection range for optimal performance. It integrates all the analog functions on-chip so that the output can be directly sampled for digital signal processing. Measurement results show that the fabricated chip has a sensitivity of better than -101 dBm for ideal detection in the absence of random body movement. Experiments have been performed successfully in laboratory environment to detect the vital signs of human subjects.

Question: What is the sensitivity of the radar sensor chip?


A Survey on M2M Systems for mHealth: A Wireless Communications Perspective. In the new era of connectivity, marked by the explosive number of wireless electronic devices and the need for smart and pervasive applications, Machine-to-Machine (M2M) communications are an emerging technology that enables the seamless device interconnection without the need of human interaction. The use of M2M technology can bring to life a wide range of mHealth applications, with considerable benefits for both patients and healthcare providers. Many technological challenges have to be met, however, to ensure the widespread adoption of mHealth solutions in the future. In this context, we aim to provide a comprehensive survey on M2M systems for mHealth applications from a wireless communication perspective. An end-to-end holistic approach is adopted, focusing on different communication aspects of the M2M architecture. Hence, we first provide a systematic review ofWireless Body Area Networks (WBANs), which constitute the enabling technology at the patient's side, and then discuss end-to-end solutions that involve the design and implementation of practical mHealth applications. We close the survey by identifying challenges and open research issues, thus paving the way for future research opportunities.

Question: What is the size of the canadian military?


A Survey of First-Order Probabilistic Models. There has been a long standing division in Artificial Intelligence between logical and probabilistic reasoning approaches. While probabilistic models can deal well with inherent uncertainty in many real-world domains, they operate on a mostly propositional level. Logic systems, on the other hand, can deal with much richer representations, especially first-order ones, but treat uncertainty only in limited ways. Therefore, an integration of these types of inference is highly desirable, and many approaches have been proposed, especially from the 1990s on. These solutions come from many different subfields and vary greatly in language, features and (when available at all) inference algorithms. Therefore their relation to each other is not always clear, as well as their semantics. In this survey, we present the main aspects of the solutions proposed and group them according to language, semantics and inference algorithm. In doing so, we draw relations between them and discuss particularly important choices and tradeoffs.

Question: What is a first-order probabilistic model?


Adaptive Sharing for Online Social Networks: A Trade-off Between Privacy Risk and Social Benefit. Online social networks such as Facebook allow users to control which friend sees what information, but it can be a laborious process for users to specify every receiver for each piece of information they share. Therefore, users usually group their friends into social circles, and select the most appropriate social circle to share particular information with. However, social circles are not formed for setting privacy policies, and even the most appropriate social circle still cannot adapt to the changes of users' privacy requirements influenced by the changes in context. This problem drives the need for better privacy control which can adaptively filter the members in a selected social circle to satisfy users' requirements while maintaining users' social needs. To enable such adaptive sharing, this paper proposes a utility-based trade-off framework that models users' concerns (i.e. Potential privacy risks) and incentives of sharing (i.e. Potential social benefits), and quantifies users' requirements as a trade-off between these two types of utilities. By balancing these two metrics, our framework suggests a subset of a selected circle that aims to maximise users' overall utility of sharing. Numerical simulation results compare the outcome of three sharing strategies in randomly changing contexts.

Question: How to model users' concerns and incentives of sharing?


The Fifth 'CHiME' Speech Separation and Recognition Challenge: Dataset, Task and Baselines. The CHiME challenge series aims to advance robust automatic speech recognition (ASR) technology by promoting research at the interface of speech and language processing, signal processing, and machine learning. This paper introduces the 5th CHiME Challenge, which considers the task of distant multimicrophone conversational ASR in real home environments. Speech material was elicited using a dinner party scenario with efforts taken to capture data that is representative of natural conversational speech and recorded by 6 Kinect microphone arrays and 4 binaural microphone pairs. The challenge features a single-array track and a multiple-array track and, for each track, distinct rankings will be produced for systems focusing on robustness with respect to distant-microphone capture vs. systems attempting to address all aspects of the task including conversational language modeling. We discuss the rationale for the challenge and provide a detailed description of the data collection procedure, the task, and the baseline systems for array synchronization, speech enhancement, and conventional and end-to-end ASR.

Question: What is the CHiME challenge?


On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas. This paper is motivated by the need for fundamental understanding of ultimate limits of bandwidth efficient delivery of higher bit-rates in digital wireless communications and to also begin to look into how these limits might be approached. We examine exploitation of multi-element array (MEA) technology, that is processing the spatial dimension (not just the time dimension) to improve wireless capacities in certain applications. Specifically, we present some basic information theory results that promise great advantages of using MEAs in wireless LANs and building to building wireless communication links. We explore the important case when the channel characteristic is not available at the transmitter but the receiver knows (tracks) the characteristic which is subject to Rayleigh fading. Fixing the overall transmitted power, we express the capacity offered by MEA technology and we see how the capacity scales with increasing SNR for a large but practical number, , of antenna elements at bothtransmitter and receiver. We investigate the case of independent Rayleigh faded paths between antenna elements and find that with high probability extraordinary capacity is available. Compared to the baseline n = 1 case, which by Shannon's classical formula scales as one more bit/cycle for every 3 dB of signal-to-noise ratio (SNR) increase, remarkably with MEAs, the scaling is almost like n more bits/cycle for each 3 dB increase in SNR. To illustrate how great this capacity is, even for small n, take the cases n = 2, 4 and 16 at an average received SNR of 21 dB. For over 99% of the channels the capacity is about 7, 19 and 88 bits/cycle respectively, while if n = 1 there is only about 1.2 bit/cycle at the 99% level. For say a symbol rate equal to the channel bandwith, since it is the bits/symbol/dimension that is relevant for signal constellations, these higher capacities are not unreasonable.

Question: What is the capacity of wireless communications?


On computable numbers, with an application to the Entscheidungsproblem. The "computable" numbers may be described briefly as the real numbers whose expressions as a decimal are calculable by finite means. Although the subject of this paper is ostensibly the computable numbers. it is almost equally easy to define and investigate computable functions of an integral variable or a real or computable variable, computable predicates, and so forth. The fundamental problems involved are, however, the same in each case, and I have chosen the computable numbers for explicit treatment as involving the least cumbrous technique. I hope shortly to give an account of the relations of the computable numbers, functions, and so forth to one another. This will include a development of the theory of functions of a real variable expressed in terms of computable numbers. According to my definition, a number is computable if its decimal can be written down by a machine.

Question: What is the computable numbers?


Monolithic CMOS distributed amplifier and oscillator. CMOS implementations for RF applications often employ technology modifications to reduce the silicon substrate loss at high frequencies. The most common techniques include the use of a high-resistivity substrate (/spl rho/>10 /spl Omega/-cm) or silicon-on-insulator (SOI) substrate and precise bondwire inductors. However, these techniques are incompatible with low-cost CMOS manufacture. This design demonstrates use of CMOS with a conventional low-resistivity epi-substrate and on-chip inductors for applications above 10 GHz.

Question: What is the difference between a monolithic CMOS amplifier and oscillator?


Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f/spl isin/C/sup N/ and a randomly chosen set of frequencies /spl Omega/. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set /spl Omega/? A typical result of this paper is as follows. Suppose that f is a superposition of |T| spikes f(t)=/spl sigma//sub /spl tau//spl isin/T/f(/spl tau/)/spl delta/(t-/spl tau/) obeying |T|/spl les/C/sub M//spl middot/(log N)/sup -1/ /spl middot/ |/spl Omega/| for some constant C/sub M/>0. We do not know the locations of the spikes nor their amplitudes. Then with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the /spl lscr//sub 1/ minimization problem. In short, exact recovery may be obtained by solving a convex optimization problem. We give numerical values for C/sub M/ which depend on the desired probability of success. Our result may be interpreted as a novel kind of nonlinear sampling theorem. In effect, it says that any signal made out of |T| spikes may be recovered by convex programming from almost every set of frequencies of size O(|T|/spl middot/logN). Moreover, this is nearly optimal in the sense that any method succeeding with probability 1-O(N/sup -M/) would in general require a number of frequency samples at least proportional to |T|/spl middot/logN. The methodology extends to a variety of other situations and higher dimensions. For example, we show how one can reconstruct a piecewise constant (one- or two-dimensional) object from incomplete frequency samples - provided that the number of jumps (discontinuities) obeys the condition above - by minimizing other convex functionals such as the total variation of f.

Question: What is the difference between a convex optimization problem and a linear programming problem?


Dynamic Filters in Graph Convolutional Networks. Convolutional neural networks (CNNs) have massively impacted visual recognition in 2D images, and are now ubiquitous in state-of-the-art approaches. While CNNs naturally extend to other domains, such as audio and video, where data is also organized in rectangular grids, they do not easily generalize to other types of data such as 3D shape meshes, social network graphs or molecular graphs. To handle such data, we propose a novel graph-convolutional network architecture that builds on a generic formulation that relaxes the 1-to-1 correspondence between filter weights and data elements around the center of the convolution. The main novelty of our architecture is that the shape of the filter is a function of the features in the previous network layer, which is learned as an integral part of the neural network. Experimental evaluations on digit recognition, semi-supervised document classification, and 3D shape correspondence yield state-of-the-art results, significantly improving over previous work for shape correspondence.

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


Auto-Encoding User Ratings via Knowledge Graphs in Recommendation Scenarios. In the last decade, driven also by the availability of an unprecedented computational power and storage capabilities in cloud environments, we assisted to the proliferation of new algorithms, methods, and approaches in two areas of artificial intelligence: knowledge representation and machine learning. On the one side, the generation of a high rate of structured data on the Web led to the creation and publication of the so-called knowledge graphs. On the other side, deep learning emerged as one of the most promising approaches in the generation and training of models that can be applied to a wide variety of application fields. More recently, autoencoders have proven their strength in various scenarios, playing a fundamental role in unsupervised learning. In this paper, we instigate how to exploit the semantic information encoded in a knowledge graph to build connections between units in a Neural Network, thus leading to a new method, SEM-AUTO, to extract and weight semantic features that can eventually be used to build a recommender system. As adding content-based side information may mitigate the cold user problems, we tested how our approach behaves in the presence of a few ratings from a user on the Movielens 1M dataset and compare results with BPRSLIM.

Question: What is the difference between knowledge graphs and knowledge bases?


Authenticated storage using small trusted hardware. A major security concern with outsourcing data storage to third-party providers is authenticating the integrity and freshness of data. State-of-the-art software-based approaches require clients to maintain state and cannot immediately detect forking attacks, while approaches that introduce limited trusted hardware (e.g., a monotonic counter) at the storage server achieve low throughput. This paper proposes a new design for authenticating data storage using a small piece of high-performance trusted hardware attached to an untrusted server. The proposed design achieves significantly higher throughput than previous designs. The server-side trusted hardware allows clients to authenticate data integrity and freshness without keeping any mutable client-side state. Our design achieves high performance by parallelizing server-side authentication operations and permitting the untrusted server to maintain caches and schedule disk writes, while enforcing precise crash recovery and write access control.

Question: What is a monotonic counter?


Affect in Human-Robot Interaction. More and more, robots are expected to interact with humans in a social, easily understandable manner, which presupposes effective use of robot affect. This chapter provides a brief overview of research advances into this important aspect of human-robot interaction. Keywords: human-robot interaction, affective robotics, robot behavior I. Introduction    and    Motivation Humans possess an amazing capability of attributing life and affect to inanimate objects (Reeves and Nass 96, Melson et al 09). Robots take this to the next level, even beyond that of virtual characters due to their embodiment and situatedness. They offer the opportunity for people to bond with them by maintaining a physical presence in their world, in some ways comparable to other beings, such as fellow humans and pets. This raises a broad range of questions in terms of the role of affect in human-robot interaction (HRI), which will be discussed in this article: • What is the role of affect for a robot and in what ways can it add value and risk to humanrobot relationships? Can robots be companions, friends, even intimates to people? • Is it necessary for a robot to actually experience emotion in order to convey its internal state to a person? Is emotion important in enhancing HRI and if so when and where? • What approaches, theories, representations, and experimental methods inform affective HRI research? Report Documentation Page Form Approved OMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden, to Washington Headquarters Services, Directorate for Information Operations an

Question: What is the role of affect for a robot and in what ways can it add value and risk to humanrobot relationships? Can robots be companions, friends, even intimates to people?


A 0.7V Fully-on-Chip Pseudo-Digital LDO Regulator with 6.3μA Quiescent Current and 100mV Dropout Voltage in 0.18-μm CMOS. This paper presents an NMOS pseudo-digital low-dropout (PD-LDO) regulator that supports low-voltage operation by eliminating the amplifier of an analog LDO. The proposed pseudo-digital control loop consists of a latched comparator, a 2X charge pump and a RC network. It detects the output voltage and provides a continuous gate control signal for the power transistor by charging and discharging the RC network. Fast transient response is achieved due to the source follower structure of the power NMOS, with a small output capacitor and small occupied chip area and without consuming large quiescent current. The proof-of-concept design of the proposed PD-LDO is implemented in a 0.18-J.1m CMOS process. The minimum supply voltage is 0.7 V, with a dropout voltage of 100 mV and a maximum load current of 100 mA. Using only 20 pF of on-chip output capacitor and 10 MHz comparator clock frequency, the undershoot is 106 mV with 90 mA load current step and 150 ns edge time. The quiescent current is only 6.3 μA and the active chip area is 0.08 mm2.

Question: What is a pseudo-digital LDO?