نتایج جستجو برای: orthogonal

تعداد نتایج: 47710  

2012
Saxby Pridmore Pim KuiPers Abdul Majeed Zainab Sam restifo Adrian Lee Julie aPPLeton

Background: Suicide may be conceptualized as an escape from intolerable predicaments, in particular, mental illness and environmental stressors. The operationalized predicaments of suicide (OPS) is a 4 category framework designed to assist in the classification of suicide. The objective was to examine whether this framework is potentially useful. Method: 18 psychiatrists from 6 different countr...

2003
ABDERRAZEK KAROUI

In this note, we announce a general method for the construction of nonseparable orthogonal wavelet bases of L2(Rn), where n ≥ 2. Hence, we prove the existence of such type of wavelet bases for any integer n ≥ 2. Moreover, we show that this construction method can be extended to the construction of n-D multiwavelet matrix filters.

Journal: :SIAM J. Math. Analysis 2001
Howard L. Resnikoff Jun Tian Raymond O. Wells

In this paper we study the algebraic and geometric structure of the space of compactly supported biorthogonal wavelets. We prove that any biorthogonal wavelet matrix pair (which consists of the scaling lters and wavelet lters) can be factored as the product of primitive parau-nitary matrices, a pseudo identity matrix pair, an invertible matrix, and the canonical Haar matrix. Compared with the f...

2013
Chung-Yi Suen

Mixed orthogonal arrays of strength two and size s are constructed by grouping points in the finite projective geometry . can be partitioned into   1, PG mn s   1, PG mn s       1 1 mn n s s         –1 n -flats such that each   –1 n flat is associated with a point in . An orthogonal array  1, n PG m s        1 1 mn n mn s s n s L s         can be constructed ...

Journal: :Australasian J. Combinatorics 2011
R. Sampathkumar M. Simaringa

Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...

2002
John G. Dorsey Daniel P. Siewiorek

This paper describes a design process for custom wearable systems produced in an academic setting. A set of 245 wearable design defects from two distinct periods separated by six years in time is presented. These data identify aspects of the process requiring significant developer effort, which we show using an Orthogonal Defect Classification scheme. A comparison of defect attribute distributi...

In this paper, we give the spectral theory for eigenvalues and eigenfunctions of a boundary value problem consisting of the linear fractional Bessel operator. Moreover, we show that this operator is self-adjoint, the eigenvalues of the problem are real, and the corresponding eigenfunctions are orthogonal. In this paper, we give the spectral theory for eigenvalues and eigenfunctions...

‎In this paper, generalized convex contractions on orthogonal metric spaces are stablished in whath  might be called their  definitive versions. Also, we show that there are examples which show that our main theorems are  genuine generalizations of Theorem 3.1 and 3.2 of [M.A. Miandaragh, M. Postolache and S. Rezapour,  {it Approximate fixed points of generalized convex contractions}, Fixed Poi...

Journal: :Int. J. Math. Mathematical Sciences 2013
Ramadan A. El-Shanawany Mahmoud Shibl Higazy Ahmed Ibrahim El Mesady

Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex, where G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H and share no edges whenever the corresponding vertices are nonadjacent in H. In this paper, we are concerned with ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید