Community Detection in Temporal Networks. Many complex systems in nature, society and technologyfrom the online social networks to the internet from the nervous system to power gridscan be represented as a graph of vertices interconnected by edges. Small world network, Scale free network, Community detection are fundamental properties of complex networks. Community is a sub graph with densely connected nodes typically reveals topological relations, network structure, organizational and functional characteristics of the underlying network, e.g., friendships on Facebook, Followers of a VIP account on Twitter, and interaction with business professionals on LinkedIn. Online social networks are dynamic in nature, they evolve in size and space rapidly. In this paper we are detecting incremental disjoint communities using dyanamic multi label propagation algorithm. It tackles the temporal event changes, i.e., addition, deletion of an edge or vertex in a sub graph for every timestamp. The experimental results on Enron real network dataset shows that the proposed method is quite well in identifying communities.

Question: How to detect communities in temporal networks?


Rationalizing Sentiment Analysis in Tensorflow. Sentiment analysis using deep learning models is a leading subject of interest in Natural Language Processing that is as powerful as it is opaque. Current state-ofthe-art models can produce accurate predictions, but they provide little insight as to why the model predicted this sentiment. Businesses relying on these models might be less likely to act on insight given the lack of evidence for predictions. These people would be more likely to trust such predictions if a brief explanation of the outcome is provided. Recent work by Lei et al [4]. has set forth a framework for a multi-aspect sentiment analysis concurrently providing text rationalization with each prediction. This framework sets forth a two-part approach, which summarizes a review and predicts a sentiment. In this paper, we explore the performance of this framework, seeking to recreate and improve upon it in TensorFlow.

Question: What is the framework for sentiment analysis?


Key parameters influencing the behavior of Steel Plate Shear Walls (SPSW). The complex behavior of Steel Plate Shear Walls (SPSW) is investigated herein through nonlinear FE simulations. A 3D detailed FE model is developed and validated utilizing experimental results available in the literature. The influence of key parameters on the structural behavior is investigated. The considered parameters are: the infill plate thickness, the beam size, the column size, the infill plate material grade and the frame material grade. Several structural responses are used as criteria to quantify their influence on the SPSW behavior. The evaluated structural responses are: yield strength, yield displacement, ultimate strength, initial stiffness and secondary stiffness. The results show that, overall the most influential parameter is the infill plate thickness followed by the beam size. Also, it was found that the least influential parameter is the frame material grade.

Question: What is the most influential parameter on the behavior of steel plate shear walls?


Teaching Virtualization by Building a Hypervisor. Virtual machines (VMs) are an increasingly ubiquitous feature of modern computing, yet the interested student or professional has limited resources to learn how VMs work. In particular, there is a lack of "hands-on" exercises in constructing a virtual machine monitor (VMM, or hypervisor), which are both simple enough to understand completely but realistic enough to capture the practical challenges in using this technology. This paper describes a set of assignments to extend a small, pedagogical operating system (OS) to form a hypervisor and host itself. This pedagogical hypervisor, called HOSS, adds roughly 1,000 lines of code to the MIT JOS source, and includes a set of guided exercises. Initial results with HOSS in an upper-level virtualization course indicate that students enjoyed the assignments and were able to apply what they learned to solve different virtualization-related problems. HOSS is publicly available.

Question: How to build a hypervisor?


Deciphering Severely Degraded License Plates. Extremely low-quality images, on the order of 20 pixels in width, appear with frustrating frequency in many forensic investigations. Even advanced de-noising and super-resolution technologies are unable to extract useful information from such lowquality images. We show, however, that useful information is present in such highly degraded images. We also show that convolutional neural networks can be trained to decipher the contents of highly degraded images of license plates, and that these networks significantly outperform human observers. Introduction Recognizing text in images is a well-studied problem [1]. Text recognition can either be done by recognizing individual characters or by recognizing the full word. For degraded images, however, it is difficult to localize and recognize individual characters in an image. Word recognition, therefore, has become central to text recognition in degraded images. Deep convolutional neural networks [2] have been used for text recognition in natural images. Goodfellow et al. [3] used a deep neural network to localize, segment and recognize multiple digits on street view images. Jaderberg et al. [4] also proposed an end to end text recognition system for natural images using a deep neural network. Jaderberg et al. used a large word dictionary and formulated the text recognition task as a large scale classification problem. Recently, Svoboda et al. [5] used CNN to remove motion blur from images of license plate blurred with a blur kernel of various directions and lengths. Although this approach is able to deblur highly blurred images, it does not contend with extremely low resolution and noisy images. Unlike much of this previous work we focus on extracting text from highly degraded images on the scale of only a few pixels per character. Hsieh et al. [6] were the first to show that information can be extracted from highly degraded license plates. In this work the authors assume a kno

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


Design and Implementation of Phalanges Based on Iteration of a Prosthesis. In this work an electromechanical hand is implemented based on the study and implementation of the phalanges of the five fingers of the hand, a control system based on a microcontroller was implemented that takes as feedback signals coming from flexosensors and strain gauges. The movement of the fingers was made based on myoelectric signals in real time, these signals were acquired through an innovative method of acquisition based on patterns. The tests performed were measurements with extended hand, closed hand and pressing an object that validates the present proposal.

Question: What is the phalanges?


A Simple Edit-Time Metaobject Protocol. We present a simple edit-time metaobject protocol (ETMOP) which runs as part of a code editor and enables metadata annotations to customize the rendering and editing of code. The protocol is layered, so that simple render/edit customizations are easy to implement, while more substantial customizations are still manageable. Experiments with a prototype implementation of the protocol as an Eclipse plug-in show that the ETMOP is flexible enough to allow easy customization of the rendering and editing of a number of annotations being used in current practice. The flexibility and performance of the prototype suggest that the ETMOP approach is viable and warrants further study.

Question: What is a simple edit-time metaobject protocol?


Animal Navigation: Path Integration, Visual Landmarks and Cognitive Maps. Animals typically have several navigational strategies available to them. Interactions between these strategies can reduce navigational errors and may lead to the emergence of new capacities.

Question: What are the different navigational strategies available to animals?


Cloud detection of remote sensing images by deep learning. Cloud detection plays a major role for remote sensing image processing. Most of the existed cloud detection methods use the low-level feature of the cloud, which often cause error result especially for thin cloud and complex scene. In this paper, a novel cloud detection method based on deep learning framework is proposed. The designed deep Convolutional Neural Networks (CNNs) consists of four convolutional layers and two fully-connected layers, which can mine the deep features of cloud. The image is firstly clustered into superpixels as sub-region through simple linear iterative cluster (SLIC) method. Through the designed network model, the probability of each superpixel that belongs to cloud region is predicted, so that the cloud probability map of the image is generated. Lastly, the cloud region is obtained according to the gradient of the cloud map. Through the proposed method, both thin cloud and thick cloud can be detected well, and the result is insensitive to complex scene. Experimental results indicate that the proposed method is more robust and effective than compared methods.

Question: What is the cloud detection method based on deep learning?


Mean and Covariance Structures (MACS) Analyses of Cross-Cultural Data: Practical and Theoretical Issues.. Practical and theoretical issues are discussed for testing (a) the comparability, or measurement equivalence, of psychological constructs and (b) detecting possible sociocultural difference on the constructs in cross-cultural research designs. Specifically, strong factorial invariance (Meredith, 1993) of each variable's loading and intercept (mean-level) parameters implies that constructs are fundamentally the same in each sociocultural group, and thus comparable. Under this condition, hypotheses about the nature of sociocultural differences and similarities can be confidently and meaningfully tested among the constructs' moments in each sociocultural sample. Some of the issues involved in making such tests are reviewed and explicated within the framework of multiple-group mean and covariance structures analyses.

Question: How to test for measurement equivalence of psychological constructs?


Perspectives of granular computing. Granular computing emerges as a new multi-disciplinary study and has received much attention in recent years. A conceptual framework is presented by extracting shared commonalities from many fields. The framework stresses multiple views and multiple levels of understanding in each view. It is argued that granular computing is more about a philosophical way of thinking and a practical methodology of problem solving. By effectively using levels of granularity, granular computing provides a systematic, natural way to analyze, understand, represent, and solve real world problems. With granular computing, one aims at structured thinking at the philosophical level, and structured problem solving at the practical level.

Question: What is granular computing?


Unsupervized Image Clustering With SIFT-Based Soft-Matching Affinity Propagation. It is known that affinity propagation can perform exemplar-based unsupervised image clustering by taking as input similarities between pairs of images and producing a set of exemplars that best represent the images, and then assigning each nonexemplar image to its most appropriate exemplar. However, the clustering performance of affinity propagation is largely limited by the adopted similarity between any pair of images. As the scale invariant feature transform (SIFT) has been widely employed to extract image features, the nonmetric similarity between any pair of images was proposed by "hard" matching of SIFT features (e.g., counting the number of matching SIFT features). In this letter, we notice, however, that the decision of hard matching of SIFT features is binary, which is not necessary for deriving similarities. Hence, we propose a novel measure of similarities by replacing hard matching with the so-called soft matching. Experimental examples show that significant performance gains can be achieved by the resulting affinity propagation algorithm.

Question: What is the difference between hard and soft matching?


