24,223 research outputs found
Graphs with 3-rainbow index and
Let be a nontrivial connected graph with an edge-coloring
, where adjacent edges
may be colored the same. A tree in is a if no two edges
of receive the same color. For a vertex set , the tree
connecting in is called an -tree. The minimum number of colors that
are needed in an edge-coloring of such that there is a rainbow -tree for
each -set of is called the -rainbow index of , denoted by
. In \cite{Zhang}, they got that the -rainbow index of a tree is
and the -rainbow index of a unicyclic graph is or . So
there is an intriguing problem: Characterize graphs with the -rainbow index
and . In this paper, we focus on , and characterize the graphs
whose 3-rainbow index is and , respectively.Comment: 14 page
Picasso, Matisse, or a Fake? Automated Analysis of Drawings at the Stroke Level for Attribution and Authentication
This paper proposes a computational approach for analysis of strokes in line
drawings by artists. We aim at developing an AI methodology that facilitates
attribution of drawings of unknown authors in a way that is not easy to be
deceived by forged art. The methodology used is based on quantifying the
characteristics of individual strokes in drawings. We propose a novel algorithm
for segmenting individual strokes. We designed and compared different
hand-crafted and learned features for the task of quantifying stroke
characteristics. We also propose and compare different classification methods
at the drawing level. We experimented with a dataset of 300 digitized drawings
with over 80 thousands strokes. The collection mainly consisted of drawings of
Pablo Picasso, Henry Matisse, and Egon Schiele, besides a small number of
representative works of other artists. The experiments shows that the proposed
methodology can classify individual strokes with accuracy 70%-90%, and
aggregate over drawings with accuracy above 80%, while being robust to be
deceived by fakes (with accuracy 100% for detecting fakes in most settings)
The 3-rainbow index of a graph
Let be a nontrivial connected graph with an edge-coloring , where adjacent edges may be
colored the same. A tree in is a if no two edges of
receive the same color. For a vertex subset , a tree that
connects in is called an -tree. The minimum number of colors that
are needed in an edge-coloring of such that there is a rainbow -tree for
each -subset of is called -rainbow index, denoted by
. In this paper, we first determine the graphs whose 3-rainbow index
equals 2, , , respectively. We also obtain the exact values of
for regular complete bipartite and multipartite graphs and wheel
graphs. Finally, we give a sharp upper bound for of 2-connected
graphs and 2-edge connected graphs, and graphs whose attains the
upper bound are characterized.Comment: 13 page
Adaptive and Robust Fault-Tolerant Tracking Control of Contact force of Pantograph-Catenary for High-Speed Trains
Abstract This paper presents a modified multi-body dynamic model and a linear time-invariant model with actuator faults (loss of effectiveness faults, bias faults) and matched and unmatched uncertainties. Based on the fault model, a class of adaptive and robust tracking controllers are proposed which are adjusted online to tolerate the time-varying loss of effectiveness faults and bias faults, and compensate matched disturbances without the knowledge of bounds. For unmatched uncertainties, optimal control theory is added to the controller design processes. Simulations on a pantograph are shown to verify the efficiency of the proposed fault-tolerant design approach
Non-classical non-Gaussian state of a mechanical resonator via selectively incoherent damping in three-mode optomechanical systems
We theoretically propose a scheme for the generation of a non-classical
single-mode motional state of a mechanical resonator (MR) in the three-mode
optomechanical systems, in which two optical modes of the cavities are linearly
coupled to each other and one mechanical mode of the MR is optomechanically
coupled to the two optical modes with the same coupling strength
simultaneously. One cavity is driven by a coherent laser light. By properly
tuning the frequency of the weak driving field, we obtain engineered
Liouvillian superoperator via engineering the selective interaction Hamiltonian
confined to the Fock subspaces. In this case, the motional state of the MR can
be prepared into a non-Gaussian state, which possesses the sub-Poisson
statistics although its Wigner function is positive.Comment: 6 pages, 5 figure
- β¦