• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.227-245
• /
• 2011

In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.58-67
• /
• 2016

With the large amount of complex network data that is increasingly available on the Web, link prediction has become a popular data-mining research field. The focus of this paper is on a link-prediction task that can be formulated as a binary classification problem in complex networks. To solve this link-prediction problem, a sparse-classification algorithm called "Truncated Kernel Projection Machine" that is based on empirical-feature selection is proposed. The proposed algorithm is a novel way to achieve a realization of sparse empirical-feature-based learning that is different from those of the regularized kernel-projection machines. The algorithm is more appealing than those of the previous outstanding learning machines since it can be computed efficiently, and it is also implemented easily and stably during the link-prediction task. The algorithm is applied here for link-prediction tasks in different complex networks, and an investigation of several classification algorithms was performed for comparison. The experimental results show that the proposed algorithm outperformed the compared algorithms in several key indices with a smaller number of test errors and greater stability.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.173-180
• /
• 1994

Let H be a separable, infinite dimensional, compled Hilbert space and let L(H) be the algebra of all bounded linear operators on H. A dual algebra is a subalgebra of L(H) that contains the identity operator $I_{H}$ and is closed in the ultraweak topology on L(H). Note that the ultraweak operator topology coincides with the wea $k^{*}$ topology on L(H)(see [3]). Bercovici-Foias-Pearcy [3] studied the problem of solving systems of simultaneous equations in the predual of a dual algebra. The theory of dual algebras has been applied to the topics of invariant subspaces, dilation theory and reflexibity (see [1],[2],[3],[5],[6]), and is deeply related with properties ( $A_{m,n}$). Jung-Lee-Lee [7] introduced n-separating sets for subalgebras and proved the relationship between n-separating sets and properties ( $A_{m,n}$). In this paper we will study the relationship between direct sum and properties ( $A_{m,n}$). In particular, using some results of [7] we obtain relationship between n-separating sets and direct sum of von Neumann algebras.ras.s.ras.

• Kyungpook Mathematical Journal
• /
• v.55 no.1
• /
• pp.63-71
• /
• 2015

Let H be a separable infinite dimensional complex Hilbert space, and let $\mathcal{L}(H)$ denote the algebra of all bounded linear operators on H into itself. Let $A,B{\in}\mathcal{L}(H)$ we define the generalized derivation ${\delta}_{A,B}:\mathcal{L}(H){\mapsto}\mathcal{L}(H)$ by ${\delta}_{A,B}(X)=AX-XB$, we note ${\delta}_{A,A}={\delta}_A$. If the inequality ${\parallel}T-(AX-XA){\parallel}{\geq}{\parallel}T{\parallel}$ holds for all $X{\in}\mathcal{L}(H)$ and for all $T{\in}ker{\delta}_A$, then we say that the range of ${\delta}_A$ is orthogonal to the kernel of ${\delta}_A$ in the sense of Birkhoff. The operator $A{\in}\mathcal{L}(H)$ is said to be finite [22] if ${\parallel}I-(AX-XA){\parallel}{\geq}1(*)$ for all $X{\in}\mathcal{L}(H)$, where I is the identity operator. The well-known inequality (*), due to J. P. Williams [22] is the starting point of the topic of commutator approximation (a topic which has its roots in quantum theory [23]). In [16], the author showed that a paranormal operator is finite. In this paper we present some new classes of finite operators containing the class of paranormal operators and we prove that the range of a generalized derivation is orthogonal to its kernel for a large class of operators containing the class of normal operators.

• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.553-563
• /
• 2006

Let A be a bounded linear operator acting on a Hilbert space H. The B-Weyl spectrum of A is the set ${\sigma}_{B{\omega}}(A)$ of all ${\lambda}{\in}\mathbb{C}$ such that $A-{\lambda}I$ is not a B-Fredholm operator of index 0. Let E(A) be the set of all isolated eigenvalues of A. Recently in [6] Berkani showed that if A is a hyponormal operator, then A satisfies generalized Weyl's theorem ${\sigma}_{B{\omega}}(A)={\sigma}(A)$\E(A), and the B-Weyl spectrum ${\sigma}_{B{\omega}}(A)$ of A satisfies the spectral mapping theorem. In [51], H. Weyl proved that weyl's theorem holds for hermitian operators. Weyl's theorem has been extended from hermitian operators to hyponormal and Toeplitz operators [12], and to several classes of operators including semi-normal operators ([9], [10]). Recently W. Y. Lee [35] showed that Weyl's theorem holds for algebraically hyponormal operators. R. Curto and Y. M. Han [14] have extended Lee's results to algebraically paranormal operators. In [19] the authors showed that Weyl's theorem holds for algebraically p-hyponormal operators. As Berkani has shown in [5], if the generalized Weyl's theorem holds for A, then so does Weyl's theorem. In this paper all the above results are generalized by proving that generalizedWeyl's theorem holds for the case where A is an algebraically ($p,\;k$)-quasihyponormal or an algebarically paranormal operator which includes all the above mentioned operators.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.7 no.2
• /
• pp.83-94
• /
• 2003

