434,515 research outputs found
Degree Sequence Index Strategy
We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by
which to bound graph invariants by certain indices in the ordered degree
sequence. As an illustration of the DSI strategy, we show how it can be used to
give new upper and lower bounds on the -independence and the -domination
numbers. These include, among other things, a double generalization of the
annihilation number, a recently introduced upper bound on the independence
number. Next, we use the DSI strategy in conjunction with planarity, to
generalize some results of Caro and Roddity about independence number in planar
graphs. Lastly, for claw-free and -free graphs, we use DSI to
generalize some results of Faudree, Gould, Jacobson, Lesniak and Lindquester
Determining the multi-scale hedge ratios of stock index futures using the lower partial moments method
This paper considers a multi-scale future hedge strategy that minimizes lower partial moments (LPM). To do this, wavelet analysis is adopted to decompose time series datainto different components. Next, different parametric estimation methods with known distributions are applied to calculate the LPM of hedged portfolios, which is the key todetermining multi-scale hedge ratios over different time scales. Then these parametric methods are compared with the prevailing nonparametric kernel metric method. Empirical results indicate that in the China Securities Index 300 (CSI 300) index futures and spot markets, hedge ratios and hedge efficiency estimated by the nonparametric kernel metric method are inferior to those estimated by parametric hedging model based on the featuresof sequence distributions. In addition, if minimum-LPM is selected as a hedge target, the hedging periods, degree of risk aversion, and target returns can affect the multi-scale hedge ratios and hedge efficiency, respectively
An Optimized and Scalable Eigensolver for Sequences of Eigenvalue Problems
In many scientific applications the solution of non-linear differential
equations are obtained through the set-up and solution of a number of
successive eigenproblems. These eigenproblems can be regarded as a sequence
whenever the solution of one problem fosters the initialization of the next. In
addition, in some eigenproblem sequences there is a connection between the
solutions of adjacent eigenproblems. Whenever it is possible to unravel the
existence of such a connection, the eigenproblem sequence is said to be
correlated. When facing with a sequence of correlated eigenproblems the current
strategy amounts to solving each eigenproblem in isolation. We propose a
alternative approach which exploits such correlation through the use of an
eigensolver based on subspace iteration and accelerated with Chebyshev
polynomials (ChFSI). The resulting eigensolver is optimized by minimizing the
number of matrix-vector multiplications and parallelized using the Elemental
library framework. Numerical results show that ChFSI achieves excellent
scalability and is competitive with current dense linear algebra parallel
eigensolvers.Comment: 23 Pages, 6 figures. First revision of an invited submission to
special issue of Concurrency and Computation: Practice and Experienc
A Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions
In this work we develop a dynamically adaptive sparse grids (SG) method for
quasi-optimal interpolation of multidimensional analytic functions defined over
a product of one dimensional bounded domains. The goal of such approach is to
construct an interpolant in space that corresponds to the "best -terms"
based on sharp a priori estimate of polynomial coefficients. In the past, SG
methods have been successful in achieving this, with a traditional construction
that relies on the solution to a Knapsack problem: only the most profitable
hierarchical surpluses are added to the SG. However, this approach requires
additional sharp estimates related to the size of the analytic region and the
norm of the interpolation operator, i.e., the Lebesgue constant. Instead, we
present an iterative SG procedure that adaptively refines an estimate of the
region and accounts for the effects of the Lebesgue constant. Our approach does
not require any a priori knowledge of the analyticity or operator norm, is
easily generalized to both affine and non-affine analytic functions, and can be
applied to sparse grids build from one dimensional rules with arbitrary growth
of the number of nodes. In several numerical examples, we utilize our
dynamically adaptive SG to interpolate quantities of interest related to the
solutions of parametrized elliptic and hyperbolic PDEs, and compare the
performance of our quasi-optimal interpolant to several alternative SG schemes
Cyclic redundancy check-based detection algorithms for automatic identification system signals received by satellite.
This paper addresses the problem of demodulating signals transmitted in the automatic identification system. The main characteristics of such signals consist of two points: (i) they are modulated using a trellis-coded modulation, more precisely a Gaussian minimum shift keying modulation; and (ii) they are submitted to a bit stuffing procedure, which makes more difficult the detection of the transmitted information bits. This paper presents several demodulation algorithms developed in different contexts: mono-user and multi-user transmissions, and known/unknown phase shift. The proposed receiver uses the cyclic redundancy check (CRC) present in the automatic identification system signals for error correction and not for error detection only. By using this CRC, a particular Viterbi algorithm, on the basis of a so-called extended trellis, is developed. This trellis is defined by extended states composed of a trellis code state and a CRC state. Moreover, specific conditional transitions are defined to take into account the possible presence of stuffing bits. The algorithms proposed in the multi-user scenario present a small increase of computation complexity with respect to the mono-user algorithms. Some performance results are presented for several scenarios in the context of the automatic identification system and compared with those of existing techniques developed in similar scenarios
A new upper bound on the game chromatic index of graphs
We study the two-player game where Maker and Breaker alternately color the
edges of a given graph with colors such that adjacent edges never get
the same color. Maker's goal is to play such that at the end of the game, all
edges are colored. Vice-versa, Breaker wins as soon as there is an uncolored
edge where every color is blocked. The game chromatic index
denotes the smallest for which Maker has a winning strategy.
The trivial bounds hold for every
graph , where is the maximum degree of . In 2008, Beveridge,
Bohman, Frieze, and Pikhurko proved that for every there exists a
constant such that holds for any graph
with , and conjectured that the same
holds for every graph . In this paper, we show that is true for all graphs with . In
addition, we consider a biased version of the game where Breaker is allowed to
color edges per turn and give bounds on the number of colors needed for
Maker to win this biased game.Comment: 17 page
- âŠ