🚀 go-pugleaf

------------------------------------------------------------------------
SIG Notes Series (SIGAL meeting held on September 22, October 24, 1989)

            published by

Information Processing Society of Japan  (in Japanese)
------------------------------------------------------------------------

[Collection and dissemination of this information supported in part by
 ONR Grant N0001492J1737.]

SIGAL Meeting (Held on September 22, 1989)

Encoding and Operations of Binary Images
	by Y. NISHITANI(1), H. YOSHIDA(2) and K. SHIMIZU(3)
 	 (1)  Faculty of Engineering, Gunma University, Kiryu, 376, Japan
	 (2)  Oki Electric Industry, Minato-ku, Tokyo 105, Japan
 	 (3)  Faculty of Engineering, Gunma University

On Translating a Set of C-oriented Objects in Three Dimensions
	by Xue-Hou TAN, T. HIRATA and Y. INAGAKI
	 Faculty of Engineering, Nagoya University, Chikusaku,
	 Nagoya, 464, Japan

Linear Time Algorithms for Finding k-Edge-Connected and k-Node-Connected
 Spanning Subgraphs
	by H. NAGAMOCHI(1) and T. IBARAKI(2)
	 (1)  Dept. of Information & Computer Sciences, Toyohashi
	  University of Technology, Toyohashi, 440, Japan
	 (2)  Dept. of Applied Mathematics & Physics, Faculty of Engineering, 
	  Kyoto University, Kyoto 606, Japan

An Efficient Compensation-path Finding Algorithm for a Large-scale
 Systolic Array
	by T. OZAWA
	 Department of Electrical Engineering, Kyoto University,
	 Kyoto, 606, Japan

Some Voronoi Diagrams for Character Placing Problems in MAP Databases
	by H. AONUMA, H. IMAI and T. TOKUYAMA(2)
	 Department of Computer Science and Communication Engineering,
	 Kyushu University, Hakozaki, Higashi, Fukuoka 812, Japan
	 (2)  IBM Research, Tokyo Research Laboratory, Sanbancho, 
	  Chiyoda-ku Tokyo 102, Japan

SIGAL Meeting (Held on October 24,1989)

A Loop Region Analysis Algorithm and Its Applications
	by S. MAKINO
	 IBM Research, Tokyo Research Laboratory, 5-19, Sanbancho, 
 	 Chiyoda-ku, Tokyo 102, Japan

A Combinatorial-structure Oriented Algorithm for Voronoi Diagrams
 of Line Segments
	by T. IMAI and K. SUGIHARA
	 Faculty of Engineering, University of Tokyo, 7-3-1 Hongo,
	 Bunkyo-ku, Tokyo 113, Japan

Basis Reduction and Random Number Generation
	by S. TEZUKA
	 IBM Tokyo Research Laboratory, 519, Sanbancho, Chiyodaku,
	 Tokyo 102, Japan

The Algorithm for the Transitive Closure by the Dynamic
 Blocked Warshall Algorithm
	by N. TATESHITA, T. OHYANAGI and A. OHUCHI
	 Department of Information Engineering, Faculty of Engineering,
	 Hokkaido University, N-13, W-8, Kita-ku, Sapporo, Hokkaido 060, Japan

Combinatorial Face Enumeration in Arrangements and Oriented Matroids
	by K. FUKUDA, S. SAITO(2), A. TAMURA(2) and T. TOKUYAMA(3) 
	 Graduate School of Systems Management, the University of Tsukuba,
	 Bunkyo-ku, Tokyo Japan
	 (2)  Department of Information Sciences, Tokyo Institute of
	  Technology, Meguro-ku, Tokyo, Japan
	 (3)  IBM Research, Tokyo Research Laboratory, Chiyoda-ku,
	  Tokyo, Japan

On Cographic Multicommodity Flow Algorithms
	by A. SEBO
	 IMAG, ARTEMIS, Universite Fourier (de Grenoble) 38402 St Martin
	 D'heres, Cedex

Computational Complexity of the Method of Analytic Centers
 for Convex Programming
	by F. JARRE
	 Institut fur Angewandte Mathematik und Statistik, Universitat Wurzburg,
	 Am Hubland, 8700 Wurzburg, West-Germany

A New Algorithm for the Continuous Modular Design Problem
	by E. KLAFSZKY, J. MAYER(2) and T. TERLAKY(3)
	 Department of Building Management and Org. Technical University,
	 Budapest, Muegyetem rkp. 3. Hungary
	 (2)  Department of O.R. Comp. and Aut. Inst. Hung. Acad. of
	  Sci. Budapest, V. Hugo u. 18-22, Hungary
	 (3)  Depatment of Mathematics and Computer Science Technical
	  University, 2600 AJ Delft P.O. Box. 356. Netherlands

On the Generic Rigidity of Plane Frameworks
	by H. CRAPO 
	 Bat 10, INRIA, B.P. 105, 78153 Le Chesnay Cedex, France