Search

Outlier removal is a fundamental data processing task to ensure the quality of scanned point cloud data (PCD), which is becoming increasing important in industrial applications and reverse engineering. Acquired scanned PCD is usually noisy, sparse and temporarily incoherent. Thus the processing of scanned data is typically an ill-posed problem. In the paper, we present a simple and effective method based on two geometrical characteristics constraints to trim the noisy points. One of the geometrical characteristics is the local density information and another is the deviation from the local fitting plane. The local density based method provides a preprocessing step, which could remove those sparse outlier and isolated outlier. The non-isolated outlier removal in this paper depends on a local projection method, which placing those points onto objects. There is no doubt that the deviation of any point from the local fitting plane should be a criterion to reduce the noisy points. The experimental results demonstrate the ability to remove the noisy point from various man-made objects consisting of complex outlier. [ABSTRACT FROM AUTHOR]

This paper studies the drive-response synchronization for quaternion-valued shunting inhibitory cellular neural networks (QVSICNNs) with mixed delays. First, QVSICNN is decomposed into an equivalent real-valued system in order to avoid the non-commutativity of the multiplicity. Then, the existence of almost periodic solutions is obtained based on the Banach fixed point theorem. An novel state-feedback controller is designed to ensure the global exponential almost periodic synchronization. At the end of the paper, an example is given to illustrate the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

In this paper, new Network Data Envelopment Analysis (NDEA) models are developed to evaluate the efficiency of regional electricity power networks. The primary objective of this paper is to consider perturbation in data and develop new NDEA models based on the adaptation of robust optimization methodology. Furthermore, in this paper, the efficiency of the entire networks of electricity power, involving generation, transmission and distribution stages is measured. While DEA has been widely used to evaluate the efficiency of the components of electricity power networks during the past two decades, there is no study to evaluate the efficiency of the electricity power networks as a whole. The proposed models are applied to evaluate the efficiency of 16 regional electricity power networks in Iran and the effect of data uncertainty is also investigated. The results are compared with the traditional network DEA and parametric SFA methods. Validity and verification of the proposed models are also investigated. The preliminary results indicate that the proposed models were more reliable than the traditional Network DEA model. [ABSTRACT FROM AUTHOR]

Product aspect recognition is a key task in fine-grained opinion mining. Current methods primarily focus on the extraction of aspects from the product reviews. However, it is also important to cluster synonymous extracted aspects into the same category. In this paper, we focus on the problem of product aspect clustering. The primary challenge is to properly cluster and generalize aspects that have similar meanings but different representations. To address this problem, we learn two types of background knowledge for each extracted aspect based on two types of effective aspect relations: relevant aspect relations and irrelevant aspect relations, which describe two different types of relationships between two aspects. Based on these two types of relationships, we can assign many relevant and irrelevant aspects into two different sets as the background knowledge to describe each product aspect. To obtain abundant background knowledge for each product aspect, we can enrich the available information with background knowledge from the Web. Then, we design a hierarchical clustering algorithm to cluster these aspects into different groups, in which aspect similarity is computed using the relevant and irrelevant aspect sets for each product aspect. Experimental results obtained in both camera and mobile phone domains demonstrate that the proposed product aspect clustering method based on two types of background knowledge performs better than the baseline approach without the use of background knowledge. Moreover, the experimental results also indicate that expanding the available background knowledge using the Web is feasible. [ABSTRACT FROM AUTHOR]

Traffic surveillance systems are interesting to many researchers to improve the traffic control and reduce the risk caused by accidents. In this area, many published works are only concerned about vehicle detection in normal conditions. The camera may vibrate due to wind or bridge movement. Detection and tracking of vehicles is a very difficult task when we have bad weather conditions in winter (snowy, rainy, windy, etc.), dusty weather in arid and semi-arid regions, at night, etc. Also, it is very important to consider speed of vehicles in the complicated weather condition. In this paper, we improved our method to track and count vehicles in dusty weather with vibrating camera. For this purpose, we used a background subtraction based strategy mixed with an extra processing to segment vehicles. In this paper, the extra processing included the analysis of the headlight size, location, and area. In our work, tracking was done between consecutive frames via a generalized particle filter to detect the vehicle and pair the headlights using the connected component analysis. So, vehicle counting was performed based on the pairing result, with Centroid of each blob we calculated distance between two frames by simple formula and hence dividing it by the time between two frames obtained from the video. Our proposed method was tested on several video surveillance records in different conditions such as dusty or foggy weather, vibrating camera, and in roads with medium-level traffic volumes. The results showed that the new proposed method performed better than our previously published method and other methods, including the Kalman filter or Gaussian model, in different traffic conditions. [ABSTRACT FROM AUTHOR]

Authorship attribution is to identify the most likely author of a given sample among a set of candidate known authors. It can be not only applied to discover the original author of plain text, such as novels, blogs, emails, posts etc., but also used to identify source code programmers. Authorship attribution of source code is required in diverse applications, ranging from malicious code tracking to solving authorship dispute or software plagiarism detection. This paper aims to propose a new method to identify the programmer of Java source code samples with a higher accuracy. To this end, it first introduces back propagation (BP) neural network based on particle swarm optimization (PSO) into authorship attribution of source code. It begins by computing a set of defined feature metrics, including lexical and layout metrics, structure and syntax metrics, totally 19 dimensions. Then these metrics are input to neural network for supervised learning, the weights of which are output by PSO and BP hybrid algorithm. The effectiveness of the proposed method is evaluated on a collected dataset with 3,022 Java files belong to 40 authors. Experiment results show that the proposed method achieves 91.060% accuracy. And a comparison with previous work on authorship attribution of source code for Java language illustrates that this proposed method outperforms others overall, also with an acceptable overhead. [ABSTRACT FROM AUTHOR]

