Abstractive Multi-document Summarization with Semantic Information Extraction

This paper proposes a novel approach to generate abstractive summary for multiple documents by extracting semantic information from texts. The concept of Basic Semantic Unit (BSU) is defined to describe the semantics of an event or action. A semantic link network on BSUs is constructed to capture the semantic information of texts. Summary structure is planned with sentences generated based on the semantic link network. Experiments demonstrate that the approach is effective in generating informative, coherent and compact summary.


Opportunistic Computation Offloading in Mobile Edge Cloud Computing Environments

The dynamic mobility and limitations in computational power, battery resources, and memory availability are main bottlenecks in fully harnessing mobile devices as data mining platforms. Therefore, the mobile devices are augmented with cloud resources in mobile edge cloud computing (MECC) environments to seamlessly execute data mining tasks. The MECC infrastructures provide compute, network, and storage services in one-hop wireless distance from mobile devices to minimize the latency in communication as well as provide localized computations to reduce the burden on federated cloud systems. However, when and how to offload the computation is a hard problem. In this paper, we present an opportunistic computation offloading scheme to efficiently execute data mining tasks in MECC environments. The scheme provides the suitable execution mode after analyzing the amount of unprocessed data, privacy configurations, contextual information, and available on-board local resources (memory, CPU, and battery power). We develop a mobile application for online activity recognition and evaluate the proposed scheme using the event data stream of 5 million activities collected from 12 users for 15 days. The experiments show significant improvement in execution time and battery power consumption resulting in 98% data reduction.


Large-scale audio feature extraction and SVM for acoustic scene classification

This work describes a system for acoustic scene classification using large-scale audio feature extraction. It is our contribution to the Scene Classification track of the IEEE AASP Challenge on Detection and Classification of Acoustic Scenes and Events (D-CASE). The system classifies 30 second long recordings of 10 different acoustic scenes. From the highly variable recordings, a large number of spectral, cepstral, energy and voicing-related audio features are extracted. Using a sliding window approach, classification is performed on short windows. SVM are used to classify these short segments, and a majority voting scheme is employed to get a decision for longer recordings. On the official development set of the challenge, an accuracy of 73 % is achieved. SVM are compared with a nearest neighbour classifier and an approach called Latent Perceptual Indexing, whereby SVM achieve the best results. A feature analysis using the t-statistic shows that mainly Mel spectra are the most relevant features.


A fractional order fuzzy PID controller for binary distillation column control

Expert and intelligent control schemes have recently emerged out as a promising solution with robustness which can efficiently deal with the nonlinearities, along with various types of modelling uncertainties, present in different real world systems e.g. binary distillation column. This paper is an attempt to propose an intelligent control system which takes the form of a Fractional Order Fuzzy Proportional – Integral – Derivative (FOFPID) controller which is investigated as a solution to deal with the complex dynamic nature of the distillation column. The FOFPID controller is an extension of an existing formula based self tuning fuzzy Proportional Integral controller structure, which varies its gains at run time in accordance with the instantaneous error and rate of change of error. The FOFPID controller is a Takagi-Sugeno (TS) model based fuzzy adaptive controller comprising of non-integer order of integration and differentiation operators used in the controller. It has been observed that inclusion of non-integer order of the integration and differentiation operators made the controller scheme more robust. For the performance evaluation of the proposed scheme, the performance of FOFPID controller is compared with that of its integer order counterpart, a Fuzzy Proportional – Integral – Derivative (FPID) controller. The parameters of both the controllers were optimized for minimum integral of absolute error (IAE) using a bio-inspired global optimization algorithm, Genetic Algorithm (GA). Intensive LabVIEW TM simulation studies were performed which included setpoint tracking with and without uncertainties, disturbance rejection, and noise suppression investigations. For testing the parameter uncertainty handling capability of the proposed controller, uncertain and time varying relative volatility and uncertain tray hydraulic constant were applied. Also, for the disturbance rejection studies, intensive simulations were conducted, which included two most common causes of disturbance i.e. variation in feed composition and variation in feed flow rate. All the simulation investigations clearly suggested that FOFPID controller provided superior performance over FPID controller for each case study i.e. setpoint tracking, disturbance rejection, noise suppression and parameter uncertainties.


A three-component scattering model for polarimetric SAR data

An approach has been developed that involves the fit of a combination of three simple scattering mechanisms to polarimetric SAR observations. The mechanisms are canopy scatter from a cloud of randomly oriented dipoles, evenor double-bounce scatter from a pair of orthogonal surfaces with different dielectric constants and Bragg scatter from a moderately rough surface. This composite scattering model is used to describe the polarimetric backscatter from naturally occurring scatterers. The model is shown to describe the behavior of polarimetric backscatter from tropical rain forests quite well by applying it to data from NASA/Jet Propulsion Laboratory’s (JPL’s) airborne polarimetric synthetic aperture radar (AIRSAR) system. The model fit allows clear discrimination between flooded and nonflooded forest and between forested and deforested areas, for example. The model is also shown to be usable as a predictive tool to estimate the effects of forest inundation and disturbance on the fully polarimetric radar signature. An advantage of this model fit approach is that the scattering contributions from the three basic scattering mechanisms can be estimated for clusters of pixels in polarimetric SAR images. Furthermore, it is shown that the contributions of the three scattering mechanisms to the HH, HV, and VV backscatter can be calculated from the model fit. Finally, this model fit approach is justified as a simplification of more complicated scattering models, which require many inputs to solve the forward scattering problem.


Stacked Patch Antenna With Dual-Polarization and Low Mutual Coupling for Massive MIMO

Massive multiple input and multiple output (MIMO) has attracted significant interests in both academia and industry. It has been considered as one of most promising technologies for 5G wireless systems. The large-scale antenna array for base stations naturally becomes the key to deploy the Massive MIMO technologies. In this communication, we present a dual-polarized antenna array with 144 ports for Massive MIMO operating at 3.7 GHz. The proposed array consists of 18 low profile subarrays. Each subarray consists of four single units. Each single antenna unit consists of one vertically polarized port and one horizontally polarized port connected to power splitters, which serve as a feeding network. A stacked patch design is used to construct the single unit with the feeding network, which gives higher gain and lower mutual coupling within the size of a conversional dual-port patch antenna. Simulation results of the proposed single antenna unit, sub-array, and Massive MIMO array are verified by measurement.


UIMA: an architectural approach to unstructured information processing in the corporate research environment

IBM Research has over 200 people working on Unstructured Information Management (UIM) technologies with a strong focus on Natural Language Processing (NLP). These researchers are engaged in activities ranging from natural language dialog, information retrieval, topic-tracking, named-entity detection, document classification and machine translation to bioinformatics and open-domain question answering. An analysis of these activities strongly suggested that improving the organization’s ability to quickly discover each other's results and rapidly combine different technologies and approaches would accelerate scientific advance. Furthermore, the ability to reuse and combine results through a common architecture and a robust software framework would accelerate the transfer of research results in NLP into IBM’s product platforms. Market analyses indicating a growing need to process unstructured information, specifically multilingual, natural language text, coupled with IBM Research’s investment in NLP, led to the development of middleware architecture for processing unstructured information dubbed UIMA. At the heart of UIMA are powerful search capabilities and a data-driven framework for the development, composition and distributed deployment of analysis engines. In this paper we give a general introduction to UIMA focusing on the design points of its analysis engine architecture and we discuss how UIMA is helping to accelerate research and technology transfer. 1 Motivation and Objectives We characterize a UIM application as a software system that analyzes large volumes of unstructured information while consulting structured information sources to discover, organize and present knowledge relevant to the application’s end-user. We define structured information as information whose intended meaning is unambiguous and explicitly represented in the structure or format of the data. The canonical example of structured information is a relational database table. We define unstructured information as information whose intended meaning is only loosely implied by its form. The canonical example is a natural language document; other examples include voice, audio, image and video. To appear in a special issue of the Journal of Natural Language Engineering 2004 2 Ferrucci and Lally Do Not Distirubte without written permission from authors Market indicators suggest a rapid increase in the use of text and voice analytics to a growing class of commercially viable applications (Roush 2003). National security interests are driving applications to involve an even broader set of UIM technologies including image and video analytics. Emerging and commercially important UIM application areas include life sciences, e-commerce, technical support, advanced search, and national and business intelligence. In six major labs spread out over the globe, IBM Research has over 200 people working on Unstructured Information Management (UIM) technologies with a primary focus on Natural Language Processing (NLP). These researchers are engaged in activities ranging from natural language dialog, information retrieval, topic-tracking, named-entity detection, document classification and machine translation to bioinformatics and open-domain question answering. Each group is developing different technical and engineering approaches to process unstructured information in pursuit of their specific research agenda in the UIM space. While IBM Research’s independent UIM technologies fare well in scientific venues, accelerated development of integrated, robust applications is becoming increasingly important to IBM’s commercial interests. Furthermore the rapid integration of different alogorthims and techniques is also a means to advance scientific results. For example, experiments in statistical name-entity detection or machine translation may benefit from using a deep parser as a feature generator. Facilitating the rapid integration of an independently produced deep parser with statistical algorithm implementations can accelerate the research cycle time as well as the time to product. Some of the challenges that face a large research organization in efficiently leveraging and integrating its (and third-party) UIM assets include: • Organizational Structure. IBM Research is largely organized in three to five person teams geographically dispersed among different labs throughout world. This structure makes it more difficult to jointly develop and reuse technologies. • Skills Alignment. There are inefficiencies in having PhDs trained and specialized in, for example, computational linguistics or statistical machine learning, develop and apply the requisite systems expertise to deliver their work into product architectures and/or make it easily usable by other researchers. To appear in a special issue of the Journal of Natural Language Engineering 2004 3 Ferrucci and Lally Do Not Distirubte without written permission from authors • Development Inefficiencies. Research results are delivered in a myriad of interfaces and technologies. Reuse and integration often requires too much effort dedicated to technical adaptation. Too often work is replicated. • Speed to product. Software Products introduce their own architectures, interfaces and implementation technologies. Technology transfer from the lab to the products often becomes a significant engineering or rewrite effort for researchers. A common framework and engineering discipline could help address the challenges listed above. The Unstructured Information Management Architecture (UIMA) project was initiated within IBM Research based on the premise that a common software architecture for developing, composing and delivering UIM technologies, if adopted by the organization, would facilitate technology reuse and integration, enable quicker scientific experimentation and speed the path to product. IBM’s Unstructured Information Management Architecture (UIMA) high-level objectives are two fold: 1) Accelerate scientific advances by enabling the rapid combination of UIM technologies (e.g., natural language processing, audio and video analysis, information retrieval, etc.). 2) Accelerate transfer of UIM technologies to product by providing an architecture and associated framework implementations that promote reuse and support flexible deployment options. 2 The Unstructured Information Management Architecture (UIMA) UIMA is a software architecture for developing UIM applications. The UIMA high-level architecture, illustrated in Figure 1, defines the roles, interfaces and communications of large-grained components essential for UIM applications. These include components capable of analyzing unstructured artifacts, integrating and accessing structured sources and storing, indexing and searching for artifacts based on discovered semantic content resulting from analyses. A primary design point for UIMA is that it should admit the implementation of middleware frameworks that provide a component-based infrastructure for developing UIM applications suitable for vastly different deployment environments. These should range from lightweight and embeddable implementations to highly scalable implementations that are meant to exploit clusters of machines and provide high throughput, high availability serviced-based offerings. While the primary focus of current UIMA framework implementations is squarely on natural language To appear in a special issue of the Journal of Natural Language Engineering 2004 4 Ferrucci and Lally Do Not Distirubte without written permission from authors UIM Application Analysis Collection Level Analysis Document, Collection & Metadata Store Knowledge Source Access Collection Processing Manager (CPM) Knowledge & Data Bases Unstructured Information (Text) Analysis Engines Crawlers Analysis Engine Directory Acquisition Unstructured Information Analysis Structured Information Access Semantic Search Engine Indices Indices Documents Collections Metadata Knowledge Source Adapter Directory Access


