Gang Xiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gang Xiang has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Olga Kosheleva
University of Texas at El Paso
2 shared publications - Vladik Kreinovich
Department of Computer Science, University of Texas at El Paso, 500 W. University, El Paso, TX 79968, USA
2 shared publications - Alexander Wolpert
Roosevelt University
1 shared publication - Andrzej Pownuk
University of Texas at El Paso
1 shared publication - Damjan Škulj
University of Ljubljana
1 shared publication Daniel Berleant
1 shared publication
Latest Publications
- 31 December 2007
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 46 (3) , 499-510
Towards adding probabilities and correlations to interval computations
- 31 December 2007
- Published by Elsevier in International Journal of Approximate Reasoning
- Vol. 46 (3) , 499-510
Towards adding probabilities and correlations to interval computations
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 570-575
Von Mises Failure Criterion in Mechanics of Materials: How to Efficiently Use it Under Interval and Fuzzy Uncertainty
One of the main objective of mechanics of materials is to predict when the material experiences fracture (fails), and to prevent this failure. With this objective in mind, it is desirable to use it ductile materials, i.e., materials which can sustain large deformations without failure. Von Mises criterion enables us to predict the failure of such ductile materials. To apply this criterion, we need to know the exact stresses applied at different directions. In practice, we only know these stresses with interval or fuzzy uncertainty. In this paper, we describe how we can apply this criterion under such uncertainty, and how to make this application computationally efficient.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 570-575
Von Mises Failure Criterion in Mechanics of Materials: How to Efficiently Use it Under Interval and Fuzzy Uncertainty
One of the main objective of mechanics of materials is to predict when the material experiences fracture (fails), and to prevent this failure. With this objective in mind, it is desirable to use it ductile materials, i.e., materials which can sustain large deformations without failure. Von Mises criterion enables us to predict the failure of such ductile materials. To apply this criterion, we need to know the exact stresses applied at different directions. In practice, we only know these stresses with interval or fuzzy uncertainty. In this paper, we describe how we can apply this criterion under such uncertainty, and how to make this application computationally efficient.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 526-531
Under Interval and Fuzzy Uncertainty, Symmetric Markov Chains Are More Difficult to Predict
Markov chains are an important tool for solving practical problems. In particular, Markov chains have been successfully applied in bioinformatics. Traditional statistical tools for processing Markov chains assume that we know the exact probabilities pij of a transition from the state i to the state j. In reality, we often only know these transition probabilities with interval (or fuzzy) uncertainty. We start the paper with a brief reminder of how the Markov chain formulas can be extended to the cases of such interval and fuzzy uncertainty. In some practical situations, there is another restriction on the Markov chain-that this Markov chain is symmetric in the sense that for every two states i and j, the probability of transitioning from i to j is the same as the probability of transitioning from j to i: pij = pji. In general, symmetry assumptions simplify computations. In this paper, we show that for Markov chains under interval and fuzzy uncertainty, symmetry has the opposite effect: it makes the computational problems more difficult.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 526-531
Under Interval and Fuzzy Uncertainty, Symmetric Markov Chains Are More Difficult to Predict
Markov chains are an important tool for solving practical problems. In particular, Markov chains have been successfully applied in bioinformatics. Traditional statistical tools for processing Markov chains assume that we know the exact probabilities pij of a transition from the state i to the state j. In reality, we often only know these transition probabilities with interval (or fuzzy) uncertainty. We start the paper with a brief reminder of how the Markov chain formulas can be extended to the cases of such interval and fuzzy uncertainty. In some practical situations, there is another restriction on the Markov chain-that this Markov chain is symmetric in the sense that for every two states i and j, the probability of transitioning from i to j is the same as the probability of transitioning from j to i: pij = pji. In general, symmetry assumptions simplify computations. In this paper, we show that for Markov chains under interval and fuzzy uncertainty, symmetry has the opposite effect: it makes the computational problems more difficult.
- 1 August 2006
- Published by Springer Nature in Reliable Computing
- Vol. 12 (4) , 273-280
Population Variance under Interval Uncertainty: A New Algorithm
- 1 August 2006
- Published by Springer Nature in Reliable Computing
- Vol. 12 (4) , 273-280
Population Variance under Interval Uncertainty: A New Algorithm
- 1 February 2006
- Published by Springer Nature in Reliable Computing
- Vol. 12 (1) , 59-64
Fast Algorithm for Computing the Upper Endpoint of Sample Variance for Interval Data: Case of Sufficiently Accurate Measurements
- 1 February 2006
- Published by Springer Nature in Reliable Computing
- Vol. 12 (1) , 59-64
Fast Algorithm for Computing the Upper Endpoint of Sample Variance for Interval Data: Case of Sufficiently Accurate Measurements
- 9 December 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 717-721
How to Reconstruct the Original Shape of a Radar Signal?
The shape of the radar signal can provide us with the additional information about the reflecting surface. However, to decrease the noise, radars use filtering, and filtering changes the shapes of the radar signal. It is therefore necessary to reconstruct the original shape of the radar signal.
- 9 December 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 717-721
How to Reconstruct the Original Shape of a Radar Signal?
The shape of the radar signal can provide us with the additional information about the reflecting surface. However, to decrease the noise, radars use filtering, and filtering changes the shapes of the radar signal. It is therefore necessary to reconstruct the original shape of the radar signal.