あらまし 探したい音や映像が具体的に与えられ,それとほぼ同じ信号の区間が蓄積された長時間の音や映像 の中のどこにあるかを高速に探索する問題に対する新しい手法を提案する.これまでに,高速探索手法の一つと して,時系列アクティブ探索法が提案されている.これは,信号から抽出したヒストグラムに基づく信号探索手 法であり,ローカルな枝刈り,すなわち照合窓周辺の類似度に基づいて探索の必要がない区間の照合を省くこと により高速な探索を実現していた.それに対し,提案手法は,ローカルな枝刈りに加え,信号全体の類似性に基 づくヒストグラムの分類により信号時系列全体を見て探索の必要がない区間を取り除く,グローバルな枝刈りを 導入することにより,更に高速な探索を実現する.本論文では,グローバルな枝刈りの度合と保証される精度と の関係を詳しく議論する.例えば提案手法では,128 次元のヒストグラムを 1024...

Oak trees cover a wide range of forests in Iran and most of them are located in Kohgiloye and Boyer-Ahmad province (K.B). The high tannin is one of the anti-nutritional characteristics of acorn for domestic animal. Wide range of gut microorganisms could tolerate tannin and reduce it by producing tannase enzyme. This study was carried out to isolate and identify the tannin resistance bacteria (t...

Background & objectives: Nutrition literacy is defined as the degree to which individuals have the capacity to obtain process, understand and use nutritional information to make an appropriate decision about nutritional behaviors. This study aimed to determine the nutrition literacy status of 4000 adults, aged 15 years and older, in Kohgiloye and BoyerAhmad province in 2017. Methods: In this c...

oak trees cover a wide range of forests in iran and most of them are located in kohgiloye and boyer-ahmad province (k.b). the high tannin is one of the anti-nutritional characteristics of acorn for domestic animal. wide range of gut microorganisms could tolerate tannin and reduce it by producing tannase enzyme. this study was carried out to isolate and identify the tannin resistance bacteria (t...

The Boyer-Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem are considered. The k mismatches problem is to find all approximate occurrences of a pattern string (length m) in a text string (length n) with at most k mismatches. Our generalized Boyer-Moore algorithm is shown (under a mild independence assumption) to solve the pro...

The keyword pattern matching problem has been frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of well-known solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy did not include a variant of the Boyer-Moore algorithm developed by Horspool. In this paper, I present t...

We study Boyer-Moore-type string searching algorithms. We analyze the Horspool’s variant. The searching time is linear. An exact expression of the linearity constant is derived and is proven to be asymptotically r. 1;~ d x < 2/(c + I), where c is the cardinality of the alphabet. We exhibit a stationary process and reduce the problem to a word enumeration problem. The same technique applies to o...

Abbas M, Arsad M, Azam A (2013), Fixed points of asymptotically regular mappings in complex-valued metric spaces, Georgian Math. J. , 20 (2), 213-221. Abbas M. Fisher B, Nazir T (2012), Well-posedness and periodic point property of mappings satisfying a rational inequality in an ordered complex valued metric space, Sci. Stud. Res. , Ser. Math. Inform. , 22 (1), 5-24. Ahmad J, Klin-Eam C, Azam A...