• Title/Summary/Keyword: Problem-finding

Search Result 1,671, Processing Time 0.023 seconds

A Approaches to the Problem in connection with the Circle in Point of View of the Angle and Arc (원과 관련된 문제에서 각과 호의 관점으로의 접근)

  • Kang, Jeong Gi
    • The Mathematical Education
    • /
    • v.51 no.4
    • /
    • pp.471-484
    • /
    • 2012
  • It is not easy to find the auxiliary line to solve the problem in connection with the circle, where it is the problem finding the central angle or angle at the circumference in a circle. The purpose of the study is to give an aid for this difficulties. The angle at the circumference is closely related to the arc. And so we looked into the problem in connection with the angle at the circumference in point of view of the arc. We have got the following the results. It is not necessary to draw the auxiliary line when solving the problem in connection with the angle at the circumference in point of view of the arc. And we can find the reason to draw the specific auxiliary in point of view of the arc. We hope that the results of research are given aids to a lot of students.

A NOTE ON SINGULAR QUARTIC MOMENT PROBLEM

  • Li, Chun-Ji
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.1
    • /
    • pp.91-102
    • /
    • 2000
  • Let ${\gamma}{\equiv}{\gamma}^{(2n)}$ denote a sequence of complex numbers ${\gamma}{00},{\gamma}{01},\cdots,{\gamma}0, 2n,...,{\gamma}{2n},0\;with\; {\gamma}{00}\;>\;0,{\gamma}{ji}={{\overline}{\gamma_{ij}}}$,and let K denote a closed subset of the complex plane C. The truncated K complex moment problem entails finding a positive Borel measure $\mu$ such that ${\gamma}{ij}={\int}{{\overline}{z}}^{i}z^{j}d{\mu}\;(0{\leq}\;i+j\;{\leq}\;2n)$ and supp ${\mu}{\subseteq}\;K$. If n=2, then is called the quartic moment problem. In this paper, we give partial solutions for the singular quartic moment problem with rank M(2)=5 and ${{\overline}{Z}}Z{\in}\;<1,Z,{{\overline}{Z}},Z^{2},{{\overline}{Z}}^2>$.

  • PDF

COMPLEX MOMENT MATRICES VIA HALMOS-BRAM AND EMBRY CONDITIONS

  • Li, Chunji;Jung, Il-Bong;Park, Sang-Soo
    • Journal of the Korean Mathematical Society
    • /
    • v.44 no.4
    • /
    • pp.949-970
    • /
    • 2007
  • By considering a bridge between Bram-Halmos and Embry characterizations for the subnormality of cyclic operators, we extend the Curto-Fialkow and Embry truncated complex moment problem, and solve the problem finding the finitely atomic representing measure ${\mu}$ such that ${\gamma}_{ij}={\int}\bar{z}^iz^jd{\mu},\;(0{\le}i+j{\le}2n,\;|i-j|{\le}n+s,\;0{\le}s{\le}n);$ the cases of s = n and s = 0 are induced by Bram-Halmos and Embry characterizations, respectively. The former is the Curto-Fialkow truncated complex moment problem and the latter is the Embry truncated complex moment problem.

A Study on the Effectiveness of a Robotics curriculum based on "Bee-Bot"

  • Nam, Ki-won;Kwon, Un-jou;Han, Seung-chul
    • International Journal of Advanced Culture Technology
    • /
    • v.7 no.3
    • /
    • pp.79-85
    • /
    • 2019
  • This study examined the effects of a robotics curriculum based on "Bee-Bot" on the scientific problem-solving ability on 5-year-old children. A robotics curriculum was also designed to enhance their scientific problem-solving ability. This study examined a 4-week robotics curriculum was conducted 12 times for 4 weeks. For this study, 14 children in kindergarten A in Korea were set up as a treatment group and 18 children in kindergarten B in Korea as a control group. It was found that children in the treatment group who engaged in the robotics curriculum using "Bee-Bot" performed better on scientific problem-solving tests. This finding indicates that an enhanced planning experience using "Bee-Bot" was beneficial for improving young children's scientific problem-solving ability. The implications for designing appropriate curricula using "Bee-Bot" robots for kindergarteners are addressed.

