Resting state networks and consciousness Alterations of multiple resting state network connectivity in physiological , pharmacological , and pathological consciousness states

*Correspondence: Athena Demertzi , Coma Science Group, Cyclotron Research Center, Allée du 6 août no 8, Sart Tilman B30, University of Liège, 4000 Liège, Belgium. e-mail: a.demertzi@ulg.ac.be In order to better understand the functional contribution of resting state activity to conscious cognition, we aimed to review increases and decreases in functional magnetic resonance imaging (fMRI) functional connectivity under physiological (sleep), pharmacological (anesthesia), and pathological altered states of consciousness, such as brain death, coma, vegetative state/unresponsive wakefulness syndrome, and minimally conscious state.The reviewed resting state networks were the DMN, left and right executive control, salience, sensorimotor, auditory, and visual networks. We highlight some methodological issues concerning resting state analyses in severely injured brains mainly in terms of hypothesis-driven seed-based correlation analysis and data-driven independent components analysis approaches. Finally, we attempt to contextualize our discussion within theoretical frameworks of conscious processes.We think that this “lesion” approach allows us to better determine the necessary conditions under which normal conscious cognition takes place. At the clinical level, we acknowledge the technical merits of the resting state paradigm. Indeed, fast and easy acquisitions are preferable to activation paradigms in clinical populations. Finally, we emphasize the need to validate the diagnostic and prognostic value of fMRI resting state measurements in non-communicating brain damaged patients.


tress and anxiety detection using facial cues from videos

This study develops a framework for the detection and analysis of stress/anxiety emotional states through video-recorded facial cues. A thorough experimental protocol was established to induce systematic variability in affective states (neutral, relaxed and stressed/anxious) through a variety of external and internal stressors. The analysis was focused mainly on non-voluntary and semi-voluntary facial cues in order to estimate the emotion representation more objectively. Features under investigation included eye-related events, mouth activity, head motion parameters and heart rate estimated through camerabased photoplethysmography. A feature selection procedure was employed to select the most robust features followed by classification schemes discriminating between stress/anxiety and neutral states nxiety tress link rate ead motion with reference to a relaxed state in each experimental phase. In addition, a ranking transformation was proposed utilizing self reports in order to investigate the correlation of facial parameters with a participant perceived amount of stress/anxiety. The results indicated that, specific facial cues, derived from eye activity, mouth activity, head movements and camera based heart activity achieve good accuracy and are suitable as discriminative indicators of stress and anxiety.


Unsupervised Concept Categorization and Extraction from Scientific Document Titles

This paper studies the automated categorization and extraction of scientific concepts from titles of scientific articles, in order to gain a deeper understanding of their key contributions and facilitate the construction of a generic academic knowledgebase. Towards this goal, we propose an unsupervised, domain-independent, and scalable two-phase algorithm to type and extract key concept mentions into aspects of interest (e.g., Techniques, Applications, etc.). In the first phase of our algorithm we proposePhraseType, a probabilistic generative model which exploits textual features and limited POS tags to broadly segment text snippets into aspect-typed phrases. We extend this model to simultaneously learn aspect-specific features and identify academic domains in multi-domain corpora, since the two tasks mutually enhance each other. In the second phase, we propose an approach based on adaptor grammars to extract fine grained concept mentions from the aspect-typed phrases without the need for any external resources or human effort, in a purely data-driven manner. We apply our technique to study literature from diverse scientific domains and show significant gains over state-of-the-art concept extraction techniques. We also present a qualitative analysis of the results obtained.


Recover Corrupted Data in Sensor Networks: A Matrix Completion Solution

Affected by hardware and wireless conditions in WSNs, raw sensory data usually have notable data loss and corruption. Existing studies mainly consider the interpolation of random missing data in the absence of the data corruption. There is also no strategy to handle the successive missing data. To address these problems, this paper proposes a novel approach based on matrix completion (MC) to recover the successive missing and corrupted data. By analyzing a large set of weather data collected from 196 sensors in Zhu Zhou, China, we verify that weather data have the features of low-rank, temporal stability, and spatial correlation. Moreover, from simulations on the real weather data, we also discover that successive data corruption not only seriously affects the accuracy of missing and corrupted data recovery but even pollutes the normal data when applying the matrix completion in a traditional way. Motivated by these observations, we propose a novel Principal Component Analysis (PCA)-based scheme to efficiently identify the existence of data corruption. We further propose a two-phase MC-based data recovery scheme, named MC-Two-Phase, which applies the matrix completion technique to fully exploit the inherent features of environmental data to recover the data matrix due to either data missing or corruption. Finally, the extensive simulations with real-world sensory data demonstrate that the proposed MC-Two-Phase approach can achieve very high recovery accuracy in the presence of successively missing and corrupted data.


A Secure and Efficient Uniqueness-and-Anonymity-Preserving Remote User Authentication Scheme for Connected Health Care

Connected health care has several applications including telecare medicine information system, personally controlled health records system, and patient monitoring. In such applications, user authentication can ensure the legality of patients. In user authentication for such applications, only the legal user/patient himself/herself is allowed to access the remote server, and no one can trace him/her according to transmitted data. Chang et al. proposed a uniqueness-and-anonymity-preserving remote user authentication scheme for connected health care (Chang et al., J Med Syst 37:9902, 2013). Their scheme uses the user’s personal biometrics along with his/her password with the help of the smart card. The user’s biometrics is verified using BioHashing. Their scheme is efficient due to usage of one-way hash function and exclusive-or (XOR) operations. In this paper, we show that though their scheme is very efficient, their scheme has several security weaknesses such as (1) it has design flaws in login and authentication phases, (2) it has design flaws in password change phase, (3) it fails to protect privileged insider attack, (4) it fails to protect the man-in-the middle attack, and (5) it fails to provide proper authentication. In order to remedy these security weaknesses in Chang et al.’s scheme, we propose an improvement of their scheme while retaining the original merit of their scheme. We show that our scheme is efficient as compared to Chang et al.’s scheme. Through the security analysis, we show that our scheme is secure against possible attacks. Further, we simulate our scheme for the formal security verification using the widely-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to ensure that our scheme is secure against passive and active attacks. In addition, after successful authentication between the user and the server, they establish a secret session key shared between them for future secure communication.


S3: A Symbolic String Solver for Vulnerability Detection in Web Applications

Motivated by the vulnerability analysis of web programs which work on string inputs, we present S3, a new symbolic string solver. Our solver employs a new algorithm for a constraint language that is expressive enough for widespread applicability. Specifically, our language covers all the main string operations, such as those in JavaScript. The algorithm first makes use of a symbolic representation so that membership in a set defined by a regular expression can be encoded as string equations. Secondly, there is a constraint-based generation of instances from these symbolic expressions so that the total number of instances can be limited. We evaluate S3 on a well-known set of practical benchmarks, demonstrating both its robustness (more definitive answers) and its efficiency (about 20 times faster) against the state-of-the-art.


NANOFIBRILLATED CELLULOSE AS PAPER ADDITIVE IN EUCALYPTUS PULPS

In this work, the physical and mechanical properties of bleached Eucalyptus pulp reinforced with nanofibrillated cellulose (NFC) are compared with those of traditional beaten pulp used in the making of writing/printing and offset printing papers. For this purpose, three different types of hardwood slurries were prepared: beaten pulps, unbeaten pulps reinforced with NFC, and slightly beaten pulps also reinforced with NFC. Physical and mechanical tests were performed on handsheets from these different slurries. The results showed that adding NFC to unbeaten pulps results in physical and mechanical properties similar to those in pulps used for printing/writing papers. Nevertheless, the best results were obtained in slurries previously beaten at slight conditions and subsequently reinforced with NFC. These results demonstrate that the addition of NFC allows a reduction in beating intensity without decreasing the desired mechanical properties for this specific purpose.


Make Evasion Harder: An Intelligent Android Malware Detection System

To combat the evolving Android malware attacks, in this paper, instead of only using Application Programming Interface (API) calls, we further analyze the different relationships between them and create higher-level semantics which require more efforts for attackers to evade the detection. We represent the Android applications (apps), related APIs, and their rich relationships as a structured heterogeneous information network (HIN). Then we use a meta-path based approach to characterize the semantic relatedness of apps and APIs. We use each meta-path to formulate a similarity measure over Android apps, and aggregate different similarities using multi-kernel learning to make predictions. Promising experimental results based on real sample collections from Comodo Cloud Security Center demonstrate that our developed system HinDroid outperforms other alternative Android malware detection techniques.


Learning Latent Vector Spaces for Product Search

We introduce a novel latent vector space model that jointly learns the latent representations of words, e-commerce products and a mapping between the two without the need for explicit annotations. The power of the model lies in its ability to directly model the discriminative relation between products and a particular word. We compare our method to existing latent vector space models (LSI, LDA and word2vec) and evaluate it as a feature in a learning to rank setting. Our latent vector space model achieves its enhanced performance as it learns better product representations. Furthermore, the mapping from words to products and the representations of words benefit directly from the errors propagated back from the product representations during parameter estimation. We provide an in-depth analysis of the performance of our model and analyze the structure of the learned representations.


Improving Login Authorization by Providing Graphical Password (Security)

