Syntax Annotation for the GENIA Corpus

Linguistically annotated corpus based on texts in biomedical domain has been constructed to tune natural language processing (NLP) tools for biotextmining. As the focus of information extraction is shifting from "nominal" information such as named entity to "verbal" information such as function and interaction of substances, application of parsers has become one of the key technologies and thus the corpus annotated for syntactic structure of sentences is in demand. A subset of the GENIA corpus consisting of 500 MEDLINE abstracts has been annotated for syntactic structure in an XMLbased format based on Penn Treebank II (PTB) scheme. Inter-annotator agreement test indicated that the writing style rather than the contents of the research abstracts is the source of the difficulty in tree annotation, and that annotation can be stably done by linguists without much knowledge of biology with appropriate guidelines regarding to linguistic phenomena particular to scientific texts.


Algorithms for time series knowledge mining

Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe disadvantages for knowledge discovery. The Time Series Knowledge Representation (TSKR) is a new hierarchical language for interval patterns expressing the temporal concepts of coincidence and partial order. We present effective and efficient mining algorithms for such patterns based on itemset techniques. A novel form of search space pruning effectively reduces the size of the mining result to ease interpretation and speed up the algorithms. On a real data set a concise set of TSKR patterns can explain the underlying temporal phenomena, whereas the patterns found with Allen's relations are far more numerous yet only explain fragments of the data.


Kodu Game Lab: a programming environment

Kodu Game Lab is a tile-based visual programming tool that enables users to learn programming concepts through making and playing computer games. Kodu is a relatively new programming language designed specifically for young children to learn through independent exploration. It is integrated in a real-time isometric 3D gaming environment that is designed to compete with modern console games in terms of intuitive user interface and graphical production values.


KairosVM: Deterministic introspection for real-time virtual machine hierarchical scheduling

Consolidation and isolation are key technologies that promoted the undisputed popularity of virtualization in most of the computer industry. This popularity has recently led to a growing interest in real-time virtualization, making this technology enter the real-time system market. However, it has several issues due to the strict timing guarantees contracted. Moreover supporting legacy software stacks adds another level of complexity when the software is a black box. We present KairosVM, a latency-bounded, real-time extension to Linux's KVM module. It aims to bridge the lack of communication of the real-time requirements between the guest scheduler and the host scheduler, exploiting virtual machine introspection. The hypervisor captures the real-time requirements of the guest by catching previously added undefined instructions, without the need to do any modification to the guests. Our evaluations show that KairosVM's overhead is negligible when compared to existing introspection solutions thus can be used in real-time.


Music Feature Maps with Convolutional Neural Networks for Music Genre Classification

Nowadays, deep learning is more and more used for Music Genre Classification: particularly Convolutional Neural Networks (CNN) taking as entry a spectrogram considered as an image on which are sought different types of structure.
 But, facing the criticism relating to the difficulty in understanding the underlying relationships that neural networks learn in presence of a spectrogram, we propose to use, as entries of a CNN, a small set of eight music features chosen along three main music dimensions: dynamics, timbre and tonality. With CNNs trained in such a way that filter dimensions are interpretable in time and frequency, results show that only eight music features are more efficient than 513 frequency bins of a spectrogram and that late score fusion between systems based on both feature types reaches 91% accuracy on the GTZAN database.


A study of the documentation essential to software maintenance

Software engineering has been striving for years to improve the practice of software development and maintenance. Documentation has long been prominent on the list of recommended practices to improve development and help maintenance. Recently however, agile methods started to shake this view, arguing that the goal of the game is to produce software and that documentation is only useful as long as it helps to reach this goal.On the other hand, in the re-engineering field, people wish they could re-document useful legacy software so that they may continue maintain them or migrate them to new platform.In these two case, a crucial question arises: "How much documentation is enough?" In this article, we present the results of a survey of software maintainers to try to establish what documentation artifacts are the most useful to them.


Experiments with a New Boosting Algorithm

In an earlier paper [9], we introduced a new “boosting” algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learning algorithm that consistently generates classifiers whose performance is a little better than random guessing. We also introduced the related notion of a “pseudo-loss” which is a method for forcing a learning algorithm of multi-label concepts to concentrate on the labels that are hardest to discriminate. In this paper, we describe experiments we carried out to assess how well AdaBoost with and without pseudo-loss, performs on real learning problems. We performed two sets of experiments. The first set compared boosting to Breiman’s [1] “bagging” method when used to aggregate various classifiers (including decision trees and single attribute-value tests). We compared the performance of the two methods on a collection of machine-learning benchmarks. In the second set of experiments, we studied in more detail the performance of boosting using a nearest-neighbor classifier on an OCR problem.


Machine Learning, Neural and Statistical Classification

Algorithms which construct classifiers from sample data -such as neural networks, radial basis functions, and decision trees -have attracted growing attention for their wide applicability. Researchers in the fields of Statistics, Artificial Intelligence, Machine Learning, Data Mining, and Pattern Recognition are continually introducing (or rediscovering) induction methods, and often publishing implementing code. It is natural for practitioners and potential users to wonder, "Which classification technique is best?", or more realistically, "What subset of methods tend to work well for a given type of dataset?". This book provides perhaps the best current answer to that question.


Modeling Human Understanding of Complex Intentional Action with a Bayesian Nonparametric Subgoal Model

Most human behaviors consist of multiple parts, steps, or subtasks. These structures guide our action planning and execution, but when we observe others, the latent structure of their actions is typically unobservable, and must be inferred in order to learn new skills by demonstration, or to assist others in completing their tasks. For example, an assistant who has learned the subgoal structure of a colleague’s task can more rapidly recognize and support their actions as they unfold. Here we model how humans infer subgoals from observations of complex action sequences using a nonparametric Bayesian model, which assumes that observed actions are generated by approximately rational planning over unknown subgoal sequences. We test this model with a behavioral experiment in which humans observed different series of goal-directed actions, and inferred both the number and composition of the subgoal sequences associated with each goal. The Bayesian model predicts human subgoal inferences with high accuracy, and significantly better than several alternative models and straightforward heuristics. Motivated by this result, we simulate how learning and inference of subgoals can improve performance in an artificial user assistance task. The Bayesian model learns the correct subgoals from fewer observations, and better assists users by more rapidly and accurately inferring the goal of their actions than alternative approaches.


Webcam-Based Accurate Eye-Central Localization

This paper contains experimental procedure of webcam-based eye-tracker specially for low power devices. This paper consists of five processes. First one is background suppression for reducing average processing requirement. Second one is Haar-cascade feature-based face detection algorithm. Third one is geometrically eye-position determination. The fourth part is to detect and track eye-ball center using mean of gradient vector. The fifth and last step is to detect where the user looking. We simply calculate percentage of movement of eye to detect either it looking left, right, up or down. This procedure is highly effective with satisfactory accuracy. It also requires less processing power.


Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy

This paper addresses pattern classification in the framework of domain adaptation by considering methods that solve problems in which training data are assumed to be available only for a source domain different (even if related) from the target domain of (unlabeled) test data. Two main novel contributions are proposed: 1) a domain adaptation support vector machine (DASVM) technique which extends the formulation of support vector machines (SVMs) to the domain adaptation framework and 2) a circular indirect accuracy assessment strategy for validating the learning of domain adaptation classifiers when no true labels for the target--domain instances are available. Experimental results, obtained on a series of two-dimensional toy problems and on two real data sets related to brain computer interface and remote sensing applications, confirmed the effectiveness and the reliability of both the DASVM technique and the proposed circular validation strategy.


Semi-Supervised Kernel Matching for Domain Adaptation

In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distribution. Specifically, we learn a prediction function on the labeled source data while mapping the target data points to similar source data points by matching the target kernel matrix to a submatrix of the source kernel matrix based on a Hilbert Schmidt Independence Criterion. We formulate this simultaneous learning and mapping process as a non-convex integer optimization problem and present a local minimization procedure for its relaxed continuous form. Our empirical results show the proposed kernel matching method significantly outperforms alternative methods on the task of cross domain sentiment classification.


Soft-Switching Solid-State Transformer (S4T)

This paper presents a new topology for a fully bidirectional soft-switching solid-state transformer (S4T). The minimal topology, featuring 12 main devices and a high-frequency transformer, does not use an intermediate dc voltage link, and provides sinusoidal input and output voltages. The S4T can be configured to interface with two- or multiterminal dc, single- or multiphase ac systems. An auxiliary resonant circuit creates zero-voltage-switching conditions for main devices from no-load to full-load, and helps manage interactions with circuit parasitic elements. The modularized structure allows series and/or parallel stacking of converter cells for high-voltage and high-power applications.


Categorical equational systems : algebraic models and equational reasoning

