Binary stirring: self-randomizing instruction addresses of legacy x86 binary code. Unlike library code, whose instruction addresses can be randomized by address space layout randomization (ASLR), application binary code often has static instruction addresses. Attackers can exploit this limitation to craft robust shell codes for such applications, as demonstrated by a recent attack that reuses instruction gadgets from the static binary code of victim applications.  This paper introduces binary stirring, a new technique that imbues x86 native code with the ability to self-randomize its instruction addresses each time it is launched. The input to STIR is only the application binary code without any source code, debug symbols, or relocation information. The output is a new binary whose basic block addresses are dynamically determined at load-time. Therefore, even if an attacker can find code gadgets in one instance of the binary, the instruction addresses in other instances are unpredictable. An array of binary transformation techniques enable STIR to transparently protect large, realistic applications that cannot be perfectly disassembled due to computed jumps, code-data interleaving, OS callbacks, dynamic linking and a variety of other difficult binary features. Evaluation of STIR for both Windows and Linux platforms shows that stirring introduces about 1.6% overhead on average to application runtimes.

Question: How to protect against binary stirring?


Path Planning Based on Bézier Curve for Autonomous Ground Vehicles. In this paper we present two path planning algorithms based on Bezier curves for autonomous vehicles with way points and corridor constraints. Bezier curves have useful properties for the path generation problem. The paper describes how the algorithms apply these properties to generate the reference trajectory for vehicles to satisfy the path constraints. Both algorithms join cubic Bezier curve segments smoothly to generate the path. Additionally, we discuss the constrained optimization problem that optimizes the resulting path for a user-defined cost function. The simulation shows the generation of successful routes for autonomous vehicles using these algorithms as well as control results for a simple kinematic vehicle. Extensions of these algorithms towards navigating through an unstructured environment with limited sensor range are discussed.

Question: How do you generate a path for an autonomous vehicle?


Analysis of modulation schemes for Bluetooth-LE module for Internet-of-Things (IoT) applications. Bluetooth transceivers have been in the active area of recent research being the key component of physical layer in the Bluetooth technology. The low power consumption of Bluetooth low energy (LE) devices compared to the conventional Bluetooth devices has enhanced its importance in Internet-of-Things (IoT) applications. Therefore, Bluetooth low energy device based solution needs expansion in the IoT network infrastructure. The transceivers in the literature and modulation schemes are compared and summarized. Energy consumption of modulation schemes in Bluetooth communication are analyzed and compared using the model presented in this work. In this approach considering both circuit and signal power consumption, optimum modulation order for minimum energy consumption has been found using numerical calculation and relation between signal to noise ratio (SNR) and channel capacity. Battery life for IoT sensors using Bluetooth LE technology as a wireless link has been analyzed considering multiple transaction times for transmitters having different power consumption. MFSK and more bandwidth-efficient GFSK are identified as low energy solution for all smart devices.

Question: What is the difference between the modulation schemes?


Discrete Content-aware Matrix Factorization. Precisely recommending relevant items from massive candidates to a large number of users is an indispensable yet computationally expensive task in many online platforms (e.g., Amazon.com and Netflix.com). A promising way is to project users and items into a Hamming space and then recommend items via Hamming distance. However, previous studies didn't address the cold-start challenges and couldn't make the best use of preference data like implicit feedback. To fill this gap, we propose a Discrete Content-aware Matrix Factorization (DCMF) model, 1) to derive compact yet informative binary codes at the presence of user/item content information; 2) to support the classification task based on a local upper bound of logit loss; 3) to introduce an interaction regularization for dealing with the sparsity issue. We further develop an efficient discrete optimization algorithm for parameter learning. Based on extensive experiments on three real-world datasets, we show that DCFM outperforms the state-of-the-arts on both regression and classification tasks.

Question: What is the hamming distance?


Multimodal recognition of personality traits in social interactions. This paper targets the automatic detection of personality traits in a meeting environment by means of audio and visual features; information about the relational context is captured by means of acoustic features designed to that purpose. Two personality traits are considered: Extraversion (from the Big Five) and the Locus of Control. The classification task is applied to thin slices of behaviour, in the form of 1-minute sequences. SVM were used to test the performances of several training and testing instance setups, including a restricted set of audio features obtained through feature selection. The outcomes improve considerably over existing results, provide evidence about the feasibility of the multimodal analysis of personality, the role of social context, and pave the way to further studies addressing different features setups and/or targeting different personality traits.

Question: What is the role of social context in the automatic detection of personality traits?


Tag suggestion and localization in user-generated videos based on social knowledge. Nowadays, almost any web site that provides means for sharing user-generated multimedia content, like Flickr, Facebook, YouTube and Vimeo, has tagging functionalities to let users annotate the material that they want to share. The tags are then used to retrieve the uploaded content, and to ease browsing and exploration of these collections, e.g. using tag clouds. However, while tagging a single image is straightforward, and sites like Flickr and Facebook allow also to tag easily portions of the uploaded photos, tagging a video sequence is more cumbersome, so that users just tend to tag the overall content of a video. Moreover, the tagging process is completely manual, and often users tend to spend as few time as possible to annotate the material, resulting in a sparse annotation of the visual content. A semi-automatic process, that helps the users to tag a video sequence would improve the quality of annotations and thus the overall user experience. While research on image tagging has received a considerable attention in the latest years, there are still very few works that address the problem of automatically assigning tags to videos, locating them temporally within the video sequence. In this paper we present a system for video tag suggestion and temporal localization based on collective knowledge and visual similarity of frames. The algorithm suggests new tags that can be associated to a given keyframe exploiting the tags associated to videos and images uploaded to social sites like YouTube and Flickr and visual features.

Question: What is the name of the algorithm?


Solid state Marx Generator using series-connected IGBTs. This paper describes a newly developed novel repetitive impulse voltage generator using a boost converter array. To solve problems such as short life time, low operating frequency, and the fixed pulse width of conventional generators, the proposed generator is designed with a boost converter array that employs series-connected capacitors and insulated gate bipolar transistors. The circuit can easily obtain a high-voltage pulse without any high-voltage direct current source and pulse transformer. Thus, the proposed circuit not only allows elimination of the expensive high-frequency transformer but also allows operation at a frequency up to several kilohertz with high reliability and longer life span. To validate the proposed circuit, two pulse generators rated at 1.8 kV, 40 A and 20 kV, 300 A are implemented and tested.

Question: What is a series-connected capacitor?


Modular switched capacitor voltage multiplier topology for pulsed power supply. Along with rapid advancement of power semiconductors, voltage multipliers have introduced new series of pulsed power generators. In this paper, based on conventional voltage multiplier and by using power electronics switches a new topology in high voltage pulsed power application is proposed. This topology is a modular circuit that can generate a high output voltage from a relatively low input voltage with fast rise time and adjustable frequency, pulse width, and voltage levels using a series connection of switched capacitor cells. A comparative analysis is carried out to show the advantages of proposed topology. Experimental and simulation results are presented to confirm the analysis.

Question: What is a voltage multiplier?


Multiclass Classification of Driver Perceived Workload Using Long Short-Term Memory based Recurrent Neural Network. Human sensing enables intelligent vehicles to provide driver-adaptive support by classifying perceived workload into multiple levels. Objective of this study is to classify driver workload associated with traffic complexity into five levels. We conducted driving experiments in systematically varied traffic complexity levels in a simulator. We recorded driver physiological signals including electrocardiography, electrodermal activity, and electroencephalography. In addition, we integrated driver performance and subjective workload measures. Deep learning based models outperform statistical machine learning methods when dealing with dynamic time-series data with variable sequence lengths. We show that our long short-term memory based recurrent neural network model can classify driver perceived-workload into five classes with an accuracy of 74.5%. Since perceived workload differ between individual drivers for the same traffic situation, our results further highlight the significance of including driver characteristics such as driving style and workload sensitivity to achieve higher classification accuracy.

Question: How to classify driver workload?


Analysis of open source Business Intelligence suites. In recent time, technology applications in different fields, especially Business Intelligence (BI) have been developed rapidly and considered to be one of the most significant uses of information technology. BI is a broad category of applications and technologies for gathering, storing, analyzing, and providing access to data to help enterprise users make better business decisions. Whereas in the past the Business Intelligence market was strictly dominated by closed source and commercial tools, the last few years were characterized by the birth of open source solutions. This represents a tremendous competitive advantage, however the choice of a suitable open source BI suite is a challenge. The present study evaluated and compared the last versions of the five main Open Source Business Intelligence suites: JasperSoft, Palo, Pentaho, SpagoBI and Vanilla.

Question: What is the best open source business intelligence suite?


