Scalable Similarity Search With Topology Preserving Hashing

Hashing-based similarity search techniques is becoming increasingly popular in large data sets. To capture meaningful neighbors, the topology of a data set, which represents the neighborhood relationships between its subregions and the relative proximities between the neighbors of each subregion, e.g., the relative neighborhood ranking of each subregion, should be exploited. However, most existing hashing methods are developed to preserve neighborhood relationships while ignoring the relative neighborhood proximities. Moreover, most hashing methods lack in providing a good result ranking, since there are often lots of results sharing the same Hamming distance to a query. In this paper, we propose a novel hashing method to solve these two issues jointly. The proposed method is referred to as topology preserving hashing (TPH). TPH is distinct from prior works by also preserving the neighborhood ranking. Based on this framework, we present three different TPH methods, including linear unsupervised TPH, semisupervised TPH, and kernelized TPH. Particularly, our unsupervised TPH is capable of mining semantic relationship between unlabeled data without supervised information. Extensive experiments on four large data sets demonstrate the superior performances of the proposed methods over several state-of-the-art unsupervised and semisupervised hashing techniques.


LNSC: A Security Model for Electric Vehicle and Charging Pile Management Based on Blockchain Ecosystem

The Internet of Energy (IoE) provides an effective networking technology for distributed green energy, which allows the connection of energy anywhere at any time. As an important part of the IoE, electric vehicles (EVs), and charging pile management are of great significance to the development of the IoE industry. Previous work has mainly focused on network performance optimization for its management, and few studies have considered the security of the management between EVs and charging piles. Therefore, this paper proposes a decentralized security model based on the lightning network and smart contract in the blockchain ecosystem; this proposed model is called the lightning network and smart contract (LNSC). The overall model involves registration, scheduling, authentication, and charging phases. The new proposed security model can be easily integrated with current scheduling mechanisms to enhance the security of trading between EVs and charging piles. Experimental results according to a realistic infrastructure are presented in this paper. These experimental results demonstrate that our scheme can effectively enhance vehicle security. Different performances of LNSC-based scheduling strategies are also presented.


Round-Robin Arbiter Design and Generation

In this paper, we introduce a Round-robin Arbiter Generator (RAG) tool. The RAG tool can generate a design for a Bus Arbiter (BA). The BA is able to handle the exact number of bus masters for both on-chip and off-chip buses. RAG can also generate a distributed and parallel hierarchical Switch Arbiter (SA). The first contribution of this paper is the automated generation of a round-robin token passing BA to reduce time spent on arbiter design. The generated arbiter is fair, fast, and has a low and predictable worst-case wait time. The second contribution of this paper is the design and integration of a distributed fast arbiter, e.g., for a terabit switch, based on 2x2 and 4x4 switch arbiters (SAs). Using a .25µ TSMC standard cell library from LEDA Systems [10, 14], we show the arbitration time of a 256x256 SA for a terabit switch and demonstrate that the SA generated by RAG meets the time constraint to achieve approximately six terabits of throughput in a typical network switch design. Furthermore, our generated SA performs better than the Ping-Pong Arbiter and Programmable Priority Encoder by a factor of 1.9X and 2.4X, respectively.


Extending the Coverage of DBpedia Properties using Distant Supervision over Wikipedia

DBpedia is a Semantic Web project aiming to extract structured data from Wikipedia articles. Due to the increasing number of resources linked to it, DBpedia plays a central role in the Linked Open Data community. Currently, the information contained in DBpedia is mainly collected from Wikipedia infoboxes, a set of subject-attribute-value triples that represents a summary of the Wikipedia page. These infoboxes are manually compiled by the Wikipedia contributors, and in more than 50% of the Wikipedia articles the infobox is missing. In this article, we use the distant supervision paradigm to extract the missing information directly from the Wikipedia article, using a Relation Extraction tool trained on the information already present in DBpedia. We evaluate our system on a data set consisting of seven DBpedia properties, demonstrating the suitability of the approach in extending the DBpedia coverage.


Online Tourism Communities on the Path to Web 2.0: An Evaluation

In recent years a technological and sociological paradigm shift has taken place in the Internet that is often referred to as Web 2.0. Companies and individuals have started to adapt existing Web sites to the new standards and principles and created new types of Web services and communities. The tourism domain is no exception to this trend new tourism communities emerged and long-established ones integrated new features to keep up with this trend. In this paper we are evaluating eight tourism communities with respect to Web 2.0. Each community is evaluated based on a criteria catalogue that draws ideas from online community studies. The findings are discussed in the context of the tourist life cycle that is structured in a pre-trip, on-site and after-trip phase. The value for the traveller is highlighted for each phase and potential problems are discussed.


Wideband Circularly Polarized Patch Antennas on Reactive Impedance Substrates

A reduced-size wideband single-feed circularly polarized patch antenna is introduced for telemetry applications in S-band around 2300 MHz. The proposed structure consists of a slot-loaded patch antenna printed over an optimized metamaterial-inspired reactive impedance substrate (RIS). We demonstrate, step by step, the main role of each antenna element by comparing numerically and experimentally the performance of various antenna configurations: antenna over a single- or dual-layer substrate, standard patch or slot-loaded patch, antenna with or without RIS. The final optimized structure exhibits an axial-ratio bandwidth of about 15% and an impedance bandwidth better than 11%, which is much wider than the conventional printed antenna on the same materials.


Magnetic Field Analysis of Halbach Permanent Magnetic Synchronous Machine

A numerical study of PMSM based on finite element method for estimating the airgap magnetic field distribution considering stator slots effect is presented both for traditional radial magnet structure and Halbach magnet array topology. Magnetic field, flux, torque and the induction in the air gap are presented. The two machines structures performances were compared which put in view the modifications brought by these structures.. According to numerical calculations, and harmonic analysis, the PMSM with Halbach magnet array provides a higher torque and better performance than the classical radial PMSM.


Rice quality analysis using image processing techniques

In agricultural industries grain quality evaluation is very big challenge. Quality control is very important in food industry because after harvesting, based on quality parameters food products are classified and graded into different grades. Grain quality evaluation is done manually but it is relative, time consuming, may be varying results and costly. To overcome these limitations and shortcoming image processing techniques is the alternative solution can be used for grain quality analysis. Rice quality is nothing but the combination of physical and chemical characteristics. Grain size and shape, chalkiness, whiteness, milling degree, bulk density and moisture content are some physical characteristics while amylose content, gelatinization temperature and gel consistency are chemical characteristics of rice. The paper presents a solution of grading and evaluation of rice grains on the basis of grain size and shape using image processing techniques. Specifically edge detection algorithm is used to find out the region of boundaries of each grain. In this technique we find the endpoints of each grain and after using caliper we can measure the length and breadth of rice. This method requires minimum time and it is low in cost.


The British Industrial Revolution in Global Perspective

THE INDUSTRIAL REVOLUTION was a turning point in the history of the world and inaugurated two centuries of economic growth that have resulted in the high incomes enjoyed in developed countries today.1 Technological progress is the motor of economic growth, and the Industrial Revolution is defi ned by famous technological breakthroughs: machinery to spin and weave cotton, the use of coal to smelt and refi ne iron, and the steam engine.2 In the words of the schoolboy made famous by T. S. Ashton: ‘About 1760 a wave of gadgets swept over England’ (Ashton 1955: 42). The questions for today’s lecture are: How can we explain the technological breakthroughs of the Industrial Revolution? And, why did the Industrial Revolution happen in Britain, rather than France, the Netherlands, or China? These questions will be answered by developing these themes: in comparison with other countries, Britain had an unusual structure of wages and prices in the eighteenth century, and this structure of wages and prices was a major factor in explaining why the revolution happened in Britain. In addition Britain had an effective ‘innovation system’ based on a high


Stanley: The robot that won the DARPA Grand Challenge

Sebastian Thrun1, Mike Montemerlo1, Hendrik Dahlkamp1, David Stavens1, Andrei Aron1, James Diebel1, Philip Fong1, John Gale1, Morgan Halpenny1, Gabriel Hoffmann1, Kenny Lau1, Celia Oakley1, Mark Palatucci1, Vaughan Pratt1, Pascal Stang1, Sven Strohband2, Cedric Dupont2, Lars-Erik Jendrossek2, Christian Koelen2, Charles Markey2, Carlo Rummel2, Joe van Niekerk2, Eric Jensen2, Philippe Alessandrini2, Gary Bradski3, Bob Davies3, Scott Ettinger3, Adrian Kaehler3, Ara Nefian3, and Pamela Mahoney4


Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces

Real-time robot motion planning using rasterizing computer graphics hardware. In Proc. OY82] C. O'D unlaing and C.K. Yap. A retraction method for planning the motion of a disc. A local approach for path planning of manipulators with a high number of degrees of freedom. a path generation algorithm into oo-line programming of airbus panels. Motion planning for many degrees of freedom-random reeections at c-space obstacles. REFERENCES 31 iterative collision checker. We observed no dramatic slowdown of the planner. A challenging research goal would now be to extend the method to dynamic scenes. One rst question is: How should a roadmap computed for a given workspace be updated if a few obstacles are removed or added? Answering this question would be useful to apply our method to scenes subject to small incremental changes. Such changes occur in many manufacturing (e.g., assembly) cells; while most of the geometry of such a cell is permanent and stationary, a few objects (e.g., xtures) are added or removed between any two consecutive manufacturing operations. Similar incremental changes also occur in automatic graphic animation. A second question is: How should the learning and query phase be modiied if some obstacles are moving along known trajectories? An answer to this question might consist of applying our roadmap method in the conngurationtime space of the robot Lat91]. The roadmap would then have to be built as a directed graph, since local paths between any two nodes must monotonically progress along the time axis, with possibly additional constraints on their slope and curvature to reeect bounds on the robot's velocity and acceleration. A motion planner with performance proportional to task diiculty. 30 In KL94a, KL94b, O S94] prior versions of the method have been applied to a great variety of holonomic robots including planar and spatial articulated robots with revolute, prismatic, and/or spherical joints, xed or free base, and single or multiple kinematic chains. In Sve93, SO94] a variation of the method (essentially one with a diierent general local planner) was also run successfully on examples involving nonholonomic car-like robots. Experimental results show that our method can eeciently solve problems which are beyond the capabilities of other existing methods. For example, for planar articulated robots with many dofs, the customized implementation of Section 5 is much more consistent than the Randomized Path Planner (RPP) of BL91]. Indeed, the latter can be very fast on some diicult problems, but it …


Mushroom immunomodulators: unique molecules with unlimited applications.

For centuries, mushrooms have been used as food and medicine in different cultures. More recently, many bioactive compounds have been isolated from different types of mushrooms. Among these, immunomodulators have gained much interest based on the increasing growth of the immunotherapy sector. Mushroom immunomodulators are classified under four categories based on their chemical nature as: lectins, terpenoids, proteins, and polysaccharides. These compounds are produced naturally in mushrooms cultivated in greenhouses. For effective industrial production, cultivation is carried out in submerged culture to increase the bioactive compound yield, decrease the production time, and reduce the cost of downstream processing. This review provides a comprehensive overview on mushroom immunomodulators in terms of chemistry, industrial production, and applications in medical and nonmedical sectors.


One Road to Turnover: An Examination of Work Exhaustion in Technology Professionals

The concept of work exhaustion (or job burnout) from the management and psychology research literature is examined in the context of technology professionals. Data were collected from 270 IT professionals and managers in various industries across the United States. Through structural equation modeling, work exhaustion was shown to partially mediate the effects of workplace factors on turnover intention. In addition, the results of the study revealed that: (1) technology professionals experiencing higher levels of exhaustion reported higher intentions to leave the job and, (2) of the variables expected to influence exhaustion (work overload, role ambiguity and conflict, lack of autonomy and lack of rewards), work overload was the strongest contributor to exhaustion in the technology workers. Moreover, exhausted IT professionals identified insufficient staff and resources as a primary cause of work overload and exhaustion. Implications for practice and future research are discussed.


Reranking and Self-Training for Parser Adaptation

Statistical parsers trained and tested on the Penn Wall Street Journal (WSJ) treebank have shown vast improvements over the last 10 years. Much of this improvement, however, is based upon an ever-increasing number of features to be trained on (typically) the WSJ treebank data. This has led to concern that such parsers may be too finely tuned to this corpus at the expense of portability to other genres. Such worries have merit. The standard “Charniak parser” checks in at a labeled precisionrecall f -measure of 89.7% on the Penn WSJ test set, but only 82.9% on the test set from the Brown treebank corpus. This paper should allay these fears. In particular, we show that the reranking parser described in Charniak and Johnson (2005) improves performance of the parser on Brown to 85.2%. Furthermore, use of the self-training techniques described in (McClosky et al., 2006) raise this to 87.8% (an error reduction of 28%) again without any use of labeled Brown data. This is remarkable since training the parser and reranker on labeled Brown data achieves only 88.4%.


Social network, social trust and shared goals in organizational knowledge sharing

The aim of our study was to further develop an understanding of social capital in organizationalknowledge-sharing. We first developed a measurement tool and then a theoretical framework in which three social capital factors (social network, social trust, and shared goals) were combined with the theory of reasoned action; their relationships were then examined using confirmatory factoring analysis. We then surveyed of 190 managers from Hong Kong firms, we confirm that a social network and shared goals significantly contributed to a person’s volition to share knowledge, and directly contributed to the perceived social pressure of the organization. The social trust has however showed no direct effect on the attitude and subjective norm of sharing knowledge. 2008 Elsevier B.V. All rights reserved. * Corresponding author. Tel.: +852 3411 7582; fax: +852 3411 5585. E-mail addresses: vwschow@hkbu.edu.hk (W.S. Chow), sherry.ls.chan@gmail.com (L.S. Chan).


Leader Efficacy Linking Leadership to Student Learning : The Contributions of


Learning A Task-Specific Deep Architecture For Clustering

While sparse coding-based clustering methods have shown to be successful, their bottlenecks in both efficiency and scalability limit the practical usage. In recent years, deep learning has been proved to be a highly effective, efficient and scalable feature learning tool. In this paper, we propose to emulate the sparse coding-based clustering pipeline in the context of deep learning, leading to a carefully crafted deep model benefiting from both. A feed-forward network structure, named TAGnet, is constructed based on a graphregularized sparse coding algorithm. It is then trained with taskspecific loss functions from end to end. We discover that connecting deep learning to sparse coding benefits not only the model performance, but also its initialization and interpretation. Moreover, by introducing auxiliary clustering tasks to the intermediate feature hierarchy, we formulate DTAGnet and obtain a further performance boost. Extensive experiments demonstrate that the proposed model gains remarkable margins over several state-of-the-art methods.


Vision based fire detection

Vision based fire detection is potentially a useful technique. With the increase in the number of surveillance cameras being installed, a vision based fire detection capability can be incorporated in existing surveillance systems at relatively low additional cost. Vision based fire detection offers advantages over the traditional methods. It will thus complement the existing devices. In this paper, we present spectral, spatial and temporal models of fire regions in visual image sequences. The spectral model is represented in terms of the color probability density of fire pixels. The spatial model captures the spatial structure within a fire region. The shape of a fire region is represented in terms of the spatial frequency content of the region contour using its Fourier coefficients. The temporal changes in these coefficients are used as the temporal signatures of the fire region. Specifically, an auto regressive model of the Fourier coefficient series is used. Experiments with a large number of scenes show that our method is capable of detecting fire reliably.


The role of violent media preference in cumulative developmental risk for violence and general aggression.

The impact of exposure to violence in the media on the long-term development and short-term expression of aggressive behavior has been well documented. However, gaps in this literature remain, and in particular the role of violent media exposure in shaping violent and other serious antisocial behavior has not been investigated. Further, studies of violent media effects typically have not sampled from populations with confirmed histories of violent and/or nonviolent antisocial behavior. In this study, we analyzed data on 820 youth, including 390 juvenile delinquents and 430 high school students, to examine the relation of violent media use to involvement in violence and general aggression. Using criterion scores developed through cross-informant modeling of data from self, parent/guardian, and teacher/staff reports, we observed that childhood and adolescent violent media preferences contributed significantly to the prediction of violence and general aggression from cumulative risk totals. Findings represent a new and important direction for research on the role of violent media use in the broader matrix of risk factors for youth violence.


Towards Building a SentiWordNet for Tamil

Sentiment analysis is a discipline of Natural Language Processing which deals with analysing the subjectivity of the data. It is an important task with both commercial and academic functionality. Languages like English have several resources which assist in the task of sentiment analysis. SentiWordNet for English is one such important lexical resource that contains subjective polarity for each lexical item. With growing data in native vernacular, there is a need for language-specific SentiWordNet(s). In this paper, we discuss a generic approach followed for the development of a Tamil SentiWordNet using currently available resources in English. For Tamil SentiWordNet, a substantial agreement Fleiss Kappa score of 0.663 was obtained after verification from Tamil annotators. Such a resource would serve as a baseline for future improvements in the task of sentiment analysis specific to


Point Cloud GAN

Generative Adversarial Networks (GAN) can achieve promising performance on learning complex data distributions on different types of data. In this paper, we first show a straightforward extension of existing GAN algorithm is not applicable to point clouds, because the constraint required for discriminators is undefined for set data. We propose a two fold modification to GAN algorithm for learning to generate point clouds (PC-GAN). First, we combine ideas from hierarchical Bayesian modeling and implicit generative models by learning a hierarchical and interpretable sampling process. A key component of our method is that we train a posterior inference network for the hidden variables. Second, instead of using only state-of-the-art Wasserstein GAN objective, we propose a sandwiching objective, which results in a tighter Wasserstein distance estimate than the commonly used dual form. Thereby, PC-GAN defines a generic framework that can incorporate many existing GAN algorithms. We validate our claims on ModelNet40 benchmark dataset. Using the distance between generated point clouds and true meshes as metric, we find that PC-GAN trained by the sandwiching objective achieves better results on test data than the existing methods. Moreover, as a byproduct, PCGAN learns versatile latent representations of point clouds, which can achieve competitive performance with other unsupervised learning algorithms on object recognition task. Lastly, we also provide studies on generating unseen classes of objects and transforming image to point cloud, which demonstrates the compelling generalization capability and potentials of PC-GAN.


Understanding the Effects of Mobile Gamification on Learning Performance

