• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.141-154
• /
• 2007

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes $O(K(G)mn^{1.5})$ time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes $O(n^2)$ time and O(n) space for a trapezoid graph.

• Journal of Applied Reliability
• /
• v.13 no.3
• /
• pp.153-163
• /
• 2013

QFD(Quality Function Deployment) is a very important tool to improve market share by reducing the gap between the voice of customer and the product's performance. But QFD is not a problem solving tool, although it is very useful in identifying what has to be solved or improved in order to meet the customer's desires. TRIZ has proved to be a very strong tool to solve the difficult problems that requires inventive thinking. QFD integrated with TRIZ becomes hot research recently. But merely linking between HOQ(House of Quality) in QFD and the contradiction matrix in TRIZ can not provide designers with a concrete method to solve the technical problem in the design process. Practically, the contradiction matrix and 40 inventive principles are not helpful for solving the technical problem. To solve the technical problem using TRIZ, a search for the tool and the object involved in the problem is made, from which the wanted result should be derived. A practical method to integrate QFD and TRIZ is proposed in this paper.

• Journal of Advanced Information Technology and Convergence
• /
• v.9 no.1
• /
• pp.77-87
• /
• 2019

The Butterfly model, which aims to solve contradiction problems, defines the type of contradiction for given problems and finds the problem-solving objectives and their strategies. Unlike the ARIZ algorithm in TRIZ, the Butterfly model is based on logical proposition, which helps to reduce trial and errors and quickly narrows the problem space for solutions. However, it is hard for problem solvers to define the right propositional relations in the previous Butterfly algorithm. In this research, we propose a contradiction solving algorithm which determines the right problem-solving strategy just with yes or no simple questions. Also, we implement the Butterfly Chatbot based on the proposed algorithm that provides visual and auditory information at the same time and help people solve the contradiction problems. The Butterfly Chatbot can solve contradictions effectively in a short period of time by eliminating arbitrary alternative choices and reducing the problem space.

• The Mathematical Education
• /
• v.50 no.1
• /
• pp.1-12
• /
• 2011

It is the aim of this paper to study the target problem solving process in reference to the base problem. We observed closely how students solve the target problem in reference to the base problem. The students couldn't solve the target problem, although they succeed to find the base problem. This comes from failing to discover the structural similarity between the target problem and the base problem. Especially it is important to cognize the proper corresponding of primary components between the base problem and target problem. And there is sometimes a part component of the target problem equivalent to the base problem and the target problem can't be solved without the insight into this fact. Consequently, finding the base problem fail to reach solving the target problem without the insight into their structural similarity. We have to make efforts to have an insight into the structural similarity between the target problem and the base problem to solve the target problem.

• Kyungpook Mathematical Journal
• /
• v.62 no.4
• /
• pp.673-687
• /
• 2022

In this study, we solve the Cayley inclusion problem and the fixed point problem in real Hilbert space using Tseng's technique with inertial extrapolation in order to obtain more efficient results. We provide a strong convergence theorem to approximate a common solution to the Cayley inclusion problem and the fixed point problem under some appropriate assumptions. Finally, we present a numerical example that satisfies the problem and shows the computational performance of our suggested technique.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.613-616
• /
• 2000

This paper considers the problem of subway crew scheduling. Crew scheduling is concerned with finding a minimum number of assignments of crews to a given timetable satisfying various restrictions. Traditionally, crew scheduling problem has been formulated as a set covering or set partitioning problem possessing exponentially many variables, but even the LP relaxation of the problem is hard to solve due to the exponential number of variables. In this paper, we propose two basic techniques that solve the problem in a reasonable time, though the optimality of the solution is not guaranteed. To reduce the number of variables, we adopt column-generation technique. We could develop an algorithm that solves column-generation problem in polynomial time. In addition, the integrality of the solution is accomplished by variable-fixing technique. Computational results show column-generation makes the problem of treatable size, and variable fixing enables us to solve LP relaxation in shorter time without a considerable increase in the optimal value. Finally, we were able to obtain an integer optimal solution of a real instance within a reasonable time.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3815-3820
• /
• 2000

