Results 61 to 70 of about 793,315 (170)
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
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
Journal of Field Robotics, EarlyView.ABSTRACT People with physical disabilities face significant mobility challenges while climbing uneven surfaces and staircases. In these circumstances, traditional wheelchairs do not provide stable, safely controlled mobility, underscoring the importance of building superior stair‐climbing wheelchairs for both medical and infrastructure purposes.
Gopisetti Manikanta +10 more
wiley +1 more source
, 2023 Given a finite simple graph G $G$, an odd cover of G $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of G $G$ appears in an odd number of bicliques, and each nonedge of G $G$ appears in an even number of bicliques.
Jiaxi Nie +12 more
core +1 more source
Integrative Zoology, EarlyView.A quantum‐enhanced weighted gene co‐expression network analysis framework integrating quantum amplitude amplification is developed to overcome sample size constraints in zoological genomics. This noise‐tolerant analytical strategy enables robust network reconstruction for non‐model species with limited biological replicates.
Seok‐Jin Kang, Hongchul Shin
wiley +1 more source
Accounting &Finance, EarlyView.ABSTRACT We examine how accounting quality attributes jointly mitigate underpricing associated with two dimensions of information risk in seasoned equity offerings (SEOs). In information environments with relatively more potent information asymmetry, the evidence suggests that accruals quality and accounting comparability act as substitutes; i.e ...
Adam Bordeman +3 more
wiley +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
New Families of Odd Harmonious Graphs
, 2014 Dans cet article, nous montrons que le nombre d'arêtes pour tout graphe eulérien harmonieux impair est congruent à 0 ou 2 (mod 4), et nous avons trouvé un contre-exemple pour l'inverse de cette affirmation n'est pas vrai. Nous avons également prouvé que, les graphiques qui sont construits par deux copies de cycle pair Cn partageant une arête commune ...
openaire +2 more sources
Computation of Even-Odd Harmonious Labeling of Certain Family of Acyclic Graphs
International Journal of Engineering and Advanced Technology, 2019 Let ( ) , GVE be a graph with p number of vertices and q number of edges. An injective function f :V →1, 3, 5, , 2 p −1 is called an even-odd harmonious labeling of the graph G if there exists an induced edge function : →0,2,,2( −1) * f E q such that i) * f is bijective function ii) ( = ) = ( ( ) + ( ))( 2 ) * f e uv f u f v mod q The graph ...
M. Kalaimathi, B. J. Balamurugan
openaire +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source