With the development of mobile technology, mobile learning, which is not bound by time and space, has become one of the most essential learning methods for modern people. However, previous studies have suggested that improvements are still needed in mobile learning performance. One of the means to achieve this goal is situated learning, which enhances learners’ autonomous motivation and make them more enthusiastic in learning. Nonetheless, few studies have attempted to increase learning performance through situated learning. This study attempts to explore the development of a productive learning atmosphere in the context of mobile situated learning. An experiment is conducted with university-level students having homogenous background and coursework by applying heterogeneous pedagogies, including textual pedagogy, video pedagogy, collaborative pedagogy, and gamification pedagogy. Moreover, the uses and gratification theory and the cognitive load theory were adopted to identify the cognitive factors that influence the learning performance in situated learning. It is hoped that education service providers can benefit from the insights discovered from this study and implement more effective learning strategies in mobile education.


Generating regular expression signatures for network traffic classification in trusted network management

Network traffic classification is a critical foundation for trusted network management and security systems. Matching application signatures in traffic payload is widely considered to be the most reliable classifying method. However, deriving accurate and efficient signatures for various applications is not a trivial task, for which current practice is mostly manual thus error-prone and of low efficiency. In this paper, we tackle the problem of automatic signature generation. In particular, we focus on generating regular expression signatures with a certain subset of standard syntax rules, which are of sufficient expressive power and compatible with most practical systems. We propose a novel approach that takes as input a labeled training data set and produces a set of signatures for matching the application classes presented in the data. The approach involves four procedures: pre-processing to extract application session payload, tokenization to find common substrings and incorporate position constraints, multiple sequence alignment to find common subsequences, and signature construction to transform the results into regular expressions. A real life full payload traffic trace is used to evaluate the proposed system, and signatures for a range of applications are automatically derived. The results indicate that the signatures are of high quality, and exhibit low false negatives and false positives. & 2011 Elsevier Ltd. All rights reserved.


Toward Automatic Sound Source Recognition : Identifying Musical Instruments

average pitch average spectral centroid avg. normalized spect. cent. maximum onset slope onset duration vibrato frequency vibrato strength tremolo frequency tremolo strength slope of onset harmonic skew variance of ons. harm. skew amplitude decay odd/even harmonic ratio Features violin (bowed, muted, pizzicato) viola (bowed, muted, pizzicato) cello (bowed, muted, pizzicato) double bass (bowed, muted, pizz.) trumpet (C, Bach, C with Harmon mute) horn (normal, muted) tenor trombone (normal, muted) tuba flute piccolo oboe english horn bassoon Bb clarinet Instruments


Inversion of seismic reflection data in the acoustic approximation

The nonlinear inverse problem for seismic reflection data is solved in the acoustic approximation. The method is based on the generalized least-squares criterion, and it can handle errors in the data set and a priori information on the model. Multiply reflected energy is naturally taken into account, as well as refracted energy or surface waves. The inverse problem can be solved using an iterative algorithm which gives, at each iteration, updated values of bulk modulus, density, and time source function. Each step of the iterative algorithm essentially consists of a forward propagation of the actual sources in the current model and a forward propagation (backward in time) of the data residuals. The correlation at each point of the space of the two fields thus obtained yields the corrections of the bulk modulus and density models. This shows, in particular, that the general solution of the inverse problem can be attained by methods strongly related to the methods of migration of unstacked data, and commercially competitive with them.


Neural Machine Translation Incorporating Named Entity

This study proposes a new neural machine translation (NMT) model based on the encoderdecoder model that incorporates named entity (NE) tags of source-language sentences. Conventional NMT models have two problems enumerated as follows: (i) they tend to have difficulty in translating words with multiple meanings because of the high ambiguity, and (ii) these models’ ability to translate compound words seems challenging because the encoder receives a word, a part of the compound word, at each time step. To alleviate these problems, the encoder of the proposed model encodes the input word on the basis of its NE tag at each time step, which could reduce the ambiguity of the input word. Furthermore, the encoder introduces a chunk-level LSTM layer over a word-level LSTM layer and hierarchically encodes a source-language sentence to capture a compound NE as a chunk on the basis of the NE tags. We evaluate the proposed model on an English-to-Japanese translation task with the ASPEC, and English-to-Bulgarian and English-to-Romanian translation tasks with the Europarl corpus. The evaluation results show that the proposed model achieves up to 3.11 point improvement in BLEU.


Software Defect Prediction via Convolutional Neural Network

To improve software reliability, software defect prediction is utilized to assist developers in finding potential bugs and allocating their testing efforts. Traditional defect prediction studies mainly focus on designing hand-crafted features, which are input into machine learning classifiers to identify defective code. However, these hand-crafted features often fail to capture the semantic and structural information of programs. Such information is important in modeling program functionality and can lead to more accurate defect prediction.In this paper, we propose a framework called Defect Prediction via Convolutional Neural Network (DP-CNN), which leverages deep learning for effective feature generation. Specifically, based on the programs' Abstract Syntax Trees (ASTs), we first extract token vectors, which are then encoded as numerical vectors via mapping and word embedding. We feed the numerical vectors into Convolutional Neural Network to automatically learn semantic and structural features of programs. After that, we combine the learned features with traditional hand-crafted features, for accurate software defect prediction. We evaluate our method on seven open source projects in terms of F-measure in defect prediction. The experimental results show that in average, DP-CNN improves the state-of-the-art method by 12%.


Towards continuous control of flippers for a multi-terrain robot using deep reinforcement learning

In this paper we focus on developing a control algorithm for multi-terrain tracked robots with flippers using a reinforcement learning (RL) approach. The work is based on the deep deterministic policy gradient (DDPG) algorithm, proven to be very successful in simple simulation environments. The algorithm works in an end-to-end fashion in order to control the continuous position of the flippers. This end-to-end approach makes it easy to apply the controller to a wide array of circumstances, but the huge flexibility comes to the cost of an increased difficulty of solution. The complexity of the task is enlarged even more by the fact that real multi-terrain robots move in partially observable environments. Notwithstanding these complications, being able to smoothly control a multi-terrain robot can produce huge benefits in impaired people daily lives or in search and rescue situations. Manuscript received 22 September 2017 ar X iv :1 70 9. 08 43 0v 1 [ cs .R O ] 2 5 Se p 20 17


Computational approaches to fMRI analysis

Analysis methods in cognitive neuroscience have not always matched the richness of fMRI data. Early methods focused on estimating neural activity within individual voxels or regions, averaged over trials or blocks and modeled separately in each participant. This approach mostly neglected the distributed nature of neural representations over voxels, the continuous dynamics of neural activity during tasks, the statistical benefits of performing joint inference over multiple participants and the value of using predictive models to constrain analysis. Several recent exploratory and theory-driven methods have begun to pursue these opportunities. These methods highlight the importance of computational techniques in fMRI analysis, especially machine learning, algorithmic optimization and parallel computing. Adoption of these techniques is enabling a new generation of experiments and analyses that could transform our understanding of some of the most complex—and distinctly human—signals in the brain: acts of cognition such as thoughts, intentions and memories.


iMAP-CampUS: Developing an Intelligent Mobile Augmented Reality Program on Campus as a Ubiquitous System

Augmented Reality (AR) offers a combination of physical and virtual objects, drawing on the strengths of each. Therefore, it is different from virtual reality since it permits users to sight the real world enhanced with virtual objects. Thus, AR technology holds potential to support users with valuable information about the surrounding area. In this paper, we demonstrate the development of an AR app that provides the students with rich information about the buildings nearby. The application, which we name "iMAP-CampUS", is designed to assist students at Macquarie University in locating places of interest close to them by moving the camera of the device in all probable directions to overlay information of places around them. The iMAP-CampUS has been developed for both iOS and Android platforms and run on smartphones and tablets with different screen sizes.


Deep Learning Based Forecasting of Critical Infrastructure Data

Intelligent monitoring and control of critical infrastructure such as electric power grids, public water utilities and transportation systems produces massive volumes of time series data from heterogeneous sensor networks. Time Series Forecasting (TSF) is essential for system safety and security, and also for improving the efficiency and quality of service delivery. Being highly dependent on various external factors, the observed system behavior is usually stochastic, which makes the next value prediction a tricky and challenging task that usually needs customized methods. In this paper we propose a novel deep learning based framework for time series analysis and prediction by ensembling parametric and nonparametric methods. Our approach takes advantage of extracting features at different time scales, which improves accuracy without compromising reliability in comparison with the state-of-the-art methods. Our experimental evaluation using real-world SCADA data from a municipal water management system shows that our proposed method outperforms the baseline methods evaluated here.


A fast restoration method for atmospheric turbulence degraded images using non-rigid image registration

In this paper, a fast image restoration method is proposed to restore the true image from an atmospheric turbulence degraded video. A non-rigid image registration algorithm is employed to register all the frames of the video to a reference frame and determine the shift maps. The First Register Then Average And Subtract-variant (FRTAASv) method is applied to correct the geometric distortion of the reference frame. A performance comparison is presented between the proposed restoration method and the earlier Minimum Sum of Squared Differences (MSSD) image registration based FRTAASv method, in terms of processing time and accuracy. Simulation results show that the proposed method requires shorter processing time to achieve the same geometric accuracy.


A framework for mesencephalic dopamine systems based on predictive Hebbian learning.