Usable security has unique usability challenges because the need for security often means that standard humancomputer-interaction approaches cannot be directly applied. An important usability goal for authentication systems is to support users in selecting better passwords. Users often create memorable passwords that are easy for attackers to guess, but strong system-assigned passwords are difficult for users to remember. So researchers of modern days have gone for alternative methods where in graphical pictures are used as passwords. Graphical passwords essentially use images or representation of images as passwords. Human brain is good in remembering picture than textual character. There are various graphical password schemes or graphical password software in the market. However, very little research has been done to analyze graphical passwords that are still immature. There for, this project work merges persuasive selective click points and password guessing resistant protocol. The major goal of this work is to reduce the guessing attacks as well as encouraging users to select more random, and difficult passwords to guess. Well known security threats like brute force attacks and dictionary attacks can be successfully abolished using this method.


A novel corner-fed patch to reduce cross-polarization for a microstrip antenna array

This paper presents a novel corner-fed microstrip square patch. On the patch there is a slot along the diagonal. With this slot, the current distribution on the patch is changed. The currents related to co-polarization become more dominant and those related to cross-polarization become more symmetrical. These two factors result in a reduction in the cross-polarization level. An eight element shunt connected series-fed linear array has been designed, manufactured and tested. The measured results show that the cross-polarization level is reduced by 10.5 dB, while the other performances of the array are nearly the same as those of a standard one.


Advertising Keyword Recommendation based on Supervised Link Prediction in Multi-Relational Network

In the sponsored search system, advertisers bid on keywords that are related to their products or services to participate in repeated auctions and display their ads on the search result pages. Since there is a huge inventory of possible terms, instructive keyword recommendation is an important component to help advertisers optimize their campaigns and improve ad monetization. In this paper, by constructing a heterogeneous network which contains four types of links between advertisers and keywords based on different data resources and mining complex representations of network structure and task-guided attributes of nodes, we propose an approach to keyword recommendation based on supervised link prediction in multi-relational network. This method can retrieve ample candidates and provide informative ranking scores for recommended list of keywords, experimental results with real sponsored search data validate the effectiveness of the proposed algorithm in producing valuable keywords for advertisers.


Mean Shift, Mode Seeking, and Clustering

Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking process on a surface constructed with a “shadow” kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications in clustering and Hough transform are demonstrated. Mean shift is also considered as an evolutionary strategy that performs multistart global optimization.


Information Theoretic-Learning auto-encoder

We propose Information Theoretic-Learning (ITL) divergence measures for variational regularization of neural networks. We also explore ITL-regularized autoencoders as an alternative to variational autoencoding bayes, adversarial autoencoders and generative adversarial networks for randomly generating sample data without explicitly defining a paritition function. This paper also formalizes, generative moment matching networks under the ITL framework.


Adversarial Autoencoders

In this paper we propose a new method for regularizing autoencoders by imposing an arbitrary prior on the latent representation of the autoencoder. Our method, named “adversarial autoencoder”, uses the recently proposed generative adversarial networks (GAN) in order to match the aggregated posterior of the hidden code vector of the autoencoder with an arbitrary prior. Matching the aggregated posterior to the prior ensures that there are no “holes” in the prior, and generating from any part of prior space results in meaningful samples. As a result, the decoder of the adversarial autoencoder learns a deep generative model that maps the imposed prior to the data distribution. We show how adversarial autoencoders can be used to disentangle style and content of images and achieve competitive generative performance on MNIST, Street View House Numbers and Toronto Face datasets.


Information Theory, Inference, and Learning Algorithms


EPIC: Efficient Private Image Classification (or: Learning from the Masters)

Outsourcing an image classification task raises privacy concerns, both from the image provider’s perspective, who wishes to keep their images confidential, and from the classification algorithm provider’s perspective, who wishes to protect the intellectual property of their classifier. We propose EPIC, an efficient private image classification system based on support vector machine (SVM) learning, secure against malicious adversaries. EPIC builds upon transfer learning techniques known from the Machine Learning (ML) literature and minimizes the load on the privacy-preserving part. Our solution is based on Multiparty Computation (MPC), it is 34 times faster than Gazelle (USENIX’18) –the state-of-the-art in private image classification– and it improves the communication cost by 50 times, with a 7% higher accuracy on CIFAR-10 dataset. For the same accuracy as Gazelle achieves on CIFAR-10, EPIC is 700 times faster and the communication cost is reduced by 500 times.


Transformation of generalized chebyshev lowpass filter prototype to Suspended Stripline Structure highpass filter for wideband communication systems

This paper presents the transformation of generalized Chebyshev lowpass filter prototype to highpass filter using Suspended Stripline Structure (SSS) technology. The study involves circuit analysis to determine generalized Chebyshev responses with a transmission zero at finite frequency. The transformation of the highpass filter from the lowpass filter prototype provides a cutoff frequency of 3.1 GHz with a return loss better than -20 dB. The design is simulated on a Roger Duroid RO4350 with a dielectric constant, εr of 3.48 and a thickness of 0.168 mm. The simulation performance results show promising results that could be further examined during the experimental works. This class of generalized Chebyshev highpass filter with finite transmission zero would be useful in any RF/ microwave communication systems particularly in wideband applications where the reduction of overall physical volume and weight as well as cost very important, while maintaining its excellent performance.


Coupled IGMM-GANs for deep multimodal anomaly detection in human mobility data

Detecting anomalous activity in human mobility data has a number of applications including road hazard sensing, telematic based insurance, and fraud detection in taxi services and ride sharing. In this paper we address two challenges that arise in the study of anomalous human trajectories: 1) a lack of ground truth data on what defines an anomaly and 2) the dependence of existing methods on significant pre-processing and feature engineering. While generative adversarial networks seem like a natural fit for addressing these challenges, we find that existing GAN based anomaly detection algorithms perform poorly due to their inability to handle multimodal patterns. For this purpose we introduce an infinite Gaussian mixture model coupled with (bi-directional) generative adversarial networks, IGMM-GAN, that is able to generate synthetic, yet realistic, human mobility data and simultaneously facilitates multimodal anomaly detection. Through estimation of a generative probability density on the space of human trajectories, we are able to generate realistic synthetic datasets that can be used to benchmark existing anomaly detection methods. The estimated multimodal density also allows for a natural definition of outlier that we use for detecting anomalous trajectories. We illustrate our methodology and its improvement over existing GAN anomaly detection on several human mobility datasets, along with MNIST.


An Italian Twitter Corpus of Hate Speech against Immigrants

The paper describes a recently-created Twitter corpus of about 6,000 tweets, annotated for hate speech against immigrants, and developed to be a reference dataset for an automatic system of hate speech monitoring. The annotation scheme was therefore specifically designed to account for the multiplicity of factors that can contribute to the definition of a hate speech notion, and to offer a broader tagset capable of better representing all those factors, which may increase, or rather mitigate, the impact of the message. This resulted in a scheme that includes, besides hate speech, the following categories: aggressiveness, offensiveness, irony, stereotype, and (on an experimental basis) intensity. The paper hereby presented namely focuses on how this annotation scheme was designed and applied to the corpus. In particular, also comparing the annotation produced by CrowdFlower contributors and by expert annotators, we make some remarks about the value of the novel resource as gold standard, which stems from a preliminary qualitative analysis of the annotated data and on future corpus development.


Towards reducing the attack surface of software backdoors

Backdoors in software systems probably exist since the very first access control mechanisms were implemented and they are a well-known security problem. Despite a wave of public discoveries of such backdoors over the last few years, this threat has only rarely been tackled so far.
 In this paper, we present an approach to reduce the attack surface for this kind of attacks and we strive for an automated identification and elimination of backdoors in binary applications. We limit our focus on the examination of server applications within a client-server model. At the core, we apply variations of the delta debugging technique and introduce several novel heuristics for the identification of those regions in binary application that backdoors are typically installed in (i.e., authentication and command processing functions). We demonstrate the practical feasibility of our approach on several real-world backdoors found in modified versions of the popular software tools ProFTPD and OpenSSH. Furthermore, we evaluate our implementation not only on common instruction set architectures such as x86-64, but also on commercial off-the-shelf embedded devices powered by a MIPS32 processor.


Ovariohysterectomy versus ovariectomy for elective sterilization of female dogs and cats: is removal of the uterus necessary?

Views: Commentary 1409 E sterilization of female dogs and cats is one of the most common procedures performed in veterinary practice and is considered by private veterinary practitioners as one of the most important skills required of new graduates. Potential benefits of sterilization include population control, prevention of diseases of the reproductive tract, and elimination of undesirable behaviors associated with hormonal cycling. The AVMA and the Association of Shelter Veterinarians both promote elective sterilization of female dogs and cats as integral to reducing euthanasia of unwanted dogs and cats. Sterilization of female dogs and cats can be accomplished by removing both the ovaries and uterus (ovariohysterectomy) or by removing the ovaries alone (ovariectomy). Ovariohysterectomy has historically been recommended in the United States and Canada and is currently emphasized at schools and colleges of veterinary medicine in these countries. To our knowledge, only one of the most frequently used surgical textbooks in the United States and Canada describes ovariectomy, and ovariectomy is generally not taught to veterinary students during their surgical laboratories. The Clinical Proficiency Examination, which is the final step in the Educational Commission for Foreign Veterinary Graduates’ program for establishing the educational equivalence of graduates of nonaccredited veterinary schools seeking licensure in the United States or Canada, requires “complete removal of both ovaries and removal of the majority of the uterus” to obtain a passing grade. Despite the apparent preference for ovariohysterectomy in the United States and Canada, ovariectomy appears to have become the standard of care in many European countries. In addition, with the development of minimally invasive surgical techniques, laparoscopic ovariectomy has gained popularity. Thus, it may be helpful to review the scientific evidence comparing ovariohysterectomy and ovariectomy for elective sterilization of healthy female dogs and cats.


