• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.235-250
• /
• 2023

Let 1 ≤ p, q < ∞ be fixed, and let R = [r_jk] be an infinite scalar matrix such that 1 ≤ r_jk < ∞ and sup_j,k r_jk < ∞. Let 𝓑(𝑙_p, 𝑙_q) be the set of all bounded linear operator from 𝑙_p into 𝑙_q. For a fixed Banach algebra 𝐁 with identity, we define a new vector space S^R_p,q(𝐁) of infinite matrices over 𝐁 and a paranorm G on S^R_p,q(𝐁) as follows: let $$S^R_{p,q}({\mathbf{B}})=\{A:A^{[R]}{\in}{\mathcal{B}}(l_p,l_q)\}$$ and $G(A)={\parallel}A^{[R]}{\parallel}^{\frac{1}{M}}_{p,q}$, where $A^{[R]}=[{\parallel}a_{jk}{\parallel}^{r_{jk}}]$ and M = max{1, sup_j,k r_jk}. The existance of S^R_p,q(𝐁) equipped with the paranorm G(·) including its completeness are studied. We also provide characterizations of β -dual of the paranormed space.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.1
• /
• pp.14-20
• /
• 2006

In this paper. a novel technique to set up the initial weights in BSS of delayed mixtures is proposed. After analyzing Eigendecomposition for the correlation matrix of mixing data. the initial weights are set from the Eigenvectors ith delay information. The Proposed setting of initial weighting method for conventional FDICA technique improved the separation Performance. The computer simulation shows that the Proposed method achieves the improved SIR and faster convergence speed of learning curve.

• Communications of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.611-622
• /
• 2024

The purpose of this paper is to introduce a new class of rings containing the class of m-formally Noetherian rings and contained in the class of nonnil-SFT rings introduced and investigated by Benhissi and Dabbabi in 2023 [4]. Let A be a commutative ring with a unit. The ring A is said to be nonnil-m-formally Noetherian, where m ≥ 1 is an integer, if for each increasing sequence of nonnil ideals (I_n)_n≥0 of A the (increasing) sequence (∑_i1+⋯+im=nI_i1I_i2⋯I_im)_n≥0 is stationnary. We investigate the nonnil-m-formally Noetherian variant of some well known theorems on Noetherian and m-formally Noetherian rings. Also we study the transfer of this property to the trivial extension and the amalgamation algebra along an ideal. Among other results, it is shown that A is a nonnil-m-formally Noetherian ring if and only if the m-power of each nonnil radical ideal is finitely generated. Also, we prove that a flat overring of a nonnil-m-formally Noetherian ring is a nonnil-m-formally Noetherian. In addition, several characterizations are given. We establish some other results concerning m-formally Noetherian rings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.383-393
• /
• 2005

Retrieval of images from image databases by spatial relationship can be effectively performed through visual interface systems. In these systems, the representation of image with 2D strings, which are derived from symbolic projections, provides an efficient and natural way to construct image index and is also an ideal representation for the visual query. With this approach, retrieval is reduced to matching two symbolic strings. However, using 2D-string representations, spatial relationships between the objects in the image might not be exactly specified. Ambiguities arise for the retrieval of images of 3D scenes. In order to remove ambiguous description of object spatial relationships, in this paper, images are referred by considering spatial relationships using the spatial location algebra for the 3D image scene. Also, we remove the repetitive spatial relationships using the several reduction rules. A reduction mechanism using these rules can be used in query processing systems that retrieve images by content. This could give better precision and flexibility in image retrieval.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.1013-1024
• /
• 1997

In the traditional object modeling methodologies, the object model can be said as formal since it has been based on rich semantic model. But almost of all methodolgies lack in formality the dyamic model and modeling process. Dynamic model cannot represent exctly the timing constraints and the interaction among the objects, which are very important features in real-time and multimedia system. In this paper, we formalize the synamic moedl and modeling proxess based on object behavior and state. This model defines the object state space using the concepts in algebra stucture and defines the object behavior func-tion. Also this model can formalize object kifecycle and conurrency among the objects usint the temporal logiction. Also this model can frlmaize object lifecycle and conurrency among the objects using the tempral logic and behavior founction. We apply firing rules to behacior function for modeling the dependency of interaction among the objescts.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.13 no.2
• /
• pp.11-20
• /
• 2010

In this study, the effects of stand height growth on GIS-based viewshed analysis were investigated. DSM was created by combining stand height layers on DEM using map algebra functions. In developing the tree height layers, the digital forest-type maps, forest site maps and stand yield tables of Korea Forest Research Institute were used. The time horizon for viewshed analysis were 40 years. Two viewpoints in crossings of downtown for viewshed analyses were chosen using a projective mapping technique. The effects of tree height growth over time on visibility were measured in terms of the depth of blind areas and the area of visible regions. The results of viewshed analyses show that 17% of visible regions is reduced when we use DSM instead of DEM. As the tree height grows, the visibility gets worse and worse and the depth of blind area increases.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.5
• /
• pp.57-64
• /
• 2004

We proposed the eye gaze tracking system under natural head movements, which consists of one narrow-view field CCD camera, two mirrors which of reflective angles are controlled and active infra-red illumination. The mirrors' angles were computed by geometric and linear algebra calculations to put the pupil images on the optical axis of the camera. Our system allowed the subjects head to move 90cm horizontally and 60cm vertically, and the spatial resolutions were about 6$^{\circ}$ and 7$^{\circ}$, respectively. The frame rate for estimating gaze points was 10～15 frames/sec. As gaze mapping function, we used the hierarchical generalized regression neural networks (H-GRNN) based on the two-pass GRNN. The gaze accuracy showed 94% by H-GRNN improved 9% more than 85% of GRNN even though the head or face was a little rotated. Our system does not have a high spatial gaze resolution, but it allows natural head movements, robust and accurate gaze tracking. In addition there is no need to re-calibrate the system when subjects are changed.

• Journal of Elementary Mathematics Education in Korea
• /
• v.19 no.3
• /
• pp.251-266
• /
• 2015

The statement, 'Taking more mathematics would result a better mathematics teacher.' sounds plausible. However, it is questionable that how much of taking university level of mathematics such as abstract algebra and real analysis would affect to teach elementary mathematics well. Would a mathematician be a better teacher for elementary students to teach mathematics than who has been prepared to teach elementary mathematics? This paper reports the effects of opportunities to learn tertiary level mathematics and school level mathematics on pre-service primary school teachers' mathematics pedagogical content knowledge. The study analyzed Teacher Education and Development Study in Mathematics 2008 (TEDS-M 2008) database using multiple regression. Prospective primary teachers who have been prepared as generalist were the focus of the study. The results support future elementary teachers might need to have opportunities to revisit school mathematics they are going to teach.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.36D no.3
• /
• pp.48-58
• /
• 1999

In this paper, a new parallel computation method, which fully utilize the parallel processors both in mesh generation and FEM calculation for 2D/3D process simulation, is presented. High performance parallel FEM and parallel linear algebra solving technique was showed that excessive computational requirement of memory size and CPU time for the three-dimensional simulation could be treated successively. Our parallelized numerical solver successfully interpreted the transient enhanced diffusion (TED) phenomena of dopant diffusion and irregular shape of R-LOCOS within 15 minutes. Monte Carlo technique requires excessive computational requirement of CPU time. Therefore high performance parallel solving technique were employed to our cascade sputter simulation. The simulation results of Our sputter simulator allowed the calculation time of 520 sec and speedup of 25 using 30 processors. We found the optimized number of ion injection of our MC sputter simulation is 30,000.