• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.136-144
• /
• 2003

In this paper, we propose a scheme that can control the loss probability of low priority class bursts by dynamically adjusting the assembly threshold of low priority class. The key ideas is that the loss Probability of the longer burst increases as the load increases, thus reduced low priority class burst length decreases the loss priority at high traffic load. To achieve this aim, we first derive the relation among the loss probability, the assembly threshold, and the traffic load. In this paper we derive the relation by curve fitting on the simulation results. The ingress edge routers periodically or by event-driven receives the proper corresponding assembly threshold information from the core routers. This assembly threshold is calculated from the derived relation so that the required loss probability of the low priority class bursts in the network is satisfied. The simulation results show that the proposed scheme performs well to meet the loss probability target as expected.

• Spatial Information Research
• /
• v.12 no.1
• /
• pp.101-110
• /
• 2004

Research that establish new cadastral survey model that use GPS to introduce GPS observation technique in cadastral survey and research that develop connection technologies are now abuzz. The purpose of this research is to keep in step in such trend and grasp present condition and performance of surveying connection to common use GPS data processing software, and analyze data processing algorithm, and develop suitable GPS data processing software in our real condition regarding GPS data processing and result of control point calculation. This research studies analysis common use software and error occurrence by data processing method that college and company have. Also, It analyzes algorithm that is applied to existing GPS data processing software. After that we study algorithm that is most suitable with cadastral survey and then develop cadastral survey calculation software for new cadastral control points.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.8
• /
• pp.3635-3640
• /
• 2014

Aim: To determine whether induced abortion (IA) increases breast cancer (BC) risk. Materials and Methods: A population-based case-control study was performed from Dec, 2000 to November, 2004 in Shanghai, China, where IA could be verified through the family planning network and client medical records. Structured questionnaires were completed by 1,517 cases with primary invasive epithelial breast cancer and 1,573 controls frequency-matched to cases for age group. The information was supplemented and verified by the family planning records. Statistical analysis was conducted with SAS 9.0. Results: After adjusting for potential confounders, induced abortions were not found to be associated with breast cancer with OR=0.94 (95%CI= 0.79-1.11). Compared to parous women without induced abortion, parous women with 3 or more times induced abortion (OR=0.66, 95%CI=0.46 to 0.95) and women with 3 or more times induced abortion after the first live birth (OR=0.66, 95%CI =0.45 to 0.97) showed a lower risk of breast cancer, after adjustment for age, level of education, annual income per capita, age at menarche, menopause, parity times, spontaneous abortion, age at first live birth, breast-feeding, oral contraceptives, hormones drug, breast disease, BMI, drinking alcohol, drinking tea, taking vitamin/calcium tablet, physical activity, vocation, history of breast cancer, eating the bean. Conclusions: The results suggest that a history of induced abortions may not increase the risk of breast cancer.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.36 no.1
• /
• pp.62-69
• /
• 2008

This study was conducted in order to recommend forest-based wildlife protection areas in Chung-nam Province using several basic habitat conditions. The conditions used in this study were the forest patch size with the potential to keep wildlife animals safe, the distance from water sources, and the availability of food for wildlife. The fractal dimension index was also used to find the edge line dynamics, which can influence on habitat conditions for edge species. The natural conservation management indices including a forest map (indicating the level of forest age), a slope map, and an elevation map were used to find the forest patches with enough space for wildlife to live on. Water resources and their buffer areas were considered as factors to protect the space as an ecological corridor. Deciduous trees and trees mixed with deciduous trees and conifers were chosen to provide wildlife animals their food. In total, 525 forest patches were chosen and recommended for the wildlife protection area. Five of these forest patches were recommended as wildlife protection areas managed by the provincial government. The other 520 forest patches were recommended to protect local wildlife animals and be managed by each county or city. These forest patches were located around the Geum-buk and Geum-nam mountains, and the forest patches are important resources as habitats to keep wildlife in the area. An ecological network consists of these separate forest patches with the ecological integration. A fractal dimension index was used to divide forest patches into several categories in order to find how patches are shaped. The forest patches with longer edges or more irregular shapes have a much higher possibility of being inhabited by various types of edge species. Through comparison of the wildlife protection areas recommended in this study to the current wildlife protection areas, we recognized that the current wildlife protection areas need boundary adjustments in order for wildlife animals to survive by themselves with water sources and food.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5A
• /
• pp.527-536
• /
• 2004

