• Title/Summary/Keyword: good list

Search Result 176, Processing Time 0.028 seconds

An Application of Idea Generation Methods to Kano Quality Model (Kano 품질분석을 위한 아이디어 발상법 적용에 관한 역구)

  • Kim, Tai-Young;Park, Young-Taek
    • Journal of Korean Society for Quality Management
    • /
    • v.39 no.2
    • /
    • pp.305-312
    • /
    • 2011
  • Kano model has been widely used to identify and classify customer attributes of a product or a service. The first step of Kano model application is the derivation of customer attributes, and brainstorming has been used conventionally for the purpose. A typical advantage of brainstorming is to get many ideas in a relatively short period, but the practicability of the derived ideas are known to be not so good. The derivation of good and practical ideas is important for the successful use of Kano model. Wish list, bug list and forced connection method as well as brainstorming were applied to PMP(Portable Multimedia Player) in order to derive customer attributes. To compare the idea generation methods, the derived attributes are classified and compared using Kano model.

Application of Idea Generation Methods to Kano Quality Model (Kano 품질분석을 위한 아이디어 발상법 적용에 관한 연구)

  • Kim, Tai-Young;Park, Young-Taek
    • Proceedings of the Korean Society for Quality Management Conference
    • /
    • 2010.04a
    • /
    • pp.283-290
    • /
    • 2010
  • This paper suggest that the derivation of good and practical ideas is important for the successful use of Kano model. Wish List, Bug List and Forced Connection Method as well as Brainstorming were applied to PMP(Portable Multimedia Player) in order to derive customer attributes. Wish List and Bug List are variants of Brainstorming, which are contrary to each other. Forced Connection Method is designed to bring about bisociation which is a typical characteristic of creative thinking.

  • PDF

A Real-time Dynamic Storage Allocation Algorithm Supporting Various Allocation Policies (다양한 할당 정책을 지원하는 실시간 동적 메모리 할당 알고리즘)

  • 정성무
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.10B
    • /
    • pp.1648-1664
    • /
    • 2000
  • This paper proposes a real-time dynamic storage allocation algorithm QSHF(quick-segregated-half-fit) that provides various memory allocation policies. that manages a free block list per each word size for memory requests of small size good(segregated)-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per proper range size for medium size requests and half-fit policy that manages a free list per each power of 2 size for large size requests. The proposed algorithm has the time complexit O(1) and makes us able to easily estimate the worst case execution time(WCET). This paper also suggests two algorithm that finds the proper free list for the requested memory size in predictable time and if the found list is empty then finds next available non-empty free list in fixed time. In order to confirm efficiency of the proposed algorithm we simulated the memory utilization of each memory allocation policy. The simulation result showed that each policy guarantees the constant WCET regardless of memory size but they have trade-off between memory utilization and list management overhead.

  • PDF

A study on the list of must books in middle schools (중고등학교 필독도서목록에 관한 연구)

  • 변우열
    • Journal of Korean Library and Information Science Society
    • /
    • v.24
    • /
    • pp.243-274
    • /
    • 1996
  • The purpose of this study is to investigate the necessity, selection, organization and management of Must Books List in middle schools. A great book can change a person's life and future. Especially, reading in the juvenile period is important because of their intellectual curiosity and sensitivity. The results of the study were as follows: 1. The necessity of Must Books can be considered in two perspectives : One is the cultivation of emotion and sense of value and the other is the development of information abilities. 2. The general criteria for the selection of Must Books are whether a book is su n.0, pportive of learning activities, of extracurricular activities, and of activities for school festivals. And whether a book is contributing to the building of good characters of students or not should be considered, too. 3. The special attention should be given to such matters as the organizational and distributional ratio among subjects of the Must Books, the degree of difficulties, the ratio of books for both male and female students, the ratio of foreign books to domestics, the possibilities of further reading and the bibliographical matters. 4. The points to be duly considered for the management of Must Books List are the educational considerations, clearness of objectives, the elimination of commercialism and authoritarianism in the book selection. The Must Books List should be managed autonomously, depending on the characteristics of each school and be updated annually. However, the most important thing is that the teacher should be a good reader himself. 5. It is better to include short stories than the long one in the Must Book List. Students should be guided to read explanatory text first and then to move to the original text. And they should be exposed to books in various subjects and not to be too dependent on the Must Books List. They should be able to develop the problem solving ability through the reading of the Must Books. 6. Finally, the Must Books selection committee should be composed of both teacher librarian and subject teachers. It is desirable that books for the cultivation of emotion, for the establishment of sense of value, and for the development of information ability should be selected by consulting the various reading lists compiled by the Ministry of Education, the Board of Local Education and other authorities concerned.

  • PDF

The Design and Implementation of System for Blocking the Harmful Information on Client/server Environment (클라이언트/서버 환경에서 유해정보차단을 위한 시스템의 설계 및 구현)

  • 염태영
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.10
    • /
    • pp.571-580
    • /
    • 2003
  • A intercepting program of Black List Filtering System is widely used for blocking the harmful information in the internet. Hut The Black List Filtering System give rise to reduce the performance of Client PC. In this thesis the author proposes the good way to solve a problem of the Black List Filtering System. Keep to the point that is puting the black List into The Black List Serve on Client/server Environment and building Black List into Client PC in use of revisiting pattern of web-user. The best effect that tried to Solve the problem in the experiment concerning the thesis is presented not only to maintain the performance of Client PC, but also to improve the speed of performance of Client PC.

  • PDF