Discovering Texture Regularity as a Higher-Order Correspondence Problem

Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of near-regular textures in real images. The underlying lattice of a near-regular texture identifies all of the texels as well as the global topology among the texels. A key contribution of this paper is to formulate lattice-finding as a correspondence problem. The algorithm finds a plausible lattice by iteratively proposing texels and assigning neighbors between the texels. Our matching algorithm seeks assignments that maximize both pair-wise visual similarity and higher-order geometric consistency. We approximate the optimal assignment using a recently developed spectral method. We successfully discover the lattices of a diverse set of unsegmented, real-world textures with significant geometric warping and large appearance variation among


ltm : An R Package for Latent Variable Modeling and Item Response Theory Analyses

The R package ltm has been developed for the analysis of multivariate dichotomous and polytomous data using latent variable models, under the Item Response Theory approach. For dichotomous data the Rasch, the Two-Parameter Logistic, and Birnbaum’s Three-Parameter models have been implemented, whereas for polytomous data Semejima’s Graded Response model is available. Parameter estimates are obtained under marginal maximum likelihood using the Gauss-Hermite quadrature rule. The capabilities and features of the package are illustrated using two real data examples.


A Model-Driven Framework to Develop Personalized Health Monitoring

Both distributed healthcare systems and the Internet of Things (IoT) are currently hot topics. The latter is a new computing paradigm to enable advanced capabilities in engineering various applications, including those for healthcare. For such systems, the core social requirement is the privacy/security of the patient information along with the technical requirements (e.g., energy consumption) and capabilities for adaptability and personalization. Typically, the functionality of the systems is predefined by the patient’s data collected using sensor networks along with medical instrumentation; then, the data is transferred through the Internet for treatment and decision-making. Therefore, systems creation is indeed challenging. In this paper, we propose a model-driven framework to develop the IoT-based prototype and its reference architecture for personalized health monitoring (PHM) applications. The framework contains a multi-layered structure with feature-based modeling and feature model transformations at the top and the application software generation at the bottom. We have validated the framework using available tools and developed an experimental PHM to test some aspects of the functionality of the reference architecture in real time. The main contribution of the paper is the development of the model-driven computational framework with emphasis on the synergistic effect of security and energy issues.


Recognizing human activity in smart home using deep learning algorithm

There is a topic of interest for many researchers about human activities recognition in recent years. In this paper, we propose the research to recognize human activities by deep learning (DL) algorithm. We collected the data from participants performing activities in order to evaluate the human activities recognition results. After pre-training the deep network, the fine-tuning process begins. Compared with Hidden Markov Model (HMM) and naïve Bayes Classifier (NBC), the experiment results show that the proposed deep learning algorithm is an effective way for recognizing human activities in smart home.


Real User Evaluation of Spoken Dialogue Systems Using Amazon Mechanical Turk

This paper describes a framework for evaluation of spoken dialogue systems. Typically, evaluation of dialogue systems is performed in a controlled test environment with carefully selected and instructed users. However, this approach is very demanding. An alternative is to recruit a large group of users who evaluate the dialogue systems in a remote setting under virtually no supervision. Crowdsourcing technology, for example Amazon Mechanical Turk (AMT), provides an efficient way of recruiting subjects. This paper describes an evaluation framework for spoken dialogue systems using AMT users and compares the obtained results with a recent trial in which the systems were tested by locally recruited users. The results suggest that the use of crowdsourcing technology is feasible and it can provide reliable results.


Pocket reflectometry

We present a simple, fast solution for reflectance acquisition using tools that fit into a pocket. Our method captures video of a flat target surface from a fixed video camera lit by a hand-held, moving, linear light source. After processing, we obtain an SVBRDF.
 We introduce a BRDF chart, analogous to a color "checker" chart, which arranges a set of known-BRDF reference tiles over a small card. A sequence of light responses from the chart tiles as well as from points on the target is captured and matched to reconstruct the target's appearance.
 We develop a new algorithm for BRDF reconstruction which works directly on these LDR responses, without knowing the light or camera position, or acquiring HDR lighting. It compensates for spatial variation caused by the local (finite distance) camera and light position by warping responses over time to align them to a specular reference. After alignment, we find an optimal linear combination of the Lambertian and purely specular reference responses to match each target point's response. The same weights are then applied to the corresponding (known) reference BRDFs to reconstruct the target point's BRDF. We extend the basic algorithm to also recover varying surface normals by adding two spherical caps for diffuse and specular references to the BRDF chart.
 We demonstrate convincing results obtained after less than 30 seconds of data capture, using commercial mobile phone cameras in a casual environment.


Un Método para definir la Arquitectura de Procesos

In this paper we present a method for systematically defining the process architecture of any organization. We begin by presenting a detailed interpretation of the upper levels of Zachman’s framework, providing an answer to the cell formed by the intersection of the perspective of the Planner (row 1) and the dimension of Function (column 2). Our method consists of four steps: capturing the organizational structure; exhaustively analyzing the flow of information between the different organizational units, customers, and providers, allowing for a high-level understanding of the organization’s operation; identifying and modeling the configuration of value that best adapts itself to the creation of value for the organization (value chain, workshop, or network); and, given the specified value configuration, identifying, defining, and interrelating the different essential processes.


Development of Self Balance Transporter : A Segway

This paper deals with constructing the vehicle which is fully functional to transport the one person only and movement of it is achieve by naturally. Forward and backwards motion is achieved by leaning forwards and backwards. Segway uses handlebar for turning purpose. In Segway technique uses principle of inverted pendulum in which it keeps an angle of Zero degrees with vertical at all times. The rider motion enables this technique to accelerate, brake or steer the vehicle, for this it uses Gyroscopic Sensor and it is Eco-friendly and non polluting.


Can Active Memory Replace Attention?

Several mechanisms to focus attention of a neural network on selected parts of its input or memory have been used successfully in deep learning models in recent years. Attention has improved image classification, image captioning, speech recognition, generative models, and learning algorithmic tasks, but it had probably the largest impact on neural machine translation. Recently, similar improvements have been obtained using alternative mechanisms that do not focus on a single part of a memory but operate on all of it in parallel, in a uniform way. Such mechanism, which we call active memory, improved over attention in algorithmic tasks, image processing, and in generative modelling. So far, however, active memory has not improved over attention for most natural language processing tasks, in particular for machine translation. We analyze this shortcoming in this paper and propose an extended model of active memory that matches existing attention models on neural machine translation and generalizes better to longer sentences. We investigate this model and explain why previous active memory models did not succeed. Finally, we discuss when active memory brings most benefits and where attention can be a better choice.


Magnetic resonance imaging findings associated with surgically proven rotator interval lesions

To identify shoulder magnetic resonance imaging (MRI) findings associated with surgically proven rotator interval abnormalities. The preoperative MRI examinations of five patients with surgically proven rotator interval (RI) lesions requiring closure were retrospectively evaluated by three musculoskeletal-trained radiologists in consensus. We assessed the structures in the RI, including the coracohumeral ligament, superior glenohumeral ligament, fat tissue, biceps tendon, and capsule for variations in size and signal alteration. In addition, we noted associated findings of rotator cuff and labral pathology. Three of three of the MR arthrogram studies demonstrated extension of gadolinium to the cortex of the undersurface of the coracoid process compared with the control images, seen best on the sagittal oblique images. Four of five of the studies demonstrated subjective thickening of the coracohumeral ligament, and three of five of the studies demonstrated subjective thickening of the superior glenohumeral ligament. Five of five of the studies demonstrated a labral tear. The MRI arthrogram finding of gadolinium extending to the cortex of the undersurface of the coracoid process was noted on the studies of those patients with rotator interval lesions at surgery in this series. Noting this finding—especially in the presence of a labral tear and/or thickening of the coracohumeral ligament or superior glenohumeral ligament—may be helpful in the preoperative diagnosis of rotator interval lesions.


A Tidy Data Model for Natural Language Processing using cleanNLP

Recent advances in natural language processing have produced libraries that extract lowlevel features from a collection of raw texts. These features, known as annotations, are usually stored internally in hierarchical, tree-based data structures. This paper proposes a data model to represent annotations as a collection of normalized relational data tables optimized for exploratory data analysis and predictive modeling. The R package cleanNLP, which calls one of two state of the art NLP libraries (CoreNLP or spaCy), is presented as an implementation of this data model. It takes raw text as an input and returns a list of normalized tables. Specific annotations provided include tokenization, part of speech tagging, named entity recognition, sentiment analysis, dependency parsing, coreference resolution, and word embeddings. The package currently supports input text in English, German, French, and Spanish.


Learning Anisotropic RBF Kernels

We present an approach for learning an anisotropic RBF kernel in a game theoretical setting where the value of the game is the degree of separation between positive and negative training examples. The method extends a previously proposed method (KOMD) to perform feature re-weighting and distance metric learning in a kernel-based classification setting. Experiments on several benchmark datasets demonstrate that our method generally outperforms stateof-the-art distance metric learning methods, including the Large Margin Nearest Neighbor Classification family of methods.


Evaluation of Consumer Understanding of Different Front-of-Package Nutrition Labels, 2010–2011

