Design of Kernels in Convolutional Neural Networks for Image Classification

Despite the effectiveness of convolutional neural networks (CNNs) for image classification, our understanding of the effect of shape of convolution kernels on learned representations is limited. In this work, we explore and employ the relationship between shape of kernels which define receptive fields (RFs) in CNNs for learning of feature representations and image classification. For this purpose, we present a feature visualization method for visualization of pixel-wise classification score maps of learned features. Motivated by our experimental results, and observations reported in the literature for modeling of visual systems, we propose a novel design of shape of kernels for learning of representations in CNNs. In the experimental results, the proposed models achieved an outstanding performance in the classification task, comparing to a base CNN models that introduces more parameters and computational time. Additionally, we examined the region of interest (ROI) of different models in the classification task and analyzed the robustness of the proposed method to occluded images. Our results indicate the effectiveness of the proposed approach.


Efficient Edge Detection on Low-Cost FPGAs

Improving the efficiency of edge detection in embedded applications, such as UAV control, is critical for reducing system cost and power dissipation. Field programmable gate arrays (FPGA) are a good platform for making improvements because of their specialised internal structure. However, current FPGA edge detectors do not exploit this structure well. A new edge detection architecture is proposed that is better optimised for FPGAs. The basis of the architecture is the Sobel edge kernels that are shown to be the most suitable because of their separability and absence of multiplications. Edge intensities are calculated with a new 4:2 compressor that consists of two custom-designed 3:2 compressors. Addition speed is increased by breaking carry propagation chains with look-ahead logic. Testing of the design showed it gives a 28% increase in speed and 4.4% reduction in area over previous equivalent designs, which demonstrated that it will lower the cost of edge detection systems, dissipate less power and still maintain highspeed control. Keywords—edge detection; FPGA; compressor; low-cost; UAV


CSI-MIMO: Indoor Wi-Fi fingerprinting system

Wi-Fi based fingerprinting systems, mostly utilize the Received Signal Strength Indicator (RSSI), which is known to be unreliable due to environmental and hardware effects. In this paper, we present a novel Wi-Fi fingerprinting system, exploiting the fine-grained information known as Channel State Information (CSI). The frequency diversity of CSI can be effectively utilized to represent a location in both frequency and spatial domain resulting in more accurate indoor localization. We propose a novel location signature CSI-MIMO that incorporates Multiple Input Multiple Output (MIMO) information and use both the magnitude and the phase of CSI of each sub-carrier. We experimentally evaluate the performance of CSI-MIMO fingerprinting using the k-nearest neighbor and the Bayes algorithm. The accuracy of the proposed CSI-MIMO is compared with Finegrained Indoor Fingerprinting System (FIFS) and a simple CSI-based system. The experimental result shows an accuracy improvement of 57% over FIFS with an accuracy of 0.95 meters.


Structured Perceptron with Inexact Search

Structured learning with inexact inference is a fundamental problem. We propose variants of the structured perceptron algorithm under a general “violation-fixing” framework that guarantees convergence. This framework subsumes previous remedies including “early update” as special cases, and also explains why standard perceptron may fail with inexact search. We also propose new update methods within this framework which learn better models with dramatically reduced training times on state-of-the-art part-of-speech tagging and incremental parsing systems.


ON RANDOM DEEP AUTOENCODERS: EXACT ASYMP-

We study the behavior of weight-tied multilayer vanilla autoencoders under the assumption of random weights. Via an exact characterization in the limit of large dimensions, our analysis reveals interesting phase transition phenomena when the depth becomes large. This, in particular, provides quantitative answers and insights to three questions that were yet fully understood in the literature. Firstly, we provide a precise answer on how the random deep weight-tied autoencoder model performs “approximate inference” as posed by Scellier et al. (2018), and its connection to reversibility considered by several theoretical studies. Secondly, we show that deep autoencoders display a higher degree of sensitivity to perturbations in the parameters, distinct from the shallow counterparts. Thirdly, we obtain insights on pitfalls in training initialization practice, and demonstrate experimentally that it is possible to train a deep autoencoder, even with the tanh activation and a depth as large as 200 layers, without resorting to techniques such as layer-wise pre-training or batch normalization. Our analysis is not specific to any depths or any Lipschitz activations, and our analytical techniques may have broader applicability.


Review on fraud detection methods in credit card transactions

Cashless transactions such as online transactions, credit card transactions, and mobile wallet are becoming more popular in financial transactions nowadays. With increased number of such cashless transaction, number of fraudulent transactions are also increasing. Fraud can be distinguished by analyzing spending behavior of customers (users) from previous transaction data. If any deviation is noticed in spending behavior from available patterns, it is possibly of fraudulent transaction. To detect fraud behavior, bank and credit card companies are using various methods of data mining such as decision tree, rule based mining, neural network, fuzzy clustering approach, hidden markov model or hybrid approach of these methods. Any of these methods is applied to find out normal usage pattern of customers (users) based on their past activities. The objective of this paper is to provide comparative study of different techniques to detect fraud.


Learning partial differential equations via data discovery and sparse optimization.

We investigate the problem of learning an evolution equation directly from some given data. This work develops a learning algorithm to identify the terms in the underlying partial differential equations and to approximate the coefficients of the terms only using data. The algorithm uses sparse optimization in order to perform feature selection and parameter estimation. The features are data driven in the sense that they are constructed using nonlinear algebraic equations on the spatial derivatives of the data. Several numerical experiments show the proposed method's robustness to data noise and size, its ability to capture the true features of the data, and its capability of performing additional analytics. Examples include shock equations, pattern formation, fluid flow and turbulence, and oscillatory convection.


Biomimetic walking robot SCORPION: Control and modeling

We present the biomimetic control scheme for the walking robot SCORPION. We used a concept of Basic Motion Patterns, which can be combined in a very flexible manner. In addition our modeling and simulation approach is described, which has been done based on the ADAMS(TM) simulator. Especially the motion patterns of real scorpions were analyzed and used for walking patterns and acceleration of the robot.


A Machine Learning Approach to Test Data Generation: A Case Study in Evaluation of Gene Finders

Programs for gene prediction in computational biology are examples of systems for which the acquisition of authentic test data is difficult as these require years of extensive research. This has lead to test methods based on semiartificially produced test data, often produced by ad hoc techniques complemented by statistical models such as Hidden Markov Models (HMM). The quality of such a test method depends on how well the test data reflect the regularities in known data and how well they generalize these regularities. So far only very simplified and generalized, artificial datasets have been tested, and a more thorough statistical foundation is required. We propose to use logic-statistical modelling methods for machine-learning for analyzing existing and manually marked up data, integrated with the generation of new, artificial data. More specifically, we suggest to use the PRISM system developed by Sato and Kameya. Based on logic programming extended with random variables and parameter learning, PRISM appears as a powerful modelling environment, which subsumes HMMs and a wide range of other methods, all embedded in a declarative language. We illustrate these principles here, showing parts of a model under development for genetic sequences and indicate firstinitial experiments producing test data for evaluation of existing gene finders, exemplified by GENSCAN. The advantage of the approach is the relative ease and flexibility with which these probabilistic models can be developed.


Dynamic Transfer Learning for Named Entity Recognition

State-of-the-art named entity recognition (NER) systems have been improving continuously using neural architectures over the past several years. However, many tasks including NER require large sets of annotated data to achieve such performance. In particular, we focus on NER from clinical notes, which is one of the most fundamental and critical problems for medical text analysis. Our work centers on effectively adapting these neural architectures towards lowresource settings using parameter transfer methods. We complement a standard hierarchical NER model with a general transfer learning framework consisting of parameter sharing between the source and target tasks, and showcase scores significantly above the baseline architecture. These sharing schemes require an exponential search over tied parameter sets to generate an optimal configuration. To mitigate the problem of exhaustively searching for model optimization, we propose the Dynamic Transfer Networks (DTN), a gated architecture which learns the appropriate parameter sharing scheme between source and target datasets. DTN achieves the improvements of the optimized transfer learning framework with just a single training setting, effectively removing the need for exponential search.


Design a single band microstrip patch antenna at 60 GHz millimeter wave for 5G application

This proposed paper, a single band microstrip patch antenna for 5G wireless application is presented. This proposed antenna is suitable for the millimeter wave frequency. The single band antenna consist of new H slot and E slot loaded on the radiating patch with the 50 ohms microstrip line feeding used. This single band antenna is simulated on a Rogers RT5880 dielectric substrate have relative permittivity 2.2, loss tangent 0.0009, and height 1.6mm. The antenna is simulated by Electromagnetic simulation, computer software technology Microwave studio. The proposed single band antenna and simulated result on return loss, VSWR, surface current and 3D radiation pattern is presented. The simulated antenna shows the return loss −40.99dB at 60 GHz millimeter wave 5G wireless application presented.


Data Analytics Using Ontologies of Management Theories: Towards Implementing "From Theory to Practice" (Application Paper)

We explore how computational ontologies can be impactful vis-à-vis the developing discipline of "data science." We posit an approach wherein management theories are represented as formal axioms, and then applied to draw inferences about data that reside in corporate databases. That is, management theories would be implemented as rules within a data analytics engine. We demonstrate a case study development of such an ontology by formally representing an accounting theory in First-Order Logic. Though quite preliminary, the idea that an information technology, namely ontologies, can potentially actualize the academic cliché, "From Theory to Practice," and be applicable to the burgeoning domain of data analytics is novel and exciting.


