Diabetes management in the primary care setting: a comparison of physicians' performance by gender.

BACKGROUND
A major shift in the gender of the medical-doctor workforce is now underway, and all over the world it is expected that an average 65% of the medical workforce will be women by 2030. In addition, an aging population means that chronic diseases, such as diabetes, are becoming more prevalent and the demand for care is rising. There is growing evidence of female physicians performing better than male physicians.AimOur study aimed to investigate whether any differences in diabetes process indicators are associated with gender, and/or the interaction between gender and different organizational models.Design and settingA population-based cross-sectional analysis was conducted on a large data set obtained by processing the public health administration databases of seven Italian local health units (LHUs). The seven LHUs, distributed all over the Italian peninsula in seven different regions, took part in a national project called MEDINA, with the focus on chronic disease management in primary care (PC).

METHODS
A total score was calculated for the average performance in the previously listed five indicators, representing global adherence to a quality management of patients with diabetes. A multilevel analysis was applied to see how LHUs affected the outcome. A quantile regression model was also fitted.

RESULTS
Our study included 2287 Italian general practitioners (586 of them female) caring for a total of 2 646 059 patients. Analyzing the performance scores confirmed that female general practitioners obtained better results than males. The differences between males and females were stronger on the 25th and 75th percentiles of the score than on the median values. The interaction between gender and LHU was not significant.

CONCLUSION
Our study evidenced that female physicians perform better than males in providing PC for diabetes independently by the different organizational models. Further research to understand the reasons for these gender differences is needed.


Direct type-specific conic fitting and eigenvalue bias correction

A new method to fit specific types of conics to scattered data points is introduced. Direct, specific fitting of ellipses and hyperbolae is achieved by imposing a quadratic constraint on the conic coefficients, whereby an improved partitioning of the design matrix is devised so as to improve computational efficiency and numerical stability by eliminating redundant aspects of the fitting procedure. Fitting of parabolas is achieved by determining an orthogonal basis vector set in the Grassmannian space of the quadratic terms’ coefficients. The linear combination of the basis vectors that fulfills the parabolic condition and has a minimum residual norm is determined using Lagrange multipliers. This is the first known direct solution for parabola specific fitting. Furthermore, the inherent bias of a linear conic fit is addressed. We propose a linear method of correcting this bias, producing better geometric fits which are still constrained to specific conic type. 2007 Published by Elsevier B.V.


Articulatory feature-based pronunciation modeling

Spoken language, especially conversational speech, is characterized by great variability in word pronunciation, including many variants that differ grossly from dictionary prototypes. This is one factor in the poor performance of automatic speech recognizers on conversational speech, and it has been very difficult to mitigate in traditional phonebased approaches to speech recognition. An alternative approach, which has been studied by ourselves and others, is one based on sub-phonetic features rather than phones. In such an approach, a word’s pronunciation is represented as multiple streams of phonological features rather than a single stream of phones. Features may correspond to the positions of the speech articulators, such as the lips and tongue, or may be more abstract categories such as manner and place. This article reviews our work on a particular type of articulatory feature-based pronunciation model. The model allows for asynchrony between features, as well as per-feature substitutions, making it more natural to account for many pronunciation changes that are difficult to handle with phone-based models. Such models can be efficiently represented as dynamic Bayesian networks. The feature-based models improve significantly over phone-based counterparts in terms of frame perplexity and lexical access accuracy. The remainder of the article discusses related work and future directions.


Attacking an AES-Enabled NFC Tag: Implications from Design to a Real-World Scenario

Radio-frequency identification (RFID) technology is the enabler for applications like the future internet of things (IoT), where security plays an important role. When integrating security to RFID tags, not only the cryptographic algorithms need to be secure but also their implementation. In this work we present differential power analysis (DPA) and differential electromagnetic analysis (DEMA) attacks on a securityenabled RFID tag. The attacks are conducted on both an ASIC-chip version and on an FPGA-prototype version of the tag. The design of the ASIC version equals that of commercial RFID tags and has analog and digital part integrated on a single chip. Target of the attacks is an implementation of the Advanced Encryption Standard (AES) with 128-bit key length and DPA countermeasures. The countermeasures are shuffling of operations and insertion of dummy rounds. Our results illustrate that the effort for successfully attacking the ASIC chip in a real-world scenario is only 4.5 times higher than for the FPGA prototype in a laboratory environment. This let us come to the conclusion that the effort for attacking contactless devices like RFID tags is only slightly higher than that for contact-based devices. The results further underline that the design of countermeasures like the insertion of dummy rounds has to be done with great care, since the detection of patterns in power or electromagnetic traces can be used to significantly lower the attacking effort.


Building Program Vector Representations for Deep Learning

Deep learning has made significant breakthroughs in various fields of artificial intelligence. Advantages of deep learning include the ability to capture highly complicated features, weak involvement of human engineering, etc. However, it is still virtually impossible to use deep learning to analyze programs since deep architectures cannot be trained effectively with pure back propagation. In this pioneering paper, we propose the “coding criterion” to build program vector representations, which are the premise of deep learning for program analysis. Our representation learning approach directly makes deep learning a reality in this new field. We evaluate the learned vector representations both qualitatively and quantitatively. We conclude, based on the experiments, the coding criterion is successful in building program representations. To evaluate whether deep learning is beneficial for program analysis, we feed the representations to deep neural networks, and achieve higher accuracy in the program classification task than “shallow” methods, such as logistic regression and the support vector machine. This result confirms the feasibility of deep learning to analyze programs. It also gives primary evidence of its success in this new field. We believe deep learning will become an outstanding technique for program analysis in the near future.


A case against convexity in conceptual spaces

The notion of conceptual space, proposed by Gärdenfors as a framework for the representation of concepts and knowledge, has been highly influential over the last decade or so. One of the main theses involved in this approach is that the conceptual regions associated with properties, concepts, verbs, etc. are convex. The aim of this paper is to show that such a constraint—that of the convexity of the geometry of conceptual regions—is problematic; both from a theoretical perspective and with regard to the inner workings of the theory itself. On the one hand, all the arguments provided in favor of the convexity of conceptual regions rest on controversial assumptions. Additionally, his argument in support of a Euclidean metric, based on the integral character of conceptual dimensions, is weak, and under non-Euclidean metrics the structure of regions may be non-convex. Furthermore, even if the metric were Euclidean, the convexity constraint could be not satisfied if concepts were differentially weighted. On the other hand, Gärdenfors’ convexity constraint is brought into question by the own inner workings of conceptual spaces because: (i) some of the allegedly convex properties of concepts are not convex; (ii) the conceptual regions resulting from the combination of convex properties can be non-convex; (iii) convex regions may co-vary in non-convex ways; and (iv) his definition of verbs is incompatible with a definition of properties in terms of convex regions. Therefore, the mandatory character of the convexity requirement for regions in a conceptual space theory should be reconsidered.


Inductive Design of Maturity Models: Applying the Rasch Algorithm for Design Science Research

Maturity models are an established means to systematically document and guide the development of organizations using archetypal capability levels. Often, these models lack a sound foundation and/or are derived on the basis of an arbitrary design method. In order to foster the design of relevant and rigorous artifacts, this paper presents a method for maturity model construction that applies the Rasch algorithm and cluster analysis as a sound methodical foundation. The Rasch algorithm is widely used to improve scholarly intelligence and attainment tests. In order to demonstrate the application of the proposed method and to evaluate its usability and applicability, we present a design exemplar in the business intelligence domain.


Increased prefrontal and parietal activity after training of working memory

Working memory capacity has traditionally been thought to be constant. Recent studies, however, suggest that working memory can be improved by training. In this study, we have investigated the changes in brain activity that are induced by working memory training. Two experiments were carried out in which healthy, adult human subjects practiced working memory tasks for 5 weeks. Brain activity was measured with functional magnetic resonance imaging (fMRI) before, during and after training. After training, brain activity that was related to working memory increased in the middle frontal gyrus and superior and inferior parietal cortices. The changes in cortical activity could be evidence of training-induced plasticity in the neural systems that underlie working memory.


Aerial-Image Denoising Based on Convolutional Neural Network with Multi-Scale Residual Learning Approach

Aerial images are subject to various types of noise, which restricts the recognition and analysis of images, target monitoring, and search services. At present, deep learning is successful in image recognition. However, traditional convolutional neural networks (CNNs) extract the main features of an image to predict directly and are limited by the requirements of the training sample size (i.e., a small data size is not successful enough). In this paper, using a small sample size, we propose an aerial-image denoising recognition model based on CNNs with a multi-scale residual learning approach. The proposed model has the following three advantages: (1) Instead of directly learning latent clean images, the proposed model learns the noise from noisy images and then subtracts the learned residual from the noisy images to obtain reconstructed (denoised) images; (2) The developed image denoising recognition model is beneficial to small training datasets; (3) We use multi-scale residual learning as a learning approach, and dropout is introduced into the model architecture to force the network to learn to generalize well enough. Our experimental results on aerial-image denoising recognition reveal that the proposed approach is highly superior to the other state-of-the-art methods.


RECONCEPTUALISING GAMIFICATION : PLAY AND PEDAGOGY

