4,843 research outputs found
Modeling and Recognition of Smart Grid Faults by a Combined Approach of Dissimilarity Learning and One-Class Classification
Detecting faults in electrical power grids is of paramount importance, either
from the electricity operator and consumer viewpoints. Modern electric power
grids (smart grids) are equipped with smart sensors that allow to gather
real-time information regarding the physical status of all the component
elements belonging to the whole infrastructure (e.g., cables and related
insulation, transformers, breakers and so on). In real-world smart grid
systems, usually, additional information that are related to the operational
status of the grid itself are collected such as meteorological information.
Designing a suitable recognition (discrimination) model of faults in a
real-world smart grid system is hence a challenging task. This follows from the
heterogeneity of the information that actually determine a typical fault
condition. The second point is that, for synthesizing a recognition model, in
practice only the conditions of observed faults are usually meaningful.
Therefore, a suitable recognition model should be synthesized by making use of
the observed fault conditions only. In this paper, we deal with the problem of
modeling and recognizing faults in a real-world smart grid system, which
supplies the entire city of Rome, Italy. Recognition of faults is addressed by
following a combined approach of multiple dissimilarity measures customization
and one-class classification techniques. We provide here an in-depth study
related to the available data and to the models synthesized by the proposed
one-class classifier. We offer also a comprehensive analysis of the fault
recognition results by exploiting a fuzzy set based reliability decision rule
Recommended from our members
Intelligent Learning Algorithms for Active Vibration Control
YesThis correspondence presents an investigation into the
comparative performance of an active vibration control (AVC) system
using a number of intelligent learning algorithms. Recursive least square
(RLS), evolutionary genetic algorithms (GAs), general regression neural
network (GRNN), and adaptive neuro-fuzzy inference system (ANFIS)
algorithms are proposed to develop the mechanisms of an AVC system.
The controller is designed on the basis of optimal vibration suppression
using a plant model. A simulation platform of a flexible beam system
in transverse vibration using a finite difference method is considered to
demonstrate the capabilities of the AVC system using RLS, GAs, GRNN,
and ANFIS. The simulation model of the AVC system is implemented,
tested, and its performance is assessed for the system identification models
using the proposed algorithms. Finally, a comparative performance of the
algorithms in implementing the model of the AVC system is presented and
discussed through a set of experiments
Compressed Genotyping
Significant volumes of knowledge have been accumulated in recent years
linking subtle genetic variations to a wide variety of medical disorders from
Cystic Fibrosis to mental retardation. Nevertheless, there are still great
challenges in applying this knowledge routinely in the clinic, largely due to
the relatively tedious and expensive process of DNA sequencing. Since the
genetic polymorphisms that underlie these disorders are relatively rare in the
human population, the presence or absence of a disease-linked polymorphism can
be thought of as a sparse signal. Using methods and ideas from compressed
sensing and group testing, we have developed a cost-effective genotyping
protocol. In particular, we have adapted our scheme to a recently developed
class of high throughput DNA sequencing technologies, and assembled a
mathematical framework that has some important distinctions from 'traditional'
compressed sensing ideas in order to address different biological and technical
constraints.Comment: Submitted to IEEE Transaction on Information Theory - Special Issue
on Molecular Biology and Neuroscienc
Compatible seismogram simulation at near source site using Multi Taper Spectral Analysis approach (MTSA)
In this article a methodology is presented to simulate the three components of seismograms, at low frequency (0-1.5 Hz). This method takes into account three characteristics of observed earthquake such as the frequency content, elastic response spectra and Arias Intensity at near source regime. A multi-taper method is employed for simulating seismogram aimed at accounting for the frequency content. The differences between response spectra, power spectral density and Arias Intensity corresponding to the recorded and simulated data are minimized through an optimization-based inversion solution technique. The proposed methodology is implemented to the 2003Bam scenario (Iran) as an example. The substantial large variance of Fourier spectral amplitudes corresponding to the two sets of seismograms as a main cause of time cost is discussed. Relatively good agreements between the synthetic and those of the predicted waveforms confirm the reliability of the proposed technique in modeling forward directivity effects at near source regime
Operational Research in Education
Operational Research (OR) techniques have been applied, from the early stages of the discipline, to a wide variety of issues in education. At the government level, these include questions of what resources should be allocated to education as a whole and how these should be divided amongst the individual sectors of education and the institutions within the sectors. Another pertinent issue concerns the efficient operation of institutions, how to measure it, and whether resource allocation can be used to incentivise efficiency savings. Local governments, as well as being concerned with issues of resource allocation, may also need to make decisions regarding, for example, the creation and location of new institutions or closure of existing ones, as well as the day-to-day logistics of getting pupils to schools. Issues of concern for managers within schools and colleges include allocating the budgets, scheduling lessons and the assignment of students to courses. This survey provides an overview of the diverse problems faced by government, managers and consumers of education, and the OR techniques which have typically been applied in an effort to improve operations and provide solutions
Cellular Automata Applications in Shortest Path Problem
Cellular Automata (CAs) are computational models that can capture the
essential features of systems in which global behavior emerges from the
collective effect of simple components, which interact locally. During the last
decades, CAs have been extensively used for mimicking several natural processes
and systems to find fine solutions in many complex hard to solve computer
science and engineering problems. Among them, the shortest path problem is one
of the most pronounced and highly studied problems that scientists have been
trying to tackle by using a plethora of methodologies and even unconventional
approaches. The proposed solutions are mainly justified by their ability to
provide a correct solution in a better time complexity than the renowned
Dijkstra's algorithm. Although there is a wide variety regarding the
algorithmic complexity of the algorithms suggested, spanning from simplistic
graph traversal algorithms to complex nature inspired and bio-mimicking
algorithms, in this chapter we focus on the successful application of CAs to
shortest path problem as found in various diverse disciplines like computer
science, swarm robotics, computer networks, decision science and biomimicking
of biological organisms' behaviour. In particular, an introduction on the first
CA-based algorithm tackling the shortest path problem is provided in detail.
After the short presentation of shortest path algorithms arriving from the
relaxization of the CAs principles, the application of the CA-based shortest
path definition on the coordinated motion of swarm robotics is also introduced.
Moreover, the CA based application of shortest path finding in computer
networks is presented in brief. Finally, a CA that models exactly the behavior
of a biological organism, namely the Physarum's behavior, finding the
minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From
software to wetware. Springer, 201
Estimation of origin-destination matrix from traffic counts: the state of the art
The estimation of up-to-date origin-destination matrix (ODM) from an obsolete trip data, using current
available information is essential in transportation planning, traffic management and operations.
Researchers from last 2 decades have explored various methods of estimating ODM using traffic count
data. There are two categories of ODM; static and dynamic ODM. This paper presents studies on both the
issues of static and dynamic ODM estimation, the reliability measures of the estimated matrix and also
the issue of determining the set of traffic link count stations required to acquire maximum information to
estimate a reliable matrix
- âŠ