Urban spaces have a great impact on how people’s emotion and behaviour. There are number of factors that impact our brain responses to a space. This paper presents a novel urban place recommendation approach, that is based on modelling in-situ EEG data. The research investigations leverages on newly affordable Electroencephalogram (EEG) headsets, which has the capability to sense mental states such as meditation and attention levels. These emerging devices have been utilized in understanding how human brains are affected by the surrounding built environments and natural spaces. In this paper, mobile EEG headsets have been used to detect mental states at different types of urban places. By analysing and modelling brain activity data, we were able to classify three different places according to the mental state signature of the users, and create an association map to guide and recommend people to therapeutic places that lessen brain fatigue and increase mental rejuvenation. Our mental states classifier has achieved accuracy of (%90.8). NeuroPlace breaks new ground not only as a mobile ubiquitous brain monitoring system for urban computing, but also as a system that can advise urban planners on the impact of specific urban planning policies and structures. We present and discuss the challenges in making our initial prototype more practical, robust, and reliable as part of our on-going research. In addition, we present some enabling applications using the proposed architecture. [ABSTRACT FROM AUTHOR]

Introducing electric vehicles (EVs) into urban transportation network brings higher requirement on travel time reliability and charging reliability. Specifically, it is believed that travel time reliability is a key factor influencing travelers’ route choice. Meanwhile, due to the limited cruising range, EV drivers need to better learn about the required energy for the whole trip to make decisions about whether charging or not and where to charge (i.e., charging reliability). Since EV energy consumption is highly related to travel speed, network uncertainty affects travel time and charging demand estimation significantly. Considering the network uncertainty resulted from link degradation, which influences the distribution of travel demand on transportation network and the energy demand on power network, this paper aims to develop a reliability-based network equilibrium framework for accommodating degradable road conditions with the addition of EVs. First, based on the link travel time distribution, the mean and variance of route travel time and monetary expenses related to energy consumption are deduced, respectively. And the charging time distribution of EVs with charging demand is also estimated. Then, a nested structure is considered to deal with the difference of route choice behavior derived by the different uncertainty degrees between the routes with and without degradable links. Given the expected generalized travel cost and a psychological safety margin, a traffic assignment model with the addition of EVs is formulated. Subsequently, a heuristic solution algorithm is developed to solve the proposed model. Finally, the effects of travelers’ risk attitude, network degradation degree, and EV penetration rate on network performance are illustrated through an example network. The numerical results show that the difference of travelers’ risk attitudes does have impact on the route choice, and the widespread adoption of EVs can cut down the total system travel cost effectively when the transportation network is more reliable. [ABSTRACT FROM AUTHOR]

The Grid scheduler, schedules user jobs on the best available resource in terms of resource characteristics by optimizing job execution time. Resource failure in Grid is no longer an exception but a regular occurring event as resources are increasingly being used by the scientific community to solve computationally intensive problems which typically run for days or even months. It is therefore absolutely essential that these long-running applications are able to tolerate failures and avoid re-computations from scratch after resource failure has occurred, to satisfy the user’s Quality of Service (QoS) requirement. Job Scheduling with Fault Tolerance in Grid Computing using Ant Colony Optimization is proposed to ensure that jobs are executed successfully even when resource failure has occurred. The technique employed in this paper, is the use of resource failure rate, as well as checkpoint-based roll back recovery strategy. Check-pointing aims at reducing the amount of work that is lost upon failure of the system by immediately saving the state of the system. A comparison of the proposed approach with an existing Ant Colony Optimization (ACO) algorithm is discussed. The experimental results of the implemented Fault Tolerance scheduling algorithm show that there is an improvement in the user’s QoS requirement over the existing ACO algorithm, which has no fault tolerance integrated in it. The performance evaluation of the two algorithms was measured in terms of the three main scheduling performance metrics: makespan, throughput and average turnaround time. [ABSTRACT FROM AUTHOR]

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole. [ABSTRACT FROM AUTHOR]

A Mesh topology is one of the most promising architecture due to its regular and simple structure for on-chip communication. Performance of mesh topology degraded greatly by increasing the network size due to small bisection width and large network diameter. In order to overcome this limitation, many researchers presented modified Mesh design by adding some extra links to improve its performance in terms of network latency and power consumption. The Cross-By-Pass-Mesh was presented by us as an improved version of Mesh topology by intelligent addition of extra links. This paper presents an efficient topology named Cross-By-Pass-Torus for further increase in the performance of the Cross-By-Pass-Mesh topology. The proposed design merges the best features of the Cross-By-Pass-Mesh and Torus, to reduce the network diameter, minimize the average number of hops between nodes, increase the bisection width and to enhance the overall performance of the network. In this paper, the architectural design of the topology is presented and analyzed against similar kind of 2D topologies in terms of average latency, throughput and power consumption. In order to certify the actual behavior of proposed topology, the synthetic traffic trace and five different real embedded application workloads are applied to the proposed as well as other competitor network topologies. The simulation results indicate that Cross-By-Pass-Torus is an efficient candidate among its predecessor’s and competitor topologies due to its less average latency and increased throughput at a slight cost in network power and energy for on-chip communication. [ABSTRACT FROM AUTHOR]

Geometric phases describe how in a continuous-time dynamical system the displacement of a variable (called phase variable) can be related to other variables (shape variables) undergoing a cyclic motion, according to an area rule. The aim of this paper is to show that geometric phases can exist also for discrete-time systems, and even when the cycles in shape space have zero area. A context in which this principle can be applied is stock trading. A zero-area cycle in shape space represents the type of trading operations normally carried out by high-frequency traders (entering and exiting a position on a fast time-scale), while the phase variable represents the cash balance of a trader. Under the assumption that trading impacts stock prices, even zero-area cyclic trading operations can induce geometric phases, i.e., profits or losses, without affecting the stock quote. [ABSTRACT FROM AUTHOR]

