Product platform design and customization: Status and promise. In an effort to improve customization for today's highly competitive global marketplace, many companies are utilizing product families and platform-based product development to increase variety, shorten lead times, and reduce costs. The key to a successful product family is the product platform from which it is derived either by adding, removing, or substituting one or more modules to the platform or by scaling the platform in one or more dimensions to target specific market niches. This nascent field of engineering design has matured rapidly in the past decade, and this paper provides a comprehensive review of the flurry of research activity that has occurred during that time to facilitate product family design and platform-based product development for mass customization. Techniques for identifying platform leveraging strategies within a product family are reviewed along with metrics for assessing the effectiveness of product platforms and product families. Special emphasis is placed on optimization approaches and artificial intelligence techniques to assist in the process of product family design and platform-based product development. Web-based systems for product platform customization are also discussed. Examples from both industry and academia are presented throughout the paper to highlight the benefits of product families and product platforms. The paper concludes with a discussion of potential areas of research to help bridge the gap between planning and managing families of products and designing and manufacturing them.

Question: What is a product platform?


Exploiting the web of data in model-based recommender systems. The availability of a huge amount of interconnected data in the so called Web of Data (WoD) paves the way to a new generation of applications able to exploit the information encoded in it. In this paper we present a model-based recommender system leveraging the datasets publicly available in the Linked Open Data (LOD) cloud as DBpedia and LinkedMDB. The proposed approach adapts support vector machine (SVM) to deal with RDF triples. We tested our system and showed its effectiveness by a comparison with different recommender systems techniques -- both content-based and collaborative filtering ones.

Question: What is a recommender system?


Transductive Event Classification through Heterogeneous Networks. Events can be defined as "something that occurs at specific place and time associated with some specific actions". In general, events extracted from news articles and social networks are used to map the information from web to the various phenomena that occur in our physical world. One of the main steps to perform this relationship is the use of machine learning algorithms for event classification, which has received great attention in the web document engineering field in recent years. Traditional machine learning algorithms are based on vector space model representations and supervised classification. However, events are composed of multiple representations such as textual data, temporal information, geographic location and other types of metadata. All these representations are poorly represented together in a vector space model. Moreover, supervised classification requires the labeling of a significant sample of events to construct a training set for learning process, thereby hampering the practical application of event classification. In this paper, we propose a method called TECHN (Transductive Event Classification through Heterogeneous Networks), which considers event metadata as different objects in an heterogeneous network. Besides, the TECHN method has the ability to automatically learn which types of network objects (event metadata) are most efficient in the classification task. In addition, our TECHN method is based on a transductive classification that considers both labeled events and a vast amount of unlabeled events. The experimental results show that TECHN method obtains promising results, especially when we consider different weights of importance for each type of event metadata and a small set of labeled events.

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


Ideal Ratio Mask Estimation Using Deep Neural Networks for Monaural Speech Segregation in Noisy Reverberant Conditions. Monaural speech segregation is an important problem in robust speech processing and has been formulated as a supervised learning problem. In supervised learning methods, the ideal binary mask (IBM) is usually used as the target because of its simplicity and large speech intelligibility gains. Recently, the ideal ratio mask (IRM) has been found to improve the speech quality over the IBM. However, the IRM was originally defined in anechoic conditions and did not consider the effect of reverberation. In this paper, the IRM is extended to reverberant conditions where the direct sound and early reflections of target speech are regarded as the desired signal. Deep neural networks (DNNs) is employed to estimate the extended IRM in the noisy reverberant conditions. The estimated IRM is then applied to the noisy reverberant mixture for speech segregation. Experimental results show that the estimated IRM provides substantial improvements in speech intelligibility and speech quality over the unprocessed mixture signals under various noisy and reverberant conditions.

Question: How to estimate the ideal ratio mask in noisy reverberant conditions?


構建一個中文國小數學文字問題語料庫(Building a Corpus for Developing the Chinese Elementary School Math Word Problem Solver)[In Chinese].

Question: What is the name of the corpus?


Bandwidth Modeling in Large Distributed Systems for Big Data Applications. The emergence of Big Data applications provides new challenges in data management such as processing and movement of masses of data. Volunteer computing has proven itself as a distributed paradigm that can fully support Big Data generation. This paradigm uses a large number of heterogeneous and unreliable Internet-connected hosts to provide Peta-scale computing power for scientific projects. With the increase in data size and number of devices that can potentially join a volunteer computing project, the host bandwidth can become a main hindrance to the analysis of the data generated by these projects, especially if the analysis is a concurrent approach based on either in-situ or in-transit processing. In this paper, we propose a bandwidth model for volunteer computing projects based on the real trace data taken from the Docking@Home project with more than 280,000 hosts over a 5-year period. We validate the proposed statistical model using model-based and simulation-based techniques. Our modeling provides us with valuable insights on the concurrent integration of data generation with in-situ and in-transit analysis in the volunteer computing paradigm.

Question: What is the bandwidth model for volunteer computing?


APAC: Augmented PAttern Classification with Neural Networks. Deep neural networks have been exhibiting splendid accuracies in many of visual pattern classification problems. Many of the state-of-the-art methods employ a technique known as data augmentation at the training stage. This paper addresses an issue of decision rule for classifiers trained with augmented data. Our method is named as APAC: the Augmented PAttern Classification, which is a way of classification using the optimal decision rule for augmented data learning. Discussion of methods of data augmentation is not our primary focus. We show clear evidences that APAC gives far better generalization performance than the traditional way of class prediction in several experiments. Our convolutional neural network model with APAC achieved a state-of-the-art accuracy on the MNIST dataset among non-ensemble classifiers. Even our multilayer perceptron model beats some of the convolutional models with recentlyinvented stochastic regularization techniques on the CIFAR10 dataset.

Question: What is the difference between data augmentation and data augmentation?


Organizational Learning and Communities of Practice ; A social constructivist perspective. In this paper, the relationship between organizational learning (OL) and communities of practice (COP) is addressed. A social constructivist lens is used to analyzing the potential contributions of COP's in supporting learning by organizations. A social constructivist approach sees organizational learning as an institutionalizing process. The attention is on the process through which individual or local knowledge is transformed into collective knowledge as well as the process through which this socially constructed knowledge influences, and is part of, local knowledge. In order to analyse COP's contribution to OL, we use the three phases or 'moments' described by Berger and Luckman (1966) that can be discerned during institutionalizing knowledge: 'externalizing, objectifying and internalizing'. Externalizing knowledge refers to the process through which personal knowledge is exchanged with others. Objectifying knowledge refers to the process through which knowledge becomes an objective reality. Internalizing knowledge refers to the process through which objectified knowledge is used by individuals in the course of their socialization. In relation to OL processes, learning can be analyzed as consisting of these three knowledge sharing activities: externalizing individual knowledge resulting in shared knowledge; objectifying shared knowledge resulting in organizational knowledge; internalizing organizational knowledge resulting in individual knowledge. These various processes that in combination make up OL processes, are visualized by the use of a OL cycle. The cycle provides a simplified picture of OL seen as a process of institutionalization. The cycle is subsequently used to analyze the possible contribution of COP's to support organizational learning. The paper concludes that COP's are well suited to support processes of internalization and externalization. As a result, COP'

Question: What is the difference between a community of practice and a community of practice?


Software-Defined LANs for Interconnected Smart Environment. In this paper, we propose a solution to delegate the control and the management of the network connecting the many devices of a smart environment to a software entity, while keeping end-users in control of what is happening in their networks. For this, we rely on the logical manipulation of all connected devices through device abstraction and network programmability. Applying Software Defined Networking (SDN) principles, we propose a software-based solution that we call Software-Defined LANs in order to interconnect devices of smart environments according to the services the users are requesting or expecting.We define the adequate virtualization framework based on Virtual Objects and Communities of Virtual Objects. Using these virtual entities, we apply the SDN architectural principles to define a generic architecture that can be applied to any smart environment. Then we describe a prototype implementing these concepts in the home networking context, through a scenario in which users of two different homes can easily interconnect two private but shareable DLNA devices in a dedicated video-delivery SD-LAN. Finally we provide a discussion of the benefits and challenges of our approach regarding the generalization of SDN principles, autonomic features, Internet of Things scalability, security and privacy aspects enabled by SD-LANs intrinsic properties.

Question: What is a smart environment?


Split learning for health: Distributed deep learning without sharing raw patient data. Can health entities collaboratively train deep learning models without sharing sensitive raw data? This paper proposes several configurations of a distributed deep learning method called SplitNN to facilitate such collaborations. SplitNN does not share raw data or model details with collaborating institutions. The proposed configurations of splitNN cater to practical settings of i) entities holding different modalities of patient data, ii) centralized and local health entities collaborating on multiple tasks and iii) learning without sharing labels. We compare performance and resource efficiency trade-offs of splitNN and other distributed deep learning methods like federated learning, large batch synchronous stochastic gradient descent and show highly encouraging results for splitNN.

Question: How does split learning work?