The effects of social media on emotions , brand relationship quality , and word of mouth : An empirical study of music festival attendees

This article focuses on two under-researched areas of tourism management e the management of music festivals, and the influence of social media on customer relationships. In the new digital era of marketing communications little is known about how social media interactions with tourism brands affect how consumers think and feel about those brands, and consequently how those interactions affect desired marketing outcomes such as word mouth. Based on the literature, a conceptual model was developed and was tested using structural equation modeling. The results show that social media does indeed have a significant influence on emotions and attachments to festival brands, and that social media-based relationships lead to desired outcomes such as positive word of mouth. © 2014 Elsevier Ltd. All rights reserved.


Computational Sociolinguistics: A Survey

Language is a social phenomenon and variation is inherent to its social nature. Recently, there has been a surge of interest within the computational linguistics (CL) community in the social dimension of language. In this article we present a survey of the emerging field of “computational sociolinguistics” that reflects this increased interest. We aim to provide a comprehensive overview of CL research on sociolinguistic themes, featuring topics such as the relation between language and social identity, language use in social interaction, and multilingual communication. Moreover, we demonstrate the potential for synergy between the research communities involved, by showing how the large-scale data-driven methods that are widely used in CL can complement existing sociolinguistic studies, and how sociolinguistics can inform and challenge the methods and assumptions used in CL studies. We hope to convey the possible benefits of a closer collaboration between the two communities and conclude with a discussion of open challenges.


Probabilistic Latent Semantic Analysis

Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two-mode and co-occurrence data, which has applications in information retrieval and filtering, natural language processing, ma chine learning from text, and in related ar eas. Compared to standard Latent Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occurrence tables, the proposed method is based on a mixture decomposition derived from a latent class model. This results. in a more principled approach which has a solid foundation in statistics. In order to avoid overfitting, we propose a widely applicable generalization of maximum likelihood model fitting by tempered EM. Our approach yields substantial and consistent improvements over Latent Semantic Analysis in a number of ex periments.


Rapid Synthesis of Massive Face Sets for Improved Face Recognition

Recent work demonstrated that computer graphics techniques can be used to improve face recognition performances by synthesizing multiple new views of faces available in existing face collections. By so doing, more images and more appearance variations are available for training, thereby improving the deep models trained on these images. Similar rendering techniques were also applied at test time to align faces in 3D and reduce appearance variations when comparing faces. These previous results, however, did not consider the computational cost of rendering: At training, rendering millions of face images can be prohibitive; at test time, rendering can quickly become a bottleneck, particularly when multiple images represent a subject. This paper builds on a number of observations which, under certain circumstances, allow rendering new 3D views of faces at a computational cost which is equivalent to simple 2D image warping. We demonstrate this by showing that the run-time of an optimized OpenGL rendering engine is slower than the simple Python implementation we designed for the same purpose. The proposed rendering is used in a face recognition pipeline and tested on the challenging IJB-A and Janus CS2 benchmarks. Our results show that our rendering is not only fast, but improves recognition accuracy.


One-Class Convolutional Neural Network

We present a novel convolutional neural network (CNN) based approach for one-class classification. The idea is to use a zero centered Gaussian noise in the latent space as the pseudo-negative class and train the network using the cross-entropy loss to learn a good representation as well as the decision boundary for the given class. A key feature of the proposed approach is that any pre-trained CNN can be used as the base network for one-class classification. The proposed one-class CNN is evaluated on the UMDAA-02 Face, Abnormality-1001, and FounderType-200 datasets. These datasets are related to a variety of one-class application problems such as user authentication, abnormality detection, and novelty detection. Extensive experiments demonstrate that the proposed method achieves significant improvements over the recent state-of-the-art methods. The source code is available at: github.com/otkupjnoz/oc-cnn.


Unsupervised Training Set Generation for Automatic Acquisition of Technical Terminology in Patents

NLP methods for automatic information access to rich technological knowledge sources like patents are of great value. One important resource for accessing this knowledge is the technical terminology of the patent domain. In this paper, we address the problem of automatic terminology acquisition (ATA), i.e., the problem of automatically identifying all technical terms in a document. We analyze technical terminology in patents and define the concept of technical term based on the analysis. We present a novel method for labeling large amounts of high-quality training data for ATA in an unsupervised fashion. We train two ATA methods on this training data, a term candidate classifier and a conditional random field (CRF), and investigate the utility of different types of features. Finally, we show that our method of automatically generating training data is effective and the two ATA methods successfully generalize, considerably increasing recall while preserving high precision relative to a state-of-the-art baseline.


Habanero-Java library: a Java 8 framework for multicore programming

With the advent of the multicore era, it is clear that future growth in application performance will primarily come from increased parallelism. We believe parallelism should be introduced early into the Computer Science curriculum to educate students on the fundamentals of parallel computation. In this paper, we introduce the newly-created Habanero-Java library (HJlib), a pure Java 8 library implementation of the pedagogic parallel programming model [12]. HJlib has been used in teaching a sophomore-level course titled "Fundamentals of Parallel Programming" at Rice University.
 HJlib adds to the Java ecosystem a powerful and portable task parallel programming model that can be used to parallelize both regular and irregular applications. By relying on simple orthogonal parallel constructs with important safety properties, HJlib allows programmers with a basic knowledge of Java to get started with parallel programming concepts by writing or refactoring applications to harness the power of multicore architecture. The HJlib APIs make extensive use of lambda expressions and can run on any Java 8 JVM. HJlib runtime feedback capabilities, such as the abstract execution metrics and the deadlock detector, help the programmer to obtain feedback on theoretical performance as well as the presence of potential bugs in their program.
 Being an implementation of a pedagogic programming model, HJlib is also an attractive tool for both educators and researchers. HJlib is actively being used in multiple research projects at Rice and also by external independent collaborators. These projects include exploitation of homogeneous and heterogeneous multicore parallelism in big data applications written for the Hadoop platform [20, 43].


A lightweight infrastructure for graph analytics

Several domain-specific languages (DSLs) for parallel graph analytics have been proposed recently. In this paper, we argue that existing DSLs can be implemented on top of a general-purpose infrastructure that (i) supports very fine-grain tasks, (ii) implements autonomous, speculative execution of these tasks, and (iii) allows application-specific control of task scheduling policies. To support this claim, we describe such an implementation called the Galois system.
 We demonstrate the capabilities of this infrastructure in three ways. First, we implement more sophisticated algorithms for some of the graph analytics problems tackled by previous DSLs and show that end-to-end performance can be improved by orders of magnitude even on power-law graphs, thanks to the better algorithms facilitated by a more general programming model. Second, we show that, even when an algorithm can be expressed in existing DSLs, the implementation of that algorithm in the more general system can be orders of magnitude faster when the input graphs are road networks and similar graphs with high diameter, thanks to more sophisticated scheduling. Third, we implement the APIs of three existing graph DSLs on top of the common infrastructure in a few hundred lines of code and show that even for power-law graphs, the performance of the resulting implementations often exceeds that of the original DSL systems, thanks to the lightweight infrastructure.


A Bridging Model for Parallel Computation

The success of the von Neumann model of sequential computation is attributable to the fact that it is an efficient bridge between software and hardware: high-level languages can be efficiently compiled on to this model; yet it can be effeciently implemented in hardware. The author argues that an analogous bridge between software and hardware in required for parallel computation if that is to become as widely used. This article introduces the bulk-synchronous parallel (BSP) model as a candidate for this role, and gives results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.


Comparison of Two β-Alanine Dosing Protocols on Muscle Carnosine Elevations.

OBJECTIVE
β-alanine (BA) is a nonproteogenic amino acid that combines with histidine to form carnosine. The amount taken orally in individual doses, however, is limited due to symptoms of paresthesia that are associated with higher doses. The use of a sustained-release formulation has been reported to reduce the symptoms of paresthesia, suggesting that a greater daily dose may be possible. The purpose of the present study was to determine whether increasing the daily dose of BA can result in a similar increase in muscle carnosine in a reduced time.

METHODS
Eighteen men and twelve women were randomized into either a placebo (PLC), 6-g BA (6G), or 12-g BA (12G) groups. PLC and 6G were supplemented for 4 weeks, while 12G was supplemented for 2 weeks. A resting blood draw and muscle biopsy were obtained prior to (PRE) and following (POST) supplementation. Plasma and muscle metabolites were measured by high-performance liquid chromatography. The loss in peak torque (ΔPT) was calculated from maximal isometric contractions before and after 250 isokinetic kicks at 180°·sec-1 PRE and POST.

RESULTS
Both 12G (p = 0.026) and 6G (p = 0.004) increased muscle carnosine compared to PLC. Plasma histidine was decreased from PRE to POST in 12G compared to PLC (p = 0.002) and 6G (p = 0.001), but no group x time interaction (p = 0.662) was observed for muscle histidine. No differences were observed for any hematological measure (e.g., complete blood counts) or in symptoms of paresthesia among the groups. Although no interaction was noted in ΔPT, a trend (p = 0.073) was observed.

