• Title/Summary/Keyword: Large classes

Search Result 476, Processing Time 0.023 seconds

Analysis of School Space for Students' Customized Classes: Focused on Vittra Telefonplan School in Sweden (학생 맞춤형 수업을 위한 학교 공간 분석: 스웨덴 비트라 텔레폰플랜(Vittra Telefonplan) 학교를 중심으로)

  • Shin, Jin-Su;Jo, Hyang-Mi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.10
    • /
    • pp.433-445
    • /
    • 2019
  • This study was designed to create an innovative Korean school space plan. This was done by performing an analysis of cases of student-tailored class operations and the composition of school space in Sweden's Vittra Telefonplan School. To this end, the research team analyzed prior studies, the Vittra school space and the student-tailored classes through an analysis of the literature, documents and video images. First, the OpenSpace was operating classes tailored to each student's academic growth and needs. Second, the open-space school space played a role as the space for student life. Third, the teacher played a role as an active guide and facilitator of students. Forth, the students' individual learning management team actively conducted coding classes by utilizing IT-based learning platforms. The implications of the Vittra School are as follows. When designing a new school, it is recommended to design a small school as small as possible, organize an open space according to the grade and not by the class, and operate the curriculum around the students' grade. When reorganizing existing schools, it is proposed that standardized classrooms be modified for schools with spare classrooms to create learning spaces that can vary for large to small and to practice project-oriented classes at the grade level.

THE (0, 1)-NORMAL SANDWICH PROBLEM

  • Park, Se Won;Han, Hyuk;Park, Sung-Wook
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.16 no.1
    • /
    • pp.25-36
    • /
    • 2003
  • We study the question of whether a partial (0, 1)-normal matrix has a non-symmetric normal completion. Matrix sandwich problems are an important and special case of matrix completion problems. In this paper, we give some properties for the (0, 1)-normal matrices and some large classes that satisfies the normal sandwich completion.

  • PDF

INFINITE SERIES RELATION FROM A MODULAR TRANSFORMATION FORMULA FOR THE GENERALIZED EISENSTEIN SERIES

  • Lim, Sung-Geun
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.25 no.2
    • /
    • pp.299-312
    • /
    • 2012
  • In 1970s, B. C. Berndt proved a transformation formula for a large class of functions that includes the classical Dedekind eta function. From this formula, he evaluated several classes of infinite series and found a lot of interesting infinite series identities. In this paper, using his formula, we find new infinite series identities.

ABSOLUTE CONTINUITY OF THE MAGNETIC SCHRÖDINGER OPERATOR WITH PERIODIC POTENTIAL

  • Assel, Rachid
    • Korean Journal of Mathematics
    • /
    • v.26 no.4
    • /
    • pp.601-614
    • /
    • 2018
  • We consider the magnetic $Schr{\ddot{o}}dinger$ operator coupled with two different potentials. One of them is a harmonic oscillator and the other is a periodic potential. We give some periodic potential classes for which the operator has purely absolutely continuous spectrum. We also prove that for strong magnetic field or large coupling constant, there are open gaps in the spectrum and we give a lower bound on their number.

NEW FAMILIES OF HYPERBOLIC TWISTED TORUS KNOTS WITH GENERALIZED TORSION

  • Keisuke, Himeno;Masakazu, Teragaito
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.1
    • /
    • pp.203-223
    • /
    • 2023
  • A generalized torsion element is an obstruction for a group to admit a bi-ordering. Only a few classes of hyperbolic knots are known to admit such an element in their knot groups. Among twisted torus knots, the known ones have their extra twists on two adjacent strands of torus knots. In this paper, we give several new families of hyperbolic twisted torus knots whose knot groups have generalized torsion. They have extra twists on arbitrarily large numbers of adjacent strands of torus knots.

Training Data Sets Construction from Large Data Set for PCB Character Recognition

  • NDAYISHIMIYE, Fabrice;Gang, Sumyung;Lee, Joon Jae
    • Journal of Multimedia Information System
    • /
    • v.6 no.4
    • /
    • pp.225-234
    • /
    • 2019
  • Deep learning has become increasingly popular in both academic and industrial areas nowadays. Various domains including pattern recognition, Computer vision have witnessed the great power of deep neural networks. However, current studies on deep learning mainly focus on quality data sets with balanced class labels, while training on bad and imbalanced data set have been providing great challenges for classification tasks. We propose in this paper a method of data analysis-based data reduction techniques for selecting good and diversity data samples from a large dataset for a deep learning model. Furthermore, data sampling techniques could be applied to decrease the large size of raw data by retrieving its useful knowledge as representatives. Therefore, instead of dealing with large size of raw data, we can use some data reduction techniques to sample data without losing important information. We group PCB characters in classes and train deep learning on the ResNet56 v2 and SENet model in order to improve the classification performance of optical character recognition (OCR) character classifier.

Performance comparison of SVM and neural networks for large-set classification problems (대용량 분류에서 SVM과 신경망의 성능 비교)

  • Lee Jin-Seon;Kim Young-Won;Oh Il-Seok
    • The KIPS Transactions:PartB
    • /
    • v.12B no.1 s.97
    • /
    • pp.25-30
    • /
    • 2005
  • In this paper, we analyzed and compared the performances of modular FFMLP(feedforward multilayer perceptron) and SVUT(Support Vector Machine) for the large-set classification problems. Overall, SVM dominated modular FFMLP in the correct recognition rate and other aspects Additionally, the recognition rate of SVM degraded more slowly than neural network as the number of classes increases. The trend of the recognition rates depending on the rejection rate has been analyzed. The parameter set of SVM(kernel functions and related variables) has been identified for the large-set classification problems.

Analysis of Learning Competence according to the Contact·Untact Learing in the Team-activity Class based on PBL (PBL기반 팀활동 수업에서 대면·비대면 학습에 따른 학습역량 분석)

  • Lee, Jae-Kyoung
    • Journal of Engineering Education Research
    • /
    • v.26 no.2
    • /
    • pp.45-53
    • /
    • 2023
  • This study conducted and evaluated the PBL-based team activity classes in contact and untact learning. Appropriate subject (Engineering communication) was also selected and evaluation methods were improved. In the qualitative evaluation results, in contact learning, similar score ranges were formed for each task, and the variability of scores for each task was not large. In untact learning, the difference in scores for each task was rather large, and the variability of scores for each task was large, indicating a large difference between teams that performed well and teams that did not. In the quantitative evaluation, contact learning showed a little low grades, but untact learning showed relatively high grades, but there were limitations in showing the conclusion that the untact learning effect was very good. As a result of the survey, there were more positive responses to the degree of understanding of the class conducted online, the degree of help to improve competence, and the team activity. However, if untact learning continues, it was analyzed that it is necessary to prepare appropriate measures to enhance learning effects and efficiently conduct team activities.

Major Class Recommendation System based on Deep learning using Network Analysis (네트워크 분석을 활용한 딥러닝 기반 전공과목 추천 시스템)

  • Lee, Jae Kyu;Park, Heesung;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.95-112
    • /
    • 2021
  • In university education, the choice of major class plays an important role in students' careers. However, in line with the changes in the industry, the fields of major subjects by department are diversifying and increasing in number in university education. As a result, students have difficulty to choose and take classes according to their career paths. In general, students choose classes based on experiences such as choices of peers or advice from seniors. This has the advantage of being able to take into account the general situation, but it does not reflect individual tendencies and considerations of existing courses, and has a problem that leads to information inequality that is shared only among specific students. In addition, as non-face-to-face classes have recently been conducted and exchanges between students have decreased, even experience-based decisions have not been made as well. Therefore, this study proposes a recommendation system model that can recommend college major classes suitable for individual characteristics based on data rather than experience. The recommendation system recommends information and content (music, movies, books, images, etc.) that a specific user may be interested in. It is already widely used in services where it is important to consider individual tendencies such as YouTube and Facebook, and you can experience it familiarly in providing personalized services in content services such as over-the-top media services (OTT). Classes are also a kind of content consumption in terms of selecting classes suitable for individuals from a set content list. However, unlike other content consumption, it is characterized by a large influence of selection results. For example, in the case of music and movies, it is usually consumed once and the time required to consume content is short. Therefore, the importance of each item is relatively low, and there is no deep concern in selecting. Major classes usually have a long consumption time because they have to be taken for one semester, and each item has a high importance and requires greater caution in choice because it affects many things such as career and graduation requirements depending on the composition of the selected classes. Depending on the unique characteristics of these major classes, the recommendation system in the education field supports decision-making that reflects individual characteristics that are meaningful and cannot be reflected in experience-based decision-making, even though it has a relatively small number of item ranges. This study aims to realize personalized education and enhance students' educational satisfaction by presenting a recommendation model for university major class. In the model study, class history data of undergraduate students at University from 2015 to 2017 were used, and students and their major names were used as metadata. The class history data is implicit feedback data that only indicates whether content is consumed, not reflecting preferences for classes. Therefore, when we derive embedding vectors that characterize students and classes, their expressive power is low. With these issues in mind, this study proposes a Net-NeuMF model that generates vectors of students, classes through network analysis and utilizes them as input values of the model. The model was based on the structure of NeuMF using one-hot vectors, a representative model using data with implicit feedback. The input vectors of the model are generated to represent the characteristic of students and classes through network analysis. To generate a vector representing a student, each student is set to a node and the edge is designed to connect with a weight if the two students take the same class. Similarly, to generate a vector representing the class, each class was set as a node, and the edge connected if any students had taken the classes in common. Thus, we utilize Node2Vec, a representation learning methodology that quantifies the characteristics of each node. For the evaluation of the model, we used four indicators that are mainly utilized by recommendation systems, and experiments were conducted on three different dimensions to analyze the impact of embedding dimensions on the model. The results show better performance on evaluation metrics regardless of dimension than when using one-hot vectors in existing NeuMF structures. Thus, this work contributes to a network of students (users) and classes (items) to increase expressiveness over existing one-hot embeddings, to match the characteristics of each structure that constitutes the model, and to show better performance on various kinds of evaluation metrics compared to existing methodologies.

SUPPORT VECTOR MACHINE USING K-MEANS CLUSTERING

  • Lee, S.J.;Park, C.;Jhun, M.;Koo, J.Y.
    • Journal of the Korean Statistical Society
    • /
    • v.36 no.1
    • /
    • pp.175-182
    • /
    • 2007
  • The support vector machine has been successful in many applications because of its flexibility and high accuracy. However, when a training data set is large or imbalanced, the support vector machine may suffer from significant computational problem or loss of accuracy in predicting minority classes. We propose a modified version of the support vector machine using the K-means clustering that exploits the information in class labels during the clustering process. For large data sets, our method can save the computation time by reducing the number of data points without significant loss of accuracy. Moreover, our method can deal with imbalanced data sets effectively by alleviating the influence of dominant class.