• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.55-66
• /
• 1998

This paper presents a simple method for relieving the ambiguity problems within the sub-voxel based surface-fitting approach for the surface construction. ECB algorithm is proposed to avoid the ambiguity problem which is the root of the holes within the resulting polygon based approximation. The basic idea of our disambiguation strategy is the use of a set of predefined modeling primitives (we call SMP) which guarantees the topological consistency of resulted surface polygons. 20 SMPs are derived from the extension of the concept of the elementary modeling primitives in the CB algorithm [3], and fit one to five faces of them to the iso-surface crossing a cell with no further processing. A look-up table which has a surface triangle list is pre-calculated using these 20 SMPs. All of surface triangles in the table are from the faces of SMPs and are stored in the form of edge list on which vertices of each surface triangle are located. The resulted polygon based approximation is unique at every threshold value and its validity is guaranteed without considering the complicated problems such as average of density and postprocessing. ECB algorithm could be free from the need for the time consuming post-processing, which eliminates holes by revisiting every boundary cell. Through three experiments of surface construction from volume data, its capability of hole avoidance is showed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.270-286
• /
• 2012

In this paper, we propose a novel routing protocol called the Cartography Enhanced OLSR (CE-OLSR) for multi hop mobile ad hoc networks (multi hop MANETs). CE-OLSR is based on an efficient cartography gathering scheme and a stability routing approach. The cartography gathering scheme is non intrusive and uses the exact OLSR reduced signaling traffic, but in a more elegant and efficient way to improve responsiveness to the network dynamics. This cartography is a much richer and accurate view than the mere network topology gathered and used by OLSR. The stability routing approach uses a reduced view of the collected cartography that only includes links not exceeding a certain distance threshold and do not cross obstacles. In urban environments, IEEE 802.11 radio signals undergo severe radio shadowing and fading effects and may be completely obstructed by obstacles such as buildings. Extensive simulations are conducted to study the performances of CE-OLSR and compare them with those of OLSR. We show that CE-OLSR greatly outperforms OLSR in delivering a high percentage of route validity, a much higher throughput and a much lower average delay. In particular the extremely low average delay exacerbated by CE-OLSR makes it a viable candidate for the transport of real time data traffic in multi hop MANETs.

• The Journal of Pediatrics of Korean Medicine
• /
• v.15 no.1
• /
• pp.77-104
• /
• 2001

The effects of the oriental herbal medicine Saenghyetang(SHT, 生慧湯), which consists of Rehmanniae Radix (熟地黃 九蒸: was made by 9th steam) 40g, Corni Fructus(山茱黃) 16g, Polygalae Radix(遠志) 8g, Zizyphi Spinosae Semen(酸棗仁) 2g, Biotae Semen(柏子仁 去油: oil ingredient was removed) 20g, Poria Cocos(茯笭) 12g, Ginseng Radix(人蔘) 12g, Acori Graminei Rhizoma(石菖蒲) 2g, Sinapis Semen(白芥子) 8g, on learning ability and memory were investigated. Hot water extract(HWE) and ethanol extract(EE) from SHT were used for the studies. Learning ability and memory are related to modifications of synaptic strength among neurons that interactive. Enhanced synaptic coincidence detection leads to improved learning ability and memory. If the NMDA receptor, a synaptic coincidence detector, acts as a graded switch for memory formations, enhanced signal detection by NMDA receptors should enhance learning ability and memory. It was shown that NR2B was increased in the forebrains of oriental medicine-administrated mice, leading to enhanced activation of NMDA receptors and facilitating synaptic potentiation in response to stimulation at 10-100 Hz. These HWE-SHT treated mice exhibited that superior ability in learning and memory when performing various behavioral tasks, showing that NR2B is enhanced by HWE-SHT treatment and also is critical in gating the age-dependent threshold for plasticity and memory formation. NMDA receptor-dependent modifications, which were mediated in part by HWE administration, of synaptic efficacy, therefore, represent a mechanism for associative learning ability and memory. Results suggest that oriental medical enhancement of NR2B contributes to increase intelligence and memory in mammals On the other hand, to examine the effects of EE-SHT on the learning ability and memory in experimental mice, EE-SHT was tested on passive and active avoidance responses. The EE-SHT ameliorated the memory retrieval deficit induced by ethanol in mice, but not other memory impairments. EE-SHT(10, 20mg/100 g, p.o.) did not affect the passive avoidance responses of normal mice in the step through and step down tests, the conditioned and unconditioned avoidance responses of normal mice in the shuttle box, lever press performance tests and the ambulatory activity of normal mice in a normal condition. However, EE-SHT at 20 mg/kg significantly decrease the spontaneous motor activity during the shuttle box test, and also to extend the sleeping time induced by pentobarbital in mice. These results suggest that SHT has an ameliorating effect on memory retrieval impairments and a weak tranquilizing action.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.45-57
• /
• 2005

In this paper, we extend the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. Even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congetion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps. By analyzing the periodic bursty behavior of the source IP queue, we derive estimated for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.1 no.2
• /
• pp.102-109
• /
• 2006

In this paper, we improve the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. For example, even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congestion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.5
• /
• pp.312-321
• /
• 2003

In this paper, we implement robot which are ability to recognize obstacles and moving automatically to destination. we present two results in this paper; hardware implementation of image processing board and software implementation of visual feedback algorithm for a self-controlled robot. In the first part, the mobile robot depends on commands from a control board which is doing image processing part. We have studied the self controlled mobile robot system equipped with a CCD camera for a long time. This robot system consists of a image processing board implemented with DSPs, a stepping motor, a CCD camera. We will propose an algorithm in which commands are delivered for the robot to move in the planned path. The distance that the robot is supposed to move is calculated on the basis of the absolute coordinate and the coordinate of the target spot. And the image signal acquired by the CCD camera mounted on the robot is captured at every sampling time in order for the robot to automatically avoid the obstacle and finally to reach the destination. The image processing board consists of DSP (TMS320VC33), ADV611, SAA7111, ADV7l76A, CPLD(EPM7256ATC144), and SRAM memories. In the second part, the visual feedback control has two types of vision algorithms: obstacle avoidance and path planning. The first algorithm is cell, part of the image divided by blob analysis. We will do image preprocessing to improve the input image. This image preprocessing consists of filtering, edge detection, NOR converting, and threshold-ing. This major image processing includes labeling, segmentation, and pixel density calculation. In the second algorithm, after an image frame went through preprocessing (edge detection, converting, thresholding), the histogram is measured vertically (the y-axis direction). Then, the binary histogram of the image shows waveforms with only black and white variations. Here we use the fact that since obstacles appear as sectional diagrams as if they were walls, there is no variation in the histogram. The intensities of the line histogram are measured as vertically at intervals of 20 pixels. So, we can find uniform and nonuniform regions of the waveforms and define the period of uniform waveforms as an obstacle region. We can see that the algorithm is very useful for the robot to move avoiding obstacles.