Levofloxacin implants with predefined microstructure fabricated by three-dimensional printing technique.. A novel three-dimensional (3D) printing technique was utilized in the preparation of drug implants that can be designed to have complex drug release profiles. The method we describe is based on a lactic acid polymer matrix with a predefined microstructure that is amenable to rapid prototyping and fabrication. We describe how the process parameters, especially selection of the binder, were optimized. Implants containing levofloxacin (LVFX) with predefined microstructures using an optimized binder solution of ethanol and acetone (20:80, v/v) were prepared by a 3D printing process that achieved a bi-modal profile displaying both pulsatile and steady state LVFX release from a single implant. The pulse release appeared from day 5 to 25, followed by a steady state phase of 25 days. The next pulse release phase then began at the 50th day and ended at the 80th day. To evaluate the drug implants structurally and analytically, the microscopic morphologies and the in vitro release profiles of the implants fabricated by both the 3D printing technique and the conventional lost mold technique were assessed using environmental scanning electron microscopy (ESEM) and UV absorbance spectrophotometry. The results demonstrate that the 3D printing technology can be used to fabricate drug implants with sophisticated micro- and macro-architecture in a single device that may be rapidly prototyped and fabricated. We conclude that drug implants with predefined microstructure fabricated by 3D printing techniques can have clear advantages compared to implants fabricated by conventional compressing methods.

Question: What is the difference between the 3D printing technique and the conventional lost mold technique?


Bayesian network classifiers for identifying the slope of the customer lifecycle of long-life customers. Undoubtedly, Customer Relationship Management (CRM) has gained its importance through the statement that acquiring a new customer is several times more costly than retaining and selling additional products to existing customers. Consequently, marketing practitioners are currently often focusing on retaining customers for as long as possible. However, recent findings in relationship marketing literature have shown that large differences exist within the group of long-life customers in terms of spending and spending evolution. Therefore, this paper focuses on introducing a measure of a customer's future spending evolution that might improve relationship marketing decision making. In this study, from a marketing point of view, we focus on predicting whether a newly acquired customer will increase or decrease his/her future spending from initial purchase information. This is essentially a classification task. The main contribution of this study lies in comparing and evaluating several Bayesian network classifiers with statistical and other artificial intelligence techniques for the purpose of classifying customers in the binary classification problem at hand. Certain Bayesian network classifiers have been recently proposed in the artificial

Question: What is the difference between a Bayesian network classifier and a decision tree classifier?


The Second Dialog State Tracking Challenge. A spoken dialog system, while communicating with a user, must keep track of what the user wants from the system at each step. This process, termed dialog state tracking, is essential for a successful dialog system as it directly informs the system's actions. The first Dialog State Tracking Challenge allowed for evaluation of different dialog state tracking techniques, providing common testbeds and evaluation suites. This paper presents a second challenge, which continues this tradition and introduces some additional features – a new domain, changing user goals and a richer dialog state. The challenge received 31 entries from 9 research groups. The results suggest that while large improvements on a competitive baseline are possible, trackers are still prone to degradation in mismatched conditions. An investigation into ensemble learning demonstrates the most accurate tracking can be achieved by combining multiple trackers.

Question: What is the second dialog state tracking challenge?


Online movement adaptation based on previous sensor experiences. Personal robots can only become widespread if they are capable of safely operating among humans. In uncertain and highly dynamic environments such as human households, robots need to be able to instantly adapt their behavior to unforseen events. In this paper, we propose a general framework to achieve very contact-reactive motions for robotic grasping and manipulation. Associating stereotypical movements to particular tasks enables our system to use previous sensor experiences as a predictive model for subsequent task executions. We use dynamical systems, named Dynamic Movement Primitives (DMPs), to learn goal-directed behaviors from demonstration. We exploit their dynamic properties by coupling them with the measured and predicted sensor traces. This feedback loop allows for online adaptation of the movement plan. Our system can create a rich set of possible motions that account for external perturbations and perception uncertainty to generate truly robust behaviors. As an example, we present an application to grasping with the WAM robot arm.

Question: How can we adapt our movements to the environment?


Collaborative Joint Training With Multitask Recurrent Model for Speech and Speaker Recognition. Automatic speech and speaker recognition are traditionally treated as two independent tasks and are studied separately. The human brain in contrast deciphers the linguistic content, and the speaker traits from the speech in a collaborative manner. This key observation motivates the work presented in this paper. A collaborative joint training approach based on multitask recurrent neural network models is proposed, where the output of one task is backpropagated to the other tasks. This is a general framework for learning collaborative tasks and fits well with the goal of joint learning of automatic speech and speaker recognition. Through a comprehensive study, it is shown that the multitask recurrent neural net models deliver improved performance on both automatic speech and speaker recognition tasks as compared to single-task systems. The strength of such multitask collaborative learning is analyzed, and the impact of various training configurations is investigated.

Question: What is the impact of multitask learning on speech and speaker recognition?


The Weak Byzantine Generals Problem. The Byzantine Generals Problem requires processes to reach agreement upon a value even though some of them may fad. It is weakened by allowing them to agree upon an "incorrect" value if a failure occurs. The transaction eormmt problem for a distributed database Js a special case of the weaker problem. It is shown that, like the original Byzantine Generals Problem, the weak version can be solved only ff fewer than one-third of the processes may fad. Unlike the onginal problem, an approximate solution exists that can tolerate arbaranly many failures. Categories and Subject Descnptors: D.4.5 [Operating Systems]: Reliability, F.2.m [Analysis of Algorithms and Problem Complexity]: Mzscellaneous General Terms: Reliabthty Addmonal

Question: What is the weak Byzantine Generals Problem?


NOSEP: Nonoverlapping Sequence Pattern Mining With Gap Constraints. Sequence pattern mining aims to discover frequent subsequences as patterns in a single sequence or a sequence database. By combining gap constraints (or flexible wildcards), users can specify special characteristics of the patterns and discover meaningful subsequences suitable for their own application domains, such as finding gene transcription sites from DNA sequences or discovering patterns for time series data classification. Due to the inherent complexity of sequence patterns, including the exponential candidate space with respect to pattern letters and gap constraints, to date, existing sequence pattern mining methods are either incomplete or do not support the Apriori property because the support ratio of a pattern may be greater than that of its subpatterns. Most importantly, patterns discovered by these methods are either too restrictive or too general and cannot represent underlying meaningful knowledge in the sequences. In this paper, we focus on a nonoverlapping sequence pattern mining task with gap constraints, where a nonoverlapping sequence pattern allows sequence letters to be flexibly and maximally utilized for pattern discovery. A new Apriori-based nonoverlapping sequence pattern mining algorithm, NOSEP, is proposed. NOSEP is a complete pattern mining algorithm, which uses a specially designed data structure, Nettree, to calculate the exact occurrence of a pattern in the sequence. Experimental results and comparisons on biology DNA sequences, time series data, and Gazelle datasets demonstrate the efficiency of the proposed algorithm and the uniqueness of nonoverlapping sequence patterns compared to other methods.

Question: What is the difference between a sequence pattern and a subsequence?


Spotlight: Optimizing Device Placement for Training Deep Neural Networks. Training deep neural networks (DNNs) requires an increasing amount of computation resources, and it becomes typical to use a mixture of GPU and CPU devices. Due to the heterogeneity of these devices, a recent challenge is how each operation in a neural network can be optimally placed on these devices, so that the training process can take the shortest amount of time possible. The current state-of-the-art solution uses reinforcement learning based on the policy gradient method, and it suffers from suboptimal training times. In this paper, we propose Spotlight, a new reinforcement learning algorithm based on proximal policy optimization, designed specifically for finding an optimal device placement for training DNNs. The design of our new algorithm relies upon a new model of the device placement problem: by modeling it as a Markov decision process with multiple stages, we are able to prove that Spotlight achieves a theoretical guarantee on performance improvements. We have implemented Spotlight in the CIFAR-10 benchmark and deployed it on the Google Cloud platform. Extensive experiments have demonstrated that the training time with placements recommended by Spotlight is 60.9% of that recommended by the policy gradient method.

Question: What is the difference between a policy gradient method and a reinforcement learning algorithm?


Communicating Algorithmic Process in Online Behavioral Advertising. Advertisers develop algorithms to select the most relevant advertisements for users. However, the opacity of these algorithms, along with their potential for violating user privacy, has decreased user trust and preference in behavioral advertising. To mitigate this, advertisers have started to communicate algorithmic processes in behavioral advertising. However, how revealing parts of the algorithmic process affects users' perceptions towards ads and platforms is still an open question. To investigate this, we exposed 32 users to why an ad is shown to them, what advertising algorithms infer about them, and how advertisers use this information. Users preferred interpretable, non-creepy explanations about why an ad is presented, along with a recognizable link to their identity. We further found that exposing users to their algorithmically-derived attributes led to algorithm disillusionment---users found that advertising algorithms they thought were perfect were far from it. We propose design implications to effectively communicate information about advertising algorithms.

Question: How do advertisers use information about users?


Using Discriminant Eigenfeatures for Image Retrieval. |This paper describes the automatic selection of features from an image training set using the theories of multi-dimensional linear discriminant analysis and the associated optimal linear projection. We demonstrate the eeectiveness of these Most Discriminating Features for view-based class retrieval from a large database of widely varying real-world objects presented as \well-framed" views, and compare it with that of the principal component analysis.

Question: How to select features for image retrieval?


Phantom vibrations among undergraduates: Prevalence and associated psychological characteristics.

Question: What is phantom vibrations?


