JaLCDOI | 10.18926/15411 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_29_2_13.pdf |

著者 | Dwianto Gatot| 大崎 紘一| 梶原 康博| |

抄録 | We propose a method to design the supplying method of parts to an assembly line. Three types of supplying model (Serial, Parallel, and Mixed) are proposed based on the relation between the area of part and that of the transportation equipment. The part is supplied by the pallet on which the all parts of one product are arranged or by the lot of one part. AGV or conveyor are used to transport the pallet. The supplying model is evaluated from the total transportation cost calculated from the price of the transportation equipment and of land. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 1995-03-27 |

巻 | 29巻 |

号 | 2号 |

開始ページ | 13 |

終了ページ | 21 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307903 |

JaLCDOI | 10.18926/19616 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_33_1_53.pdf |

著者 | Li Sen| 大崎 紘一| 梶原 康博| 宗澤 良臣| |

抄録 | A method for designing a monitoring system with multiple cameras is proposed in order to supervise and recognize the progress of wide work area. First, a wide view camera is deveeloped by combining several usual cameras so that its visual angle could cover more than π/2. Secondly, A method for determining the number and location points of cameras is proposed by considering the shape of monitored area and the installation cost of cameras. The monitored area is divided into three kinds of basic shape (rectangular form, L form and convex form). For every basic shape area, the camera is located at the vertex pasition, so that the whole area can be monitored by the camera. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 1998-11-30 |

巻 | 33巻 |

号 | 1号 |

開始ページ | 53 |

終了ページ | 57 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002309122 |

JaLCDOI | 10.18926/15376 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_35_183.pdf |

著者 | Tabuchi Satoshi| 大崎 紘一| 梶原 康博| 宗澤 良臣| |

抄録 | This research proposes a strategy for reducing both electricity charge and environmental load by considering multi energy sources. The reduction of the contract electric demand is considered, and its differential cost is used for purchasing substitute power sources. Some variables, such as the amount of reduced contract demand, and amount of electricity are generated by each substitute power source. By using those variables, we formulate a simulation model that enables to minimize the energy cost and environmental cost. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 2001-03-27 |

巻 | 35巻 |

号 | 1-2号 |

開始ページ | 183 |

終了ページ | 189 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307173 |

JaLCDOI | 10.18926/14071 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_42_110.pdf |

著者 | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