General Sales Forecast Models for Automobile Markets and their Analysis. In this paper, various enhanced sales forecast methodologies and models for the automobile market are presented. The methods used deliver highly accurate predictions while maintaining the ability to explain the underlying model at the same time. The representation of the economic training data is discussed, as well as its effects on the newly registered automobiles to be predicted. The methodology mainly consists of time series analysis and classical Data Mining algorithms, whereas the data is composed of absolute and/or relative market-specific exogenous parameters on a yearly, quarterly, or monthly base. It can be concluded that the monthly forecasts were especially improved by this enhanced methodology using absolute, normalized exogenous parameters. Decision Trees are considered as the most suitable method in this case, being both accurate and explicable. The German and the US-American automobile market are presented for the evaluation of the forecast models.

Question: What is the difference between a time series analysis and a classical data mining algorithm?


An Italian Twitter Corpus of Hate Speech against Immigrants. The paper describes a recently-created Twitter corpus of about 6,000 tweets, annotated for hate speech against immigrants, and developed to be a reference dataset for an automatic system of hate speech monitoring. The annotation scheme was therefore specifically designed to account for the multiplicity of factors that can contribute to the definition of a hate speech notion, and to offer a broader tagset capable of better representing all those factors, which may increase, or rather mitigate, the impact of the message. This resulted in a scheme that includes, besides hate speech, the following categories: aggressiveness, offensiveness, irony, stereotype, and (on an experimental basis) intensity. The paper hereby presented namely focuses on how this annotation scheme was designed and applied to the corpus. In particular, also comparing the annotation produced by CrowdFlower contributors and by expert annotators, we make some remarks about the value of the novel resource as gold standard, which stems from a preliminary qualitative analysis of the annotated data and on future corpus development.

Question: What is a corpus of hate speech against immigrants?


Social Media and the Decision to Participate in Political Protest : Observations From Tahrir Square. Based on a survey of participants in Egypt's Tahrir Square protests, we demonstrate that social media in general, and Facebook in particular, provided new sources of information the regime could not easily control and were crucial in shaping how citizens made individual decisions about participating in protests, the logistics of protest, and the likelihood of success. We demonstrate that people learned about the protests primarily through interpersonal communication using Facebook, phone contact, or face-to-face conversation. Controlling for other factors, social media use greatly increased the odds that a respondent attended protests on the first day. Half of those surveyed produced and disseminated visuals from the demonstrations, mainly through Facebook.

Question: How did social media affect the decision to participate in political protest?


Using the Output Embedding to Improve Language Models. We study the topmost weight matrix of neural network language models. We show that this matrix constitutes a valid word embedding. When training language models, we recommend tying the input embedding and this output embedding. We analyze the resulting update rules and show that the tied embedding evolves in a more similar way to the output embedding than to the input embedding in the untied model. We also offer a new method of regularizing the output embedding. Our methods lead to a significant reduction in perplexity, as we are able to show on a variety of neural network language models. Finally, we show that weight tying can reduce the size of neural translation models to less than half of their original size without harming their performance.

Question: What is the topmost weight matrix of neural network language models?


D-Sempre: Learning Deep Semantic-Preserving Embeddings for User interests-Social Contents Modeling. Exponential growth of social media consumption demands e'ective user interests-social contents modeling for more personalized recommendation and social media summarization. However, due to the heterogeneous nature of social contents, traditional approaches lack the ability of capturing the hidden semantic correlations across these multi-modal data, which leads to semantic gaps between social content understanding and user interests. To e'ectively bridge the semantic gaps, we propose a novel deep learning framework for user interests-social contents modeling. We €rst mine and parse data, i.e. textual content, visual content, social context and social relation, from heterogeneous social media feeds. Œen, we design a two-branch network to map the social contents and users into a same latent space. Particularly, the network is trained by a largemargin objective that combines a cross-instance distance constraint with a within-instance semantic-preserving constraint in an endto-end manner. At last, a Deep Semantic-Preserving Embedding (D-Sempre) is learned, and the ranking results can be given by calculating distances between social contents and users. To demonstrate the e'ectiveness of D-Sempre in user interests-social contents modeling, we construct a TwiŠer dataset and conduct extensive experiments on it. As a result, D-Sempre e'ectively integrates the multimodal data from heterogeneous social media feeds and captures the hidden semantic correlations between users' interests and social contents.

Question: What is the size of the canadian military?


A SIMULATION AND REGRESSION TESTING FRAMEWORK FOR AUTONOMOUS VEHICLES. x

Question: What is a simulation and regression testing framework for autonomous vehicles?


Learning to search: Functional gradient techniques for imitation learning. Programming robot behavior remains a challenging task. While it is often easy to abstractly define or even demonstrate a desired behavior, designing a controller that embodies the same behavior is difficult, time consuming, and ultimately expensive. The machine learning paradigm offers the promise of enabling "programming by demonstration" for developing high-performance robotic systems. Unfortunately, many "behavioral cloning" (Bain & Sammut, 1995; Pomerleau, 1989; LeCun et al., 2006) approaches that utilize classical tools of supervised learning (e.g. decision trees, neural networks, or support vector machines) do not fit the needs of modern robotic systems. These systems are often built atop sophisticated planning algorithms that efficiently reason far into the future; consequently, ignoring these planning algorithms in lieu of a supervised learning approach often leads to myopic and poor-quality robot performance. While planning algorithms have shown success in many real-world applications ranging from legged locomotion (Chestnutt et al., 2003) to outdoor unstructured navigation (Kelly et al., 2004; Stentz, 2009), such algorithms rely on fully specified cost functions that map sensor readings and environment models to quantifiable costs. Such cost functions are usually manually designed and programmed. Recently, a set of techniques has been developed that explore learning these functions from expert human demonstration. These algorithms apply an inverse optimal control approach to find a cost function for which planned behavior mimics an expert's demonstration. The work we present extends the Maximum Margin Planning (MMP) (Ratliff et al., 2006a) framework to admit learning of more powerful, non-linear cost functions. These algorithms, known collectively as LEARCH (LEArning to seaRCH ), are simpler to implement than most existing methods, more efficient than previous attempts at non-linear

Question: What is the difference between a robot and a computer?


TensorLog: A Differentiable Deductive Database. Large knowledge bases (KBs) are useful in many tasks, but it is unclear how to integrate this sort of knowledge into "deep" gradient-based learning systems. To address this problem, we describe a probabilistic deductive database, called TensorLog, in which reasoning uses a differentiable process. In TensorLog, each clause in a logical theory is first converted into certain type of factor graph. Then, for each type of query to the factor graph, the message-passing steps required to perform belief propagation (BP) are "unrolled" into a function, which is differentiable. We show that these functions can be composed recursively to perform inference in non-trivial logical theories containing multiple interrelated clauses and predicates. Both compilation and inference in TensorLog are efficient: compilation is linear in theory size and proof depth, and inference is linear in database size and the number of message-passing steps used in BP. We also present experimental results with TensorLog and discuss its relationship to other first-order probabilistic logics.

Question: What is a deductive database?


There is a blind spot in AI research. advances in the technical domains of AI. Alongside such efforts, designers and researchers from a range of disciplines need to conduct what we call social-systems analyses of AI. They need to assess the impact of technologies on their social, cultural and political settings. A social-systems approach could investigate, for instance, how the app AiCure — which tracks patients' adherence to taking prescribed medication and transmits records to physicians — is changing the doctor– patient relationship. Such an approach to perform a range of complex tasks in everyday life. These ranged from the identification of skin alterations that are indicative of earlystage cancer to the reduction of energy costs for data centres. The workshops also highlighted a major blind spot in thinking about AI. Autonomous systems are already deployed in our most crucial social institutions, from hospitals to courtrooms. Yet there are no agreed methods to assess the sustained effects of such applications on human populations. Recent years have brought extraordinary There is a blind spot in AI research

Question: What is a blind spot in AI research?


Opportunities and Challenges of Switched Reluctance Motor Drives for Electric Propulsion: A Comparative Study. Selection of the proper electric traction drive is an important step in design and performance optimization of electrified powertrains. Due to the use of high energy magnets, permanent magnet synchronous machines (PMSM) have been the primary choice in the electric traction motor market. However, manufacturers are very interested to find a permanent magnet-free alternative as a fallback option due to unstable cost of rare-earth metals and fault tolerance issues related to the constant permanent magnet excitation. In this paper, a new comprehensive review of electric machines (EMs) that includes various new switched reluctance machine topologies in addition to conventional EMs such as PMSM, induction machine, synchronous reluctance machine (SynRel), and PM-assisted SynRel is presented. This paper is based on performances such as power density, efficiency, torque ripple, vibration and noise, and fault tolerance. These systematic examinations prove that recently proposed magnetic configurations such as double-stator switched reluctance machine can be a reasonable substitute for permanent magnet machines in electric traction applications.

Question: What is the difference between a PMSM and a SynRel?


Orthogonal Coaxial Cavity Filters With Distributed Cross-Coupling. In this letter, six-pole filters are presented, in which the coaxial cavity resonators are arranged with 90 degree rotated spatial orientation. Cross-coupling between nonadjacent resonators will appear. In the new proposed filter topologies the cross-coupling elements are not arranged in separated triplet or quadruplet blocks. They interlace to form distributed cross-coupling. Synthesis of the distributed coupling matrix based on the symmetric canonical prototype is discussed. Two different bandpass filter topologies are presented. The first one has an inline arrangement of six orthogonal coaxial cavity resonators. Its distributed cross-coupling consists of four interlaced triplets, which generate two transmission zeros above the passband. The second filter design has a folded arrangement of two inline triplets with strong cross-coupling. An additional interlaced quadruplet pushes the resulting transmission zeros to the complex frequency domain. Measurement results of two corresponding filter prototypes confirm the predicted performance.

