• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1529-1541
• /
• 2006

Moving objects have been widely employed in traffic and logistic applications. Spatio-temporal aggregations mainly describe the moving object's behavior in the spatial data warehouse. The previous works usually express the object moving in some certain region, but ignore the object often moving along as the trajectory. Other researches focus on aggregation and comparison of trajectories. They divide the spatial region into units which records how many times the trajectories passed in the unit time. It not only makes the storage space quite ineffective, but also can not maintain spatial data property. In this paper, a spatio-temporal aggregation index structure for moving object trajectory in constrained network is proposed. An extended B-tree node contains the information of timestamp and the aggregation values of trajectories with two directions. The network is divided into segments and then the spatial index structure is constructed. There are the leaf node and the non leaf node. The leaf node contains the aggregation values of moving object's trajectory and the pointer to the extended B-tree. And the non leaf node contains the MBR(Minimum Bounding Rectangle), MSAV(Max Segment Aggregation Value) and its segment ID. The proposed technique overcomes previous problems efficiently and makes it practicable finding moving object trajectory in the time interval. It improves the shortcoming of R-tree, and makes some improvement to the spatio-temporal data in query processing and storage.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1433-1442
• /
• 1997

Algorithm design is needed to optimized bandwidth which satisfy quality of service(QoS) requirements of vary traffic classes for Multimedia service in ATM networks. The diverse flow characteristics e.g., burstiness, bit rate and burst length, have to guarantee the different quality of service(QoS) requirements in Asynchronous Transfer Mode(ATM). The QoS parameter may be measured in terms of cell loss probability and maximum cell dely. In this paper, we consider the ATM networks which the virtual path(vip) concept is implemented by applying the Markov Modulated Deterministic Process method. We develop an efficient algorithm to computer the minimum capacity required to satisfy all the QoS requirements when multiple classes of on-off source are multiplexed on single VP. Using above the result, we propose a simple algorithm to determine the VP combination to achieve the near optimum of total capacity required for satisfying the individual QoS requirements. Numerical results are also presented to demonstrate the performance of the algorithm, when compared to the optimal total capacity required.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

• Journal of the Korean Association of Oral and Maxillofacial Surgeons
• /
• v.42 no.4
• /
• pp.174-181
• /
• 2016

Objectives: This retrospective study aims to evaluate the prevalence of maxillofacial trauma in a developing country, along with its pattern, etiology and management. Data for the present study were collected from the Department of Dentistry, ESIC Medical College and Post Graduate Institute of Medical Sciences and Research, Chennai in India. Materials and Methods: The medical records of patients treated for maxillofacial injuries between May 2014 and November 2015 were retrospectively retrieved and analyzed for prevalence, pattern, etiology, and management of maxillofacial trauma. SPSS software version 16.0 was used for the data analysis. Results: Maxillofacial fractures accounts for 93.3% of total injuries. The mean and standard deviation for the age of the patients were $35.0{\pm}11.8$ years and with a minimum age of 5 years and maximum age of 75 years. Adults from 20 to 40 years age groups were more commonly involved, with a male to female ratio of 3:1. There was a statistically significantly higher proportion of males more commonly involved in accident and injuries (P <0.001). Conclusion: The most common etiology of maxillofacial injury was road traffic accidents (RTA) followed by falls and assaults, the sports injuries seem to be very less. In RTA, motorized two-wheelers (MTW) were the most common cause of incidents. The majority of victims of RTA were young adult males between the ages of 20 to 40 years. The malar bone and maxilla were the most common sites of fracture, followed by the mandible. The right side of the zygomatic complex was the predominant side of MTW injury. The majority of the zygomatic complex fractures were treated by conservative management. Open reduction and internal fixation were performed for indicated fracture patients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• Journal of Communications and Networks
• /
• v.14 no.4
• /
• pp.434-442
• /
• 2012

Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with themaximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

• Journal of the Korean Institute of Educational Facilities
• /
• v.16 no.4
• /
• pp.61-70
• /
• 2009