MentorNet: Regularizing Very Deep Neural Networks on Corrupted Labels. Recent studies have discovered that deep networks are capable of memorizing the entire data even when the labels are completely random. Since deep models are trained on big data where labels are often noisy, the ability to overfit noise can lead to poor performance. To overcome the overfitting on corrupted training data, we propose a novel technique to regularize deep networks in the data dimension. This is achieved by learning a neural network called MentorNet to supervise the training of the base network, namely, StudentNet. Our work is inspired by curriculum learning and advances the theory by learning a curriculum from data by neural networks. We demonstrate the efficacy of MentorNet on several benchmarks. Comprehensive experiments show that it is able to significantly improve the generalization performance of the state-of-the-art deep networks on corrupted training data.

Question: How to regularize deep networks on corrupted labels?


Growing a tree in the forest: constructing folksonomies by integrating structured metadata. Many social Web sites allow users to annotate the content with descriptive metadata, such as tags, and more recently to organize content hierarchically. These types of structured metadata provide valuable evidence for learning how a community organizes knowledge. For instance, we can aggregate many personal hierarchies into a common taxonomy, also known as a folksonomy, that will aid users in visualizing and browsing social content, and also to help them in organizing their own content. However, learning from social metadata presents several challenges, since it is sparse, shallow, ambiguous, noisy, and inconsistent. We describe an approach to folksonomy learning based on relational clustering, which exploits structured metadata contained in personal hierarchies. Our approach clusters similar hierarchies using their structure and tag statistics, then incrementally weaves them into a deeper, bushier tree. We study folksonomy learning using social metadata extracted from the photo-sharing site Flickr, and demonstrate that the proposed approach addresses the challenges. Moreover, comparing to previous work, the approach produces larger, more accurate folksonomies, and in addition, scales better.

Question: How do you learn from folksonomies?


Simulation of Absolute Amplitudes of Ultrasound Signals Using Equivalent Circuits. Equivalent circuits for piezoelectric devices and ultrasonic transmission media can be used to cosimulate electronics and ultrasound parts in simulators originally intended for electronics. To achieve efficient system- level optimization, it is important to simulate correct, absolute amplitude of the ultrasound signal in the system, as this determines the requirements on the electronics regarding dynamic range, circuit noise, and power consumption. This paper presents methods to achieve correct, absolute amplitude of an ultrasound signal in a simulation of a pulse-echo system using equivalent circuits. This is achieved by taking into consideration loss due to diffraction and the effect of the cable that connects the electronics and the piezoelectric transducer. The conductive loss in the transmission line that models the propagation media of the ultrasound pulse is used to model the loss due to diffraction. Results show that the simulated amplitude of the echo follows measured values well in both near and far fields, with an offset of about 10%. The use of a coaxial cable introduces inductance and capacitance that affect the amplitude of a received echo. Amplitude variations of 60% were observed when the cable length was varied between 0.07 m and 2.3 m, with simulations predicting similar variations. The high precision in the achieved results show that electronic design and system optimization can rely on system simulations alone. This will simplify the development of integrated electronics aimed at ultrasound systems.

Question: How to simulate the absolute amplitude of an ultrasound signal?


An Evaluation of Techniques for Grabbing and Manipulating Remote Objects in Immersive Virtual Environments. Grabbing and manipulating virtual objects is an important user interaction for immersive virtual environments. We present implementations and discussion of six techniques which allow manipulation of remote objects. A user study of these techniques was performed which revealed their characteristics and deficiencies, and led to the development of a new class of techniques. These hybrid techniques provide istinct advantages in terms of ease of use and efficiency because they consider the tasks of grabbing and manipulation separately. CR Categories and Subject Descr iptors: I.3.7 [Computer Graphics]:Three-Dimensional Graphics and Realism Virtual Reality; I.3.6 [Computer Graphics]:Methodology and Techniques Interaction Techniques.

Question: What is the difference between a virtual reality and a virtual environment?


Real time face recognition engine using compact features for electronics key. In this research, a design and implementation of real-time face recognition engine using compact features vector extracted by linear binary pattern (LBP) and zoned discrete cosine transforms (DCT) analysis is proposed for electronics key. The function of LBP is to normalize the lighting variations of the input face image and the function of zoned DCT is to define the local descriptors of the face image. In order to get more compact features vector, the predictive LDA is employed for dimensional reduction. The aims of this research is to develop fast and strong face recognition that can be implemented for electronic key which will be implemented for substituting current security system (PIN and password). In addition, the recognition engine is also designed for real time face recognition which can work on hardware having limited resources such as Intel atom computer, raspberry pi, and android smart phone. The experimental results show that the proposed engine provide high enough recognition rate, and small false rejection rate (FRR) and false acceptance rate (FAR). In addition, the engine needs short processing time.

Question: What is the function of LBP?


IMM object tracking for high dynamic driving maneuvers. Classical object tracking approaches use a Kalman-filter with a single dynamic model which is therefore optimised to a single driving maneuver. In contrast the interacting multiple model (IMM) filter allows for several parallel models which are combined to a weighted estimate. Choosing models for different driving modes, such as constant speed, acceleration and strong acceleration changes, the object state estimation can be optimised for highly dynamic driving maneuvers. The paper describes the analysis of Stop&Go situations and the systematic parametrisation of the IMM method based on these statistics. The evaluation of the IMM approach is presented based on real sensor measurements of laser scanners, a radar and a video image processing unit.

Question: What is the difference between a Kalman filter and an interacting multiple model filter?


A Comparison of learning algorithms on the Arcade Learning Environment. Reinforcement learning agents have traditionally been evaluated on small toy problems. With advances in computing power and the advent of the Arcade Learning Environment, it is now possible to evaluate algorithms on diverse and difficult problems within a consistent framework. We discuss some challenges posed by the arcade learning environment which do not manifest in simpler environments. We then provide a comparison of model-free, linear learning algorithms on this challenging problem set.

Question: What is the arcade learning environment?


Cost-effective low-loss flexible optical engine with microlens-imprinted film for high-speed on-board optical interconnection. There is a strong demand for optical interconnection technology to overcome bandwidth bottlenecks in high-end server systems. The interconnection speed in present systems is approaching 10 Gb/s, and higher-speed interconnections over 25 Gb/s are being discussed. To achieve such optical interconnections in commercial production, it is necessary to develop lower-cost and higher-speed optical transceiver modules. We propose a flexible printed circuit optical engine (FPC-OE) with a microlens-imprinted film and a polymer waveguide to achieve low-cost and high-speed operation. The microlens-imprinted film can be produced at low cost by using nanoimprint technology and can drastically reduce the optical loss of the FPC-OE with polymer waveguide. We successfully demonstrated error-free operation at 25 Gb/s with the fabricated optical transceiver that contains an FPC-OE, microlens-imprinted film, and a polymer waveguide.

Question: What is the cost of a microlens-imprinted film?


Recurrent Neural Network Regularization. We present a simple regularization technique for Recurrent Neural Networks (RNNs) with Long Short-Term Memory (LSTM) units. Dropout, the most successful technique for regularizing neural networks, does not work well with RNNs and LSTMs. In this paper, we show how to correctly apply dropout to LSTMs, and show that it substantially reduces overfitting on a variety of tasks. These tasks include language modeling, speech recognition, and machine translation.

Question: How to apply dropout to recurrent neural networks?


Question: What is the Canadian Armed Forces?


Power Budgets for CubeSat Radios to Support Ground Communications and Inter-Satellite Links. CubeSats are a class of pico-satellites that have emerged over the past decade as a cost-effective alternative to the traditional large satellites to provide space experimentation capabilities to universities and other types of small enterprises, which otherwise would be unable to carry them out due to cost constraints. An important consideration when planning CubeSat missions is the power budget required by the radio communication subsystem, which enables a CubeSat to exchange information with ground stations and/or other CubeSats in orbit. The power that a CubeSat can dedicate to the communication subsystem is limited by the hard constraints on the total power available, which are due to its small size and light weight that limit the dimensions of the CubeSat power supply elements (batteries and solar panels). To date, no formal studies of the communications power budget for CubeSats are available in the literature, and this paper presents a detailed power budget analysis that includes communications with ground stations as well as with other CubeSats. For ground station communications, we outline how the orbital parameters of the CubeSat trajectory determine the distance of the ground station link and present power budgets for both uplink and downlink that include achievable data rates and link margins. For inter-satellite communications, we study how the slant range determines power requirements and affects the achievable data rates and link margins.

Question: What is the power budget for a CubeSat?


Identifying technological competition trends for R&D planning using dynamic patent maps: SAO-based content analysis. Patent maps showing competition trends in technological development can provide valuable input for decision support on research and development (R&D) strategies. By introducing semantic patent analysis with advantages in representing technological objectives and structures, this paper constructs dynamic patent maps to show technological competition trends and describes the strategic functions of the dynamic maps. The proposed maps are based on subject-action-object (SAO) structures that are syntactically ordered sentences extracted using the natural language processing of the patent text; the structures of a patent encode the key findings of the invention and expertise of its inventors. Therefore, this paper introduces a method of constructing dynamic patent maps using SAO-based content analysis of patents and presents several types of dynamic patent maps by combining patent bibliographic information and patent mapping and clustering techniques. Building on the maps, this paper provides further analyses to identify technological areas in which patents have not been granted ("patent vacuums"), areas in which many patents have actively appeared ("technological hot spots"), R&D overlap of technological competitors, and characteristics of patent clusters. The proposed analyses of dynamic patent maps are illustrated using patents related to the synthesis of carbon nanotubes. We expect that the proposed method will aid experts in understanding technological competition trends in the process of formulating R&D strategies.

