• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.2
• /
• pp.333-355
• /
• 2006

Network generation methods to visualize bibliometric data for examining the intellectual structure of knowledge domains are investigated in some detail. Among the four methods investigated in this study, pathfinder network algorithm is the most effective method in representing local details as well as global intellectual structure. The nearest neighbor graph, although never used in bibliometic analysis, also has some advantages such as its simplicity and clustering ability. The effect of input data preparation process on resulting intellectual structures are examined, and concluded that unlike MDS map with clusters, the network structure could be changed significantly by the differences in data matrix preparation process. The network generation methods investigated in this paper could be alternatives to conventional multivariate analysis methods and could facilitate our research on examining intellectual structure of knowledge domains.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6A
• /
• pp.500-505
• /
• 2009

In this paper, We present a low complexity candidate list generation scheme in iterative MIMO receiver. Since QAM modulation can be decomposed into HP symbols and LP symbol and HP symbol is robust in error capability, we generate HP symbol list with simple ZF detector output and its corresponding neighbor HP symbols, Then, based on HP symbol list, the LP symbol list is generated by using the sphere decoder. From the second iteration, since apriori value from channel decoder is available, the candidate list is updated based on demodulated apriori value. Through the simulation, we observe that at the first iteration, the BER performance is worse than LSD. However, as the number of iteration is increased, the proposed scheme has almost same performance as LSD. Moreover, the proposed one has reduced candidate list generation time and lower number of candidate list compared with LSD.

• Journal of Korea Multimedia Society
• /
• v.25 no.10
• /
• pp.1404-1415
• /
• 2022

The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.42-48
• /
• 2006

In this paper a joint detection method for other cell interference cancellation is proposed in the next generation hybrid TD-CDMA mobile communication systems. A joint detection technique, a most characteristic feature of hybrid TD-CDMA mobile communication systems. retrieves users' data in the same time slot simultaneously with the elimination of multiple user interference. Previously a two stage joint detection method was proposed to cancel other cell interference as well as multiple user interference in the target cell. However the previous scheme does not have concrete ways to recognize other cell users who give major interference to the target cell. Thus all users in neighbor other cells has to be jointly detected and it causes huge complexity of the two stage joint detection. In this paper a method is proposed to perform two stage joint detection according to users' interference with the target cell. Performances of the proposed scheme are investigated through simulations and compared to the previous method the proposed method has no performance degradation and also lower the complexity of two stage joint detection significantly.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.23-32
• /
• 2015

The advanced receiver which can manage inter-cell interference is required to cope with the explosively increasing mobile data traffic. 3rd Generation Partnership Project (3GPP) has discussed network assisted interference cancellation and suppression (NAICS) to improve signal-to-noise-plus-interference ratio (SINR) and receiver performance by suppression or cancellation of interference signal from inter-cells. In this paper, we propose the novel hybrid receiver Full Suppression Cancellation (FSC) to reduce the interference from neighbor cell in backhaul system. The proposed receiver can suppress and cancel the interference by combining Interference Rejection Combining (IRC) with Successive Interference Cancellation (SIC). We perform the system level simulation based on 20MHz bandwidth of 3GPP LTE-Advanced system. Simulation results show that the proposed receiver can improve error rate and throughput of conventional system.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.10-22
• /
• 2015

Recently, 3rd Generation Partnership Project (3GPP) has developed sidehaul system to cope with the explosively increasing mobile data traffic. The sidehaul system is based on single carrier-frequency division multiple access (SC-FMDA) due to its low peak to average power ratio (PAPR). Also, antenna array is designed to support multiple input multiple output (MIMO) in a restricted space. In this paper, we design the antenna array about uniform linear array (ULA), uniform circular array (UCA) and uniform planar array (UPA), and analysis the performance in sidehaul system. In addition, we propose the novel hybrid receiver full suppression cancellation (FSC) to reduce the interference from neighbor cell in sidehaul system. The proposed receiver can suppress and cancel the interference by combining interference rejection combining (IRC) with successive interference cancellation (SIC).

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.19 no.5
• /
• pp.1105-1111
• /
• 2005

In order to investigate the meanings and bases of transforming theories of diseases(病傳論), several relevant theories were collected from medical books since . The outside-to-inside changing process(pyoree jeon) was the fundamental pattern in febrile diseases regardless of slang han and wen bing after Han dynasty. But in case of numb disease the three exogenous pathogenic factors of wind, cold and dampness got into each viscera through five tissues like skin, vessesl, flesh, tendons, bones respectively. It was called corresponding changing process(sanghap jeon) here. The pathogenic changing process(byungsa jeon) had complicated details to explain pathologic processes, but could give useful informations on evaluating relative strength of pathogens and tendency ahead. The changing process of diseases of internal injuries were explained in case of emotional distress which is outbroken abruptly didn't follow regular order of viscera-emotion relations. So it was named random changing process(bulcha jeon) after 's usage. And marasmus and asthenic disease followed top-to-down or down-to-top changing process(sangha jeon) based on . There are many types of changing process of diseases between viscera and viscera or viscera and bowels like generation changing process, restriction changing process, changing process between couple, changing process of mutual transmission based on attributions of each element by the theory of 5 phases(五行論). And changing process to a neighbor doesn't have any special relations within two organs but has anatomical contiguity and physiological continuity between them. The transforming theories of diseases bring forth useful understanding on comings and goings of pathogenic factors and tendency and prognosis of disease, so they are needed to be taught in the course of pathology class.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.5
• /
• pp.40-52
• /
• 2018

Solid state drive (SSD) cache technologies that are used as a second-tier cache between the main memory and hard disk drive (HDD) have been widely studied. The SSD cache requires a new prefetching scheme as well as cache replacement algorithms. This paper presents a prefetching scheme for a storage-class cache using SSD. This prefetching scheme is designed for the storage-class cache and based on a long-term scheduling in contrast to the short-term prefetching in the main memory. Traditional prefetching algorithms just consider only read, but the presented prefetching scheme considers both read and write. An experimental evaluation shows 2.3% to 17.8% of hit rate with a 64GB of SSD and the 4GiB of prefetching size using an I/O trace of 14 days. The proposed prefetching scheme showed significant improvement of cache hit rate and can be easily implemented in storage-class cache systems.

• Advances in nano research
• /
• v.3 no.3
• /
• pp.143-168
• /
• 2015

Initiation of crack and its growth simulation requires accurate model of traction - separation law. Accurate modeling of traction-separation law remains always a great challenge. Atomistic simulations based prediction has great potential in arriving at accurate traction-separation law. The present paper is aimed at establishing a method to address the above problem. A method for traction-separation law prediction via utilizing atomistic simulations data has been proposed. In this direction, firstly, a simpler approach of common neighbor analysis (CNA) for the prediction of crack growth has been proposed and results have been compared with previously used approach of threshold potential energy. Next, a scheme for prediction of crack speed has been demonstrated based on the stable crack growth criteria. Also, an algorithm has been proposed that utilizes a variable relaxation time period for the computation of crack growth, accurate stress behavior, and traction-separation atomistic law. An understanding has been established for the generation of smoother traction-separation law (including the effect of free surface) from a huge amount of raw atomistic data. A new curve fit has also been proposed for predicting traction-separation data generated from the molecular dynamics simulations. The proposed traction-separation law has also been compared with the polynomial and exponential model used earlier for the prediction of traction-separation law for the bulk materials.

• Journal of Korea Multimedia Society
• /
• v.21 no.6
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.