Let K be a nonempty closed convex subset of a real Hilbert space H. Approximation solvability of a system of nonlinear variational inequality (SNVI) problems, based on the convergence of projection methods, is given as follows: find elements $x^*,\;y^*{\in}H$ such that $g(x^*),\;g(y^*){\in}K$ and $$<\;{\rho}T(y^*)+g(x^*)-g(y^*),\;g(x)-g(x^*)\;{\geq}\;0\;{\forall}\;g(x){\in}K\;and\;for\;{\rho}>0$$ $$<\;{\eta}T(x^*)+g(y^*)-g(x^*),\;g(x)-g(y^*)\;{\geq}\;0\;{\forall}g(x){\in}K\;and\;for\;{\eta}>0,$$ where T: $H\;{\rightarrow}\;H$ is a relaxed $g-{\gamma}-r-cocoercive$ and $g-{\mu}-Lipschitz$ continuous nonlinear mapping on H and g: $H{\rightarrow}\;H$ is any mapping on H. In recent years general variational inequalities and their algorithmic have assumed a central role in the theory of variational methods. This two-step system for nonlinear variational inequalities offers a great promise and more new challenges to the existing theory of general variational inequalities in terms of applications to problems arising from other closely related fields, such as complementarity problems, control and optimizations, and mathematical programming.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.1
• /
• pp.19-34
• /
• 2011

A bounded linear operator T on a complex Banach space X is said to have property (I) provided that T has Bishop's property (${\beta}$) and there exists an integer p > 0 such that for a closed subset F of ${\mathbb{C}}$ ${X_T}(F)={E_T}(F)=\bigcap_{{\lambda}{\in}{\mathbb{C}}{\backslash}F}(T-{\lambda})^PX$ for all closed sets $F{\subseteq}{\mathbb{C}}$, where $X_T$(F) denote the analytic spectral subspace and $E_T$(F) denote the algebraic spectral subspace of T. Easy examples are provided by normal operators and hyponormal operators in Hilbert spaces, and more generally, generalized scalar operators and subscalar operators in Banach spaces. In this paper, we prove that if T has property (I), then the quasi-nilpotent part $H_0$(T) of T is given by $$KerT^P=\{x{\in}X:r_T(x)=0\}={\bigcap_{{\lambda}{\neq}0}(T-{\lambda})^PX$$ for all sufficiently large integers p, where ${r_T(x)}=lim\;sup_{n{\rightarrow}{\infty}}{\parallel}T^nx{\parallel}^{\frac{1}{n}}$. We also prove that if T has property (I) and the spectrum ${\sigma}$(T) is finite, then T is algebraic. Finally, we prove that if $T{\in}L$(X) has property (I) and has decomposition property (${\delta}$) then T has a non-trivial invariant closed linear subspace.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.929-949
• /
• 2022

Given an ACM set 𝕏 of points in a multiprojective space ℙ^m×ℙⁿ over a field of characteristic zero, we are interested in studying the Kähler different and the Cayley-Bacharach property for 𝕏. In ℙ¹×ℙ¹, the Cayley-Bacharach property agrees with the complete intersection property and it is characterized by using the Kähler different. However, this result fails to hold in ℙ^m×ℙⁿ for n > 1 or m > 1. In this paper we start an investigation of the Kähler different and its Hilbert function and then prove that 𝕏 is a complete intersection of type (d₁, …, d_m, d'₁, …, d'_n) if and only if it has the Cayley-Bacharach property and the Kähler different is non-zero at a certain degree. We characterize the Cayley-Bacharach property of 𝕏 under certain assumptions.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.6
• /
• pp.413-422
• /
• 2022

In this paper, the fault analysis of the momentum wheel, which is a high-speed rotary machinery of 'Control Moment Gyro' for medium and large satellite, was described. For fault diagnosis, envelope spectrum analysis was performed using Hilbert transformation method and signal demodulation method to find the impact signals periodically generated from amplitude modulated signals. Through this, the fault of the momentum wheel was diagnosed by analyzing whether there was a harmonic component of the rotational frequency and a bearing fault frequency in a specific frequency band with a high peak.

• Journal of Information Technology and Architecture
• /
• v.10 no.1
• /
• pp.79-91
• /
• 2013

This paper proposes a systematic methodology that could be used to decide which one shows the best performance among space filling curves (SFCs) in applying lower-dimensional transformations to histogram sequences. A histogram sequence represents a time-series converted from an image by the given SFC. Due to the high-dimensionality nature, histogram sequences are very difficult to be stored and searched in their original form. To solve this problem, we generally use lower-dimensional transformations, which produce lower bounds among high dimensional sequences, but the tightness of those lower-bounds is highly affected by the types of SFC. In this paper, we attack a challenging problem of evaluating which SFC shows the better performance when we apply the lower-dimensional transformation to histogram sequences. For this, we first present a concept of spatial locality, which comes from an intuition of "if the entries are adjacent in a histogram sequence, their corresponding cells should also be adjacent in its original image." We also propose spatial locality preservation metric (slpm in short) that quantitatively evaluates spatial locality and present its formal computation method. We then evaluate five SFCs from the perspective of slpm and verify that this evaluation result concurs with the performance evaluation of lower-dimensional transformations in real image matching. Finally, we perform k-NN (k-nearest neighbors) search based on lower-dimensional transformations and validate accuracy of the proposed slpm by providing that the Hilbert-order with the highest slpm also shows the best performance in k-NN search.