Question: What is the difference between a six-pole filter and a four-pole filter?


Narrating a Knowledge Base. We aim to automatically generate natural language narratives about an input structured knowledge base (KB). We build our generation framework based on a pointer network which can copy facts from the input KB, and add two attention mechanisms: (i) slot-aware attention to capture the association between a slot type and its corresponding slot value; and (ii) a new table position self-attention to capture the inter-dependencies among related slots. For evaluation, besides standard metrics including BLEU, METEOR, and ROUGE, we also propose a KB reconstruction based metric by extracting a KB from the generation output and comparing it with the input KB. We also create a new data set which includes 106,216 pairs of structured KBs and their corresponding natural language descriptions for two distinct entity types. Experiments show that our approach significantly outperforms state-of-the-art methods. The reconstructed KB achieves 68.8% 72.6% F-score.1

Question: What is the name of the dataset?


Deep Cross-Modal Projection Learning for Image-Text Matching. The key point of image-text matching is how to accurately measure the similarity between visual and textual inputs. Despite the great progress of associating the deep cross-modal embeddings with the bi-directional ranking loss, developing the strategies for mining useful triplets and selecting appropriate margins remains a challenge in real applications. In this paper, we propose a cross-modal projection matching (CMPM) loss and a cross-modal projection classification (CMPC) loss for learning discriminative image-text embeddings. The CMPM loss minimizes the KL divergence between the projection compatibility distributions and the normalized matching distributions defined with all the positive and negative samples in a mini-batch. The CMPC loss attempts to categorize the vector projection of representations from one modality onto another with the improved norm-softmax loss, for further enhancing the feature compactness of each class. Extensive analysis and experiments on multiple datasets demonstrate the superiority of the proposed approach.

Question: How to measure the similarity between visual and textual inputs?


Development of humanoid robot platform KHR-2 (KAIST humanoid robot-2). We are presenting the mechanical and electrical system design and system integration of controllers including sensory devices of the humanoid, KHR-2 in this paper. The concept and the objective of the design will be described. We have developed KHR-2 since 2003 which has 41 DOF (degree of freedom). Each arm including a hand and a wrist has 11 DOF (5+2 DOF/hand (finger + wrist), 4 DOF/arm) and each leg has 6 DOF. Head and trunk have 6 DOF (2 DOF/eye and 2 DOF/neck) and 1 DOF respectively. The mechanical part of the robot is designed to have human friendly appearance and wide movable angle range. Joint actuators are designed to have negligible uncertainties such as backlash. To control all axes, distributed control architecture is adopted to reduce the computation burden of the main controller (PC) and to expand the devices easily. We developed a sub-controller which is a servo motor controller and sensor interfacing devices using microprocessor. The main controller (PC) attached on the back of the robot communicates with sub-controllers in real-time by using CAN (controller area network). Windows XP is used for OS (operating system) for fast development of main control program. RTX (real time extension) HAL extension software is used to realize the real-time control in Windows XP environment. KHR-2 has several sensor types, which are 3-axis F/T (force/torque) sensors at foot and wrist, inertia sensor system (accelerometer and rate gyro) and CCD camera. The F/T sensor at the foot is the most fundamental sensor for stable walking. The inertia sensor system is essential for determining the inclination between the ground and the robot. Finally, we used the CCD camera for navigation and stabilization of the robot in the future. We described the details of the KHR-2 in this paper.

Question: What is the objective of the design?


Superior thermal conductivity of single-layer graphene.. We report the measurement of the thermal conductivity of a suspended single-layer graphene. The room temperature values of the thermal conductivity in the range approximately (4.84+/-0.44)x10(3) to (5.30+/-0.48)x10(3) W/mK were extracted for a single-layer graphene from the dependence of the Raman G peak frequency on the excitation laser power and independently measured G peak temperature coefficient. The extremely high value of the thermal conductivity suggests that graphene can outperform carbon nanotubes in heat conduction. The superb thermal conduction property of graphene is beneficial for the proposed electronic applications and establishes graphene as an excellent material for thermal management.

Question: What is the thermal conductivity of graphene?


A Literature Review on Kidney Disease Prediction using Data Mining Classification Technique. -The huge amounts of data generated by healthcare transactions are too complex and voluminous to be processed and analyzed by traditional methods. Data mining provides the methodology and technology to transform these mounds of data into useful information for decision making. The Healthcare industry is generally "information rich", which is not feasible to handle manually. These large amounts of data are very important in the field of data mining to extract useful information and generate relationships amongst the attributes. Kidney disease is a complex task which requires much experience and knowledge. Kidney disease is a silent killer in developed countries and one of the main contributors to disease burden in developing countries. In the health care industry the data mining is mainly used for predicting the diseases from the datasets. The Data mining classification techniques, namely Decision trees, ANN, Naive Bayes are analyzed on Kidney disease data set. Keywords--Data Mining, Kidney Disease, Decision tree, Naive Bayes, ANN, K-NN, SVM, Rough Set, Logistic Regression, Genetic Algorithms (GAs) / Evolutionary Programming (EP), Clustering

Question: What is the difference between data mining and data analysis?


Control of Flight Operation of a Quad rotor AR . Drone Using Depth Map from Microsoft Kinect Sensor. In recent years, many user-interface devices appear for managing variety the physical interactions. The Microsft Kinect camera is a revolutionary and useful depth camera giving new user experience of interactive gaming on the Xbox platform through gesture or motion detection. In this paper we present an approach for control the Quadrotor AR.Drone using the Microsft Kinect sensor.

Question: How to control a quadrotor using a Kinect sensor?


A Case Study on Quality Attribute Measurement using MARF and GIPSY. This literature focuses on doing a comparative analysis between Modular Audio Recognition Framework (MARF) and the General Intentional Programming System (GIPSY) with the help of different software metrics. At first, we understand the general principles, architecture and working of MARF and GIPSY by looking at their frameworks and running them in the Eclipse environment. Then, we study some of the important metrics including a few state of the art metrics and rank them in terms of their usefulness and their influence on the different quality attributes of a software. The quality attributes are viewed and computed with the help of the Logiscope and McCabe IQ tools. These tools perform a comprehensive analysis on the case studies and generate a quality report at the factor level, criteria level and metrics level. In next step, we identify the worst code at each of these levels, extract the worst code and provide recommendations to improve the quality. We implement and test some of the metrics which are ranked as the most useful metrics with a set of test cases in JDeodorant. Finally, we perform an analysis on both MARF and GIPSY by doing a fuzzy code scan using MARFCAT to find the list of weak and vulnerable classes.

Question: What is a case study?


A NEW GENERALIZATION OF FIBONACCI SEQUENCE AND EXTENDED BINET'S FORMULA. Consider the Fibonacci sequence {Fn}n=0 with initial conditions F0 = 0, F1 = 1 and recurrence relation Fn = Fn−1 + Fn−2 (n ≥ 2). The Fibonacci sequence has been generalized in many ways, some by preserving the initial conditions, and others by preserving the recurrence relation. In this article, we study a new generalization {qn}, with initial conditions q0 = 0 and q1 = 1, which is generated by the recurrence relation qn = aqn−1 + qn−2 (when n is even) or qn = bqn−1 + qn−2 (when n is odd), where a and b are nonzero real numbers. Some well-known sequences are special cases of this generalization. The Fibonacci sequence is a special case of {qn} with a = b = 1. Pell's sequence is {qn} with a = b = 2 while k-Fibonacci sequence has a = b = k. We produce an extended Binet's formula for {qn} and, thereby, identities such as Cassini's, Catalan's, d'Ocagne's, etc.

Question: What is the extended Binet's formula for {qn}?


Approximate model for interactive-tendon driven mechanism of a multiple-DoFs myoelectric prosthetic hand. For practical use, a myoelectric prosthetic hand needs to (1) have a human-like structure, (2) be lightweight, (3) have multiple degrees of freedom (DoFs), and (4) have a high grip force. We have developed a myoelectric prosthetic hand with an interactive-tendon driven mechanism. This paper describes the control method by which the interactive-tendon driven mechanism produces fine and precise actions, as well as an approximate model for the control method. The approximate model was developed based on a geometry model and an equilibrium model for the joint torque. Experimental results show that the joint motions of the actual robotic hand are controlled with errors of between 9 and 15% using the approximate model.

Question: What is the approximate model for the control method?


Mosaic: quantifying privacy leakage in mobile networks. With the proliferation of online social networking (OSN) and mobile devices, preserving user privacy has become a great challenge. While prior studies have directly focused on OSN services, we call attention to the privacy leakage in mobile network data. This concern is motivated by two factors. First, the prevalence of OSN usage leaves identifiable digital footprints that can be traced back to users in the real-world. Second, the association between users and their mobile devices makes it easier to associate traffic to its owners. These pose a serious threat to user privacy as they enable an adversary to attribute significant portions of data traffic including the ones with NO identity leaks to network users' true identities. To demonstrate its feasibility, we develop the Tessellation methodology. By applying Tessellation on traffic from a cellular service provider (CSP), we show that up to 50% of the traffic can be attributed to the names of users. In addition to revealing the user identity, the reconstructed profile, dubbed as "mosaic," associates personal information such as political views, browsing habits, and favorite apps to the users. We conclude by discussing approaches for preventing and mitigating the alarming leakage of sensitive user information.

Question: How can we prevent the leakage of user information?