Virtual Robot Experimentation Platform V-REP: A Versatile 3D Robot Simulator. From exploring planets to cleaning homes, the reach and versatility of robotics is vast. The integration of actuation, sensing and control makes robotics systems powerful, but complicates their simulation. This paper introduces a modular and decentralized architecture for robotics simulation. In contrast to centralized approaches, this balances functionality, provides more diversity, and simplifies connectivity between (independent) calculation modules. As the Virtual Robot Experimentation Platform (V-REP) demonstrates, this gives a smallfootprint 3D robot simulator that concurrently simulates control, actuation, sensing and monitoring. Its distributed and modular approach are ideal for complex scenarios in which a diversity of sensors and actuators operate asynchronously with various rates and characteristics. This allows for versatile prototyping applications including systems verification, safety/remote monitoring, rapid algorithm development, and factory automation simulation.

Question: What is a robot simulator?


Soft labeling by Distilling Anatomical knowledge for Improved MS Lesion Segmentation. This paper explores the use of a soft ground-truth mask ("soft mask") to train a Fully Convolutional Neural Network (FCNN) for segmentation of Multiple Sclerosis (MS) lesions. Detection and segmentation of MS lesions is a complex task largely due to the extreme unbalanced data, with very small number of lesion pixels that can be used for training. Utilizing the anatomical knowledge that the lesion surrounding pixels may also include some lesion level information, we suggest to increase the data set of the lesion class with neighboring pixel data with a reduced confidence weight. A soft mask is constructed by morphological dilation of the binary segmentation mask provided by a given expert, where expert-marked voxels receive label 1 and voxels of the dilated region are assigned a soft label. In the methodology proposed, the FCNN is trained using the soft mask. On the ISBI 2015 challenge dataset, this is shown to provide a better precision-recall tradeoff and to achieve a higher average Dice similarity coefficient. We also show that by using this soft mask scheme we can improve the network segmentation performance when compared to a second independent expert.

Question: How to segment MS lesions?


Get Out of my Picture! Internet-based Inpainting. We present a method to replace a user specified target region of a photograph by using other photographs of the same scene downloaded from the Internet via viewpoint invariant image search. Each of the retrieved images is first geometrically then photometrically registered with the query photograph. Geometric registration is achieved using multiple homographies and photometric registration is performed using a global affine transformation on image intensities. Each retrieved image proposes a possible solution for the target region. In the final step we combine these proposals into a single visually consistent result, using a Markov random field optimisation to choose seams between proposals, followed by gradient domain fusion. We demonstrate removal of objects and people in challenging photographs of Oxford landmarks containing complex image structures.

Question: How to remove people from a picture?


Associations among Wine Grape Microbiome, Metabolome, and Fermentation Behavior Suggest Microbial Contribution to Regional Wine Characteristics. UNLABELLED Regionally distinct wine characteristics (terroir) are an important aspect of wine production and consumer appreciation. Microbial activity is an integral part of wine production, and grape and wine microbiota present regionally defined patterns associated with vineyard and climatic conditions, but the degree to which these microbial patterns associate with the chemical composition of wine is unclear. Through a longitudinal survey of over 200 commercial wine fermentations, we demonstrate that both grape microbiota and wine metabolite profiles distinguish viticultural area designations and individual vineyards within Napa and Sonoma Counties, California. Associations among wine microbiota and fermentation characteristics suggest new links between microbiota, fermentation performance, and wine properties. The bacterial and fungal consortia of wine fermentations, composed from vineyard and winery sources, correlate with the chemical composition of the finished wines and predict metabolite abundances in finished wines using machine learning models. The use of postharvest microbiota as an early predictor of wine chemical composition is unprecedented and potentially poses a new paradigm for quality control of agricultural products. These findings add further evidence that microbial activity is associated with wine terroir   IMPORTANCE Wine production is a multi-billion-dollar global industry for which microbial control and wine chemical composition are crucial aspects of quality. Terroir is an important feature of consumer appreciation and wine culture, but the many factors that contribute to terroir are nebulous. We show that grape and wine microbiota exhibit regional patterns that correlate with wine chemical composition, suggesting that the grape microbiome may influence terroir In addition to enriching our understa

Question: What is the importance of wine terroir?


A Variable Threshold Voltage CMOS Comparator for Flash Analog to Digital Converter. This paper presents a variable threshold voltage CMOS comparator for flash analog to digital converter. The proposed comparator has single-ended type of architecture. The comparator is designed and analyzed by Cadence Virtuoso Analog Design Environment using UMC 180nm technology. The proposed comparator consumes peak power of 34. 97 ?W from 1. 8 V power supply. It achieves the power delay product (PDP) of 8 fJ and propagation delay of 230 ps. The designed comparator eliminates the requirement of resistive ladder network for reference voltage generation. This makes it highly suitable in the design of flash analog to digital converter.

Question: What is the power consumption of the comparator?


Structural XML Classification in Concept Drifting Data Streams. Classification of large, static collections of XML data has been intensively studied in the last several years. Recently however, the data processing paradigm is shifting from static to streaming data, where documents have to be processed online using limited memory and class definitions can change with time in an event called concept drift. As most existing XML classifiers are capable of processing only static data, there is a need to develop new approaches dedicated for streaming environments. In this paper, we propose a new classification algorithm for XML data streams called XSC. The algorithm uses incrementally mined frequent subtrees and a tree-subtree similarity measure to classify new documents in an associative manner. The proposed approach is experimentally evaluated against eight state-of-the-art stream classifiers on real and synthetic data. The results show that XSC performs significantly better than competitive algorithms in terms of accuracy and memory usage.

Question: What is the difference between a static and a streaming XML classifier?


Single-unit pattern generators for quadruped locomotion. Legged robots can potentially venture beyond the limits of wheeled vehicles. While creating controllers for such robots by hand is possible, evolutionary algorithms are an alternative that can reduce the burden of hand-crafting robotic controllers. Although major evolutionary approaches to legged locomotion can generate oscillations through popular techniques such as continuous time recurrent neural networks (CTRNNs) or sinusoidal input, they typically face a challenge in maintaining long-term stability. The aim of this paper is to address this challenge by introducing an effective alternative based on a new type of neuron called a single-unit pattern generator (SUPG). The SUPG, which is indirectly encoded by a compositional pattern producing network (CPPN) evolved by HyperNEAT, produces a flexible temporal activation pattern that can be reset and repeated at any time through an explicit trigger input, thereby allowing it to dynamically recalibrate over time to maintain stability. The SUPG approach, which is compared to CTRNNs and sinusoidal input, is shown to produce natural-looking gaits that exhibit superior stability over time, thereby providing a new alternative for evolving oscillatory locomotion.

Question: What is a single-unit pattern generator?


One Million Sense-Tagged Instances for Word Sense Disambiguation and Induction. Supervised word sense disambiguation (WSD) systems are usually the best performing systems when evaluated on standard benchmarks. However, these systems need annotated training data to function properly. While there are some publicly available open source WSD systems, very few large annotated datasets are available to the research community. The two main goals of this paper are to extract and annotate a large number of samples and release them for public use, and also to evaluate this dataset against some word sense disambiguation and induction tasks. We show that the open source IMS WSD system trained on our dataset achieves stateof-the-art results in standard disambiguation tasks and a recent word sense induction task, outperforming several task submissions and strong baselines.

Question: What is the size of the dataset?


Comparison of Two β-Alanine Dosing Protocols on Muscle Carnosine Elevations.. OBJECTIVE β-alanine (BA) is a nonproteogenic amino acid that combines with histidine to form carnosine. The amount taken orally in individual doses, however, is limited due to symptoms of paresthesia that are associated with higher doses. The use of a sustained-release formulation has been reported to reduce the symptoms of paresthesia, suggesting that a greater daily dose may be possible. The purpose of the present study was to determine whether increasing the daily dose of BA can result in a similar increase in muscle carnosine in a reduced time.   METHODS Eighteen men and twelve women were randomized into either a placebo (PLC), 6-g BA (6G), or 12-g BA (12G) groups. PLC and 6G were supplemented for 4 weeks, while 12G was supplemented for 2 weeks. A resting blood draw and muscle biopsy were obtained prior to (PRE) and following (POST) supplementation. Plasma and muscle metabolites were measured by high-performance liquid chromatography. The loss in peak torque (ΔPT) was calculated from maximal isometric contractions before and after 250 isokinetic kicks at 180°·sec-1 PRE and POST.   RESULTS Both 12G (p = 0.026) and 6G (p = 0.004) increased muscle carnosine compared to PLC. Plasma histidine was decreased from PRE to POST in 12G compared to PLC (p = 0.002) and 6G (p = 0.001), but no group x time interaction (p = 0.662) was observed for muscle histidine. No differences were observed for any hematological measure (e.g., complete blood counts) or in symptoms of paresthesia among the groups. Although no interaction was noted in ΔPT, a trend (p = 0.073) was observed.   CONCLUSION Results of this investigation indicate that a BA supplementation protocol of 12 g/d-1, using a sustained-release formulation, can accelerate the increase in carnosine content in skeletal muscle while attenuating paresthesia.

Question: What is the difference between a sustained-release and a non-sustained-release formulation?


