نتایج جستجو برای: mean distance

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

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت دبیر شهید رجایی - دانشکده علوم انسانی 1392

this study investigated the impact of explicit instruction of morphemic analysis and synthesis on the vocabulary development of the students. the participants were 90 junior high school students divided into two experimental groups and one control group. morphological awareness techniques (analysis/synthesis) and conventional techniques were used to teach vocabulary in the experimental groups a...

Journal: :PeerJ PrePrints 2016
Daniel J. Greenhoe

Metric spaces provide a framework for analysis and have several very useful properties. Many of these properties follow in part from the triangle inequality. However, there are several applications in which the triangle inequality does not hold but in which we may still like to perform analysis. This paper investigates what happens if the triangle inequality is removed all together, leaving wha...

Journal: :Discrete & Computational Geometry 2017
Claudia D'Ambrosio Ky Khac Vu Carlile Lavor Leo Liberti Nelson Maculan

The interval Distance Geometry Problem (i DGP) consists in finding a realization in R of a simple undirected graph G = (V,E) with nonnegative intervals assigned to the edges in such a way that, for each edge, the Euclidean distance between the realization of the adjacent vertices is within the edge interval bounds. In this paper, we focus on the application to the conformation of proteins in sp...

1999
RUMEN KUNCHEV ALEXANDER MIRONOV

A new class of algorithms for image decomposition, named Inverse Pyramid Decomposition (IPD), is explored in this work. The algorithms of this class, developed and analyzed in the present work, are based on image approximation in the pyramid levels with a set of models. The algorithm for pyramid decomposition, known as Reduced Difference Pyramid (RDP) [2], which is the closest of the same class...

2015
Noriyuki Iwane

Semaphore, a way of communicating remotely, usually practiced in scouting activities. Information is delivered by gestures or movements using specific tools such as flags, paddles or rods. Teacher and instructors are needed for learning semaphore in conventional way as they will give examples and make correction when such an error occured. Based on the practical need to provide an alternative w...

1997
W Hunziker I M Sigal

We give a full and selfcontained account of the basic results in N{body scattering theory which emerged over the last ten years: The existence and completeness of scattering states for potentials decreasing like r ? , > p 3 ? 1. Our approach is a synthesis of earlier work and of new ideas. Global conditions on the potentials are imposed only to deene the dynamics. Asymptotic completeness is der...

1997
J. Ross Thomson Jaume Casademunt

The eeects of ow induced by a random acceleration eld (g-jitter) are considered in two related situations that are of interest for microgravity uid experiments: the random motion of isolated buoyant particles, and diiusion driven coarsening of a solid-liquid mixture. We start by analyzing in detail actual accelerometer data gathered during a recent microgravity mission, and obtain the values of...

2007
Ahmad M. Sarhan Omar I. Al Helalat

In this paper, a novel approach to Arabic letter recognition is proposed. The system is based on the classified vector quantization (CVQ) technique employing the minimum distance classifier. To prove the robustness of the CVQ system, its performance is compared to that of a standard artificial neural network (ANN)-based solution. In the CVQ system, each input letter is mapped to its class using...

Journal: :transactions on combinatorics 2012
ivan gutman linhua feng guihai yu

let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

For all $a,b>0$, the following two optimal inequalities are presented: $H^{alpha}(a,b)L^{1-alpha}(a,b)geq M_{frac{1-4alpha}{3}}(a,b)$ for $alphain[frac{1}{4},1)$, and $ H^{alpha}(a,b)L^{1-alpha}(a,b)leq M_{frac{1-4alpha}{3}}(a,b)$ for $alphain(0,frac{3sqrt{5}-5}{40}]$. Here, $H(a,b)$, $L(a,b)$, and $M_p(a,b)$ denote the harmonic, logarithmic, and power means of order $p$ of two positive numbers...

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

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