• Fire Science and Engineering
• /
• v.22 no.2
• /
• pp.63-69
• /
• 2008

The characteristics of the spread of a forest fire are generally related to the attributes of combustibles, geographical features, and meteorological conditions, such as wind conditions. The most common methodology used to create a prediction model for the spread of forest fires, based on the numerical analysis of the development stages of a forest fire, is an analysis of heat energy transmission by the stage of heat transmission. When a forest fire breaks out, the analysis of the transmission velocity of heat energy is quantifiable by the spread velocity of flame movement through a physical and chemical analysis at every stage of the fire development from flame production and heat transmission to its termination. In this study, the formula used for the 1-D surface forest fire behavior prediction model, derived from a numerical analysis of the surface flame spread rate of solid combustibles, is introduced. The formula for the 1-D surface forest fire behavior prediction model is the estimated equation of the flame spread velocity, depending on the condition of wind velocity on the ground. Experimental and theoretical equations on flame duration, flame height, flame temperature, ignition temperature of surface fuels, etc., has been applied to the device of this formula. As a result of a comparison between the ROS(rate of spread) from this formula and ROSs from various equations of other models or experimental values, a trend suggesting an increasing curved line of the exponent function under 3m/s or less wind velocity condition was identified. As a result of a comparison between experimental values and numerically analyzed values for fallen pine tree leaves, the flame spread velocity reveals a prediction of an approximately 10% upward tendency under wind velocity conditions of 1 to 2m/s, and of an approximately 20% downward tendency under those of 3m/s.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.48-55
• /
• 2009

In this paper, We propose Adaptive Group Separation algorithm for efficient RFID system AGS algorithm determines the optimized initial prefix size j, and divides the group of. A reader requests the group and searches the tag ID. If a tag collision occurred, reader adds a one bit, '0' or '1' at first bit of collision point, As a result we observe that transmitted data bits and the recognition time are decreased. The proposed algorithms have been verified by computer simulation. The performance of the proposed anti-collision algorithm is evaluated in terms of the number of repetitions and the amount of transmission bits according to the in crease of the number of tags is 256. The AGS algorithm improve the number of repetitions by about 32.3% and reduce tile amount of the transmission bits by about 1/40 than slotted binary tree algorithm.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.1-8
• /
• 2014

As the e-learning spreads widely and demands on the internet video service, transmitting video data for many users over the Internet becomes popular. To satisfy this needs, the traditional approach uses a tree structure that uses the video server as the root node. However, this approach has the danger of stopping the video service even when one of the nodes along the path has a some problem. In this paper, we propose a video-on-demand service that uses multiple paths. We add new paths for backup and speed up for transmitting the video data. We show by simulation experiments that our approach provides a high-quality of video service.

• Korean Journal of Food Science and Technology
• /
• v.45 no.3
• /
• pp.370-375
• /
• 2013

Propolis is a resinous mixture found in the tree buds, sap flows, and other botanical sources, which is used by honey bees in the construction of their hives. Antimicrobial effects of propolis were evaluated against Streptococcus mutans KCTC 3065, S. sobrinus KCTC 3308, S. sobrinus KCTC 5134, and Porphyromonas gingivalis KCTC 5352 by an agar diffusion assay. Sensitivity of these microorganisms to propolis was evaluated in broth containing different concentrations of propolis at $37^{\circ}C$, followed by observation using transmission electron microscopy (TEM). Propolis inhibited all oral microorganisms tested at the minimum inhibitory concentration (MIC) of $0.14mg/{\mu}L$ in the agar diffusion assay. Treatment with 0.06 and $0.22mg/{\mu}L$ of propolis had a bactericidal effect in a concentration- and treatment time-dependent manner against the tested microorganisms. TEM of propolis-treated S. mutans KCTC 3065 and P. gingivalis KCTC 5352 revealed structural damage of the cell membrane. The activity of propolis was affected by heat and pH treatment. The results indicate that propolis shows antibacterial activity against oral microorganisms and that it has potential for future applications in the food industry.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.349-359
• /
• 2004

