18,565 research outputs found
A multiparameter family of irreducible representations of the quantum plane and of the quantum Weyl algebra
We construct a family of irreducible representations of the quantum plane and
of the quantum Weyl algebra over an arbitrary field, assuming the deformation
parameter is not a root of unity. We determine when two representations in this
family are isomorphic, and when they are weight representations, in the sense
of Bavula.Comment: 12 pages, Section 2 has been reorganized, new material added in a new
Section
Multi-q Pattern Classification of Polarization Curves
Several experimental measurements are expressed in the form of
one-dimensional profiles, for which there is a scarcity of methodologies able
to classify the pertinence of a given result to a specific group. The
polarization curves that evaluate the corrosion kinetics of electrodes in
corrosive media are an application where the behavior is chiefly analyzed from
profiles. Polarization curves are indeed a classic method to determine the
global kinetics of metallic electrodes, but the strong nonlinearity from
different metals and alloys can overlap and the discrimination becomes a
challenging problem. Moreover, even finding a typical curve from replicated
tests requires subjective judgement. In this paper we used the so-called
multi-q approach based on the Tsallis statistics in a classification engine to
separate multiple polarization curve profiles of two stainless steels. We
collected 48 experimental polarization curves in aqueous chloride medium of two
stainless steel types, with different resistance against localized corrosion.
Multi-q pattern analysis was then carried out on a wide potential range, from
cathodic up to anodic regions. An excellent classification rate was obtained,
at a success rate of 90%, 80%, and 83% for low (cathodic), high (anodic), and
both potential ranges, respectively, using only 2% of the original profile
data. These results show the potential of the proposed approach towards
efficient, robust, systematic and automatic classification of highly non-linear
profile curves.Comment: 12 pages, 7 figure
Plantio direto de feijão Phaseolus sobre a palhada da leguminosa Guandu na agricultura familiar da Transamazônica.
bitstream/item/28092/1/com.tec.81.pd
Control Plane Compression
We develop an algorithm capable of compressing large networks into a smaller
ones with similar control plane behavior: For every stable routing solution in
the large, original network, there exists a corresponding solution in the
compressed network, and vice versa. Our compression algorithm preserves a wide
variety of network properties including reachability, loop freedom, and path
length. Consequently, operators may speed up network analysis, based on
simulation, emulation, or verification, by analyzing only the compressed
network. Our approach is based on a new theory of control plane equivalence. We
implement these ideas in a tool called Bonsai and apply it to real and
synthetic networks. Bonsai can shrink real networks by over a factor of 5 and
speed up analysis by several orders of magnitude.Comment: Extended version of the paper appearing in ACM SIGCOMM 201
Event-Driven Network Programming
Software-defined networking (SDN) programs must simultaneously describe
static forwarding behavior and dynamic updates in response to events.
Event-driven updates are critical to get right, but difficult to implement
correctly due to the high degree of concurrency in networks. Existing SDN
platforms offer weak guarantees that can break application invariants, leading
to problems such as dropped packets, degraded performance, security violations,
etc. This paper introduces EVENT-DRIVEN CONSISTENT UPDATES that are guaranteed
to preserve well-defined behaviors when transitioning between configurations in
response to events. We propose NETWORK EVENT STRUCTURES (NESs) to model
constraints on updates, such as which events can be enabled simultaneously and
causal dependencies between events. We define an extension of the NetKAT
language with mutable state, give semantics to stateful programs using NESs,
and discuss provably-correct strategies for implementing NESs in SDNs. Finally,
we evaluate our approach empirically, demonstrating that it gives well-defined
consistency guarantees while avoiding expensive synchronization and packet
buffering
- …