Indexing structures based on space partitioning are powerless because of the well-known “curse of dimensionality”. Linear scan of the data with approximation is more efficient in high dimensional similarity search. However, approaches so far concentrated on reducing I/O, ignored the computation cost. For an expensive distance function such as Lp norm with fractional p, the computation cost beco...

Tensor representation and tensor decompositions are natural approaches to deal with large amounts of data with multiple aspects and high dimensionality in modern applications, such as environmental analysis, chemometrices, pharmaceutical analysis, spectral analysis, neuroscience. The two most popular decomposition/factorization models for N -th order tensors are the Tucker model and the more re...

The present study demonstrated scale development of the social support (SS), whose measurement should be re-evaluated based on past studies findings. This aimed for and investigated dimensionality items measuring SS construct. validation content face validity used Modified Delphi Method with seven panelists, however Exploratory Factor Analysis (EFA) questionnaires construct was administered 100...

In the 1970s O. Zariski introduced a general theory of equisingularity for algebroid and algebraic hypersurfaces over an algebraically closed field characteristic zero. His builds up on understanding dimensionality type hypersurface singularities, notion defined recursively by considering discriminants loci successive “generic” corank <mml:math xmlns:...

let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...

‎‎let $g=(v,e)$ be a simple graph‎. ‎an edge labeling $f:eto {0,1}$ induces a vertex labeling $f^+:vtoz_2$ defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$‎, ‎where $z_2={0,1}$ is the additive group of order 2‎. ‎for $iin{0,1}$‎, ‎let‎ ‎$e_f(i)=|f^{-1}(i)|$ and $v_f(i)=|(f^+)^{-1}(i)|$‎. ‎a labeling $f$ is called edge-friendly if‎ ‎$|e_f(1)-e_f(0)|le 1$‎. ‎$i_f(g)=v_f(...

ÐThe observed image texture for a rough surface has a complex dependence on the illumination and viewing angles due to effects such as foreshortening, local shading, interreflections, and the shadowing and occlusion of surface elements. We introduce the dimensionality surface as a representation for the visual complexity of a material sample. The dimensionality surface defines the number of bas...