HDTenEightyP/NetNews huggingface dataset:
From: stgprao@st.unocal.COM (Richard Ottolini)
Subject: Re: Depth Sorting
Organization: Unocal Corporation
Date: Fri, 8 Jan 1993 16:45:13 GMT

In article <hrpctw.10@pnv.palm.cri.nz> news@massey.ac.nz (USENET News System) writes:
>I need to be able to display a very complicated three dimensional structure
>consisting of a lot of small unconnected polygons, a whole heap of line
>segments, a few very small ellipsoids, which are probably small enough to
>be approximated by a single polygon each.  I have no problems in performing
>the 3D transformations etc, but I'm having trouble figuring out what exactly
>is the best way of displaying this data.  For a first attempt I'll probably
>just sort the objects in order from back to front and plot them like that,
>but this is not really a good solution.  What I would like is a fairly nice
>algorithm (understandability is preferable to efficiency) that will allow
>me to draw polygons and line segments without objects being drawn over the
>top of objects on front of them.
>
>Does anyone have any such algorithms, (or better still, C code), or know
>where I can look to find something suitable.

This question has occurred a couple times recently.
One way to think through an answer is that graphics-geometry algorithms can be implemented
in at least two ways: (1) in the "model space" or geometric description of the object to
be drawn, or (2) the "image space" or coordinates of the drawing surface.
Brute force model space methods tend to be polynomial in cost, that each object must be compared
to each other object.  This can be reduced somewhat by ordering/sorting the model parts.  Oct-trees
os one typoe of ordering.  An image space algorithm is the zbuffer method- recording the depth
of each pixel drawn and comparing it to the existing contents. This algorithm is essentially linear
with the number of objects to be drawn.
Newsgroups: comp.graphics
From: m23364@mwunix (James Meritt)
Subject: color gif -> xbm
Organization: MITRE Corporation, McLean VA
Distribution: usa
Date: Thu, 7 Jan 1993 20:57:16 GMT


I have some color gifs that I want to transform to color xbms.
I can (using pbmplus with no flags & Asterix) do a conversion.
Unfortunately, it comes out in black and white (dithered).
Anyone know how I can do the conversion and preserve the color?

Thanks.


--
James W. Meritt:  m23364@mwunix.mitre.org - or - jmeritt@mitre.org
The opinions above are mine.  If anyone else wants to share them, fine.
They may say so if they wish. The facts "belong" to noone and simply are.
Newsgroups: comp.graphics
From: coy@plato.ds.boeing.com (Stephen B Coy)
Subject: Re: Commercial Vivid?
Organization: Boeing Defense & Space Group
Date: Thu, 7 Jan 1993 20:47:26 GMT

In article <1ievf7INNmv@usenet.INS.CWRU.Edu> af774@cleveland.Freenet.Edu (Chad Cipiti) writes:
>
>I've heard rumors that there is a commericla version of Vivid
> coming out soon this year.  Anyone know anything about this?

No, what have you heard?

Stephen Coy
coy@plato.ds.boeing.com

:-)
From: droege@infko.uni-koblenz.de (Detlev Droege)
Newsgroups: comp.graphics
Subject: Re: fast bitmap rotation
Date: 6 Jan 1993 10:04:00 GMT
Organization: CC/CS Uni-Koblenz
Distribution: world
NNTP-Posting-Host: nebel.uni-koblenz.de

In article <6655@pdxgate.UUCP> idr@rigel.cs.pdx.edu (Ian D Romanick) writes:
> If you are rotating every single point on a machine that doesn't do matrix
> math in hardware, then you should be shot!  There are two easy ways to do
> this that are at least 100 times faster!
> 
> 1. This is the easiest, but least versitile method.  You basically shear your
>    bit map twice.  Once horizontally and once vertically.

Shearing twice is ok only for small angles. The correct method is to
shear three times (mentioned in Foley/vanDam/Feiner/Hughes on p. 831,
although not in a proper context).
This method is due to Alan Paeth and can be found e.g. in Graphic Gems Vol. 1.

You should also have a look in the FAQs of this group !!

--
Detlev Droege                          | droege@infko.uni-koblenz.de
Universitaet Koblenz,                  |       (NeXTmail ok)
Institut fuer Informatik               | Voice: +49 261 9119-421
Rheinau 3-4, D-5400 Koblenz, Germany   | Fax:   +49 261 9119-499
Xref: sparky comp.graphics:13584 alt.binaries.pictures.d:6090
From: dtb@adpgate.UUCP (Tom Beach)
Newsgroups: comp.graphics,alt.binaries.pictures.d
Subject: Need ftp site for pbmplus
Date: 8 Jan 93 16:36:47 GMT
Followup-To: poster
Organization: ADP Dealer Services R&D, Portland, OR

