• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.3
• /
• pp.341-346
• /
• 2012

In rehabilitation where ultrasonographic diagnosis is not popular, it could be subjective by medical expert's experience. Thus, it is necessary to develop an objective automative procedure in ultrasonic image analysis. A disadvantage of existing automative analytic procedure in musculoskeletal system is to designate an incorrect muscle area when the figure of fascia is vague. In this study, we propose a new procedure to extract more accurate muscle area in abdomen ultrasonic image for that purpose. After removing unnecessary noise from input image, we apply End-in Search algorithm to enhance the contrast between fascia and muscle area. Then after extracting initial muscle area by Up-Down search, we trace the fascia area with a mask based on morphological and directional information. By this tracing of mask movements, we can emphasize the fascia area to extract more accurate muscle area in result. This new procedure is proven to be more effective than existing methods in experiment using convex ultrasound images that are used in real world rehabilitation diagnosis.

• Asia pacific journal of information systems
• /
• v.12 no.4
• /
• pp.21-36
• /
• 2002

This study empirically examined the effects of data warehousing methodology on the success of data warehousing. Research model and two hypotheses were set up to identify the relationships among two types of data warehousing methodology(top-down/bottom-up, dw configuration) and success based on the investigations of such theories as data warehousing, data warehousing methodology, IS success and so forth. And the survey instrument(questionnaire) was developed to collect data. Ultimately 183 questionnaires from 61 korean firms were collected. Findings showed that two types of data warehousing methodology affect significant effect on the success of data warehousing.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.207-215
• /
• 2011

Due to the increasing availability and popularity of digital television (DTV), the numbers of TV channels and programs that can be selected by consumers are also increasing rapidly. Therefore, searching for interesting channels and program via remote controls or channel guide maps can be frustrating and slow. In this paper, in order to better satisfy consumers, we propose a dynamic channel surfing scheme that reduces the channel seek distance in DTV. The proposed scheme dynamically rearranges the channel sequences according to the channel currently being watched to reduce the channel seek distance. The results of a simulation experiment demonstrate that the proposed dynamic channel surfing scheme reduces the channel seek distance for DTV channel navigation when up-down channel selection interfaces are used.

• Journal of Digital Convergence
• /
• v.15 no.6
• /
• pp.107-119
• /
• 2017

This article explores early childhood teachers' practices from bottom-up perspectives on the relationship between theory and practice. Results of the review of literature are as follows: 1) From top-down perspectives early childhood teachers' practices and their classroom behaviors have been traditionally defined within the framework of theories of child development, the notion of developmentally appropriate practice, and designed program models; 2) From bottom-up perspectives researchers have a focus on how teachers' practices lead theories and how they construct the act of teaching through reflective thinking; 3) empirical research on preservice and inservice teachers demonstrates that preservice teachers develop their own theories of teaching from their previously held assumptions, gained knowledge from preparation programs, and their individual experiences. It also shows that inservice teachers construct teaching through their implicit knowledge and the use of strategies to negotiate problems. Implications for future studies on teachers's practices are discussed.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.645-653
• /
• 2002

The unit commitment problem in a power system involves determining the start-up and shut-down schedules of many dynamos for a day or a week while satisfying the power demands and diverse constraints of the individual units in the system. It is very difficult to derive an economically optimal schedule due to its huge search space when the number of dynamos involved is large. Tabu search is a popular solution method used for various optimization problems because it is equipped with effective means of searching beyond local optima and also it can naturally incorporate and exploit domain knowledge specific to the target problem. When given a large-scaled problem with a number of complicated constraints, however, tabu search cannot easily find a good solution within a reasonable time. This paper shows that a large- scaled optimization problem such as the unit commitment problem can be solved efficiently by using a parallel tabu search. The parallel tabu search not only reduces the search time significantly but also finds a solution of better quality.

• Science of Emotion and Sensibility
• /
• v.6 no.1
• /
• pp.55-62
• /
• 2003

