User behaviour analysis in context-aware recommender system using hybrid filtering approach. The incorporation of context in recommendation systems is important for providing good recommendations as it improves the performance. Context awareness is an important concept in many disciplines. There are various methods that have already been proposed for context aware recommendation systems and can be classified into pre-filter, post-filter and contextual generalization. However, we found that there are some problems in using a single approach. So, in this paper we propose a new approach by combining pre-filter and post-filter methods based on the importance of contextual attribute. We believe that the contextual attribute should be dynamically selected for every user, as we found that it varies according to the user behaviour. In our approach, in case of a few rating scenario a simple method is used to provide a solution. The strategy adopted is advantageous over the single approach and is effective in improving the accuracy for the context aware recommender system.

Question: What is the difference between pre-filter and post-filter?


Addressing cold start in recommender systems: a semi-supervised co-training algorithm. Cold start is one of the most challenging problems in recommender systems. In this paper we tackle the cold-start problem by proposing a context-aware semi-supervised co-training method named CSEL. Specifically, we use a factorization model to capture fine-grained user-item context. Then, in order to build a model that is able to boost the recommendation performance by leveraging the context, we propose a semi-supervised ensemble learning algorithm. The algorithm constructs different (weak) prediction models using examples with different contexts and then employs the co-training strategy to allow each (weak) prediction model to learn from the other prediction models. The method has several distinguished advantages over the standard recommendation methods for addressing the cold-start problem. First, it defines a fine-grained context that is more accurate for modeling the user-item preference. Second, the method can naturally support supervised learning and semi-supervised learning, which provides a flexible way to incorporate the unlabeled data.  The proposed algorithms are evaluated on two real-world datasets. The experimental results show that with our method the recommendation accuracy is significantly improved compared to the standard algorithms and the cold-start problem is largely alleviated.

Question: What is recommender systems?


Introduction to Information Retrieval: Index.

Question: What is the index?


Combining Naive Bayes and Decision Tree for Adaptive Intrusion Detection. In this paper, a new learning algorithm for adaptive network intrusion detection using naive Bayesian classifier and decision tree is presented, which performs balance detections and keeps false positives at acceptable level for different types of network attacks, and eliminates redundant attributes as well as contradictory examples from training data that make the detection model complex. The proposed algorithm also addresses some difficulties of data mining such as handling continuous attribute, dealing with missing attribute values, and reducing noise in training data. Due to the large volumes of security audit data as well as the complex and dynamic properties of intrusion behaviours, several data miningbased intrusion detection techniques have been applied to network-based traffic data and host-based data in the last decades. However, there remain various issues needed to be examined towards current intrusion detection systems (IDS). We tested the performance of our proposed algorithm with existing learning algorithms by employing on the KDD99 benchmark intrusion detection dataset. The experimental results prove that the proposed algorithm achieved high detection rates (DR) and significant reduce false positives (FP) for different types of network intrusions using limited computational resources.

Question: What is the difference between naive Bayes and decision tree?


Hat-Delta --- One Right Does Make a Wrong. We outline two methods for locating bugs in a program. This is done by comparing computations of the same program with different input. At least one of these computations must produce a correct result, while exactly one must exhibit some erroneous behaviour. Firstly reductions that are thought highly likely to be correct are eliminated from the search for the bug. Secondly, a program slicing technique is used to identify areas of code that are likely to be correct. Both methods have been implemented. In combination with algorithmic debugging they provide a system that quickly and accurately identifies bugs.

Question: What is a bug?


Study of wheel slip and traction forces in differential drive robots and slip avoidance control strategy. The effect of wheel slip in differential drive robots is investigated in this paper. We consider differential drive robots with two driven wheels and ball-type caster wheels that are used to provide balance and support to the mobile robot. The limiting values of traction forces for slip and no slip conditions are dependent on wheel-ground kinetic and static friction coefficients. The traction forces are used to determine the fraction of input torque that provides robot motion and this is used to calculate the actual position of the robot under slip conditions. The traction forces under no slip conditions are used to determine the limiting value of the wheel torque above which the wheel slips. This limiting torque value is used to set a saturation limit for the input torque to avoid slip. Simulations are conducted to evaluate the behavior of the robot during slip and no slip conditions. Experiments are conducted under similar slip and no slip conditions using a custom built differential drive mobile robot with one caster wheel to validate the simulations. Experiments are also conducted with the torque limiting strategy. Results from model simulations and experiments are presented and discussed.

Question: What is the difference between wheel slip and traction forces?


Automatic Identification of Word Translations from Unrelated English and German Corpora. Algorithms for the alignment of words in translated texts are w ell established. However, only recently, new approaches have been proposed to identify word translations f rom non-parallel or even unrelated texts. This task is more difficult, because most statistical clues useful in the processing of parallel texts can not be applied for non-parallel tex ts. For this reason, whereas for parallel texts in some studies up to 99% of the word alignments have been shown to be correct, the accuracy for non-parallel texts has been around 30% up to now. The current study, which is based on the assumption that there is a correlation between the patterns of word cooccurrences in corpora of different languages, makes a significant improvement to about 72% of word translations identified correctly.

Question: How do you identify word translations from non-parallel texts?


An effective way of word-level language identification for code-mixed facebook comments using word-embedding via character-embedding. Individuals utilize online networking sites like Facebook and Twitter to express their interests, opinions or reviews. The users used English language as their medium for communication in earlier days. Despite the fact that content can be written in Unicode characters now, people find it easier to communicate by mixing two or more languages together or lean toward writing their native language in Roman script. These types of data are called code-mixed text. While processing such social-media data, recognizing the language of the text is an important task. In this work, we have developed a system for word-level language identification on code-mixed social media text. The work is accomplished for Tamil-English and Malayalam-English code-mixed Facebook comments. The methodology used for the system is a novel approach which is implemented based on features obtained from character-based embedding technique with the context information and uses a machine learning based classifier, Support Vector Machine for training and testing. An accuracy of 93% was obtained for Malayalam-English and 95% for Tamil-English code-mixed text.

Question: How to identify the language of a code-mixed text?


Integrated photovoltaic maximum power point tracking converter. A low-power low-cost highly efficient maximum power point tracker (MPPT) to be integrated into a photovoltaic (PV) panel is proposed. This can result in a 25% energy enhancement compared to a standard photovoltaic panel, while performing functions like battery voltage regulation and matching of the PV array with the load. Instead of using an externally connected MPPT, it is proposed to use an integrated MPPT converter as part of the PV panel. It is proposed that this integrated MPPT uses a simple controller in order to be cost effective. Furthermore, the converter has to be very efficient, in order to transfer more energy to the load than a directly coupled system. This is achieved by using a simple soft-switched topology. A much higher conversion efficiency at lower cost will then result, making the MPPT an affordable solution for small PV energy systems.

Question: What is the maximum power point tracking converter?


Pvclust: an R package for assessing the uncertainty in hierarchical clustering. SUMMARY Pvclust is an add-on package for a statistical software R to assess the uncertainty in hierarchical cluster analysis. Pvclust can be used easily for general statistical problems, such as DNA microarray analysis, to perform the bootstrap analysis of clustering, which has been popular in phylogenetic analysis. Pvclust calculates probability values (p-values) for each cluster using bootstrap resampling techniques. Two types of p-values are available: approximately unbiased (AU) p-value and bootstrap probability (BP) value. Multiscale bootstrap resampling is used for the calculation of AU p-value, which has superiority in bias over BP value calculated by the ordinary bootstrap resampling. In addition the computation time can be enormously decreased with parallel computing option.

Question: What is the difference between approximately unbiased p-value and bootstrap probability value?


Malware Detection Using Deep Transferred Generative Adversarial Networks. Malicious software is generated with more and more modified features of which the methods to detect malicious software use characteristics. Automatic classification of malicious software is efficient because it does not need to store all characteristic. In this paper, we propose a transferred generative adversarial network (tGAN) for automatic classification and detection of the zero-day attack. Since the GAN is unstable in training process, often resulting in generator that produces nonsensical outputs, a method to pre-train GAN with autoencoder structure is proposed. We analyze the detector, and the performance of the detector is visualized by observing the clustering pattern of malicious software using t-SNE algorithm. The proposed model gets the best performance compared with the conventional machine learning algorithms.

Question: What is a zero-day attack?


Self-Supervised Adversarial Hashing Networks for Cross-Modal Retrieval. Thanks to the success of deep learning, cross-modal retrieval has made significant progress recently. However, there still remains a crucial bottleneck: how to bridge the modality gap to further enhance the retrieval accuracy. In this paper, we propose a self-supervised adversarial hashing (SSAH) approach, which lies among the early attempts to incorporate adversarial learning into cross-modal hashing in a self-supervised fashion. The primary contribution of this work is that two adversarial networks are leveraged to maximize the semantic correlation and consistency of the representations between different modalities. In addition, we harness a self-supervised semantic network to discover high-level semantic information in the form of multi-label annotations. Such information guides the feature learning process and preserves the modality relationships in both the common semantic space and the Hamming space. Extensive experiments carried out on three benchmark datasets validate that the proposed SSAH surpasses the state-of-the-art methods.

