• Composites Research
• /
• v.30 no.3
• /
• pp.202-208
• /
• 2017

Resin transfer molding (RTM) is a mass production process that allows the fabrication of composites ranging in size from small to large. Recently, fast curing resins with a curing time of less than about 10 minutes have been used in the automotive and aerospace industries. The viscosity of resin is bound up with the degree of cure, and it can be changed rapidly in the fast-cure resin system during the mold filling process. Therefore, it is advantageous to experimentally measure and evaluate the degree of cure because it requires much effort to predict the flow characteristics and cure of the fast curing resin. DMA and dielectric technique are the typical methods to measure the degree of cure of composite materials. In this paper, the resin flow and degree of cure were measured through the multi-channel dielectric system. A total of 8 channels of dielectric sensors were used and resin flow and degree of cure were measured and compared with each other under various pressure conditions.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.131-145
• /
• 2004

Mobile IP has been designed only to maintain communications as mobile devices move from a place to a place, so it does not guarantee Quality of Service (QoS). Hierarchical MIPv6 improved QoS somewhat using Mobility Anchor Point(MAP), but QoS guarantee problem still remains. QoS in mobile IP is important to provide multimedia and real-timeapplications services in a mobile environment, and QoS is closely related to handoff delay. Therefore, handoff delay problem is actively studied as a main issue in mobile IP research area to guarantee QoS. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in an active network in order to resolve such a problem, Suggested QoS controlled method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show an improvement on handoff delay, and consequently the QoS improvement.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.45-55
• /
• 1997

In this paper, we propose a fast algorithm with adaptive thresholding for the wavelet transform (WT) based blocking artifact reduction. In the fast algorithm, all processings that are equivalent to the processing in WT domain of the first and second scale are performed in spatial domain. In the adaptive thresholding, the threshold values used to classify the block boundary are selected adaptively according to each input image by using the statistical properties of the WT of the coded signal at block boundary and at block center, which can be obtained in spatial domain. Experimental results showed that the proposed fast algorithm is about 10 times faster than the WT-based algorithm. It also was found that the postprocessing with proposed adaptive thresholding yields some PSNR improvement and better subjective quality over that with nonadaptive thresholding which has best performance at high compression ratios of a certain .image, even at low compression ratios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2A
• /
• pp.186-195
• /
• 2010

For the fast target base station channel decision in WiMAX networks, fast group scanning scheme was suggested, in which mobile stations in proximity of each other form a group and scan the candidate channels dispersively. However, the previous group scanning scheme does not consider the different QoS requirements of each MS in a group. In this paper we propose the enhanced group scanning scheme, so-called QoS-aware group scan scheduling scheme, that makes mobile stations in a group scan the candidate channels without deteriorating the QoS requirements. We introduce the QoS-aware channel scanning concept of a individual mobile station and show the different scanning latencies due to the different QoS requirements. With the help of the efficient channel allocation by the serving BS, in the proposed scanning scheme, a mobile station with relatively higher QoS in a group scans less amount of candidate channels than the others with relatively lower QoS, while the mobile stations in a group still guarantees the fast target base station decision. The performance results show that our proposed scanning scheme results in the fast target base station decision while considering the QoS requirements of each MS.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.198-203
• /
• 2009

With the growing demand for multimedia services and advances in display technology, new applications for 3$\sim$D scene communication have emerged. While multi-view video of these emerging applications may provide users with more realistic scene experience, drastic increase in the bandwidth is a major problem to solve. In this paper, we propose a fast prediction mode decision algorithm which can significantly reduce complexity and time consumption of the encoding process. This is based on the object segmentation, which can effectively identify the fast moving foreground object. As the foreground object with fast motion is more likely to be encoded in the view directional prediction mode, we can properly limit the motion compensated coding for a case in point. As a result, time savings of the proposed algorithm was up to average 45% without much loss in the quality of the image sequence.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.7
• /
• pp.45-51
• /
• 2009