Would someone please send me the ftp site and path for the pbmplus
utilities package. (Yes I know it's in the FAQ but I don't have a local copy)

Thanks for your help

Tom Beach

dtb%adpgate@pdx.mcs.mot.com

********************************************************************************
* Tom Beach             *  "There are NO easy answers in benchmark testing;    *
* ADP Dealer Services   *      only difficult questions.                       *
* 2525 SW 1st Ave       *                                                      *
* Portland, OR, 97201   *                     Bill Machrone - PC Magazine      *
* adpgate!dtb@apple.com *                                                      *
********************************************************************************
Newsgroups: comp.graphics
From: glock@chip.cba.ufl.edu (Joe Granto)
Subject: GUS help, please
Organization: College of Business, University of Florida
Date: Mon, 4 Jan 1993 17:46:11 GMT

I posted a week or so ago, but go no reply.  So, here I go again:


I have the opportunity to buy a GUS and sell my SoundBlaster.  I use the 
card for games.  Someday I hope to hook up a keyboard and do some MIDI 
stuff, but that will be a while.  My question is:  should I go ahead and get 
the GUS now?  I have heard about SB compatibility problems, and was 
wondering if I should wait to get it or not.  What is the latest version of 
the GUS (or the SBOS software)?  I want to make sure I get the most 
recent stuff.  What is the best mail order place to get it from, and how 
much I am looking at for a GUS with 1 MB of memory?

Any help would be appreciated.






Joe

