• Journal of the Korean Geographical Society
• /
• v.31 no.1
• /
• pp.1-18
• /
• 1996

This study examines the spatial characteristics of postal office patronage in rural areas. in the light of future possible relocation and closures of the postal facilities. Most of private services have flown out small rural central places due to the decrease of supporting population, and there consequently remain only a few public services including government-run post offices at the Myon seats, the lowest level among rural central places in Korea. The small local population and its further decline undermine the rationale for maintaining such public services in depleted rural areas. For the worse of it, the government recently plans to transform the postal system to a quasi-private, corporational structure. One can fear that the profit-seeking nature of the new postal corporation will inevitably force to close many of such small rural facilities. The study first analysed nation-wide censuses of postal offices for the years of 1986 and 1992. The postal services examined are per capita number of postal stamps and revenue stamps sold, and letters, parcels, telegrams and monetary transactions handled at the post offices. It is found that, while the usage of postal services has increased substantially throughout the nation during the period of 1986-1992, the increment has largely been occurred by urban post offices rather than by those in Gun seats (i.e., rural counties); and that the gap of the service levels between urban and rural post offices is ever widening. The study further examined the service differentials among the post offices within rural counties to find that those post offices adjacent to the county (Gun) seats and larger urban centers rendered less amount of services than remote rural post offices, indicating that rural residents tend to partonize larger centers more and more than local Myon seats. At the second stage of the study, questionnaire surveys were conducted in Muju, Kimpo, and Hongsung-Gun's. These three counties are meant to represent respectively the remote, suburban, and intermediary counties in Korea. The analyses of survey data reveal that the postal hinterlands of the county seats extend to much of nearby Myons, the subdivisions of a Gun. It is also found that the extent of postal hinterlands of the three counties and the magnitude of patronage and quite different from each other depending upon the topography, population density, and the propinquity of the counties to metropolitan centers. The findings suggest to reappraise the current flat allocation scheme of public facilites to each of rural subdivisions throughout the nation. A detailed analysis on the travel behavior of the survey respondents yields that age is the most salient variable to distinguish activity spaces of rural residents. The activity spaces of older respondents tend to be more limited within their Myon, whereas those of younger respondents extend across the Myon boundary, toward the central towns and even distant larger cities. The very existence of several activity spaces in rural areas calls for an attention in the future locational decisions of public facilities. The locational criteria, employed by the Ministry of Communication of Korean government to establish a post office, are the size of hinterland population and the distance from adjacent postal facilities. The present study findings suggest two additional criteria: the order in rural central place hierarchy and the propinquity to the upper-level centers of the central hierarchy. These old and new criteria are complementary each other in that the former criteria are employed to determine new office locations, whereas the latter are appropriate to determine facility relocation and closures.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.73-94
• /
• 2010

The attending system is a medical system that allows doctors in clinics to use the extra equipment in hospitals-beds, laboratory, operating room, etc-for their patient's care under a contract between the doctors and hospitals. Therefore, the system is very beneficial in terms of the efficiency of the usage of medical resources. However, it is necessary to develop a strong support system to strengthen its weaknesses and supplement its merits. If doctors use hospital beds under the attending system of hospitals, they would be able to check a patient's condition often and provide them with nursing care services. However, the current attending system lacks delivery and assistance support. Thus, for the successful performance of the attending system, a networking system should be developed to facilitate communication between the doctors and nurses. In particular, the nursing records in the attending system could help doctors monitor the patient's condition and provision of nursing care services. A nursing record is the formal documentation associated with nursing care. It is merely a data repository that helps nurses to track their activities; nursing records thus represent a resource of primary information that can be reused. In order to maximize their usefulness, nursing records have been introduced as part of computerized patient records. However, nursing records are internal data that are not disclosed by hospitals. Moreover, the lack of standardization of the record list makes it difficult to share nursing records. Under the attending system, nurses would want to minimize the amount of effort they have to put in for the maintenance of additional records. Hence, they would try to maintain the current level of nursing records in the form of record lists and record attributes, while doctors would require more detailed and real-time information about their patients in order to monitor their condition. Therefore, this study developed a system for assisting in the maintenance and sharing of the nursing records under the attending system. In contrast to previous research on the functionality of computer-based nursing records, we have emphasized the practical usefulness of nursing records from the viewpoint of the actual implementation of the attending system. We suggested that nurses could design a nursing record dictionary for their convenience, and that doctors and nurses could confirm the definitions that they looked up in the dictionary through negotiations with intelligent agents. Such an agent-based system could facilitate networking among medical institutes. Multi-agent systems are a widely accepted paradigm for the distribution and sharing of computation workloads in the scientific community. Agent-based systems have been developed with differences in functional cooperation, coordination, and negotiation. To increase such communication, a framework for a multi-agent based system is proposed in this study. The agent-based approach is useful for developing a system that promotes trade-offs between transactions involving multiple attributes. A brief summary of our contributions follows. First, we propose an efficient and accurate utility representation and acquisition mechanism based on a preference scale while minimizing user interactions with the agent. Trade-offs between various transaction attributes can also be easily computed. Second, by providing a multi-attribute negotiation framework based on the attribute utility evaluation mechanism, we allow both the doctors in charge and nurses to negotiate over various transaction attributes in the nursing record lists that are defined by the latter. Third, we have designed the architecture of the nursing record management server and a system of agents that provides support to the doctors and nurses with regard to the framework and mechanisms proposed above. A formal protocol has also been developed to create and control the communication required for negotiations. We verified the realization of the system by developing a web-based prototype. The system was implemented using ASP and IIS5.1.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.143-150
• /
• 2012