CONCLUSION
Results of this investigation indicate that a BA supplementation protocol of 12 g/d-1, using a sustained-release formulation, can accelerate the increase in carnosine content in skeletal muscle while attenuating paresthesia.


Meta-awareness, perceptual decoupling and the wandering mind

Mind wandering (i.e. engaging in cognitions unrelated to the current demands of the external environment) reflects the cyclic activity of two core processes: the capacity to disengage attention from perception (known as perceptual decoupling) and the ability to take explicit note of the current contents of consciousness (known as meta-awareness). Research on perceptual decoupling demonstrates that mental events that arise without any external precedent (known as stimulus independent thoughts) often interfere with the online processing of sensory information. Findings regarding meta-awareness reveal that the mind is only intermittently aware of engaging in mind wandering. These basic aspects of mind wandering are considered with respect to the activity of the default network, the role of executive processes, the contributions of meta-awareness and the functionality of mind wandering.


Yoga as an adjunctive treatment for posttraumatic stress disorder: a randomized controlled trial.

BACKGROUND
More than a third of the approximately 10 million women with histories of interpersonal violence in the United States develop posttraumatic stress disorder (PTSD). Currently available treatments for this population have a high rate of incomplete response, in part because problems in affect and impulse regulation are major obstacles to resolving PTSD. This study explored the efficacy of yoga to increase affect tolerance and to decrease PTSD symptomatology.

METHOD
Sixty-four women with chronic, treatment-resistant PTSD were randomly assigned to either trauma-informed yoga or supportive women's health education, each as a weekly 1-hour class for 10 weeks. Assessments were conducted at pretreatment, midtreatment, and posttreatment and included measures of DSM-IV PTSD, affect regulation, and depression. The study ran from 2008 through 2011.

RESULTS
The primary outcome measure was the Clinician-Administered PTSD Scale (CAPS). At the end of the study, 16 of 31 participants (52%) in the yoga group no longer met criteria for PTSD compared to 6 of 29 (21%) in the control group (n = 60, χ²₁ = 6.17, P = .013). Both groups exhibited significant decreases on the CAPS, with the decrease falling in the large effect size range for the yoga group (d = 1.07) and the medium to large effect size decrease for the control group (d = 0.66). Both the yoga (b = -9.21, t = -2.34, P = .02, d = -0.37) and control (b = -22.12, t = -3.39, P = .001, d = -0.54) groups exhibited significant decreases from pretreatment to the midtreatment assessment. However, a significant group × quadratic trend interaction (d = -0.34) showed that the pattern of change in Davidson Trauma Scale significantly differed across groups. The yoga group exhibited a significant medium effect size linear (d = -0.52) trend. In contrast, the control group exhibited only a significant medium effect size quadratic trend (d = 0.46) but did not exhibit a significant linear trend (d = -0.29). Thus, both groups exhibited significant decreases in PTSD symptoms during the first half of treatment, but these improvements were maintained in the yoga group, while the control group relapsed after its initial improvement.

DISCUSSION
Yoga significantly reduced PTSD symptomatology, with effect sizes comparable to well-researched psychotherapeutic and psychopharmacologic approaches. Yoga may improve the functioning of traumatized individuals by helping them to tolerate physical and sensory experiences associated with fear and helplessness and to increase emotional awareness and affect tolerance.

TRIAL REGISTRATION
ClinicalTrials.gov identifier: NCT00839813.


ZOZZLE: Fast and Precise In-Browser JavaScript Malware Detection

JavaScript malware-based attacks account for a large fraction of successful mass-scale exploitation happening today. Attackers like JavaScript-based attacks because they can be mounted against an unsuspecting user visiting a seemingly innocent web page. While several techniques for addressing these types of exploits have been proposed, in-browser adoption has been slow, in part because of the performance overhead these methods incur. In this paper, we propose ZOZZLE, a low-overhead solution for detecting and preventing JavaScript malware that is fast enough to be deployed in the browser. Our approach uses Bayesian classification of hierarchical features of the JavaScript abstract syntax tree to identify syntax elements that are highly predictive of malware. Our experimental evaluation shows that ZOZZLE is able to detect JavaScript malware through mostly static code analysis effectively. ZOZZLE has an extremely low false positive rate of 0.0003%, which is less than one in a quarter million. Despite this high accuracy, the ZOZZLE classifier is fast, with a throughput of over one megabyte of JavaScript code per second.


Novel Word-sense Identification

Automatic lexical acquisition has been an active area of research in computational linguistics for over two decades, but the automatic identification of new word-senses has received attention only very recently. Previous work on this topic has been limited by the availability of appropriate evaluation resources. In this paper we present the largest corpus-based dataset of diachronic sense differences to date, which we believe will encourage further work in this area. We then describe several extensions to a state-of-the-art topic modelling approach for identifying new word-senses. This adapted method shows superior performance on our dataset of two different corpus pairs to that of the original method for both: (a) types having taken on a novel sense over time; and (b) the token instances of such novel senses.


Remaining Useful Life Estimation of Critical Components With Application to Bearings

Prognostics activity deals with the estimation of the Remaining Useful Life (RUL) of physical systems based on their current health state and their future operating conditions. RUL estimation can be done by using two main approaches, namely model-based and data-driven approaches. The first approach is based on the utilization of physics of failure models of the degradation, while the second approach is based on the transformation of the data provided by the sensors into models that represent the behavior of the degradation. This paper deals with a data-driven prognostics method, where the RUL of the physical system is assessed depending on its critical component. Once the critical component is identified, and the appropriate sensors installed, the data provided by these sensors are exploited to model the degradation's behavior. For this purpose, Mixture of Gaussians Hidden Markov Models (MoG-HMMs), represented by Dynamic Bayesian Networks (DBNs), are used as a modeling tool. MoG-HMMs allow us to represent the evolution of the component's health condition by hidden states by using temporal or frequency features extracted from the raw signals provided by the sensors. The prognostics process is then done in two phases: a learning phase to generate the behavior model, and an exploitation phase to estimate the current health state and calculate the RUL. Furthermore, the performance of the proposed method is verified by implementing prognostics performance metrics, such as accuracy, precision, and prediction horizon. Finally, the proposed method is applied to real data corresponding to the accelerated life of bearings, and experimental results are discussed.


Can you infect me now?: malware propagation in mobile phone networks

In this paper we evaluate the effects of malware propagating usingcommunication services in mobile phone networks. Although self-propagating malware is well understood in the Internet, mobile phone networks have very different characteristics in terms of topologies, services, provisioning and capacity, devices, and communication patterns. To investigate malware in this new environment, we have developed an event-driver simulator that captures the characteristics and constraints of mobile phone networks. In particular, the simulator models realistic topologies and provisioned capacities of the network infrastructure, as well as the contactgraphs determined by cell phone address books. We evaluate the speedand severity of random contact worms in mobile phone networks, characterize the denial-of-service effects such worms could have on the network, investigate approaches to accelerate malware propagation, and discuss the implications of defending networks against such attacks.


THE EXPOSURE OF YOUTH TO UNWANTED SEXUAL MATERIAL ON THE INTERNET A National Survey of Risk , Impact , and Prevention

This national survey of youth, ages 10 to 17, and their caretakers has several implications for the current debate about young people and Internet pornography. Twentyfive percent of youth had unwanted exposure to sexual pictures on the Internet in the past year, challenging the prevalent assumption that the problem is primarily about young people motivated to actively seek out pornography. Most youth had no negative reactions to their unwanted exposure, but one quarter said they were very or extremely upset, suggesting a priority need for more research on and interventions directed toward such negative effects. The use of filtering and blocking software was associated with a modest reduction in unwanted exposure, suggesting that it may help but is far from foolproof. Various forms of parental supervision were not associated with any reduction in exposure. The authors urge that social scientific research be undertaken to inform this highly contentious public policy controversy.


IT Security Governance: A Framework based on ISO 38500

ISO 38500 is an international standard for IT governance. The guidelines of ISO 38500 can also be applied at the IT security functional level in order to guide the governance of IT security. This paper proposes the use of a strategic information security management (ISM) framework to implement guidelines of ISO 38500. This approach provides several strategic advantages to the organization by 1) aligning IT security initiatives to business strategy; 2) providing a mechanism for establishing and tracking security metrics; and 3) enhancing the overall maturity of business, IT and IT security processes. The framework also leverages tools such as COBIT, the Balanced Scorecard and SSE-CMM in order to implement IT security governance and continuous improvement practices. Using extant literature, this paper identifies certain challenges and solutions with respect to the governance of IT security. For practitioners, it highlights relevant links between principles of ISO 38500 and IT governance, provides an over-arching contextual framework to drive IT security governance, and demonstrates mitigation solutions for IT security governance challenges. For academics, the paper makes theoretical contributions, by relating IT security governance to business strategy and proposing that firms develop dynamic governance capabilities (Pavlou and El Sawy, 2010) or organizational learning ladders (Ciborra and Andreu, 2010).


Hierarchical Tree Long Short-Term Memory for Sentence Representations