****************************************************************
**                 GLOCK@chip.cba.ufl.edu                     **
**                                                            **
**     "When the going gets tough, the tough get a GLOCK."    **
****************************************************************
Newsgroups: comp.graphics
From: orourke@sophia.smith.edu (Joseph O'Rourke)
Subject: Re: Finding 3D faces from coordinates
Keywords: faces 3d algorithm
Organization: Smith College, Northampton, MA, US
Date: Tue, 12 Jan 1993 14:05:42 GMT

In article <43347@sdcc12.ucsd.edu> cote@cs.ucsd.edu (Brad Cote) writes:
>Hello all,
>
>	I have a set of three dimensional coordinates from which I need to
>construct a 3 dimensional solid. Some of the coordinates are points
>which are interior to the solid. 

	Is the solid convex, i.e., without dents?  If so, then what
you seek is the convex hull of your points.  If not, then you have a
much harder problem, but there are methods in the literature nevertheless.
Newsgroups: comp.graphics
From: hausner@qucis.queensu.ca (Alejo Hausner)
Subject: Re: fast bitmap rotation
Organization: M.Sc, C.S, Queen's, Kingston, Canada.
Date: Tue, 5 Jan 1993 22:39:50 GMT

In article <1993Jan4.215419.7730@a.cs.okstate.edu> jmccorm@a.cs.okstate.edu (MCCORMICK JOSHUA C) writes:

> From article <726100620.1@freudsys.iaf>, by
> Renee.Teunissen@freudsys.iaf.nl (Renee Teunissen):
>>
>> I have the following "problem". for a Photo montage package i wrote a
>> rotation tool for full color objects [bitmap images]. this program
>> runs unther windows 3.1. but rotating these bitmaps goes very slow, eg
>> if I do the same rotation [same image size and pixel depth] in
>> PhotoStyler is goes much faster. anyone any smart idears about a
>> pointer to a fast rotation algorithm ??
>
>x' = x * cos (radians) - y * sin (radians)
>y' = y * cos (radians) + x * sin (radians)
> 

I think Foley and van Dam point out that a rotation can be decomposed
into two shears, one about the x axis and the other about the y.  If
your pixel array is n x n, each of the shears can be done in O(n) time
if the displacements for each row or column are pre-computed.  There
will be O(n x n) additions.  However, the usual method you give uses
O(n x n) multiplications, so it can be a lot slower.

I forget the way to decompose the rotation into two shears, but I can
look it up.

Alejo Hausner (hausner@qucis.queensu.ca)
Newsgroups: comp.cog-eng
From: IMAGING.CLUB@OFFICE.WANG.COM ("Imaging Club")
Newsgroups: comp.research.japan
Subject: Japanese kaizen continuous improvement
Date: 12 Jan 93 04:16:42 GMT
Organization: Mail to News Gateway at Wang Labs

In view of the major contribution that TQM has been making to the US and
Japanese electronics industry, the following "Quality" article which just
came out this week should be of a lot of interest:

                  Kaizen (continuous improvement)

Many of us in the West focus our attention mainly on quality assurance
through measurement, inspection, testing and management practices.  In
Japan, however, more attention is now being paid to a philosophy--or
perhaps better, an attitude--they call kaizen.  Literally, it means
gradual, continuous improvement, mainly in small matters, in all
aspects of working life.

This practice is explained in a book called Kaizen: The Key to Japan's
Competitive Success, by Masaaki Imai.  The English version is published
by McGraw-Hill, New York.

MOST IMPORTANT

"Kaizen is the single most important concept in Japanese management,"
Imai claims.  "It is the key to Japanese competitive success.  It means
ongoing improvement involving everyone-top management, managers, and
workers."

Kaizen begins with the recognition that any corporation can have problems.
Kaizen solves problems by establishing a corporate culture in which everyone
can freely admit to these problems.

"Kaizen movements are going on all the time in most Japanese companies,"
Imai states, "and most of them contend that management should devote at
least 50 percent of its attention to kaizen,"  He says that Japanese
managers are always looking for ways to improve systems and procedures.
This quest extends even into labor relations, marketing and supplier
relations.

"Engineers in Japanaese plants are often warned.  There will be no progress
if you keep on doing things exactly the same way all the time."

WEAK IN WEST

Imai adds that after studying Western business practices for many years,
he concludes that the kaizen concept is non-existent, or at least very
weak, in most Western companies.  "This lack of kaizen helps explain why
an American or European factory can remain exactly the same for a quarter
of a century."

Imai points out that at the same time, some Western companies are
enamoured of innovation.  He characterizes this as rapid, radical change,
usually in large matters.  Kaizen, on the other hand, consists of many
small, ongoing improvements in the status quo, as a result of continuous
efforts.

In Japan, he reports, employees are involved in kaizen through suggestion
systems, quality circles, and TQM or TQC programs.  An important point is
that once an employee's suggestion is adopted, the standard for the
activity is changed.  Thus kaizen involves flexible, changing standards,
not a lack of them.

Michael.Willett@OFFICE.Wang.com
From: uh311ae@sunmanager.lrz-muenchen.de (Henrik Klagges)
Newsgroups: comp.research.japan
Subject: Re: Kahaner Report: Facial classification by neural nets
Date: 4 Jan 93 22:18:05 GMT
Followup-To: comp.ai.neural-nets
Organization: Leibniz-Rechenzentrum, Muenchen (Germany)

[Followups to comp.ai.neural-nets please.  -- Rick]

rick@cs.arizona.edu (Rick Schlichting) writes:

> Prof. S. Tamura at Osaka University Medical School, and Asst. Prof.  H.
> Kawai ... have demonstrated that the back propagation neural network can
> identify with high accuracy the sex of persons from their faces.

That is a significant claim.
 
> The test indicated that people have an identifying ability poorer than
> the neural network [sic].  How the neural network differentiates between
> the sexes has to be elucidated.  The neural network may extract facial
> features that people cannot detect.

The fact that a vanilla bp performs better than humans on a complex task 
at which humans normally excel makes it probable that the nn's success is 
based on 'artefact' information. Such artefacts could be easily intro-
duced into the training set by e.g. taking the photos of the men & women
in separate sessions with e.g. different background lighting. A very 
simple averaging calculation could then be performed by the nn to 
distinguish between 'male' (== background A) & 'female' (== background B).
 
> ... it answered 93% correctly even for given
> 8x8-array mosaic images, which were not recognizable as human faces to
> people.

That is a picture considerably smaller than a workstation icon, and the 
latter already require lots of clever pixel editing to resemble something
like a mailbox (even if graylevels are allowed). I find it hard to believe 
that the sex of a face can be reliably inferred from a 8x8 picture _at all_.
This performance claim makes an 'artefact'-based explanation very likely.

Cheers, henrik@robots.ox.ac.uk


PS: The Kahaner reports are typically very useful and worth reading, I just
    had to comment on this one. 
PPS:If bp really does the job, send me the code - they might give me a PhD
    for it here :-) !
From: romel@lamar.ColoState.EDU (lapitan)
Newsgroups: comp.research.japan,sci.lang.japan,soc.culture.japan
Subject: Internet address at Ehime University
Date: 9 Jan 93 05:10:56 GMT
Followup-To: comp.research.japan
Organization: Colorado State University, Fort Collins, CO  80523