A novel hybrid multiple access system, TD-BCDMA, where Binary CDMA that maintains a constant amplitude by clipping the summation of input signals multiplied by the orthogonal codes is transmitted over a TDMA frame structure, was Nosed. In every time slot of TDMA, binary CDMA modulated multiple channel signals are transmitted with the same waveform of TDMA. TD-BCDMA has all the advantages of TDMA. Flexible adjustment of the data transmission rate In demand is possible by adjusting the number of codes and time slots assigned to each user. This property was used to show an example of Ad Hoc network applications. To obtain a proper synchronization scheme for TD-BCDMA, the Receiver Operating Characteristics performance and the false alarm probability and false dismissal probability under various channel environment of two different schemes, a preamble scheme as in TDMA and a synchronization channel scheme as in CDMA were compared. It was proved that the preamble scheme is more practical and suitable than the synchronization channel scheme for the hybrid multiple access system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8A
• /
• pp.702-711
• /
• 2011

This paper proposes a HAG(Hidden-Node-Aware Grouping) algorithm for IEEE 802.15.4 networks to enhance the performance by eliminating collisions resulted from the hidden node problem without adopting the RTS/CTS packet exchanges. To solve the hidden node problem, the HAG algorithm organizes nodes into disjoint transmission groups by dynamically allocating hidden nodes into separate groups which take turns in a round robin way for their transmission. For dynamic group adjustment, it periodically evaluates the presence of hidden nodes based on subordinate nodes' receipt reports. To accurately measure its behavior, this paper also builds an analytical model to estimate its throughput fluctuation over various network topologies. The mathematical model along with simulation results confirmed that the HAG technique gracefully degraded the throughput of IEEE 802.15.4 networks whereas the standard IEEE 802.15.4 networks suffer severe throughput fallout as hidden nodes become populated.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.7
• /
• pp.30-38
• /
• 2012

This paper presents packet detection, frequency offset estimation architecture and performance analysis for OFDM-based wireless personal area network (WPAN) systems. Packet detection structure is used to find the start point of a packet exactly in WPAN system as the correlation value passes the constant threshold value. The applied autocorrelation structure of the algorithm can be implemented simply compared to conventional packet detection algorithms. The proposed frequency offset estimation architecture is designed for phase rotation process structure, internal bit reduction to reduce hardware size and the frequency offset adjustment block to reduce look-up table size unlike the conventional structure. If the received signal can be compensated by estimated frequency offset through the correction block, it can reduce the impact on the frequency offset. Through the performance result, the proposed structure has lower hardware complexity and gate count compared to the conventional structure. Thus, the proposed structure for OFDM-based WPAN systems can be applied to the initial synchronization process and high-speed low-power WPAN chips.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1589-1598
• /
• 2014

To support the WBAN, IEEE 802.15 Task Group 6 announced standardized documents on technical requirements of the PHY and MAC. In the IEEE 802.15.6 MAC protocol, CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) algorithm is performed based on the eight-level priorities according to the type of traffics of the periodic data from medical sensor nodes. Several nodes, which detected the changed bio signals, transmit emergency data at the same time, so latency could be higher than emergency latency and energy consumption will increase. In this thesis, we proposed a CSMA/CA algorithm in WBAN to solve these problems. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.217-224
• /
• 2012

Location-Based Services(LBS) is a service that provide location information by using communication network or satellite signal. In order to provide LBS precisely and efficiently, we studied how we can reduce the error on location determination of objects such people and things. We focus on using the least square method and triangulation positioning method to improves the accuracy of the existing location determination method. Above two methods is useful if the distance between the AP and the tags can be find. Though there are a variety of ways to find the distance between the AP and tags, least squares and triangulation positioning method are wildely used. In this thesis, positioning method is composed of preprocessing and calculation of location coordinate and detail of methodology in each stage is explained. The distance between tag and AP is adjusted in the preprocessing stage then we utilize least square method and triangulation positioning method to calculate tag coordinate. In order to confirm the performance of suggested method, we developed the test program for location determination with Labview2010. According to test result, triangulation positioning method showed up loss error than least square method by 38% and also error reduction was obtained through adjustment process and filtering process. It is necessary to study how to reduce error by using additional filtering method and sensor addition in the future and also how to improve the accuracy of location determination at the boundary location between indoor and outdoor and mobile tag.

• Journal of the Korean Society for Railway
• /
• v.17 no.6
• /
• pp.466-473
• /
• 2014

Recently, there is has been significant interest in the allocation systems of rail track capacities with considerations of the multiple train operating companies. The system indicates both a well-defined procedure and an algorithmic method to allocate the rail track capacities. Among them, this study considers the algorithmic method to derive the optimal timetable for the trains, which the companies propose together with their arrival and departure times at each station. However, most studies have focused on the adjustment of the departure and arrival times without conflicts, which could result in incompatible allocations with the line plan, which would result in an insufficient number of trains on each line to satisfy the demands. Our study presents a new optimization model and algorithm for the allocation problem in order to reflect the predetermined line plan. Furthermore, we provide the experimental results that were applied to the Korean high-speed railway network including the Suseo lines.