Declaration This dissertation is the result of my own work done under the guidance of my supervisor, and includes nothing which is the outcome of work done in collaboration except where specifically indicated in the text. This dissertation is not substantially the same as any that I have submitted or will be submitting for a degree or diploma or other qualification at this or any other University. This dissertation does not exceed the regulation length of 60,000 words, including tables and footnotes. 5 Summary We introduce two abstract notions of equational algebraic system, called Equational System (ES) and Term Equational System (TES), in order to achieve sufficient expressivity as needed in modern applications in computer science. These generalize the classical concept of (enriched) algebraic theory of Kelly and Power [1993]. We also develop a theory for constructing free algebras for ESs and a theory of equational reasoning for TESs. In Part I, we introduce the general abstract, yet practical, concept of equational system and develop finitary and transfinitary conditions under which we give an explicit construction of free algebras for ESs. This free construction extends the well-known construction of free algebras for ω-cocontinuous endofunctors to an equational setting, capturing the intuition that free algebras consist of freely constructed terms quotiented by given equations and congruence rules. We further show the monadicity and cocom-pleteness of categories of algebras for ESs under the finitary and transfinitary conditions. To illustrate the expressivity of equational systems, we exhibit various examples including two modern applications, the Σ-monoids of Fiore et al. [1999] and the π-algebras of Stark [2005]. In Part II, we introduce the more concrete notion of term equational system, which is obtained by specializing the concept of equational system, but remains more general than that of enriched algebraic theory. We first develop a sound logical deduction system, called Term Equational Logic (TEL), for equational reasoning about algebras of TESs. Then, to pursue a complete logic, we give an internal completeness result, from which together with the explicit construction of free algebras one can typically synthesize sound and complete rewriting-style equational logics. To exemplify this scenario, we give two applications: multi-sorted algebraic theories and nominal equational theories of Clouston and Pitts [2007] and of Gabbay and Mathijssen [2007]. 7 Acknowledgements First and foremost, I am deeply grateful to my Ph.D. supervisor Marcelo Fiore for his patient guidance and support, without which this thesis would …


A Novel Myoelectric Pattern Recognition Strategy for Hand Function Restoration After Incomplete Cervical Spinal Cord Injury

This study presents a novel myoelectric pattern recognition strategy towards restoration of hand function after incomplete cervical spinal cord Injury (SCI). High density surface electromyogram (EMG) signals comprised of 57 channels were recorded from the forearm of nine subjects with incomplete cervical SCI while they tried to perform six different hand grasp patterns. A series of pattern recognition algorithms with different EMG feature sets and classifiers were implemented to identify the intended tasks of each SCI subject. High average overall accuracies (>; 97%) were achieved in classification of seven different classes (six intended hand grasp patterns plus a hand rest pattern), indicating that substantial motor control information can be extracted from partially paralyzed muscles of SCI subjects. Such information can potentially enable volitional control of assistive devices, thereby facilitating restoration of hand function. Furthermore, it was possible to maintain high levels of classification accuracy with a very limited number of electrodes selected from the high density surface EMG recordings. This demonstrates clinical feasibility and robustness in the concept of using myoelectric pattern recognition techniques toward improved function restoration for individuals with spinal injury.


Suicidal decapitation using a tractor loader: a case report and review of the literature.

In forensic practice, decapitated bodies are predominantly associated with decapitation by wheels of trains or with postmortem dismemberment following homicide. In the suicidal context, decapitation accounts for less than 1% of total suicide. Apart from decapitation by trains, other encountered methods involve suicidal hanging and vehicle-assisted ligature suicide. Reported here is a unique case of suicidal decapitation in a 45-year-old man using a tractor loader at the foot of a silo, on his farm. The head was recovered in the loader and there were several impact spots from the loader as well as blood on the silo wall. The autopsy revealed a complete decapitation wound with the severance plane located between the third and fourth cervical vertebra. A 1.5 cm wide abrasion on the anterior part of the neck and abrasions under the chin were noted. This very unique case of intentional suicidal decapitation is the first reported case of a planned system intended to create decapitation outside the unique case of homemade guillotine and the more common decapitation by train.


Anatomical Basis for Safe and Effective Volumization of the Temple.

BACKGROUND
One of the earliest but often unaddressed signs of facial aging is volume loss in the temple. Treatment of the area can produce satisfying results for both patient and practitioner.

OBJECTIVE
Safe injection requires explicit knowledge of the anatomy to avoid complications related to the multitude of vessels that course throughout the region at various depths. The authors aim to detail the anatomy of the area and provide a safe and easy-to-follow method for injection.

MATERIALS AND METHODS
The authors review the relevant anatomy of the temporal region and its application to cosmetic filler injections.

RESULTS
The authors describe an easy-to-follow approach for a safe and effective injection window based on numerous anatomical studies. Injection in this area is not without risk, including potential blindness. The authors review the potential complications and their treatments.

CONCLUSION
Hollowing of the temple is an early sign of aging that, when corrected, can lead to significant patient and practitioner satisfaction. Proper anatomically knowledge is required to avoid potentially severe complications. In this study, the authors present a reliable technique to safely and effectively augment this often undertreated area of the aging face.


Weakly Supervised Object Discovery by Generative Adversarial & Ranking Networks.

The deep generative adversarial networks (GAN) recently have been shown to be promising for different computer vision applications, like image editing, synthesizing high resolution images, generating videos, etc. These networks and the corresponding learning scheme can handle various visual space mappings. We approach GANs with a novel training method and learning objective, to discover multiple object instances for three cases: 1) synthesizing a picture of a specific object within a cluttered scene; 2) localizing different categories in images for weakly supervised object detection; and 3) improving object discovery in object detection pipelines. A crucial advantage of our method is that it learns a new deep similarity metric, to distinguish multiple objects in one image. We demonstrate that the network can act as an encoder-decoder generating parts of an image which contain an object, or as a modified deep CNN to represent images for object detection in supervised and weakly supervised scheme. Our ranking GAN offers a novel way to search through images for object specific patterns. We have conducted experiments for different scenarios and demonstrate the method performance for object synthesizing and weakly supervised object detection and classification using the MS-COCO and PASCAL VOC datasets.


Translation techniques in cross-language information retrieval

Cross-language information retrieval (CLIR) is an active sub-domain of information retrieval (IR). Like IR, CLIR is centered on the search for documents and for information contained within those documents. Unlike IR, CLIR must reconcile queries and documents that are written in different languages. The usual solution to this mismatch involves translating the query and/or the documents before performing the search. Translation is therefore a pivotal activity for CLIR engines. Over the last 15 years, the CLIR community has developed a wide range of techniques and models supporting free text translation. This article presents an overview of those techniques, with a special emphasis on recent developments.


A Review on Phishing Attacks and Various Anti Phishing Techniques

Phishing is a threat that acquire sensitive information such as username, password etc through online. Phishing often takes place in email spoofing or instant messaging .Phishing email contains messages like ask the users to enter the personal information so that it is easy for hackers to hack the information. This paper presents an overview about various phishing attacks and various techniques to protect the information.


Open Government Data Implementation Evaluation

This paper analyses the implementation of the Open Government Data strategy and portal of the City of Vienna. This evaluation is based on qualitative interviews and online polls after the strategy was implemented. Two groups of users were involved in the evaluation: internal target groups (employees and heads of department in the City of Vienna’s public administration departments) and external stakeholders (citizens, business representatives, science and research, journalists). Analyzed aspects included the present organizational processes, the benefits (to business and society), and requirements for future Open Government Data initiatives. This evaluation reveals success factors which accompanied the implementation: the clear definition of responsibilities and the implementation along a process model, the integration of the Open Government Data platform into existing Content Management Systems, the evaluation of the Open Government Data initiative very shortly after its inception. Based on the theoretical and empirical findings, recommendations for future Open Government Data strategies are made which target the local authority and would require action on the federal level such as Creative Commons Attribution License as the default for subsidy funds or public relation measures carried out directly by the data providing departments.


Geometric Correspondence Network for Camera Motion Estimation

In this paper, we propose a new learning scheme for generating geometric correspondences to be used for visual odometry. A convolutional neural network (CNN) combined with a recurrent neural network (RNN) are trained together to detect the location of keypoints as well as to generate corresponding descriptors in one unified structure. The network is optimized by warping points from source frame to reference frame, with a rigid body transform. Essentially, learning from warping. The overall training is focused on movements of the camera rather than movements within the image, which leads to better consistency in the matching and ultimately better motion estimation. Experimental results show that the proposed method achieves better results than both related deep learning and hand crafted methods. Furthermore, as a demonstration of the promise of our method we use a naive SLAM implementation based on these keypoints and get a performance on par with ORB-SLAM.


An Efficient and Fast Li-Ion Battery Charging System Using Energy Harvesting or Conventional Sources

This paper presents a multi-input battery charging system that is capable of increasing the charging efficiency of lithium-ion (Li-ion) batteries. The proposed battery charging system consists of three main building blocks: a pulse charger, a step-down dc–dc converter, and a power path controller. The pulse charger allows charging via a wall outlet or an energy harvesting system. It implements charge techniques that increase the battery charge efficiency of a Li-ion battery. The power path controller (PPC) functions as a power monitor and selects the optimal path for charging either via an energy harvesting system or an ac adapter. The step-down dc–dc converter provides an initial supply voltage to start up the energy harvesting system. The integrated circuit design is implemented on a CMOS 0.18 μm technology process. Experimental results verify that the proposed pulse charger reduces the charging time of 100 mAh and 45 mAh Li-ion batteries respectively by 37.35% and 15.56% and improves the charge efficiency by 3.15% and 3.27% when compared to the benchmark constant current-constant voltage charging technique. The step-down dc–dc converter has a maximum efficiency of 90% and the operation of the PPC is also verified by charging the battery via a thermoelectric energy harvesting system.