INTRODUCTION
Governments throughout the world are using or considering various front-of-package (FOP) food labeling systems to provide nutrition information to consumers. Our web-based study tested consumer understanding of different FOP labeling systems.

METHODS
Adult participants (N = 480) were randomized to 1 of 5 groups to evaluate FOP labels: 1) no label; 2) multiple traffic light (MTL); 3) MTL plus daily caloric requirement icon (MTL+caloric intake); 4) traffic light with specific nutrients to limit based on food category (TL+SNL); or 5) the Choices logo. Total percentage correct quiz scores were created reflecting participants' ability to select the healthier of 2 foods and estimate amounts of saturated fat, sugar, and sodium in foods. Participants also rated products on taste, healthfulness, and how likely they were to purchase the product. Quiz scores and product perceptions were compared with 1-way analysis of variance followed by post-hoc Tukey tests.

RESULTS
The MTL+caloric intake group (mean [standard deviation], 73.3% [6.9%]) and Choices group (72.5% [13.2%]) significantly outperformed the no label group (67.8% [10.3%]) and the TL+SNL group (65.8% [7.3%]) in selecting the more healthful product on the healthier product quiz. The MTL and MTL+caloric intake groups achieved average scores of more than 90% on the saturated fat, sugar, and sodium quizzes, which were significantly better than the no label and Choices group average scores, which were between 34% and 47%.

CONCLUSION
An MTL+caloric intake label and the Choices symbol hold promise as FOP labeling systems and require further testing in different environments and population subgroups.


Does High Self-Esteem Cause Better Performance, Interpersonal Success, Happiness, or Healthier Lifestyles?

Self-esteem has become a household word. Teachers, parents, therapists, and others have focused efforts on boosting self-esteem, on the assumption that high self-esteem will cause many positive outcomes and benefits-an assumption that is critically evaluated in this review. Appraisal of the effects of self-esteem is complicated by several factors. Because many people with high self-esteem exaggerate their successes and good traits, we emphasize objective measures of outcomes. High self-esteem is also a heterogeneous category, encompassing people who frankly accept their good qualities along with narcissistic, defensive, and conceited individuals. The modest correlations between self-esteem and school performance do not indicate that high self-esteem leads to good performance. Instead, high self-esteem is partly the result of good school performance. Efforts to boost the self-esteem of pupils have not been shown to improve academic performance and may sometimes be counterproductive. Job performance in adults is sometimes related to self-esteem, although the correlations vary widely, and the direction of causality has not been established. Occupational success may boost self-esteem rather than the reverse. Alternatively, self-esteem may be helpful only in some job contexts. Laboratory studies have generally failed to find that self-esteem causes good task performance, with the important exception that high self-esteem facilitates persistence after failure. People high in self-esteem claim to be more likable and attractive, to have better relationships, and to make better impressions on others than people with low self-esteem, but objective measures disconfirm most of these beliefs. Narcissists are charming at first but tend to alienate others eventually. Self-esteem has not been shown to predict the quality or duration of relationships. High self-esteem makes people more willing to speak up in groups and to criticize the group's approach. Leadership does not stem directly from self-esteem, but self-esteem may have indirect effects. Relative to people with low self-esteem, those with high self-esteem show stronger in-group favoritism, which may increase prejudice and discrimination. Neither high nor low self-esteem is a direct cause of violence. Narcissism leads to increased aggression in retaliation for wounded pride. Low self-esteem may contribute to externalizing behavior and delinquency, although some studies have found that there are no effects or that the effect of self-esteem vanishes when other variables are controlled. The highest and lowest rates of cheating and bullying are found in different subcategories of high self-esteem. Self-esteem has a strong relation to happiness. Although the research has not clearly established causation, we are persuaded that high self-esteem does lead to greater happiness. Low self-esteem is more likely than high to lead to depression under some circumstances. Some studies support the buffer hypothesis, which is that high self-esteem mitigates the effects of stress, but other studies come to the opposite conclusion, indicating that the negative effects of low self-esteem are mainly felt in good times. Still others find that high self-esteem leads to happier outcomes regardless of stress or other circumstances. High self-esteem does not prevent children from smoking, drinking, taking drugs, or engaging in early sex. If anything, high self-esteem fosters experimentation, which may increase early sexual activity or drinking, but in general effects of self-esteem are negligible. One important exception is that high self-esteem reduces the chances of bulimia in females. Overall, the benefits of high self-esteem fall into two categories: enhanced initiative and pleasant feelings. We have not found evidence that boosting self-esteem (by therapeutic interventions or school programs) causes benefits. Our findings do not support continued widespread efforts to boost self-esteem in the hope that it will by itself foster improved outcomes. In view of the heterogeneity of high self-esteem, indiscriminate praise might just as easily promote narcissism, with its less desirable consequences. Instead, we recommend using praise to boost self-esteem as a reward for socially desirable behavior and self-improvement.


Phantom vibrations among undergraduates: Prevalence and associated psychological characteristics


Dynamic Adaptive Streaming over HTTP/2.0

MPEG Dynamic Adaptive Streaming over HTTP (DASH) is a new streaming standard that has been recently ratified as an international standard (IS). In comparison to other streaming systems, e.g., HTTP progressive download, DASH is able to handle varying bandwidth conditions providing smooth streaming. Furthermore, it enables NAT and Firewall traversal, flexible and scalable deployment as well as reduced infrastructure costs due to the reuse of existing Internet infrastructure components, e.g., proxies, caches, and Content Distribution Networks (CDN). Recently, the Hypertext Transfer Protocol Bis (httpbis) working group of the IETF has officially started the development of HTTP 2.0. Initially three major proposals have been submitted to the IETF i.e., Googles' SPDY, Microsofts' HTTP Speed+Mobility and Network-Friendly HTTP Upgrade, but SPDY has been chosen as working draft for HTTP 2.0. In this paper we implemented MPEG-DASH over HTTP 2.0 (i.e., SPDY), demonstrating its potential benefits and drawbacks. Moreover, several experimental evaluations have been performed that compare HTTP 2.0 with HTTP 1.1 and HTTP 1.0 in the context of DASH. In particular, the protocol overhead, the performance for different round trip times, and DASH with HTTP 2.0 in a lab test scenario has been evaluated in detail.


An experimental evaluation of rate-adaptation algorithms in adaptive streaming over HTTP

Adaptive (video) streaming over HTTP is gradually being adopted, as it offers significant advantages in terms of both user-perceived quality and resource utilization for content and network service providers. In this paper, we focus on the rate-adaptation mechanisms of adaptive streaming and experimentally evaluate two major commercial players (Smooth Streaming, Netflix) and one open source player (OSMF). Our experiments cover three important operating conditions. First, how does an adaptive video player react to either persistent or short-term changes in the underlying network available bandwidth. Can the player quickly converge to the maximum sustainable bitrate? Second, what happens when two adaptive video players compete for available bandwidth in the bottleneck link? Can they share the resources in a stable and fair manner? And third, how does adaptive streaming perform with live content? Is the player able to sustain a short playback delay? We identify major differences between the three players, and significant inefficiencies in each of them.


Dynamic adaptive streaming over HTTP dataset

The delivery of audio-visual content over the Hypertext Transfer Protocol (HTTP) got lot of attention in recent years and with dynamic adaptive streaming over HTTP (DASH) a standard is now available. Many papers cover this topic and present their research results, but unfortunately all of them use their own private dataset which -- in most cases -- is not publicly available. Hence, it is difficult to compare, e.g., adaptation algorithms in an objective way due to the lack of a common dataset which shall be used as basis for such experiments. In this paper, we present our DASH dataset including our DASHEncoder, an open source DASH content generation tool. We also provide basic evaluations of the different segment lengths, the influence of HTTP server settings, and, in this context, we show some of the advantages as well as problems of shorter segment lengths.


A VLC media player plugin enabling dynamic adaptive streaming over HTTP

This paper describes the implementation of a VLC media player plugin enabling Dynamic Adaptive Streaming over HTTP (DASH). DASH is an emerging ISO/IEC MPEG and 3GPP standard for HTTP streaming. It aims to standardize formats enabling segmented progressive download by exploiting existing Internet infrastructure as such. Our implementation of these formats as described in this paper is based on the well-known VLC. Hence, it is fully integrated into the VLC structure and has been also submitted to the VLC development team for consideration in future releases of VLC. Therefore, it is licensed under the GNU Lesser General Public License (LGPL). The plugin provides a very flexible structure that could be easily extended with respect to different adaptation logics or profiles of the DASH standard. As a consequence, the plugin enables the integration of a variety of adaptation logics and comparison thereof, making it attractive for the research community.


Microcontroller Based Smart Helmet Using GSM & GPRS

The thought of developing this proposed model comes from social responsibility towards the society. Lack of immediate First Aid and Emergency medical services during accident are prime cause of death in majority of cases of accidents. The one of the main reasons for this may be late arrival of ambulance, no person at place of accident to give information to the ambulance. This thought of taking responsibility of society resulted in our proposed model “Microcontroller based smart helmet using GSM & GPRS”. The aim of this proposed model design is to inform the responsible persons at the earliest about the accident so that they can take required actions to save the life of the injured person. Our proposed system consists of Arduino as Microcontroller, GSM for calling purpose, GPRS for tracking purpose and mainly Sensors to detect the accident. Our proposed system detects the accident and sends text message along with a voice message within a minute to the registered number.