Gamification is a complex and controversial concept. It has been both embraced as a marketing and education revolution, and dismissed as practice of exploitation. Contested within the debate around gamification has been the very concept of what a game is, what the core mechanics of games are, and whether gamification truly mobilises these core mechanics. This paper will challenge the foundation of this debate through reconceptualising gamification not as a simple set of techniques and mechanics, but as a pedagogic heritage, an alternative framework for training and shaping participant behaviour that has at its core the concepts of entertainment and engagement. In doing so it will recontextualise current practices of gamification into a longer and deeper history, and suggest potential pathways for more sophisticated gamification in the future.


Minimum Near-Convex Shape Decomposition.

Shape decomposition is a fundamental problem for part-based shape representation. We propose the Minimum Near-Convex Decomposition (MNCD) to decompose arbitrary shapes into minimum number of "near-convex" parts. The near-convex shape decomposition is formulated as a discrete optimization problem by minimizing the number of non-intersecting cuts. Two perception rules are imposed as constraints into our objective function to improve the visual naturalness of the decomposition. With the degree of near-convexity a user specified parameter, our decomposition is robust to local distortions and shape deformation. The optimization can be efficiently solved via Binary Integer Linear Programming. Both theoretical analysis and experiment results show that our approach outperforms the state-of-the-art results without introducing redundant parts, and thus leads to robust shape representation.


A 3-kW Wireless Power Transfer System for Sightseeing Car Supercapacitor Charge

Wireless power transfer (WPT) is the preferred charging method for electric vehicles (EVs) powered by battery and supercapacitor. In this paper, a novel WPT system with constant current charging capability for sightseeing car with supercapacitor storage is designed. First, an optimized magnetic coupler using ferrite cores and magnetic shielding structure is proposed to ensure stable power transfer and high efficiency. Compared with the traditional planar shape ferrite core coupler, the proposed magnetic coupler requires lesser ferrite material without degrading the performance of the WPT system. Second, the model of supercapacitor is applied to the WPT system and the relationship between equivalent load resistances of supercapacitor and charging time is analyzed in detail. Then, a Buck converter with proportional integral (PI) controller is implemented on the secondary side to maintain constant charging current for the variable load. Finally, the proposed design is verified by experiments. Constant charging current of 31.5 A across transfer distance of 15 cm is achieved. The peak transfer power and system efficiency are 2.86 kW and 88.05%, respectively.


Step Climbing Omnidirectional Mobile Robot with Passive Linkages

In this paper, we develop a holonomic omni-directional mobile vehicle with step-climbing ability. This system realizes omni-directional motion on flat floor using special wheels and passes over the step in forward or backward direction using the passive linkage mechanism. Our key ideas are the following topics. First topic is new omnidirectional mobile mechanism which consists of special wheels and passive linkage mechanism. Second topic is new passive linkage mechanism which can change its body configuration easily when the vehicle passes over the step. Third topic is wheel control reference derivation based on the body configuration, which changes passively during step climbing for reducing wheel slippage. Last topic is wheel control method which keeps the rotation velocity coordination among the wheels for reducing wheel slippage and increasing the step-climbing performance. We verified the effectiveness of our proposed method by the computer simulations and experiments. Utilizing our proposed mechanism and control systems, the vehicle has both omnidirectional mobility and step overcoming function. Furthermore, our developing vehicle can pass over the 128[mm] height step using the wheel which radius is 66[mm]. Its performance is three times larger than one of general wheeled vehicle.


Pay Attention to the Ending: Strong Neural Baselines for the ROC Story Cloze Task

We consider the ROC story cloze task (Mostafazadeh et al., 2016) and present several findings. We develop a model that uses hierarchical recurrent networks with attention to encode the sentences in the story and score candidate endings. By discarding the large training set and only training on the validation set, we achieve an accuracy of 74.7%. Even when we discard the story plots (sentences before the ending) and only train to choose the better of two endings, we can still reach 72.5%. We then analyze this “ending-only” task setting. We estimate human accuracy to be 78% and find several types of clues that lead to this high accuracy, including those related to sentiment, negation, and general ending likelihood regardless of the story context.


Convenient or Useful ? Consumer Adoption of Smartphones for Mobile Commerce

Merchants have developed apps for the smartphone that assist consumers through the buying process, from when they gather information to when they decide to purchase. Sharing information, such as location, shopping preferences and financial data, can enhance consumers’ experience. However, they may be reluctant to disclose these details unless they perceive that the benefits gained are more than the risk of privacy loss. This privacy calculus is added to the unified theory of acceptance and use of technology (UTAUT2) in order to explain consumers’ willingness to exchange the disclosure of personal information for additional value. Sharing information makes mobile commerce more convenient by saving time and effort. Companies are able to send offers that are tailored to a specific customer. Payments are processed faster because the merchant already has the financial data on hand. UTAUT2 is further extended with the Theory of Convenience. Results from a survey of over 300 consumers show that perceived value and perceived convenience are influencing variables and that perceived value mediates the influence of perceived convenience on intention to use.


DeepLogo: Hitting Logo Recognition with the Deep Neural Network Hammer

Recently, there has been a flurry of industrial activity around logo recognition, such as Ditto’s service for marketers to track their brands in user-generated images, and LogoGrab’s mobile app platform for logo recognition. However, relatively little academic or open-source logo recognition progress has been made in the last four years. Meanwhile, deep convolutional neural networks (DCNNs) have revolutionized a broad range of object recognition applications. In this work, we apply DCNNs to logo recognition. We propose several DCNN architectures, with which we surpass published state-of-art accuracy on a popular logo recognition dataset.


Hidden Markov Models for Speech Recognition

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


Procedural Generation of Roads

In this paper, we propose an automatic method for generating roads based on a weighted anisotropic shortest path algorithm. Given an input scene, we automatically create a path connecting an initial and a final point. The trajectory of the road minimizes a cost function that takes into account the different parameters of the scene including the slope of the terrain, natural obstacles such as rivers, lakes, mountains and forests. The road is generated by excavating the terrain along the path and instantiating generic parameterized models.


Arc-Length Parameterized Spline Curves for Real-Time Simulation

Parametric curves are frequently used in computer animation and virtual environments to control the movements of synthetic objects. In many of these applications it is essential to efficiently relate parameter values to the arc length of the curve. Current approaches to compute arc length or to construct an arc-length parameterized curve are impractical to use in real-time applications. This paper presents a simple and efficient technique to generate approximately arc-length parameterized spline curves that closely match spline curves typically used to model roads in high-fidelity driving simulators.


Congested traffic states in empirical observations and microscopic simulations

We present data from several German freeways showing different kinds of congested traffic forming near road inhomogeneities, specifically lane closings, intersections, or uphill gradients. The states are localized or extended, homogeneous or oscillating. Combined states are observed as well, like the coexistence of moving localized clusters and clusters pinned at road inhomogeneities, or regions of oscillating congested traffic upstream of nearly homogeneous congested traffic. The experimental findings are consistent with a recently proposed theoretical phase diagram for traffic near on-ramps [D. Helbing, A. Hennecke, and M. Treiber, Phys. Rev. Lett. 82, 4360 (1999)]. We simulate these situations with a continuous microscopic single-lane model, the "intelligent driver model," using empirical boundary conditions. All observations, including the coexistence of states, are qualitatively reproduced by describing inhomogeneities with local variations of one model parameter. We show that the results of the microscopic model can be understood by formulating the theoretical phase diagram for bottlenecks in a more general way. In particular, a local drop of the road capacity induced by parameter variations has essentially the same effect as an on-ramp.


Computing the arc length of parametric curves

Specifying constraints on motion is simpler if the curve is parameterized by arc length, but many parametric curves of practical interest cannot be parameterized by arc length. An approximate numerical reparameterization technique that improves on a previous algorithm by using a different numerical integration procedure that recursively subdivides the curve and creates a table of the subdivision points is presented. The use of the table greatly reduces the computation required for subsequent arc length calculations. After table construction, the algorithm takes nearly constant time for each arc length calculation. A linear increase in the number of control points can result in a more than linear increase in computation. Examples of this type of behavior are shown.<<ETX>>


Approximate Arc Length Parametrization

Current approaches to compute the arc length of a parametric curve rely on table lookup schemes. We present an approximate closed-form solution to the problem of computing an arc length parametrization for any given parametric curve. Our solution outputs a one or two-span Bézier curve which relates the length of the curve to the parametric variable. The main advantage of our approach is that we obtain a simple continuous function relating the length of the curve and the parametric variable. This allows the length to be easily computed given the parametric values. Tests with our algorithm on several thousand curves show that the maximum error in our approximation is 8.7% and that the average of maximum errors is 1.9%. Our algorithm is fast enough to compute the closed-form solution in a fraction of a second. After that a user can interactively get an approximation of the arc length for an arbitrary parameter value.


NIH Image to ImageJ: 25 years of image analysis

For the past 25 years NIH Image and ImageJ software have been pioneers as open tools for the analysis of scientific images. We discuss the origins, challenges and solutions of these two programs, and how their history can serve to advise and inform other software projects.


Graph Database Applications and Concepts with Neo4j

Graph databases (GDB) are now a viable alternative to Relational Database Systems (RDBMS). Chemistry, biology, semantic web, social networking and recommendation engines are all examples of applications that can be represented in a much more natural form. Comparisons will be drawn between relational database systems (Oracle, MySQL) and graph databases (Neo4J) focusing on aspects such as data structures, data model features and query facilities. Additionally, several of the inherent and contemporary limitations of current offerings comparing and contrasting graph vs. relational database implementations will be explored.