To provide multicasting service, several multicast protocols for mobile hosts have been proposed. But they include glitches such as a non-optimal delivery route, data loss when hosts move another network, therefore they have some insecure problems about multicast data transmission. In this paper, we consider these problems and propose a new reliable and efficient multicast routing protocol for Mobile If networks. The proposed protocol provides reliable multicast transmission by compensating data loss from the previous agent when a mobile host moves another network. Also it provides additional function that is directly to connect a multicast tree according to the status of agents. It provides more efficient and optimal multicast path. The performance of the proposed protocol is proved by simulation of various conditions.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.2
• /
• pp.181-186
• /
• 2009

The objective of this study is ensuring safety of cabin when the blade impacts into a obstacle by verifying safety of the rotor mast and the transmission using impact loads calculated from the simulation. The rotor mast shall not fail and the transmission shall not be displaced into occupiable space when the main rotor composite blade impact into a 8 inch rigid cylinder in diameter on the outer 10% of the blade at operational rotor speed. To calculate the reaction loads at the spherical bearing and lead-lag damper, blade impact analysis was performed with FE model consist of composite blade, tree(or rigid cylinder) using elastic-plastic with damage material and several contact surfaces which were created to describe a progress of actual failure. Also, the reaction loads were investigated in change of blade rotation speed and pitch angle.

• Journal of Satellite, Information and Communications
• /
• v.5 no.1
• /
• pp.32-37
• /
• 2010

The algorithm of multiple channel signal processing requires the flexibility of variable frequency band, efficient allocation of transmission power, and flexible frequency band reallocation to satisfy various service types which requires different transmission rates and frequency band. There are three methods including per-channel approach, multiple tree approach, and block approach performing frequency band reallocation method by channelization and dechannelization in the multiple-channel signal. This paper proposes an improved per-channel approach for converting the frequency band of multiple carrier signals efficiently. The proposed algorithm performs decimation and interpolation using CIC(cascaded integrator comb filter), half-band filter, and FIR filter. In addition, it performs filtering of each sub-channel, and reallocates channel band through FIR low-pass filter in the multiple-channel signal. The computer simulation result shows that the perfect reconstruction of output signal and the flexible frequency band reallocation is performed efficiently by the proposed algorithm.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.107-113
• /
• 2017

Real-time multicasting is a packet transmission scheme ensuring that multiple destinations receive a packet within the desired time line. In wireless sensor networks, a packet can be delivered to a limited distance under a given deadline, since the end-to-end delay tends to be proportional to the end-to-end physical distance. Existing real-time multicasting protocols select the distance between the source and the furthest destination as the distance limitation and construct a multicasting tree guaranteeing delivery paths to each destination within the distance limitation. However, the protocols might lead to real-time delivery failures and energy efficiency degradation due to the fixed distance limitation. In this study, we proposed a real-time multicasting protocol using time deadline. The proposed protocol obtains the maximum transmittable distance with a given time deadline and subsequently constructs a multicasting tree using the maximum transmittable distance. The form of the multicasting tree varies according to the given time deadline to trade off the energy efficiency against the real-time delivery success ratio. The simulation results showed that the proposed scheme is superior to the existing protocols in terms of energy efficiency and real-time delivery success ratio under various time deadlines.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.289-298
• /
• 2006

Algorithms for application-level multicast often use trees to deliver data from the source to the multiple receivers. With the tree structure, the throughput experienced by the descendant nodes will be determined by the performance of the slowest ancestor node. Furthermore, the failure of an ancestor node results in the suspension of the session of all the descendant nodes. This paper focuses on the transmission of data using multiple virtual forwarders, and suggests a scheme to overcome the drawbacks of the plain tree-based application layer multicast schemes. The proposed scheme elects multiple forwarders other than the parent node of the delivery tree. A receiver receives data from the multiple forwarders as well as the parent node and it can increase the amount of receiving data per time unit. The multiple forwarder helps a receiver to reduce the impact of the failure of an ancestor node. The proposed scheme suggests the forwarder selection algorithm to avoid the receipt of duplicate packets. We implemented the proposed scheme using MACEDON which provides a development environment for application layer multicast. We compared the proposed scheme with Bullet by applying the implementation in PlanetLab which is a global overlay network. The evaluation results show that the proposed scheme enhanced the throughput by 20 % and reduced the control overhead over 90 % compared with Bullet.