Automatic Question Generation using Discourse Cues

In this paper, we present a system that automatically generates questions from natural language text using discourse connectives. We explore the usefulness of the discourse connectives for Question Generation (QG) that looks at the problem beyond sentence level. Our work divides the QG task into content selection and question formation. Content selection consists of finding the relevant part in text to frame question from while question formation involves sense disambiguation of the discourse connectives, identification of question type and applying syntactic transformations on the content. The system is evaluated manually for syntactic and semantic correctness.


Natural Language Processing methods and systems for biomedical ontology learning

While the biomedical informatics community widely acknowledges the utility of domain ontologies, there remain many barriers to their effective use. One important requirement of domain ontologies is that they must achieve a high degree of coverage of the domain concepts and concept relationships. However, the development of these ontologies is typically a manual, time-consuming, and often error-prone process. Limited resources result in missing concepts and relationships as well as difficulty in updating the ontology as knowledge changes. Methodologies developed in the fields of Natural Language Processing, information extraction, information retrieval and machine learning provide techniques for automating the enrichment of an ontology from free-text documents. In this article, we review existing methodologies and developed systems, and discuss how existing methods can benefit the development of biomedical ontologies.


Predictive coding: a fresh view of inhibition in the retina.

Interneurons exhibiting centre--surround antagonism within their receptive fields are commonly found in peripheral visual pathways. We propose that this organization enables the visual system to encode spatial detail in a manner that minimizes the deleterious effects of intrinsic noise, by exploiting the spatial correlation that exists within natural scenes. The antagonistic surround takes a weighted mean of the signals in neighbouring receptors to generate a statistical prediction of the signal at the centre. The predicted value is subtracted from the actual centre signal, thus minimizing the range of outputs transmitted by the centre. In this way the entire dynamic range of the interneuron can be devoted to encoding a small range of intensities, thus rendering fine detail detectable against intrinsic noise injected at later stages in processing. This predictive encoding scheme also reduces spatial redundancy, thereby enabling the array of interneurons to transmit a larger number of distinguishable images, taking into account the expected structure of the visual world. The profile of the required inhibitory field is derived from statistical estimation theory. This profile depends strongly upon the signal: noise ratio and weakly upon the extent of lateral spatial correlation. The receptive fields that are quantitatively predicted by the theory resemble those of X-type retinal ganglion cells and show that the inhibitory surround should become weaker and more diffuse at low intensities. The latter property is unequivocally demonstrated in the first-order interneurons of the fly's compound eye. The theory is extended to the time domain to account for the phasic responses of fly interneurons. These comparisons suggest that, in the early stages of processing, the visual system is concerned primarily with coding the visual image to protect against subsequent intrinsic noise, rather than with reconstructing the scene or extracting specific features from it. The treatment emphasizes that a neuron's dynamic range should be matched to both its receptive field and the statistical properties of the visual pattern expected within this field. Finally, the analysis is synthetic because it is an extension of the background suppression hypothesis (Barlow & Levick 1976), satisfies the redundancy reduction hypothesis (Barlow 1961 a, b) and is equivalent to deblurring under certain conditions (Ratliff 1965).


A SPEC RG Cloud Group's Vision on the Performance Challenges of FaaS Cloud Architectures

As a key part of the serverless computing paradigm, Function-as-a-Service (FaaS) platforms enable users to run arbitrary functions without being concerned about operational issues. However, there are several performance-related issues surrounding the state-of-the-art FaaS platforms that can deter widespread adoption of FaaS, including sizeable overheads, unreliable performance, and new forms of the cost-performance trade-off. In this work we, the SPEC RG Cloud Group, identify six performance-related challenges that arise specifically in this FaaS model, and present our roadmap to tackle these problems in the near future. This paper aims at motivating the community to solve these challenges together.


Automatic navigation and landing of an indoor AR. drone quadrotor using ArUco marker and inertial sensors

Within the next few years, unmanned quadrotors are likely to become an important vehicle in humans' daily life. However, their automatic navigation and landing in indoor environments are among the commonly discussed topics in this regard. In fact, the quadrotor should be able to automatically find the landing point from the nearby position, navigate toward it, and finally, land on it accurately and smoothly. In this paper, we proposed a low-cost and thorough solution to this problem by using both bottom-facing and front-facing cameras of the drone. In addition, in the case that vision data were unavailable, inertial measurements alongside a Kalman filter were used to navigate the drone to achieve the promising continuity and reliability. An AR.Drone 2.0 quadrotor, as well as an ArUco marker, were employed in order to test the proposed method experimentally. The results indicated that the drone successfully landed on the predefined position with an acceptable time and accuracy.


Improved Neural Machine Translation with SMT Features

Neural machine translation (NMT) conducts end-to-end translation with a source language encoder and a target language decoder, making promising translation performance. However, as a newly emerged approach, the method has some limitations. An NMT system usually has to apply a vocabulary of certain size to avoid the time-consuming training and decoding, thus it causes a serious out-of-vocabulary problem. Furthermore, the decoder lacks a mechanism to guarantee all the source words to be translated and usually favors short translations, resulting in fluent but inadequate translations. In order to solve the above problems, we incorporate statistical machine translation (SMT) features, such as a translation model and an n-gram language model, with the NMT model under the log-linear framework. Our experiments show that the proposed method significantly improves the translation quality of the state-of-the-art NMT system on Chinese-toEnglish translation tasks. Our method produces a gain of up to 2.33 BLEU score on NIST open test sets.


MARSSx 86 : A Full System Simulator for x 86 CPUs

We present MARSS, an open source, fast, full system simulation tool built on QEMU to support cycle-accurate simulation of superscalar homogeneous and heterogeneous multicore x86 processors. MARSS includes detailed models of coherent caches, interconnections, chipsets, memory and IO devices. MARSS simulates the execution of all software components in the system, including unmodified binaries of applications, OS and libraries.


Automatic programming assessment and test data generation a review on its approaches

Automatic programming assessment has recently become an important method in assisting lecturers and instructors of programming courses to automatically mark and grade students' programming exercises as well as to provide useful feedbacks on students' programming solutions. As part of the method, test data generation process plays as an integral part to perform a dynamic testing on students' programs. To date, various automated methods for test data generation particularly in software testing field are available. Unfortunately, they are seldom used in the context of automatic programming assessment research area. Nevertheless, there have been limited studies taking a stab to integrate both of them due to more useful features and to include a better quality program testing coverage. Thus, this paper provides a review on approaches that have been implemented in various studies with regard to automatic programming assessment, test data generation and integration of both of them. This review is aimed at gathering different techniques that have been employed to forward an interested reader the starting points for finding further information regarding its trends. In addition, the result of the review reveals the main gap that exists within the context of the considered areas which contributes to our main research topic of interest.


Learning Important Features Through Propagating Activation Differences

The purported “black box” nature of neural networks is a barrier to adoption in applications where interpretability is essential. Here we present DeepLIFT (Deep Learning Important FeaTures), a method for decomposing the output prediction of a neural network on a specific input by backpropagating the contributions of all neurons in the network to every feature of the input. DeepLIFT compares the activation of each neuron to its ‘reference activation’ and assigns contribution scores according to the difference. By optionally giving separate consideration to positive and negative contributions, DeepLIFT can also reveal dependencies which are missed by other approaches. Scores can be computed efficiently in a single backward pass. We apply DeepLIFT to models trained on MNIST and simulated genomic data, and show significant advantages over gradient-based methods. Video tutorial: http://goo.gl/ qKb7pL, code: http://goo.gl/RM8jvH.


Approximation by exponential sums revisited ✩

Article history: Received 15 May 2009 Accepted 15 August 2009 Available online 2 September 2009 Communicated by Ginette Saracco


Reduced keyframes for fast bundle adjustment using point and line features in monoslam

Visual Simultaneous Localization and Mapping (VSLAM) requires feature detection on visual data. In indoor scenes that include architectures such as plain walls and doors, there are no or less corners detected, in such cases tracking will be lost. To overcome this situation we track different types of features that help in feature extraction even in textureless scenes. Line features are used to get the outline of the structure. This paper explains method of line based localization when no point features are detected and process of mapping the matched lines between two frames. One of the existing state of art monocular SLAM that extracts point features only, is used as the main build and LBD (Line Band Descriptor) is incorporated in it for localization and mapping. Our new system extracts more features compared to the existing system and complexity of the bundle adjustment is decreased as it decreases the keyframes selected for local mapping and optimization when tested using our own dataset and compared with the existing system.


Teaching the Basics of NLP and ML in an Introductory Course to Information Science

In this paper we discuss our experience of teaching basic Natural Language Processing (NLP) and Machine Learning (ML) in an introductory course to Information Science. We discuss the challenges we faced while incorporating NLP and ML to the curriculum followed by a presentation of how we met these challenges. The overall response (of students) to the inclusion of this new topic to the curriculum has been positive. Students this semester are pursuing NLP/ML projects, formulating their own tasks (some of which are novel and presented towards the end of the paper), collecting and annotating data and building models for their task.


Echo State Queueing Network: A new reservoir computing learning tool