Fully Convolutional Networks for Semantic Segmentation

Convolutional networks are powerful visual models that yield hierarchies of features. We show that convolutional networks by themselves, trained end-to-end, pixels-to-pixels, improve on the previous best result in semantic segmentation. Our key insight is to build “fully convolutional” networks that take input of arbitrary size and produce correspondingly-sized output with efficient inference and learning. We define and detail the space of fully convolutional networks, explain their application to spatially dense prediction tasks, and draw connections to prior models. We adapt contemporary classification networks (AlexNet, the VGG net, and GoogLeNet) into fully convolutional networks and transfer their learned representations by fine-tuning to the segmentation task. We then define a skip architecture that combines semantic information from a deep, coarse layer with appearance information from a shallow, fine layer to produce accurate and detailed segmentations. Our fully convolutional networks achieve improved segmentation of PASCAL VOC (30% relative improvement to 67.2% mean IU on 2012), NYUDv2, SIFT Flow, and PASCAL-Context, while inference takes one tenth of a second for a typical image.


Computational Decomposition of Style for Controllable and Enhanced Style Transfer

Neural style transfer has been demonstrated to be powerful in creating artistic image with help of Convolutional Neural Networks (CNN). However, there is still lack of computational analysis of perceptual components of the artistic style. Different from some early attempts which studied the style by some pre-processing or post-processing techniques, we investigate the characteristics of the style systematically based on feature map produced by CNN. First, we computationally decompose the style into basic elements using not only spectrum based methods including Fast Fourier Transform (FFT), Discrete Cosine Transform (DCT) but also latent variable models such Principal Component Analysis (PCA), Independent Component Analysis (ICA). Then, the decomposition of style induces various ways of controlling the style elements which could be embedded as modules in state-of-the-art style transfer algorithms. Such decomposition of style brings several advantages. It enables the computational coding of different artistic styles by our style basis with similar styles clustering together, and thus it facilitates the mixing or intervention of styles based on the style basis from more than one styles so that compound style or new style could be generated to produce styled images. Experiments demonstrate the effectiveness of our method on not only painting style transfer but also sketch style transfer which indicates possible applications on picture-to-sketch problems.


A CMOS low-power low-offset and high-speed fully dynamic latched comparator

This paper presents a novel dynamic latched comparator that demonstrates lower offset voltage and higher load drivability than the conventional dynamic latched comparators. With two additional inverters inserted between the input- and output-stage of the conventional double-tail dynamic comparator, the gain preceding the regenerative latch stage is improved. The complementary version of the regenerative latch stage, which provides larger output drive current than the conventional one at a limited area, is implemented. The proposed circuit is designed using 90nm CMOS technology and 1V power supply voltage, and it demonstrates up to 19% less offset voltage and 62% less sensitivity of the delay to the input voltage difference (17ps/decade) than the conventional double-tail latched comparator at approximately the same area and power consumption.


A DYNAMIC FUZZY-COGNITIVE-MAP APPROACH BASED ON RANDOM NEURAL NETWORKS

A fuzzy cognitive map is a graphical means of representing arbitrarily complex models of interrelations between concepts. The purpose of this paper is to describe a dynamic fuzzy cognitive map based on the random neural network model. Previously, we have developed a random fuzzy cognitive map and illustrated its application in the modeling of processes. The adaptive fuzzy cognitive map changes its fuzzy causal web as causal patterns change and as experts update their causal knowledge. Our model carries out inferences via numerical calculation instead of symbolic deduction. We show how the dynamic random fuzzy cognitive map can reveal implications of models composed of dynamic processes. Copyright c ©2003 Yang’s Scientific Research Institute, LLC. All rights reserved.


Eclectic extraction of propositional rules from Neural Networks

Artificial Neural Network is among the most popular algorithm for supervised learning. However, Neural Networks have a well-known drawback of being a “Black Box” learner that is not comprehensible to the Users. This lack of transparency makes it unsuitable for many high risk tasks such as medical diagnosis that requires a rational justification for making a decision. Rule Extraction methods attempt to curb this limitation by extracting comprehensible rules from a trained Network. Many such extraction algorithms have been developed over the years with their respective strengths and weaknesses. They have been broadly categorized into three types based on their approach to use internal model of the Network. Eclectic Methods are hybrid algorithms that combine the other approaches to attain more performance. In this paper, we present an Eclectic method called HERETIC. Our algorithm uses Inductive Decision Tree learning combined with information of the neural network structure for extracting logical rules. Experiments and theoretical analysis show HERETIC to be better in terms of speed and performance.


High Efficiency AC – AC Power Electronic Converter Applied To Domestic Induction Heating

Induction heating is a well-known technique to produce very high temperature for applications. A large number of topologies have been developed in this area such as voltage and current source inverter. This project presents the analysis and design of a new ac–ac resonant converter applied to domestic induction heating. The proposed topology, based on the halfbridge series resonant inverter, uses only two diodes to rectify the mains voltage.The proposed converter can operate with zerovoltage switching during both switches-on and switch-off transitions. This topology doubles the output voltage, and therefore, the current in the load is reduced for the same output power. As a consequence, the converter efficiency is significantly improved.The output power is controlled using the PWM technique. This results in an increase of the net efficiency of the induction heating system. The circuit is simulated using MATLAB. The circuit is implemented using PIC controller. Both simulation and hardware results are compared.


Censoring Representations with an Adversary

In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying information. We address these two related issues by learning flexible representations that minimize the capability of an adversarial critic. This adversary is trying to predict the relevant sensitive variable from the representation, and so minimizing the performance of the adversary ensures there is little or no information in the representation about the sensitive variable. We demonstrate this adversarial approach on two problems: making decisions free from discrimination and removing private information from images. We formulate the adversarial model as a minimax problem, and optimize that minimax objective using a stochastic gradient alternate min-max optimizer. We demonstrate the ability to provide discriminant free representations for standard test problems, and compare with previous state of the art methods for fairness, showing statistically significant improvement across most cases. The flexibility of this method is shown via a novel problem: removing annotations from images, from separate training examples of annotated and unannotated images, and with no a priori knowledge of the form of annotation provided to the model.


EHRs Connect Research and Practice: Where Predictive Modeling, Artificial Intelligence, and Clinical Decision Support Intersect

Objectives: Electronic health records (EHRs) are only a first step in capturing and utilizing healthrelated data—the challenge is turning that data into useful information. Furthermore, EHRs are increasingly likely to include data relating to patient outcomes, functionality such as clinical decision support, and genetic information as well, and, as such, can be seen as repositories of increasingly valuable information about patients’ health conditions and responses to treatment over time. Methods: We describe a case study of 423 patients treated by Centerstone within Tennessee and Indiana in which we utilized electronic health record data to generate predictive algorithms of individual patient treatment response. Multiple models were constructed using predictor variables derived from clinical, financial and geographic data. Results: For the 423 patients, 101 deteriorated, 223 improved and in 99 there was no change in clinical condition. Based on modeling of various clinical indicators at baseline, the highest accuracy in predicting individual patient response ranged from 70% to 72% within the models tested. In terms of individual predictors, the Centerstone Assessment of Recovery Level—Adult (CARLA) baseline score was most significant in predicting outcome over time (odds ratio 4.1+2.27). Other variables with consistently significant impact on outcome included payer, diagnostic category, location and provision of case management services. Conclusions: This approach represents a promising avenue toward reducing the current gap between research and practice across healthcare, developing data-driven clinical decision support based on real-world populations, and serving as a component of embedded clinical artificial intelligences that ‘‘learn’’ over time. & 2012 Fellowship of Postgraduate Medicine. Published by Elsevier Ltd. All rights reserved. 2211-8837/$ see front matter & 2012 Fellowship of Postgraduate Medicine. Published by Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.hlpt.2012.03.001 Corresponding author at: Department of Informatics, Centerstone Research Institute, 365 South Park Ridge Road, Suite 103, Bloomington, IN 47401, United States. Tel.: +1 812 337 2302. E-mail addresses: Casey.Bennett@CenterstoneResearch.org (C.C. Bennett), Tom.Doub@CenterstoneResearch.org (T.W. Doub), RebeccaSelove@CenterstoneResearch.org (R. Selove). Health Policy and Technology (2012) 1, 105–114 Author's personal copy


Full-wave design of H-plane contiguous manifold output multiplexers using the fictitious reactive load concept

In this paper, a new procedure for the design of contiguous band manifold output multiplexers in H-plane configuration is presented. Such a configuration eliminates the slots between the T-junctions and the filters allowing high power handling, as well as dramatically reducing the risk of multipactor. This paper pursues the division of the design into tasks with low computational effort. The approach comprises: 1) the singly terminated synthesis of the channel filters and their corresponding full-wave responses; 2) the manifold design using fictitious reactive loads simulating the phase response of every channel out of its corresponding band; and 3) the final full-wave optimization of the whole structure using the simulated-annealing method. In order to validate the above procedure, a five-channel Ku-band multiplexer has been designed, manufactured, and measured.


Highly Parallel Genome-wide Expression Profiling of Individual Cells Using Nanoliter Droplets