Single-molecule Förster Resonance Energy Transfer (smFRET) allows probing intermolecular interactions and conformational changes in biomacromolecules, and represents an invaluable tool for studying cellular processes at the molecular scale. smFRET experiments can detect the distance between two fluorescent labels (donor and acceptor) in the 3-10 nm range. In the commonly employed confocal geometry, molecules are free to diffuse in solution. When a molecule traverses the excitation volume, it emits a burst of photons, which can be detected by single-photon avalanche diode (SPAD) detectors. The intensities of donor and acceptor fluorescence can then be related to the distance between the two fluorophores. While recent years have seen a growing number of contributions proposing improvements or new techniques in smFRET data analysis, rarely have those publications been accompanied by software implementation. In particular, despite the widespread application of smFRET, no complete software package for smFRET burst analysis is freely available to date. In this paper, we introduce FRETBursts, an open source software for analysis of freely-diffusing smFRET data. FRETBursts allows executing all the fundamental steps of smFRET bursts analysis using state-of-the-art as well as novel techniques, while providing an open, robust and well-documented implementation. Therefore, FRETBursts represents an ideal platform for comparison and development of new methods in burst analysis. We employ modern software engineering principles in order to minimize bugs and facilitate long-term maintainability. Furthermore, we place a strong focus on reproducibility by relying on Jupyter notebooks for FRETBursts execution. Notebooks are executable documents capturing all the steps of the analysis (including data files, input parameters, and results) and can be easily shared to replicate complete smFRET analyzes. Notebooks allow beginners to execute complex workflows and advanced users to customize the analysis for their own needs. By bundling analysis description, code and results in a single document, FRETBursts allows to seamless share analysis workflows and results, encourages reproducibility and facilitates collaboration among researchers in the single-molecule community. [ABSTRACT FROM AUTHOR]

This paper presents the Hybrid Scalable-Minimized-Butterfly-Fat-Tree (H-SMBFT) topology for on-chip communication. Main aspects of this work are the description of the architectural design and the characteristics as well as a comparative analysis against two established indirect topologies namely Butterfly-Fat-Tree (BFT) and Scalable-Minimized-Butterfly-Fat-Tree (SMBFT). Simulation results demonstrate that the proposed topology outperforms its predecessors in terms of performance, area and power dissipation. Specifically, it improves the link interconnectivity between routing levels, such that the number of required links isreduced. This results into reduced router complexity and shortened routing paths between any pair of communicating nodes in the network. Moreover, simulation results under synthetic as well as real-world embedded applications workloads reveal that H-SMBFT can reduce the average latency by up-to35.63% and 17.36% compared to BFT and SMBFT, respectively. In addition, the power dissipation of the network can be reduced by up-to33.82% and 19.45%, while energy consumption can be improved byup-to32.91% and 16.83% compared to BFT and SMBFT, respectively. [ABSTRACT FROM AUTHOR]

The framework of dynamical systems offers powerful tools to understand the relation between stability and variability in human cognition in general and in speech in particular. In the current paper, we propose a dynamical systems approach to the description of German nuclear pitch accents in focus marking to account for both the categorical as well as the continuous variation found in intonational data. We report on results from 27 native speakers and employ an attractor landscape to represent pitch accent types in terms of f0 measures in a continuous dimension. We demonstrate how the same system can account for both the categorical variation (relative stability of one prosodic category) as well as the continuous variation (detailed modifications within one prosodic category). The model is able to capture the qualitative aspects of focus marking such as falling vs. rising pitch accent types as well as the quantitative aspects such as less rising vs. more rising accents in one system by means of scaling a single parameter. Furthermore, speaker group specific strategies are analysed and modelled as differences in the scaling of this parameter. Thus, the model contributes to the ongoing debate about the relation between phonetics and phonology and the importance of variation in language and speech. [ABSTRACT FROM AUTHOR]

Digital public displays installed in various locations provide valuable information for the passers-by. However, the static characteristic of the digital public display limits the consumption of the displayed content to a small area. Personal mobile devices such as smartphones are now capable of interacting with digital public displays, which enables the passers-by to “take-away” the content and consume it on-the-go. This process requires device binding, content selection, and transfer between the two devices. In this paper, we propose a device binding method which utilizes the content brightness changing pattern as a unique content ID on the public display and an illuminance sensor on the mobile to bind and transfer between two devices. We conducted performance evaluations for binding algorithm robustness in different conditions. Also comparative studies among other binding interaction methods were conducted. Our results show that our proposed method performed stably across the various conditions and overall performance in interaction completion time and error rate was similar or superior to the existing methods. [ABSTRACT FROM AUTHOR]

The financial risk not only affects the development of the company itself, but also affects the economic development of the whole society; therefore, the financial risk assessment of company is an important part. At present, numerous methods of financial risk assessment have been researched by scholars. However, most of the extant methods neither integrated fuzzy sets with quantitative analysis, nor took into account the historical data of the past few years. To settle these defects, this paper proposes a novel financial risk assessment model for companies based on heterogeneous multiple-criteria decision-making (MCDM) and historical data. Subjective and objective indexes are comprehensively taken into consideration in the financial risk assessment index system of the model, which combines fuzzy theory with quantitative data analysis. Moreover, the assessment information obtained from historical financial information of company, credit rating agency and decision makers, including crisp numbers, triangular fuzzy numbers and neutrosophic numbers. Furthermore, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) method is used to determine the ranking order of companies according to their financial risk. Finally, an empirical study of financial risk assessment for companies is conducted, and the results of comparative analysis and sensitivity analysis suggest that the proposed model can effectively and reliably obtain the company with the lowest financial risk. [ABSTRACT FROM AUTHOR]