AGDISTIS - Graph-Based Disambiguation of Named Entities Using Linked Data. Over the last decades, several billion Web pages have been made available on the Web. The ongoing transition from the current Web of unstructured data to the Web of Data yet requires scalable and accurate approaches for the extraction of structured data in RDF (Resource Description Framework) from these websites. One of the key steps towards extracting RDF from text is the disambiguation of named entities. While several approaches aim to tackle this problem, they still achieve poor accuracy. We address this drawback by presenting AGDISTIS, a novel knowledge-base-agnostic approach for named entity disambiguation. Our approach combines the Hypertext-Induced Topic Search (HITS) algorithm with label expansion strategies and string similarity measures. Based on this combination, AGDISTIS can efficiently detect the correct URIs for a given set of named entities within an input text. We evaluate our approach on eight different datasets against state-of-theart named entity disambiguation frameworks. Our results indicate that we outperform the state-of-the-art approach by up to 29% F-measure.

Question: What is the name of the algorithm?


Identifying Potential CSCW Applications by Means of Activity Theory Concepts: A Case Example. The paper presents some novel concepts and models derived from Activity Theory for to identify a potential CSCW application. It is suggested that the six elements of the structure of the activity concept might be useful for differentiating between areas of support, and that three levels of support are needed in order to cope with both routine and emergent features of cooperative work situations. Thus a 3x6 support type classification is formed and its usefulness studied by means of a real-world example. A work situation is analyzed, problems identified and possible areas of support defined. A temporary solution is produced and, by evaluating it, possible directions for the development of a "real" new CSCW application and the usefulness of the classification am discussed.

Question: What is the structure of the activity concept?


Security and privacy in mobile crowdsourcing networks: challenges and opportunities. The mobile crowdsourcing network (MCN) is a promising network architecture that applies the principles of crowdsourcing to perform tasks with human involvement and powerful mobile devices. However, it also raises some critical security and privacy issues that impede the application of MCNs. In this article, in order to better understand these critical security and privacy challenges, we first propose a general architecture for a mobile crowdsourcing network comprising both crowdsourcing sensing and crowdsourcing computing. After that, we set forth several critical security and privacy challenges that essentially capture the characteristics of MCNs. We also formulate some research problems leading to possible research directions. We expect this work will bring more attention to further investigation on security and privacy solutions for mobile crowdsourcing networks.

Question: What is the architecture of a mobile crowdsourcing network?


Believable Social and Emotional Agents.. One of the key steps in creating quality interactive drama is the ability to create quality interactive characters (or believable agents). Two important aspects of such characters will be that they appear emotional and that they can engage in social interactions. My basic approach to these problems has been to use a broad agent architecture and minimal amounts of modeling of other agent in the environment. This approach is based on an understanding of the artistic nature of the problem. To enable agent-builders (artists) to create emotional agents, I provide a general framework for building emotional agents, default emotion-processing rules, and discussion about how to create quality, emotional characters. My framework gets a lot of its power from being part of a broad agent architecture. The concept is simple: the agent will be emotionally richer if there are more things to have emotions about and more ways to express them. This reliance on breadth has also meant that I have been able to create simple emotion models that rely on perception and motivation instead of deep modeling of other agents and complex cognitive processing. To enable agent builders to create social behaviors for believable agents, I have designed a methodology that provides heuristics for incorporating personality into social behaviors and suggests how to model other agents in the environment. I propose an approach to modeling other agents that calls for limiting the amount of modeling of other agents to that which is sufficient to create the desired behavior. Using this technique, I have been able to build robust social behaviors that use surprisingly little representation. I have used this methodology to build a number of social behaviors, like negotiation and making friends. I have built three simulations containing seven agents to drive and test this work. I have also conducted user studies to demonstrate that these agents appear to be emotional and

Question: How to create believable social agents?


A shape-based similarity measure for time series data with ensemble learning. This paper introduces a shape-based similarity measure, called the angular metric for shape similarity (AMSS), for time series data. Unlike most similarity or dissimilarity measures, AMSS is based not on individual data points of a time series but on vectors equivalently representing it. AMSS treats a time series as a vector sequence to focus on the shape of the data and compares data shapes by employing a variant of cosine similarity. AMSS is, by design, expected to be robust to time and amplitude shifting and scaling, but sensitive to short-term oscillations. To deal with the potential drawback, ensemble learning is adopted, which integrates data smoothing when AMSS is used for classification. Evaluative experiments reveal distinct properties of AMSS and its effectiveness when applied in the ensemble framework as compared to existing measures.

Question: What is the angular metric for shape similarity?


A Critical Review of Construct Indicators and Measurement Model Misspecification in Marketing and Consumer Research. A review of the literature suggests that few studies use formative indicator measurement models, even though they should. Therefore, the purpose of this research is to (a) discuss the distinction between formative and reflective measurement models, (b) develop a set of conceptual criteria that can be used to determine whether a construct should be modeled as having formative or reflective indicators, (c) review the marketing literature to obtain an estimate of the extent of measurement model misspecification in the field, (d ) estimate the extent to which measurement model misspecification biases estimates of the relationships between constructs using a Monte Carlo simulation, and (e) provide recommendations for modeling formative indicator constructs.

Question: What is the purpose of this research?


Cyclic deadlock prediction and avoidance for zone-controlled AGV system. Automated guided vehicles (AGVs) are now becoming popular in automated materials handling systems, flexible manufacturing systems and even containers handling applications at seaports. Its performance affects the efficiency of the entire system. Deadlock formation is a serious problem as it stalls the AGVS. The objective of this paper is to develop an efficient AGV deadlock prediction and avoidance algorithm for container port operations. Deadlock in a broad sense is a situation in which at least a part of the system stalls. There are a lot of situations in which the system may stall and most of these situations can be avoided through the control and navigation system. This paper discusses the development of an efficient strategy for predicting and avoiding the deadlocks in a large scale AGVS A variety of deadlock-detecting algorithms are available, but these methods work mainly for manufacturing system where the network layout is simple and uses only a small number of AGVs. The AGVS under study has complex layout and involves close to 80 AGVs. The proposed solution is implemented using the Automod simulation software, and the performance of the technique is presented. Simulation shows that all the potential deadlock situations can be detected and avoided via this methodology. Also, the proposed strategy is computationally efficient and is able to provide the movement decision to the vehicles within the 1.5-s sampling time. r 2002 Published by Elsevier Science B.V.

Question: What is the difference between a container port and a manufacturing system?


Multilabel Classification via Co-Evolutionary Multilabel Hypernetwork. Multilabel classification is prevalent in many real-world applications where data instances may be associated with multiple labels simultaneously. In multilabel classification, exploiting label correlations is an essential but nontrivial task. Most of the existing multilabel learning algorithms are either ineffective or computationally demanding and less scalable in exploiting label correlations. In this paper, we propose a co-evolutionary multilabel hypernetwork (Co-MLHN) as an attempt to exploit label correlations in an effective and efficient way. To this end, we firstly convert the traditional hypernetwork into a multilabel hypernetwork (MLHN) where label correlations are explicitly represented. We then propose a co-evolutionary learning algorithm to learn an integrated classification model for all labels. The proposed Co-MLHN exploits arbitrary order label correlations and has linear computational complexity with respect to the number of labels. Empirical studies on a broad range of multilabel data sets demonstrate that Co-MLHN achieves competitive results against state-of-the-art multilabel learning algorithms, in terms of both classification performance and scalability with respect to the number of labels.

Question: What is a hypernetwork?


Neural basis of speech perception.. The functional neuroanatomy of speech processing has been difficult to characterize. One major impediment to progress has been the failure to consider task effects when mapping speech-related processing systems. We summarize a dual-stream model of speech processing that addresses this situation. In this model, a ventral stream processes speech signals for comprehension, and a dorsal stream maps acoustic speech signals to parietal and frontal-lobe articulatory networks. The model assumes that the ventral stream is largely bilaterally organized, although there are important computational differences between the left- and right-hemisphere systems, whereas the dorsal stream is strongly left-hemisphere-dominant.

Question: What is the functional neuroanatomy of speech processing?


A theory of multi-layer flat refractive geometry. Flat refractive geometry corresponds to a perspective camera looking through single/multiple parallel flat refractive mediums. We show that the underlying geometry of rays corresponds to an axial camera. This realization, while missing from previous works, leads us to develop a general theory of calibrating such systems using 2D-3D correspondences. The pose of 3D points is assumed to be unknown and is also recovered. Calibration can be done even using a single image of a plane. We show that the unknown orientation of the refracting layers corresponds to the underlying axis, and can be obtained independently of the number of layers, their distances from the camera and their refractive indices. Interestingly, the axis estimation can be mapped to the classical essential matrix computation and 5-point algorithm [15] can be used. After computing the axis, the thicknesses of layers can be obtained linearly when refractive indices are known, and we derive analytical solutions when they are unknown. We also derive the analytical forward projection (AFP) equations to compute the projection of a 3D point via multiple flat refractions, which allows non-linear refinement by minimizing the reprojection error. For two refractions, AFP is either 4th or 12th degree equation depending on the refractive indices. We analyze ambiguities due to small field of view, stability under noise, and show how a two layer system can be well approximated as a single layer system. Real experiments using a water tank validate our theory.

Question: What is the theory of multi-layer flat refractive geometry?


