• Management & Information Systems Review
• /
• v.34 no.3
• /
• pp.125-140
• /
• 2015

KOSDAQ market reorganized their division system from two types to four types of division departments such as blue chip, venture, medium, and technology development departments in 2011. However, under the current new division system, financially unhealthy firms attempting to take advantage of the classifying opportunity of blue chip department are likely to engage in pernicious earnings management. The objective of this study is to investigate the earnings management behavior surrounding the time of KOSDAQ firms entering the blue chip department via new division system. More specifically, we test whether the firms classified blue chip department tend to engage in upward earnings management using accruals and real activities before and after they achieve blue chip status. In this study, we analyzed 111 firms classified blue chip department in 2011 according to new division system in KOSDAQ market. Major test results indicate that firms entering the blue chip department according to current KOSDAQ division system in general, tend to inflate reported earnings by means both of accruals and real activities right before the entering year. This result suggests that the firms classified blue chip department engage in opportunistic earnings management with a view to uplifting their market values. Our study is expected to provide clues useful for searching policy directions which intend to ameliorate adverse side effects of the current KOSDAQ division system. In sum, the regulatory authorities and enforcement bodies need to exercise caution in deliberating more stringent review procedures so that financially healthy and promising candidates are properly segregated from their poor and risky counterparts, thus enhancing the beneficial effects, while mitigating adverse side effects of the system.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.372-383
• /
• 2006

Among the approaches to image database management, content-based image retrieval (CBIR) is viewed as having the best support for effective searching and browsing of large digital image libraries. Typical CBIR systems allow a user to provide a query image, from which low-level features are extracted and used to find 'similar' images in a database. However, there exists the semantic gap between human visual perception and low-level representations. An effective methodology for overcoming this semantic gap involves relevance feedback to perform feature re-weighting. Current approaches to feature re-weighting require the number of components for a feature representation to be the same for every image in consideration. Following this assumption, they map each component to an axis in the n-dimensional space, which we call the metric space; likewise the feature representation is stored in a fixed-length vector. However, with the emergence of features that do not have a fixed number of components in their representation, existing feature re-weighting approaches are invalidated. In this paper we propose a feature re-weighting technique that supports features regardless of whether or not they can be mapped into a metric space. Our approach analyses the feature distances calculated between the query image and the images in the database. Two-sided confidence intervals are used with the distances to obtain the information for feature re-weighting. There is no restriction on how the distances are calculated for each feature. This provides freedom for how feature representations are structured, i.e. there is no requirement for features to be represented in fixed-length vectors or metric space. Our experimental results show the effectiveness of our approach and in a comparison with other work, we can see how it outperforms previous work.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.133-140
• /
• 2012

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.27-37
• /
• 2009

Sensor nodes forming a sensor network have limited energy capacity such as small batteries and when these nodes are placed in a specific field, it is important to research minimizing sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Clustering has been in the limelight as one of efficient techniques to reduce sensor nodes' energy consumption in sensor networks. However, energy saving results can vary greatly depending on election of cluster heads, the number and size of clusters and the distance among the sensor nodes. /This research has an aim to find the optimal set of clusters which can reduce sensor nodes' energy consumption. We use a Genetic Algorithm(GA), a stochastic search technique used in computing, to find optimal solutions. GA performs searching through evolution processes to find optimal clusters in terms of energy efficiency. Our results show that GA is more efficient than LEACH which is a clustering algorithm without evolution processes. The two-dimensional GA (2D-GA) proposed in this research can perform more efficient gene evolution than one-dimensional GA(1D-GA)by giving unique location information to each node existing in chromosomes. As a result, the 2D-GA can find rapidly and effectively optimal clusters to maximize lifetime of the sensor networks.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.30-39
• /
• 2009

Extraction of glomeruli region plays a very important role for diagnosing nephritis automatically. However, it is not easy to extract glomeruli region correctly because the difference between glomeruli region and other region is not obvious, simultaneously unevennesses that is brought in the sampling process and in the imaging process. In this study, a new method for extracting renal glomeruli region using genetic algorithm is proposed. The first, low and high resolution images are obtained by using Laplacian-Gaussian filter with ${\sigma}=2.1$ and ${\sigma}=1.8$, then, binary images by setting the threshold value to zero are obtained. And then border edge is detected from low resolution images, the border of glomeruli is expressed by a closed B-splines' curve line. The parameters that decide the closed curve line with this low resolution image prevent the noises and the border lines from breaking off in the middle by searching using genetic algorithm. Next, in order to obtain more precise border edges of glomeruli, the number of node points is increased and corrected in order from eight to sixteen and thirty two from high resolution images. Finally, the validity of this proposed method is shown to be effective by applying to the real images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.97-107
• /
• 2009