This study was an exploratory approach to the cognitive model of textile designers on the stage of motif development in textile design process. Prior to the main research, several previous studies adopting methods of video/audio protocol analysis were reviewed. On the basis of the review, the categories of design action were derived as an analysis frame by application of top-down access method, meanwhile the sub-groups of each category of design action were identified through a bottom-up access method. To summarize the research result, total three categories of textile design action appeared based on the theory of ‘Human processor’ model : ‘motor action’, ‘perceptual action’ and 'cognitive action'. In next, a new coding scheme suitably explaining these three categories of fertile design action was developed. Finally, a cognitive model of textile designer on the stage of motif development, employing the new coding scheme, was suggested in this study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.147-156
• /
• 2011

With the increasing utility of the recent information system, the methods to pick up necessary products rapidly by using a lot of data has been studied. Association rule search methods to find hidden patterns has been drawing much attention, and the Apriori algorithm is a major method. However, the Apriori algorithm increases search time due to its repeated scans. This paper proposes an algorithm to reduce searching time of frequent items. The proposed algorithm creates matrix using transaction database and search for frequent items using the mean number of items of transactions at matrix and a defined minimum support. The mean number of items of transactions is used to reduce the number of transactions, and the minimum support to cut down on items. The performance of the proposed algorithm is assessed by the comparison of search time and precision with existing algorithms. The findings from this study indicated that the proposed algorithm has been searched more quickly and efficiently when extracting final frequent items, compared to existing Apriori and Matrix algorithm.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.606-619
• /
• 2001

This paper presents an efficient algorithm to compute difference between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms some document tree into another The proposed algorithm is based on hybridization of bottom-up and top-down methods: matching relationships between nodes in the two versions are producted in a bottom-up manner and top-down breadth -first search computes an edit script. Because the algorithm does not need to investigate possible existence of matchings for all nodes, faster matching can be achieved . Furthermore, it can detect more structurally meaningful changes such as subtree move and copy as well as simple changes to the node itself like insert, delete, and update.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.12
• /
• pp.61-70
• /
• 2005

In this paper, we propose an efficient global placement algorithm which is an enhanced version of Hybrid Placer$^{[25]}$, a standard cell placement tool, which uses a middle-down approach. Combining techniques used in the well-known partitioner hMETIS and the RBLS(Relaxation Based Local Search) in Hybrid Placer improves the quality of global placements. Partitioning techniques of hMETIS is applied in a top-down manner and RBLS is used in each level of the top-down hierarchy to improve the global placement. The proposed new approach resolves the problem that Hybrid Placer seriously depends on initial placements and it speeds up without deteriorating the placement quality. Experimental results prove that solutions generated by the proposed method on the MCNC benchmarks are comparable to those by FengShui which is a well known placement tool. Compared to the results of the original Hybrid Placer, new method is 5 times faster on average and shows improvement on bigger circuits.

• Journal of the Korea Convergence Society
• /
• v.12 no.6
• /
• pp.9-16
• /
• 2021

In the past, there have been various studies on predicting the stock market by machine learning techniques using stock price data and financial big data. As stock index ETFs that can be traded through HTS and MTS are created, research on predicting stock indices has recently attracted attention. In this paper, machine learning models for KOSPI's up and down predictions are implemented separately. These models are optimized through a grid search of their control parameters. In addition, a hybrid machine learning model that combines individual models is proposed to improve the precision and increase the ETF trading return. The performance of the predictiion models is evaluated by the accuracy and the precision that determines the ETF trading return. The accuracy and precision of the hybrid up prediction model are 72.1 % and 63.8 %, and those of the down prediction model are 79.8% and 64.3%. The precision of the hybrid down prediction model is improved by at least 14.3 % and at most 20.5 %. The hybrid up and down prediction models show an ETF trading return of 10.49%, and 25.91%, respectively. Trading inverse×2 and leverage ETF can increase the return by 1.5 to 2 times. Further research on a down prediction machine learning model is expected to increase the rate of return.