A comparative assessment of classification methods

Classification systems play an important role in business decision-making tasks by classifying the available information based on some criteria. The objective of this research is to assess the relative performance of some well-known classification methods. We consider classification techniques that are based on statistical and AI techniques. We use synthetic data to perform a controlled experiment in which the data characteristics are systematically altered to introduce imperfections such as nonlinearity, multicollinearity, unequal covariance, etc. Our experiments suggest that data characteristics considerably impact the classification performance of the methods. The results of the study can aid in the design of classification systems in which several classification methods can be employed to increase the reliability and consistency of the classification. D 2002 Elsevier Science B.V. All rights reserved.


Islamic star patterns from polygons in contact

We present a simple method for rendering Islamic star patterns based on Hankin’s “polygons-in-contact” technique. The method builds star patterns from a tiling of the plane and a small number of intuitive parameters. We show how this method can be adapted to construct Islamic designs reminiscent of Huff’s parquet deformations. Finally, we introduce a geometric transformation on tilings that expands the range of patterns accessible using our method. This transformation simplifies construction techniques given in previous work, and clarifies previously unexplained relationships between certain classes of star patterns.


Exact clothing retrieval approach based on deep neural network

In recent years, the trend of shopping for clothing on an onscreen character has been raising. Unfortunately, clothes that appear on screen could be difficult to track down, much less to purchase directly. It is a challenging task to find out exactly what the clothing in a TV show is from massive amounts of clothing items in online clothing retails due to the clearly noticeable visual discrepancies of the same clothing in video and in online shop photos. In order to tackle the problem, we adopt the deep neural network to learn recognizable clothing-specific feature for finding the exact clothing item in the video scenario among a large collection of online shop images. The experiments shows the clothing-specific feature is more effective in retrieval task and color filtering improve the retrieval performance.


Multi-objective optimisation algorithms for GIS-based multi-criteria decision analysis : an application for evacuation planning

Geographic Information Systems have gradually acquired greater relevance as tools to support decision-making processes, and during the last decades they have been used in conjunction with Multi-Criteria Decision Analysis techniques (GIS-MCDA) to solve real-world spatial problems. GIS-MCDA can be generally divided in two main approaches: Multi-Attribute and MultiObjective techniques. Until now most of the applications of GIS-MCDA have been focused only on using the multi-attribute approach, and less than 10% of the research has been related to a specific type of multi-objective technique: the use of heuristic/meta-heuristic algorithms. The present study explores how different heuristic/meta-heuristic methods perform on solving a spatial multi-objective optimisation problem. To achieve this, four algorithms representing different types of heuristics methods were implemented, and applied to solve the same spatial multi-objective optimisation problem related with an evacuation planning situation. The implemented algorithms were Standard Particle Swarm Optimisation (SPSO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), Archived Multi-Objective Simulated Annealing (AMOSA) and Multi-Objective Grey Wolf Optimiser (MOGWO). The results show that the four algorithms were effective on solving the given problem, although in general AMOSA and MOGWO had a higher performance for the evaluated aspects (number of solutions, effectiveness of the optimisation, diversity, execution time and repeatability). However, the differences in the results obtained from each algorithm were not clear enough to state that one type of heuristic is superior than others. Since AMOSA and MOGWO are the most recent algorithms among the implemented ones, they include several improvements achieved by the latest research, and their superior performance could be connected to these improvements more than to the specific type of algorithms they belong to. Further research is suggested to explore the suitability of these methods for many-objectives spatial problems, to consider the temporal variability and dynamism of real-world situations, to create a standard set of algorithms to be used for benchmarking, and to integrate them with the currently available GIS-MCDA tools. Despite this, from the performed research it is possible to conclude that heuristics methods are reliable techniques for solving spatial problems with multiple and conflictive objectives, and future research and practical implementations in this field can strengthen the capacities of GIS as a multi-criteria decisionmaking support tool.


Cosine similarity based fingerprinting algorithm in WLAN indoor positioning against device diversity

The fingerprinting location method is commonly used in WLAN indoor positioning system. Device diversity (DD) which leads to Received Signal Strength (RSS) value difference between the users' device and the reference device is becoming an increasingly important factor impacting the positioning accuracy. Thus, the device diversity is a key problem gained more and more attention in fingerprinting location system recently, which introduces many uncertainties to the positioning result. Traditionally, the Euclidean distance is widely adopted in fingerprinting method. However, when encountering with RSS value difference caused by device diversity, the localization performance is degraded significantly. Due to this problem, our paper proposes a method employing cosine similarity instead of the Euclidean distance to improve the positioning accuracy about 13.15% higher within 2 meters when device diversity exists in the positioning. The experiment results show that the proposed method presents a good performance without the expenses of computation caused by calibration method which is employed in many previous works.


Design comparison of NdFeB and ferrite radial flux magnetic gears

Magnetic gears promise the benefits of mechanical gears with added advantages from contactless power transfer. Although most literature focuses on minimizing the size of magnetic gears, their material costs must also be reduced to achieve economic feasibility. This work compares the active material costs of NdFeB and ferrite radial flux magnetic gears with surface permanent magnets through a parametric 2D and 3D finite element analysis (FEA) study. Differences in optimal design trends such as pole count and magnet thicknesses are illustrated for the two materials. The results demonstrate that, for most historical price combination scenarios, NdFeB gear designs are capable of achieving lower active material costs than ferrite gear designs, and they are always capable of achieving much higher torque densities. Based on the selected design constraints, relative to a nominal ferrite cost of $10/kg, NdFeB must cost more than $90/kg before ferrite is cost competitive. Additionally, contour plots are provided to show the impact of material price rate variation on the cost break points.


iPCA : An Interactive System for PCA-based Visual Analytics

Principle Component Analysis (PCA) is a widely used mathematical technique in many fields for factor and trend analysis, dimension reduction, etc. However, it is often considered to be a “black box” operation whose results are difficult to interpret and sometimes counter-intuitive to the user. In order to assist the user in better understanding and utilizing PCA, we have developed a system that visualizes the results of principal component analysis using multiple coordinated views and a rich set of user interactions. Our design philosophy is to support analysis of multivariate datasets through extensive interaction with the PCA output. To demonstrate the usefulness of our system, we performed a comparative user study with a known commercial system, SAS/INSIGHT’s Interactive Data Analysis. Participants in our study solved a number of high-level analysis tasks with each interface and rated the systems on ease of learning and usefulness. Based on the participants’ accuracy, speed, and qualitative feedback, we observe that our system helps users to better understand relationships between the data and the calculated eigenspace, which allows the participants to more accurately analyze the data. User feedback suggests that the interactivity and transparency of our system are the key strengths of our approach.


Fusion of time-of-flight depth and stereo for high accuracy depth maps

Time-of-flight range sensors have error characteristics which are complementary to passive stereo. They provide real time depth estimates in conditions where passive stereo does not work well, such as on white walls. In contrast, these sensors are noisy and often perform poorly on the textured scenes for which stereo excels. We introduce a method for combining the results from both methods that performs better than either alone. A depth probability distribution function from each method is calculated and then merged. In addition, stereo methods have long used global methods such as belief propagation and graph cuts to improve results, and we apply these methods to this sensor. Since time-of-flight devices have primarily been used as individual sensors, they are typically poorly calibrated. We introduce a method that substantially improves upon the manufacturerpsilas calibration. We show that these techniques lead to improved accuracy and robustness.


An adaptive and adaptable learning platform with realtime eye-tracking support: lessons learned

For a learning platform to be adapti ve, it needs to monitor the user in r ealtime. At the ScienceCampus Tübingen, we conduct empirical research on learning strategies, in particular with regard to system adaptivity. Our experimental Webbased adaptiv e multimedia learning environment is able to communicate with an eyetracking system in real-time, and l inks gaze data to browser-based learning content. By processing simple evaluation scripts in the browser, we can control the learning process by adapting the learning content in response to predefined conditions and user inputs. The experimental system serves as a basis for a series of psyc hologi al studies in the learning context. We have already conducted some studies with our experimental learning platform, but its devel opment is still ongoing. In particular, we are adding new feature s required for future studies. In this paper, we desc ribe the actual state of our experimental learning environment, lessons learned from its a pplication in the studies, and our plans for future devel opment.


Evaluation of 3D Feature Descriptors for Multi-modal Data Registration

We propose a framework for 2D/3D multi-modal data registration and evaluate 3D feature descriptors for registration of 3D datasets from different sources. 3D datasets of outdoor environments can be acquired using a variety of active and passive sensor technologies. Registration of these datasets into a common coordinate frame is required for subsequent modelling and visualisation. 2D images are converted into 3D structure by stereo or multiview reconstruction techniques and registered to a unified 3D domain with other datasets in a 3D world. Multi-modal datasets have different density, noise, and types of errors in geometry. This paper provides a performance benchmark for existing 3D feature descriptors across multi-modal datasets. This analysis highlights the limitations of existing 3D feature detectors and descriptors which need to be addressed for robust multi-modal data registration. We analyse and discuss the performance of existing methods in registering various types of datasets then identify future directions required to achieve robust multi-modal data registration.


2005: Tutorial on Agent-Based Modeling and Simulation

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


A Dempster-Shafer theoretic conditional approach to evidence updating for fusion of hard and soft data

