Transactions of the Japan Society of Mechanical Engineers Series C
Online ISSN : 1884-8354
Print ISSN : 0387-5024
Volume 72, Issue 716
Displaying 51-52 of 52 articles from this issue
  • Synthesis of Titanium Boride and Grinding Experiment
    Takeshi NAKAMOTO, Eiji SHAMOTO, Yoshitake YAMAZAKI, Youichi SHIRAKATA
    2006 Volume 72 Issue 716 Pages 1384-1389
    Published: April 25, 2006
    Released on J-STAGE: March 04, 2011
    JOURNAL FREE ACCESS
    This paper deals with development of a new method for producing profile grinding wheel. At first, the desired shape is made of metal that is machined easily. Next, powder material is spread on a surface of the metal. And the surface is scanned by a laser beam and then a ceramic layer is produced on the surface of the metal by the chemical reaction between the powder material and metal material. The produced ceramic layer is used as grinding wheel. The powder material is boron and the metal material is titanium in this experiment. The components of the layer are examined by X-ray diffraction and titanium boride is detected in the layer. Grinding experiment is performed using this grinding wheel. The results shows that the ceramic layer can be used to grind hardened die steel.
    Download PDF (4818K)
  • Yoshiyuki KARUNO, Hiroshi NAGAMOCHI, Yoshiyuki OHSHIMA
    2006 Volume 72 Issue 716 Pages 1390-1397
    Published: April 25, 2006
    Released on J-STAGE: March 04, 2011
    JOURNAL FREE ACCESS
    In this paper, we deal with a f0od packing problem in an automated food packing system. The packing system has n hoppers, where an item is thrown into each hopper. An integer weight ui, and a priority γi are associated with each item i, where any wi is assumed to be bounded by an integer wmax. Given a set I of n items in the hoppers, the packing system chooses a subset I' (⊂e;I) of items, and puts them into a package with a specified target weight B. After that, the packing system updates the set I by taking the union of the remaining items in I-I' and new items thrown into empty hoppers. Repeating these operations, it makes a large number of packages one by one. In the packing system, an item may be left in a hopper for a long time until it is chosen. The priority γi is introduced to avoid such a situation, if possible. The packing problem is formulated as a lexicographic bi-criteria discrete optimization problem, where the first objective is to minimize ΣiIu'i such that Σi∈I'wiB must be satisfied, and the second is to maximize ΣiIγi.In this paper, we propose an O (n2wmax) time algorithm based on dynamic programming to the packing problem. We also examine the performance of the proposed approach by means of numerical experiments, and report the results.
    Download PDF (1222K)
feedback
Top