• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.695-704
• /
• 2018

The rainfall cases were identified by rainfall estimation techniques which were developed by using X - band marine radar. A digital signal converter was used to convert the signal received from the marine radar into digital reflectivity information. The ground clutter signal was removed and the errors caused by beam attenuation and beam volume changes were corrected. The reflectivity showed a linear relationship with the rain gauge rainfall. Quantitative rainfall was estimated by converting the radar signal into an cartesian coordinate system. When the rainfall was recorded more than $5mm\;hr^{-1}$ at three automatic weather stations, the rain cell distribution on the marine radar was consistent with that of the weather radar operated by Korea meteorological Adminstration.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.4
• /
• pp.659-664
• /
• 2020

In this paper, we propose a silicon-based electro-optic (EO) modulator which can modulate a sign of a topological charge number l of |l|=1 orbital angular momentum (OAM) mode. The proposed EO modulator consists of position-dependent doped Si waveguide core and undoped SiO2, cladding, which enables control of the effective index and propagation loss of two OAM constitutive eigenmodes. The modulator functions as OAM mode maintaining waveguide at -0.33V and as topological charge sign inverter at 10V. The output OAM mode purity is calculated through electric field distribution, showing high purity of |l|>0.92 in both cases.

• Korean Institute of Interior Design Journal
• /
• v.16 no.6
• /
• pp.116-124
• /
• 2007

The purpose of this study is to find out the spatial characteristics of the multi-housing units in Seoul and Kyung-gi area since 2006. Literature review and content analysis were used for this study and 82units of the big size over $165m^2$ were analyzed to review such design characteristics as spatial composition, layout and linkage. Through this study, the following conclusions have been reached; 1) Most unit plans had 4LDK and 3bath types including family room as a public space. This results shows that family-room and bathroom has recently become more important than number of rooms in multi-housing units planning. 2) Diversity of plan figures such as mass-mixing, mass-separation and polygons(L, V-type)was showed in most unit plan, breaking from the standardized forms of box types. 3) Intermediated spaces such as foyers and halls in entrance zone were planned and sub-entrance into kitchen were planned for the various types of circulation and work-efficiency. Cases had private space separated from public space, the dispersion of rooms with the increase of connection by corridors, L-DK meaning the living room isolated from the dining and kitchen, partially located living room for a view in area distribution. The spatial planning of master-zone mostly consists of the types of two-rooms and an entry into a foyer(library, dress-powder room, bathroom and master bedroom). This study has a significant meaning on grasping current trend in Korean multi-housing and to provide information for future direction on housing-unit design.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.325-330
• /
• 2006

The container terminal is the unified transportation system which connects between a land transportation and a sea transportation. This system has many subsystems such as ship operation, yard transfer operation, yard storage system, gate operation, and information manage system. This paper presents a method of modeling a simulator with which user can evaluate the efficiency of the equipment and allocation policies in the container terminal. The final purpose is to estimate the efficiency of each equipments and the distribution policies. In a design step in the simulator development. We suggest the Object Oriented method with which the developer can easily design, because the object oriented method has the advantages of reusability and modularity.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.315-323
• /
• 2001

The concept of vertical partitioning has been discussed so far in an objective of improving the performance of query execution and system throughput. It can be applied to the areas where the match between data and queries affects performance, which includes partitioning of individual files in centralized environments, data distribution in distributed databases, dividing data among different levels of memory hierarchies, and so on. In general, a vertical partitioning algorithm should support n-ary partitioning as well as a globally optimal solution for the generation of all meaningful fragments. Most previous methods, however, have some limitations to support both of them efficiently. Because the vertical partitioning problem basically includes the fuzziness property, the proper management is required for the fuzziness problem. In this paper we propose an efficient vertical $\alpha$-partitioning algorithm which is based on the fuzzy theory. The method can not only generate all meaningful fragments but also support n-ary partitioning without any complex mathematical computations.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.849-858
• /
• 2004

Most of supervised teaming algorithms could be applied after that continuous variables are transformed to categorical ones at the preprocessing stage in order to avoid the difficulty of processing continuous variables. This preprocessing stage is called global discretization, uses the class distribution list called bins. But, when data are large and the range of the variable to be discretized is very large, many sorting and merging should be performed to produce a single bin because most of global discretization methods need a single bin. Also, if new data are added, they have to perform discretization from scratch to construct categories influenced by the data because the existing methods perform discretization in batch mode. This paper proposes a method that extracts sample points and performs discretization from these sample points in order to solve these problems. Because the approach in this paper does not require merging for producing a single bin, it is efficient when large data are needed to be discretized. In this study, an experiment using real and synthetic datasets was made to compare the proposed method with an existing one.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.655-664
• /
• 2002

In many data-parallel applications massive parallelism can be easily extracted through data distribution. But it often causes very long communication latency. This paper shows that task parallelism, which is extracted from data-parallel programs, can be exploited to hide such communication latency Unlike the most previous researches over exploitation of task parallelism which has not been considered together with data parallelism, this paper describes exploitation of task parallelism in the context of data parallelism. PCFG(Parallel Control Flow Graph) is proposed to represent a multithreaded program consisting of a few task threads each of which can include a few data-parallel loops. It is also described how a PCFG is constructed from a source data-parallel program through HDG(Hierarchical Dependence Graph) and how the multithreaded program can be constructed from the PCFG.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.10
• /
• pp.550-560
• /
• 2002

External sort on cluster computers requires not only fast internal sorting computation but also careful scheduling of disk input and output and interprocessor communication through networks. This is because the overall time for the execution is determined by reflecting the times for all the jobs involved, and the portion for interprocessor communication and disk I/O operations is significant. In this paper, we improve the sorting performance (sorting throughput) on a cluster of PCs with a low-speed network by developing a new algorithm that enables even distribution of load among processors, and optimizes the disk read and write operations with other computation/communication activities during the sort. Experimental results support the effectiveness of the algorithm. We observe the algorithm reduces the sort time by 45% compared to the previous NOW-sort[1], and provides more scalability in the expansion of the computing nodes of the cluster as well.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.487-494
• /
• 2004

The multiprocessor system suffers interconnection network contension while exploiting the program's parallelism. A CC-NUMA system based on point-to-point link ring structure is one of the scalable architectures that expand the system bandwidth the number of processors/nodes increases. The dual-ring system is a simple solution to enhance the system performance and scalability by duplicating the links. In ring-based systems, an unbalanced transaction among links makes a hot spot on the interconnection network. In this situation, total system performance and scalability are bound by the hot spot of the links In this paper, I propose a dual-link CC-NUMA system, which alleviates the concentration of transactions among the links. By the simulation results, the proposed system significantly outperforms the single-ring and bidirection dual-ring systems. In addition, the proposed system show better distribution of transactions among the links that achieves an extended scalability.