• Title/Summary/Keyword: Problem-finding

Search Result 1,671, Processing Time 0.024 seconds

Difference between Gifted and Regular Students in Mathematical Problem Solving Ability (중학교 1학년 수학 영재학생과 일반 학생의 수학 문제해결과 문제설정 능력의 차이 비교)

  • Hwang, Dong-Jou
    • Journal of the Korean School Mathematics Society
    • /
    • v.9 no.3
    • /
    • pp.287-308
    • /
    • 2006
  • In this study, an instrument of mathematical problem solving ability test was considered, and the difference between gifted and regular students in the ability were investigated by the test. The instrument consists of 10 items, and verified its quality due to reliability, validity and discrimination. Participants were 168 regular students and 150 gifted from seventh grade. As a result, not only problem solving but also problem finding and problem posing could be the characteristics of the giftedness.

  • PDF

Comparisons of AIC and MDL on Estimation Reliability of Number of Soureces in Direction Finding Problem (Direction Finding Problem에서의 신호원 갯수 추정 신뢰도에 관한 AIC와 MDL의 비교)

  • 이일근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.10
    • /
    • pp.842-849
    • /
    • 1990
  • In this paper, a couple of well-known methods for determination of the number of source signals impinging on sersor array in array processing are introduced and compared in terms of estimation accuracy. The one is the procedure issued by Akaike(Akaike's Information Criterion : AIC) and the other one by Schwartz and Rissanen(Minimum Description Length:MDL). This paper demonstrates, through computer simulation, that the AIC is more reliable than the MDL in such troublesome cases as very closely spaced source signlas, very limited number of sensors in the array, finite data sequences and/or low Signal-to-Noise ratio(S/N).

  • PDF

A Digital Forensic Analysis for Directory in Windows File System (Windows 파일시스템의 디렉토리에 대한 디지털 포렌식 분석)

  • Cho, Gyusang
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.2
    • /
    • pp.73-90
    • /
    • 2015
  • When we apply file commands on files in a directory, the directory as well as the file suffer changes in timestamps of MFT entry. Based on understanding of these changes, this work provides a digital forensic analysis on the timestamp changes of the directory influenced by execution of file commands. NTFS utilizes B-tree indexing structure for managing efficient storage of a huge number of files and fast lookups, which changes an index tree of the directory index when files are operated by commands. From a digital forensic point of view, we try to understand behaviors of the B-tree indexes and are looking for traces of files to collect information. But it is not easy to analyze the directory index entry when the file commands are executed. And researches on a digital forensic about NTFS directory and B-tree indexing are comparatively rare. Focusing on the fact, we present, in this paper, directory timestamp changes after executing file commands including a creation, a copy, a deletion etc are analyzed and a method for finding forensic evidences of a deletion of directory containing files. With some cases, i.e. examples of file copy and file deletion command, analyses on the problem of timestamp changes of the directory are given and the problem of finding evidences of a deletion of directory containging files are shown.

Application of Color Information to Facilitate Finding Books in the Library

  • Park, Kyeongjin;Kim, Hyeon Chul;Lee, Eun Hye;Kim, Kyungdoh
    • Journal of the Ergonomics Society of Korea
    • /
    • v.36 no.3
    • /
    • pp.197-211
    • /
    • 2017
  • Objective: We propose to apply color information to facilitate finding books in the library. Background: Currently, books are classified in the basis of a decimal classification system and a call number in the library. Users find a book using the call number. However, this classification system causes various difficulties. Method: In a process analysis and survey study, we identify what the real problem is and where the problem is occurred. To solve the real problems, we derived a new search method using color information. We conducted a comparative experiment with 48 participants to see whether the new method can show higher performance. Results: The new method using color information showed faster time and higher subjective rating scores than current call number method. Also, the new method showed faster time regardless of the skill level while the call number method showed time differences in terms of the skill level. Conclusion: The effectiveness of the proposed method was verified by experiments. Users will be able to find the desired book without difficulty. This method can improve the quality of service and satisfaction of library use. Application: Our book search method can be applied as a book search tool in a real public library. We hope that the method can provide higher satisfaction to users.

Information Sharing System Based on Ontology in Wireless Internet (무선 인터넷 환경에서의 온톨로지 기반 정보 공유 시스템)

  • 노경신;유영훈;조근식
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.133-136
    • /
    • 2003
  • Due to recent explosion of information available online, question- answering (Q&A) systems are becoming a compelling framework for finding relevant information in a variety of domains. Question-answering system is one of the best ways to introduce a novice customer to a new domain without making him/her to obtain prior knowledge of its overall structure improving search request with specific answer. However, the current web poses serious problem for finding specific answer for many overlapped meanings for the same questions or duplicate questions also retrieved answer for many overlapped meanings fer the same questions or duplicate questions also retrieved answer is slow due to enhanced network traffic, which leads to wastage of resource. In order to avoid wrong answer which occur due to above-mentioned problem we propose the system using ontology by RDF, RDFS and mobile agent based on JAVA. We also choose wireless internet based embedded device as our test bed for the system and apply the system in E-commerce information domain. The mobile agent provides agent routing with reduced network traffic, consequently helps us to minimize the elapsed time for answers and structured ontology based on our proposed algorithms sorts out the similarity between current and past question by comparing properties of classes.

  • PDF

A VISCOSITY APPROXIMATIVE METHOD TO CES$\`{A}$RO MEANS FOR SOLVING A COMMON ELEMENT OF MIXED EQUILIBRIUM, VARIATIONAL INEQUALITIES AND FIXED POINT PROBLEMS

  • Jitpeera, Thanyarat;Katchang, Phayap;Kumam, Poom
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.227-245
    • /
    • 2011
  • In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

Automatic Individual Tooth Region Separation using Accurate Tooth Curve Detection for Orthodontic Treatment Planning

  • Lee, Chan-woo;Chae, Ok-sam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.4
    • /
    • pp.57-64
    • /
    • 2018
  • In this paper, we propose the automatic detection method for individual region separation using panorama image. Finding areas that contain individual teeth is one of the most important tasks in automating 3D models through individual tooth separation. In the conventional method, the maxillary and mandibular teeth regions are separated using a straight line or a specific CT slide, and the tooth regions are separated using a straight line in the vertical direction. In the conventional method, since the teeth are arranged in a curved shape, there is a problem that each tooth region is incorrectly detected in order to generate an accurate tooth region. This is a major obstacle to automating the creation of individual tooth models. In this study, we propose a method to find the correct tooth curve by using the jawbone curve which is very similar to the tooth curve in order to overcome the problem of finding the area containing the existing tooth. We have proposed a new method to accurately set individual tooth regions using the feature that individual teeth are arranged in a direction similar to the normal direction of the tooth alignment curve. In the proposed method, the maxillary and mandibular teeth can be more precisely separated than the conventional method, and the area including the individual teeth can be accurately set. Experiments using real dental CT images demonstrate the superiority of the proposed method.

An Improvement of the Deadlock Avoidance Algorithm (Deadlock 회피책에 대한 개선방안 연구)

  • Kim, Tae-Yeong;Park, Dong-Won
    • The Journal of Engineering Research
    • /
    • v.1 no.1
    • /
    • pp.49-57
    • /
    • 1997
  • In this paper, the follow-up works of Habermann's deadlock avoidance algorithm is investigated from the view of correction, efficiency and concurrency. Habermann's deadlock avoidance algorithm is briefly surveyed and in-depth discussion of follow-up algorithms modified and improved is presented. Then, further improvement of Kameda's algorithm will be discussed. His algorithm for testing deadlock-freedom in computer system converts the Habermann's model into a labeled bipartite graph so that the deadlock detection problem can be equivalent to finding complete matching for Mormon marriage problem. His algorithm has a running time of O($mn^1.5$) because Dinic's algorithm is used. The speed of above algorithm can be enhanced by employing a faster algorithm for finding a maximal matching. The wave method by Kazanov is used for.

  • PDF

Effects of a Flipped Classroom using Khan Academy and Mathematical Modeling on Overcoming Difficulties in Learning Mathematics

  • Lee, Jiyoon;Shin, Dongjo
    • Research in Mathematical Education
    • /
    • v.25 no.2
    • /
    • pp.99-115
    • /
    • 2022
  • This study examined difficulties middle school students have in learning mathematics and proposed a flipped classroom consisting of Khan Academy activities, small-group problem solving, and mathematical modeling to help improve their learning. A mixed-method approach was used to identify difficulties students have in learning mathematics, explore how the flipped classroom helped them reduce the learning difficulties identified, and examine if there were differences in students' mathematics achievement and their affective characteristics after participating in the flipped classroom. Qualitative analyses showed that students had difficulties in understanding mathematical concepts and finding effective ways to learn as well as negative views towards learning mathematics. This study also found that each activity of the flipped classroom had a different impact on student learning. Before class, the Khan Academy activities were most likely to help students understand mathematical concepts. In class, small-group problem solving activities were most helpful for students who had trouble finding effective learning methods and environments. Mathematical modeling activities were most likely effective in changing students' negative views towards mathematics. A quantitative analysis showed that the flipped classroom not only significantly improved the students' mathematics achievement, but also positively affected their confidence and motivation and how much they valued learning mathematics.

Range finding algorithm of equidistance stereo catadioptric mirror (등거리 스테레오 전방위 렌즈 영상에 대한 위치 측정 알고리즘)

  • Choi, Young-Ho
    • Journal of Internet Computing and Services
    • /
    • v.6 no.6
    • /
    • pp.149-161
    • /
    • 2005
  • Catadioptric mirrors are widely used in automatic surveillance system. The major drawback of catadioptric mirror is its unequal image resolution. Equidistance catadioptric mirror can be the solution to this problem. Even double panoramic structure can generate stereo images with single camera system. So two images obtained from double panoramic equidistance catadioptric mirror can be used in finding the depth and height values of object's points. But compared to the single catadioptric mirror. the image size of double panoramic system is relatively small. This leads to the severe accuracy problem in estimation. The exact axial alignment and the exact mount of mirror are the sources that can be avoided but the focal length variation is inevitable. In this paper, the effects of focal length variation on the computation of depth and height of object' point are explained and the effective focal length finding algorithm, using the assumption that the object's viewing angles are almost same in stereo images, is presented.

  • PDF