Question: How can we identify technological competition trends in R&D planning using dynamic patent maps?


Efficient Discovery of Ontology Functional Dependencies. Functional Dependencies (FDs) define attribute relationships based on syntactic equality, and, when used in data cleaning, they erroneously label syntactically different but semantically equivalent values as errors. We enhance dependency-based data cleaning with Ontology Functional Dependencies (OFDs), which express semantic attribute relationships such as synonyms and is-a hierarchies defined by an ontology. Our technical contributions are twofold: 1) theoretical foundations for OFDs, including a set of sound and complete axioms and a linear-time inference procedure, and 2) an algorithm for discovering OFDs (exact ones and ones that hold with some exceptions) from data that uses the axioms to prune the exponential search space in the number of attributes. We demonstrate the efficiency of our techniques on real datasets, and we show that OFDs can significantly reduce the number of false positive errors in data cleaning techniques that rely on traditional FDs.

Question: What is the difference between a functional dependency and an ontology functional dependency?


Digital photography with flash and no-flash image pairs. Digital photography has made it possible to quickly and easily take a pair of images of low-light environments: one with flash to capture detail and one without flash to capture ambient illumination. We present a variety of applications that analyze and combine the strengths of such flash/no-flash image pairs. Our applications include denoising and detail transfer (to merge the ambient qualities of the no-flash image with the high-frequency flash detail), white-balancing (to change the color tone of the ambient image), continuous flash (to interactively adjust flash intensity), and red-eye removal (to repair artifacts in the flash image). We demonstrate how these applications can synthesize new images that are of higher quality than either of the originals.

Question: How to combine two images?


Crowdfunding Success Factors: The Characteristics of Successfully Funded Projects on Crowdfunding Platforms. Crowdfunding platforms offer promising opportunities for project founders to publish their project ideas and to collect money in order to be able to realize them. Consequently, the question of what influences the successful funding of projects, i.e., reaching the target amount of money, is very important. Building upon media richness theory and the concept of reciprocity, we extend previous research in the field of crowdfunding success factors. We provide a comprehensive view on factors influencing crowdfunding success by both focusing on project-specific as well as founder-specific aspects. Analyzing a sample of projects of the crowdfunding platform kickstarter.com, we find that the project description, related images and videos as well as the question of whether the founder has previously backed other projects influence funding success. Interestingly, the question of whether the founder has previously created other projects has no significant influence. Our results are of high interest for the stakeholders on crowdfunding platforms.

Question: What are the characteristics of successfully funded projects on crowdfunding platforms?


Differential Mode Input Filter Design for a Three-Phase Buck-Type PWM Rectifier Based on Modeling of the EMC Test Receiver. For a three-phase buck-type pulsewidth modulation rectifier input stage of a high-power telecommunications power supply module, a differential-mode (DM) electromagnetic compatibility (EMC) filter is designed for compliance to CISPR 22 Class B in the frequency range of 150 kHz-30 MHz. The design is based on a harmonic analysis of the rectifier input current and a mathematical model of the measurement procedure including the line impedance stabilization network (LISN) and the test receiver. Guidelines for a successful filter design are given, and components for a 5-kW rectifier prototype are selected. Furthermore, formulas for the estimation of the quasi-peak detector output based on the LISN output voltage spectrum are provided. The damping of filter resonances is optimized for a given attenuation in order to facilitate a higher stability margin for system control. Furthermore, the dependence of the filter input and output impedances and the attenuation characteristic on the inner mains impedance are discussed. As experimentally verified by using a three-phase common-/Differential-Mode separator, this procedure allows accurate prediction of the converter DM conducted emission levels and therefore could be employed in the design process of the rectifier system to ensure compliance to relevant EMC standards

Question: How to design a differential mode input filter for a three-phase buck-type pulsewidth modulation rectifier?


An anatomically-constrained local deformation model for monocular face capture. We present a new anatomically-constrained local face model and fitting approach for tracking 3D faces from 2D motion data in very high quality. In contrast to traditional global face models, often built from a large set of blendshapes, we propose a local deformation model composed of many small subspaces spatially distributed over the face. Our local model offers far more flexibility and expressiveness than global blendshape models, even with a much smaller model size. This flexibility would typically come at the cost of reduced robustness, in particular during the under-constrained task of monocular reconstruction. However, a key contribution of this work is that we consider the face anatomy and introduce subspace skin thickness constraints into our model, which constrain the face to only valid expressions and helps counteract depth ambiguities in monocular tracking. Given our new model, we present a novel fitting optimization that allows 3D facial performance reconstruction from a single view at extremely high quality, far beyond previous fitting approaches. Our model is flexible, and can be applied also when only sparse motion data is available, for example with marker-based motion capture or even face posing from artistic sketches. Furthermore, by incorporating anatomical constraints we can automatically estimate the rigid motion of the skull, obtaining a rigid stabilization of the performance for free. We demonstrate our model and single-view fitting method on a number of examples, including, for the first time, extreme local skin deformation caused by external forces such as wind, captured from a single high-speed camera.

Question: What is the rigid stabilization of the performance for free?


Facial Expression Recognition From Image Sequence Based on LBP and Taylor Expansion. The aim of an automatic video-based facial expression recognition system is to detect and classify human facial expressions from image sequence. An integrated automatic system often involves two components: 1) peak expression frame detection and 2) expression feature extraction. In comparison with the image-based expression recognition system, the video-based recognition system often performs online detection, which prefers low-dimensional feature representation for cost-effectiveness. Moreover, effective feature extraction is needed for classification. Many recent recognition systems often incorporate rich additional subjective information and thus become less efficient for real-time application. In our facial expression recognition system, first, we propose the double local binary pattern (DLBP) to detect the peak expression frame from the video. The proposed DLBP method has a much lower-dimensional size and can successfully reduce detection time. Besides, to handle the illumination variations in LBP, logarithm-laplace (LL) domain is further proposed to get a more robust facial feature for detection. Finally, the Taylor expansion theorem is employed in our system for the first time to extract facial expression feature. We propose the Taylor feature pattern (TFP) based on the LBP and Taylor expansion to obtain an effective facial feature from the Taylor feature map. Experimental results on the JAFFE and Cohn-Kanade data sets show that the proposed TFP method outperforms some state-of-the-art LBP-based feature extraction methods for facial expression feature extraction and can be suited for real-time applications.

Question: Facial expression recognition from image sequence based on LBP and Taylor expansion


Handwriting instruction in elementary schools.. OBJECTIVE Classroom teachers teach handwriting, but when problems arise, students are referred to occupational therapy for remediation. This study, conducted by occupational therapists, reviews handwriting instruction by classroom teachers in one school district.   METHOD Teachers from kindergarten through grade 6 were asked to complete an open-ended questionnaire regarding handwriting instruction.   RESULTS Teachers differed in their methods of instruction, including in the programs and paper used, and practice provided. Teachers of grades 5 and 6 had to continue to review handwriting instruction, because all students could not fluently use handwriting as a tool of expression.   CONCLUSION Elementary students need structured instruction to develop the motor skill of writing. School-based occupational therapists can support effective handwriting instruction by interpreting information from motor learning theory pertaining to instruction and practice, which supports acquisition, transfer, and retention of handwriting skills. They also need to be cognizant of prior handwriting instruction when addressing handwriting difficulties.

Question: What is the difference between a teacher and an occupational therapist?


Machine morality: bottom-up and top-down approaches for modelling human moral faculties. The implementation of moral decision making abilities in artificial intelligence (AI) is a natural and necessary extension to the social mechanisms of autonomous software agents and robots. Engineers exploring design strategies for systems sensitive to moral considerations in their choices and actions will need to determine what role ethical theory should play in defining control architectures for such systems. The architectures for morally intelligent agents fall within two broad approaches: the top-down imposition of ethical theories, and the bottom-up building of systems that aim at goals or standards which may or may not be specified in explicitly theoretical terms. In this paper we wish to provide some direction for continued research by outlining the value and limitations inherent in each of these approaches.

Question: What is the difference between top-down and bottom-up approaches?


A Domain Model for the Internet of Things. By bringing together the physical world of real objects with the virtual world of IT systems, the Internet of Things has the potential to significantly change both the enterprise world as well as society. However, the term is very much hyped and understood differently by different communities, especially because IoT is not a technology as such but represents the convergence of heterogeneous - often new - technologies pertaining to different engineering domains. What is needed in order to come to a common understanding is a domain model for the Internet of Things, defining the main concepts and their relationships, and serving as a common lexicon and taxonomy and thus as a basis for further scientific discourse and development of the Internet of Things. As we show, having such a domain model is also helpful in design of concrete IoT system architectures, as it provides a template and thus structures the analysis of use cases.

Question: What is the domain model for the Internet of Things?