We develop a theoretical framework that shows how mesencephalic dopamine systems could distribute to their targets a signal that represents information about future expectations. In particular, we show how activity in the cerebral cortex can make predictions about future receipt of reward and how fluctuations in the activity levels of neurons in diffuse dopamine systems above and below baseline levels would represent errors in these predictions that are delivered to cortical and subcortical targets. We present a model for how such errors could be constructed in a real brain that is consistent with physiological results for a subset of dopaminergic neurons located in the ventral tegmental area and surrounding dopaminergic neurons. The theory also makes testable predictions about human choice behavior on a simple decision-making task. Furthermore, we show that, through a simple influence on synaptic plasticity, fluctuations in dopamine release can act to change the predictions in an appropriate manner.


Predictive reward signal of dopamine neurons.

The effects of lesions, receptor blocking, electrical self-stimulation, and drugs of abuse suggest that midbrain dopamine systems are involved in processing reward information and learning approach behavior. Most dopamine neurons show phasic activations after primary liquid and food rewards and conditioned, reward-predicting visual and auditory stimuli. They show biphasic, activation-depression responses after stimuli that resemble reward-predicting stimuli or are novel or particularly salient. However, only few phasic activations follow aversive stimuli. Thus dopamine neurons label environmental stimuli with appetitive value, predict and detect rewards and signal alerting and motivating events. By failing to discriminate between different rewards, dopamine neurons appear to emit an alerting message about the surprising presence or absence of rewards. All responses to rewards and reward-predicting stimuli depend on event predictability. Dopamine neurons are activated by rewarding events that are better than predicted, remain uninfluenced by events that are as good as predicted, and are depressed by events that are worse than predicted. By signaling rewards according to a prediction error, dopamine responses have the formal characteristics of a teaching signal postulated by reinforcement learning theories. Dopamine responses transfer during learning from primary rewards to reward-predicting stimuli. This may contribute to neuronal mechanisms underlying the retrograde action of rewards, one of the main puzzles in reinforcement learning. The impulse response releases a short pulse of dopamine onto many dendrites, thus broadcasting a rather global reinforcement signal to postsynaptic neurons. This signal may improve approach behavior by providing advance reward information before the behavior occurs, and may contribute to learning by modifying synaptic transmission. The dopamine reward signal is supplemented by activity in neurons in striatum, frontal cortex, and amygdala, which process specific reward information but do not emit a global reward prediction error signal. A cooperation between the different reward signals may assure the use of specific rewards for selectively reinforcing behaviors. Among the other projection systems, noradrenaline neurons predominantly serve attentional mechanisms and nucleus basalis neurons code rewards heterogeneously. Cerebellar climbing fibers signal errors in motor performance or errors in the prediction of aversive events to cerebellar Purkinje cells. Most deficits following dopamine-depleting lesions are not easily explained by a defective reward signal but may reflect the absence of a general enabling function of tonic levels of extracellular dopamine. Thus dopamine systems may have two functions, the phasic transmission of reward information and the tonic enabling of postsynaptic neurons.


FMRI Visualization of Brain Activity during a Monetary Incentive Delay Task

Comparative studies have implicated striatal and mesial forebrain circuitry in the generation of autonomic, endocrine, and behavioral responses for incentives. Using blood oxygen level-dependent functional magnetic resonance imaging, we sought to visualize functional activation of these regions in 12 normal volunteers as they anticipated and responded for monetary incentives. Both individual and group analyses of time-series data revealed significant activation of striatal and mesial forebrain structures (including insula, caudate, putamen, and mesial prefrontal cortex) during trials involving both monetary rewards and punishments. In addition to these areas, during trials involving punishment, group analysis revealed activation foci in the anterior cingulate and thalamus. These results corroborate comparative studies which implicate striatal and mesial forebrain circuitry in the elaboration of incentive-driven behavior. This report also introduces a new paradigm for probing the functional integrity of this circuitry in humans.


Improved Single Image Dehazing Using Dark Channel Prior and Multi-scale Retinex

In this paper, we propose an improved image dehazing algorithm using dark channel prior and Multi-Scale Retinex. Main improvement lies in automatic and fast acquisition of transmission map of the scene. We implement the Multi-scale Retinex algorithm on the luminance component in YCbCr space, obtain a pseudo transmission map whose function is similar to the transmission map in original approach. Combining with the haze image model and the dark channel prior, we can recover a high quality haze-free image. Compared with the original method, our algorithm has two main advantages: (i) no user interaction is needed, and (ii) restoring the image much faster while maintaining comparable dehazing performance.


Formal Design and Verification of Self-Adaptive Systems with Decentralized Control

Feedback control loops that monitor and adapt managed parts of a software system are considered crucial for realizing self-adaptation in software systems. The MAPE-K (Monitor-Analyze-Plan-Execute over a shared Knowledge) autonomic control loop is the most influential reference control model for self-adaptive systems. The design of complex distributed self-adaptive systems having decentralized adaptation control by multiple interacting MAPE components is among the major challenges. In particular, formal methods for designing and assuring the functional correctness of the decentralized adaptation logic are highly demanded.
 This article presents a framework for formal modeling and analyzing self-adaptive systems. We contribute with a formalism, called self-adaptive Abstract State Machines, that exploits the concept of multiagent Abstract State Machines to specify distributed and decentralized adaptation control in terms of MAPE-K control loops, also possible instances of MAPE patterns. We support validation and verification techniques for discovering unexpected interfering MAPE-K loops, and for assuring correctness of MAPE components interaction when performing adaptation.


Online Media Use of False News to Frame the 2016 Trump Presidential Campaign

The 2016 U.S. presidential election campaigns witnessed an unprecedented viral false news -- a type of misinformation referred to as "factitious information blend" that is motivated to discredit political rivals. Despite the different speculations of factors that might have influenced Donald Trump's surprised victory, empirical and theoretical research on the potential impacts of false news propagated by online news media during election campaigns on influencing voters' attitudes and public opinion is seriously lacking. By drawing on the literature on framing political-effects research and by developing our computational text analytics programs, we addressed questions regarding how online news media used false news to negatively frame the Trump presidential campaign. Our text analytics results indicate that although the negative frames against Trump far outnumbered those against Hillary Clinton, weak frames of unverifiable misinformation might have failed to influence the mass audience, leaving them to the power of Trump's direct political communications via Twitter.


Seraph: an efficient, low-cost system for concurrent graph processing

Graph processing systems have been widely used in enterprises like online social networks to process their daily jobs. With the fast growing of social applications, they have to efficiently handle massive concurrent jobs. However, due to the inherent design for single job, existing systems incur great inefficiency in memory use and fault tolerance. Motivated by this, in this paper we introduce Seraph, a graph processing system that enables efficient job-level parallelism. Seraph is designed based on a decoupled data model, which allows multiple concurrent jobs to share graph structure data in memory. Seraph adopts a copy-on-write semantic to isolate the graph mutation of concurrent jobs, and a lazy snapshot protocol to generate consistent graph snapshots for jobs submitted at different time. Moreover, Seraph adopts an incremental checkpoint/regeneration model which can tremendously reduce the overhead of checkpointing. We have implemented Seraph, and the evaluation results show that Seraph significantly outperforms popular systems (such as Giraph and Spark) in both memory usage and job completion time, when executing concurrent graph jobs.


Person Re-identification with Deep Similarity-Guided Graph Neural Network

The person re-identification task requires to robustly estimate visual similarities between person images. However, existing person re-identification models mostly estimate the similarities of different image pairs of probe and gallery images independently while ignores the relationship information between different probe-gallery pairs. As a result, the similarity estimation of some hard samples might not be accurate. In this paper, we propose a novel deep learning framework, named Similarity-Guided Graph Neural Network (SGGNN) to overcome such limitations. Given a probe image and several gallery images, SGGNN creates a graph to represent the pairwise relationships between probegallery pairs (nodes) and utilizes such relationships to update the probegallery relation features in an end-to-end manner. Accurate similarity estimation can be achieved by using such updated probe-gallery relation features for prediction. The input features for nodes on the graph are the relation features of different probe-gallery image pairs. The probe-gallery relation feature updating is then performed by the messages passing in SGGNN, which takes other nodes’ information into account for similarity estimation. Different from conventional GNN approaches, SGGNN learns the edge weights with rich labels of gallery instance pairs directly, which provides relation fusion more precise information. The effectiveness of our proposed method is validated on three public person re-identification datasets.


Of, for, and by the people: the legal lacuna of synthetic persons

Conferring legal personhood on purely synthetic entities is a very real legal possibility, one under consideration presently by the European Union. We show here that such legislative action would be morally unnecessary and legally troublesome. While AI legal personhood may have some emotional or economic appeal, so do many superficially desirable hazards against which the law protects us. We review the utility and history of legal fictions of personhood, discussing salient precedents where such fictions resulted in abuse or incoherence. We conclude that difficulties in holding “electronic persons” accountable when they violate the rights of others outweigh the highly precarious moral interests that AI legal personhood might protect.


Grasping analysis for a 3-Finger Adaptive Robot Gripper

