In this paper we introduce a new compression technique for 2D vector fields which preserves the complete topology, i.e., the critical points and the connectivity of the separatrices. As the theoretical foundation of the algorithm, we show in a theorem that for local modifications of a vector field, it is possible to decide entirely by a local analysis whether or not the global topology is prese...

relatively freely along the neural fiber direction but are While functional brain imaging methods can locate the hindered in the fiber-transverse direction. The hindrance cortical regions subserving particular cognitive funcof water diffusion in white matter is putatively due to tions, the connectivity between the functional areas of the diffusion barrier presented by the cell membrane the huma...

relatively freely along the neural fiber direction but are While functional brain imaging methods can locate the hindered in the fiber-transverse direction. The hindrance cortical regions subserving particular cognitive funcof water diffusion in white matter is putatively due to tions, the connectivity between the functional areas of the diffusion barrier presented by the cell membrane the huma...

Chari proved that if ∆ is a (d − 1)-dimensional simplicial complex with a convex ear decomposition, then h0 ≤ · · · ≤ hbd/2c [7]. Nyman and Swartz raised the problem of whether or not the corresponding g-vector is an M -vector [18]. This is proved to be true by showing that the set of pairs (ω,Θ), where Θ is a l.s.o.p. for k[∆], the face ring of ∆, and ω is a g-element for k[∆]/Θ, is nonempty w...

the tenacity of a graph g, t(g), is dened by t(g) = min{[|s|+τ(g-s)]/[ω(g-s)]}, where the minimum is taken over all vertex cutsets s of g. we dene τ(g - s) to be the number of the vertices in the largest component of the graph g - s, and ω(g - s) be the number of components of g - s.in this paper a lower bound for the tenacity t(g) of a graph with genus γ(g) is obtained using the graph's...

let $gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. denote by $upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. in the classes of graphs $gamma_{n,kappa}$ and $upsilon_{n,beta}$, the elements having maximum augmented zagreb index are determined.

Word embedding is a technique to represent sentences in vector space. The representation itself carried-out build model that would suffice representing particular task related the use of sentence itself, for example, similarity among sentences/words, Twitter user connectivity, and demographics tweets model. word handful sentiment analysis research because it helps mathematical-friendly from sen...

An algorithm has been designed to infer the flow direction of a river network represented in a vector data model. It is based on the connectivity of channels and heuristics about the angles at which channels intersect at junctions, but it requires no information about the elevation of the terrain. The algorithm finds first the main branches of a network, from which it then infers the destinatio...

A new computational method is introduced to predict disulfide connectivity patterns in a protein chain, starting with the assumption that the disulfide bonding state of each cysteine is known. The method uses support vector machines based on the pairwise local similarities between cyteineneighboring sequences and the distance between the cysteine pair under consideration. According to the exper...