• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.1
• /
• pp.33-37
• /
• 2022

In this short note, we prove an open problem for the interval (-∞, ∞), related to a reverse trigonometric Masjed-Jamei inequality presented in [2] and establish a new inequality of a similar kind.

• Bulletin of the Korean Mathematical Society
• /
• v.36 no.1
• /
• pp.161-169
• /
• 1999

Generalized nonnegative trigonometric polynomials are defined as the products of nonnegative trigonometric polynomials raised to positive real powers. The generalized degree can be defined in a natural way. We improve and extend the large sieve involving pth powers of trigonometric polynomials so that it holds for generalized trigonometric polynomials.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.315-332
• /
• 2013

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

• The Pure and Applied Mathematics
• /
• v.11 no.3
• /
• pp.189-196
• /
• 2004

In this article, using the L'Hospital rule, mathematical induction, the trigonometric power formulae and integration by parts, some integral formulae for the improper integrals ${\int}_0^{\infty}$[sin$^{2m}({\alpha}x)]/(x^{2n})dx$ AND ${\int}_0^{\infty}$[sin$^{2m+1}({\alpha}x)]/(x^{2n+1})dx$ are established, where m $\geq$ n are all positive integers and $\alpha$$\neq$ 0.

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.