In image-based gait recognition systems, physical factors, such as the camera angle and the lens distortion, and environmental factors such as illumination determines the performance of recognition. In this paper we present a robust gait recognition method by compensating various types of image distortions. The proposed method is compared with existing gait recognition algorithm with consideration of both physical and environmental distortion factors in the input image. More specifically, we first present an efficient compensation algorithm of image distortion by using the projective transform, and test the feasibility of the proposed algorithm by comparing the recognition performances with and without the compensation process. Proposed method gives universal gait data which is invariant to both distance and environment. Gained data improved gait recognition rate about 41.5% in indoor image and about 55.5% in outdoor image. Proposed method can be used effectively in database(DB) construction, searching and tracking of specific objects.

• Journal of Korean Society of Archives and Records Management
• /
• v.20 no.1
• /
• pp.115-137
• /
• 2020

This study aims to examine the limitations of status that describe archives based on the Archival rules, and to propose a new method using the Records in Context - Conceptual model (RiC-CM) as a solution. Given this, the study conducted literature reviews and case studies. The solutions based on RiC-CM and its effects on the limitations of the existing environment are as follows. First, RiC-CM can describe multiple provenances about archives. This can be solved by defining individual records and provenances as "entity" and expressing their associations as relationships. The interrelation of entities alone can more accurately represent the information of provenances associated with a particular archive, making it easier to identify the overall context that makes records. Second, RiC-CM can link related files. Those that belong to a specific records group (fonds) can be resolved by assigning them to individual entities and making interrelation according to the context that makes records. This method makes it possible to serve information about the context that makes records. From the user's point of view, more options are available for searching records. Third, RiC-CM can link all relevant producer-made records related to a specific production organization. If organizations are related to each other, they can be defined as "entity," and their relationship can be expressed as "associated with." It helps to comprehensively examine the context of provenances. The findings of this study are expected to be used as a basis for future research on RiC-CM, in response to the paradigm shift for electronic records management systems.

• Journal of Korean Home Economics Education Association
• /
• v.30 no.1
• /
• pp.1-13
• /
• 2018

The purpose of this study is to investigate the improvement of career self-efficacy of middle school students through the fashion career educational program designed for Free-semester. For the purpose of this study, three middle schools were implemented and their effects were verified. First, the fashion career educational program was designed based on subordinate elements of career education: job information searching, self-understanding and exploration, career-planning, and problem-solving. The results of this study were as follows: First, the fashion career education program has positive effects on the improvement of career self-efficacy of middle school students. The positive experiences of accomplishment through task solving, the role experience of successful role model, the return of successful experience, and the positive interactions of teachers and friends that can be done in the future have brought positive changes to career self-efficacy. Second, this program has positive effects on the career self-efficacy sub-factors, which are career exploration efficacy, career decision making efficacy, and career-performing efficacy. As a result of practicing and exploring activities related to fashion, It seems to be due to the self - confidence of planning and preparing their own career through their self-understanding and exploration, collecting information of job, problem solving, career planning, etc.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.125-144
• /
• 2006

The development of mobile applications is fast in recent years. However, nearly all applications are for messaging, financial, locating services based on simple interactions with mobile users because of the limited screen size, narrow network bandwidth, and low computing power. Processing an algorithm for supporting a group decision process on mobile devices becomes impossible. In this paper, we introduce the mobile-oriented simple interactive procedure for support a group decision making process. The interactive procedure is developed for multiple objective linear programming problems to help the group select a compromising solution in the mobile Internet environment. Our procedure lessens the burden of group decision makers, which is one of necessary conditions of the mobile environment. Only the partial weak order preferences of variables and objectives from group decision makers are enough for searching the best compromising solution. The methodology is designed to avoid any assumption about the shape or existence of the decision makers' utility function. For the purpose of the experimental study of the procedure, we developed a group decision support system in the mobile Internet environment, MOBIGSS and applied to an allocation problem of investor assets.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.