On composition of a federated web search result page: using online users to provide pairwise preference for heterogeneous verticals

Modern web search engines are federated --- a user query is sent to the numerous specialized search engines called verticals like web (text documents), News, Image, Video, etc. and the results returned by these engines are then aggregated and composed into a search result page (SERP) and presented to the user. For a specific query, multiple verticals could be relevant, which makes the placement of these vertical results within blocks of textual web results challenging: how do we represent, assess, and compare the relevance of these heterogeneous entities?
 In this paper we present a machine-learning framework for SERP composition in the presence of multiple relevant verticals. First, instead of using the traditional label generation method of human judgment guidelines and trained judges, we use a randomized online auditioning system that allows us to evaluate triples of the form query, web block, vertical>. We use a pairwise click preference to evaluate whether the web block or the vertical block had a better users' engagement. Next, we use a hinged feature vector that contains features from the web block to create a common reference frame and augment it with features representing the specific vertical judged by the user. A gradient boosted decision tree is then learned from the training data. For the final composition of the SERP, we place a vertical result at a slot if the score is higher than a computed threshold. The thresholds are algorithmically determined to guarantee specific coverage for verticals at each slot.
 We use correlation of clicks as our offline metric and show that click-preference target has a better correlation than human judgments based models. Furthermore, on online tests for News and Image verticals we show higher user engagement for both head and tail queries.


Soft start-up for high frequency LLC resonant converter with optimal trajectory control

This paper investigates the soft start-up for high frequency LLC resonant converter with optimal trajectory control. Two methods are proposed to realize soft start-up for high frequency LLC converter by commercial low-cost microcontrollers (MCU). Both methods can achieve soft start-up with minimum stress and optimal energy delivery. One method is mixed-signal implementation by sensing resonant tank to minimize the digital delay. Another method is digital implementation with look-up table. Experimental results are demonstrated on 500kHz 1kW 400V/12V LLC converter.


Grammar Variational Autoencoder

s m i l e s ! c h a i n atom ! b r a c k e t _ a t o m | a l i p h a t i c _ o r g a n i c | a r o m a t i c _ o r g a n i c a l i p h a t i c _ o r g a n i c ! ’B’ | ’C’ | ’N’ | ’O’ | ’S ’ | ’P ’ | ’F ’ | ’ I ’ | ’ Cl ’ | ’ Br ’ a r o m a t i c _ o r g a n i c ! ’ c ’ | ’ n ’ | ’ o ’ | ’ s ’ b r a c k e t _ a t o m ! ’ [ ’ BAI ’ ] ’ BAI ! i s o t o p e symbol BAC | symbol BAC | i s o t o p e symbol | symbol BAC ! c h i r a l BAH | BAH | c h i r a l BAH ! hc ou n t BACH | BACH | h co u n t BACH ! c h a r g e c l a s s | c h a r g e | c l a s s symbol ! a l i p h a t i c _ o r g a n i c | a r o m a t i c _ o r g a n i c i s o t o p e ! DIGIT | DIGIT DIGIT | DIGIT DIGIT DIGIT DIGIT ! ’1 ’ | ’2 ’ | ’3 ’ | ’4 ’ | ’5 ’ | ’6 ’ | ’7 ’ | ’8 ’ c h i r a l ! ’@’ | ’@@’ hc ou n t ! ’H’ | ’H’ DIGIT c h a r g e ! ’ ’ | ’ ’ DIGIT | ’ ’ DIGIT DIGIT | ’+ ’ | ’+ ’ DIGIT | ’+ ’ DIGIT DIGIT bond ! ’ ’ | ’= ’ | ’# ’ | ’ / ’ | ’ \ ’ r i n g b o n d ! DIGIT | bond DIGIT branched_a tom ! atom | atom RB | atom BB | atom RB BB RB ! RB r i n g b o n d | r i n g b o n d BB ! BB b ra n ch | b r a n ch b ra nc h ! ’ ( ’ c h a i n ’ ) ’ | ’ ( ’ bond c h a i n ’ ) ’ c h a i n ! branched_a tom | c h a i n branched_a tom | c h a i n bond branched_a tom


Fashion-focused creative commons social dataset

In this work, we present a fashion-focused Creative Commons dataset, which is designed to contain a mix of general images as well as a large component of images that are focused on fashion (i.e., relevant to particular clothing items or fashion accessories). The dataset contains 4810 images and related metadata. Furthermore, a ground truth on image's tags is presented. Ground truth generation for large-scale datasets is a necessary but expensive task. Traditional expert based approaches have become an expensive and non-scalable solution. For this reason, we turn to crowdsourcing techniques in order to collect ground truth labels; in particular we make use of the commercial crowdsourcing platform, Amazon Mechanical Turk (AMT). Two different groups of annotators (i.e., trusted annotators known to the authors and crowdsourcing workers on AMT) participated in the ground truth creation. Annotation agreement between the two groups is analyzed. Applications of the dataset in different contexts are discussed. This dataset contributes to research areas such as crowdsourcing for multimedia, multimedia content analysis, and design of systems that can elicit fashion preferences from users.


Memory versus non-linearity in reservoirs

Reservoir Computing (RC) is increasingly being used as a conceptually simple yet powerful method for using the temporal processing of recurrent neural networks (RNN). However, because fundamental insight in the exact functionality of the reservoir is as yet still lacking, in practice there is still a lot of manual parameter tweaking or brute-force searching involved in optimizing these systems. In this contribution we aim to enhance the insights into reservoir operation, by experimentally studying the interplay of the two crucial reservoir properties, memory and non-linear mapping. For this, we introduce a novel metric which measures the deviation of the reservoir from a linear regime and use it to define different regions of dynamical behaviour. Next, we study the relationship of two important reservoir parameters, input scaling and spectral radius, on two properties of an artificial task, namely memory and non-linearity.


Improving feature selection techniques for machine learning

