• Title/Summary/Keyword: Too selection

Search Result 195, Processing Time 0.031 seconds

Automated Selection System of Examination Questions in Web-Based Instruction (웹기반교육에서의 자동 문제 출제 시스템)

  • Kim, Kyung-A;Choi, Eun-Man
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.301-310
    • /
    • 2002
  • Internet has been applied to the educational field such as data search, lecture by motion picture, realtime examination. Most questions made for these remote examinations use methods of making questions randomly using fixed questions or item pools. The designed system in this paper makes questions without knowing MARK-UP language and after undergoing examinations on Web. Also it readjusts degree of difficulty automatically on the basis of the rate of correct answers. In addition, this enables learners to perform feedback learning after examinations and subsequently learners themselves to adjust their degree of difficulty and undergo reexaminations. The automatic selection system makes it easy to select questions, possible to expect average marks and number of questions made, and to prevent that questions may be made too easy or too hard. For a remote examination, as there are much possibilities of dishonesty such as examination by proxy so different types of problems are made, and problems of the rationality caused from that can be avoided.

Self-terminated carbonation model as an useful support for durable concrete structure designing

  • Woyciechowski, Piotr P.;Sokolowska, Joanna J.
    • Structural Engineering and Mechanics
    • /
    • v.63 no.1
    • /
    • pp.55-64
    • /
    • 2017
  • The paper concerns concrete carbonation, the phenomena that occurs in every type of climate, especially in urban-industrial areas. In European Standards, including Eurocode (EC) for concrete structures the demanded durability of construction located in the conditions of the carbonation threat is mainly assured by the selection of suitable thickness of reinforcement cover. According to EC0 and EC2, the thickness of the cover in the particular class of exposure depends on the structural class/category and concrete compressive strength class which is determined by cement content and water-cement ratio (thus the quantitative composition) but it is not differentiated for various cements, nor additives (i.e., qualitative composition), nor technological types of concrete. As a consequence the selected thickness of concrete cover is in fact a far estimation - sometimes too exaggerated (too safe or too risky). The paper presents the elaborated "self-terminated carbonation model" that includes abovementioned factors and enables to indicate the maximal possible depth of carbonation. This is possible because presented model is a hyperbolic function of carbonation depth in time (the other models published in the literature use the parabolic function that theoretically assume the infinite increase of carbonation depth value). The paper discusses the presented model in comparison to other models published in the literature, moreover it contains the algorithm of concrete cover design with use of the model as well as an example of calculation of the cover thickness.

IRIS Task Scheduling Algorithm Based on Task Selection Policies (태스크 선택정책에 기반을 둔 IRIS 태스크 스케줄링 알고리즘)

  • Shim, Jae-Hong;Choi, Kyung-Hee;Jung, Gi-Hyun
    • The KIPS Transactions:PartA
    • /
    • v.10A no.3
    • /
    • pp.181-188
    • /
    • 2003
  • We propose a heuristic on-line scheduling algorithm for the IRIS (Increasing Reward with Increasing Service) tasks, which has low computation complexity and produces total reward approximated to that of previous on-line optimal algorithms. The previous on-line optimal algorithms for IRIS tasks perform scheduling on all tasks in a system to maximize total reward. Therefore, the complexities of these algorithms are too high to apply them to practical systems handling many tasks. The proposed algorithm doesn´t perform scheduling on all tasks in a system, but on (constant) W´s tasks selected by a predefined task selection policy. The proposed algorithm is based on task selection policies that define how to select tasks to be scheduled. We suggest two simple and intuitive selection policies and a generalized selection policy that integrates previous two selection policies. By narrowing down scheduling scope to only W´s selected tasks, the computation complexity of proposed algorithm can be reduced to O(Wn). However, simulation results for various cases show that it is closed to O(W) on the average.

An Applied Study of the AHP on the Selection of Nonmemory Semiconductor Chip (AHP를 이용한 비메모리 반도체칩 제품군 선정에 관한 연구)

  • 권철신;조근태
    • Korean Management Science Review
    • /
    • v.18 no.1
    • /
    • pp.1-13
    • /
    • 2001
  • Despite that the semiconductor industry plays an important role to our economy, it has abnormal industrial structure stressing too much on memory chips. Thus, it is essential for our corporate to develop nonmemory chips to obtain technological leadership in a highly competitive semiconductor market. In this study, we demonstrate how benefit/cost analysis using the Analytic Hierarchy process (AHP) can be used for the proper selection of nonmemory semiconductor chips: Microprocessor, ASIC, digital IC and Analogue IC. The final results show that ASIC is the most attractive chip to develop, followed by Analogue IC, digital IC and Microprocessor. This is Somewhat consistent with the information that we found with respect to the elements that were taken into consideration. Sensitivity analysis is also provided here.

  • PDF