Question: What is the self-supervised adversarial hashing?


QRSF: QoS-aware resource scheduling framework in cloud computing. Cloud computing harmonizes and delivers the ability of resource sharing over different geographical sites. Cloud resource scheduling is a tedious task due to the problem of finding the best match of resource-workload pair. The efficient management of dynamic nature of resource can be done with the help of cloud workloads. Till cloud workload is deliberated as a central capability, the resources cannot be utilized in an effective way. In literature, very few efficient resource scheduling policies for energy, cost and time constraint cloud workloads are reported. This paper presents an efficient cloud workload management framework in which cloud workloads have been identified, analyzed and clustered through K-means on the basis of weights assigned and their QoS requirements. Further scheduling has been done based on different scheduling policies and their corresponding algorithms. The performance of the proposed algorithms has been evaluated with existing scheduling policies through CloudSim toolkit. The experimental results show that the proposed framework gives better results in terms of energy consumption, execution cost and time of different cloud workloads as compared to existing algorithms.

Question: What is cloud computing?


Connectivity in a citation network: The development of DNA theory. The study of citation networks for both articles and journals is routine. In general, these analyses proceed by considering the similarity of articles or journals and submitting the set of similarity measures to some clustering or scaling procedure. Two common methods are found in bibliomettic coupling, where two citing articles are similar to the extent they cite the same literature, and co-citation analysis where cited articles are similar to the extent they are cited by the same citing articles. Methods based on structural and regular equivalence also seek to partition the article based on their positional location. Such methods have in common focus on the articles and partitions of them. We propose a quite different approach where the connective threads through a network are preserved and the focus is on the links in the network rather than on the nodes. Variants of the depth first search algorithm are used to detect and represent the mainstream of the literature of a clearly delineated area of scientific research. The specific citation network is one that consists of ties among the key events and papers that lead to the discovery and modeling of DNA together with the final experimental confirmation of its representation.

Question: What is the difference between a citation network and a co-citation network?


A low noise readout circuit for integrated electrochemical biosensor arrays. This paper presents a low noise electrochemical interface circuit that is tuned to the needs of protein-based biosensor arrays and compatible with the formation of fully integrated biochemical microsystems. The circuit includes an integrated potentiostat and highly sensitive amperometric readout amplifier. It achieves good noise performance while supporting biosensor output currents from 10 pA to 10 /spl mu/A to suit a wide range of sensitivities and electrode areas. Implemented in 0.5 /spl mu/m CMOS process, it is compatible with a post-CMOS process to realize an integrated biosensor array.

Question: What is a low noise readout circuit?


Making Scheduling "Cool": Temperature-Aware Workload Placement in Data Centers. Trends towards consolidation and higher-density computing configurations make the problem of heat management one of the critical challenges in emerging data centers. Conventional approaches to addressing this problem have focused at the facilities level to develop new cooling technologies or optimize the delivery of cooling. In contrast to these approaches, our paper explores an alternate dimension to address this problem, namely a systems-level solution to control the heat generation through temperatureaware workload placement. We first examine a theoretic thermodynamic formulation that uses information about steady state hot spots and cold spots in the data center and develop real-world scheduling algorithms. Based on the insights from these results, we develop an alternate approach. Our new approach leverages the non-intuitive observation that the source of cooling inefficiencies can often be in locations spatially uncorrelated with its manifested consequences; this enables additional energy savings. Overall, our results demonstrate up to a factor of two reduction in annual data center cooling costs over location-agnostic workload distribution, purely through software optimizations without the need for any costly capital investment.

Question: What is the cost of cooling a data center?


Smart contract-based campus demonstration of decentralized transactive energy auctions. Transactive energy paradigms will enable the exchange of energy from a distributed set of prosumers. While prosumers have access to distributed energy resources, these resources are intermittently available. There is a need for distributed markets to enable the exchange of energy in transactive environments, however, the large number of potential prosumers introduces challenges in the establishment of trust between prosumers. Markets for transactive environments create other challenges, such as establishing clearing prices for energy and exchanging money between prosumers. Blockchains provide a unique technology to address this distributed trust problem through the use of a distributed ledger, cryptocurrencies, and the execution of smart contracts. This paper introduces a smart contract that implements a transactive energy auction that operates without the need for a trusted entitys oversight. The auction mechanism implements a Vickrey second price auction, which guarantees bidders will submit honest bids. The contract is implemented on transactive agents on the WSU campus interacting with a 72kW PV array and the Ethereum blockchain. The contract is then used to execute auctions based on the energy from the the PV array and simulated building loads to demonstrate the auctions operations.

Question: What is a Vickrey second price auction?


Cross-domain recommendations without overlapping data: myth or reality?. Cross-domain recommender systems adopt different techniques to transfer learning from source domain to target domain in order to alleviate the sparsity problem and improve accuracy of recommendations. Traditional techniques require the two domains to be linked by shared characteristics associated to either users or items. In collaborative filtering (CF) this happens when the two domains have overlapping users or item (at least partially). Recently, Li et al. [7] introduced codebook transfer (CBT), a cross-domain CF technique based on co-clustering, and presented experimental results showing that CBT is able to transfer knowledge between non-overlapping domains. In this paper, we disprove these results and show that CBT does not transfer knowledge when source and target domains do not overlap.

Question: What is the difference between cross-domain and cross-domain recommendations?


Discriminating Gender on Twitter. Accurate prediction of demographic attributes from social media and other informal online content is valuable for marketing, personalization, and legal investigation. This paper describes the construction of a large, multilingual dataset labeled with gender, and investigates statistical models for determining the gender of uncharacterized Twitter users. We explore several different classifier types on this dataset. We show the degree to which classifier accuracy varies based on tweet volumes as well as when various kinds of profile metadata are included in the models. We also perform a large-scale human assessment using Amazon Mechanical Turk. Our methods significantly out-perform both baseline models and almost all humans on the same task.

Question: How accurate is gender prediction on twitter?


Ka-Band Phased Array Antenna for High-Data-Rate SATCOM. The general issue of this letter deals with the design of a phased array antenna for high-data-rate SATCOM. A final demonstrator antenna could be installed on an unmanned aerial vehicle (UAV) to communicate with a satellite in Ka-band. First, a compact reflection-type phase shifter is designed and realized. Second, the conception of a phased array antenna prototype is detailed. Third, a new calibration method is involved that can provide the bias voltage to be applied to each phase shifter in order to scan the beam in the desired direction.

Question: What is a reflection-type phase shifter?


Multi words quran and hadith searching based on news using TF-IDF. Each week religious leaders need to give advice to their community. Religious advice matters ideally contain discussion and solution of the problem that arising in society. But the lot of religious resources that must be considered agains many arising problems make this religious task is not easy. Especially in moslem community, the religious resources are Quran and Kutubus Sitah, the six most referenced collection of Muhammad (pbuh) news (hadith). The problem that arising in society can be read from various online mass media. Doing manually, they must know the Arabic word of the problem, and make searching manually from Mu'jam, Quran and Hadith index, then write out the found verses or hadith. TF-IDF method is often used in the weighting informational retrieval and text mining. This research want to make tools that get input from mass media news, make multi words searching from database using TF-IDF (Term Frequency - Inverse Document Frequency), and give relevan verse of Quran and hadith. Top five the most relevan verse of Quran and hadith will be displayed. Justified by religious leader, application give 60% precision for Quranic verses, and 53% for hadith, with the average query time 2.706 seconds.

Question: How to make multi words searching based on news using TF-IDF?


Constraint-based sequential pattern mining: the pattern-growth methods. Constraints are essential for many sequential pattern mining applications. However, there is no systematic study on constraint-based sequential pattern mining. In this paper, we investigate this issue and point out that the framework developed for constrained frequent-pattern mining does not fit our mission well. An extended framework is developed based on a sequential pattern growth methodology. Our study shows that constraints can be effectively and efficiently pushed deep into the sequential pattern mining under this new framework. Moreover, this framework can be extended to constraint-based structured pattern mining as well.

Question: What is the framework for constraint-based sequential pattern mining?


Many-objective optimization algorithm applied to history matching. Reservoir model calibration, called history matching in the petroleum industry, is an important task to make more accurate predictions for better reservoir management. Providing an ensemble of good matched reservoir models from history matching is essential to reproduce the observed production data from a field and to forecast reservoir performance. The nature of history matching is multi-objective because there are multiple match criteria or misfit from different production data, wells and regions in the field. In many cases, these criteria are conflicting and can be handled by the multi-objective approach. Moreover, multi-objective provides faster misfit convergence and more robust towards stochastic nature of optimization algorithms. However, reservoir history matching may feature far too many objectives that can be efficiently handled by conventional multi-objective algorithms, such as multi-objective particle swarm optimizer (MOPSO) and non-dominated sorting genetic algorithm II (NSGA II). Under an increasing number of objectives, the performance of multi-objective history matching by these algorithms deteriorates (lower match quality and slower misfit convergence). In this work, we introduce a recently proposed algorithm for many-objective optimization problem, known as reference vector-guided evolutionary algorithm (RVEA), to history matching. We apply the algorithm to history matching a synthetic reservoir model and a real field case study with more than three objectives. The paper demonstrates the superiority of the proposed RVEA to the state of the art multi-objective history matching algorithms, namely MOPSO and NSGA II.