As a commonly used technique in data preprocessing for machine learning, feature selection identifies important features and removes irrelevant, redundant or noise features to reduce the dimensionality of feature space. It improves efficiency, accuracy and comprehensibility of the models built by learning algorithms. Feature selection techniques have been widely employed in a variety of applications, such as genomic analysis, information retrieval, and text categorization. Researchers have introduced many feature selection algorithms with different selection criteria. However, it has been discovered that no single criterion is best for all applications. We proposed a hybrid feature selection framework called based on genetic algorithms (GAs) that employs a target learning algorithm to evaluate features, a wrapper method. We call it hybrid genetic feature selection (HGFS) framework. The advantages of this approach include the ability to accommodate multiple feature selection criteria and find small subsets of features that perform well for the target algorithm. The experiments on genomic data demonstrate that ours is a robust and effective approach that can find subsets of features with higher classification accuracy and/or smaller size compared to each individual feature selection algorithm. A common characteristic of text categorization tasks is multi-label classification with a great number of features, which makes wrapper methods time-consuming and impractical. We proposed a simple filter (non-wrapper) approach called Relation Strength and Frequency Variance (RSFV) measure. The basic idea is that informative features are those that are highly correlated with the class and distribute most differently among all classes. The approach is compared with two well-known feature selection methods in the experiments on two standard text corpora. The experiments show that RSFV generate equal or better performance than the others in many cases. INDEX WORDS: Feature selection, Gene selection, Term selection, Dimension Reduction, Genetic algorithm, Text categorization, Text classification IMPROVING FEATURE SELECTION TECHNIQUES FOR


Calculating the maximum execution time of real-time programs

In real-time systems, the timing behavior is an important property of each task. It has to be guaranteed that the execution of a task does not take longer than the specified amount of time. Thus, a knowledge about the maximum execution time of programs is of utmost importance. This paper discusses the problems for the calculation of the maximum execution time (MAXT... MAximum eXecution Time). It shows the preconditions which have to be met before the MAXT of a task can be calculated. Rules for the MAXT calculation are described. Triggered by the observation that in most cases the calculated MAXT far exceeds the actual execution time, new language constructs are introduced. These constructs allow programmers to put into their programs more information about the behavior of the algorithms implemented and help to improve the self checking property of programs. As a consequence, the quality of MAXT calculations is improved significantly. In a realistic example, an improvement fator of 11 has been achieved.


Comparative Study of Chronic Kidney Disease Prediction using KNN and SVM

Chronic kidney disease (CKD), also known as chronic renal disease. Chronic kidney disease involves conditions that damage your kidneys and decrease their ability to keep you healthy. You may develop complications like high blood pressure, anemia (low blood count), weak bones, poor nutritional health and nerve damage. . Early detection and treatment can often keep chronic kidney disease from getting worse. Data Mining is the term used for knowledge discovery from large databases. The task of data mining is to make use of historical data, to discover regular patterns and improve future decisions, follows from the convergence of several recent trends: the lessening cost of large data storage devices and the everincreasing ease of collecting data over networks; the expansion of robust and efficient machine learning algorithms to process this data; and the lessening cost of computational power, enabling use of computationally intensive methods for data analysis. Machine learning, has already created practical applications in such areas as analyzing medical science outcomes, detecting fraud, detecting fake users etc. Various data mining classification approaches and machine learning algorithms are applied for prediction of chronic diseases. The objective of this research work is to introduce a new decision support system to predict chronic kidney disease. The aim of this work is to compare the performance of Support vector machine (SVM) and K-Nearest Neighbour (KNN) classifier on the basis of its accuracy, precision and execution time for CKD prediction. From the experimental results it is observed that the performance of KNN classifier is better than SVM. Keywords—Data Mining, Machine learning, Chronic kidney disease, Classification, K-Nearest Neighbour, Support vector machine.


Prader-Willi syndrome: a review of clinical, genetic, and endocrine findings

INTRODUCTION
Prader-Willi syndrome (PWS) is a multisystemic complex genetic disorder caused by lack of expression of genes on the paternally inherited chromosome 15q11.2-q13 region. There are three main genetic subtypes in PWS: paternal 15q11-q13 deletion (65-75 % of cases), maternal uniparental disomy 15 (20-30 % of cases), and imprinting defect (1-3 %). DNA methylation analysis is the only technique that will diagnose PWS in all three molecular genetic classes and differentiate PWS from Angelman syndrome. Clinical manifestations change with age with hypotonia and a poor suck resulting in failure to thrive during infancy. As the individual ages, other features such as short stature, food seeking with excessive weight gain, developmental delay, cognitive disability and behavioral problems become evident. The phenotype is likely due to hypothalamic dysfunction, which is responsible for hyperphagia, temperature instability, high pain threshold, hypersomnia and multiple endocrine abnormalities including growth hormone and thyroid-stimulating hormone deficiencies, hypogonadism and central adrenal insufficiency. Obesity and its complications are the major causes of morbidity and mortality in PWS.

METHODS
An extensive review of the literature was performed and interpreted within the context of clinical practice and frequently asked questions from referring physicians and families to include the current status of the cause and diagnosis of the clinical, genetics and endocrine findings in PWS.

CONCLUSIONS
Updated information regarding the early diagnosis and management of individuals with Prader-Willi syndrome is important for all physicians and will be helpful in anticipating and managing or modifying complications associated with this rare obesity-related disorder.


Spotlight: Optimizing Device Placement for Training Deep Neural Networks

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


Percutaneous interventions for left atrial appendage exclusion: options, assessment, and imaging using 2D and 3D echocardiography.

Percutaneous left atrial appendage (LAA) exclusion is an evolving treatment to prevent embolic events in patients with nonvalvular atrial fibrillation. In the past few years multiple percutaneous devices have been developed to exclude the LAA from the body of the left atrium and thus from the systemic circulation. Two- and 3-dimensional transesophageal echocardiography (TEE) is used to assess the LAA anatomy and its suitability for percutaneous closure to select the type and size of the closure device and to guide the device implantation procedure in conjunction with fluoroscopy. In addition, 2- and 3-dimensional TEE is also used to assess the effectiveness of device implantation acutely and on subsequent follow-up examination. Knowledge of the implantation options that are currently available along with their specific characteristics is essential for choosing the appropriate device for a given patient with a specific LAA anatomy. We present the currently available LAA exclusion devices and the echocardiographic imaging approaches for evaluation of the LAA before, during, and after LAA occlusion.


Biomedical ontology alignment: an approach based on representation learning

BACKGROUND
While representation learning techniques have shown great promise in application to a number of different NLP tasks, they have had little impact on the problem of ontology matching. Unlike past work that has focused on feature engineering, we present a novel representation learning approach that is tailored to the ontology matching task. Our approach is based on embedding ontological terms in a high-dimensional Euclidean space. This embedding is derived on the basis of a novel phrase retrofitting strategy through which semantic similarity information becomes inscribed onto fields of pre-trained word vectors. The resulting framework also incorporates a novel outlier detection mechanism based on a denoising autoencoder that is shown to improve performance.

RESULTS
An ontology matching system derived using the proposed framework achieved an F-score of 94% on an alignment scenario involving the Adult Mouse Anatomical Dictionary and the Foundational Model of Anatomy ontology (FMA) as targets. This compares favorably with the best performing systems on the Ontology Alignment Evaluation Initiative anatomy challenge. We performed additional experiments on aligning FMA to NCI Thesaurus and to SNOMED CT based on a reference alignment extracted from the UMLS Metathesaurus. Our system obtained overall F-scores of 93.2% and 89.2% for these experiments, thus achieving state-of-the-art results.

CONCLUSIONS
Our proposed representation learning approach leverages terminological embeddings to capture semantic similarity. Our results provide evidence that the approach produces embeddings that are especially well tailored to the ontology matching task, demonstrating a novel pathway for the problem.


The Media and Technology Usage and Attitudes Scale: An empirical investigation

Current approaches to measuring people's everyday usage of technology-based media and other computer-related activities have proved to be problematic as they use varied outcome measures, fail to measure behavior in a broad range of technology-related domains and do not take into account recently developed types of technology including smartphones. In the present study, a wide variety of items, covering a range of up-to-date technology and media usage behaviors. Sixty-six items concerning technology and media usage, along with 18 additional items assessing attitudes toward technology, were administered to two independent samples of individuals, comprising 942 participants. Factor analyses were used to create 11 usage subscales representing smartphone usage, general social media usage, Internet searching, e-mailing, media sharing, text messaging, video gaming, online friendships, Facebook friendships, phone calling, and watching television in addition to four attitude-based subscales: positive attitudes, negative attitudes, technological anxiety/dependence, and attitudes toward task-switching. All subscales showed strong reliabilities and relationships between the subscales and pre-existing measures of daily media usage and Internet addiction were as predicted. Given the reliability and validity results, the new Media and Technology Usage and Attitudes Scale was suggested as a method of measuring media and technology involvement across a variety of types of research studies either as a single 60-item scale or any subset of the 15 subscales.


A Computational Approach to Edge Detection

This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to a single edge. We use the criteria in numerical optimization to derive detectors for several common image features, including step edges. On specializing the analysis to step edges, we find that there is a natural uncertainty principle between detection and localization performance, which are the two main goals. With this principle we derive a single operator shape which is optimal at any scale. The optimal detector has a simple approximate implementation in which edges are marked at maxima in gradient magnitude of a Gaussian-smoothed image. We extend this simple detector using operators of several widths to cope with different signal-to-noise ratios in the image. We present a general method, called feature synthesis, for the fine-to-coarse integration of information from operators at different scales. Finally we show that step edge detector performance improves considerably as the operator point spread function is extended along the edge.


Exploring steganography: Seeing the unseen