A smart grid, considered the next-generation type of power grid, combines a traditional power grid with information and communication technologies to effectively facilitate power generation and ensure transmission security and reliability in real-time. Only authorized consumers should be able to access the smart grid because the information gathered by smart meters includes users’ private information. However, smart grid security is still a challenge. Motivated by this challenge, in this paper, we propose a heterogeneous signcryption (HSC) scheme for secure communication between smart meters and the utility. We demonstrate that this scheme is indistinguishable against adaptive chosen-ciphertext attacks (IND-CCA2), existentially unforgeable against adaptive chosen-message attacks (EUF-CMA) and ciphertext-anonymous against adaptive chosen ciphertext attacks (ANON-CCA2) under the computational Diffie-Hellman (CDH) problem in the random oracle model. Our scheme simultaneously achieves confidentiality, integrity, authentication, non-repudiation and ciphertext anonymity in a single logical step. It supports heterogeneous systems, allowing a meter in an identity-based cryptography (IBC) environment to transmit electrical usage data to a utility in a public key infrastructure (PKI) environment. Compared with other existing related schemes, our scheme has the lowest communication overhead and energy consumption for the smart grid. Based on these features, our scheme is highly suitable for secure power transmissions in a smart grid. [ABSTRACT FROM AUTHOR]

This paper tries to tackle the modern challenge of practical steganalysis over large data by presenting a novel approach whose aim is to perform with perfect accuracy and in a completely automatic manner. The objective is to detect changes introduced by the steganographic process in those data objects, including signatures related to the tools being used. Our approach achieves this by first extracting reliable regularities by analyzing pairs of modified and unmodified data objects; then, combines these findings by creating general patterns present on data used for training. Finally, we construct a Naive Bayes model that is used to perform classification, and operates on attributes extracted using the aforementioned patterns. This technique has been be applied for different steganographic tools that operate in media files of several types. We are able to replicate or improve on a number or previously published results, but more importantly, we in addition present new steganalytic findings over a number of popular tools that had no previous known attacks. [ABSTRACT FROM AUTHOR]

Recent research on speech segregation and music fingerprinting has led to improvements in speech segregation and music identification algorithms. Speech and music segregation generally involves the identification of music followed by speech segregation. However, music segregation becomes a challenging task in the presence of noise. This paper proposes a novel method of speech segregation for unlabelled stationary noisy audio signals using the deep belief network (DBN) model. The proposed method successfully segregates a music signal from noisy audio streams. A recurrent neural network (RNN)-based hidden layer segregation model is applied to remove stationary noise. Dictionary-based fisher algorithms are employed for speech classification. The proposed method is tested on three datasets (TIMIT, MIR-1K, and MusicBrainz), and the results indicate the robustness of proposed method for speech segregation. The qualitative and quantitative analysis carried out on three datasets demonstrate the efficiency of the proposed method compared to the state-of-the-art speech segregation and classification-based methods. [ABSTRACT FROM AUTHOR]

The path choice behavior of battery electric vehicle (BEV) drivers is influenced by the lack of public charging stations, limited battery capacity, range anxiety and long battery charging time. This paper investigates the congestion/flow pattern captured by stochastic user equilibrium (SUE) traffic assignment problem in transportation networks with BEVs, where the BEV paths are restricted by their battery capacities. The BEV energy consumption is assumed to be a linear function of path length and path travel time, which addresses both path distance limit problem and road congestion effect. A mathematical programming model is proposed for the path-based SUE traffic assignment where the path cost is the sum of the corresponding link costs and a path specific out-of-energy penalty. We then apply the convergent Lagrangian dual method to transform the original problem into a concave maximization problem and develop a customized gradient projection algorithm to solve it. A column generation procedure is incorporated to generate the path set. Finally, two numerical examples are presented to demonstrate the applicability of the proposed model and the solution algorithm. [ABSTRACT FROM AUTHOR]

Music genre classification is a challenging research concept, for which open questions remain regarding classification approach, music piece representation, distances between/within genres, and so on. In this paper an investigation on the classification of generated music pieces is performed, based on the idea that grouping close related known pieces in different sets –or clusters– and then generating in an automatic way a new song which is somehow “inspired” in each set, the new song would be more likely to be classified as belonging to the set which inspired it, based on the same distance used to separate the clusters. Different music pieces representations and distances among pieces are used; obtained results are promising, and indicate the appropriateness of the used approach even in a such a subjective area as music genre classification is. [ABSTRACT FROM AUTHOR]

The automatic detection and recognition of sound events by computers is a requirement for a number of emerging sensing and human computer interaction technologies. Recent advances in this field have been achieved by machine learning classifiers working in conjunction with time-frequency feature representations. This combination has achieved excellent accuracy for classification of discrete sounds. The ability to recognise sounds under real-world noisy conditions, called robust sound event classification, is an especially challenging task that has attracted recent research attention. Another aspect of real-word conditions is the classification of continuous, occluded or overlapping sounds, rather than classification of short isolated sound recordings. This paper addresses the classification of noise-corrupted, occluded, overlapped, continuous sound recordings. It first proposes a standard evaluation task for such sounds based upon a common existing method for evaluating isolated sound classification. It then benchmarks several high performing isolated sound classifiers to operate with continuous sound data by incorporating an energy-based event detection front end. Results are reported for each tested system using the new task, to provide the first analysis of their performance for continuous sound event detection. In addition it proposes and evaluates a novel Bayesian-inspired front end for the segmentation and detection of continuous sound recordings prior to classification. [ABSTRACT FROM AUTHOR]