Question: What is the difference between multi-objective and many-objective optimization?


Environmental impacts of polyvinyl chloride (PVC) production process. The increasing demand for plastics in the world leads to pressures on the environment generated by the consumption of raw materials based on fossil fuels and the need for plastic waste reduction and absorption to diminish their environmental impacts. In this paper we evaluated the environmental impacts induced by the production of polyvinyl chloride (PVC), one of the most widely used plastics in the manufacture of various goods. The impacts were calculated based on Life Cycle Assessment methodology. The negative environmental impacts of PVC production may be reduced by recycling, a sustainable, effective, currently available alternative of waste management. Our study showed that the use of recyclable materials, such as organic biodegradable waste as raw materials instead of crude oil can lead to significant reduction of environmental impacts.

Question: What are the environmental impacts of PVC production?


Energy-aware wireless microsensor networks. Self-configuring wireless sensor networks can be invaluable in many civil and military applications for collecting, processing, and disseminating wide ranges of complex environmental data. Because of this, they have attracted considerable research attention in the last few years. The WINS [1] and SmartDust [2] projects, for instance, aim to integrate sensing, computing, and wireless communication capabilities into a small form factor to enable low-cost production of these tiny nodes in large numbers. Several other groups are investigating efficient hardware/software system architectures, signal processing algorithms, and network protocols for wireless sensor networks [3]-[5]. Sensor nodes are battery driven and hence operate on an extremely frugal energy budget. Further, they must have a lifetime on the order of months to years, since battery replacement is not an option for networks with thousands of physically embedded nodes. In some cases, these networks may be required to operate solely on energy scavenged from the environment through seismic, photovoltaic, or thermal conversion. This transforms energy consumption into the most important factor that determines sensor node lifetime. Conventional low-power design techniques [6] and hardware architectures only provide point solutions which are insufficient for these highly energy-constrained systems. Energy optimization, in the case of sensor networks, is much more complex, since it involves not only reducing the energy consumption of a single sensor node but also maximizing the lifetime of an entire network. The network lifetime can be maximized

Question: What is the difference between a wireless sensor network and a wireless sensor?


Static hand gesture recognition based on HOG characters and support vector machines. Gesture recognition technology has important significance in the field of human-computer interaction (HCI), the gesture recognition technology which is based on visual is sensitive to the impact of the experimental environment lighting, and so, the recognition result will produce a greater change; it makes this technology one of the most challenging topics. HOG feature which is successfully applied to pedestrian detection is operating on the local grid unit of image, so it can maintain a good invariance on geometric and optical deformation. In this paper, we extracted the gradient direction histogram (HOG) features of gestures, then, a Support Vector Machines is used to train these feature vectors, at testing time, a decision is taken using the previously learned SVMs, and compared the same gesture recognition rate in different light conditions. Experimental results show that the HOG feature extraction and multivariate SVM classification methods has a high recognition rate, and the system has a better robustness for the illumination.

Question: How to extract HOG features?


Computing arbitrary functions of encrypted data. Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorphic" encryption scheme that keeps data private, but that allows a worker that does not have the secret decryption key to compute any (still encrypted) result of the data, even when the function of the data is very complex. In short, a third party can perform complicated processing of data without being able to see it. Among other things, this helps make cloud computing compatible with privacy.

Question: What is a fully homomorphic encryption scheme?


SDR-Based Resilient Wireless Communications. As the use of wireless technologies increases significantly due to ease of deployment, cost-effectiveness and the increase in bandwidth, there is a critical need to make the wireless communications secure, and resilient to attacks or faults (malicious or natural). Wireless communications are inherently prone to cyberattacks due to the open access to the medium. While current wireless protocols have addressed the privacy issues, they have failed to provide effective solutions against denial of service attacks, session hijacking and jamming attacks.In this paper, we present a resilient wireless communication architecture based on Moving Target Defense, and Software Defined Radios (SDRs). The approach achieves its resilient operations by randomly changing the runtime characteristics of the wireless communications channels between different wireless nodes to make it extremely difficult to succeed in launching attacks. The runtime characteristics that can be changed include packet size, network address, modulation type, and the operating frequency of the channel. In addition, the lifespan for each configuration will be random. To reduce the overhead in switching between two consecutive configurations, we use two radio channels that are selected at random from a finite set of potential channels, one will be designated as an active channel while the second acts as a standby channel. This will harden the wireless communications attacks because the attackers have no clue on what channels are currently being used to exploit existing vulnerability and launch an attack. The experimental results and evaluation show that our approach can tolerate a wide range of attacks (Jamming, DOS and session attacks) against wireless networks.

Question: What is the lifespan of a configuration?


Text Mining for Documents Annotation and Ontology Support. This paper presents a survey of basic concepts in the area of text data mining and some of the methods used in order to elicit useful knowledge from collections of textual data. Three different text data mining techniques (clustering/visualisation, association rules and classification models) are analysed and its exploitation possibilities within the Webocracy project are showed. Clustering and association rules discovery are well suited as supporting tools for ontology management. Classification models are used for automatic documents annotation.

Question: What is the Webocracy project?


Wiktionary-Based Word Embeddings. Vectorial representations of words have grown remarkably popular in natural language processing and machine translation. The recent surge in deep learning-inspired methods for producing distributed representations has been widely noted even outside these fields. Existing representations are typically trained on large monolingual corpora using context-based prediction models. In this paper, we propose extending pre-existing word representations by exploiting Wiktionary. This process results in a substantial extension of the original word vector representations, yielding a large multilingual dictionary of word embeddings. We believe that this resource can enable numerous monolingual and cross-lingual applications, as evidenced in a series of monolingual and cross-lingual semantic experiments that we have conducted.

Question: What is a vectorial representation of a word?


Adaptive Optimal Control of Highly Dissipative Nonlinear Spatially Distributed Processes With Neuro-Dynamic Programming. Highly dissipative nonlinear partial differential equations (PDEs) are widely employed to describe the system dynamics of industrial spatially distributed processes (SDPs). In this paper, we consider the optimal control problem of the general highly dissipative SDPs, and propose an adaptive optimal control approach based on neuro-dynamic programming (NDP). Initially, Karhunen-Loève decomposition is employed to compute empirical eigenfunctions (EEFs) of the SDP based on the method of snapshots. These EEFs together with singular perturbation technique are then used to obtain a finite-dimensional slow subsystem of ordinary differential equations that accurately describes the dominant dynamics of the PDE system. Subsequently, the optimal control problem is reformulated on the basis of the slow subsystem, which is further converted to solve a Hamilton-Jacobi-Bellman (HJB) equation. HJB equation is a nonlinear PDE that has proven to be impossible to solve analytically. Thus, an adaptive optimal control method is developed via NDP that solves the HJB equation online using neural network (NN) for approximating the value function; and an online NN weight tuning law is proposed without requiring an initial stabilizing control policy. Moreover, by involving the NN estimation error, we prove that the original closed-loop PDE system with the adaptive optimal control policy is semiglobally uniformly ultimately bounded. Finally, the developed method is tested on a nonlinear diffusion-convection-reaction process and applied to a temperature cooling fin of high-speed aerospace vehicle, and the achieved results show its effectiveness.

Question: How to solve a nonlinear PDE?


Partial entity structure: a compact non-manifold boundary representation based on partial topological entities. Non-manifold boundary representations have gained a great deal of popularity in recent years and various representation schemes have been proposed because they allow an even wider range of objects for various applications than conventional manifold representations. However, since these schemes are mainly interested in describing sufficient adjacency relationships of topological entities, the models represented in these schemes occupy too much storage space redundantly although they are very efficient in answering queries on topological adjacency relationships. Storage requirement can arise as a crucial problem in models in which topological data is more dominant than geometric data, such as tessellated or mesh models. To solve this problem, in this paper, we propose a compact non-manifold boundary representation, called the partial entity structure, which allows the reduction of the storage size to half that of the radial edge structure, which is known as a time efficient non-manifold data structure, while allowing full topological adjacency relationships to be derived without loss of efficiency. This representation contains not only the conventional primitive entities like the region, face, edge, and vertex, but also the partial topological entities such as the partial-face, partial-edge, and partial-vertex for describing non-manifold conditions at vertices, edges, and faces. In order to verify the time and storage efficiency of the partial entity structure, the time complexity of basic query procedures and the storage requirement for typical geometric models are derived and compared with those of existing schemes. Furthermore, a set of the generalized Euler operators and typical high-level modeling capabilities such as Boolean operations are also implemented to confirm that our data structure is sound and easy to be manipulated.

Question: What is the storage requirement of the partial entity structure?