Steganography is the art of hiding information in ways that prevent the detection of hidden messages. It includes a vast array of secret communications methods that conceal the message's very existence. These methods include invisible inks, microdots, character arrangement, digital signatures, covert channels, and spread spectrum communications. Steganography and cryptography are cousins in the spycraft family: cryptography scrambles a message so it cannot be understood while steganography hides the message so it cannot be seen. In this article the authors discuss image files and how to hide information in them, and discuss results obtained from evaluating available steganographic software. They argue that steganography by itself does not ensure secrecy, but neither does simple encryption. If these methods are combined, however, stronger encryption methods result. If an encrypted message is intercepted, the interceptor knows the text is an encrypted message. But with steganography, the interceptor may not know that a hidden message even exists. For a brief look at how steganography evolved, there is included a sidebar titled "Steganography: Some History."


Techniques for Data Hiding

by International Business Machines Corporation. Copying in printed form for private use is permitted without payment of royalty provided that (1) each reproduction is done without alteration and (2) the Journal reference and IBM copyright notice are included on the first page. The title and abstract, but no other portions, of this paper may be copied or distributed royalty free without further permission by computer-based and other information service systems. Permission to republish any other portion of this paper must be obtained from the Editor. Data hiding, a form of steganography, embeds data into digital media for the purpose of identification, annotation, and copyright. Several constraints affect this process: the quantity of data to be hidden, the need for invariance of these data under conditions where a " host " signal is subject to distortions, e.g., lossy compression, and the degree to which the data must be immune to interception, modification, or removal by a third party. We explore both traditional and novel techniques for addressing the data-hiding process and evaluate these techniques in light of three applications: copyright protection, tamper-proofing, and augmentation data embedding. igital representation of media facilitates access and potentially improves the portability, efficiency , and accuracy of the information presented. Undesirable effects of facile data access include an increased opportunity for violation of copyright and tampering with or modification of content. The motivation for this work includes the provision of protection of intellectual property rights, an indication of content manipulation, and a means of annotation. Data hiding represents a class of processes used to embed data, such as copyright information, into various forms of media such as image, audio, or text with a minimum amount of perceivable degradation to the " host " signal; i.e., the embedded data should be invisible and inaudible to a human observer. Note that data hiding, while similar to compression, is distinct from encryption. Its goal is not to restrict or regulate access to the host signal, but rather to ensure that embedded data remain inviolate and recoverable. Two important uses of data hiding in digital media are to provide proof of the copyright, and assurance of content integrity. Therefore, the data should stay hidden in a host signal, even if that signal is subjected to manipulation as degrading as filtering, resampling, cropping, or lossy data compression. Other applications of data hiding, such as the inclusion of augmentation data, need not …


A New Approach to Persian/Arabic Text Steganography

Conveying information secretly and establishing hidden relationship has been of interest since long past. Text documents have been widely used since very long time ago. Therefore, we have witnessed different method of hiding information in texts (text steganography) since past to the present. In this paper we introduce a new approach for steganography in Persian and Arabic texts. Considering the existence of too many points in Persian and Arabic phrases, in this approach, by vertical displacement of the points, we hide information in the texts. This approach can be categorized under feature coding methods. This method can be used for Persian/Arabic watermarking. Our method has been implemented by Java programming language


Applications of data hiding in digital images


At the end of the 14C time scale--the Middle to Upper Paleolithic record of western Eurasia.

The dynamics of change underlying the demographic processes that led to the replacement of Neandertals by Anatomically Modern Humans (AMH) and the emergence of what are recognized as Upper Paleolithic technologies and behavior can only be understood with reference to the underlying chronological framework. This paper examines the European chronometric (mainly radiocarbon-based) record for the period between ca. 40 and 30 ka 14C BP and proposes a relatively rapid transition within some 2,500 years. This can be summarized in the following falsifiable hypotheses: (1) final Middle Paleolithic (FMP) "transitional" industries (Uluzzian, Chatelperronian, leaf-point industries) were made by Neandertals and date predominantly to between ca. 41 and 38 ka 14C BP, but not younger than 35/34 ka 14C BP; (2) initial (IUP) and early (EUP) Upper Paleolithic "transitional" industries (Bachokirian, Bohunician, Protoaurignacian, Kostenki 14) will date to between ca. 39/38 and 35 ka 14C BP and document the appearance of AMH in Europe; (3) the earliest Aurignacian (I) appears throughout Europe quasi simultaneously at ca. 35 ka 14C BP. The earliest appearance of figurative art is documented only for a later phase ca. 33.0/32.5-29.2 ka 14C BP. Taken together, the Middle to Upper Paleolithic transition appears to be a cumulative process involving the acquisition of different elements of "behavioral modernity" through several "stages of innovation."


Azuma A Survey of Augmented Reality

This paper surveys the field of augmented reality (AR), in which 3D virtual objects are integrated into a 3D real environment in real time. It describes the medical, manufacturing , visualization, path planning, entertainment, and military applications that have been explored. This paper describes the characteristics of augmented reality systems, including a detailed discussion of the tradeoffs between optical and video blending approaches. Registration and sensing errors are two of the biggest problems in building effective augmented reality systems, so this paper summarizes current efforts to overcome these problems. Future directions and areas requiring further research are discussed. This survey provides a starting point for anyone interested in researching or using augmented reality.


The Social Explanatory Styles Questionnaire: Assessing Moderators of Basic Social-Cognitive Phenomena Including Spontaneous Trait Inference, the Fundamental Attribution Error, and Moral Blame

Why is he poor? Why is she failing academically? Why is he so generous? Why is she so conscientious? Answers to such everyday questions--social explanations--have powerful effects on relationships at the interpersonal and societal levels. How do people select an explanation in particular cases? We suggest that, often, explanations are selected based on the individual's pre-existing general theories of social causality. More specifically, we suggest that over time individuals develop general beliefs regarding the causes of social events. We refer to these beliefs as social explanatory styles. Our goal in the present article is to offer and validate a measure of individual differences in social explanatory styles. Accordingly, we offer the Social Explanatory Styles Questionnaire (SESQ), which measures three independent dimensions of social explanatory style: Dispositionism, historicism, and controllability. Studies 1-3 examine basic psychometric properties of the SESQ and provide positive evidence regarding internal consistency, factor structure, and both convergent and divergent validity. Studies 4-6 examine predictive validity for each subscale: Does each explanatory dimension moderate an important phenomenon of social cognition? Results suggest that they do. In Study 4, we show that SESQ dispositionism moderates the tendency to make spontaneous trait inferences. In Study 5, we show that SESQ historicism moderates the tendency to commit the Fundamental Attribution Error. Finally, in Study 6 we show that SESQ controllability predicts polarization of moral blame judgments: Heightened blaming toward controllable stigmas (assimilation), and attenuated blaming toward uncontrollable stigmas (contrast). Decades of research suggest that explanatory style regarding the self is a powerful predictor of self-functioning. We think it is likely that social explanatory styles--perhaps comprising interactive combinations of the basic dimensions tapped by the SESQ--will be similarly potent predictors of social functioning. We hope the SESQ will be a useful tool for exploring that possibility.


SimSensei Demonstration: A Perceptive Virtual Human Interviewer for Healthcare Applications

We present the SimSensei system, a fully automatic virtual agent that conducts interviews to assess indicators of psychological distress. We emphasize on the perception part of the system, a multimodal framework which captures and analyzes user state for both behavioral understanding and interactional purposes.


Speech Synthesis of Code-Mixed Text

Most Text to Speech (TTS) systems today assume that the input text is in a single language and is written in the same language that the text needs to be synthesized in. However, in bilingual and multilingual communities, code mixing or code switching occurs in speech, in which speakers switch between languages in the same utterance. Due to the popularity of social media, we now see code-mixing even in text in these multilingual communities. TTS systems capable of synthesizing such text need to be able to handle text that is written in multiple languages and scripts. Code-mixed text poses many challenges to TTS systems, such as language identification, spelling normalization and pronunciation modeling. In this work, we describe a preliminary framework for synthesizing code-mixed text. We carry out experiments on synthesizing code-mixed Hindi and English text. We find that there is a significant user preference for TTS systems that can correctly identify and pronounce words in different languages.


A framework for designing cloud forensic-enabled services (CFeS)

Cloud computing is used by consumers to access cloud services. Malicious actors exploit vulnerabilities of cloud services to attack consumers. The link between these two assumptions is the cloud service. Although cloud forensics assists in the direction of investigating and solving cloud-based cyber-crimes, in many cases the design and implementation of cloud services fall back. Software designers and engineers should focus their attention on the design and implementation of cloud services that can be investigated in a forensic sound manner. This paper presents a methodology that aims on assisting designers to design cloud forensic-enabled services. The methodology supports the design of cloud services by implementing a number of steps to make the services cloud forensic enabled. It consists of a set of cloud forensic constraints, a modeling language expressed through a conceptual model and a process based on the concepts identified and presented in the model. The main advantage of the proposed methodology is the correlation of cloud services’ characteristics with the cloud investigation while providing software engineers the ability to design and implement cloud forensic-enabled services via the use of a set of predefined forensic-related tasks.


Implementing a Personal Health Record Cloud Platform Using Ciphertext-Policy Attribute-Based Encryption

Work on designing and implementing a patient-centric, personal health record cloud platform based on open-source Indivo X system. We adopt cipher text-policy attribute-based encryption to provide privacy protection and fine-grained access control.


An ef fi cient and effective convolutional auto-encoder extreme learning machine network for 3 d feature learning