Fusion of hard data with soft data is an issue that has attracted recent attention. An effective fusion strategy requires an analytical framework that can capture the uncertainty inherent in hard and soft data. For instance, computational linguistic parsing of text-based data generates logical propositions that inherently possess significant semantic ambiguity. An effective fusion framework must exploit the respective advantages of hard and soft data while mitigating their particular weaknesses. In this paper, we describe a Dempster-Shafer theoretic approach to hard and soft data fusion that relies upon the novel conditional approach to updating. The conditional approach engenders a more flexible method that allows for tuning and adapting update strategies. When computational complexity concerns are taken into account, it also provides guidance on how evidence could be ordered for updating. This has important implications in working with models that convert propositional logic statements from text into Dempster-Shafer theoretic form.


Guidelines for critique of a research report.

Before findings reported in a research article are used to change clinical practice, the research must be evaluated for evidence of credibility, integrity, and potential for replication. This paper provides guidelines for use in evaluating deductive, empirical research. The standards presented in this paper are derived from the tenets of the scientific method, measurement theory, statistical principles, and research ethics. The guidelines may be used to evaluate each section of a research report, from the title to the interpretation of findings.


High Performance Computer Acoustic Data Accelerator: A New System for Exploring Marine Mammal Acoustics for Big Data Applications

This paper presents a new software model designed for distributed sonic signal detection runtime using machine learning algorithms called DeLMA. A new algorithm--Acoustic Data-mining Accelerator (ADA)--is also presented. ADA is a robust yet scalable solution for efficiently processing big sound archives using distributing computing technologies. Together, DeLMA and the ADA algorithm provide a powerful tool currently being used by the Bioacoustics Research Program (BRP) at the Cornell Lab of Ornithology, Cornell University. This paper provides a high level technical overview of the system, and discusses various aspects of the design. Basic runtime performance and project summary are presented. The DeLMA-ADA baseline performance comparing desktop serial configuration to a 64 core distributed HPC system shows as much as a 44 times faster increase in runtime execution. Performance tests using 48 cores on the HPC shows a 9x to 12x efficiency over a 4 core desktop solution. Project summary results for 19 east coast deployments show that the DeLMA-ADA solution has processed over three million channel hours of sound to date.


Effects of small-sided games on physical conditioning and performance in young soccer players.

The purpose of this study was to examine, first, the movement actions performed during two different small-sided games and, second, their effects on a series of field endurance and technical tests. Thirty-four young soccer players (age: 13 ± 0.9 yrs; body mass: 62.3 ± 15.1 kg; height: 1.65 ± 0.06 m) participated in the study. Small-sided games included three-a-side (3 versus 3 players) and six-a-side (6 versus 6 players) games consisting of 10 bouts of 4 min duration with 3 min active recovery between bouts. Soccer player performance was evaluated using five field tests: a) 30m sprint, b) throw-in for distance, c) Illinois Agility Test, d) dribbling the ball and e) horizontal jump before, in the middle and after the implementation of both game situations. Heart rate was monitored during the entire testing session. Each game was also filmed to measure soccer movements within the game. The ANOVA analysis indicated that the three-a- side games displayed significantly higher heart rate values compared with the six-a-side games (p < 0.05). The number of short passes, kicks, tackles, dribbles and scoring goals were significantly higher during the three-a-side compared with the six-a-side game condition (p < 0. 05) while players performed more long passes and headed the ball more often during the six-a-side (p < 0.05). After the three-a-side games, there was a significant decline in sprint and agility performance (p < 0.05), while after both game conditions significant alterations in the throw-in and the horizontal jump performance were observed (p < 0.05). The results of the present study indicated that three-a-side games provide higher stimulus for physical conditioning and technical improvement than six-a-side games and their use for training young soccer players is recommended. Key pointsThree-a-side games display higher HR compared with six-a-side games.In the three-a-side games players performed more short passes, kicks, dribbles, tackles and scored more goals compared with the six-a-side games.Impairment in endurance and field test performance was observed mainly after three-a-side games.The use of the three-a-side games to develop physical fitness and technique in young soccer players is recommended.


Modular Monad Transformers

During the last two decades, monads have become an indispensable tool for structuring functional programs with computational effects. In this setting, the mathematical notion of a monad is extended with operations that allow programmers to manipulate these effects. When several effects are involved, monad transformers can be used to build up the required monad one effect at a time. Although this seems to be modularity nirvana, there is a catch: in addition to the construction of a monad, the effect-manipulating operations need to be lifted to the resulting monad. The traditional approach for lifting operations is nonmodular and ad-hoc. We solve this problem with a principled technique for lifting operations that makes monad transformers truly modular.


A novel objective function for improved phoneme recognition using time delay neural networks

The authors present single- and multispeaker recognition results for the voiced stop consonants /b, d, g/ using time-delay neural networks (TDNN), a new objective function for training these networks, and a simple arbitration scheme for improved classification accuracy. With these enhancements a median 24% reduction in the number of misclassifications made by TDNNs trained with the traditional backpropagation objective function is achieved. This redundant results in /b, d, g/ recognition rates that consistently exceed 98% for TDNNs trained with individual speakers; it yields a 98.1% recognition rate for a TDNN trained with three male speakers.<<ETX>>


Combined long short-term memory based network employing wavelet coefficients for MI-EEG recognition

Motor Imagery Electroencephalography (MI-EEG) plays an important role in brain computer interface (BCI) based rehabilitation robot, and its recognition is the key problem. The Discrete Wavelet Transform (DWT) has been applied to extract the time-frequency features of MI-EEG. However, the existing EEG classifiers, such as support vector machine (SVM), linear discriminant analysis (LDA) and BP network, did not make full use of the time sequence information in time-frequency features, the resulting recognition performance were not very ideal. In this paper, a Long Short-Term Memory (LSTM) based recurrent Neural Network (RNN) is integrated with Discrete Wavelet Transform (DWT) to yield a novel recognition method, denoted as DWT-LSTM. DWT is applied to analyze the each channel of MI-EEG and extract its effective wavelet coefficients, representing the time-frequency features. Then a LSTM based RNN is used as a classifier for the patten recognition of observed MI-EEG data. Experiments are conducted on a publicly available dataset, and the 5-fold cross validation experimental results show that DWT-LSTM yields relatively higher classification accuracies compared to the existing approaches. This is helpful for the further research and application of RNN in processing of MI-EEG.


A review of soft computing applications in supply chain management

It is broadly recognised by global companies that supply chain management is one of the major core competencies for an organisation to compete in the marketplace. Organisational strategies are mainly concentrated on improvement of customer service levels as well as reduction of operational costs in order to maintain profit margins. Therefore supply chain performance has attracted researchers’ attention. A variety of soft computing techniques including fuzzy logic and genetic algorithms have been employed to improve effectiveness and efficiency in various aspects of supply chain management. Meanwhile, an increasing number of papers have been published to address related issues. The aim of this paper is to summarise the findings by a systematic review of existing research papers concerning the application of soft computing techniques to supply chain management. Some areas in supply chain management that have rarely been exposed in existing papers, such as customer relationship management and reverse logistics, are therefore suggested for future research. 2009 Elsevier B.V. All rights reserved.


Consumer attitudes and behavior: the theory of planned behavior applied to food consumption decisions

The author compares the multi-attribute and subjective expected utility (SEU) models popular in research on consumer behavior to the approach offered by the theory of planed behavior (TPB). Unlike the multi-attribute and SEU models, the TPB relies not on revealed preferences to infer the underlying decision process but instead on direct assessment of its theoretical constructs. According to the theory, the consumer’s behavior is a function of intention to perform the behavior in question; the intention is based on attitude, subjective norm, and perceived behavioral control with respect to the behavior; and these factors are determined, respectively, by behavioral, normative, and control beliefs. The theory allows us to predict intentions and behavior with respect to the purchase or use of a single brand or product as well as in relation to choice among different brands or products.


Parent – School Involvement and School Performance : Mediated Pathways Among Socioeconomically Comparable African American and Euro-American Families

Children’s academic and social competencies were examined as mediators to explain the often positive relation between parent–school involvement and achievement. Ethnic variations in the relation between parent–school involvement and early achievement and the mediated pathways were examined. Because much of the comparative research confounds ethnicity with socioeconomic status, the relations were examined among socioeconomically comparable samples of African American and Euro-American kindergarten children and their mothers. For reading achievement, academic skills mediated the relation between involvement and achievement for African Americans and Euro-Americans. For math achievement, the underlying process differed across ethnic groups. For African Americans, academic skills mediated the relation between school involvement and math performance. For Euro-Americans, social competence mediated the impact of home involvement on school achievement.


The framing of decisions and the psychology of choice.

The psychological principles that govern the perception of decision problems and the evaluation of probabilities and outcomes produce predictable shifts of preference when the same problem is framed in different ways. Reversals of preference are demonstrated in choices regarding monetary outcomes, both hypothetical and real, and in questions pertaining to the loss of human lives. The effects of frames on preferences are compared to the effects of perspectives on perceptual appearance. The dependence of preferences on the formulation of decision problems is a significant concern for the theory of rational choice.


Android Code Protection via Obfuscation Techniques: Past, Present and Future Directions

