• Journal of the Korea Fashion and Costume Design Association
• /
• v.8 no.1
• /
• pp.127-136
• /
• 2006

These researches discussed promotions and effectiveness in the area of star marketing production, copying, advertising, and expenditure on clothes. The thesis is refreshing in the way it deals with analysis of strategical changes in the fashion of entertainers asia cultural industry developed. I specially focused on comparing and analyzing the changes in style of Hip Hop fashion from the period of inferior culture to the period in which their fashion is highly respected. Also, I'd like to study the influence of the fashion to Korean Hip Hop artists. The Hip Hop musicians developed their styles from underdog images of Hip Hop to glamourous and luxurious styles along with modeling in various magazines appealing sexually. In Korea, Seven and Hyori Lee are showing new and changed styles that are different from the past to their fans. The Hip Hop style now is showing with unimaginably luxurious styles as opposed to its original image. With their pursuance of ostentatious and luxurious styles Hip Hop was reborn as new Glam style. Old Hip Hop styles such as ripped jeans, safety pins, graffiti, and loose and exaggerated silhouette give inspirations to many worldly known designers and their collection. Hip Hop that used to be a branch of a low culture was able to grow to the culture of luxuries via the development the media and improvement of lives and the level of consciousness of the middleclass. Music stars with luxurious Hip Hop fashion influenced coming of a new musical genre and Korean musicians largely. I hope this research can help developing the unique low-culture and creating new trend in the field of entertainers' fashion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.595-605
• /
• 2012

DV-Hop is one of the well known range-free localization algorithms. The algorithm works well in case of isotropic network since the sensor and anchor nodes are placed in the entire area. However, it results in large errors in case of anisotropic networks where the hop count between nodes is not linearly proportional to the Euclidean distance between them. Hence, we proposed a novel range-free algorithm for anisotropic networks to improve the localization accuracy. In the paper, the Euclidean distance between anchor node and unknown node is estimated by the average hop distance calculated at each hop count with hop count and distance information between anchor nodes. By estimating the unknown location of nodes with the estimated distance estimated by the average hop distance calculated at each hop, the localization accuracy is improved. Simulation results show that the proposed algorithm has more accuracy than DV-Hop.

• Korean Journal of Food Science and Technology
• /
• v.52 no.3
• /
• pp.296-303
• /
• 2020

Hop-resistant lactic acid bacteria (LAB) are well-known, major beer-spoilage bacteria. The hop-gradient agar containing ethanol (c-HGA+E) method has been used to examine hop-resistance of beer-spoilage LAB. However, the selection of beer-spoilage bacteria by the c-HGA+E method is either too selective or too inclusive. Furthermore, it is accompanied by a complicated experimental procedure, high-cost and time. To overcome these disadvantages, the modified hop-gradient agar with ethanol (m-HGA+E) method was developed. The most remarkable modifications were the shape of the petri dish and the inoculation method for bacteria. The efficiency and validation of the m-HGA+E approach were proven by the formation of colonies at different hop concentrations in the bottom layer, co-culture with the bacteriocin producer and by PCR detection of hop-resistant genes. This study demonstrated that m-HGA+E is a rapid, economical, and easy method to monitor potential hop-resistant beer-spoilage LAB during the beer brewing process.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1299-1303
• /
• 2005

Over the last decade the research of end-to-end behavior on computer network has grown by orders but it has few researching in hop-by-hop behavior. We think if we know hop-by-hop behavior it can make better understanding in network behavior. This paper represent ICMP time stamp request and time stamp reply as tool of network study for learning in hop-by-hop behavior to estimate link bandwidth and link structure. We describe our idea, experiment tools, experiment environment, result and analysis, and our discussion in our observative.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4541-4554
• /
• 2019

