Results 41 to 50 of about 35,860 (292)
Orthogonal Trades and the Intersection Problem for Orthogonal Arrays
Graphs and Combinatorics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fatih Demirkale +3 more
openaire +7 more sources
A Novel Block-based Watermarking Scheme Using the SVD Transform
Algorithms, 2009 In this paper, a block-based watermarking scheme based on the Singular Value Decomposition (SVD) is proposed. Our watermark, a pseudo-random Gaussian sequence, is embedded by modifying the angles formed by the right singular vectors of each block of the ...
Alessandro Basso +4 more
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1971 AbstractWe give a new construction showing how new orthomodular lattices can be built out of old ones by choosing any join dense subset of the given orthomodular lattice and putting a lexicographic orthogonality relation on the free monoid generated by this subset. This construction has relevance to the logic of an empirical science and, in particular,
David J. Foulis, C. H. Randall
openaire +3 more sources
Independent representations of ipsilateral and contralateral limbs in primary motor cortex
eLife, 2019 Several lines of research demonstrate that primary motor cortex (M1) is principally involved in controlling the contralateral side of the body. However, M1 activity has been correlated with both contralateral and ipsilateral limb movements.
Ethan A Heming +4 more
doaj +1 more source
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard P. Anstee, Lou Caccetta
openaire +2 more sources
OFDM MIMO radar waveform design for targets identification
ETRI Journal, 2018 In order to obtain better target identification performance, an efficient waveform design method with high range resolution and low sidelobe level for orthogonal frequency division multiplexing (OFDM) multiple‐input multiple‐output (MIMO) radar is ...
Ting Bai, Nae Zheng, Song Chen
doaj +1 more source
The Annals of Mathematical Statistics, 1966 It was shown in [11] that one can construct orthogonal arrays $(\lambda 2^3, k + 1, 2, 3)$ from arrays $(\lambda 2^2, k, 2, 2)$ with the maximum number of constraints $k + 1$ provided that $k$ is the maximum number of constraints for the arrays of strength two. This result is generalized here to construction of arrays $(\lambda 2^{t + 1}, k + 1, 2, t +
Seiden, Esther, Zemach, Rita
openaire +2 more sources
Science and Religion: Some Demarcation Criteria
Zygon, 2001 Discussions on the congruence, compatibility, and contradictions between science and religion have been going on since the rise of modern science. In our own times, there are many efforts to build bridges of harmony between the two.
doaj +2 more sources
Discrete Mathematics, 2002 Let \(G\) be a graph decomposed into \(m\) 2-factors. An orthogonal matching in \(G\) is a matching which contains exactly one edge from each 2-factor. It is proved that \(G\) has an orthogonal matching if the order of \(G\) is at least \(3m- 2\).
openaire +2 more sources
Two Mappings Related To Semi-Inner Products And Their Applications in Geometry of Normed Linear Spaces [PDF]
, 1998 In this paper we introduce two mappings associated with the lower and upper semiinner product (.,.)i and (.,.)s and with semi-inner products [.,.] (in the sense of Lumer) which generate the norm of a real normed linear space, and study properties of ...
Koliha, Jerry J, Dragomir, Sever S
core +6 more sources