Results 61 to 70 of about 5,368 (184)

Perturbation‐induced responses improved seizure forecasting in epileptic rats

Epilepsia, EarlyView.
Abstract Objective The unpredictability of seizures is one of the most challenging aspects of uncontrolled epilepsy for patients. Prior work forecasting seizure risk has measured changes in passive intracranial electroencephalographic (EEG) signals, but currently, there are no such clinical devices available.
Wei‐Chih Chang, Jack Lin, Warwick Cheung, Alan Lai, Mark J. Cook, David B. Grayden, William C. Stacey   +6 more
wiley   +1 more source

Intersection Numbers of the Natural Embedding of the Twisted Triality Hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$

Journal of Combinatorial Designs, EarlyView.
ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley   +1 more source

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley   +1 more source

Graph Isomorphism and the Lasserre Hierarchy [PDF]

, 2014
In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that runs in time exp(
Codenotti, Paolo, Schoenebeck, Grant, Snook, Aaron   +2 more
core  

Orthogonal labeling

Indonesian Journal of Combinatorics, 2016
Let ∆G be the maximum degree of a simple connected graph G(V,E). An injective mapping P : V → R∆G is said to be an orthogonal labeling of G if uv,uw ∈ E implying (P(v) − P(u)) · (P(w) − P(u)) = 0, where · is the usual dot product defined in Euclidean ...
Bernard Immanuel, Kiki A. Sugeng
doaj  

Double quadrilateral snakes on k-odd sequential harmonious labeling of graphs

Malaya Journal of Matematik, 2015
The objective of this paper is to investigate some $k$-odd sequential harmonious labeling of graphs. In particular, we show that $k$-odd sequential harmonious labeling of double quadrilateral snakes $\left(2 Q_x\right.$-snakes) for each $x \geq 1$. We also prove that, $2 m Q_x$-snakes are $k$-odd sequential harmonious labeling of graphs for each $m, x \
null A. Manonmani, null R. Savithiri
openaire   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Multimode Phonon Lasing via Self‐Induced Optical Coherent Pumping

Laser &Photonics Reviews, EarlyView.
A silicon optomechanical nanobeam generates self‐sustained phonon lasing in multiple competing mechanical modes via self‐pulsing, an intrinsic optical modulation arising from cavity nonlinearity. This self‐organized mechanism enables robust multi‐frequency operation spanning periodic, quasi‐periodic, and chaotic regimes without external modulation. The
David Alonso Tomás, Carlos Mas Arabí, Carles Milián, Néstor E. Capuj, Alejandro Martínez, Daniel Navarro Urrios   +5 more
wiley   +1 more source

On d-graceful labelings

, 2012
In this paper we introduce a generalization of the well known concept of a graceful labeling. Given a graph G with e=dm edges, we call d-graceful labeling of G an injective function from V(G) to the set {0,1,2,..., d(m+1)-1} such that {|f(x)-f(y)| | [x,y]
Pasotti, A.
core  

The role of identification in data‐driven policy iteration: A system theoretic study

International Journal of Robust and Nonlinear Control, EarlyView.
Abstract The goal of this article is to study fundamental mechanisms behind so‐called indirect and direct data‐driven control for unknown systems. Specifically, we consider policy iteration applied to the linear quadratic regulator problem. Two iterative procedures, where data collected from the system are repeatedly used to compute new estimates of ...
Bowen Song, Andrea Iannelli
wiley   +1 more source