Mobile devices have become ubiquitous due to centralization of private user information, contacts, messages and multiple sensors. Google Android, an open-source mobile Operating System (OS), is currently the market leader. Android popularity has motivated the malware authors to employ set of cyber attacks leveraging code obfuscation techniques. Obfuscation is an action that modifies an application (app) code, preserving the original semantics and functionality to evade anti-malware. Code obfuscation is a contentious issue. Theoretical code analysis techniques indicate that, attaining a verifiable and secure obfuscation is impossible. However, obfuscation tools and techniques are popular both among malware developers (to evade anti-malware) and commercial software developers (protect intellectual rights). We conducted a survey to uncover answers to concrete and relevant questions concerning Android code obfuscation and protection techniques. The purpose of this paper is to review code obfuscation and code protection practices, and evaluate efficacy of existing code de-obfuscation tools. In particular, we discuss Android code obfuscation methods, custom app protection techniques, and various de-obfuscation methods. Furthermore, we review and analyze the obfuscation techniques used by malware authors to evade analysis efforts. We believe that, there is a need to investigate efficiency of the defense techniques used for code protection. This survey would be beneficial to the researchers and practitioners, to understand obfuscation and de-obfuscation techniques to propose novel solutions on Android.


Automated Plant Disease Analysis (APDA): Performance Comparison of Machine Learning Techniques

Plant disease analysis is one of the critical tasks in the field of agriculture. Automatic identification and classification of plant diseases can be supportive to agriculture yield maximization. In this paper we compare performance of several Machine Learning techniques for identifying and classifying plant disease patterns from leaf images. A three-phase framework has been implemented for this purpose. First, image segmentation is performed to identify the diseased regions. Then, features are extracted from segmented regions using standard feature extraction techniques. These features are then used for classification into disease type. Experimental results indicate that our proposed technique is significantly better than other techniques used for Plant Disease Identification and Support Vector Machines outperforms other techniques for classification of diseases.


Adaptive content generation for games

From a simple entertainment activity to a learning tool, it is undeniable that video games are one of the most active and relevant areas in today's society. Since their inception, video games experienced an evolution unmatched by almost any other area and today's video games are complex pieces of software built by expensive multidisciplinary teams. Procedural Content Generation (PCG) offers an alternative to manual design of video game content, optimizing the process of development and thus reducing its cost. However, the content that is generated by traditional PCG techniques is usually very generic and it struggles to offer meaningful game experiences to a diverse player base. Recent years have brought some new PCG techniques that try to solve this problem by dynamically adjusting the generation of content to suit the needs of each individual player. The work presented in this paper focuses on the development of a new PCG methodology that aims to close the gap between game developers and their players. This is achieved by providing the developers with relevant real time player and playing context information and thus creating an easier way for developers to adjust their content generation process in run time to better suit the needs of each player. This was achieved by first designing a methodology that models the player, their context and the game. It was also developed a simple game to showcase the potential of such methodology. The end result was a game that adapts some of its content to different types of players and contexts.


eSOLHotel: Generación de un lexicón de opinión en español adaptado al dominio turístico

Since Web 2.0 is the largest container for subjective expressions about different topics or issues expressed in all languages, the study of Sentiment Analysis has grown exponentially. In this work, we focus on Spanish polarity classification of hotel reviews and a new domain-dependent lexical resource (eSOLHotel) is presented. This new lexicon has been compiled following a corpus-based approach. We have carried out several experiments using an unsupervised approach for the polarity classification over the category of hotels from corpus SFU. The results obtained with the new lexicon eSOLHotel outperform the results with other general purpose lexicon.


Exact matrix completion via convex optimization

Suppose that one observes an incomplete subset of entries selected from a low-rank matrix. When is it possible to complete the matrix and recover the entries that have not been seen? We demonstrate that in very general settings, one can perfectly recover all of the missing entries from most sufficiently large subsets by solving a convex programming problem that finds the matrix with the minimum nuclear norm agreeing with the observed entries. The techniques used in this analysis draw upon parallels in the field of compressed sensing, demonstrating that objects other than signals and images can be perfectly reconstructed from very limited information.


A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks

The idea of programmable networks has recently re-gained considerable momentum due to the emergence of the Software-Defined Networking (SDN) paradigm. SDN, often referred to as a "radical new idea in networking", promises to dramatically simplify network management and enable innovation through network programmability. This paper surveys the state-of-the-art in programmable networks with an emphasis on SDN. We provide a historic perspective of programmable networks from early ideas to recent developments. Then we present the SDN architecture and the OpenFlow standard in particular, discuss current alternatives for implementation and testing of SDN-based protocols and services, examine current and future SDN applications, and explore promising research directions based on the SDN paradigm.


Evaluation of Local Spatio-temporal Features for Action Recognition

Local space-time features have recently become a popular video representation for action recognition. Several methods for feature localization and description have been proposed in the literature, and promising recognition results were demonstrated for different action datasets. The comparison of those methods, however, is limited given the different experimental settings and various recognition methods used. The purpose of this paper is first to define a common evaluation setup to compare local space-time detectors and descriptors. All experiments are reported for the same bag-of-features SVM recognition framework. Second, we provide a systematic evaluation of different spatio-temporal features. We evaluate the performance of several space-time interest point detectors and descriptors along with their combinations on datasets with varying degree of difficulty. We also include a comparison with dense features obtained by regular sampling of local space-time patches. Feature detectors. In our experimental evaluation, we consider the following feature detectors. (1) The Harris3D detector [3] extends the Harris detector for images to image sequences. At each video point, a spatio-temporal second-moment matrix μ is computed using a separable Gaussian smoothing function and space-time gradients. Interest points are located at local maxima of H = det(μ)− k trace3(μ). (2) The Cuboid detector [1] is based on temporal Gabor filters. The response function has the form: R = (I ∗ g ∗ hev) + (I ∗ g ∗ hod), where g(x,y;σ) is the 2D Gaussian smoothing kernel, and hev and hod are 1D Gabor filters. Interest points are detected at local maxima of R. (3) The Hessian detector [6] is a spatio-temporal extension of the Hessian saliency measure. The determinant of the 3D Hessian matrix is used to measure saliency. The determinant of the Hessian is computed over several spatial and temporal scales. A non-maximum suppression algorithm selects extrema as interest points. (4) Dense sampling extracts multi-scale video blocks at regular positions in space and time and for varying scales. In our experiments, we sample cuboids with 50% spatial and temporal overlap. Feature descriptors. The following feature descriptors are investigated. (1) For the Cuboid descriptor [1], gradients computed for each pixel in a cuboid region are concatenated into a single vector. PCA projects vectors to a lower dimensional space. (2) The HOG/HOF descriptors [4] divide a cuboid region into a grid of cells. For each cell, 4-bin histograms of gradient orientations (HOG) and 5-bin histograms of optic flow (HOF) are computed. Normalized histograms are concatenated into HOG, HOF as well as HOG/HOF descriptor vectors. (3) The HOG3D descriptor [2] is based on histograms of 3D gradient orientations. Gradients are computed via an integral video representations. Regular polyhedrons are used to uniformly quantize the orientation of spatio-temporal gradients. A given 3D volume is divided into a grid of cells. The corresponding descriptor concatenates gradient histograms of all cells. (4) The extended SURF (ESURF) descriptor [6] extends the image SURF descriptor to videos. Again 3D cuboids are divided into a grid of cells. Each cell is represented by a weighted sum of uniformly sampled responses of Haar-wavelets aligned with the three axes. Experimental Setup. We represent video sequences as a bag of local spatio-temporal features [5]. Spatio-temporal features are first quantized HOG3D HOG/HOF HOG HOF Cuboids ESURF Harris3D 89.0% 91.8% 80.9% 92.1% – – Cuboids 90.0% 88.7% 82.3% 88.2% 89.1% – Hessian 84.6% 88.7% 7767% 88.6% – 81.4% Dense 85.3% 86.1% 79.0% 88.0% – – Table 1: Average accuracy on the KTH actions dataset.


Gender Recognition Based on Sift Features

This paper proposes a robust approach for face detection and gender classification in color images. Previous researches about gender recognition suppose an expensive computational and time-consuming pre-processing step in order to alignment in which face images are aligned so that facial landmarks like eyes, nose, lips, chin are placed in uniform locations in image. In this paper, a novel technique based on mathematical analysis is represented in three stages that eliminates alignment step. First, a new color based face detection method is represented with a better result and more robustness in complex backgrounds. Next, the features which are invariant to affine transformations are extracted from each face using scale invariant feature transform (SIFT) method. To evaluate the performance of the proposed algorithm, experiments have been conducted by employing a SVM classifier on a database of face images which contains 500 images from distinct people with equal ratio of male and female.


Data integration driven ontology design, case study smart city

Methods to design of formal ontologies have been in focus of research since the early nineties when their importance and conceivable practical application in engineering sciences had been understood. However, often significant customization of generic methodologies is required when they are applied in tangible scenarios. In this paper, we present a methodology for ontology design developed in the context of data integration. In this scenario, a targeting ontology is applied as a mediator for distinct schemas of individual data sources and, furthermore, as a reference schema for federated data queries. The methodology has been used and evaluated in a case study aiming at integration of buildings' energy and carbon emission related data. We claim that we have made the design process much more efficient and that there is a high potential to reuse the methodology.


Hand Gesture Recognition using Computer Vision

