• Journal of the Korean Institute of Landscape Architecture
• /
• v.30 no.6
• /
• pp.109-118
• /
• 2003

This design is for the landscape of Busan Yeonje Post Office. The design requirements were: the preparation of an open space, the expression of regional identity, total design concept, and application of environmentally-friendly materials. The Busan Yeonje Post Office is not a just post office building but also a place for people including a communications center, rental offices, and a post office, facilities which require publicity, functionality, and symbolism. Therefore, this design reflected the design requirements, and considered the following to include the theme of "Pleasant messages and a pleasant post office with vitality and comfort. First, the open space was to be increased in the adjacent public vacant lot and street park by pulling back the construction line. In this way, the publicity, accessibility, and spatiality of the prepared open space were strengthened. Second, a sense of place for the landscape was expressed through the image of a wave representing Busan, a coastal town. Recognition of the space was strengthened, while regional identity and the concept of transmission of information were expressed. In addition, Citrus junos Sieb., representing 'Happy news' was Planted as a symbolic tree to denote a meaningful resting Place. Third, with respect to the design of reception facilities, considering the general purposes of the construction, post office stamps, envelopes, and postal delivery persons were portrayed on the walls, decorative walls, and environmental formations respectively The flooring was decorated with stamps and waves in keeping with of the total design concept. Fourth, to select environmentally-friendly materials, soil block and eco-grass block were introduced as major paving materials, and folk kinds of trees were included on site. According to the aforesaid plans, the researcher attempted to convert the public agency and office space characterized by feelings of dullness and rigidity into a soft and vivid outdoor space. It is expected that the location will be an open place in the downtown area and be recognized as a 'shared' space for citizens of Yeonje-gu.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.117-121
• /
• 2008

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Therefore, the energy consumption is important in the routing design, otherwise cluster schemes are efficient in energy conserving. For the above reasons, an Energy conserving Context aware Clustering algorithm (ECC) is proposed to establish the network clustering structure, and a routing algorithm is introduced to choose the Optimal Energy Routing Protocol (OERP) path in this paper. Because in ad hoc network, the topology, nodes residual energy and energy consuming rate are dynamic changing. The network system should react continuously and rapidly to the changing conditions, and make corresponding action according different conditions. So we use the context aware computing to actualize the cluster head node, the routing path choosing. In this paper, we consider a novel routing protocol using the cluster schemes to find the optimal energy routing path based on a special topology structure of Resilient Ontology Multicasting Routing Protocol (RODMRP). The RODMRP is one of the hierarchical ad hoc network structure which combines the advantage of the tree based and the mesh based network. This scheme divides the nodes in different level found on the node energy condition, and the clustering is established based on the levels. This protocol considered the residual energy of the nodes and the total consuming energy ratio on the routing path to get the energy efficiently routing. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission. Also, by using the context aware computing, according to the condition and the rules defined, the sensor nodes could adjust their behaviors correspondingly to improve the network routing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1098-1107
• /
• 2011

As recent integration of wire and wireless networks and the convergence of telecommunications and broadcasting, uniform and standardized by the broadcasting operators of existing stations to provide 4A(Any-time, Any-where, Any-device, Any-contents) services for the next-generation of multimedia services research is being progressed. Demand for theses next-generation multimedia services to ensure video compression coding technology, as well as mobility, ability to operation a variety of devices, characteristics and performance of user network and the status and conditiion, user preferences and context-awareness based on the technology has an interest in technical studies. In this paper, the current internet environment, SVC(Scalable Video Coding) encoded by a mixture of multicast and overlay multicast transmission technology for broadcasting services by designing and efficient multimedia broadcasting system is proposed. In addition, ACK-Aow Optimization by overlay multicast scheme existing tree-based overlay multicast, and by comparing the effectiveness of the proposed algorithm is demonstrated.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.297-310
• /
• 2005

In this study we investigate the association between the haplotype block of 4 SNPs in ACE genes and hypertension with a case-control dataset of size of 277 and 40 families data collected from Kangwha studies. To this end we perform a haplotype-based case-control association study and a haplotype-based TDT study. We do the same analysis with tag-SNPs that can identify the haplotype block. Through a cladogram analysis we make the evolution-tree of haplotypes and then classify the haplotypes into a few clades by collecting haplotypes exposed to the disease to the same extent. We also discuss the association between these clades and hypertension.