A Study of the List for CM Product Measure Check-List through 4 Way View;Focusing on Owner, CMr, Designer, Constructor (4자관점을 통한 CM의 성과측정 체크리스트 항목에 관한 연구)

  • Ahn, Eun-Jin;Kim, Ju-Hyung;Lee, Yoon-Sun;Kim, Jae-Jun
    • Proceedings of the Korean Institute Of Construction Engineering and Management
    • /
    • 2007.11a
    • /
    • pp.509-512
    • /
    • 2007
  • In Domestic, the beginning of CM system was at December 1996 by 'Construction Industry fundamental law'. Today the needs of CM is more and more during 10 years. Although the time of CM's induction and high-quality human resources are insufficiency, various studies and developments's level through theoritical base and academic level is good which are compared by developed countries's. But still now the effort of CM product measure part, especially public sector is not enough. Besides, the existing check-list is for project owner so it needs to make up for balanced view as organized 4way-view of owner, CMr, designer, constructor. On this study, produce the list of check-list and then weight of each list by view of owner, CMr, designer, constructor. The completec check-list will be useful for CM product measure objectively .

  • PDF

Applying a modified AUC to gene ranking

  • Yu, Wenbao;Chang, Yuan-Chin Ivan;Park, Eunsik
    • Communications for Statistical Applications and Methods
    • /
    • v.25 no.3
    • /
    • pp.307-319
    • /
    • 2018
  • High-throughput technologies enable the simultaneous evaluation of thousands of genes that could discriminate different subclasses of complex diseases. Ranking genes according to differential expression is an important screening step for follow-up analysis. Many statistical measures have been proposed for this purpose. A good ranked list should provide a stable rank (at least for top-ranked gene), and the top ranked genes should have a high power in differentiating different disease status. However, there is a lack of emphasis in the literature on ranking genes based on these two criteria simultaneously. To achieve the above two criteria simultaneously, we proposed to apply a previously reported metric, the modified area under the receiver operating characteristic cure, to gene ranking. The proposed ranking method is found to be promising in leading to a stable ranking list and good prediction performances of top ranked genes. The findings are illustrated through studies on both synthesized data and real microarray gene expression data. The proposed method is recommended for ranking genes or other biomarkers for high-dimensional omics studies.

Economic Design of Tree Network Using Tabu List Coupled Genetic Algorithms (타부 리스트가 결합된 유전자 알고리즘을 이용한 트리형 네트워크의 경제적 설계)

  • Lee, Seong-Hwan;Lee, Han-Jin;Yum, Chang-Sun
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.1
    • /
    • pp.10-15
    • /
    • 2012
  • This paper considers an economic design problem of a tree-based network which is a kind of computer network. This problem can be modeling to be an objective function to minimize installation costs, on the constraints of spanning tree and maximum traffic capacity of sub tree. This problem is known to be NP-hard. To efficiently solve the problem, a tabu list coupled genetic algorithm approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic algorithm approach.

A Study on the rail-transport operation control for railway embankment under rainfall (강우시 철도성토사면의 열차운전규제기준에 관한 연구)

  • 김현기;박영곤;신민호;김수삼
    • Proceedings of the KSR Conference
    • /
    • 2001.10a
    • /
    • pp.514-519
    • /
    • 2001
  • There are a close relationship between natural disasters and train safety. So it is very important to guaranty train safety using reasonable rail-transport operation control against disasters. Therefore, based on the past record of rainfall at failure, rail-transport operation control for railway embankment under rainfall was set up. After slope check list at home and abroad had been analyzed, new slope check list was suggested and site investigations were carried out using this check list. In order to evaluate the stability of railway slopes under rainfall, explanatory variables and subordinate variables were selected for multi-variate analysis and critical rainfall was defined by statistical process. Rail-transport operation control including regional and geological properties was suggested by analyzing the critical rainfall and rail-transport operation control in other country, and this will be a good tool to control train speed under rainfall and to secure train safety.

  • PDF

List Schedulin on WDM Optical Interconnection Networks using Genetic Algorithms (유전자 알고리즘을 이용한 광상호 연결망에서 파장분할다중방식의 리스트 스케쥴링)

  • Jung, Hea-Jin;Wee, Kyu-Bum;Yeh, Hong-Jin;Hong, Man-Pyo;Byeon, Kwang-June
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.9
    • /
    • pp.2302-2311
    • /
    • 1998
  • The problem of scheduling general packet traffic on WDM optical interconnection networks is NP-complete, It is known that the list scheduling is a good approximation algurithm fur this problem, The resulting list schedules vary depending on the order of transmitters considered to be placed on each time slot We propose an improvement of the list scheduling that tries different orders of transmitters to obtain shorter schedule lengths, Genetic algorithms are used to explore various orders of transmitters.

  • PDF