The use of the gesture system in our daily life as a natural human-human interaction has inspired the researchers to simulate and utilize this gift in human-machine interaction which is appealing and can take place the bore interaction ones that existed such as television, radio, and various home appliances as well as virtual reality will worth and deserve its name. This kind of interaction ensures promising and satisfying outcomes if applied in systematic approach, and supports unadorned human hand when transferring the message to these devices which is easiest, comfort and desired rather than the communication that requires frills to deliver the message to such devices. With the rapid emergence of 3d applications and virtual environments in computer system the need for a new type of interaction device arises. This is because the traditional devices such as mouse, keyboard and joystick become inefficient and cumbersome within this virtual environments.in other words evolution of user interfaces shapes the change in the HumanComputer Interaction (HCI).Intuitive and naturalness characteristics of “Hand Gestures” in the HCI have been the driving force and motivation to develop an interaction device which can replace current unwieldy tools. A survey on the methods of analysing, modelling and recognizing hand gestures in the context of the HCI is provided in this paper.


A Theoretic Framework of K-Means-Based Consensus Clustering

Consensus clustering emerges as a promising solution to find cluster structures from data. As an efficient approach for consensus clustering, the Kmeans based method has garnered attention in the literature, but the existing research is still preliminary and fragmented. In this paper, we provide a systematic study on the framework of K-meansbased Consensus Clustering (KCC). We first formulate the general definition of KCC, and then reveal a necessary and sufficient condition for utility functions that work for KCC, on both complete and incomplete basic partitionings. Experimental results on various real-world data sets demonstrate that KCC is highly efficient and is comparable to the state-of-the-art methods in terms of clustering quality. In addition, KCC shows high robustness to incomplete basic partitionings with substantial missing values.


Pose estimation of anime/manga characters: a case for synthetic data

2D articulated pose estimation is the task of locating the body joint positions of a human figure in an image. A pose estimator that works on anime/manga images could be an important component of an automatic system to create 3D animation from existing manga or anime, which could significantly the lower cost of media production. To create an accurate pose estimator, however, a sizable and high-quality dataset is needed, and such a dataset can be expensive to create.
 To alleviate data scarcity, we propose using a database of 3D character models and poses to generate synthetic training data for 2D pose estimators of anime/manga characters based on convolutional neural networks (CNN). We demonstrate that a high-performing estimator can be obtained by pretraining a network on a large synthetic dataset and then fine-tuning it on a small dataset of drawings. We also show that the approach yields a pose estimator competitive with many previous works when applied to a photograph-based dataset, establishing our synthetic data's usefulness beyond the intended domain.


A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a nonprobabilistic model of constrained sources. The compression ratio achieved by the proposed universal code uniformly approaches the lower bounds on the compression ratios attainable by block-to-variable codes and variable-to-block codes designed to match a completely specified source.


RoboADS: Anomaly Detection Against Sensor and Actuator Misbehaviors in Mobile Robots

Mobile robots such as unmanned vehicles integrate heterogeneous capabilities in sensing, computation, and control. They are representative cyber-physical systems where the cyberspace and the physical world are strongly coupled. However, the safety of mobile robots is significantly threatened by cyber/physical attacks and software/hardware failures. These threats can thwart normal robot operations and cause robot misbehaviors. In this paper, we propose a novel anomaly detection system, which leverages physical dynamics of mobile robots to detect misbehaviors in sensors and actuators. We explore issues raised in real-world implementations, e.g., distinctive robot dynamic models, sensor quantity and quality, decision parameters, etc., for practicality purposes. We implement the detection system on two types of mobile robots and evaluate the detection performance against various misbehavior scenarios, including signal interference, sensor spoofing, logic bomb and physical jamming. The experiments show detection effectiveness and small detection delays.


Loginson: a transform and load system for very large-scale log analysis in large IT infrastructures

Nowadays, most systems and applications produce log records that are useful for security and monitoring purposes such as debugging programming errors, checking system status, and detecting configuration problems or even attacks. To this end, a log repository becomes necessary whereby logs can be accessed and visualized in a timely manner. This paper presents Loginson, a high-performance log centralization system for large-scale log collection and processing in large IT infrastructures. Besides log collection, Loginson provides high-level analytics through a visual interface for the purpose of troubleshooting critical incidents. We note that Loginson outperforms all of the other log centralization solutions by taking full advantage of the vertical scalability, and therefore decreasing Capital Expenditure (CAPEX) and Operating Expense (OPEX) costs for deployment scenarios with a huge volume of log data.


Factors Influencing Consumers ’ E-Commerce Commodity Purchases

The 2002 North America Online Report published by eMarketer estimates that almost 24 million pre-college age students (ages 9-17) are already shopping online and gaining valuable e-commerce purchasing experience. Estimates of online shopping usage project steady growth, the number of young adults buying online will increase proportionally. This research seeks to develop a better understanding of the factors motivating young people to select e-commerce vendors for commodity purchases by exploring attitudes, demographic characteristics and purchase decision perceptions (i.e., the product, shopping experience, customer service, and consumer risk). Findings indicate that young adults with a history of e-commerce purchasing experience have a more positive attitude towards online buying than do young adults without e-commerce purchasing experience. In a related finding, a history of e-commerce purchasing experience serves as a good predictor of future e-commerce commodity purchases. Additionally, consumer risk and shopping experience perceptions were found to influence experienced e-commerce shoppers’ commodity purchase decisions more than customer service or consumer risk.


Orbitofrontal cortex, decision-making and drug addiction

The orbitofrontal cortex, as a part of prefrontal cortex, is implicated in executive function. However, within this broad region, the orbitofrontal cortex is distinguished by its unique pattern of connections with crucial subcortical associative learning nodes, such as basolateral amygdala and nucleus accumbens. By virtue of these connections, the orbitofrontal cortex is uniquely positioned to use associative information to project into the future, and to use the value of perceived or expected outcomes to guide decisions. This review will discuss recent evidence that supports this proposal and will examine evidence that loss of this signal, as the result of drug-induced changes in these brain circuits, might account for the maladaptive decision-making that characterizes drug addiction.


Deep Underwater Image Enhancement

In an underwater scene, wavelength-dependent light absorption and scattering degrade the visibility of images, causing low contrast and distorted color casts. To address this problem, we propose a convolutional neural network based image enhancement model, i.e., UWCNN, which is trained efficiently using a synthetic underwater image database. Unlike the existing works that require the parameters of underwater imaging model estimation or impose inflexible frameworks applicable only for specific scenes, our model directly reconstructs the clear latent underwater image by leveraging on an automatic end-to-end and data-driven training mechanism. Compliant with underwater imaging models and optical properties of underwater scenes, we first synthesize ten different marine image databases. Then, we separately train multiple UWCNN models for each underwater image formation type. Experimental results on real-world and synthetic underwater images demonstrate that the presented method generalizes well on different underwater scenes and outperforms the existing methods both qualitatively and quantitatively. Besides, we conduct an ablation study to demonstrate the effect of each component in our network.


A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection

We review accuracy estimation methods and compare the two most commonmethods cross validation and bootstrap Recent experimen tal results on arti cial data and theoretical re sults in restricted settings have shown that for selecting a good classi er from a set of classi ers model selection ten fold cross validation may be better than the more expensive leave one out cross validation We report on a large scale experiment over half a million runs of C and a Naive Bayes algorithm to estimate the e ects of di erent parameters on these al gorithms on real world datasets For cross validation we vary the number of folds and whether the folds are strati ed or not for boot strap we vary the number of bootstrap sam ples Our results indicate that for real word datasets similar to ours the best method to use for model selection is ten fold strati ed cross validation even if computation power allows using more folds


Natural language Interface for Database: A Brief review

Information is playing an important role in our lives. One of the major sources of information is databases. Databases and database technology are having major impact on the growing use of computers. Almost all IT applications are storing and retrieving information from databases. Retrieving information database requires knowledge of database languages like SQL. The Structured Query Language (SQL) norms are been pursued in almost all languages for relational database systems. However, not everybody is able to write SQL queries as they may not be aware of the structure of the database. So this has led to the development of Intelligent Database System ( IDBS) . There is an overwhelming need for non-expert users to query relational databases in their natural language instead of working with the values of the attributes. As a result many intelligent natural language interfaces to databases have been developed, which provides flexible options for manipulating queries. The idea of using Natural Language instead of SQL has prompted the development of new type of processing called Natural language Interface to Database. NLIDB is a step towards the development of intelligent database systems (IDBS) to enhance the users in performing flexible querying in databases. This paper is an introduction to Intelligent Database System and Natural Language Interface to Databases. Then a brief overview of NLIDB subcomponents is given and then discussion then moves on to NLIDB architectures and various approaches for the development of NLIDB systems.


Dynamic circular work-stealing deque

The non-blocking work-stealing algorithm of Arora, Blumofe, and Plaxton (henceforth ABP work-stealing) is on its way to becoming the multiprocessor load balancing technology of choice in both industry and academia. This highly efficient scheme is based on a collection of array-based double-ended queues (deques) with low cost synchronization among local and stealing processes. Unfortunately, the algorithm's synchronization protocol is strongly based on the use of fixed size arrays, which are prone to overflows, especially in the multiprogrammed environments for which they are designed. We present a work-stealing deque that does not have the overflow problem.The only ABP-style work-stealing algorithm that eliminates the overflow problem is the list-based one presented by Hendler, Lev and Shavit. Their algorithm indeed deals with the overflow problem, but it is complicated, and introduces a trade-off between the space and time complexity, due to the extra work required to maintain the list.Our new algorithm presents a simple lock-free work-stealing deque, which stores the elements in a cyclic array that can grow when it overflows. The algorithm has no limit other than integer overflow (and the system's memory size) on the number of elements that may be on the deque, and the total memory required is linear in the number of elements in the deque.