3D shape features play a crucial role in graphics applications, such as 3D shape matching, recognition, and retrieval. Various 3D shape descriptors have been developed over the last two decades; however, existing descriptors are handcrafted features that are labor-intensively designed and cannot extract discriminative information for a large set of data. In this paper, we propose a rapid 3D feature learning advantages of the convolutional neuron network, auto-encoder, and extreme learning machine (ELM). This method performs better and faster than other methods. In addition, we define a novel architecture based on CAE-ELM. The architecture accepts two types of 3D shape representation, namely, voxel data and signed distance field data (SDF), as inputs to extract the global and local features of 3D shapes. Voxel data describe structural information, whereas SDF data contain details on 3D shapes. Moreover, the proposed CAE-ELM can be used in practical graphics applications, such as 3D shape completion. Experiments show that the features extracted by CAE-ELM are superior to existing hand-crafted features and other deep learning methods or ELM models. Moreover, the classification accuracy of the proposed architecture is superior to that of other methods on ModelNet10 (91.4%) and ModelNet40 (84.35%). The training process also runs faster than existing deep learning methods by approximately two orders of magnitude. & 2015 Elsevier B.V. All rights reserved.


Benchmarking Neural Network Robustness to Common Corruptions and Surface Variations

In this paper we establish rigorous benchmarks for image classifier robustness. Our first benchmark, IMAGENET-C, standardizes and expands the corruption robustness topic, while showing which classifiers are preferable in safety-critical applications. Unlike recent robustness research, this benchmark evaluates performance on commonplace corruptions not worst-case adversarial corruptions. We find that there are negligible changes in relative corruption robustness from AlexNet to ResNet classifiers, and we discover ways to enhance corruption robustness. Then we propose a new dataset called ICONS-50 which opens research on a new kind of robustness, surface variation robustness. With this dataset we evaluate the frailty of classifiers on new styles of known objects and unexpected instances of known classes. We also demonstrate two methods that improve surface variation robustness. Together our benchmarks may aid future work toward networks that learn fundamental class structure and also robustly generalize.


Dual Policy Iteration