Movie Recommendation Algorithm Using Social Network Analysis to Alleviate Cold-Start Problem

  • Xinchang, Khamphaphone;Vilakone, Phonexay;Park, Doo-Soon
    • Journal of Information Processing Systems
    • /
    • v.15 no.3
    • /
    • pp.616-631
    • /
    • 2019
  • With the rapid increase of information on the World Wide Web, finding useful information on the internet has become a major problem. The recommendation system helps users make decisions in complex data areas where the amount of data available is large. There are many methods that have been proposed in the recommender system. Collaborative filtering is a popular method widely used in the recommendation system. However, collaborative filtering methods still have some problems, namely cold-start problem. In this paper, we propose a movie recommendation system by using social network analysis and collaborative filtering to solve this problem associated with collaborative filtering methods. We applied personal propensity of users such as age, gender, and occupation to make relationship matrix between users, and the relationship matrix is applied to cluster user by using community detection based on edge betweenness centrality. Then the recommended system will suggest movies which were previously interested by users in the group to new users. We show shown that the proposed method is a very efficient method using mean absolute error.

Implementation of Tactical Path-finding Integrated with Weight Learning (가중치 학습과 결합된 전술적 경로 찾기의 구현)

  • Yu, Kyeon-Ah
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.91-98
    • /
    • 2010
  • Conventional path-finding has focused on finding short collision-free paths. However, as computer games become more sophisticated, it is required to take tactical information like ambush points or lines of enemy sight into account. One way to make this information have an effect on path-finding is to represent a heuristic function of a search algorithm as a weighted sum of tactics. In this paper we consider the problem of learning heuristic to optimize path-finding based on given tactical information. What is meant by learning is to produce a good weight vector for a heuristic function. Training examples for learning are given by a game level-designer and will be compared with search results in every search level to update weights. This paper proposes a learning algorithm integrated with search for tactical path-finding. The perceptron-like method for updating weights is described and a simulation tool for implementing these is presented. A level-designer can mark desired paths according to characters' properties in the heuristic learning tool and then it uses them as training examples to learn weights and shows traces of paths changing along with weight learning.

Associated Factors of Binge Drinking and Problem Drinking among Korean Men and Women (우리나라 남녀 성인의 폭음 및 문제음주 영향 요인)

  • Jeon, Gyeong-Suk;Lee, Hyo-Young
    • Korean Journal of Health Education and Promotion
    • /
    • v.27 no.1
    • /
    • pp.91-103
    • /
    • 2010
  • Objectives: This study firstly examined the pattern and prevalence of drinking. Secondly, we examined the sociodemographic and health factors associated with binge drinking and problem drinking among Korean men and women. Methods: Secondary analysis of the 2005 Korea National Health and Nutrition Examination Survey was conducted for 6,613 respondents aged 19 to 64. Results: Prevalence for binge drinking was 59.7% of men and 15.2% of women. Overall, 45.0% of men and 7.1% of women reported problem drinking. For both men and women, being divorced/separated/widowed was associated with binge drinking (OR=1.51 for men, OR=1.91 for women) and problem drinking (OR=1.43 for men, OR=2.12 for women), and smoking was associated with binge drinking (OR=3.20 for men, OR=3.96 for women) and problem drinking (OR=2.39 for men, OR=4.93 for women). Among women, unmarried and less educated increased the risk of binge drinking and problem drinking but being single and education level were not associated with binge drinking and problem drinking in men. Conclusion: There might be sex difference in the relationships between sociodemographic, and health factors and binge drinking, and problem drinking. Our finding suggest that the need to develop appropriate binge drinking prevention and intervention strategies for sex specified groups at greater risk.

A Heuristic Algorithm for Crew Scheduling Problems (발견적 승무계획 해법의 연구)

  • 김정식
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.9 no.13
    • /
    • pp.79-86
    • /
    • 1986
  • This paper presents a heuristic algorithm for a crew scheduling problem with dead head flights. This paper modifies and improves saving method for finding the Multiple Salesman tours in the graph. The results show that the computing time from this algorithm is implemented very much than those from general crew scheduling algorithms by set covering models.

  • PDF

PSEUDO-CONJUGATIONS

  • Ko, Ki-Hyoung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.25 no.2
    • /
    • pp.247-251
    • /
    • 1988
  • This note gives a combinatorial treatment to the problem finding a generating set among conjugating automorphisms of a free group and to the method deciding when a conjugating endomorphism of a free group is an automorphism. Our group of pseudo-conjugating automorphisms can be thought of as a generalization of the artin's braid group.

  • PDF

Single-period Stochastic Inventory Problems with Quadratic Costs

  • Song, Moon-Ho
    • Journal of the military operations research society of Korea
    • /
    • v.5 no.2
    • /
    • pp.15-25
    • /
    • 1979
  • Single-period inventory problems such as the newspaper boy problem having quadratic cost functions for both shortages and overage are examined to determine the optimal order level under various principles of choice such as minimum expected cost, aspiration level, and minimax regret. Procedures for finding the optimum order levels are developed for both continuous and discrete demand patterns.

  • PDF