• Journal of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.139-175
• /
• 2000

We consider the boundary behavior of a Hardy class holomorphic function, either on the disk D in the complex plane or on a domain in multi-dimensional complex space. Although the two theories are formally different, we postulate some unifying fearures, and we suggest some future directions for research.

• Journal of the Korean Mathematical Society
• /
• v.40 no.3
• /
• pp.435-445
• /
• 2003

In this paper we consider Sobolev-type embedding theorems for harmonic and holomorphic Sobolev spaces on a bounded domain with $C^2$ boundary.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.229-232
• /
• 2006

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.93-113
• /
• 2020

According to information theory, non-orthogonal transmission can achieve the multiple-user channel capacity with an onion-peeling like successive interference cancellation (SIC) based detection followed by a capacity approaching channel code. However, in multiple antenna system, due to the unideal characteristic of the SIC detector, the residual interference propagated to the next detection stage will significantly degrade the detection performance of spatial data layers. To overcome this problem, we proposed a modified power-domain non-orthogonal multiple access (P-NOMA) scheme joint designed with space-time coding for multiple input multiple output (MIMO) NOMA system. First, with proper power allocation for each user, inter-user signals can be separated from each other for NOMA detection. Second, a well-designed quasi-orthogonal space-time block code (QO-STBC) was employed to facilitate the SIC-based MIMO detection of spatial data layers within each user. Last, we proposed an optimization algorithm to assign channel coding rates to balance the bit error rate (BER) performance of those spatial data layers for each user. Link-level performance simulation results demonstrate that the proposed time-space-power domain joint transmission scheme performs better than the traditional P-NOMA scheme. Furthermore, the proposed algorithm is of low complexity and easy to implement.

• Journal of Advanced Navigation Technology
• /
• v.6 no.2
• /
• pp.138-150
• /
• 2002

This paper addresses the problem of combining adaptive polarization processing and space-time processing for further performance improvement of radar target detection in clutter and Jammer environments. Since the most straightforward cascade combinations have quite limited performance improvement potentials, we focus on the development of adaptive processing in the joint polarization-space-time domain. Unlike a direct extension of some existing space-time processing algorithms to the joint domain, the processing algorithm developed in this paper does not need a potentially costly polarization filter bank to cover the unknown target polarization parameter. The performance of the new algorithm is derived and evaluated in terms of the probability of detection and the probability of false alarm, and it is compared with other algorithms that do not utilize the polarization information or assume that the target polarization is known.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.8
• /
• pp.70-76
• /
• 2012

In this paper, we propose a power allocation scheme of the unlicensed user based on orthogonal frequency division multiplexing (OFDM) in the TV white space (TVWS). Power constraints in TVWS should be satisfied in the time domain. However, because OFDM has high PAPR (peak-to-average power ratio), it is difficult to satisfy power constraints of TVWS in the time domain. Furthermore, the conventional power allocation schemes cannot be generally applied to unlicensed user in TVWS. Therefore, we propose a power allocation scheme to satisfy power constraints of TVWS by reducing PAPR in the time domain. In addition, we analyze the capacity of the unlicensed user based on OFDM in a closed form. Based on the capacity analysis, as the number of subcarriers decreases, the capacity can be enhanced. In simulation results, we show that the capacity of the unlicensed user increases, as the number of subcarriers decreases and the mean of the channel between the transmitter and the receiver of the unlicensed user increases.

• Journal of Digital Contents Society
• /
• v.16 no.1
• /
• pp.33-41
• /
• 2015

Since bitmap indices are useful for OLAP queries over low-cardinality data columns, they are frequently used in data warehouses. In many data warehouse applications, the domain of a column tends to be hierarchical, such as categorical data and geographical data. When the domain of a column is hierarchical, hierarchical bitmap index is able to significantly improve the performance of queries with conditions on that column. This strategy, however, has a limitation in that when a large scale hierarchy is used, building a bimamp for each distinct node leads to a large space overhead. Thus, in this paper, we introduce the way to build hierarchical bitmap index on an attribute whose domain is organized into a large-scale hierarchy in space-constrained environments. Especially, in order to figure out space overhead of hierarchical bitmap indices, we propose the cut-selection strategy which divides the entire hierarchy into two exclusive regions.

• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.1
• /
• pp.67.1-67.1
• /
• 2015

In the past two decades, diverse methods and computer codes for reconstruction of coronal magnetic fields have been developed. Some of them can reproduce a known analytic solution quite well when the magnetic field vector is fully specified by the known solution at the domain boundaries. In practical problems, however, we do not know the boundary conditions in the computational domain except the photospheric boundary, where vector magnetogram data are provided. We have developed a new, simple variational method employing vector potentials. We have tested the computational code based on this method for problems with known solutions and those with actual photospheric data. When solutions are fully given at all boundaries, the accuracy of our method is almost comparable to best performing methods in the market. When magnetic field vectors are only given at the photospheric boundary, our method excels other methods in "figures of merit" devised by Schrijver et al. (2006). Our method is expected to contribute to the real time monitoring of the sun required for future space weather prediction.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.677-684
• /
• 2009

With various sensor network and ubiquitous technologies, we can extend interaction area from a virtual domain to physical space domain. This spatial interaction is differ in that traditional interaction is mainly processed by direct interaction with the computer machine which is a target machine or provides interaction tools and the spatial interaction is performed indirectly between users with smart interaction tools and many distributed components of space. So, this interaction gives methods to users to control whole manageable space components by registering and recognizing objects. Finally, this paper provides an effective spatial interaction method with template-based task mapping algorithm which is sorted by historical interaction data for support of users' intended task. And then, we analyze how much the system performance would be improved with the task mapping algorithm and conclude with an introduction of a GUI method to visualize results of spatial interaction.

• The Mathematical Education
• /
• v.62 no.1
• /
• pp.117-149
• /
• 2023

This study attempted to design a virtual space using ZEP, a metaverse platform, to enable mathematics classes in the metaverse space, to apply it to mathematics classes, and to find out changes in students' affective domain. As a result, students showed positive effects in terms of subject efficacy, subject interest, intrinsic motivation, class satisfaction and participation. In addition, we found the possibility of customized classes for each student level by performing different missions in classroom classes with limited time and space.