Self-assembly of neural networks viewed as swarm intelligence. While self-assembly is a fairly active area of research in swarm intelligence, relatively little attention has been paid to the issues surrounding the construction of network structures. In this paper we extend methods developed previously for controlling collective movements of agent teams to serve as the basis for self-assembly or "growth" of networks, using neural networks as a concrete application to evaluate our approach. Our central innovation is having network connections arise as persistent "trails" left behind moving agents, trails that are reminiscent of pheromone deposits made by agents in ant colony optimization models. The resulting network connections are thus essentially a record of agent movements. We demonstrate our model's effectiveness by using it to produce two large networks that support subsequent learning of topographic and feature maps. Improvements produced by the incorporation of collective movements are also examined through computational experiments. These results indicate that methods for directing collective movements can be adopted to facilitate network self-assembly.

Question: How can we use collective movements to self-assemble networks?


The Role of Instructional Design in Persuasion: A Comics Approach for Improving Cybersecurity. Although computer security technologies are the first line of defence to secure users, their success is dependent on individuals' behaviour. It is therefore necessary to persuade users to practice good computer security. Our interview analysis of users' conceptualization of security password guessing attacks, antivirus protection, and mobile online privacy shows that poor understanding of security threats influences users' motivation and ability to practice safe behaviours. We designed and developed an online interactive comic series called Secure Comics based on instructional design principles to address this problem. An eye-tracking experiment suggests that the graphical and interactive components of the comics direct users' attention and facilitate comprehension of the information. In our evaluations of Secure Comics, results from several user studies show that the comics improve understanding and motivate positive changes in security management behaviour. We discuss the implication of the findings to better understand the role of instructional design and persuasion in education technology.

Question: How can we persuade users to practice good computer security?


Redirected Walking in Place. This paper describes a method for allowing people to virtually move around a CAVETM without ever having to turn to face the missing back wall. We describe the method, and report a pilot study of 28 participants, half of whom moved through the virtual world using a hand-held controller, and the other half used the new technique called 'Redirected Walking in Place' (RWP). The results show that the current instantiation of the RWP technique does not result in a lower frequency of looking towards the missing wall. However, the results also show that the sense of presence in the virtual environment is significantly and negatively correlated with the amount that the back wall is seen. There is evidence that RWP does reduce the chance of seeing the blank wall for some participants. The increased sense of presence through never having to face the blank wall, and the results of this pilot study show the RWP has promise and merits further development.

Question: How does the RWP technique work?


User experiences with web-based 3D virtual travel destination marketing portals: the need for visual indication of interactive 3D elements. The tourism sector has found virtual reality technology to be a good way to market travel destinations for consumers. In this paper, we describe two user studies with three web-based 3D virtual travel destination marketing portals. These three portals were developed to support and attract wintertime tourism into the region by offering a possibility to experience in advance, a virtual snowy scenery with different activities, for example downhill skiing. In both user studies with 21 subjects the focus was on user experience with the 3D virtual travel destination marketing portals. In the second study also the visual design aspects within these portals were studied. Our studies indicate that 3D virtual travel destination marketing portals can enhance 2D web pages, if they offer the possibility to explore the location freely and through different kinds of virtual activities. Also our studies support prior findings of the efficiency of glow effect for indicating interactive 3D elements within a 3D virtual environment.

Question: How can we enhance 2D web pages with 3D virtual travel destination marketing portals?


Short-Text Clustering using Statistical Semantics. Short documents are typically represented by very sparse vectors, in the space of terms. In this case, traditional techniques for calculating text similarity results in measures which are very close to zero, since documents even the very similar ones have a very few or mostly no terms in common. In order to alleviate this limitation, the representation of short-text segments should be enriched by incorporating information about correlation between terms. In other words, if two short segments do not have any common words, but terms from the first segment appear frequently with terms from the second segment in other documents, this means that these segments are semantically related, and their similarity measure should be high. Towards achieving this goal, we employ a method for enhancing document clustering using statistical semantics. However, the problem of high computation time arises when calculating correlation between all terms. In this work, we propose the selection of a few terms, and using these terms with the Nystr\"om method to approximate the term-term correlation matrix. The selection of the terms for the Nystr\"om method is performed by randomly sampling terms with probabilities proportional to the lengths of their vectors in the document space. This allows more important terms to have more influence on the approximation of the term-term correlation matrix and accordingly achieves better accuracy.

Question: What is the Nystr\"om method?


The importance of being flexible: the ability to both enhance and suppress emotional expression predicts long-term adjustment.. Researchers have documented the consequences of both expressing and suppressing emotion using between-subjects designs. It may be argued, however, that successful adaptation depends not so much on any one regulatory process, but on the ability to flexibly enhance or suppress emotional expression in accord with situational demands. We tested this hypothesis among New York City college students in the aftermath of the September 11th terrorist attacks. Subjects' performance in a laboratory task in which they enhanced emotional expression, suppressed emotional expression, and behaved normally on different trials was examined as a prospective predictor of their adjustment across the first two years of college. Results supported the flexibility hypothesis. A regression analysis controlling for initial distress and motivation and cognitive resources found that subjects who were better able to enhance and suppress the expression of emotion evidenced less distress by the end of the second year. Memory deficits were also observed for both the enhancement and the suppression tasks, suggesting that both processes require cognitive resources.

Question: How does the ability to flexibly enhance or suppress emotional expression predict long-term adjustment?


Aggregating local descriptors into a compact image representation. We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usage of the representation. We first propose a simple yet efficient way of aggregating local image descriptors into a vector of limited dimension, which can be viewed as a simplification of the Fisher kernel representation. We then show how to jointly optimize the dimension reduction and the indexing algorithm, so that it best preserves the quality of vector comparison. The evaluation shows that our approach significantly outperforms the state of the art: the search accuracy is comparable to the bag-of-features approach for an image representation that fits in 20 bytes. Searching a 10 million image dataset takes about 50ms.

Question: How to aggregate local descriptors into a compact image representation?


Software-Defined Networking: A Comprehensive Survey. The Internet has led to the creation of a digital society, where (almost) everything is connected and is accessible from anywhere. However, despite their widespread adoption, traditional IP networks are complex and very hard to manage. It is both difficult to configure the network according to predefined policies, and to reconfigure it to respond to faults, load, and changes. To make matters even more difficult, current networks are also vertically integrated: the control and data planes are bundled together. Software-defined networking (SDN) is an emerging paradigm that promises to change this state of affairs, by breaking vertical integration, separating the network's control logic from the underlying routers and switches, promoting (logical) centralization of network control, and introducing the ability to program the network. The separation of concerns, introduced between the definition of network policies, their implementation in switching hardware, and the forwarding of traffic, is key to the desired flexibility: by breaking the network control problem into tractable pieces, SDN makes it easier to create and introduce new abstractions in networking, simplifying network management and facilitating network evolution. In this paper, we present a comprehensive survey on SDN. We start by introducing the motivation for SDN, explain its main concepts and how it differs from traditional networking, its roots, and the standardization activities regarding this novel paradigm. Next, we present the key building blocks of an SDN infrastructure using a bottom-up, layered approach. We provide an in-depth analysis of the hardware infrastructure, southbound and northbound application programming interfaces (APIs), network virtualization layers, network operating systems (SDN controllers), network programming languages, and network applications. We also look at cross-layer problems such as debugging and troubleshooting. In an

Question: What is the motivation for software defined networking?


A Logit Model of Brand Choice Calibrated on Scanner Data. Optical scanning of the Universal Product Code in supermarkets provides a new level of detail and completeness in household panel data and makes possible the construction of more comprehensive brand choice models than hitherto possible. A multinomial logit model calibrated on 32 weeks of purchases of regular ground coffee by 100 households shows high statistical significance for the explanatory variables of brand loyalty, size loyalty, presence/absence of store promotion, regular shelf price and promotional price cut. The model is quite parsimonious in that the coefficients of these variables are modeled to be the same for all coffee brand-sizes. Considering its parsimony, the calibrated model predicts surprisingly well the share of purchases by brand-size in a hold-out sample of 100 households over the 32 week calibration period and a subsequent 20 week forecast period. Discrepencies in prediction are conjectured to be due in part to missing variables. Three short term market response measures are calculated from the model: regular shelf price elasticity of share, percent share increase from a promotion with a median price cut, and promotional price cut elasticity of share. Responsiveness varies across brand-sizes in a systematic way with large share brand-sizes showing less responsiveness in percentage terms. On the basis of the model a quantitative picture emerges of groups of loyal customers who are relatively insensitive to marketing actions and a pool of switchers who are quite responsive.

Question: What is a brand loyalty model?


Minimal intervention dentistry: part 4. Detection and diagnosis of initial caries lesions. The detection of carious lesions is focused on the identification of early mineral changes to allow the demineralisation process to be managed by non-invasive interventions. The methods recommended for clinical diagnosis of initial carious lesions are discussed and illustrated. These include the early detection of lesions, evaluation of the extent of the lesion and its state of activity and the establishment of appropriate monitoring. The place of modern tools, including those based on fluorescence, is discussed. These can help inform patients. They are also potentially useful in regular control visits to monitor the progression or regression of early lesions. A rigorous and systematic approach to caries diagnosis is essential to establish a care plan for the disease and to identify preventive measures based on more precise diagnosis and to reduce reliance on restorative measures.

Question: What is the difference between a carious lesion and a cavity?