We have presented a routing mechanism that selects a route by considering channel statuses in order to fast transfer delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is the shortest or the number of hops is the smallest. An algorithm to select a real-time transfer path based on link error rates according to the characteristic of wireless medium was also suggested. However, the propagation delay and retransmission timeout affected by link error rates are shorter than channel assessment time and backoff time. Therefore, the mechanism proposed in this paper estimated the time spent in using a clear channel and sending out a packet, which is based on channel backoff rates. A source node comes to select a route with the shortest end-to-end delay as a fast transfer path for real-time traffic, and sends data along the path chosen. We found that this proposed mechanism improves the speed of event-to-sink data transfer by performing experiments under different link error and channel backoff rates.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.803-812
• /
• 2004

The performance of video-on-demand(VOD) systems is known to be mainly dependent on a scheduling mechanism which they employ. Broadcast-based scheduling schemes have attracted a lot of attention as an efficient way of distributing popular videos to very large client populations. The main motivations of broadcasting scheduling mechanisms are that they scale up extremely well and they have very modest bandwidth requirements. This paper studies this issue and proposes a new broadcasting scheduling mechanism, named fast universal video dis-tribution(FUVD). FUVD scheme dynamically constructs a video broadcasting schedule in response to client requests, and broadcasts video seg-ments according to this schedule. This paper also evaluates the performance of FUVD on the basis of a simulation approach. The simulation results indicate that FUVD protocol shows a superior performance over UD, CBHD, and NPB in terms of the average response time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.6
• /
• pp.619-625
• /
• 2009

FastSLAM which uses the Rao-Blackwellized particle filter is one of the famous solutions to SLAM (Simultaneous Localization and Mapping) problem that estimates concurrently a robot's pose and surrounding environment. However, the particle depletion problem arises from the loss of the particle diversity in the resampling process of FastSLAM. Then, the performance of FastSLAM degenerates over the time. In this work, DIR (Density Information-based Resampling) technique is proposed to solve the particle depletion problem. First, the cluster is constructed based on the density of each particle, and the density of each cluster is computed. After that, the number of particles to be reserved in each cluster is determined using a linear method based on the distance between the highest density cluster and each cluster. Finally, the resampling process is performed by rejecting the particles which are not selected to be reserved in each cluster. The performance of the DIR proposed to solve the particle depletion problem in FastSLAM was verified in computer simulations, which significantly reduced both the RMS position error and the feature error.

• Investigative Magnetic Resonance Imaging
• /
• v.4 no.1
• /
• pp.42-51
• /
• 2000

Purpose: Projection-type Fast Spin Echo (PFSE) imaging is robust to patient motion or flow related artifact compared to conventional Fast Spin Echo (FSE) imaging, however, it has difficulty in controlling $T_2$ contrast. In this paper, Tz contrast in the PFSE method is analyzed and compared with those of the FSE method with various effective echo times by computer simulation. The contrasts in the FSE and PFSE methods are also compared by experiments with volunteers. From the analysis and simulation, it is shown that ${T_2}-weighted$ images can well be obtained by the PFSE method proposed. Materials and methods: Pulse sequence for the PFSE method is implemented at a 1.0 Tesla whole body MRI system and $T_2$ contrasts in the PFSE and FSE methods are analyzed by computer simulation and experiment with volunteers. For the simulation, a mathematical phantom composed of various $T_2$ values is devised and $T_2$ contrast in the reconstructed image by the PFSE is compared to those by the FSE method with various effective echo times. Multi-slice ${T_2}-weighted$ head images of the volunteers obtained by the PFSE method are also shown in comparison with those by the FSE method at a 1.0 Tesla whole body MRI system. Results: From the analysis, $T_2$ contrast by the PFSE method appears similar to those by the FSE method with the effective echo time in a range of SO-lOOms. Using a mathematical phantom, contrast in the PFSE image appears close to that by the FSE method with the effective echo time of 96ms. From experiment with volunteers, multi-slice $T_2-weighted$ images are obtained by the PFSE method having contrast similar to that of the FSE method with the effective echo time of 96ms. Reconstructed images by the PFSE method show less motion related artifact compared to those by the FSE method. Conclusion: The projection-type FSE imaging acquires multiple radial lines with different angles in polar coordinate in k space using multiple spin echoes. The PFSE method is robust to patient motion or flow, however, it has difficulty in controlling $T_2$ contrast compared to the FSE method. In this paper, it is shown that the PFSE method provides good $T_2$ contrast (${T_2}-weighted$ images) similar to the FSE method by both computer simulation and experiments with volunteers.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.242-245
• /
• 1995