JaLCDOI 10.18926/14088
FullText URL Mem_Fac_Eng_OU_41_1_93.pdf
Author Tarequl Islam Bhuiyan| Nakanishi, Makoto| Fujii, Tatsuo| Takada, Jun|
Abstract Co-precipitation method has been employed to fabricate neodymium substituted hematite with different compositions from the aqueous solution of their corresponding metal salts. Thermal analysis and X-ray diffraction studies revealed the coexistence of Fe(2)O(3) and Nd(2)O(3) phases up to 1050℃ and formation of solid solution phase among them at 1100℃ and above temperatures, which was evidenced by shifting of the XRD peaks. Unit cell parameters and the cell volumes of the samples were found to increase by adding Nd(3+) ions in the reaction process. FESEM studies showed the suppression of particle growth due to the presence of Nd(3+) ions. Spectroscopic measurement evidenced that neodymium substituted hematite exhibited brighter yellowish red color tone than that of pure α-Fe(2)O(3).
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 93
End Page 98
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308163
JaLCDOI 10.18926/14087
FullText URL Mem_Fac_Eng_OU_41_1_73.pdf
Author Kanatani, Kenichi|
Abstract A rigorous accuracy analysis is given to various techniques for estimating parameters of geometric models from noisy data for computer vision applications. First, it is pointed out that parameter estimation for vision applications is very different in nature from traditional statistical analysis and hence a different mathematical framework is necessary in such a domain. After general theories on estimation and accuracy are given, typical existing techniques are selected, and their accuracy is evaluated up to higher order terms. This leads to a “hyperaccurate” method that outperforms existing methods.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 73
End Page 92
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308410
JaLCDOI 10.18926/14086
FullText URL Mem_Fac_Eng_OU_41_1_63.pdf
Author Kanatani, Kenichi| Sugaya, Yasuyuki|
Abstract The convergence performance of typical numerical schemes for geometric fitting for computer vision applications is compared. First, the problem and the associated KCR lower bound are stated. Then, three well known fitting algorithms are described: FNS, HEIV, and renormalization. To these, we add a special variant of Gauss-Newton iterations. For initialization of iterations, random choice, least squares, and Taubin’s method are tested. Numerical simulations and real image experiments and conducted for fundamental matrix computation and ellipse fitting, which reveals different characteristics of each method.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 63
End Page 72
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308585
JaLCDOI 10.18926/14084
FullText URL Mem_Fac_Eng_OU_41_1_52.pdf
Author Inaba, Hideo| Syahrul Husain| Horibe, Akihiko| Haruki, Naoto|
Abstract The effects of heat and mass transfer parameters on the efficiency of fluidized bed drying have been studied to optimize the input and output conditions. The analysis was carried out using two different materials, wheat and corn. Energy and exergy models based on the first and second law of thermodynamic are developed. Furthermore, some unified non-dimensional experimental correlations for predicting the efficiency of fluidized bed drying process have been proposed. The effects of hydrodynamics and thermodynamics conditions such as the inlet air temperature, the initial moisture content and well known Fourier and Reynolds numbers on energy efficiency and exergy efficiency were analyzed using the developed model. A good agreement was achieved between the model predictions, non-dimensional correlations and the available experimental results.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 52
End Page 62
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308668
JaLCDOI 10.18926/14083
FullText URL Mem_Fac_Eng_OU_41_1_44.pdf
Author Maeno, Ryota| Konishi, Masami| Imai, Jun|
Abstract Petri net model is a frequently-used versatile tool which can represent a widely discrete event system. However, when the scale of the system becomes large, the calculation time for solving optimal problem (optimal firing sequence problem) is markedly increased. In this paper, we propose an approximation method that achieves the efficiency improvement of the solution by decomposing the Petri net for solving the optimal firing sequence problem. A timed Petri Net is decomposed into several subnets in which the optimal firing sequence for each subnet is solved by Dijkstra’s algorithm in polynomial computational complexity. The effectivity of the proposed method is verified by numerical experiments for the flowshop schedule problem.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 44
End Page 51
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308128
JaLCDOI 10.18926/14082
FullText URL Mem_Fac_Eng_OU_41_1_31.pdf
Author Hamana, Ryohei| Konishi, Masami| Imai, Jun|
Abstract Various kind of productions are made in semiconductor factories, where it employs the production system with multiprocess and multiple Automated Guided Vehicles(AGVs) for transportation. It is difficult to optimize planning of production and transportation simultaneously because of the complicated flow of semifinished products. This paper describes the formulations of production scheduling and transportation routing, and algorithm for simultaneous optimization of plannings by using logic cuts. The entire problem is decomposed to the master problem and the sub problem. If it derives the infeasible solutions, new constraints are added to the master problem to eliminate the solution area including infeasible solutions. The results of about optimality and computation time by using CPLEX solver are shown compared with conventional decomposition method to check up effectivity of proposed method in small size problem, and about optimality and computaion time for large scale problem.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 31
End Page 43
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308108
JaLCDOI 10.18926/14081
FullText URL Mem_Fac_Eng_OU_41_1_20.pdf
Author Imamura, Takuji| Konishi, Masami| Imai, Jun|
Abstract In this paper, we propose a simultaneous optimization method for inventory control and production planning problem for a chemical batch plant. The plant consists of blending process, intermediate storage tanks and filling process. In the proposed method, the original problem is decomposed into production planning sub-problem and inventory control sub-problem. Then the decision variables are optimized by alternately solving each sub-problem. The solution of the proposed method is compared with that of centralized optimization method. The effectiveness of the proposed method is investigated from numerical computational results.
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 20
End Page 30
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308626
JaLCDOI 10.18926/14080
FullText URL Mem_Fac_Eng_OU_41_1_11.pdf
Author Nogami, Yasuyuki| Morikawa, Yoshitaka|
Abstract This paper proposes an algorithm for generating irreducible cubic trinomials in the form x(3) + ax + b, b ∈ F(p), where a is a certain fixed non-zero element in the prime field F(p). The proposed algorithm needs a certain irreducible cubic trinomial over F(p) to be previously given as a generator; however, the proposed algorithm can generate irreducible cubic polynomials one after another by changing a certain parameter in F(p). In this paper, we compare the calculation cost and the average computation time for generating an irreducible cubic polynomial, especially trinomial, among Hiramoto et al. irreducibility testing algorithm, Berlekamp-Massey minimal polynomial determining algorithm, and the proposed algorithm. From the experimental results, it is shown that the proposed algorithm is the fastest among the three algorithms for generating irreducible cubic trinomials.
Keywords irreducible cubic polynomial minimal polynomial
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 11
End Page 19
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308381
JaLCDOI 10.18926/14079
FullText URL Mem_Fac_Eng_OU_41_1_1.pdf
Author Nogami, Yasuyuki| Morikawa, Yoshitaka|
Abstract In this paper, we first show the number of x's such that x(2) +u, u ∈ F(*)(p) , becomes a quadratic residue in F(p), and then this number is proven to be equal to (p+1)/2 if −u is a quadratic residue in Fp, which is a necessary fact for the following. With respect to the irreducible cubic polynomials over Fp in the form of x(3)+ax+b, we give a classification based on the trace of an element in F(p3) and based on whether or not the coefficient of x, i.e. the parameter a, is a quadratic residue in Fp. According to this classification, we can know the minimal set of the irreducible cubic polynomials, from which all the irreducible cubic polynomials can be generated by using the following two variable transformations: x=x + i, x=j−1x, i, j ∈ Fp, j ≠ 0. Based on the classification and that necessary fact, we show the number of the irreducible cubic polynomials in the form of x(3)+ax+b, b ∈ F(p), where a is a certain fixed element in F(p).
Keywords Irreducible cubic polynomial trace quadratic residue
Publication Title Memoirs of the Faculty of Engineering, Okayama University
Published Date 2007-01
Volume volume41
Issue issue1
Start Page 1
End Page 10
ISSN 0475-0071
language 英語
File Version publisher
NAID 120002308562