A 3-Finger Adaptive Robot Gripper is an advanced robotic research that provides a robotic hand-like capabilities due to its flexibility and versatility. However, the grasping performance has to be analyzed and monitored based on the motor encoder, motor current, and force feedback so that the finger position and grasping force can be effectively controlled. This paper provides an open-loop grasping analysis for a 3-Finger Adaptive Robot Gripper. A series of grasping tests has been conducted to demonstrate the robot capabilities and functionalities. Different stiffness levels of the grasped objects have been chosen to demonstrate the grasping ability. In the experiment, a Modbus RTU protocol and Matlab/Simulink are used as communication and control platform. A specially modified interlink FSR sensor is proposed where a special plastic cover has been developed to enhance the sensor sensitivity. The Arduino IO Package is employed to interface the sensor and Matlab/Simulink. The results show that the significant relationships between finger position, motor current, and force sensor are found and the results can be used for a proper grasping performance.


Posterior short-segment fixation with or without fusion for thoracolumbar burst fractures. a five to seven-year prospective randomized study.

BACKGROUND
The impact of fusion as a supplement to short-segment instrumentation for the treatment of thoracolumbar burst fractures is unclear. We conducted a controlled clinical trial to define the effect of fusion on lumbar spine and patient-related functional outcomes.

METHODS
From 2000 to 2002, seventy-three consecutive patients with a single-level Denis type-B burst fracture involving the thoracolumbar spine and a load-sharing score of <or=6 were managed with posterior pedicle screw instrumentation. The patients were randomly assigned to treatment with posterolateral fusion (fusion group, n = 37) or without posterolateral fusion (nonfusion group, n = 36). The patients were followed for at least five years after surgery and were assessed with regard to clinical and radiographic outcomes. Clinical outcomes were evaluated with use of the Frankel scale, the motor score of the American Spinal Injury Association, a visual analog scale, and the Short Form-36 (SF-36) questionnaire. Radiographic outcomes were assessed on the basis of the local kyphosis angle and loss of kyphosis correction.

RESULTS
No significant difference in radiographic or clinical outcomes was noted between the patients managed with the two techniques. Both operative time and blood loss were significantly less in the nonfusion group compared with the fusion group (p < 0.05). Twenty-five of the thirty-seven patients in the fusion group still had some degree of donor-site pain at the time of the latest examination.

CONCLUSIONS
Posterolateral bone-grafting is not necessary when a Denis type-B thoracolumbar burst fracture associated with a load-sharing score of <or=6 is treated with short-segment pedicle screw fixation.


Ask the Mutants: Mutating Faulty Programs for Fault Localization

We present MUSE (MUtation-baSEd fault localization technique), a new fault localization technique based on mutation analysis. A key idea of MUSE is to identify a faulty statement by utilizing different characteristics of two groups of mutants-one that mutates a faulty statement and the other that mutates a correct statement. We also propose a new evaluation metric for fault localization techniques based on information theory, called Locality Information Loss (LIL): it can measure the aptitude of a localization technique for automated fault repair systems as well as human debuggers. The empirical evaluation using 14 faulty versions of the five real-world programs shows that MUSE localizes a fault after reviewing 7.4 statements on average, which is about 25 times more precise than the state-of-the-art SBFL technique Op2.


APAC: Augmented PAttern Classification with Neural Networks

Deep neural networks have been exhibiting splendid accuracies in many of visual pattern classification problems. Many of the state-of-the-art methods employ a technique known as data augmentation at the training stage. This paper addresses an issue of decision rule for classifiers trained with augmented data. Our method is named as APAC: the Augmented PAttern Classification, which is a way of classification using the optimal decision rule for augmented data learning. Discussion of methods of data augmentation is not our primary focus. We show clear evidences that APAC gives far better generalization performance than the traditional way of class prediction in several experiments. Our convolutional neural network model with APAC achieved a state-of-the-art accuracy on the MNIST dataset among non-ensemble classifiers. Even our multilayer perceptron model beats some of the convolutional models with recentlyinvented stochastic regularization techniques on the CIFAR10 dataset.


Graphene-based single-bacterium resolution biodevice and DNA transistor: interfacing graphene derivatives with nanoscale and microscale biocomponents.

Establishing "large-contact-area" interfaces of sensitive nanostructures with microbes and mammalian cells will lead to the development of valuable tools and devices for biodiagnostics and biomedicine. Chemically modified graphene (CMG) nanostructures with their microscale area, sensitive electrical properties, and modifiable chemical functionality are excellent candidates for such biodevices at both biocellular and biomolecular scale. Here, we report on the fabrication and functioning of a novel CMG-based (i) single-bacterium biodevice, (ii) label-free DNA sensor, and (iii) bacterial DNA/protein and polyelectrolyte chemical transistor. The bacteria biodevice was highly sensitive with a single-bacterium attachment generating approximately 1400 charge carriers in a p-type CMG. Similarly, single-stranded DNA tethered on graphene hybridizes with its complementary DNA strand to reversibly increase the hole density by 5.61 x 1012 cm(-2). We further demonstrate (a) a control on the device sensitivity by manipulating surface groups, (b) switching of polarity specificity by changing surface polarity, and (c) a preferential attachment of DNA on thicker CMG surfaces and sharp CMG wrinkles.


Discriminative key-component models for interaction detection and recognition

Not all frames are equal – selecting a subset of discriminative frames from a video can improve performance at detecting and recognizing human interactions. In this paper we present models for categorizing a video into one of a number of predefined interactions or for detecting these interactions in a long video sequence. The models represent the interaction by a set of key temporal moments and the spatial structures they entail. For instance: two people approaching each other, then extending their hands before engaging in a “handshaking” interaction. Learning the model parameters requires only weak supervision in the form of an overall label for the interaction. Experimental results on the UT-Interaction and VIRAT datasets verify the efficacy of these structured models for human interactions.


Why Are Consumers Willing to Pay for Privacy? An Application of the Privacy-freemium Model to Media Companies

Monetizing their users’ personal information instead of charging a fee has become an established revenue model for platform operators—a new form of media companies specialized in aggregating, managing, and distributing user-generated online content. However, the commodification of privacy leads to privacy concerns that might be a risk for such businesses. Thus, a new approach is to focus on consumers’ willingness to pay for privacy, assuming that monetizing privacy protection might be an alternative revenue model. Following the freemium idea, we developed an innovative research design, offering 553 online survey participants the opportunity to subscribe to a fictional premium version of Facebook with additional privacy control features in return for a monthly fee. Based on the theory of planned behavior, we developed and tested a research model to explain actual willingness to pay for privacy behavior. Our findings show that perceived usefulness and trust significantly affect willingness to pay. In contrast, perceived internet privacy risk was not found to have a significant influence. We thus conclude that consumers are willing to pay for privacy in the form of a privacy-freemium model, provided they perceive the premium version as offering added value and as trustworthy.


Decision support system for servitization of industrial SMEs: a modelling and simulation approach M. Chalal, X. Boucher & G. Marques To cite this article: M. Chalal, X. Boucher & G. Marques (2015) Decision support system for servitization of industrial SMEs: a modelling and simulation approach, Journal of Decision Systems, 24:4, 355-382, DOI: 10.1080/12460125.2015.1074836 To link to this article: http://dx.doi.org/10.1080/12460125.2015.1074836


A neurophilosophical slant on consciousness research.

Explaining the nature and mechanisms of conscious experience in neurobiological terms seems to be an attainable, if yet unattained, goal. Research at many levels is important, including research at the cellular level that explores the role of recurrent pathways between thalamic nuclei and the cortex, and research that explores consciousness from the perspective of action. Conceptually, a clearer understanding of the logic of expressions such as "causes" and "correlates", and about what to expect from a theory of consciousness are required. The logic of some terms, such as "qualia" and "reductionism", continues to generate misunderstandings about the scientific possibilities and limits. Experimentally, a deeper understanding of the role of the thalamus in coordinating activity across cortical levels, and a readiness to reconsider the orthodox approach to thalamocortical organization are also required.


TopicViz: interactive topic exploration in document collections

Existing methods for searching and exploring large document collections focus on surface-level matches to user queries, ignoring higher-level semantic structure. In this paper we show how topic modeling - a technique for identifying latent themes across a large collection of documents - can support semantic exploration. We present TopicViz: an interactive environment which combines traditional search and citation-graph exploration with a force-directed layout that links documents to the latent themes discovered by the topic model. We describe usage scenarios in which TopicViz supports rapid sensemaking on large document collections.


Moving Obstacle Detection using Monocular Vision

This paper proposes a method for detecting moving obstacles on roads, by using a vehicle mounted monocular camera. To detect various moving obstacles, such as vehicles and pedestrians, the ego-motion of the vehicle is initially estimated from images captured by the camera. There are two problems in ego-motion estimation. Firstly, a typical road scene contains moving obstacles. This causes false estimation of the ego-motion. Secondly, roads possess fewer features, when compared to the number associated with background structures. This reduces the accuracy of ego-motion estimation. In our approach, the ego-motion is estimated from the correspondences of dispersed feature points extracted from various regions other than those that contain moving obstacles. After estimating the ego-motion, any moving obstacles are detected by tracking the feature points over consecutive frames. In our experiments, it has been shown that the proposed method is able to detect moving obstacles


A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Over the last decade many metaheuristics have been applied t o the flowshop scheduling problem, ranging from Simulated Annealing or Tabu Search to complex hybrid techniques. Some of these methods provide excellent effectiveness and e fficiency at the expense of being utterly complicated. In fact, several published meth ods require substantial implementation efforts, exploit problem specific speed-up techniqu es that cannot be applied to slight variations of the original problem, and often re-implement ations of these methods by other researchers produce results that are quite different from t he original ones. In this work we present a new iterated greedy algorithm that applies two pha ses iteratively, namedestruction, were some jobs are eliminated from the incumbent solution, andconstruction, where the eliminated jobs are reinserted into the sequence using t he well known NEH construction Corresponding author


