• Title/Summary/Keyword: problem solving approach

Search Result 863, Processing Time 0.024 seconds

A Parallel Iterative Algorithm for Solving The Eigenvalue Problem of Symmetric matrices

  • Baik, Ran
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.2
    • /
    • pp.99-110
    • /
    • 2000
  • This paper is devoted to the parallelism of a numerical matrix eigenvalue problem. The eigenproblem arises in a variety of applications, including engineering, statistics, and economics. Especially we try to approach the industrial techniques from mathematical modeling. This paper has developed a parallel algorithm to find all eigenvalues. It is contributed to solve a specific practical problem, a vibration problem in the industry. Also we compare the runtime between the serial algorithm and the parallel algorithm for the given problems.

  • PDF

A Q-Methodological Study on the Community Nursing Practice of Nursing Students (간호 학생의 지역사회간호 실습 경험에 대한 유형 분석 -Q방법론적 접근-)

  • Kim, Lee-Sun
    • Research in Community and Public Health Nursing
    • /
    • v.8 no.1
    • /
    • pp.133-143
    • /
    • 1997
  • This study measures the subjectivity of nursing students' experience in community fields through community nursing practice. The purpose of this study is as follows: 1) to find out typologies based on opinions and attitudes toward community nursing practice. 2) to describe the characteristic of each type. 3) to provide alternative strategies for solving community nursing practice problems. A Q-Methodological method was used for that purpose. As a research method, Q-statements were collected through indepth interviews and review of the current literature. For this study 34 Q-statements were selected. 24 nursing students were subjects for the research. The 24 nursing students sorted 34 Q-statements using the principle of Forced Normal Distribution. The principle of Forced Normal Distribution, which has nine scales to measure individual opinions, was called, a Q- Factor Analysis by using a PC Quanl Program to supply the material. According to the results of this study, there were three categories of opinion concerning community nursing practice. The first type is the realistic problem-oriented approach: the second type is the self-responsibility or pursuit of life meaning approach: the third type is the group approach for problem solving. As a result, we need to develop and revise a more realistic way of community nursing practice for nursing students. Finally, the result of this study will provide to the educational program alternative strategies for community nursing practice for nursing students.

  • PDF

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos;Ho, Pin-Han
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.198-209
    • /
    • 2007
  • This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

Estimation of remodeling of small-scale houses to improve the residential environment for the underprivileged - case study on the TV program 'Love House' for free residential remodeling - (소외계층의 주거환경개선을 위한 소규모 주택 리모델링에 관한 평가연구 - TV 방송 무료주택 리모델링 프로그램 '러브하우스' 사례조사를 중심으로-)

  • Yang, Se-Eun
    • Korean Institute of Interior Design Journal
    • /
    • v.17 no.3
    • /
    • pp.34-42
    • /
    • 2008
  • The objective of this research is not only making the planning guides regarding a small-scale residential remodeling but also examining closely the social roles of the interior design for the poor and the underprivileged class by analyzing the residential remodeling cases. The scope of research includes 40 remodeling houses free of charge which are broadcasted in the TV program 'Love House'. Taking in consideration the characteristics of users like parentless or single-parent families and families with disabled persons, this study uses the spatial approach, user's convenience approach and psychological problem solving approach, in terms of the methodology. In result of the analysis of their interior design, first of all, it is essential solving the problem of limited house space by comparison with the family number. Second, the universal design concept for the family with disabled persons(72.5%), old persons or children is strengthened guaranteeing privacy in small and old interior space. Third, the interior design is focused in increasing communication among family members, because mental and physical obstacle would obstruct accessibility among them. This research shows the importance of the interior design which makes wide social roles contributing to create "welfare society".

Design of robust LQR/LQG controllers by LMIs (Linear Matrix Inequalities(LMIs)를 이용한 강인한 LQR/LQG 제어기의 설계)

  • 유지환;박영진
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.988-991
    • /
    • 1996
  • The purpose of this thesis is to develop methods of designing robust LQR/LQG controllers for time-varying systems with real parametric uncertainties. Controller design that meet desired performance and robust specifications is one of the most important unsolved problems in control engineering. We propose a new framework to solve these problems using Linear Matrix Inequalities (LMls) which have gained much attention in recent years, for their computational tractability and usefulness in control engineering. In Robust LQR case, the formulation of LMI based problem is straightforward and we can say that the obtained solution is the global optimum because the transformed problem is convex. In Robust LQG case, the formulation is difficult because the objective function and constraint are all nonlinear, therefore these are not treatable directly by LMI. We propose a sequential solving method which consist of a block-diagonal approach and a full-block approach. Block-diagonal approach gives a conservative solution and it is used as a initial guess for a full-block approach. In full-block approach two LMIs are solved sequentially in iterative manner. Because this algorithm must be solved iteratively, the obtained solution may not be globally optimal.

  • PDF

