• Journal of applied mathematics & informatics
• /
• v.30 no.3_4
• /
• pp.571-591
• /
• 2012

To the best of our knowledge, there is no method, in the literature, to find the fuzzy optimal solution of fully fuzzy shortest path (FFSP) problems i.e., shortest path (SP) problems in which all the parameters are represented by fuzzy numbers. In this paper, a new method is proposed to find the fuzzy optimal solution of FFSP problems. Kumar and Kaur [Methods for solving unbalanced fuzzy transportation problems, Operational Research-An International Journal, 2010 (DOI 10.1007/s 12351-010-0101-3)] proposed a new method with new representation, named as JMD representation, of trapezoidal fuzzy numbers for solving fully fuzzy transportation problems and shown that it is better to solve fully fuzzy transportation problems by using proposed method with JMD representation as compare to proposed method with the existing representation. On the same direction in this paper a new method is proposed to find the solution of FFSP problems and it is shown that it is also better to solve FFSP problems with JMD representation as compare to existing representation. To show the advantages of proposed method with this representation over proposed method with other existing representations. A FFSP problem solved by using proposed method with JMD representation as well as proposed method with other existing representations and the obtained results are compared.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.7
• /
• pp.3172-3193
• /
• 2018

Recently, several studies have shown that linear representation based approaches are very effective and efficient for image classification. One of these linear-representation-based approaches is the Collaborative representation (CR) method. The existing algorithms based on CR have two major problems that degrade their classification performance. First problem arises due to the limited number of available training samples. The large variations, caused by illumintion and expression changes, among query and training samples leads to poor classification performance. Second problem occurs when an image is partially noised (contiguous occlusion), as some part of the given image become corrupt the classification performance also degrades. We aim to extend the collaborative representation framework under limited training samples face recognition problem. Our proposed solution will generate virtual samples and intra-class variations from training data to model the variations effectively between query and training samples. For robust classification, the image patches have been utilized to compute representation to address partial occlusion as it leads to more accurate classification results. The proposed method computes representation based on local regions in the images as opposed to CR, which computes representation based on global solution involving entire images. Furthermore, the proposed solution also integrates the locality structure into CR, using Euclidian distance between the query and training samples. Intuitively, if the query sample can be represented by selecting its nearest neighbours, lie on a same linear subspace then the resulting representation will be more discriminate and accurately classify the query sample. Hence our proposed framework model the limited sample face recognition problem into sufficient training samples problem using virtual samples and intra-class variations, generated from training samples that will result in improved classification accuracy as evident from experimental results. Moreover, it compute representation based on local image patches for robust classification and is expected to greatly increase the classification performance for face recognition task.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.345-354
• /
• 2006

In this paper first, we find a canonical symmetrical trapezoidal(triangular) for the solution of the fuzzy linear system $A\tilde{x}=\tilde{b}$, where the elements in A and $\tilde{b}$ are crisp and arbitrary fuzzy numbers, respectively. Then, a model for fuzzy linear programming problem with fuzzy variables (FLPFV), in which, the right hand side of constraints are arbitrary numbers, and coefficients of the objective function and constraint matrix are regarded as crisp numbers, is discussed. A numerical procedure for calculating a canonical symmetrical trapezoidal representation for the solution of fuzzy linear system and the optimal solution of FLPFV, (if there exist) is proposed. Several examples illustrate these ideas.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.831-846
• /
• 2011