Formal Semantics and Analysis of BPMN Process Models using Petri Nets ?. The Business Process Modelling Notation (BPMN) is a standard for capturing business processes in the early phases of systems development. The mix of constructs found in BPMN makes it possible to obtain models with a range of semantic errors. The ability to statically check the semantic correctness of models is thus a desirable feature for modelling tools based on BPMN. However, the static analysis of BPMN models is hindered by ambiguities in the standard specification and the complexity of the language. The fact that BPMN integrates constructs from graph-oriented process definition languages with features for concurrent execution of multiple instances of a subprocess and exception handling, makes it challenging to provide a formal semantics of BPMN. Even more challenging is to define a semantics that can be used to analyse BPMN models. This paper proposes a formal semantics of BPMN defined in terms of a mapping to Petri nets, for which efficient analysis techniques exist. The proposed mapping has been implemented as a tool that generates code in the Petri Net Markup Language. This formalisation exercise has also led to the identification of a number of deficiencies in the BPMN standard specification.

Question: What is the formal semantics of BPMN?


Formalism-Independent Parser Evaluation with CCG and DepBank. A key question facing the parsing community is how to compare parsers which use different grammar formalisms and produce different output. Evaluating a parser on the same resource used to create it can lead to non-comparable accuracy scores and an over-optimistic view of parser performance. In this paper we evaluate a CCG parser on DepBank, and demonstrate the difficulties in converting the parser output into DepBank grammatical relations. In addition we present a method for measuring the effectiveness of the conversion, which provides an upper bound on parsing accuracy. The CCG parser obtains an F-score of 81.9% on labelled dependencies, against an upper bound of 84.8%. We compare the CCG parser against the RASP parser, outperforming RASPby over 5% overall and on the majority of dependency types.

Question: How to compare parsers which use different grammar formalisms and produce different output?


Unsupervised Segmentation of 3D Medical Images Based on Clustering and Deep Representation Learning. This paper presents a novel unsupervised segmentation method for 3D medical images. Convolutional neural networks (CNNs) have brought significant advances in image segmentation. However, most of the recent methods rely on supervised learning, which requires large amounts of manually annotated data. Thus, it is challenging for these methods to cope with the growing amount of medical images. This paper proposes a unified approach to unsupervised deep representation learning and clustering for segmentation. Our proposed method consists of two phases. In the first phase, we learn deep feature representations of training patches from a target image using joint unsupervised learning (JULE) that alternately clusters representations generated by a CNN and updates the CNN parameters using cluster labels as supervisory signals. We extend JULE to 3D medical images by utilizing 3D convolutions throughout the CNN architecture. In the second phase, we apply k-means to the deep representations from the trained CNN and then project cluster labels to the target image in order to obtain the fully segmented image. We evaluated our methods on three images of lung cancer specimens scanned with micro-computed tomography (micro-CT). The automatic segmentation of pathological regions in micro-CT could further contribute to the pathological examination process. Hence, we aim to automatically divide each image into the regions of invasive carcinoma, noninvasive carcinoma, and normal tissue. Our experiments show the potential abilities of unsupervised deep representation learning for medical image segmentation.

Question: How to segment lung cancer?


Back EMF Sensorless-Control Algorithm for High-Dynamic Performance PMSM. In this paper, a low-time-consuming and low-cost sensorless-control algorithm for high-dynamic performance permanent-magnet synchronous motors, both surface and internal permanent-magnet mounted for position and speed estimation, is introduced, discussed, and experimentally validated. This control algorithm is based on the estimation of rotor speed and angular position starting from the back electromotive force space-vector determination without voltage sensors by using the reference voltages given by the current controllers instead of the actual ones. This choice obviously introduces some errors that must be vanished by means of a compensating function. The novelties of the proposed estimation algorithm are the position-estimation equation and the process of compensation of the inverter phase lag that also suggests the final mathematical form of the estimation. The mathematical structure of the estimation guarantees a high degree of robustness against parameter variation as shown by the sensitivity analysis reported in this paper. Experimental verifications of the proposed sensorless-control system have been made with the aid of a flexible test bench for brushless motor electrical drives. The test results presented in this paper show the validity of the proposed low-cost sensorless-control algorithm and, above all, underline the high dynamic performances of the sensorless-control system also with a reduced equipment.

Question: What is the difference between a brushless motor and a permanent-magnet synchronous motor?


CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice.. The sensitivity of the commonly used progressive multiple sequence alignment method has been greatly improved for the alignment of divergent protein sequences. Firstly, individual weights are assigned to each sequence in a partial alignment in order to down-weight near-duplicate sequences and up-weight the most divergent ones. Secondly, amino acid substitution matrices are varied at different alignment stages according to the divergence of the sequences to be aligned. Thirdly, residue-specific gap penalties and locally reduced gap penalties in hydrophilic regions encourage new gaps in potential loop regions rather than regular secondary structure. Fourthly, positions in early alignments where gaps have been opened receive locally reduced gap penalties to encourage the opening up of new gaps at these positions. These modifications are incorporated into a new program, CLUSTAL W which is freely available.

Question: What is the sensitivity of the commonly used progressive multiple sequence alignment method?


IEEE 802.22: The first cognitive radio wireless regional area network standard. This article presents a high-level overview of the IEEE 802.22 standard for cognitive wireless regional area networks (WRANs) that is under development in the IEEE 802 LAN/MAN Standards Committee.

Question: What is the first cognitive radio wireless regional area network standard?


Computer-aided generation of multiple-choice tests. Summary form only given. The paper describes a novel automatic procedure for the generation of multiple-choice tests from electronic documents. In addition to employing various NLP techniques including term extraction and shallow parsing, the system makes use of language resources such as corpora and ontologies. The system operates in a fully automatic mode and also a semiautomatic environment where the user is offered the option to post-edit the generated test items. The results from the conducted evaluation suggest that the new procedure is very effective saving time and labour considerably and that the test items produced with the help of the program are not of inferior quality to those produced manually.

Question: What is a multiple-choice test?


Active sampling for entity matching. In entity matching, a fundamental issue while training a classifier to label pairs of entities as either duplicates or non-duplicates is the one of selecting informative training examples. Although active learning presents an attractive solution to this problem, previous approaches minimize the misclassification rate (0-1 loss) of the classifier, which is an unsuitable metric for entity matching due to class imbalance (i.e., many more non-duplicate pairs than duplicate pairs). To address this, a recent paper [1] proposes to maximize recall of the classifier under the constraint that its precision should be greater than a specified threshold. However, the proposed technique requires the labels of all n input pairs in the worst-case.  Our main result is an active learning algorithm that approximately maximizes recall of the classifier while respecting a precision constraint with provably sub-linear label complexity (under certain distributional assumptions). Our algorithm uses as a black-box any active learning module that minimizes 0-1 loss. We show that label complexity of our algorithm is at most log n times the label complexity of the black-box, and also bound the difference in the recall of classifier learnt by our algorithm and the recall of the optimal classifier satisfying the precision constraint. We provide an empirical evaluation of our algorithm on several real-world matching data sets that demonstrates the effectiveness of our approach.

Question: What is the label complexity of active learning?


Domain Adaptation for Relation Extraction with Domain Adversarial Neural Network. Relations are expressed in many domains such as newswire, weblogs and phone conversations. Trained on a source domain, a relation extractor's performance degrades when applied to target domains other than the source. A common yet labor-intensive method for domain adaptation is to construct a target-domainspecific labeled dataset for adapting the extractor. In response, we present an unsupervised domain adaptation method which only requires labels from the source domain. Our method is a joint model consisting of a CNN-based relation classifier and a domain-adversarial classifier. The two components are optimized jointly to learn a domain-independent representation for prediction on the target domain. Our model outperforms the state-of-the-art on all three test domains of ACE 2005.

Question: What is the state-of-the-art on relation extraction?


SDN-Based Data Center Networking With Collaboration of Multipath TCP and Segment Routing. Large-scale data centers are major infrastructures in the big data era. Therefore, a stable and optimized architecture is required for data center networks (DCNs) to provide services to the applications. Many studies use software-defined network (SDN)-based multipath TCP (MPTCP) implementation to utilize the entire DCN's performance and achieve good results. However, the deployment cost is high. In SDN-based MPTCP solutions, the flow allocation mechanism leads to a large number of forwarding rules, which may lead to storage consumption. Considering the advantages and limitations of the SDN-based MPTCP solution, we aim to reduce the deployment cost due to the use of an extremely expensive storage resource—ternary content addressable memory (TCAM). We combine MPTCP and segment routing (SR) for traffic management to limit the storage requirements. And to the best of our knowledge, we are among the first to use the collaboration of MPTCP and SR in multi-rooted DCN topologies. To explain how MPTCP and SR work together, we use four-layer DCN architecture for better description, which contains physical topology, SR over the topology, multiple path selection supplied by MPTCP, and traffic scheduling on the selected paths. Finally, we implement the proposed design in a simulated SDN-based DCN environment. The simulation results reveal the great benefits of such a collaborative approach.

Question: What is the difference between SDN and SDN-based MPTCP?


