• Journal of the Korean Institute of Landscape Architecture
• /
• v.40 no.6
• /
• pp.127-139
• /
• 2012

This study aims to figure out the main agent of management in the 69 recently constructed neighborhood parks in Busan, and to analyze the present status of the main agents. For this purpose, the work resources on park and landscape management, interview to related staff, and the budget on urban parks were found as the main agents of management. In case the parks were managed by consignment or by other separate organization, this study collected resources through the homepage or personal visits. As a result for the management method on parks, about 48 parks(69.6%) were under direct management by the local governments' main office and its business offices. Eighteen parks(26.1%) were commissioned to corporation or private organizations and three parks(4.3%) were operated by both direct and commissioned management. Because of the overall management result on urban parks, the company under outsourced management is not sufficient for a comprehensive management. Such is mainly focused on the maintenance like landscape or cleaning, but have fewer programs for the users. Forty-six parks cared by the local governments are mainly small sized neighborhood parks. For the management, contract workers or short-term workers are hired. It demonstrates an urgent need to improve professional personnel and organizational system for park management. In addition, any educational or cultural facility in the park is managed by separate institutions. Thus, it is not controlled as a park facility but an independent facility with separate controls. Moreover, to solve such problems, it needs legalization on the proper employment for parks, institutional improvement, cooperative network with NGO, planning and development of the program used according to the change of time, and customer oriented program management.

• The Korean Journal of Applied Statistics
• /
• v.26 no.5
• /
• pp.835-845
• /
• 2013