Cells, the basic units of biological structure and function, vary broadly in type and state. Single-cell genomics can characterize cell identity and function, but limitations of ease and scale have prevented its broad application. Here we describe Drop-seq, a strategy for quickly profiling thousands of individual cells by separating them into nanoliter-sized aqueous droplets, associating a different barcode with each cell's RNAs, and sequencing them all together. Drop-seq analyzes mRNA transcripts from thousands of individual cells simultaneously while remembering transcripts' cell of origin. We analyzed transcriptomes from 44,808 mouse retinal cells and identified 39 transcriptionally distinct cell populations, creating a molecular atlas of gene expression for known retinal cell classes and novel candidate cell subtypes. Drop-seq will accelerate biological discovery by enabling routine transcriptional profiling at single-cell resolution. VIDEO ABSTRACT.


STRIP: A Defence Against Trojan Attacks on Deep Neural Networks

Recent trojan attacks on deep neural network (DNN) models are one insidious variant of data poisoning attacks. Trojan attacks exploit an effective backdoor created in a DNN model by leveraging the difficulty in interpretability of the learned model to misclassify any inputs signed with the attacker’s chosen trojan trigger input. Trojan attacks are easy to craft; survive even in adverse conditions such as different viewpoints, and lighting conditions on images; and threaten real world applications such as autonomous vehicles and robotics. The trojan trigger is a secret guarded and exploited by the attacker. Therefore, detecting such trojaned inputs is a challenge, especially at run-time when models are in active operation. We focus on vision systems and build the STRong Intentional Perturbation (STRIP) based run-time trojan attack detection system. We intentionally perturb the incoming input, for instance by superimposing various image patterns, and observe the randomness of the predicted classes for the perturbed inputs for a given model—malicious or benign—under deployment. A low entropy in the predicted classes violates the input-dependence property of a benign model and implies the presence of a malicious input—a characteristic of a trojaned input. The high efficacy of our method is validated through case studies on two popular and contrasting datasets: MNIST and CIFAR10. We achieve an overall false acceptance rate (FAR) of less than 1%, given a preset false rejection rate (FRR) of 1%, for four different tested trojan trigger types—three triggers are identified in previous attack works and one dedicated trigger is crafted by us to demonstrate the trigger-size insensitivity of the STRIP detection approach. In particular, on the dataset of natural images in CIFAR10, we have empirically achieved the desired result of 0% for both FRR and FAR.


Introduction to This is Watson


A formal ontological perspective on the behaviors and functions of technical artifacts

In this paper we present a formal characterization of the engineering concepts of behavior and function of technical artifacts. We capture the meanings that engineers attach to these concepts by formalizing, within the formal ontology DOLCE, the five meanings of artifact behavior and the two meanings of function that Chandrasekaran and Josephson identified in 2000 within the Functional Representation approach. We begin our formalization by reserving the term ‘behavior’ of a technical artifact as ‘the specific way in which the artifact occurs in an event.’ This general notion is characterized formally, and used to provide definitions of actual behaviors of artifacts, and the physically possible and physically impossible behaviors that rational agents believe that artifacts have. We also define several other notions, e.g., input and output behaviors of artifacts, and then show that these ontologically characterizedconcepts give a general framework in which Chandrasekaran and Josephson’s meanings of behavior can be explicitly formalized. Finally we show how Chandrasekaran and Josephson’s two meanings of artifact functions, namely, device-centric and environmental-centric functions, can be captured in DOLCE via the concepts of behavioral constraint and mode of deployment of an artifact. A more general goal of this work is to show that foundational ontologies are suited to the engineering domain: they can facilitate information sharing and exchange in the various engineering domains by providing concept structures and clarifications that make explicit and precise important engineering notions. The meanings of the terms ‘behavior’ and ‘function’ in domains like designing, redesigning, reverse engineering, product architecture, and engineering knowledge bases are often ambiguous or overloaded. Our results show that foundational ontologies can accommodate the variety of denotations these terms have and can explain their relationships.


THE DEVELOPMENT OF THE BALANCED SCORECARD AS A STRATEGIC MANAGEMENT TOOL

The Balanced Scorecard is a widely adopted performance management framework first described in the early 1990s. More recently it has been proposed as the basis for a ‘strategic management system’. This paper describes its evolution, recognising three distinct generations of Balanced Scorecard design. The paper relates the empirically driven developments in Balanced Scorecard thinking with literature concerning strategic management within organisations. It concludes that developments to date have been worthwhile, highlights potential areas for further refinement, and sets out some possible topics for future research into the field. The Balanced Scorecard and its development The Balanced Scorecard was first introduced in the early 1990s through the work of Robert Kaplan and David Norton of the Harvard Business School. Since then, the concept has become well known and its various forms widely adopted across the world (Rigby, 2001). By combining financial measures and non-financial measures in a single report, the Balanced Scorecard aims to provide managers with richer and more relevant information about activities they are managing than is provided by financial measures alone. To aid clarity and utility, Kaplan and Norton proposed that the number of measures on a Balanced Scorecard should also be constrained in number, and clustered into four groups (Kaplan and Norton, 1992, 1993). Beyond this, the original definition of Balanced Scorecard was sparse. But from the outset it was clear that the selection of measures, both in terms of filtering (organisations typically had access to many more measures than were needed to populate the Balanced Scorecard) and clustering (deciding which measures should appear in which perspectives) would be a key activity. Kaplan and Norton proposed that measure selection should focus on information relevant to the implementation of strategic plans, and that simple attitudinal questions be used to help determine the appropriate allocation of measures to perspectives (Kaplan and Norton, 1992). In essence the Balanced Scorecard has remained unchanged since these early papers, having at its core a limited number of measures clustered into groups, and an underlying strategic focus. But modern Balanced Scorecard designs also have a number of features that clearly differentiate them from earlier examples. This paper describes these changes as an evolution through three distinct ‘generations’ of Balanced Scorecard design. 1 Generation Balanced Scorecard Balanced Scorecard was initially described as a simple, “4 box” approach to performance measurement (Kaplan and Norton, 1992). In addition to financial measures, managers were encouraged to look at measures drawn from three other “perspectives” of the business: Learning and Growth; Internal Business Process; and Customer, chosen to represent the major stakeholders in a business (Mooraj et al, 1999). Definition of what comprised a Balanced Scorecard was sparse and focused on the high level structure of the device. Simple ‘causality’ between the four perspectives was illustrated but not used for specific purpose. Kaplan and Norton’s original paper’s focus was on the selection and reporting of a limited number of measures in each of the four perspectives (Kaplan and Norton, 1992). The paper suggested use of attitudinal questions relating to the vision and goals of the organisation to help in the selection of measures to be used, and also encouraged the consideration of ‘typical’ areas of interest in this process. Kaplan and Norton’s original work makes no specific observations concerning how the Balanced Scorecard might improve the performance of organisations; the implication is that the provision of accessible relevant measurement data itself will trigger improved organisational performance. However, they do imply that the source of these improvements is changes in behaviour: “It establishes goals but assumes that people will adopt whatever behaviours and take whatever actions are necessary to arrive at those goals”. In the light of this, the basis for selecting the goals represented by the Balanced Scorecard is of some importance. But in their first paper Kaplan and Norton say little about how a Balanced Scorecard could be developed in practice beyond a general assertion that design involved “putting vision and strategy at the centre of the measurement system” (1992). Later writing includes increasing amounts of proscription about development methods, concluding with a lengthy description of one such process in their first book on the subject published in 1996. Figure 1 – 1 Generation Balanced Scorecard Figure 1 shows a diagrammatic representation of Kaplan and Norton’s original Balanced Scorecard design. We will subsequently refer to this type of Balanced Scorecard design as a ‘1 Generation’ Balanced Scorecard. Key attributes of the design and suggested development process for this type of Balanced Scorecard are summarised in the table below. Practical Experiences with 1 Generation Balanced Scorecards The authors’ professional experience suggests that 1 Generation Balanced Scorecards are still being developed, and that they probably still form the large majority of Balanced Scorecard designs introduced into organisations. This is reflected in the literature, where books and articles that use more advanced representations of Balanced Scorecard are only recently appearing (Olve et al, 1999, Kaplan and Norton, 2000, Niven, 2002). But despite its huge popularity as a concept, and apparently widespread adoption, relatively few detailed case studies concerning Balanced Scorecard implementation experiences appear to exist in the academic literature. Those few that do focus primarily on the architecture of the Balanced Scorecard design (e.g. Butler et al, 1997), and associated organisational experiences (e.g. Ahn, 2001). Commercial / practitioner writing on Balanced Scorecard is more extensive (e.g. Schneiderman, 1999), but often more partisan (e.g. Lingle et al 1996). But in general the literature endorses the utility of the approach (Epstein et al, 1997) but notes weaknesses in the initial design proposition, and recommends improvements (e.g. Eagleson et al, 2000, Kennerley et al, 2000). 2 Generation Balanced Scorecard The practical difficulties associated with the design of 1 Generation Balanced Scorecards are significant, in part because the definition of a Balanced Scorecard was initially vague, allowing for considerable interpretation. Two significant areas of concern were filtering (the process of choosing specific measures to report), and clustering (deciding how to group measures into ‘perspectives’). Discussions relating to clustering continue to be rehearsed in the literature (e.g. Butler et al, 1997, Kennerley et al, 2000), but discussions relating to filtering are less common, and usually appear as part of descriptions of methods of Balanced Scorecard design (e.g. Kaplan and Norton, 1996, Olve et al, 1999). Perhaps the most significant early change translated the attitudinal approach to measure selection proposed initially be Kaplan and Norton (e.g. “To succeed financially, how should we appear to our shareholders?”) into a process that yielded a few appropriate key measures of performance in each perspective. A solution was the introduction of the concept of ‘strategic objectives’ (Kaplan and Norton, 1993). Initially these were represented as short sentences attached to the four perspectives, and were used to capture the essence of the organisation’s strategy material to each of the areas: measures were then selected that reflected achievement of these strategic objectives. Although subtle, this approach to measure selection quite different from that initially proposed, since strategic objectives were developed directly from strategy statements based on a corporate vision or a strategic plan. Another key development concerned causality. Causality between the perspectives had been introduced in early ‘1st Generation’ Balanced Scorecard thinking (see Figure 1). ‘2nd Generation’ Balanced Scorecard saw the idea of causality developed further. Instead of simply highlighting causal links between perspectives, internal documents from one consulting firm’s work in 1993 shows an early attempt to indicate linkages between the measures themselves. This improvement was also proposed later by others (Newing, 1995). Measure based linkages provided a richer model of causality than before, but presented conceptual problems – for example, the use of measures encouraged attempts to ‘prove’ the causality between measures using various forms of analysis (indeed this is still the case – e.g. Brewer, 2002). Collectively the changes in design described here represent a materially different definition of what comprises a Balanced Scorecard compared to Kaplan and Norton’s original work we will refer to Balanced Scorecards that incorporate these developments as ‘2 Generation Balanced Scorecards’. The impact of these changes were characterised by Kaplan and Norton in 1996 as enabling the Balanced Scorecard to evolve from “an improved measurement system to a core management system” (Kaplan and Norton 1996). Maintaining the focus that Balanced Scorecard was intended to support the management of strategic implementation, Kaplan and Norton further described the use of this development of the Balanced Scorecard as the central element of “a strategic management system”. One consequence of this change in emphasis was to increase the pressure on the design process to accurately reflect the organisation’s strategic goals. Over time the idea of strategic linkage became an increasingly important element of Balanced Scorecard design methodology, and in the mid 1990’s Balanced Scorecard documentation began to show graphically linkages between the strategic objectives themselves (rather than the measures) with causality linking across the perspectives toward key objectives re