Artificial Neural Network Method for Solution of Boundary Value Problems With Exact Satisfaction of Arbitrary Boundary Conditions. A method for solving boundary value problems (BVPs) is introduced using artificial neural networks (ANNs) for irregular domain boundaries with mixed Dirichlet/Neumann boundary conditions (BCs). The approximate ANN solution automatically satisfies BCs at all stages of training, including before training commences. This method is simpler than other ANN methods for solving BVPs due to its unconstrained nature and because automatic satisfaction of Dirichlet BCs provides a good starting approximate solution for significant portions of the domain. Automatic satisfaction of BCs is accomplished by the introduction of an innovative length factor. Several examples of BVP solution are presented for both linear and nonlinear differential equations in two and three dimensions. Error norms in the approximate solution on the order of 10-4 to 10-5 are reported for all example problems.

Question: How to solve a boundary value problem with exact satisfaction of arbitrary boundary conditions?


Microrobot Design Using Fiber Reinforced Composites. Mobile microrobots with characteristic dimensions on the order of 1cm are difficult to design using either MEMS (microelectromechanical systems) technology or precision machining. This is due to the challenges associated with constructing the high strength links and high-speed, low-loss joints with micron scale features required for such systems. Here we present an entirely new framework for creating microrobots which makes novel use of composite materials. This framework includes a new fabrication process termed Smart Composite Microstructures (SCM) for integrating rigid links and large angle flexure joints through a laser micromachining and lamination process. We also present solutions to actuation and integrated wiring issues at this scale using SCM. Along with simple design rules that are customized for this process, our new complete microrobotic framework is a cheaper, quicker, and altogether superior method for creating microrobots that we hope will become the paradigm for robots at this scale.

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


Anomaly Detection in Text: The Value of Domain Knowledge. We consider the problem of detecting anomalies from text data. Our hypothesis is that as with classical anomaly detection algorithms, domain-specific features are more important than the linguistic features. We employ the use of first-order logic and demonstrate the effectiveness of useful domain knowledge in two domains. Our results show that the domain-specific features are more predictive and that the relational learning methods exhibit superior performance.

Question: What is the value of domain knowledge in anomaly detection?


Coping through emotional approach: scale construction and validation.. Four studies demonstrate the psychometric adequacy and validity of scales designed to assess coping through emotional approach. In separate undergraduate samples, exploratory and confirmatory factor analyses of dispositional (Study 1) and situational (Study 3) coping item sets yielded 2 distinct emotional approach coping factors: emotional processing (i.e., active attempts to acknowledge and understand emotions) and emotional expression. The 2 scales yielded high internal consistency and test-retest reliability, as well as convergent and discriminant validity. A study (Study 2) of young adults and their parents established the scales' interjudge reliabilities. Longitudinal (Study 3) and experimental (Study 4) research supported the predictive validity of the emotional approach coping scales with regard to adjustment to stressful encounters. Findings highlight the utility of functionalist theories of emotion as applied to coping theory.

Question: What is the difference between emotional processing and emotional expression?


Learning Profiles in Duplicate Question Detection. This paper presents the results of systematic and comparative experimentation with major types of methodologies for automatic duplicate question detection when these are applied to datasets of progressively larger sizes, thus allowing to study the learning profiles of this task under these different approaches and evaluate their merits. This study was made possible by resorting to the recent release for research purposes, by the Quora online question answering engine, of a new dataset with over 400,000 pairs labeled with respect to their elements being duplicate interrogative segments.

Question: What is the learning profile of duplicate question detection?


Weakly Supervised Facial Analysis with Dense Hyper-Column Features. Weakly supervised methods have recently become one of the most popular machine learning methods since they are able to be used on large-scale datasets without the critical requirement of richly annotated data. In this paper, we present a novel, self-taught, discriminative facial feature analysis approach in the weakly supervised framework. Our method can find regions which are discriminative across classes yet consistent within a class and can solve many face related problems. The proposed method first trains a deep face model with high discriminative capability to extract facial features. The hypercolumn features are then used to give pixel level representation for better classification performance along with discriminative region detection. In addition, calibration approaches are proposed to enable the system to deal with multi-class and mixed-class problems. The system is also able to detect multiple discriminative regions from one image. Our uniform method is able to achieve competitive results in various face analysis applications, such as occlusion detection, face recognition, gender classification, twins verification and facial attractiveness analysis.

Question: What is the weakly supervised facial feature analysis?


Meta-Analytic Review of Leader-Member Exchange Theory : Correlates and Construct Issues. s International, 48, 2922. Dienesch, R. M., & Liden, R. C. (1986). Leader-member exchange model of leadership: A critique and further development. Academy of Management Review, 11, 618—634. *Dobbins, G. H., Cardy, R. L., & Platz-Vieno, S. J. (1990). A contingency approach to appraisal satisfaction: An initial investigation of the joint effects of organizational variables and appraisal characteristics. Journal of Management, 16, 619-632. *Dockery, T. M., & Steiner, D. D. (1990). The role of the initial interaction in leader-member exchange. Group and Organization Studies, 15, 395-413. *Duarte, N. T, Goodson, J. R., & Klich, N. R. (1994). Effects of dyadic quality and duration on performance appraisal. Academy of Management Journal, 37, 499-521. *Duchon, D., Green, S. G., &Taber, T. D. (1986). Vertical dyad linkage: A longitudinal assessment of antecedents, measures, and consequences. Journal of Applied Psychology, 71, 5660. *Dunegan, K. J., Duchon, D., & Uhl-Bien, M. (1992). Examining the link between leader-member exchange and subordinate performance: The role of task analyzability and variety as moderators. Journal of Management, 18, 59—76. *Dunegan, K. J., Uhl-Bien, M., & Duchon, D. (1994, August). Task-level climate (TLC) and leader-member exchange (LMX) as interactive predictors of subordinate performance. Paper presented at the 54th Academy of Management meeting, Dallas, TX. Fahr, J.-L., & Dobbins, G. H. (1989). Effects of comparative performance information on the accuracy of self-ratings and agreement between selfand supervisor ratings. Journal of Applied Psychology, 74, 606-610. Feldman, J. M. (1986). A note on the statistical correction of halo error. Journal of Applied Psychology, 71, 173-176. * Ferris, G. R. (1985). Role of leadership in the employee withdrawal process: A constructive replication. Journal of Applied Psychology, 70, 777-781. *Rikami, C. V, & Larson, E.

Question: What is the difference between a leader and a manager?


Common mode EMI noise suppression in bridgeless boost PFC converter. Bridgeless boost PFC converter has high efficiency by eliminating the input diode bridge. However, Common Mode (CM) conducted EMI becomes a great issue. The goal of this paper is to study the possibility to minimize the CM noise in this converter. First the noise model is studied. Then a balance concept is introduced and applied to cancel the CM noise. Two approaches to minimize CM noise are introduced and compared. Experiments verify the effectiveness of both approaches.

Question: How to suppress common mode noise in bridgeless boost PFC converter?


A universal algorithm for sequential data compression. A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.

Question: What is a universal algorithm for sequential data compression?


A randomized, efficient, and distributed protocol for the detection of node replication attacks in wireless sensor networks. Wireless sensor networks are often deployed in hostile environments, where anadversary can physically capture some of the nodes. Once a node is captured, the attackercan re-program it and replicate the node in a large number of clones, thus easily taking over the network. The detection of node replication attacks in a wireless sensor network is therefore a fundamental problem. A few distributed solutions have recently been proposed. However, these solutions are not satisfactory. First, they are energy and memory demanding: A serious drawback for any protocol that is to be used in resource constrained environment such as a sensor network. Further, they are vulnerable to specific adversary models introduced in this paper.  The contributions of this work are threefold. First, we analyze the desirable properties of a distributed mechanism for the detection of node replication attacks. Second, we show that the known solutions for this problem do not completely meet our requirements. Third, we propose a new Randomized, Efficient, and Distributed (RED) protocol for the detection of node replication attacks and we show that it is completely satisfactory with respect to the requirements. Extensive simulations also show that our protocol is highly efficient in communication, memory, and computation, that it sets out an improved attack detection probability compared to the best solutions in the literature, and that it is resistant to the new kind of attacks we introduce in this paper, while other solutions are not.

Question: What is the difference between a distributed protocol and a centralized protocol?


Handbook of Fingerprint Recognition. label(s) Label Class c) b) a) 7.3 Integration Strategies 241 Combination strategy A combination strategy (also called combination scheme) is a technique used to combine the output of the individual classifiers. The most popular combination strategies at the abstract level are based on majority vote rules, which simply assign an input pattern to the most voted class (see Section 7.2). When two classifiers are combined, either a logical AND or a logical OR operator is typically used. When more than two classifiers are integrated, the AND/OR rules can be combined. For example, a biometric system may work on "fingerprint OR (face AND hand geometry)"; that is, it requires a user to present either a fingerprint or both face and hand geometry for recognition. Class set reduction, logistic regression, and Borda counts are the most commonly used approaches in combining classifiers based on the rank labels (Ho, Hull, and Srihari, 1994). In class set reduction, a subset of the classes is selected with the aim that the subset be as small as possible and still contain the true class. Multiple subsets from multiple modalities are typically combined using either a union or an intersection of the subsets. The logistic regression and Borda count methods are collectively called the class set reordering methods. The objective here is to derive a consensus ranking of the given classes such that the true class is ranked at the top. Rank labels are very useful for integration in an indexing/retrieval system. A biometric retrieval system typically outputs an ordered list of candidates (most likely matches). The top element of this ordered list is the most likely to be a correct match and the bottom of the list is the least likely match. The most popular combination schemes for combining confidence values from multiple modalities are sum, mean, median, product, minimum, and maximum rules. Kittler et al. (1998) have developed a theoretical framework in a