A simulation methodology and corresponding program based on it is to be discussed for analyzing the effects of the networking operation of existing DHC system in connection with CHP system on-site. The practical simulation for arbitrary areas with various building compositions is carried out for the analysis of operational features in both systems, and the various aspects of thermal energy grids with connecting operation are highlighted through the detailed assessment of predicted results. The intrinsic operational features of CHP prime movers, gas engine, gas turbine etc., are effectively implemented by realizing the performance data, i.e. actual operation efficiency in the full and part loads range. For the sake of simplicity, a simple mathematical correlation model is proposed for simulating various aspects of change effectively on the existing DHC system side due to the connecting operation, instead of performing cycle simulations separately. The empirical correlations are developed using the hourly based annual operation data for a branch of the Korean District Heating Corporation (KDHC) and are implicit in relation between main operation parameters such as fuel consumption by use, heat and power production. In the simulation, a variety of system configurations are able to be considered according to any combination of the probable CHP prime-movers, absorption or turbo type cooling chillers of every kind and capacity. From the analysis of the thermal network operation simulations, it is found that the newly proposed methodology of mathematical correlation for modelling of the existing DHC system functions effectively in reflecting the operational variations due to thermal energy grids with connecting operation. The effects of intrinsic features of CHP prime-movers, e.g. the different ratio of heat and power production, various combinations of different types of chillers (i.e. absorption and turbo types) on the overall system operation are discussed in detail with the consideration of operation schemes and corresponding simulation algorithms.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.11
• /
• pp.509-520
• /
• 2015

College Scholastic Ability Test(CSAT) is a primary test to evaluate the study achievement of high-school students and used by most universities for admission decision in South Korea. Because its level of difficulty is a significant issue to both students and universities, the government makes a huge effort to have a consistent difficulty level every year. However, the actual levels of difficulty have significantly fluctuated, which causes many problems with university admission. In this paper, we build two types of data-driven prediction models to predict correct answer rate and to identify significant factors for CSAT English test through accumulated test data of CSAT, unlike traditional methods depending on experts' judgments. Initially, we derive candidate question-specific factors that can influence the correct answer rate, such as the position, EBS-relation, readability, from the annual CSAT practices and CSAT for 10 years. In addition, we drive context-specific factors by employing topic modeling which identify the underlying topics over the text. Then, the correct answer rate is predicted by multiple linear regression and level of difficulty is predicted by classification tree. The experimental results show that 90% of accuracy can be achieved by the level of difficulty (difficult/easy) classification model, whereas the error rate for correct answer rate is below 16%. Points and problem category are found to be critical to predict the correct answer rate. In addition, the correct answer rate is also influenced by some of the topics discovered by topic modeling. Based on our study, it will be possible to predict the range of expected correct answer rate for both question-level and entire test-level, which will help CSAT examiners to control the level of difficulties.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.6
• /
• pp.155-164
• /
• 2018

Many malicious programs have been compressed or encrypted using various commercial packers to prevent reverse engineering, So malicious code analysts must decompress or decrypt them first. The OEP (Original Entry Point) is the address of the first instruction executed after returning the encrypted or compressed executable file back to the original binary state. Several unpackers, including PinDemonium, execute the packed file and keep tracks of the addresses until the OEP appears and find the OEP among the addresses. However, instead of finding exact one OEP, unpackers provide a relatively large set of OEP candidates and sometimes OEP is missing among candidates. In other words, existing unpackers have difficulty in finding the correct OEP. We have developed new tool which provides fewer OEP candidate sets by adding two methods based on the property of the OEP. In this paper, we propose two methods to provide fewer OEP candidate sets by using the property that the function call sequence and parameters are same between packed program and original program. First way is based on a function call. Programs written in the C/C++ language are compiled to translate languages into binary code. Compiler-specific system functions are added to the compiled program. After examining these functions, we have added a method that we suggest to PinDemonium to detect the unpacking work by matching the patterns of system functions that are called in packed programs and unpacked programs. Second way is based on parameters. The parameters include not only the user-entered inputs, but also the system inputs. We have added a method that we suggest to PinDemonium to find the OEP using the system parameters of a particular function in stack memory. OEP detection experiments were performed on sample programs packed by 16 commercial packers. We can reduce the OEP candidate by more than 40% on average compared to PinDemonium except 2 commercial packers which are can not be executed due to the anti-debugging technique.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.281-286
• /
• 2003