In the last decade, a new computational paradigm was introduced in the field of Machine Learning, under the name of Reservoir Computing (RC). RC models are neural networks which a recurrent part (the reservoir) that does not participate in the learning process, and the rest of the system where no recurrence (no neural circuit) occurs. This approach has grown rapidly due to its success in solving learning tasks and other computational applications. Some success was also observed with another recently proposed neural network designed using Queueing Theory, the Random Neural Network (RandNN). Both approaches have good properties and identified drawbacks. In this paper, we propose a new RC model called Echo State Queueing Network (ESQN), where we use ideas coming from RandNNs for the design of the reservoir. ESQNs consist in ESNs where the reservoir has a new dynamics inspired by recurrent RandNNs. The paper positions ESQNs in the global Machine Learning area, and provides examples of their use and performances. We show on largely used benchmarks that ESQNs are very accurate tools, and we illustrate how they compare with standard ESNs.


Experiences of stigma and access to HAART in children and adolescents living with HIV/AIDS in Brazil.

This study describes and conceptualizes the experiences of stigma in a group of children living with HIV in São Paulo, Brazil, and evaluates the impact of access to highly active antiretroviral therapy (HAART) over the social course of AIDS and over the children's experiences of stigma. Through ethnographic research in São Paulo from 1999 to 2001, the life trajectories of 50 children ages 1-15 living with or affected by HIV were studied. Data were collected via participant observation and semi-structured informal interviews and analyzed using social theories on illness experience and social inequality. Our results demonstrate that AIDS-related stigma occurs within complex discrimination processes that change as children reach adolescence. We found that structural violence in the forms of poverty, racism, and inequalities in social status, gender, and age fuels children's experiences of stigma. We also describe how access to HAART changes the lived experience of children, reduces stigma, and brings new challenges in AIDS care such as adolescents' sexuality and treatment adherence. Based on these results, we propose structural violence as the framework to study stigma and argue that interventions to reduce stigma that solely target the perception and attitudes toward people living with HIV are limited. In contrast universal access to HAART in Brazil is a powerful intervention that reduces stigma, in that it transforms AIDS from a debilitating and fatal disease to a chronic and manageable one, belongs to a broader mechanism to assure citizens' rights, and reduces social inequalities in access to health care.


Bricks, Blocks, Boxes, Cubes, and Dice: On the Role of Cubic Shapes for the Design of Tangible Interactive Devices

Cubic shapes play an astonishing role in the design of tangible interactive devices. Due to our curiosity for this widespread design preference lasting over thirty years, we constituted a literature survey of papers, books and products since the late 1970s. Out of a corpus of fourty-seven papers, books and products that propose cubic shapes for tangible interactive devices we trace the origins of cubicle tangibles and highlight the rationale for their application. Through a comparative study, we analyze the properties of this shape for tangible interaction design and classify these along the themes of: Manipulation as Input, Placement in Space as Input, Arrangement, Multifunctionality, Randomness, Togetherness & Variations, Physical Qualities, Container, and Pedestal for Output. We propose a taxonomy for cubic shaped tangible interactive devices based on the reviewed contributions, in order to support researchers and designers in their future work of designing cubic shaped tangible interactive devices.


A case study of a five-year-old child with pervasive developmental disorder-not otherwise specified using sound-based interventions.

The aim of this study was to determine the efficacy of The Listening Program (TLP) in treating a child with pervasive developmental disorder-not otherwise specified (PDD-NOS). Using a single-subject case study design, one child with PDD-NOS was administered a 20-week TLP intervention focused on improving sensory processing and language function. Data collection included pre- and post-evaluations using video footage, and Sensory Profile and Listening Checklist questionnaires. Results of the study indicated improved behaviour and sensory tolerance in the post-intervention video footage, including active participation in singing and movements to song. Sensory Profile and Listening Checklist questionnaires indicated significant improvements in sensory processing, receptive/expressive listening and language, motor skills, and behavioural/social adjustment at the post-intervention assessment. Although small in scope, this study highlights the need for continued research by occupational therapists into sound-based interventions. Particularly, occupational therapists need to perform larger-scale studies utilizing TLP to verify the efficacy of this alternative treatment method.


Health, Inequality, and Economic Development

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.


Real-Time CPU-Based Large-Scale Three-Dimensional Mesh Reconstruction

In robotics, especially in this era of autonomous driving, mapping is one key ability of a robot to be able to navigate through an environment, localize on it, and analyze its traversability. To allow for real-time execution on constrained hardware, the map usually estimated by feature-based or semidense SLAM algorithms is a sparse point cloud; a richer and more complete representation of the environment is desirable. Existing dense mapping algorithms require extensive use of graphics processing unit (GPU) computing and they hardly scale to large environments; incremental algorithms from sparse points still represent an effective solution when light computational effort is needed and big sequences have to be processed in real time. In this letter, we improved and extended the state-of-the-art incremental manifold mesh algorithm proposed by Litvinov and Lhuillier and extended by Romanoni and Matteucci. While these algorithms do not reconstruct the map in real time and they embed points from SLAM or structure from motion only when their position is fixed, in this letter, we propose the first incremental algorithm able to reconstruct a manifold mesh in real time through single core CPU processing, which is also able to modify the mesh according to three-dimensional points updates from the underlying SLAM algorithm. We tested our algorithm against two state-of-the-art incremental mesh mapping systems on the KITTI dataset, and we showed that, while accuracy is comparable, our approach is able to reach real-time performances thanks to an order of magnitude speed-up.


Does the use of social networking sites increase children's risk of harm?

Although research findings have been equivocal as to whether the use of social networking sites (SNS) increases experiences of online risk among children, the affordances of SNS lend support to this possibility, attracting much policy and public concern. The present article examines whether the use of such services increases the risks that children and young people encounter by analyzing data from a random stratified sample of approximately 1000 internetusing children aged 9-16 years in each of 25 European countries. Four hypotheses were formulated and tested. The first hypothesis, namely that children who use social networking sites will encounter more risks online than those who do not, is supported by the data. The second hypothesis stated that SNS users with more digital competence will encounter more online risk than those with less competence; this was also supported, despite being counter to common assumptions. Thirdly, we hypothesized that SNS users with more risky SNS practices (e.g. a public profile, displaying identifying information, with a very large number of contacts) will encounter more online risk than those with fewer risky practices: this too was supported by the data; thus what matters for risk is how SNS are used, a useful point for awareness-raising initiatives. The fourth hypothesis stated that SNS users with more digital competence in using the internet will experience less harm associated with online risk. The data did not support this hypothesis, since digital competence did not reduce the probability of children saying that they have been bothered or upset by something on the internet. Finally, the study found that, although this had not been predicted, whether or not risks are experienced as harmful depends on the specific relation between risks and platforms (website, instant messaging, gaming or social networking). We call on future research to explore how particular affordances sustain particular communicative conditions and, in turn, are responded to differently by children. The research and policy implications of the findings are discussed.


Integrating the Architecture Tradeoff Analysis Method ( ATAM ) with the Cost Benefit Analysis Method ( CBAM )

.............................................................................................................vii


Textile Materials for the Design of Wearable Antennas: A Survey

In the broad context of Wireless Body Sensor Networks for healthcare and pervasive applications, the design of wearable antennas offers the possibility of ubiquitous monitoring, communication and energy harvesting and storage. Specific requirements for wearable antennas are a planar structure and flexible construction materials. Several properties of the materials influence the behaviour of the antenna. For instance, the bandwidth and the efficiency of a planar microstrip antenna are mainly determined by the permittivity and the thickness of the substrate. The use of textiles in wearable antennas requires the characterization of their properties. Specific electrical conductive textiles are available on the market and have been successfully used. Ordinary textile fabrics have been used as substrates. However, little information can be found on the electromagnetic properties of regular textiles. Therefore this paper is mainly focused on the analysis of the dielectric properties of normal fabrics. In general, textiles present a very low dielectric constant that reduces the surface wave losses and increases the impedance bandwidth of the antenna. However, textile materials are constantly exchanging water molecules with the surroundings, which affects their electromagnetic properties. In addition, textile fabrics are porous, anisotropic and compressible materials whose thickness and density might change with low pressures. Therefore it is important to know how these characteristics influence the behaviour of the antenna in order to minimize unwanted effects. This paper presents a survey of the key points for the design and development of textile antennas, from the choice of the textile materials to the framing of the antenna. An analysis of the textile materials that have been used is also presented.


Computer Game Mods, Modders, Modding, and the Mod Scene

Computer games have increasingly been the focus of user-led innovations in the form of game mods. This paper examines how different kinds of socio-technical affordances serve to organize the actions of the people who develop and share their game mods. The affordances examined include customization and tailoring mechanisms, software and content copyright licenses, game software infrastructure and development tools, career contingencies and organizational practices of mod teams, and social worlds intersecting the mod scene. Numerous examples will be used to ground this review and highlight how such affordances can organize, facilitate or constrain what can be done. Overall, this study helps to provide a deeper understanding of how a web of associated affordances collectively serve to govern what mods get made, how modding practices emerge and flourish, and how modders and the game industry serve each others' interests, though not always in equivocal terms.


Feature selection and the class imbalance problem in predicting protein function from sequence.

