Correction to: Attention-based multimodal contextual fusion for sentiment and emotion classification using bidirectional LSTM

Multimedia Tools and Applications - A Correction to this paper has been published: https://doi.org/10.1007/s11042-021-10591-y     

HSIC-based affinity measure for learning on graphs

Pattern Analysis and Applications - The performance of graph-based learning techniques largely relies on the edges defined between the vertices of the graph. These edges that represent the affinity...     

Prevention of water pollution problems in mining: The bactericide technology

In pyritic environments, the bacteriaThiobacillus ferrooxidans catalyze acid formation by increasing the oxidation rate of pyrite by a factor of one million. This acid solubilizes metals and pollutes adjacent streams and lands. Bactericide sprays during mining and waste disposal operations attack the source of the problem by preventing acid formation and metals solubilization. Used in conjunction with current water treatment systems, bactericides can dramatically reduce operating costs. Controlled release bactericides contribute to successful reclamation by providing assurance against revegetation failure and post-reclamation water quality problems that can necessitate perpetual water treatment. While inhibitingT. ferrooxidans these organic compounds aid in the establishment of beneficial heterotrophic bacteria which support vegetation. These conditions continue to persist after the bactericide is depleted from the controlled release system. Case Studies I and II show that bactericides inhibit acid generation during hard rock and coal mining operations and they are cost effective. Case Studies III and IV illustrate the improvement in water quality and vegetation after reclamation when controlled release bactericides were used. Economic analyses show cost benefits are achieved when controlled-release bactericides are part of the reclamation plan.     

Computational auditory models in predicting noise reduction performance for wideband telephony applications

The performance of several noise reduction algorithms intended for wideband telephony was evaluated both subjectively and objectively. The chosen algorithms were based on statistical modeling, spectral subtraction, Wiener filtering, or subspace modelling principles. A customized wideband noise reduction database containing speech samples corrupted by three types of background noises at three SNR levels, along with their enhanced versions was created. The overall quality of the speech samples in the database was subsequently rated by a group of listeners with normal hearing capabilities. Comprehensive statistical analyses were performed to assess the reliability of the subjective data, and to assess the performance of noise reduction algorithms across varied noisy conditions. The subjective quality ratings were then used to investigate the performance of several auditory model-based objective quality metrics. Key results from these investigations include: (a) there was a high degree of inter- and intra-subject reliability in the subjective ratings, (b) noise reduction algorithms enhance speech quality for only a subset of the noise conditions, and (c) auditory model-based metrics perform similarly in predicting speech quality ratings, when speech quality scores pertaining to a particular noise condition were averaged.     

A low‐profile,low‐cost antenna system with improved gain for DSRC vehicle‐to‐vehicle communications

A novel wire antenna for future dedicated short range communications vehicle‐to‐vehicle communications is introduced. The proposed antenna carries low‐profile and low‐cost features, and possesses an improved gain performance. This article also includes a specific feed network design for the proposed antenna to meet the mechanical and manufacturing requirements. Two different numerical techniques using CST Microwave Studio and HFSS have been applied for evaluating the performance of the proposed antenna. The whole system including the feed network and the antenna elements is integrated, and its performance is also assessed. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

Evolutionary forwarding games in delay tolerant networks: Equilibria,mechanism design and stochastic approximation

In this paper, we apply evolutionary games to non-cooperative forwarding control in Delay Tolerant Networks (DTNs). The main focus is on mechanisms to rule the participation of the relays to the delivery of messages in DTNs. Thus, we express the success probability as a function of the competition that takes place within a large population of mobiles, and we characterize the effect of reward-based mechanisms on the performance of such systems. Devices acting as active relays, in fact, sacrifice part of their batteries in order to support message replication and thus increase the probability to reach the destination. In our scheme, a relay can choose the strategy by which they participate to the message relaying. A mobile that participates receives a unit of reward based on the reward mechanism selected by the network. A utility function is introduced as the difference between the expected reward and the energy cost, i.e., the cost spent by the relay to sustain forwarding operations. We show how the evolution dynamics and the equilibrium behavior (called Evolutionary Stable Strategy – ESS) are influenced by the characteristics of inter contact time, energy expenditure and pricing characteristics.We extend our analysis to mechanisms that the system can introduce in order to have the message delivered to the destination with high probability within a given deadline and under energy constraints which bound the number of released copies per message. Finally, we apply our findings in order to devise decentralized forwarding algorithms that are rooted in the theory of stochastic approximations. Thus, we demonstrate that the ESS can be attained without complete knowledge of the system state and letting the source monitor number of released copies per message only. We provide extensive numerical results to validate the proposed scheme.     

Random Bichromatic Matchings

Given a graph with edges colored Red and Blue, we study the problem of sampling and approximately counting the number of matchings with exactly k Red edges. We solve the problem of estimating the number of perfect matchings with exactly k Red edges for dense graphs. We study a Markov chain on the space of all matchings of a graph that favors matchings with k Red edges. We show that it is rapidly mixing using non-traditional canonical paths that can backtrack. We show that this chain can be used to sample matchings in the 2-dimensional toroidal lattice of any fixed size ℓ with k Red edges, where the horizontal edges are Red and the vertical edges are Blue. An extended abstract appeared in J.R. Correa, A. Hevia and M.A. Kiwi (eds.) Proceedings of the 7th Latin American Theoretical Informatics Symposium, LNCS 3887, pp. 190–201, Springer, 2006. N. Bhatnagar’s and D. Randall’s research was supported in part by NSF grants CCR-0515105 and DMS-0505505. V.V. Vazirani’s research was supported in part by NSF grants 0311541, 0220343 and CCR-0515186. N. Bhatnagar’s and E. Vigoda’s research was supported in part by NSF grant CCR-0455666.     

Trust management towards service-oriented applications

In service-oriented computing (SOC) environments, service clients interact with service providers for services or transactions. From the point view of service clients, the trust status of a service provider is a critical issue to consider, particularly when the service provider is unknown to them. Typically, the trust evaluation is based on the feedback on the service quality provided by service clients. In this paper, we first present a trust management framework that is event-driven and rule-based. In this framework, trust computation is based on formulae. But rules are defined to determine which formula to use and what arguments to use, according to the event occurred during the transaction or service. In addition, we propose some trust evaluation metrics and a formula for trust computation. The formula is designed to be adaptable to different application domains by setting suitable arguments. Particularly, the proposed model addresses the incremental characteristics of trust establishment process. Furthermore, we propose a fuzzy logic based approach for determining reputation ranks that particularly differentiates new service providers and old (long-existing) ones. This is further incentive to new service providers and penalize poor quality services from service providers. Finally, a set of empirical studies has been conducted to study the properties of the proposed approaches, and the method to control the trust changes in both trust increment and decrement cases. The proposed framework is adaptable for different domains and complex trust evaluation systems.

CP2EH: a comprehensive privacy-preserving e-health scheme over cloud

The Journal of Supercomputing - In the Attribute-Based Encryption (ABE) scheme, patients encrypt their electronic health record (EHR), attach the appropriate attributes with it, and outsource them...