Results 271 to 280 of about 1,069,691 (320)

Orthogonal Prediction Configural Frequency Analysis by Chi‐Square Partitioning

Biometrical Journal, 1992
AbstractPrediction Configural Frequency Analysis is reconceptualized in terms of orthogonal Chi‐Square decomposition. The predictor‐criterion contingency table is subdivided into fourfold tables. The chisquare components of these tables, calculated using Kimball's shortcut formulas, sum up to the total chi‐square of the r × c table. As a result of this
Erwin Lautsch, Gustav A. Lienert, Alexander Von Eye   +2 more
openaire   +1 more source

A new result on orthogonal factorizations in networks

Filomat
Let m, n, r, ? and ki (1 ? i ? m) be positive integers satisfying 1 ? n ? m and k1 ? k2 ???? ? km ? (3? ? 1)r ? 1. Let G be a graph, and let H be an m?-subgraph of G and F = {F1, F2,???, Fm} be a (g, f)- factorization of G. If for any partition {A1,A2,???
Sizhong Zhou, Quanru Pan, Yang Xu
semanticscholar   +1 more source

An orthogonal partition selection strategy for the sampling of graph signals with successive local aggregations

Signal Processing, 2021
Guangrui Yang, Lihua Yang, Chao Huang
semanticscholar   +1 more source

Orthogonal and Nonorthogonal Methods for Partitioning Regression Variance

American Educational Research Journal, 1971
Bottenberg and Ward's (1963) developments of the generalized exploitation of multiple linear regression and of their concept of "independent contributions" of variable sets in regression composites were based on Mood's distinction. Stimulated by these developments, two of their colleagues published a systematic application of the Bottenberg-Ward ...
openaire   +1 more source

An Orthogonal Partitioning Approach to Simplify Robust Model Predictive Control

Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005., 2005
The main limitation of many robust model predictive control (MPC) algorithms is the formidable on-line computational complexity. For linear discrete-time systems with a polytopic uncertainty description, a new efficient algorithm to determine an approximate explicit state feedback solution to robust MPC is developed.
M.T. Cychowski, null Baocang Ding, T. O'Mahony   +2 more
openaire   +1 more source

A Fundamental Partition in Models with Commutative Orthogonal Block Structure

AIP Conference Proceedings, 2011
Models with commutative orthogonal block structure, COBS, constitute an interesting class of models with orthogonal block structure, OBS, in which the orthogonal projection matrix on the space Ω spanned by the mean vectors commute with the known pairwise orthogonal projection matrices Q1,…, Qm that figure in the expression of the variance‐covariance ...
Francisco Carvalho, João T. Mexia, Ricardo Covas, Célia Fernandes, Theodore E. Simos, George Psihoyios, Ch. Tsitouras, Zacharias Anastassi   +7 more
openaire   +1 more source

Cycle reversals in oriented plane quadrangulations and orthogonal plane partitions

Journal of Geometry, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nakamoto, Atsuhiro, Watanabe, Mamoru
openaire   +1 more source

ORTHOGONAL PARTITIONS OF THE 5 × 5 LATIN SQUARES

Annals of Eugenics, 1946
The articles published by the Annals of Eugenics (1925–1954) have been made available online as an historical archive intended for scholarly use. The work of eugenicists was often pervaded by prejudice against racial, ethnic and disabled groups. The online publication of this material for scholarly research purposes is not an endorsement of those views
openaire   +1 more source

Binary Space Partition for Orthogonal Fat Rectangles

2003
We generate a binary space partition (BSP) of size O(n log8 n) and depth O(n log4 n) for n orthogonal fat rectangles in three-space, improving earlier bounds of Agarwal et al. We also give a lower bound construction showing that the size of an orthogonal BSP for these objects is Ω(n log n) in the worst case.
openaire   +1 more source

Optimal set-partitioning for super-orthogonal space-time trellis codes

Proceedings IEEE International Symposium on Information Theory,, 2003
Space-time trellis codes provide improved error performance for wireless systems using multiple transmit antennas. The authors have shown that such codes can provide full diversity gain as well as additional signal-to-noise ratio (SNR) advantage that they call the coding gain. Code design rules for achieving full diversity are also provided.
H. Jafarkhani, N. Seshadri
openaire   +1 more source