When the standard approach to predict protein function by sequence homology fails, other alternative methods can be used that require only the amino acid sequence for predicting function. One such approach uses machine learning to predict protein function directly from amino acid sequence features. However, there are two issues to consider before successful functional prediction can take place: identifying discriminatory features, and overcoming the challenge of a large imbalance in the training data. We show that by applying feature subset selection followed by undersampling of the majority class, significantly better support vector machine (SVM) classifiers are generated compared with standard machine learning approaches. As well as revealing that the features selected could have the potential to advance our understanding of the relationship between sequence and function, we also show that undersampling to produce fully balanced data significantly improves performance. The best discriminating ability is achieved using SVMs together with feature selection and full undersampling; this approach strongly outperforms other competitive learning algorithms. We conclude that this combined approach can generate powerful machine learning classifiers for predicting protein function directly from sequence.


A Category-Based Model for ABAC

In Attribute-Based Access Control (ABAC) systems, access to resources is controlled by evaluating rules against the attributes of the user and the object involved in the access request, as well as the values of the relevant attributes from the environment. This is a powerful concept: ABAC is able to enforce DAC and RBAC policies, as well as more general, dynamic access control policies, where the decision to grant or deny an access request is based on the system's state. However, in its current definition, ABAC does not lend itself well to some operations, such as review queries, and it is in general more costly to specify and maintain than simpler systems such as RBAC. To address these issues, in this paper we propose a formal model of ABAC based on the notion of a category that underlies the general category-based metamodel of access control (CBAC). Our proposed approach adds structure to ABAC, so that policies are easier to design and understand, review queries become easy to evaluate, and simple systems such as RBAC can be implemented as instances of ABAC without additional costs.


Attacking Fieldbus Communications in ICS: Applications to the SWaT Testbed


A view of the parallel computing landscape

Writing programs that scale with increasing numbers of cores should be as easy as writing programs for sequential computers.


SAP HANA - From Relational OLAP Database to Big Data Infrastructure

SAP HANA started as one of the best-performing database engines for OLAP workloads strictly pursuing a main-memory centric architecture and exploiting hardware developments like large number of cores and main memories in the TByte range. Within this paper, we outline the steps from a traditional relational database engine to a Big Data infrastructure comprising different methods to handle data of different volume, coming in with different velocity, and showing a fairly large degree of variety. In order to make the presentation of this transformation process more tangible, we discuss two major technical topics–HANA native integration points as well as extension points for collaboration with Hadoop-based data management infrastructures. The overall of goal of this paper is to (a) review current application patterns and resulting technical challenges as well as to (b) paint the big picture for upcoming architectural designs with SAP HANA database as the core of a SAP Big Data infrastructure.


Predictive Control of a Three-Level Boost Converter and an NPC Inverter for High-Power PMSG-Based Medium Voltage Wind Energy Conversion Systems

In this paper, a new medium voltage power converter topology using a diode rectifier, three-level boost (TLB) converter, and neutral-point-clamped (NPC) inverter is proposed for a high-power permanent magnet synchronous generator-based wind energy conversion system. The generator-side TLB converter performs the maximum power point tracking and balancing of dc-link capacitor voltages, while the grid-side NPC inverter regulates the net dc-bus voltage and reactive power to the grid. A significant improvement in the grid power quality is accomplished as the NPC inverter no longer controls the dc-link neutral point voltage. A model predictive strategy is proposed to control the complete system where the discrete-time models of the proposed power electronic converters are used to predict the future behavior of control variables. These predictions are evaluated using two independent cost functions, and the switching states which minimize these cost functions are selected and applied to the generator- and grid-side converters directly. In order to comply with the high-power application, the switching frequencies of the TLB converter and NPC inverter are minimized and maintained below 1.5 and 1 kHz, respectively. The proposed topology and control strategy are verified through MATLAB simulations on a 3-MW/3000-V/577-A system and dSPACE DS1103-based experiments on 3.6-kW/208-V/10-A prototype.


Maintaining Views Incrementally

We present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. The view definitions can be in SQL or Datalog, and may use UNION, negation, aggregation (e.g. SUM, MIN), linear recursion, and general recursion.
We first present a counting algorithm that tracks the number of alternative derivations (counts) for each derived tuple in a view. The algorithm works with both set and duplicate semantics. We present the algorithm for nonrecursive views (with negation and aggregation), and show that the count for a tuple can be computed at little or no cost above the cost of deriving the tuple. The algorithm is optimal in that it computes exactly those view tuples that are inserted or deleted. Note that we store only the number of derivations, not the derivations themselves.
We then present the Delete and Rederive algorithm, DRed, for incremental maintenance of recursive views (negation and aggregation are permitted). The algorithm works by first deleting a superset of the tuples that need to be deleted, and then rederiving some of them. The algorithm can also be used when the view definition is itself altered.


Modeling Relation Paths for Representation Learning of Knowledge Bases

Representation learning of knowledge bases aims to embed both entities and relations into a low-dimensional space. Most existing methods only consider direct relations in representation learning. We argue that multiple-step relation paths also contain rich inference patterns between entities, and propose a path-based representation learning model. This model considers relation paths as translations between entities for representation learning, and addresses two key challenges: (1) Since not all relation paths are reliable, we design a path-constraint resource allocation algorithm to measure the reliability of relation paths. (2) We represent relation paths via semantic composition of relation embeddings. Experimental results on real-world datasets show that, as compared with baselines, our model achieves significant and consistent improvements on knowledge base completion and relation extraction from text. The source code of this paper can be obtained from https://github.com/mrlyk423/ relation_extraction.


Transition-based Knowledge Graph Embedding with Relational Mapping Properties

Many knowledge repositories nowadays contain billions of triplets, i.e. (head-entity, relationship, tail-entity), as relation instances. These triplets form a directed graph with entities as nodes and relationships as edges. However, this kind of symbolic and discrete storage structure makes it difficult for us to exploit the knowledge to enhance other intelligenceacquired applications (e.g. the QuestionAnswering System), as many AI-related algorithms prefer conducting computation on continuous data. Therefore, a series of emerging approaches have been proposed to facilitate knowledge computing via encoding the knowledge graph into a low-dimensional embedding space. TransE is the latest and most promising approach among them, and can achieve a higher performance with fewer parameters by modeling the relationship as a transitional vector from the head entity to the tail entity. Unfortunately, it is not flexible enough to tackle well with the various mapping properties of triplets, even though its authors spot the harm on performance. In this paper, we thus propose a superior model called TransM to leverage the structure of the knowledge graph via pre-calculating the distinct weight for each training triplet according to its relational mapping property. In this way, the optimal function deals with each triplet depending on its own weight. We carry out extensive experiments to compare TransM with the state-of-the-art method TransE and other prior arts. The performance of each approach is evaluated within two different application scenarios on several benchmark datasets. Results show that the model we proposed significantly outperforms the former ones with lower parameter complexity as TransE.


Semantic Data Integration for Knowledge Graph Construction at Query Time

The evolution of the Web of documents into a Web of services and data has resulted in an increased availability of data from almost any domain. For example, general domain knowledge bases such as DBpedia or Wikidata, or domain specific Web sources like the Oxford Art archive, allow for accessing knowledge about a wide variety of entities including people, organizations, or art paintings. However, these data sources publish data in different ways, and they may be equipped with different search capabilities, e.g., SPARQL endpoints or REST services, thus requiring data integration techniques that provide a unified view of the published data. We devise a semantic data integration approach named FuhSen that exploits keyword and structured search capabilities of Web data sources and generates on-demand knowledge graphs merging data collected from available Web sources. Resulting knowledge graphs model semantics or meaning of merged data in terms of entities that satisfy keyword queries, and relationships among those entities. FuhSen relies on both RDF to semantically describe the collected entities, and on semantic similarity measures to decide on relatedness among entities that should be merged. We empirically evaluate the results of FuhSen data integration techniques on data from the DBpedia knowledge base. The experimental results suggest that FuhSen data integration techniques accurately integrate similar entities semantically into knowledge graphs.


TransG : A Generative Model for Knowledge Graph Embedding

Recently, knowledge graph embedding, which projects symbolic entities and relations into continuous vector space, has become a new, hot topic in artificial intelligence. This paper proposes a novel generative model (TransG) to address the issue of multiple relation semantics that a relation may have multiple meanings revealed by the entity pairs associated with the corresponding triples. The new model can discover latent semantics for a relation and leverage a mixture of relationspecific component vectors to embed a fact triple. To the best of our knowledge, this is the first generative model for knowledge graph embedding, and at the first time, the issue of multiple relation semantics is formally discussed. Extensive experiments show that the proposed model achieves substantial improvements against the state-of-the-art baselines.


Representation Learning of Knowledge Graphs with Entity Descriptions

Representation learning (RL) of knowledge graphs aims to project both entities and relations into a continuous lowdimensional space. Most methods concentrate on learning representations with knowledge triples indicating relations between entities. In fact, in most knowledge graphs there are usually concise descriptions for entities, which cannot be well utilized by existing methods. In this paper, we propose a novel RL method for knowledge graphs taking advantages of entity descriptions. More specifically, we explore two encoders, including continuous bag-of-words and deep convolutional neural models to encode semantics of entity descriptions. We further learn knowledge representations with both triples and descriptions. We evaluate our method on two tasks, including knowledge graph completion and entity classification. Experimental results on real-world datasets show that, our method outperforms other baselines on the two tasks, especially under the zero-shot setting, which indicates that our method is capable of building representations for novel entities according to their descriptions. The source code of this paper can be obtained from https://github.com/xrb92/DKRL.