A Comparative Analysis and Study of Multiview CNN Models for Joint Object Categorization and Pose Estimation. In the Object Recognition task, there exists a dichotomy between the categorization of objects and estimating object pose, where the former necessitates a view-invariant representation, while the latter requires a representation capable of capturing pose information over different categories of objects. With the rise of deep architectures, the prime focus has been on object category recognition. Deep learning methods have achieved wide success in this task. In contrast, object pose estimation using these approaches has received relatively less attention. In this work, we study how Convolutional Neural Networks (CNN) architectures can be adapted to the task of simultaneous object recognition and pose estimation. We investigate and analyze the layers of various CNN models and extensively compare between them with the goal of discovering how the layers of distributed representations within CNNs represent object pose information and how this contradicts with object category representations. We extensively experiment on two recent large and challenging multi-view datasets and we achieve better than the state-of-the-art.

Question: What is the difference between object recognition and pose estimation?


A Survey of Enabling Technologies of Low Power and Long Range Machine-to-Machine Communications. Low power and long range machine-to-machine (M2M) communication techniques are expected to provide ubiquitous connections for the wireless devices. In this paper, three major low power and long range M2M solutions are surveyed. The first type of solutions is referred to as the low power wide area (LPWA) network. The design of the LPWA techniques features low cost, low data rate, long communication range, and low power consumption. The second type of solutions is the IEEE 802.11ah which features higher data rates using a wider bandwidth than the LPWA-based solutions. The third type of solutions is operated under the cellular network infrastructure. Based on the analysis of the pros and cons of the enabling technologies of the surveyed M2M solutions, as well as the corresponding deployment strategies, the gaps in knowledge are identified. The paper also presents a summary of the research directions for improving the performance of the surveyed low power and long range M2M communication technologies.

Question: What is the difference between the LPWA and IEEE 802.11ah?


A data mining framework for detecting subscription fraud in telecommunication. Service providing companies including telecommunication companies often receive substantial damage from customers' fraudulent behaviors. One of the common types of fraud is subscription fraud in which usage type is in contradiction with subscription type. This study aimed at identifying customers' subscription fraud by employing data mining techniques and adopting knowledge discovery process. To this end, a hybrid approach consisting of preprocessing, clustering, and classification phases was applied, and appropriate tools were employed commensurate to each phase. Specifically, in the clustering phase SOM and K-means were combined, and in the classification phase decision tree (C4.5), neural networks, and support vector machines as single classifiers and bagging, boosting, stacking, majority and consensus voting as ensembles were examined. In addition to using clustering to identify outlier cases, it was also possible – by defining new features – to maintain the results of clustering phase for the classification phase. This, in turn, contributed to better classification results. A real dataset provided by Telecommunication Company of Tehran was applied to demonstrate the effectiveness of the proposed method. The efficient use of synergy among these techniques significantly increased prediction accuracy. The performance of all single and ensemble classifiers is evaluated based on various metrics and compared by statistical tests. The results showed that support vector machines among single classifiers and boosted trees among all classifiers have the best performance in terms of various metrics. The research findings show that the proposed model has a high accuracy, and the resulting outcomes are significant both theoretically and practically. & 2010 Elsevier Ltd. All rights reserved.

Question: What is a data mining framework for detecting subscription fraud in telecommunication?


The search engine manipulation effect (SEME) and its possible impact on the outcomes of elections.. Internet search rankings have a significant impact on consumer choices, mainly because users trust and choose higher-ranked results more than lower-ranked results. Given the apparent power of search rankings, we asked whether they could be manipulated to alter the preferences of undecided voters in democratic elections. Here we report the results of five relevant double-blind, randomized controlled experiments, using a total of 4,556 undecided voters representing diverse demographic characteristics of the voting populations of the United States and India. The fifth experiment is especially notable in that it was conducted with eligible voters throughout India in the midst of India's 2014 Lok Sabha elections just before the final votes were cast. The results of these experiments demonstrate that (i) biased search rankings can shift the voting preferences of undecided voters by 20% or more, (ii) the shift can be much higher in some demographic groups, and (iii) search ranking bias can be masked so that people show no awareness of the manipulation. We call this type of influence, which might be applicable to a variety of attitudes and beliefs, the search engine manipulation effect. Given that many elections are won by small margins, our results suggest that a search engine company has the power to influence the results of a substantial number of elections with impunity. The impact of such manipulations would be especially large in countries dominated by a single search engine company.

Question: How can search engine manipulation affect elections?


Lower limb rehabilitation robot. This paper describes a new prototype of lower limb rehabilitation robot (for short: LLRR), including its detailed structure, operative principles, manipulative manual and control mode which give considerate protection to patients. It implements the programmable process during the course of the limbs rehabilitation, furthermore, renders variable and predetermined step posture and force sensing. LLRR could assist patient in-- simulating normal people's footsteps, exercising leg muscles, gradually recovering the neural control toward walking function and finally walking in normal way utterly. Such robot is comprised with steps posture controlling system and weight alleviation controlling mechanism.

Question: What is the lower limb rehabilitation robot?


Hempseed as a nutritional resource: An overview. The seed of Cannabis sativa L. has been an important source of nutrition for thousands of years in Old World cultures. Non-drug varieties of Cannabis, commonly referred to as hemp, have not been studied extensively for their nutritional potential in recent years, nor has hempseed been utilized to any great extent by the industrial processes and food markets that have developed during the 20th century. Technically a nut, hempseed typically contains over 30% oil and about 25% protein, with considerable amounts of dietary fiber, vitamins and minerals. Hempseed oil is over 80% in polyunsaturated fatty acids (PUFAs), and is an exceptionally rich source of the two essential fatty acids (EFAs) linoleic acid (18:2 omega-6) and alpha-linolenic acid (18:3 omega-3). The omega-6 to omega-3 ratio (n6/n3) in hempseed oil is normally between 2:1 and 3:1, which is considered to be optimal for human health. In addition, the biological metabolites of the two EFAs, gamma-linolenic acid (18:3 omega-6; 'GLA') and stearidonic acid (18:4 omega-3; 'SDA'), are also present in hempseed oil. The two main proteins in hempseed are edestin and albumin. Both of these high-quality storage proteins are easily digested and contain nutritionally significant amounts of all essential amino acids. In addition, hempseed has exceptionally high levels of the amino acid arginine. Hempseed has been used to treat various disorders for thousands of years in traditional oriental medicine. Recent clinical trials have identified hempseed oil as a functional food, and animal feeding studies demonstrate the long-standing utility of hempseed as an important food resource.

Question: What is the nutritional value of hempseed?


Software-defined network virtualization: an architectural framework for integrating SDN and NFV for service provisioning in future networks. SDN and NFV are two significant innovations in networking. The evolution of both SDN and NFV has shown strong synergy between these two paradigms. Recent research efforts have been made toward combining SDN and NFV to fully exploit the advantages of both technologies. However, integrating SDN and NFV is challenging due to the variety of intertwined network elements involved and the complex interaction among them. In this article, we attempt to tackle this challenging problem by presenting an architectural framework called SDNV. This framework offers a clear holistic vision of integrating key principles of both SDN and NFV into unified network architecture, and provides guidelines for synthesizing research efforts toward combining SDN and NFV in future networks. Based on this framework, we also discuss key technical challenges to realizing SDN-NFV integration and identify some important topics for future research, with a hope to arouse the research community's interest in this emerging area.

Question: What is the difference between SDN and NFV?


Twitter Sentiment Analysis: Lexicon Method, Machine Learning Method and Their Combination. This paper covers the two approaches for sentiment analysis: i) lexicon based method; ii) machine learning method. We describe several techniques to implement these approaches and discuss how they can be adopted for sentiment classification of Twitter messages. We present a comparative study of different lexicon combinations and show that enhancing sentiment lexicons with emoticons, abbreviations and social-media slang expressions increases the accuracy of lexicon-based classification for Twitter. We discuss the importance of feature generation and feature selection processes for machine learning sentiment classification. To quantify the performance of the main sentiment analysis methods over Twitter we run these algorithms on a benchmark Twitter dataset from the SemEval-2013 competition, task 2-B. The results show that machine learning method based on SVM and Naive Bayes classifiers outperforms the lexicon method. We present a new ensemble method that uses a lexicon based sentiment score as input feature for the machine learning approach. The combined method proved to produce more precise classifications. We also show that employing a cost-sensitive classifier for highly unbalanced datasets yields an improvement of sentiment classification performance up to 7%.

Question: What is the difference between lexicon based method and machine learning method?


Semantic Compositionality through Recursive Matrix-Vector Spaces. Single-word vector space models have been very successful at learning lexical information. However, they cannot capture the compositional meaning of longer phrases, preventing them from a deeper understanding of language. We introduce a recursive neural network (RNN) model that learns compositional vector representations for phrases and sentences of arbitrary syntactic type and length. Our model assigns a vector and a matrix to every node in a parse tree: the vector captures the inherent meaning of the constituent, while the matrix captures how it changes the meaning of neighboring words or phrases. This matrix-vector RNN can learn the meaning of operators in propositional logic and natural language. The model obtains state of the art performance on three different experiments: predicting fine-grained sentiment distributions of adverb-adjective pairs; classifying sentiment labels of movie reviews and classifying semantic relationships such as cause-effect or topic-message between nouns using the syntactic path between them.

Question: What is the meaning of the sentence "The Canadian Armed Forces"?