An Overview of Virtual Machine Architectures

hen early computer systems were being developed, hardware was designed first and software written specifically for that hardware followed. Each system was essentially handcrafted with its own instruction set, and software was developed for that specific instruction set. This included operating system software, assemblers (later compilers), and application programs. With a small user community, relatively simple programs, and fixed hardware, this tightly integrated approach worked quite well, especially while the basic concepts of the stored program computer were still evolving. But user communities grew, operating systems became more complex, and the number of application programs rapidly expanded, so that re-writing and distributing software for each new computer system became a major burden.


Human simulations of vocabulary learning

The work reported here experimentally investigates a striking generalization about vocabulary acquisition: Noun learning is superior to verb learning in the earliest moments of child language development. The dominant explanation of this phenomenon in the literature invokes differing conceptual requirements for items in these lexical categories: Verbs are cognitively more complex than nouns and so their acquisition must await certain mental developments in the infant. In the present work, we investigate an alternative hypothesis; namely, that it is the information requirements of verb learning, not the conceptual requirements, that crucially determine the acquisition order. Efficient verb learning requires access to structural features of the exposure language and thus cannot take place until a scaffolding of noun knowledge enables the acquisition of clause-level syntax. More generally, we experimentally investigate the hypothesis that vocabulary acquisition takes place via an incremental constraint-satisfaction procedure that bootstraps itself into successively more sophisticated linguistic representations which, in turn, enable new kinds of vocabulary learning. If the experimental subjects were young children, it would be difficult to distinguish between this information-centered hypothesis and the conceptual change hypothesis. Therefore the experimental "learners" are adults. The items to be "acquired" in the experiments were the 24 most frequent nouns and 24 most frequent verbs from a sample of maternal speech to 18-24-month-old infants. The various experiments ask about the kinds of information that will support identification of these words as they occur in mother-to-child discourse. Both the proportion correctly identified and the type of word that is identifiable changes significantly as a function of information type. We discuss these results as consistent with the incremental construction of a highly lexicalized grammar by cognitively and pragmatically sophisticated human infants, but inconsistent with a procedure in which lexical acquisition is independent of and antecedent to syntax acquisition.


Why Nouns Are Learned before Verbs: Linguistic Relativity Versus Natural Partitioning. Technical Report No. 257.

ABSTRACT There is overwhelming evidence that children's first words are primarily nouns even across languages. These data are interpreted as evidence of a "Natural Partitions Theory," one that holds that the concepts referred to by nouns are conceptually more basic than those referred to by verbs or prepositions. Analysis of data from cross-linguistic studies designed to eliminate Inonconceptual differences between words in a language that might account for the Larlier acquisition of nouns--such as the position of a word in the sentence, morphological transparency (the ease with which the root can be heard in various uses of the word), and patterns of language teaching strategies--leaves some version of the Natural Partitions hypothesis as the most reasonable view of early vocabulary acquisition. A cross-linguistic examination of a single sentence suggests that if objecthood is created by spatial relations among perceptual elements, then good concrete objects are particularly cohesive collections of percepts. These highly cohesive collections of perceptual information tend to be lexicalized as nouns by almost every language. Object concepts are given to language users by the world and can be learned one at a time, while predicate concepts form a system in each language., that, from a child's point of view, must be discovered. (HTE)


FROM SIMPLE ASSOCIATIONS TO SYSTEMATIC REASONING : A Connectionist representation of rules , variables , and dynamic bindings using temporal synchrony

Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency — as though these inferences are a reflex response of their cognitive apparatus. Furthermore, these inferences are drawn with reference to a large body of background knowledge. This remarkable human ability seems paradoxical given the results about the complexity of reasoning reported by researchers in artificial intelligence. It also poses a challenge for cognitive science and computational neuroscience: How can a system of simple and slow neuron-like elements represent a large body of systematic knowledge and perform a range of inferences with such speed? We describe a computational model that is a step toward addressing the cognitive science challenge and resolving the artificial intelligence paradox. We show how a connectionist network can encode millions of facts and rules involving n-ary predicates and variables, and perform a class of inferences in a few hundred msec. Efficient reasoning requires the rapid representation and propagation of dynamic bindings. Our model achieves this by i) representing dynamic bindings as the synchronous firing of appropriate nodes, ii) rules as interconnection patterns that direct the propagation of rhythmic activity, iii) and long-term facts as temporal pattern-matching sub-networks. The model is consistent with recent neurophysiological findings which suggest that synchronous activity occurs in the brain and may play a representational role in neural information processing. The model also makes specific predictions about the nature of reflexive reasoning that are psychologically significant. It identifies constraints on the form of rules that may participate in such reasoning and relates the capacity of the working memory underlying reflexive reasoning to biological parameters such as the lowest frequency at which nodes can sustain synchronous oscillations and the coarseness of synchronization.


Zero-Shot Adaptive Transfer for Conversational Language Understanding

Conversational agents such as Alexa and Google Assistant constantly need to increase their language understanding capabilities by adding new domains. A massive amount of labeled data is required for training each new domain. While domain adaptation approaches alleviate the annotation cost, prior approaches suffer from increased training time and suboptimal concept alignments. To tackle this, we introduce a novel Zero-Shot Adaptive Transfer method for slot tagging that utilizes the slot description for transferring reusable concepts across domains, and enjoys efficient training without any explicit concept alignments. Extensive experimentation over a dataset of 10 domains relevant to our commercial personal digital assistant shows that our model outperforms previous state-of-the-art systems by a large margin, and achieves an even higher improvement in the low data regime.


Type Checking Type Classes

We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This lead to simple type inference systems and algorithms which closely resemble those for ML. In particular we present a new unification algorithm which is an extension of syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.


Gender violence: transgender experiences with violence and discrimination.

There is a pervasive pattern of discrimination and prejudice against transgendered people within society. Both economic discrimination and experiencing violence could be the result of a larger social climate that severely sanctions people for not conforming to society's norms concerning gender; as such, both would be strongly associated with each other. Questionnaires were distributed to people either through events or through volunteers, and made available upon the World Wide Web. A sample of 402 cases was collected over the span of 12 months (April 1996-April 1997). We found that over half the people within this sample experienced some form of harassment or violence within their lifetime, with a quarter experiencing a violent incident. Further investigation found that experiencing economic discrimination because one is transgendered had the strongest association with experiencing a transgender related violent incident. Economic discrimination was related to transgendered people's experience with violence. Therefore, both hate crimes legislation and employment protections are needed for transgendered individuals.


WeChecker: efficient and precise detection of privilege escalation vulnerabilities in Android apps

Due to the rapid increase of Android apps and their wide usage to handle personal data, a precise and large-scaling checker is in need to validate the apps' permission flow before they are listed on the market. Several tools have been proposed to detect sensitive data leaks in Android apps. But these tools are not applicable to large-scale analysis since they fail to deal with the arbitrary execution orders of different event handlers smartly. Event handlers are invoked by the framework based on the system state, therefore we cannot pre-determine their order of execution. Besides, since all exported components can be invoked by an external app, the execution orders of these components are also arbitrary. A naive way to simulate these two types of arbitrary execution orders yields a permutation of all event handlers in an app. The time complexity is O(n!) where n is the number of event handlers in an app. This leads to a high analysis overhead when n is big. To give an illustration, CHEX [10] found 50.73 entry points of 44 unique class types in an app on average. In this paper we propose an improved static taint analysis to deal with the challenge brought by the arbitrary execution orders without sacrificing the high precision. Our analysis does not need to make permutations and achieves a polynomial time complexity. We also propose to unify the array and map access with object reference by propagating access paths to reduce the number of false positives due to field-insensitivity and over approximation of array access and map access.
 We implement a tool, WeChecker, to detect privilege escalation vulnerabilities [7] in Android apps. WeChecker achieves 96% precision and 96% recall in the state-of-the-art test suite DriodBench (for compairson, the precision and recall of FlowDroid [1] are 86% and 93%, respectively). The evaluation of WeChecker on real apps shows that it is efficient (average analysis time of each app: 29.985s) and fits for large-scale checking.


Latent Fingerprint Matching: Fusion of Manually Marked and Derived Minutiae

Matching unknown latent fingerprints lifted from crime scenes to full (rolled or plain) fingerprints in law enforcement databases is of critical importance for combating crime and fighting terrorism. Compared to good quality full fingerprints acquired using live-scan or inking methods during enrollment, latent fingerprints are often smudgy and blurred, capture only a small finger area, and have large nonlinear distortion. For this reason, features (minutiae and singular points) in latents are typically manually marked by trained latent examiners. However, this introduces an undesired interoperability problem between latent examiners and automatic fingerprint identification systems (AFIS); the features marked by examiners are not always compatible with those automatically extracted by AFIS, resulting in reduced matching accuracy. While the use of automatically extracted minutiae from latents can avoid interoperability problem, such minutiae tend to be very unreliable, because of the poor quality of latents. In this paper, we improve latent to full fingerprint matching accuracy by combining manually marked (ground truth) minutiae with automatically extracted minutiae. Experimental results on a public domain database, NIST SD27, demonstrate the effectiveness of the proposed algorithm.