Optimal Beaconing Control for Epidemic Routing in Delay-Tolerant Networks

Owing to the uncertainty of transmission opportunities between mobile nodes, the routing in delay-tolerant networks (DTNs) exploits the mechanism of opportunistic forwarding. Energy-efficient algorithms and policies for DTN are crucial to maximizing the message delivery probability while reducing the delivery cost. In this contribution, we investigate the problem of energy-efficient optimal beaconing control in a DTN. We model the message dissemination under variable beaconing rate with a continuous-time Markov model. Based on this model, we then formulate the optimization problem of the optimal beaconing control for epidemic routing and obtain the optimal threshold policy from the solution of this optimization problem. Furthermore, through extensive numerical results, we demonstrate that the proposed optimal threshold policy significantly outperforms the static policy with constant beaconing rate in terms of system energy consumption savings.


Linking Transformational Leadership and Knowledge Sharing: The Mediating Roles of Perceived Team Goal Commitment and Perceived Team Identification

It is widely assumed that transformational leadership can effectively facilitate the sharing of knowledge among followers, but most investigations of the underlying mechanisms were based on the social exchange perspective. Based on a sensegiving theory perspective, this article attempts to uncover the mechanisms by which transformational leadership has its impact on employee knowledge sharing behavior by proposing two team-directed mediating mechanisms: perceived team goal commitment and perceived team identification. Results of multi-source and time-lagged data from 186 leader-follower pairs supported the proposed mediating effects. Implications and limitations are discussed.


Flattening Gamma: Radiometric Terrain Correction for SAR Imagery

Enabling intercomparison of synthetic aperture radar (SAR) imagery acquired from different sensors or acquisition modes requires accurate modeling of not only the geometry of each scene, but also of systematic influences on the radiometry of individual scenes. Terrain variations affect not only the position of a given point on the Earth's surface but also the brightness of the radar return as expressed in radar geometry. Without treatment, the hill-slope modulations of the radiometry threaten to overwhelm weaker thematic land cover induced backscatter differences, and comparison of backscatter from multiple satellites, modes, or tracks loses meaning. The ASAR & PALSAR sensors provide state vectors and timing with higher absolute accuracy than was previously available, allowing them to directly support accurate tie-point-free geolocation and radiometric normalization of their imagery. Given accurate knowledge of the acquisition geometry of a SAR image together with a digital height model (DHM) of the area imaged, radiometric image simulation is applied to estimate the local illuminated area for each point in the image. Ellipsoid-based or sigma naught (σ0) based incident angle approximations that fail to reproduce the effect of topographic variation in their sensor model are contrasted with a new method that integrates terrain variations with the concept of gamma naught (γ0) backscatter, converting directly from beta naught (β0) to a newly introduced terrain-flattened γ0 normalization convention. The interpretability of imagery treated in this manner is improved in comparison to processing based on conventional ellipsoid or local incident angle based σ0 normalization.


Low Data Drug Discovery with One-Shot Learning

Recent advances in machine learning have made significant contributions to drug discovery. Deep neural networks in particular have been demonstrated to provide significant boosts in predictive power when inferring the properties and activities of small-molecule compounds (Ma, J. et al. J. Chem. Inf.

MODEL
2015, 55, 263-274). However, the applicability of these techniques has been limited by the requirement for large amounts of training data. In this work, we demonstrate how one-shot learning can be used to significantly lower the amounts of data required to make meaningful predictions in drug discovery applications. We introduce a new architecture, the iterative refinement long short-term memory, that, when combined with graph convolutional neural networks, significantly improves learning of meaningful distance metrics over small-molecules. We open source all models introduced in this work as part of DeepChem, an open-source framework for deep-learning in drug discovery (Ramsundar, B. deepchem.io. https://github.com/deepchem/deepchem, 2016).


Bayesian Modeling with Gaussian Processes using the GPstuff Toolbox

Gaussian processes (GP) are powerful tools for probabilistic modeling purposes. They can be used to define prior distributions over latent functions in hierarchical Bayesian models. The prior over functions is defined implicitly by the mean and covariance function, which determine the smoothness and variability of the function. The inference can then be conducted directly in the function space by evaluating or approximating the posterior process. Despite their attractive theoretical properties GPs provide practical challenges in their implementation. GPstuff is a versatile collection of computational tools for GP models compatible with Linux and Windows MATLAB and Octave. It includes, among others, various inference methods, sparse approximations and tools for model assessment. In this work, we review these tools and demonstrate the use of GPstuff in several models.


Noncontact Proximity Vital Sign Sensor Based on PLL for Sensitivity Enhancement

In this paper, a noncontact proximity vital sign sensor, using a phase locked loop (PLL) incorporated with voltage controlled oscillator (VCO) built-in planar type circular resonator, is proposed to enhance sensitivity in severe environments. The planar type circular resonator acts as a series feedback element of the VCO as well as a near-field receiving antenna. The frequency deviation of the VCO related to the body proximity effect ranges from 0.07 MHz/mm to 1.8 MHz/mm (6.8 mV/mm to 205 mV/mm in sensitivity) up to a distance of 50 mm, while the amount of VCO drift is about 21 MHz in the condition of 60 °C temperature range and discrete component tolerance of ±5%. Total frequency variation occurs in the capture range of the PLL which is 60 MHz. Thus, its loop control voltage converts the amount of frequency deviation into a difference of direct current (DC) voltage, which is utilized to extract vital signs regardless of the ambient temperature. The experimental results reveal that the proposed sensor placed 50 mm away from a subject can reliably detect respiration and heartbeat signals without the ambiguity of harmonic signals caused by respiration signal at an operating frequency of 2.4 GHz.


Principles of micro-RNA production and maturation

Micro-RNAs (miRNAs) are a class of approximately 22-nucleotide non-coding RNAs expressed in multicellular organisms. They are first transcribed in a similar manner to pre-mRNAs. The transcripts then go through a series of processing steps, including endonucleolytic cleavage, nuclear export and a strand selection procedure, to yield the single-stranded mature miRNA products. The transcription and processing of miRNAs determines the abundance and the sequence of mature miRNAs and has important implications for the function of miRNAs.


A survey on nature inspired metaheuristic algorithms for partitional clustering

The partitional clustering concept started with K-means algorithm which was published in 1957. Since then many classical partitional clustering algorithms have been reported based on gradient descent approach. The 1990 kick started a new era in cluster analysis with the application of nature inspired metaheuristics. After initial formulation nearly two decades have passed and researchers have developed numerous new algorithms in this field. This paper embodies an up-to-date review of all major nature inspired metaheuristic algorithms employed till date for partitional clustering. Further, key issues involved during formulation of various metaheuristics as a clustering problem and major application areas are discussed. & 2014 Published by Elsevier B.V.


Scaling and criticality in a stochastic multi-agent model of a financial market

Financial prices have been found to exhibit some universal characteristics that resemble the scaling laws characterizing physical systems in which large numbers of units interact. This raises the question of whether scaling in finance emerges in a similar way — from the interactions of a large ensemble of market participants. However, such an explanation is in contradiction to the prevalent ‘efficient market hypothesis’ in economics, which assumes that the movements of financial prices are an immediate and unbiased reflection of incoming news about future earning prospects. Within this hypothesis, scaling in price changes would simply reflect similar scaling in the ‘input’ signals that influence them. Here we describe a multi-agent model of financial markets which supports the idea that scaling arises from mutual interactions of participants. Although the ‘news arrival process’ in our model lacks both power-law scaling and any temporal dependence in volatility, we find that it generates such behaviour as a result of interactions between agents.


From genetic privacy to open consent

Recent advances in high-throughput genomic technologies are showing concrete results in the form of an increasing number of genome-wide association studies and in the publication of comprehensive individual genome–phenome data sets. As a consequence of this flood of information the established concepts of research ethics are stretched to their limits, and issues of privacy, confidentiality and consent for research are being re-examined. Here, we show the feasibility of the co-development of scientific innovation and ethics, using the open-consent framework that was implemented in the Personal Genome Project as an example.


Classification of Heart Disease Dataset using Multilayer Feed forward backpropogation Algorithm

In this study, for the classification of heart diseases dataset, multilayer feed forward network with backpropogation algorithm is introduced. Artificial Neural Network (ANN) is widely used data mining method to extract patterns. Data mining is the process of automating information discovery .Its main aim is to find relationships in data and to predict outcomes. Classification is one of the important data mining techniques for classifying given set of input data. Many real world problems in various fields can be solved by using classification approach such as business, science, industry and medicine. For analysis the medical data related to Heart diseases is considered and analyzed using artificial neural network (ANN). To perform classification task of medical data, the neural network is trained using back propagation algorithm with momentum. To increase the efficiency of the classification process parallel processing approach is also applies on each neuron in different layers.


Lightweight Authentication Scheme with Dynamic Group Members in IoT Environments

In IoT environments, the user may have many devices to connect each other and share the data. Also, the device will not have the powerful computation and storage ability. Many studies have focused on the lightweight authentication between the cloud server and the client in this environment. They can use the cloud server to help sensors or proxies to finish the authentication. But in the client side, how to create the group session key without the cloud capability is the most important issue in IoT environments. The most popular application network of IoT environments is the wireless body area network (WBAN). In WBAN, the proxy usually needs to control and monitor user's health data transmitted from the sensors. In this situation, the group authentication and group session key generation is needed. In this paper, in order to provide an efficient and robust group authentication and group session key generation in the client side of IoT environments, we propose a lightweight authentication scheme with dynamic group members in IoT environments. Our proposed scheme can satisfy the properties including the flexible generation of shared group keys, the dynamic participation, the active revocation, the low communication and computation cost, and no time synchronization problem. Also our scheme can achieve the security requirements including the mutual authentication, the group session key agreement, and prevent all various well-known attacks.


Training a Fully Convolutional Neural Network to Route Integrated Circuits

We present a deep, fully convolutional neural network that learns to route a circuit layout ‘net’ with appropriate choice of metal tracks and wire class combinations. Inputs to the network are the encoded layouts containing spatial location of pins to be routed. After 15 fully convolutional stages followed by a score comparator, the network outputs 8 layout layers (corresponding to 4 route layers, 3 via layers and an identity-mapped pin layer) which are then decoded to obtain the routed layouts. We formulate this as a binary segmentation problem on a per-pixel per-layer basis, where the network is trained to correctly classify pixels in each layout layer to be ‘on’ or ‘off’. To demonstrate learnability of layout design rules, we train the network on a dataset of 50,000 train and 10,000 validation samples that we generate based on certain pre-defined layout constraints. Precision, recall and F1 score metrics are used to track the training progress. Our network achieves F1 ≈ 97% on the train set and F1 ≈ 92% on the validation set. We use PyTorch for implementing our model. Code is made publicly available1.


Smart home for elderly living using Wireless Sensor Networks and an Android application

A Smart Home (SH) is a house or an apartment equipped with advanced automation technologies to provide the occupants with intelligent monitoring and actionable information that can be situation specific. It allows for improvements in the way we live or work, and for improved energy efficiencies. The smart home is especially relevant for the elderly because the intelligent sensing systems would allow for remote monitoring and possibly control of health and environmental parameters according to their health status and living needs. The burgeoning elderly population and rising costs of elderly healthcare and home needs have led to a rapid evolution of the elderly smart living environment. However, the lack of proper eldercare smart home technologies has inspired us to develop Information and Communication Technologies (ICT) based smart home for the elderly using the Android platform. We have proposed a model for the elderly using Wireless Sensor Networks (WSNs) implemented as an Android application. Our smart home research potentially allows the elderly to continue to live in their own homes while being monitored non-invasively, seamlessly and economically according to their healthcare needs and status.


E-GOVERNMENT EVALUATION FACTORS: CITIZEN’S PERSPECTIVE

The e-government field is growing to a considerable size, both in its contents and position with respect to other research fields. The government to citizen segment of egovernment is taking the lead in terms of its importance and size. Like the evaluation of all other information systems initiatives, the evaluation of egovernments in both theory and practice has proved to be important but complex. The complexity of evaluation is mostly due to the multiple perspectives involved, the difficulties of quantifying benefits, and the social and technical context of use. The importance of e-government evaluation is due to the enormous investment of governments on delivering e-government services, and to the considerable pace of growing in the e-government field. However, despite the importance of the evaluation of e-government services, literature shows that e-government evaluation is still an immature area in terms of development and management. This work is part of a research effort that aims to develop a holistic evaluation framework for e-government systems. The main aim of this paper is to investigate the citizen’ perspective in evaluating e-government services, and present a set of evaluating factors that influence citizens’ utilization of e-government services. These evaluation factors can serve as part of an e-government evaluation framework. Moreover, the evaluation factors can also be used as means of providing valuable feedback for the planning of future egovernment initiatives.


Attentive Moment Retrieval in Videos

In the past few years, language-based video retrieval has attracted a lot of attention. However, as a natural extension, localizing the specific video moments within a video given a description query is seldom explored. Although these two tasks look similar, the latter is more challenging due to two main reasons: 1) The former task only needs to judge whether the query occurs in a video and returns an entire video, but the latter is expected to judge which moment within a video matches the query and accurately returns the start and end points of the moment. Due to the fact that different moments in a video have varying durations and diverse spatial-temporal characteristics, uncovering the underlying moments is highly challenging. 2) As for the key component of relevance estimation, the former usually embeds a video and the query into a common space to compute the relevance score. However, the later task concerns moment localization where not only the features of a specific moment matter, but the context information of the moment also contributes a lot. For example, the query may contain temporal constraint words, such as "first'', therefore need temporal context to properly comprehend them. To address these issues, we develop an Attentive Cross-Modal Retrieval Network. In particular, we design a memory attention mechanism to emphasize the visual features mentioned in the query and simultaneously incorporate their context. In the light of this, we obtain the augmented moment representation. Meanwhile, a cross-modal fusion sub-network learns both the intra-modality and inter-modality dynamics, which can enhance the learning of moment-query representation. We evaluate our method on two datasets: DiDeMo and TACoS. Extensive experiments show the effectiveness of our model as compared to the state-of-the-art methods.