Aimed at the complicated problems of attraction characteristics regarding passenger flow in urban rail transit network, the concept of the gravity field of passenger flow is proposed in this paper. We establish the computation methods of field strength and potential energy to reveal the potential attraction relationship among stations from the perspective of the collection and distribution of passenger flow and the topology of network. As for the computation methods of field strength, an optimum path concept is proposed to define betweenness centrality parameter. Regarding the computation of potential energy, Compound Simpson’s Rule Formula is applied to get a solution to the function. Taking No. 10 Beijing Subway as a practical example, an analysis of simulation and verification is conducted, and the results shows in the following ways. Firstly, the bigger field strength value between two stations is, the stronger passenger flow attraction is, and the greater probability of the formation of the largest passenger flow of section is. Secondly, there is the greatest passenger flow volume and circulation capacity between two zones of high potential energy. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive fuzzy sliding mode controller is proposed to control a two-stage single-phase photovoltaic (PV) grid-connected inverter. Two key technologies are discussed in the presented PV system. An incremental conductance method with adaptive step is adopted to track the maximum power point (MPP) by controlling the duty cycle of the controllable power switch of the boost DC-DC converter. An adaptive fuzzy sliding mode controller with an integral sliding surface is developed for the grid-connected inverter where a fuzzy system is used to approach the upper bound of the system nonlinearities. The proposed strategy has strong robustness for the sliding mode control can be designed independently and disturbances can be adaptively compensated. Simulation results of a PV grid-connected system verify the effectiveness of the proposed method, demonstrating the satisfactory robustness and performance. [ABSTRACT FROM AUTHOR]

The recently proposed Parkinson’s Disease (PD) telediagnosis systems based on detecting dysphonia achieve very high classification rates in discriminating healthy subjects from PD patients. However, in these studies the data used to construct the classification model contain the speech recordings of both early and late PD patients with different severities of speech impairments resulting in unrealistic results. In a more realistic scenario, an early telediagnosis system is expected to be used in suspicious cases by healthy subjects or early PD patients with mild speech impairment. In this paper, considering the critical importance of early diagnosis in the treatment of the disease, we evaluate the ability of vocal features in early telediagnosis of Parkinson's Disease (PD) using machine learning techniques with a two-step approach. In the first step, using only patient data, we aim to determine the patient group with relatively greater severity of speech impairments using Unified Parkinson’s Disease Rating Scale (UPDRS) score as an index of disease progression. For this purpose, we use three supervised and two unsupervised learning techniques. In the second step, we exclude the samples of this group of patients from the dataset, create a new dataset consisting of the samples of PD patients having less severity of speech impairments and healthy subjects, and use three classifiers with various settings to address this binary classification problem. In this classification problem, the highest accuracy of 96.4% and Matthew’s Correlation Coefficient of 0.77 is obtained using support vector machines with third-degree polynomial kernel showing that vocal features can be used to build a decision support system for early telediagnosis of PD. [ABSTRACT FROM AUTHOR]

The use of RFID technology in complex and distributed environments often leads to a multi-domain RFID system, in which trust establishment among entities from heterogeneous domains without past interaction or prior agreed policy, is a challenge. The current trust management mechanisms in the literature do not meet the specific requirements in multi-domain RFID systems. Therefore, this paper analyzes the special challenges on trust management in multi-domain RFID systems, and identifies the implications and the requirements of the challenges on the solutions to the trust management of multi-domain RFID systems. A multi-domain trust management model is proposed, which provides a hierarchical trust management framework include a diversity of trust evaluation and establishment approaches. The simulation results and analysis show that the proposed method has excellent ability to deal with the trust relationships, better security, and higher accuracy rate. [ABSTRACT FROM AUTHOR]

The traditional scale invariant feature transform (SIFT) method can extract distinctive features for image matching. However, it is extremely time-consuming in SIFT matching because of the use of the Euclidean distance measure. Recently, many binary SIFT (BSIFT) methods have been developed to improve matching efficiency; however, none of them is invariant to mirror reflection. To address these problems, in this paper, we present a horizontal or vertical mirror reflection invariant binary descriptor named MBR-SIFT, in addition to a novel image matching approach. First, 16 cells in the local region around the SIFT keypoint are reorganized, and then the 128-dimensional vector of the SIFT descriptor is transformed into a reconstructed vector according to eight directions. Finally, the MBR-SIFT descriptor is obtained after binarization and reverse coding. To improve the matching speed and accuracy, a fast matching algorithm that includes a coarse-to-fine two-step matching strategy in addition to two similarity measures for the MBR-SIFT descriptor are proposed. Experimental results on the UKBench dataset show that the proposed method not only solves the problem of mirror reflection, but also ensures desirable matching accuracy and speed. [ABSTRACT FROM AUTHOR]

This paper presents a continuous composite control scheme to achieve fixed-time stabilization for nonlinear systems with mismatched disturbances. The composite controller is constructed in two steps: First, uniformly finite time exact disturbance observers are proposed to estimate and compensate the disturbances. Then, based on adding a power integrator technique and fixed-time stability theory, continuous fixed-time stable state feedback controller and Lyapunov functions are constructed to achieve global fixed-time system stabilization. The proposed control method extends the existing fixed-time stable control results to high order nonlinear systems with mismatched disturbances and achieves global fixed-time system stabilization. Besides, the proposed control scheme improves the disturbance rejection performance and achieves performance recovery of nominal system. Simulation results are provided to show the effectiveness, the superiority and the applicability of the proposed control scheme. [ABSTRACT FROM AUTHOR]