A New Feature for Automatic Speaker Verification Anti-Spoofing: Constant Q Cepstral Coefficients

Efforts to develop new countermeasures in order to protect automatic speaker verification from spoofing have intensified over recent years. The ASVspoof 2015 initiative showed that there is great potential to detect spoofing attacks, but also that the detection of previously unforeseen spoofing attacks remains challenging. This paper argues that there is more to be gained from the study of features rather than classifiers and introduces a new feature for spoofing detection based on the constant Q transform, a perceptually-inspired time-frequency analysis tool popular in the study of music. Experimental results obtained using the standard ASVspoof 2015 database show that, when coupled with a standard Gaussian mixture model-based classifier, the proposed constant Q cepstral coefficients (CQCCs) outperform all previously reported results by a significant margin. In particular, those for a subset of unknown spoofing attacks (for which no matched training data was used) is 0.46%, a relative improvement of 72% over the best, previously reported results.


Coco-Q: Learning in Stochastic Games with Side Payments

Coco (“cooperative/competitive”) values are a solution concept for two-player normalform games with transferable utility, when binding agreements and side payments between players are possible. In this paper, we show that coco values can also be defined for stochastic games and can be learned using a simple variant of Q-learning that is provably convergent. We provide a set of examples showing how the strategies learned by the Coco-Q algorithm relate to those learned by existing multiagent Q-learning algorithms.


Deep Learning with Sets and Point Clouds

We study a simple notion of structural invariance that readily suggests a parameter-sharing scheme in deep neural networks. In particular, we define structure as a collection of relations, and derive graph convolution and recurrent neural networks as special cases. We study composition of basic structures in defining models that are invariant to more complex “product” structures such as graph of graphs, sets of images or sequence of sets. For demonstration, our experimental results are focused on the setting where the discrete structure of interest is a set. We present results on several novel and non-trivial problems on sets, including point-cloud classification, set outlier detection and semi-supervised learning using clustering information.


Integration of Standardized and Non-Standardized Product Data

Smart products adapt to environments, process contexts, users and other products. Standardized product data such as BMECat, eCl@ss, and EPC global formats are designed to support the exploitation of product data and therefore contribute to more efficient supply chains. Non-standardized product data mainly target soft benefits which targets the exploration of product data [Su04]. We present an extended product data model (SPDO) that integrates standardized and non-standardized product data. The SPDO model consists of five product information types that receive product data and, if available, associated explicit semantics. Explicit semantics are used for advanced services, such as compatibility testing or product bundling. Exemplified by the GS1 approach, we present how standardized product data is retrieved via RFID-based Electronic Product Codes (EPC) and stored in SPDO instantiations.


Cognitive radio network security: A survey

Recent advancements in wireless communication are creating a spectrum shortage problem on a daily basis. Recently, Cognitive Radio (CR), a novel technology, has attempted to minimize this problem by dynamically using the free spectrum in wireless communications and mobile computing. Cognitive radio networks (CRNs) can be formed using cognitive radios by extending the radio link features to network layer functions. The objective of CRN architecture is to improve the whole network operation to fulfil the user’s demands anytime and anywhere, through accessing CRNs in a more efficient way, rather than by just linking spectral efficiency. CRNs are more flexible and exposed to wireless networks compared with other traditional radio networks. Hence, there are many security threats to CRNs, more so than other traditional radio environments. The unique characteristics of CRNs make security more challenging. Several crucial issues have not yet been investigated in the area of security for CRNs. A typical public key infrastructure (PKI) scheme which achieves secure routing and other purposes in typical ad hoc networks is not enough to guarantee the security of CRNs under limited communication and computation resources. However, there has been increasing research attention on security threats caused specifically by CR techniques and special characteristics of CR in CRNs. Therefore, in this research, a survey of CRNs and their architectures and security issues has been carried out in a broad


Mining Social Science Publications for Survey Variables

Research in Social Science is usually based on survey data where individual research questions relate to observable concepts (variables). However, due to a lack of standards for data citations a reliable identification of the variables used is often difficult. In this paper, we present a work-in-progress study that seeks to provide a solution to the variable detection task based on supervised machine learning algorithms, using a linguistic analysis pipeline to extract a rich feature set, including terminological concepts and similarity metric scores. Further, we present preliminary results on a small dataset that has been specifically designed for this task, yielding a significant increase in performance over the random baseline.


Polygonal boundary approximation for a 2D general sweep based on envelope and boolean operations

This paper presents an algorithm that approximates (using polygons) the boundary of a general sweep for an arbitrary 2D curved object (possibly with holes). Based on set-theoretic properties of the general sweep, our algorithm generates the polygonal sweep boundary incrementally, where envelope approximations and union operations are repeatedly applied to intermediate boundaries of the sweep and consecutive instances of the moving object at sampled locations of the motion. For approximation, each instance of the object is polygonized along the motion, where the object may experience dynamic shape transformation with topological changes such as creating and /or destroying internal holes. The incremental nature of the proposed algorithm makes the boundary construction of a general sweep useful for applications in interactive shape design, collision detection, and mechanical part design. Our algorithm generates a precise approximation of the boundary of a general sweep with real-time performance in computing unsweeps, Minkowski sums and differences, and constant radius offsets. Some experimental results are also given in this paper.


Multivariate lattices for encrypted image processing

Images are inherently sensitive signals that require privacy-preserving solutions when processed in an untrusted environment, but their efficient encrypted processing is particularly challenging due to their structure and size. This work introduces a new cryptographic hard problem called m-RLWE (multivariate Ring Learning with Errors) extending RLWE. It gives support to lattice cryptosystems that allow for encrypted processing of multidimensional signals. We show an example cryptosystem and prove that it outperforms its RLWE counterpart in terms of security against basis-reduction attacks, efficiency and cipher expansion for encrypted image processing.


Epigenetics and depression: return of the repressed.

INTRODUCTION
Epigenetics has recently emerged as a potential mechanism by which adverse environmental stimuli can result in persistent changes in gene expression. Epigenetic mechanisms function alongside the DNA sequence to modulate gene expression and ultimately influence protein production. The current review provides an introduction and overview of epigenetics with a particular focus on preclinical and clinical studies relevant to major depressive disorder (MDD).

METHODS
PubMed and Web of Science databases were interrogated from January 1995 up to December 2012 using combinations of search terms, including "epigenetic", "microRNA" and "DNA methylation" cross referenced with "depression", "early life stress" and "antidepressant".

RESULTS
There is an association between adverse environmental stimuli, such as early life stress, and epigenetic modification of gene expression. Epigenetic changes have been reported in humans with MDD and may serve as biomarkers to improve diagnosis. Antidepressant treatments appear to reverse or initiate compensatory epigenetic alterations that may be relevant to their mechanism of action.

LIMITATIONS
As a narrative review, the current report was interpretive and qualitative in nature.

CONCLUSION
Epigenetic modification of gene expression provides a mechanism for understanding the link between long-term effects of adverse life events and the changes in gene expression that are associated with depression. Although still a developing field, in the future, epigenetic modifications of gene expression may provide novel biomarkers to predict future susceptibility and/or onset of MDD, improve diagnosis, and aid in the development of epigenetics-based therapies for depression.


Assessing attractiveness in online dating profiles

Online dating systems play a prominent role in the social lives of millions of their users, but little research has considered how users perceive one another through their personal profiles. We examined how users perceive attractiveness in online dating profiles, which provide their first exposure to a potential partner. Participants rated whole profiles and profile components on such qualities as how attractive, extraverted, and genuine and trustworthy they appeared. As past research in the psychology of attraction would suggest, the attractiveness and other qualities of the photograph were the strongest predictors of whole profile attractiveness, but they were not alone: the free-text component also played an important role in predicting overall attractiveness. In turn, numerous other qualities predicted the attractiveness ratings of photos and free-text components, albeit in different ways for men and women. The fixed-choice elements of a profile, however, were unrelated to attractiveness.


Survey of Authentication and Authorization for the Internet of Things

The Internet of Things is currently getting significant interest from the scientific community. Academia and industry are both focused on moving ahead in attempts to enhance usability, maintainability, and security through standardization and development of best practices.We focus on security because of its impact as one of themost limiting factors to wider Internet ofThings adoption. Numerous research areas exist in the security domain, ranging from cryptography to network security to identitymanagement.This paper provides a survey of existing research applicable to the Internet of Things environment at the application layer in the areas of identity management, authentication, and authorization. We survey and analyze more than 200 articles, categorize them, and present current trends in the Internet of Things security domain.


Measuring the perceived quality of an AR-based learning application: a multidimensional model

Augmented reality (AR) technologies could enhance learning in several ways. The quality of an AR-based educational platform is a combination of key features that manifests in usability, usefulness, and enjoyment for the learner. In this paper, we present a multidimensional model to measure the quality of an AR-based application as perceived by students. The model is specified by a second-order factor (perceived quality) and three dimensions: ergonomic quality, learning quality, and hedonic quality. The purpose of this model is to embody previous research into a coherent framework for the evaluation of AR-based educational platforms and to provide guidance for researchers and practitioners. The model was empirically validated on a Chemistry learning scenario and the results confirm the importance of both the learning and hedonic quality. ARTICLE HISTORY Received 23 July 2014 Revised 2 December 2015 Accepted 9 December 2015


Explainable Prediction of Medical Codes from Clinical Text