Management of trust in the e-marketplace: the role of the buyer's experience in building trust. The e-marketplace, or broker-managed online market, is one of today's most profitable e-business models. In these marketplaces, buyers routinely engage with businesses and individual sellers with whom they have had little or no prior interaction, making trust one of the most important issues in the e-marketplaces. Therefore, a clear understanding of the trust building process in the e-marketplace is important for the success in the market. In this study, we analyze the process by which e-marketplace customers develop trust in both a market-maker and sellers. Additionally, this analysis provides a theoretical framework to identify the antecedents of trust. In the framework, we suggest that the impact of trust on transaction intention is moderated by the customer's previous experiences in the e-marketplace. The theoretical model presented here was tested on survey and transaction data collected from 692 respondents. The results indicate that customers value the importance of trust in the market-maker and sellers differentially by the level of transaction experience. It is also shown that market-maker's characteristics (reputation, website's usability and security) and seller's characteristics (expertise) play an important role in the formation and development of trust toward a market-maker and sellers, respectively. Journal of Information Technology (2007) 22, 119–132. doi:10.1057/palgrave.jit.2000095 Published online 23 January 2007

Question: What is the role of trust in the e-marketplace?


Graphical SLAM - a self-correcting map. We describe an approach to simultaneous localization and mapping, SLAM. This approach has the highly desirable property of robustness to data association errors. Another important advantage of our algorithm is that non-linearities are computed exactly, so that global constraints can be imposed even if they result in large shifts to the map. We represent the map as a graph and use the graph to find an efficient map update algorithm. We also show how topological consistency can be imposed on the map, such as, closing a loop. The algorithm has been implemented on an outdoor robot and we have experimental validation of our ideas. We also explain how the graph can be simplified leading to linear approximations of sections of the map. This reduction gives us a natural way to connect local map patches into a much larger global map.

Question: What is a self-correcting map?


A Hybrid Indexing Method for Approximate String Matching. We present a new indexing method for the approximate string matching problem. The method is based on a suffix array combined with a partitioning of the pattern. We analyze the resulting algorithm and show that the average retrieval time is , for some that depends on the error fraction tolerated and the alphabet size . It is shown that for approximately , where . The space required is four times the text size, which is quite moderate for this problem. We experimentally show that this index can outperform by far all the existing alternatives for indexed approximate searching. These are also the first experiments that compare the different existing schemes.

Question: What is the average retrieval time of this index?


From Adjective Glosses to Attribute Concepts: Learning Different Aspects That an Adjective Can Describe. Adjectives are one of the major contributors to conveying subjective meaning to sentences. Understanding the semantics of adjectives is essential for understanding natural language sentences. In this paper we propose a novel approach for learning different properties that an adjective can describe, corresponding to the 'attribute concepts', which is not currently available in existing linguistic resources. We accomplish this by reading adjective glosses and bootstrapping attribute concepts from a seed of adjectives. We show that we can learn new attribute concepts using adjective glosses of WordNet adjectives with high accuracy as compared with human annotation on a test set.

Question: What is the difference between a gloss and an attribute concept?


Sockeye: A Toolkit for Neural Machine Translation. We describe SOCKEYE,1 an open-source sequence-to-sequence toolkit for Neural Machine Translation (NMT). SOCKEYE is a production-ready framework for training and applying models as well as an experimental platform for researchers. Written in Python and built on MXNET, the toolkit offers scalable training and inference for the three most prominent encoder-decoder architectures: attentional recurrent neural networks, self-attentional transformers, and fully convolutional networks. SOCKEYE also supports a wide range of optimizers, normalization and regularization techniques, and inference improvements from current NMT literature. Users can easily run standard training recipes, explore different model settings, and incorporate new ideas. In this paper, we highlight SOCKEYE's features and benchmark it against other NMT toolkits on two language arcs from the 2017 Conference on Machine Translation (WMT): English–German and Latvian–English. We report competitive BLEU scores across all three architectures, including an overall best score for SOCKEYE's transformer implementation. To facilitate further comparison, we release all system outputs and training scripts used in our experiments. The SOCKEYE toolkit is free software released under the Apache 2.0 license.

Question: What is a neural machine translation toolkit?


Robust kernel density estimation. In this paper, we propose a method for robust kernel density estimation. We interpret a KDE with Gaussian kernel as the inner product between a mapped test point and the centroid of mapped training points in kernel feature space. Our robust KDE replaces the centroid with a robust estimate based on M-estimation (P. Huber, 1981), The iteratively re-weighted least squares (IRWLS) algorithm for M-estimation depends only on inner products, and can therefore be implemented using the kernel trick. We prove the IRWLS method monotonically decreases its objective value at every iteration for a broad class of robust loss functions. Our proposed method is applied to synthetic data and network traffic volumes, and the results compare favorably to the standard KDE.

Question: What is the kernel trick?


CAP twelve years later: How the "rules" have changed. The CAP theorem asserts that any networked shared-data system can have only two of three desirable properties. However, by explicitly handling partitions, designers can optimize consistency and availability, thereby achieving some trade-off of all three. The featured Web extra is a podcast from Software Engineering Radio, in which the host interviews Dwight Merriman about the emerging NoSQL movement, the three types of nonrelational data stores, Brewer's CAP theorem, and much more.

Question: What is the CAP theorem?


Transcriptional regulatory networks in Saccharomyces cerevisiae.. We have determined how most of the transcriptional regulators encoded in the eukaryote Saccharomyces cerevisiae associate with genes across the genome in living cells. Just as maps of metabolic networks describe the potential pathways that may be used by a cell to accomplish metabolic processes, this network of regulator-gene interactions describes potential pathways yeast cells can use to regulate global gene expression programs. We use this information to identify network motifs, the simplest units of network architecture, and demonstrate that an automated process can use motifs to assemble a transcriptional regulatory network structure. Our results reveal that eukaryotic cellular functions are highly connected through networks of transcriptional regulators that regulate other transcriptional regulators.

Question: What is a transcriptional regulatory network?


Sparse solutions to linear inverse problems with multiple measurement vectors. We address the problem of finding sparse solutions to an underdetermined system of equations when there are multiple measurement vectors having the same, but unknown, sparsity structure. The single measurement sparse solution problem has been extensively studied in the past. Although known to be NP-hard, many single-measurement suboptimal algorithms have been formulated that have found utility in many different applications. Here, we consider in depth the extension of two classes of algorithms-Matching Pursuit (MP) and FOCal Underdetermined System Solver (FOCUSS)-to the multiple measurement case so that they may be used in applications such as neuromagnetic imaging, where multiple measurement vectors are available, and solutions with a common sparsity structure must be computed. Cost functions appropriate to the multiple measurement problem are developed, and algorithms are derived based on their minimization. A simulation study is conducted on a test-case dictionary to show how the utilization of more than one measurement vector improves the performance of the MP and FOCUSS classes of algorithm, and their performances are compared.

Question: What is the difference between the single and multiple measurement sparse solution problem?


Learning analytics: envisioning a research discipline and a domain of practice. Learning analytics are rapidly being implemented in different educational settings, often without the guidance of a research base. Vendors incorporate analytics practices, models, and algorithms from datamining, business intelligence, and the emerging "big data" fields. Researchers, in contrast, have built up a substantial base of techniques for analyzing discourse, social networks, sentiments, predictive models, and in semantic content (i.e., "intelligent" curriculum). In spite of the currently limited knowledge exchange and dialogue between researchers, vendors, and practitioners, existing learning analytics implementations indicate significant potential for generating novel insight into learning and vital educational practices. This paper presents an integrated and holistic vision for advancing learning analytics as a research discipline and a domain of practices. Potential areas of collaboration and overlap are presented with the intent of increasing the impact of analytics on teaching, learning, and the education system.

Question: What is the difference between learning analytics and learning analytics?


Artificial Intelligence MArkup Language: A Brief Tutorial. The purpose of this paper is to serve as a reference guide for the development of chatterbots implemented with the AIML language. In order to achieve this, the main concepts in Pattern Recognition area are described because the AIML uses such theoretical framework in their syntactic and semantic structures. After that, AIML language is described and each AIML command/tag is followed by an application example. Also, the usage of AIML embedded tags for the handling of sequence dialogue limitations between humans and machines is shown. Finally, computer systems that assist in the design of chatterbots with the AIML language are classified and described.

Question: What is the purpose of this paper?


Process scheduling under uncertainty: Review and challenges. Uncertainty is a very important concern in production scheduling since it can cause infeasibilities and production disturbances. Thus scheduling nder uncertainty has received a lot of attention in the open literature in recent years from chemical engineering and operations research communities. he purpose of this paper is to review the main methodologies that have been developed to address the problem of uncertainty in production cheduling as well as to identify the main challenges in this area. The uncertainties in process scheduling are first analyzed, and the different athematical approaches that exist to describe process uncertainties are classified. Based on the different descriptions for the uncertainties, lternative scheduling approaches and relevant optimization models are reviewed and discussed. Further research challenges in the field of process cheduling under uncertainty are identified and some new ideas are discussed. 2007 Elsevier Ltd. All rights reserved.

Question: What is the purpose of this paper?


Overview of the TAC 2010 Knowledge Base Population Track. In this paper we give an overview of the Knowledge Base Population (KBP) track at TAC 2010. The main goal of KBP is to promote research in discovering facts about entities and expanding a structured knowledge base with this information. A large source collection of newswire and web documents is provided for systems to discover information. Attributes (a.k.a. "slots") derived from Wikipedia infoboxes are used to create the reference knowledge base (KB). KBP2010 includes the following four tasks: (1) Regular Entity Linking, where names must be aligned to entities in the KB; (2) Optional Entity linking, without using Wikipedia texts; (3) Regular Slot Filling, which requires a system to automatically discover the attributes of specified entities from the source document collection and use them to expand the KB; (4) Surprise Slot Filling, which requires a system to return answers regarding new slot types within a short time period. KBP2010 has attracted many participants (over 45 teams registered for KBP 2010 (not including the RTEKBP Validation Pilot task), among which 23 teams submitted results). In this paper we provide an overview of the task definition and annotation challenges associated with KBP2010. Then we summarize the evaluation results and discuss the lessons that we have learned based on detailed analysis.

Question: What is the canadian military?


A Comparison of Intensive Care Unit Mortality Prediction Models through the Use of Data Mining Techniques. OBJECTIVES The intensive care environment generates a wealth of critical care data suited to developing a well-calibrated prediction tool. This study was done to develop an intensive care unit (ICU) mortality prediction model built on University of Kentucky Hospital (UKH)'s data and to assess whether the performance of various data mining techniques, such as the artificial neural network (ANN), support vector machine (SVM) and decision trees (DT), outperform the conventional logistic regression (LR) statistical model.   METHODS The models were built on ICU data collected regarding 38,474 admissions to the UKH between January 1998 and September 2007. The first 24 hours of the ICU admission data were used, including patient demographics, admission information, physiology data, chronic health items, and outcome information.   RESULTS Only 15 study variables were identified as significant for inclusion in the model development. The DT algorithm slightly outperformed (AUC, 0.892) the other data mining techniques, followed by the ANN (AUC, 0.874), and SVM (AUC, 0.876), compared to that of the APACHE III performance (AUC, 0.871).   CONCLUSIONS With fewer variables needed, the machine learning algorithms that we developed were proven to be as good as the conventional APACHE III prediction.

Question: What is the difference between the ANN, SVM and DT?


Dataset Augmentation in Feature Space. Dataset augmentation, the practice of applying a wide array of domain-specific transformations to synthetically expand a training set, is a standard tool in supervised learning. While effective in tasks such as visual recognition, the set of transformations must be carefully designed, implemented, and tested for every new domain, limiting its re-use and generality. In this paper, we adopt a simpler, domain-agnostic approach to dataset augmentation. We start with existing data points and apply simple transformations such as adding noise, interpolating, or extrapolating between them. Our main insight is to perform the transformation not in input space, but in a learned feature space. A re-kindling of interest in unsupervised representation learning makes this technique timely and more effective. It is a simple proposal, but to-date one that has not been tested empirically. Working in the space of context vectors generated by sequence-to-sequence models, we demonstrate a technique that is effective for both static and sequential data.

Question: How to augment a dataset?


Learning to learn with the informative vector machine. This paper describes an efficient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn independently from the same GP prior. An efficient algorithm is obtained by extending the informative vector machine (IVM) algorithm to handle the multi-task learning case. The multi-task IVM (MTIVM) saves computation by greedily selecting the most informative examples from the separate tasks. The MT-IVM is also shown to be more efficient than random sub-sampling on an artificial data-set and more effective than the traditional IVM in a speaker dependent phoneme recognition task.

Question: What is the informative vector machine?


Educational game design for online education. The use of educational games in learning environments is an increasingly relevant trend. The motivational and immersive traits of game-based learning have been deeply studied in the literature, but the systematic design and implementation of educational games remain an elusive topic. In this study some relevant requirements for the design of educational games in online education are analyzed, and a general game design method that includes adaptation and assessment features is proposed. Finally, a particular implementation of that design is described in light of its applicability to other implementations and environments. 2008 Elsevier Ltd. All rights reserved.

Question: What is the use of educational games in online education?


Neural scene representation and rendering. Scene representation—the process of converting visual sensory data into concise descriptions—is a requirement for intelligent behavior. Recent work has shown that neural networks excel at this task when provided with large, labeled datasets. However, removing the reliance on human labeling remains an important open problem. To this end, we introduce the Generative Query Network (GQN), a framework within which machines learn to represent scenes using only their own sensors. The GQN takes as input images of a scene taken from different viewpoints, constructs an internal representation, and uses this representation to predict the appearance of that scene from previously unobserved viewpoints. The GQN demonstrates representation learning without human labels or domain knowledge, paving the way toward machines that autonomously learn to understand the world around them.

Question: What is a neural scene representation?


Evaluation of Computer Games Developed by Primary School Children to Gauge Understanding of Programming Concepts. Under the Curriculum for Excellence (CfE) in Scotland, newer approaches such as games-based learning and games-based construction are being adopted to motivate and engage students. Construction of computer games is seen by some to be a highly motivational and practical approach at engaging children at Primary Education (PE) level in computer programming concepts. Gamesbased learning (GBL) and games-based construction both suffer from a dearth of empirical evidence supporting their validity as teaching and learning approaches. To address this issue, this paper will present the findings of observational research at PE level using Scratch as a tool to develop computer games using rudimentary programming concepts. A list of criteria will be compiled for reviewing the implementation of each participant to gauge the level of programming proficiency demonstrated. The study will review 29 games from Primary 4 to Primary 7 level and will present the overall results and results for each individual year. This study will contribute to the empirical evidence in games-based construction by providing the results of observational research across different levels of PE and will provide pedagogical guidelines for assessing programming ability using a games-based construction approach.

Question: What is the difference between a game and a game-based learning?


International Journal of Advanced Robotic Systems Design of a Control System for an Autonomous Vehicle Based on Adaptive-PID Regular Paper. The  autonomous  vehicle  is  a  mobile  robot integrating  multi‐sensor  navigation  and  positioning, intelligent decision making and control  technology. This paper  presents  the  control  system  architecture  of  the autonomous vehicle, called "Intelligent Pioneer", and the path  tracking  and  stability  of  motion  to  effectively navigate  in unknown  environments  is discussed.  In  this approach,  a  two  degree‐of‐freedom  dynamic  model  is developed to formulate the path‐tracking problem in state space format. For controlling the instantaneous path error, traditional  controllers  have  difficulty  in  guaranteeing performance and stability over a wide range of parameter changes and disturbances. Therefore, a newly developed adaptive‐PID  controller  will  be  used.  By  using  this approach the flexibility of the vehicle control system will be  increased  and  achieving  great  advantages. Throughout,  we  provide  examples  and  results  from Intelligent Pioneer and the autonomous vehicle using this approach  competed  in  the  2010  and  2011  Future Challenge of China. Intelligent Pioneer finished all of the competition programmes and won  first position  in 2010 and third position in 2011.

Question: What is the name of the autonomous vehicle?


Inducing Features of Random Fields. We present a technique for constructing random elds from a set of training samples. The learning paradigm builds increasingly complex elds by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the Kullback-Leibler divergence between the model and the empirical distribution of the training data. A greedy algorithm determines how features are incrementally added to the eld and an iterative scaling algorithm is used to estimate the optimal values of the weights. The random eld models and techniques introduced in this paper di er from those common to much of the computer vision literature in that the underlying random elds are nonMarkovian and have a large number of parameters that must be estimated. Relations to other learning approaches including decision trees and Boltzmann machines are given. As a demonstration of the method, we describe its application to the problem of automatic word classi cation in natural language processing.

Question: How to construct a random eld?


Template Attacks. We present template attacks, the strongest form of side channel attack possible in an information theoretic sense. These attacks can break implementations and countermeasures whose security is dependent on the assumption that an adversary cannot obtain more than one or a limited number of side channel samples. They require that an adversary has access to an identical experimental device that he can program to his choosing. The success of these attacks in such constraining situations is due manner in which noise within each sample is handled. In contrast to previous approaches which viewed noise as a hindrance that had to be reduced or eliminated, our approach focuses on precisely modeling noise, and using this to fully extract information present in a single sample. We describe in detail how an implementation of RC4, not amenable to techniques such as SPA and DPA, can easily be broken using template attacks with a single sample. Other applications include attacks on certain DES implementations which use DPA–resistant hardware and certain SSL accelerators which can be attacked by monitoring electromagnetic emanations from an RSA operation even from distances of fifteen feet.

Question: How to break RC4?


Rotation-discriminating template matching based on Fourier coefficients of radial projections with robustness to scaling and partial occlusion. We consider brightness/contrast-invariant and rotation-discriminating template matching that searches an image to analyze A for a query image Q. We propose to use the complex coefficients of the discrete Fourier transform of the radial projections to compute new rotation-invariant local features. These coefficients can be efficiently obtained via FFT. We classify templates in "stable" and "unstable" ones and argue that any local feature-based template matching may fail to find unstable templates. We extract several stable sub-templates of Q and find them in A by comparing the features. The matchings of the sub-templates are combined using the Hough transform. As the features of A are computed only once, the algorithm can find quickly many different sub-templates in A, and it is suitable for: finding many query images in A; multi-scale searching and partial occlusion-robust template matching.

Question: How to find a query image in a database?


Survey on security threats of smartphones in Internet of Things. Internet of Things (IoT) is an emerging concept which will interconnect billions of devices (such as smartphones, sensors and other networking devices), to communicate with each other. This interconnection of devices can be beneficial in many ways such as improving location based services and timely coordination. However, this also impose severe security concerns specially on smartphones which contains sensitive data. In this paper, we provide a comprehensive analysis of different security issues in smartphones which are integral part of IoT. We provide an easy and concise overview of different security threats. Our categorization helps in identifying specific security breach and applying relevant countermeasures.

Question: What are the security threats of smartphones in internet of things?


Cannabinoids in the Treatment of Epilepsy.. Despite the availability of more than 20 different antiseizure drugs and the provision of appropriate medical therapy, 30% of people with epilepsy continue to have seizures.1,2 The approval of many new antiseizure drugs during the past two decades, including several with novel mechanisms of action, has not substantially reduced the proportion of patients with medically refractory disease.1 The safety and side-effect profile of antiseizure drugs has improved, but side effects related to the central nervous system are common and affect quality of life.3 Patients need new treatments that control seizures and have fewer side effects. This treatment gap has led patients and families to seek alternative treatments. Cannabis-based treatment for epilepsy has recently received prominent attention in the lay press4 and in social media, with reports of dramatic improvements in seizure control in children with severe epilepsy. In response, many states have legalized cannabis for the treatment of epilepsy (and other medical conditions) in children and adults (for a list of medical marijuana laws according to state, see www . ncsl . org/ research/ health/ state-medical-marijuana-laws . aspx). Cannabis has been used medicinally for millennia and was used in the treatment of epilepsy as early as 1800 b.c.e. in Sumeria.5 Victorian-era neurologists used Indian hemp to treat epilepsy and reported dramatic success.5,6 The use of cannabis therapy for the treatment of epilepsy diminished with the introduction of phenobarbital (1912) and phenytoin (1937) and the passage of the Marijuana Tax Act (1937). The discovery of an endogenous cannabinoid-signaling system in the 1990s7 rekindled interest in therapies derived from constituents of cannabis for nervous system disorders such as epilepsy (see ClinicalTrials.gov numbers, NCT02091375, NCT02224690, NCT02324673, NCT02318537, and NCT02318563). This review addresses the current preclinical and clinic

Question: What is the difference between the antiseizure drugs and cannabis?


A theory of visual attention.. A unified theory of visual recognition and attentional selection is developed by integrating the biased-choice model for single-stimulus recognition (Luce, 1963; Shepard, 1957) with a choice model for selection from multielement displays (Bundesen, Pedersen, & Larsen, 1984) in a race model framework. Mathematically, the theory is tractable, and it specifies the computations necessary for selection. The theory is applied to extant findings from a broad range of experimental paradigms. The findings include effects of object integrality in selective report, number and spatial position of targets in divided-attention paradigms, selection criterion and number of distracters in focused-attention paradigms, delay of selection cue in partial report, and consistent practice in search. On the whole, the quantitative fits are encouraging.

Question: What is the unified theory of visual attention?


Image inpainting. Inpainting, the technique of modifying an image in an undetectable form, is as ancient as art itself. The goals and applications of inpainting are numerous, from the restoration of damaged paintings and photographs to the removal/replacement of selected objects. In this paper, we introduce a novel algorithm for digital inpainting of still images that attempts to replicate the basic techniques used by professional restorators. After the user selects the regions to be restored, the algorithm automatically fills-in these regions with information surrounding them. The fill-in is done in such a way that isophote lines arriving at the regions' boundaries are completed inside. In contrast with previous approaches, the technique here introduced does not require the user to specify where the novel information comes from. This is automatically done (and in a fast way), thereby allowing to simultaneously fill-in numerous regions containing completely different structures and surrounding backgrounds. In addition, no limitations are imposed on the topology of the region to be inpainted. Applications of this technique include the restoration of old photographs and damaged film; removal of superimposed text like dates, subtitles, or publicity; and the removal of entire objects from the image like microphones or wires in special effects.

Question: What is the name of the algorithm?


Disconnected aging: Cerebral white matter integrity and age-related differences in cognition. Cognition arises as a result of coordinated processing among distributed brain regions and disruptions to communication within these neural networks can result in cognitive dysfunction. Cortical disconnection may thus contribute to the declines in some aspects of cognitive functioning observed in healthy aging. Diffusion tensor imaging (DTI) is ideally suited for the study of cortical disconnection as it provides indices of structural integrity within interconnected neural networks. The current review summarizes results of previous DTI aging research with the aim of identifying consistent patterns of age-related differences in white matter integrity, and of relationships between measures of white matter integrity and behavioral performance as a function of adult age. We outline a number of future directions that will broaden our current understanding of these brain-behavior relationships in aging. Specifically, future research should aim to (1) investigate multiple models of age-brain-behavior relationships; (2) determine the tract-specificity versus global effect of aging on white matter integrity; (3) assess the relative contribution of normal variation in white matter integrity versus white matter lesions to age-related differences in cognition; (4) improve the definition of specific aspects of cognitive functioning related to age-related differences in white matter integrity using information processing tasks; and (5) combine multiple imaging modalities (e.g., resting-state and task-related functional magnetic resonance imaging; fMRI) with DTI to clarify the role of cerebral white matter integrity in cognitive aging.

Question: What is the relationship between white matter integrity and age-related differences in cognition?


Comparison of Architectural Design Decisions for Resource-Constrained Self-Driving Cars - A Multiple Case-Study. Context: Self-Driving cars are getting more and more attention with public demonstration from all important automotive OEMs but also from companies, which do not have a long history in the automotive industry. Fostered by large international competitions in the last decade, several automotive OEMs have already announced to bring this technology to the market around 2020. Objective: International competitions like the 2007 DARPA Urban Challenge did not focus on efficient usage of resources to realize the self-driving vehicular functionality. Since the automotive industry is very cost-sensitive, realizing reliable and robust selfdriving functionality is challenging when expensive and sophisticated sensors mounted very visibly on the vehicle's roof for example cannot be used. Therefore, the goal for this study is to investigate how architectural design decisions of recent self-driving vehicular technology consider resource-efficiency. Method: In a multiple case study, the architectural design decisions derived for resourceconstrained self-driving miniature cars for the international competition CaroloCup are compared with architectural designs from recent real-scale self-driving cars. Results: Scaling down available resources for realizing self-driving vehicular technology puts additional constraints on the architectural design; especially reusability of software components in platform-independent algorithmic concepts are prevailing. Conclusion: Software frameworks like the robotic operating system (ROS) enable fast prototypical solutions; however, architectural support for resource-constrained devices is limited. Here, architectural design drivers as realized in AUTOSAR are more suitable.

Question: How do self-driving cars compare to other cars?


Local Naive Bayes Nearest Neighbor for image classification. We present Local Naive Bayes Nearest Neighbor, an improvement to the NBNN image classification algorithm that increases classification accuracy and improves its ability to scale to large numbers of object classes. The key observation is that only the classes represented in the local neighborhood of a descriptor contribute significantly and reliably to their posterior probability estimates. Instead of maintaining a separate search structure for each class's training descriptors, we merge all of the reference data together into one search structure, allowing quick identification of a descriptor's local neighborhood. We show an increase in classification accuracy when we ignore adjustments to the more distant classes and show that the run time grows with the log of the number of classes rather than linearly in the number of classes as did the original. Local NBNN gives a 100 times speed-up over the original NBNN on the Caltech 256 dataset. We also provide the first head-to-head comparison of NBNN against spatial pyramid methods using a common set of input features. We show that local NBNN outperforms all previous NBNN based methods and the original spatial pyramid model. However, we find that local NBNN, while competitive with, does not beat state-of-the-art spatial pyramid methods that use local soft assignment and max-pooling.

Question: What is the local naive bayes nearest neighbor?


Kalman filters improve LSTM network performance in problems unsolvable by traditional recurrent nets. The long short-term memory (LSTM) network trained by gradient descent solves difficult problems which traditional recurrent neural networks in general cannot. We have recently observed that the decoupled extended Kalman filter training algorithm allows for even better performance, reducing significantly the number of training steps when compared to the original gradient descent training algorithm. In this paper we present a set of experiments which are unsolvable by classical recurrent networks but which are solved elegantly and robustly and quickly by LSTM combined with Kalman filters.

Question: What is the difference between LSTM and Kalman filters?


The trouble with overconfidence.. The authors present a reconciliation of 3 distinct ways in which the research literature has defined overconfidence: (a) overestimation of one's actual performance, (b) overplacement of one's performance relative to others, and (c) excessive precision in one's beliefs. Experimental evidence shows that reversals of the first 2 (apparent underconfidence), when they occur, tend to be on different types of tasks. On difficult tasks, people overestimate their actual performances but also mistakenly believe that they are worse than others; on easy tasks, people underestimate their actual performances but mistakenly believe they are better than others. The authors offer a straightforward theory that can explain these inconsistencies. Overprecision appears to be more persistent than either of the other 2 types of overconfidence, but its presence reduces the magnitude of both overestimation and overplacement.

Question: What is the difference between overconfidence and overprecision?


Circuit techniques for reducing the effects of op-amp imperfections: autozeroing, correlated double sampling, and chopper stabilization. In linear IC's fabricated in a low-voltage CMOS technology, the reduction of the dynamic range due to the dc offset and low,frequency noise of the ampli$ers becomes increasingly significant. Also, the achievable aniplijier gain is often quite low in such a technology, since cascoding may not be a practical circuit option due to the resulting reduction of the output signal swing. In this paper, some old and some new circuit techniques will be described for the compensation of the amplifier most important nonideal effects including the noise (mainly thermal and l l f noise), the input-referred dc offset voltage, as well as the finite gain resulting in a nonideal virtual ground at the input.

Question: What is the difference between a chopper and a chopper stabilization?


The Role of Feasibility and Desirability Considerations in Near and Distant Future Decisions : A Test of Temporal Construal Theory. Temporal construal theory states that distant future situations are construed on a higher level (i.e., using more abstract and central features) than near future situations. Accordingly, the theory suggests that the value associated with the high-level construal is enhanced over delay and that the value associated with the low-level construal is discounted over delay. In goal-directed activities, desirability of the activity's end state represents a high-level construal, whereas the feasibility of attaining this end state represents a low-level construal. Study 1 found that distant future activities were construed on a higher level than near future activities. Studies 2 and 3 showed that decisions regarding distant future activities, compared with decisions regarding near future activities, were more influenced by the desirability of the end state and less influenced by the feasibility of attaining the end state. Study 4 presented students with a real-life choice of academic assignments varying in difficulty (feasibility) and interest (desirability). In choosing a distant future assignment, students placed relatively more weight on the assignment's interest, whereas in choosing a near future assignment, they placed relatively more weight on difficulty. Study 5 found that distant future plans, compared with near future plans, were related to desirability of activities rather than to time constraints.

Question: What is the difference between a near future and a distant future?


ADVISOR 2.1: a user-friendly advanced powertrain simulation using a combined backward/forward approach. -ADVISOR 2.1 is the latest version of the National Renewable Energy Laboratory's advanced vehicle simulator. It was first developed in 1994 to support the U.S. Department of Energy hybrid propulsion system program, and is designed to be accurate, fast, flexible, easily sharable, and easy to use. This paper presents the model, focusing on its combination of forwardand backward-facing simulation approaches, and evaluates the model in terms of its design goals. ADVISOR predicts acceleration time to within 0.7% and energy use on the demanding US06 to within 0.6% for an underpowered series hybrid vehicle (0-100 km/h in 20 s). ADVISOR simulates vehicle performance on standard driving cycles between 2.6 and 8.0 times faster than a representative forward-facing vehicle model. Due in large part to ADVISOR's powerful graphical user interface and Web presence, over 800 users have downloaded ADVISOR from 45 different countries. Many of these users have contributed their own component data to the ADVISOR library.

Question: What is the latest version of the National Renewable Energy Laboratory's advanced vehicle simulator?


Tampering Detection in Low-Power Smart Cameras. A desirable feature in smart cameras is the ability to autonomously detect any tampering event/attack that would prevent a clear view over the monitored scene. No matter whether tampering is due to atmospheric phenomena (e.g., few rain drops over the camera lens) or to malicious attacks (e.g., occlusions or device displacements), these have to be promptly detected to possibly activate countermeasures. Tampering detection is particularly challenging in battery-powered cameras, where it is not possible to acquire images at full-speed frame-rates, nor use sophisticated image-analysis algorithms. We here introduce a tampering-detection algorithm specifically designed for low-power smart cameras. The algorithm leverages very simple indicators that are then monitored by an outlier-detection scheme: any frame yielding an outlier is detected as tampered. Core of the algorithm is the partitioning of the scene into adaptively defined regions, that are preliminarily defined by segmenting the image during the algorithmconfiguration phase, and which shows to improve the detection of camera displacements. Experiments show that the proposed algorithm can successfully operate on sequences acquired at very low-frame rate, such as one frame every minute, with a very small computational complexity.

Question: How to detect tampering in low-power smart cameras?


Effect of Corporate Governance Structure on the Financial Performance of Johannesburg Stock Exchange ( JSE )-Listed Mining Firms. There have been many corporate collapses and financial crises in recent years linked to a lack of effective corporate governance. The South African King IV Code of Corporate Governance recommends that corporate governing bodies should be comprised of an appropriate balance of knowledge, diversity, and independence for discharging their duties objectively and more efficiently. This study examines the effect of corporate governance structures on firm financial performance. The secondary data of selected Johannesburg Stock Exchange (JSE), Socially Responsible Investment (SRI) Index-listed mining firms' sustainability reports, and integrated annual financial statements are used. Using panel data analysis of the random effects model, we determined the relationship between board independence and board size and the return on equity (ROE) for the period 2010–2015. Results indicate a weak negative correlation between ROE and board size, and a weak, but positive, correlation between ROE and board independence. Additionally, there is a positive, but weak, correlation between ROE and sales growth, but a negative and weak relationship between ROE and firm size. The study suggests that effective corporate governance through a small effective board and monitoring by an independent board result in increased firm financial performance. We recommend that South African companies see compliance with the recommendations of the King IV Code on Corporate Governance not as a liability, but an ethical investment that may likely yield financial benefit in the long-term. Although complying with corporate governance principles does not necessarily translate into a significant economic benefit, firms should, however, continue to adopt corporate governance for ethical reasons to meet stakeholder's social and environmental needs for sustainable development.

Question: What is the effect of corporate governance structure on firm financial performance?


CAB: Connectionist Analogy Builder. The ability to make informative comparisons is central to human cognition. Comparison involves aligning two representations and placing their elements into correspondence. Detecting correspondences is a necessary component of analogical inference, recognition, categorization, schema formation, and similarity judgment. Connectionist Analogy Builder (CAB) determines correspondences through a simple iterative computation that matches elements in one representation with elements playing compatible roles in the other representation while simultaneously enforcing structural constraints. CAB shows promise as a process model of comparison as its performance can be related to human performance (e.g., solution trajectory, error patterns, time-on-task). Furthermore, CAB's bounded working memory allows it to account for the inherent capacity limitations of human processing. CAB's strengths are its parsimony, transparency of operations, and ability to generate performance predictions. In this paper, CAB is evaluated against benchmark phenomena from the analogy literature. © 2003 Cognitive Science Society, Inc. All rights reserved.

Question: What is the connectionist analogy builder?


BinMatch: A Semantics-Based Hybrid Approach on Binary Code Clone Analysis. Binary code clone analysis is an important technique which has a wide range of applications in software engineering (e.g., plagiarism detection, bug detection). The main challenge of the topic lies in the semantics-equivalent code transformation (e.g., optimization, obfuscation) which would alter representations of binary code tremendously. Another challenge is the trade-off between detection accuracy and coverage. Unfortunately, existing techniques still rely on semantics-less code features which are susceptible to the code transformation. Besides, they adopt merely either a static or a dynamic approach to detect binary code clones, which cannot achieve high accuracy and coverage simultaneously.  In this paper, we propose a semantics-based hybrid approach to detect binary clone functions. We execute a template binary function with its test cases, and emulate the execution of every target function for clone comparison with the runtime information migrated from that template function. The semantic signatures are extracted during the execution of the template function and emulation of the target function. Lastly, a similarity score is calculated from their signatures to measure their likeness. We implement the approach in a prototype system designated as BinMatch which analyzes IA-32 binary code on the Linux platform. We evaluate BinMatch with eight real-world projects compiled with different compilation configurations and commonly-used obfuscation methods, totally performing over 100 million pairs of function comparison. The experimental results show that BinMatch is robust to the semantics-equivalent code transformation. Besides, it not only covers all target functions for clone analysis, but also improves the detection accuracy comparing to the state-of-the-art solutions.

Question: What is the difference between a static and a dynamic approach to detect binary code clones?


DRC: a dual route cascaded model of visual word recognition and reading aloud.. This article describes the Dual Route Cascaded (DRC) model, a computational model of visual word recognition and reading aloud. The DRC is a computational realization of the dual-route theory of reading, and is the only computational model of reading that can perform the 2 tasks most commonly used to study reading: lexical decision and reading aloud. For both tasks, the authors show that a wide variety of variables that influence human latencies influence the DRC model's latencies in exactly the same way. The DRC model simulates a number of such effects that other computational models of reading do not, but there appear to be no effects that any other current computational model of reading can simulate but that the DRC model cannot. The authors conclude that the DRC model is the most successful of the existing computational models of reading.

Question: What is the dual route cascaded model of visual word recognition and reading aloud?


Comparison of a 1450-nm diode laser and a 1320-nm Nd:YAG laser in the treatment of atrophic facial scars: a prospective clinical and histologic study.. BACKGROUND Atrophic scar revision techniques, although numerous, have been hampered by inadequate clinical responses and prolonged postoperative recovery periods. Nonablative laser treatment has been shown to effect significant dermal collagen remodeling with minimal posttreatment sequelae. Although many studies have been published regarding the effectiveness of these nonablative lasers on rhytides, there are limited data demonstrating their specific effects on atrophic scars.   OBJECTIVE To evaluate and compare the efficacy and safety of long-pulsed 1320-nm Nd:YAG and 1450-nm diode lasers in the treatment of atrophic facial scarring.   METHODS A series of 20 patients (skin phototypes I-V) with mild to moderate atrophic facial acne scars randomly received three successive monthly treatments with a long-pulsed 1320-nm Nd:YAG laser on one facial half and a long-pulsed 1450-nm diode laser on the contralateral facial half. Patients were evaluated using digital photography and three-dimensional in vivo microtopography measurements at each treatment visit and at 1, 3, 6, and 12 months postoperatively. Histologic evaluations of cutaneous biopsies obtained before treatment, immediately after the first treatment, and at 1, 3, 6, and 12 months after the third treatment were performed. Clinical assessment scores were determined at each treatment session and follow-up visit. Patient satisfaction surveys were obtained at the end of the study.   RESULTS Mild to moderate clinical improvement was observed after the series of three treatments in the majority of patients studied. Patient satisfaction scores and in vivo microtopography measurements paralleled the photographic and histopathologic changes seen. Side effects of treatment were limited to mild transient erythema, edema, and hyperpigmentation. No scarring or adverse textural

Question: What is the difference between a 1450-nm diode laser and a 1320-nm Nd:YAG laser?


Applying QR code in augmented reality applications. In this paper we present an augmented reality (AR) application based on the QR Code. The system can extract the information embedded in a QR Code and show the information in an extended 3D form with the QR Code being the traditional AR marker. Traditional AR systems often use a particularly designed pattern (the marker) to recover the 3D scene structure and identify the object to be displayed on the scene. In these systems, the marker is used only for tracking and identification. They do not convey any other information. Consequently, the applications of these systems are limited and often a registration procedure is required for a new marker.  QR Code has the advantage of large information capacity and is similar to an AR marker in appearance. Thus, more interesting and useful applications can be developed by combining the QR Code with the traditional AR system. In this paper, we combine these two techniques to develop a product demo system. A QR Code is pasted on the package of a product and then a 3D virtual object is displayed on the QR Code. This system allows the customer to visualize the product via a more direct and interactive way. Our system demonstrates the success of using QR Code as the AR marker to a particular application and we believe it can bring more convenient to our life in the future.

Question: What is the difference between QR code and AR marker?


Development of a wall-climbing robot using a tracked wheel mechanism. In this paper, a new concept of a wall-climbing robot able to climb a vertical plane is presented. A continuous locomotive motion with a high climbing speed of 15m/min is realized by adopting a series chain on two tracked wheels on which 24 suction pads are installed. While each tracked wheel rotates, the suction pads which attach to the vertical plane are activated in sequence by specially designed mechanical valves. The engineering analysis and detailed mechanism design of the tracked wheel, including mechanical valves and the overall features, are described in this paper. It is a self-contained robot in which a vacuum pump and a power supply are integrated and is controlled remotely. The climbing performance, using the proposed mechanism, is evaluated on a vertical steel plate. Finally, the procedures are presented for an optimization experiment using Taguchi methodology to maximize vacuum pressure which is a critical factor for suction force.

Question: How to climb a wall?


A Neural Network Approch to Efficient Valuation of Large Portfolios of Variable Annuities. Managing and hedging the risks associated with Variable Annuity (VA) products requires intraday valuation of key risk metrics for these products. The complex structure of VA products and computational complexity of their accurate evaluation has compelled insurance companies to adopt Monte Carlo (MC) simulations to value their large portfolios of VA products. Because the MC simulations are computationally demanding, especially for intraday valuations, insurance companies need more efficient valuation techniques. Recently, a framework based on traditional spatial interpolation techniques has been proposed that can significantly decrease the computational complexity of MC simulation (Gan and Lin, 2015). However, traditional interpolation techniques require the definition of a distance function that can significantly impact their accuracy. Moreover, none of the traditional spatial interpolation techniques provide all of the key properties of accuracy, efficiency, and granularity (Hejazi et al., 2015). In this paper, we present a neural network approach for the spatial interpolation framework that affords an efficient way to find an effective distance function. The proposed approach is accurate, efficient, and provides an accurate granular view of the input portfolio. Our numerical experiments illustrate the superiority of the performance of the proposed neural network approach compared to the traditional spatial interpolation schemes.

Question: How to find an effective distance function?


Healthy Menus Recommendation: Optimizing the Use of the Pantry. We are often unable to plan menus ahead, thus making poor and unhealthy choices of meals. Besides healthy, one may want menus in which ingredients harmonize and cover well the available ingredients in the pantry. In this paper, we propose a novel multi-objective-based recommender of menus that features an optimal balance between nutritional aspects, harmony and coverage of available ingredients. We conduct experiments on real-world and synthetic datasets and show that our approach achieves the desired levels of nutrients, harmonization and coverage of ingredients.

Question: What is a multi-objective-based recommender?


WiFi-SLAM Using Gaussian Process Latent Variable Models. WiFi localization, the task of determining the physical location of a mobile device from wireless signal strengths, has been shown to be an accurate method of indoor and outdoor localization and a powerful building block for location-aware applications. However, most localization techniques require a training set of signal strength readings labeled against a ground truth location map, which is prohibitive to collect and maintain as maps grow large. In this paper we propose a novel technique for solving the WiFi SLAM problem using the Gaussian Process Latent Variable Model (GPLVM) to determine the latent-space locations of unlabeled signal strength data. We show how GPLVM, in combination with an appropriate motion dynamics model, can be used to reconstruct a topological connectivity graph from a signal strength sequence which, in combination with the learned Gaussian Process signal strength model, can be used to perform efficient localization.

Question: How to solve the WiFi SLAM problem using GPLVM?


A State-Space Approach to Dynamic Nonnegative Matrix Factorization. Nonnegative matrix factorization (NMF) has been actively investigated and used in a wide range of problems in the past decade. A significant amount of attention has been given to develop NMF algorithms that are suitable to model time series with strong temporal dependencies. In this paper, we propose a novel state-space approach to perform dynamic NMF (D-NMF). In the proposed probabilistic framework, the NMF coefficients act as the state variables and their dynamics are modeled using a multi-lag nonnegative vector autoregressive (N-VAR) model within the process equation. We use expectation maximization and propose a maximum-likelihood estimation framework to estimate the basis matrix and the N-VAR model parameters. Interestingly, the N-VAR model parameters are obtained by simply applying NMF. Moreover, we derive a maximum a posteriori estimate of the state variables (i.e., the NMF coefficients) that is based on a prediction step and an update step, similarly to the Kalman filter. We illustrate the benefits of the proposed approach using different numerical simulations where D-NMF significantly outperforms its static counterpart. Experimental results for three different applications show that the proposed approach outperforms two state-of-the-art NMF approaches that exploit temporal dependencies, namely a nonnegative hidden Markov model and a frame stacking approach, while it requires less memory and computational power.

Question: What is a state-space approach to dynamic nonnegative matrix factorization?


A theorem on polygon cutting with applications. Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight of all vertices. We prove that it is possible, in O(N) time, to find two vertices a,b in P, such that the segment ab lies entirely inside the polygon P and partitions it into two polygons, each with a weight not exceeding 2C/3. This computation assumes that all the vertices have been sorted along some axis, which can be done in O(Nlog N) time. We use this result to derive a number of efficient divide-and-conquer algorithms for: 1. Triangulating an N-gon in O(Nlog N) time. 2. Decomposing an N-gon into (few) convex pieces in O(Nlog N) time. 3. Given an O(Nlog N) preprocessing, computing the shortest distance between two arbitrary points inside an N-gon (i.e., the internal distance), in O(N) time. 4. Computing the longest internal path in an N-gon in O(N2) time. In all cases, the algorithms achieve significant improvements over previously known methods, either by displaying better performance or by gaining in simplicity. In particular, the best algorithms for Problems 2,3,4, known so far, performed respectively in O(N2), O(N2), and O(N4) time.

Question: What is the longest internal path in a triangle?


A summary-statistic representation in peripheral vision explains visual crowding.. Peripheral vision provides a less faithful representation of the visual input than foveal vision. Nonetheless, we can gain a lot of information about the world from our peripheral vision, for example in order to plan eye movements. The phenomenon of crowding shows that the reduction of information available in the periphery is not merely the result of reduced resolution. Crowding refers to visual phenomena in which identification of a target stimulus is significantly impaired by the presence of nearby stimuli, or flankers. What information is available in the periphery? We propose that the visual system locally represents peripheral stimuli by the joint statistics of responses of cells sensitive to different position, phase, orientation, and scale. This "textural" representation by summary statistics predicts the subjective "jumble" of features often associated with crowding. We show that the difficulty of performing an identification task within a single pooling region using this representation of the stimuli is correlated with peripheral identification performance under conditions of crowding. Furthermore, for a simple stimulus with no flankers, this representation can be adequate to specify the stimulus with some position invariance. This provides evidence that a unified neuronal mechanism may underlie peripheral vision, ordinary pattern recognition in central vision, and texture perception. A key component of our methodology involves creating visualizations of the information available in the summary statistics of a stimulus. We call these visualizations "mongrels" and show that they are highly useful in examining how the early visual system represents the visual input. Mongrels enable one to study the "equivalence classes" of our model, i.e., the sets of stimuli that map to the same representation according to the model.

Question: What is the summary statistic representation of a stimulus?


A survey of multicore processors. General-purpose multicore processors are being accepted in all segments of the industry, including signal processing and embedded space, as the need for more performance and general-purpose programmability has grown. Parallel processing increases performance by adding more parallel resources while maintaining manageable power characteristics. The implementations of multicore processors are numerous and diverse. Designs range from conventional multiprocessor machines to designs that consist of a "sea" of programmable arithmetic logic units (ALUs). In this article, we cover some of the attributes common to all multicore processor implementations and illustrate these attributes with current and future commercial multicore designs. The characteristics we focus on are application domain, power/performance, processing elements, memory system, and accelerators/integrated peripherals.

Question: What is a multicore processor?


Stitching Web Tables for Improving Matching Quality. HTML tables on web pages ("web tables") cover a wide variety of topics. Data from web tables can thus be useful for tasks such as knowledge base completion or ad hoc table extension. Before table data can be used for these tasks, the tables must be matched to the respective knowledge base or base table. The challenges of web table matching are the high heterogeneity and the small size of the tables. Though it is known that the majority of web tables are very small, the gold standards that are used to compare web table matching systems mostly consist of larger tables. In this experimental paper, we evaluate T2K Match, a web table to knowledge base matching system, and COMA, a standard schema matching tool, using a sample of web tables that is more realistic than the gold standards that were previously used. We find that both systems fail to produce correct results for many of the very small tables in the sample. As a remedy, we propose to stitch (combine) the tables from each web site into larger ones and match these enlarged tables to the knowledge base or base table afterwards. For this stitching process, we evaluate different schema matching methods in combination with holistic correspondence refinement. Limiting the stitching procedure to web tables from the same web site decreases the heterogeneity and allows us to stitch tables with very high precision. Our experiments show that applying table stitching before running the actual matching method improves the matching results by 0.38 in F1-measure for T2K Match and by 0.14 for COMA. Also, stitching the tables allows us to reduce the amount of tables in our corpus from 5 million original web tables to as few as 100,000 stitched tables.

Question: How do you stitch web tables?


Lifetime study for a poly fuse in a 0.35 /spl mu/m polycide CMOS process. Poly fuses are used as the base element for one time programmable cells in a standard CMOS process. Using a defined programming current, the resistance of the poly fuse increases irreversibly over several orders of magnitude. The goal of this study is to show that a poly fuse has a sufficient life time stability to be used as a storage element even in high reliability circuits. This paper shows the drift of the resistance of a poly fuse over the whole range of programming currents for a standard polycide 0.35 /spl mu/m CMOS process. The poly fuse for the selected process is build using two different layers, which gives a special performance in terms of programming current.

Question: What is a poly fuse?


Data Mining Approaches for Intrusion Detection. In this paper we discuss our research in developing general and systematic methods for intrusion detection. The key ideas are to use data mining techniques to discover consistent and useful patterns of system features that describe program and user behavior, and use the set of relevant system features to compute (inductively learned) classifiers that can recognize anomalies and known intrusions. Using experiments on the s ndmailsystem call data and the network tcpdumpdata, we demonstrate that we can construct concise and accurate classifiers to detect anomalies. We provide an overview on two general data mining algorithms that we have implemented: the association rules algorithm and the frequent episodes algorithm. These algorithms can be used to compute the intraand interaudit record patterns, which are essential in describing program or user behavior. The discovered patterns can guide the audit data gathering process and facilitate feature selection. To meet the challenges of both efficient learning (mining) and real-time detection, we propose an agent-based architecture for intrusion detection systems where the learning agents continuously compute and provide the updated (detection) models to the detection agents.

Question: What is the difference between the association rules algorithm and the frequent episodes algorithm?


Data-Warehousing 3.0 - Die Rolle von Data-Warehouse-Systemen auf Basis von In-Memory Technologie. In diesem Beitrag widmen wir uns der Frage, welche Rolle aktuelle Trends der Hardund Software für Datenbanksysteme spielen, um als Enabler für neuartige Konzepte im Umfeld des Data-Warehousing zu dienen. Als zentraler Schritt der Evolution im Kontext des Data-Warehousing wird dabei die enge Kopplung zu operativen Systemen gesehen, um eine direkte Rückkopplung bzw. Einbettung in operationale Geschäftsprozesse zu realisieren. In diesem Papier diskutieren wir die Fragen, wie In-Memory-Technologie das Konzept von Echtzeit-DWH-Systemen unterstützt bzw. ermöglicht. Dazu stellen wir zum einen eine Referenzarchitektur für DWH-Systeme vor, die insbesondere pushund pullbasierte Datenversorgung berücksichtigt. Zum anderen diskutieren wir die konkrete Rolle von In-Memory-Systemen mit Blick auf konkrete Aspekte wie der Frage optionaler Persistenzschichten, Reduktion der Batchgröße, Positionierung von In-Memory-Techniken für den Aufbau eines Corporate Memorys und die schnelle Bereitstellung externer Datenbestände zur Unterstützung situativer BISzenarien.

Question: What is the role of data warehouses in the evolution of data management?


Executive Functions Predict the Success of Top-Soccer Players. While the importance of physical abilities and motor coordination is non-contested in sport, more focus has recently been turned toward cognitive processes important for different sports. However, this line of studies has often investigated sport-specific cognitive traits, while few studies have focused on general cognitive traits. We explored if measures of general executive functions can predict the success of a soccer player. The present study used standardized neuropsychological assessment tools assessing players' general executive functions including on-line multi-processing such as creativity, response inhibition, and cognitive flexibility. In a first cross-sectional part of the study we compared the results between High Division players (HD), Lower Division players (LD) and a standardized norm group. The result shows that both HD and LD players had significantly better measures of executive functions in comparison to the norm group for both men and women. Moreover, the HD players outperformed the LD players in these tests. In the second prospective part of the study, a partial correlation test showed a significant correlation between the result from the executive test and the numbers of goals and assists the players had scored two seasons later. The results from this study strongly suggest that results in cognitive function tests predict the success of ball sport players.

Question: What is the difference between a high division player and a lower division player?


Learning Distributed Representations of Texts and Entities from Knowledge Base. We describe a neural network model that jointly learns distributed representations of texts and knowledge base (KB) entities. Given a text in the KB, we train our proposed model to predict entities that are relevant to the text. Our model is designed to be generic with the ability to address various NLP tasks with ease. We train the model using a large corpus of texts and their entity annotations extracted from Wikipedia. We evaluated the model on three important NLP tasks (i.e., sentence textual similarity, entity linking, and factoid question answering) involving both unsupervised and supervised settings. As a result, we achieved state-of-the-art results on all three of these tasks. Our code and trained models are publicly available for further academic research.

Question: What is the neural network model for text and knowledge base?


Design and Control of Concentric-Tube Robots. A novel approach toward construction of robots is based on a concentric combination of precurved elastic tubes. By rotation and extension of the tubes with respect to each other, their curvatures interact elastically to position and orient the robot's tip, as well as to control the robot's shape along its length. In this approach, the flexible tubes comprise both the links and the joints of the robot. Since the actuators attach to the tubes at their proximal ends, the robot itself forms a slender curve that is well suited for minimally invasive medical procedures. This paper demonstrates the potential of this technology. Design principles are presented and a general kinematic model incorporating tube bending and torsion is derived. Experimental demonstration of real-time position control using this model is also described.

Question: What is a concentric tube robot?


Home Bias in Online Investments: An Empirical Study of an Online Crowdfunding Market. An extensive literature in economics and finance has documented " home bias, " the tendency that transactions are more likely to occur between parties in the same country or state, rather than outside. Can the Internet help overcome this spatial divide, especially in the context of online financial investments? We address this question in the context of a large online crowd funding marketplace. We analyze detailed transaction data over an extended period of time under typical market conditions, as well as those from a natural experiment, a period in which investors were restricted to only one state due to regulations. We further employ a quasi-experimental design by tracking borrowers who moved across state boundaries, and study how investors' behaviors change when those borrowers moved. Home bias appears to be a robust phenomenon under all three scenarios. This finding has important implications not just for the home bias literature, but also more broadly for the growing research and policy interest on Internet-based crowd funding, especially as a new channel for entrepreneurial financing.

Question: What is home bias?


Armadillo: An Open Source C++ Linear Algebra Library for Fast Prototyping and Computationally Intensive Experiments. In this report we provide an overview of the open source Armadillo C++ linear algebra library (matrix maths). The library aims to have a good balance between speed and ease of use, and is useful if C++ is the language of choice (due to speed and/or integration capabilities), rather than another language like Matlab or Octave. In particular, Armadillo can be used for fast prototyping and computationally intensive experiments, while at the same time allowing for relatively painless transition of research code into production environments. It is distributed under a license that is applicable in both open source and proprietary software development contexts. The library supports integer, floating point and complex numbers, as well as a subset of trigonometric and statistics functions. Various matrix decompositions are provided through optional integration with LAPACK, or one its high-performance drop-in replacements, such as MKL from Intel or ACML from AMD. A delayed evaluation approach is employed (during compile time) to combine several operations into one and reduce (or eliminate) the need for temporaries. This is accomplished through C++ template meta-programming. Performance comparisons suggest that the library is considerably faster than Matlab and Octave, as well as previous C++ libraries such as IT++ and Newmat. This report reflects a subset of the functionality present in Armadillo v2.4. Armadillo can be downloaded from: • http://arma.sourceforge.net If you use Armadillo in your research and/or software, we would appreciate a citation to this document. Please cite as: • Conrad Sanderson. Armadillo: An Open Source C++ Linear Algebra Library for Fast Prototyping and Computationally Intensive Experiments. Technical Report, NICTA, 2010. Armadillo: An Open Source C++ Linear Algebra Library NICTA Technical Report

Question: What is the difference between a matrix and a vector?


A Monte Carlo Model of Light Propagation in Tissue. The Monte Carlo method is rapidly becoming the model of choice for simulating light transport in tissue. This paper provides all the details necessary for implementation of a Monte Carlo program. Variance reduction schemes that improve the efficiency of the Monte Carlo method are discussed. Analytic expressions facilitating convolution calculations for finite flat and Gaussian beams are included. Useful validation benchmarks are presented.

Question: What is the Monte Carlo method?