Smart Societies, Infrastructure, Technologies and Applications

We describe a new approach to building high performance nonstop infrastructure for scalable AI and cloud computing. With AI as the technological driving force behind future smart cities and smart societies, we will need powerful new nonstop AI infrastructures at both the cloud level and at the edge.


Warm-white light-emitting diode with yellowish orange SiALON ceramic phosphor.

A warm-white light-emitting diode (LED) without blending of different kinds of phosphors is demonstrated. An approach that consists of a blue LED chip and a wavelength-conversion phosphor is carried out. The phosphor is a newly developed yellowish orange CaEuSiAlON ceramic phosphor with high efficiency. The CIE1931 chromaticity coordinates (x, y) are (0.458, 0.414), the color temperature is 2750 K, and the luminous efficacy of this LED is 25.9 lm/W at room temperature and with a forward-bias current of 20 mA. The chromaticity of the assembled LED is more thermally stable than that of a LED with a conventional oxide phosphor (YAG:Ce) because of the better thermal stability of the oxynitride phosphor.


A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network

Efficient enumeration of all maximal cliques in a given graph has many applications in graph theory, data mining and bio informatics. However, the exponentially increasing computation time of this problem confines the scale of the graph. Meanwhile, recent researches show that many networks in our world are complex networks involving massive data. To solve the maximal clique problem in the real-world scenarios, this paper presents a parallel algorithm Peamc (parallel enumeration of all maximal cliques) which exploits several new and effective techniques to enumerate all maximal cliques in a complex network. Furthermore, we provide a performance study on a true-life call graph with up to 2,423,807 vertices and 5,317,183 edges. The experimental results show that Peamc can find all the maximal cliques in a complex network with high efficiency and scalability


Evaluating mobile apps for breathing training: The effectiveness of visualization

Deep and slow breathing exercises can be an effective adjunct in the treatment of stress, anxiety, post-traumatic stress disorder, chronic pain and depression. Breathing techniques are traditionally learned in courses with trainers and/or with materials such as audio CDs for home practice. Recently, mobile apps have been proposed as novel breathing training tools, but to the best of our knowledge no research has focused on their evaluation so far. In this paper, we study three different designs for breathing training apps. The first employs audio instructions as in traditional training based on audio CDs, while the other two include visualizations of the breathing process, representative of those employed in current breathing training apps. We carry out a thorough analysis, focusing on users’ physiological parameters as well as subjective perception. One visualization produces better results both objectively (measured deepness of breath) and subjectively (users’ preferences and perceived effectiveness) than the more traditional audio-only design. This indicates that a visualization can contribute to the effectiveness of breathing training apps. We discuss which features could have allowed one visualization (but not the other) to obtain better results than traditional audio-only instructions.


Software Architecture Quality Measurement Stability and

Over the past years software architecture has become an important sub-field of software engineering. There has been substantial advancement in developing new technical approaches to start handling architectural design as an engineering discipline. Measurement is an essential part of any engineering discipline. Quantifying the quality attributes of the software architecture will reveal good insights about the architecture. It will also help architects and practioners to choose the best fit of alternative architectures that meets their needs. This work paves the way for researchers to start investigating ways to measure software architecture quality attributes. Measurement of these qualities is essential for this sub-field of software engineering. This work explores Stability and Understandability of software architecture, several metrics that affect them, and literature review of these qualities. Keywords—Software Engineering; Software Architecture; Quality Attributes; Stability; Understandability


Detection Based on Structural Properties

Phishing attacks pose a serious threat to end-users and commercial institutions alike. Majority of the present day phishing attacks employ e-mail as their primary carrier, in order to allure unsuspecting victims to visit the masqueraded website. While the recent defense mechanisms focus on detection by validating the authenticity of the website, very few approaches have been proposed which concentrate on detecting e-mail based phishing attacks based on the structural properties inherently present in the phishing e-mail. Also, phishing attacks growing in ingenuity as well as sophistication render most of existing browser based solutions weak. In this paper, we propose a novel technique to discriminate phishing e-mails from the legitimate e-mails using the distinct structural features present in them. The derived features, together with oneclass Support Vector Machine (SVM), can be used to efficiently classify phishing e-mails before it reaches the users inbox, essentially reducing the human exposure. Our prototype implementation sits between a user's mail transfer agent (MTA) and mail user agent (MUA) and processes each arriving e-mail even before it reaches the inbox. Using live email data, we demonstrate that our approach is able to detect a wide range of phishing e-mails with minimal performance overhead


Heart rate variability in elite triathletes, is variation in variability the key to effective training? A case comparison

Measures of an athlete’s heart rate variability (HRV) have shown potential to be of use in the prescription of training. However, little data exists on elite athletes who are regularly exposed to high training loads. This case study monitored daily HRV in two elite triathletes (one male: 22 year, $$ \dot{V}$$ O2max 72.5 ml kg min−1; one female: 20 year, $$ \dot{V}$$ O2max 68.2 ml kg min−1) training 23 ± 2 h per week, over a 77-day period. During this period, one athlete performed poorly in a key triathlon event, was diagnosed as non-functionally over-reached (NFOR) and subsequently reactivated the dormant virus herpes zoster (shingles). The 7-day rolling average of the log-transformed square root of the mean sum of the squared differences between R–R intervals (Ln rMSSD), declined towards the day of triathlon event (slope = −0.17 ms/week; r 2 = −0.88) in the NFOR athlete, remaining stable in the control (slope = 0.01 ms/week; r 2 = 0.12). Furthermore, in the NFOR athlete, coefficient of variation of HRV (CV of Ln rMSSD 7-day rolling average) revealed large linear reductions towards NFOR (i.e., linear regression of HRV variables versus day number towards NFOR: −0.65%/week and r 2 = −0.48), while these variables remained stable for the control athlete (slope = 0.04%/week). These data suggest that trends in both absolute HRV values and day-to-day variations may be useful measurements indicative of the progression towards mal-adaptation or non-functional over-reaching.


Evolutionary Algorithm for Extractive Text Summarization

Text summarization is the process of automatically creating a compressed version of a given document preserving its information content. There are two types of summarization: extractive and abstractive. Extractive summarization methods simplify the problem of summarization into the problem of selecting a representative subset of the sentences in the original documents. Abstractive summarization may compose novel sentences, unseen in the original sources. In our study we focus on sentence based extractive document summarization. The extractive summarization systems are typically based on techniques for sentence extraction and aim to cover the set of sentences that are most important for the overall understanding of a given document. In this paper, we propose unsupervised document summarization method that creates the summary by clustering and extracting sentences from the original document. For this purpose new criterion functions for sentence clustering have been proposed. Similarity measures play an increasingly important role in document clustering. Here we’ve also developed a discrete differential evolution algorithm to optimize the criterion functions. The experimental results show that our suggested approach can improve the performance compared to sate-of-the-art summarization approaches.


TEM Horn Antenna Loaded With Absorbing Material for GPR Applications

A novel exponentially tapered TEM horn antenna is presented. It is fed directly by a coax through a compact transition section and possesses a wide bandwidth, good radiation characteristic, and easy integration with microwave circuits. Two specially tapered metal flares have been designed to make a wideband characteristic and reduce the reflection. To overcome aperture reflections at low frequencies and unbalanced aperture field at higher frequencies, an arc surface is added at the end of the flare plates, and an absorbing material is loaded on the outer surface of the flare section. Measured results show that the presented antenna has a wide bandwidth from 0.83 to more than 12.8 GHz under a return loss <;-10 dB, small input reflection, a moderate gain from 0 dBi at 0.83 GHz to 10 dBi at 12 GHz, and a good radiation characteristics in the time domain, which can be suitable for ground penetrating radar (GPR) applications.


Eye Contact Detection via Deep Neural Networks

With the presence of ubiquitous devices in our daily lives, effectively capturing and managing user attention becomes a critical device requirement. While gaze-tracking is typically employed to determine the user’s focus of attention, gaze-lock detection to sense eyecontact with a device is proposed in [16]. This work proposes eye contact detection using deep neural networks, and makes the following contributions: (1) With a convolutional neural network (CNN) architecture, we achieve superior eye-contact detection performance as compared to [16] with minimal data pre-processing ; our algorithm is furthermore validated on multiple datasets, (2) Gaze-lock detection is improved by combining head pose and eye-gaze information consistent with social attention literature, and (3) We demonstrate gaze-locking on an Android mobile platform via CNN model compression.


Efficient parallel skyline processing using hyperplane projections

The skyline of a set of multi-dimensional points (tuples) consists of those points for which no clearly better point exists in the given set, using component-wise comparison on domains of interest. Skyline queries, i.e., queries that involve computation of a skyline, can be computationally expensive, so it is natural to consider parallelized approaches which make good use of multiple processors. We approach this problem by using hyperplane projections to obtain useful partitions of the data set for parallel processing. These partitions not only ensure small local skyline sets, but enable efficient merging of results as well. Our experiments show that our method consistently outperforms similar approaches for parallel skyline computation, regardless of data distribution, and provides insights on the impacts of different optimization strategies.