Diversity of Problem Solving Methods about a Problem of Area from the History of Mathematics by High Achieving Elementary School Students (수학사의 한 넓이 문제에 대한 초등 수학 우수아의 풀이 다양성 탐색)

  • Chang, Hye-Won
    • Journal for History of Mathematics
    • /
    • v.21 no.4
    • /
    • pp.153-168
    • /
    • 2008
  • This study investigates how high achievers solve a given mathematical problem. The problem, which comes from 'SanHakIbMun', a Korean mathematics book from eighteenth century, is not used in regular courses of study. It requires students to determine the area of a gnomon given four dimensions(4,14,4,22). The subjects are 84 sixth grade elementary school students who, at the recommendation of his/her school principal, participated in the mathematics competition held by J university. The methods used by these students can be classified into two approaches: numerical and decomposing-reconstructing, which are subdivided into three and six methods respectively. Of special note are a method which assumes algebraic feature, and some methods which appear in the history of eastern mathematics. Based on the result, we may observe a great variance in methods used, despite the fact that nearly half of the subject group used the numerical approach.

  • PDF

A Neural Network-Driven Decision Tree Classifier Approach to Time Series Identification (인공신경망 기초 의사결정트리 분류기에 의한 시계열모형화에 관한 연구)

  • 오상봉
    • Journal of the Korea Society for Simulation
    • /
    • v.5 no.1
    • /
    • pp.1-12
    • /
    • 1996
  • We propose a new approach to classifying a time series data into one of the autoregressive moving-average (ARMA) models. It is bases on two pattern recognition concepts for solving time series identification. The one is an extended sample autocorrelation function (ESACF). The other is a neural network-driven decision tree classifier(NNDTC) in which two pattern recognition techniques are tightly coupled : neural network and decision tree classfier. NNDTc consists of a set of nodes at which neural network-driven decision making is made whether the connecting subtrees should be pruned or not. Therefore, time series identification problem can be stated as solving a set of local decisions at nodes. The decision values of the nodes are provided by neural network functions attached to the corresponding nodes. Experimental results with a set of test data and real time series data show that the proposed approach can efficiently identify the time seires patterns with high precision compared to the previous approaches.

  • PDF

Application of Initial Stress Method on Elasto-plastic Problem in Boundary Element Method (경계요소법의 탄소성문제에 대한 초기응력법의 적용)

  • Soo, Lyong-Lee
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.43 no.6 s.150
    • /
    • pp.683-692
    • /
    • 2006
  • The BEM, known as solving boundary value problems, could have some advantages In solving domain problems which are mostly solved by FEM and FDM. Lately, in the elastic-plastic nonlinear problems, BEM could provide the subdomain approach for the region where the plastic deformation could occur and the unknown nodal displacement of this region are added as the unknown of the boundary integral equation for this approach. In this paper, initial stress method was used to establish the formulation of such BEM approach. And a simple rectangular plate having a circular hole was analyzed to verify the suggested method and the result is compared with that from FEM. It is shown that the result of two methods are showing similar stress-strain curves at the root of perforated plate and furthermore the plastic deformation obtained by BEM shows more reasonable behavior than that of FEM.

A Study on Complementary Usage of System Dynamics and Theory of Constraints Approaches for Solving a Dilemma (갈등문제 해결을 위한 시스템다이내믹스와 제약이론 방법론의 상호 보완적 적용에 관한 연구)

  • Yee, Soung-Ryong
    • Korean System Dynamics Review
    • /
    • v.12 no.4
    • /
    • pp.63-92
    • /
    • 2011
  • The purpose of this paper is to investigate a possibility of applying multimethodological approach for solving a dilemma. The motivation of this attempt is that the two different approaches, the system dynamics and the theory of constraints, resemble each other in having mental models for describing the target system and using graphic tools for representing those mental models. After a brief discussion on the comparison of the two approaches, a combined method applying to the problem of dilemma is suggested. For an experimental example, the proposed approach is applied to the sales and finance conflict on an inventory issue. The study shows that the suggested approach is able to complement each other's drawbacks. Especially constructing a stock-and-flow model and implementing a computer simulation would be very useful for quantifying the system's behavior which is hardly tracked down when applying the theory of constraints alone.

  • PDF

Solving Nonlinear Fixed Charge Transportation Problem by Spanning Tree-based Genetic Algorithm (신장트리 기반 유전자 알고리즘에 의한 비선형 fcTP 해법)

  • Jo, Jung-Bok;Ko, Suc-Bum;Gen, Mitsuo
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.8
    • /
    • pp.752-758
    • /
    • 2005
  • The transportation problem (TP) is known as one of the important problems in Industrial Engineering and Operational Research (IE/OR) and computer science. When the problem is associated with additional fixed cost for establishing the facilities or fulfilling the demand of customers, then it is called fixed charge transportation problem (fcTP). This problem is one of NP-hard problems which is difficult to solve it by traditional methods. This paper aims to show the application of spanning-tree based Genetic Algorithm (GA)approach for solving nonlinear fixed charge transportation problem. Our new idea lies on the GA representation that includes the feasibility criteria and repairing procedure for the chromosome. Several numerical experimental results are presented to show the effectiveness of the proposed method.