New lower bounds on the size of (n,r)‐arcs in PG(2,q)
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21672
Abstract: An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective linear codes. Let… read more here.
Keywords: bounds size; size arcs; lower bounds; new lower ... See more keywords
Are Cramér‐Rao lower bounds an accurate estimate for standard deviations in in vivo magnetic resonance spectroscopy?
Sign Up to like & getrecommendations! Published in 2021 at "NMR in Biomedicine"
DOI: 10.1002/nbm.4521
Abstract: Due to inherent time constraints for in vivo experiments, it is infeasible to repeat multiple MRS scans to estimate standard deviations on the desired measured parameters. As such, the Cramér‐Rao lower bounds (CRLBs) have become… read more here.
Keywords: cram rao; standard deviations; lower bounds; spectroscopy ... See more keywords
Lower bounds for the eigenvalue estimates of the submanifold Dirac operator
Sign Up to like & getrecommendations! Published in 2020 at "Mathematische Zeitschrift"
DOI: 10.1007/s00209-021-02752-4
Abstract: We get optimal lower bounds for the eigenvalues of the submanifold Dirac operator on locally reducible Riemannian manifolds in terms of intrinsic and extrinsic expressions. The limiting-cases are also studied. As a corollary, we can… read more here.
Keywords: submanifold dirac; bounds eigenvalue; dirac operator; lower bounds ... See more keywords
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0485-7
Abstract: We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called k-LCIS: Given k integer sequences $$X_1,\dots ,X_k$$X1,⋯,Xk of length at most n, the task is to determine the length… read more here.
Keywords: longest common; time; subsequence; lower bounds ... See more keywords
Lower Bounds on the Runtime of Crossover-Based Algorithms via Decoupling and Family Graphs
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00776-6
Abstract: The runtime analysis of evolutionary algorithms using crossover as search operator has recently produced remarkable results indicating benefits and drawbacks of crossover and illustrating its working principles. Virtually all these results are restricted to upper… read more here.
Keywords: crossover; family; based algorithms; crossover based ... See more keywords
Improved lower bounds on the degree–diameter problem
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Algebraic Combinatorics"
DOI: 10.1007/s10801-018-0822-6
Abstract: Let C(d, k) and AC(d, k) be the largest order of a Cayley graph and a Cayley graph based on an abelian group, respectively, of degree d and diameter k. It is well known that $$C(d,k)\le 1+d+d(d-1)+\cdots… read more here.
Keywords: degree diameter; graph; diameter problem; frac ... See more keywords
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Global Optimization"
DOI: 10.1007/s10898-019-00780-3
Abstract: In this paper we address a min–max problem of fractional quadratic (not necessarily convex) over linear functions on a feasible set described by linear and (not necessarily convex) quadratic functions. We propose a conic reformulation… read more here.
Keywords: fractional quadratic; quadratic problems; max fractional; min max ... See more keywords
New lower bounds on q-ary error-correcting codes
Sign Up to like & getrecommendations! Published in 2018 at "Cryptography and Communications"
DOI: 10.1007/s12095-018-0302-9
Abstract: Let Aq (n, d) denote the maximum size of a q-ary code with length n and minimum distance d. For most values of n and d, only lower and upper bounds on Aq (n, d)… read more here.
Keywords: bounds ary; correcting codes; error correcting; lower bounds ... See more keywords
A new approach to distributed control for multi-agent systems based on approximate upper and lower bounds
Sign Up to like & getrecommendations! Published in 2017 at "International Journal of Control, Automation and Systems"
DOI: 10.1007/s12555-015-0479-z
Abstract: In this paper, the distributed control of the LQR problem for continuous-time multi-agent systems is considered. Based on the centralized optimal control, we prove that the solution of the algebraic Riccati equation is the maximal… read more here.
Keywords: agent systems; control; multi agent; lower bounds ... See more keywords
Lower bounds for enumerative counts of positive-genus real curves
Sign Up to like & getrecommendations! Published in 2018 at "Advances in Mathematics"
DOI: 10.1016/j.aim.2018.09.024
Abstract: We transform the positive-genus real Gromov-Witten invariants of many real-orientable symplectic threefolds into signed counts of curves. These integer invariants provide lower bounds for counts of real curves of a given genus that pass through… read more here.
Keywords: bounds enumerative; real curves; lower bounds; positive genus ... See more keywords
Lower Bounds on Delay Margin of Second-Order Unstable Systems
Sign Up to like & getrecommendations! Published in 2018 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2018.07.230
Abstract: Abstract This paper examines the delay margin achievable by using PID controllers for linear time-invariant (LTI) systems subject to variable, unknown time delays. We derive explicit lower bounds on the delay margin of second-order unstable… read more here.
Keywords: second order; delay margin; lower bounds; bounds delay ... See more keywords