First-person hyper-lapse videos

We present a method for converting first-person videos, for example, captured with a helmet camera during activities such as rock climbing or bicycling, into hyper-lapse videos, i.e., time-lapse videos with a smoothly moving camera. At high speed-up rates, simple frame sub-sampling coupled with existing video stabilization methods does not work, because the erratic camera shake present in first-person videos is amplified by the speed-up. Our algorithm first reconstructs the 3D input camera path as well as dense, per-frame proxy geometries. We then optimize a novel camera path for the output video that passes near the input cameras while ensuring that the virtual camera looks in directions that can be rendered well from the input. Finally, we generate the novel smoothed, time-lapse video by rendering, stitching, and blending appropriately selected source frames for each output frame. We present a number of results for challenging videos that cannot be processed using traditional techniques.


CubeNet: Equivariance to 3D Rotation and Translation

3D Convolutional Neural Networks are sensitive to transformations applied to their input. This is a problem because a voxelized version of a 3D object, and its rotated clone, will look unrelated to each other after passing through to the last layer of a network. Instead, an idealized model would preserve a meaningful representation of the voxelized object, while explaining the pose-difference between the two inputs. An equivariant representation vector has two components: the invariant identity part, and a discernable encoding of the transformation. Models that can’t explain pose-differences risk “diluting” the representation, in pursuit of optimizing a classification or regression loss function. We introduce a Group Convolutional Neural Network with linear equivariance to translations and right angle rotations in three dimensions. We call this network CubeNet, reflecting its cube-like symmetry. By construction, this network helps preserve a 3D shape’s global and local signature, as it is transformed through successive layers. We apply this network to a variety of 3D inference problems, achieving state-of-the-art on the ModelNet10 classification challenge, and comparable performance on the ISBI 2012 Connectome Segmentation Benchmark. To the best of our knowledge, this is the first 3D rotation equivariant CNN for voxel representations.


Like: The Discourse Particle and Semantics

Using data from interviews with high school students, I first adduce evidence that lends support to Schourup’s (1985) claim that the United States English adolescent hedge like is a discourse particle signalling a possible slight mismatch between words and meaning. Such a particle would generally be included in a grammar in a post-compositional pragmatic component, but, surprisingly, like also affects basic semantic attributes. These include both truth-conditions and the weak/strong distinction—though only in existential there and sluicing sentences. I argue that the differential behaviour of like in various constructions selecting weak NP’s stems from the restricted free variable it introduces, a variable which only there and sluicing require. This variable is available for binding, quantifier interpretation and other syntactic-semantic processes, yet is pragmatically conditioned. Indeed, I show that, due to its formal properties, like can be interpreted only during the assignment of model-theoretic denotations to expressions, along the lines of Lasersohn’s (1999) pragmatic haloes. These results support the idea that weak/strong is not a unitary distinction and suggest that the various components of grammars must be organized to allow information from pragmatic/discourse elements to affect basic compositional semantics.


A Maturity Model for Green ICT: The Case of the SURF Green ICT Maturity Model

This paper discusses the development and evaluation of a maturity model for Green ICT. We describe how the model was developed with the input of a number of Green ICT experts before it was released to the general public. The model consists of three domains with attributes on Green ICT that encompass both Greening of ICT as well as Greening by ICT. The quality of the model and its accuracy to capture the full scope of Green ICT has been evaluated through an online survey. We evaluated the quality of the model on relevancy of attributes, whether the attributes were well defined and whether the domains were complete. Twenty participants contributed meaningfully. Two attributes were considered to be irrelevant and six new attributes were suggested. With these results the quality of the maturity model can be improved. Our next step is to test the usefulness of the model by seeing how it is used in practice. We hope this paper inspires more work on testing the quality and usefulness of models and frameworks on Green ICT.


Zero-Shot Cross-lingual Classification Using Multilingual Neural Machine Translation

Transferring representations from large supervised tasks to downstream tasks has shown promising results in AI fields such as Computer Vision and Natural Language Processing (NLP). In parallel, the recent progress in Machine Translation (MT) has enabled one to train multilingual Neural MT (NMT) systems that can translate between multiple languages and are also capable of performing zero-shot translation. However, little attention has been paid to leveraging representations learned by a multilingual NMT system to enable zeroshot multilinguality in other NLP tasks. In this paper, we demonstrate a simple framework, a multilingual EncoderClassifier, for cross-lingual transfer learning by reusing the encoder from a multilingual NMT system and stitching it with a task-specific classifier component. Our proposed model achieves significant improvements in the English setup on three benchmark tasks Amazon Reviews, SST and SNLI. Further, our system can perform classification in a new language for which no classification data was seen during training, showing that zero-shot classification is possible and remarkably competitive. In order to understand the underlying factors contributing to this finding, we conducted a series of analyses on the effect of the shared vocabulary, the training data type for NMT, classifier complexity, encoder representation power, and model generalization on zero-shot performance. Our results provide strong evidence that the representations learned from multilingual NMT systems are widely applicable across languages and tasks.