A general design formula of multi-section power divider based on singly terminated filter design theory. A novel design formula of multi-section power divider is derived to obtain wide isolation performance. The derived design formula is based on the singly terminated filter design theory. This paper presents several simulation and experimental results of multi section power divider to show validity of the proposed design formula. Experiments show excellent performance of multi section power divider with multi-octave isolation characteristic.

Question: What is the formula for a power divider?


H.264/AVC over IP. H.264 is the ITU-T's new, nonbackward compatible video compression Recommendation that significantly outperforms all previous video compression standards. It consists of a video coding layer (VCL) which performs all the classic signal processing tasks and generates bit strings containing coded macroblocks, and a network adaptation layer (NAL) which adapts those bit strings in a network friendly way. The paper describes the use of H.264 coded video over best-effort IP networks, using RTP as the real-time transport protocol. After the description of the environment, the error-resilience tools of H.264 and the draft specification of the RTP payload format are introduced. Next the performance of several possible VCLand NAL-based error-resilience tools of H.264 are verified in simulations.

Question: What is the ITU-T's new, nonbackward compatible video compression Recommendation?


Self-Assembling Machine. This letter describes dynamic self-assembly of two-component rotors floating at the interface between liquid and air into simple, reconfigurable mechanical systems ~''machines''!. The rotors are powered by an external, rotating magnetic field, and their positions within the interface are controlled by:~i! repulsive hydrodynamic interactions between them and ~ii ! by localized magnetic fields produced by an array of small electromagnets located below the plane of the interface. The mechanical functions of the machines depend on the spatiotemporal sequence of activation of the electromagnets. ©2004 American Institute of Physics. @DOI: 10.1063/1.1664019 #

Question: What is a self-assembling machine?


A zigbee-based home automation system. In recent years, the home environment has seen a rapid introduction of network enabled digital technology. This technology offers new and exciting opportunities to increase the connectivity of devices within the home for the purpose of home automation. Moreover, with the rapid expansion of the Internet, there is the added potential for the remote control and monitoring of such network enabled devices. However, the adoption of home automation systems has been slow. This paper identifies the reasons for this slow adoption and evaluates the potential of ZigBee for addressing these problems through the design and implementation of a flexible home automation architecture. A ZigBee based home automation system and Wi-Fi network are integrated through a common home gateway. The home gateway provides network interoperability, a simple and flexible user interface, and remote access to the system. A dedicated virtual home is implemented to cater for the system's security and safety needs. To demonstrate the feasibility and effectiveness of the proposed system, four devices, a light switch, radiator valve, safety sensor and ZigBee remote control have been developed and evaluated with the home automation system.

Question: What is a zigbee-based home automation system?


Research of Workflow Access Control Strategy based on Trust. The traditional workflow access control strategy has often found to be inadequate to detect and restrain malicious behavior effectively. With the aim to solve this problem, this paper presents a new workflow access control model based on trust, and a new access control strategy with an authorization process. This strategy introduces user behavior evaluation, trust computation and role hierarchy into role access control strategy. Through the trust computation of user behavior, it can dynamically adjust user's role and permissions, realizing the dynamic authorization process. Theory analysis and simulation experiments show that this access control strategy is more sensitive in dynamic authorization, and it has fine-grained trust computation. Also this strategy can detect malicious behaviors in time, effectively restraining malicious behavior harming the system so enhancing the security of the system.

Question: What is the workflow access control strategy based on trust?


Match makers and deal breakers: analyses of assortative mating in newlywed couples.. We conducted a comprehensive analysis of assortative mating (i.e., the similarity between wives and husbands on a given characteristic) in a newlywed sample. These newlyweds showed (a) strong similarity in age, religiousness, and political orientation; (b) moderate similarity in education and verbal intelligence; (c) modest similarity in values; and (d) little similarity in matrix reasoning, self- and spouse-rated personality, emotional experience and expression, and attachment. Further analyses established that similarity was not simply due to background variables such as age and education and reflected initial assortment (i.e., similarity at the time of marriage) rather than convergence (i.e., increasing similarity with time). Finally, marital satisfaction primarily was a function of the rater's own traits and showed little relation to spousal similarity.

Question: What is assortative mating?


Hand grasp and motion for intent expression in mid-air virtual pottery. We describe the design and evaluation of a geometric interaction technique for bare-hand mid-air virtual pottery. We model the shaping of a pot as a gradual and progressive convergence of the potprofile to the shape of the user's hand represented as a point-cloud (PCL). Our pottery-inspired application served as a platform for systematically revealing how users use their hands to express the intent of deformation during a pot shaping process. Through our approach, we address two specific problems: (a) determining start and end of deformation without explicit clutching and declutching, and (b) identifying user's intent by characterizing grasp and motion of the hand on the pot. We evaluated our approach's performance in terms of intent classification, users' behavior, and users' perception of controllability. We found that the expressive capability of hand articulation can be effectively harnessed for controllable shaping by organizing the deformation process in broad classes of intended operations such as pulling, pushing and fairing. After minimal practice with the pottery application, users could figure out their own strategy for reaching, grasping and deforming the pot. Further, the use of PCL as mid-air input allows for using common physical objects as tools for pot deformation. Users particularly enjoyed this aspect of our method for shaping pots.

Question: How can we use a pot to express intent?


Defining Creativity: Finding Keywords for Creativity Using Corpus Linguistics Techniques. A computational system that evaluates creativity needs guidance on what creativity actually is. It is by no means straightforward to provide a computer with a formal definition of creativity; no such definition yet exists and viewpoints in creativity literature vary as to what the key components of creativity are considered to be. This work combines several viewpoints for a more general consensus of how we define creativity, using a corpus linguistics approach. 30 academic papers from various academic disciplines were analysed to extract the most frequently used words and their frequencies in the papers. This data was statistically compared with general word usage in written English. The results form a list of words that are significantly more likely to appear when talking about creativity in academic texts. Such words can be considered keywords for creativity, guiding us in uncovering key sub-components of creativity which can be used for computational assessment of creativity.

Question: What is a corpus linguistics approach?


Two decades of terror management theory: a meta-analysis of mortality salience research.. A meta-analysis was conducted on empirical trials investigating the mortality salience (MS) hypothesis of terror management theory (TMT). TMT postulates that investment in cultural worldviews and self-esteem serves to buffer the potential for death anxiety; the MS hypothesis states that, as a consequence, accessibility of death-related thought (MS) should instigate increased worldview and self-esteem defense and striving. Overall, 164 articles with 277 experiments were included. MS yielded moderate effects (r = .35) on a range of worldview- and self-esteem-related dependent variables (DVs), with effects increased for experiments using (a) American participants, (b) college students, (c) a longer delay between MS and the DV, and (d) people-related attitudes as the DV. Gender and self-esteem may moderate MS effects differently than previously thought. Results are compared to other reviews and examined with regard to alternative explanations of TMT. Finally, suggestions for future research are offered.

Question: What is the mortality salience hypothesis of terror management theory?


A Survey of Logical Models for OLAP Databases. In this paper, we present different proposals for multidimensional data cubes, which are the basic logical model for OLAP applications. We have grouped the work in the field in two categories: commercial tools (presented along with terminology and standards) and academic efforts. We further divide the academic efforts in two subcategories: the relational model extensions and the cube-oriented approaches. Finally, we attempt a comparative analysis of the various efforts.

Question: What is the difference between the relational model extensions and the cube-oriented approaches?


Balance equilibrium manifold and control of rider-bikebot systems. Postural balance control of machines is one of the most important human motor skills. We present a balance equilibrium manifold (BEM) concept to study how a human rider balances a bicycle-like robot (i.e., bikebot) while maintaining tracking a desired trajectory. The BEM is built on the external-internal convertible (EIC) structure of the rider-bikebot dynamics to capture the balance properties of the rider-bikebot systems. We analyze the contribution of the upper-body movements and the steering inputs to the task of balance control of the systems. The results reveal that steering actuation is more effective than upper-body movement for balance task. A performance metric is also introduced to quantify the balance motor skills using the BEM. Extensive experiments are conducted to validate and demonstrate the analyses and the proposed balance skill metrics.

Question: How do you balance a bikebot?


Keyword Search in Spatial Databases: Towards Searching by Document. This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive information represented in the form of keywords. The mCK query aims to find the spatially closest tuples which match m user-specified keywords. Given a set of keywords from a document, mCK query can be very useful in geotagging the document by comparing the keywords to other geotagged documents in a database. To answer mCK queries efficiently, we introduce a new index called the bR*-tree, which is an extension of the R*-tree. Based on bR*-tree, we exploit a priori-based search strategies to effectively reduce the search space. We also propose two monotone constraints, namely the distance mutex and keyword mutex, as our a priori properties to facilitate effective pruning. Our performance study demonstrates that our search strategy is indeed efficient in reducing query response time and demonstrates remarkable scalability in terms of the number of query keywords which is essential for our main application of searching by document.

Question: What is the m-closest keywords query?