[Most Japanese universities now have email capabilities, although
 connectivity often varies widely by department.  A complete list 
 of email domains in Japan and hints for guessing an email address 
 are available for anonymous FTP from site cs.arizona.edu, file 
 email.domains.  -- Rick]

I am wondering if there is a way to communicate by e-mail to certain
Universities in Japan, particularly Ehime University. The specific
department is given below

	United Graduate School of Agricultural Sciences
	Ehime University
	3 Tarumi, Matsuyama 790
	Japan

I would appreciate if anyone can furnish me info on how to go about
this, including their Internet address if you happened to know it.
If there is some kind of a catalog/publication or anything of this
sort that contains info about Ehime University, and that is available
here in the US, I would appreciate some info. Thanks.

romel
From: japancs@cs.arizona.edu (Japan CS Project)
Newsgroups: comp.research.japan
Subject: SIG Notes Series (SIGCH meeting held on September 1, 1989)
Date: 4 Jan 93 22:15:52 GMT


------------------------------------------------------------------------
SIG Notes Series (SIGCH meeting held on September 1, 1989)

            published by

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

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


Computing in the Humanities
	by A. OIKAWA
	 National Institute for Educational Research, Shimomeguro 6-5-22, 
	 Meguro-ku, Tokyo 153, Japan

Nara Natioal Cultural Properties Research Institute Aerial Photograph
 Data base Retrieval System
	by T. ITOH
	 Nara National Cultural Properties Research Institute, 2-9-1
	 Nijou-chou, Nara-shi, 630, Japan

User Interface Improvements by Using The Iterative Design Method
	by H. HASHIHARA, J-K. HONG and S. SUGITA(2)
	 IBM Research, Tokyo Research Laboratory, 5-19 Sanbancho,
	 Chiyodaku, Tokyo 102
	 (2)  National Museum of Ethnology, Senri Expo Park, Suita, Osaka

Mediatheque and Computer
	by H. HATANO
	 Tokyo Metropolitan Central Library, 5-7-13 Minami-Azabu,
	 Minato-ku, Tokyo 106, Japan

Production of a Document Retrieval System in Japanese Linguisitics
	by H. NAKANO
	 The National Language Research Institute, 3-9-14 Nishigaoka,
	 Kitaku, Tokyo 115, Japan

Computer Applications for Japanese Literary Researches
	by H. YASUNAGA
	 National Institute of Japanese Literature, 1-16-10 Yutakacho,
	 Shinagawaku, Tokyo
Xref: sparky comp.research.japan:353 comp.realtime:1519
From: japancs@cs.arizona.edu (Japan CS Project)
Newsgroups: comp.research.japan,comp.realtime
Subject: Computer Software, Vol. 9, No. 3 (May 1992)
Date: 7 Jan 93 20:59:25 GMT
Followup-To: comp.research.japan


-----------------------------------------------------------------------
     COMPUTER SOFTWARE, VOL. 9, NO. 3 (May 1992)

          published by

     JAPAN SOCIETY FOR SOFTWARE SCIENCE AND TECHNOLOGY
          (in Japanese)
-----------------------------------------------------------------------

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

4	Recent Trends in Technologies of Distributed Real-Time Operating
	Systems.
	 Hideyuki Tokuda
	  Faculty of Environmental Information, Keio University / Department
 	  of Computer Science, Carnegie-Mellon University.

15	Object-Oriented Distributed Operating Systems.
	 Yasuhiko Yokote
	  Sony Computer Science Laboratory Inc.

36	A Naming Model Based on Cooperative Computation for Open Systems.
	 Yasunori Harada(1), Sin-ya Watanabe(2), and Eiichi Miyamoto(2)
	  (1)  Graduate School of Engineering, Hokkaido University.
	  (2)  Faculty of Engineering, Hokkaido University.

50	Host Migration Transparency in Wide Area Networks.
	 Fumio Teraoka(1), Yasuhiko Yokote(1), Mario Tokoro(3)
	  (1)  Sony Computer Science Laboratory, Inc.
	  (2)  Sony Computer Science Laboratory, Inc. / Department of Computer
	       Science, Keio University.

65	Distributed C Language Based on a Higher-Order RPC Technique.
	 Kazuhiko Kato(1), Takashi Masuda(1), Atsushi Ohori(2), and 
	 Takeo Murakami(3)
	  (1)  Department of Information Science, Faculty of Science,
	       University of Tokyo.
	  (2)  Kansai Laboratory, Oki Electric Corporation.
	  (3)  Department of Information Science, Faculty of Science,
	       University of Tokyo, (Currently Fujitsu Laboratories Ltd.)