An Algorithm for Portfolio Selection Model

  • Kim, Yong-Chan;Shin, Ki-Young;Kim, Jong-Soo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.65-68
    • /
    • 2000
  • The problem of selecting a portfolio is to find Un investment plan that achieves a desired return while minimizing the risk involved. One stream of algorithms are based upon mixed integer linear programming models and guarantee an integer optimal solution. But these algorithms require too much time to apply to real problems. Another stream of algorithms are fur a near optimal solution and are fast enough. But, these also have a weakness in that the solution generated can't be guaranteed to be integer values. Since it is not a trivial job to tansform the scullion into integer valued one simutaneously maintaining the quality of the solution, they are not easy to apply to real world portfolio selection. To tackle the problem more efficiently, we propose an algorithm which generates a very good integer solution in reasonable amount of time. The algorithm is tested using Korean stock market data to verify its accuracy and efficiency.

  • PDF

Application of genotyping-by-sequencing (GBS) in plant genome using bioinformatics pipeline

  • Lee, Yun Gyeong;Kang, Chon-Sik;Kim, Changsoo
    • Proceedings of the Korean Society of Crop Science Conference
    • /
    • 2017.06a
    • /
    • pp.58-58
    • /
    • 2017
  • The advent of next generation sequencing technology has elicited plenty of sequencing data available in agriculturally relevant plant species. For most crop species, it is too expensive to obtain the whole genome sequence data with sufficient coverage. Thus, many approaches have been developed to bring down the cost of NGS. Genotyping-by-sequencing (GBS) is a cost-effective genotyping method for complex genetic populations. GBS can be used for the analysis of genomic selection (GS), genome-wide association study (GWAS) and constructing haplotype and genetic linkage maps in a variety of plant species. For efficiently dealing with plant GBS data, the TASSEL-GBS pipeline is one of the most popular choices for many researchers. TASSEL-GBS is JAVA based a software package to obtain genotyping data from raw GBS sequences. Here, we describe application of GBS and bioinformatics pipeline of TASSEL-GBS for analyzing plant genetics data.

  • PDF

Are Professors Good Selector\ulcorner -The Case of Professors of English Literature at the Pusan National University- (교수는 적합한 선정자인가 -부산대학교 영문한 전공자를 중심으로-)

  • 김정근;구영미
    • Journal of Korean Library and Information Science Society
    • /
    • v.32 no.1
    • /
    • pp.151-170
    • /
    • 2001
  • The university library is supposed to build its collection in an organized and controlled manner to achieve its one goals for information services, and the book selection is an essential element of librarianship to support the university process of research and education effectively. This study focuses on the faculty influence on the book selection process of the university library. the researcher concludes that too much hegemony in the hands of professors is not appropriate and at least part of it should be handed over to librarians.

  • PDF

Optimal Design of Torque Motor using an Improved Niching Genetic Algorithm (개선된 니칭 유전 알고리즘을 이용한 토크모터의 최적설계)

  • Kim, Jae-Kwang;Cho, Dong-Hyeok;Jung, Hyun-Kyo;Lee, Cheol-Gyun
    • The Transactions of the Korean Institute of Electrical Engineers B
    • /
    • v.50 no.7
    • /
    • pp.323-330
    • /
    • 2001
  • Niching method enables the genetic algorithm(GA) to be applied to the problems that require the location of multiple solutions in the search space, but these methods have fatal disadvantages. The main disadvantage is that the method requires too much calculation of object function. In this paper, a niching method using restricted competition selection(RCS) combined with a pattern search method(PSM) is proposed to identify multiple niches more efficiently and fast in a multimodal domain. The validity of the proposed method is verified by the simulation of test functions and the optimal design of an torque motor.

  • PDF

A Study On The Methods Of Signal Processing For High Impedance Fault Detection (고저항 지락사고 검출을 위한 신호처리 방법에 관한 연구)

  • Lee, Sung-Hwan;Woo, Chun-Hee;Kang, Sin-Jun;Woo, Kwang-Bang;Lee, Jin;Kim, Sang-Chul
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.156-158
    • /
    • 1993
  • This paper presents several techniques of power spectrum estimation for high impedance fault detection. High impedance faults are those faults with current too low to be reliably cleared by conventional overcurrent protection. So power spectrum estimation is required. AR and MA techniques require optimal order for good performance of power spectrum estimation because these techniques are unstable for order selection. ARMA and Extended techniches are stable for order selection and have very sharp response. So ARMA and Extended Prony techniques are suitable for our purpose.

  • PDF

A Feature Selection Technique for an Efficient Document Automatic Classification (효율적인 문서 자동 분류를 위한 대표 색인어 추출 기법)

  • 김지숙;김영지;문현정;우용태
    • The Journal of Information Technology and Database
    • /
    • v.8 no.1
    • /
    • pp.117-128
    • /
    • 2001
  • Recently there are many researches of text mining to find interesting patterns or association rules from mass textual documents. However, the words extracted from informal documents are tend to be irregular and there are too many general words, so if we use pre-exist method, we would have difficulty in retrieving knowledge information effectively. In this paper, we propose a new feature extraction method to classify mass documents using association rule based on unsupervised learning technique. In experiment, we show the efficiency of suggested method by extracting features and classifying of documents.

  • PDF