• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.9
• /
• pp.1146-1151
• /
• 2019

Histogram H is an x-monotone rectilinear polygon with a horizontal edge, called by a base, connecting the leftmost vertical edge and the rightmost vertical edge. Here the rectilinear polygon is a polygon with only horizontal and vertical edges and the x- monotone polygon P is a polygon in which every line orthogonal to the x-axis intersects P at most twice. Walking counterclockwise on the boundary of a histogram H yields a sequence of left turns and right turns at its vertices. Conversely, a given sequence of the turns at the vertices can be realized by a histogram. In this paper, we consider the problem of finding a histogram to realize a given turn sequence. Particularly, we will find the histograms to minimize its area and its bounding box. It will be shown that both of the problems can be solved by linear time algorithms.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.161-173
• /
• 2009

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extend and improve the corresponding results announced by many others.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.3
• /
• pp.621-640
• /
• 2014

In this paper, we introduce a new approximating method for finding the common element of the set of fixed points of nonexpansive mappings and the set of solution of system variational inequalities for finite family of inverse strongly monotone mappings and strictly pseudo-contractive of Browder-Petryshyn type mappings. We show that the sequence converges strongly to a common element the above two sets under some parameter controling conditions. Our results improve and extend the results announced by many others.

• Kyungpook Mathematical Journal
• /
• v.51 no.3
• /
• pp.345-352
• /
• 2011

In this article we introduce the fuzzy real valued double sequence spaces $_2{\ell}^F$ (p) where p = ($p_{nk}$) is a double sequence of bounded strictly positive numbers. We study their different properties like completeness, solidness, symmetricity, convergence free etc. We prove some inclusion results also.

• ETRI Journal
• /
• v.32 no.3
• /
• pp.479-481
• /
• 2010

An optimal multiuser detection algorithm with a computational complexity of O(K log K) is proposed for the class of linear multiple-access systems which have constant cross-correlation values. Here the optimal multiuser detection is implemented by searching for a monotone sequence with maximum likelihood, under the ranking of sufficient statistics. The proposed algorithm is intuitive and concise. It is carried out in just two steps, and at each step only one kind of operation is performed. Also, the proposed algorithm can be extended to more complex systems having more than a single cross-correlation value.

• Smart Media Journal
• /
• v.12 no.6
• /
• pp.9-14
• /
• 2023

The longest increasing subsequence is a fundamental problem which has been studied for a long time in computer science. In this paper, we consider the maximal increasing subsequence problem where the constraint is released from the longest to the maximal. For two kinds of increasing (monotone increasing and strictly increasing), we propose linear-time algorithms computing a maximal increasing subsequence of an input sequence from an alphabet Σ. Our algorithm for computing a maximal monotone increasing subsequence requires O(1) space and our algorithm for computing a maximal strictly increasing subsequence requires O(|Σ|) space.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.61-81
• /
• 2016

In this paper, we prove some existence and uniqueness results on coincidence points for g-monotone mappings satisfying linear as well as generalized nonlinear contractivity conditions in ordered metric spaces. Our results generalize and extend two classical and well known results due to Ran and Reurings (Proc. Amer. Math. Soc. 132 (2004), no. 5, 1435-1443) and Nieto and $Rodr{\acute{i}}guez$-$L{\acute{o}}pez$ (Acta Math. Sin. 23 (2007), no. 12, 2205-2212) besides similar other ones. Finally, as an application of one of our newly proved results, we establish the existence and uniqueness of solution of a first order periodic boundary value problem.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.763-771
• /
• 2009

T.H. Kim, H.K. Xu, [Convergence of the modified Mann's iteration method for asymptotically strict pseudo-contractions, Nonlinear Anal.(2007),doi:l0.l016/j.na.2007.02.029.] proved the strong convergence for asymptotically strict pseudo-contractions by the classical CQ iterative method. In this paper, we apply the monotone CQ iterative method to modify the classical CQ iterative method of T.H. Kim, H.K. Xu, and to obtain the strong convergence theorems for asymptotically strict pseudo-contractions. In the proved process of this paper, Cauchy sequences method is used, so we complete the proof without using the demi-closedness principle, Opial's condition or others about weak topological technologies. In addition, we use a ingenious technology to avoid defining that F(T) is bounded. On the other hand, we relax the restriction on the control sequence of iterative scheme.

• Kyungpook Mathematical Journal
• /
• v.52 no.2
• /
• pp.189-200
• /
• 2012

In this article we introduce the class of I-convergent double sequences of fuzzy real numbers. We have studied different properties like solidness, symmetricity, monotone, sequence algebra etc. We prove that the class of I-convergent double sequences of fuzzy real numbers is a complete metric spaces.

• Honam Mathematical Journal
• /
• v.8 no.1
• /
• pp.1-19
• /
• 1986

We show that a (possibly unbounded) linear operator, T, is scalar on the real line (spectral operator of scalar type, with real spectrum) if and only if (iT) generates a uniformly bounded semigroup and $(1-iT)(1+iT)^{-1}$ is scalar on the unit circle. T is scalar on [0, $\infty$) if and only if T generates a uniformly bounded semigroup and $(1+T)^{-1}$ is scalar on [0,1). By analogy with these results, we define $C^0$-scalar, on the real line, or [0. $\infty$), for an unbounded operator. We show that a generator of a positive-definite group is $C^0$-scalar on the real line. and a generator of a completely monotone semigroup is $C^0$-scalar on [0, $\infty$). We give sufficient conditions for a closed operator, T, to generate a positive-definite group: the sequence < $\phi(T^{n}x)$ > $_{n=0}^{\infty}$ must equal the moments of a positive measure on the real line, for sufficiently many positive $\phi$ in $X^{*}$, x in X. If the measures are supported on [0, $\infty$), then T generates a completely monotone semigroup. On a reflexive Banach lattice, these conditions are also necessary, and are equivalent to T being scalar, with positive projection-valued measure. T generates a completely monotone semigroup if and only if T is positive and m-dispersive and generates a bounded holomorphic semigroup.