Clinical notes are text documents that are created by clinicians for each patient encounter. They are typically accompanied by medical codes, which describe the diagnosis and treatment. Annotating these codes is labor intensive and error prone; furthermore, the connection between the codes and the text is not annotated, obscuring the reasons and details behind specific diagnoses and treatments. We present an attentional convolutional network that predicts medical codes from clinical text. Our method aggregates information across the document using a convolutional neural network, and uses an attention mechanism to select the most relevant segments for each of the thousands of possible codes. The method is accurate, achieving precision@8 of 0.71 and a Micro-F1 of 0.54, which are both better than the prior state of the art. Furthermore, through an interpretability evaluation by a physician, we show that the attention mechanism identifies meaningful explanations for each code assignment.


Content-based approach for Vietnamese spam SMS filtering

Short Message Service (SMS) spam is a serious problem in Vietnam because of the availability of very cheap prepaid SMS packages. There are some systems to detect and filter spam messages for English, most of which use machine learning techniques to analyze the content of messages and classify them. For Vietnamese, there is some research on spam email filtering but none focused on SMS. In this work, we propose the first system for filtering Vietnamese spam SMS. We first propose an appropriate preprocessing method since existing tools for Vietnamese preprocessing cannot give good accuracy on our dataset. We then experiment with vector representations and classifiers to find the best model for this problem. Our system achieves an accuracy of 94% when labelling spam messages while the misclassification rate of legitimate messages is relatively small, about only 0.4%. This is an encouraging result compared to that of English and can be served as a strong baseline for future development of Vietnamese SMS spam prevention systems.


A survey of Agent-Oriented Software Engineering

Agent-Oriented Software Engineering is the one of the most recent contributions to the field of Software Engineering. It has several benefits compared to existing development approaches, in particular the ability to let agents represent high-level abstractions of active entities in a software system. This paper gives an overview of recent research and industrial applications of both general high-level methodologies and on more specific design methodologies for industry-strength software engineering.


Raimond: Quantitative Data Extraction from Twitter to Describe Events

Social media play a decisive role in communicating and spreading information during global events. In particular, real-time microblogging platforms such as Twitter have become prevalent. Researchers have used microblogging for a number of tasks, including past events analysis, predictions, and information retrieval. Nevertheless, little attention has been given to quantitative data extraction. In this paper, we address two questions: can we develop a mechanism to extract quantitative data from a collection of tweets, and can we use the salient findings to describe an event? To answer the first question, we introduce Raimond, a virtual text curator, specialized in quantitative data extraction from Twitter. To address the second question, we use our system on three events and evaluate its output using a crowdsourcing strategy. We demonstrate the e↵ectiveness of our approach with a number of real world examples.


A novel ultra low power temperature sensor for UHF RFID tag chip is presented. The sensor consists of a constant pulse generator, a temperature related oscillator, a counter and a bias. Conversion of temperature to digital output is fulfilled by counting the number of the clocks of the temperature related oscillator in a constant pulse period. The sensor uses time domain comparing, where high power consumption bandgap voltage references and traditional ADCs arc not needed. The sensor is realized in a standard 0.18 mum CMOS process, and the area is only 0.2 mm2. The accuracy of the temperature sensor is plusmn1degC after calibration. The power consumption of the sensor is only 0.9 muW.


Benefits of an active spine supported bounding locomotion with a small compliant quadruped robot

We studied the effect of the control of an active spine versus a fixed spine, on a quadruped robot running in bound gait. Active spine supported actuation led to faster locomotion, with less foot sliding on the ground, and a higher stability to go straight forward. However, we did no observe an improvement of cost of transport of the spine-actuated, faster robot system compared to the rigid spine.


Walking Robots and the Central and Peripheral Control of Locomotion in Insects

This paper outlines aspects of locomotor control in insects that may serve as the basis for the design of controllers for autonomous hexapod robots. Control of insect walking can be considered hierarchical and modular. The brain determines onset, direction, and speed of walking. Coordination is done locally in the ganglia that control leg movements. Typically, networks of neurons capable of generating alternating contractions of antagonistic muscles (termed central pattern generators, or CPGs) control the stepping movements of individual legs. The legs are coordinated by interactions between the CPGs and sensory feedback from the moving legs. This peripheral feedback provides information about leg load, position, velocity, and acceleration, as well as information about joint angles and foot contact. In addition, both the central pattern generators and the sensory information that feeds them may be modulated or adjusted according to circumstances. Consequently, locomotion in insects is extraordinarily robust and adaptable.


"Cheap" Rapid Locomotion of a Quadruped Robot: Self-Stabilization of Bounding Gait

The legged animals are capable of rapid, energy efficient, and adaptive locomotion in a complex environment. Toward a comprehensive understanding of the nature of such ecologically balanced legged locomotion, in this paper, we propose a novel method to achieve a form of bounding gait for a quadruped robot by using a minimalistic approach. Although this method uses a simple sinusoidal position control with no global sensory feedback, it is shown that the rapid bounding is possible in a relatively robust manner by properly exploiting the intrinsic dynamics and the interaction with the environment. The behavioral analyses with the robot experiments show that this relatively complicated dynamic locomotion is achieved even with a simple controller mainly because of a self-stabilization mechanism. Moreover, by exploiting this mechanism of self-stabilization, we propose a unique approach to control the forward velocity of the locomotion.


Modeling and Experiments of Untethered Quadrupedal Running with a Bounding Gait: The Scout II Robot

In this paper we compare models and experiments involving Scout II, an untethered four-legged running robot with only one actuator per compliant leg. Scout II achieves dynamically stable running of up to 1.3 m s−1 on flat ground via a bounding gait. Energetics analysis reveals a highly efficient system with a specific resistance of only 1.4. The running controller requires no task-level or body-state feedback, and relies on the passive dynamics of the mechanical system. These results contribute to the increasing evidence that apparently complex dynamically dexterous tasks may be controlled via simple control laws. We discuss general modeling issues for dynamically stable legged robots. Two simulation models are compared with experimental data to test the validity of common simplifying assumptions. The need for including motor saturation and non-rigid torque transmission characteristics in simulation models is demonstrated. Similar issues are likely to be important in other dynamically stable legged robots as well. An extensive suite of experimental results documents the robot’s performance and the validity of the proposed


Real-Time Tracking of Non-Rigid Objects Using Mean Shift

A new method for r eal-time tracking of non-rigid objects seen from a moving camera is proposed. The central computational module is based on the mean shift iterations and nds the most probable tar get p osition in the current frame. The dissimilarity between the target model (its c olor distribution) and the target candidates is expr essed by a metric derive d from the Bhattacharyya coe cient. The theoretical analysis of the approach shows that it relates to the Bayesian framework while providing a practical, fast and e cient solution. The capability of the tracker to handle in real-time partial occlusions, signi cant clutter, and target scale variations, is demonstrated for several image sequences.


s Association rule mining identifies the remarkable association or relationship between a large set of data items. With huge quantity of data constantly being obtained and stored in databases, several industries are becoming concerned in mining association rules from their databases. For example, the detection of interesting association relationships between large quantities of business transaction data can assist in catalog design, cross-marketing, lossleader analysis, and various business decision making processes. A typical example of association rule mining is market basket analysis. This method examines customer buying patterns by identifying associations among various items that customers place in their shopping baskets. The identification of such associations can assist retailers expand marketing strategies by gaining insight into which items are frequently purchased jointly by customers. It is helpful to examine the customer purchasing behavior and assists in increasing the sales and conserve inventory by focusing on the point of sale transaction data. This work acts as a broad area for the researchers to develop a better data mining algorithm. This paper presents a survey about the existing data mining algorithm for market basket analysis. Keyewords : Association Rule Mining, Apriori Algorithm, Market Basket Analysis GJCST Classification : H.2.8 A Survey on Data Mining Algorithm for Market Basket Analysis Strictly as per the compliance and regulations of: Global Journal of Computer Science and Technology Volume 11 Issue 11 Version 1.0 July 2011 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172 & Print ISSN: 0975-4350


Functional connectivity in the resting brain: a network analysis of the default mode hypothesis.

Functional imaging studies have shown that certain brain regions, including posterior cingulate cortex (PCC) and ventral anterior cingulate cortex (vACC), consistently show greater activity during resting states than during cognitive tasks. This finding led to the hypothesis that these regions constitute a network supporting a default mode of brain function. In this study, we investigate three questions pertaining to this hypothesis: Does such a resting-state network exist in the human brain? Is it modulated during simple sensory processing? How is it modulated during cognitive processing? To address these questions, we defined PCC and vACC regions that showed decreased activity during a cognitive (working memory) task, then examined their functional connectivity during rest. PCC was strongly coupled with vACC and several other brain regions implicated in the default mode network. Next, we examined the functional connectivity of PCC and vACC during a visual processing task and show that the resultant connectivity maps are virtually identical to those obtained during rest. Last, we defined three lateral prefrontal regions showing increased activity during the cognitive task and examined their resting-state connectivity. We report significant inverse correlations among all three lateral prefrontal regions and PCC, suggesting a mechanism for attenuation of default mode network activity during cognitive processing. This study constitutes, to our knowledge, the first resting-state connectivity analysis of the default mode and provides the most compelling evidence to date for the existence of a cohesive default mode network. Our findings also provide insight into how this network is modulated by task demands and what functions it might subserve.