Information Systems and Healthcare XXXII: Understanding the Multidimensionality of Information Systems Use: A Study of Nurses' Use of a Mandated Electronic Medical Record System


Data-Intensive Question Answering

Microsoft Research Redmond participated for the first time in TREC this year, focusing on the question answering track. There is a separate report in this volume on the Microsoft Research Cambridge submissions for the filtering and Web tracks (Robertson et al., 2002). We have been exploring data-driven techniques for Web question answering, and modified our system somewhat for participation in TREC QA. We submitted two runs for the main QA track (AskMSR and AskMSR2).


The Nature of Statistical Learning Theory


Compact Microstrip-to-CPS Transition for UWB Application

A novel ultra-wideband (UWB) microstrip-to-CPS (coplanar stripline) transition has been developed. This transition or balun structure has several attractive advantages such as good impedance transformation, compact size and wide bandwidth. After the parallel-coupled line section between the microstrip line and CPS is investigated under varied traversal dimensions, a wide transmitting band is well achieved with the emergence of two transmission poles. Next, such a single transition circuit is optimally designed to cover the whole UWB band (3.1 GHz to 10.6 GHz). To verify the predicted results in experiment, the two back-to-back transitions with the same 50 Omega microstrip feed lines are fabricated and tested. Measured results exhibit the return loss close to 10.0 dB over a band from 3.5 GHz to 10.0 GHz.


Retrieval of Song Lyrics from Sung Queries

Retrieving the lyrics of a sung recording from a database of text documents is a research topic that has not received much attention so far. Such a retrieval system has many practical applications, e.g. for karaoke applications or for indexing large song databases by their lyric content. We present a new method for lyrics retrieval. An acoustic model trained on singing is used to obtain phoneme probabilities from sung queries, which are then mapped to phoneme sequences. These are compared against lines of textual lyrics in a large corpus in order to retrieve the best-matching song. The approach is tested on three sung datasets. Lyrics are retrieved from a set of 300 possible songs (12,000 lines of lyrics). The results are highly encouraging and could be used further to perform automatic lyrics alignment and keyword spotting for large databases of songs, or for retrieving lyrics from the internet.


IT worker turnover: an empirical examination of intrinsic motivation

This study examined intrinsic motivation's influence on information technology (IT) workers' attitudes and intentions. Drawing on Human Resource management research (Eby & Freeman, 1999), we model Intrinsic motivation as mediating the influence of motivators (i.e., intrinsic job characteristics) and hygiene factors (i.e., pay and supervisory satisfaction) on workplace attitudes (i.e., job satisfaction and affective organizational commitment). In turn, workplace attitudes mediate the influence of intrinsic motivation on turnover intention. The model was tested using data collected from public sector IT workers in the Southeastern United States. Although intrinsic motivation did not fully mediate the influence of motivators and hygiene factors, findings suggest that intrinsic motivation positively influences workplace attitudes and has a mediated influence on turnover intent. Implications for research and practice are offered.


DSCarver: decompose-and-spiral-carve for subtractive manufacturing

We present an automatic algorithm for subtractive manufacturing of freeform 3D objects using high-speed machining (HSM) via CNC. A CNC machine operates a cylindrical cutter to carve off material from a 3D shape stock, following a tool path, to "expose" the target object. Our method decomposes the input object's surface into a small number of patches each of which is fully accessible and machinable by the CNC machine, in continuous fashion, under a fixed cutter-object setup configuration. This is achieved by covering the input surface with a minimum number of accessible regions and then extracting a set of machinable patches from each accessible region. For each patch obtained, we compute a continuous, space-filling, and iso-scallop tool path which conforms to the patch boundary, enabling efficient carving with high-quality surface finishing. The tool path is generated in the form of connected Fermat spirals, which have been generalized from a 2D fill pattern for layered manufacturing to work for curved surfaces. Furthermore, we develop a novel method to control the spacing of Fermat spirals based on directional surface curvature and adapt the heat method to obtain iso-scallop carving. We demonstrate automatic generation of accessible and machinable surface decompositions and iso-scallop Fermat spiral carving paths for freeform 3D objects. Comparisons are made to tool paths generated by commercial software in terms of real machining time and surface quality.


ActiVis: Visual Exploration of Industry-Scale Deep Neural Network Models

While deep learning models have achieved state-of-the-art accuracies for many prediction tasks, understanding these models remains a challenge. Despite the recent interest in developing visual tools to help users interpret deep learning models, the complexity and wide variety of models deployed in industry, and the large-scale datasets that they used, pose unique design challenges that are inadequately addressed by existing work. Through participatory design sessions with over 15 researchers and engineers at Facebook, we have developed, deployed, and iteratively improved ActiVis, an interactive visualization system for interpreting large-scale deep learning models and results. By tightly integrating multiple coordinated views, such as a computation graph overview of the model architecture, and a neuron activation view for pattern discovery and comparison, users can explore complex deep neural network models at both the instance-and subset-level. ActiVis has been deployed on Facebook's machine learning platform. We present case studies with Facebook researchers and engineers, and usage scenarios of how ActiVis may work with different models.


Efficient and robust computation of an approximated medial axis

The medial axis can be viewed as a compact representation for an arbitrary model; it is an essential geometric structure in many applications. A number of practical algorithms for its computation have been aimed at speeding up its computation and at addressing its instabilities. In this paper we propose a new algorithm to compute the medial axis with arbitrary precision. It exhibits several desirable properties not previously combined in a practical and efficient algorithm. First, it allows for a tradeoff between computation time and accuracy, making it well-suited for applications in which an approximation of the medial axis suffices, but computational efficiency is of particular concern. Second, it is output sensitive: the computation complexity of the algorithm does not depend on the size of the representation of a model, but on the size of the representation of the resulting medial axis. Third, the densities of the approximated medial axis points in different areas are adaptive to local free space volumes, based on the assumption that a coarser approximation in wide open area can still suffice the requirements of the applications. We present theoretical results, bounding the error introduced by the approximation process. The algorithm has been implemented and experimental results are presented that illustrate its computational efficiency and robustness.


Can you hear me now?!: it must be BGP

Industry observers expect VoIP to eventually replace most of the existing land-line telephone connections. Currently however, quality and reliability concerns largely limit VoIP usage to either personal calls on cross-domain services such as Skype and Vonage, or to single-domain services such as trunking, where a core ISP carries long-distance voice as VoIP only within its backbone, to save cost with a unified voice/data infrastructure. This paper investigates the factors that prevent cross-domain VoIP deployments from achieving the quality and reliability of existing land-line telephony (PSTN). We ran over 50,000 VoIP phone calls between 24 locations in US and Europe for a three-week period. Our results indicate that VoIP usability is hindered as much by BGP's slow convergence as network congestion. In fact, about half of the unintelligible VoIP samples in our data occur within 10 minutes of a BGP update


Out-of-bag Estimation

In bagging, predictors are constructed using bootstrap samples from the training set and then aggregated to form a bagged predictor. Each bootstrap sample leaves out about 37% of the examples. These left-out examples can be used to form accurate estimates of important quantities. For instance, they can be used to give much improved estimates of node probabilities and node error rates in decision trees. Using estimated outputs instead of the observed outputs improves accuracy in regression trees. They can also be used to give nearly optimal estimates of generalization errors for bagged predictors. Introduction: We assume that there is a training set T= {(y n ,x n), n=1, ... ,N} and a method for constructing a predictor Q(x,T) using the given training set. The output variable y can either be a class label (classification) or numerical (regression). In bagging (Breiman[1996a]) a sequence of training sets T B,1 , ... , T B,K are generated of the same size as T by bootstrap selection from T. Then K predictors are constructed such that the kth predictor Q(x,T k,B) is based on the kth bootstrap training set. It was shown that if these predictors are aggregated-averaging in regression or voting in classification, then the resultant predictor can be considerably more accurate than the original predictor.


Intelligent Human Robot Interaction (iHRI)


Near-Field Microwave Imaging Based on Aperture Raster Scanning With TEM Horn Antennas

The design, fabrication, and characterization of an ultrawideband (UWB) antenna for near-field microwave imaging of dielectric objects are presented together with the imaging setup. The focus is on an application in microwave breast tumor detection. The new antenna operates as a sensor with the following properties: 1) direct contact with the imaged body; 2) more than 90% of the microwave power is coupled directly into the tissue; 3) UWB performance; 4) excellent de-coupling from the outside environment; 5) small size; and 6) simple fabrication. The antenna characterization includes return loss, total efficiency, near-field directivity, fidelity, and group velocity. The near-field imaging setup employs planar aperture raster scanning. It consists of two antennas aligned along each other's boresight and moving together to scan two parallel apertures. The imaged object lies between the two apertures. With a blind de-convolution algorithm, the images are de-blurred. Simulation and experimental results confirm the satisfactory performance of the antenna as an UWB sensor for near-field imaging.


Predicting retweet count using visual cues