Spatial Data Mining Features between General Data Mining. Data mining is usually defined as searching,analyzing and sifting through large amounts of data to find relationships, patterns, or any significant statistical correlation. Spatial Data Mining (SDM) is the process of discovering interesting, useful, non-trivial patterns information or knowledge from large spatial datasets.Extracting interesting and useful patterns from spatial datasets must be more difficult than extracting the corresponding patterns from traditional numeric or categorical data due to the complexity of spatial data types, spatial relationships, and spatial auto-correlation.Emphasized overviewed the unique features that distinguish spatial data mining from classical Data Mining, and presents major accomplishments of spatial Data Mining research. Extracting interesting patterns and rules from spatial datasets, such as remotely sensed imagery and associated ground data, can be of importance in precision agriculture, community planning,resource discovery and other areas.

Question: What is the difference between spatial data mining and data mining?


Exemplary Automotive Attack Scenarios : Trojan Horses for Electronic Throttle Control System ( ETC ) and Replay Attacks on the Power Window System. The consideration of targeted security attacks is not yet common in the automotive domain where primarily safety requirements are considered. Hence this survey addresses the relatively new field of IT-security in automotive technology in order to motivate further research. With the emergence of automotive technologies like car-to-car (c2c) communication, the challenges increase. In order to show the necessity for such research we describe how in theory, a potential attack on the Electronic Throttle Control (ETC) could succeed, if no countermeasures are taken, with potentially drastic consequences on the safety of the vehicle, its occupants and its environment as a result. Also an attack on the power window system is shown using the implementation techniques already employed in the design of automotive components. Our goal is to show, that such exploited security vulnerabilities are likely to have serious consequences with respect to the vehicles safety. Therefore such attacks need to be considered and suitable countermeasures have to be identified. In order to achieve this, the connection of the two disciplines Safety and Security for automotive IT components needs to be discussed. We introduce two exemplary attacks, the Trojan Horse targeting at the Electronic Throttle Control System (ETC) and a replay attack on the electric window lift. The first attack is mainly discussed in theory, the second is elaborated in a practical simulation scenario. Finally we introduce a general investigation of potential ways of intrusion and present some first practical results from tests with current automotive hardware.

Question: What is the difference between a Trojan Horse and a Replay Attack?


Emotion regulation through listening to music in everyday situations.. Music is a stimulus capable of triggering an array of basic and complex emotions. We investigated whether and how individuals employ music to induce specific emotional states in everyday situations for the purpose of emotion regulation. Furthermore, we wanted to examine whether specific emotion-regulation styles influence music selection in specific situations. Participants indicated how likely it would be that they would want to listen to various pieces of music (which are known to elicit specific emotions) in various emotional situations. Data analyses by means of non-metric multidimensional scaling revealed a clear preference for pieces of music that were emotionally congruent with an emotional situation. In addition, we found that specific emotion-regulation styles might influence the selection of pieces of music characterised by specific emotions. Our findings demonstrate emotion-congruent music selection and highlight the important role of specific emotion-regulation styles in the selection of music in everyday situations.

Question: How do people use music to regulate their emotions?


Visual Correspondence Using Energy Minimization and Mutual Information. We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian scenes or to differences between cameras. We use maximization of mutual information, a powerful technique for registering images that requires no a priori model of the relationship between scene intensities in different views. However, it has proven difficult to use mutual information to compute dense visual correspondence. Comparing fixed-size windows via mutual information suffers from the well-known problems of fixed windows, namely poor performance at discontinuities and in low-texture regions. In this paper, we show how to compute visual correspondence using mutual information without suffering from these problems. Using a simple approximation, mutual information can be incorporated into the standard energy minimization framework used in early vision. The energy can then be efficiently minimized using graph cuts, which preserve discontinuities and handle low-texture regions. The resulting algorithm combines the accurate disparity maps that come from graph cuts with the tolerance for intensity changes that comes from mutual information.

Question: How to compute dense visual correspondence using mutual information?


Automatic Identification of Retinal Arteries and Veins in Fundus Images using Local Binary Patterns. Artery and vein (AV) classification of retinal images is a key to necessary tasks, such as automated measurement of arteriolar-to-venular diameter ratio (AVR). This paper comprehensively reviews the state-of-the art in AV classification methods. To improve on previous methods, a new Local Binary Pattern-based method (LBP) is proposed. Beside its simplicity, LBP is robust against low contrast and low quality fundus images; and it helps the process by including additional AV texture and shape information. Experimental results compare the performance of the new method with the state-of-the art; and also methods with different feature extraction and classification schemas.

Question: What is the state-of-the art in AV classification methods?


A Compact Fractal Loop Rectenna for RF Energy Harvesting. This letter presents a compact fractal loop rectenna for RF energy harvesting at GSM1800 bands. First, a fractal loop antenna with novel in-loop ground-plane impedance matching is proposed for the rectenna design. Also, a high-efficiency rectifier is designed in the loop antenna to form a compact rectenna. Measured results show that an efficiency of 61% and an output dc voltage of 1.8 V have been achieved over 12-kΩ resistor for 10 μW/cm2 power density at 1.8 GHz. The rectenna is able to power up a battery-less LCD watch at a distance of 10 m from the cell tower. The proposed rectenna is compact, easy to fabricate, and useful for various energy harvesting applications.

Question: What is a compact fractal loop rectenna?


Design and Modeling of A Crowdsource-Enabled System for Urban Parcel Relay and Delivery. This paper proposes a crowdsource-enabled system for urban parcel relay and delivery. We consider cyclists and pedestrians as crowdsources who are close to customers and interested in relaying parcels with a truck carrier and undertaking jobs for the last-leg parcel delivery and the first-leg parcel pickup. The crowdsources express their interests in doing so by submitting bids to the truck carrier. The truck carrier then selects bids and coordinates crowdsources' last-leg delivery (first-leg pickup) with its truck operations. The truck carrier's problem is formulated as a mixed integer non-linear program which simultaneously i) selects crowdsources to complete the last-leg delivery (first-leg pickup) between customers and selected points for crowdsource-truck relay; and ii) determines the relay points and truck routes and schedule. To solve the truck carrier problem, we first decompose the problem into a winner determination problem and a simultaneous pickup and delivery problem with soft time windows, and propose a Tabu Search based algorithm to iteratively solve the two subproblems. Numerical results show that this solution approach is able to yield close-to-optimum solutions with much less time than using offthe-shelf solvers. By adopting this new system, truck vehicle miles traveled (VMT) and total cost can be reduced compared to pure-truck delivery. The advantage of the system over pure-truck delivery is sensitive to factors such as penalty for servicing outside customers' desired time windows, truck unit operating cost, time value of crowdsources, and the crowdsource mode.

Question: How to design a crowdsource-enabled system for urban parcel relay and delivery?


Convergence of Stochastic Gradient Descent for PCA. We consider the problem of principal component analysis (PC A) in a streaming stochastic setting, where our goal is to find a direction of approximate maximal va riance, based on a stream of i.i.d. data points inR. A simple and computationally cheap algorithm for this is st ochastic gradient descent (SGD), which incrementally updates its estimate based on ea ch new data point. However, due to the non-convex nature of the problem, analyzing its performanc e has been a challenge. In particular, existing guarantees rely on a non-trivial eigengap assumption on the covariance matrix, which is intuitively unnecessary. In this paper, we provide (to the best of our kno wledge) the first eigengap-free convergence guarantees for SGD in the context of PCA. This also part ially resolves an open problem posed in [10]. Moreover, under an eigengap assumption, we show tha t the same techniques lead to new SGD convergence guarantees with better dependence on the eigen gap.

Question: What is the convergence rate of SGD for PCA?


A faceted approach to conceptualizing tasks in information seeking. 0306-4573/$ see front matter Published by Elsevi doi:10.1016/j.ipm.2008.07.005 * Corresponding author. Tel.: +1 601 266 4035; fa E-mail addresses: Yuelin.Li@usm.edu (Y. Li), nick 1 Tel.: +1 732 932 7500x8271; fax: +1 732 932 69 The nature of the task that leads a person to engage in information interaction, as well as of information seeking and searching tasks, have been shown to influence individuals' information behavior. Classifying tasks in a domain has been viewed as a departure point of studies on the relationship between tasks and human information behavior. However, previous task classification schemes either classify tasks with respect to the requirements of specific studies or merely classify a certain category of task. Such approaches do not lead to a holistic picture of task since a task involves different aspects. Therefore, the present study aims to develop a faceted classification of task, which can incorporate work tasks and information search tasks into the same classification scheme and characterize tasks in such a way as to help people make predictions of information behavior. For this purpose, previous task classification schemes and their underlying facets are reviewed and discussed. Analysis identifies essential facets and categorizes them into Generic facets of task and Common attributes of task. Generic facets of task include Source of task, Task doer, Time, Action, Product, and Goal. Common attributes of task includes Task characteristics and User's perception of task. Corresponding sub-facets and values are identified as well. In this fashion, a faceted classification of task is established which could be used to describe users' work tasks and information search tasks. This faceted classification provides a framework to further explore the relationships among work tasks, search tasks, and interactive information retrieval and advance adaptive IR systems design. Published by

Question: What is the nature of the task that leads a person to engage in information interaction?


The Effect of Data Sampling When Using Random Forest on Imbalanced Bioinformatics Data. Ensemble learning is a powerful tool that has shown promise when applied towards bioinformatics datasets. In particular, the Random Forest classifier has been an effective and popular algorithm due to its relatively good classification performance and its ease of use. However, Random Forest does not account for class imbalance which is known for decreasing classification performance and increasing bias towards the majority class. In this study, we seek to determine if the inclusion of data sampling will improve the performance of the Random Forest classifier. In order to test the effect of data sampling, we used Random Undersampling along with two post-sampling class distribution ratios: 35:65 and 50:50 (minority:majority). Additionally, we also built inductive models with Random Forest when no data sampling technique was applied, so we can observe the true effect of the data sampling. All three options were tested on a series of fifteen imbalanced bioinformatics datasets. Our results show that data sampling does improve the classification performance of Random Forest, especially when using the 50:50 post-sampling class distribution ratio. However, statistical analysis shows that the increase in performance is not statistically significant. Thus, we can state that while data sampling does improve the classification performance of Random Forest, it is not a necessary step as the classifier is fairly robust to imbalanced data on its own.