Dynamic Units of Visual Speech

We present a new method for generating a dynamic, concatenative, unit of visual speech that can generate realistic visual speech animation. We redefine visemes as temporal units that describe distinctive speech movements of the visual speech articulators. Traditionally visemes have been surmized as the set of static mouth shapes representing clusters of contrastive phonemes (e.g. /p, b, m/, and /f, v/). In this work, the motion of the visual speech articulators are used to generate discrete, dynamic visual speech gestures. These gestures are clustered, providing a finite set of movements that describe visual speech, the visemes. Dynamic visemes are applied to speech animation by simply concatenating viseme units. We compare to static visemes using subjective evaluation. We find that dynamic visemes are able to produce more accurate and visually pleasing speech animation given phonetically annotated audio, reducing the amount of time that an animator needs to spend manually refining the animation.


Statistical Parametric Speech Synthesis


Photo-Realistic Talking-Heads from Image Samples

This paper describes a system for creating a photo-realistic model of the human head that can be animated and lip-synched from phonetic transcripts of text. Combined with a state-of-the-art text-to-speech synthesizer (TTS), it generates video animations of talking heads that closely resemble real people. To obtain a naturally looking head, we choose a “data-driven” approach. We record a talking person and apply image recognition to extract automatically bitmaps of facial parts. These bitmaps are normalized and parameterized before being entered into a database. For synthesis, the TTS provides the audio track, as well as the phonetic transcript from which trajectories in the space of parameterized bitmaps are computed for all facial parts. Sampling these trajectories and retrieving the corresponding bitmaps from the database produces animated facial parts. These facial parts are then projected and blended onto an image of the whole head using its pose information. This talking head model can produce new, never recorded speech of the person who was originally recorded. Talking-head animations of this type are useful as a front-end for agents and avatars in multimedia applications such as virtual operators, virtual announcers, help desks, educational, and expert systems.


Expressive speech-driven facial animation

Speech-driven facial motion synthesis is a well explored research topic. However, little has been done to model expressive visual behavior during speech. We address this issue using a machine learning approach that relies on a database of speech-related high-fidelity facial motions. From this training set, we derive a generative model of expressive facial motion that incorporates emotion control, while maintaining accurate lip-synching. The emotional content of the input speech can be manually specified by the user or automatically extracted from the audio signal using a Support Vector Machine classifier.


Comparison of main control strategies for DC/DC stage of bidirectional vehicle charger

This paper presents comparison of two control algorithms for DC/DC converters in vehicle chargers. It presents operation in phase-shifting algorithm and resonant LLC algorithm, their implementation, and test results.


Feature Reduction for Document Clustering and Classification

Often users receive search results which contain a wide range of documents, only some of which are relevant to their information needs. To address this problem, ever more systems not only locate information for users, but also organise that information on their behalf. We look at two main automatic approaches to information organisation: interactive clustering of search results and pre-categorising documents to provide hierarchical browsing structures. To be feasible in real world applications, both of these approaches require accurate yet efficient algorithms. Yet, both suffer from the curse of dimensionality — documents are typically represented by hundreds or thousands of words (features) which must be analysed and processed during clustering or classification. In this paper, we discuss feature reduction techniques and their application to document clustering and classification, showing that feature reduction improves efficiency as well as accuracy. We validate these algorithms using human relevance assignments and categorisation.


The "wake-sleep" algorithm for unsupervised neural networks.

An unsupervised learning algorithm for a multilayer network of stochastic neurons is described. Bottom-up "recognition" connections convert the input into representations in successive hidden layers, and top-down "generative" connections reconstruct the representation in one layer from the representation in the layer above. In the "wake" phase, neurons are driven by recognition connections, and generative connections are adapted to increase the probability that they would reconstruct the correct activity vector in the layer below. In the "sleep" phase, neurons are driven by generative connections, and recognition connections are adapted to increase the probability that they would produce the correct activity vector in the layer above.


A Novel Wideband Microstrip Line to Ridge Gap Waveguide Transition Using Defected Ground Slot

In this letter design of a novel, wideband and low loss microstrip line transition to ridge gap waveguide is described. The transition is made up of two sections. The first section is a microstrip line that feeds a slot on the ground plane. The microstrip line is placed inside a metal box. The second part is the slot to ridge gap waveguide matching section. The proposed design has a broadband coupling to ridge gap waveguide and covers the whole stop-band of the periodic gap structure. The design optimization is performed for the microstrip line, slot size and ridge gap waveguide matching ridges. A prototype in Ku-band is manufactured and measured that shows a return loss less than 14 dB and a back-to-back insertion loss smaller than 0.5 dB for the given bandwidth. The microstrip transition enables integration of monolithic microwave integrated circuits (MMICs) in ridge gap waveguide technology.


Technological Developments in Batteries: A Survey of Principal Roles, Types, and Management Needs

Battery energy storage effectively staBIlizes the electric grid and aids renewable integration by balancing supply and demand in real time. The importance of such storage is especially crucial in densely populated urban areas, where traditional storage techniques such as pumped hydroelectric energy storage and compressed-air energy storage are often not feasible.


TRUSTED CODE EXECUTION ON UNTRUSTED PLATFORMS USING INTEL SGX

Today, isolated trusted computation and code execution is of paramount importance to protect sensitive information and workfl ows from other malicious privileged or unprivileged software. Intel Software Guard Extensions (SGX) is a set of security architecture extensions fi rst introduced in the Skylake microarchitecture that enables a Trusted Execution Environment (TEE). It provides an ‘inverse sandbox’, for sensitive programs, and guarantees the integrity and confi dentiality of secure computations, even from the most privileged malicious software (e.g. OS, hypervisor). SGX-capable CPUs only became available in production systems in Q3 2015, and they are not yet fully supported and adopted in systems. Besides the capability in the CPU, the BIOS also needs to provide support for the enclaves, and not many vendors have released the required updates for the system support. This has led to many wrong assumptions being made about the capabilities, features, and ultimately dangers of secure enclaves. By having access to resources and publications such as white papers, patents and the actual SGX-capable hardware and software development environment, we are in a privileged position to be able to investigate and demystify SGX. In this paper, we fi rst review the previous trusted execution technologies, such as ARM Trust Zone and Intel TXT, to better understand and appreciate the new innovations of SGX. Then, we look at the details of SGX technology, cryptographic primitives and the underlying concepts that power it, namely the sealing, attestation, and the Memory Encryption Engine (MEE). We also consider use cases such as trusted and secure code execution on an untrusted cloud platform, and digital rights management (DRM). This is followed by an overview of the software development environment and the available libraries.


Getting stress out of stressed-out stress granules.

Amyotrophic lateral sclerosis (ALS) pathology is linked to the aberrant aggregation of specific proteins, including TDP-43, FUS, and SOD1, but it is not clear why these aggregation events cause ALS. In this issue of The EMBO Journal, Mateju et al (2017) report a direct link between misfolded proteins accumulating in stress granules and the phase transition of these stress granules from liquid to solid. This discovery provides a model connecting protein aggregation to stress granule dysfunction.


Targeting the right students using data mining

The education domain offers a fertile ground for many interesting and challenging data mining applications. These applications can help both educators and students, and improve the quality of education. In this paper, we present a real-life application for the Gifted Education Programme (GEP) of the Ministry of Education (MOE) in Singapore. The application involves many data mining tasks. This paper focuses only on one task, namely, selecting students for remedial classes. Traditionally, a cut-off mark for each subject is used to select the weak students. That is, those students whose scores in a subject fall below the cut-off mark for the subject are advised to take further classes in the subject. In this paper, we show that this traditional method requires too many students to take part in the remedial classes. This not only increases the teaching load of the teachers, but also gives unnecessary burdens to students, which is particularly undesirable in our case because the GEP students are generally taking more subjects than non-GEP students, and the GEP students are encouraged to have more time to explore advanced topics. With the help of data mining, we are able to select the targeted students much more precisely.


Cultural diversity among nursing students: reanalysis of the cultural awareness scale.

Nurses are educated to provide culturally competent care. Cultural competence begins with cultural awareness, a concept previously measured with the Cultural Awareness Scale (CAS). The purpose of this study was to reanalyze the CAS to determine construct validity and differences in cultural awareness among students of varying educational levels and experiences. The sample consisted of 150 nursing students (92% female, 33.6% racial minorities). Confirmatory factor analysis yielded three factors (CFI = 0.868, TLI = 0.854, RMSEA = 0.065, and SRMR = 0.086). Cronbach's alpha ranged from 0.70 to 0.89. There were significant differences among educational levels, with lower division BSN students generally scoring higher than upper division and master's of science in nursing students. Students who had taken courses on cultural diversity or global health generally outscored those who had not taken such courses. Findings support the validity of the CAS and its applicability to research studies of cultural awareness in nursing.


A Hybrid Data Mining Approach for Intrusion Detection on Imbalanced NSL-KDD Dataset