Finite-time Analysis of the Multiarmed Bandit Problem. Reinforcement learning policies face the exploration versus exploitation dilemma, i.e. the search for a balance between exploring the environment to find profitable actions while taking the empirically best action as often as possible. A popular measure of a policy's success in addressing this dilemma is the regret, that is the loss due to the fact that the globally optimal policy is not followed all the times. One of the simplest examples of the exploration/exploitation dilemma is the multi-armed bandit problem. Lai and Robbins were the first ones to show that the regret for this problem has to grow at least logarithmically in the number of plays. Since then, policies which asymptotically achieve this regret have been devised by Lai and Robbins and many others. In this work we show that the optimal logarithmic regret is also achievable uniformly over time, with simple and efficient policies, and for all reward distributions with bounded support.

Question: What is the multi-armed bandit problem?


Path Integral Networks: End-to-End Differentiable Optimal Control. In this paper, we introduce Path Integral Networks (PI-Net), a recurrent network representation of the Path Integral optimal control algorithm. The network includes both system dynamics and cost models, used for optimal control based planning. PI-Net is fully differentiable, learning both dynamics and cost models end-to-end by back-propagation and stochastic gradient descent. Because of this, PI-Net can learn to plan. PI-Net has several advantages: it can generalize to unseen states thanks to planning, it can be applied to continuous control tasks, and it allows for a wide variety learning schemes, including imitation and reinforcement learning. Preliminary experiment results show that PI-Net, trained by imitation learning, can mimic control demonstrations for two simulated problems; a linear system and a pendulum swing-up problem. We also show that PI-Net is able to learn dynamics and cost models latent in the demonstrations.

Question: What is the path integral networks?


Survey on data science with population-based algorithms. This paper discusses the relationship between data science and population-based algorithms, which include swarm intelligence and evolutionary algorithms. We reviewed two categories of literature, which include population-based algorithms solving data analysis problem and utilizing data analysis methods in population-based algorithms. With the exponential increment of data, the data science, or more specifically, the big data analytics has gained increasing attention among researchers. New and more efficient algorithms should be designed to handle this massive data problem. Based on the combination of population-based algorithms and data mining techniques, we understand better the insights of data analytics, and design more efficient algorithms to solve real-world big data analytics problems. Also, the weakness and strength of population-based algorithms could be analyzed via the data analytics along the optimization process, a crucial entity in population-based algorithms.

Question: What is the relationship between data science and population-based algorithms?


A generalized iterative LQG method for locally-optimal feedback control of constrained nonlinear stochastic systems. We present an iterative linear-quadratic-Gaussian method for locally-optimal feedback control of nonlinear stochastic systems subject to control constraints. Previously, similar methods have been restricted to deterministic unconstrained problems with quadratic costs. The new method constructs an affine feedback control law, obtained by minimizing a novel quadratic approximation to the optimal cost-to-go function. Global convergence is guaranteed through a Levenberg-Marquardt method; convergence in the vicinity of a local minimum is quadratic. Performance is illustrated on a limited-torque inverted pendulum problem, as well as a complex biomechanical control problem involving a stochastic model of the human arm, with 10 state dimensions and 6 muscle actuators. A Matlab implementation of the new algorithm is availabe at www.cogsci.ucsd.edu//spl sim/todorov.

Question: What is a generalized iterative LQG method for locally-optimal feedback control of constrained nonlinear stochastic systems?


Potentials and limits of high-speed PM motors. This paper illustrates potentials and limits of high-speed permanent-magnet (PM) motors. The influence of materials chosen for PM, stator core, and retaining sleeve is highlighted. Slotted and slotless topologies are considered and compared, computing magnetic, electrical, mechanical, and thermal quantities by means of both analytical and finite-element approach. Thermal and PM demagnetization limits as well as rotor losses are evaluated. A criteria of optimization of the motor structure is described, with the diameter ratio and the iron flux density as main design variables.

Question: What is the diameter ratio?


A master-slave blockchain paradigm and application in digital rights management. Upon flaws of current blockchain platforms of heavyweight, large capacity of ledger, and time-consuming of synchronization of data, in this paper, we proposed a new paradigm of master-slave blockchain scheme (MSB) for pervasive computing that suitable for general PC, mobile device such as smart phones or PADs to participants in the working of mining and verification, in which we separated traditional blockchain model in 2 layer defined as master node layer and a series of slavery agents layer, then we proposed 2 approaches for partially computing model(P-CM) and non-computing of model(NCM) in the MSB blockchain, Finally large amounts of simulations manifest the proposed master-slave blockchain scheme is feasible, extendible and suitable for pervasive computing especially in the 5G generation environment, and can apply in the DRM-related applications.

Question: What is a blockchain?


Machine-Learning Research Four Current Directions. Machine Learning research has been making great progress in many directions This article summarizes four of these directions and discusses some current open problems The four directions are a improving classi cation accuracy by learning ensembles of classi ers b methods for scaling up supervised learning algorithms c reinforcement learning and d learning complex stochastic models

Question: What are the four directions of machine learning research?