From the mid-1990s, the discussion on alternative schools began in earnest, and with the increasing interests in them, Korean parents' association of alternative education, KPAAE was launched formally in November, 2008. Among the alternative schools in the nation, thirteen urban alternative schools were studied and analyzed. The result indicated that they are being run by individuals and civic organizations with no approval and the facilities and spatial organization of the schools are poor, which is thought to be mainly due to financial reasons as well as the schools' educational goal that puts emphasis on experiences leading to utilize outside local facilities. With this background, the results from the analysis of the facility status and the spatial organization of urban alternative schools led us to understand the followings: First, it showed that per capita average of area of the urban alternative school is approximately 11.995m$^2$, less than 14N, the standard area of institutional schools. Second, depending on the form of facilities, the space of other facilities is shared to make up for insufficient space, and is utilized to a small degree and for multi-purposes. Third, the space reflects the disposition of subject students, and is located in the area with convenient traffic for students' attending the schools conveniently. Fourth, specialized space is run on the basis of educational goals, and the exploring of career and the improving of sociality are pursued through internship programs associated with local facilities. Thus, it is desirable for the minimum per capita area of the urban alternative school to meet 14N, the standard area of the institutional schools in order that the urban alternative school may overcome the spatial limitation and the financial hardship stemming from the practically difficult constructing of new buildings and the small scale operation, and it may make flexible use of the space, and the students may live their lives smoothly. Also, it is thought that for the activating of the urban alternative schools, the plans for utilizing various facilities associated with local facilities should be considered.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.5
• /
• pp.59-66
• /
• 2010

Korea have experienced a very rapid increase in police-reported collisions between bicycle and motor vehicles over the past decade. Even though cycling accidents are increasing, efforts to make urban areas more accomodating to cyclists are seldom formed. Clearance intervals(including both the yellow change and all-red clearance intervals) at signalized intersections that are of inadequate lengths for bicycles may cause accidents. Data on bicycling speed, acceleration and deceleration were tested and analyzed on the flat. Using the results of the analysis and based on the AASHTO's equation of the bicycle clearance interval, a methodology is got for calculation safe clearance intervals for bicycle riders. The clearance interval call for bicycles will be larger or same than for vehicles because of the speed, acceleration and deceleration difference. Adequate bicycle speed, acceleration and deceleration for korean bicycle users is presented in this paper. It is hoped that traffic engineers to provide safe intersection clearance time for bicycles use the results of this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.837-843
• /
• 2006

IEEE802.15.3 and IEEE802.15.4 have defined the hybrid MAC protocols based on TDMA and CSMA where a multi-frame TDMA structure is employed so that multiple data frames can be transmitted within one timeslot to guarantee minimum delay bounds of isochroous traffic. However, TDMA has an intrinsic problem that cannot dynamically allocate optimal length of timeslot to each station. Therefore the idle timeslot can be produced by stations when each transmission queue is instantaneously empty during its timeslot, which would waste lots of timeslots especially in the multi-frame TDMA systems. In this paper, we propose a more flexible multiple-access scheme for the multi-frame TDMA system based on the concept of virtual slot which is accessible by every station with the highest priority for slot owner and lower priority for other stations. Finally, our simulation results from various environments show that proposed scheme can achieve magnitude improvement of total system throughput and average message delay by maximizing channel utilization.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.45-50
• /
• 2003

Guaranteed Frame Rate (GFR) service category is one of the most recent ATM service categories. The GFR specification was recently finalized by the ATM Forum and is expected to become an important service category which can efficiently support TCP/IP traffic in ATM network. In GFR switch implementation, it is important to guarantee MCR (minimum cell rate) and improve fairness. In this paper, we propose a new scheduling algorithm for the GFR service. Proposed algorithm provides priority to VC (virtual circuit)s and high Priority given to a VC which has fewer untagged cells in buffer. High priority VCs are serviced before low priority VCs. Proposed algorithm can guarantee MCR and improve fair sharing of the remaining bandwidth between GFR VCs. From computer simulation results, we demonstrate the proposed scheduling algorithm provide much better performance in TCP goodput and fairness than previous schemes.