Social media platforms allow rapid information diffusion, and serve as a source of information to many of the users. Particularly, in Twitter information provided by tweets diffuses over the users through retweets. Hence, being able to predict the retweet count of a given tweet is important for understanding and controlling information diffusion on Twitter. Since the length of a tweet is limited to 140 characters, extracting relevant features to predict the retweet count is a challenging task. However, visual features of images linked in tweets may provide predictive features. In this study, we focus on predicting the expected retweet count of a tweet by using visual cues of an image linked in that tweet in addition to content and structure-based features.


The circulatory system of amphioxus (Branchiostoma floridae)

The endothelial cell of Amphioxus has an endocytotic capability since both ferritin and horseradish peroxidase, when injected into the endostylar artery, became localized within endothelial cell cytoplasmic vesicles. The endothelial cells also contain vesicles within which the lysosomal enzyme acid phosphatase has been localized. Because of the presence of an endocytotic capability and lysosomes, these cells possess both the means and the method for the acquisition and disposal of exogenous proteins.


Algebraic MACs and Keyed-Verification Anonymous Credentials

We consider the problem of constructing anonymous credentials for use in a setting where the issuer of credentials is also the verifier, or more generally where the issuer and verifier have a shared key. In this setting we can use message authentication codes (MACs) instead of public key signatures as the basis for the credential system.
 To this end, we construct two algebraic MACs in prime-order groups, along with efficient protocols for issuing credentials, asserting possession of a credential, and proving statements about hidden attributes (e.g., the age of the credential owner). We prove the security of the first scheme in the generic group model, and prove the security of the second scheme\dash using a dual-system-based approach\dash under decisional Diffie-Hellman (DDH). Our MACs are of independent interest, as they are the only uf-cmva-secure MACs with efficient proofs of knowledge.
 Finally, we compare the efficiency of our new systems to two existing constructions of anonymous credentials: U-Prove and Idemix. We show that the performance of the new schemes is competitive with U-Prove (which does not have multi-show unlinkability), and many times faster than Idemix.


Predicting User Behavior in Display Advertising via Dynamic Collective Matrix Factorization

Conversion prediction and click prediction are two important and intertwined problems in display advertising, but existing approaches usually look at them in isolation. In this paper, we aim to predict the conversion response of users by jointly examining the past purchase behavior and the click response behavior. Additionally, we model the temporal dynamics between the click response and purchase activity into a unified framework. In particular, a novel matrix factorization approach named dynamic collective matrix factorization (DCMF) is proposed to address this problem. Our model considers temporal dynamics of post-click conversions and also takes advantages of the side information of users, advertisements, and items. Experiments on a real-world marketing dataset show that our model achieves significant improvements over several baselines.


Malicious web content detection using machine leaning

Naive users using a browser have no idea about the back-end of the page. The users might be tricked into giving away their credentials or downloading malicious data. Our aim is to create an extension for Chrome which will act as middleware between the users and the malicious websites, and mitigate the risk of users succumbing to such websites. Further, all harmful content cannot be exhaustively collected as even that is bound to continuous development. To counter this we are using machine learning-to train the tool and categorize the new content it sees every time into the particular categories so that corresponding action can be taken.


Accelerating Online CP Decompositions for Higher Order Tensors

Tensors are a natural representation for multidimensional data. In recent years, CANDECOMP/PARAFAC (CP) decomposition, one of the most popular tools for analyzing multi-way data, has been extensively studied and widely applied. However, today's datasets are often dynamically changing over time. Tracking the CP decomposition for such dynamic tensors is a crucial but challenging task, due to the large scale of the tensor and the velocity of new data arriving. Traditional techniques, such as Alternating Least Squares (ALS), cannot be directly applied to this problem because of their poor scalability in terms of time and memory. Additionally, existing online approaches have only partially addressed this problem and can only be deployed on third-order tensors. To fill this gap, we propose an efficient online algorithm that can incrementally track the CP decompositions of dynamic tensors with an arbitrary number of dimensions. In terms of effectiveness, our algorithm demonstrates comparable results with the most accurate algorithm, ALS, whilst being computationally much more efficient. Specifically, on small and moderate datasets, our approach is tens to hundreds of times faster than ALS, while for large-scale datasets, the speedup can be more than 3,000 times. Compared to other state-of-the-art online approaches, our method shows not only significantly better decomposition quality, but also better performance in terms of stability, efficiency and scalability.


A reconfigurable low-noise dynamic comparator with offset calibration in 90nm CMOS

This paper presents a reconfigurable, low offset, low noise and high speed dynamic clocked-comparator for medium to high resolution Analog to Digital Converters (ADCs). The proposed comparator reduces the input referred noise by half and shows a better output driving capability when compared with the previous work. The offset, noise and power consumption can be controlled by a clock delay which allows simple reconfiguration. Moreover, the proposed offset calibration technique improves the offset voltage from 11.6mV to 533μV at 1 sigma. A prototype of the comparator is implemented in 90nm 1P8M CMOS with experimental results showing 320μV input referred noise at 1.5GHz with 1.2V supply.


Educational data mining applications and tasks: A survey of the last 10 years

Educational Data Mining (EDM) is the field of using data mining techniques in educational environments. There exist various methods and applications in EDM which can follow both applied research objectives such as improving and enhancing learning quality, as well as pure research objectives, which tend to improve our understanding of the learning process. In this study we have studied various tasks and applications existing in the field of EDM and categorized them based on their purposes. We have compared our study with other existing surveys about EDM and reported a taxonomy of task.


A CSRR Loaded MIMO Antenna System for ISM Band Operation

A 2 × 2 (four-element) multiple-input multiple-output (MIMO) patch antenna system is designed and fabricated for a 2.45-GHz ISM band operation. It uses complementary split-ring resonator (CSRR) loading on its ground plane for antenna miniaturization. This reduces the single-element antenna size by 76%. The total board size of the proposed MIMO antenna system, including the GND plane is 100 × 50 × 0.8 mm3, while the single-patch antenna element has a size of 14 × 18 mm2. The antenna is fabricated and tested. Measured results are in good agreement with simulations. A minimum measured isolation of 10 dB is obtained given the close interelement spacing of 0.17λ. The maximum measured gain for a single operating element is -0.8 dBi.


Asymptotic Confidence Regions for High-Dimensional Structured Sparsity

In the setting of high-dimensional linear regression models, we propose two frameworks for constructing pointwise and group confidence sets for penalized estimators, which incorporate prior knowledge about the organization of the nonzero coefficients. This is done by desparsifying the estimator by S. van de Geer and B. Stucky and S. van de Geer <italic>et al.</italic>, then using an appropriate estimator for the precision matrix <inline-formula> <tex-math notation="LaTeX">$\Theta$</tex-math></inline-formula>. In order to estimate the precision matrix a corresponding structured matrix norm penalty has to be introduced. After normalization the result is an asymptotic pivot. The asymptotic behavior is studied and simulations are added to study the differences between the two schemes.


YAGO: A Large Ontology from Wikipedia and WordNet

This article presents YAGO, a large ontology with high coverage and precision. YAGO has been automatically derived from Wikipedia and WordNet. It comprises entities and relations, and currently contains more than 1.7 million entities and 15 million facts. These include the taxonomic Is-A hierarchy as well as semantic relations between entities. The facts for YAGO have been extracted from the category system and the infoboxes of Wikipedia and have been combined with taxonomic relations from WordNet. Type Ontologies Information extraction K checking techniques help us keep YAGO’s precision at 95%—as proven by an extensive evaluation study. YAGO is based on a clean logical model with a decidable consistency. Furthermore, it allows representing n-ary relations in a natural way while maintaining compatibility with RDFS. A powerful query model s data


Knowledge-Rich Word Sense Disambiguation Rivaling Supervised Systems

One of the main obstacles to highperformance Word Sense Disambiguation (WSD) is the knowledge acquisition bottleneck. In this paper, we present a methodology to automatically extend WordNet with large amounts of semantic relations from an encyclopedic resource, namely Wikipedia. We show that, when provided with a vast amount of high-quality semantic relations, simple knowledge-lean disambiguation algorithms compete with state-of-the-art supervised WSD systems in a coarse-grained all-words setting and outperform them on gold-standard domain-specific datasets.


Arabic Tokenization, Part-of-Speech Tagging and Morphological Disambiguation in One Fell Swoop

We present an approach to using a morphological analyzer for tokenizing and morphologically tagging (including partof-speech tagging) Arabic words in one process. We learn classifiers for individual morphological features, as well as ways of using these classifiers to choose among entries from the output of the analyzer. We obtain accuracy rates on all tasks in the high nineties.


The curvelet transform for fusion of very-high resolution multi-spectral and panchromatic images

This paper presents a novel image fusion method, suitable for pan-sharpening of multispectral (MS) bands, based on multi-resolution analysis (MRA). The low-resolution MS bands are sharpened by injecting high-pass directional details extracted from the high-resolution panchromatic (Pan) image by means of the curvelet transform, which is a non-separable MRA, whose basis function are directional edges with progressively increasing resolution. The advantage with respect to conventional separable MRA, either decimated or not, is twofold: directional detail coefficients matching image edges may be preliminarily soft-thresholded to achieve denoising better than in the separable wavelet domain; modeling of the relationships between high-resolution detail coefficients of MS bands and of the Pan image is more fitting, being carried out in a directional wavelet domain. Experiments carried out on a very-high resolution MS + Pan QuickBird image show that the proposed curvelet method quantitatively outperforms state-of-the art image fusion methods, in terms of geometric, radiometric, and spectral fidelity.