Intrusion detection systems aim to detect malicious viruses from computer and network traffic, which is not possible using common firewall. Most intrusion detection systems are developed based on machine learning techniques. Since datasets which used in intrusion detection are imbalanced, in the previous methods, the accuracy of detecting two attack classes, R2L and U2R, is lower than that of the normal and other attack classes. In order to overcome this issue, this study employs a hybrid approach. This hybrid approach is a combination of synthetic minority oversampling technique (SMOTE) and cluster center and nearest neighbor (CANN). Important features are selected using leave one out method (LOO). Moreover, this study employs NSL KDD dataset. Results indicate that the proposed method improves the accuracy of detecting U2R and R2L attacks in comparison to the baseline paper by 94% and 50%, respectively. Keywords—intrusion detection system; feature selection; imbalanced dataset; SMOTE; NSL KDD


Fog Computing architecture to enable consumer centric Internet of Things services

Fog Computing is a recent computing paradigm that is extending cloud computing towards the edge of network. Due to its proximity to end-users, dense geographical distribution, open platform and support for high mobility, Fog Computing platforms can provide services with reduced latency and improved QoS. Thus it is becoming an important enabler for consumer centric Internet of Things based applications and services that require real time operations e.g. connected vehicles, smart road intersection management and smart grid. The paper discusses one such architecture for connected vehicles with Road Side Units (RSUs) and M2M gateways including the Fog Computing Platform. M2M data processing with semantics, discovery and management of connected vehicles are briefly discussed as consumer centric IoT services enabled by the distinct characteristics of Fog Computing.


Karma: A System for Mapping Structured Sources into the Semantic Web

The Linked Data cloud contains large amounts of RDF data generated from databases. Much of this RDF data, generated using tools such as D2R, is expressed in terms of vocabularies automatically derived from the schema of the original database. The generated RDF would be significantly more useful if it were expressed in terms of commonly used vocabularies. Using today’s tools, it is labor-intensive to do this. For example, one can first use D2R to automatically generate RDF from a database and then use R2R to translate the automatically generated RDF into RDF expressed in a new vocabulary. The problem is that defining the R2R mappings is difficult and labor intensive because one needs to write the mapping rules in terms of SPARQL graph patterns. In this work, we present a semi-automatic approach for building mappings that translate data in structured sources to RDF expressed in terms of a vocabulary of the user’s choice. Our system, Karma, automatically derives these mappings, and provides an easy to use interface that enables users to control the automated process to guide the system to produce the desired mappings. In our evaluation, users need to interact with the system less than once per column (on average) in order to construct the desired mapping rules. The system then uses these mapping rules to generate semantically rich RDF for the data sources. We demonstrate Karma using a bioinformatics example and contrast it with other approaches used in that community. Bio2RDF [7] and Semantic MediaWiki Linked Data Extension (SMW-LDE) [2] are examples of efforts that integrate bioinformatics datasets by mapping them to a common vocabulary. We applied our approach to a scenario used in the SMW-LDE that integrate ABA, Uniprot, KEGG Pathway, PharmGKB and Linking Open Drug Data datasets using a


Path-tracking for autonomous vehicles at the limit of friction

The ability to use all of the available tire force is essential to road vehicles for emergency maneuvers and racing. As the front tires of an understeering vehicle saturate while cornering at the limit of tire-road friction, steering is lost as a control input for path-tracking. Experimental data from an autonomous vehicle show that for path-tracking at the limit of friction through steering the value of friction needs to be known to within approximately 2%. This requirement exceeds the capabilities of existing real-time friction estimation algorithms. Data collected with a professional race car driver inspire a novel control framework, with a slip angle-based control strategy of maintaining the front tires at the slip angle for which maximum tire force is attained, and longitudinal speed control for path-tracking. This approach has significantly less demanding requirements on the accuracy of friction estimation. A controller is presented to explore this concept, and experimental results demonstrate successful tracking of a circular path at the friction limit without a priori friction information.


BEYOND STUDENT PERCEPTIONS: ISSUES OF INTERACTION, PRESENCE, AND PERFORMANCE IN AN ONLINE COURSE

The research literature on Web-based learning supports the assumption that interaction is important for a successful course, yet questions exist regarding the nature and extent of the interaction and its effects on student performance. Much of the research is based on student perceptions of the quality and quantity of their interactions and how much they have learned in an online course. The purpose of this study is to examine performance in an online course in relationship to student interaction and sense of presence in the course. Data on multiple independent (measures of interaction and presence) and dependent (measures of performance) variables were collected and subjected to analysis. An attempt was made to go beyond typical institutional performance measures such as grades and withdrawal rates and to examine measures specifically related to course objectives.


Grey Wolf Optimizer

This work proposes a new meta-heuristic called Grey Wolf Optimizer (GWO) inspired by grey wolves (Canis lupus). The GWO algorithm mimics the leadership hierarchy and hunting mechanism of grey wolves in nature. Four types of grey wolves such as alpha, beta, delta, and omega are employed for simulating the leadership hierarchy. In addition, the three main steps of hunting, searching for prey, encircling prey, and attacking prey, are implemented. The algorithm is then benchmarked on 29 well-known test functions, and the results are verified by a comparative study with Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Differential Evolution (DE), Evolutionary Programming (EP), and Evolution Strategy (ES). The results show that the GWO algorithm is able to provide very competitive results compared to these wellknown meta-heuristics. The paper also considers solving three classical engineering design problems (tension/compression spring, welded beam, and pressure vessel designs) and presents a real application of the proposed method in the field of optical engineering. The results of the classical engineering design problems and real application prove that the proposed algorithm is applicable to challenging problems with unknown search spaces.


Object detection in VHR optical remote sensing images via learning rotation-invariant HOG feature

Object detection in very high resolution (VHR) optical remote sensing images is one of the most fundamental but challenging problems in the field of remote sensing image analysis. As object detection is usually carried out in feature space, effective feature representation is very important to construct a high-performance object detection system. During the last decades, a great deal of effort has been made to develop various feature representations for the detection of different types of objects. Among various features developed for visual object detection, the histogram of oriented gradients (HOG) feature is maybe one of the most popular features that has been successfully applied to computer vision community. However, although the HOG feature has achieved great success in nature scene images, it is problematic to directly use it for object detection in optical remote sensing images because it is difficult to effectively handle the problem of object rotation variations. To explore a possible solution to the problem, this paper proposes a novel method to learn rotation-invariant HOG (RIHOG) features for object detection in optical remote sensing images. This is achieved by learning a rotation-invariant transformation model via optimizing a new objective function, which constrains the training samples before and after rotation to share the similar features to achieve rotation-invariance. In the experiments, we evaluate the proposed method on a publicly available 10-class VHR geospatial object detection dataset and comprehensive comparisons with state-of-the-arts demonstrate the effectiveness the proposed method.


An intelligent decision support system for skin cancer detection from dermoscopic images

It is challenging to develop an intelligent agent-based or robotic system to conduct long-term automatic health monitoring and robust efficient disease diagnosis as autonomous e-Carers in real-world applications. In this research, we aim to deal with such challenges by presenting an intelligent decision support system for skin lesion recognition as the initial step, which could be embedded into an intelligent service robot for health monitoring in home environments to promote early diagnosis. The system is developed to identify benign and malignant skin lesions using multiple steps, including pre-processing such as noise removal, segmentation, feature extraction from lesion regions, feature selection and classification. After extracting thousands of raw shape, colour and texture features from the lesion areas, a Genetic Algorithm (GA) is used to identify the most discriminating significant feature subsets for healthy and cancerous cases. A Support Vector Machine classifier has been employed to perform benign and malignant lesion recognition. Evaluated with 1300 images from the Dermofit dermoscopy image database, the empirical results indicate that our approach achieves superior performance in comparison to other related research reported in the literature.


Missing Modalities Imputation via Cascaded Residual Autoencoder

Affordable sensors lead to an increasing interest in acquiring and modeling data with multiple modalities. Learning from multiple modalities has shown to significantly improve performance in object recognition. However, in practice it is common that the sensing equipment experiences unforeseeable malfunction or configuration issues, leading to corrupted data with missing modalities. Most existing multi-modal learning algorithms could not handle missing modalities, and would discard either all modalities with missing values or all corrupted data. To leverage the valuable information in the corrupted data, we propose to impute the missing data by leveraging the relatedness among different modalities. Specifically, we propose a novel Cascaded Residual Autoencoder (CRA) to impute missing modalities. By stacking residual autoencoders, CRA grows iteratively to model the residual between the current prediction and original data. Extensive experiments demonstrate the superior performance of CRA on both the data imputation and the object recognition task on imputed data.


Convergence of Stochastic Gradient Descent for PCA

We consider the problem of principal component analysis (PC A) in a streaming stochastic setting, where our goal is to find a direction of approximate maximal va riance, based on a stream of i.i.d. data points inR. A simple and computationally cheap algorithm for this is st ochastic gradient descent (SGD), which incrementally updates its estimate based on ea ch new data point. However, due to the non-convex nature of the problem, analyzing its performanc e has been a challenge. In particular, existing guarantees rely on a non-trivial eigengap assumption on the covariance matrix, which is intuitively unnecessary. In this paper, we provide (to the best of our kno wledge) the first eigengap-free convergence guarantees for SGD in the context of PCA. This also part ially resolves an open problem posed in [10]. Moreover, under an eigengap assumption, we show tha t the same techniques lead to new SGD convergence guarantees with better dependence on the eigen gap.