A novel framework for SMS spam filtering. A novel framework for SMS spam filtering is introduced in this paper to prevent mobile phone users from unsolicited SMS messages. The framework makes use of two distinct feature selection approaches based on information gain and chi-square metrics to find out discriminative features representing SMS messages. The discriminative feature subsets are then employed in two different Bayesian-based classifiers, so that SMS messages are categorized as either spam or legitimate. Moreover, the paper introduces a real-time mobile application for Android™ based mobile phones utilizing the proposed spam filtering scheme, as well. Hence, SMS spam messages are silently filtered out without disturbing phone users. Effectiveness of the filtering framework is evaluated on a large SMS message collection including legitimate and spam messages. Following the evaluation, remarkably accurate classification results are obtained for both spam and legitimate messages.

Question: What is a novel framework for SMS spam filtering?


Effect of gas type and flow rate on Cu free air ball formation in thermosonic wire bonding. 0026-2714/$ see front matter 2010 Elsevier Ltd. A doi:10.1016/j.microrel.2010.02.023 * Corresponding author. E-mail address: apequegn@uwaterloo.ca (A. Peque The development of novel Cu wires for thermosonic wire bonding is time consuming and the effects of shielding gas on the electrical flame off (EFO) process is not fully understood. An online method is used in this study for characterizing Cu free air balls (FABs) formed with different shielding gas types and flow rates. The ball heights before (HFAB) and after deformation (Hdef) are responses of the online method and measured as functions of gas flow rate. Sudden changes in the slopes of these functions, a non-parallelity of the two functions, and a large standard deviation of the HFAB measurements all identify FAB defects. Using scanning electron microscope (SEM) images in parallel with the online measurements golf-club shaped and pointed shaped FABs are found and the conditions at which they occur are identified. In general FAB defects are thought to be caused by changes in surface tension of the molten metal during EFO due to inhomogeneous cooling or oxidation. It is found that the convective cooling effect of the shielding gas increases with flow rate up to 0.65 l/min where the bulk temperature of a thermocouple at the EFO site decreases by 19 C. Flow rates above 0.7 l/min yield an undesirable EFO process due to an increase in oxidation which can be explained by a change in flow from laminar to turbulent. The addition of H2 to the shielding gas reduces the oxidation of the FAB as well as providing additional thermal energy during EFO. Different Cu wire materials yield different results where some perform better than others. 2010 Elsevier Ltd. All rights reserved.

Question: What is the effect of gas type and flow rate on Cu free air ball formation in thermosonic wire bonding?


Exemplar Guided Unsupervised Image-to-Image Translation. Image-to-image translation task has become a popular topic recently. Most works focus on either one-to-one mapping in an unsupervised way or many-to-many mapping in a supervised way. However, a more practical setting is many-to-many mapping in an unsupervised way, which is harder due to the lack of supervision and the complex inner and cross-domain variations. To alleviate these issues, we propose the Exemplar Guided UNsupervised Image-to-image Translation (EGUNIT) network which conditions the image translation process on an image in the target domain. An image representation is assumed to comprise both content information which is shared across domains and style information specific to one domain. By applying exemplar-based adaptive instance normalization to the shared content representation, EG-UNIT manages to transfer the style information in the target domain to the source domain. Experimental results on various datasets show that EG-UNIT can indeed translate the source image to diverse instances in the target domain with semantic consistency.

Question: What is the difference between image-to-image translation and image-to-image generation?


Cyber-Physical System Security of a Power Grid : State-ofthe-Art. As part of the smart grid development, more and more technologies are developed and deployed on the power grid to enhance the system reliability. A primary purpose of the smart grid is to significantly increase the capability of computer-based remote control and automation. As a result, the level of connectivity has become much higher, and cyber security also becomes a potential threat to the cyber-physical systems (CPSs). In this paper, a survey of the state-of-the-art is conducted on the cyber security of the power grid concerning issues of: (1) the structure of CPSs in a smart grid; (2) cyber vulnerability assessment; (3) cyber protection systems; and (4) testbeds of a CPS. At Washington State University (WSU), the Smart City Testbed (SCT) has been developed to provide a platform to test, analyze and validate defense mechanisms against potential cyber intrusions. A test case is provided in this paper to demonstrate how a testbed helps the study of cyber security and the anomaly detection system (ADS) for substations.

Question: What is the structure of a CPS?


Deep content-based music recommendation. Automatic music recommendation has become an increasingly relevant problem in recent years, since a lot of music is now sold and consumed digitally. Most recommender systems rely on collaborative filtering. However, this approach suffers from the cold start problem: it fails when no usage data is available, so it is not effective for recommending new and unpopular songs. In this paper, we propose to use a latent factor model for recommendation, and predict the latent factors from music audio when they cannot be obtained from usage data. We compare a traditional approach using a bag-of-words representation of the audio signals with deep convolutional neural networks, and evaluate the predictions quantitatively and qualitatively on the Million Song Dataset. We show that using predicted latent factors produces sensible recommendations, despite the fact that there is a large semantic gap between the characteristics of a song that affect user preference and the corresponding audio signal. We also show that recent advances in deep learning translate very well to the music recommendation setting, with deep convolutional neural networks significantly outperforming the traditional approach.

Question: What is the cold start problem?


A Novel User Authentication Scheme Based on QR-Code. User authentication is one of the fundamental procedures to ensure secure communications and share system resources over an insecure public network channel. Thus, a simple and efficient authentication mechanism is required for securing the network system in the real environment. In general, the password-based authentication mechanism provides the basic capability to prevent unauthorized access. Especially, the purpose of the one-time password is to make it more difficult to gain unauthorized access to restricted resources. Instead of using the password file as conventional authentication systems, many researchers have devoted to implement various one-time password schemes using smart cards, time-synchronized token or short message service in order to reduce the risk of tampering and maintenance cost. However, these schemes are impractical because of the far from ubiquitous hardware devices or the infrastructure requirements. To remedy these weaknesses, the attraction of the QR-code technique can be introduced into our one-time password authentication protocol. Not the same as before, the proposed scheme based on QR code not only eliminates the usage of the password verification table, but also is a cost effective solution since most internet users already have mobile phones. For this reason, instead of carrying around a separate hardware token for each security domain, the superiority of handiness benefit from the mobile phone makes our approach more practical and convenient.

Question: What is the purpose of the QR-code technique?


Neural Taylor Approximations: Convergence and Exploration in Rectifier Networks. Modern convolutional networks, incorporating rectifiers and max-pooling, are neither smooth nor convex; standard guarantees therefore do not apply. Nevertheless, methods from convex optimization such as gradient descent and Adam are widely used as building blocks for deep learning algorithms. This paper provides the first convergence guarantee applicable to modern convnets, which furthermore matches a lower bound for convex nonsmooth functions. The key technical tool is the neural Taylor approximation – a straightforward application of Taylor expansions to neural networks – and the associated Taylor loss. Experiments on a range of optimizers, layers, and tasks provide evidence that the analysis accurately captures the dynamics of neural optimization. The second half of the paper applies the Taylor approximation to isolate the main difficulty in training rectifier nets – that gradients are shattered – and investigates the hypothesis that, by exploring the space of activation configurations more thoroughly, adaptive optimizers such as RMSProp and Adam are able to converge to better solutions.

Question: What is a neural Taylor approximation?


Which robot am I thinking about? The impact of action and appearance on people's evaluations of a moral robot. In three studies we found further evidence for a previously discovered Human-Robot (HR) asymmetry in moral judgments: that people blame robots more for inaction than action in a moral dilemma but blame humans more for action than inaction in the identical dilemma (where inaction allows four persons to die and action sacrifices one to save the four). Importantly, we found that people's representation of the "robot" making these moral decisions appears to be one of a mechanical robot. For when we manipulated the pictorial display of a verbally described robot, people showed the HR asymmetry only when making judgments about a mechanical-looking robot, not a humanoid robot. This is the first demonstration that robot appearance affects people's moral judgments about robots.

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


Survey on Collaborative AR for Multi-user in Urban Simulation. This paper describes an augmented reality (AR) environment that allows multiple participants or multi-user to interact with 2D and 3D data. AR simply can provide a collaborative interactive AR environment for urban simulation, where users can interact naturally and intuitively. In addition, the collaborative AR makes multi-user in urban simulation to share simultaneously a real world and virtual world. The fusion between real and virtual world, existed in AR environment by see-through HMDs, achieves higher interactivity as a key features of collaborative AR. In real-time, precise registration between both worlds and multiuser are crucial for the collaborations. Collaborative AR allow multi-user to simultaneously share a real world surrounding them and a virtual world. Common problems in AR environment will be discussed and major issues in collaborative AR will be explained details in this paper. The features of collaboration in AR environment are will be identified and the requirements of collaborative AR will be defined. This paper will give an overview on collaborative AR environment for multi-user in urban studies and planning. The work will also cover numerous systems of collaborative AR environments for multi-user.

Question: What is the difference between AR and VR?


Limiting privacy breaches in privacy preserving data mining. There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One approach for this problem is to randomize the values in individual records, and only disclose the randomized values. The model is then built over the randomized data, after first compensating for the randomization (at the aggregate level). This approach is potentially vulnerable to privacy breaches: based on the distribution of the data, one may be able to learn with high confidence that some of the randomized records satisfy a specified property, even though privacy is preserved on average.In this paper, we present a new formulation of privacy breaches, together with a methodology, "amplification", for limiting them. Unlike earlier approaches, amplification makes it is possible to guarantee limits on privacy breaches without any knowledge of the distribution of the original data. We instantiate this methodology for the problem of mining association rules, and modify the algorithm from [9] to limit privacy breaches without knowledge of the data distribution. Next, we address the problem that the amount of randomization required to avoid privacy breaches (when mining association rules) results in very long transactions. By using pseudorandom generators and carefully choosing seeds such that the desired items from the original transaction are present in the randomized transaction, we can send just the seed instead of the transaction, resulting in a dramatic drop in communication and storage cost. Finally, we define new information measures that take privacy breaches into account when quantifying the amount of privacy preserved by randomization.

Question: How to limit privacy breaches in privacy preserving data mining?


Return-oriented programming without returns. We show that on both the x86 and ARM architectures it is possible to mount return-oriented programming attacks without using return instructions. Our attacks instead make use of certain instruction sequences that behave like a return, which occur with sufficient frequency in large libraries on (x86) Linux and (ARM) Android to allow creation of Turing-complete gadget sets.  Because they do not make use of return instructions, our new attacks have negative implications for several recently proposed classes of defense against return-oriented programming: those that detect the too-frequent use of returns in the instruction stream; those that detect violations of the last-in, first-out invariant normally maintained for the return-address stack; and those that modify compilers to produce code that avoids the return instruction.

Question: What is return-oriented programming?


Personalized Security Messaging : Nudges for Compliance with Browser Warnings. Decades of psychology and decision-making research show that everyone makes decisions differently; yet security messaging is still one-size-fits-all. This suggests that we can improve outcomes by delivering information relevant to how each individual makes decisions. We tested this hypothesis by designing messaging customized for stable personality traits— specifically, the five dimensions of the General Decision-Making Style (GDMS) instrument. We applied this messaging to browser warnings, security messaging encountered by millions of web users on a regular basis. To test the efficacy of our nudges, we conducted experiments with 1,276 participants, who encountered a warning about broken HTTPS due to an invalid certificate under realistic circumstances. While the effects of some nudges correlated with certain traits in a statistically significant manner, we could not reject the null hypothesis—that the intervention did not affect the subjects' behavior—for most of our nudges, especially after accounting for participants who did not pay close attention to the message. In this paper, we present the detailed results of our experiments, discuss potential reasons for why the outcome contradicts the decision-making research, and identify lessons for researchers based on our experience.

Question: How do I know if my browser is vulnerable to a man-in-the-middle attack?


A four-electrode low frequency impedance spectroscopy measurement system using the AD5933 measurement chip.. This paper presents the design of a four electrode impedance measurement circuit dedicated to bioimpedance embedded applications. It extends the use of the AD5933 measurement chip to allow it to operate in a four electrode configuration in order to limit the effects of the parasitic impedances between the medium under test and the electrodes. The circuit has shown a good measurement accuracy on various test circuits. In association with a four microband electrode system it has been successfully used to characterize small physiological samples (50 μl) with conductivities ranging from 0.14 to 1.2 S m(-1). It can be used as an alternative bioimpedance measurement approach for embedded applications operating in the four electrode configuration.

Question: What is a four electrode impedance measurement system?


Drunk person identification using thermal infrared images. Drunk person identification is carried out using thermal infrared images. The features used for this purpose are simply the pixel values on specific points on the face of the person. It is proved that for a drunk person, the corresponding cluster in the feature space moves far away from its original position for the sober person. The concept behind the proposed approach is based on the physiology-based face identification. For demonstration purposes, Fisher Linear Discriminant approach is used for space dimensionality reduction. The feature space is found to be of very low dimensionality.

Question: How does drunk person identification work?


High-Efficiency Slim Adapter With Low-Profile Transformer Structure. This paper presents the implementation of a high-efficiency slim adapter using an resonant converter. A new structure of the slim-type transformer is proposed, which is composed of copper wire as the primary winding and printed-circuit-board winding on the outer layer as the secondary winding. The proposed structure is suitable for a slim and high-efficiency converter because it has advantages of easy utilization and wide conductive cross-sectional area. In addition, the voltage-doubler rectifier is applied to the secondary side due to its simple structure of secondary winding, and a filter is adopted to reduce the output filter size. The validity of this study is confirmed by the experimental results from an 85-W prototype.

Question: What is the purpose of this paper?


Read Empiricism And The Philosophy Of Mind Empiricism And The Philosophy Of Mind empiricism and the philosophy of mind. empiricism and the philosophy of mind. Book lovers, when you need a new book to read, find the book here. Never worry not to find what you need. Is the empiricism and the philosophy of mind your needed book now? That's true; you are really a good reader. This is a perfect book that comes from great author to share with you. The book offers the best experience and lesson to take, not only take, but also learn.

Question: What is the philosophy of mind?


An ontology-based approach for the reconstruction and analysis of digital incidents timelines. Due to the democratisation of new technologies, computer forensics investigators have to deal with volumes of data which are becoming increasingly large and heterogeneous. Indeed, in a single machine, hundred of events occur per minute, produced and logged by the operating system and various software. Therefore, the identification of evidence, and more generally, the reconstruction of past events is a tedious and time-consuming task for the investigators. Our work aims at reconstructing and analysing automatically the events related to a digital incident, while respecting legal requirements. To tackle those three main problems (volume, heterogeneity and legal requirements), we identify seven necessary criteria that an efficient reconstruction tool must meet to address these challenges. This paper introduces an approach based on a three-layered ontology, called ORD2I, to represent any digital events. ORD2I is associated with a set of operators to analyse the resulting timeline and to ensure the reproducibility of the investigation. © 2015 Elsevier Ltd. All rights reserved.

Question: What is the ontology-based approach for the reconstruction and analysis of digital incidents timelines?


Assessing patient suitability for short-term cognitive therapy with an interpersonal focus. In the current study, the development and initial validation of the Suitability for Short-Term Cognitive Therapy (SSCT) interview procedure is reported. The SSCT is an interview and rating procedure designed to evaluate the potential appropriateness of patients for short-term cognitive therapy with an interpersonal focus. It consists of a 1-hour, semistructured interview, focused on eliciting information from the patient relevant to nine selection criteria. The procedures involved in the development of this scale are described in detail, and preliminary evidence suggesting that the selection criteria can be rated reliably is presented. In addition, data indicating that scores on the SSCT scale predict the outcome of short-term cognitive therapy on multiple dependent measures, including both therapist and patient perspectives, are reported. It is concluded that the SSCT is a potentially useful scale for identifying patients who may be suitable, or unsuitable, for the type of short-term cognitive therapy administered in the present study.

Question: How do you assess patient suitability for short-term cognitive therapy?


Molecular classification of cancer: class discovery and class prediction by gene expression monitoring.. Although cancer classification has improved over the past 30 years, there has been no general approach for identifying new cancer classes (class discovery) or for assigning tumors to known classes (class prediction). Here, a generic approach to cancer classification based on gene expression monitoring by DNA microarrays is described and applied to human acute leukemias as a test case. A class discovery procedure automatically discovered the distinction between acute myeloid leukemia (AML) and acute lymphoblastic leukemia (ALL) without previous knowledge of these classes. An automatically derived class predictor was able to determine the class of new leukemia cases. The results demonstrate the feasibility of cancer classification based solely on gene expression monitoring and suggest a general strategy for discovering and predicting cancer classes for other types of cancer, independent of previous biological knowledge.

Question: What is the difference between acute myeloid leukemia and acute lymphoblastic leukemia?


Enhanced cardiac perception is associated with benefits in decision-making.. In the present study we provide the first empirical evidence that viscero-sensory feedback from an internal organ is associated with decision-making processes. Participants with accurate vs. poor perception of their heart activity were compared with regard to their performance in the Iowa Gambling Task. During this task, participants have to choose between four card decks. Decks A and B yield high gains and high losses, and if played continuously, result in net loss. In contrast, decks C and D yield small gains and also small losses, but result in net profit if they are selected continuously. Accordingly, participants have to learn to avoid the net loss options in favor of the net gain options. In our study, participants with good cardiac perception chose significantly more of the net gain and fewer of the net loss options. Our findings document the substantial role of visceral feedback in decision-making processes in complex situations.

Question: What is the first empirical evidence that viscero-sensory feedback from an internal organ is associated with decision-making processes?


Impact of dietary fiber intake on glycemic control, cardiovascular risk factors and chronic kidney disease in Japanese patients with type 2 diabetes mellitus: the Fukuoka Diabetes Registry. BACKGROUND Dietary fiber is beneficial for the treatment of type 2 diabetes mellitus, although it is consumed differently in ethnic foods around the world. We investigated the association between dietary fiber intake and obesity, glycemic control, cardiovascular risk factors and chronic kidney disease in Japanese type 2 diabetic patients.   METHODS A total of 4,399 patients were assessed for dietary fiber intake using a brief self-administered diet history questionnaire. The associations between dietary fiber intake and various cardiovascular risk factors were investigated cross-sectionally.   RESULTS Body mass index, fasting plasma glucose, HbA1c, triglyceride and high-sensitivity C-reactive protein negatively associated with dietary fiber intake after adjusting for age, sex, duration of diabetes, current smoking, current drinking, total energy intake, fat intake, saturated fatty acid intake, leisure-time physical activity and use of oral hypoglycemic agents or insulin. The homeostasis model assessment insulin sensitivity and HDL cholesterol positively associated with dietary fiber intake. Dietary fiber intake was associated with reduced prevalence of abdominal obesity, hypertension and metabolic syndrome after multivariate adjustments including obesity. Furthermore, dietary fiber intake was associated with lower prevalence of albuminuria, low estimated glomerular filtration rate and chronic kidney disease after multivariate adjustments including protein intake. Additional adjustments for obesity, hypertension or metabolic syndrome did not change these associations.   CONCLUSION We demonstrated that increased dietary fiber intake was associated with better glycemic control and more favorable cardiovascular disease risk factors including chronic kidney disease in Japanese type 2

Question: What is the impact of dietary fiber intake on glycemic control, cardiovascular risk factors and chronic kidney disease in Japanese patients with type 2 diabetes mellitus?


Semantic Sentiment Analysis Challenge at ESWC2017. Sentiment Analysis is a widely studied research field in both research and industry, and there are different approaches for addressing sentiment analysis related tasks. Sentiment Analysis engines implement approaches spanning from lexicon-based techniques, to machine learning, or involving syntactical rules analysis. Such systems are already evaluated in international research challenges. However, Semantic Sentiment Analysis approaches, which take into account or rely also on large semantic knowledge bases and implement Semantic Web best practices, are not under specific experimental evaluation and comparison by other international challenges. Such approaches may potentially deliver higher performance, since they are also able to analyze the implicit, semantics features associated with natural language concepts. In this paper, we present the fourth edition of the Semantic Sentiment Analysis Challenge, in which systems implementing or relying on semantic features are evaluated in a competition involving large test sets, and on different sentiment tasks. Systems merely based on syntax/word-count or just lexicon-based approaches have been excluded by the evaluation. Then, we present the results of the evaluation for each task and show the winner of the most innovative approach award, that combines several knowledge bases for addressing the sentiment analysis task.

Question: What is the fourth edition of the Semantic Sentiment Analysis Challenge?


Kansei Engineering with Online Review Mining for Hotel Service Development. In the Internet era, consumers can comment on their hotel living experience directly through the Internet. Thus, consumers online comments might become a key factor for consumers choosing hotels when planning their tourism itinerary. The large amount of User-Generated Content (UGC) provided by the consumers has also provided chances for the hospitality industry to consumer behavior statistic inferences. This study applies Kansei engineering combined with text mining to develop guidelines for hotel services to help managers meet consumers Kansei needs. Through understanding consumers online comments by text mining, this study identifies the most important customer Kansei and hotel service characteristics, and then analyzes the relationships between them. The finds can provide suggestions for hotel service improvement and development.

Question: What is Kansei engineering?


Robotic Forceps Manipulator With a Novel Bending Mechanism. This paper proposes a new bending technique with a screwdrive mechanism that allows for omnidirectional bending motion by rotating two linkages, each consisting of a right-handed screw, a universal joint, and a left-handed screw. The new screwdrive mechanism, termed double-screw-drive (DSD) mechanism, is utilized in a robotic forceps manipulator for laparoscopic surgery. A robotic forceps manipulator incorporating the DSD mechanism (DSD forceps) can bend without using wires. Without wires, it has high rigidity, and can bend at 90° in any arbitrary direction. In addition, the gripper of the DSD forceps can perform rotational motion, which is achieved by rotating a third linkage in the DSD mechanism. Opening and closing motions of the gripper are attained by wire actuation. Fundamental experiments examining the bending force and the accuracy of the DSD forceps were conducted, and an analysis of the accuracy was performed. Control of the DSD forceps through a teleoperation system was achieved via a joystick-type manipulator. A servo system was constructed for each linkage and the wire actuation mechanism, and tracking control experiments as well as a suturing experiment were conducted. The results of the experiments showed that the required design specifications were fulfilled. Thus, the validity of the DSD forceps was demonstrated.

Question: What is the novel bending mechanism?


Simultaneous Feature and Dictionary Learning for Image Set Based Face Recognition. In this paper, we propose a simultaneous feature and dictionary learning (SFDL) method for image set-based face recognition, where each training and testing example contains a set of face images, which were captured from different variations of pose, illumination, expression, resolution, and motion. While a variety of feature learning and dictionary learning methods have been proposed in recent years and some of them have been successfully applied to image set-based face recognition, most of them learn features and dictionaries for facial image sets individually, which may not be powerful enough because some discriminative information for dictionary learning may be compromised in the feature learning stage if they are applied sequentially, and vice versa. To address this, we propose a SFDL method to learn discriminative features and dictionaries simultaneously from raw face pixels so that discriminative information from facial image sets can be jointly exploited by a one-stage learning procedure. To better exploit the nonlinearity of face samples from different image sets, we propose a deep SFDL (D-SFDL) method by jointly learning hierarchical non-linear transformations and class-specific dictionaries to further improve the recognition performance. Extensive experimental results on five widely used face data sets clearly shows that our SFDL and D-SFDL achieve very competitive or even better performance with the state-of-the-arts.

Question: What is the difference between feature learning and dictionary learning?


A Survey of Denial-of-Service and Distributed Denial of Service Attacks and Defenses in Cloud Computing. Cloud Computing is a computing model that allows ubiquitous, convenient and on-demand access to a shared pool of highly configurable resources (e.g., networks, servers, storage, applications and services). Denial-of-Service (DoS) and Distributed Denial-of-Service (DDoS) attacks are serious threats to the Cloud services' availability due to numerous new vulnerabilities introduced by the nature of the Cloud, such as multi-tenancy and resource sharing. In this paper, new types of DoS and DDoS attacks in Cloud Computing are explored, especially the XML-DoS and HTTP-DoS attacks, and some possible detection and mitigation techniques are examined. This survey also provides an overview of the existing defense solutions and investigates the experiments and metrics that are usually designed and used to evaluate their performance, which is helpful for the future research in the domain.

Question: What is the cloud computing?


Digital Facial Engraving. This contribution introduces the basic techniques for digital facial engraving, which imitates traditional copperplate engraving. Inspired by traditional techniques, we first establish a set of basic rules thanks to which separate engraving layers are built on the top of the original photo. Separate layers are merged according to simple merging rules and according to range shift/scale masks specially introduced for this purpose. We illustrate the introduced technique by a set of black/white and color engravings, showing different features such as engraving-specific image enhancements, mixing different regular engraving lines with mezzotint, irregular perturbations of engraving lines etc. We introduce the notion of engraving style which comprises a set of separate engraving layers together with a set of associated range shift/scale masks. The engraving style helps to port the look and feel of one engraving to another. Once different libraries of pre-defined mappable engraving styles and an appropriate user interface are added to the basic system, producing a decent gravure starting from a simple digital photo will be a matter of seconds. The engraving technique described in this contribution opens new perspectives for digital art, adding unprecedented power and precision to the engraver's work. 1. Rationale Engraving is among the most important traditional graphical techniques. It first appeared in the fifteenth century as an illustrative support for budding book-printing, but very quickly became an art in its own right, thanks to its specific expressive power. Actually, four main classes of engraving are used by artists: letterpress or relief printing, intaglio or in-hollow printing, silk screen process and lithography, with several different techniques in each class. The history of printmaking was punctuated by prosperous periods of techniques which later declined for various reasons. Facial engraving is one such example. Extremely popular

Question: What is facial engraving?


Hardware/Software Codesign: The Past, the Present, and Predicting the Future. Hardware/software codesign investigates the concurrent design of hardware and software components of complex electronic systems. It tries to exploit the synergy of hardware and software with the goal to optimize and/or satisfy design constraints such as cost, performance, and power of the final product. At the same time, it targets to reduce the time-to-market frame considerably. This paper presents major achievements of two decades of research on methods and tools for hardware/software codesign by starting with a historical survey of its roots, by highlighting its major research directions and achievements until today, and finally, by predicting in which direction research in codesign might evolve in the decades to come.

Question: What is codesign?


Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms. We describe new algorithms for training tagging models, as an alternative to maximum-entropy models or conditional random elds (CRFs). The algorithms rely on Viterbi decoding of training examples, combined with simple additive updates. We describe theory justifying the algorithms through a modi cation of the proof of convergence of the perceptron algorithm for classi cation problems. We give experimental results on part-of-speech tagging and base noun phrase chunking, in both cases showing improvements over results for a maximum-entropy tagger.

Question: What is the difference between discriminative training and maximum entropy training?


AZR-LEACH: An Energy Efficient Routing Protocol for Wireless Sensor Networks. Reducing the energy consumption of available resources is still a problem to be solved in Wireless Sensor Networks (WSNs). Many types of existing routing protocols are developed to save power consumption. In these protocols, cluster-based routing protocols are found to be more energy efficient. A cluster head is selected to aggregate the data received from root nodes and forwards these data to the base station in cluster-based routing. The selection of cluster heads should be efficient to save energy. In our proposed protocol, we use static clustering for the efficient selection of cluster heads. The proposed routing protocol works efficiently in large as well as small areas. For an optimal number of cluster head selection we divide a large sensor field into rectangular clusters. Then these rectangular clusters are further grouped into zones for efficient communication between cluster heads and a base station. We perform MATLAB simulations to observe the network stability, throughput, energy consumption, network lifetime and the number of cluster heads. Our proposed routing protocol outperforms in large areas in comparison with the LEACH, MH-LEACH, and SEP routing protocols.

Question: How to select cluster heads efficiently?


Effects of manual lymphatic drainage on breast cancer-related lymphedema: a systematic review and meta-analysis of randomized controlled trials. BACKGROUND Lymphedema is a common complication of axillary dissection for breast cancer. We investigated whether manual lymphatic drainage (MLD) could prevent or manage limb edema in women after breast-cancer surgery.   METHODS We performed a systematic review and meta-analysis of published randomized controlled trials (RCTs) to evaluate the effectiveness of MLD in the prevention and treatment of breast-cancer-related lymphedema. The PubMed, EMBASE, CINAHL, Physiotherapy Evidence Database (PEDro), SCOPUS, and Cochrane Central Register of Controlled Trials electronic databases were searched for articles on MLD published before December 2012, with no language restrictions. The primary outcome for prevention was the incidence of postoperative lymphedema. The outcome for management of lymphedema was a reduction in edema volume.   RESULTS In total, 10 RCTs with 566 patients were identified. Two studies evaluating the preventive outcome of MLD found no significant difference in the incidence of lymphedema between the MLD and standard treatment groups, with a risk ratio of 0.63 and a 95% confidence interval (CI) of 0.14 to 2.82. Seven studies assessed the reduction in arm volume, and found no significant difference between the MLD and standard treatment groups, with a weighted mean difference of 75.12 (95% CI, -9.34 to 159.58).   CONCLUSIONS The current evidence from RCTs does not support the use of MLD in preventing or treating lymphedema. However, clinical and statistical inconsistencies between the various studies confounded our evaluation of the effect of MLD on breast-cancer-related lymphedema.

Question: What is the effect of manual lymphatic drainage on breast cancer-related lymphedema?


Material classification and semantic segmentation of railway track images with deep convolutional neural networks. The condition of railway tracks needs to be periodically monitored to ensure passenger safety. Cameras mounted on a moving vehicle such as a hi-rail vehicle or a geometry inspection car can generate large volumes of high resolution images. Extracting accurate information from those images has been challenging due to background clutter in railroad environments. In this paper, we describe a novel approach to visual track inspection using material classification and semantic segmentation with Deep Convolutional Neural Networks (DCNN). We show that DCNNs trained end-to-end for material classification are more accurate than shallow learning machines with hand-engineered features and are more robust to noise. Our approach results in a material classification accuracy of 93.35% using 10 classes of materials. This allows for the detection of crumbling and chipped tie conditions at detection rates of 86.06% and 92.11%, respectively, at a false positive rate of 10 FP/mile on the 85-mile Northeast Corridor (NEC) 2012-2013 concrete tie dataset.

Question: How accurate is the material classification?


Automated Diagnosis of Glaucoma Using Digital Fundus Images. Glaucoma is a disease of the optic nerve caused by the increase in the intraocular pressure of the eye. Glaucoma mainly affects the optic disc by increasing the cup size. It can lead to the blindness if it is not detected and treated in proper time. The detection of glaucoma through Optical Coherence Tomography (OCT) and Heidelberg Retinal Tomography (HRT) is very expensive. This paper presents a novel method for glaucoma detection using digital fundus images. Digital image processing techniques, such as preprocessing, morphological operations and thresholding, are widely used for the automatic detection of optic disc, blood vessels and computation of the features. We have extracted features such as cup to disc (c/d) ratio, ratio of the distance between optic disc center and optic nerve head to diameter of the optic disc, and the ratio of blood vessels area in inferior-superior side to area of blood vessel in the nasal-temporal side. These features are validated by classifying the normal and glaucoma images using neural network classifier. The results presented in this paper indicate that the features are clinically significant in the detection of glaucoma. Our system is able to classify the glaucoma automatically with a sensitivity and specificity of 100% and 80% respectively.

Question: What is the cup to disc ratio?


Abiotic and Biotic Stress Responses in Solanum tuberosum Group Phureja DM1-3 516 R44 as Measured through Whole Transcriptome Sequencing. This study conducted an in-depth analysis of the potato (Solanum tuberosum L.) transcriptome in response to abiotic (salinity, drought, and heat) and biotic (Phytophthora infestans, DL-b amino-n-butyric acid, and acibenzolar-s-methyl) stresses and plant hormone treatment (abscisic acid, 6-benzylaminopurine, gibberellic acid, and indole-3-acetic acid) using ribonucleic acid sequencing (RNA-seq) of the doubled monoploid S. tuberosum Group Phureja DM1-3 516 R44 clone. Extensive changes in gene expression were observed with 37% of the expressed genes being differentially expressed in at least one comparison of stress to control tissue. Stress-inducible genes known to function in stress tolerance or to be involved in the regulation of gene expression were among the highest differentially expressed. Members of the MYB, APETALA2 (AP2)/ethylene-responsive element binding factor (ERF), and NAM, ATAF1/2, and CUC2 (NAC) transcription factor families were the most represented regulatory genes. A weighted gene co-expression network analysis yielded 37 co-expression modules containing 9198 genes. Fifty percent of the genes within these co-expression modules were specific to a stress condition indicating conditionspecific responses. Cross-species comparison between potato and Arabidopsis thaliana (L.) Heynh. uncovered differentially expressed orthologs and defined evolutionary conserved genes. Collectively, the transcriptional profiling of RNA-seq data presented here provide a valuable reference for potato stress responses to environmental factors that is supported by statistically significant differences in expression changes, highly interconnected genes in co-expression networks, and evidence of evolutionary conservation. Plants growing in natural habitats are exposed to multiple environmental stresses resulting from abiotic and biotic factors.

Question: What is the difference between abiotic and biotic stress?


Primal-dual subgradient methods for convex problems. In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. The proposed schemes differ from the classical approaches (divergent series methods, mirror descent methods) by presence of two control sequences. The first sequence is responsible for aggregating the support functions in the dual space, and the second one establishes a dynamically updated scale between the primal and dual spaces. This additional flexibility allows to guarantee a boundedness of the sequence of primal test points even in the case of unbounded feasible set. We present the variants of subgradient schemes for nonsmooth convex minimization, minimax problems, saddle point problems, variational inequalities, and stochastic optimization. In all situations our methods are proved to be optimal from the view point of worst-case black-box lower complexity bounds.

Question: What is the worst-case complexity of primal-dual subgradient methods for convex problems?


Online crowdsourcing: Rating annotators and obtaining cost-effective labels. Labeling large datasets has become faster, cheaper, and easier with the advent of crowdsourcing services like Amazon Mechanical Turk. How can one trust the labels obtained from such services? We propose a model of the labeling process which includes label uncertainty, as well a multi-dimensional measure of the annotators' ability. From the model we derive an online algorithm that estimates the most likely value of the labels and the annotator abilities. It finds and prioritizes experts when requesting labels, and actively excludes unreliable annotators. Based on labels already obtained, it dynamically chooses which images will be labeled next, and how many labels to request in order to achieve a desired level of confidence. Our algorithm is general and can handle binary, multi-valued, and continuous annotations (e.g. bounding boxes). Experiments on a dataset containing more than 50,000 labels show that our algorithm reduces the number of labels required, and thus the total cost of labeling, by a large factor while keeping error rates low on a variety of datasets.

Question: How can one trust the labels obtained from such services?


OPINE: Extracting Product Features and Opinions from Reviews. Consumers have to often wade through a large number of on-line reviews in order to make an informed product choice. We introduce OPINE, an unsupervised, high-precision information extraction system which mines product reviews in order to build a model of product features and their evaluation by reviewers.

Question: What is an unsupervised information extraction system?


A Comprehensive Comparison between Neural Style Transfer and Universal Style Transfer. Style transfer aims to transfer arbitrary visual styles to content images. We explore algorithms adapted from two papers that try to solve the problem of style transfer while generalizing on unseen styles or compromised visual quality. Majority of the improvements made focus on optimizing the algorithm for real-time style transfer while adapting to new styles with considerably less resources and constraints. We compare these strategies and compare how they measure up to produce visually appealing images. We explore two approaches to style transfer: neural style transfer with improvements and universal style transfer. We also make a comparison between the different images produced and how they can be qualitatively measured.

Question: What is style transfer?


A deep learning framework for unsupervised affine and deformable image registration. Image registration, the process of aligning two or more images, is the core technique of many (semi-)automatic medical image analysis tasks. Recent studies have shown that deep learning methods, notably convolutional neural networks (ConvNets), can be used for image registration. Thus far training of ConvNets for registration was supervised using predefined example registrations. However, obtaining example registrations is not trivial. To circumvent the need for predefined examples, and thereby to increase convenience of training ConvNets for image registration, we propose the Deep Learning Image Registration (DLIR) framework for unsupervised affine and deformable image registration. In the DLIR framework ConvNets are trained for image registration by exploiting image similarity analogous to conventional intensity-based image registration. After a ConvNet has been trained with the DLIR framework, it can be used to register pairs of unseen images in one shot. We propose flexible ConvNets designs for affine image registration and for deformable image registration. By stacking multiple of these ConvNets into a larger architecture, we are able to perform coarse-to-fine image registration. We show for registration of cardiac cine MRI and registration of chest CT that performance of the DLIR framework is comparable to conventional image registration while being several orders of magnitude faster.

Question: How does deep learning image registration work?


A review of content-based image retrieval systems in medical applications - clinical benefits and future directions. Content-based visual information retrieval (CBVIR) or content-based image retrieval (CBIR) has been one on the most vivid research areas in the field of computer vision over the last 10 years. The availability of large and steadily growing amounts of visual and multimedia data, and the development of the Internet underline the need to create thematic access methods that offer more than simple text-based queries or requests based on matching exact database fields. Many programs and tools have been developed to formulate and execute queries based on the visual or audio content and to help browsing large multimedia repositories. Still, no general breakthrough has been achieved with respect to large varied databases with documents of differing sorts and with varying characteristics. Answers to many questions with respect to speed, semantic descriptors or objective image interpretations are still unanswered. In the medical field, images, and especially digital images, are produced in ever-increasing quantities and used for diagnostics and therapy. The Radiology Department of the University Hospital of Geneva alone produced more than 12,000 images a day in 2002. The cardiology is currently the second largest producer of digital images, especially with videos of cardiac catheterization ( approximately 1800 exams per year containing almost 2000 images each). The total amount of cardiologic image data produced in the Geneva University Hospital was around 1 TB in 2002. Endoscopic videos can equally produce enormous amounts of data. With digital imaging and communications in medicine (DICOM), a standard for image communication has been set and patient information can be stored with the actual image(s), although still a few problems prevail with respect to the standardization. In several articles, content-based access to medical images for supporting clinical dec

Question: What is the total amount of cardiologic image data produced in the Geneva University Hospital?


Category-Based Induction. An argument is categorical if its premises and conclusion are of the form All members ofC have property F, where C is a natural category like FALCON or BIRD, and P remains the same across premises and conclusion. An example is Grizzly bears love onions. Therefore, all bears love onions. Such an argument is psychologically strong to the extent that belief in its premises engenders belief in its conclusion. A subclass of categorical arguments is examined, and the following hypothesis is advanced: The strength of a categorical argument increases with (a) the degree to which the premise categories are similar to the conclusion category and (b) the degree to which the premise categories are similar to members of the lowest level category that includes both the premise and the conclusion categories. A model based on this hypothesis accounts for 13 qualitative phenomena and the quantitative results of several experiments.

Question: What is a categorical argument?


Building a motor simulation de novo: Observation of dance by dancers. Research on action simulation identifies brain areas that are active while imagining or performing simple overlearned actions. Are areas engaged during imagined movement sensitive to the amount of actual physical practice? In the present study, participants were expert dancers who learned and rehearsed novel, complex whole-body dance sequences 5 h a week across 5 weeks. Brain activity was recorded weekly by fMRI as dancers observed and imagined performing different movement sequences. Half these sequences were rehearsed and half were unpracticed control movements. After each trial, participants rated how well they could perform the movement. We hypothesized that activity in premotor areas would increase as participants observed and simulated movements that they had learnt outside the scanner. Dancers' ratings of their ability to perform rehearsed sequences, but not the control sequences, increased with training. When dancers observed and simulated another dancer's movements, brain regions classically associated with both action simulation and action observation were active, including inferior parietal lobule, cingulate and supplementary motor areas, ventral premotor cortex, superior temporal sulcus and primary motor cortex. Critically, inferior parietal lobule and ventral premotor activity was modulated as a function of dancers' ratings of their own ability to perform the observed movements and their motor experience. These data demonstrate that a complex motor resonance can be built de novo over 5 weeks of rehearsal. Furthermore, activity in premotor and parietal areas during action simulation is enhanced by the ability to execute a learned action irrespective of stimulus familiarity or semantic label.

Question: How do dancers rate their ability to perform a dance?


Short-term memory, working memory, and executive functioning in preschoolers: longitudinal predictors of mathematical achievement at age 7 years.. This study examined whether measures of short-term memory, working memory, and executive functioning in preschool children predict later proficiency in academic achievement at 7 years of age (third year of primary school). Children were tested in preschool (M age = 4 years, 6 months) on a battery of cognitive measures, and mathematics and reading outcomes (from standardized, norm-referenced school-based assessments) were taken on entry to primary school, and at the end of the first and third year of primary school. Growth curve analyses examined predictors of math and reading achievement across the duration of the study and revealed that better digit span and executive function skills provided children with an immediate head start in math and reading that they maintained throughout the first three years of primary school. Visual-spatial short-term memory span was found to be a predictor specifically of math ability. Correlational and regression analyses revealed that visual short-term and working memory were found to specifically predict math achievement at each time point, while executive function skills predicted learning in general rather than learning in one specific domain. The implications of the findings are discussed in relation to further understanding the role of cognitive skills in different mathematical tasks, and in relation to the impact of limited cognitive skills in the classroom environment.

Question: What is the difference between short-term memory and working memory?


A Survey of Vehicular Ad hoc Networks Routing Protocols. In recent years, the aspect of vehicular ad hoc network (VANET) is becoming an interesting research area; VANET is a mobile ad hoc network considered as a special case of mobile ad hoc network (MANET). Similar to MANET, VANET is characterized as autonomous and self-configured wireless network. However, VANET has very dynamic topology, large and variable network size, and constrained mobility; these characteristics led to the need for efficient routing and resource saving VANET protocols, to fit with different VANET environments. These differences render traditional MANET's protocols unsuitable for VANET. The aim of this work is to give a survey of the VANETs routing mechanisms, this paper gives an overview of Vehicular ad hoc networks (VANETs) and the existing VANET routing protocols; mainly it focused on vehicle to vehicle (V2V) communication and protocols. The paper also represents the general outlines and goals of VANETs, investigates different routing schemes that have been developed for VANETs, as well as providing classifications of VANET routing protocols (focusing on two classification forms), and gives summarized comparisons between different classes in the context of their methodologies used, strengths, and limitations of each class scheme compared to other classes. Finally, it extracts the current trends and the challenges for efficient routing mechanisms in VANETs.

Question: What is the difference between a vehicular ad hoc network and a mobile ad hoc network?


Heart-Brain Neurodynamics : The Making of Emotions. As pervasive and vital as they are in human experience, emotions have long remained an enigma to science. This monograph explores recent scientific advances that clarify central controversies in the study of emotion, including the relationship between intellect and emotion, and the historical debate on the source of emotional experience. Particular attention is given to the intriguing body of research illuminating the critical role of ascending input from the body to the brain in the generation and perception of emotions. This discussion culminates in the presentation of a systems-oriented model of emotion in which the brain functions as a complex pattern-matching system, continually processing input from both the external and internal environments. From this perspective it is shown that the heart is a key component of the emotional system, thus providing a physiological basis for the long-acknowledged link between the heart and our emotional life.

Question: What is the heart?


Incremental learning for ν-Support Vector Regression. The ν-Support Vector Regression (ν-SVR) is an effective regression learning algorithm, which has the advantage of using a parameter ν on controlling the number of support vectors and adjusting the width of the tube automatically. However, compared to ν-Support Vector Classification (ν-SVC) (Schölkopf et al., 2000), ν-SVR introduces an additional linear term into its objective function. Thus, directly applying the accurate on-line ν-SVC algorithm (AONSVM) to ν-SVR will not generate an effective initial solution. It is the main challenge to design an incremental ν-SVR learning algorithm. To overcome this challenge, we propose a special procedure called initial adjustments in this paper. This procedure adjusts the weights of ν-SVC based on the Karush-Kuhn-Tucker (KKT) conditions to prepare an initial solution for the incremental learning. Combining the initial adjustments with the two steps of AONSVM produces an exact and effective incremental ν-SVR learning algorithm (INSVR). Theoretical analysis has proven the existence of the three key inverse matrices, which are the cornerstones of the three steps of INSVR (including the initial adjustments), respectively. The experiments on benchmark datasets demonstrate that INSVR can avoid the infeasible updating paths as far as possible, and successfully converges to the optimal solution. The results also show that INSVR is faster than batch ν-SVR algorithms with both cold and warm starts.

Question: Incremental learning for ν-Support Vector Regression


Analytical and Experimental Investigation of a Low Torque, Ultra-High Speed Drive System. New application areas are demanding the development of ultra-high speed electrical machines. Significant challenges exist to produce a test bench that is capable of withstanding operating speeds exceeding 500,000 rpm and measuring very low torque values of mNm. This paper describes a purpose built test bench that is able to characterize the operation of an ultra-high speed drive system. Furthermore, the calculation of electromagnetic losses, air friction and critical speeds is presented and a comparison of analytical and experimental results is given. The ultra-high speed machine has an efficiency of 95%, however, in the upper speed ranges the frictional losses become dominant

Question: What is the efficiency of an ultra-high speed machine?


Bayesian Non-Exhaustive Classification A Case Study: Online Name Disambiguation using Temporal Record Streams. The name entity disambiguation task aims to partition the records of multiple real-life persons so that each partition contains records pertaining to a unique person. Most of the existing solutions for this task operate in a batch mode, where all records to be disambiguated are initially available to the algorithm. However, more realistic settings require that the name disambiguation task be performed in an online fashion, in addition to, being able to identify records of new ambiguous entities having no preexisting records. In this work, we propose a Bayesian non-exhaustive classification framework for solving online name disambiguation task. Our proposed method uses a Dirichlet process prior with a Normal x Normal x Inverse Wishart data model which enables identification of new ambiguous entities who have no records in the training data. For online classification, we use one sweep Gibbs sampler which is very efficient and effective. As a case study we consider bibliographic data in a temporal stream format and disambiguate authors by partitioning their papers into homogeneous groups. Our experimental results demonstrate that the proposed method is better than existing methods for performing online name disambiguation task.

Question: How to disambiguate authors in a temporal stream?


Balanced Multithreading: Increasing Throughput via a Low Cost Multithreading Hierarchy. A simultaneous multithreading (SMT) processor can issue instructions from several threads every cycle, allowing it to effectively hide various instruction latencies; this effect increases with the number of simultaneous contexts supported. However, each added context on an SMT processor incurs a cost in complexity, which may lead to an increase in pipeline length or a decrease in the maximum clock rate. This paper presents new designs for multithreaded processors which combine a conservative SMT implementation with a coarse-grained multithreading capability. By presenting more virtual contexts to the operating system and user than are supported in the core pipeline, the new designs can take advantage of the memory parallelism present in workloads with many threads, while avoiding the performance penalties inherent in a many-context SMT processor design. A design with 4 virtual contexts, but which is based on a 2-context SMT processor core, gains an additional 26% throughput when 4 threads are run together.

Question: How many threads can a processor support?


LinkNBed: Multi-Graph Representation Learning with Entity Linkage. Knowledge graphs have emerged as an important model for studying complex multirelational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs and eventually construct a unified graph is a crucial next step for the success of knowledge-based inference for many downstream applications. To this end, we propose LinkNBed, a deep relational learning framework that learns entity and relationship representations across multiple graphs. We identify entity linkage across graphs as a vital component to achieve our goal. We design a novel objective that leverage entity linkage and build an efficient multi-task training procedure. Experiments on link prediction and entity linkage demonstrate substantial improvements over the state-ofthe-art relational learning approaches.

Question: What is the state-ofthe-art relational learning approach?


Comparative Study and Enhancement of Camera Tampering Detection Algorithms. Recently the use of video surveillance systems is widely increasing. Different places are equipped by camera surveillances such as hospitals, schools, airports, museums and military places in order to ensure the safety and security of the persons and their property. Therefore it becomes significant to guarantee the proper working of these systems. Intelligent video surveillance systems equipped by sophisticated digital camera can analyze video information's and automatically detect doubtful actions. The camera tampering detection algorithms may indicate that accidental or suspicious activities have occurred and that causes the abnormality works of the video surveillance. It uses several techniques based on image processing and computer vision. In this paper, comparative study of performance of four algorithms that can detect abnormal disturbance for video surveillance is presented also a new proposed method is exposed.

Question: What is the purpose of the paper?


The "visual cliff".. This simple apparatus is used to investigate depth perception in different animals. All species thus far tested seem able to perceive and avoid a sharp drop as soon as they can move about. Human infants at the creeping and toddling stage are notoriously prone to falls from more or less high places. They must be kept from going over the brink by side panels on their cribs, gates on stairways and the vigilance of adults. As their muscular coordination matures they begin to avoid such accidents on their own. Common sense might suggest that the child learns to recognize falling-off places by experience–that is, by falling and hurting himself. But is experience really the teacher? Or is the ability to perceive and avoid a brink part of the child's original endowment? Answers to these questions will throw light on the genesis of space perception in general. Height perception is a special case of distance perception: information in the light reaching the eye provides stimuli that can be utilized for the discrimination both of depth and of receding distance on the level. At what stage of development can an animal respond effectively to these stimuli? Does the onset of such response vary with animals of different species and habitats? At Cornell University we have been investigating these problems by means of a simple experimental setup that we call a visual cliff. The cliff is a simulated one and hence makes it possible not only to control the optical and other stimuli (auditory and tactual, for instance) but also to protect the experimental subjects. It consists of a board laid across a large sheet of heavy glass which is supported a foot or more above the floor. On one side of the board a sheet of patterned material is placed flush against the undersurface of the glass, giving the glass the appearance as well as the substance of solidity. On the other side a sheet of the same material is laid upon the floor; this side of the board thus becomes the vis

Question: How does the visual cliff work?


Question: What is the satisfaction with life scale?


Instance Weighting for Domain Adaptation in NLP. Domain adaptation is an important problem in natural language processing (NLP) due to the lack of labeled data in novel domains. In this paper, we study the domain adaptation problem from the instance weighting perspective. We formally analyze and characterize the domain adaptation problem from a distributional view, and show that there are two distinct needs for adaptation, corresponding to the different distributions of instances and classification functions in the source and the target domains. We then propose a general instance weighting framework for domain adaptation. Our empirical results on three NLP tasks show that incorporating and exploiting more information from the target domain through instance weighting is effective.

Question: What is the domain adaptation problem?


RMSProp and equilibrated adaptive learning rates for non-convex optimization. Parameter-specific adaptive learning rate methods are computationally efficient ways to reduce the ill-conditioning problems encountered when training large deep networks. Following recent work that strongly suggests that most of the critical points encountered when training such networks are saddle points, we find how considering the presence of negative eigenvalues of the Hessian could help us design better suited adaptive learning rate schemes. We show that the popular Jacobi preconditioner has undesirable behavior in the presence of both positive and negative curvature, and present theoretical and empirical evidence that the socalled equilibration preconditioner is comparatively better suited to non-convex problems. We introduce a novel adaptive learning rate scheme, called ESGD, based on the equilibration preconditioner. Our experiments show that ESGD performs as well or better than RMSProp in terms of convergence speed, always clearly improving over plain stochastic gradient descent.

Question: What is the difference between RMSProp and equilibrated adaptive learning rates for non-convex optimization?


Trajectory planning for car-like vehicles: A modular approach. We consider the problem of trajectory planning with geometric constraints for a car-like vehicle. The vehicle is described by its dynamic model, considering such effects as lateral slipping and aerodynamic drag. We propose a modular solution, where three different problems are identified and solved by specific modules. The execution of the three modules can be orchestrated in different ways in order to produce efficient solutions to a variety of trajectory planning problems (e.g., obstacle avoidance, or overtake). As a specific example, we show how to generate the optimal lap on a specified racing track. The numeric examples provided in the paper are good witnesses of the effectiveness of our strategy.

Question: How to generate the optimal lap on a specified racing track?


Using speakers' referential intentions to model early cross-situational word learning.. Word learning is a "chicken and egg" problem. If a child could understand speakers' utterances, it would be easy to learn the meanings of individual words, and once a child knows what many words mean, it is easy to infer speakers' intended meanings. To the beginning learner, however, both individual word meanings and speakers' intentions are unknown. We describe a computational model of word learning that solves these two inference problems in parallel, rather than relying exclusively on either the inferred meanings of utterances or cross-situational word-meaning associations. We tested our model using annotated corpus data and found that it inferred pairings between words and object concepts with higher precision than comparison models. Moreover, as the result of making probabilistic inferences about speakers' intentions, our model explains a variety of behavioral phenomena described in the word-learning literature. These phenomena include mutual exclusivity, one-trial learning, cross-situational learning, the role of words in object individuation, and the use of inferred intentions to disambiguate reference.

Question: What is the chicken and egg problem?


Multi-User Energy Consumption Monitoring and Anomaly Detection with Partial Context Information. Anomaly detection is an important problem in building energy management in order to identify energy theft and inefficiencies. However, it is hard to differentiate actual anomalies from the genuine changes in energy consumption due to seasonal variations and changes in personal settings such as holidays. One of the important drawbacks of existing anomaly detection algorithms is that various unknown context variables, such as seasonal variations, can affect the energy consumption of users in ways that appear anomalous to existing time series based anomaly detection algorithms.  In this paper, we present a system for monitoring the energy consumption of multiple users within a neighborhood and a novel algorithm for detecting anomalies by combining data from multiple users. For each user, the neighborhood is defined as the set of all other users that have similar characteristics (function, location or demography), and are therefore likely to react and consume energy in the similar way in response to the external conditions. The neighborhood can be predefined based on prior customer information, or can be identified through an analysis of historical energy consumption. The proposed algorithm works as a two-step process. In the first step, the algorithm periodically computes an anomaly score for each user by just considering their own energy consumption and variations in the consumption of the past. In the second step, the anomaly score for a user is adjusted by analyzing the energy consumption data in the neighborhood. The collation of data within the neighborhood allows the proposed algorithm to differentiate between these genuine effects and real anomalous behavior of users. Unlike multivariate time series anomaly detection algorithms, the proposed algorithm can identify specific users that are exhibiting anomalous behavior. The capabilities of the algorithm are demonstrate

Question: How to detect anomalies in energy consumption?


User Experience in Service Design: A Case Study from Algeria. The design of crisis management services is crucial for emerging countries such as Algeria. It must take into account the experiences of diverse stakeholders. The authors investigate user experience (UX) practices from a service design perspective and describe a case study from Algeria exploring UX-driven service design for crisis management.

Question: What is a case study?


Coupling CCG and Hybrid Logic Dependency Semantics. Categorial grammar has traditionally used the λ-calculus to represent meaning. We present an alternative, dependency-based perspective on linguistic meaning and situate it in the computational setting. This perspective is formalized in terms of hybrid logic and has a rich yet perspicuous propositional ontology that enables a wide variety of semantic phenomena to be represented in a single meaning formalism. Finally, we show how we can couple this formalization to Combinatory Categorial Grammar to produce interpretations compositionally.

Question: What is the difference between categorial grammar and hybrid logic?


Design issues in CMOS differential LC oscillators. An analysis of phase noise in differential crosscoupled inductance–capacitance(LC) oscillators is presented. The effect of tail current and tank power dissipation on the voltage amplitude is shown. Various noise sources in the complementary cross-coupled pair are identified, and their effect on phase noise is analyzed. The predictions are in good agreement with measurements over a large range of tail currents and supply voltages. A 1.8-GHz LC oscillator with a phase noise of 121 dBc/Hz at 600 kHz is demonstrated, dissipating 6 mW of power using on-chip spiral inductors.

Question: What is the phase noise of a CMOS differential LC oscillator?


Conducted EMI noise mitigation in DC-DC converters using active filtering method. Electromagnetic interference (EMI) noise mitigation is an important issue that should be addressed and emphasized when designing DC/DC converters. These later, are known to be the primary culprit of the EMI noise generation in most of the electronic systems, mainly due to the switching action of the MOSFET circuitries. Passive input EMI LC filters have been the intuitive solution for EMI noise mitigation; hence they have been integrated in almost every DC/DC converters. However, their size, weight and cost can cause a significant constraint in some applications. To overcome these constraints, an input active EMI filter is proposed. The active filter is based on the noise current phase shift and the injection of this noise current back to the DC input bus. However, the combination of the input active and the passive filters shows a substantial attenuation of the conducted emissions as compared to the passive filter only, which in turn contributes to the reduction of the size and weight of the input passive EMI filter. The proposed combination provides a design solution for compliance engineers where the PCB real-estate is an issue. Experimental results to demonstrate the performance and the effectiveness of the input active EMI filter in DC/DC converters are presented.

Question: How to reduce the size of the passive EMI filter?


Algorithms for the Longest Common Subsequence Problem. We start by def ining conven t ions and t e rmino logy that will be used th roughou t this paper . String C = clc~ ... cp is a subsequence of string A = aja2 "'" am if there is a mapp ing F : {1, 2 . . . . , p} ~ {1, 2, ... , m} such that F(i) = k only if c~ = ak and F is a m o n o t o n e strictly increasing funct ion (i .e. F(i) = u, F(]) = v, and i < j imply that u < v). C can be fo rmed by delet ing m p (not necessari ly ad jacen t ) symbols f rom A . F o r example , " c o u r s e " is a subsequence of " c o m p u t e r sc ience . " Str ing C is a c o m m o n s ubs equence of strings A and B if C is a s u b s e q u e n c e of A and also a subsequence of B. String C is a longest c o m m o n subsequence (abbrev ia ted LCS) of string A and B if C is a c o m m o n subsequence of A and B of maximal length , i .e. there is no c o m m o n subsequence of A and B that has grea te r length. Th roughou t this paper , we assume that A and B are strings of lengths m and n , m _< n , that have an LCS C of (unknown) length p . We assume that the symbols that may appea r in these strings c o m e f rom some a lphabet of size t . A symbol can be s tored in m e m o r y by using log t bits, which we assume will fit in one word of memory . Symbols can be c o m p a r e d (a -< b?) in one t ime unit . The n u m b e r of di f ferent symbols that actual ly appear in string B is def ined to be s (which must be less than n and t). The longest c o m m o n s u b s e q u e n c e prob lem has been solved by using a recurs ion re la t ionship on the length of the solut ion [7, 12, 16, 21]. These are general ly appl icable a lgor i thms that take O ( m n ) t ime for any input strings o f lengths m and n even though the lower bound on t ime of O ( m n ) need not apply to all inputs [2]. We present a lgor i thms that , depend ing on the na ture of the Input, may not requ i re quadra t ic t ime to r ecove r an LCS. The first a lgor i thm is ap

Question: What is the longest common subsequence problem?


Sustainable Passenger Transportation : Dynamic RideSharing. AND

Question: Dynamic RideSharing


PPDDL 1 . 0 : An Extension to PDDL for Expressing Planning Domains with Probabilistic Effects. We desribe a variation of the planning domain definition language, PDDL, that permits the modeling of probabilistic planning problems with rewards. This language, PPDDL1.0, was used as the input language for the probabilistic track of the 4th International Planning Competition. We provide the complete syntax for PPDDL1.0 and give a semantics of PPDDL1.0 planning problems in terms of Markov decision processes. Department of Computer Science, Rutgers University, Piscataway, NJ 08854, USA

Question: What is the syntax of PPDDL?


Speed-Security Tradeo s in Blockchain Protocols. Transaction processing speed is one of the major considerations in cryptocurrencies that are based on proof of work (POW) such as Bitcoin. At an intuitive level it is widely understood that processing speed is at odds with the security aspects of the underlying POW based consensus mechanism of such protocols, nevertheless the tradeo between the two properties is still not well understood. In this work, motivated by recent work [9] in the formal analysis of the Bitcoin backbone protocol, we investigate the tradeo between provable security and transaction processing speed viewing the latter as a function of the block generation rate. We introduce a new formal property of blockchain protocols, called chain growth, and we show it is fundamental for arguing the security of a robust transaction ledger. We strengthen the results of [9] showing for the rst time that reasonable security bounds hold even for the faster (than Bitcoin's) block generation rates that have been adopted by several major alt-coins (including Litecoin, Dogecoin etc.). We then provide a rst formal security proof of the GHOST rule for blockchain protocols. The GHOST rule was put forth in [14] as a mechanism to improve transaction processing speed and a variant of the rule is adopted by Ethereum. Our security analysis of the GHOST backbone matches our new analysis for Bitcoin in terms of the common pre x property but falls short in terms of chain growth where we provide an attack that substantially reduces the chain speed compared to Bitcoin. While our results establish the GHOST variant as a provably secure alternative to standard Bitcoin-like transaction ledgers they also highlight potential shortcomings in terms of processing speed compared to Bitcoin. We nally present attacks and simulation results against blockchain protocols (both for Bitcoin and GHOST) that present natural upper barriers for the speed-security tradeo . By combining our positive and

Question: What is the tradeo between security and speed in blockchain protocols?


Semi-global matching based disparity estimate using fast Census transform. The Census transform is very useful in stereo matching algorithms. But the traditional Census transform cost too much computation, and its accuracy and robustness are not satisfying. In this paper, a modified semi-global matching (SGM) algorithm based on the fast Census transform is proposed to improve the quality of the range map and decrease the computation. In addition, we modify the disparity refinement to enhance the quality of the estimated range map. Our experiments show that the proposed method performs better than the original SGM algorithm in terms of the accuracy and the anti-noise capability.

Question: What is the fast Census transform?


Translating evidence-based decision making into practice: EBDM concepts and finding the evidence.. This is the first of 2 articles that focuses on strategies that can be used to integrate an evidence-based decision making [EBDM] approach into practice. The articles will focus on EBDM methodology and enhancing skills, including how to find valid evidence to answer clinical questions, critically appraise the evidence found and determine if it applies. In addition, online resources will be identified to supplement information presented in each article. The purpose of this article is to define evidence-based decision making and discuss skills necessary for practitioners to efficiently adopt EBDM. It will provide a guide for finding evidence to answer a clinical question using PubMed's specialized searching tools under Clinical Queries.

Question: What is the purpose of this article?


Traffic sign detection and recognition for intelligent vehicle. In this paper, we propose a computer vision based system for real-time robust traffic sign detection and recognition, especially developed for intelligent vehicle. In detection phase, a color-based segmentation method is used to scan the scene in order to quickly establish regions of interest (ROI). Sign candidates within ROIs are detected by a set of Haar wavelet features obtained from AdaBoost training. Then, the Speeded Up Robust Features (SURF) is applied for the sign recognition. SURF finds local invariant features in a candidate sign and matches these features to the features of template images that exist in data set. The recognition is performed by finding out the template image that gives the maximum number of matches. We have evaluated the proposed system on our intelligent vehicle SmartVII. A recognition accuracy of over 90% in real-time has been achieved.

Question: What is the speed of the vehicle?


Privacy protection issues in social networking sites. Social Networking Sites (SNS) have become very popular during the past few years, as they allow users to both express their individuality and meet people with similar interests. Nonetheless, there are also many potential threats to privacy associated with these SNS such as identity theft and disclosure of sensitive information. However, many users still are not aware of these threats and the privacy settings provided by SNS are not flexible enough to protect user data. In addition, users do not have any control over what others reveal about them. As such, we conduct a preliminary study which examines the privacy protection issues on Social Networking Sites (SNS) such as MySpace, Facebook and LinkedIn. Based on this study, we identify three privacy problems in SNS and propose a Privacy Framework as a foundation to cope with these problems.

Question: What are the privacy issues in social networking sites?


DeFlaker: Automatically Detecting Flaky Tests. Developers often run tests to check that their latest changes to a code repository did not break any previously working functionality. Ideally, any new test failures would indicate regressions caused by the latest changes. However, some test failures may not be due to the latest changes but due to non-determinism in the tests, popularly called flaky tests. The typical way to detect flaky tests is to rerun failing tests repeatedly. Unfortunately, rerunning failing tests can be costly and can slow down the development cycle.  We present the first extensive evaluation of rerunning failing tests and propose a new technique, called DeFlaker, that detects if a test failure is due to a flaky test without rerunning and with very low runtime overhead. DeFlaker monitors the coverage of latest code changes and marks as flaky any newly failing test that did not execute any of the changes. We deployed DeFlaker live, in the build process of 96 Java projects on TravisCI, and found 87 previously unknown flaky tests in 10 of these projects. We also ran experiments on project histories, where DeFlaker detected 1, 874 flaky tests from 4, 846 failures, with a low false alarm rate (1.5%). DeFlaker had a higher recall (95.5% vs. 23%) of confirmed flaky tests than Maven's default flaky test detector.

Question: How to detect flaky tests?


A Region Ensemble for 3-D Face Recognition. In this paper, we introduce a new system for 3D face recognition based on the fusion of results from a committee of regions that have been independently matched. Experimental results demonstrate that using 28 small regions on the face allow for the highest level of 3D face recognition. Score-based fusion is performed on the individual region match scores and experimental results show that the Borda count and consensus voting methods yield higher performance than the standard sum, product, and min fusion rules. In addition, results are reported that demonstrate the robustness of our algorithm by simulating large holes and artifacts in images. To our knowledge, no other work has been published that uses a large number of 3D face regions for high-performance face matching. Rank one recognition rates of 97.2% and verification rates of 93.2% at a 0.1% false accept rate are reported and compared to other methods published on the face recognition grand challenge v2 data set.

Question: How many regions are used for 3d face recognition?


A 28GHz SiGe BiCMOS phase invariant VGA. The paper describes a technique to design a phase invariant variable gain amplifier (VGA). Variable gain is achieved by varying the bias current in a BJT, while the phase variation is minimized by designing a local feedback network such that the applied base to emitter voltage has a bias-dependent phase variation which compensates the inherent phase variation of the transconductance. Two differential 28GHz VGA variants based on these principles achieve <;5° phase variation over 8dB and 18dB of gain control range, respectively, with phase invariance maintained over PVT. Implemented in GF 8HP BiCMOS technology, the VGAs achieve 18dB nominal gain, 4GHz bandwidth, and IP1dB > -13dBm while consuming 35mW.

Question: What is a 28GHz SiGe BiCMOS phase invariant VGA?


Combining OpenFlow and sFlow for an effective and scalable anomaly detection and mitigation mechanism on SDN environments. Software Defined Networks (SDNs) based on the OpenFlow (OF) protocol export controlplane programmability of switched substrates. As a result, rich functionality in traffic management, load balancing, routing, firewall configuration, etc. that may pertain to specific flows they control, may be easily developed. In this paper we extend these functionalities with an efficient and scalable mechanism for performing anomaly detection and mitigation in SDN architectures. Flow statistics may reveal anomalies triggered by large scale malicious events (typically massive Distributed Denial of Service attacks) and subsequently assist networked resource owners/operators to raise mitigation policies against these threats. First, we demonstrate that OF statistics collection and processing overloads the centralized control plane, introducing scalability issues. Second, we propose a modular architecture for the separation of the data collection process from the SDN control plane with the employment of sFlow monitoring data. We then report experimental results that compare its performance against native OF approaches that use standard flow table statistics. Both alternatives are evaluated using an entropy-based method on high volume real network traffic data collected from a university campus network. The packet traces were fed to hardware and software OF devices in order to assess flow-based datagathering and related anomaly detection options. We subsequently present experimental results that demonstrate the effectiveness of the proposed sFlow-based mechanism compared to the native OF approach, in terms of overhead imposed on usage of system resources. Finally, we conclude by demonstrating that once a network anomaly is detected and identified, the OF protocol can effectively mitigate it via flow table modifications. 2013 Elsevier B.V. All rights reserved.

Question: What is the difference between sFlow and OF?


Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Design. Flow-based generative models are powerful exact likelihood models with efficient sampling and inference. Despite their computational efficiency, flowbased models generally have much worse density modeling performance compared to state-of-the-art autoregressive models. In this paper, we investigate and improve upon three limiting design choices employed by flow-based models in prior work: the use of uniform noise for dequantization, the use of inexpressive affine flows, and the use of purely convolutional conditioning networks in coupling layers. Based on our findings, we propose Flow++, a new flow-based model that is now the state-of-the-art non-autoregressive model for unconditional density estimation on standard image benchmarks. Our work has begun to close the significant performance gap that has so far existed between autoregressive models and flow-based models. Our implementation is available at https://github.com/aravind0706/flowpp.

Question: What is flow-based generative models?


Frame-by-frame language identification in short utterances using deep neural networks. This work addresses the use of deep neural networks (DNNs) in automatic language identification (LID) focused on short test utterances. Motivated by their recent success in acoustic modelling for speech recognition, we adapt DNNs to the problem of identifying the language in a given utterance from the short-term acoustic features. We show how DNNs are particularly suitable to perform LID in real-time applications, due to their capacity to emit a language identification posterior at each new frame of the test utterance. We then analyse different aspects of the system, such as the amount of required training data, the number of hidden layers, the relevance of contextual information and the effect of the test utterance duration. Finally, we propose several methods to combine frame-by-frame posteriors. Experiments are conducted on two different datasets: the public NIST Language Recognition Evaluation 2009 (3 s task) and a much larger corpus (of 5 million utterances) known as Google 5M LID, obtained from different Google Services. Reported results show relative improvements of DNNs versus the i-vector system of 40% in LRE09 3 second task and 76% in Google 5M LID.

Question: How to combine frame-by-frame posteriors?


Phishing counter measures and their effectiveness – literature review. Purpose – Phishing is essentially a social engineering crime on the Web, whose rampant occurrences and technique advancements are posing big challenges for researchers in both academia and the industry. The purpose of this study is to examine the available phishing literatures and phishing countermeasures, to determine how research has evolved and advanced in terms of quantity, content and publication outlets. In addition to that, this paper aims to identify the important trends in phishing and its countermeasures and provides a view of the research gap that is still prevailing in this field of study. Design/methodology/approach – This paper is a comprehensive literature review prepared after analysing 16 doctoral theses and 358 papers in this field of research. The papers were analyzed based on their research focus, empirical basis on phishing and proposed countermeasures. Findings – The findings reveal that the current anti-phishing approaches that have seen significant deployments over the internet can be classified into eight categories. Also, the different approaches proposed so far are all preventive in nature. A Phisher will mainly target the innocent consumers who happen to be the weakest link in the security chain and it was found through various usability studies that neither server-side security indicators nor client-side toolbars and warnings are successful in preventing vulnerable users from being deceived. Originality/value – Educating the internet users about phishing, as well as the implementation and proper application of anti-phishing measures, are critical steps in protecting the identities of online consumers against phishing attacks. Further research is required to evaluate the effectiveness of the available countermeasures against fresh phishing attacks. Also there is the need to find out the factors which influence internet user's ability to correctly identify phishing webs

Question: What is phishing?


An ANN-Based Synthesis Model for the Single-Feed Circularly-Polarized Square Microstrip Antenna With Truncated Corners. An artificial neural network-based synthesis model is proposed for the design of single-feed circularly-polarized square microstrip antenna (CPSMA) with truncated corners. To obtain the training data sets, the resonant frequency and Q-factor of square microstrip antennas are calculated by empirical formulae. Then the size of the truncated corners and the operation frequency with the best axial ratio are obtained. Using the Levenberg-Marquardt (LM) algorithm, a three hidden layered network is trained to achieve an accurate synthesis model. At last, the model is validated by comparing its results with the electromagnetic simulation and measurement. It is extremely useful to antenna engineers for directly obtaining patch physical dimensions of the single-feed CPSMA with truncated corners.

Question: What is the size of the truncated corners?


Bazaar-Extension: A CloudSim Extension for Simulating Negotiation Based Resource Allocations. Negotiation processes taking place between two or more parties need to agree on a viable execution mechanism. Auctioning protocols have proven useful as electronic negotiation mechanisms in the past. Auctions are a way of determining the price of a resource in a dynamic way. Additionally, auctions have well defined rules such as winner and loser determination, time restrictions or minimum price increment. These restrictions are necessary to ensure fair and transparent resource allocation. However, these rules are limiting flexibility of consumers and providers. In this paper we introduce a novel negotiation based resource allocation mechanisms using the offer-counteroffer negotiation protocol paradigm. This allocation mechanism shows similarities to the supermarket approach as consumer and provider are able to communicate directly. Further, the price is determined in a dynamic way similar to auctioning. We developed a Bazaar-Extension for CloudSim which simulates negotiation processes with different strategies. In this paper we introduce and analyze a specific Genetic Algorithm based negotiation strategy. For the comparison of the efficiency of resource allocations a novel Bazaar-Score was used.

Question: What is a Bazaar-Extension?


Information overload and the message dynamics of online interaction spaces: a theoretical model and empirical exploration. This publication contains reprint articles for which IEEE does not hold copyright. Full text is not available on IEEE Xplore for these articles.

Question: What is the full text of this publication?


AmiGO: online access to ontology and annotation data. AmiGO is a web application that allows users to query, browse and visualize ontologies and related gene product annotation (association) data. AmiGO can be used online at the Gene Ontology (GO) website to access the data provided by the GO Consortium; it can also be downloaded and installed to browse local ontologies and annotations. AmiGO is free open source software developed and maintained by the GO Consortium.

Question: What is the ontology of the gene ontology?