In the stock market, return reversal occurs when investors sell overbought stocks and buy oversold stocks, reversing the stocks’ price trends. In this paper, we develop a new method to identify key drivers of return reversal by incorporating a comprehensive set of factors derived from different economic theories into one unified dynamical Bayesian factor graph. We then use the model to depict factor relationships and their dynamics, from which we make some interesting discoveries about the mechanism behind return reversals. Through extensive experiments on the US stock market, we conclude that among the various factors, the liquidity factors consistently emerge as key drivers of return reversal, which is in support of the theory of liquidity effect. Specifically, we find that stocks with high turnover rates or high Amihud illiquidity measures have a greater probability of experiencing return reversals. Apart from the consistent drivers, we find other drivers of return reversal that generally change from year to year, and they serve as important characteristics for evaluating the trends of stock returns. Besides, we also identify some seldom discussed yet enlightening inter-factor relationships, one of which shows that stocks in Finance and Insurance industry are more likely to have high Amihud illiquidity measures in comparison with those in other industries. These conclusions are robust for return reversals under different thresholds. [ABSTRACT FROM AUTHOR]

Characterizing how people move through space has been an important component of many disciplines. With the advent of automated data collection through GPS and other location sensing systems, researchers have the opportunity to examine human mobility at spatio-temporal resolution heretofore impossible. However, the copious and complex data collected through these logging systems can be difficult for humans to fully exploit, leading many researchers to propose novel metrics for encapsulating movement patterns in succinct and useful ways. A particularly salient proposed metric is the mobility entropy rate of the string representing the sequence of locations visited by an individual. However, mobility entropy rate is not scale invariant: entropy rate calculations based on measurements of the same trajectory at varying spatial or temporal granularity do not yield the same value, limiting the utility of mobility entropy rate as a metric by confounding inter-experimental comparisons. In this paper, we derive a scaling relationship for mobility entropy rate of non-repeating straight line paths from the definition of Lempel-Ziv compression. We show that the resulting formulation predicts the scaling behavior of simulated mobility traces, and provides an upper bound on mobility entropy rate under certain assumptions. We further show that this formulation has a maximum value for a particular sampling rate, implying that optimal sampling rates for particular movement patterns exist. [ABSTRACT FROM AUTHOR]

Classification based on social dimensions is commonly used to handle the multi-label classification task in heterogeneous networks. However, traditional methods, which mostly rely on the community detection algorithms to extract the latent social dimensions, produce unsatisfactory performance when community detection algorithms fail. In this paper, we propose a novel behavior based social dimensions extraction method to improve the classification performance in multi-label heterogeneous networks. In our method, nodes’ behavior features, instead of community memberships, are used to extract social dimensions. By introducing Latent Dirichlet Allocation (LDA) to model the network generation process, nodes’ connection behaviors with different communities can be extracted accurately, which are applied as latent social dimensions for classification. Experiments on various public datasets reveal that the proposed method can obtain satisfactory classification results in comparison to other state-of-the-art methods on smaller social dimensions. [ABSTRACT FROM AUTHOR]

This paper presents a novel secure and robust steganographic technique in the compressed video domain namely embedding-based byte differencing (EBBD). Unlike most of the current video steganographic techniques which take into account only the intra frames for data embedding, the proposed EBBD technique aims to hide information in both intra and inter frames. The information is embedded into a compressed video by simultaneously manipulating the quantized AC coefficients (AC-QTCs) of luminance components of the frames during MPEG-2 encoding process. Later, during the decoding process, the embedded information can be detected and extracted completely. Furthermore, the EBBD basically deals with two security concepts: data encryption and data concealing. Hence, during the embedding process, secret data is encrypted using the simplified data encryption standard (S-DES) algorithm to provide better security to the implemented system. The security of the method lies in selecting candidate AC-QTCs within each non-overlapping 8 × 8 sub-block using a pseudo random key. Basic performance of this steganographic technique verified through experiments on various existing MPEG-2 encoded videos over a wide range of embedded payload rates. Overall, the experimental results verify the excellent performance of the proposed EBBD with a better trade-off in terms of imperceptibility and payload, as compared with previous techniques while at the same time ensuring minimal bitrate increase and negligible degradation of PSNR values. [ABSTRACT FROM AUTHOR]

With the security requirements of networks, biometrics authenticated schemes which are applied in the multi-server environment come to be more crucial and widely deployed. In this paper, we propose a novel biometric-based multi-server authentication and key agreement scheme which is based on the cryptanalysis of Mishra et al.’s scheme. The informal and formal security analysis of our scheme are given, which demonstrate that our scheme satisfies the desirable security requirements. The presented scheme provides a variety of significant functionalities, in which some features are not considered in the most of existing authentication schemes, such as, user revocation or re-registration and biometric information protection. Compared with several related schemes, our scheme has more secure properties and lower computation cost. It is obviously more appropriate for practical applications in the remote distributed networks. [ABSTRACT FROM AUTHOR]

The performance of objective speech and audio quality measures for the prediction of the perceived quality of frequency-compressed speech in hearing aids is investigated in this paper. A number of existing quality measures have been applied to speech signals processed by a hearing aid, which compresses speech spectra along frequency in order to make information contained in higher frequencies audible for listeners with severe high-frequency hearing loss. Quality measures were compared with subjective ratings obtained from normal hearing and hearing impaired children and adults in an earlier study. High correlations were achieved with quality measures computed by quality models that are based on the auditory model of Dau et al., namely, the measure PSM, computed by the quality model PEMO-Q; the measure qc, computed by the quality model proposed by Hansen and Kollmeier; and the linear subcomponent of the HASQI. For the prediction of quality ratings by hearing impaired listeners, extensions of some models incorporating hearing loss were implemented and shown to achieve improved prediction accuracy. Results indicate that these objective quality measures can potentially serve as tools for assisting in initial setting of frequency compression parameters. [ABSTRACT FROM AUTHOR]