An agent-based decision support system for wholesale electricity market

Application software has been developed for analyzing and understanding a dynamic price change in the US wholesale power market. Traders can use the software as an effective decision-making tool by modeling and simulating a power market. The software uses different features of a decision support system by creating a framework for assessing new trading strategies in a competitive electricity trading environment. The practicality of the software is confirmed by comparing its estimation accuracy with those of other methods (e.g., neural network and genetic algorithm). The software has been applied to a data set regarding the California electricity crisis in order to examine whether the learning (convergence) speed of traders is different between the two periods (before and during the crisis). Such an application confirms the validity of the proposed software. © 2007 Elsevier B.V. All rights reserved.


Tuning of PID controller using Ziegler-Nichols method for speed control of DC motor

In this paper, a weighted tuning methods of a PID speed controller for separately excited Direct current motor is presented, based on Empirical Ziegler-Nichols tuning formula and modified Ziegler-Nichol PID tuning formula. Both these methods are compared on the basis of output response, minimum settling time, and minimum overshoot for speed demand application of DC motor. Computer simulation shows that the performance of PID controller using Modified Ziegler-Nichols technique is better than that of traditional Ziegler-Nichols technique.


Comparative analysis of RADAR-IR sensor fusion methods for object detection

This paper presents the Radar and IR sensor fusion method for objection detection. The infrared camera parameter calibration with Levenberg-Marquardt (LM) optimization method is proposed based on the Radar ranging data represented by Cartesian coordinate compared with 6 fusion methods. The proposed method firstly performs the estimation of the intrinsic parameter matrix of infrared camera with some optical trick. Then the method searches the extrinsic parameters using the generative approach. The initial angle and translation of the extrinsic parameters are optimized by the LM method with the geometrical cost function. In the experiments, the performance of proposed method outperforms by a maximum 13 times the performance of the other baseline methods on the averaged Euclidian distance error. In future work, the angular noise of the Radar information will be improved and the proposed method will provide the effective proposals for the deep neural network.


Noise-Immune Embedded NAND-ROM Using a Dynamic Split Source-Line Scheme for VDDmin and Speed Improvements

Embedded NAND-type read-only-memory (NAND-ROM) provides large-capacity, high-reliability, on-chip non-volatile storage. However, NAND-ROM suffers from code-dependent read noises and cannot survive at low supply voltages (VDDs). These code-dependent read noises are primarily due to the charge-sharing effect, bitline leakage current, and crosstalk between bitlines, which become worse at lower VDD. This study proposes a dynamic split source-line (DSSL) scheme for NAND-ROM. The proposed scheme overcomes code-dependent read noises while improving the read access time and suppressing the active-mode gate leakage current, with only a 1% area penalty in the cell array. Experiments on a fabricated 256 Kb macro using a 90 nm industrial logic process demonstrate that the proposed DSSL scheme achieves 100% code-pattern coverage under a small sensing margin. Additionally, the DSSL NAND-ROM works with a wide range of supply voltages (1-0.31 V) with a 38%, 45.8%, and 37% improvement in speed, power, and standby current, respectively, at VDD = 1 V.


FlowQA: Grasping Flow in History for Conversational Machine Comprehension

Conversational machine comprehension requires a deep understanding of the conversation history. To enable traditional, single-turn models to encode the history comprehensively, we introduce FLOW, a mechanism that can incorporate intermediate representations generated during the process of answering previous questions, through an alternating parallel processing structure. Compared to shallow approaches that concatenate previous questions/answers as input, FLOW integrates the latent semantics of the conversation history more deeply. Our model, FLOWQA, shows superior performance on two recently proposed conversational challenges (+7.2% F1 on CoQA and +4.0% on QuAC). The effectiveness of FLOW also shows in other tasks. By reducing sequential instruction understanding to conversational machine comprehension, FLOWQA outperforms the best models on all three domains in SCONE, with +1.8% to +4.4% improvement in accuracy.


Not All Neural Embeddings are Born Equal

Neural language models learn word representations that capture rich linguistic and conceptual information. Here we investigate the embeddings learned by neural machine translation models. We show that translation-based embeddings outperform those learned by cutting-edge monolingual models at single-language tasks requiring knowledge of conceptual similarity and/or syntactic role. The findings suggest that, while monolingual models learn information about how concepts are related, neural-translation models better capture their true ontological status. It is well known that word representations can be learned from the distributional patterns in corpora. Originally, such representations were constructed by counting word co-occurrences, so that the features in one word’s representation corresponded to other words [11, 17]. Neural language models, an alternative means to learn word representations, use language data to optimise (latent) features with respect to a language modelling objective. The objective can be to predict either the next word given the initial words of a sentence [4, 14, 8], or simply a nearby word given a single cue word [13, 15]. The representations learned by neural models (sometimes called embeddings) generally outperform those acquired by co-occurrence counting models when applied to NLP tasks [3]. Despite these clear results, it is not well understood how the architecture of neural models affects the information encoded in their embeddings. Here, we explore this question by considering the embeddings learned by architectures with a very different objective function to monolingual language models: neural machine translation models. We show that translation-based embeddings outperform monolingual embeddings on two types of task: those that require knowledge of conceptual similarity (rather than simply association or relatedness), and those that require knowledge of syntactic role. We discuss what the findings indicate about the information content of different embeddings, and suggest how this content might emerge as a consequence of the translation objective. 1 Learning embeddings from language data Both neural language models and translation models learn real-valued embeddings (of specified dimension) for words in some pre-specified vocabulary, V , covering many or all words in their training corpus. At each training step, a ‘score’ for the current training example (or batch) is computed based on the embeddings in their current state. This score is compared to the model’s objective function, and the error is backpropagated to update both the model weights (affecting how the score is computed from the embeddings) and the embedding features. At the end of this process, the embeddings should encode information that enables the model to optimally satisfy its objective. 1.1 Monolingual models In the original neural language model [4] and subsequent variants [8], each training example consists of n subsequent words, of which the model is trained to predict the n-th word given the first n − 1 ar X iv :1 41 0. 07 18 v2 [ cs .C L ] 1 3 N ov 2 01 4 1 words. The model first represents the input as an ordered sequence of embeddings, which it transforms into a single fixed length ‘hidden’ representation by, e.g., concatenation and non-linear projection. Based on this representation, a probability distribution is computed over the vocabulary, from which the model can sample a guess at the next word. The model weights and embeddings are updated to maximise the probability of correct guesses for all sentences in the training corpus. More recent work has shown that high quality word embeddings can be learned via models with no nonlinear hidden layer [13, 15]. Given a single word in the corpus, these models simply predict which other words will occur nearby. For each word w in V , a list of training cases (w, c) : c ∈ V is extracted from the training corpus. For instance, in the skipgram approach [13], for each ‘cue word’ w the ‘context words’ c are sampled from windows either side of tokens of w in the corpus (with c more likely to be sampled if it occurs closer to w).1 For each w in V , the model initialises both a cue-embedding, representing the w when it occurs as a cue-word, and a context-embedding, used when w occurs as a context-word. For a cue word w, the model can use the corresponding cueembedding and all context-embeddings to compute a probability distribution over V that reflects the probability of a word occurring in the context of w. When a training example (w, c) is observed, the model updates both the cue-word embedding of w and the context-word embeddings in order to increase the conditional probability of c. 1.2 Translation-based embeddings Neural translation models generate an appropriate sentence in their target language St given a sentence Ss in their source language [see, e.g., 16, 6]. In doing so, they learn distinct sets of embeddings for the vocabularies Vs and Vt in the source and target languages respectively. Observing a training case (Ss, St), such a model represents Ss as an ordered sequence of embeddings of words from Vs. The sequence for Ss is then encoded into a single representation RS .2 Finally, by referencing the embeddings in Vt, RS and a representation of what has been generated thus far, the model decodes a sentence in the target language word by word. If at any stage the decoded word does not match the corresponding word in the training target St, the error is recorded. The weights and embeddings in the model, which together parameterise the encoding and decoding process, are updated based on the accumulated error once the sentence decoding is complete. Although neural translation models can differ in low-level architecture [7, 2], the translation objective exerts similar pressure on the embeddings in all cases. The source language embeddings must be such that the model can combine them to form single representations for ordered sequences of multiple words (which in turn must enable the decoding process). The target language embeddings must facilitate the process of decoding these representations into correct target-language sentences. 2 Comparing Mono-lingual and Translation-based Embeddings To learn translation-based embeddings, we trained both the RNN encoder-decoder [RNNenc, 7] and the RNN Search architectures [2] on a 300m word corpus of English-French sentence pairs. We conducted all experiments with the resulting (English) source embeddings from these models. For comparison, we trained a monolingual skipgram model [13] and its Glove variant [15] for the same number of epochs on the English half of the bilingual corpus. We also extracted embeddings from a full-sentence language model [CW, 8] trained for several months on a larger 1bn word corpus. As in previous studies [1, 5, 3], we evaluate embeddings by calculating pairwise (cosine) distances and correlating these distances with (gold-standard) human judgements. Table 1 shows the correlations of different model embeddings with three such gold-standard resources, WordSim-353 [1], MEN [5] and SimLex-999 [10]. Interestingly, translation embeddings perform best on SimLex-999, while the two sets of monolingual embeddings perform better on modelling the MEN and WordSim353. To interpret these results, it should be noted that SimLex-999 evaluation quantifies conceptual similarity (dog wolf ), whereas MEN and WordSim-353 (despite its name) quantify more general relatedness (dog collar) [10]. The results seem to indicate that translation-based embeddings better capture similarity, while monolingual embeddings better capture relatedness. 1 Subsequent variants use different algorithms for selecting the (w, c) from the training corpus [9, 12] Alternatively, subsequences (phrases) of Ss may be encoded at this stage in place of the whole sentence [2].


