The influence of contextual similarity on children's recognition memory performance was examined using a retroactive interference paradigm. In the study, 9- and 12-year-olds were randomly assigned to one of two contextual conditions. In both conditions, target and interfering information were presented in distinctive contexts by using different modalities (pictures and words, respectively). How...

The revised edge-Szeged index of a connected graph $G$ is defined as Sze*(G)=∑e=uv∊E(G)( (mu(e|G)+(m0(e|G)/2)(mv(e|G)+(m0(e|G)/2) ), where mu(e|G), mv(e|G) and m0(e|G) are, respectively, the number of edges of G lying closer to vertex u than to vertex v, the number of ed...

The fine-grained soil including the problematic ones can cause many difficulties in project accomplishment. Settlement and swelling are among the problems of the fine-grained soils. The present study compared the effects of the polypropylene waste plastic (PWP) and glass fiber reinforced polymer (GFRP) on geotechnical properties of the clayey soils for the subgrade design. To this end, the PWP ...

The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...

This paper presents a speech enhancement method, where an adaptive threshold is statistically determined based on Gaussian modeling of Teager energy (TE) operated perceptual wavelet packet (PWP) coe cients of noisy speech. In order to obtain an enhanced speech, the threshold thus derived is applied upon the PWP coe cients by employing a Gaussian pdf dependent custom thresholding function, which...

The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...

The atom bond connectivity index of a graph is a new topological index was defined by E. Estrada as ABC(G)  uvE (dG(u) dG(v) 2) / dG(u)dG(v) , where G d ( u ) denotes degree of vertex u. In this paper we present some bounds of this new topological index.

i n m a n u f a c t u r i n g a c t i v i t i e s, i s s u e s s u c h a s t h e i n t e n s i t y o f c o m p e t i t i o n, r i s i n g a n d c h a n g i n g c u s t o m e r e x p e c t a t i o n s, a n d e v e r-i n c r e a s i n g t e c h n o l o g i c a l d e v e l o p m e n t s, i n t e n s i f y m a n u f a c t u r e r c o m m i t m e n t t o e l i m i n a t e d e f e c t s i n i t s p r...

‎let $r$ be a noncommutative prime ring of‎ ‎characteristic different from $2$‎, ‎$u$ the utumi quotient ring of $r$‎, ‎$c$ $(=z(u))$ the extended centroid‎ ‎of $r$‎. ‎let $0neq ain r$ and $f(x_1,ldots,x_n)$ a multilinear‎ ‎polynomial over $c$ which is noncentral valued on $r$‎. ‎suppose‎ ‎that $g$ and $h$ are two nonzero generalized derivations of $r$‎ ‎such that $a(h(f(x))f(x)-f(x)g(f(x)))in ...