Factors Affecting Fear of Local Communities Toward Brown Bears (Ursus arctos) in Kohgiluyeh and Boyer-Ahmad Province, Iran

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

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...

This paper extends the edge addition planarity algorithm from Boyer and Myrvold to provide a new way of solving the subgraph homeomorphism problem for K2,3, K4, and K3,3. These extensions derive much of their behavior and correctness from the edge addition planarity algorithm, providing an alternative perspective on these subgraph homeomorphism problems based on affinity with planarity rather t...

This report investigates two approaches for online pattern-matching in files compressed with the Burrows-Wheeler transform (Burrows & Wheeler 1994). The first is based on the Boyer-Moore pattern matching algorithm (Boyer & Moore 1977), and the second is based on binary search. The new methods use the special structure of the BurrowsWheeler transform to achieve efficient, robust pattern matching...

The timed pattern matching problem is formulated by Ulus et al. and has been actively studied since, with its evident application in monitoring realtime systems. The problem takes as input a timed word/signal and a timed pattern (specified either by a timed regular expression or by a timed automaton); and it returns the set of those intervals for which the given timed word, when restricted to t...