A fixed-length feature vector is required for many machine learning algorithms in NLP field. Word embeddings have been very successful at learning lexical information. However, they can’t capture the compositional meaning of sentences, which prevents them from a deeper understanding of language. In this paper, we introduce a novel hierarchical tree long short-term memory (HTLSTM) model that learns vector representations for sentences of arbitrary syntactic type and length. We propose to split one sentence into three hierarchies: short phrase, long phrase and full sentence level. The HTLSTM model gives our algorithm the potential to fully consider the hierarchical information and longterm dependencies of language. We design the experiments on both English and Chinese corpus to evaluate our model on sentiment analysis task. And the results show that our model outperforms several existing state of the art approaches significantly.


1 Basic model for Speech-to-Speech Translation

This paper reviews the technology used in Speech-to-Speech Translation that is the phrases spoken in one language are immediately spoken in another language by the device. Speech-to-Speech Translation is a three step software process which includes Automatic speech Recognition, Machine Translation and voice synthesis. This paper includes the major speech translation projects using different approaches for speech recognition, translation and text to speech synthesis highlighting the major pros and cons for the approach being used.


Hyperbolic Plykin Attractor Can Exist in Neuron Models

Hyperbolic Plykin attractor can exist in neuron models Strange hyperbolic attractors are hard to find in real physical systems. This paper provides the first example of a realistic system, a canonical three-dimensional (3D) model of bursting neurons, that is likely to have a strange hyperbolic attractor. Using a geometrical approach to the study of the neuron model, we derive a flow-defined Poincare map giving ail accurate account of the system's dynamics. In a parameter region where the neuron system undergoes bifurcations causing transitions between tonic spiking and bursting, this two-dimensional map becomes a map of a disk with several periodic holes. A particular case is the map of a disk with three holes, matching the Plykin example of a planar hyperbolic attractor. The corresponding attractor of the 3D neuron model appears to be hyperbolic (this property is not verified in the present paper) and arises as a result of a two-loop (secondary) homoclinic bifurcation of a saddle. This type of bifurcation, and the complex behavior it can produce, have not been previously examined.


Challenges and Best Practices for Mobile Application Development: Review Paper

Over the last ten years or so, mobile devices technology has changed significantly, with these devices and operating systems becoming more sophisticated. These developments have led to a huge variety of mobile applications designed for mobile operating systems. These mobile applications are typically harder to design and build because of several factors such as screen size and limited processing power and so forth. Therefore, it is important to clearly identify the characteristics of mobile application development and the issues and challenges related to it, as well as, the key features that characterize a great mobile application which make them valuable and useful. This paper has reviewed existing literature of the challenge and best practices of mobile application development. This study contributes towards a great understanding of the characteristics of mobile application development process, examines real challenges faced and explores the best practices that can be effectively applied to improve the development of mobile application.


Friend or foe: The effect of implicit trustworthiness judgments in social decision-making

The human face appears to play a key role in signaling social intentions and usually people form reliable and strong impressions on the basis of someone's facial appearance. Therefore, facial signals could have a substantial influence on how people evaluate and behave towards another person in a social interaction, such as an interactive risky decision-making game. Indeed, there is a growing body of evidence that demonstrates that social behavior plays a crucial role in human decision-making. Although previous research has demonstrated that explicit social information about one's partner can influence decision-making behavior, such as knowledge about the partner's moral status, much less is known about how implicit facial social cues affect strategic decision-making. One particular social cue that may be especially important in assessing how to interact with a partner is facial trustworthiness, a rapid, implicit assessment of the likelihood that the partner will reciprocate a generous gesture. In this experiment, we tested the hypothesis that implicit processing of trustworthiness is related to the degree to which participants cooperate with previously unknown partners. Participants played a Trust Game with 79 hypothetical partners who were previously rated on subjective trustworthiness. In each game, participants made a decision about how much to trust their partner, as measured by how much money they invested with that partner, with no guarantee of return. As predicted, people invested more money in partners who were subjectively rated as more trustworthy, despite no objective relationship between these factors. Moreover, the relationship between the amount of money offered seemed to be stronger for trustworthy faces as compared to untrustworthy faces. Overall, these data indicate that the perceived trustworthiness is a strong and important social cue that influences decision-making.


Assessing automotive functional safety microprocessor with ISO 26262 hardware requirements

This paper provides a step-by-step guideline for the assessment of an automotive safety microprocessor with ISO 26262 hardware requirements. ISO 26262 part 5 - Product development at the hardware level - specifies the safety activities during the phase of the automotive hardware development. In this phase, hardware safety design is derived (from the results of ISO 26262 part 3 and 4), implemented, integrated, and tested. To prove the compliance with ISO 26262 hardware development process, quantitative evaluations on the hardware are indispensable. These quantitative evaluations are known as hardware architecture metrics and probabilistic hardware metrics. The assessment results qualify a design with an automotive safety integrity level (ASIL) which ranges from ASIL-A (lowest) to ASIL-D (highest). In this paper, we implemented an exemplary safety microprocessor to demonstrate the ISO 26262 hardware assessment process. The derivation procedures of the ASIL level from the hardware architecture metrics and probabilistic hardware metrics are fully discussed. Based on the evaluation results, we also provide design suggestions for the ISO 26262 safety hardware design.


Video retargeting: automating pan and scan

When a video is displayed on a smaller display than originally intended, some of the information in the video is necessarily lost. In this paper, we introduce Video Retargeting that adapts video to better suit the target display, minimizing the important information lost. We define a framework that measures the preservation of the source material, and methods for estimating the important information in the video. Video retargeting crops each frame and scales it to fit the target display. An optimization process minimizes information loss by balancing the loss of detail due to scaling with the loss of content and composition due to cropping. The cropping window can be moved during a shot to introduce virtual pans and cuts, subject to constraints that ensure cinematic plausibility. We demonstrate results of adapting a variety of source videos to small display sizes.


Tutorial on agent-based modeling and simulation

Agent-based modeling and simulation (ABMS) is a new approach to modeling systems comprised of autonomous, interacting agents. ABMS promises to have far-reaching effects on the way that businesses use computers to support decision-making and researchers use electronic laboratories to support their research. Some have gone so far as to contend that ABMS is a third way of doing science besides deductive and inductive reasoning. Computational advances have made possible a growing number of agent-based applications in a variety of fields. Applications range from modeling agent behavior in the stock market and supply chains, to predicting the spread of epidemics and the threat of bio-warfare, from modeling consumer behavior to understanding the fall of ancient civilizations, to name a few. This tutorial describes the theoretical and practical foundations of ABMS, identifies toolkits and methods for developing ABMS models, and provides some thoughts on the relationship between ABMS and traditional modeling techniques.


Clickstream clustering using weighted longest common subsequences

Categorizing visitors based on their interactions with a we bsite is a key problem in web usage mining. The clickstreams generated by various users often follow disti nct patterns, the knowledge of which may help in providing customized content. In this paper, we propose a novel and eff ective algorithm for clustering webusers based on a function of the longest common subsequence of their clickst reams that takes into account both the trajectory taken through a website and the time spent at each page. Results are presented on weblogs of www.sulekha.com to illustrate the techniques. keywords : web usage mining, clickstream, subsequence, clustering.


Multimodal language grounding for improved human-robot collaboration: exploring spatial semantic representations in the shared space of attention

There is an increased interest in artificially intelligent technology that surrounds us and takes decisions on our behalf. This creates the need for such technology to be able to communicate with humans and understand natural language and non-verbal behaviour that may carry information about our complex physical world. Artificial agents today still have little knowledge about the physical space that surrounds us and about the objects or concepts within our attention. We are still lacking computational methods in understanding the context of human conversation that involves objects and locations around us. Can we use multimodal cues from human perception of the real world as an example of language learning for robots? Can artificial agents and robots learn about the physical world by observing how humans interact with it and how they refer to it and attend during their conversations? This PhD project’s focus is on combining spoken language and non-verbal behaviour extracted by multi-party dialogue in order to increase context awareness and spatial understanding for artificial agents.


Predicting football match results with logistic regression

Many efforts has been made in order to predict football matches result and selecting significant variables in football. Prediction is very useful in helping managers and clubs make the right decision to win leagues and tournaments. In this paper a logistic regression model is built to predict matches results of Barclays' Premier League season 2015/2016 for home win or away win and to determine what are the significant variable to win matches. Our work is different from others as we use only significant variables gathered from researches in the same field rather than making our own guess on what are the significant variables. We also used data gathered from video game FIFA, as Shin and Gasparyan [8] showed us that including data from the video game could improve prediction quality. The model was built using variations of training data from 2010/2011 season until 2015/2016. Logistic regression is a classification method which can be used to predict sports results and it can gives additional knowledge through regression coefficients. The variables used are “Home Offense”, “Home Defense”, “Away Offense”, and “Away Defense”. We conducted experiments by altering seasons of training data used. Prediction accuracy of built model is 69.5%. We found our work improved significantly compared to the one Snyder [9] did. We concluded that the significant variables are “Home Defense”, and “Away Defense”.


An Analysis on a Dynamic Amplifier and Calibration Methods for a Pseudo-Differential Dynamic Comparator