Question: How does data sampling affect the performance of Random Forest?


A Fast Iterative Method for Solving the Eikonal Equation on Triangulated Surfaces. This paper presents an efficient, fine-grained parallel algorithm for solving the Eikonal equation on triangular meshes. The Eikonal equation, and the broader class of Hamilton-Jacobi equations to which it belongs, have a wide range of applications from geometric optics and seismology to biological modeling and analysis of geometry and images. The ability to solve such equations accurately and efficiently provides new capabilities for exploring and visualizing parameter spaces and for solving inverse problems that rely on such equations in the forward model. Efficient solvers on state-of-the-art, parallel architectures require new algorithms that are not, in many cases, optimal, but are better suited to synchronous updates of the solution. In previous work [W. K. Jeong and R. T. Whitaker, SIAM J. Sci. Comput., 30 (2008), pp. 2512-2534], the authors proposed the fast iterative method (FIM) to efficiently solve the Eikonal equation on regular grids. In this paper we extend the fast iterative method to solve Eikonal equations efficiently on triangulated domains on the CPU and on parallel architectures, including graphics processors. We propose a new local update scheme that provides solutions of first-order accuracy for both architectures. We also propose a novel triangle-based update scheme and its corresponding data structure for efficient irregular data mapping to parallel single-instruction multiple-data (SIMD) processors. We provide detailed descriptions of the implementations on a single CPU, a multicore CPU with shared memory, and SIMD architectures with comparative results against state-of-the-art Eikonal solvers.

Question: How to solve the eikonal equation on a triangulated surface?


Optimizing Hierarchical Visualizations with the Minimum Description Length Principle. In this paper we examine how the Minimum Description Length (MDL) principle can be used to efficiently select aggregated views of hierarchical datasets that feature a good balance between clutter and information. We present MDL formulae for generating uneven tree cuts tailored to treemap and sunburst diagrams, taking into account the available display space and information content of the data. We present the results of a proof-of-concept implementation. In addition, we demonstrate how such tree cuts can be used to enhance drill-down interaction in hierarchical visualizations by implementing our approach in an existing visualization tool. Validation is done with the feature congestion measure of clutter in views of a subset of the current DMOZ web directory, which contains nearly half million categories. The results show that MDL views achieve near constant clutter level across display resolutions. We also present the results of a crowdsourced user study where participants were asked to find targets in views of DMOZ generated by our approach and a set of baseline aggregation methods. The results suggest that, in some conditions, participants are able to locate targets (in particular, outliers) faster using the proposed approach.

Question: How to optimize hierarchical visualizations?


Utility of MRI after inconclusive ultrasound in pediatric patients with suspected appendicitis: retrospective review of 60 consecutive patients.. OBJECTIVE The purpose of this study is to examine the utility of appendix MRI in evaluation of pediatric patients with right lower quadrant pain and inconclusive appendix sonography findings.   MATERIALS AND METHODS A search of the radiology electronic database was performed for all appendix MRI examinations performed of pediatric patients within 24 hours after inconclusive appendix sonography from December 1, 2009, through April 26, 2012. Sixty patients underwent appendix MRI within 24 hours of inconclusive sonography and represented the study cohort. MRI examinations were reviewed independently by two radiologists blinded to the diagnosis and were graded as "positive," "negative," or "indeterminate" for acute appendicitis. The final diagnosis was established by review of the surgical and pathology reports and patients' electronic medical records.   RESULTS Ten of 60 patients (17%) had acute appendicitis. Both readers graded the same 12 examinations as positive and the same 48 examinations as negative for acute appendicitis, with a kappa value of 1.00 (expected agreement, 0.695). No MRI examination was interpreted as indeterminate. The sensitivity and specificity of MRI for acute appendicitis in children with inconclusive appendix ultrasound findings were 100% (95% CI, 0.72-1.00) and 96% (95% CI, 0.87-0.98), respectively. The positive predictive value for the examination was 83%, the negative predictive value was 100%, and overall test accuracy was 97%.   CONCLUSION Our study shows that MRI has a sensitivity of 100% and specificity of 96% for appendicitis in pediatric patients after inconclusive appendix sonography. We think that MRI may supplant CT as the secondary modality to follow inconclusive appendix sonography.

Question: What is the utility of MRI after inconclusive ultrasound in pediatric patients with suspected appendicitis?


Orbitofrontal cortex, decision-making and drug addiction. The orbitofrontal cortex, as a part of prefrontal cortex, is implicated in executive function. However, within this broad region, the orbitofrontal cortex is distinguished by its unique pattern of connections with crucial subcortical associative learning nodes, such as basolateral amygdala and nucleus accumbens. By virtue of these connections, the orbitofrontal cortex is uniquely positioned to use associative information to project into the future, and to use the value of perceived or expected outcomes to guide decisions. This review will discuss recent evidence that supports this proposal and will examine evidence that loss of this signal, as the result of drug-induced changes in these brain circuits, might account for the maladaptive decision-making that characterizes drug addiction.

Question: What is the orbitofrontal cortex?


High-Conversion-Ratio Bidirectional DC–DC Converter With Coupled Inductor. In this paper, a high-conversion-ratio bidirectional dc-dc converter with coupled inductor is proposed. In the boost mode, two capacitors are parallel charged and series discharged by the coupled inductor. Thus, high step-up voltage gain can be achieved with an appropriate duty ratio. The voltage stress on the main switch is reduced by a passive clamp circuit. Therefore, the low resistance RDS(ON) of the main switch can be adopted to reduce conduction loss. In the buck mode, two capacitors are series charged and parallel discharged by the coupled inductor. The bidirectional converter can have high step-down gain. Aside from that, all of the switches achieve zero voltage-switching turn-on, and the switching loss can be improved. Due to two active clamp circuits, the energy of the leakage inductor of the coupled inductor is recycled. The efficiency can be further improved. The operating principle and the steady-state analyses of the voltage gain are discussed. Finally, a 24-V-input-voltage, 400-V-output-voltage, and 200-W-output-power prototype circuit is implemented in the laboratory to verify the performance.

Question: What is the purpose of the paper?


Procedural Content Generation: Goals, Challenges and Actionable Steps. This chapter discusses the challenges and opportunities of procedural content generation (PCG) in games. It starts with defining three grand goals of PCG, namely multi-level multi-content PCG, PCG-based game design and generating complete games. The way these goals are defined, they are not feasible with current technology. Therefore we identify nine challenges for PCG research. Work towards meeting these challenges is likely to take us closer to realising the three grand goals. In order to help researchers get started, we also identify five actionable steps, which PCG researchers could get started working on immediately. 1998 ACM Subject Classification I.2.1 Applications and Expert Systems: Games

Question: What is procedural content generation?


Inferring Destination from Mobility Data. Destination prediction in a moving vehicle has several applications such as alternative route recommendations even in cases where the driver has not entered their destination into the system. In this paper a hierarchical approach to destination prediction is presented. A Discrete Time Markov Chain model is used to make an initial prediction of a general region the vehicle might be travelling to. Following that a more complex Bayesian Inference Model is used to make a fine grained prediction within that destination region. The model is tested on a dataset of 442 taxis operating in Porto, Portugal. Experiments are run on two maps. One is a smaller map concentrating specificially on trips within the Porto city centre and surrounding areas. The second map covers a much larger area going as far as Lisbon. We achieve predictions for Porto with average distance error of less than 0.6 km from early on in the trip and less than 1.6 km dropping to less than 1 km for the wider area.

Question: How do you infer destination from mobility data?


Broadband and compact impedance transformers for microwave circuits. Most microwave circuits and antennas use impedance transformers. In a conventional power amplifier, large number of inductors and capacitor or transmission line sections are use to realize an impedance transformer. This article presents an asymmetric broadside-coupled microstrip TLT (transmission line transformer) on the GaAs substrate. This matching network can be easily implemented using any monolithic microwave integrated circuit (MMIC) process supporting multilevel metallization

Question: What is a broadband impedance transformer?


Intelligent Parking Management System Based on Image Processing. This paper aims to present an intelligent system for parking space detection based on image processing technique. The proposed system captures and processes the rounded image drawn at parking lot and produces the information of the empty car parking spaces. In this work, a camera is used as a sensor to take photos to show the occupancy of car parks. The reason why a camera is used is because with an image it can detect the presence of many cars at once. Also, the camera can be easily moved to detect different car parking lots. By having this image, the particular car parks vacant can be known and then the processed information was used to guide a driver to an available car park rather than wasting time to find one. The proposed system has been developed in both software and hardware platform. An automatic parking system is used to make the whole process of parking cars more efficient and less complex for both drivers and administrators.

Question: What is the difference between a camera and a sensor?