Question: What is the difference between a combination strategy and a fusion strategy?


Modeling Documents with Deep Boltzmann Machines. We introduce a type of Deep Boltzmann Machine (DBM) that is suitable for extracting distributed semantic representations from a large unstructured collection of documents. We overcome the apparent difficulty of training a DBM with judicious parameter tying. This enables an efficient pretraining algorithm and a state initialization scheme for fast inference. The model can be trained just as efficiently as a standard Restricted Boltzmann Machine. Our experiments show that the model assigns better log probability to unseen data than the Replicated Softmax model. Features extracted from our model outperform LDA, Replicated Softmax, and DocNADE models on document retrieval and document classification tasks.

Question: What is a deep boltzmann machine?


A review of empirical research on manufacturing flexibility. Manufacturing flexibility is widely recognized as a critical component to achieving a competitive advantage in the marketplace. A comprehensive look at the empirical research pertaining to manufacturing flexibility highlights the very fragmented nature of this body of work. We present a comprehensive contingency-based framework for examining the content related issues involving the relationships and variables included in past studies. We also examine several important Ž . research designrmethodology issues e.g., sampling, data collection and measurement and propose solutions to some identified problems. q 2000 Elsevier Science B.V. All rights reserved.

Question: What is a review of empirical research on manufacturing flexibility?


Take a Look Around: Using Street View and Satellite Images to Estimate House Prices. When an individual purchases a home, they simultaneously purchase its structural features, its accessibility to work, and the neighborhood amenities. Some amenities, such as air quality, are measurable whilst others, such as the prestige or the visual impression of a neighborhood, are difficult to quantify. Despite the well-known impacts intangible housing features have on house prices, limited attention has been given to systematically quantifying these difficult to measure amenities. Two issues have lead to this neglect. Not only do few quantitative methods exist that can measure the urban environment, but that the collection of such data is both costly and subjective. We show that street image and satellite image data can capture these urban qualities and improve the estimation of house prices. We propose a pipeline that uses a deep neural network model to automatically extract visual features from images to estimate house prices in London, UK. We make use of traditional housing features such as age, size and accessibility as well as visual features from Google Street View images and Bing aerial images in estimating the house price model. We find encouraging results where learning to characterize the urban quality of a neighborhood improves house price prediction, even when generalizing to previously unseen London boroughs. We explore the use of non-linear vs. linear methods to fuse these cues with conventional models of house pricing, and show how the interpretability of linear models allows us to directly extract the visual desirability of neighborhoods as proxy variables that are both of interest in their own right, and could be used as inputs to other econometric methods. This is particularly valuable as once the network has been trained with the training data, it can be applied elsewhere, allowing us to generate vivid dense maps of the desirability of London streets.

Question: How can we use street view images to estimate house prices?


Majority is not enough: bitcoin mining is vulnerable. The Bitcoin cryptocurrency records its transactions in a public log called the blockchain. Its security rests critically on the distributed protocol that maintains the blockchain, run by participants called miners. Conventional wisdom asserts that the mining protocol is incentive-compatible and secure against colluding minority groups, that is, it incentivizes miners to follow the protocol as prescribed.  We show that the Bitcoin mining protocol is not incentive-compatible. We present an attack with which colluding miners' revenue is larger than their fair share. The attack can have significant consequences for Bitcoin: Rational miners will prefer to join the attackers, and the colluding group will increase in size until it becomes a majority. At this point, the Bitcoin system ceases to be a decentralized currency.  Unless certain assumptions are made, selfish mining may be feasible for any coalition size of colluding miners. We propose a practical modification to the Bitcoin protocol that protects Bitcoin in the general case. It prohibits selfish mining by a coalition that command less than 1/4 of the resources. This threshold is lower than the wrongly assumed 1/2 bound, but better than the current reality where a coalition of any size can compromise the system.

Question: What is the bitcoin mining protocol?


Datasets for Aspect-Based Sentiment Analysis in French. Aspect Based Sentiment Analysis (ABSA) is the task of mining and summarizing opinions from text about specific entities and their aspects. This article describes two datasets for the development and testing of ABSA systems for French which comprise user reviews annotated with relevant entities, aspects and polarity values. The first dataset contains 457 restaurant reviews (2365 sentences) for training and testing ABSA systems, while the second contains 162 museum reviews (655 sentences) dedicated to out-of-domain evaluation. Both datasets were built as part of SemEval-2016 Task 5 "Aspect-Based Sentiment Analysis" where seven different languages were represented, and are publicly available for research purposes. This article provides examples and statistics by annotation type, summarizes the annotation guidelines and discusses their cross-lingual applicability. It also explains how the data was used for evaluation in the SemEval ABSA task and briefly presents the results obtained for French.

Question: What is the size of the french dataset?


Finding Alternative Translations in a Large Corpus of Movie Subtitle. OpenSubtitles.org provides a large collection of user contributed subtitles in various languages for movies and TV programs. Subtitle translations are valuable resources for cross-lingual studies and machine translation research. A less explored feature of the collection is the inclusion of alternative translations, which can be very useful for training paraphrase systems or collecting multi-reference test suites for machine translation. However, differences in translation may also be due to misspellings, incomplete or corrupt data files, or wrongly aligned subtitles. This paper reports our efforts in recognising and classifying alternative subtitle translations with language independent techniques. We use time-based alignment with lexical re-synchronisation techniques and BLEU score filters and sort alternative translations into categories using edit distance metrics and heuristic rules. Our approach produces large numbers of sentence-aligned translation alternatives for over 50 languages provided via the OPUS corpus collection.

Question: How to find alternative translations in a large corpus of movie subtitles?


Benign Osteoblastoma Involving Maxilla: A Case Report and Review of the Literature. Background. Osteoblastoma is a rare benign tumor. This tumor is characterized by osteoid and bone formation with the presence of numerous osteoblasts. The lesion is more frequently seen in long bones and rarely involves maxilla and mandible. Due to its clinical and histological similarity with other bone tumors such as osteoid osteoma and fibro-osseous lesions, osteoblastoma presents a diagnostic dilemma. Case Report. Very few cases of osteoblastomas involving maxillofacial region have been reported in the literature. This case report involves osteoblastoma involving right maxilla in an 18-year-old male patient. Following detailed clinical examination, radiological interpretation, and histopathological diagnosis, surgical excision was performed. The patient was followed up for a period of 3 years and was disease free. Summary and Conclusion. Benign osteoblastoma involving jaw bones is a rare tumor. There is a close resemblance of this tumor with other lesions such as fibro-osseous lesions and odontogenic tumors and thus faces a diagnostic challenge. Surgical excision with a long-term follow-up gives good prognosis to this lesion-Benign Osteoblastoma.

Question: What is benign osteoblastoma?


Temperature-aware microarchitecture: Modeling and implementation. With cooling costs rising exponentially, designing cooling solutions for worst-case power dissipation is prohibitively expensive. Chips that can autonomously modify their execution and power-dissipation characteristics permit the use of lower-cost cooling solutions while still guaranteeing safe temperature regulation. Evaluating techniques for this dynamic thermal management (DTM), however, requires a thermal model that is practical for architectural studies.This paper describes HotSpot, an accurate yet fast and practical model based on an equivalent circuit of thermal resistances and capacitances that correspond to microarchitecture blocks and essential aspects of the thermal package. Validation was performed using finite-element simulation. The paper also introduces several effective methods for DTM: "temperature-tracking" frequency scaling, "migrating computation" to spare hardware units, and a "hybrid" policy that combines fetch gating with dynamic voltage scaling. The latter two achieve their performance advantage by exploiting instruction-level parallelism, showing the importance of microarchitecture research in helping control the growth of cooling costs.Modeling temperature at the microarchitecture level also shows that power metrics are poor predictors of temperature, that sensor imprecision has a substantial impact on the performance of DTM, and that the inclusion of lateral resistances for thermal diffusion is important for accuracy.

Question: What is the temperature of a microarchitecture?


Coupling Distributed and Symbolic Execution for Natural Language Queries. Building neural networks to query a knowledge base (a table) with natural language is an emerging research topic in deep learning. An executor for table querying typically requires multiple steps of execution because queries may have complicated structures. In previous studies, researchers have developed either fully distributed executors or symbolic executors for table querying. A distributed executor can be trained in an end-to-end fashion, but is weak in terms of execution efficiency and explicit interpretability. A symbolic executor is efficient in execution, but is very difficult to train especially at initial stages. In this paper, we propose to couple distributed and symbolic execution for natural language queries, where the symbolic executor is pretrained with the distributed executor's intermediate execution results in a step-by-step fashion. Experiments show that our approach significantly outperforms both distributed and symbolic executors, exhibiting high accuracy, high learning efficiency, high execution efficiency, and high interpretability.