Motivation and Second Language Acquisition 1

This paper posits four stages of language acquisition, identified as elemental, consolidation, conscious expression, and automaticity and thought, and considers the role of motivation in this process. It distinguishes between two types of motivation, language learning motivation and classroom motivation, indicating how these relate to two distinct contexts, the cultural and the educational through their influence on integrativeness and attitudes toward the learning situation. It discusses how the two types of motivation are differentially involved in the four stages, and empirical support for this perspective is presented in the form of path analyses of two samples of students from Catalonia.


Leveraging Augmented Reality Training Tool for Medical Education: a Case Study in Central Venous Catheterization

Central venous catheterization is a relatively common bedside medical procedure that involves the placement of a catheter into a patient»s internal jugular vein in order to administer medication or fluids. To learn this technique, medical students traditionally practice on training mannequins under the guidance of a clinical instructor. The objective of this project was to co-develop a standardized augmented reality solution for teaching medical students this procedure, which would enable them to practice independently and at their own pace. Following an iterative design and prototyping process, we compiled a comprehensive set of usability heuristics specific to augmented reality healthcare applications, used to identify unique usability issues associated with augmented reality software. This approach offers a better strategy to improve the usability of augmented reality system and increases the potential to standardize and render medical education more accessible. The benefits of applying augmented reality to simulated medical education come with heavy consequences in the event of poor learning outcomes. The usability of these systems is paramount to ensure the development of clinical competence is facilitated and not hindered.


Manipulator state estimation with low cost accelerometers and gyroscopes

Robot manipulator designs are increasingly focused on low cost approaches, especially those envisioned for use in unstructured environments such as households, office spaces and hazardous environments. The cost of angular sensors varies based on the precision offered. For tasks in these environments, millimeter order manipulation errors are unlikely to cause drastic reduction in performance. In this paper, estimates the joint angles of a manipulator using low cost triaxial accelerometers by taking the difference between consecutive acceleration vectors. The accelerometer-based angle is compensated with a uniaxial gyroscope using a complementary filter to give robust measurements. Three compensation strategies are compared: complementary filter, time varying complementary filter, and extended Kalman filter. This sensor setup can also accurately track the joint angle even when the joint axis is parallel to gravity and the accelerometer data does not provide useful information. In order to analyze this strategy, accelerometers and gyroscopes were mounted on one arm of a PR2 robot. The arm was manually moved smoothly through different trajectories in its workspace while the joint angle readings from the on-board optical encoders were compared against the joint angle estimates from the accelerometers and gyroscopes. The low cost angle estimation strategy has a mean error 1.3° over the three joints estimated, resulting in mean end effector position errors of 6.1 mm or less. This system provides an effective angular measurement as an alternative to high precision encoders in low cost manipulators and as redundant measurements for safety in other manipulators.


Agents of Things (AoT): An intelligent operational concept of the Internet of Things (IoT)

In this conceptual paper, we review the definitions, characteristics, and architecture of the Internet of Things (IoT) concept. We then identify the deficiencies of the IoT concept, analyze them, and discover the issue of lack of reasoning and intelligence in the IoT concept. We propose a solution to augment the IoT with intelligent software agents resulting in a new concept called the Agents of Things (AoT). The paper presents the AoT architecture and a scenario for one application of the proposed concept. Finally, it discusses the benefits of implementing AoT concept to solve real world issues and the future work.


Natural history and evolutionary principles of gene duplication in fungi

Gene duplication and loss is a powerful source of functional innovation. However, the general principles that govern this process are still largely unknown. With the growing number of sequenced genomes, it is now possible to examine these events in a comprehensive and unbiased manner. Here, we develop a procedure that resolves the evolutionary history of all genes in a large group of species. We apply our procedure to seventeen fungal genomes to create a genome-wide catalogue of gene trees that determine precise orthology and paralogy relations across these species. We show that gene duplication and loss is highly constrained by the functional properties and interacting partners of genes. In particular, stress-related genes exhibit many duplications and losses, whereas growth-related genes show selection against such changes. Whole-genome duplication circumvents this constraint and relaxes the dichotomy, resulting in an expanded functional scope of gene duplication. By characterizing the functional fate of duplicate genes we show that duplicated genes rarely diverge with respect to biochemical function, but typically diverge with respect to regulatory control. Surprisingly, paralogous modules of genes rarely arise, even after whole-genome duplication. Rather, gene duplication may drive the modularization of functional networks through specialization, thereby disentangling cellular systems.


Implementation of potential field method for mobile robot navigation in greenhouse environment with WSN support

This paper deals with the implementation of mobile measuring station in greenhouse environment navigated using potential field method. The function of a greenhouse is to create the optimal growing conditions for the full life of the plants. Using autonomous measuring systems helps to monitor all the necessary parameters for creating the optimal environment in the greenhouse. The robot equipped with sensors is capable of driving to the end and back along crop rows inside the greenhouse. It introduces a wireless sensor network that was used for the purpose of measuring and controlling the greenhouse application. Continuous advancements in wireless technology and miniaturization have made the deployment of sensor networks to monitor various aspects of the environment increasingly flexible.


Automatic common-centroid layout generation for binary-weighted capacitors in charge-scaling DAC

As the precision of the capacitance ratios among binary-weighted capacitors is the key to accuracy/performance of charge-scaling digital-to-analog converters, it is very important to generate a highly matched common-centroid layout with minimum routing-induced parasitics. However, most of the previous works only focused on common-centroid placement optimization with the consideration of random and systematic mismatch. This paper introduces a novel common-centroid capacitor layout generation approach to minimize the parasitic impact on circuit accuracy/performance. Experimental results show that, compared with the manual layout, the layout generated by the presented approach can achieve even smaller layout area and better circuit accuracy/performance within much shorter time.


Scaffolds in tissue engineering bone and cartilage.

Musculoskeletal tissue, bone and cartilage are under extensive investigation in tissue engineering research. A number of biodegradable and bioresorbable materials, as well as scaffold designs, have been experimentally and/or clinically studied. Ideally, a scaffold should have the following characteristics: (i) three-dimensional and highly porous with an interconnected pore network for cell growth and flow transport of nutrients and metabolic waste; (ii) biocompatible and bioresorbable with a controllable degradation and resorption rate to match cell/tissue growth in vitro and/or in vivo; (iii) suitable surface chemistry for cell attachment, proliferation, and differentiation and (iv) mechanical properties to match those of the tissues at the site of implantation. This paper reviews research on the tissue engineering of bone and cartilage from the polymeric scaffold point of view.


3D Ego-Pose Estimation via Imitation Learning

Ego-pose estimation, i.e., estimating a person’s 3D pose with a single wearable camera, has many potential applications in activity monitoring. For these applications, both accurate and physically plausible estimates are desired, with the latter often overlooked by existing work. Traditional computer vision-based approaches using temporal smoothing only take into account the kinematics of the motion without considering the physics that underlies the dynamics of motion, which leads to pose estimates that are physically invalid. Motivated by this, we propose a novel control-based approach to model human motion with physics simulation and use imitation learning to learn a videoconditioned control policy for ego-pose estimation. Our imitation learning framework allows us to perform domain adaption to transfer our policy trained on simulation data to real-world data. Our experiments with real egocentric videos show that our method can estimate both accurate and physically plausible 3D ego-pose sequences without observing the cameras wearer’s body.


Jointless structure and under-actuation mechanism for compact hand exoskeleton

It is important for a wearable robot to be compact and sufficiently light for use as an assistive device. Since human fingers are arranged in a row in dense space, the concept of traditional wearable robots using a rigid frame and a pin joint result in size and complexity problems. A structure without a conventional pin joint, called a jointless structure, has the potential to be used as a wearable robotic hand because the human skeleton and joint can replace the robot's conventional structure. Another way to reduce the weight of the system is to use under-actuation. Under-actuation enables adaptive grasping with less number of actuators for robotic hands. Differential mechanisms are widely used for multi-finger under-actuation; however, they require additional working space. We propose a design with a jointless structure and a novel under-actuation mechanism to reduce the size and weight of a hand exoskeleton. Using these concepts, we developed a prototype that weighs only 80 grams. To evaluate the prototype, fingertip force and blocked force are measured. Fingertip force is the force that can be applied by the finger of the hand exoskeleton on the object surface. The fingertip force is about 18 N when actuated by a tension force of 35 N from the motor. 18 N is sufficient for simple pinch motion in daily activities. Another factor related to performance of the under-actuation mechanism is blocked force, which is a force required to stop one finger while the other finger keeps on moving. It is measured to be 0.5 N, which is sufficiently small. With these experiments, the feasibility of the new hand exoskeleton has been shown.


Multiband Handset Antenna Combining a PIFA, Slots, and Ground Plane Modes

