• Journal of Korean Society for Geospatial Information Science
• /
• v.25 no.2
• /
• pp.39-47
• /
• 2017

Although motorcycle safety studies to date have identified the causes of motorcycle accidents in general, very few have investigated postal motorcycle accidents by studying the delivery postmen's specific work environment. To better understand postal motorcyclists' driving behavior associated with their delivery workload, we developed a system using V-World platform which visualizes driving behavior in real time along the driver's delivery route throughout an entire work day. We conducted a field test to examine the feasibility of our system by involving six delivery postmen currently working in Songpa, Seocheongju, and Gangseo, respectively. To show the potential of our system for nationwide comparison of postal motorcyclists' driving behavior and their workloads, we present several sample analyses using the collected field data. Although ideally, postmen's workloads should be standardized nationwide, we found large variation depending on regional characteristics of work area which affects postmen's driving behavior.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.491-498
• /
• 1997

Geographic Infprmation System(GIS)is being apply to extended from specified ppkication to general purpose deu to the omprovement of computing power.As one part of postal Integarated Information Servies, Postalroute Optimication system(PROS) is comprsed of the composed of the shortest pathe genrator for providing fast and shortest route of postal delivery, the ischronal area generator, the boudary relacation generator, GIS engine, road map, and rdelational database , etc.This paper is related to creation algorithm of the shortest path generation (SPAWD;Shortest Path Algorithm With Direction)from PEOS model.To differ from the exsting shortest path generating methods, this paper suggests SPAWD alforithm for searching destinations of fast time between start and destination points with dirdstion.It comapares and analyzes the new algorithm with existion algorithms, and suggests directions of future studies.

• The KIPS Transactions:PartD
• /
• v.8D no.3
• /
• pp.273-284
• /
• 2001

A systematic approach for interpreting Korean addresses based on postal code is presented in this paper. The implementation is focused on producing the final delivery point code from various types of address recognized. There are two stages in the address interpretation : 1) agreement verification between the recognized postal code and upper part of the address and 2) analysis of lower part of the address. In the agreement verification procedure, the recognized postal code is used as the key to the address dictionary and each of the retrieved addresses is compared with the words in the recognized address. As the result, the boundary between the upper part and the lower part is located. The confusion matrix, which is introduced to correct possible mis-recognized characters, is applied to improve the performance of the process. In the procedure for interpreting the lower part address, a delivery code is assigned using the house number and/or the building name. Several rules for the interpretation have been developed based on the real addresses collected. Experiments have been performed to evaluate the proposed approach using addresses collected from Kwangju and Pusan areas.

• ETRI Journal
• /
• v.21 no.2
• /
• pp.31-39
• /
• 1999

Given two sorted lists A=(a0, a1, ${\cdots}$,a${\ell}$-1}) and B=(b0, b1, ${\cdots}$, bm-1), we are to merge these two lists into a sorted list C=(c0,c1, ${\cdots}$, cn-1), where n=${\ell}$+m. Since this is a fundamental problem useful to solve many problems such as sorting and graph problems, there have been many efficient parallel algorithms for this problem. But these algorithms cannot be performed efficiently in the postal model since the communication latency ${\lambda}$, which is of prime importance in this model, is not needed to be considered for those algorithms. Hence, in this paper we propose an efficient merge algorithm in this model that runs in $$2{\lambda}{\frac{{\log}n}{{\log}({\lambda}+1)}}+{\lambda}-1$$ time by using a new property of the bitonic sequence which is crucial to our algorithm. We also show that our algorithm is near-optimal by proving that the lower bound of this problem in the postal model is $f_{\lambda}({\frac{n}{2}})$, where $${\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}{\le}f_{\lambda}({\frac{n}{2}}){\le}2{\lambda}+2{\lambda}{\frac{{\log}n-{\log}2}{{\log}([{\lambda}]+1)}}$$.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.663-666
• /
• 2005

The Geography Markup Language (GML) is an XML encoding for the transport and storage of geographic information, including both the geometry and properties of geographic features. This paper uses the GML to provide extendibility and interoperability of spatial data in moving objects management system. Since the purpose of the system is to provide locations of the moving objects in the web and mobile environments, we used the GML both for presenting map data and trajectories of the moving objects. The proposed system is composed of Location Data Interface, Moving Objects Engine, and Web/Mobile Presentation Interface. We utilized the concept of Web Map Server, that is web mapping technology of OGC (Open Geospatial Consortium), to integrate map data and the location information of the moving objects. In the process of the integration, we used the standard data model and interfaces while defining new application schema. Since our suggested system uses open spatial data encoding and interfaces, both extendibility and interoperability are guaranteed.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2007.05a
• /
• pp.183-186
• /
• 2007

Faster, safer and cheaper mailing of the postal matter is essential for surviving in the competitive market of home-delivery service. The Steiner tree connects points minimally in geometrical way and has been used in the distribution system optimization and optimal routing of the transmission lines of the electric power system. This paper proposes a method to select the optimal location of mail distribution center that minimally connect the local mail center of some major cities using the Steiner tree theorem.

• Corrosion Science and Technology
• /
• v.6 no.6
• /
• pp.286-290
• /
• 2007

Biocompatible Hydroxy apatite (HAp) coatings on metallic substrate by plasma spray techniques have been developed. Long-term credibility of plasma spray HAp coatings has been evaluated in physiological saline by electrochemical measurements. It was found that the corrosion resisitance of SUS316L based HAp/Ti conbined coatings was excellent even after more than 10 weeks long-term immersion. It was shown that postal heat treatment improved both the crystallinity and corrosion resistance of HAp. By lowering cooling rate during heat treatment process, less cracks produced in HAp coating layer, which lead to higher credibility of HAp during immersion in physiological saline. The ICP results showed that the dissolution level of substrate metallic ions was low and HAp coatings produced in this research can be acceptable as biocompatible materials. Also, the concentration of dissolved ions from HAp coatings with postal heat treatment was lower compared to those from samples without postal heat treatment. The adherence of HAp coatings with Ti substrate and other mechanical properties were also assessed by three-point bending test. The poor adhesion of HAp coating to titanium substrate can be improved by introducing a plasma spray titanium intermediate layer.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.2
• /
• pp.92-102
• /
• 2011

Visibility of the flow of goods is an important service element when considering how to improve the quality of a logistics service. Registered mail service of Korea Post, one of logistics service providers, currently supply information on the handling of postal items, such as receipts and delivery and arrival times to customers. However, internally problems related to excessive spending on operating expenses and less reliable tracking and tracing information exist due to errors in the information acquisition and link handling processes, leading to unnecessarily duplicated tasks. Therefore, the purpose of this paper is to propose process optimization method for improving the quality of tracking and tracing information for registered mail items. We analyzed the process and information control system of the current registered mail service and identified the basic causes of the existence of less reliable tracking and tracing information. And we present optimized mail handling and information management process for removing internal problems. Test results using tracking and tracing information examples show a significant performance of the proposed method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.133-141
• /
• 2013

The revitalization of e-business via Internet brings big changes to the postal business, and leads to a tremendous increase of heavy and large sized postal mails with continuing growth of home delivery business. Thus, even though the number of intermediate storages for mail delivery that mailmen use for picking up mails in the middle of mail delivery has been being increased, it has still many problems such as insufficient number and size of the storages as well as avoidance of mail keeping of trust agents. It is necessary that safety of mail keeping, seamless mail delivery, and individual parcel pick-up process reestablishment should be made through an improved counter plan for the problems described previously. This study presents the efficient and right operational plan for the intermediate storage for mail delivery with providing the number and size of intermediate storages per mail delivery sequence according to four different types of post offices.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.