House mice (Mus musculus) emit complex ultrasonic vocalizations (USVs) during social and sexual interactions, which have features similar to bird song (i.e., they are composed of several different types of syllables, uttered in succession over time to form a pattern of sequences). Manually processing complex vocalization data is time-consuming and potentially subjective, and therefore, we developed an algorithm that automatically detects mouse ultrasonic vocalizations (Automatic Mouse Ultrasound Detector or A-MUD). A-MUD is a script that runs on STx acoustic software (S_TOOLS-STx version 4.2.2), which is free for scientific use. This algorithm improved the efficiency of processing USV files, as it was 4–12 times faster than manual segmentation, depending upon the size of the file. We evaluated A-MUD error rates using manually segmented sound files as a ‘gold standard’ reference, and compared them to a commercially available program. A-MUD had lower error rates than the commercial software, as it detected significantly more correct positives, and fewer false positives and false negatives. The errors generated by A-MUD were mainly false negatives, rather than false positives. This study is the first to systematically compare error rates for automatic ultrasonic vocalization detection methods, and A-MUD and subsequent versions will be made available for the scientific community. [ABSTRACT FROM AUTHOR]

The distribution of scientific citations for publications selected with different rules (author, topic, institution, country, journal, etc…) collapse on a single curve if one plots the citations relative to their mean value. We find that the distribution of “shares” for the Facebook posts rescale in the same manner to the very same curve with scientific citations. This finding suggests that citations are subjected to the same growth mechanism with Facebook popularity measures, being influenced by a statistically similar social environment and selection mechanism. In a simple master-equation approach the exponential growth of the number of publications and a preferential selection mechanism leads to a Tsallis-Pareto distribution offering an excellent description for the observed statistics. Based on our model and on the data derived from PubMed we predict that according to the present trend the average citations per scientific publications exponentially relaxes to about 4. [ABSTRACT FROM AUTHOR]

An empirical question of long-standing interest is how price promotions affect a brand’s sale shares in the fast-moving consumer-goods market. We investigated this question with concurrent promotions and sales records of specialty beer brands pooled over Tesco stores in the UK. Most brands were continuously promoted, rendering infeasible a conventional approach of establishing impact against an off-promotion sales baseline, and arguing in favor of a dynamics approach. Moreover, promotion/sales records were volatile without easily-discernable regularity. Past work conventionally attributed volatility to the impact of exogenous random shocks on stable markets, and reasoned that promotions have only an ephemeral impact on sales shares in stationary mean-reverting stochastic markets, or a persistent freely-wandering impact in nonstationary markets. We applied new empirical methods from the applied sciences to uncover an overlooked alternative: ‘systematic persistence’ in which promotional impacts evolve systematically in an endogenously-unstable market governed by deterministic-nonlinear dynamics. We reconstructed real-world market dynamics from the Tesco dataset, and detected deterministic-nonlinear market dynamics. We used reconstructed market dynamics to identify a complex network of systematic interactions between promotions and sales shares among competing brands, and quantified/characterized the dynamics of these interactions. For the majority of weeks in the study, we found that: (1) A brand’s promotions drove down own sales shares (a possibility recognized in the literature), but ‘cannibalized’ sales shares of competing brands (perhaps explaining why brands were promoted despite a negative marginal impact on own sales shares); and (2) Competitive interactions between brands owned by the same multinational brewery differed from those with outside brands. In particular, brands owned by the same brewery enjoyed a ‘mutually-beneficial’ relationship in which an incremental increase in the sales share of one marginally increased the sales share of the other. Alternatively, the sales shares of brands owned by different breweries preyed on each other’s market shares. [ABSTRACT FROM AUTHOR]

Does music penetrate cultural differences with its ability to evoke emotion? The ragas of Hindustani music are specific sequences of notes that elicit various emotions: happy, romantic, devotion, calm, angry, longing, tension and sad. They can be presented in two modes, alaap and gat, which differ in rhythm, but match in tonality. Participants from Indian and Non-Indian cultures (N = 144 and 112, respectively) rated twenty-four pieces of Hindustani ragas on eight dimensions of emotion, in a free response task. Of the 192 between-group comparisons, ratings differed in only 9% of the instances, showing universality across multiple musical emotions. Robust regression analyses and machine learning methods revealed tonality best explained emotion ratings for Indian participants whereas rhythm was the primary predictor in Non-Indian listeners. Our results provide compelling evidence for universality in emotions in the auditory domain in the realm of musical emotion, driven by distinct acoustic features that depend on listeners’ cultural backgrounds. [ABSTRACT FROM AUTHOR]

We present a new computational model of speech motor control: the Feedback-Aware Control of Tasks in Speech or FACTS model. FACTS employs a hierarchical state feedback control architecture to control simulated vocal tract and produce intelligible speech. The model includes higher-level control of speech tasks and lower-level control of speech articulators. The task controller is modeled as a dynamical system governing the creation of desired constrictions in the vocal tract, after Task Dynamics. Both the task and articulatory controllers rely on an internal estimate of the current state of the vocal tract to generate motor commands. This estimate is derived, based on efference copy of applied controls, from a forward model that predicts both the next vocal tract state as well as expected auditory and somatosensory feedback. A comparison between predicted feedback and actual feedback is then used to update the internal state prediction. FACTS is able to qualitatively replicate many characteristics of the human speech system: the model is robust to noise in both the sensory and motor pathways, is relatively unaffected by a loss of auditory feedback but is more significantly impacted by the loss of somatosensory feedback, and responds appropriately to externally-imposed alterations of auditory and somatosensory feedback. The model also replicates previously hypothesized trade-offs between reliance on auditory and somatosensory feedback and shows for the first time how this relationship may be mediated by acuity in each sensory domain. These results have important implications for our understanding of the speech motor control system in humans. [ABSTRACT FROM AUTHOR]