A multiband handset antenna combining a PIFA and multiple slots on a ground plane is presented. It is shown by means of simulations that the slots on the ground plane have a double function: to tune the ground plane resonance at low frequencies (f ¿ 900 MHz) and to act as parasitic radiators at high frequencies (f ¿ 1800 MHz). A prototype is designed and built featuring a behavior suitable for low frequencies (GSM850 and GSM900) and for high frequencies spanning from DCS1800 to Bluetooth, and including, for instance, PCS1900, UMTS2000, and other possible systems. Reflection coefficient, efficiency, and radiation patterns are measured and compared with a design without slots to prove the advantages of the slotted ground plane. The component effect is investigated to determine critical areas where the placement is not recommended. Besides, the effect of the slot of the ground plane on SAR is investigated, by discussing the effect of the ground plane and slot modes for two phone positions. The total antenna volume of the proposed design is 40 × 15 × 6 mm3.


3D Face Recognition Using Shapes of Facial Curves

Recognition of human beings using shapes of their full facial surfaces is a difficult problem. Our approach is to approximate a facial surface using a collection of (closed) facial curves, and to compare surfaces by comparing their corresponding curves. The differences between shapes of curves are quantified using lengths of geodesic paths between them on a pre-defined curve shape space. The metric for comparing facial surfaces is a composition of the metric involving individual facial curves. These ideas are demonstrated in the context of face recognition using the nearest-neighbor classifier


CSRR loaded Sierpinski gasket fractal antenna for multiband applications

The CSRR loaded Sierpinski fractal antenna for multiband applications are presented. This model fairs that the multiband presence of the Sierpinski fractal antenna is a fallout of its fractal nature. The antenna consists of iterations of sierpinski gasket with a complementary split ring resonator. In plan to provoke multi resonant frequency band aspect, these CSRR are implanted back side of the substrate. The simulated results offers a three operating bands, covering C band at 5.72 GHz, Ku band at 14.3 GHz and 16.06 GHz. The size of the CSRR loaded Gasket antenna is 14 mm × 12 mm × 1.6 mm3 printed on FR4 substrate. The parametric review and simulated radiation component are presented.


A Lie Never Lives to be Old: The Effects of Fake Social Information on Consumer Decision-Making in Crowdfunding

The growing success of social media led to a strong presence of social information such as customer product reviews and product ratings in electronic markets. While this information helps consumers to better assess the quality of goods before purchase, its impact on consumer decision-making also incentivizes sellers to game the system by creating fake data in favor of specific goods in order to deliberately mislead consumers. As a consequence, consumers could make suboptimal choices or could choose to disregard social information altogether. In this exploratory study, we assess the effects nongenuine social information has on the consumer’s decision-making in the context of reward-based crowdfunding. Specifically, we capture unnatural peaks in the number of Facebook Likes that a specific crowdfunding campaign receives on the platforms Kickstarter and Indiegogo and observe subsequent campaign performance. Our results show that fake Facebook Likes have a very short-term positive effect on the number of backers participating in the respective crowdfunding campaign. However, this peak in participation is then followed by a period in which participation is lower than prior to the existence of the non-genuine social information. We further discuss circumstances that foster this artificial manipulation of quality signals.


Opening black box Data Mining models using Sensitivity Analysis

There are several supervised learning Data Mining (DM) methods, such as Neural Networks (NN), Support Vector Machines (SVM) and ensembles, that often attain high quality predictions, although the obtained models are difficult to interpret by humans. In this paper, we open these black box DM models by using a novel visualization approach that is based on a Sensitivity Analysis (SA) method. In particular, we propose a Global SA (GSA), which extends the applicability of previous SA methods (e.g. to classification tasks), and several visualization techniques (e.g. variable effect characteristic curve), for assessing input relevance and effects on the model's responses. We show the GSA capabilities by conducting several experiments, using a NN ensemble and SVM model, in both synthetic and real-world datasets.


Learning to predict slip for ground robots

In this paper we predict the amount of slip an exploration rover would experience using stereo imagery by learning from previous examples of traversing similar terrain. To do that, the information of terrain appearance and geometry regarding some location is correlated to the slip measured by the rover while this location is being traversed. This relationship is learned from previous experience, so slip can be predicted later at a distance from visual information only. The advantages of the approach are: 1) learning from examples allows the system to adapt to unknown terrains rather than using fixed heuristics or predefined rules; 2) the feedback about the observed slip is received from the vehicle's own sensors which can fully automate the process; 3) learning slip from previous experience can replace complex mechanical modeling of vehicle or terrain, which is time consuming and not necessarily feasible. Predicting slip is motivated by the need to assess the risk of getting trapped before entering a particular terrain. For example, a planning algorithm can utilize slip information by taking into consideration that a slippery terrain is costly or hazardous to traverse. A generic nonlinear regression framework is proposed in which the terrain type is determined from appearance and then a nonlinear model of slip is learned for a particular terrain type. In this paper we focus only on the latter problem and provide slip learning and prediction results for terrain types, such as soil, sand, gravel, and asphalt. The slip prediction error achieved is about 15% which is comparable to the measurement errors for slip itself


Bartender: a fast and accurate clustering algorithm to count barcode reads

Motivation
Barcode sequencing (bar-seq) is a high-throughput, and cost effective method to assay large numbers of cell lineages or genotypes in complex cell pools. Because of its advantages, applications for bar-seq are quickly growing-from using neutral random barcodes to study the evolution of microbes or cancer, to using pseudo-barcodes, such as shRNAs or sgRNAs to simultaneously screen large numbers of cell perturbations. However, the computational pipelines for bar-seq clustering are not well developed. Available methods often yield a high frequency of under-clustering artifacts that result in spurious barcodes, or over-clustering artifacts that group distinct barcodes together. Here, we developed Bartender, an accurate clustering algorithm to detect barcodes and their abundances from raw next-generation sequencing data.

Results
In contrast with existing methods that cluster based on sequence similarity alone, Bartender uses a modified two-sample proportion test that also considers cluster size. This modification results in higher accuracy and lower rates of under- and over-clustering artifacts. Additionally, Bartender includes unique molecular identifier handling and a 'multiple time point' mode that matches barcode clusters between different clustering runs for seamless handling of time course data. Bartender is a set of simple-to-use command line tools that can be performed on a laptop at comparable run times to existing methods.

Availability and implementation
Bartender is available at no charge for non-commercial use at https://github.com/LaoZZZZZ/bartender-1.1.

Contact
sasha.levy@stonybrook.edu or song.wu@stonybrook.edu.

Supplementary information
Supplementary data are available at Bioinformatics online.


The comparation of text mining with Naive Bayes classifier, nearest neighbor, and decision tree to detect Indonesian swear words on Twitter

Twitter is one of world most famous social media. There are many statement expresed in Twitter like happiness, sadness, public information, etc. Unfortunately, people may got angry to each other and write it down as a tweet on Twitter. Some tweet may contain Indonesian swear words. It's serious problem because many Indonesians may not tolerated swear words. Some Indonesian swear words may have multiple means, not always an Indonesian swear word means insulting. Twitter has provide tweet's data by account, trending topics, and advance keyword. This work try to analyze many tweet about political news, political event, and some Indonesian famous person because the tweet assumed contains many Indonesian swear word. The derived tweets will process in text mining and then analyzed by classification process using Naive Bayes Classifier, Nearest Neighbor, and Decision Tree to detect Indonesian swear word. This work expected to discover the high accurate classification model. It means, the model can differentiate the real meaning of Indonesian swear word contained in tweet.


Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing

We propose Symbol-Refined Tree Substitution Grammars (SR-TSGs) for syntactic parsing. An SR-TSG is an extension of the conventional TSG model where each nonterminal symbol can be refined (subcategorized) to fit the training data. We aim to provide a unified model where TSG rules and symbol refinement are learned from training data in a fully automatic and consistent fashion. We present a novel probabilistic SR-TSG model based on the hierarchical Pitman-Yor Process to encode backoff smoothing from a fine-grained SR-TSG to simpler CFG rules, and develop an efficient training method based on Markov Chain Monte Carlo (MCMC) sampling. Our SR-TSG parser achieves an F1 score of 92.4% in the Wall Street Journal (WSJ) English Penn Treebank parsing task, which is a 7.7 point improvement over a conventional Bayesian TSG parser, and better than state-of-the-art discriminative reranking parsers.


Parsing as Language Modeling

We recast syntactic parsing as a language modeling problem and use recent advances in neural network language modeling to achieve a new state of the art for constituency Penn Treebank parsing — 93.8 F1 on section 23, using 2-21 as training, 24 as development, plus tri-training. When trees are converted to Stanford dependencies, UAS and LAS are 95.9% and 94.1%.


Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles

Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed stateof-the-art approaches in constituency parsing. To remedy this, we introduce a new shiftreduce system whose stack contains merely sentence spans, represented by a bare minimum of LSTM features. We also design the first provably optimal dynamic oracle for constituency parsing, which runs in amortized O(1) time, compared to O(n) oracles for standard dependency parsing. Training with this oracle, we achieve the best F1 scores on both English and French of any parser that does not use reranking or external data.


Character-Aware Neural Language Models

We describe a simple neural language model that relies only on character-level inputs. Predictions are still made at the word-level. Our model employs a convolutional neural network (CNN) and a highway network over characters, whose output is given to a long shortterm memory (LSTM) recurrent neural network language model (RNN-LM). On the English Penn Treebank the model is on par with the existing state-ofthe-art despite having 60% fewer parameters. On languages with rich morphology (Czech, German, French, Spanish, Russian), the model consistently outperforms a Kneser-Ney baseline and word-level/morpheme-level LSTM baselines, again with far fewer parameters. Our results suggest that on many languages, character inputs are sufficient for language modeling.