• 식품과학과 산업
• /
• 제53권2호
• /
• pp.225-234
• /
• 2020

During the Japanese colonial period, Japanese brewing companies established 2 breweries in Korea, and brought in malting barley seeds, began trial cultivation in near Daejeon area and Jeju Island, and cultivated hops in Hyesan, Hamgyeong-do. In 1933, Chosun Brewery Co. Ltd. and Showa-Kirin Brewery Co. were established in Yeongdeungpo by Japan and these 2 breweries became the birthplace of today's Hite Brewery and Oriental Brewery. Oriental Brewery tried to cultivate hops and malting barley in Korea, and once self-sufficient but now hops depend on imports, and production of domestic malting barley is about 5% of demand. Beer was only about 5% of domestic alcohol consumption in the early 1970s, but now occupies more than 50% and became the most popular alcoholic drink in Korea. Recently various beers are imported from the world, and many craft breweries serving variety of beers to consumers, thus Korean enjoy heyday of the beer culture.

• 대한전자공학회논문지TC
• /
• 제44권5호
• /
• pp.1-6
• /
• 2007

무선 메쉬 네트워크(WMN: Wireless Mesh Network)는 다중 홉 환경에서 동일한 플로우 내의 홉간의 간섭뿐만 아니라 서로 다른 플로우의 홉간의 간섭으로 인하여 거쳐가는 흡수가 증가할수록 플로우의 종단간 수율이 크게 저하되는 문제점을 가진다. 본 논문은 이동성이 없는 매쉬 라우터로 구성된 WMW의 성능 향상을 위한 홉 기반 분산형 다중 채널 할당 방안 (DMASH: Distributed Multi-channel Assignment Scheme based on Hops)을 제안한다. 제안한 DMASH는 IEEE 802.11 기반의 다중 인터페이스 환경에서 전송 시 무선 채널간의 간섭을 줄임으로써 종단간 수율을 향상시킬 수 있는 새로운 홉 기반의 분산형 다중 채널 할당 방안이다. DMASH는 채널 설정 단계에서 게이트웨이로부터의 흡수를 기반으로 인접 홉간에 서로 간섭을 갖지 않는 채널 그룹을 각 홉에 할당하고, 통일 홉 안에서의 각 노드들은 할당된 채널 그룹 내에서 임의의 채널을 하나 선택한다. DMASH는 WMN에서 각 노드들이 자신의 채널을 자율적으로 선택할 수 있는 분산형 채널 할당 방안으로 중앙 제어형에 비해 오버헤드가 적을 뿐 아니라 구현이 간단한 장점을 가진다 NS-2 시뮬레이션을 통해 DMASH는 다중 홉 환경에서 임의 채널 할당 방식보다 망 전체 수율을 크게 향상할 수 있음을 보였다.

• 정보통신설비학회논문지
• /
• 제6권3호
• /
• pp.1-7
• /
• 2007

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide efficient utilization in optical networks. Under several legacy schemes, a switch drops the burst with the shortest time regardless of its traversed hop count. As a result, a dropped burst that have been traversed many hops might cause increased bandwidth waste compared to one that has traversed a few hops. To improve this problem, we propose the Just Enough Time (JET) with a hop counting scheme which can reduce the wasted bandwidth by prioritizing the burst traversed many hops over others. From the simulation result, it is preyed, we show that the proposed scheme has advantages against legacy schemes in terms of the burst blocking probability and the link utilization.

• 정보통신설비학회논문지
• /
• 제8권4호
• /
• pp.195-200
• /
• 2009

In this paper, we propose a new priority Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose a Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. The simulation results shows that the proposed scheme has more advantages over the legacy schemes in terms of the burst blocking probability and the link utilization.

• 정보통신설비학회논문지
• /
• 제9권1호
• /
• pp.7-12
• /
• 2010

In this paper, we propose a new prioritized Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical Wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop counts. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose the Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. From the simulation result, we show that the proposed scheme is advantageous over the legacy schemes in terms of the burst blocking probability and the link utilization.

• 한국작물학회지
• /
• 제27권2호
• /
• pp.141-146
• /
• 1982

Hop의 증수를 위한 재배기술의 일환으로 적심효과를 검토하고자 무적심, 1회적심, 2회적심, 3회적심의 적심방법 시험을 1979년에 실시하였고, 무적심, 5월 14일 적심(주경 3절위 신장시), 5월 19일 적심(주경 4절위 신장시), 5월 24일 적심(주경 5절위 신장시), 5월 29일 적심(주경 6절위 신장시)의 주경적심시험을 1980년에 실시하였던 바, 그 결과를 요약하면 다음과 같다. 1. 무적심에 비하여 적심회수가 거듭되거나 적심시기가 늦어질수록 영양생장기간 및 개화기가 지연되었다. 2. 주경적심처리는 무적심보다 만장과 총측지수 적었으나 측지 생육이 촉진되어 조기 적심일수록 만중이 증가되었을 뿐만 아니라, 주경 10절위 이하에서도 구화가 착생되어 착화측지수가 증가되었다. 3. 조기적심일수록 무적심에 비하여 10절위 이상 20절위 이하의 측지장이 현저히 길어져 착화측지당구화수 및 주당 구화수가 증가되어 12-43%의 증수를 가져왔다. 4. 만기적심(5월 29일 적심)은 적심 후에서 모화기까지의 일수가 짧아 무적심보다 착화측지수가 적었고, 측지장이 짧아 주당 구화수가 적었으며 100구화중도 가벼워 무적심보다 20% 감수되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.224-242
• /
• 2010

Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.

• 한국멀티미디어학회논문지
• /
• 제21권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.

• 약학회지
• /
• 제54권6호
• /
• pp.481-487
• /
• 2010

The proteasome plays a major role in the degradation of abnormal proteins within the cell. Therefore, repressed proteasome function is accepted as one of factors contributing the pathogenesis of multiple degenerative diseases. In the present study, we have observed that xanthohumol C, which is one of prenylated flavonoids from hops, increases the expression of the proteasome subunits through the Nrf2 pathway. Treatment of murine renal epithelial TCMK-1 cells with xanthohumol C and its methoxymethoxy-derivative elevated the expression of the Antioxidant Response Element (ARE)-driven reporter gene, as well as Nrf2-target genes including NAD(P)H: quinoneoxidoreductaes 1 (Nqo1). Transcript levels for the catalytic subunits of the proteasome Psmb5 and Psmb6 were increased by these compounds. The activation of the psmb5 promoter by xanthohumol C was abolished when the ARE in this promoter was mutated, indicating that proteasome induction was mediated by the Nrf2-ARE pathway. These results suggest that xanthohumol compounds from hops have a potential benefit on various oxidative stress-associated human diseases through the induction of the proteasome.

• Journal of Communications and Networks
• /
• 제9권3호
• /
• pp.282-295
• /
• 2007

Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.