Intelligent Transport System (ITS) uses the IEEE 802.11P standard for the wireless communication among vehicles. A wireless ad hoc network of vehicles is established to improve road safety, comfort, security, and traffic efficiency. Wireless communication in ITS leads to many security and privacy challenges. Security and privacy of ITS are important issues that demand incorporation of confidentiality, privacy, authentication, integrity, non-repudiation, and restrictive obscurity. In order to ensure the privacy of vehicles during communication, it is required that the real identity of vehicles should not be revealed. There must be robust and efficient security and privacy mechanisms for the establishment of a reliable and trustworthy network. Therefore, we propose Advanced Strong Pseudonym based Authentication (ASPA), which is a distributed framework to handle the security and privacy issues of vehicle communications in ITS. ASPA only allows vehicles with valid pseudonyms to communicate in ITS. Pseudonyms are assigned to vehicles in a secure manner. The pseudonym mappings of vehicles are stored at different locations to avoid any chance of vehicle pseudonyms certificates linkability. In addition, the most recent communication pseudonyms of a malicious vehicle are revoked and are stored in the Certificate Revocation List (CRL) that results in small size of the CRL. Therefore, the CRL size does not increase exponentially. The distributed framework of ASPA guarantees, the vehicles privacy preservation in the real identities mapping and revocation phase. The empirical results prove that ASPA is robust and efficient with low computational cost, overhead ratio, average latency, and an increased delivery ratio. [ABSTRACT FROM AUTHOR]

Due to the characteristics of T-connection transmission lines, a new method for T-connection transmission lines fault identification based on current reverse travelling wave multi-scale S-transformation energy entropy and limit learning machine is proposed. S-transform are implemented on the faulty reverse traveling waves measured by each traveling wave protection unit of the T-connection transmission line, the reverse travelling wave energy entropies under eight different frequencies are respectively calculated, and a T-connection transmission line fault characteristic vector sample set are thus formed. Establish an intelligent fault identification model of extreme learning machines, and use the sample set for training and testing to identify the specific faulty branch of the T-connection transmission line. The simulation results show that the proposed algorithm can accurately and quickly identify the branch where the fault is located on the T-connection transmission line under various operation conditions. [ABSTRACT FROM AUTHOR]

As the airline industry has become ever-more competitive and profitability more tenuous, airline service quality management has grown more important to airlines. Although many studies have focused on the evaluation of airline service quality, some common limitations need to be noted. First, traditional fuzzy logics were utilized to present linguistic variables as fuzzy numbers. However, precise quantification of lower and upper bounds with a single number is often difficult; thus, interval-valued fuzzy sets that represent the lower and upper bounds in the fuzzy number as an interval form should be applied instead. Second, while some studies have applied various multiple-criteria decision-making method [MCDM] and the service quality (SERVQUAL) method for evaluation of airline service quality, few have utilized grey relational analysis (GRA, a simple and data-driven MCDM method applicable to environments with incomplete information) and the service performance (SERVPERF), a performance-based measure that can resolve the ambiguity issue of the expectations construct in SERVQUAL. Third, extant studies dealing with the issue of weighting criteria in the evaluation of airline service quality have focused only on either subjective or objective weights, though weighting criteria based on a combined objective/subjective approach would be much better than those just considering the subjective approach. The present study endeavored to fill these literature gaps by developing, for evaluation of airline service quality, interval-valued fuzzy GRA with SERVPERF based on both subjective and objective weights. It contributes to the field by incorporating the 22 criteria from SERVPERF to effectively account for the various characteristics of airline service. Additionally, it is the first study to utilize interval-valued fuzzy GRA together with a novel technique that combines a subjective/objective weighting method for integration of objective decision-matrix-derived information with subjective decision-maker preferences. The supplemental empirical case study of airline service evaluation, further, provides researchers and practitioners with a means of better understanding the proposed approach in the practical perspectives. [ABSTRACT FROM AUTHOR]

Smart energy meters generate real time, high frequency data which can foster demand management and response of consumers and firms, with potential private and social benefits. However, proper statistical techniques are needed to make sense of this large amount of data and translate them into usable recommendations. Here, we apply Functional Data Analysis (FDA), a novel branch of Statistics that analyses functions—to identify drivers of residential electricity load curves. We evaluate a real time feedback intervention which involved about 1000 Italian households for a period of three years. Results of the FDA modelling reveal, for the first time, daytime-indexed patterns of residential electricity consumption which depend on the ownership of specific clusters of electrical appliances and an overall reduction of consumption after the introduction of real time feedback, unrelated to appliance ownership characteristics. [ABSTRACT FROM AUTHOR]

Different performance measures are used to assess the behaviour, and to carry out the comparison, of classifiers in Machine Learning. Many measures have been defined on the literature, and among them, a measure inspired by Shannon’s entropy named the Confusion Entropy (CEN). In this work we introduce a new measure, MCEN, by modifying CEN to avoid its unwanted behaviour in the binary case, that disables it as a suitable performance measure in classification. We compare MCEN with CEN and other performance measures, presenting analytical results in some particularly interesting cases, as well as some heuristic computational experimentation. [ABSTRACT FROM AUTHOR]

The Quantum Trajectories Method (QTM) is one of the frequently used methods for studying open quantum systems. The main idea of this method is the evolution of wave functions which describe the system (as functions of time). Then, so-called quantum jumps are applied at a randomly selected point in time. The obtained system state is called as a trajectory. After averaging many single trajectories, we obtain the approximation of the behavior of a quantum system. This fact also allows us to use parallel computation methods. In the article, we discuss the QTM package which is supported by the MPI technology. Using MPI allowed utilizing the parallel computing for calculating the trajectories and averaging them—as the effect of these actions, the time taken by calculations is shorter. In spite of using the C++ programming language, the presented solution is easy to utilize and does not need any advanced programming techniques. At the same time, it offers a higher performance than other packages realizing the QTM. It is especially important in the case of harder computational tasks, and the use of MPI allows improving the performance of particular problems which can be solved in the field of open quantum systems. [ABSTRACT FROM AUTHOR]