From: japancs@cs.arizona.edu (Japan CS Project)
Newsgroups: comp.research.japan,comp.object
Subject: Computer Software, Vol. 9, No. 2 (March 1992)
Date: 7 Jan 93 20:57:57 GMT
Followup-To: comp.research.japan


-----------------------------------------------------------------------
     COMPUTER SOFTWARE, VOL. 9, NO. 2 (March 1992)

          published by

     JAPAN SOCIETY FOR SOFTWARE SCIENCE AND TECHNOLOGY
          (in Japanese)
-----------------------------------------------------------------------

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

3	Foundations of Object-Oriented Programming Languages.
	 Etsuya Shibayama
	  Faculty of Science and Technology, Ryukoku University.

14	Dynamic Manipulation of Types in Misty - a Statically Typed 
	Object-Oriented Programming Language.
	 Yasushi Kuno
	  Graduate School of Systems Management, University of Tsukuba, Tokyo.

28	Distributed Real-Time Programming Language:  RTC++
	 Yutaka Ishikawa(1) and HIdeyuki Tokuda(2)
	  (1)  Electrotechnical Laboratory.
	  (2)  Keio University / Carnegie Mellon University.

48	Compostitional Adaptation:  A New Method for Constructing Software
	for Open-ended Systems.
	 Yasuaki Honda(1), Shigeru Watari(1), and Mario Tokoro(2)
	  (1)  Sony Computer Science Laboratory, Inc.
	  (2)  Sony Computer Science Laboratory, Inc. and Keio Universtiy.

63	A Type Mechanism for Distributed Computing Environments with Multiple
	Languages.
	 Yasunori Harada(1), Noboru Hamada(2), Sin-ya Watanabe(3), and
         Eiichi Miyamoto(3).
	  (1)  Graduate School of Engineering, Hokkaido University.
	  (2)  CANON Inc.
	  (3)  Faculty of Engineering, Hokkaido University.

75	A Formalism for Concurrent Object-based Computing.	
	 Kohei Honda(1), Mario Tokoro(2)
	  (1)  Keio University
	  (2)  Keio University / Sony Computer Science Laboratory Inc.


Xref: sparky comp.research.japan:344 comp.theory:2785
From: rick@cs.arizona.edu (Rick Schlichting)
Newsgroups: comp.research.japan,sci.lang.japan,soc.culture.japan
Subject: Overview of comp.research.japan [periodic posting, revised 1/5/93]
Date: 6 Jan 93 15:04:22 GMT
Followup-To: comp.research.japan


Welcome to comp.research.japan, a newsgroup devoted to Japanese 
research developments in computing and computer science.  This posting 
provides a general overview of the group and describes how to submit
articles.  Companion postings in comp.research.japan describe other aspects 
of the newsgroup, including regular features such as Kahaner Reports and 
information generated by the Japan CS Project, past articles that are 
available for anonymous FTP from The University of Arizona, etc.

OVERVIEW:

The basic purpose of this newsgroup is to increase the awareness of 
Japanese computing and CS by providing a forum for publicizing this 
work and for subsequent discussions.  For example, articles of the 
following type are appropriate for this newsgroup:

       -- Information about CS research papers published in Japan, 
          including titles, authors, and (where feasible) abstracts.
          This includes papers in both English and Japanese.

       -- Descriptions of current Japanese computing and CS activities,
          trip reports to Japanese universities and companies, etc.

       -- Announcements related to computing and CS in Japan, including 
          those related to conferences held in Japan, research opportunities 
          in Japan, funding for research visits to Japan, etc.

       -- Queries related to computing and CS research underway in Japan.

       -- General discussions on computing and CS in Japan, both academic 
          and industrial.

Articles related to the Japanese language should be submitted to 
sci.lang.japan, while more general articles on Japanese life and
culture should be submitted to soc.culture.japan.

comp.research.japan is a moderated newsgroup, which means that
articles first go to me as moderator before being posted to the
newsgroup.  The role of the moderator here is to avoid duplicate
postings, redirect articles more appropriately submitted elsewhere,
actively solicit articles, etc. 

SUBMISSIONS:

Articles can be submitted by the normal posting mechanism in
most news reading programs; the software will then mail them 
to the moderator for posting.  Articles for posting can also
be submitted by email to address "japan@cs.arizona.edu".
Comments, questions, etc. that are not intended for posting
can be submitted to me directly at "rick@cs.arizona.edu."

-------------------------------------------------------------------------
Rick Schlichting, Associate Professor           (rick@cs.arizona.edu) 
Dept of Computer Science,  The University of Arizona
-------------------------------------------------------------------------