Travel-time is considered the most typical and preferred traffic information for intelligent transportation systems(ITS). This paper proposes a real-time travel-time prediction method for a national highway. In this paper, the K-nearest neighbor(KNN) method is used for travel time prediction. The KNN method (a nonparametric method) is appropriate for a real-time traffic management system because the method needs no additional assumptions or parameter calibration. The performances of various models are compared based on mean absolute percentage error(MAPE) and coefficient of variation(CV). In real application, the analysis of real traffic data collected from Korean national highways indicates that the proposed model outperforms other prediction models such as the historical average model and the Kalman filter model. It is expected to improve travel-time reliability by flexibly using travel-time from the proposed model with travel-time from the interval detectors.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.131-156
• /
• 1998

Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering Process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention on the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy (KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance. The KAH consists of two types of knowledge abstraction hierarchies. The value abstraction hierarchy is constructed by abstract values that are hierarchically derived from specific data values in the underlying database on the basis of generalization and specialization relationships. The domain abstraction hierarchy is built on the various domains of the data values and incorporates the classification relationship between super-domains and sub-domains. On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, database operations are discussed for both the generalization and specialization Processes, and the conceptual query handling. A prototype system has been implemented at KAIST that demonstrates the usefulness of KAH in ordinary database application systems.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.177-186
• /
• 2013

Recently, with the sudden changes in the security environment, expectations towards the police and fear towards safety are increasing. Thus, the local community police operation, which creates a mutually cooperative relationship between the police and local residents, is coming to the fore as the paradigm of the nationwide police operation. The police operation in Korea has also gone through change, and as part of the local community police operation, Korea has implemented a community police system since 2003. Recently, the system has been going through change in that the operations are centralizing around not only prevention of crime including the safe city program, protection of multicultural families, response to foreign crime, protection of the socially disadvantaged but also life security of the citizens. Along these lines, this study seeks to examine conditions of the three elements of local community police operation - Strategic Oriented Policing (SOP), Neighborhood Oriented Policing (NOP), Problem Oriented Policing (POP) - and policy suggestions accordingly.

• Journal of Periodontal and Implant Science
• /
• v.46 no.3
• /
• pp.207-217
• /
• 2016

Purpose: The aim of this study is to analyze and visualize the distribution of patients visiting the periodontology department at a dental college hospital, using a geographic information system (GIS) to utilize these data in patient care and treatment planning, which may help to assess the risk and prevent periodontal diseases. Methods: Basic patient information data were obtained from Dankook University Dental Hospital, including the unit number, gender, date of birth, and address, down to the dong (neighborhood) administrative district unit, of 306,656 patients who visited the hospital between 2007 and 2014. The data of only 26,457 patients who visited the periodontology department were included in this analysis. The patient distribution was visualized using GIS. Statistical analyses including multiple regression, logistic regression, and geographically weighted regression were performed using SAS 9.3 and ArcGIS 10.1. Five factors, namely proximity, accessibility, age, gender, and socioeconomic status, were investigated as the explanatory variables of the patient distribution. Results: The visualized patient data showed a nationwide scale of the patient distribution. The mean distance from each patient's regional center to the hospital was $30.94{\pm}29.62km$ and was inversely proportional to the number of patients from the respective regions. The distance from a regional center to the adjacent toll gate had various effects depending on the local distance from the hospital. The average age of the patients was $52.41{\pm}12.97years$. Further, a majority of regions showed a male dominance. Personal income had inconsistent results between analyses. Conclusions: The distribution of patients is significantly affected by the proximity, accessibility, age, gender and socioeconomic status of patients, and the patients visiting the periodontology department travelled farther distances than those visiting the other departments. The underlying reason for this needs to be analyzed further.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1477-1486
• /
• 2012

In this paper, we propose Multi-view CGH Making System using method of generation of virtual view-point depth image. We acquire reliable depth image using TOF depth camera. We extract parameters of reference-view cameras. Once the position of camera of virtual view-point is defined, select optimal reference-view cameras considering position of it and distance between it and virtual view-point camera. Setting a reference-view camera whose position is reverse of primary reference-view camera as sub reference-view, we generate depth image of virtual view-point. And we compensate occlusion boundaries of virtual view-point depth image using depth image of sub reference-view. In this step, remaining hole boundaries are compensated with minimum values of neighborhood. And then, we generate final depth image of virtual view-point. Finally, using result of depth image from these steps, we generate CGH. The experimental results show that the proposed algorithm performs much better than conventional algorithms.

• Journal of Biosystems Engineering
• /
• v.27 no.5
• /
• pp.433-450
• /
• 2002

The daily food intake for dairy cows has to be effectively controlled to breed a sound group of cows as well as to enhance the productivity of the cows. But, feed stuffs are fed in the common bulk for a group of cows in most cases despite that the individual food intake has to be varied. To obtain the feed for each cow, both the nutrient requirements and the nutrient composition of fred have to be provided in advance, which are based on the status of cows such as weigh marginal weight amount of milk, fat concentration in milk, growth and milking stages, and rough feed ratio, etc. Then, the mixed ration fur diet would be computed by the nutrient requirements constraints. However, when TMR (Total Mixed Ration) is conventionally supplied for a group of cows, it is almost impossible to get an optimal feed mixed ration meeting the nutrient requirements of each individual cow since the constraints are usually conflicting and over-constrained although they are linear. Hence, addressed in this paper is a simulated annealing (SA) technique to find the food intake for dairy cows, considering the characteristics of individual or grouped cows. Appropriate parameters fur the successful working of SA are determined through preliminary experiments. The parameters include initial temperature, epoch length. cooling scheduling, and stopping criteria. In addition, a neighborhood solution generation method for the effective improvement of solutions is presented. Experimental results show that the final solution for the mixture of feed fits the rough feed ratio and some other nutrient requirements such as rough fiber, acid detergent fiber, and neutral detergent fiber, with 100 percent, while fulfilling net energy for lactating, metabolic energy, total digestible nutrients, crude protein, and undegraded intake protein within average five percent.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1676-1689
• /
• 2014

At present, the Content-Based Image Retrieval (CBIR) system has become a hot research topic in the computer vision field. In the CBIR system, the accurate extractions of low-level features can reduce the gaps between high-level semantics and improve retrieval precision. This paper puts forward a new retrieval method aiming at the problems of high computational complexities and low precision of global feature extraction algorithms. The establishment of the new retrieval method is on the basis of the SIFT and Harris (APISH) algorithm, and the salient region of interest points (SRIP) algorithm to satisfy users' interests in the specific targets of images. In the first place, by using the IPDSH and SRIP algorithms, we tested stable interest points and found salient regions. The interest points in the salient region were named as salient interest points. Secondary, we extracted the pseudo-Zernike moments of the salient interest points' neighborhood as the feature vectors. Finally, we calculated the similarities between query and database images. Finally, We conducted this experiment based on the Caltech-101 database. By studying the experiment, the results have shown that this new retrieval method can decrease the interference of unstable interest points in the regions of non-interests and improve the ratios of accuracy and recall.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.211-217
• /
• 2006

The learning control develops controllers that learn to improve their performance at executing a given task, based on experience performing this specific task. In a previous work, the authors presented an iterative precision of linear decentralized learning control based on p-integrated learning method for the vertical dynamic multiple systems. This paper develops an indirect decentralized learning control based on adaptive control method. The original motivation of the teaming control field was teaming in robots doing repetitive tasks such as on an assembly line. This paper starts with decentralized discrete time systems, and progresses to the robot application, modeling the robot as a time varying linear system in the neighborhood of the nominal trajectory, and using the usual robot controllers that are decentralized, treating each link as if it is independent of any coupling with other links. Error wave propagation method will show up in the numerical simulation for five-bar linkage as a vertical dynamic robot. The methods of learning system are shown up for the iterative precision of each link at each time step in repetition domain. Those can be helped to apply to the vertical multiple dynamic systems for precision quality assurance in the industrial robots and medical equipments.

• Journal of Digital Convergence
• /
• v.15 no.12
• /
• pp.293-301
• /
• 2017

Most new products not only suddenly disappear in the market but also quickly cannibalize older products. Under such a circumstance, retailers may have too much stock, and customers may be faced with difficulties discovering products suitable to their preferences among short life cycle products. To address these problems, recommender systems are good solutions. However, most previous recommender systems had difficulty in reflecting changes in customer preferences because the systems employ static customer preferences. In this paper, we propose a recommendation methodology that considers dynamic customer preferences. The proposed methodology consists of dynamic customer profile creation, neighborhood formation, and recommendation list generation. For the experiments, we employ a mobile image transaction dataset that has a short product life cycle. Our experimental results demonstrate that the proposed methodology has a higher quality of recommendation than a typical collaborative filtering-based system. From these results, we conclude that the proposed methodology is effective under conditions where most new products have short life cycles. The proposed methodology need to be verified in the physical environment at a future time.