Question: What is the difference between a distributed and a symbolic executor?


Precision and Recall for Regression. Cost sensitive prediction is a key task in many real world applications. Most existing research in this area deals with classification problems. This paper addresses a related regression problem: the prediction of rare extreme values of a continuous variable. These values are often regarded as outliers and removed from posterior analysis. However, for many applications (e.g. in finance, meteorology, biology, etc.) these are the key values that we want to accurately predict. Any learning method obtains models by optimizing some preference criteria. In this paper we propose new evaluation criteria that are more adequate for these applications. We describe a generalization for regression of the concepts of precision and recall often used in classification. Using these new evaluation metrics we are able to focus the evaluation of predictive models on the cases that really matter for these applications. Our experiments indicate the advantages of the use of these new measures when comparing predictive models in the context of our target applications.

Question: What is the difference between precision and recall?


A Hybrid Model to Detect Malicious Executables. We present a hybrid data mining approach to detect malicious executables. In this approach we identify important features of the malicious and benign executables. These features are used by a classifier to learn a classification model that can distinguish between malicious and benign executables. We construct a novel combination of three different kinds of features: binary n-grams, assembly n-grams, and library function calls. Binary features are extracted from the binary executables, whereas assembly features are extracted from the disassembled executables. The function call features are extracted from the program headers. We also propose an efficient and scalable feature extraction technique. We apply our model on a large corpus of real benign and malicious executables. We extract the above mentioned features from the data and train a classifier using support vector machine. This classifier achieves a very high accuracy and low false positive rate in detecting malicious executables. Our model is compared with other feature-based approaches, and found to be more efficient in terms of detection accuracy and false alarm rate.

Question: What is a hybrid model?


Travel time estimation and order batching in a 2-block warehouse. The order batching problem (OBP) is the problem of determining the number of orders to be picked together in one picking tour. Although various objectives may arise in practice, minimizing the average throughput time of a random order is a common concern. In this paper, we consider the OBP for a 2-block rectangular warehouse with the assumptions that orders arrive according to a Poisson process and the method used for routing the orderpickers is the well-known S-shape heuristic. We first elaborate on the first and second moment of the order-picker's travel time. Then we use these moments to estimate the average throughput time of a random order. This enables us to estimate the optimal picking batch size. Results from simulation show that the method provides a high accuracy level. Furthermore, the method is rather simple and can be easily applied in practice.

Question: How to estimate the average throughput time of a random order?


A radio resource management framework for TVWS exploitation under an auction-based approach. This paper elaborates on the design, implementation and performance evaluation of a prototype Radio Resource Management (RRM) framework for TV white spaces (TVWS) exploitation, under an auction-based approach. The proposed RRM framework is applied in a centralised Cognitive Radio (CR) network architecture, where exploitation of the available TVWS by Secondary Systems is orchestrated via a Spectrum Broker. Efficient RRM framework performance, as a matter of maximum-possible resources utilization and benefit of Spectrum Broker, is achieved by proposing and evaluating an auction-based algorithm. This auction-based algorithm considers both frequency and time domain during TVWS allocation process which was defined as an optimization problem, where maximum payoff of Spectrum Broker is the optimization goal. Experimental tests that were carried-out under controlled conditions environment, verified the validity of the proposed framework, besides identifying fields for further research.

Question: What is a radio resource management framework for TVWS exploitation under an auction-based approach?


WebRTC technology overview and signaling solution design and implementation. This paper describes the WebRTC technology and implementation of WebRTC client, server and signaling. Main parts of the WebRTC API are described and explained. Signaling methods and protocols are not specified by the WebRTC standards, therefore in this study we design and implement a novel signaling mechanism. The corresponding message sequence chart of the WebRTC communication behavior describes a communication flow between peers and the server. The server application is implemented as a WebSocket server. The client application demonstrates the use of the WebRTC API for achieving real-time communication. Benefits and future development of the WebRTC technology are mentioned.

Question: What is the WebRTC technology?


Multi-Task Learning for Mental Health using Social Media Text. We introduce initial groundwork for estimating suicide risk and mental health in a deep learning framework. By modeling multiple conditions, the system learns to make predictions about suicide risk and mental health at a low false positive rate. Conditions are modeled as tasks in a multitask learning (MTL) framework, with gender prediction as an additional auxiliary task. We demonstrate the effectiveness of multi-task learning by comparison to a well-tuned single-task baseline with the same number of parameters. Our best MTL model predicts potential suicide attempt, as well as the presence of atypical mental health, with AUC > 0.8. We also find additional large improvements using multi-task learning on mental health tasks with limited training data.

Question: How to estimate suicide risk and mental health?


A New Similarity Measure to Understand Visitor Behavior in a Web Site. The behavior of visitors browsing in a web site offers a lot of information about their requirements and the way they use the respective site. Analyzing such behavior can provide the necessary information in order to improve the web site's structure. The literature contains already several suggestions on how to characterize web site usage and to identify the respective visitor requirements based on clustering of visitor sessions. Here we propose to combine visitor behavior with the content of the respective web pages and the similarity between different page sequences in order to define a similarity measure between different visits. This similarity serves as input for clustering of visitor sessions. The application of our approach to a bank's web site and its visitor sessions shows its potential for internet-based businesses. key words: web mining, browsing behavior, similarity measure, clustering.

Question: What is the potential of web mining?


A Semantic Web Services Architecture. Formed in February 2003, the Semantic Web Services Initiative Architecture (SWSA) committee's mission is to develop the necessary abstractions for an architecture that supports Semantic Web services. The resultant framework builds on the W3C Web Services Architecture working group report (and is motivated in part by Tim Berners-Lee's vision for the Semantic Web1). Other groups developing Semantic Web services frameworks contributed to the discussions, including the Web Ontology Language for Services (OWL-S) consortium, the Web Service Modeling Ontology (WSMO; www.wsmo. org) group at the Digital Enterprise Research Institute (DERI), and the Managing End-to-End Operations-Semantics (METEOR-S; http://lsdis.cs.uga.edu/projects/meteor-s/) group at the University of Georgia.2,3 In this article, we describe the protocols exchanged between the interacting entities or agents that interpret and reason with semantic descriptions in the deployment of Semantic Web services. We focus specifically on those capabilities that extend the potential range of Web services; we also discuss security, reliability, and a flexible means of recovery from the problems that can occur in open and evolving environments. The SWSA architectural framework attempts to address five classes of Semantic Web agent requirements — dynamic service discovery, service engagement, service process enactment and management, community support services, and quality of service (QoS) — which we cover in detail here as well.

Question: What is the semantic web?


A Low-Power Text-Dependent Speaker Verification System with Narrow-Band Feature Pre-Selection and Weighted Dynamic Time Warping. To fully enable voice interaction in wearable devices, a system requires low-power, customizable voice-authenticated wake-up. Existing speaker-verification (SV) methods have shortcomings relating to power consumption and noise susceptibility. To meet the application requirements, we propose a low-power, text-dependent SV system comprising a sparse spectral feature extraction front-end showing improved noise robustness and accuracy at low power, and a back-end running an improved dynamic time warping (DTW) algorithm that preserves signal envelope while reducing misalignments. Without background noise, the proposed system achieves an equal-errorrate (EER) of 1.1%, compared to 1.4% with a conventional Mel-frequency cepstral coefficients (MFCC)+DTW system and 2.6% with a Gaussian mixture universal background (GMMUBM) based system. At 3dB signal-to-noise ratio (SNR), the proposed system achieves an EER of 5.7%, compared to 13% with a conventional MFCC+DTW system and 6.8% with a GMM-UBM based system. The proposed system enables simple, low-power implementation such that the power consumption of the end-to-end system, which includes a voice activity detector, feature extraction front-end, and back-end decision unit, is under 380 μW.

Question: How to implement a low-power speaker verification system?


In-vehicle information system as a driver's secondary activity: Case study. A robust methodology for detecting and evaluating driver distraction induced by in-vehicle information system using artificial neural network and fuzzy logic is introduced in this paper. An artificial neural network is used to predict driver's performance on a specific road segment. The predicted performance-based measures are compared to the driving with secondary task accomplishment. Fuzzy logic is applied to fuse the variables into a single output, which constitutes a level of driver distraction in percentage. The technique was tested on a vehicle simulator by ten drivers that exploited in-vehicle information system as a secondary activity. The driver-in-the-loop experiment outcomes are discussed.

Question: How to detect driver distraction?


Concept Mining via Embedding. In this work, we study the problem of concept mining, which serves as the first step in transforming unstructured text into structured information, and supports downstream analytical tasks such as information extraction, organization, recommendation and search. Previous work mainly relies on statistical signals, existing knowledge bases, or predefined linguistic patterns. In this work, we propose a novel approach that mines concepts based on their occurrence contexts, by learning embedding vector representations that summarize the context information for each possible candidates, and use these embeddings to evaluate the concept's global quality and their fitness to each local context. Experiments over several real-world corpora demonstrate the superior performance of our method. A publicly available implementation is provided at https://github.com/kleeeeea/ECON.

Question: What is the difference between concept mining and information extraction?