-
Article type: Cover
2009 Volume 19 Issue 3 Pages
Cover1-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2009 Volume 19 Issue 3 Pages
Cover2-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2009 Volume 19 Issue 3 Pages
Toc1-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 3 Pages
App1-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
[in Japanese]
Article type: Article
2009 Volume 19 Issue 3 Pages
i-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Minhao Lu, Tomoyuki Idogawa
Article type: Article
2009 Volume 19 Issue 3 Pages
205-214
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper, we propose a new algorithm based on mathematical morphology to decompose and reconstruct an image by using two contours. These contours are defined as the edge and the second edge (i.e., the edge of the image which has been removed an edge once) of the original image. Since these contours have informations of boundary and internal direction of image, the original image can be reconstructed exactly from them. The methods proposed in [1, 3] use the skeleton, but our method does not. Hence, the calculation time can be reduced by using our method in comparison to the preceding ones.
View full abstract
-
Masayuki Hariya, Ichiro Kataoka, Ichiro Harashima, Junichi Hirai
Article type: Article
2009 Volume 19 Issue 3 Pages
215-226
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
We developed a technique that retrieves partial shapes from CAD data to improve the operating efficiency of CAE and CAM. The technique is similar to feature shape retrieval, which involves using holes and ditches that the user specifies from CAD data. The technique can divide a three-dimensional CAD model into a partial shape and can retrieve a partial shape group that is equal to the structure of the feature shape that the user specifies. The effectiveness of the development technique was demonstrated by applying it to retrieve the similar-feature shapes of holes, which contain spot-faced holes of a machine parts model.
View full abstract
-
Mitsuhiro KASHIWAGI
Article type: Article
2009 Volume 19 Issue 3 Pages
227-242
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
This paper proposes a method to find intermediate eigensolutions in the vicinity of a shifted origin in a large sparse symmetric matrix. The shifted origin is held stationary at its new location in the conventional shifted origin inverse power method. In this method, however, when the relative residual error of the just-determined eigenvalue is above some convergence value, the conventional shifted origin inverse power method is employed. Once the relative residual error falls below the threshold, the shift distance is reset at every iteration of the shifted origin inverse power method. This enables the algorithm to reach a solution in approximately half the number of iterations and half the time of the conventional shifted origin inverse power method. Numerical experiments with Helmholtz problems in the standard eigenvalue problem carried out, as these often have multiple roots. This method is shown to be effective.
View full abstract
-
Shin'ichi Yoshikawa, Masatoshi Tanaka
Article type: Article
2009 Volume 19 Issue 3 Pages
243-256
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper, we extend Yu-Chung Tsao and Yung-Fu Huang to construct an economic order quantity(EOQ) model under advance sales discount and partial trade credit. This EOQ model consists of one manufacturer and one retailer. We assume that the retailer has powerful decision maker. Here, some theorems and properties are obtained to efficiently determine the optimal inventory policy for the retailer. Then, we investigate the retailer's optimal cycle time and discount rate. Finally, numerical examples arc given to illustrate a new model.
View full abstract
-
Akira Morimoto, Hiroyuki Koyama, Daiki Inoue, Atsushi Oomichi, Hitoshi ...
Article type: Article
2009 Volume 19 Issue 3 Pages
257-278
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
A method using time-frequency information to solve blind source separation problems for one dimensional signals is extended to two dimensional signals in order to solve the image separation problem. The discrete stationary wavelet transformation is used to define spatial-scale information. Algorithms to solve the image separation problem are proposed. Several numerical experiments are presented to reveal the proposed algorithms to be effective. A comparative study of the proposed method and a standard method using independent component analysis is given.
View full abstract
-
Daichi Yanagisawa, Ayako Kimura, Akiyasu Tomoeda, Ryosuke Nishi, Yushi ...
Article type: Article
2009 Volume 19 Issue 3 Pages
279-292
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
In this paper, we have introduced the effects of two important phenomena in evacuation dynamics, i.e., "conflict between pedestrians" and "turning at an exit", to the floor field model. The validity of our extended model is verified by our experiments. We have also found that putting an obstacle in front of the exit increases the pedestrian outflow from our experiments. Our extended model clearly explains the mechanism of the effect of the obstacle, i.e., an obstacle restricts the pedestrians' movement and decreases the conflicts, which leads to the increase of the pedestrian outflow.
View full abstract
-
Sho Noritake, Akira Imakura, Yusaku Yamamoto, Shao-Liang Zhang
Article type: Article
2009 Volume 19 Issue 3 Pages
293-312
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
We consider an application of the Krylov approximation method for the matrix exponential to the solution of linear simultaneous ordinary differential equations. Although this approach has large-grain parallelism, it has two potential problems, namely, the instability due to a large dimension of the Krylov subspace and the determination of an appropriate dimension of the Krylov subspace. In this paper, we show how to solve these problems. The resulting method is shown to be faster than the implicit finite difference method when the required accuracy is relatively high.
View full abstract
-
Tomonori Kouya
Article type: Article
2009 Volume 19 Issue 3 Pages
313-328
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
Buttari et al. have proposed the mixed-precision iterative refinement method using the IEEE754 single- and double-precision arithmetic for solving linear systems of equations. Their benchmark tests show that their proposed method can obtain high performance on computation environment on which the performance of single-precision arithmetic can be higher than double-precison arithmetic. However, the application of their method is limited to well-conditioned problems that can be solved by using single-precision arithmetic. Hence, the convergence of ill-conditioned problems may not be possible, which requires double-precision arithmetic. We broaden the scope of applications of the mixed-precision iterative refinement method by using a combination of double-precision arithmetic and multiple-precision arithmetic, and show that the new method has higher performance and yields more precise solutions than the original method. Finally, throught our numerical experiments, we demonstrate that the implicit Runge-Kutta methods with the mixed-precision iterative refinement method can speed up.
View full abstract
-
Yusuke Onoue, Seiji Fujino
Article type: Article
2009 Volume 19 Issue 3 Pages
329-350
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
IDR(s), Bi_IDR(s) and GIDR(s, L) methods based on the IDR Theorem have been proposed one after another. It is crucial how to build up a dense matrix P in view of reduction of computational cost and maintenance of convergence rate in a family of IDR(s) methods. Therefore, in this paper, we propose a device for building up a dense matrix P which is applicable commonly to a family of IDR(s) methods. Through numerical experiments, we clarify that the strategy of the proposed a Slim Dense matrix P is very effective for improvement of efficiency of IDR(s), Bi_IDR(s) and GIDR(s, L) methods.
View full abstract
-
Takeshi Takaishi
Article type: Article
2009 Volume 19 Issue 3 Pages
351-369
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
The phase field model which is suitable for the numerical simulation of mode III (anti-plane shear) crack growth is proposed. Using these model equations, some numerical results for crack growth are presented. Usefulness of this model is shown in the results, in the case that 2 cracks grow as various types, including the sub-crack. This model has many good features for numerical simulation, such as fixed computational domain, and it would be adapted to the well-known numerical methods. It is expected to be very useful to study the crack growth.
View full abstract
-
Article type: Appendix
2009 Volume 19 Issue 3 Pages
App2-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 3 Pages
App3-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Appendix
2009 Volume 19 Issue 3 Pages
App4-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Index
2009 Volume 19 Issue 3 Pages
Toc2-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2009 Volume 19 Issue 3 Pages
Cover3-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
-
Article type: Cover
2009 Volume 19 Issue 3 Pages
Cover4-
Published: September 25, 2009
Released on J-STAGE: April 08, 2017
JOURNAL
FREE ACCESS