Externalising the autobiographical self: sharing personal memories online facilitated memory retention.. Internet technology provides a new means of recalling and sharing personal memories in the digital age. What is the mnemonic consequence of posting personal memories online? Theories of transactive memory and autobiographical memory would make contrasting predictions. In the present study, college students completed a daily diary for a week, listing at the end of each day all the events that happened to them on that day. They also reported whether they posted any of the events online. Participants received a surprise memory test after the completion of the diary recording and then another test a week later. At both tests, events posted online were significantly more likely than those not posted online to be recalled. It appears that sharing memories online may provide unique opportunities for rehearsal and meaning-making that facilitate memory retention.

Question: What is the mnemonic consequence of posting personal memories online?


Elimination of the musical noise phenomenon with the Ephraim and Malah noise suppressor. This paper presents a study of the noise suppression technique proposed by Ephraim and Malah. This technique has been used recently for the restoration of degraded audio recordings because it is free of the frequently encountered 'musical noise' artifact. It is demonstrated how this artifact is actually eliminated without bringing distortion to the recorded signal even if the noise is only poorly stationary.

Question: How does the noise suppressor work?


Binomial filters. Binomial filters are simple and efficient structures based on the binomial coefficients for implementing Gaussian filtering. They do not require multipliers and can therefore be implemented efficiently in programmable hardware. There are many possible variations of the basic binomial filter structure, and they provide a wide range of space-time trade-offs; a number of these designs have been captured in a parametrised form and their features are compared. This technique can be used for multi-dimensional filtering, provided that the filter is separable. The numerical performance of binomial filters, and their implementation using field-programmable devices for an image processing application, are also discussed.

Question: What is a binomial filter?


Active defence through deceptive IPS. Modern security mechanisms such as Unified Threat Management (UTM), Next-Generation Firewalls and Security Information and Event Management (SIEM) have become more sophisticated over recent years, promising advanced security features and immediate mitigation of the most advanced threats. While this appears promising, in practice even this cutting-edge technology often fails to protect modern organisations as they are being targeted by attacks that were previously unknown to the security industry. Most security mechanisms are based on a database of previously known attack artefacts (signatures) and they will fail on slightly modified or new attacks. The need for threat intelligence is in complete contrast with the way current security solutions are responding to the threats they identify, as they immediately block them without attempting to acquire any further information. In this report, we present and evaluate a security mechanism that operates as an intrusion prevention system which uses honeypots to deceive an attacker, prevent a security breach and which allows the potential acquisition of intelligence on each intrusion attempt. a aThis article is published online by Computer Weekly as part of the 2017 Royal Holloway information security thesis series http://www.computerweekly.com/ehandbook/Active-defence-through-deceptive-IPS. It is based on an MSc dissertation written as part of the MSc in Information Security at the ISG, Royal Holloway, University of London. The full thesis is published on the ISG's website at https://www.royalholloway.ac.uk/isg/.

Question: What is a honeypot?


Efficient Training and Evaluation of Recurrent Neural Network Language Models for Automatic Speech Recognition. Recurrent neural network language models RNNLMs are becoming increasingly popular for a range of applications including automatic speech recognition. An important issue that limits their possible application areas is the computational cost incurred in training and evaluation. This paper describes a series of new efficiency improving approaches that allows RNNLMs to be more efficiently trained on graphics processing units GPUs and evaluated on CPUs. First, a modified RNNLM architecture with a nonclass-based, full output layer structure F-RNNLM is proposed. This modified architecture facilitates a novel spliced sentence bunch mode parallelization of F-RNNLM training using large quantities of data on a GPU. Second, two efficient RNNLM training criteria based on variance regularization and noise contrastive estimation are explored to specifically reduce the computation associated with the RNNLM output layer softmax normalisation term. Finally, a pipelined training algorithm utilizing multiple GPUs is also used to further improve the training speed. Initially, RNNLMs were trained on a moderate dataset with 20M words from a large vocabulary conversational telephone speech recognition task. The training time of RNNLM is reduced by up to a factor of 53 on a single GPU over the standard CPU-based RNNLM toolkit. A 56 times speed up in test time evaluation on a CPU was obtained over the baseline F-RNNLMs. Consistent improvements in both recognition accuracy and perplexity were also obtained over C-RNNLMs. Experiments on Google's one billion corpus also reveals that the training of RNNLM scales well.

Question: How to train a recurrent neural network language model?


Evasion and Hardening of Tree Ensemble Classifiers. Classifier evasion consists in finding for a given instance x the "nearest" instance x′ such that the classifier predictions of x and x′ are different. We present two novel algorithms for systematically computing evasions for tree ensembles such as boosted trees and random forests. Our first algorithm uses a Mixed Integer Linear Program solver and finds the optimal evading instance under an expressive set of constraints. Our second algorithm trades off optimality for speed by using symbolic prediction, a novel algorithm for fast finite differences on tree ensembles. On a digit recognition task, we demonstrate that both gradient boosted trees and random forests are extremely susceptible to evasions. Finally, we harden a boosted tree model without loss of predictive accuracy by augmenting the training set of each boosting round with evading instances, a technique we call adversarial boosting.

Question: How to harden a tree ensemble?


Center-Fed Patch Antenna Array Excited by an Inset Dielectric Waveguide for 60-GHz Applications. A patch antenna array proximity-coupled fed by the inset dielectric waveguide (IDW) is proposed in 60-GHz frequency band. The antenna array consists of four series-fed subarrays each having eight pairs of circular patch elements, four substrate integrated IDWs, and a compact four-way power divider transmitting the signal from the grounded coplanar waveguide (GCPW) to the IDWs. The IDW is realized by metallized via-hole arrays in a printed circuit board (PCB). The parallel center-fed configuration is applied to suppress the frequency-dependent beam squinting of the series-fed subarray. Measured results show that the proposed antenna exhibits a gain variation between 15.8 and 19.2 dBi, fixed main beam in the direction of θ = 0°, and the reflection coefficient |S11| ≤ -10 dB over the frequency band from 58 to 64 GHz.

Question: What is the center-fed patch antenna array excited by an inset dielectric waveguide for 60-GHz applications?


A unified architecture for natural language processing: deep neural networks with multitask learning. We describe a single convolutional neural network architecture that, given a sentence, outputs a host of language processing predictions: part-of-speech tags, chunks, named entity tags, semantic roles, semantically similar words and the likelihood that the sentence makes sense (grammatically and semantically) using a language model. The entire network is trained jointly on all these tasks using weight-sharing, an instance of multitask learning. All the tasks use labeled data except the language model which is learnt from unlabeled text and represents a novel form of semi-supervised learning for the shared tasks. We show how both multitask learning and semi-supervised learning improve the generalization of the shared tasks, resulting in state-of-the-art-performance.

Question: What is a unified architecture for natural language processing?


Type-2 fuzzy ontology-based semantic knowledge for collision avoidance of autonomous underwater vehicles. The volume of obstacles encountered in the marine environment is rapidly increasing, which makes the development of collision avoidance systems more challenging. Several fuzzy ontology-based simulators have been proposed to provide a virtual platform for the analysis of maritime missions. However, due to the simulators' limitations, ontologybased knowledge cannot be utilized to evaluate maritime robot algorithms and to avoid collisions. The existing simulators must be equipped with smart semantic domain knowledge to provide an efficient framework for the decision-making system of AUVs. This article presents type-2 fuzzy ontology-based semantic knowledge (T2FOBSK) and a simulator for marine users that will reduce experimental time and the cost of marine robots and will evaluate algorithms intelligently. The system reformulates the user's query to extract the positions of AUVs and obstacles and convert them to a proper format for the simulator. The simulator uses semantic knowledge to calculate the degree of collision risk and to avoid obstacles. The available type-1 fuzzy ontology-based approach cannot extract intensively blurred data from the hazy marine environment to offer actual solutions. Therefore, we propose a type-2 fuzzy ontology to provide accurate information about collision risk and the marine environment during real-time marine operations. Moreover, the type-2 fuzzy ontology is designed using Protégé OWL-2 tools. The DL query and SPARQL query are used to evaluate the ontology. The distance to closest point of approach (DCPA), time to closest point of approach (TCPA) and variation of compass degree (VCD) are used to calculate the degree of collision risk between AUVs and obstacles. The experimental and simulation results show that the proposed architecture is highly efficient and highly productive for marine missions and the real-time decision-making

Question: What is the volume of obstacles encountered in the marine environment?


Signal Processing in Cognitive Radio. Cognitive radio allows for usage of licensed frequency bands by unlicensed users. However, these unlicensed (cognitive) users need to monitor the spectrum continuously to avoid possible interference with the licensed (primary) users. Apart from this, cognitive radio is expected to learn from its surroundings and perform functions that best serve its users. Such an adaptive technology naturally presents unique signal-processing challenges. In this paper, we describe the fundamental signal-processing aspects involved in developing a fully functional cognitive radio network, including spectrum sensing and spectrum sculpting.

Question: What is cognitive radio?


Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms. With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the term "prototypes" refers to the reference instances used in a nearest neighbor computation — the instances with respect to which similarity is assessed in order to assign a class to a new data item. Both algorithms rely on stochastic techniques to search the space of sets of prototypes and are simple to implement. The first is a Monte Carlo sampling algorithm; the second applies random mutation hill climbing. On four datasets we show that only three or four prototypes sufficed to give predictive accuracy equal or superior to a basic nearest neighbor algorithm whose run-time storage costs were approximately 10 to 200 times greater. We briefly investigate how random mutation hill climbing may be applied to select features and prototypes simultaneously. Finally, we explain the performance of the sampling algorithm on these datasets in terms of a statistical measure of the extent of clustering displayed by the target classes.

Question: What is the difference between hill climbing and hill climbing?