A novel class of Approximate Policy Iteration (API) algorithms have recently demonstrated impressive practical performance (e.g., ExIt [1], AlphaGo-Zero [2]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at test time, and a slow, non-reactive policy (e.g., Tree Search), that can plan multiple steps ahead. The reactive policy is updated under supervision from the non-reactive policy, while the non-reactive policy is improved via guidance from the reactive policy. In this work we study this class of Dual Policy Iteration (DPI) strategy in an alternating optimization framework and provide a convergence analysis that extends existing API theory. We also develop a special instance of this framework which reduces the update of non-reactive policies to model-based optimal control using learned local models, and provides a theoretically sound way of unifying model-free and model-based RL approaches with unknown dynamics. We demonstrate the efficacy of our approach on various continuous control Markov Decision Processes.


SCPNet: Spatial-Channel Parallelism Network for Joint Holistic and Partial Person Re-Identification

Holistic person re-identification (ReID) has received extensive study in the past few years and achieves impressive progress. However, persons are often occluded by obstacles or other persons in practical scenarios, which makes partial person re-identification non-trivial. In this paper, we propose a spatial-channel parallelism network (SCPNet) in which each channel in the ReID feature pays attention to a given spatial part of the body. The spatial-channel corresponding relationship supervises the network to learn discriminative feature for both holistic and partial person re-identification. The single model trained on four holistic ReID datasets achieves competitive accuracy on these four datasets, as well as outperforms the state-of-the-art methods on two partial ReID datasets without training.


Identifying prosumer's energy sharing behaviours for forming optimal prosumer-communities

Smart Grid (SG) achieves bidirectional energy and information flow between the energy user and the utility grid, allowing energy users not only to consume energy, but also to generate the energy and share with the utility grid or with other energy consumers. This type of energy user who consumes energy and who also can generate the energy is called the “prosumer”. The sustainability of the SG energy sharing process heavily depends on its participating prosumers, making prosumer participation and management schemes crucial within the energy sharing approaches. However in literature, there is very little attention on prosumer management schemes. The contribution of this article is twofold. First, this article introduces a novel concept of participating and managing the prosumers in the SG energy sharing process in the form of autonomous, intelligent goal-oriented virtual communities. Here, the community of prosumers can collectively increase the amount of power to be auctioned or bought offering higher bargaining power, thereby settling for a higher price per kilowatt in long-term. According to the literature, this research is the first of this type introducing a community approach for prosumer management. The initial step to build an effective prosumer-community is the identification of those prosumers who would be suitable to make efficient prosumer communities. This leads the necessity of identifying parameters that influence the energy sharing behaviours of prosumers. The second contribution of this article is that, this comprehensively analyzes the different parameters influencing the prosumer's energy sharing behaviours and thus presents multi-agent architecture for optimal prosumer-community formation.


Adaptive UKF-SLAM based on magnetic gradient inversion method for underwater navigation

Consider the two characteristics: (1) Simultaneous localization and mapping (SLAM) is a popular algorithm for autonomous underwater vehicle, but visual SLAM is significantly influenced by weak illumination. (2)Geomagnetism-aided navigation and gravity-aided navigation are equally important methods in the field of vehicle navigation, but both are affected heavily by time-varying noises and terrain fluctuations. However, magnetic gradient vector can avoid the influence of time-varying noises, and is less affected by terrain fluctuations. To this end, we propose an adaptive SLAM-based magnetic gradient aided navigation with the following advantages: (1) Adaptive SLAM is an efficient way to deal with uncertainty of the measurement model. (2) Magnetic gradient inversion equation is a good alternative to be used as measurement equation in visual SLAM-denied environment. Experimental results show that our proposed method is an effective solution, combining magnetic gradient information with SLAM.


Investigating episodes of mobile phone activity as indicators of opportune moments to deliver notifications

We investigate whether opportune moments to deliver notifications surface at the endings of episodes of mobile interaction (making voice calls or receiving SMS) based on the assumption that the endings collocate with naturally occurring breakpoint in the user's primary task. Testing this with a naturalistic experiment we find that interruptions (notifications) are attended to and dealt with significantly more quickly after a user has finished an episode of mobile interaction compared to a random baseline condition, supporting the potential utility of this notification strategy. We also find that the workload and situational appropriateness of the secondary interruption task significantly affect subsequent delay and completion rate of the tasks. In situ self-reports and interviews reveal complexities in the subjective experience of the interruption, which suggest that a more nuanced classification of the particular call or SMS and its relationship to the primary task(s) would be desirable.


Virtual reality and hand tracking system as a medical tool to evaluate patients with parkinson's

In this paper, we take advantage of the free hand interaction technology as a medical tool, either in rehabilitation centers or at home, that allows the evaluation of patients with Parkinson's. We have created a virtual reality scene to engage the patient to feel in an activity that can be found in daily life, and use the Leap Motion controller tracking to evaluate and classify the tremor in the hands. A sample of 33 patients diagnosed with Parkinson's disease (PD) participated in the study. Three tests were performed per patient, the first two to evaluate the amplitude of the postural tremor in each hand, and the third to measure the time to complete a specific task. Analysis shows that our tool can be used effectively to classify the stage of Parkinson's disease.


Neonatal Abstinence Syndrome and High School Performance.

BACKGROUND AND OBJECTIVES
Little is known of the long-term, including school, outcomes of children diagnosed with Neonatal abstinence syndrome (NAS) (International Statistical Classification of Disease and Related Problems [10th Edition], Australian Modification, P96.1).

METHODS
Linked analysis of health and curriculum-based test data for all children born in the state of New South Wales (NSW), Australia, between 2000 and 2006. Children with NAS (n = 2234) were compared with a control group matched for gestation, socioeconomic status, and gender (n = 4330, control) and with other NSW children (n = 598 265, population) for results on the National Assessment Program: Literacy and Numeracy, in grades 3, 5, and 7.

RESULTS
Mean test scores (range 0-1000) for children with NAS were significantly lower in grade 3 (359 vs control: 410 vs population: 421). The deficit was progressive. By grade 7, children with NAS scored lower than other children in grade 5. The risk of not meeting minimum standards was independently associated with NAS (adjusted odds ratio [aOR], 2.5; 95% confidence interval [CI], 2.2-2.7), indigenous status (aOR, 2.2; 95% CI, 2.2-2.3), male gender (aOR, 1.3; 95% CI, 1.3-1.4), and low parental education (aOR, 1.5; 95% CI, 1.1-1.6), with all Ps < .001.

CONCLUSIONS
A neonatal diagnostic code of NAS is strongly associated with poor and deteriorating school performance. Parental education may decrease the risk of failure. Children with NAS and their families must be identified early and provided with support to minimize the consequences of poor educational outcomes.


Programming challenges of chatbot: Current and future prospective

In the modern Era of technology, Chatbots is the next big thing in the era of conversational services. Chatbots is a virtual person who can effectively talk to any human being using interactive textual skills. Currently, there are many cloud base Chatbots services which are available for the development and improvement of the chatbot sector such as IBM Watson, Microsoft bot, AWS Lambda, Heroku and many others. A virtual person is based on machine learning and Artificial Intelligence (AI) concepts and due to dynamic nature, there is a drawback in the design and development of these chatbots as they have built-in AI, NLP, programming and conversion services. This paper gives an overview of cloud-based chatbots technologies along with programming of chatbots and challenges of programming in current and future Era of chatbot.


Model predictive control for dynamic footstep adjustment using the divergent component of motion

This paper presents an extension of previous model predictive control (MPC) schemes to the stabilization of the time-varying divergent component of motion (DCM). To address the control authority limitations caused by fixed footholds, the step positions and rotations are treated as control inputs, allowing the generation and execution of stable walking motions, both at high speeds and in the face of disturbances. Rotation approximations are handled by applying a mixed-integer program, which, when combined with the use of the time-varying DCM to account for the effects of height changes, improve the versatility of MPC. Simulation results of fast walking and step recovery with the ESCHER humanoid demonstrate the effectiveness of this approach.


Vaginal Labiaplasty: Defense of the Simple “Clip and Snip” and a New Classification System

Vaginal labiaplasty has become a more frequently performed procedure as a result of the publicity and education possible with the internet. Some of our patients have suffered in silence for years with large, protruding labia minora and the tissue above the clitoris that is disfiguring and uncomfortable and makes intercourse very difficult and painful. We propose four classes of labia protrusion based on size and location: Class 1 is normal, where the labia majora and minora are about equal. Class 2 is the protrusion of the minora beyond the majora. Class 3 includes a clitoral hood. Class 4 is where the large labia minora extends to the perineum. There are two principal means of reconstructing this area. Simple amputation may be possible for Class 2 and Class 4. Class 2 and Class 3 may be treated with a wedge resection and flap advancement that preserves the delicate free edge of the labia minora (Alter, Ann Plast Surg 40:287, 1988). Class 4 may require a combination of both amputation of the clitoral hood and/or perineal extensions and rotation flap advancement over the labia minora. This journal requires that authors assign a level of evidence to each article. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors www.springer.com/00266 .


Face Recognition: A Hybrid Neural Network Approach

Faces represent complex, multidimensional, meaningful visual stimuli an d developing a computational model for face recognition is difficult [42]. We present a hybrid neural network solution which compares favorably with other methods. The system combines local image sam pling, a self-organizing map neural network, and a convolutional neural network. The self-organizi ng map provides a quantization of the image samples into a topological space where inputs that are n e rby in the original space are also nearby in the output space, thereby providing dimensionality red uction and invariance to minor changes in the image sample, and the convolutional neural network prov ides for partial invariance to translation, rotation, scale, and deformation. The convolutional net work extracts successively larger features in a hierarchical set of layers. We present results using the Karhunen -Loève transform in place of the self-organizing map, and a multi-layer perceptron in place of the con volutional network. The Karhunen-Loève transform performs almost as well (5.3% error versus 3 .8%). The multi-layer perceptron performs very poorly (40% error versus 3.8%). The method is cap able of rapid classification, requires only fast, approximate normalization and preprocessing, and cons istently exhibits better classification performance than the eigenfaces approach [42] on the database consider ed as the number of images per person in the training database is varied from 1 to 5. With 5 imag es per person the proposed method and eigenfaces result in 3.8% and 10.5% error respectively. The recogni zer provides a measure of confidence in its output and classification error approaches zero when rejecting as few as 10% of the examples. We use a database of 400 images of 40 individuals which cont ains quite a high degree of variability in expression, pose, and facial details. We analyze computati onal complexity and discuss how new classes could be added to the trained recognizer.


Prevalence of chronic low back pain: systematic review

OBJECTIVE
To estimate worldwide prevalence of chronic low back pain according to age and sex.

METHODS
We consulted Medline (PubMed), LILACS and EMBASE electronic databases. The search strategy used the following descriptors and combinations: back pain, prevalence, musculoskeletal diseases, chronic musculoskeletal pain, rheumatic, low back pain, musculoskeletal disorders and chronic low back pain. We selected cross-sectional population-based or cohort studies that assessed chronic low back pain as an outcome. We also assessed the quality of the selected studies as well as the chronic low back pain prevalence according to age and sex.

RESULTS
The review included 28 studies. Based on our qualitative evaluation, around one third of the studies had low scores, mainly due to high non-response rates. Chronic low back pain prevalence was 4.2% in individuals aged between 24 and 39 years old and 19.6% in those aged between 20 and 59. Of nine studies with individuals aged 18 and above, six reported chronic low back pain between 3.9% and 10.2% and three, prevalence between 13.1% and 20.3%. In the Brazilian older population, chronic low back pain prevalence was 25.4%.

CONCLUSIONS
Chronic low back pain prevalence increases linearly from the third decade of life on, until the 60 years of age, being more prevalent in women. Methodological approaches aiming to reduce high heterogeneity in case definitions of chronic low back pain are essential to consistency and comparative analysis between studies. A standard chronic low back pain definition should include the precise description of the anatomical area, pain duration and limitation level.


The image of India as a Travel Destination and the attitude of viewers towards Indian TV Dramas

For a few decades now, various television stations in Indonesia have been broadcasting foreign drama series including those from a range of Asian countries, such Korea, India, Turkey, Thailand and the Philippines . This study aims to explore attitude towards Asian drama in those countries and the destination image of the country where the drama emanates from as perceived by the audiences. This study applied a mixed-methodology approach in order to explore particularly attitudes towards foreign television drama productions. There is a paucity of study exploring the attitudes of audiences towards Indian television dramas and a limited study focussing on the image of India as a preferred travel destination. Data was collected using an online instrument and participants were selected as a convenience sample. The attitude towards foreign television dramas was measured using items that were adapted from the qualitative study results, whereas for measuring destination image, an existing scale was employed. This study found that the attitudes of audiences towards Indian drama and their image of India had no dimension (one factor). The study also reported that attitude towards Indian dramas had a significant impact on the image of India as a travel destination and vice-versa. Recommendations for future study and tourism marketing are discussed.


Low Power High-Efficiency Shift Register Using Implicit Pulse-Triggered Flip-Flop in 130 nm CMOS Process for a Cryptographic RFID Tag

The shift register is a type of sequential logic circuit which is mostly used for storing digital data or the transferring of data in the form of binary numbers in radio frequency identification (RFID) applications to improve the security of the system. A power-efficient shift register utilizing a new flip-flop with an implicit pulse-triggered structure is presented in this article. The proposed flip-flop has features of high performance and low power. It is composed of a sampling circuit implemented by five transistors, a C-element for rise and fall paths, and a keeper stage. The speed is enhanced by executing four clocked transistors together with a transition condition technique. The simulation result confirms that the proposed topology consumes the lowest amounts of power of 30.1997 and 22.7071 nW for parallel in –parallel out (PIPO) and serial in –serial out (SISO) shift register respectively covering 22 μm2 chip area. The overall design consist of only 16 transistors and is simulated in 130 nm complementary-metal-oxide-semiconductor (CMOS) technology with a 1.2 V power supply.


Static and dynamic 3D facial expression recognition: A comprehensive survey

a r t i c l e i n f o Keywords: Facial behaviour analysis Facial expression recognition 3D facial surface 3D facial surface sequences (4D faces) Automatic facial expression recognition constitutes an active research field due to the latest advances in computing technology that make the user's experience a clear priority. The majority of work conducted in this area involves 2D imagery, despite the problems this presents due to inherent pose and illumination variations. In order to deal with these problems, 3D and 4D (dynamic 3D) recordings are increasingly used in expression analysis research. In this paper we survey the recent advances in 3D and 4D facial expression recognition. We discuss developments in 3D facial data acquisition and tracking, and present currently available 3D/4D face databases suitable for 3D/4D facial expressions analysis as well as the existing facial expression recognition systems that exploit either 3D or 4D data in detail. Finally, challenges that have to be addressed if 3D facial expression recognition systems are to become a part of future applications are extensively discussed. Automatic human behaviour understanding has attracted a great deal of interest over the past two decades, mainly because of its many applications spanning various fields such as psychology, computer technology , medicine and security. It can be regarded as the essence of next-generation computing systems as it plays a crucial role in affective computing technologies (i.e. proactive and affective user interfaces), learner-adaptive tutoring systems, patient-profiled personal wellbeing technologies, etc. [1]. Facial expression is the most cogent, naturally preeminent means for humans to communicate emotions, to clarify and give emphasis, to signal comprehension disagreement, to express intentions and, more generally, to regulate interactions with the environment and other people [2]. These facts highlight the importance of automatic facial behaviour analysis, including facial expression of emotion and facial action unit (AU) recognition, and justify the interest this research area has attracted, in the past twenty years [3,4]. Until recently, most of the available data sets of expressive faces were of limited size containing only deliberately posed affective displays, mainly of the prototypical expressions of six basic emotions (i.e. anger, disgust, fear, happiness, sadness and surprise), recorded under highly controlled conditions. Recent efforts focus on the recognition of complex and spontaneous emotional phenomena (e.g. boredom or lack of attention, frustration , stress, etc.) rather than on the recognition of deliberately displayed prototypical expressions of emotions [5,4,6,7]. However, most …


Steady-State VEP-Based Brain-Computer Interface Control in an Immersive 3D Gaming Environment

This paper presents the application of an effective EEG-based brain-computer interface design for binary control in a visually elaborate immersive 3D game. The BCI uses the steady-state visual evoked potential (SSVEP) generated in response to phasereversing checkerboard patterns. Two power-spectrum estimation methods were employed for feature extraction in a series of offline classification tests. Both methods were also implemented during real-time game play. The performance of the BCI was found to be robust to distracting visual stimulation in the game and relatively consistent across six subjects, with 41 of 48 games successfully completed. For the best performing feature extraction method, the average real-time control accuracy across subjects was 89%. The feasibility of obtaining reliable control in such a visually rich environment using SSVEPs is thus demonstrated and the impact of this result is discussed.


Brainport: an alternative input to the brain.

Brain Computer Interface (BCI) technology is one of the most rapidly developing areas of modern science; it has created numerous significant crossroads between Neuroscience and Computer Science. The goal of BCI technology is to provide a direct link between the human brain and a computerized environment. The objective of recent BCI approaches and applications have been designed to provide the information flow from the brain to the computerized periphery. The opposite or alternative direction of the flow of information (computer to brain interface, or CBI) remains almost undeveloped. The BrainPort is a CBI that offers a complementary technology designed to support a direct link from a computerized environment to the human brain - and to do so non-invasively. Currently, BrainPort research is pursuing two primary goals. One is the delivery of missing sensory information critical for normal human behavior through an additional artificial sensory channel around the damaged or malfunctioning natural sensory system. The other is to decrease the risk of sensory overload in human-machine interactions by providing a parallel and supplemental channel for information flow to the brain. In contrast, conventional CBI strategies (e.g., Virtual Reality), are usually designed to provide additional or substitution information through pre-existing sensory channels, and unintentionally aggravate the brain overload problem.


A general framework for brain-computer interface design

The Brain-Computer Interface (BCI) research community has acknowledged that researchers are experiencing difficulties when they try to compare the BCI techniques described in the literature. In response to this situation, the community has stressed the need for objective methods to compare BCI technologies. Suggested improvements have included the development and use of benchmark applications and standard data sets. However, as a young, multidisciplinary research field, the BCI community lacks a common vocabulary. As a result, this deficiency leads to poor intergroup communication, which hinders the development of the desired methods of comparison. One of the principle reasons for the lack of common vocabulary is the absence of a common functional model of a BCI System. This paper proposes a new functional model for BCI System design. The model supports many features that facilitate the comparison of BCI technologies with other BCI and non-BCI user interface technologies. From this model, taxonomy for BCI System design is developed. Together the model and taxonomy are considered a general framework for BCI System design. The representational power of the proposed framework was evaluated by applying it to a set of existing BCI technologies. The framework could effectively describe all of the BCI System designs tested.


The thought translation device (TTD) for completely paralyzed patients.

The thought translation device trains locked-in patients to self-regulate slow cortical potentials (SCP's) of their electroencephalogram (EEG). After operant learning of SCP self-control, patients select letters, words or pictograms in a computerized language support program. Results of five respirated, locked-in-patients are described, demonstrating the usefulness of the thought translation device as an alternative communication channel in motivated totally paralyzed patients with amyotrophic lateral sclerosis.


Brain-computer interfaces based on the steady-state visual-evoked response.

The Air Force Research Laboratory has implemented and evaluated two brain-computer interfaces (BCI's) that translate the steady-state visual evoked response into a control signal for operating a physical device or computer program. In one approach, operators self-regulate the brain response; the other approach uses multiple evoked responses.


The Struggle for District-based Health Information Systems in South Africa

This article describes the initial period (1994–2001) of an ongoing action research project to develop health information systems to support district management in South Africa. The reconstruction of the health sector in postapartheid South Africa striving for equity in health service delivery and building of a decentralized structure based on health districts. In terms of information systems (IS) development, this reform process translates into standardization of health data in ways that inscribe the goals of the new South Africa by enhancing local control and integration of information handling. We describe our approach to action research and use concepts from actor-network and structuration theories in analyzing the case material. In the detailed description and analysis of the process of IS development provided, we focus on the need to balance standardization and local  exibility (localization); standardization is thus seen as bottom-up alignment of an array of heterogeneous actors. Building on a social system model of information systems, we conceptualize the IS design strategy developed and used as the cultivation of processes whereby these actors are translating and aligning their interests. We develop a modular hierarchy of global and local datasets as a framework within which the tensions between standardization and localization may be understood and addressed. Finally, we discuss the possible relevance of the results of the research in other countries.


Dynamic Conditional Random Fields for Joint Sentence Boundary and Punctuation Prediction

The use of dynamic conditional random fields (DCRF) has been shown to outperform linear-chain conditional random fields (LCRF) for punctuation prediction on conversational speech texts [1]. In this paper, we combine lexical, prosodic, and modified n-gram score features into the DCRF framework for a joint sentence boundary and punctuation prediction task on TDT3 English broadcast news. We show that the joint prediction method outperforms the conventional two-stage method using LCRF or maximum entropy model (MaxEnt). We show the importance of various features using DCRF, LCRF, MaxEnt, and hidden-event n-gram model (HEN) respectively. In addition, we address the practical issue of feature explosion by introducing lexical pruning, which reduces model size and improves the F1-measure. We adopt incremental local training to overcome memory size limitation without incurring significant performance penalty. Our results show that adding prosodic and n-gram score features gives about 20% relative error reduction in all cases. Overall, DCRF gives the best accuracy, followed by LCRF, MaxEnt, and HEN.


Toward Understanding How Early-Life Stress Reprograms Cognitive and Emotional Brain Networks

Vulnerability to emotional disorders including depression derives from interactions between genes and environment, especially during sensitive developmental periods. Adverse early-life experiences provoke the release and modify the expression of several stress mediators and neurotransmitters within specific brain regions. The interaction of these mediators with developing neurons and neuronal networks may lead to long-lasting structural and functional alterations associated with cognitive and emotional consequences. Although a vast body of work has linked quantitative and qualitative aspects of stress to adolescent and adult outcomes, a number of questions are unclear. What distinguishes ‘normal’ from pathologic or toxic stress? How are the effects of stress transformed into structural and functional changes in individual neurons and neuronal networks? Which ones are affected? We review these questions in the context of established and emerging studies. We introduce a novel concept regarding the origin of toxic early-life stress, stating that it may derive from specific patterns of environmental signals, especially those derived from the mother or caretaker. Fragmented and unpredictable patterns of maternal care behaviors induce a profound chronic stress. The aberrant patterns and rhythms of early-life sensory input might also directly and adversely influence the maturation of cognitive and emotional brain circuits, in analogy to visual and auditory brain systems. Thus, unpredictable, stress-provoking early-life experiences may influence adolescent cognitive and emotional outcomes by disrupting the maturation of the underlying brain networks. Comprehensive approaches and multiple levels of analysis are required to probe the protean consequences of early-life adversity on the developing brain. These involve integrated human and animal-model studies, and approaches ranging from in vivo imaging to novel neuroanatomical, molecular, epigenomic, and computational methodologies. Because early-life adversity is a powerful determinant of subsequent vulnerabilities to emotional and cognitive pathologies, understanding the underlying processes will have profound implications for the world’s current and future children.


Mutations in EZH2 cause Weaver syndrome.

We used trio-based whole-exome sequencing to analyze two families affected by Weaver syndrome, including one of the original families reported in 1974. Filtering of rare variants in the affected probands against the parental variants identified two different de novo mutations in the enhancer of zeste homolog 2 (EZH2). Sanger sequencing of EZH2 in a third classically-affected proband identified a third de novo mutation in this gene. These data show that mutations in EZH2 cause Weaver syndrome.


CapStones and ZebraWidgets: sensing stacks of building blocks, dials and sliders on capacitive touch screens

Recent research proposes augmenting capacitive touch pads with tangible objects, enabling a new generation of mobile applications enhanced with tangible objects, such as game pieces and tangible controllers. In this paper, we extend the concept to capacitive tangibles consisting of multiple parts, such as stackable gaming pieces and tangible widgets with moving parts. We achieve this using a system of wires and connectors inside each block that causes the capacitance of the bottom-most block to reflect the entire assembly. We demonstrate three types of tangibles, called CapStones, Zebra Dials and Zebra Sliders that work with current consumer hardware and investigate what designs may become possible as touchscreen hardware evolves.


Sufficient Sample Sizes for Multilevel Modeling

An important problem in multilevel modeling is what constitutes a sufficient sample size for accurate estimation. In multilevel analysis, the major restriction is often the higher-level sample size. In this paper, a simulation study is used to determine the influence of different sample sizes at the group level on the accuracy of the estimates (regression coefficients and variances) and their standard errors. In addition, the influence of other factors, such as the lowest-level sample size and different variance distributions between the levels (different intraclass correlations), is examined. The results show that only a small sample size at level two (meaning a sample of 50 or less) leads to biased estimates of the second-level standard errors. In all of the other simulated conditions the estimates of the regression coefficients, the variance components, and the standard errors are unbiased and accurate.


How Many Trees in a Random Forest?

Random Forest is a computationally efficient technique that can operate quickly over large datasets. It has been used in many recent research projects and real-world applications in diverse domains. However, the associated literature provides almost no directions about how many trees should be used to compose a Random Forest. The research reported here analyzes whether there is an optimal number of trees within a Random Forest, i.e., a threshold from which increasing the number of trees would bring no significant performance gain, and would only increase the computational cost. Our main conclusions are: as the number of trees grows, it does not always mean the performance of the forest is significantly better than previous forests (fewer trees), and doubling the number of trees is worthless. It is also possible to state there is a threshold beyond which there is no significant gain, unless a huge computational environment is available. In addition, it was found an experimental relationship for the AUC gain when doubling the number of trees in any forest. Furthermore, as the number of trees grows, the full set of attributes tend to be used within a Random Forest, which may not be interesting in the biomedical domain. Additionally, datasets’ density-based metrics proposed here probably capture some aspects of the VC dimension on decision trees and low-density datasets may require large capacity machines whilst the opposite also seems to be true.


Security in IPv 6-enabled Wireless Sensor Networks : An Implementation of TLS / DTLS for the Contiki Operating System

During the last several years the advancements in technology made it possible for small sensor nodes to communicate wirelessly with the rest of the Internet. With this achievement the question of securing such IP-enabled Wireless Sensor Networks (IP-WSNs) emerged and has been an important research topic since. In this thesis we discuss our implementation of TLS and DTLS protocols using a pre-shared key cipher suite (TLS PSK WITH AES 128 CCM 8) for the Contiki operating system. Apart from simply adding a new protocol to the set of protocols supported by the Contiki OS, this project allows us to evaluate how suitable the transport-layer security and pre-shared key management schemes are for IP-WSNs.


Arbuscular mycorrhizal fungi in alleviation of salt stress: a review.

BACKGROUND
Salt stress has become a major threat to plant growth and productivity. Arbuscular mycorrhizal fungi colonize plant root systems and modulate plant growth in various ways.

SCOPE
This review addresses the significance of arbuscular mycorrhiza in alleviation of salt stress and their beneficial effects on plant growth and productivity. It also focuses on recent progress in unravelling biochemical, physiological and molecular mechanisms in mycorrhizal plants to alleviate salt stress.

CONCLUSIONS
The role of arbuscular mycorrhizal fungi in alleviating salt stress is well documented. This paper reviews the mechanisms arbuscular mycorrhizal fungi employ to enhance the salt tolerance of host plants such as enhanced nutrient acquisition (P, N, Mg and Ca), maintenance of the K(+) : Na(+) ratio, biochemical changes (accumulation of proline, betaines, polyamines, carbohydrates and antioxidants), physiological changes (photosynthetic efficiency, relative permeability, water status, abscissic acid accumulation, nodulation and nitrogen fixation), molecular changes (the expression of genes: PIP, Na(+)/H(+) antiporters, Lsnced, Lslea and LsP5CS) and ultra-structural changes. Theis review identifies certain lesser explored areas such as molecular and ultra-structural changes where further research is needed for better understanding of symbiosis with reference to salt stress for optimum usage of this technology in the field on a large scale. This review paper gives useful benchmark information for the development and prioritization of future research programmes.


Efficient Object Localization and Pose Estimation with 3D Wireframe Models

We propose a new and efficient method for 3D object localization and fine-grained 3D pose estimation from a single 2D image. Our approach follows the classical paradigm of matching a 3D model to the 2D observations. Our first contribution is a 3D object model composed of a set of 3D edge primitives learned from 2D object blueprints, which can be viewed as a 3D generalization of HOG features. This model is used to define a matching cost obtained by applying a rigid-body transformation to the 3D object model, projecting it onto the image plane, and matching the projected model to HOG features extracted from the input image. Our second contribution is a very efficient branch-and-bound algorithm for finding the 3D pose that maximizes the matching score. For this, 3D integral images of quantized HOGs are employed to evaluate in constant time the maximum attainable matching scores of individual model primitives. We applied our method to three different datasets of cars and achieved promising results with testing times as low as less than half a second.


Didier Dubey Suarez Medina Assessment of Web-based Information Security Awareness Courses

Information security awareness web-based courses are commonly recommended in cyber security strategies to help build a security culture capable of addressing information systems breaches caused by user mistakes whose negligence or ignorance of policies may endanger information systems assets. A research gap exists on the impact of Information Security Awareness Web-Based Courses: these are failing in changing to a significant degree the behavior of participants regarding compliance and diligence, which translates into continuous vulnerabilities. The aim of this work is to contribute with a theoretical and empirical analysis on the potential strengths and weaknesses of Information Security Awareness Web-Based Courses and with two practical tools readily applicable for designers and reviewers of web-based or mediatized courses on information security awareness and education. The research design seeks to respond two research questions. The first on the formulation of a minimum set of criteria that could be applied to Information Security Awareness Web-Based Courses, to support their real impact on employee’s diligence and compliance, resulting in eleven criteria for courses’ assessment and a checklist. The second, about a controlled experiment to explore the actual impact of an existing course, in respect to diligence and compliance using phishing emails as educational tools, that reaffirms the theoretical assumptions arrived to earlier. The development of minimum criteria and their systematic implementation pursue behavioral change, emphasizes the importance of disciplinary integration in cyber security research, and advocates for the development of a solid security culture of diligence and compliance, capable of supporting the protection of organizations from information system threats. The results gathered in this study suggest that achieving positive results in the existing information security tests that follow security awareness courses does not necessarily imply that diligence or information security policies compliance are affected. These preliminary findings accumulate evidence on the importance of implementing the recommendations formulated in this work.


An Analysis of Time-Dependent Planning

This paper presents a framework for exploring issues in time-dependent planning: planning in which the time available to respond to predicted events varies, and the decision making required to formulate effective responses is complex. Our analysis of time-dependent planning suggests an approach based on a class of algorithms that we call anytime algorithms. Anytime algorithms can be interrupted at any point during computation to return a result whose utility is a function of computation time. We explore methods for solving time-dependent planning problems based on the properties of anytime algorithms. Time-dependent planning is concerned with determining how best to respond to predicted events when the time available to make such determinations varies from situation to situation. In order to program a robot to react appropriately over a range of situations, we have to understand how to design effective algorithms for time-dependent planning. In this paper, we will be concerned primarily with understanding the properties of such algorithms, and providing a precise characterization of time-dependent planning. The issues we are concerned with arise either because the number of events that the robot has to contend with varies, and, hence, the time allotted to deliberating about any one event varies, or the observations that allow us to predict events precede the events they herald by varying amounts of time. The range of planning problems in which such complications occur is quite broad. Almost any situation that involves tracking objects of differing velocities will involve time-dependent planning (e.g., vehicle monitoring [Lesser and Corkill, 1983; Durfee, 19871, signal processing [Chung et al., 19871, and juggling [Donner and Jameson, 19861). S t t i ua ions where a system has to dynamically reevaluate its options [Fox and Smith, 1985; Dean, 19871 or delay committing to specific options until critical information arrives [Fox and Kempf, 19851 generally can be cast as time-dependent planning problems. To take a specific example, consider the problem faced by a stationary robot assigned the task of recognizing and intercepting or rerouting objects on a moving conveyor *This work was supported in part by the National Science Foundation under grant IRI-8612644 and by an IBM faculty development award. belt. Suppose that the robot’s view of the conveyor is obscured at some point by a partition, and that someone on the other side of this partition places objects on the conveyor at irregular intervals. The robot’s task requires that, between the time each object clears the partition and the time it reaches the end of the conveyor, it must classify the object and react appropriately. We assume that classification is computationally intensive, and that the longer the robot spends in analyzing an image, the more likely it is to make a correct classification. One can imagine a variety of reactions. The robot might simply have to push a button to direct each object into a bin intended for objects of a specific class; the time required for this sort of reaction is negligible. Alternatively, the robot might have to reach out and grasp certain objects and assemble them; the time required to react in this case will depend upon many factors. One can also imagine variations that exacerbate the timedependent aspects of the problem. For instance, it might take more time to classify certain objects, the number of objects placed on the conveyor might vary throughout the day, or the conveyor might speed up or slow down according to production demands. The important thing to note is, if the robot is to make optimal use of its time, it should be prepared to make decisions in situations where there is very little time to decide as well as to take advantage of situations where there is more than average time to decide. This places certain constraints on the design of the algorithms for performing classification, determining assembly sequences, and handling other inferential tasks. Traditional computer science concerns itself primarily with the complexity and correctness of algorithms. In most planning situations, however, there is no one correct answer, and having the right answer too late is tantamount to not having it at all. In dealing with potentially intractable problems, computer scientists are sometimes content with less than guaranteed solutions (e.g., answers that are likely correct and guaranteed computed in polynomial time (Monte Carlo algorithms), answers that are guaranteed correct and likely computed in polynomial time (Las Vegas algorithms), answers that are optimal within some factor and computed in polynomial time (approximation algorithms). While we regard this small concession to reality as encouraging, it doesn’t begin to address the problems in time-dependent planning. For many planning tasks, polynomial performance is not sufficient; we need algorithms that compute the best answers they can in the time they have available. Planning is concerned with reasoning about whether to act and how. Scheduling is concerned with reasoning about Dean and Boddy 49 From: AAAI-88 Proceedings. Copyright ©1988, AAAI (www.aaai.org). All rights reserved.


LSTM-CF: Unifying Context Modeling and Fusion with LSTMs for RGB-D Scene Labeling

Our model achieves the state-of-the-art performance on SUNRGBD, NYUdepth v2. It can be leveraged to improve the groundtruth annotations of newly captured 3943 RGB-D images in the SUNRGBD dataset. 2.2% improvement over previous state-of-the-art average accuracy and best on 15 categories Photometric data is vital for scene labeling while depth is an auxiliary information source. LSMT-CF model is important for fusing context features from different sources.