There are several methods, in the literature, for finding the fuzzy optimal solution of fully fuzzy transportation problems (transportation problems in which all the parameters are represented by fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings, a new method (based on fuzzy linear programming formulation) is proposed to find the fuzzy optimal solution of unbalanced fuzzy transportation problems with a new representation of trapezoidal fuzzy numbers. The advantages of the proposed method over existing method are discussed. Also, it is shown that it is better to use the proposed representation of trapezoidal fuzzy numbers instead of existing representation of trapezoidal fuzzy numbers for finding the fuzzy optimal solution of fuzzy transportation problems. To illustrate the proposed method a fuzzy transportation problem (FTP) is solved by using the proposed method and the obtained results are discussed. The proposed method is easy to understand and to apply for finding the fuzzy optimal solution of fuzzy transportation problems occurring in real life situations.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.3
• /
• pp.225-242
• /
• 2016

The phase-type representation is strongly connected with the positive realization in positive system. We attempt to transform phase-type representation into sparse mono-cyclic positive representation with as low order as possible. Because equivalent positive representations of a given phase-type distribution are non-unique, it is important to find a simple sparse positive representation with lower order that leads to more effective use in applications. A Hypo-Feedback-Coxian Block (HFCB) representation is a good candidate for a simple sparse representation. Our objective is to find an HFCB representation with possibly lower order, including all the eigenvalues of the original generator. We introduce an efficient nonlinear optimization method for computing an HFCB representation from a given phase-type representation. We discuss numerical problems encountered when finding efficiently a stable solution of the nonlinear constrained optimization problem. Numerical simulations are performed to show the effectiveness of the proposed algorithm.

• The Mathematical Education
• /
• v.42 no.5
• /
• pp.637-646
• /
• 2003

Visual representation is very important topic in Mathematics Education since it fosters understanding of Mathematical concepts, principles and rules and helps to solve the problem. So, the purpose of this paper is to analyze and clarify the various meaning and roles about the visual representation. For this purpose, I examine the status of the visual representation. Since the visual representation has the roles of creatively mathematical activity, we emphasize the using of the visual representation in teaching and learning. Next, I examine the errors in relation to the visual representation which come from limitation of the visual representation. It suggests that students have to know conceptual meaning of the visual representation when they use the visual representation. Finally, I suggest some examples of problem solving via the visual representation. This examples clarify that the visual representation gives the clues and solution of problem solving. Students can apprehend intuitively and easily the mathematical concepts, principles and rules using the visual representation because of its properties of finiteness and concreteness. So, mathematics teachers create the various visual representations and show students them. Moreover, mathematics teachers ask students to design the visual representation and teach students to understand the conceptual meaning of the visual representation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.101-111
• /
• 1993

The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

• East Asian mathematical journal
• /
• v.29 no.4
• /
• pp.449-466
• /
• 2013

This paper started from a question: Can it help a student solve the problem to give supports in point of view of a teacher knowing the solution. We performed a case study to get an answer for the question. We analysed a case which students do not make full use of data in the mathematical problem from this point of view of the mental representation. We examined closely the cause for not making full use of data. We got that the wrong mental representation which the students get from data in the problem lead to not making full use of data. We knew that it is insufficient to present the data not making use of. To help a student truly, it is necessary to give a aid based on a student's mental representation. From the conclusion of study, We got that figuring out student's mental representation is important and hope that many investigation about student's mental representation for various problem occur with frequency.

• Journal for History of Mathematics
• /
• v.28 no.4
• /
• pp.167-179
• /
• 2015

We study the solution of truncated series of Lee Sang-hyeog with the aspect of visualization. Lee Sang-hyeog solved a problem of truncated series by 4 ways: Shen Kuo' series method, splitting method, difference sequence method, and Ban Chu Cha method. As the structure and solution of truncated series in tertiary number is already clarified with algebraic symbols in some previous research, we express and explain it by visual representation. The explanation and proof of algebraic symbols about truncated series is clear in mathematical aspects; however, it has a lot of difficulties in the aspects of understanding. In other words, it is more effective in the educational situations to provide algebraic symbols after the intuitive understanding of structure and solution of truncated series with visual representation.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.21-34
• /
• 2012

This paper addresses a network design problem in a supply chain system that involves locating both plants and distribution centers, and determining the best strategy for distributing products from the suppliers to the plants, from the plants to the distribution centers and from the distribution centers to the customers. This paper suggests a cooperative coevolutionary algorithm (CCEA) approach to solve the model. First, the problem is decomposed into three subproblems for each of which the chromosome population is created correspondingly. Each chromosome in each population is represented as a permutation denoting the priority. Then an algorithm generating a solution from the combined set of chromosomes from each population is suggested. Also an algorithm evaluating the performance of a solution is suggested. An experimental study is carried out. The results show that our CCEA tends to generate better solutions than the previous CCEA as the problem size gets larger and that the permutation representation for chromosome used here is better than other representation.