• Korean Journal of Veterinary Service
• /
• v.42 no.4
• /
• pp.245-250
• /
• 2019

Newcastle disease (ND) is an infectious poultry disease that caused high mortality and reduced egg production. NDVs are regularly present in the domestic duck population. And ducks play a possible role in the maintenance and transmission of NDVs. While we were monitoring the Avian Influenza, NDVs were isolated from field samples by accident. So we analysed the biological and genetic characteristics of these viruses. Lentogenic NDVs were isolated from two farms among twenty breeder duck farms. The ages of ducks were 39 weeks old in the 'A' farm and 3~72 weeks old in the 'B' farm. And they were not inoculated with the NDVs vaccine. In the biological characteristics, the both viruses which separated from the farm 'A' and 'B' were thermostable. The amino acid sequence of a site from 112 to 119 in the fusion (F) protein was 'GKQGRLIG' which has monobasic motif in the samples of both farms. And this means the separated NDVs are lentogenic. Phylogenetic analysis was performed by entire nucleotide sequence of F protein. The virus strains from the A farm (MN095239) and the B farm (MN095240) belonged to class II genotype I. Using the analysis of whole F protein nucleic acid sequence, the MN095239 (GenBank) had homology with Ulster strain about 99.95% and the MN095239 (GenBank) had homology with KR/CK/KU_LBM255/09 strain about 99.89%. NDV surveillance is needed to investigate epidemiological relationship of domestic breeder duck isolates in Korea.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.38-46
• /
• 2010

A stable game managing system is absolutely needed to accept simultaneous interlacing of many users for on- line game system. The proposed P2P on-line game system in this paper is able to get stable and real-time game managing within limited time stamp utilizing through reorganizing peers according to synchronous time which can be avoid congestion on one region, it is possible to synchronize for game nodes within limited time stamp utilizing. Reorganizing M-tree which leads 10 distribute loads. The system manages each region unit, and it is execute no matter how big game sizes are. Thus to ensure such as the problems of expand server and stabilization or message transmission. Also, prove efficiency of the suggested system through the simulation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.11-18
• /
• 1998

A binary line code, called MB46d, is designed by use of the BUDA(Binary Unit DSV and ASV) cell concept to retain the property of being runlength limited, DC tree, and with a power spectral null at the Nyquist frequency. This new code is a stateless line code with a simple encoding and a decoding rule and enables efficient error monitoring. The power spectrum and the eye pattern of the new line code are simulated for a minimum-bandwidth digital transmission system where the sinc function is used as a basic pulse. The obtained power null at the Nyquist frequency is wide enough to enable easy band-limiting as well as secure insertion of a clock pilot where necessary. The eye is also substantially wide to tolerate a fair amount of timing jitter in the receiver.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.571-573
• /
• 2018

Wireless sensor networks have unbalanced energy consumption due to the convergence structure in which data is concentrated to sink nodes. To solve this problem, in the previous research, the relay node was placed between the source node and the sink node to merge the data before being concentrated to the sink node. However, selecting a relay node that does not consider the link quality causes packet loss according to the link quality of the reconfigured routing path. Therefore, in this paper, we propose a link cost calculation method for data reliability in routing path reconfiguration for relay node selection. We propose a link cost estimation formula considering the number of hops and RSSI as the routing metric value and select the RSSI threshold value through the packet transmission experiment between the sensor modules.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1295-1304
• /
• 2010

This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.274-281
• /
• 2006

Sensor network applications need synchronized time extremely such as object tracking, consistent state updates, duplicate detection, and temporal order delivery. This paper describes reliable time synchronization protocol (RTSP) for wireless sensor networks. In the proposed method, synchronization error is decreased by creating hierarchical tree with lower depth and reliability is improved by maintaining and updating information of candidate parent nodes. The RTSP reduces recovery time and communication overheads comparing to TPSN when there are topology changes owing to moving of nodes, running out of energy and physical crashes. Simulation results show that RTSP has about 20% better performance than TPSN in synchronization accuracy. And the number of message in the RTSP is $20%{\sim}60%$ lower than that in the TPSN when nodes are failed in the network. In case of different transmission range of nodes, the communication overhead in the RTSP is reduced up to 40% than that in the TPSN at the maximum.