Entity Linking meets Word Sense Disambiguation: a Unified Approach

Entity Linking (EL) and Word Sense Disambiguation (WSD) both address the lexical ambiguity of language. But while the two tasks are pretty similar, they differ in a fundamental respect: in EL the textual mention can be linked to a named entity which may or may not contain the exact mention, while in WSD there is a perfect match between the word form (better, its lemma) and a suitable word sense. In this paper we present Babelfy, a unified graph-based approach to EL and WSD based on a loose identification of candidate meanings coupled with a densest subgraph heuristic which selects high-coherence semantic interpretations. Our experiments show state-of-the-art performances on both tasks on 6 different datasets, including a multilingual setting. Babelfy is online at http://babelfy.org


Align, Disambiguate and Walk: A Unified Approach for Measuring Semantic Similarity

Semantic similarity is an essential component of many Natural Language Processing applications. However, prior methods for computing semantic similarity often operate at different levels, e.g., single words or entire documents, which requires adapting the method for each data type. We present a unified approach to semantic similarity that operates at multiple levels, all the way from comparing word senses to comparing text documents. Our method leverages a common probabilistic representation over word senses in order to compare different types of linguistic data. This unified representation shows state-ofthe-art performance on three tasks: semantic textual similarity, word similarity, and word sense coarsening.


Cycling Down Under : A Comparative Analysis of Bicycling Trends and Policies in Sydney and Melbourne

The purpose of this paper is to document and explain differences in cycling between Australia’s two largest cities. Our comparative case study analysis is based on a wide range of statistical datasets, secondary reports, and interviews with a panel of 22 bicycling policy and planning experts. The main finding is that cycling levels in Melbourne are roughly twice as high as in Sydney and have been growing three times as fast in recent years. The difference is due to Melbourne’s more favorable topography, climate, and road network as well as more supportive public policies. In particular, Melbourne has more and better integrated cycling infrastructure as well as more extensive cycling programs, advocacy, and promotional events. Melbourne also benefits from safer cycling than Sydney, which suffers from a lack of traffic-protected cycling facilities and aggressive motorist behavior toward cyclists on the road. While cycling has been increasing in Australia, it remains at very low levels relative to northern Europe, where both land use and transport policies are far more supportive of bicycling while discouraging car use through numerous restrictions and financial disincentives.


An attack scenario and mitigation mechanism for enterprise BYOD environments

The recent proliferation of the Internet of Things (IoT) technology poses major security and privacy concerns. Specifically, the use of personal IoT devices, such as tablets, smartphones, and even smartwatches, as part of the Bring Your Own Device (BYOD) trend, may result in severe network security breaches in enterprise environments. Such devices increase the attack surface by weakening the digital perimeter of the enterprise network and opening new points of entry for malicious activities. In this paper we demonstrate a novel attack scenario in an enterprise environment by exploiting the smartwatch device of an innocent employee. Using a malicious application running on a suitable smartwatch, the device imitates a real Wi-Fi direct printer service in the network. Using this attack scenario, we illustrate how an advanced attacker located outside of the organization can leak/steal sensitive information from the organization by utilizing the compromised smartwatch as a means of attack. An attack mitigation process and countermeasures are suggested in order to limit the capability of the remote attacker to execute the attack on the network, thus minimizing the data leakage by the smartwatch.


Introduction to Algorithms, 3rd Edition


Impact of an augmented reality system on students' motivation for a visual art course


OTPaaS—One Time Password as a Service

Conventional password-based authentication is considered inadequate by users as many online services started to affect each other. Online credentials are used to recover other credentials and complex attacks are directed to the weakest one of many of these online credentials. As researchers are looking for new authentication techniques, one time passwords, which is a two-factor authentication scheme, looks like a natural enhancement over conventional username/password schemes. The manuscript places the OTP verifier to the cloud to ease adoption of its usage by cloud service providers. When the OTP verifier is placed on the cloud as a service, other cloud service providers could outsource their OTP deployments as well as cloud users could activate their respective account on the OTP provider on several cloud services. This enables them to use several cloud services without the difficulty of managing several OTP accounts for each cloud service. On the other hand, OTP service provision saves inexperienced small to medium enterprises from spending extra costs for OTP provisioning hardware, software, and employers. The paper outlines architecture to build a secure, privacy-friendly, and sound OTP provider in the cloud to outsource the second factor of authentication. Cloud user registration to OTP provider, service provider activation, and authentication phases are inspected. The security and privacy considerations of the proposed architecture are defined and analyzed. Attacks from outsiders, unlinkability properties of user profiles, attacks from curious service providers or OTP verifiers are mitigated within the given assumptions. The proposed solution, which locates the OTP provider in the cloud, is rendered robust and sound as a result of the analysis.


POLSAR Image Classification via Wishart-AE Model or Wishart-CAE Model

Neural network such as an autoencoder (AE) and a convolutional autoencoder (CAE) have been successfully applied in image feature extraction. For the statistical distribution of polarimetric synthetic aperture radar (POLSAR) data, we combine the Wishart distance measurement into the training process of the AE and the CAE. In this paper, a new type of AE and CAE is specially defined, which we name them Wishart-AE (WAE) and Wishart-CAE (WCAE). Furthermore, we connect the WAE or the WCAE with a softmax classifier to compose a classification model for the purpose of POLSAR image classification. Compared with AE and CAE models, WAE and WCAE models can achieve higher classification accuracy because they could obtain the classification features, which are more suitable for POLSAR data. What is more, the WCAE model utilizes the local spatial information of a POLSAR image when compared with the WAE model. A convolutional natural network (CNN), which also makes use of the spatial information, has been widely applied in image classification, but our WCAE model is time-saving than the CNN model. Given the above, our methods not only improve the classification performance but also save the experimental time. Experimental results on four POLSAR datasets also demonstrate that our proposed methods are significantly effective.


Comparison of database replication techniques based on total order broadcast

In this paper, we present a performance comparison of database replication techniques based on total order broadcast. While the performance of total order broadcast-based replication techniques has been studied in previous papers, this paper presents many new contributions. First, it compares with each other techniques that were presented and evaluated separately, usually by comparing them to a classical replication scheme like distributed locking. Second, the evaluation is done using a finer network model than previous studies. Third, the paper compares techniques that offer the same consistency criterion (one-copy serializability) in the same environment using the same settings. The paper shows that, while networking performance has little influence in a LAN setting, the cost of synchronizing replicas is quite high. Because of this, total order broadcast-based techniques are very promising as they minimize synchronization between replicas.