This paper analyzes a pseudo-differential dynamic comparator with a dynamic pre-amplifier. The transient gain of a dynamic preamplifier is derived and applied to equations of the thermal noise and the regeneration time of a comparator. This analysis enhances understanding of the roles of transistor’s parameters in pre-amplifier’s gain. Based on the calculated gain, two calibration methods are also analyzed. One is calibration of a load capacitance and the other is calibration of a bypass current. The analysis helps designers’ estimation for the accuracy of calibration, dead-zone of a comparator with a calibration circuit, and the influence of PVT variation. The analyzed comparator uses 90-nm CMOS technology as an example and each estimation is compared with simulation results. key words: dynamic amplifier, dynamic comparator, load capacitance, bypass current, calibration, and PVT variation


Development of a Wheelchair Skills Home Program for Older Adults Using a Participatory Action Design Approach

Restricted mobility is the most common impairment among older adults and a manual wheelchair is often prescribed to address these limitations. However, limited access to rehabilitation services results in older adults typically receiving little or no mobility training when they receive a wheelchair. As an alternative and novel approach, we developed a therapist-monitored wheelchair skills home training program delivered via a computer tablet. To optimize efficacy and adherence, principles of self-efficacy and adult learning theory were foundational in the program design. A participatory action design approach was used to engage older adult wheelchair users, care providers, and prescribing clinicians in an iterative design and development process. A series of prototypes were fabricated and revised, based on feedback from eight stakeholder focus groups, until a final version was ready for evaluation in a clinical trial. Stakeholder contributions affirmed and enhanced the foundational theoretical principles and provided validation of the final product for the target population.


Mediated parent-child contact in work-separated families

Parents and children in families living with regular separation due to work develop strategies to manage being apart. We interviewed 14 pairs of parents and children (ages 7 -- 13) from work-separated families to understand their experiences and the strategies that they use to keep their family together. Parents focus on combining scheduled synchronous and spontaneous asynchronous communication to maintain a constant presence in the life of the child. Children, on the other hand, focus on other sources of support, on other activities, and on the eventual reunion. Both the remote parent and the child rely heavily on a collocated adult to maintain aware-ness and contact. We compare work-separated families with other types of separation and highlight opportunities for new designs.


Lévy flights, non-local search and simulated annealing

We solve a problem of non-convex stochastic optimisation with help of simulated annealing of Lévy flights of a variable stability index. The search of the ground state of an unknown potential is non-local due to big jumps of the Levy flights process. The convergence to the ground state is fast due to a polynomial decrease rate of the temperature.


Cuckoo Search via Lévy flights

In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization problems. This algorithm is based on the obligate brood parasitic behaviour of some cuckoo species in combination with the Lévy flight behaviour of some birds and fruit flies. We validate the proposed algorithm against test functions and then compare its performance with those of genetic algorithms and particle swarm optimization. Finally, we discuss the implication of the results and suggestion for further research.


Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems

In this study, a new metaheuristic optimization algorithm, called cuckoo search (CS), is introduced for solving structural optimization tasks. The new CS algorithm in combination with Lévy flights is first verified using a benchmark nonlinear constrained optimization problem. For the validation against structural engineering optimization problems, CS is subsequently applied to 13 design problems reported in the specialized literature. The performance of the CS algorithm is further compared with various algorithms representative of the state of the art in the area. The optimal solutions obtained by CS are mostly far better than the best solutions obtained by the existing methods. The unique search features used in CS and the implications for future research are finally discussed in detail.


Visual Concepts and Compositional Voting

It is very attractive to formulate vision in terms of pattern theory [26], where patterns are defined hierarchically by compositions of elementary building blocks. But applying pattern theory to real world images is currently less successful than discriminative methods such as deep networks. Deep networks, however, are black-boxes which are hard to interpret and can easily be fooled by adding occluding objects. It is natural to wonder whether by better understanding deep networks we can extract building blocks which can be used to develop pattern theoretic models. This motivates us to study the internal representations of a deep network using vehicle images from the PASCAL3D+ dataset. We use clustering algorithms to study the population activities of the features and extract a set of visual concepts which we show are visually tight and correspond to semantic parts of vehicles. To analyze this we annotate these vehicles by their semantic parts to create a new dataset, VehicleSemanticParts, and evaluate visual concepts as unsupervised part detectors. We show that visual concepts perform fairly well but are outperformed by supervised discriminative methods such as Support Vector Machines (SVM). We next give a more detailed analysis of visual concepts and how they relate to semantic parts. Following this, we use the visual concepts as building blocks for a simple pattern theoretical model, which we call compositional voting. In this model several visual concepts combine to detect semantic parts. We show that this approach is significantly better than discriminative methods like SVM and deep networks trained specifically for semantic part detection. Finally, we return to studying occlusion by creating an annotated dataset with occlusion, called VehicleOcclusion, and show that compositional voting outperforms even deep networks when the amount of occlusion becomes large.


Universal coding, information, prediction, and estimation

A connection between universal codes and the problems of prediction and statistical estimation is established. A‘known lower bound for the mean length of universal codes is sharpened and generalized, and optimum universal codes constructed. The bound is defined to give the information in strings relative to the considered class of processes. The earlier derived minimum description length criterion for estimation of parameters, including their number, is given a fundamental information, theoretic justification by showing that its estimators achieve the information in the strings. It is also shown that one cannot do prediction in Manuscript received July 13,1983; revised January 16,1984. This work was presented in part at the IEEE International Symposium on Information Theory, St. Jovite, Canada, September 26-30, 1983. This work was done while the author was Visiting Professor at the Department of System Science, University of California, Los Angeles, while on leave from the IBM Research Laboratory, San Jose, CA 95193. Gaussian autoregressive moving average (ARMA) processes below a bound, which is determined by the information in the data.


Social Collaborative Viewpoint Regression with Explainable Recommendations

A recommendation is called explainable if it not only predicts a numerical rating for an item, but also generates explanations for users' preferences. Most existing methods for explainable recommendation apply topic models to analyze user reviews to provide descriptions along with the recommendations they produce. So far, such methods have neglected user opinions and influences from social relations as a source of information for recommendations, even though these are known to improve the rating prediction.
 In this paper, we propose a latent variable model, called social collaborative viewpoint regression (sCVR), for predicting item ratings based on user opinions and social relations. To this end, we use so-called viewpoints, represented as tuples of a concept, topic, and a sentiment label from both user reviews and trusted social relations. In addition, such viewpoints can be used as explanations. We apply a Gibbs EM sampler to infer posterior distributions of sCVR. Experiments conducted on three large benchmark datasets show the effectiveness of our proposed method for predicting item ratings and for generating explanations.


Continuous Queries over Append-Only Databases

In a database to which data is continually added, users may wish to issue a permanent query and be notified whenever data matches the query. If such continuous queries examine only single records, this can be implemented by examining each record as it arrives. This is very efficient because only the incoming record needs to be scanned. This simple approach does not work for queries involving joins or time. The Tapestry system allows users to issue such queries over a database of mail and bulletin board messages. The user issues a static query, such as “show me all messages that have been replied to by Jones,” as though the database were fixed and unchanging. Tapestry converts the query into an incremental query that efficiently finds new matches to the original query as new messages are added to the database. This paper describes the techniques used in Tapestry, which do not depend on triggers and thus be implemented on any commercial database that supports SQL. Although Tapestry is designed for filtering mail and news messages, its techniques are applicable to any append-only database.


Data Governance Maturity Model for Micro Financial Organizations in Peru

Micro finance organizations play an important role since they facilitate integration of all social classes to sustained economic growth. Against this background, exponential growth of data, resulting from transactions and operations carried out with these companies on a daily basis, becomes imminent. Appropriate management of this data is therefore necessary because, otherwise, it will result in a competitive disadvantage due to the lack of valuable and quality information for decision-making and process improvement. Data Governance provides a different approach to data management, as seen from the perspective of business assets. In this regard, it is necessary that the organization have the ability to assess the extent to which that management is correct or is generating expected results. This paper proposes a data governance maturity model for micro finance organizations, which frames a series of formal requirements and criteria providing an objective diagnosis. This model was implemented based on the information of a Peruvian micro finance organization. Four domains, out of the seven listed in the model, were evaluated. Finally, after validation of the proposed model, it was evidenced that it serves as a means for identifying the gap between data management and objectives set.


The Use of Case-Based Reasoning for the Monitoring of Financial Fraud Transactions

Financial transaction fraud constitutes an acute problem domain for detection and early warning systems. Despite that different branches of AI have been addressing the problem since the late 90s, CBR approaches have seldom been applied. This paper provides a proof of concept approach and experimental investigation for the use of a CBR Intelligent Monitoring System for detecting abnormal patterns in financial transaction flows. The representation of workflow related knowledge in this research using graphs is explained. The workflow process is orchestrated by a software system using BPEL technologies within a service-oriented architecture. Workflow cases are represented in terms of events and their corresponding temporal relationships. The matching and CBR retrieval mechanisms used in this research are explained and a simple evaluation of the approach is provided using simulation data. Further work on the system and the extension to a full intelligent monitoring and process optimisation system is finally presented.


Light at the End of the Tunnel: High-Speed LiDAR-Based Train Localization in Challenging Underground Environments