抄録 | This paper shows a method for checking the parity of (#Jc − 1)/2 without calculating the order #Jc, where #Jc is the order of genus 2 or 3 hyperelliptic curve. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 2008-01 |

巻 | 42巻 |

号 | 1号 |

開始ページ | 110 |

終了ページ | 114 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002308489 |

JaLCDOI | 10.18926/15367 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_30_1_9.pdf |

著者 | Ding Ronggui| 大崎 紘一| |

抄録 | Decision Support Systems (DSS) have been taken as hopeful support tools for decision making for more than 20 years. There are a lot of literatures on DSS, but most of them are not so practical as the designers expected. This paper points out the crux of this situation and argues that the research on DSS should pay some more attention to the decision making activities before the model using stage. A method named "Problem Situation Decomposing Graph (PSDG)" is presented in this paper for helping the decision maker(DM) elicit the decision making problems. A PSDG is an acycle AND/OR logical directed graph, and which includes all the factors affecting the problem situation based on the DM's knowledge. The logical nodes and parameter determining methods in PSDG can reflect the DM's decision making style. This paper introduces some basic concepts of PSDG, discusses some of its characteristics, and proposes a logical adjacency matrix for PSDG representation and analysis. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 1995-12-28 |

巻 | 30巻 |

号 | 1号 |

開始ページ | 9 |

終了ページ | 17 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307826 |

JaLCDOI | 10.18926/14157 |
---|---|

フルテキストURL | Mem_Fac_Eng_39_1_82.pdf |

著者 | Wang, Feng| Nogami, Yasuyuki| Morikawa, Yoshitaka| |

抄録 | In this paper, we focus on developing a high-speed square root (SQRT) algorithm required for an elliptic curve cryptosystem. Examining Smart algorithm, the previously well-known SQRT algorithm, we can see that there is a lot of computation overlap in Smart algorithm and the quadratic residue (QR) test, which must be implemented prior to a SQRT computation. It makes Smart algorithm inefficient. The essence of our proposition is thus to present a new QR test and an efficient SQRT algorithm to avoid all the overlapping computations. The authors devised a SQRT algorithm for which most of the data required have been computed in the proposed QR test. Not only there is no computation overlap in the proposed algorithm and the proposed QR test, but also in the proposed algorithm over GF(p(2)) (4 | p − 1) some computations can be executed in GF(p); whereas in Smart algorithm over GF(p(2)) all the computations must be executed in GF(p(2)). These yield many reductions in the computational time and complexity. We implemented the two QR tests and the two SQRT algorithms over GF(pm) (m=1, 2) in C++ language with NTL (Number Theory Library) on Pentium4 (2.6GHz), where the size of p is around 160 bits. The computer simulations showed that the proposed QR test and the proposed algorithm over GF(p(m)) were about 2 times faster than the conventional QR test and Smart algorithm over GF(p(m)). |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 2005-01 |

巻 | 39巻 |

号 | 1号 |

開始ページ | 82 |

終了ページ | 92 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002308422 |

JaLCDOI | 10.18926/17849 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_43_99.pdf |

著者 | Kato, Hidehiro| Nogami, Yasuyuki| Morikawa, Yoshitaka| |

抄録 | A square root (SQRT) algorithm in extension field F(p(m))(m = r(0)r(1)･･･r(n−1)･2(d), r(i) : odd prime, d : positive integer) is proposed in this paper. First, a conventional SQRT algorithm, the Tonelli-Shanks algorithm, is modified to compute the inverse SQRT in F(p(2d)), where most of the computations are performed in the corresponding subfields F(p(2i)) for 0 ≤ i ≤ d-1. Then the Frobenius mappings with addition chain are adopted for the proposed SQRT algorithm, in which a lot of computations in a given extension field F(p(m)) are also reduced to those in a proper subfield by the norm computations. Those reductions of the field degree increase efficiency in the SQRT implementation. The Tonelli-Shanks algorithm and the proposed algorithm in F(p(6)) and F(p(10)) were implemented on a Core2 (2.66 GHz) using the C++ programming language. The computer simulations showed that, on average, the proposed algorithm accelerated the SQRT computation by 6 times in F(p(6)), and by 10 times in F(p(10)), compared to the Tonelli-Shanks algorithm. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 2009-01 |

巻 | 43巻 |

開始ページ | 99 |

終了ページ | 107 |

ISSN | 1349-6115 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002308980 |

JaLCDOI | 10.18926/15382 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_35_207.pdf |

著者 | 中西 透| Fujiwara Toru| |

抄録 | In the group signature scheme with a trusted party, a verifier can determine whether or not a signature is made by a member of the group, but cannot identify the member who signed the signature. In case of dispute later on, the signer can be identified by the trusted party. However, for efficient group signature schemes proposed so far, removing a member from the group can be not efficiently performed. In this paper, a group signature scheme with an easy membership canceling is proposed. By sending a request to use a resource together with the group signature on it to the manager of the resource, the manager can control anonymous accesses to the resource. In such an application, the proposed group signature scheme is suitable for canceling of the access privilege. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 2001-03-27 |

巻 | 35巻 |

号 | 1-2号 |

開始ページ | 207 |

終了ページ | 212 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307232 |

JaLCDOI | 10.18926/46982 |
---|---|

フルテキストURL | mfe_37_2_073_087.pdf |

著者 | Nogami, Yasuyuki| Morikawa, Yoshitaka| |

抄録 | Public key cryptosystem has many uses, such as to sign digitally, to realize electronic commerce. Especially, RSA public key cryptosystem has been the most widely used, but its key for ensuring sufficient security reaches about 2000 bits long. On the other hand, elliptic curve cryptosystem(ECC) has the same security level with about 7-fold smaller length key. Accordingly, ECC has been received much attention and implemented on various processors even with scarce computation resources. In this paper, we deal with an elliptic curve which is defined over extension field F(p2c) and has a prime order, where p is the characteristic and c is a non negative integer. In order to realize a fast software implementation of ECC adopting such an elliptic curve, a fast implementation method of definition field F(p2c) especially F(p8) is proposed by using a technique called successive extension. First, five fast implementation methods of base field F(p2) are introduced. In each base field implementation, calculation costs of F(p2)-arithmetic operations are evaluated by counting the numbers of F(p)-arithmetic operations. Next, a successive extension method which adopts a polynomial basis and a binomial as the modular polynomial is proposed with comparing to a conventional method. Finally, we choose two prime numbers as the characteristic, and consider several implementations for definition field F(p8) by using five base fields and two successive extension methods. Then, one of these implementations is especially selected and implemented on Toshiba 32-bit micro controller TMP94C251(20MHz) by using C language. By evaluating calculation times with comparing to previous works, we conclude that proposed method can achieve a fast implementation of ECC with a prime order. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 2003-03 |

巻 | 37巻 |

号 | 2号 |

開始ページ | 73 |

終了ページ | 87 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 80015999992 |

JaLCDOI | 10.18926/15472 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_23_2_9.pdf |

著者 | Kuroda Tsutomu| 大崎 紘一| 松田 正明| Fujisawa Keita| |

抄録 | Multi-item flexible manufacturing systems have been spread to correspond the short life-cycle and the diversification of products. Part handling plays an important role to operate multi-functional robot efficiently in these systems, and many jigs are widely used to hold a part. They should be exchanged at once according to changing products. In this paper, we propose a pin jig which holds a part with two pins, and design method of the position, length and diameter of those pins for a cylindrical part. This jig has the following characteristics. As a surface of the jig is inclined to use gravity, the part can be fixed without any external forces. Therefore the structure of jig becomes simple, and loading and unloading of a part becomes easy for a robot hand. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 1989-03-30 |

巻 | 23巻 |

号 | 2号 |

開始ページ | 9 |

終了ページ | 19 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307693 |

JaLCDOI | 10.18926/15439 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_26_2_77.pdf |

著者 | 和田 修己| Nakajima Masamitsu| |

抄録 | This paper describes a method to design an antenna to focus millimeter-wave beam generated by a gyrotron. The antenna, which has been proposed by the authors, consists of a stair-cut circular waveguide and two cylindrical reflectors; one is elliptic and the other is parabolic. Its principle is based on the geometrical optics though slightly modified to consider the diffraction effect. Results of low-power experiments agree well with the design on beam direction, beam width and the position of the focal point. At 35.5 GHz using TE(01) mode, a focused beam with half-power thickness of 13 mm x 10 mm was obtained. This type of antennas find applications to millimeter-wave scattering measurement in fusion plasma research and high- energy-density source for material heating. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 1992-03-28 |

巻 | 26巻 |

号 | 2号 |

開始ページ | 77 |

終了ページ | 92 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307321 |

JaLCDOI | 10.18926/15512 |
---|---|

フルテキストURL | Mem_Fac_Eng_OU_25_2_69.pdf |

著者 | Tsuchiya Takao| 加川 幸雄| |

抄録 | A finite element approach to the calculation of nonlinear sound propagation is proposed. Under the assumption of a weak nonlinearity, a linearized one-dimensional equation is considered. The equation is discretized in space, and is then solved for time by using Newmark-β integration scheme, in which a numerical damping is devised. Some numerical demonstrations are made for the nonlinear sound propagation of a single-shot pulse in air. It is shown that the shock wave propagation is stably and accurately simulated by the introduction of the numerical damping. |

出版物タイトル | Memoirs of the Faculty of Engineering, Okayama University |

発行日 | 1991-03-28 |

巻 | 25巻 |

号 | 2号 |

開始ページ | 69 |

終了ページ | 80 |

ISSN | 0475-0071 |

言語 | English |

論文のバージョン | publisher |

NAID | 120002307747 |