A printed 16 ports massive MIMO antenna system with directive port beams

The design of a massive multiple-input-multiple-output (mMIMO) antenna system based on patch antennas is presented in this paper. The array consists of 16 ports, each port consists of a 2×2 patch antenna array with different phase excitation at each element to tilt the beam toward different directions to provide lower correlation coefficient values. A fixed progressive phase feed network is designed to provide the beam tilts. The proposed antenna system is designed using a 3-layer FR4 substrate with total size of 33.33×33.33×0.16 cm3.


Social influence based clustering of heterogeneous information networks

Social networks continue to grow in size and the type of information hosted. We witness a growing interest in clustering a social network of people based on both their social relationships and their participations in activity based information networks. In this paper, we present a social influence based clustering framework for analyzing heterogeneous information networks with three unique features. First, we introduce a novel social influence based vertex similarity metric in terms of both self-influence similarity and co-influence similarity. We compute self-influence and co-influence based similarity based on social graph and its associated activity graphs and influence graphs respectively. Second, we compute the combined social influence based similarity between each pair of vertices by unifying the self-similarity and multiple co-influence similarity scores through a weight function with an iterative update method. Third, we design an iterative learning algorithm, SI-Cluster, to dynamically refine the K clusters by continuously quantifying and adjusting the weights on self-influence similarity and on multiple co-influence similarity scores towards the clustering convergence. To make SI-Cluster converge fast, we transformed a sophisticated nonlinear fractional programming problem of multiple weights into a straightforward nonlinear parametric programming problem of single variable. Our experiment results show that SI-Cluster not only achieves a better balance between self-influence and co-influence similarities but also scales extremely well for large graph clustering.


Unemployment alters the set point for life satisfaction.

According to set-point theories of subjective well-being, people react to events but then return to baseline levels of happiness and satisfaction over time. We tested this idea by examining reaction and adaptation to unemployment in a 15-year longitudinal study of more than 24,000 individuals living in Germany. In accordance with set-point theories, individuals reacted strongly to unemployment and then shifted back toward their baseline levels of life satisfaction. However, on average, individuals did not completely return to their former levels of satisfaction, even after they became reemployed. Furthermore, contrary to expectations from adaptation theories, people who had experienced unemployment in the past did not react any less negatively to a new bout of unemployment than did people who had not been previously unemployed. These results suggest that although life satisfaction is moderately stable over time, life events can have a strong influence on long-term levels of subjective well-being.


Towards an intelligent textbook: eye gaze based attention extraction on materials for learning and instruction in physics

In this paper, we propose the attention extraction method on a textbook of physics by using eye tracking glasses. We prepare a document including text and tasks in physics, and record reading behavior on the document from 6-grade students. The result confirms that students pay attention to a different region depending on situations (using the text as a material to learn the content, or using it as hints to solve tasks) and their comprehension.


A single-phase grid-connected PV converter with minimal DC-link capacitor and low-frequency ripple-free maximum power point tracking

This paper presents a novel single-phase grid-connected photovoltaic (PV) converter based on current-fed dual active bridge (CF-DAB) dc-dc converter. The proposed converter allows a minimal DC-link capacitor with large voltage variation without low-frequency effect on maximum power point tracking (MPPT). An advanced control system is developed based on the converter operation principles. Minimized transformer peak current is capable to be achieved through a symmetrical dc voltage control. Simulation results are presented to validate the performance of the proposed PV converter. A 5kW laboratorial prototype is also implemented and the results will be presented later.


DeepV2D: Video to Depth with Differentiable Structure from Motion

We propose DeepV2D, an end-to-end differentiable deep learning architecture for predicting depth from a video sequence. We incorporate elements of classical Structure from Motion into an end-to-end trainable pipeline by designing a set of differentiable geometric modules. Our full system alternates between predicting depth and refining camera pose. We estimate depth by building a cost volume over learned features and apply a multi-scale 3D convolutional network for stereo matching. The predicted depth is then sent to the motion module which performs iterative pose updates by mapping optical flow to a camera motion update. We evaluate our proposed system on NYU, KITTI, and SUN3D datasets and show improved results over monocular baselines and deep and classical stereo reconstruction.


Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle

This article introduces Periodically Controlled Hybrid Automata (PCHA) for modular specification of embedded control systems. In a PCHA, control actions that change the control input to the plant occur roughly periodically, while other actions that update the state of the controller may occur in the interim. Such actions could model, for example, sensor updates and information received from higher-level planning modules that change the set point of the controller. Based on periodicity and subtangential conditions, a new sufficient condition for verifying invariant properties of PCHAs is presented. For PCHAs with polynomial continuous vector fields, it is possible to check these conditions automatically using, for example, quantifier elimination or sum of squares decomposition. We examine the feasibility of this automatic approach on a small example. The proposed technique is also used to manually verify safety and progress properties of a fairly complex planner-controller subsystem of an autonomous ground vehicle. Geometric properties of planner-generated paths are derived which guarantee that such paths can be safely followed by the controller.


Prediction of Student Academic Performance by an Application of K-Means Clustering Algorithm

Data Clustering is used to extract meaningful information and to develop significant relationships among variables stored in large data set/data warehouse. In this paper data clustering technique named k-means clustering is applied to analyze student’s learning behavior. The student’s evaluation factor like class quizzes, mid and final exam assignment are studied. It is recommended that all these correlated information should be conveyed to the class advisor before the conduction of final exam. This study will help the teachers to reduce the drop out ratio to a significant level and improve the performance of students.


Scalable Realistic Rendering with Many-Light Methods

Recent years have seen increasing attention and significant progress in many-light rendering, a class of methods for the efficient computation of global illumination. The many-light formulation offers a unified mathematical framework for the problem reducing the full lighting transport simulation to the calculation of the direct illumination from many virtual light sources. These methods are unrivaled in their scalability: they are able to produce artifact-free images in a fraction of a second but also converge to the full solution over time. In this state-of-the-art report, we have three goals: give an easy-to-follow, introductory tutorial of many-light theory; provide a comprehensive, unified survey of the topic with a comparison of the main algorithms; and present a vision to motivate and guide future research. We will cover both the fundamental concepts as well as improvements, extensions, and applications of many-light rendering.


Accelerated training of conditional random fields with stochastic gradient methods

We apply Stochastic Meta-Descent (SMD), a stochastic gradient optimization method with gain vector adaptation, to the training of Conditional Random Fields (CRFs). On several large data sets, the resulting optimizer converges to the same quality of solution over an order of magnitude faster than limited-memory BFGS, the leading method reported to date. We report results for both exact and inexact inference techniques.


HURRICANE TRAJECTORY PREDICTION VIA A SPARSE RECURRENT NEURAL NETWORK

A proposed sparse recurrent neural network with flexible topology is used for trajectory prediction of the Atlantic hurricanes. For prediction of the future trajectories of a target hurricane, the most similar hurricanes to the target hurricane are found by comparing directions of the hurricanes. Then, the first and second differences of their positions over their life time are used for training the proposed network. Comparison of the obtained predictions with actual trajectories of Sandy and Humberto hurricanes show that our approach is quite promising for this aim.


Mindful consumption : a customer-centric approach to sustainability

How effectively business deals with the challenges of sustainability will define its success for decades to come. Current sustainability strategies have three major deficiencies: they do not directly focus on the customer, they do not recognize the looming threats from rising global over-consumption, and they do not take a holistic approach. We present a framework for a customer-centric approach to sustainability. This approach recasts the sustainability metric to emphasize the outcomes of business actions measured holistically in term of environmental, personal and economic well-being of the consumer. We introduce the concept of mindful consumption (MC) as the guiding principle in this approach. MC is premised on a consumer mindset of caring for self, for community, and for nature, that translates behaviorally into tempering the selfdefeating excesses associated with acquisitive, repetitive and aspirational consumption. We also make the business case for fostering mindful consumption, and illustrate how the marketing function can be harnessed to successfully implement the customer-centric approach to sustainability.


Quality-biased ranking for queries with commercial intent

Modern search engines are good enough to answer popular commercial queries with mainly highly relevant documents. However, our experiments show that users behavior on such relevant commercial sites may differ from one to another web-site with the same relevance label. Thus search engines face the challenge of ranking results that are equally relevant from the perspective of the traditional relevance grading approach. To solve this problem we propose to consider additional facets of relevance, such as trustability, usability, design quality and the quality of service. In order to let a ranking algorithm take these facets in account, we proposed a number of features, capturing the quality of a web page along the proposed dimensions. We aggregated new facets into the single label, commercial relevance, that represents cumulative quality of the site. We extrapolated commercial relevance labels for the entire learning-to-rank dataset and used weighted sum of commercial and topical relevance instead of default relevance labels. For evaluating our method we created new DCG-like metrics and conducted off-line evaluation as well as on-line interleaving experiments demonstrating that a ranking algorithm taking the proposed facets of relevance into account is better aligned with user preferences.


Scalable Graph Exploration on Multicore Processors