The Impact of Information Communication and Technology on Students ' Academic Performance : Evidence from Indonesian EFL Classrooms. The present study examined the impact of Information Communication Technology [ICT] on a group of university students' academic performance in an Indonesian English as a Foreign Language (EFL) classroom. As the platform of the ICT usage in this current study, English learning websites was used as the independent variable. Academic performance (students' score on pre and post test) was used the dependent variable. The participants in the study were 60 students of the Department of Public Health at the State University of Gorontalo, Indonesia, i.e an experimental group of 30 students (n=30) and a control group of 30 students (n=30). They took English courses as one of the compulsory subjects in the university curriculum. This study used a mixed method of a quasi-experimental and a qualitative interview approaches. Based on the result of the quantitative method of data collection, ttests of this study indicated that students in the experiment group performed significantly better than the students in the control group. Test results also showed that there was a significant difference between students' score on the preand post-test. The students' score in the post test and post test in the control group, however, were not significantly different. As interview results showed, participants expressed their positive learning experience with technologies, growing motivation in English learning, and positive feeling and confidence on their language performance.

Question: What is the impact of information communication and technology on students' academic performance?


Metrics for Quality Assurance of Web Based Applications. Web-Commerce applications are now an indispensable aspect of businesses around the world. More businesses are now migrating from outdated applications to a new type of combined e-business designs. With such large volumes of applications that need to be put online, there is now a dire need for measurable and quantifiable metrics that can help in gauging the quality of these websites. The development considerations for both domains may be deemed similar in their final purpose, that is to provide a service to its end-users, however, web-applications today face a myriad of constraints, with most businesses opting to go online, the crucial questions are; Is the Web info metrics are any different, or is it just an application of classical metrics (desktop metrics) to a new medium (web metrics). In our research, we propose to investigate these issues, and present the distinguishable metrics for the Quality Assurance(QA) processes involved in Web-Applications, as opposed to traditional desktop software application. We will also be scrutinizing the major problem that has been persistent in QA related to web applications; the lack of standards, and development models for the web applications.

Question: What are the metrics for quality assurance of web based applications?


Cellular and molecular mechanisms of hepatocellular carcinoma: an update. Hepatocellular carcinoma (HCC) is the most common primary malignant tumor that accounts for ~80 % of all liver cancer cases worldwide. It is a multifactorial disease caused by a variety of risk factors and often develops in the background of underlying cirrhosis. A number of cellular phenomena, such as tumor microenvironment, inflammation, oxidative stress, and hypoxia act in concert with various molecular events to facilitate tumor initiation, progression, and metastasis. The emergence of microRNAs and molecular-targeted therapies adds a new dimension in our efforts to combat this deadly disease. Intense research in this multitude of areas has led to significant progress in our understanding of cellular processes and molecular mechanisms that occur during multistage events that lead to hepatocarcinogenesis. In this review, we discuss the current knowledge of HCC, focusing mainly on advances that have occurred during the past 5 years and on the development of novel therapeutics for liver cancer.

Question: What is the most common primary malignant tumor that accounts for ~80 % of all liver cancer cases worldwide?


Printed Meandering Probe-Fed Circularly Polarized Patch Antenna With Wide Bandwidth. In this letter, a wideband compact circularly polarized (CP) patch antenna is proposed. This patch antenna consists of a printed meandering probe (M-probe) and truncated patches that excite orthogonal resonant modes to generate a wideband CP operation. The stacked patch is employed to further improve the axial-ratio (AR) bandwidth to fit the 5G Wi-Fi application. The proposed antenna achieves 42.3% impedance bandwidth and 16.8% AR bandwidth, respectively. The average gain within the AR bandwidth is 6.6 dBic with less than 0.5 dB variation. This work demonstrates a bandwidth broadening technique of an M-probe fed CP patch antenna. It is the first study to investigate and exhibit the M-probe could also provide the wideband characteristics in the dielectric loaded patch antenna. The potential applications of the antenna are 5G Wi-Fi and satellite communication systems.

Question: What is the difference between a meandering probe and a truncated patch?


Deep learning in neural networks: An overview. In recent years, deep artificial neural networks (including recurrent ones) have won numerous contests in pattern recognition and machine learning. This historical survey compactly summarizes relevant work, much of it from the previous millennium. Shallow and Deep Learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects. I review deep supervised learning (also recapitulating the history of backpropagation), unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.

Question: What is the history of deep learning?


Navigation of an omni-directional mobile robot with active caster wheels. This work deals with navigation of an omni-directional mobile robot with active caster wheels. Initially, the posture of the omni-directional mobile robot is calculated by using the odometry information. Next, the position accuracy of the mobile robot is measured through comparison of the odometry information and the external sensor measurement. Finally, for successful navigation of the mobile robot, a motion planning algorithm that employs kinematic redundancy resolution method is proposed. Through experiments for multiple obstacles and multiple moving obstacles, the feasibility of the proposed navigation algorithm was verified.

Question: How to navigate an omni-directional mobile robot with active caster wheels?


Probability Estimates for Multi-class Classification by Pairwise Coupling. Pairwise coupling is a popular multi-class classification method that combines together all pairwise comparisons for each pair of classes. This paper presents two approaches for obtaining class probabilities. Both methods can be reduced to linear systems and are easy to implement. We show conceptually and experimentally that the proposed approaches are more stable than two existing popular methods: voting and [3].

Question: What is a multi-class classification?


Survival Analysis Part I: Basic concepts and first analyses. In many cancer studies, the main outcome under assessment is the time to an event of interest. The generic name for the time is survival time, although it may be applied to the time 'survived' from complete remission to relapse or progression as equally as to the time from diagnosis to death. If the event occurred in all individuals, many methods of analysis would be applicable. However, it is usual that at the end of follow-up some of the individuals have not had the event of interest, and thus their true time to event is unknown. Further, survival data are rarely Normally distributed, but are skewed and comprise typically of many early events and relatively few late ones. It is these features of the data that make the special methods called survival analysis necessary. This paper is the first of a series of four articles that aim to introduce and explain the basic concepts of survival analysis. Most survival analyses in cancer journals use some or all of Kaplan– Meier (KM) plots, logrank tests, and Cox (proportional hazards) regression. We will discuss the background to, and interpretation of, each of these methods but also other approaches to analysis that deserve to be used more often. In this first article, we will present the basic concepts of survival analysis, including how to produce and interpret survival curves, and how to quantify and test survival differences between two or more groups of patients. Future papers in the series cover multivariate analysis and the last paper introduces some more advanced concepts in a brief question and answer format. More detailed accounts of these methods can be found in books written specifically about survival analysis, for example, Collett (1994), Parmar and Machin (1995) and Kleinbaum (1996). In addition, individual references for the methods are presented throughout the series. Several introductory texts also describe the basis of survival analysis, for ex

Question: What is survival analysis?


Dual-band leaky-wave antenna based on a dual-layer frequency selective surface for bi-directional satcom-on-the-move in Ka-band. A 2D-periodic leaky-wave antenna for a Ka-band satcom-on-the-move ground user terminal is presented. The antenna panel operates at the 20 GHz downlink as well as the 30 GHz uplink bands with the respective circular polarizations, using a common radiation aperture and a common phase centre. The dual-band performance is achieved by a carefully designed stacked dual-layer frequency selective surface, with one layer operating at 20 GHz and being transparent at 30 GHz, and the second layer acting vice versa. The paper describes the design of the circularly polarized primary feed, the dual-layer structures, and the complete compact leaky-wave antenna panel. The measured radiation performance reveals realized-gain values above 22 dBi and efficiencies above 60%. The cross-polarization discrimination and sidelobe level are suitable to meet the power spectral requirements for satellite communications at Ka-band.

Question: What is a dual-layer frequency selective surface?


Smarter Presentations: Exploiting Homography in Camera-Projector Systems. Standard presentation systems consisting of a laptop connected to a projector suffer from two problems: (1) the projected image appears distorted (keystoned) unless the projector is precisely aligned to the projection screen; (2) the speaker is forced to interact with the computer rather than the audience. This paper shows how the addition of an uncalibrated camera, aimed at the screen, solves both problems. Although the locations, orientations and optical parameters of the camera and projector are unknown, the projector-camera system calibrates itself by exploiting the homography between the projected slide and the camera image. Significant improvements are possible over passively calibrating systems since the projector actively manipulates the environment by placing feature points into the scene. For instance, using a low-resolution (160x120) camera, we can achieve an accuracy of ±3 pixels in a 1024x768 presentation slide. The camera-projector system infers models for the projector-to-camera and projector-to-screen mappings in order to provide two major benefits. First, images sent to the projector are pre-warped in such a way that the distortions induced by the arbitrary projector-screen geometry are precisely negated. This enables projectors to be mounted anywhere in the environment – for instance, at the side of the room, where the speaker is less likely to cast shadows on the screen, and where the projector does not occlude the audience's view. Second, the system detects the position of the user's laser pointer dot in the camera image at 20Hz, allowing the laser pointer to emulate the pointing actions of a mouse. This enables the user to activate virtual buttons in the presentation (such as "next slide") and draw on the projected image. The camera-assisted presentation system requires no special hardware (aside from the cheap camera) Rahul Sukthankar (rahuls@cs.cmu.edu) is now affiliated

Question: What is the camera-projector system?


The Blockchain-Based Digital Content Distribution System. The blockchain-based digital content distribution system was developed. Decentralized and pear-to-pear authentication mechanism can be considered as the ideal rights management mechanism. The blockchain has the potential to realize this ideal content distribution system. This is the successful model of the Superdistribution concept which was announced almost 30 years ago. The proposed system was demonstrated and got a lot of feedback for the future practical system.

Question: What is the blockchain-based digital content distribution system?


[Internet- and computer game addiction: phenomenology, comorbidity, etiology, diagnostics and therapeutic implications for the addictives and their relatives].. OBJECTIVE Excessive and addictive internet use and computer game playing is reported as an increasing problem in outpatient care. The aim of this paper is to give an overview about the current scientific discussion of the overuse and addiction of internet and computer game playing.   METHODS Pubmed was used for a systematic literature research considering original papers and review articles dealing with Internet/computer game addiction.   RESULTS Recent epidemiological data from Germany suggest that 1.5-3.5 % of adolescent computer and internet users show signs of an overuse or addictive use of computer and video games. Moreover there is evidence that the disorder is associated with higher rates of depression, anxiety, as well as lower achievements e. g. at school. Although the nosological assignment still remains unclear there is some evidence from neurobiological data that the disorder can be conceptualized as behavioral addiction. As treatment strategy CBT-techniques have been proposed, but there is still a lack of controlled clinical trials concerning their efficacy.   CONCLUSIONS Since the addicted persons often show little motivation for a behavioural change we consider it a promising approach to treat and train their relatives with the aim of increasing the motivation for a behavioural change of the addicted person.

Question: What is the prevalence of internet and computer game addiction?


Code analysis of lightweight encryption algorithms using in RFID systems to improve cipher performance. This research has investigated the performance analysis of lightweight encryption algorithms, which are using in RFID applications. In the first part, the codes of the investigated ciphers are analyzed, and then, four encryption algorithms include TEA, HIGHT, KATAN, and KLEIN are implemented on AVR Microcontroller to evaluate the number of CPU clock cycle for each cipher. In the last part, the results of two previous parts are compared.

Question: What is the code analysis of lightweight encryption algorithms using in RFID systems to improve cipher performance?


Control of hybrid AC/DC microgrid involving energy storage, renewable energy and pulsed loads. This paper proposes the coordinated control of a hybrid AC/DC power system with renewable energy source, energy storages and critical loads. The hybrid microgrid consists of both AC and DC sides. A synchronous generator and a PV farm supply power to the system's AC and DC sides, respectively. A bidirectional fully controlled AC/DC converter with active and reactive power decoupling technique is used to link the AC bus with the DC bus while regulating the system voltage and frequency. A DC/DC boost converter with a maximum power point tracking (MPPT) function is implemented to maximize the energy generation from the PV farm. Current controlled bidirectional DC/DC converters are applied to connect each lithium-ion battery bank to the DC bus. Lithium-ion battery banks act as energy storage devices that serve to increase the system stability by absorbing or injecting power to the grid as ancillary services. The proposed system can function in both grid-connected mode and islanding mode. Power electronic converters with different control strategies are analyzed in both modes in detail. Simulation results in MATLAB Simulink verify that the proposed topology is coordinated for power management in both AC and DC sides under critical loads with high efficiency, reliability, and robustness under both grid-connected and islanding modes.

Question: How to control a hybrid AC/DC microgrid?


Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles. We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser actions are determined by a classifier, based on features that represent the current state of the parser. We apply this parsing framework to both tracks of the CoNLL 2007 shared task, in each case taking advantage of multiple models trained with different learners. In the multilingual track, we train three LR models for each of the ten languages, and combine the analyses obtained with each individual model with a maximum spanning tree voting scheme. In the domain adaptation track, we use two models to parse unlabeled data in the target domain to supplement the labeled out-ofdomain training set, in a scheme similar to one iteration of co-training.

Question: What is the dependency parsing algorithm?


Real-time rigid-body visual tracking in a scanning electron microscope. Robotics continues to provide researchers with an increasing ability to interact with objects at the nano scale. As micro- and nanorobotic technologies mature, more interest is given to computer-assisted or automated approaches to manipulation at these scales. Although actuators are currently available that enable displacements resolutions in the subnanometer range, improvements in feedback technologies have not kept pace. Thus, many actuators that are capable of performing nanometer displacements are limited in automated tasks by the lack of suitable feedback mechanisms. This paper proposes the use of a rigid-model-based method for end effector tracking in a scanning electron microscope to aid in enabling more precise automated manipulations and measurements. These models allow the system to leverage domain-specific knowledge to increase performance in a challenging tracking environment.

Question: What is a rigid-model-based method for end effector tracking in a scanning electron microscope?


Feature reduction and selection for EMG signal classification. 0957-4174/$ see front matter 2012 Elsevier Ltd. A doi:10.1016/j.eswa.2012.01.102 ⇑ Corresponding author. Tel.: +66 74 55 8831; fax: E-mail address: angkoon.p@hotmail.com (A. Phiny Feature extraction is a significant method to extract the useful information which is hidden in surface electromyography (EMG) signal and to remove the unwanted part and interferences. To be successful in classification of the EMG signal, selection of a feature vector ought to be carefully considered. However, numerous studies of the EMG signal classification have used a feature set that have contained a number of redundant features. In this study, most complete and up-to-date thirty-seven time domain and frequency domain features have been proposed to be studied their properties. The results, which were verified by scatter plot of features, statistical analysis and classifier, indicated that most time domain features are superfluity and redundancy. They can be grouped according to mathematical property and information into four main types: energy and complexity, frequency, prediction model, and time-dependence. On the other hand, all frequency domain features are calculated based on statistical parameters of EMG power spectral density. Its performance in class separability viewpoint is not suitable for EMG recognition system. Recommendation of features to avoid the usage of redundant features for classifier in EMG signal classification applications is also proposed in this study. 2012 Elsevier Ltd. All rights reserved.

Question: How to reduce the number of features?


Large-Scale Liquid Simulation on Adaptive Hexahedral Grids. Regular grids are attractive for numerical fluid simulations because they give rise to efficient computational kernels. However, for simulating high resolution effects in complicated domains they are only of limited suitability due to memory constraints. In this paper we present a method for liquid simulation on an adaptive octree grid using a hexahedral finite element discretization, which reduces memory requirements by coarsening the elements in the interior of the liquid body. To impose free surface boundary conditions with second order accuracy, we incorporate a particular class of Nitsche methods enforcing the Dirichlet boundary conditions for the pressure in a variational sense. We then show how to construct a multigrid hierarchy from the adaptive octree grid, so that a time efficient geometric multigrid solver can be used. To improve solver convergence, we propose a special treatment of liquid boundaries via composite finite elements at coarser scales. We demonstrate the effectiveness of our method for liquid simulations that would require hundreds of millions of simulation elements in a non-adaptive regime.

Question: How to simulate a liquid on an adaptive octree grid?


Time-Dependent Trajectory Regression on Road Networks via Multi-Task Learning. Road travel costs are important knowledge hidden in largescale GPS trajectory data sets, the discovery of which can benefit many applications such as intelligent route planning and automatic driving navigation. While there are previous studies which tackled this task by modeling it as a regression problem with spatial smoothness taken into account, they unreasonably assumed that the latent cost of each road remains unchanged over time. Other works on route planning and recommendation that have considered temporal factors simply assumed that the temporal dynamics be known in advance as a parametric function over time, which is not faithful to reality. To overcome these limitations, in this paper, we propose an extension to a previous static trajectory regression framework by learning the temporal dynamics of road travel costs in an innovative non-parametric manner which can effectively overcome the temporal sparsity problem. In particular, we unify multiple different trajectory regression problems in a multi-task framework by introducing a novel crosstask regularization which encourages temporal smoothness on the change of road travel costs. We then propose an efficient block coordinate descent method to solve the resulting problem by exploiting its separable structures and prove its convergence to global optimum. Experiments conducted on both synthetic and real data sets demonstrate the effectiveness of our method and its improved accuracy on travel time

Question: What is the difference between a static trajectory regression and a time-dependent trajectory regression?


" Proof-of-Work " Proves Not to Work version 0 . 1. A frequently proposed method of reducing unsolicited bulk email ("spam") is for senders to pay for each email they send. Proof-ofwork schemes avoid charging real money by requiring senders to demonstrate that they have expended processing time in solving a cryptographic puzzle. We attempt to determine how difficult that puzzle should be so as to be effective in preventing spam. We analyse this both from an economic perspective, "how can we stop it being cost-effective to send spam", and from a security perspective, "spammers can access insecure end-user machines and will steal processing cycles to solve puzzles". Both analyses lead to similar values of puzzle difficulty. Unfortunately, realworld data from a large ISP shows that these difficulty levels would mean that significant numbers of senders of legitimate email would be unable to continue their current levels of activity. We conclude that proof-of-work will not be a solution to the problem of spam.

Question: How can we stop spam?


Is Memory Schematic ?. ion Information that has been selected because it is important and/or relevant to the schema is further reduced during the encoding process by abstraction. This process codes the meaning but not the format of a message (e.g., Bobrow, 1970; Bransford, Barclay, & Franks, 1972). Thus, details such as the lexical form of an individual word (e.g., Schank, 1972, 1976) and the syntactic form of a sentence (e.g., Sachs, 1967) will not be preserved in memory. Because memory for syntax appears to be particularly sparce as well as brief (e.g., J. R. Anderson, 1974; Begg & Wickelgren, 1974; Jarvella, 1971; Sachs, 1967, 1974), the abstraction process is thought to operate during encoding. Additional support for the notion that what is stored is an abstracted representation of the original stimulus comes from studies that demonstrate that after a passage is read, it takes subjects the same amount of time to verify information originally presented in a complex linguistic format as it does to verify that same information presented in a simpler format (e.g., King & Greeno, 1974; Kintsch &Monk, 1972). There are a considerable number of theories that assume that memory consists of sets of propositions and their relations (e.g., J. R. Anderson, 1976; Bransford, et al., 1972; Brewer, 1975; Frederiksen, 1975a; Kintsch, 1974; Norman & Rumelhart, 1975; Schank, 1972, 1976). One formalized presentation of this idea is Schank's conceptual dependency theory (1972). The theory asserts that all propositions can be expressed by a small set of primitive concepts. All lexical expressions that share an identical meaning will be represented in one way (and so stored economically) regardless of their presentation format. As a result people should often incorrectly recall or misrecognize synonyms of originally presented words, and they do (e.g., Anderson & Bower, 1973; R. C. Anderson, 1974; Anisfeld & Knapp, 1968; Brewer, 1975; Graesser, 1978b; Sachs, 1974). Abstraction and memor

Question: What is the difference between a schema and a schema?


Development and investigation of efficient artificial bee colony algorithm for numerical function optimization. Artificial bee colony algorithm (ABC), which is inspired by the foraging behavior of honey bee swarm, is a biological-inspired optimization. It shows more effective than genetic algorithm (GA), particle swarm optimization (PSO) and ant colony optimization (ACO). However, ABC is good at exploration but poor at exploitation, and its convergence speed is also an issue in some cases. For these insufficiencies, we propose an improved ABC algorithm called I-ABC. In I-ABC, the best-so-far solution, inertia weight and acceleration coefficients are introduced to modify the search process. Inertia weight and acceleration coefficients are defined as functions of the fitness. In addition, to further balance search processes, the modification forms of the employed bees and the onlooker ones are different in the second acceleration coefficient. Experiments show that, for most functions, the I-ABC has a faster convergence speed and ptimization better performances than each of ABC and the gbest-guided ABC (GABC). But I-ABC could not still substantially achieve the best solution for all optimization problems. In a few cases, it could not find better results than ABC or GABC. In order to inherit the bright sides of ABC, GABC and I-ABC, a high-efficiency hybrid ABC algorithm, which is called PS-ABC, is proposed. PS-ABC owns the abilities of prediction and selection. Results show that PS-ABC has a faster convergence speed like I-ABC and better search ability ods f than other relevant meth

Question: What is the difference between the gbest-guided ABC and the improved ABC?


Artificial moral agents are infeasible with foreseeable technologies. For an artificial agent to be morally praiseworthy, its rules for behaviour and the mechanisms for supplying those rules must not be supplied entirely by external humans. Such systems are a substantial departure from current technologies and theory, and are a low prospect. With foreseeable technologies, an artificial agent will carry zero responsibility for its behavior and humans will retain full responsibility.

Question: What is the difference between an artificial agent and a robot?


k-Shape: Efficient and Accurate Clustering of Time Series. The proliferation and ubiquity of temporal data across many disciplines has generated substantial interest in the analysis and mining of time series. Clustering is one of the most popular data mining methods, not only due to its exploratory power, but also as a preprocessing step or subroutine for other techniques. In this paper, we describe k-Shape, a novel algorithm for time-series clustering. k-Shape relies on a scalable iterative refinement procedure, which creates homogeneous and well-separated clusters. As its distance measure, k-Shape uses a normalized version of the cross-correlation measure in order to consider the shapes of time series while comparing them. Based on the properties of that distance measure, we develop a method to compute cluster centroids, which are used in every iteration to update the assignment of time series to clusters. An extensive experimental evaluation against partitional, hierarchical, and spectral clustering methods, with the most competitive distance measures, showed the robustness of k-Shape. Overall, k-Shape emerges as a domain-independent, highly accurate, and efficient clustering approach for time series with broad applications.

Question: What is a time series?