• Food Science and Industry
• /
• v.53 no.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.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.1-6
• /
• 2007

In wireless mesh networks (WMNs), the end-to-end throughput of a flow decreases drastically according to the traversed number of hops due to interference among different hops of the same flow in addition to interference between hops of different flows with different paths. This paper proposes a distributed multi-channel assignment scheme based on hops (DMASH) to improve the performance of a static WMN. The proposed DMASH is a novel distributed multi-channel assignment scheme based on hops to enhance the end-to-end throughput by reducing interference between channels when transmitting packets in the IEEE 802.11 based multi-interface environments. The DMASH assigns a channel group to each hop, which has no interference between adjacent hops from a gateway in channel assignment phase, then each node selects its channel randomly among the channel group. Since the DMASH is a distributed scheme with unmanaged and auto-configuration of channel assignment, it has a less overhead and implementation complexity in algorithm than centralized multi-channel assignment schemes. Simulation results using the NS-2 showed that the DMASH could improve remarkably the total network throughput in multi-hop environments, comparing with a random channel assignment scheme.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.6 no.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.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.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.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.9 no.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.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.27 no.2
• /
• pp.141-146
• /
• 1982

In the vine training methods, main vine training yield was 36% higher than the non-training. Main vine training date was studied for increasing cone yield in hops. Training was done four different dates from May 14 to May 29 including non-training as a check. Earlier training increased cone yield from 12 to 43% due to more beared branches per plant, longer branch length caused by accelerating the branch growth, and an increased of number of cone per beared branch and total cone number.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.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.

• 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.

• YAKHAK HOEJI
• /
• v.54 no.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
• /
• v.9 no.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.