Fear of being laughed at and social anxiety : A preliminary psychometric study

The present study examines the relationship between questionnaire measures of social phobia and gelotophobia. A sample of 211 Colombian adults filled in Spanish versions of the Social Anxiety and Distress scale (SAD; Watson & Friend, 1969), the Fear of Negative Evaluation scale (FNE; Watson & Friend, 1969) and the GELOPH<15> (Ruch & Proyer, 2008). Results confirmed that both Social Anxiety and Distress and Fear of Negative Evaluation scale overlapped with the fear of being laughed at without being identical with it. The SAD and FNE correlated highly with the GELOPH<15> but not all high scorers in these scales expressed a fear of being laughed at. Furthermore, an item factor analysis yielded three factors that were mostly loaded by items of the respective scales. This three-factor structure was verified using confirmatory factor analysis. A measure model where one general factor of social anxiety was specified, or another one where two different factors were defined (gelotophobia vs. social anxiety assessed by SAD and FNE) showed a very poor fit to the data. It is concluded that the fear of being laughed cannot fully be accounted for by these measures of social phobia.


Caraoke: An E-Toll Transponder Network for Smart Cities

Electronic toll collection transponders, e.g., E-ZPass, are a widely-used wireless technology. About 70% to 89% of the cars in US have these devices, and some states plan to make them mandatory. As wireless devices however, they lack a basic function: a MAC protocol that prevents collisions. Hence, today, they can be queried only with directional antennas in isolated spots. However, if one could interact with e-toll transponders anywhere in the city despite collisions, it would enable many smart applications. For example, the city can query the transponders to estimate the vehicle flow at every intersection. It can also localize the cars using their wireless signals, and detect those that run a red-light. The same infrastructure can also deliver smart street-parking, where a user parks anywhere on the street, the city localizes his car, and automatically charges his account. This paper presents Caraoke, a networked system for delivering smart services using e-toll transponders. Our design operates with existing unmodified transponders, allowing for applications that communicate with, localize, and count transponders, despite wireless collisions. To do so, Caraoke exploits the structure of the transponders' signal and its properties in the frequency domain. We built Caraoke reader into a small PCB that harvests solar energy and can be easily deployed on street lamps. We also evaluated Caraoke on four streets on our campus and demonstrated its capabilities.


Mathematical Modeling of Hexacopter

The purpose of this paper is to present the basic mathematical modeling of microcopters, which could be used to develop proper methods for stabilization and trajectory control. The microcopter taken into account consists of six rotors, with three pairs of counter-rotating fixedpitch blades. The microcopter is controlled by adjusting the angular velocities of the rotors which are spun by electric motors. It is assumed as a rigid body, so the differential equations of the microcopter dynamics can be derived from both the Newton-Euler and Euler-Lagrange equations. Euler-angle parametrization of three-dimensional rotations contains singular points in the coordinate space that can cause failure of both dynamical model and control. In order to avoid singularities, the rotations of the microcopter are parametrized in terms of quaternions. This choice has been made taking into consideration the linearity of quaternion formulation, their stability and efficiency.


Sources of variance in current sense of humor inventories : How much substance , how much method variance ?

The present study investigates the relationship of self-report inventories of "sense of humor" and behavioral measures of humor as well as their location in the Eysenckian PEN system. 110 male and female adults in the ages from 17 to 83 years answered the following inventories: SHRQ (Martin and Lefcourt 1984), SHQZ (Ziv 1981), SHQ-3 revised (Svebak 1993), CHS (Martin and Lefcourt 1983), MSHS (Thorson and Powell 1993), HIS (Bell, McGhee, and Duffey 1986), 3 WD-K (Ruch 1983), CPPT (Köhler and Ruch 1993), TDS (Murgatroyd, Rushton, Apter, and Ray 1978), STCI-T (Ruch, Freiss, and Köhler 1993), and EPQ-R (Eysenck, Eysenck, and Barrett 1985). Reliability of the humor scales is examined and convergent and discriminant validity of homologous scales of humor appreciation and humor creation is determined. Behavioral measures and self-report instruments yield only meager correlations. While humor appreciation and humor creation form distinct traits in the behavioral measures, they can not be validly discriminated in the self-reports. Factor analysis of self-report inventories yields that the sense of humor is composed of the two orthogonal dimensions of cheerfulness and seriousness. Extraversion is predictive of cheerfulness, low seriousness, and quantity of humor production. Psychoticism is associated with low seriousness, wit and quality of humor production. Finally, emotional stability correlates with cheerfulness. All in all, the general state of the art in the assessment of the sense of humor and its components appears to be far from being satisfactory. Sources of variance 2 -


An interactive tool for manual, semi-automatic and automatic video annotation

The annotation of image and video data of large datasets is a fundamental task in multimedia information retrieval and computer vision applications. The aim of annotation tools is to relieve the user from the burden of the manual annotation as much as possible. To achieve this ideal goal, many different functionalities are required in order to make the annotations process as automatic as possible. Motivated by the limitations of existing tools, we have developed the iVAT: an interactive Video Annotation Tool. It supports manual, semi-automatic and automatic annotations through the interaction of the user with various detection algorithms. To the best of our knowledge, it is the first tool that integrates several computer vision algorithms working in an interactive and incremental learning framework. This makes the tool flexible and suitable to be used in different application domains. A quantitative and qualitative evaluation of the proposed tool on a challenging case study domain is presented and discussed. Results demonstrate that the use of the semi-automatic, as well as the automatic, modality drastically reduces the human effort while preserving the quality of the annotations. 2014 Elsevier Inc. All rights reserved.


Marginalized Denoising Dictionary Learning With Locality Constraint

Learning good representation for images is always a hot topic in machine learning and pattern recognition fields. Among the numerous algorithms, dictionary learning is a well-known strategy for effective feature extraction. Recently, more discriminative sub-dictionaries have been built by Fisher discriminative dictionary learning with specific class labels. Different types of constraints, such as sparsity, low rankness, and locality, are also exploited to make use of global and local information. On the other hand, as the basic building block of deep structure, the auto-encoder has demonstrated its promising performance in extracting new feature representation. To this end, we develop a unified feature learning framework by incorporating the marginalized denoising auto-encoder into a locality-constrained dictionary learning scheme, named marginalized denoising dictionary learning. Overall, we deploy low-rank constraint on each sub-dictionary and locality constraint instead of sparsity on coefficients, in order to learn a more concise and pure feature spaces meanwhile inheriting the discrimination from sub-dictionary learning. Finally, we evaluate our algorithm on several face and object data sets. Experimental results have demonstrated the effectiveness and efficiency of our proposed algorithm by comparing with several state-of-the-art methods.


Sentiment classification: The contribution of ensemble learning

Article history: Received 27 August 2012 Received in revised form 1 August 2013 Accepted 5 August 2013 Available online 15 August 2013


All your network are belong to us: a transport framework for mobile network selection

Mobile devices come with an assortment of networks: WiFi in two different frequency bands, each of which can run in infrastructure-mode, WiFi-Direct mode, or ad hoc mode; cellular radios, which can run in LTE/4G, 3G, or EDGE modes; and Bluetooth. But how should an app choose which network to use? There is no systematic solution to this problem today: in current practice the choice is almost always left to the user, who usually has no idea what's best. In fact, what's best for a user depends on the app's performance objectives (throughput, delay, object load time, etc.) and the user's constraints on cost and battery life. Besides, what's best for a single user or app must be balanced with what's best for the wireless network as a whole (individual optimality vs. social utility). This paper introduces Delphi, a transport-layer module to resolve these issues. Delphi has three noteworthy components: "local learning", in which a mobile device estimates or infers useful properties of different networks efficiently, "property sharing", in which mobile devices share what they learn with other nearby devices, and "selection", in which each node selects a network using what it has observed locally and/or from its neighbors.


Identifying Ghanaian pre-service teachers ’ readiness for computer use : A Technology Acceptance Model approach

This study extends the technology acceptance model to identify factors that influence technology acceptance among pre-service teachers in Ghana. Data from 380 usable questionnaires were tested against the research model. Utilising the extended technology acceptance model (TAM) as a research framework, the study found that: pre-service teachers’ pedagogical beliefs, perceived ease of use, perceived usefulness of computer technology and attitude towards computer use to be significant determinants of actual use of computer technology. Results obtained employing multiple stepwise regression analysis revealed that: (1) pre-service teachers’ pedagogical beliefs significantly influenced both perceived ease of use and perceived usefulness, (2) both perceived ease of use and perceived usefulness influence attitude towards computer use and attitude towards computer use significantly influences pre-service teachers’ actual use of computers. However, statistically, perceived ease of use did not significantly influence perceived usefulness. The findings contribute to the literature by validating the TAM in the Ghanaian context and provide several prominent implications for the research and practice of technology integration development.


Community Detection based on Distance Dynamics