In this paper, we present an infrastructure-free mapping and localization framework for rail vehicles using only a lidar sensor. Our method is designed to handle the pathological environment found in modern underground tunnels: narrow, parallel, and relatively smooth concrete walls with very little infrastructure to break up the empty spaces in the tunnel. By using an RQE-based, point-cloud alignment approach, we are able to implement a sliding-window algorithm, used for both mapping and localization. We demonstrate the proposed method with datasets gathered on a subway train travelling at high speeds (up to 70 km/h) in an underground tunnel for a total of 20 km across 6 runs. Our method is capable of mapping the tunnel with less than 0.6% error over the total length of the generated map. It is capable of continuously localizing, relative to the generated map, to within 10 cm in stations and at crossovers, and 1.8 m in pathological sections of tunnel. This method improves rail-based localization in a tunnel, which can be used to increase capacity on existing railways and for automated trains.


TaxoFinder: A Graph-Based Approach for Taxonomy Learning

Taxonomy learning is an important task for knowledge acquisition, sharing, and classification as well as application development and utilization in various domains. To reduce human effort to build a taxonomy from scratch and improve the quality of the learned taxonomy, we propose a new taxonomy learning approach, named TaxoFinder. TaxoFinder takes three steps to automatically build a taxonomy. First, it identifies domain-specific concepts from a domain text corpus. Second, it builds a graph representing how such concepts are associated together based on their co-occurrences. As the key method in TaxoFinder, we propose a method for measuring associative strengths among the concepts, which quantify how strongly they are associated in the graph, using similarities between sentences and spatial distances between sentences. Lastly, TaxoFinder induces a taxonomy from the graph using a graph analytic algorithm. TaxoFinder aims to build a taxonomy in such a way that it maximizes the overall associative strengths among the concepts in the graph to build a taxonomy. We evaluate TaxoFinder using gold-standard evaluation on three different domains: emergency management for mass gatherings, autism research, and disease domains. In our evaluation, we compare TaxoFinder with a state-of-the-art subsumption method and show that TaxoFinder is an effective approach significantly outperforming the subsumption method.


A Survey of Caching Mechanisms in Information-Centric Networking

Information-Centric Networking (ICN) is a novel networking paradigm that attracts increasing research interests in recent years. In-network caching has been viewed as an attractive feature of ICN because it can reduce network traffic, alleviate server bottleneck, and reduce the user access latencies. Because of this, the network community has proposed many in-network caching mechanisms that aim at optimizing various performance metrics such as cache hit ratio and cache hit distance. In this survey, we present a comprehensive overview of the recently proposed in-network caching mechanisms for ICN. For each caching mechanism, we describe it in detail, present examples to illustrate how it works, and analyze its possible benefits and drawbacks. We also compare some typical in-network caching mechanisms through extensive simulations and discuss the remaining research challenges.


Convolutional Self Organizing Map

Recently, deep learning became very popular, and was applied to many fields. The convolutional neural networks are often used for representing the layers for deep learning. In this paper, we propose Convolutional Self Organizing Map, which can be applicable to deep learning. Conventional Self Organizing Map uses single layered architecture, and can visualizes and classifies the input data on 2 dimensional map. SOMs which uses multiple layers are already proposed. In this paper, we propose Self Organizing Map algorithms which include convolutional layers. 2 types of convolution methods, which are based on conventional method and inspired from Self Organizing Map algorithm are proposed, and the performance of both method is examined in the experiments of clustering image data.


Probabilistic neural network and its application

Nuclear marine apparatus is a huge complicated system, most of which equipments are of nonlin-earity, time varying, coupling and inexactness. Neuralnet is widely applied in nuclear fault diagnosis for its approaching any kinds of nonlinearity mapping. At present, BP neural net is used more widely, but the layers of the net and the neurones on each layer can not be delimited easily; such net may fall into the minimum point in the course of training. In this essay, PNN proves effective in diagnosing faults on nuclearmarine apparatus.


Cardboard semiotics: reconfigurable symbols as a means for narrative prototyping in game design

In this paper, we propose the technique of cardboard semiotics. We explain the importance of symbolic analysis as a tool for building narrative prototypes in videogames. Borrowing from the participatory design work in the early 1990s, we suggest a means for adapting and extending this work based on the implicit participation of gamers' immediate-level stories (i.e., the gameplay with narrative implications). Our paper first introduces the concept of semiotics and explains how cardboard semiotics can function as an applied technique within the domain of videogame design and development. Next, we propose a theoretical basis for our work using a simple three act narrative structure and explore some basic concepts from narrative game design. Finally, we conclude with some simple examples of how cardboard semiotics might function in a design environment.


Role of the amygdala in decision-making.

The somatic marker hypothesis proposes that both the amygdala and the orbitofrontal cortex are parts of a neural circuit critical for judgment and decision-making. Although both structures couple exteroceptive sensory information with interoceptive information concerning somatic/emotional states, they do so at different levels, thus making different contributions to the process. We define "primary inducers" as stimuli that unconditionally, or through learning (e.g., conditioning and semantic knowledge), can (perceptually or subliminally) produce states that are pleasurable or aversive. Encountering a fear object (e.g., a snake), a stimulus predictive of a snake, or semantic information such as winning or losing a large sum of money are all examples of primary inducers. "Secondary inducers" are entities generated by the recall of a personal or hypothetical emotional event or perceiving a primary inducer that generates "thoughts" and "memories" about the inducer, all of which, when they are brought to memory, elicit a somatic state. The episodic memory of encountering a snake, losing a large sum of money, imagining the gain of a large sum of money, or hearing or looking at primary inducers that bring to memory "thoughts" pertaining to an emotional event are all examples of secondary inducers. We present evidence in support of the hypothesis that the amygdala is a critical substrate in the neural system necessary for triggering somatic states from primary inducers. The ventromedial cortex is a critical substrate in the neural system necessary for the triggering of somatic states from secondary inducers. The amygdala system is a priori a necessary step for the normal development of the orbitofrontal system for triggering somatic states from secondary inducers. However, once this orbitofrontal system is developed, the induction of somatic states by secondary inducers via the orbitofrontal system is less dependent on the amygdala system. Perhaps the amygdala is equivalent to the hippocampus with regard to emotions, that is, necessary for acquiring new emotional attributes (anterograde emotions), but not for retrieving old emotional attributes (retrograde emotions). Given the numerous lesion and functional neuroimaging studies illustrating the involvement of the amygdala in complex cognitive and behavioral functions, including "social cognition," we suggest that this involvement is a manifestation of a more fundamental function mediated by the amygdala, which is to couple stimuli/entities with their emotional attributes, that is, the processing of somatic states from primary inducers.


Bazaar-Extension: A CloudSim Extension for Simulating Negotiation Based Resource Allocations

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


Training neural nets with the reactive tabu search

In this paper the task of training subsymbolic systems is considered as a combinatorial optimization problem and solved with the heuristic scheme of the reactive tabu search (RTS). An iterative optimization process based on a "modified local search" component is complemented with a meta-strategy to realize a discrete dynamical system that discourages limit cycles and the confinement of the search trajectory in a limited portion of the search space. The possible cycles are discouraged by prohibiting (i.e., making tabu) the execution of moves that reverse the ones applied in the most recent part of the search. The prohibition period is adapted in an automated way. The confinement is avoided and a proper exploration is obtained by activating a diversification strategy when too many configurations are repeated excessively often. The RTS method is applicable to nondifferentiable functions, is robust with respect to the random initialization, and effective in continuing the search after local minima. Three tests of the technique on feedforward and feedback systems are presented.


SDN for network security

Software Defined Networking, SDN, is the programmable separation of control and forwarding elements of networking that enables software control of network forwarding that can be logically and/or physically separated from physical switches and routers. The following important question is considered in this paper: to what extent can SDN-based networks address network security management problems? The new opportunities for enhancing network security brought by this separation are considered in the paper.


Computerized classification of intraductal breast lesions using histopathological images

In the diagnosis of preinvasive breast cancer, some of the intraductal proliferations pose a special challenge. The continuum of intraductal breast lesions includes the usual ductal hyperplasia (UDH), atypical ductal hyperplasia (ADH), and ductal carcinoma in situ (DCIS). The current standard of care is to perform percutaneous needle biopsies for diagnosis of palpable and image-detected breast abnormalities. UDH is considered benign and patients diagnosed UDH undergo routine follow-up, whereas ADH and DCIS are considered actionable and patients diagnosed with these two subtypes get additional surgical procedures. About 250 000 new cases of intraductal breast lesions are diagnosed every year. A conservative estimate would suggest that at least 50% of these patients are needlessly undergoing unnecessary surgeries. Thus, improvement in the diagnostic reproducibility and accuracy is critically important for effective clinical management of these patients. In this study, a prototype system for automatically classifying breast microscopic tissues to distinguish between UDH and actionable subtypes (ADH and DCIS) is introduced. This system automatically evaluates digitized slides of tissues for certain cytological criteria and classifies the tissues based on the quantitative features derived from the images. The system is trained using a total of 327 regions of interest (ROIs) collected across 62 patient cases and tested with a sequestered set of 149 ROIs collected across 33 patient cases. An overall accuracy of 87.9% is achieved on the entire test data. The test accuracy of 84.6% is obtained with borderline cases (26 of the 33 test cases) only, when compared against the diagnostic accuracies of nine pathologists on the same set (81.2% average), indicates that the system is highly competitive with the expert pathologists as a stand-alone diagnostic tool and has a great potential in improving diagnostic accuracy and reproducibility when used as a “second reader” in conjunction with the pathologists.