This paper is about the minimum requirements to solve the Election problem in asynchronous distributed systems. The focus of the paper is to find out what failure detector is the weakest one to solve the Election problem. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors and show that the Election problem is harder than the Consensus problem. More precisely, the weakest failure detector that is needed to solve this problem is a Perfect Failure Detector. which is strictly stronger than the weakest failure detector that is needed to solve Consensus.

• Korean Journal of Childcare and Education
• /
• v.7 no.4
• /
• pp.273-299
• /
• 2011

The purpose of this research was to examine the relationship of mother's emotional expressiveness, parenting self-efficacy, verbal control style and children's peer interaction, ability to solve interpersonal problem in an attempt to help improve mother's practical parenting style for promoting children's peer interaction and ability to solve interpersonal problem. The subject of this research were four to five year-old 212 children from five day care center in J city and their teachers. Teachers were tested by questionnaires and children were interviewed. There were the results of this research. There were significant positive correlation among mother's positive emotional expressiveness, positive peer interaction and ability to solve interpersonal problem. There were significant positive correlation among negative emotional expressiveness, negative peer interaction and ability to solve interpersonal problem. There were significant positive correlation between parenting self-efficacy and positive peer interaction. There were significant positive correlation among imperative verbal control pattern and negative peer interaction and ability to solve interpersonal problem. There were significant positive correlation among hierarchical verbal control pattern and negative peer interaction and ability to solve interpersonal problem. There were significant positive correlation among humanitarian verbal control pattern and positive peer interaction and ability to solve interpersonal problem. There were significant negative correlation between parenting self-efficacy and negative peer interaction. There were significant negative correlation between imperative verbal control pattern and positive peer interaction.

• Journal of The Korean Association For Science Education
• /
• v.25 no.1
• /
• pp.1-15
• /
• 2005

This study examined two students' problem solving approaches: the similarities and the differences in their problem solving approaches, and the general problem solving strategies (heuristics) the students employed were discussed. The two students represent differences not only in terms of grades earned, but also in terms of participation, motivation, attention to detail, and approaches to answering questions and problem solving. Three separate problems were selected for this study: A stoichiometry problem; a fruit salad problem; and a limiting reactant problem. Each student was asked individually on three separate occasions to contribute to this study. There are more similarities in the students' problem solving strategies than there are differences. Both students were able to correctly solve the stoichiometry and the fruit salad problems, and were unable to correctly solve the limiting reactant problem. They recognized that an algorithm could be used for both chemistry problems(a stoichiometry problem & a limiting reactant problem). Both students were unable to correctly solve the limiting reactant problem and to demonstrate a clear understanding of the Law of Conservation of Mass. Nor did they show an ability to apply it in solving the problem. However, there was a difference in each one's ability to extend what had been learned/practiced/quizzed in class, to a related but different problem situation.

• Journal of Educational Research in Mathematics
• /
• v.27 no.1
• /
• pp.51-67
• /
• 2017

Analogical reasoning is a mathematically useful way of thinking. By analogy reasoning, students can improve problem solving, inductive reasoning, heuristic methods and creativity. The purpose of this study is to analyze the analogical reasoning of preservice mathematics teachers while constructing quadratic curves defined by eccentricity. To do this, we produced tasks and 28 preservice mathematics teachers solved. The result findings are as follows. First, students could not solve a target problem because of the absence of the mathematical knowledge of the base problem. Second, although student could solve a base problem, students could not solve a target problem because of the absence of the mathematical knowledge of the target problem which corresponded the mathematical knowledge of the base problem. Third, the various solutions of the base problem helped the students solve the target problem. Fourth, students used an algebraic method to construct a quadratic curve. Fifth, the analysis method and potential similarity helped the students solve the target problem.