In this paper, we introduce a new community detection algorithm, called Attractor, which automatically spots communities in a network by examining the changes of "distances" among nodes (i.e. distance dynamics). The fundamental idea is to envision the target network as an adaptive dynamical system, where each node interacts with its neighbors. The interaction will change the distances among nodes, while the distances will affect the interactions. Such interplay eventually leads to a steady distribution of distances, where the nodes sharing the same community move together and the nodes in different communities keep far away from each other. Building upon the distance dynamics, Attractor has several remarkable advantages: (a) It provides an intuitive way to analyze the community structure of a network, and more importantly, faithfully captures the natural communities (with high quality). (b) Attractor allows detecting communities on large-scale networks due to its low time complexity (O(|E|)). (c) Attractor is capable of discovering communities of arbitrary size, and thus small-size communities or anomalies, usually existing in real-world networks, can be well pinpointed. Extensive experiments show that our algorithm allows the effective and efficient community detection and has good performance compared to state-of-the-art algorithms.


Discovering affective regions in deep convolutional neural networks for visual sentiment prediction

In this paper, we address the problem of automatically recognizing emotions in still images. While most of current work focus on improving whole-image representations using CNNs, we argue that discovering affective regions and supplementing local features will boost the performance, which is inspired by the observation that both global distributions and salient objects carry massive sentiments. We propose an algorithm to discover affective regions via deep framework, in which we use an off-the-shelf tool to generate N object proposals from a query image and rank these proposals with their objectness scores. Then, each proposal's sentiment score is computed using a pre-trained and fine-tuned CNN model. We combine both scores and select top K regions from the N candidates. These K regions are regarded as the most affective ones of the input image. Finally, we extract deep features from the whole-image and the selected regions, respectively, and sentiment label is predicted. The experiments show that our method is able to detect the affective local regions and achieve state-of-the-art performances on several popular datasets.


Localization & Segmentation of Indian Car Number Plate system : A Projection based Multistage Approach

Enormous incorporation of information technologies into all aspects of recent life caused demand for processing vehicles as conceptual resources in information systems. This can be achieved by a human agent, or by special intelligent equipment which is be able to recognize vehicles by their number plates in a real environment and reflect it into conceptual resources. Because of this, various recognition techniques have been developed and number plate recognition systems are today used in various traffic and security applications, such as parking, access and border control, or tracking of stolen cars. This work deals with problematic from field of artificial intelligence, machine vision and neural networks in construction of an automatic car number plate Recognition (ACNPR). This techniques deals with enhanced shadow removal algorithm, along with horizontal and vertical projection method for number plate localization & segmentation..Work comparatively deals with methods achieving invariance of systems towards image illumination, translations and various light conditions during the capture.


Application of CFD in building performance simulation for the outdoor environment : an overview

This paper provides an overview of the application of CFD in building performance simulation for the outdoor environment, focused on four topics: (1) pedestrian wind environment around buildings, (2) wind-driven rain on building facades, (3) convective heat transfer coefficients at exterior building surfaces, and (4) air pollutant dispersion around buildings. For each topic, its background, the need for CFD, an overview of some past CFD studies, a discussion about accuracy and some perspectives for practical application are provided. The paper indicates that for all four topics, CFD offers considerable advantages compared to wind tunnel modelling or (semi-)empirical formulae because it can provide detailed whole-flow field data under fully controlled conditions and without similarity constraints. The main limitations are the deficiencies of steady RANS modelling, the increased complexity and computational expense of LES and the requirement of systematic and time-consuming CFD solution verification and validation studies.


Numerical Study of Urban Canyon Microclimate Related to Geometrical Parameters

In this study a microclimate analysis on a particular urban configuration: the—street canyon—has been carried out. The analysis, conducted by performing numerical simulations using the finite volumes commercial code ANSYS-Fluent, shows the flow field in an urban environment, taking into account three different aspect ratios (H/W). This analysis can be helpful in the study on urban microclimate and on the heat exchanges with the buildings. Fluid-dynamic fields on vertical planes within the canyon, have been evaluated. The results show the importance of the geometrical configuration, in relation to the ratio between the height (H) of the buildings and the width (W) of the road. This is a very important subject from the point of view of “Smart Cities”, considering the urban canyon as a subsystem of a larger one (the city), which is affected by climate changes.


BEST PRACTICE GUIDELINE FOR THE CFD SIMULATION OF FLOWS IN THE URBAN ENVIRONMENT

Legal notice by the COST Office Neither the COST Office nor any person acting on its behalf is responsible for the use which might be made of the information contained in the present publication. The COST Office is not responsible for the external web sites referred to in the present publication. No permission to reproduce or utilize the contents of this book by any means is necessary, other than in the case of images, diagrams or other material from other copyright holders. In such cases permission of the copyright holders is required. This book may be cited as: Title of the book and Action Number


Urban Physics : Effect of the micro-climate on comfort , health and energy demand

Y-NC-ND license. Abstract The global trend towards urbanisation explains the growing interest in the study of the modification of the urban climate due to the heat island effect and global warming, and its impact on energy use of buildings. Also urban comfort, health and durability, referring respectively to pedestrian wind/ thermal comfort, pollutant dispersion and wind-driven rain are of interest. Urban Physics is a wellestablished discipline, incorporating relevant branches of physics, environmental chemistry, aerodynamics, meteorology and statistics. Therefore, Urban Physics is well positioned to provide keycontributions to the current urban problems and challenges. The present paper addresses the role of Urban Physics in the study of wind comfort, thermal comfort, energy demand, pollutant dispersion and wind-driven rain. Furthermore, the three major research methods applied in Urban Physics, namely field experiments, wind tunnel experiments and numerical simulations are discussed. Case studies illustrate the current challenges and the relevant contributions of Urban Physics. & 2012. Higher Education Press Limited Company. Production and hosting by Elsevier B.V. Open access under CC BY-NC-ND license.


Verification , Validation , and Predictive Capability in Computational Engineering and Physics

Developers of computer codes, analysts who use the codes, and decision makers who rely on the results of the analyses face a critical question: How should confidence in modeling and simulation be critically assessed? Verification and validation (V&V) of computational simulations are the primary methods for building and quantifying this confidence. Briefly, verification is the assessment of the accuracy of the solution to a computational model. Validation is the assessment of the accuracy of a computational simulation by comparison with experimental data. In verification, the relationship of the simulation to the real world is not an issue. In validation, the relationship between computation and the real world, i.e., experimental data, is the issue.


Practical path planning and path following for a non-holonomic mobile robot based on visual servoing

In this paper, a practical real-time path planning and robot navigation algorithm for a non-holonomic indoor mobile robot based on visual servoing is implemented. The proposed algorithm is divided into three parts; the first part uses Multi-Stencils Fast Marching (MSFM) as a path planning method. But the generated path results from fast marching methods when used directly, not guaranteed to be safe and smooth. Subsequently, the robot can touch corners, walls and obstacles. The proposed algorithm uses image processing methods to solve this problem. The second part estimates the position and orientation of the robot, from the visual information, to follow the desired path with avoiding obstacles. The third part proposes a decentralized PD-like Fuzzy Logic Controller (FLC) to keep up the robot on the desired path. Experimental results show that the developed design is valid to estimate shortest-path by avoiding obstacles and able to guide the robot to follow the path in real-time.


Analysis of Statistical Question Classification for Fact-Based Questions

Question classification systems play an important role in question answering systems and can be used in a wide range of other domains. The goal of question classification is to accurately assign labels to questions based on expected answer type. Most approaches in the past have relied on matching questions against hand-crafted rules. However, rules require laborious effort to create and often suffer from being too specific. Statistical question classification methods overcome these issues by employing machine learning techniques. We empirically show that a statistical approach is robust and achieves good performance on three diverse data sets with little or no hand tuning. Furthermore, we examine the role different syntactic and semantic features have on performance. We find that semantic features tend to increase performance more than purely syntactic features. Finally, we analyze common causes of misclassification error and provide insight into ways they may be overcome.


UTAssistant: A Web Platform Supporting Usability Testing in Italian Public Administrations

Even if the benefits of the usability testing are remarkable, it is scarcely adopted in the software development process. To foster its adoption, this paper presents a Web platform, UTAssistant, that supports people, also without skills in Human-Computer Interaction (HCI), in evaluating Web site usability.


A Game Theoretic Framework for Incentives in P2P Systems

Peer-To-Peer (P2P) networks are self-organizing, distributed systems, with no centralized authority or infrastructure. Because of the voluntary participation, the availability of resources in a P2P system can be highly variable and unpredictable. In this paper, we use ideas from Game Theory to study the interaction of strategic and rational peers, and propose a differential service-based incentive scheme to improve the system’s performance.


Fast and Robust Joint Models for Biomedical Event Extraction

Extracting biomedical events from literature has attracted much recent attention. The bestperforming systems so far have been pipelines of simple subtask-specific local classifiers. A natural drawback of such approaches are cascading errors introduced in early stages of the pipeline. We present three joint models of increasing complexity designed to overcome this problem. The first model performs joint trigger and argument extraction, and lends itself to a simple, efficient and exact inference algorithm. The second model captures correlations between events, while the third model ensures consistency between arguments of the same event. Inference in these models is kept tractable through dual decomposition. The first two models outperform the previous best joint approaches and are very competitive with respect to the current state-of-theart. The third model yields the best results reported so far on the BioNLP 2009 shared task, the BioNLP 2011 Genia task and the BioNLP 2011 Infectious Diseases task.