Action recognition with trajectory-pooled deep-convolutional descriptors

Visual features are of vital importance for human action understanding in videos. This paper presents a new video representation, called trajectory-pooled deep-convolutional descriptor (TDD), which shares the merits of both hand-crafted features [31] and deep-learned features [24]. Specifically, we utilize deep architectures to learn discriminative convolutional feature maps, and conduct trajectory-constrained pooling to aggregate these convolutional features into effective descriptors. To enhance the robustness of TDDs, we design two normalization methods to transform convolutional feature maps, namely spatiotemporal normalization and channel normalization. The advantages of our features come from (i) TDDs are automatically learned and contain high discriminative capacity compared with those hand-crafted features; (ii) TDDs take account of the intrinsic characteristics of temporal dimension and introduce the strategies of trajectory-constrained sampling and pooling for aggregating deep-learned features. We conduct experiments on two challenging datasets: HMD-B51 and UCF101. Experimental results show that TDDs outperform previous hand-crafted features [31] and deep-learned features [24]. Our method also achieves superior performance to the state of the art on these datasets.


Designing A Virtual Empowerment Mobile App for the Blinds

The Virtual Empowerment App for the Blinds is an empowerment mobile application for the blind. It is developed based on the modules of the existing Latihan Maya Kejayaan Orang Kurang Upaya app, which was intended to empower persons with physical disabilities. As the requirements of persons with physical disabilities greatly differ from that of vision disabilities, this study aims to develop an app that would help blind users to navigate the module of Latihan Maya Kejayaan OKU by themselves based on the requirements observed from the blind users. An interface design to develop a functional and practical app for the blinds is proposed. A comparison between different gesture platforms was also compared. Three tests were conducted, namely the preliminary testing, pilot testing and final testing to analyze the interaction of users when using the app. Results suggested that the extended app developed based on the design proposed in this study were easily navigated and adapted by persons with vision disabilities.


Is face recognition really a Compressive Sensing problem?

Compressive Sensing has become one of the standard methods of face recognition within the literature. We show, however, that the sparsity assumption which underpins much of this work is not supported by the data. This lack of sparsity in the data means that compressive sensing approach cannot be guaranteed to recover the exact signal, and therefore that sparse approximations may not deliver the robustness or performance desired. In this vein we show that a simple £2 approach to the face recognition problem is not only significantly more accurate than the state-of-the-art approach, it is also more robust, and much faster. These results are demonstrated on the publicly available YaleB and AR face datasets but have implications for the application of Compressive Sensing more broadly.


Fully Statistical Neural Belief Tracking

This paper proposes an improvement to the existing data-driven Neural Belief Tracking (NBT) framework for Dialogue State Tracking (DST). The existing NBT model uses a hand-crafted belief state update mechanism which involves an expensive manual retuning step whenever the model is deployed to a new dialogue domain. We show that this update mechanism can be learned jointly with the semantic decoding and context modelling parts of the NBT model, eliminating the last rule-based module from this DST framework. We propose two different statistical update mechanisms and show that dialogue dynamics can be modelled with a very small number of additional model parameters. In our DST evaluation over three languages, we show that this model achieves competitive performance and provides a robust framework for building resource-light DST models.


Semantically Conditioned LSTM-based Natural Language Generation for Spoken Dialogue Systems

Natural language generation (NLG) is a critical component of spoken dialogue and it has a significant impact both on usability and perceived quality. Most NLG systems in common use employ rules and heuristics and tend to generate rigid and stylised responses without the natural variation of human language. They are also not easily scaled to systems covering multiple domains and languages. This paper presents a statistical language generator based on a semantically controlled Long Short-term Memory (LSTM) structure. The LSTM generator can learn from unaligned data by jointly optimising sentence planning and surface realisation using a simple cross entropy training criterion, and language variation can be easily achieved by sampling from output candidates. With fewer heuristics, an objective evaluation in two differing test domains showed the proposed method improved performance compared to previous methods. Human judges scored the LSTM system higher on informativeness and naturalness and overall preferred it to the other systems.


Incorporating Loose-Structured Knowledge into LSTM with Recall Gate for Conversation Modeling

Modeling human conversations is the essence for building satisfying chat-bots with multi-turn dialog ability. Conversation modeling will notably benefit from domain knowledge since the relationships between sentences can be clarified due to semantic hints introduced by knowledge. In this paper, a deep neural network is proposed to incorporate background knowledge for conversation modeling. Through a specially designed Recall gate, domain knowledge can be transformed into the extra global memory of Long Short-Term Memory (LSTM), so as to enhance LSTM by cooperating with its local memory to capture the implicit semantic relevance between sentences within conversations. In addition, this paper introduces the loose structured domain knowledge base, which can be built with slight amount of manual work and easily adopted by the Recall gate. Our model is evaluated on the context-oriented response selecting task, and experimental results on both two datasets have shown that our approach is promising for modeling human conversations and building key components of automatic chatting systems.


A Diversity-Promoting Objective Function for Neural Conversation Models

Sequence-to-sequence neural network models for generation of conversational responses tend to generate safe, commonplace responses (e.g.,I don’t know) regardless of the input. We suggest that the traditional objective function, i.e., the likelihood of output (responses) given input (messages) is unsuited to response generation tasks. Instead we propose using Maximum Mutual Information (MMI) as objective function in neural models. Experimental results demonstrate that the proposed objective function produces more diverse, interesting, and appropriate responses, yielding substantive gains in BLEU scores on two conversational datasets.


Are We There Yet? Research in Commercial Spoken Dialog Systems

In this paper we discuss the recent evolution of spoken dialog systems in commercial deployments. Yet based on a simple finite state machine design paradigm, dialog systems reached today a higher level of complexity. The availability of massive amounts of data during deployment led to the development of continuous optimization strategy pushing the design and development of spoken dialog applications from an art to science. At the same time new methods for evaluating the subjective caller experience are available. Finally we describe the inevitable evolution for spoken dialog applications from speech only to multimodal interaction.


Tonsillectomy and risk of Parkinson's disease: A danish nationwide population-based cohort study.

BACKGROUND
We hypothesized that tonsillectomy modifies the risk of PD.

OBJECTIVES
To test the hypothesis in a nationwide population-based cohort study.

METHODS
We used Danish medical registries to construct a cohort of all patients in Denmark with an operation code of tonsillectomy 1980-2010 (n = 195,169) and a matched age and sex general population comparison cohort (n = 975,845). Patients were followed until PD diagnosis, death, censoring, or end of follow-up 30 November 2013. Using Cox regression, we computed hazard ratios for PD and corresponding 95% confidence intervals, adjusting for age and sex by study design, and potential confounders.