This paper proposes a planar projection DV-hop location algorithm (PTCDV-hop) based on the LED semi-angle at half power (SAHP, which accounts for LED SAHP characteristics in visible light communication (VLC)) and uses the DV-hop algorithm for range-free localization. Distances between source nodes and nodes positioned in three-dimensional indoor space are projected onto a two-dimensional plane to reduce complexity. Circles are structured by assigning source nodes (projected onto the horizontal plane of the assigned nodes) to be centers and the projection distances as radii. The proposed PTCDV-hop algorithm then determines the position of node location coordinates using the trilateral-weighted-centroid algorithm. Simulation results show localization errors of the proposed algorithm are on the order of magnitude of a millimeter when three sources are used. The PTCDV-hop algorithm has higher positioning accuracy and stronger dominance than the traditional DV-hop algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.69-78
• /
• 2009

DV-Hop algorithm is not accurate in estimating geographic location of nodes because the average size for one hop is calculated without considering of the positioning error. In this paper, a novel algorithm based on DV-Hop algorithm is proposed for the approach to estimating the average size of a hop by minimizing anchor's positioning error using Least Square Error with other anchors. Moreover, unknown nodes have their own average size for one hop to compensate for the location error of the unknown occurring as more than the minimum hop counts to the distance. Simulation results show that the proposed algorithm has more accuracy than DV-Hop has in positioning.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.4
• /
• pp.295-301
• /
• 2020

When a spacecraft in deep space falls into an abnormal state, an emergency communication channel between ground and the spacecraft is essential in order to perform analysis to the cause of the anomaly, and to remedy the spacecraft from the distressed state. Because the recovery actions generally comprises of long and complicated sequences of commands, the transmission of the recovery commands may require a reliable and a delay tolerant networking technology based on bundle routing. While the delay tolerant networking protocol becomes a prominent method interfacing ground and space into a internet-like Solar system network because it can address the issues of the severe communication problems in deep space, the communication system on the spacecraft which based on space packet protocol cannot use the delay tolerant networking technology directly. So a community of the consultative committee for space data systems starts a discussion of the first-hop last-hop mechanism to establish a feasible concept and standardization. This paper presents an enhanced concept of the first-hop last-hop by applying it a virtual cislunar communication environment, and we believe this contributes to make a way applicable to an interoperable relay concept of the first hop last hop between the delay tolerant networking and space packet protocol standard.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.442-445
• /
• 2006

In Wireless Sensor Networks(WSNs), a sensor node broadcasts an acquisited data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In this paper, we proposes a reliable congestion protocol, ratted HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

• Korean Journal of Environmental Agriculture
• /
• v.1 no.2
• /
• pp.99-104
• /
• 1982

These studies were carried out to investigate the damage of root rot of hop by heptachlor residues in soil at nine farm fields and pot experiment for two years from 1980 to 1981. 1) Pot experiment results indicated that root rot of hop occurred in farm field were caused by heptachlor phytotoxicity. 2) The damage of root rot of the hop was found by heptachlor residues in soil. Hop root in the low concentration of heptachlor was turned to brown mottle, and then rotted. In high concentration, the hop root was decreased in number, blocked in growth, and resulted to greyish change with death. 3) Hop vine damaged by heptachlor was hardened and broken with ease. 4) Heptachlor epoxide which was inferred to be the main cause of hop root rot gave the damage to hop at 0.009 ppm reisdues in soil. 5) The phytotoxicity of heptachlor was proved to last for 10 years or more in this study.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.35-42
• /
• 2003

In this paper, we classified the wavelength reservation mechanisms of optical burst switching (OBS), and investigated the path length priority effect of the offset time/delayed reservation (OT/DR)-based scheme like the just-enough-time (JET) protocol. And, we showed that the fiber delay line (FDL)-based scheme can avoid the path length priority effect in multiple hop network environments. Also, we proposed a novel FDL/DR with hop-by-hop priority increasing (HPI) scheme which can improve the end-to-end throughput by increasing the priority of bursts hop-by-hop using the input FDLs at each node. The simulation results showed that the proposed FDL/DR with HPI scheme could avoid the path length priority effect and enhance the end-to-end throughput in multiple hop network environments.