Javier A. Barria

Javier A. Barria

Auto-generated profile, based on publicly available information

Javier A. Barria

Department of Electrical and Electronic Engineering, Imperial College London, London, U.K.

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 May 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
EGEdgar S. García-Treviño
Edgar S. García-Treviño
PYPu Yang
Pu Yang
JBJavier A. Barria
Javier A. Barria
In this article, a novel wavelet probabilistic neural network (WPNN), which is a generative-learning wavelet neural network that relies on the wavelet-based estimation of class probability densities, is proposed. In this new neural network approach, the number of basis functions employed is independent of the number of data inputs, and in that sense, it overcomes the well-known drawback of traditional probabilistic neural networks (PNNs). Since the parameters of the proposed network are updated at a low and constant computational cost, it is particularly aimed at data stream classification and anomaly detection in off-line settings and online environments where the length of data is assumed to be unconstrained. Both synthetic and real-world datasets are used to assess the proposed WPNN. Significant performance enhancements are attained compared to state-of-the-art algorithms.

31 July 2004 in Ad Hoc Networks
Verified
Journal Article
Open access
WUW. Usaha
W. Usaha
JBJ. Barria
J. Barria
In this paper, a path discovery scheme which supports QoS routing in mobile ad hoc networks (MANETs) in the presence of imprecise information is investigated. The aim is to increase the probability of success in finding feasible paths and reduce average path cost of a previously proposed ticket based probing (TBP) path discovery scheme. The proposed scheme integrates the original TBP scheme with a reinforcement learning method called the on-policy first-visit Monte Carlo (ONMC) method. We investigate the performance of the ONMC method in the presence of imprecise information. Our numerical study shows that, in respect to a flooding based algorithm, message overhead reduction can be achieved with marginal difference in the path search ability and additional computational and storage requirements. When the average message overhead of the ONMC method is reduced to the same order of magnitude of the original TBP, the ONMC method gains an improvement of 28% in success ratio and 7% reduction in the average path cost over the original TBP.

1 February 2012 in Computational Statistics & Data Analysis
Verified
Journal Article
Closed access
EGE.S. García-Treviño
E.S. García-Treviño
JBJ.A. Barria
J.A. Barria

21 February 2010 in Electronic Commerce Research
Verified
Journal Article
Open access
PDF file
TRTobias Regner
Tobias Regner
JBJavier A. Barria
Javier A. Barria
JPJeremy V. Pitt
Jeremy V. Pitt
BNBrendan Neville
Brendan Neville
The realm of digital media is undergoing fundamental changes as it moves from mass media to an era of mass participation. This emergence of content created by the masses requires to re-consider the conventional intellectual property rights framework. Free content and protected content co-exist (in the Dark/Light Web). We propose an alternative environment for the governance of digital content. It incorporates psychological aspects into its economics framework. Multi-agent systems play an important role in order to create an infrastructure that makes the voluntary-based environment sustainable. We propose a platform based on an open contracts design that encourages voluntary payments. Peer-based reputation and recommendation mechanisms as well as socio-emotive instruments facilitate norm adherence in this online environment. They leverage the efficiency of alternative voluntary payment models based on fairness concerns and reciprocity. The envisioned platform matches Dark Web content to consumers who value it highly, provides Dark Web content creators with a basic reward for their work and reduces the infringement of protected content in the Dark Web.

1 November 2009 in Electronic Commerce Research and Applications
Verified
Journal Article
Closed access
TRTobias Regner
Tobias Regner
JBJavier A. Barria
Javier A. Barria
JPJeremy V. Pitt
Jeremy V. Pitt
BNBrendan Neville
Brendan Neville

7 August 2002 in IEEE Communications Letters
Verified
Journal Article
Closed access
RSR.M. Salles
R.M. Salles
JBJ.A. Barria
J.A. Barria
This letter presents packet scheduling disciplines based on application utility functions and network traffic measurements. The disciplines support different classes of adaptive applications over the Internet, providing differentiation, fairness, and dynamic allocation of network resources. They are composed of a decision procedure, where a fairness criterion based on utility functions is used; and a measurement procedure, which considers the statistics involving packet arrivals and departures. The underlying algorithm is then applied to emulate the proportional differentiation services, and is shown-via simulation-that its results outperform the best alternative algorithms published in the literature.