A large number of features are collected for problem solving in real life, but to utilize ail the features collected would be difficult. It is not so easy to collect of correct data about all features. In case it takes advantage of all collected data to learn, complicated learning model is created and good performance result can't get. Also exist interrelationships or hierarchical relations among the features. We can reduce feature's number analyzing relation among the features using heuristic knowledge or statistical method. Heuristic technique refers to learning through repetitive trial and errors and experience. Experts can approach to relevant problem domain through opinion collection process by experience. These properties can be utilized to reduce the number of feature used in learning. Experts generate a new feature (highly abstract) using raw data. This paper describes machine learning model that reduce the number of features used in learning using heuristic function and use abstracted feature by neural network's input value. We have applied this model to the win/lose prediction in pro-baseball games. The result shows the model mixing two techniques not only reduces the complexity of the neural network model but also significantly improves the classification accuracy than when neural network and heuristic model are used separately.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.383-390
• /
• 2004

This paper propose a method that controls facial expression of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. And we setup its system. The space of expression is created from about 2400 frames consist of motion captured data of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. But this space is not such a space where one state can go to another state via the straight trajectory between them. We derive trajectories between two states from the captured set of expressions in an approximate manner. First, two states are regarded adjacent if the distance between their distance matrices is below a given threshold. Any two states are considered to have a trajectory between them If there is a sequence of adjacent states between them. It is assumed . that one states goes to another state via the shortest trajectory between them. The shortest trajectories are found by dynamic programming. The space of facial expressions, as the set of distance matrices, is multidimensional. Facial expression of 3D avatar Is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the multidimensional scaling(MDS). To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. As a result of that, users estimate that system is very useful to control facial expression of 3D avatar in real-time.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• Journal of Science Education
• /
• v.33 no.1
• /
• pp.111-121
• /
• 2009

The purpose of this research is to survey elementary pre-service teachers' in understand the legal Units, focusing on seven basic unit such a 'm', 'm2', 'L', 'kg', 'K', 'cd', 's'. This study specifically investigates whether the students understand the legal units. The subjects were 1096 students from the University of Education in Jinju, Gyeongnam. Data was collected through a questionnaire which was designed by this research and checked by authority, and the frequency and percentage of responses to each question were obtained and analysed. The survey was the legal units on interesting, using the experience of confusing and understanding of elementary pre-service teachers. The Korea Government is regulating using traditional measures such as 'pyeong' or 'don' in commercial transactions change to adopt the metric system for as a subsidiary the first of July, 2007. The interesting of the legal units dose not exceed a positive answer to the question 52.1%. Their were answered that the experience of the confused of 60.1% in the life. How to do efforts for the settle down of the legal units that answered broadcasting>in class>a campaign>study and training by an academic year in oder. Findings show regardless of academic year, gender and from the department of liberal arts or the science department all the students knew very well that 'm' '$m^2$', 'L', 'kg' are included in the legal units, compared to the others low percentage of 'K', 'cd' and 's' the legal units. In case of time(s), women has correct answered 2.7 times than man. In case of academic year, except for the third-year students was not to exceed 50%. In case of from the department of liberal arts or the science department contrary to one's expectations increase of 50% or more correct answer while half the students scored in science. The elementary pre-service teachers are seems to thinking separate the legal units with their in university life. Also elementary pre-service teachers are the lack of interest on society. Their should be for settle down of the legal units through learning to class in university, newspapers, strengthen publicity activities of broadcast media's further more by maintenance efforts of the government.

• Journal of Korea Technology Innovation Society
• /
• v.12 no.4
• /
• pp.687-714
• /
• 2009

In this paper, we study empirically the relations between financial constraints and dividend adjustment speed of innovative small and medium sized enterprises (SMEs) listed on Kosdaq Market of Korea Exchange. The main results of this study can be summarized as follows. Determinants suggested by the major theories of dividends, namely, residual dividend theory, dividend signaling theory, agency theory, catering theory, and transactions cost theory explain significantly the dividend payout policy of Kosdaq SMEs. Lintner's dividend adjustment model indicates that Kosdaq SMEs have long run target payout ratio, and that Kosdaq SMEs adjust partially the gap between actual and target payout ratio each year. In the core variables of Lintner (1956) dividend adjustment model, past DPS has more effect than current EPS. These results suggest that Kosdaq SMEs maintain stable dividend policy which maintain past DPS level without corporate special reasons. Dividend adjustment speed of innovative Kosdaq SMEs is more fast than that of uninnovative Kosdaq SMEs, and dividend adjustment speed of financial unconstrained innovative Kosdaq SMEs is faster than that of financial constrained innovative Kosdaq SMEs. Futhermore, dividend adjustment speed of innovative Kosdaq SMEs classified by Small and Medium Business Administration is faster than that of unclassified innovative Kosdaq SMEs. The former is linked with financial policies and services like credit guaranteed service, venture investment fund, insurance program, and so on. In conclusion, past DPS and current EPS suggested by the Lintner's dividend adjustment model explain mainly dividend adjustment speed, and financial constraints explain also partially. Therefore, if managers of innovative Kosdaq SMEs can properly understand of the effects of financial constraints on dividend smoothing, they can maintain constantly dividend policy. This is encouraging result for Korea government as it has implemented many policies to commit to innovative Kosdaq SMEs.