RESULTS
We identified 100 and 568 patients diagnosed with PD among the tonsillectomy and general population comparison cohort, respectively, finding similar risks of PD (adjusted hazard ratio = 0.95 [95% confidence interval: 0.76-1.19]; for > 20 years' follow-up (adjusted hazard ratio = 0.96 [95% confidence interval: 0.64-1.41]).

CONCLUSION
Tonsillectomy is not associated with risk of PD, especially early-onset PD. © 2017 International Parkinson and Movement Disorder Society.


Acceptance of homegrown enterprise resource planning (ERP) systems in Ethiopia

In the current competitive global market, organizations are implementing information and communication technology (ICT) that could add value to their products, processes, and satisfaction of their users. The adoption, implementation and use of homegrown enterprise resource planning (ERP) systems is one of these mechanisms being globally used for recording, processing, storing, and exchanging organizational information anytime anywhere. Although organizations have been utilizing ERP systems, the acceptance of homegrown ERP systems is given less attention as compared to commercial off-the shelf (COTS) software. Hence, this research studied factors that determine acceptance of homegrown ERP through the extension of unified theory of acceptance and use of technology (UTAUT) model. The finding revealed that performance expectancy, effort expectancy, social influence, competitive advantage, cost effectiveness, and facilitations functions are determinants of homegrown ERP system acceptance in Ethiopia. Moreover, experience and voluntariness are found to be significant moderators of the study.


Explaining contradictory relations between risk perception and risk taking.

Different studies have documented opposite relations between perceived risk and behavior. The present study tested a theoretical explanation that reconciles these conflicting results. Adolescents (N= 596) completed alternative measures of risk perception that differed in cue specificity and response format. As predicted by fuzzy-trace theory, measures that emphasized verbatim retrieval and quantitative processing produced positive correlations between perceived risk and risky behavior; risk perceptions reflected the extent to which adolescents engaged in risky behavior. In contrast, measures that assessed global, gist-based judgments of risk produced negative correlations; higher risk perceptions were associated with less risk taking, a protective rather than reflective relation. Endorsement of simple values and principles provided the greatest protection against risk taking. Results support a dual-processes interpretation of the relation between risk perception and risk taking according to which observed relations depend on whether the cues in questions trigger verbatim or gist processing.


Local optima smoothing for global optimization

It is widely believed that in order to solve large scale global optimization problems an appropriate mixture of local approximation and global exploration is necessary. Local approximation, if first order information on the objective function is available, is efficiently performed by means of local optimization methods. Unfortunately, global exploration, in absence of some kind of global information on the problem, is a “blind” procedure, aimed at placing observations as evenly as possible in the search domain. Often this procedure reduces to uniform random sampling (like in Multistart algorithms, or in techniques based on clustering). In this paper we propose a new framework for global exploration which tries to guide random exploration towards the region of attraction of low-level local optima. The main idea originated by the use of smoothing techniques (based on gaussian convolutions): the possibility of applying a smoothing transformation not to the objective function but to the result of local searches seems to have never been explored yet. Although an exact smoothing of the results of local searches is impossible to implement, in this paper we propose a computational approximation scheme which has proven to be very efficient and (maybe more important) extremely robust in solving large scale global optimization problems with huge numbers of local optima. ∗Email: b.addis@ing.unifi.it Dip. Sistemi e Informatica Università di Firenze †Email: locatell@di.unito.it Dip. Informatica Università di Torino ‡Email: schoen@ing.unifi.it Dip. Sistemi e Informatica Università di Firenze


Efficient Subgraph Matching on Billion Node Graphs

The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, reachability, regular expression matching, etc. In many cases, graph indices are employed to speed up query processing. Typically, most indices require either super-linear indexing time or super-linear indexing space. Unfortunately, for very large graphs, super-linear approaches are almost always infeasible. In this paper, we study the problem of subgraph matching on billion-node graphs. We present a novel algorithm that supports efficient subgraph matching for graphs deployed on a distributed memory store. Instead of relying on super-linear indices, we use efficient graph exploration and massive parallel computing for query processing. Our experimental results demonstrate the feasibility of performing subgraph matching on web-scale graph data.


Model checking of linear temporal logic (LTL) specifications with respect to pushdown systems has been shown to be a useful tool for analysis of programs with potentially recursive procedures. LTL, however, can specify only regular properties, and properties such as correctness of procedures with respect to pre and post conditions, that require matching of calls and returns, are not regular. We introduce a temporal logic of calls and returns (CARET) for specification and algorithmic verification of correctness requirements of structured programs. The formulas of CARET are interpreted over sequences of propositional valuations tagged with special symbols call and ret. Besides the standard global temporal modalities, CARET admits the abstract-next operator that allows a path to jump from a call to the matching return. This operator can be used to specify a variety of non-regular properties such as partial and total correctness of program blocks with respect to pre and post conditions. The abstract versions of the other temporal modalities can be used to specify regular properties of local paths within a procedure that skip over calls to other procedures. CARET also admits the caller modality that jumps to the most recent pending call, and such caller modalities allow specification of a variety of security properties that involve inspection of the call-stack. Even though verifying context-free properties of pushdown systems is undecidable, we show that model checking CARET formulas against a pushdown model is decidable. We present a tableau construction that reduces our model checking problem to the emptiness problem for a Büchi pushdown system. The complexity of model checking CARET formulas is the same as that of checking LTL formulas, namely, polynomial in the model and singly exponential in the size of the specification. Comments From the 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 April 2, 2004. This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/203 A Temporal Logic of Nested Calls and Returns ? Rajeev Alur, Kousha Etessami, and P. Madhusudan 1 University of Pennsylvania 2 University of Edinburgh Abstract. Model checking of linear temporal logic (LTL) speci cations Model checking of linear temporal logic (LTL) speci cations with respect to pushdown systems has been shown to be a useful tool for analysis of programs with potentially recursive procedures. LTL, however, can specify only regular properties, and properties such as correctness of procedures with respect to pre and post conditions, that require matching of calls and returns, are not regular. We introduce a temporal logic of calls and returns (CaRet) for speci cation and algorithmic veri cation of correctness requirements of structured programs. The formulas of CaRet are interpreted over sequences of propositional valuations tagged with special symbols call and ret. Besides the standard global temporal modalities, CaRet admits the abstract-next operator that allows a path to jump from a call to the matching return. This operator can be used to specify a variety of non-regular properties such as partial and total correctness of program blocks with respect to pre and post conditions. The abstract versions of the other temporal modalities can be used to specify regular properties of local paths within a procedure that skip over calls to other procedures. CaRet also admits the caller modality that jumps to the most recent pending call, and such caller modalities allow speci cation of a variety of security properties that involve inspection of the call-stack. Even though verifying contextfree properties of pushdown systems is undecidable, we show that model checking CaRet formulas against a pushdown model is decidable. We present a tableau construction that reduces our model checking problem to the emptiness problem for a B uchi pushdown system. The complexity of model checking CaRet formulas is the same as that of checking LTL formulas, namely, polynomial in the model and singly exponential in the size of the speci cation.


Q # : A Quantum Programming Language by Microsoft

The multi-paradigm quantum programming language Q# was analysed and used to study and create novel programs that were able to go beyond the capabilities of any classical program. This language was built by Microsoft to succeed LIQUi|> and is a Domain-Specific Language (DSL) that can be used within Microsoft’s Quantum Development Kit (QDK). The quantum programs are run on a quantum simulator which possesses properties that a real quantum computer would from a behavioural aspect. It uses the .NET Code SDK, allowing for easy creation, building and running of quantum projects via the command line. Initially, the main features and libraries available were studied and experimented with by analysing implementations of the Quantum Teleportation and Deutsch-Jozsa algorithms. Thereafter, an algorithm to solve an arbitrary 2 × 2 matrix system of linear equations was implemented, demonstrating a theoretical quantum speed-up with time complexities of order O(logN) compared to the classical O(N) for sparse matrices. Running the algorithm for a particular matrix achieved results that were within the range of theoretical predictions. Subsequently, as an extension to the project, concepts within Quantum Game Theory were explored. This led to the Mermin-Peres Magic Square game successfully being simulated in Q#; a game where no classical winning strategy exists, yet a quantum strategy is able to win in all possible cases of the game.


Nuclei segmentation of microscopic breast cancer image using Gram-Schmidt and cluster validation algorithm

A combination of Gram-Schmidt method and cluster validation algorithm based Bayesian is proposed for nuclei segmentation on microscopic breast cancer image. Gram-Schmidt is applied to identify the cell nuclei on a microscopic breast cancer image and the cluster validation algorithm based Bayesian method is used for separating the touching nuclei. The microscopic image of the breast cancer cells are used as dataset. The segmented cell nuclei results on microscopic breast cancer images using Gram-Schmidt method shows that the most of MSE values are below 0.1 and the average MSE of segmented cell nuclei results is 0.08. The average accuracy of separated cell nuclei counting using cluster validation algorithm is 73% compares with the manual counting.


TCS-TRA-1260 TCS Technical Report ZDD-Based Computation of the Number of Paths in a Graph by

(Abstract) Counting the number of paths in a graph, for example the number of nonintersecting (or self-avoiding) rook paths joining opposite corners of an n × n grid, is not an easy problem since no mathematical formula is found and the number becomes too large to enumerate one by one except for small graphs. We have implemented software based on the ZDD technique in Knuth's " The Art of Computer Programming " carefully so as to achieve better memory efficiency, and have succeeded in computing the exact numbers for some graphs that were not known until now.


Approximate model for interactive-tendon driven mechanism of a multiple-DoFs myoelectric prosthetic hand

For practical use, a myoelectric prosthetic hand needs to (1) have a human-like structure, (2) be lightweight, (3) have multiple degrees of freedom (DoFs), and (4) have a high grip force. We have developed a myoelectric prosthetic hand with an interactive-tendon driven mechanism. This paper describes the control method by which the interactive-tendon driven mechanism produces fine and precise actions, as well as an approximate model for the control method. The approximate model was developed based on a geometry model and an equilibrium model for the joint torque. Experimental results show that the joint motions of the actual robotic hand are controlled with errors of between 9 and 15% using the approximate model.


Modeling punctuation prediction as machine translation

Punctuation prediction is an important task in Spoken Language Translation. The output of speech recognition systems does not typically contain punctuation marks. In this paper we analyze different methods for punctuation prediction and show improvements in the quality of the final translation output. In our experiments we compare the different approaches and show improvements of up to 0.8 BLEU points on the IWSLT 2011 English French Speech Translation of Talks task using a translation system to translate from unpunctuated to punctuated text instead of a language model based punctuation prediction method. Furthermore, we do a system combination of the hypotheses of all our different approaches and get an additional improvement of 0.4 points in BLEU.


Sneaking around concatMap: efficient combinators for dynamic programming

We present a framework of dynamic programming combinators that provides a high-level environment to describe the recursions typical of dynamic programming over sequence data in a style very similar to algebraic dynamic programming (ADP). Using a combination of type-level programming and stream fusion leads to a substantial increase in performance, without sacrificing much of the convenience and theoretical underpinnings of ADP.
 We draw examples from the field of computational biology, more specifically RNA secondary structure prediction, to demonstrate how to use these combinators and what differences exist between this library, ADP, and other approaches.
 The final version of the combinator library allows writing algorithms with performance close to hand-optimized C code.