Many important problems in computational sciences, social network analysis, security, and business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In this paper we investigate the challenges involved in exploring very large graphs by designing a breadth-first search (BFS) algorithm for advanced multi-core processors that are likely to become the building blocks of future exascale systems. Our new methodology for large-scale graph analytics combines a highlevel algorithmic design that captures the machine-independent aspects, to guarantee portability with performance to future processors, with an implementation that embeds processorspecific optimizations. We present an experimental study that uses state-of-the-art Intel Nehalem EP and EX processors and up to 64 threads in a single system. Our performance on several benchmark problems representative of the power-law graphs found in real-world problems reaches processing rates that are competitive with supercomputing results in the recent literature. In the experimental evaluation we prove that our graph exploration algorithm running on a 4-socket Nehalem EX is (1) 2.4 times faster than a Cray XMT with 128 processors when exploring a random graph with 64 million vertices and 512 millions edges, (2) capable of processing 550 million edges per second with an R-MAT graph with 200 million vertices and 1 billion edges, comparable to the performance of a similar graph on a Cray MTA-2 with 40 processors and (3) 5 times faster than 256 BlueGene/L processors on a graph with average degree 50.


Thirteen Ways to Look at the Correlation Coefficient

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


Unicorn: A System for Searching the Social Graph

Unicorn is an online, in-memory social graph-aware indexing system designed to search trillions of edges between tens of billions of users and entities on thousands of commodity servers. Unicorn is based on standard concepts in information retrieval, but it includes features to promote results with good social proximity. It also supports queries that require multiple round-trips to leaves in order to retrieve objects that are more than one edge away from source nodes. Unicorn is designed to answer billions of queries per day at latencies in the hundreds of milliseconds, and it serves as an infrastructural building block for Facebook’s Graph Search product. In this paper, we describe the data model and query language supported by Unicorn. We also describe its evolution as it became the primary backend for Facebook’s search offerings.


The anatomy of a large-scale social search engine

We present Aardvark, a social search engine. With Aardvark, users ask a question, either by instant message, email, web input, text message, or voice. Aardvark then routes the question to the person in the user's extended social network most likely to be able to answer that question. As compared to a traditional web search engine, where the challenge lies in finding the right document to satisfy a user's information need, the challenge in a social search engine like Aardvark lies in finding the right person to satisfy a user's information need. Further, while trust in a traditional search engine is based on authority, in a social search engine like Aardvark, trust is based on intimacy. We describe how these considerations inform the architecture, algorithms, and user interface of Aardvark, and how they are reflected in the behavior of Aardvark users.


Bidirectional Expansion For Keyword Search on Graph Databases

Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on such graphs has received much attention lately. A central problem in this scenario is to efficiently extract from the data graph a small number of the “best” answer trees. A Backward Expanding search, starting at nodes matching keywords and working up toward confluent roots, is commonly used for predominantly text-driven queries. But it can perform poorly if some keywords match many nodes, or some node has very large degree. In this paper we propose a new search algorithm, Bidirectional Search, which improves on Backward Expanding search by allowing forward search from potential roots towards leaves. To exploit this flexibility, we devise a novel search frontier prioritization technique based on spreading activation. We present a performance study on real data, establishing that Bidirectional Search significantly outperforms Backward Expanding search.


A comparative study of game mechanics and control laws for an adaptive physiological game

We present an adaptive biofeedback game that aims to maintain the player’s arousal by modifying game difficulty in response to the player’s physiological state, as measured with wearable sensors. Our approach models the interaction between human physiology and game difficulty during gameplay as a control problem, where game difficulty is the system input and player arousal its output. We validate the approach on a car-racing game with real-time adaptive game mechanics. Specifically, we use (1) car speed, road visibility, and steering jitter as three mechanisms to manipulate game difficulty, (2) electrodermal activity as physiological correlate of arousal, and (3) two types of control law: proportional (P) control, and proportional-integral-derivative (PID) control. We also propose quantitative measures to characterize the effectiveness of these game adaptations and controllers in manipulating the player’s arousal. Experimental trials with 25 subjects in both open-loop (no feedback) and closed-loop (negative feedback) conditions show statistically significant differences in effectiveness among the three game mechanics and also between the two control laws. Specifically, manipulating car speed provides higher control of arousal levels than changing road visibility or vehicle steering. Our results also confirm that PID control leads to lower error and reduced oscillations in the closed-loop response compared to proportional-only control. Finally, we discuss the theoretical and practical implications of our approach.


A summary-statistic representation in peripheral vision explains visual crowding.

Peripheral vision provides a less faithful representation of the visual input than foveal vision. Nonetheless, we can gain a lot of information about the world from our peripheral vision, for example in order to plan eye movements. The phenomenon of crowding shows that the reduction of information available in the periphery is not merely the result of reduced resolution. Crowding refers to visual phenomena in which identification of a target stimulus is significantly impaired by the presence of nearby stimuli, or flankers. What information is available in the periphery? We propose that the visual system locally represents peripheral stimuli by the joint statistics of responses of cells sensitive to different position, phase, orientation, and scale. This "textural" representation by summary statistics predicts the subjective "jumble" of features often associated with crowding. We show that the difficulty of performing an identification task within a single pooling region using this representation of the stimuli is correlated with peripheral identification performance under conditions of crowding. Furthermore, for a simple stimulus with no flankers, this representation can be adequate to specify the stimulus with some position invariance. This provides evidence that a unified neuronal mechanism may underlie peripheral vision, ordinary pattern recognition in central vision, and texture perception. A key component of our methodology involves creating visualizations of the information available in the summary statistics of a stimulus. We call these visualizations "mongrels" and show that they are highly useful in examining how the early visual system represents the visual input. Mongrels enable one to study the "equivalence classes" of our model, i.e., the sets of stimuli that map to the same representation according to the model.


Enhancing SDN security for IoT-related deployments through blockchain

The majority of business activity of our integrated and connected world takes place in networks based on cloud computing infrastructure that cross national, geographic and jurisdictional boundaries. Such an efficient entity interconnection is made possible through an emerging networking paradigm, Software Defined Networking (SDN) that intends to vastly simplify policy enforcement and network reconfiguration in a dynamic manner. However, despite the obvious advantages this novel networking paradigm introduces, its increased attack surface compared to traditional networking deployments proved to be a thorny issue that creates skepticism when safety-critical applications are considered. Especially when SDN is used to support Internet-of-Things (IoT)-related networking elements, additional security concerns rise, due to the elevated vulnerability of such deployments to specific types of attacks and the necessity of inter-cloud communication any IoT application would require. The overall number of connected nodes makes the efficient monitoring of all entities a real challenge, that must be tackled to prevent system degradation and service outage. This position paper provides an overview of common security issues of SDN when linked to IoT clouds, describes the design principals of the recently introduced Blockchain paradigm and advocates the reasons that render Blockchain as a significant security factor for solutions where SDN and IoT are involved.


Measuring Negative and Positive Thoughts in Children: An Adaptation of the Children’s Automatic Thoughts Scale (CATS)

The aim of this study is to describe the factor structure and psychometric properties of an extended version of the Children’s Automatic Thoughts Scale (CATS), the CATS-Negative/Positive (CATS-N/P). The CATS was originally designed to assess negative self-statements in children and adolescents. However, positive thoughts also play a major role in childhood disorders such as anxiety and depression. Therefore, positive self-statements were added to the CATS. The CATS-N/P was administered to a community sample of 554 children aged 8–18 years. The results of a confirmatory factor analysis revealed that the positive self-statements formed a separate and psychometrically sound factor. Internal and short-term test–retest reliability was good. Boys reported more hostile and positive thoughts than girls; and younger children reported more negative thoughts concerning physical threat, social threat, and failure than older children. In conclusion, the results of the current study support the use of the CATS-N/P for the measurement of positive and negative thoughts in children. The application of the CATS-N/P can facilitate further research on cognitive factors in different childhood disorders.


MODIFIED MULTILOOK CROSS CORRELATION ( MLCC ) ALGORITHM FOR DOPPLER CENTROID ESTIMATION IN SYNTHETIC APERTURE RADAR SIGNAL PROCESS -

The Multilook Cross Correlation (MLCC) is one of the most reliable algorithms used for Doppler ambiguity number estimation of the Doppler centroid parameter. However, the existing MLCC algorithm is only suitable for low contrast scenes. In high contrast scenes, the estimated result is not reliable, and the error is unacceptable. Besides, the Doppler centroid estimation processing time is long and can only be used in offline processing. In this paper, we introduce a modified MLCC algorithm that has better sensitivity which is suitable not only for low contrast scenes, but also for high contrast scenes. In addition, the modified MLCC algorithm can be implemented on parallel signal processing units for better time efficiency. Experiments with RADARSAT-1 data show that the modified algorithm works well in both high and low contrast scenes.


Author ' s personal copy A new hybrid arti fi cial neural networks for rainfall – runoff process modeling

This paper proposes a hybrid intelligent model for runoff prediction. The proposed model is a combination of data preprocessing methods, genetic algorithms and levenberg–marquardt (LM) algorithm for learning feed forward neural networks. Actually it evolves neural network initial weights for tuning with LM algorithm by using genetic algorithm. We also use data pre-processing methods such as data transformation, input variables selection and data clustering for improving the accuracy of the model. The capability of the proposed method is tested by applying it to predict runoff at the Aghchai watershed. The results show that this approach is able to predict runoff more accurately than Artificial Neural Network (ANN) and Adaptive Neuro Fuzzy Inference System (ANFIS) models. & 2013 Elsevier B.V. All rights reserved.