From gita@eng.umd.edu (Rajesh N. Raghavan)
Newsgroups: comp.infosystems,comp.misc,comp.groupware,soc.culture.indian
Subject: Invasion of Privacy ?
Date: 31 Mar 1993 03:56:44 GMT
Organization: Project GLUE, University of Maryland, College Park
Lines: 5
Distribution: world
Message-ID: <1pb4psINNnff@mojo.eng.umd.edu>
NNTP-Posting-Host: coke.eng.umd.edu

	Technology has advanced so far that it has even influenced the way we   
communicate and collaborate at work. Through the innovative linkup of computers such as the Colab setup designed by Xerox PARC, and also through the use of other technology such as Groupware, various aids to communication and collaboration have been developed.

	I am interested to know if anyone has been involved with the use of 
these or other collaborative tools, and if so whether you have found this to be an invasion of your privacy in any way.


From gita@eng.umd.edu (Rajesh N. Raghavan)
Newsgroups: comp.infosystems,comp.misc,comp.groupware,soc.culture.indian
Subject: Digital Telephony Legislation, an invasion of privacy?
Date: 31 Mar 1993 04:46:54 GMT
Organization: Project GLUE, University of Maryland, College Park
Lines: 4
Distribution: usa
Message-ID: <1pb7nuINNo8g@mojo.eng.umd.edu>
NNTP-Posting-Host: coke.eng.umd.edu

	Under current U.S law, the government may tap a telephone  lineof any    suspected criminal, by obtaining a court order. However, due to advances in     technology such as fibre optics and ISDN(Integrated Services Digital Network)   tapping is not as easy as it was previously. The reason for this is that while the intercept capability is technically feasible, not all companies have        systems designed for it. Thus the FBI and other law enforcement agencies are 
having a difficult time implementing court ordered surveillance, and hence an    effort on the part of the Justice Department to bring about digital telephony
  legislation forcing telephone companies to provide the required intercept capabilities. While the proponents maintain that they are just seeking what they      always had, others disagree saying that it would hold back technology, jeopardize security and privacy, and cost so much that finacially it would not be just
ifiable. I am writing a paper on this topic for a graduate level class and would   appreciate yours views about this. I will be more than willing to post reponses.Thanks a lot in advance. 


From tauber@uni-paderborn.de (Michael Tauber)
Newsgroups: comp.groupware
Subject: CSCW Workshop, Design of CSCW, Austria, June 1993
Date: 31 Mar 1993 20:03:53 +0200
Organization: Universitaet Paderborn, Germany
Lines: 329
Message-ID: <1pcme9INNd44@uni-paderborn.de>
NNTP-Posting-Host: uni-paderborn.de


COMPUTER SCIENCE DEPARTMENT, JOHANNES KEPLER UNIVERSITY LINZ (AUSTRIA)
in cooperation with
EUROPEAN ASSOCIATION FOR COGNITIVE ERGONOMICS (EACE) and
IFIP WORKING GROUP 13.2 ON METHODOLOGY OF USER CENTERED DESIGN


           DESIGN OF COMPUTER SUPPORTED COOPERATIVE WORK
                        AND GROUPWARE SYSTEMS

                 12th Interdisciplinary Workshop on
                    "Informatics and Psychology"



TIME:  June 1-3, 1993
PLACE: Schaerding, Austria (Kammer der Gewerblichen Wirtschaft)


STEERING COMMITTEE:

Michael J. Tauber, University Paderborn
Roland Traunmueller, Johannes Kepler University Linz
Gerrit C. van der Veer, Free University Amsterdam


PROGRAMME COMMITTEE:

Liam Bannon, Ireland
Victoria Bellotti, United Kingdom
Susanne Boedker, Denmark
Alain Giboin, France
Brigitte Jordan, USA
Simon Kaplan, USA
Jintae Lee, USA 
Wolfgang Prinz, Germany
Kjeld Schmidt, Denmark
Dan Shapiro, United Kingdom (Co-Chair)
A Min Tjoa, Austria
Roland Traunmueller, Austria (Co-Chair)



                        Preliminary programme


Monday, 31 May 1993, 20.00

Informal meeting in the "Gasthaus zur Stiege"


Tuesday, 1 June 1993, 8.30 - 9.30

Registration in the "Kammer der Gewerblichen Wirtschaft"


Tuesday, 1 June 1993, 9.30 - 13.00

Dan Shapiro and Michael J. Tauber
Welcome and introduction


SESSION 1: ETHNOGRAPHY AND DESIGN

Brigitte Jordan, Xerox PARC and IRL
Ethnographic workplace studies and CSCW

John Hughes, Val King, John Mariani, Tom Rodden and Mike Twidale, 
CSCW Research Center Lancaster
Paperwork and its lessons for database systems: An initial assessment

Akira Miyoshi, Toshiba Corporation
Some considerations upon utilization of a bulletin board system


Tuesday, 1 June 1993, 14.30 - 18.30                          

SESSION 2: GROUPWARE REQUIREMENTS

Thomas Herrmann, Volker Wulf and Anja Hartmann, University Bonn
Requirements for human-centred design of groupware

Peter Mambrey, GMD St. Augustin
Negotiation and bargaining. The market metaphor as a requirement analysis tool 
in CSCW design

Kishore Sengupta and Dov Te'eni, Naval Postgraduate School and 
Bar-Ilan University
Incorporating multiple levels of information processing in CSCW: An
Integrated Design Approach

Dirk Mahling, University of Pittsburgh
Approaching design for integrated CSCW-DAI systems


Tuesday, 1 June 1993, 20.00

Conference Dinner (Romantikhotel Gasthaus Forstinger)


Wednesday, 2 June 1993, 9.00 - 13.00                         

SESSION 3: TOOLS AND PLATFORMS

Kjeld Schmidt and Tom Rodden, 
Risoe National Laboratory and Lancaster University
Putting it all together: Requirements for a CSCW platform

I.T. Hawryszkiewycz, University of Technology Sydney
A CSCW design tool concept based on generic concepts

Norihiko Matsuura, Go Fujino, Ken-ichi Okada and Yukata Matsushita,
Matsushita Lab and Keio University
Venus: A tele-communication environment to support awareness for informal 
interactions

Franz Penz and Pedro Antunes, INESC Lisbon
Feedback in computer supported cooperation systems: Example of the user
interface design for a talk-like tool

Jan Rekers and I. Sprinkhuizen-Kuyper, University Leiden
A LOTOS specification of a CSCW tool


Wednesday, 2 June 1993, 14.30 - 21.00    

Trip and dinner (Heurigenjause)


Thursday, 3 June 1993, 9.00 - 12.00 

SESSION 4: COMBINING APPROACHES

Kari Kuutti, University of Oulu
Coping with active subjects - the emergence of CSCW from IS and HCI traditions

Dan Shapiro, CSCW Research Center Lancaster
Ferrets in a sack? Ethnographic studies and task analysis in CSCW

D.A. Bell and Peter Johnson, Queen Mary College
A contingency model for groupware design and tailoring


Thursday, 3 June 1993, 14.00 - 17.00                 

SESSION 5: RE-EVALUATIONS

Douglas Bogia, William Tollone, Celsina Bignole and Simon Kaplan,
University of Illinois at Urbana-Champaign,
Issues in the design of collaborative systems: Lessons from 
'Conversation Builder'

Liam Bannon, University Limerick
Use, design and evaluation: Steps towards an integration

Thomas Schael, RSO Milano
System design for cooperative work in the language action perspective:
A case study

Dan Shapiro
Closing




CONFERENCE FEE

Austrian Schilling 3.000,-- (members of EACE)
Austrian Schilling 3.200,-- (others)

(1 US$ is about 11 Austrian Schilling)

The conference fee includes refreshments, conference dinner (1 June), 
trip (2 June), and Heurigenjause (dinner at June 2).
It includes also preprints of the papers presented at the conference.


FOR FURTHER INFORMATIONS PLEASE CONTACT

Michael J. Tauber
University Paderborn, FB 17
Warburgerstr. 100
D-4790 Paderborn
Germany

Phone: +49 (5251) 60 2637 or 60 2617
FAX:   +49 (5251) 60 3836
email: tauber@uni-paderborn.de



HOW TO TRAVEL TO SCHAERDING

Schaerding is a small famous baroque town in the north of Austria
(Upper Austria / Oberoesterreich). It is located at the river Inn
about 20 km south of the town Passau where the Inn goes into the
river Danube (Donau). 

Please note that "Schaerding" is not the exact spelling. The "ae"
has to be replaced by the German "Umlaut a" which is an "a" with two dots
above the "a".

Airports next to Schaerding are Munich, Salzburg, and Linz. Also Vienna
can be taken. 

- Trains from Munich to Passau run about every two hours.
  (a taxi from Passau to Schaerding costs 35 - 40 German Marks)
- Trains from Passau to Schaerding run every two hours.
- Trains from Vienna/Linz to Schaerding run every two hours.
- From Salzburg you have to take a train toward Vienna and change for 
  Schaerding in Wels. Trains from Wels to Schaerding run every 
  two hours.



=========================================================================

         	     REGISTRATION FORM (CSCW WORKSHOP)


Member of EACE:		__ AS 3.000,--

Non-members:		__ AS 3.200,--

The conference fee includes refreshments, conference dinner, trip, and a
dinner at Wednesday, 2 June. It includes also a preprint of the papers
presented at the conference.

Payment was made by:

___  Cheque enclosed

___  Transferred 


The conference fee can be transferred to

	Workshop Schaerding		(account name)
	2600-008508 			(account number)
	Sparkasse Muehlviertel-West	(name of the bank)
	A-4190 Bad Leonfelden, Austria	(address of the bank)
	BLZ 20 334			(Bankleitzahl, id of the bank)
	


PLEASE INDICATE PARTICIPANTS NAME(S) AND INSTITUTE/COMPANY ON THE CHEQUE !


Name: ......................................... 

Institution: ..................................

Date: .......................................

Signature: ................................................................


PLEASE SEND THIS FORM TO

Prof. Dr. Roland Traunmueller
Institut fuer Informatik
Johannes Kepler Universitaet Linz
A-4040 Linz
Austria

FAX:	+43 (732) 2468 9308
EMAIL:	traunm@inf-wvg.uni-linz.ac.at

===========================================================================

			ACCOMMODATION RESERVATION FORM
				CSCW WORKSHOP

Please send this form directly to

	Tourismusverband Schaerding
	Unterer Stadtplatz 1
	A-4780 Schaerding
	Austria

	Phone:	+43 (7712) 4300
	Fax: 	+43 (7712) 4320


NAME: ..........................................................
Name


ADRESSE: .......................................................
Address		


ANKUNFTSTAG: ..................
Day of Arrival			


ABREISETAG: ...................
Day of Departure


ICH BESTELLE:      ............... EINZELZIMMER / single rooms(s)
I wish to order

                   ............... ZWEIBETTZIMMER / double room(s)


PREIS-KATEGORIE 	 o A = AS 450,--  -  AS 700,--
Price category		 o B = AS 350,--  -  AS 450,--

Preiskategorie A + B mit Bad/Dusche/WC
Price category A + B with bath/shower/WC

			 o C = below AS 350,--

Preiskategorie C ohne Bad/Dusche/WC
Price category C without bath/shower/WC

Die Preise beinhalten Uebernachtung mit Fruehstueck pro Person/Tag.
The prices include accommodation and breakfast per person and night



---------------------		
Datum/date			


------------------------------------
Unterschrift/signature



From sigdoc@watarts.uwaterloo.ca (Paul Beam)
Subject: Extended Deadline: SIGDOC'93 => April 13th, 1993
Message-ID: <C4rvzB.G6o@watserv2.uwaterloo.ca>
Summary: ACM Special Interest Group on Documentation
Keywords: online, hypermedia, multimedia, technical communication
Sender: news@watserv2.uwaterloo.ca
Organization: University of Waterloo
Date: Wed, 31 Mar 1993 21:35:34 GMT
Lines: 125



                                  SIGDOC'93
                                CALL FOR PAPERS

Getting In Touch--Staying In Touch:
Moving Online and Multimedia Systems Into The Workplace

The 11th Annual International Conference

October 5 to 8, 1993 at The Valhalla Inn, Kitchener, Ontario, Canada

Sponsored by the Association for Computing Machinery, SPECIAL INTEREST
GROUP on DOCUMENTATION -- SIGDOC 

SIGDOC, with the University of Waterloo, 
        and in co-operation with the STC and the IEEE  


announces its   Call For Papers for SIGDOC '93

The SIGDOC'93 Conference Committee feels that multimedia tools have 
made technical strides sufficient to warrant a major overview this year. 
Because it includes graphics, video-imaging, sound, animation and 
hyperlinks, it has important uses for our field. We are adding new
research presentations in areas of Sound & Sight, electronic networking 
for writers and designers to enable the exchange of information and tools 
and innovations in quality/efficiency assessment to last year's themes.

Online capabilities constitute a new development for SIGDOC. We are
attempting to use online and e-mail facilities to make the conference 
procedure more efficient and informative. We'd appreciate you
using e-mail for your abstracts, registration and for electronic 
contacts around the conference itself.  We hope you find the online
structure an efficient way to gain information, to send us your materials 
and to maintain contact with SIGDOC. 

Please remember to include a plain ascii version of your abstract and
if possible, a uuencoded/compressed postscript file.

You are invited to submit a proposal to present one of the 36 
research papers of 40 minutes each which will focus on issues under 
the following themes:

* Multimedia projects for on-site and remote training.

* The optimized network: patterns of materials, media and delivery 
  across a variety of communications systems and links.

* Planning and design: matching document types with multimedia 
  technologies.

* Tools: automated testing and information building.

* Optimization: hardware/software strategies and solutions; 
  affordability issues; effective distribution designs.

* Quality, usability and testing applied to efficient design techniques.

* Getting in touch: networks, tools and techniques to support online 
  help and information structures for technical writers.

* Sight and Sound: innovations in computer techniques to enhance 
  design, expression and learning.

  We encourage a broad interpretation of these themes and will reply to
  queries about the appropriateness and relevance of a particular topic by
  e-mail to>   sigdoc@watarts.uwaterloo.ca


SUBMITTING AN ABSTRACT OF RESEARCH FOR THE CONFERENCE

Presentation proposals must include:

* A 500- to 1000-word description of the session topic, outlining the 
  thesis, main points and implications for the field. Please describe
  the methods used to develop your thesis and conclusions.

* The name, title, organization, address and telephone number of each 
  participant in the presentation. Please indicate which participant is 
  the principal contact.

* A brief statement of how this abstract fits one or more topics.

* Software discussed in presentations should be available for display 
  at the conference.

Please send your proposal to:

SIGDOC 93
The University of Waterloo
200 University Ave. W.
Waterloo, Ontario Canada, N2L 3G1

Telephone: (519) 885-1211 x6833 / Fax: (519) 725-1701
E-mail address: sigdoc@watarts.uwaterloo.ca

All proposals must be received by April 13th, 1993. You will be 
notified if your proposal is accepted by May 10, 1993. All accepted 
papers will be published in the conference proceedings (copyright 
ACM). To be included in the proceedings, camera-ready copy must be 
received by July 12th, 1993.

Address questions to:
Paul Beam, Conference Chair, (pdbeam@watarts.uwaterloo.ca)

Presentation Format

* Practical applications from the research initiatives (specific
  instructional and demonstration materials, programs and 
  writing aids which apply to your presentation will enhance it in 
  their minds). 

* Demonstrations of the systems, tools, products and the 
  programs which run the studies described in your paper.

* Presentations are to an audience of up to 120 people in a room with 
  overhead/slide/computer-display capabilities. The presentations 
  should occupy 30 minutes with a question-answer session and a
  brief time for room changes between sessions.

We look forward to receiving your abstracts and to having you participate
in the conference.




From EA547@levice.educ.ualberta.ca (784998)
Subject: Re: Announcement: International KNOBELN contest
Message-ID: <EA547.11@levice.educ.ualberta.ca>
Sender: news@kakwa.ucs.ualberta.ca
Nntp-Posting-Host: levice.educ.ualberta.ca
Organization: Faculty of Education, University of Alberta
References: <1opvlsINNbsp@irau40.ira.uka.de>
Date: Wed, 31 Mar 1993 22:00:04 GMT
Lines: 399

In article <1opvlsINNbsp@irau40.ira.uka.de> prechelt@ira.uka.de (Lutz Prechelt) writes:
>       ===============================================

>         First announcement of the 1st international

>        KNOBELN --- Game-Strategy Programming Contest

>       ===============================================

>This is an announcement for the KNOBELN-contest, taking place via
>e-mail on Saturday, May 8th, 1993 and on Sunday, May 16th, 1993.

>The contest is run at the University of Karlsruhe, Germany, by
>Lutz Prechelt.

>Arbitrary teams can participate in the contest.

>PLEASE REDISTRIBUTE THIS ANNOUNCEMENT AS WIDELY AS YOU LIKE.



>-----------------
>Type of Contest:
>-----------------

>To participate, you must program in C a strategy for a simple game 
>and send it to me by email. The game is quite interesting since there 
>clearly is no canonical best strategy (the success of a strategy depends
>on the behavior of all other participants).



>--------------
>Rules of Game:
>--------------

>1. Both players (at the same time) chose an integer number in the interval 
>     a..b.
>   This selection of two numbers is called a "throw".
>   The players can watch each throw as it is made (i.e. they can know
>   all numbers they and their opponent have thrown up to the 
>   current throw)
>   Assumption:  Player P choses p1 and player Q choses q1.

>2. If p1 equals q1, nobody wins a point.

>3. The player with the higher number wins, unless the number is more 
>   than twice as high as that of his opponent.
>   Let's assume that p1 > q1, then
>     P wins if 2*q1 >= p1 and
>     Q wins if 2*q1 <  p1.

>4. A player who wins a throw with some number N gets
>     floor(log2(N)) points
>   in this throw.
>   The other player gets 0 points in this throw.
>   Example: if P wins, he/she gets floor(log2(p1)) points
>            e.g. if p1 = 6800, player P gets 12 points.

>5. A game consists of L throws.

>6. Both players must throw series of non-decreasing throws.
>   These series must (for each player individually) have a length
>   of AT LEAST k throws.
>   Example: If P1 throws (p1, p2, p3, .....) then
>            p1 <= p2 <= p3 <= ... <= p(k) is required.
>            After that, p(k) > p(k+1) is allowed.
>            If p(k) > p(k+1) then
>               p(k+1) <= p(k+2) <= ... <= p(k+k) is required.
>            else 
>               there exists some smallest number j, with j > k for which
>               p(j) > p(j+1)
>            and then 
>               p(j+1) <= p(j+2) <= ... <= p(j+k) is required.
>            and so on through the whole game.
>      If for instance k = 3 then the sequence
>        1, 2, 3, 1, 4, 5, 6, 8, 2    is allowed, while
>        1, 2, 3, 4, 1, 2, 1          is not
>                          ^ too early

>In this turnament the parameters are:
>  a = 1,  b = 12288,  k = 8,  L = 1000
>   


>--------------------
>Rules of Tournament:
>--------------------

>The tournament is performed in successive rounds with randomly mixed 
>groups of 7 to 12 participants. Within each group, every strategy
>plays one game against every other strategy in that group.

>Those half of the participants (rounded up), that have won most
>points in their group (no matter how many their opponents got), proceed
>to the next round, which is played with newly mixed groups.
>The winners of the last round are the winners of the tournament;
>the results of previous rounds are discarded.

>Any strategy is allowed to fail once per round. Failing means doing
>anything that is disallowed according to the rules of the game.
>The game in question is immediately stopped, its intermediate results
>are discarded and it is rescheduled after all the other games currently 
>scheduled for that group.
>If the strategy who failed had already failed before in the same round,
>the game is not rescheduled but the strategy is disqualified from the 
>contest. 
>All its remaining games in that round will not be carried out and
>all its previous games in that round will not be counted.

>This tournament is performed twice to find the winners of the contest:
>After the first tournament is performed, there is an eight day pause,
>during which the contestants can revise and change their strategy based
>on the game protocols of their games in the first contest (see below).
>Then the second tournament with identical rules and the same (or a
>reduced) set of participants is carried out.
>Those teams with the highest total rank in both tournaments will
>be announced as winners of the contest.

>See section 'requirements for programs' for additional rules.



>----------------------------
>Characteristics of the Game:
>----------------------------

>The method of counting within a game and the method of selecting the
>winners of a group have an interesting impact on the goal of a
>strategy: It must actually try to arrange a cooperation with its
>'opponent', because otherwise none of the two will usually be able to
>win many points. 

>It is NOT important to have more points than the opponent in any
>single game. Instead it is important to have more points than the
>other strategies on the average.

>The problem of programming a strategy could thus be formulated as
>  How do I (quickly) arrange a cooperation with a machine partner, if
>  there is no predefined protocol to do so and the only communication
>  channel is mutual exchange of integers, one at a time ?
>  
>It is clear, that there exists no optimal strategy: It is impossible
>to guarantee that a strategy A is able to arrange a cooperation with a
>strategy B, even if both are perfectly willing to cooperate in
>principle. This is true because both strategies have to 'guess' what
>might be suitable protocols to communicate. The two strategies of a game
>should together form a self-organizing system that organizes for
>cooperation.

>I think this makes the contest very interesting.
>By the way: This game is probably interesting to play with human
>            players, too.



>------------------------------
>How to Announce Participation:
>------------------------------

>If you want to participate in the contest, send email of the
>following form:

>---
>To: prechelt@ira.uka.de
>Subject: registration for KNOBELN

>email-address:   ourname@machine.domain.alfdkj
>mail-preference: LAP,LGP,DGP,GRR
>team-name:       the_heavy_lords_of_knobeln 
>Organization:    University of Northeast Sacrodata
>team-members:
>  Joe Cool,  45, professional systems programmer,
>     20-year-experienced programmer
>  Jane More, 20, graduate student of computer science,
>     hackeress fluent in 34 programming languages
>  Mona Morn, 35, Professor of CS,
>     hobby game strategy programmer
>  Bill Neat, 24, undergraduate student of psychology,
>     advanced beginner (will be my first C program!)
>---

>Please use this format exactly as shown.

>- "email-address" gives the email address that uniquely 
>  identifies the team, it should be an internet domain style address.
>- "mail-preference" is a comma-separated list of some of the following
>  declarators:
>    LAP  send list of all participants (full registration format)
>    LGP  send list of my groups' participants (team names only)
>    DGP  send detailed game protocol for each of my games (every throw)
>    GRP  send game result (points) for each of my games
>    GRG  send group result (all games of all participants)
>    GRR  send group result (ranking)

>- "team-name" can be any string that is a valid C identifier of at
>  most 50 characters and should be a funny name for the team.
>- "Organization" should be the name of the institution the team is at
>  or something else sensible, if no such thing exists.
>- "team-members" should contain a two-line informal description of each 
>  member of the team, giving his/her
>     name, age in years, occupation,
>        programming background, 
>  in this order.
>  Team size should be anywhere between 1 and 20.
>  Personnel should not be shared among teams.

>When I receive your registration, I will send an answer either
>  (a) that your registration is not accepted, (e.g. because there are
>      already too many participants registered), or
>  (b) that your registration is accepted and your authentification 
>      string is <somethingweird>. I may also tell you that I have 
>      slightly modified your team name, if it conflicts with an already 
>      registered one.
>Notes:
>- If you are unable to send email to me or if I am unable to send email 
>  to you, you can not participate in the contest.
>  Please use only Internet domain style email addresses.  
>- Notification of acceptance or rejection will usually be sent within 
>  72 hours.
>  I reserve the right to limit participation of multiple teams from the 
>  same organization.
>- You must keep the authentification string carefully.
>  It will be used to check, whether a strategy that swears to come
>  from your team really does (see below "Sending Programs").



>-----------------
>Sending Programs:
>-----------------

>To send in the first version or a new version of your program,
>send me email of the following form:

>----
>To: prechelt@ira.uka.de
>Subject: please compile

>/*
>  <<FROM>> team_name  authentification_string
>*/
>/* your source code goes here */
>----

><<FROM>> has to be given exactly as shown. The same is true for the 
>"Subject:".
>For <team_name> insert the name of your team as given in the registration.
>For <authentification_string> insert the string that I sent you with the
>registration acknowledge.

>Your program will be compiled automatically a few minutes after your 
>email arrives and you will be sent a report about the results of the 
>compilation. A successfully compiled program is automatically stored 
>to be used in the contest. The latest version is used always.



>---------------------------
>Requirements for programs:
>---------------------------

>1. Pure C (Ansi or KR), i.e., no library routines called, except
>     int init_random ()
>     int log2 (int number)
>     int next_random (int low, int high)
>     int make_throw (int my_throw)
>     int count_points (int throw1, int throw2, int *points1, int *points2);
>   (You will receive a detailed description of these functions
>    upon registration)

>2. Must be compilable with GNU C compiler (gcc).

>3. Must be in a single file, no #includes

>4. Must have at most 10000 lexical elements (after preprocessing)
>   Lexical elements are: 
>      identifier, keyword, number, 
>      string denoter, char denoter, 
>      special character
>   NO lexical elements (i.e. not counted) are: 
>      blank, Tab, newline, comment

>5. The size of the process that runs the program must not grow 
>   beyond 1024 kB on a SUN 4/25 running SUN OS 4.1.
>   The value used to test this is the one shown by 'ps -u' in the column
>   labeled 'SZ' (SIZE).

>6. Must finish every game of 1000 throws in less than 60 seconds of cpu
>   time on a SUN 4/25 (which has about 20 SPECmarks).



>------------------------------
>Recommendations for programs:
>------------------------------

>1. Should not use floating point operations. (Or you do it on your own risk)

>2. Should be infinite loop (i.e. need not terminate after 1000 throws)



>-----------------------
>Technical Environment:
>-----------------------

>In order to write and hand-test a strategy, you need the definitions
>of the library procedures mentioned above, called 'knobellib.c'.
>The source code for these functions is only 130 lines and will be 
>sent to you via email with the notification of acceptance of your
>registration. Link your strategy with this module, but do not include
>the source code of the module into your strategy or else it will
>be rejected.

>If you want to run complete games between two strategies in the same
>kind of environment that will be used in the actual contest, you need
>the source code of the 'knobeln' program. You will need an ANSI-C
>compiler and a UNIX machine in order to compile and run it. 
>There are two ways to get this source code (about 22 kB):

>1. To get 'knobeln.c' by anonymous ftp (prefered method), fetch it from
>   Sanfrancisco.ira.uka.de [129.13.13.110]:  /pub/knobeln.c

>2. To get 'knobeln.c' by mailserver, send email of the following form:
>   ---
>   To: prechelt@ira.uka.de
>   Subject: SEND knobeln.c
>   ---



>--------------------
>The Actual Contest:
>--------------------

>The actual tournaments will be run at the dates given below.

>At some time before, every team has to send its strategy as described
>above. It will be compiled and linked automatically, and you will
>receive a report about the success of this procedure or any problems
>that occur.
>This automatic compilation feature is disabled during the tournaments.

>During the contest, all participants will receive information about
>what happens, if they have announced a corresponding mail-preference 
>upon registration: 

>After every game, a detailed throw protocol or a short game result
>file (giving only the points at the end) is sent to both participants
>(if requested by their mail-preference, see in 'Registration' above);
>after every round the group summary is sent to all members of that
>group (if requested by their mail-preference).



>-------------
>Legal Issues:
>-------------

>By applying for registrations all members of a team assert that they
>understand and agree with the following points:
>1. All participants of the last round of one of the tournaments
>   will send a verbal description of how their strategy 
>   works (length 100 to 500 words) after the contest.
>2. The team members allow the organizer of the contest to publish
>   all or part of the information contained in the strategy program
>   and in the strategy description. Such publication will mention 
>   the contest context and will give credit to the team by
>   mentioning the team name or the team's organization or the names 
>   of one or several team members.


>----------------
>Important Dates:
>----------------

>93/03/28    beginning of registration
>93/03/31    beginning of registration acknowledge
>93/03/31    beginning of compilation service
>93/05/07    registration deadline
>93/05/08    first tournament of contest
>93/05/16    second tournament of contest
>93/05/20    Results posted to Usenet: rec.games.misc, misc.misc

>Relevant time of day is noon, Universal Time (UT, GMT), for all dates.


>Good luck and have fun !

>  Lutz
>  
>-- 
>Lutz Prechelt   (email: prechelt@ira.uka.de)            | Whenever you 
>Institut fuer Programmstrukturen und Datenorganisation  | complicate things,
>Universitaet Karlsruhe;  D-7500 Karlsruhe 1;  Germany   | they get
>(Voice: ++49/721/608-4068, FAX: ++49/721/694092)        | less simple.
I will distribute this announcement to Alberta Education Consultants in this 
area.  Best of luck.


From EA547@levice.educ.ualberta.ca (784998)
Subject: Re:  KNOBELN contest
Message-ID: <EA547.12@levice.educ.ualberta.ca>
Sender: news@kakwa.ucs.ualberta.ca
Nntp-Posting-Host: levice.educ.ualberta.ca
Organization: Faculty of Education, University of Alberta
References: <1opvlsINNbsp@irau40.ira.uka.de>
Date: Wed, 31 Mar 1993 22:06:29 GMT
Lines: 406

In article <1opvlsINNbsp@irau40.ira.uka.de> prechelt@ira.uka.de (Lutz Prechelt) writes:
>       ===============================================

>         First announcement of the 1st international

>        KNOBELN --- Game-Strategy Programming Contest

>       ===============================================

>This is an announcement for the KNOBELN-contest, taking place via
>e-mail on Saturday, May 8th, 1993 and on Sunday, May 16th, 1993.

>The contest is run at the University of Karlsruhe, Germany, by
>Lutz Prechelt.

>Arbitrary teams can participate in the contest.

>PLEASE REDISTRIBUTE THIS ANNOUNCEMENT AS WIDELY AS YOU LIKE.



>-----------------
>Type of Contest:
>-----------------

>To participate, you must program in C a strategy for a simple game 
>and send it to me by email. The game is quite interesting since there 
>clearly is no canonical best strategy (the success of a strategy depends
>on the behavior of all other participants).



>--------------
>Rules of Game:
>--------------

>1. Both players (at the same time) chose an integer number in the interval 
>     a..b.
>   This selection of two numbers is called a "throw".
>   The players can watch each throw as it is made (i.e. they can know
>   all numbers they and their opponent have thrown up to the 
>   current throw)
>   Assumption:  Player P choses p1 and player Q choses q1.

>2. If p1 equals q1, nobody wins a point.

>3. The player with the higher number wins, unless the number is more 
>   than twice as high as that of his opponent.
>   Let's assume that p1 > q1, then
>     P wins if 2*q1 >= p1 and
>     Q wins if 2*q1 <  p1.

>4. A player who wins a throw with some number N gets
>     floor(log2(N)) points
>   in this throw.
>   The other player gets 0 points in this throw.
>   Example: if P wins, he/she gets floor(log2(p1)) points
>            e.g. if p1 = 6800, player P gets 12 points.

>5. A game consists of L throws.

>6. Both players must throw series of non-decreasing throws.
>   These series must (for each player individually) have a length
>   of AT LEAST k throws.
>   Example: If P1 throws (p1, p2, p3, .....) then
>            p1 <= p2 <= p3 <= ... <= p(k) is required.
>            After that, p(k) > p(k+1) is allowed.
>            If p(k) > p(k+1) then
>               p(k+1) <= p(k+2) <= ... <= p(k+k) is required.
>            else 
>               there exists some smallest number j, with j > k for which
>               p(j) > p(j+1)
>            and then 
>               p(j+1) <= p(j+2) <= ... <= p(j+k) is required.
>            and so on through the whole game.
>      If for instance k = 3 then the sequence
>        1, 2, 3, 1, 4, 5, 6, 8, 2    is allowed, while
>        1, 2, 3, 4, 1, 2, 1          is not
>                          ^ too early

>In this turnament the parameters are:
>  a = 1,  b = 12288,  k = 8,  L = 1000
>   


>--------------------
>Rules of Tournament:
>--------------------

>The tournament is performed in successive rounds with randomly mixed 
>groups of 7 to 12 participants. Within each group, every strategy
>plays one game against every other strategy in that group.

>Those half of the participants (rounded up), that have won most
>points in their group (no matter how many their opponents got), proceed
>to the next round, which is played with newly mixed groups.
>The winners of the last round are the winners of the tournament;
>the results of previous rounds are discarded.

>Any strategy is allowed to fail once per round. Failing means doing
>anything that is disallowed according to the rules of the game.
>The game in question is immediately stopped, its intermediate results
>are discarded and it is rescheduled after all the other games currently 
>scheduled for that group.
>If the strategy who failed had already failed before in the same round,
>the game is not rescheduled but the strategy is disqualified from the 
>contest. 
>All its remaining games in that round will not be carried out and
>all its previous games in that round will not be counted.

>This tournament is performed twice to find the winners of the contest:
>After the first tournament is performed, there is an eight day pause,
>during which the contestants can revise and change their strategy based
>on the game protocols of their games in the first contest (see below).
>Then the second tournament with identical rules and the same (or a
>reduced) set of participants is carried out.
>Those teams with the highest total rank in both tournaments will
>be announced as winners of the contest.

>See section 'requirements for programs' for additional rules.



>----------------------------
>Characteristics of the Game:
>----------------------------

>The method of counting within a game and the method of selecting the
>winners of a group have an interesting impact on the goal of a
>strategy: It must actually try to arrange a cooperation with its
>'opponent', because otherwise none of the two will usually be able to
>win many points. 

>It is NOT important to have more points than the opponent in any
>single game. Instead it is important to have more points than the
>other strategies on the average.

>The problem of programming a strategy could thus be formulated as
>  How do I (quickly) arrange a cooperation with a machine partner, if
>  there is no predefined protocol to do so and the only communication
>  channel is mutual exchange of integers, one at a time ?
>  
>It is clear, that there exists no optimal strategy: It is impossible
>to guarantee that a strategy A is able to arrange a cooperation with a
>strategy B, even if both are perfectly willing to cooperate in
>principle. This is true because both strategies have to 'guess' what
>might be suitable protocols to communicate. The two strategies of a game
>should together form a self-organizing system that organizes for
>cooperation.

>I think this makes the contest very interesting.
>By the way: This game is probably interesting to play with human
>            players, too.



>------------------------------
>How to Announce Participation:
>------------------------------

>If you want to participate in the contest, send email of the
>following form:

>---
>To: prechelt@ira.uka.de
>Subject: registration for KNOBELN

>email-address:   ourname@machine.domain.alfdkj
>mail-preference: LAP,LGP,DGP,GRR
>team-name:       the_heavy_lords_of_knobeln 
>Organization:    University of Northeast Sacrodata
>team-members:
>  Joe Cool,  45, professional systems programmer,
>     20-year-experienced programmer
>  Jane More, 20, graduate student of computer science,
>     hackeress fluent in 34 programming languages
>  Mona Morn, 35, Professor of CS,
>     hobby game strategy programmer
>  Bill Neat, 24, undergraduate student of psychology,
>     advanced beginner (will be my first C program!)
>---

>Please use this format exactly as shown.

>- "email-address" gives the email address that uniquely 
>  identifies the team, it should be an internet domain style address.
>- "mail-preference" is a comma-separated list of some of the following
>  declarators:
>    LAP  send list of all participants (full registration format)
>    LGP  send list of my groups' participants (team names only)
>    DGP  send detailed game protocol for each of my games (every throw)
>    GRP  send game result (points) for each of my games
>    GRG  send group result (all games of all participants)
>    GRR  send group result (ranking)

>- "team-name" can be any string that is a valid C identifier of at
>  most 50 characters and should be a funny name for the team.
>- "Organization" should be the name of the institution the team is at
>  or something else sensible, if no such thing exists.
>- "team-members" should contain a two-line informal description of each 
>  member of the team, giving his/her
>     name, age in years, occupation,
>        programming background, 
>  in this order.
>  Team size should be anywhere between 1 and 20.
>  Personnel should not be shared among teams.

>When I receive your registration, I will send an answer either
>  (a) that your registration is not accepted, (e.g. because there are
>      already too many participants registered), or
>  (b) that your registration is accepted and your authentification 
>      string is <somethingweird>. I may also tell you that I have 
>      slightly modified your team name, if it conflicts with an already 
>      registered one.
>Notes:
>- If you are unable to send email to me or if I am unable to send email 
>  to you, you can not participate in the contest.
>  Please use only Internet domain style email addresses.  
>- Notification of acceptance or rejection will usually be sent within 
>  72 hours.
>  I reserve the right to limit participation of multiple teams from the 
>  same organization.
>- You must keep the authentification string carefully.
>  It will be used to check, whether a strategy that swears to come
>  from your team really does (see below "Sending Programs").



>-----------------
>Sending Programs:
>-----------------

>To send in the first version or a new version of your program,
>send me email of the following form:

>----
>To: prechelt@ira.uka.de
>Subject: please compile

>/*
>  <<FROM>> team_name  authentification_string
>*/
>/* your source code goes here */
>----

><<FROM>> has to be given exactly as shown. The same is true for the 
>"Subject:".
>For <team_name> insert the name of your team as given in the registration.
>For <authentification_string> insert the string that I sent you with the
>registration acknowledge.

>Your program will be compiled automatically a few minutes after your 
>email arrives and you will be sent a report about the results of the 
>compilation. A successfully compiled program is automatically stored 
>to be used in the contest. The latest version is used always.



>---------------------------
>Requirements for programs:
>---------------------------

>1. Pure C (Ansi or KR), i.e., no library routines called, except
>     int init_random ()
>     int log2 (int number)
>     int next_random (int low, int high)
>     int make_throw (int my_throw)
>     int count_points (int throw1, int throw2, int *points1, int *points2);
>   (You will receive a detailed description of these functions
>    upon registration)

>2. Must be compilable with GNU C compiler (gcc).

>3. Must be in a single file, no #includes

>4. Must have at most 10000 lexical elements (after preprocessing)
>   Lexical elements are: 
>      identifier, keyword, number, 
>      string denoter, char denoter, 
>      special character
>   NO lexical elements (i.e. not counted) are: 
>      blank, Tab, newline, comment

>5. The size of the process that runs the program must not grow 
>   beyond 1024 kB on a SUN 4/25 running SUN OS 4.1.
>   The value used to test this is the one shown by 'ps -u' in the column
>   labeled 'SZ' (SIZE).

>6. Must finish every game of 1000 throws in less than 60 seconds of cpu
>   time on a SUN 4/25 (which has about 20 SPECmarks).



>------------------------------
>Recommendations for programs:
>------------------------------

>1. Should not use floating point operations. (Or you do it on your own risk)

>2. Should be infinite loop (i.e. need not terminate after 1000 throws)



>-----------------------
>Technical Environment:
>-----------------------

>In order to write and hand-test a strategy, you need the definitions
>of the library procedures mentioned above, called 'knobellib.c'.
>The source code for these functions is only 130 lines and will be 
>sent to you via email with the notification of acceptance of your
>registration. Link your strategy with this module, but do not include
>the source code of the module into your strategy or else it will
>be rejected.

>If you want to run complete games between two strategies in the same
>kind of environment that will be used in the actual contest, you need
>the source code of the 'knobeln' program. You will need an ANSI-C
>compiler and a UNIX machine in order to compile and run it. 
>There are two ways to get this source code (about 22 kB):

>1. To get 'knobeln.c' by anonymous ftp (prefered method), fetch it from
>   Sanfrancisco.ira.uka.de [129.13.13.110]:  /pub/knobeln.c

>2. To get 'knobeln.c' by mailserver, send email of the following form:
>   ---
>   To: prechelt@ira.uka.de
>   Subject: SEND knobeln.c
>   ---



>--------------------
>The Actual Contest:
>--------------------

>The actual tournaments will be run at the dates given below.

>At some time before, every team has to send its strategy as described
>above. It will be compiled and linked automatically, and you will
>receive a report about the success of this procedure or any problems
>that occur.
>This automatic compilation feature is disabled during the tournaments.

>During the contest, all participants will receive information about
>what happens, if they have announced a corresponding mail-preference 
>upon registration: 

>After every game, a detailed throw protocol or a short game result
>file (giving only the points at the end) is sent to both participants
>(if requested by their mail-preference, see in 'Registration' above);
>after every round the group summary is sent to all members of that
>group (if requested by their mail-preference).



>-------------
>Legal Issues:
>-------------

>By applying for registrations all members of a team assert that they
>understand and agree with the following points:
>1. All participants of the last round of one of the tournaments
>   will send a verbal description of how their strategy 
>   works (length 100 to 500 words) after the contest.
>2. The team members allow the organizer of the contest to publish
>   all or part of the information contained in the strategy program
>   and in the strategy description. Such publication will mention 
>   the contest context and will give credit to the team by
>   mentioning the team name or the team's organization or the names 
>   of one or several team members.


>----------------
>Important Dates:
>----------------

>93/03/28    beginning of registration
>93/03/31    beginning of registration acknowledge
>93/03/31    beginning of compilation service
>93/05/07    registration deadline
>93/05/08    first tournament of contest
>93/05/16    second tournament of contest
>93/05/20    Results posted to Usenet: rec.games.misc, misc.misc

>Relevant time of day is noon, Universal Time (UT, GMT), for all dates.


>Good luck and have fun !

>  Lutz
>  
>-- 
>Lutz Prechelt   (email: prechelt@ira.uka.de)            | Whenever you 
>Institut fuer Programmstrukturen und Datenorganisation  | complicate things,
>Universitaet Karlsruhe;  D-7500 Karlsruhe 1;  Germany   | they get
>(Voice: ++49/721/608-4068, FAX: ++49/721/694092)        | less simple.


I will be happy to distribute this information to Alberta Education 
Consultants in this area.

Best of luck in the contest.

Paul McNair, Alberta Education, Edmonton, Alberta, Canada.



From minami@nri.co.jp (Tsuyoshi Minami)
Newsgroups: comp.groupware
Subject: Coordinator
Message-ID: <MINAMI.93Apr1104941@rdss2nan.nri.co.jp>
Date: 1 Apr 93 01:49:41 GMT
Sender: news@skunk.nri.co.jp
Distribution: comp
Organization: Nomura Research Institute Ltd., Yokohama, Japan.
Lines: 17


Hello. 

I am conducting researches on groupwares.
I've read about a product "Coordinator" developed by Action Technology Co.
It is a system that enables e-mail to support Winograd's Conversation model.

Plesae send me any information about it.

Thanks in advance.
--
**********************************
* minami@nri.co.jp               *
* Nomura Research Institute, Ltd.*
* Intelligent Systems Dept.      *
* Tsuyoshi Minami                *
**********************************


From Christina Cole <tinacole@uxa.cso.uiuc.edu>
Subject: Re: Invasion of Privacy ?
Date: Thu, 1 Apr 1993 04:45:26 GMT
X-Xxmessage-Id: <A7DFD048EA034561@walt18.spcomm.uiuc.edu>
X-Useragent: Nuntius v1.1.1d17
Message-ID: <C4sFvq.Ms7@news.cso.uiuc.edu>
References: <1pb4psINNnff@mojo.eng.umd.edu>
Sender: usenet@news.cso.uiuc.edu (Net Noise owner)
X-Xxdate: Wed, 31 Mar 93 04:48:40 GMT
Organization: University of Illinois
Lines: 13

Once every other week I work with a class group on a collab project. 
Basically, we type up a 5 page document together and everything being
typed shows up on everyone's screen.  I don't see this as an invasion of
privacy because we all work on this project together and as a group
trying to produce one cohesive document, we must see what our other group
members are doing.  

In article <1pb4psINNnff@mojo.eng.umd.edu> Rajesh N. Raghavan,
gita@eng.umd.edu writes:
>	I am interested to know if anyone has been involved with the use of 
>these or other collaborative tools, and if so whether you have found
this to be 
>an invasion of your privacy in any way.


From Christina Cole <tinacole@uxa.cso.uiuc.edu>
Subject: E-mail and Privacy Issues
Date: Thu, 1 Apr 1993 04:54:25 GMT
X-Xxmessage-Id: <A7DFD26606044561@walt18.spcomm.uiuc.edu>
X-Useragent: Nuntius v1.1.1d17
Message-ID: <C4sGAp.Mz5@news.cso.uiuc.edu>
Sender: usenet@news.cso.uiuc.edu (Net Noise owner)
X-Xxdate: Wed, 31 Mar 93 04:57:42 GMT
Organization: University of Illinois
Lines: 7

I need info on cases or situations where privacy has been invaded by
someone intercepting private email messages.  Also, a proposal on what to
do if this happens, and how to combat against this sort of violation,
would be important to me as well.  I am doing a research paper on this
issue and I am not sure where to locate this  type of info.  I found some
articles in Computerworld Magazine and PC Week and a few others but they
did not give me enough info.  Please help.


From nemoto@waikato.ac.nz
Newsgroups: comp.groupware
Subject: [Q] Structure of group work.
Message-ID: <1993Apr1.173516.15161@waikato.ac.nz>
Date: 1 Apr 93 17:35:16 +1200
Organization: University of Waikato, Hamilton, New Zealand
Lines: 18

Hi everyone,

I'm just starting my MSc thesis on CSCW/groupware. As the basis of the
reseach, I'm trying to investigate the structure of (group) work.
Does anybody know the papers on following topics ?

		structure of group
		type of meetings (or other group activities)
		type of communication between members
		
If anyone has information, please send it to me.

Thanks in advance.

1/4/93
Jiro Nemoto
University of Waikato
NEMOTO@waikato.ac.nz


From gg15hzav@sbusol.rz.uni-sb.de (Achim Voermanek)
Newsgroups: comp.groupware
Subject: Interactive publishung systems
Date: 1 Apr 1993 11:58:36 GMT
Organization: Universitaet des Saarlandes,Rechenzentrum
Lines: 43
Message-ID: <1peldcINN4oo@sbusol.rz.uni-sb.de>
NNTP-Posting-Host: sbusol.rz.uni-sb.de
X-Newsreader: Tin 1.1 PL4



Research on interactive publishing systems
==========================================

I am a student at the University of the Saarland in Germany and I am
looking for contact to reasearchers who work this subject. I need the
information form my final thesis in information science.

I am especially interested in:

- different ways and a classification of interactions between an
information system and a user (both "traditional" information systems (e.g.
internet services) and new publishing systems) -> user modelling

- concepts for the technical realization of interactive newspapers and
tv systems

- the impact of interactive communication on the individual user and on
the entire society (e.g. knowledge gap)

- commercial aspects of this new kind of publishing

If you could help me or know someone who is working in this area send
a personal mail to my adress.

Thanks in advance

Achim Voermanek





--
University of the Saarland
Department of Information Science
Achim Voermanek
D-6600 Saarbruecken
Tel.: +49 681 302-2239





From jcarroll@jacc.com (Jim Carroll)
Reply-To: jcarroll@jacc.com
Newsgroups: comp.groupware
Subject: Re: E-mail and Privacy Issues
Message-ID: <21-PCNews-124beta@jacc.com>
Date: 1 Apr 93 12:34:24 GMT
Organization: J.A.CarrollConsulting
References: <C4sGAp.Mz5@news.cso.uiuc.edu>
Lines: 39

tinacole@uxa.cso.uiuc.edu (Christina Cole @ University of Illinois) once wrote....
>I need info on cases or situations where privacy has been invaded by
>someone intercepting private email messages.  Also, a proposal on what to
>do if this happens, and how to combat against this sort of violation,
>would be important to me as well.  I am doing a research paper on this
>issue and I am not sure where to locate this  type of info.  I found some
>articles in Computerworld Magazine and PC Week and a few others but they
>did not give me enough info.  Please help.

You want to find the Dec. 1 issue of EMMS ("Electronic Mail & Micro 
Sytems"), an industry publication (cost $600/yr); you might find it
in a library somewhere. That issue details *15* cases involving e-mail
and privacy that are in the courts or are affecting lawmaking in 
some way. It is by far the best summary of what is going on.

Look to the Electronic Mail Association (Virginia) for a publication
they have called "Access to and Use and Disclosure of Electronic 
Mail on Company Computer Systems" (cost about $30), which provides
guidance on how companies should advise their employees of their
policy regarding the privacy of e-mail (regardless of which side of the
fence the company might sit on.)

Look for news references to the White House/Iran Contra/PROFS, which
is unfolding as we speak influencing e-mail privacy issues.

Finally, send me your fax # and I will send you a copy of an article
that I wrote on this subject some time back.

Jim Carroll


----
        ____     ___ ___       Jim Carroll, J.A. Carroll Consulting
          / /\  /   /          _____________________________________
         / /__\/   /           Internet            jcarroll@jacc.com 
     \__/ /    \___\___        Voice or Fax        +1.416.855.2950   
                                  Mississauga, Ontario, Canada                                                
                                  (in the suburbs of Toronto)



From BPRASAD@cmsa.gmr.com
Newsgroups: comp.groupware
Subject: Concurrent Engineering Journal
Message-ID: <16BA39540.BPRASAD@cmsa.gmr.com>
Date: 1 Apr 93 15:36:48 GMT
Sender: news@rphroy.ph.gmr.com
Organization: GM Research Labs
Lines: 157
Nntp-Posting-Host: cmsa.gmr.com





Subject:  CONCURRENT  ENGINEERING: RESEARCH & APPLICATIONS  (CERA)  --
International Journal --  An Announcement


Dear Fellow Researcher:


We are pleased to inform you that Concurrent Engineering (CE)  Institute
of International Society of Productivity Enhancement (ISPE) in collab-
oration  with Academic Press, London has started a new  journal  enti-
tled:  Concurrent  Engineering: Research & Applications (CERA)  --  An
International  Journal." CERA is a refereed archival quality  publica-
tion.  This journal fills a void for a very important and timely  sub-
ject  matter.  "Concurrent Engineering" has been recognized  for  some
time  to be a major force behind achieving international  competitive-
ness,   responsiveness  and improving productivity. I  know  you  have
worked  in  this area and I would like to seek your inputs  in  making
this endeavor a success.


I take this opportunity to invite you to submit your original  contri-
bution  to CERA for possible publication. Please inform  your  friends
and colleagues or write to me, who can contribute. A "Call for  Paper"
is enclosed.


If  you are interested in subscribing CERA Journal in 1993,  or  would
like  to  get a free sample copy for review please  write/call/fax  or
EMAIL your request to Academic Press, London. They would send you  the
required  information.  If you have further question,  please  do  not
hesitate to write to us or EMAIL at CERA editorial office in USA.

Thanking you and looking forward to hearing from you soon,


Sincerely,




Biren Prasad, Ph.D.
Managing Editor
Chairman, CERA J. Task Force.
Email ID: BPRASAD@CMSA.GMR.COM





                    ANNOUNCEMENT & CALL FOR PAPERS


           CONCURRENT ENGINEERING: RESEARCH & APPLICATIONS

                  (CERA) - An International Journal


CERA  is a new international, multidisciplinary journal to  promote  a
better  understanding of Concurrency in enterprise modeling,  informa-
tion  processing  and  computing. The purpose of this  journal  is  to
provide  an  international forum for the dissemination  of  scientific
work on Concurrent Engineering based on computer technologies. Concur-
rent  Engineering (CE) is an official journal of the Concurrent  Engi-
neering  Institute of the International Society for  Productivity  En-
hancement (ISPE). CERA is the key publication for the newest and  most
exciting  research  arising from parallelism of product's  life  cycle
functions.  CERA deals with all basic tracks that enable CE  including
aspects  of  Information Modeling,  Teaming &  Sharing,  Networking  &
Distribution, Planning & Scheduling,  Reasoning & Negotiation, Collab-
orative  Decision Making, Organization and Management of CE.  Emphasis
is  placed on CE technologies that result in faster  product  develop-
ment,  higher quality, lower costs, improved productivity  and  better
customer value. The journal is an important source of information  for
design, engineering and manufacturing personnel and those with  inter-
est  in research, development and applications of productivity  tools,
methods and concepts.

The  distinguishing  nature of the journal will be to foster  the  ex-
change   and integration of concepts and theories from  these  diverse
areas,  and cross-fertilization of enabling CE technologies to  stimu-
late  thinking  that can generate new insights. A second  goal  is  to
publish  interdisciplinary research that advances  interactions  among
these  are well known researchers and practitioners in the field  from
industy,  university  and government laboratories.  The  distinguished
Editorial Board reflects the excellence of this important journal  and
the  commitment  to publish quality articles on the  most  timely  and
significant  trends, issues, problems and applications  of  Concurrent
Engineering in modern manufacturing.







Research Areas include:

o  Principles of Concurrent Engineering
o  CE Process Characterization & Matrix
o  Enterprise Modeling
o  Requirements, Constraints, Workflow Tracking & Management
o  Multi-Enterprise Integration
o  Information Sharing and Collaboration
o  Project & Team Coordination
o  Decision Support & Design Assessment
o  Networked Collocation
o  Tools for Multi-media Conference on the Network
o  Distributed Computing Environments
o  Corporate Technical Memory
o  Capturing Design Intent
o  Integration Frameworks for CE
o  CE Languages and Tools
o  Intelligent Retrieval of Corporate Knowledge
o  Virtual Team Support Environments
o  Blackboard and other AI Architectures
o  Emerging Standards & Practices
o  Case Histories & Research Briefs

The journal is published by Academic Press four times a year beginning
January  1993.  Potential authors should submit papers  or  write  for
instructions  to any of the editors or managing editor.  Requests  for
subscriptions and other information can be obtained from the  managing
editor or the publisher.

Managing Editor:                       Associate Editor:
                                       DR. MARK S. FOX
Dr. Biren Prasad                       Computer Science & Mgt. Science
CERA Institute                         University of Toronto
P.O. Box 250254,                       4 Taddle Creek; Roseburgh Bldg.
West Bloomfield, MI 48325, USA.        Toronto, Ontario, Canada M5S 1A4
Tel:  (313)492-0551;   Fax:(313)       Tel: (416) 978-6823;
661-8333                               Fax: (416) 971-1373
Email: bprasad@cmsa.gmr.com

Associate Editors:                     Prof. Shuichi Fukuda
Dr. Philip Barkan                      Tokyo Metropolitan Inst. of Tech.
Dept. of Mechanical Engineering        Dept. of Management Eng.
Stanford University                    6-6, Asahigaoka, Hino
Design Division                        Tokyo 191, JAPAN
Stanford, CA 94305, USA                Tel: +81 425-83-5111 ext. 266
Tel: (415) 967-8534 (O)                /Fax: +81-425-83-5119


Associate Editors:                     Publisher:
Dr. A.M. Agogino                       Academic Press Ltd.
Professor (Room # 5136)                24-28 Oval Road
Mechanical Engineering Department      London, NW1 7DX, U.K.
University of California Berkeley      Tel: 71-267-4466
Berkeley, CA 94720, USA                Fax: 71-482-2293  or
Tel:(510)642-6450(O)/ 642 3458(M)      Fax:  71-485-4752;
/ (510) 642 1338(D)                    Email: AC2@UK.AC.RL.IB




From joe@netcom.com (Joseph Jesson)
Subject: Re: Coordinator
Message-ID: <joeC4wwpI.89M@netcom.com>
Organization: Netcom - Online Communication Services (408 241-9760 guest)
References: <MINAMI.93Apr1104941@rdss2nan.nri.co.jp> <1APR199314233591@dftnic.gsfc.nasa.gov>
Distribution: comp
Date: Sat, 3 Apr 1993 14:39:18 GMT
Lines: 4

  Action's Work Flow module will be an add-in option to Lotus Notes V3.

 V3 does have rudimentary Work Flow built-in through functions.



From keith@sytex.com (Keith Attenborough)
Newsgroups: comp.groupware
Subject: Lotus Notes book(s)      
Message-ID: <gate.NkRF2B1w165w@sytex.com>
Date: Sat, 03 Apr 93 10:01:09 EST
X-Maildoor: WaflineMail 1.00r
Lines: 28

Mr Cozzolino;
In your msg <93083.154824RBNTJC@rohvm1.rohmhaas.com> dated Wed, 24 Mar
1993 15:48:24 EST, you ask:

TJC<>Can anyone recommend a good book or 3 about Lotus Notes?
TJC<>I'm looking for a technical overview, as well as how to set up and
use the product?
TJC<>I heard there's a book called "Lotus Notes at Work".  Does anyone
know about it?

I've got a copy - it appears to be a very good basic introduction to
Notes, how to set up an application, designing the input "forms" and the
output "views", etc.  The first half (all I've gotten through at the
moment) is writtten in a very straight forwrd, non-technical manner.

I haven't heard of or seen any others, so there isn't much to compare
it to. I got it through "Lotus Direct", Lotus' direct mail order
operation, I think it was under twenty bucks.

If you don't mind, are you planning or do you have a Notes installation
now?  We're setting one up in our office (I'm the "Implementation Lead",
meaning I get to run around like crazy and figure out how to make it
work), so I'm looking for other folks with experience.  E-mail back, if
you would like.

Keith
keith@sytex.com
            


From keith@sytex.com (Keith Attenborough)
Newsgroups: comp.groupware
Subject: Re: Information on Lotus 
Message-ID: <gate.ukRF2B1w165w@sytex.com>
Date: Sat, 03 Apr 93 10:01:16 EST
X-Maildoor: WaflineMail 1.00r
Lines: 18

Mr Ashley;

In your msg, subject: "Re: Information on Lotus notes", Message-ID:
  <733420968snx@chaz.demon.co.uk>, dated: Mon, 29 Mar 1993 09:02:48
you responded to Andreas Vagt's query for information on Lotus Notes by
suggesting he "Try the April 93 issue of _Electronic Documents_.  Its
a 32-page edition on >Workflow & Collaboration, and Notes 3.0 is amply
covered." and further suggested he e-mail you for a copy.

I'm similarly interested in views on Notes and possible in the magazine
"Electronic Documents".  Is there further info available on the
publication, either the specific issue or in general?

Thanks in advance.

Keith
keith@sytex.com
                                                                                                                   


From friday@netcom.com (Carol Anne Ogdin)
Subject: NOTES Technical Problem on Network
Message-ID: <fridayC4z7Fo.LCp@netcom.com>
Summary: Help fix a NOTES problem
Keywords: Lotus NOTES NetWare
Organization: NETCOM On-line Communication Services (408 241-9760 guest)
Date: Sun, 4 Apr 1993 20:26:11 GMT
Lines: 30

I'm running NOTES 2.1 on OS/2 1.3 connected to NetWare 3.11

Because the network has the largest disk drive, I wanted to install
the code on the OS/2 workstation, and all the database files on
the file server.  Everything worked (ostensibly) fine until I
tried to Certify or Create new users:  Efforts to connect to the
Notes server (e.g., to set up a mail database for the new user)
meet with a stone wall saying "Remote pathname must be relative
to Data Directory".

That message is no where documented.  It isn't making sense.  The
path to the database directory is in both the PATH and DPATH state-
ments in CONFIG.SYS.

Temporary Solution:  Put in a new disk drive to accomodate the
Data Directory on the OS/2 machine, but it's gonna get full soon.

Question:   Do you know what the message really means and how to
            get around it?

Question:   Do you know if this is a bug that Version 2.1A fixed?
            (I'm trying to hold off upgrading until 3.0 next month.)

Hel-l-lp!

-- 
--Friday                                  "Act in such a way that you always
   Carol Anne Ogdin, Principal Designer    treat humanity never simply as a
   Deep Woods Technology                   means but always also as an end." 
     friday@well.sf.ca.us                                   --Immanuel Kant 


From daudjee@cs.yorku.ca (Khuzaima Daudjee)
Newsgroups: comp.groupware
Subject: would it work...?
Keywords: groupware
Message-ID: <1844@yetti.UUCP>
Date: 4 Apr 93 21:43:23 GMT
Article-I.D.: yetti.1844
Sender: news@yetti.UUCP
Distribution: world
Organization: York University, Dept. of Computer Science
Lines: 29

Hi,

I read the note on "invasion on privacy" etc. I have the following 
question. How would groupware affect the non-computer collaboration
of people at work ? By this, I mean the following. In many organizations
today, it is quite common for employees to get up from their desks and
take a stroll as a refresher. In the process of doing so, they quite often
meet their workmates (who are there for the same reason) and this often
leads to an exchange of ideas (about their work) in addition to a quick break.
If people were connected to each other through groupware, this would mean that
ideas could be exchanged from one's desk to another's without there being a need
to talk on the "quick" breaks.

Could this lead to a depletion of exchange of ideas since there would not be
a reason to talk about work when meeting face-to-face since groupware that enables the communication to take place at their desks (e.g. using VOODOO [developed at Univ of Toronto] which uses video and audio and even allows notes to be posted on virtual doors' of peoples' virtual offices) would be used
instead ?

Also, how effective is groupware in replacing physical face-to-face 
communication ? I would like to hear of any studies if available.

I think groupware is great. However, the above are some questions that
I am not sure of (as in how groupware would affect/change our current
means/methods of communication).

Thanks.

Khuzaima Daudjee
Dept. of Computer Science
York Univ., Canada


From rji@nyquist.cs.nott.ac.uk (Rob Ingram)
Newsgroups: comp.groupware
Subject: Re: would it work...?
Keywords: groupware
Message-ID: <1993Apr5.095650.8563@cs.nott.ac.uk>
Date: 5 Apr 93 09:56:50 GMT
References: <1844@yetti.UUCP>
Sender: news@cs.nott.ac.uk
Reply-To: rji@cs.nott.ac.uk
Organization: Communications Research Group
Lines: 53

In article <1844@yetti.UUCP>, daudjee@cs.yorku.ca (Khuzaima Daudjee) writes:
|> Hi,
|> 
|> I read the note on "invasion on privacy" etc. I have the following 
|> question. How would groupware affect the non-computer collaboration
|> of people at work ? By this, I mean the following. In many organizations
|> today, it is quite common for employees to get up from their desks and
|> take a stroll as a refresher. In the process of doing so, they quite often
|> meet their workmates (who are there for the same reason) and this often
|> leads to an exchange of ideas (about their work) in addition to a quick break.
|> If people were connected to each other through groupware, this would mean that
|> ideas could be exchanged from one's desk to another's without there being a need
|> to talk on the "quick" breaks.
|> 
|> Could this lead to a depletion of exchange of ideas since there would not be
|> a reason to talk about work when meeting face-to-face since groupware that enables the communication to take place at their desks (e.g. using VOODOO [developed at Univ of Toronto] which uses video and audio and even allows notes to be posted on virtual do|> ors' of peoples' virtual offices) would be used
|> instead ?
|> 

I don't think there would be a problem here as people would still need
to take a break and so would still go for walks, visit the coffee mechine
etc. and would still discuss work informally in these situations. The
problem we should be addressing with groupware is sort of the converse
of this - how can we support this informal interaction, which has been
shown to be very important for copperation, among people who are physically
separated but working together using groupware. As these people are not
going to meet on a stroll around the office we need a sort of equivalent
'stroll' around the groupware environment which will encourage ad-hoc
meetings in a more relaxed atmosphere than other more formal meetings.
One example: Robert Root addressed this problem with the CRUISER system by
letting people follow paths around a virtual office when 'travelling' to a
groupware 'meeting' and allowed for the opportunity to meet others following
their own paths and to hear snatches of conversations from offices as they
passed by. To encourage more meetings the paths could be randomised to make
the user venture into new areas and a 'walk' could be attached to an operation
such as e.g. printing to simulate the chance of meeting someone while picking
up a printout.


				Rob.



-- 
_______________________________________________________________________________
|                       | Rob Ingram                                          |
|  By request.          | University of Nottingham                            |
|  Englands Finest.     | Department of Computer Science                      |
|                       | Nottingham, UK.                                     |
|_______________________|_____________________________________________________|
|                       |      "Women: Can't live with 'em, can't get them    |
|  rji@cs.nott.ac.uk    |       to dress in skimpy leather Nazi outfits"      |
|_______________________|_____________________________________________________|


From prechelt@ira.uka.de (Lutz Prechelt)
Newsgroups: comp.ai,comp.ai.edu,comp.ai.philosophy,comp.edu,comp.groupware,comp.lang.c,comp.programming,comp.protocols.misc,comp.sources.wanted,comp.theory.dynamic-sys,comp.theory.self-org-sys
Subject: Announcement: International KNOBELN contest
Followup-To: comp.sources.wanted
Date: 5 Apr 1993 10:42:27 GMT
Organization: University of Karlsruhe, Comp. Sc. Dept., FRG
Lines: 409
Message-ID: <1pp2ejINNels@irau40.ira.uka.de>
NNTP-Posting-Host: i41s18.ira.uka.de

       ===============================================

         Second Announcement of the 1st International

        KNOBELN --- Game-Strategy Programming Contest

       ===============================================

This is an announcement for the KNOBELN-contest, taking place via
e-mail on Saturday, May 8th, 1993 and on Sunday, May 16th, 1993.

The contest is run at the University of Karlsruhe, Germany, by
Lutz Prechelt.

Arbitrary teams can participate in the contest.

PLEASE REDISTRIBUTE THIS ANNOUNCEMENT AS WIDELY AS YOU CAN.



-----------------
Type of Contest:
-----------------

To participate, you must program in C a strategy for a simple game 
and send it to me by email. The game is quite interesting since there 
clearly is no canonical best strategy (the success of a strategy depends
on the behavior of all other participants).



--------------
Rules of Game:
--------------

1. Both players (at the same time) chose an integer number in the interval 
     a..b.
   This selection of two numbers is called a "throw".
   The players can watch each throw as it is made (i.e. they can know
   all numbers they and their opponent have thrown up to the 
   current throw)
   Assumption:  Player P choses p1 and player Q choses q1.

2. If p1 equals q1, nobody wins a point.

3. The player with the higher number wins, unless the number is more 
   than twice as high as that of his opponent.
   Let's assume that p1 > q1, then
     P wins if 2*q1 >= p1 and
     Q wins if 2*q1 <  p1.

4. A player who wins a throw with some number N gets
     floor(log2(N)) points
   in this throw.
   The other player gets 0 points in this throw.
   Example: if P wins, he/she gets floor(log2(p1)) points
            e.g. if p1 = 6800, player P gets 12 points.

5. A game consists of L throws.

6. Both players must throw series of non-decreasing throws.
   These series must (for each player individually) have a length
   of AT LEAST k throws.
   Example: If P1 throws (p1, p2, p3, .....) then
            p1 <= p2 <= p3 <= ... <= p(k) is required.
            After that, p(k) > p(k+1) is allowed.
            If p(k) > p(k+1) then
               p(k+1) <= p(k+2) <= ... <= p(k+k) is required.
            else 
               there exists some smallest number j, with j > k for which
               p(j) > p(j+1)
            and then 
               p(j+1) <= p(j+2) <= ... <= p(j+k) is required.
            and so on through the whole game.
      If for instance k = 3 then the sequence
        1, 2, 3, 1, 4, 5, 6, 8, 2    is allowed, while
        1, 2, 3, 4, 1, 2, 1          is not
                          ^ too early

In this turnament the parameters are:
  a = 1,  b = 12288,  k = 8,  L = 1000
   


--------------------
Rules of Tournament:
--------------------

The tournament is performed in successive rounds with randomly mixed 
groups of 7 to 13 participants. Within each group, every strategy
plays one game against every other strategy in that group.

Those half of the participants (rounded up), that have won most
points in their group (no matter how many their opponents got), proceed
to the next round, which is played with newly mixed groups.
The winners of the last round are the winners of the tournament;
the results of previous rounds are discarded.

Any strategy is allowed to fail once per round. Failing means doing
anything that is disallowed according to the rules of the game.
The game in question is immediately stopped, its intermediate results
are discarded and it is rescheduled after all the other games currently 
scheduled for that group.
If the strategy who failed had already failed before in the same round,
the game is not rescheduled but the strategy is disqualified from the 
contest. 
All its remaining games in that round will not be carried out and
all its previous games in that round will not be counted.

This tournament is performed twice to find the winners of the contest:
After the first tournament is performed, there is an eight day pause,
during which the contestants can revise and change their strategy based
on the game protocols of their games in the first contest (see below).
Then the second tournament with identical rules and the same (or a
reduced) set of participants is carried out.
Those teams with the highest total rank in both tournaments will
be announced as winners of the contest.

See section 'requirements for programs' for additional rules.



----------------------------
Characteristics of the Game:
----------------------------

The method of counting within a game and the method of selecting the
winners of a group have an interesting impact on the goal of a
strategy: It must actually try to arrange a cooperation with its
'opponent', because otherwise none of the two will usually be able to
win many points. 

It is NOT important to have more points than the opponent in any
single game. Instead it is important to have more points than the
other strategies on the average.

The problem of programming a strategy could thus be formulated as
  "How do I (quickly) arrange a cooperation with a machine partner, if
   there is no predefined protocol to do so and the only communication
   channel is mutual exchange of integers, one at a time ?"
  
It is clear, that there exists no optimal strategy: It is impossible
to guarantee that a strategy A is able to arrange a cooperation with a
strategy B, even if both are perfectly willing to cooperate in
principle. This is true because both strategies have to 'guess' what
might be suitable protocols to communicate. The two strategies of a game
should together form a self-organizing system that organizes for
cooperation.

I think this makes the contest very interesting.
By the way: This game is probably interesting to play with human
            players, too.



------------------------------
How to Announce Participation:
------------------------------

If you want to participate in the contest, send email of the
following form:

---
To: prechelt@ira.uka.de
Subject: registration for KNOBELN

email-address:   ourname@machine.domain.alfdkj
mail-preference: LAP,LGP,DGP,GRR
team-name:       the_heavy_lords_of_knobeln 
Organization:    University of Northeast Sacrodata, Intellect City, Eggland
team-members:
  Joe Cool,  45, professional systems programmer,
     20-year-experienced programmer
  Jane More, 20, graduate student of computer science,
     hackeress fluent in 34 programming languages
  Mona Morn, 35, Professor of CS,
     hobby game strategy programmer
  Bill Neat, 24, undergraduate student of psychology,
     advanced beginner (will be my first C program!)
---

Please use this format exactly as shown.

- "email-address" gives the email address that uniquely 
  identifies the team, it should be an internet domain style address.
- "mail-preference" is a comma-separated list of some of the following
  declarators:
    LAP  send list of all participants (full registration format)
    LGP  send list of my groups' participants (team names only)
    DGP  send detailed game protocol for each of my games (every throw)
    GRP  send game result (points) for each of my games
    GRG  send group result (all games of all participants)
    GRR  send group result (ranking)

- "team-name" can be any string that is a valid C identifier of at
  most 50 characters and should be a funny name for the team.
- "Organization" should be the name of the institution the team is at
  or something else sensible, if no such thing exists. Please also
  give city and country (or state for the US).
- "team-members" should contain a two-line informal description of each 
  member of the team, giving his/her
     name, age in years, occupation,
        programming background, 
  in this order.
  Team size should be anywhere between 1 and 10.
  Personnel should not be shared among teams.

When I receive your registration, I will send an answer either
  (a) that your registration is not accepted, (e.g. because there are
      already too many participants registered), or
  (b) that your registration is accepted and your authentification 
      string is <somethingweird>. I may also tell you that I have 
      slightly modified your team name, if it conflicts with an already 
      registered one.
Please allow some time (ca. 3 days) for the answer to arrive.
      
Notes:
- If you are unable to send email to me or if I am unable to send email 
  to you, you can not participate in the contest.
  Please use only Internet domain style email addresses.  
- Notification of acceptance or rejection will usually be sent within 
  72 hours.
  I reserve the right to limit participation of multiple teams from the 
  same organization.
- You must keep the authentification string carefully.
  It will be used to check, whether a strategy that swears to come
  from your team really does (see below "Sending Programs").



-----------------
Sending Programs:
-----------------

To send in the first version or a new version of your program,
send me email of the following form:

----
To: prechelt@ira.uka.de
Subject: please compile

/*
  <<FROM>> team_name  authentification_string
*/
/* your source code goes here */
----

<<FROM>> has to be given exactly as shown. The same is true for the 
"Subject:".
For <team_name> insert the name of your team as given in the registration.
For <authentification_string> insert the string that I sent you with the
registration acknowledge.

Your program will be compiled automatically a few minutes after your 
email arrives and you will be sent a report about the results of the 
compilation. A successfully compiled program is automatically stored 
to be used in the contest. The latest version is used always.



---------------------------
Requirements for programs:
---------------------------

1. Pure C (Ansi or KR), i.e., no library routines called, except
     int init_random ()
     int log2 (int number)
     int next_random (int low, int high)
     int make_throw (int my_throw)
     int count_points (int throw1, int throw2, int *points1, int *points2);
   (You will receive a detailed description of these functions
    upon registration)

2. Must be compilable with GNU C compiler (gcc).

3. Must be in a single file, no #includes

4. Must have at most 10000 lexical elements (after preprocessing)
   Lexical elements are: 
      identifier, keyword, number, 
      string denoter, char denoter, 
      special character
   NO lexical elements (i.e. not counted) are: 
      blank, Tab, newline, comment
   Information about how many lexical elements your program has is
   sent to you as a report from automatic compilation as described above.

5. The size of the process that runs the program must not grow 
   beyond 1024 kB on a SUN SparcStation 2 running SUN OS 4.1.
   The value used to test this is the one shown by 'ps -u' in the column
   labeled 'SZ' (SIZE).

6. Must finish every game of 1000 throws in less than 60 seconds of cpu
   time on a SUN SparcStation 2 (which has about 20 SPECmarks).



------------------------------
Recommendations for programs:
------------------------------

1. Should not use floating point operations. (Or you do it on your own risk)

2. Should be infinite loop (i.e. need not terminate after 1000 throws)



-----------------------
Technical Environment:
-----------------------

In order to write and hand-test a strategy, you need the definitions
of the library procedures mentioned above, called 'knobellib.c'.
The source code for these functions is only 130 lines and will be 
sent to you via email with the notification of acceptance of your
registration. Link your strategy with this module, but do not include
the source code of the module into your strategy or else it will
be rejected.

If you want to run complete games between two strategies in the same
kind of environment that will be used in the actual contest, you need
the source code of the 'knobeln' program. You will need an ANSI-C
compiler and a UNIX machine in order to compile and run it. 
There are two ways to get this source code (about 22 kB):

1. To get 'knobeln.c' by anonymous ftp (prefered method), fetch it from
   Sanfrancisco.ira.uka.de [129.13.13.110]:  /pub/knobeln.c

2. To get 'knobeln.c' by mailserver, send email of the following form:
   ---
   To: prechelt@ira.uka.de
   Subject: SEND knobeln.c
   ---



--------------------
The Actual Contest:
--------------------

The actual tournaments will be run at the dates given below.

At some time before, every team has to send its strategy as described
above. It will be compiled and linked automatically, and you will
receive a report about the success of this procedure or any problems
that occur.
This automatic compilation feature is disabled during the tournaments.

During the contest, all participants will receive information about
what happens, if they have announced a corresponding mail-preference 
upon registration: 

After every game, a detailed throw protocol or a short game result
file (giving only the points at the end) is sent to both participants
(if requested by their mail-preference, see in 'Registration' above);
after every round the group summary is sent to all members of that
group (if requested by their mail-preference).



-------------
Legal Issues:
-------------

By applying for registrations all members of a team assert that they
understand and agree with the following points:
1. All participants of the last round of one of the tournaments
   will send a verbal description of how their strategy 
   works (length 100 to 500 words) after the contest.
2. The team members allow the organizer of the contest to publish
   all or part of the information contained in the strategy program
   and in the strategy description. Such publication will mention 
   the contest context and will give credit to the team by
   mentioning the team name or the team's organization or the names 
   of one or several team members.


----------------------
Status of the contest:
----------------------

By now there are 29 participants registered. 
I will allow at most 104.


----------------
Important Dates:
----------------

93/03/28    beginning of registration
93/03/31    beginning of registration acknowledge
93/03/31    beginning of compilation service
93/05/07    registration deadline
93/05/08    first tournament of contest
93/05/16    second tournament of contest
93/05/20    Results posted to Usenet: rec.games.misc, misc.misc

Relevant time of day is noon, Universal Time (UT, GMT), for all dates.


Good luck and have fun !

  Lutz
  
-- 
Lutz Prechelt   (email: prechelt@ira.uka.de)            | Whenever you 
Institut fuer Programmstrukturen und Datenorganisation  | complicate things,
Universitaet Karlsruhe;  D-7500 Karlsruhe 1;  Germany   | they get
(Voice: ++49/721/608-4068, FAX: ++49/721/694092)        | less simple.


From bmcqueen@waikato.ac.nz
Newsgroups: comp.groupware
Subject: <None>
Message-ID: <1993Apr7.093725.15299@waikato.ac.nz>
Date: 7 Apr 93 09:37:25 +1200
Organization: University of Waikato, Hamilton, New Zealand
Lines: 16

Re the groupware name..... I find it efficient, from the perspective of the
number of syllables used. Consider the following syllable counts:

(2)	groupware
(6)	CSCW
(12)	Computer supported co-operative work

Groupware will do me just fine, until something which packs a more 
helpful understanding of the area into fewer syllables (the target is one!)
comes along


Bob McQueen
Dept of Computer Science
University of Waikato, Hamilton, New Zealand



From san@pencom.com
Newsgroups: comp.groupware
Subject: Re: Invasion of Privacy? (and a model of privacy)
Message-ID: <1993Apr6.200556.16408@pencom.com>
Date: 6 Apr 93 20:05:56 GMT
References: <C4u4Aq.9n6@news.cso.uiuc.edu>
Sender: usenet@pencom.com (Usenet Pseudo User)
Reply-To: san@pencom.com
Distribution: usa
Organization: Pencom Software
Lines: 58

It's clear to me that "privacy" is a relative term and it's exact
meaning depends may be different for each individual and depend on
a number of factors.

For instance, in the article below, the author didn't consider
the situation as an invasion of his privacy.  Alternately,
though, he proposed that using the same tool in a different setting
might result in a situation considered an invasion of privacy.
Extending his situation, would he consider his privacy invaded if
he was to discover that a professor had (realtime) access to their
interactions? and what if other students had similar access?

So, taking a quick shot at this, I see privacy as a multi-dimensional
concept and what follows is an attempt to glean out a couple of the
dimensions of privacy:

	- in the article below, there is a notion of a set of people
	  with whom sharing is acceptable.  Opposite of this would be a
	  set of people with whom sharing is not acceptable.  This would
	  constitute one dimension.
	- implicit in the article below is the notion that the privacy
	  with regards to their class work will change over time.
	  This introduces time as another dimension to be considered.
	  It's easy to imagine a scenario where a professor or another
	  student having access to their class work would be considered
	  an invasion of privacy, but not so once they turned it in.

I see that the developing a full model of of privacy would be usefull
mainly as a tool to assist in communicating among people what is considered 
acceptable and unacceptable behavior.  With such a behaviorial slant,
it's clear that this model may be weak as a tool to describe internal
issues, e.g. personal motivations, causes, beliefs, etc., about privacy.

I would like to continue with this model, any comments?

 - Steve Sanderson

In article <C4u4Aq.9n6@news.cso.uiuc.edu> airpino@uxa.cso.uiuc.edu (Anthony  
Irpino) writes:
> 
> 	I am in a situation where I work with four other students at the
> University of Illinois in a colab group.  We work together for an
> advanced level speech communications class.  Obviously my case is not one
> of a "real world" work environment but it does fit the description of
> "non-privacy."  
> 	In response to your question I must say that this way of working is a
> complete invasion of privacy.  All typed information is out for everyone
> to see and thus gives the user no security to their own work.  But, at
> least in our scenario that is absolutely for the better.  By allowing
> everyone in the group to see each others work the colab makes for an
> optimal communication device.  You can relate to each other without
> talking if you want, you can adjust your work by seeing the others',
> there is no confusion of having four or five people talking to each other
> at once, and there is a great deal of organization.
> 	Our colab works both individually and as a unit because of a "lack of
> privacy."  While I believe that this has enabled our group to work more
> effectively, I can also see where a situation like ours would not be the
> best route to take for some business situations.


From david@ruc.dk (David Stodolsky)
Newsgroups: comp.groupware,news.answers,comp.answers
Subject: Introduction to comp.groupware (Periodic informational Posting)
Supersedes: <groupware-intro_732949205@GZA.COM>
Followup-To: comp.groupware
Date: 7 Apr 1993 00:00:07 -0400
Organization: Roskilde University
Lines: 349
Sender: faqserv@GZA.COM
Approved: news-answers-request@MIT.Edu
Distribution: world
Expires: 5 May 1993 04:00:04 GMT
Message-ID: <groupware-intro_734155204@GZA.COM>
NNTP-Posting-Host: pad-thai.aktis.com
Summary: Guidelines for posting to the Usenet newsgroup comp.groupware.
Keywords: CSCW, orgware, group, interactive, shared, environments
X-Last-Updated: 1993/01/25

Archive-name: groupware-intro
Last-modified: 1993/1/17
Version: 1.5

Please read carefully:
Any article posted to comp.groupware uses a minimum of ten hours of
readers' time. Do not post test messages to comp.groupware (see section
5 below). Information for teachers is contained in section 7.

This article is posted automatically every 14 days to introduce the
group to the more than one thousand new users that have subscribed
during that period. 

---------------- Contents (and revision information) ------------

Sections in this article (Revised in last modification)

0. Groupware is software and hardware for shared interactive
environments.
1. Set your distribution to "world". (Revised)
2. Sign your article.
3. Comp.groupware is being archived. (Revised)
4. If you are posting copyrighted work...
5. Read "Welcome to news.newusers.questions"... (Revised)
6. When you reply to a message, do not change the subject line...
7. Comp.groupware is read by over 28,000 people. (Revised)

------------ End of Contents (and revision information) ----------


0. Groupware is software and hardware for shared interactive
environments.

The term "environment" includes software and hardware that sets the
context for interaction. Hardware can include specially designed
furnishings and architectural spaces that are considered integral to
correct utilization of a given software application. A groupware
application may require a specific organizational environment to
function as expected. More powerful applications can adapt to, or
overcome limitations of, their environments.

The term "interactive" is used to indicate that time constraints are
managed by the system. Many groupware applications appear to support
real-time interaction. Others merely enforce deadlines that can span
weeks. In either case, the technical limitations on the pace of
interaction are made (to appear) negligible in terms of the objectives
of the application. Systems that exclude reference to real time are not
groupware applications.

The term "shared" indicates that two or more participants interact with
one another in such a manner that each person influences and is
influenced by each other person. No upper limit in the number of
participants is indicated, because mediated groups, as opposed to
natural ones, can maintain joint awareness with very large numbers of
persons. (Joint awareness is one way that "group" is defined.) An
objective of some groupware applications is to increase the number of
persons that can interact "as a group".

Some definitions of groupware include the notion of a common goal. While
all systems require some agreement among participants (at minimum that
they should be jointly used), interactions can be predominately
conflictual. Management of conflict is often a crucial feature of a
groupware system. Vote collecting systems are an example.

Definitions:

Group - Two or more persons who are interacting
with one another in such a manner that each person
influences and is influenced by each other person
(Shaw, M. E. _Group dynamics: The psychology of
small group behaviour_. 1976, p. 11).

Ware - 1 a) manufactured articles, products of art
or craft.... b) an article of merchandise.... 3) an
intangible item (as a service) that is a marketable
commodity. (_Webster's New Collegiate Dictionary_,
1976, p. 1319).


1. Set your distribution to "world". Comp.groupware is delivered to all
continents. Do not limit your chances for feedback by restricting
distribution. Restricted distribution can cause confusion when people
read responses to articles they have not seen. If you notice an article
has a restricted distribution, inform the poster by mail.

If you are restricted from posting to "world" by your administrator,
request a change in your privileges, at least for this newsgroup. If
refused, determine what your rights are in terms of appeal, based upon
information available at your site. An alternative is to use the Net to
find information and persons to contact concerning your rights. 
Try the newsgroups:

comp.org.eff.news
comp.org.eff.talk
misc.legal.computing
alt.society.civil-liberty
alt.comp.acad-freedom.news
alt.society.cu-digest

Information about the rights of network users is available from the
Electronic Frontier Foundation (EFF). Information about the Electronic
Frontier Foundation  can be requested from eff@eff.org. You can also
retrieve information about EFF and its projects via anonymous FTP from
ftp.eff.org.

As a final resort, send a summary of your case to:

Carl Kadie (kadie@eff.org)
Electronic Frontier Foundation
155 Second Street
Cambridge, MA 02141, USA
Tel.: +1 (617) 864-0665
Fax: +1 (617) 864-0866.

If you can send email off-site, you can post using a Usenet-news mail
server. Email to "comp-groupware@ucbvax.berkeley.edu" is posted with the
subject line of your letter becoming the subject line of the article.
(Note: "." in the newsgroup name is written as "-".) This allows you to
post to a newsgroup even if you have read-only access to Network News.


2. Sign your article. Each name should have one and only one user. If
the article is a joint product, indicate this at the beginning and end
of the article. Some news reading programs allow certain names to be to
be automatically selected. Help the reader by using the same name at all
times. This will improve the chances that people will read your
articles.

The signature should include complete name, address, and telephone
number (this allows quick verification in case forgery is suspected).
Email addresses ought to be included in the signature in case headers
get munged. Another nice feature is geographical coordinates, so the
time zone can be determined (useful in telephoning). The signature
should be limited to four lines as is suggested practice on Usenet.


3. Comp.groupware is being archived.
tvv@ncsc.org (Terry Myerson) began archiving comp.groupware 92.10.6.
The archive is available by anonymous FTP (File Transfer Protocol) from:
avs.ncsc.org ( 128.109.178.23 )

in the directory:
~ftp/newsgroups/comp.groupware

The archives are in mail folders named MONTH_YEAR.
For example, to peruse all of the postings in the month of
October, you could download the archive Oct_92, and execute

%       Mail -f Oct_92

FTP is a way of copying files between networked computers.  If you
need help in using or getting started with FTP, send email to:
mail-server@rtfm.mit.edu 

with:
send usenet/news.answers/ftp-list/faq

in the body to find out how to do FTP.

Those without FTP access should send email to:
mail-server@rtfm.mit.edu

with:
send usenet/news.answers/finding-sources

in the body to find out how to do FTP by email.


4. If you are posting copyrighted work, indicate at the beginning of the
article whether permission has been obtained. If you do not want an
article reproduced, indicate this (e.g., Copyright - Net distribution
only).


5. Read "Welcome to news.newusers.questions" in that newsgroup before
posting for the first time. This helps to avoid common mistakes and
inadvertent abusive behavior that can cause articles to be ignored.

Authors should refer to "Guidelines for posting on Usenet" in the
newsgroup "news.announce.newusers" to make sure they know to spell check
their articles, etc. "Answers to Frequently Asked Questions",
"Introduction to news.announce", "Hints on writing style for Usenet"
available in the same newsgroup also contain information for new users.

Do not post test messages to comp.groupware. There are special groups
for testing. And tests should be as limited in their distribution as
possible. This is basic information from "Guidelines for posting on
Usenet". Posting of test messages inappropriately is considered abusive
and will cause a loss of readership for your articles.

Always use your Subject line to state the *topic* of your article as
completely as possible (e.g., "Macintosh II voice-mail based real-time
meeting software ready.", rather than "Meeting software"). Summary lines
should indicate *what* your message says about the topic (e.g., "New
meeting coordination software available via anonymous FTP"). Statements
should always end with periods, questions with question marks
(typically), and high energy, high impact declarations with exclamation
points. These rules makes articles much easier for recipients to handle
appropriately. 

If you ask a question, your subject line should include "question",
"query", "(Q)" or should end with a "?". Questions should clearly
explain your problem and surrounding issues. Otherwise, you will simply
waste the time of those who want to help you. Tell people the kind of
work you are doing or contemplating doing. This helps them provide the
information you need. Indicate what efforts, if any, you have made thus
far, and what information was found.

Subject, Summary, and Keyword headers are scanned by many news reading
programs, thus permitting readers to find your article easily. You will
have your articles read more often if you select these carefully.


6. When you reply to a message, do not change the subject line or
redirect follow-ups (unless you are changing the subject).  Such changes
make it harder for some news readers to follow the threads in a
discussion. Include a "Summary" line which indicates specifically what
your message says. This permits your article to be found even if it is a
follow-up to an article with poorly chosen subject and keyword
information.

Please, do not post responses to articles you feel are inappropriate or
abusive. (If you can not resist, consider alt.flame as an alternative
newsgroup for your article [it has greater readership than
comp.groupware]). If the author is not saying anything worth reading,
enter the name in your "kill" file, and then no more of your time will
be wasted by that person. If you feel that the author is saying
something worth reading, but in an inappropriate way, respond by mail.
Tell the author what you think is incorrect about the article. If
possible, suggest how to accomplish the objective in an appropriate way
(e. g., post to another newsgroup). If you have responded to a person by
mail a few times without the desired effect, and you feel that the group
as a whole could benefit by a solution to the problem, only then should
you post an article.  The nature of your article should be a suggestion,
if possible, of how such problems can be avoided in the future.


7. Comp.groupware is read by over 28,000 people (Brian Reid posts
readership statistics at the beginning of each month to the newsgroup
news.lists). Consider the cost to readers of any post. If even an
obviously inappropriate article is distributed, one that just takes
readers a few seconds to scan, and then skip or kill, the total time
used is still large. With 36,000 readers, a post that takes an average
of 1 second for each reader to deal with (i. e., examining the subject
line) means a total of ten hours used (36,000 seconds / 3,600
seconds/hour = 10 hours). If the article uses up an average of four
seconds, then the total time expenditure is 40 hours, the equivalent of
a work week. This is probably the minimum time expenditure on any
article that is even selected for scanning. So, if you spend a week
preparing an article and then post it to comp.groupware, there will be a
balance between your time investment and that used by readers, even if
they only scan your article and make no response. The lack of a separate
feedback channel is an unfortunate deficiency in the Network News system
as it is currently structured.

This analysis should not discourage anyone from posting a simple
question. Some of the most interesting and valuable exchanges in
comp.groupware have resulted from such questions. However, authors must
not make such requests unnecessarily. On the other hand, a carefully
prepared article or a report of an extensive project may not receive any
comment at all. This could mean that the article is clear and error
free. It could also mean it was not of sufficient interest to anyone to
be read in detail. What can be assumed is that it was seriously
considered. This is a result of the currently low traffic level in
comp.groupware and high quality of articles posted.

Teachers should not make use of comp.groupware a class activity. If a
class is made aware of comp.groupware, this Introduction should be made
required reading, so inappropriate use is minimized. Instructional use
of the news system is best practised in a local newsgroup established
for that purpose. This also permits establishment of a better
environment for instructional purposes. See the article "Protecting
expression in teleconferencing: Pseudonym-based peer review journals"
{Stodolsky, D. S. (1990).  _Canadian Journal of Educational
Communication_, 19, 41-51. ([1989, May 9]. _Communication Research and
Theory Network [CRTNET]_, No. 175 [Semi-final draft available by
electronic mail from LISTSERV@PSUVM.BITNET at University Park, PA: The
Pennsylvania State University, Department of Speech Communication and
COMSERVE@Vm.ecs.rpi.edu at Troy, NY: Rensselaer Polytechnic Institute,
Department of Language, Literature, and Communication.])} This article
also available in compressed format as file "prot.express.tele" on
archive.eu.net in ~ftp/documents/authors/Stodolsky, and on ftp.nluug.nl
in ~ftp/pub/documents/authors/Stodolsky.

Retrieve and examine the file by typing, for example
(characters before and including ":" or ">" indicate machine's prompting
for input):

        > ftp archive.EU.net
        login: ftp
        password: <your email address here>
        ftp> bin
        ftp> cd documents/authors/Stodolsky
        ftp> get prot.express.tele.Z
        ftp> bye
        > uncompress prot.express.tele.Z
        > view prot.express.tele


If your email reply to an author fails, try again using information in
the signature lines. An X.500 directory information server can be
consulted to find a person's email address. Read the informational
article, "How to find people's email addresses" (in the newsgroup
"news.answers"), so you know to contact the postmaster at the site of
the person you are trying to reach, and so on. Do not post a reply until
you have tried to reach the author by telephone, facsimile, or paper
mail. If these fail, ask yourself if getting the reply through is worth
ten hours of readers' time. If so, post the message. Do not post a
message asking a person to send you an email address, unless your letter
must be kept private (If this is true, consider using encryption). If it
is not of general interest, use only the person's name as the subject
(e.g., "To: Foo Bar"). If other readers might find it interesting, also
give full subject information. 

Similarly, do not broadcast requests for information you can obtain from
a known source. Requests such as, "What are the contents of book Foo
published by Bar" are not appropriate. This information can normally be
obtained by a short telephone call and a few minutes of work by someone
being paid to provide that service. Let's not deprive someone of a job
and at the same time get comp.groupware readers fired because they are
wasting all their time reading unnecessary articles :-).

Post long articles as a single unit if they are less than 30,000
characters. Otherwise, post separate sections as follow-ups to the
first, breaking at meaningful places. This permits the sections to be
treated as a single unit, thus minimizing expenditure of attention on
the article. The cost of transmitting articles is negligible, so long
posts that take one second to delete "cost" the same as short ones.

Disregarding these considerations or a lack of self discipline in
following them will result in defensive attention management. That is,
certain authors will not be read at all by many readers or valuable
discussions will take place by email instead of being posted. This would
have the unfortunate effect of fractionating the joint awareness that
permits the comp.groupware readership to function as a group. Thus, it
is recommended that authors who prefer entertainment to rigor in their
news reading, post to other newsgroups.

-------

This article compiled with assistance from numerous readers of
comp.groupware.

Corrections, comments, and suggestions to:

David S. Stodolsky                            Tel: + 45 31 95 92 82
Department of Computer Science                Fax: + 45 46 75 42 01
Bldg. 20.1, Roskilde University              Internet: david@ruc.dk
Post Box 260, DK-4000 Roskilde, Denmark        : david@mcsun.EU.net


From Eija Korpela <Eija.Korpela@vtt.fi>
Newsgroups: comp.groupware
Subject: Notes in REAL use
Date: 7 Apr 1993 06:31:54 GMT
Organization: Technical Research Centre of Finland (VTT)
Lines: 26
Distribution: world
Message-ID: <1ptsgqINN611@vttux1.vtt.fi>
NNTP-Posting-Host: 130.188.36.133
X-UserAgent: Nuntius v1.1a2

For my dissertation I have been exploring Notes applications, in an
attempt to find out the limits and possibilities of Notes as an
application development environment. Most of the Notes applications I
have come across to are either
- based on the examples given by Lotus Corp.
- experimental or "to be introduced in the next two months"
- used by computing professionals and/or sophisticated computer users
I would like to learn of applications in actual production use, used by
non-computer persons.

Are there any serious applications that several people use in their
daily work, applications that serve the business or other operative needs
of companies, government or research institutions?

Please reply by email to Eija.Korpela@vtt.fi. If your info is
confidential, I will keep it confidental. If not, I will include it in a
summary to be posted in comp.groupware. I will use an alias or exclude
the company name if wished.

Thanking for the information already in advance,

Eija Korpela																														Internet: Eija.Korpela@vtt.fi
Technical Research Centre of Finland                      Fax: +358 0 456
7023
Otakaari 11
01250 ESPOO, Finland


From rwhitehead@cix.compulink.co.uk (Roger Whitehead)
Subject: <None>
Cc: rwhitehead@cix.compulink.co.uk
Reply-To: rwhitehead@cix.compulink.co.uk
Date: Wed, 7 Apr 1993 20:01:29 +0000
Message-ID: <memo.111753@cix.compulink.co.uk>
Sender: usenet@demon.co.uk
Lines: 8


> Groupware will do me just fine, until something which packs a more
> helpful understanding of the area into fewer syllables (the target is one!)
> comes along

"Hype"?

Roger


From johnod@quay.ie
Subject: Re: NOTES Technical Problem on Network
Sender: @quay.ie
Message-ID: <Apr08.152444.13696@quay.ie>
Date: Thu, 8 Apr 1993 15:24:44 GMT
News-Software: IBM OS/2 PM RN (NR/2) v0.17h by O. Vishnepolsky and R. Rogers
Lines: 67
Reply-To: johnod@quay.ie
References: <fridayC4z7Fo.LCp@netcom.com>
Organization: Quay Financial Software
Lines: 67

In <fridayC4z7Fo.LCp@netcom.com> friday@netcom.com (Carol Anne Ogdin) writes:
>I'm running NOTES 2.1 on OS/2 1.3 connected to NetWare 3.11
>
>Because the network has the largest disk drive, I wanted to install
>the code on the OS/2 workstation, and all the database files on
>the file server.  Everything worked (ostensibly) fine until I
>tried to Certify or Create new users:  Efforts to connect to the
>Notes server (e.g., to set up a mail database for the new user)
>meet with a stone wall saying "Remote pathname must be relative
>to Data Directory".
>
>That message is no where documented.  It isn't making sense.  The
>path to the database directory is in both the PATH and DPATH state-
>ments in CONFIG.SYS.
>
>Temporary Solution:  Put in a new disk drive to accomodate the
>Data Directory on the OS/2 machine, but it's gonna get full soon.
>
>Question:   Do you know what the message really means and how to
>            get around it?
>
>Question:   Do you know if this is a bug that Version 2.1A fixed?
>            (I'm trying to hold off upgrading until 3.0 next month.)
>
>Hel-l-lp!
>
>-- 
>--Friday                                  "Act in such a way that you always
>   Carol Anne Ogdin, Principal Designer    treat humanity never simply as a
>   Deep Woods Technology                   means but always also as an end." 
>     friday@well.sf.ca.us                                   --Immanuel Kant 

Hi;

I'm also running notes v2.1, but on a Token Ring network. 

The Notes server does expect all of the databases to be stored in the specified data 
directory or in a directory below it. There is however a workaround which avoids this 
problem. (thanks Peter)

Rather than storing a database in the data directory, it is possible to store the actual 
database on another disk and still use it (without the user noticing!) so long as you store
a pointer file in the data directory which points to the actual database on the remote disk. 
(a bit like file links in Unix)

For example, if you copy a database called TEST.NSF from the data directory on the 
notes server onto the J:\ABC\DEF\TEST.NSF, you should then create a plain ASCII text file 
called TEST.NSF in the data directory. This text file should contain only one line

J:\ABC\DEF\TEST.NSF

The Notes server software will open the TEST.NSF in the data directory, detect that it is not
a valid NSF format database, and check to see if it is a pointer or link file. If it is, it will go to that
directory and open the specified database.

Hope this helps...


Take Care

John.

#########################
John O'Duinn
Quay Financial Software
email: johnod@quay.ie
#########################


From geer@world.std.com (Dan Geer)
Subject: Symposium on Mobile & Location Independent Computing
Message-ID: <C56774.53s@world.std.com>
Summary: _LAST_ Call for Papers on Mobile Computing
Keywords: mobile computing
Organization: The World @ Software Tool & Die
Date: Thu, 8 Apr 1993 15:04:14 GMT
Lines: 165

Followup-to: comp.org.usenix


ANNOUNCEMENT/CALL FOR PAPERS

1993 USENIX SYMPOSIUM ON MOBILE & LOCATION-INDEPENDENT COMPUTING
August 1-3, 1993 
Marriott Hotel 
Cambridge, Massachusetts


USENIX
The UNIX and Advanced Computing Systems Professional and Technical Association


Much of the growth of UNIX has been due to its support for casual
communications, thus fostering cooperative work within a location-
independent framework. The latest incarnation of location-independence
is "Mobile Computing."

Distributed computing, now pervasive in other circles, was pioneered by
the UNIX community. Support for Mobile Computing is the next logical
step in assuring the role of UNIX as the operating system that offers a
rich and complete feature set.

Progress in Mobile Computing is everywhere evident both in academic and
non-academic circles. We intend to concentrate on it in a true state-of-
the-art symposium and technical free-for-all on what it takes to make
Mobile Computing work and work right.

SYMPOSIUM SCHEDULE
Sunday, August 1, evening     Registration and Welcome Reception 
Monday, August 2, all day     Keynote by Bob Metcalfe of InfoWorld,
                                followed by technical sessions
Monday, August 2, 6-10 pm     Vendor Demonstrations, BOFs
Tuesday, August 3, all day    Technical sessions
Tuesday, August 3, noon       Hosted Luncheon with speaker

This is a single track symposium offering two days of refereed paper
presentations.  The symposium will also include two panels,
Work-in-Progress reports, a Keynote and a speaker at the luncheon
(including with registration).  Birds-of-a-Feather sessions and a
series of Vendor Demonstrations will take place Monday evening.

Formally reviewed papers, presented during the symposium, will be
published in the symposium proceedings.  Proceedings will be
distributed free to attendees during the symposium and later will be
available for purchase from the USENIX Association.

SYMPOSIUM TOPICS
As is usual for a USENIX symposium, we are looking for new and
arresting developments in systems that directly contribute to a
technical understanding of Mobile Computing.  UNIX will be the lingua
franca of discussion, but we are eager for progress from other world
views to be presented as well.  The Mobile Computing Symposium will
address a wide range of issues and ongoing developments, including, but
not limited to:

 -Naming (e.g. Prospero or OSF/DCE DNS)
 -Wide area information distribution (e.g. WAIS or archie)
 -Security (e.g. authentication based on devices or digital signature services)
 -User locatability (e.g. paging systems or active badges)
 -Rendezvous (e.g. videoconferencing over the internet or various groupware
  efforts)
 -Networking and Connectability (e.g. the new IETF routing work, movement of
  ``sockets'' from site to site, or the rumored advent of IP connections from
  airplanes)
 -Portable tiny devices (e.g. the various palmtops or personal information
  assistants)

REFEREED PAPER SUBMISSIONS
Submission of an extended abstract of 1500-2500 words (9000-1500 bytes
or 3-5 pages) is recommended.  Shorter abstracts run a significant risk
of rejection as there will be little on which the program committee can
base an opinion.  Extended abstracts should be sent to Dan Geer at the
address below.  Those submitting hardcopy abstracts must send five
copies.

Please also provide the following information about the author(s):
 -name
 -title
 -affiliation
 -daytime telephone
 -postal address,
 -email address (please)
 -FAX if possible
 -whether you want a 15, 30 or 45 minute time slot.

IMPORTANT DATES

DATES FOR REFEREED PAPER SUBMISSIONS
April 19, 1993   Extended abstracts due
May 3, 1993      Notification to authors
June 14,1993     Camera-ready final papers due

Registration Materials Available:  May, 1993

PROGRAM COMMITTEE
Program Chair: Dan Geer
Geer Zolot Associates
geer@gza.com

Vice-Program Chair: Clement Cole
Locus Computing Corporation
clemc@locus.com

Ed Gould
Digital Equipment Corporation
ed@pa.dec.com

Mike Kazar
Transarc Corporation
mike_kazar@transarc.com

Jeff Kellem
Beyond Dreams
composer@beyond.dreams.org

Alan Nemeth
Digital Equipment Corporation
agn@flume.enet.dec.com

Tom Page
University of California, Los Angeles
page@ficus.cs.ucla.edu

Charlie Perkins
IBM - T. J. Watson Research Center
perk@watson.ibm.com

Dave Presotto
AT&T
presotto@research.att.com

Jim Rees
University of Michigan
jim.rees@umich.edu


FOR MORE PROGRAM INFORMATION
For questions about refereed paper submissions and other program
concerns, contact the Program Chair:

		Daniel E. Geer, Jr., Sc.D.
		Geer Zolot Associates
		One Main Street
		Cambridge, Massachusetts 02142
		Email:     geer@gza.com
		Telephone: +1 617 374 3700
		FAX:       +1 617 374 3715

FOR REGISTRATION INFORMATION
Materials containing all details of the symposium program, symposium
registration fees and forms, and hotel discount and reservation
information will be mailed end of May, 1993.  If you wish to receive
the registration materials, please contact:

USENIX Conference Office
22672 Lambert Street, Suite 613
Lake Forest, CA USA 92630
Email:     conference@usenix.org
Telephone: +1 714 588 8649
FAX:       +1 714 588 9706




From friday@netcom.com (Carol Anne Ogdin)
Subject: Re: NOTES Technical Problem on Network
Message-ID: <fridayC570LG.LD@netcom.com>
Organization: NETCOM On-line Communication Services (408 241-9760 guest)
References: <fridayC4z7Fo.LCp@netcom.com> <Apr08.152444.13696@quay.ie>
Date: Fri, 9 Apr 1993 01:39:15 GMT
Lines: 19

In <Apr08.152444.13696@quay.ie> johnod@quay.ie writes:

>The Notes server does expect all of the databases to be stored in the specified data 
>directory or in a directory below it. There is however a workaround which avoids this 
>problem. (thanks Peter)

Oooh.  Neat, John.  Thanks for the hint (and I wonder where *that* was
documented...NOTES is miserable on that account).  I'll try it soon.

While it requires some manual intervention, I can set up a maintenance
procedure to put in those pointers (until some damn/dumb fool tries to
replicate an 80 MB database from somewhere!).

Again, thanks for the hint.
-- 
--Friday                                  "Act in such a way that you always
   Carol Anne Ogdin, Principal Designer    treat humanity never simply as a
   Deep Woods Technology                   means but always also as an end." 
     friday@well.sf.ca.us                                   --Immanuel Kant 


From joe@netcom.com (Joseph Jesson)
Subject: Re: Notes in REAL use
Message-ID: <joeC57rxA.47w@netcom.com>
Organization: Netcom - Online Communication Services (408 241-9760 guest)
References: <1ptsgqINN611@vttux1.vtt.fi>
Date: Fri, 9 Apr 1993 11:29:34 GMT
Lines: 12


 Most of the "real" Notes commercial applications are not
advertised since companies are using them for competitive
advantage.  For example, I know of two major oil companies
using Notes for tracking their competition (CI database)
and many are using Notes for help desk problem solving.

You may want to dig deeper into the motivation of
Aurthur Anderson's recent decision to go  with Notes...

  --Joe



From mario@ucssun1.sdsu.edu (Marito Villarreal)
Newsgroups: comp.groupware
Subject: groupware in soft. development wanted
Date: 9 Apr 1993 19:14:08 GMT
Organization: San Diego State University Computing Services
Lines: 11
Message-ID: <1q4hu0$erp@gondor.sdsu.edu>
NNTP-Posting-Host: ucssun1.sdsu.edu

Does someone know about information of how to use groupware in a 
distributed software engineering environment ???? This can be
(group of people working on a module, or working in the low-level
desing phase, even, they could be working using a object oriented
design approach, etc ,et)
Do you know an article, a book, a commercial product, a journal paper, etc, etc
All help is really appreciated.



mario villarreal (mario@ucssun1.sdsu.edu)


From rslade@fraser.sfu.ca (Robert Slade)
Subject: Groupware (in)security query
Message-ID: <1993Apr10.043604.27597@sfu.ca>
Sender: news@sfu.ca
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Sat, 10 Apr 1993 04:36:04 GMT
Lines: 10

I am looking for comments, experiences and anecdotes on the security
(or lack thereof) of specific groupware applications, or on the
groupware concept as a whole.  This will become part of an article on
the subject.

For those reading this on the newsgroups, I would appreciate email, or
a "backup" copy to roberts@decus.ca and rslade@sfu.ca.

Thanks in advance.



From weon@halmi.kaist.ac.kr (Taehwan Weon)
Subject: Looking for Mocca project introduction
Message-ID: <1993Apr11.122441.17250@worak.kaist.ac.kr>
Sender: usenet@worak.kaist.ac.kr (Usenet)
Organization: Korea Advanced Institute of Science and Technology
X-Newsreader: TIN [version 1.1 PL8]
Date: Sun, 11 Apr 93 12:24:41 GMT
Lines:       13

Hi,
I am looking for an introduction material about Mocca project.
To my knowledge, it is a sub-project of Esprit project.
Any help will be appreciated.


--
-------------------------------------+------------------------------------------
 E-mail    : weon@cosmos.kaist.ac.kr |   			   Weon, Taehwan
 Telephone : +82-42-869-3554         |                  System Architecture Lab.
 Faximile  : +82-42-869-3510         | Computer Science Department, KAIST, KOREA
-------------------------------------+------------------------------------------


From interactions.chi@xerox.com
Subject: Call for Papers - Interactions
Message-ID: <1993Apr11.195641.10597@sei.cmu.edu>
Followup-To: poster
Keywords: user interface, practice & experience, Interactions, call for papers
Sender: netnews@sei.cmu.edu (Netnews)
Organization: Software Engineering Institute
Date: Sun, 11 Apr 1993 19:56:41 EDT
Lines: 68


Interactions is a major new user interface publication published 
quarterly by ACM -- the Association for Computing Machinery. The editors 
of Interactions, a timely new quarterly magazine on applied 
human-computer interaction (HCI), invite articles, reports, surveys and 
tutorials about the design, implementation, evaluation, and uses of 
interactive systems and user interface tools, techniques and products.

Premiering in January 1994, Interactions' primary objective will be 
to communicate ideas, standards, practices, research results and case 
studies to the practitioner. Users, designers, developers, managers, 
researchers and purchasers interested in HCI will gain access to leading-
edge ideas and tools that emerge from research and development, 
achieving a true technology transfer from R&D settings to the practitioner 
community.

With international coverage, Interactions will be the recognized 
source for readily available, readable information on how the latest 
research advances are being applied in practice. Readers will also benefit 
from surveys, tutorials and news items on relevant and emerging topics, as 
well as information about products, books, software, seminars and services.

Articles must present potential importance to real-world applications. 
Conceptual and theoretical articles are also welcome. Interactions' 
topics include:

-- users and how they work

-- how other designers design systems for people

-- design guidelines and standards

-- processes, methods and tools for designing user interfaces and 
   interactive systems

-- usability and user acceptance of designs

-- impacts of ergonomic, user-centered product or system design

-- applying new research or case studies to real-world applications

-- new user interface styles and devices

-- what it takes to "know the user"

-- HCI liability issues and regulation

-- future directions in designing artifacts for use by people

Manuscripts are selected for review and publication on the basis of 
significance and general interest to the readers. Principle categories of 
papers include general interest articles and case studies. On occasion, 
special sections and reports may be published. All submissions are 
reviewed for content, definitiveness, interest and importance to the 
practitioner community. There are also several channels for expressions of 
opinion. 

Send four copies of each manuscript (5-10 pages finished copy) to the
Associate Editor-in-Chief, Interactions, Bill Hefley, Software Engineering
Institute. Carnegie Mellon University, 4500 Fifth Ave., Pittsburgh, PA 15213,
U.S.A., or submit each manuscript electronically to: interactions.chi@
xerox.com. Complete instructions for authors are available on request.


-----------------------------------------------------------------------
Bill Hefley, Software Engineering Institute, Carnegie Mellon University
Pittsburgh, PA 15213  U.S.A. 
Office: (412) 268-7793 , Fax: (412) 268-5758, internet: weh@sei.cmu.edu


From szpak@fox.nstn.ns.ca (Mark Szpakowski)
Subject: Re: groupware in soft. development wanted
Message-ID: <9304122107.AA08523@192.219.29.101>
Sender: usenet@nstn.ns.ca (NNTP Entity)
Reply-To: szpak@fox.nstn.ns.ca (Mark Szpakowski)
Organization: NSTN Network Operations Centre, Nova Scotia, Canada
X-Newsreader: InterCon TCP/Connect II 1.1
References: <1q4hu0$erp@gondor.sdsu.edu>
Date: Tue, 13 Apr 1993 01:07:08 GMT
Lines: 15

In article <1q4hu0$erp@gondor.sdsu.edu>, mario@ucssun1.sdsu.edu (Marito 
Villarreal) writes:
> 
> Does someone know about information of how to use groupware in a 
> distributed software engineering environment ???? 

> Do you know an article, a book, a commercial product, a journal paper, 
> etc, etc. 

I understand that Taligent (the Apple/IBM company developing the PINK object-
oriented OS) is making good use of PacerForum.






From mike@ulinf0.unil.ch (Michael Bloch)
Subject: Looking for a report from City University Business School (London)
Message-ID: <1993Apr13.131015.15248@ulci20.unil.ch>
Sender: news@ulci20.unil.ch
Organization: HEC, University of Lausanne, Switzerland
Date: Tue, 13 Apr 1993 13:10:15 GMT
Lines: 15

Hi,

Last BYTE (April 93) mentions (p.40) a report on groupware from
the City University Business School (London).

Have you seen this report ? Do you know where to inquire about it ?
Any e-mail adress from someone in the research group ?
Any info ?

Thanks a lot, best regards
-- 
Michael Bloch                                     Internet : mike@ulinf0.unil.ch
University of Lausanne, Switzerland               

Love is a better teacher than duty - Albert Einstein


From e28bgid2@cine88.cineca.it
Newsgroups: comp.cog-eng,comp.groupware,comp.human-factors,comp.infosystems
Subject: Partners wanted for Esprit III -- CSCW
Message-ID: <1993Apr13.184059.889@cine88.cineca.it>
Date: 13 Apr 93 18:40:59 +0100
Organization: CINECA, Italian Interuniversity comp. centre
Lines: 23

Hi everybody,

we are *urgently* looking for partners in a Esprit III project (provisional
name CLOUD).  The project will provide a communication media among
users, developers and experts in a large organisation in the form of a
help desk.

Partners should be European (CEC members) and do _not_ belong
to Italy, France and Greece.  (We are not chauvinist; we are Italian,
French and Greek and we want people from other nations).

Please e-mail, phone or fax for details to:

	Andrea Spinelli
	phone +39-35-307322
	fax +39-35-211191
	e-mail  e28bgid2@cine88.cineca.it

The proposal is due for April 22nd (!).

Thanks
	A.S.



From dcheslow@impact.flint.umich.edu (David A. Cheslow)
Newsgroups: comp.groupware
Subject: Anyone heard of OmniVision?
Date: 13 Apr 1993 21:44:53 GMT
Organization: University of Michigan Engineering, Ann Arbor
Lines: 13
Distribution: world
Message-ID: <1qfc8lINNsne@srvr1.engin.umich.edu>
NNTP-Posting-Host: impact.flint.umich.edu



I am looking for a reference to Omnivision which is supposed to be a GDSS  
system. Can you help?  Please respond by e-mail, I am not a regular reader  
of this group.

--
===============================================================
*NOT* an official document of the University of Michigan-Flint
===============================================================
 David A. Cheslow               dcheslow@impact.flint.umich.edu
 School of Management, 344 CROB           Phone: (313) 762-3309
 University of Michigan - Flint             Fax: (313) 762-3282  


From zakon@hicup.mitre.org (Robert H Zakon)
Subject: Research Projects in CSCW
Message-ID: <1993Apr13.211937.13094@linus.mitre.org>
Sender: news@linus.mitre.org (News Service)
Nntp-Posting-Host: hicup.mitre.org
Reply-To: zakon@hicup.mitre.org
Organization: The MITRE Corporation
Date: Tue, 13 Apr 1993 21:19:37 GMT
Lines: 10

I am doing a survey of research projects in the area of CSCW in order
to look at where the field is going.  If you are working on a CSCW 
project or know of one, I would appreciate you e-mailing me a brief
blurb on it along with a contact (e-mail address prefered).  Please
note that I do not want to know about commercial products, but rather
projects going on in research labs within industry and universities.

E-mail replies directly to
  Robert H Zakon, rzakon@mitre.org



From cfwu@sun8.ice.ntnu.edu.tw (Wu Chi-Fon)
Subject: Where to find prototype
Message-ID: <1993Apr14.053600.16932@cc.ntnu.edu.tw>
Sender: news@cc.ntnu.edu.tw
Nntp-Posting-Host: sun8.ice.ntnu.edu.tw
Organization: NTNU, Taiwan, R.O.C.
Date: Wed, 14 Apr 1993 05:36:00 GMT
Lines: 14

I am a freshman of groupware and I want to see how groupware work,
especially group editor. But this year my school has no budget to buy a
commercial software of groupware. Anybody knows where to get a
prototype of groupware using ftp, please tell me. And is there any books,
papers or technical report concerning with how to build a groupware?

Thanks a lot!!

Wu Chi-feng
cfwu@ice.ntnu.edu.tw
Department of Information and Computer Education
National Taiwan Normal University




From rwhitehead@cix.compulink.co.uk (Roger Whitehead)
Subject: Re: groupware in soft. development wante
Cc: rwhitehead@cix.compulink.co.uk
Reply-To: rwhitehead@cix.compulink.co.uk
Date: Tue, 13 Apr 1993 20:54:39 +0000
Message-ID: <memo.125864@cix.compulink.co.uk>
Sender: usenet@demon.co.uk
Lines: 21


> I understand that Taligent . . . is making good use of PacerForum.

Have you any details of this, or a contact name and number?

TIA,

Roger

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Roger Whitehead,
Director,
Office Futures,
14 Amy Road,
Oxted,
Surrey    RH8 0PX
England

Telephone:  +44 883 713074
Fax:  +44 883 716793
Email:  rwhitehead@cix.compulink.co.uk


From carmel@icbl.hw.ac.uk (Carmel Smith)
Newsgroups: comp.groupware
Subject: Groupware for PCNFS connected PCs?
Keywords: groupware, PCNFS
Message-ID: <1993Apr14.082542.2613@cee.hw.ac.uk>
Date: 14 Apr 93 08:25:42 GMT
Sender: news@cee.hw.ac.uk (News Administrator)
Organization: Institute for Computer Based Learning
Lines: 25

Can anyone tell me if it will be possible to run a suite of groupware on a few PCNFS
connected PCs.

It has been suggested to me that this is likely to be quite difficult, and a quick read of 
a number of articles on groupware for PCs suggests developers assume the user has a Novel 
server and network. I have been told that PC to PC direct communication is possible
for NFS PCs if the groupware comes with a Novel packet driver. Does this driver convert
TCPIP into Novel protocols, or emulate a Novel driver? What are the problems in attempting
to run groupware without a server architecture? If a Novel packet driver is used for the 
groupware, would I have to reboot my machine to get back to applications requiring the 
TCPIP driver? Could anyone help me get a handle on the problems so I can work out the
best way forward?

Can anyone tell me what commercial groupware is known to work successfully with PCNFS
and if there is any public domain groupware that I could try? Does anyone keep lists
of free groupware that I can look up? What are the key things I need to look for in
their specificationns to ensure they will run on my PC? 

If all else fails could I run unix based groupware using a sun server and my PC as an
Xclient?

If these questions have already been raised and you think further discussion is likely to 
annoy other readers please mail me directly (carmel@icbl.hw.ac.uk)

Carmel Smith


From jbowyer@cis.vutbr.cs (Bowyer Jeff)
Subject: We Want Your Work
Date: Wed, 14 Apr 1993 10:02:16 GMT
Message-ID: <1993Apr14.100216.3843@cis.vutbr.cs>
X-Newsreader: TIN [version 1.1 PL8]
Reply-To: jbowyer@cis.vutbr.cs
Organization: Technical University of Brno, Czech Republic
Lines: 61


We want you to announce your work on our mailing list!

     Do you use a program that has a non-English interface?

     Have you converted any software to support more than one language for
     its interface?

     Will you sponsor a conference that might concern software with a
     non-English interface?

Please tell us!



INSOFT-L on LISTSERV@CIS.VUTBR.CS   Internationalization of Software
                                    Discussion List

   Internationalization of software relates to two subjects:

        1. Software that is written so a user can easily change the
           language of the interface;

        2. Versions of software, such as Czech WordPerfect, whose
           interface language differs from the original product.

   Topics discussed on this list will include:

        -- Techniques for developing new software

        -- Techniques for converting existing software

        -- Internationalization tools

        -- Announcements of internationalized public domain software

        -- Announcements of foreign-language versions of commercial
           software

        -- Calls for papers

	-- Conference announcements

	-- References to documentation related to the
           internationalization of software
	
   This list is moderated.

   To subscribe to this list, send an electronic mail message to
   LISTSERV@CIS.VUTBR.CS with the body containing the command:

      SUB INSOFT-L Yourfirstname Yourlastname

   Owner:

      Center for Computing and Information Services
      Technical University of Brno
      Udolni 19, 602 00 BRNO
      Czech Republic

      INSOFT-L-REQUEST@CIS.VUTBR.CS


From idema@cs.utwente.nl (Anne Idema)
Subject: Groupware & concurrent engineering
Message-ID: <1993Apr14.123757@cs.utwente.nl>
Sender: usenet@cs.utwente.nl
Nntp-Posting-Host: courvoisier.cs.utwente.nl
Organization: University of Twente, Dept. of Computer Science
Date: Wed, 14 Apr 1993 10:37:57 GMT
Lines: 13


Hello everybody,

I'm interested in news, articles etc.. about groupware and concuurent
engineering. If you do have articles in electronic form, please mail
them to me.

Thank You.

Anne Idema





From szpak@fox.nstn.ns.ca (Mark Szpakowski)
Subject: Re: groupware in soft. development wante
Message-ID: <9304140950.AA56272@192.219.29.101>
Keywords: Groupware conferencing PacerForum Notes
Sender: usenet@nstn.ns.ca (NNTP Entity)
Reply-To: szpak@fox.nstn.ns.ca (Mark Szpakowski)
Organization: NSTN Network Operations Centre, Nova Scotia, Canada
X-Newsreader: InterCon TCP/Connect II 1.1
References: <memo.125864@cix.compulink.co.uk>
Date: Wed, 14 Apr 1993 13:50:56 GMT
Lines: 16

In article <memo.125864@cix.compulink.co.uk>, rwhitehead@cix.compulink.co.uk 
(Roger Whitehead) writes:
> 
> > I understand that Taligent . . . is making good use of PacerForum.
> 
> Have you any details of this, or a contact name and number?
> 

I wish I could remember where I read this - an article that mentions that 
Taligent was using PacerForum as a conferencing and message/document sharing 
system, and that it was as effective as Lotus Notes. I think Taligent is 
located in Cupertino, California. Pacer Software is in La Jolla, California.






From bell@dcs.qmw.ac.uk (Dave Bell)
Newsgroups: comp.groupware
Subject: Re: Looking for a report from City University Business School (London)
Message-ID: <C5HCCn.H9M@dcs.qmw.ac.uk>
Date: 14 Apr 93 15:29:11 GMT
References: <1993Apr13.131015.15248@ulci20.unil.ch>
Sender: usenet@dcs.qmw.ac.uk (Usenet News System)
Organization: Computer Science Dept, QMW, University of London
Lines: 23

In <1993Apr13.131015.15248@ulci20.unil.ch> mike@ulinf0.unil.ch (Michael Bloch) writes:

>Last BYTE (April 93) mentions (p.40) a report on groupware from
>the City University Business School (London).

>Have you seen this report ? Do you know where to inquire about it ?
>Any e-mail adress from someone in the research group ?
>Any info ?

I have their phone number - I have no e-mail addresses I'm afraid.

+44 71 477 8000

I'm sure someone will claim responsibility for the article !

dave


-- 
-------------------------------------------------------------
Dave Bell  (HCI Researcher)    : Internet: bell@dcs.qmw.ac.uk
Computer Science Dept          : UUCP:     bell@qmw-dcs.UUCP
Queen Mary & Westfield College : Phone:    +44 071-975 5256/8


From rwhitehead@cix.compulink.co.uk (Roger Whitehead)
Subject: Re: groupware in soft. development wante
Cc: rwhitehead@cix.compulink.co.uk
Reply-To: rwhitehead@cix.compulink.co.uk
Date: Wed, 14 Apr 1993 23:56:10 +0000
Message-ID: <memo.130176@cix.compulink.co.uk>
Sender: usenet@demon.co.uk
Lines: 4


I'll track Pacer down there, thanks Mark.

Roger


From roseman@cpsc.ucalgary.ca (Mark Roseman)
Subject: update on GroupKit (current status / future plans)
Message-ID: <C5J6KG.E7r@cpsc.ucalgary.ca>
Followup-To: poster
Keywords: groupware toolkit GroupKit
Sender: news@cpsc.ucalgary.ca (News Manager)
Organization: University of Calgary Computer Science
Date: Thu, 15 Apr 1993 15:19:27 GMT
Lines: 52

A few people have been asking about GroupKit, which was first released
in October just before CSCW in Toronto.

Personally, much of the time after the conference was spent writing my
thesis, and since thats been overwith we've been looking at GroupKit again.
If anyone would like a copy of my thesis, you can anonymously ftp the 
postscript file from cpsc.ucalgary.ca, as the file /pub/roseman/thesis.ps.Z.
I'll be working on things at the university until at least end of June,
and taking some holidays for July and August, as well as looking for
employment for September!

Anyway, sometime in May you can expect a new GroupKit release, containing
some bug fixes as well as a major new set of components for group objects,
suitable for implementing, say, a multi-user MacDraw type program.  This
is based on our earlier "GroupDraw" prototypes; see papers in HICCS92
or Interacting with Computers 4(3) for details.  Again, this will require
a C++ compiler (I don't think g++ is acceptable yet) and InterViews 3.1.

Unfortunately, we've been finding that working with GroupKit is not as easy
as we'd hoped -- the GroupKit part has been fine, but InterViews has been
almost painful at times.  Because of some longer-term plans (an attempt to
make InterViews into an X Consortium standard called Fresco), the current
implementation is left with a relatively weak widget set, a structure that
resists attempts at customizing widgets, and poor documentation.  All of these
are significant barriers to using GroupKit, especially for the novice.

We're retargeting GroupKit to work with John Ousterhout's Tcl and Tk packages,
which like InterViews, are public domain and provide an easier interface to
X11 programming on just about every Unix box.  Because it provides a richer
widget set, straightforward commands to access the widgets, and extensive
documentation, we think its currently a more accessable platform than
InterViews.  Additionally, our group will be better able to support and
extend GroupKit after its InterViews guru (i.e. me) leaves!  Look for a 
release of Tcl-based GroupKit in June.  (You may want to follow the
comp.lang.tcl newsgroup for info -- I'll be posting major announcements to
comp.groupware, but comp.lang.tcl will likely get a lot of the techy traffic).

So, to summarize:

  1. you can grab my thesis from /pub/roseman/thesis.ps.Z@cpsc.ucalgary.ca
  2. look for an InterViews-based GroupKit release with group drawing in May
  3. look for a Tcl-based GroupKit release in June

Mark



-- 
==============================================================================
Mark Roseman  --- Groupware'R'Us
Dept. of Computer Science, University of Calgary, Calgary, Alta.  T2N 1N4
(403) 220-7691   roseman@cpsc.ucalgary.ca    Fax: (403) 284-4707


From mueller@ukraine.corp.mot.com (Bruce Mueller)
Subject: Re: groupware in soft. development wanted
Reply-To: mueller@ukraine.corp.mot.com
Organization: Motorola, Inc.
Date: Fri, 16 Apr 1993 16:48:44 GMT
Message-ID: <1993Apr16.164844.3287@lmpsbbs.comm.mot.com>
References: <9304140950.AA56272@192.219.29.101>
Sender: news@lmpsbbs.comm.mot.com (Net News)
Nntp-Posting-Host: 137.23.47.93
Lines: 12

I have just investigated the same thing -
PacerForum's number is 619-454-0565 -

For primarily macintosh applications, there 
is a neat product called Aspects from
Group Technoogies.   It looks super for 
group work, but I don't know how it will
work with software development.  Talk
with Reid or Demitri at G.T. 703-528-1555,
or mail me in a week or so after we try it
out.



From sf329@city.ac.uk (HOLTHAM C W)
Subject: Looking for City University Business School
Message-ID: <sf329.735181459@Victoria>
Keywords: CUBS
Sender: news@city.ac.uk (Unix Network News)
Nntp-Posting-Host: victoria
Organization: The City University
Date: 19 Apr 93 01:04:19 GMT
Lines: 29



In comp.groupware you write:

>In <1993Apr13.131015.15248@ulci20.unil.ch> mike@ulinf0.unil.ch (Michael Bloch) writes:

>>Last BYTE (April 93) mentions (p.40) a report on groupware from
>>the City University Business School (London).

>>Have you seen this report ? Do you know where to inquire about it ?
>>Any e-mail adress from someone in the research group ?
>>Any info ?

The report is called "Improving the Performance of Workgroups
through Information Technology" by Clive Holtham, and my details are

Clive Holtham
Bull Information Systems Professor of Information Management
City University Business School
Frobisher Crescent
Barbican Centre
LONDON EC2Y 8HB
UK

Tel 071-477-8629
Fax 071-477-8880
email sf329@city.ac.uk




From prevel@uni2a.unige.ch
Subject: RESUME : Notes, WorkFlow modelling, ATI
Message-ID: <1993Apr19.095059.1@uni2a.unige.ch>
Lines: 43
Sender: usenet@news.unige.ch
Organization: University of Geneva, Switzerland
Date: Mon, 19 Apr 1993 07:50:59 GMT


Hi,

Late February I posted a request for information about Lotus Notes,
WorkFlow modelling and the Action Tech. Inc. add on. I said I would post a
resume of the replies. Unfortunattely all the replies I had go something
like that :

>
>I don't have any information
>to offer but I would be very interested in receiving a copy of the
>resume of replies if you still have it.
[...]
>Could you please forward the above information to me ?
[...]
>did you get any reaction concerning your posting in comp.groupware about
>the integration of the Flores/Winograd model into Notes?
>I'm very interested in the results of your request, since we are starting
>to work with Lotus Notes. So it would be a great deal to have the
>possibility to model business processes in a better form than the
>unstructured way actually available for Notes.
[...]
>Please send me the reactions you got on your posting in
>comp.groupware Feb 26th.
[...]

So... I think there is interest on this question but not much information
avalaible (at least on the net). 
If I get more info, I will post it to people that made the request.

Bye

                Michel 

----------------------------------------------------------------------------
Michel Prevel                       Phone   : 41-22/705 81 16
Universite de Geneve		    Fax	    : 41-22/781 41 00
Dpt. COMIN			    E. Mail : prevel@uni2a.unige.ch
102, Bd. Carl-Vogt
1211 Geneve 4 - SWITZERLAND
----------------------------------------------------------------------------
--



From friday@netcom.com (Carol Anne Ogdin)
Subject: NOTES End-User Training
Message-ID: <fridayC5qo85.HGq@netcom.com>
Summary: New End-User Training program
Keywords: Lotus NOTES training education
Organization: NETCOM On-line Communication Services (408 241-9760 guest)
Date: Mon, 19 Apr 1993 16:24:04 GMT
Lines: 14

My consultancy, Deep Woods Technology, has just developed a new
End-User education program for Lotus NOTES.  It is focused on the
needs of large organizations (>300 licenses), and offers useful
education significantly beyond the usual "menu navigation" stuff
generally available.  And, we can do it for as low as $100/student.

If you'd like more information, please e-mail me (privately; let's
not clutter the list) and I'll respond.

-- 
--Friday                                  "Act in such a way that you always
   Carol Anne Ogdin, Principal Designer    treat humanity never simply as a
   Deep Woods Technology                   means but always also as an end." 
     friday@well.sf.ca.us                                   --Immanuel Kant 


From MAKKONEN_P@jylk.jyu.fi (t04 MAKKONEN_P )
Subject: Any good hypertextprogram for LAN(Novell) environement ???
Message-ID: <1993Apr20.091506.4269@jyu.fi>
Sender: news@jyu.fi (News Manager)
Nntp-Posting-Host: jylk.jyu.fi
Organization: University of Jyvaskyla
Distribution: comp
Date: Tue, 20 Apr 1993 09:15:06 GMT
X-News-Reader: VMS NEWS 1.20
Lines: 32

Hello



Do you know any good hypertext

We use Novell in our institute.

My plan is that my students
will design and build hypertext
in small groups and aftet that
any hypertext can be used by
anyone. All hypertext together
are good coursematerial. I
suppose that this kind of
grouphypertext needs LAN
environment.


Many thanks if you know something
about the subject.


Pekka Makkonen
lecturer
Mikkeli Polytechnic
Institute of Business

FINLAND

program for LAN environment ???



From ED@chaz.demon.co.uk (Electronic Documents)
Path: doppler!concert!gatech!darwin.sura.net!haven.umd.edu!uunet!pipex!demon!chaz.demon.co.uk!ashley
Subject: Re: RESUME : Notes, WorkFlow modelling, ATI
Reply-To: ed@chaz.demon.co.uk
References:  <1993Apr19.095059.1@uni2a.unige.ch>
Distribution: world
X-Mailer: cppnews $Revision: 1.32 $
Organization: Learned Information (Europe) Ltd.
Lines: 46
Date: Tue, 20 Apr 1993 09:23:05 +0000
Message-ID: <735322985snx@chaz.demon.co.uk>
Sender: usenet@demon.co.uk

In article <1993Apr19.095059.1@uni2a.unige.ch> you write:
>
>Hi,
>
>Late February I posted a request for information about Lotus Notes,
>WorkFlow modelling and the Action Tech. Inc. add on. 
>
[deleated]
>
>                Michel 
>
>----------------------------------------------------------------------------
>Michel Prevel                       Phone   : 41-22/705 81 16
>Universite de Geneve               Fax     : 41-22/781 41 00
>Dpt. COMIN                         E. Mail : prevel@uni2a.unige.ch
>102, Bd. Carl-Vogt
>1211 Geneve 4 - SWITZERLAND
>----------------------------------------------------------------------------
>--
>

I've offered before in this group.  The response at that time was so strong 
that I felt I should offer it again.

Lotus Notes 3.0, Action Technologies, and a range of other manufacturers are 
covered in the April 93 edition of Electronic Documents, a monthly print 
journal focused on themes relevant to electronic publishing.  

The April 93 issue of Electronic Documents, entitled Workflow & Collaboration, 
looks at a number of angles associated with groupware/collaboration/workflow
systems.  Other companies in this report include XSoft, Interleaf, Frame, 
IBM, and PictureTel.  The report totals 32 pages in length, and is not based 
on advertising.

If you want a free copy, e-mail your request to the following: 
	
	ed@chaz.demon.co.uk

Please include your terrestrial address!

*****************************************************************************
*                          - Charles Ashley -                               *
*    Reporter, LI Ltd.                                                      *
*    Internet:   ashley@chaz.demon.co.uk        Learned Information Ltd.    *
*    CompuServe: 71333,624                      tel: +44 (0)71-336-7344     *
*****************************************************************************


From david@ruc.dk (David Stodolsky)
Newsgroups: comp.groupware,news.answers,comp.answers
Subject: Introduction to comp.groupware (Periodic informational Posting)
Supersedes: <groupware-intro_734155204@GZA.COM>
Followup-To: comp.groupware
Date: 21 Apr 1993 00:00:27 -0400
Organization: Roskilde University
Lines: 349
Sender: faqserv@GZA.COM
Approved: news-answers-request@MIT.Edu
Distribution: world
Expires: 19 May 1993 04:00:07 GMT
Message-ID: <groupware-intro_735364807@GZA.COM>
NNTP-Posting-Host: pad-thai.aktis.com
Summary: Guidelines for posting to the Usenet newsgroup comp.groupware.
Keywords: CSCW, orgware, group, interactive, shared, environments
X-Last-Updated: 1993/01/25

Archive-name: groupware-intro
Last-modified: 1993/1/17
Version: 1.5

Please read carefully:
Any article posted to comp.groupware uses a minimum of ten hours of
readers' time. Do not post test messages to comp.groupware (see section
5 below). Information for teachers is contained in section 7.

This article is posted automatically every 14 days to introduce the
group to the more than one thousand new users that have subscribed
during that period. 

---------------- Contents (and revision information) ------------

Sections in this article (Revised in last modification)

0. Groupware is software and hardware for shared interactive
environments.
1. Set your distribution to "world". (Revised)
2. Sign your article.
3. Comp.groupware is being archived. (Revised)
4. If you are posting copyrighted work...
5. Read "Welcome to news.newusers.questions"... (Revised)
6. When you reply to a message, do not change the subject line...
7. Comp.groupware is read by over 28,000 people. (Revised)

------------ End of Contents (and revision information) ----------


0. Groupware is software and hardware for shared interactive
environments.

The term "environment" includes software and hardware that sets the
context for interaction. Hardware can include specially designed
furnishings and architectural spaces that are considered integral to
correct utilization of a given software application. A groupware
application may require a specific organizational environment to
function as expected. More powerful applications can adapt to, or
overcome limitations of, their environments.

The term "interactive" is used to indicate that time constraints are
managed by the system. Many groupware applications appear to support
real-time interaction. Others merely enforce deadlines that can span
weeks. In either case, the technical limitations on the pace of
interaction are made (to appear) negligible in terms of the objectives
of the application. Systems that exclude reference to real time are not
groupware applications.

The term "shared" indicates that two or more participants interact with
one another in such a manner that each person influences and is
influenced by each other person. No upper limit in the number of
participants is indicated, because mediated groups, as opposed to
natural ones, can maintain joint awareness with very large numbers of
persons. (Joint awareness is one way that "group" is defined.) An
objective of some groupware applications is to increase the number of
persons that can interact "as a group".

Some definitions of groupware include the notion of a common goal. While
all systems require some agreement among participants (at minimum that
they should be jointly used), interactions can be predominately
conflictual. Management of conflict is often a crucial feature of a
groupware system. Vote collecting systems are an example.

Definitions:

Group - Two or more persons who are interacting
with one another in such a manner that each person
influences and is influenced by each other person
(Shaw, M. E. _Group dynamics: The psychology of
small group behaviour_. 1976, p. 11).

Ware - 1 a) manufactured articles, products of art
or craft.... b) an article of merchandise.... 3) an
intangible item (as a service) that is a marketable
commodity. (_Webster's New Collegiate Dictionary_,
1976, p. 1319).


1. Set your distribution to "world". Comp.groupware is delivered to all
continents. Do not limit your chances for feedback by restricting
distribution. Restricted distribution can cause confusion when people
read responses to articles they have not seen. If you notice an article
has a restricted distribution, inform the poster by mail.

If you are restricted from posting to "world" by your administrator,
request a change in your privileges, at least for this newsgroup. If
refused, determine what your rights are in terms of appeal, based upon
information available at your site. An alternative is to use the Net to
find information and persons to contact concerning your rights. 
Try the newsgroups:

comp.org.eff.news
comp.org.eff.talk
misc.legal.computing
alt.society.civil-liberty
alt.comp.acad-freedom.news
alt.society.cu-digest

Information about the rights of network users is available from the
Electronic Frontier Foundation (EFF). Information about the Electronic
Frontier Foundation  can be requested from eff@eff.org. You can also
retrieve information about EFF and its projects via anonymous FTP from
ftp.eff.org.

As a final resort, send a summary of your case to:

Carl Kadie (kadie@eff.org)
Electronic Frontier Foundation
155 Second Street
Cambridge, MA 02141, USA
Tel.: +1 (617) 864-0665
Fax: +1 (617) 864-0866.

If you can send email off-site, you can post using a Usenet-news mail
server. Email to "comp-groupware@ucbvax.berkeley.edu" is posted with the
subject line of your letter becoming the subject line of the article.
(Note: "." in the newsgroup name is written as "-".) This allows you to
post to a newsgroup even if you have read-only access to Network News.


2. Sign your article. Each name should have one and only one user. If
the article is a joint product, indicate this at the beginning and end
of the article. Some news reading programs allow certain names to be to
be automatically selected. Help the reader by using the same name at all
times. This will improve the chances that people will read your
articles.

The signature should include complete name, address, and telephone
number (this allows quick verification in case forgery is suspected).
Email addresses ought to be included in the signature in case headers
get munged. Another nice feature is geographical coordinates, so the
time zone can be determined (useful in telephoning). The signature
should be limited to four lines as is suggested practice on Usenet.


3. Comp.groupware is being archived.
tvv@ncsc.org (Terry Myerson) began archiving comp.groupware 92.10.6.
The archive is available by anonymous FTP (File Transfer Protocol) from:
avs.ncsc.org ( 128.109.178.23 )

in the directory:
~ftp/newsgroups/comp.groupware

The archives are in mail folders named MONTH_YEAR.
For example, to peruse all of the postings in the month of
October, you could download the archive Oct_92, and execute

%       Mail -f Oct_92

FTP is a way of copying files between networked computers.  If you
need help in using or getting started with FTP, send email to:
mail-server@rtfm.mit.edu 

with:
send usenet/news.answers/ftp-list/faq

in the body to find out how to do FTP.

Those without FTP access should send email to:
mail-server@rtfm.mit.edu

with:
send usenet/news.answers/finding-sources

in the body to find out how to do FTP by email.


4. If you are posting copyrighted work, indicate at the beginning of the
article whether permission has been obtained. If you do not want an
article reproduced, indicate this (e.g., Copyright - Net distribution
only).


5. Read "Welcome to news.newusers.questions" in that newsgroup before
posting for the first time. This helps to avoid common mistakes and
inadvertent abusive behavior that can cause articles to be ignored.

Authors should refer to "Guidelines for posting on Usenet" in the
newsgroup "news.announce.newusers" to make sure they know to spell check
their articles, etc. "Answers to Frequently Asked Questions",
"Introduction to news.announce", "Hints on writing style for Usenet"
available in the same newsgroup also contain information for new users.

Do not post test messages to comp.groupware. There are special groups
for testing. And tests should be as limited in their distribution as
possible. This is basic information from "Guidelines for posting on
Usenet". Posting of test messages inappropriately is considered abusive
and will cause a loss of readership for your articles.

Always use your Subject line to state the *topic* of your article as
completely as possible (e.g., "Macintosh II voice-mail based real-time
meeting software ready.", rather than "Meeting software"). Summary lines
should indicate *what* your message says about the topic (e.g., "New
meeting coordination software available via anonymous FTP"). Statements
should always end with periods, questions with question marks
(typically), and high energy, high impact declarations with exclamation
points. These rules makes articles much easier for recipients to handle
appropriately. 

If you ask a question, your subject line should include "question",
"query", "(Q)" or should end with a "?". Questions should clearly
explain your problem and surrounding issues. Otherwise, you will simply
waste the time of those who want to help you. Tell people the kind of
work you are doing or contemplating doing. This helps them provide the
information you need. Indicate what efforts, if any, you have made thus
far, and what information was found.

Subject, Summary, and Keyword headers are scanned by many news reading
programs, thus permitting readers to find your article easily. You will
have your articles read more often if you select these carefully.


6. When you reply to a message, do not change the subject line or
redirect follow-ups (unless you are changing the subject).  Such changes
make it harder for some news readers to follow the threads in a
discussion. Include a "Summary" line which indicates specifically what
your message says. This permits your article to be found even if it is a
follow-up to an article with poorly chosen subject and keyword
information.

Please, do not post responses to articles you feel are inappropriate or
abusive. (If you can not resist, consider alt.flame as an alternative
newsgroup for your article [it has greater readership than
comp.groupware]). If the author is not saying anything worth reading,
enter the name in your "kill" file, and then no more of your time will
be wasted by that person. If you feel that the author is saying
something worth reading, but in an inappropriate way, respond by mail.
Tell the author what you think is incorrect about the article. If
possible, suggest how to accomplish the objective in an appropriate way
(e. g., post to another newsgroup). If you have responded to a person by
mail a few times without the desired effect, and you feel that the group
as a whole could benefit by a solution to the problem, only then should
you post an article.  The nature of your article should be a suggestion,
if possible, of how such problems can be avoided in the future.


7. Comp.groupware is read by over 28,000 people (Brian Reid posts
readership statistics at the beginning of each month to the newsgroup
news.lists). Consider the cost to readers of any post. If even an
obviously inappropriate article is distributed, one that just takes
readers a few seconds to scan, and then skip or kill, the total time
used is still large. With 36,000 readers, a post that takes an average
of 1 second for each reader to deal with (i. e., examining the subject
line) means a total of ten hours used (36,000 seconds / 3,600
seconds/hour = 10 hours). If the article uses up an average of four
seconds, then the total time expenditure is 40 hours, the equivalent of
a work week. This is probably the minimum time expenditure on any
article that is even selected for scanning. So, if you spend a week
preparing an article and then post it to comp.groupware, there will be a
balance between your time investment and that used by readers, even if
they only scan your article and make no response. The lack of a separate
feedback channel is an unfortunate deficiency in the Network News system
as it is currently structured.

This analysis should not discourage anyone from posting a simple
question. Some of the most interesting and valuable exchanges in
comp.groupware have resulted from such questions. However, authors must
not make such requests unnecessarily. On the other hand, a carefully
prepared article or a report of an extensive project may not receive any
comment at all. This could mean that the article is clear and error
free. It could also mean it was not of sufficient interest to anyone to
be read in detail. What can be assumed is that it was seriously
considered. This is a result of the currently low traffic level in
comp.groupware and high quality of articles posted.

Teachers should not make use of comp.groupware a class activity. If a
class is made aware of comp.groupware, this Introduction should be made
required reading, so inappropriate use is minimized. Instructional use
of the news system is best practised in a local newsgroup established
for that purpose. This also permits establishment of a better
environment for instructional purposes. See the article "Protecting
expression in teleconferencing: Pseudonym-based peer review journals"
{Stodolsky, D. S. (1990).  _Canadian Journal of Educational
Communication_, 19, 41-51. ([1989, May 9]. _Communication Research and
Theory Network [CRTNET]_, No. 175 [Semi-final draft available by
electronic mail from LISTSERV@PSUVM.BITNET at University Park, PA: The
Pennsylvania State University, Department of Speech Communication and
COMSERVE@Vm.ecs.rpi.edu at Troy, NY: Rensselaer Polytechnic Institute,
Department of Language, Literature, and Communication.])} This article
also available in compressed format as file "prot.express.tele" on
archive.eu.net in ~ftp/documents/authors/Stodolsky, and on ftp.nluug.nl
in ~ftp/pub/documents/authors/Stodolsky.

Retrieve and examine the file by typing, for example
(characters before and including ":" or ">" indicate machine's prompting
for input):

        > ftp archive.EU.net
        login: ftp
        password: <your email address here>
        ftp> bin
        ftp> cd documents/authors/Stodolsky
        ftp> get prot.express.tele.Z
        ftp> bye
        > uncompress prot.express.tele.Z
        > view prot.express.tele


If your email reply to an author fails, try again using information in
the signature lines. An X.500 directory information server can be
consulted to find a person's email address. Read the informational
article, "How to find people's email addresses" (in the newsgroup
"news.answers"), so you know to contact the postmaster at the site of
the person you are trying to reach, and so on. Do not post a reply until
you have tried to reach the author by telephone, facsimile, or paper
mail. If these fail, ask yourself if getting the reply through is worth
ten hours of readers' time. If so, post the message. Do not post a
message asking a person to send you an email address, unless your letter
must be kept private (If this is true, consider using encryption). If it
is not of general interest, use only the person's name as the subject
(e.g., "To: Foo Bar"). If other readers might find it interesting, also
give full subject information. 

Similarly, do not broadcast requests for information you can obtain from
a known source. Requests such as, "What are the contents of book Foo
published by Bar" are not appropriate. This information can normally be
obtained by a short telephone call and a few minutes of work by someone
being paid to provide that service. Let's not deprive someone of a job
and at the same time get comp.groupware readers fired because they are
wasting all their time reading unnecessary articles :-).

Post long articles as a single unit if they are less than 30,000
characters. Otherwise, post separate sections as follow-ups to the
first, breaking at meaningful places. This permits the sections to be
treated as a single unit, thus minimizing expenditure of attention on
the article. The cost of transmitting articles is negligible, so long
posts that take one second to delete "cost" the same as short ones.

Disregarding these considerations or a lack of self discipline in
following them will result in defensive attention management. That is,
certain authors will not be read at all by many readers or valuable
discussions will take place by email instead of being posted. This would
have the unfortunate effect of fractionating the joint awareness that
permits the comp.groupware readership to function as a group. Thus, it
is recommended that authors who prefer entertainment to rigor in their
news reading, post to other newsgroups.

-------

This article compiled with assistance from numerous readers of
comp.groupware.

Corrections, comments, and suggestions to:

David S. Stodolsky                            Tel: + 45 31 95 92 82
Department of Computer Science                Fax: + 45 46 75 42 01
Bldg. 20.1, Roskilde University              Internet: david@ruc.dk
Post Box 260, DK-4000 Roskilde, Denmark        : david@mcsun.EU.net


From kelly@busadm1.cba.hawaii.edu (PRIISM Project Account)
Subject: Distributed GSS minitrack at HICSS-27
Message-ID: <kelly.1@busadm1.cba.hawaii.edu>
Summary: Call for papers
Keywords: Didtributed groupware, electronic meetings
Sender: news@news.Hawaii.Edu
Organization: College Business Administration, University of Hawaii
Date: Wed, 21 Apr 1993 04:48:04 GMT
Lines: 54

HICSS REQUEST FOR PAPERS

Hawaii International Conference on System Sciences (HICSS) Mini-Track on Distributed
Group Support Systems
Maui, Hawaii - January 4-7, 1994

Twenty-seventh in a series of conferences devoted to advances in information, computer,
and system sciences, HICSS will encompass developments in both theory and practice.
HICSS is sponsored by the University of Hawaii and the College of Business Administration
in cooperation with the Association for Computing Machinery (ACM) and the IEEE
Computer Society. A broad range of papers organized around "mini-tracks" will be presented
at HICSS. This is a request for papers for a new mini-track at HICSS entitled Distributed
Group Support Systems.

Original and innovative papers are being solicited for this HICSS mini-track. Submissions
may be empirical, conceptual, tutorial, theoretical or descriptive in nature. However, papers
that employ novel, multi-disciplinary or multi-methodological  approaches and address
interesting practical questions and/or important theoretical issues in the area are
particularly welcome. Appropriate topics include, but are not limited to, the following:

- dispersed collaborative systems
- distributed meeting systems
- asynchronous meeting systems
- audio conferencing
- video conferencing
- computer conferencing
- electronic mail
- local area network applications
- wireless network systems

Instructions for submitting papers:

Submissions should include six copies of the full paper. Manuscripts should be 12-26
typewritten, double-spaced pages in length, including figures and tables. The first page of
the manuscript should include the title, author name(s), affiliation(s), complete mailing and
electronic addresses and telephone number(s). The second page should include the title and
a 300-word abstract. Important dates are:  

June 5, '93   Submit six copies of full paper to Mini-Track chair

August 31, '93       Authors will receive notification of acceptance

October 1, 93        Camera ready copies are due for accepted papers*  

Please direct all correspondence to:

Laku Chidambaram, Mini-Track Chair                            
University of Hawaii                            Phone: (808) 956-7368
College of Business Administration              Fax: (808) 956-9889
2404 Maile Way                                  Bitnet: cbadlch@uhccvm
Honolulu, HI 96822, USA 	(Internet:laku@dscience.cba.hawaii.edu)

* Please note that at this time at least one author must register for the 
conference.


From pjf@sei.cmu.edu (Priscilla Fowler)
Subject: CFP IFIP WORKING CONFERENCE ON DIFFUSION, TRANSFER, & IMPLEMENTATION OF INFORMATION TECHNOLOGY
Message-ID: <1993Apr21.152441.25690@sei.cmu.edu>
Followup-To: comp.software-eng
Sender: netnews@sei.cmu.edu (Netnews)
Organization: Software Engineering Institute
Date: Wed, 21 Apr 1993 15:24:41 EDT
Lines: 122

CALL FOR PARTICIPATION AND CALL FOR PAPERS
International Federation for Information Processing (IFIP)
WORKING CONFERENCE ON DIFFUSION, TRANSFER, & IMPLEMENTATION OF
INFORMATION TECHNOLOGY

October 11-13, 1993				Pittsburgh, PA, USA
___________________________________________________________________
Sponsor: IFIP Technical Committee 8 (Information Systems)

In cooperation with 
the Software Engineering Institute, Carnegie Mellon University
and
IEEE Computer Society Subcommittee on Software Engineering
___________________________________________________________________

Technology transfer, including diffusion and implementation of new technology
within organizations, is gaining attention within the research and development
community and within industry and government.  People want to see the
technology they develop usefully applied.  Consortia are forming; workshops
and conferences are being held; legislation is being passed.  Yet transfer
strategies reflect limited application of a broad base of research from basic
and applied disciplines.

Information technology pervades other technologies (automobiles and
appliances, earthmoving and medical equipment) and modern systems,
including banking, communications, transport.  Which models and
approaches to technology transfer are specific to information technology?
What practices and mechanisms are most successful?  What does the
practicing manager, engineer, or information systems analyst need
to know about technology transfer?

The International Federation for Information Processing (IFIP) 
provides a critical international forum for considering issues of 
information technology transfer, including:

    - Models of information technology transfer
    - Methods and mechanisms for anticipating technology transfer
	issues in product development
    - Cooperative research and development programs to quickly
	move results into practice
    - Processes for implementing information technology in
	organizations
    - For-profit and not-for-profit approaches to technology transfer
    - International intellectual property and information technology.

This working conference will explore these issues and consider the
creation and charter of an IFIP international working group on
information technology transfer.  The conference is sponsored by 
IFIP Technical Committee 8 (Information Systems) with the cooperation
of the Software Engineering Institute.  The conference is designed for 
a limited number of participants who are actively involved in 
practice or research in information technology diffusion, transfer, 
and implementation.

Prospective participants should prepare a position statement, 750 - 1500 words
(3 - 6 double-spaced pages) in length, describing experience, research or
ideas and views, and a one-page summary vita or biographical sketch. Original,
technical papers addressing the issues noted above are also welcome, and will
be considered for inclusion in the proceedings and presentation at the
conference.  Technical papers should not exceed 5000 words (about 20
double-spaced pages).  Vitae, selected position statements and technical
papers, and invited papers will be available in a notebook for conference
participants.  Attendance at the conference is contingent on submission of
either a position statement or full paper, plus vita.

The conference will consist of presentations of invited papers and
a subset of selected papers, and working sessions.  Proceedings 
will be published by North Holland shortly after the conference, 
and will consist of invited papers, selected papers, selected position
statements, and summaries of conference deliberations.

SUBMISSIONS

Vita, plus six copies of either position statements or papers, 
in English, should be accompanied by a cover sheet containing 
(1) title, (2) names, addresses, phone numbers, 
fax numbers, and email addresses (if available) of all authors, 
(3) contact author, and (4) keywords and abstract (for technical 
papers only).  All submissions should be sent to:

	Priscilla Fowler
	Software Engineering Institute
	Carnegie Mellon University
	4500 Forbes Avenue
	Pittsburgh, PA  15213
	(412) 268-7748
	(412) 268-5758 FAX
	Internet: pjf@sei.cmu.edu

Important dates:
				       
	Submissions due:	May 14, 1993
	Author notification:	July 1, 1993
	Manuscripts due:	September 10, 1993

CONFERENCE COMMITTEE:

Gordon Davis, University of Minnesota Minnesota, General Chair
Priscilla Fowler, Software Engineering Institute, Program Chair
Linda Levine, Software Engineering Institute, Organizing Chair

PROGRAM COMMITTEE:

	James Babcock (Georgia Institute of Technology, USA)
	James Brancheau (University of Colorado, USA)
	Susan Brown (University of Minnesota, USA)
	Steve Cross (Advanced Research Projects Agency, USA)
	David Gibson (University of Texas Austin, USA)
	Bernard Glasson (Curtin University of Technology, Australia)
	Tor Larsen (Norwegian School of Management, Norway)
	Lawrence Lien (Training & Operations, USA)
	James McKenney (Harvard University, USA)
	Daniel Paulish (Siemens, USA)
	Joe Ross (National Technology Transfer Center, USA)
	Carsten Soerensen (Aalborg University, Denmark)
	Sue Stetak (Hewlett Packard, USA)
	Robert Zmud (Florida State University, USA)







From schwartz@ils.nwu.edu (diane schwartz)
Newsgroups: comp.groupware
Subject: SIGKids Research Showcase Call
Followup-To: comp.groupware
Date: 23 Apr 1993 01:09:48 GMT
Organization: institute for the learning sciences
Lines: 247
Distribution: world
Message-ID: <schwartz-220493201831@schwartz.ils.nwu.edu>
NNTP-Posting-Host: schwartz.ils.nwu.edu

				                SIGKIDS CALL FOR PARTICIPATION

SIGKids Research Showcase is where learning is hip.  Pushing the edge in
education, computer graphics, and new technologies, the SIGKids Research
Showcase will provide SIGGRAPH's attendees with the latest in applying
computer technology to form state of the art educational experiences.  So
hop to it!  Submit any works which converge the disciplines of education
and computer technology.


Possible categories and domains include but are NOT LIMITED to:

-Interactive/stand-alone applications
-Self-Run demonstrations and tutorials
-Museum Installations
-Groupware/Collaborative systems
-Hypermedia
-Virtual Reality
-Scientific Visualization
-Interactive Art
-Microworlds

Deadlines:

May 21, 1993 submissions due  

Submit to:

Diane Schwartz
SIGGRAPH '93 SIGKids Committee
c/o The Institute for the Learning Sciences
1890 Maple Avenue, Suite 150
Evanston, Illinois 60201
Fax:	708.491.5258
schwartz@ils.nwu.edu

Electronic Submission Form:
schwartz@ils.nwu.edu

How to Submit:

1. Fill out the 'Permission to Use' form (see page 19 of the SIGGRAPH '93
Call for Participation or send email to schwartz@ils.nwu.edu to have one
faxed to you.)

2. Fill out the SIGKids '93 Research Showcase Submission Form (below).

3. Send an abstract/description of the submission (approximately 100 words)
in one of the following ways:

    A. Send 3 hard copies to Diane Schwartz (via surface mail) at the above
       address
                           OR

    B. Fax 1 copy to Diane Schwartz at (708)491-5258

                           OR
    C. Email 1 copy to Diane Schwartz at schwartz@ils.nwu.edu

4. If it is necessary to explain the project, additional support material
such as videotapes and slides that will assist the selection committee in
reaching a decision are highly reccommended. 

Fax and email submissions are acceptable.

PLEASE SEND ALL OF YOUR SUBMISSION MATERIAL IN THE SAME FORM (either
surface mail, email, or fax. The only exception to this should be the
additional support material which should only be sent via surface mail). 

NOTE: Due to our very limited budget, if the submitter chooses to have a
dedicated machine for their work, they will have to pay rental fees
for the hardware personally.

NOTE: Contributors outside for the United States should be aware of customs
and carrier delays and send submissions early.

---------------------------------cut
here---------------------------------------


           ACM SIGGRAPH '93 SIGKIDS RESEARCH SHOWCASE ENTRY FORM


A copy of this form must accompany each proposal you submit.  Send SIGKids
Research Showcase Entries to:

Diane Schwartz
SIGGRAPH '93 SIGKids Committee
c/o The Institute for the Learning Sciences
1890 Maple Avenue, Suite 150
Evanston, Illinois 60201
Fax:	708.491.5258
schwartz@ils.nwu.edu


Please print legibly.

Contact Information: 
Name________________________________________________

Company______________________________________________

Address______________________________________________

City_________________________________________________

State_____________Postal code______________Country_________________ 

Daytime phone_____________________Evening phone____________________ 

Fax_____________________________Email______________________________ 

Additional Information:

Title or Theme of Piece__________________________________ 

Participant(s') name(s)___________________________________

Collaborator(s') name(s)__________________________________ 

Hardware (platform and periferals):

1. What is needed:________________________________

__________________________________________________

__________________________________________________

2. Supplied by Participant:

		___ Yes  ___ No

	3. Dedicated machine?

		___ Yes  ___ No

NOTE:  Due to our very limited budget the participant must pay the rental
fees for any dedicated hardware.

___Need assistance (specify)_______________________________

___________________________________________________________

___________________________________________________________

Software___________________________________________________ 

___________________________________________________________

___________________________________________________________

Statement - Please tell us the significance of the work.
(less than 50 words)
________________________________________________________________________________

________________________________________________________________________________

________________________________________________________________________________

________________________________________________________________________________

________________________________________________________________________________

Medium:

___Other (describe - i.e. virtual reality, virtual sculpture,
interactive multimedia installation, etc.)

______________________________________________________

Special Requirements:

Physical description__________________________________ 

______________________________________________________

______________________________________________________

Power_________________________________________________

______________________________________________________

______________________________________________________

Dimensions_____________________________________________

______________________________________________________

______________________________________________________

Other_________________________________________________

______________________________________________________

______________________________________________________

Authorization

Permission to use visual and audio:  In the event that materials used in my
ACM SIGGRAPH'93 SIGKids Research Showcase Entry contain the work of other
individuals or organizations (including any copyrighted musical
compositions or excerpts thereof), I understand that it is my
responsibility to secure any necessary permissions and/or liscenses.  

___Yes ___No  My piece contains images, audio, or video components.  

If yes:

___Yes ___No  I have the necessary rights and/or permissions to use the
images, audio, or video components in my piece.

Conference presentation release:  By signing this form, I grant SIGGRAPH'93
permission to consider my piece for the SIGKids Research Showcase.  I
maintain the copyright to my work and will receive full credit wherever
this work is used.

Conference promotional material:  I grant ACM SIGGRAPH the right to use my
slides for conference and organization publicity, both now and in the
future.  This includes usage on posters, brochures, catalogs, promotional
items, or media broadcast. In exchange, SIGGRAPH provides full
author/artist credit information on all promotional material.

___Yes ___No  I grant ACM SIGGRAPH permission to use slides of my work
for conference and organization publicity.

Signature______________________________________Date_________

ACM SIGGRAPH makes every attempt to respect and protect intellectual 
property rights of people and organizations preparing material for 
SIGGRAPH conferences. This entry form explains the uses SIGGRAPH will 
make of the material and requires you to acknowledge that you have 
permission to use this material.  This may involve seeking clearance from 
your employer or from others who have loaned you material, such as 
videotapes and slides.  This form helps prevent situations whereby 
SIGGRAPH'93 presentations include material without permission that 
might lead to complaints or even legal action.

This form also asks you to grant SIGGRAPH the right to distribute your
work, while you maintain the copyright.  Slide sets and catalogs are
publications for which you grant SIGGRAPH nonexclusive worldwide
distribution rights.  SIGGRAPH marks each item in these publications with a
proper copyright notice, which informs viewers that these items may not be
copied, reproduced, broadcast, or used for commercial purposes without the
explicit permission of the indivicual copyright owners.  In addition, this
form asks if  ACM SIGGRAPH may  use the your materials for conference and
organizational promotional material in exchange for full author/artist
credit information.


From villemur@feydeau.laas.fr (Thierry Villemur,37,6317)
Newsgroups: comp.groupware
Subject: Re: groupware in soft. development wanted
Message-ID: <9396@laas.laas.fr>
Date: 13 Apr 93 22:13:12 GMT
References: <1q4hu0$erp@gondor.sdsu.edu>
Sender: news@laas.fr
Reply-To: villemur@feydeau.laas.fr
Organization: LAAS-CNRS, Toulouse (France)
Lines: 23
Nntp-Posting-Host: feydeau

In article erp@gondor.sdsu.edu, mario@ucssun1.sdsu.edu (Marito Villarreal) writes:
>Does someone know about information of how to use groupware in a 
>distributed software engineering environment ???? This can be
>(group of people working on a module, or working in the low-level
>desing phase, even, they could be working using a object oriented
>design approach, etc ,et)
>Do you know an article, a book, a commercial product, a journal paper, etc, etc
>All help is really appreciated.
>
>
>
>mario villarreal (mario@ucssun1.sdsu.edu)


I have read an interesting article about application of groupware in software
process management. Here are the references :

	H. Krasner, J. McInroy and D. B. Walz
	Groupware Research and Technology Issues with Application
		to Software Process Management
	IEEE Transactions on Systems, Man, and Cybernetics
		21(4):704-712, July/August 1991



From rwhitehead@cix.compulink.co.uk (Roger Whitehead)
Subject: Announcement
Cc: rwhitehead@cix.compulink.co.uk
Reply-To: rwhitehead@cix.compulink.co.uk
Date: Thu, 22 Apr 1993 20:27:13 +0000
Message-ID: <memo.155183@cix.compulink.co.uk>
Sender: usenet@demon.co.uk
Lines: 33


                 SEMINAR ANNOUNCEMENT

          "Workgroup Computing for IBM Users"

      27 - 28 May 1993, Washington Hotel, London


This event is aimed at IBM users, particularly in mainframe sites,
who wish to:

    -   examine the concepts behind workgroup computing
    -   fin out how it might affect them and their users
    -   learn how others have implemented workgroup systems
    -   examine ways of integrating groupware and mainframe
        systems
    -   discover what products are available, now and in the near
        future

Speakers are Rob Wombwell (Daemon Network Consulting), Robin
Wilkins (Gilbeys of Ireland), Martin Burnett (Andersen Consulting),
Dave Smith (Allan & Overy), TIm Huckvale (Praxis Systems) and
Roger Whitehead (Office Futures).

The event is being put on by Xephon.  The attendance fee is 795
plus VAT, which includes full lunches, refreshments and extensive
documentation.

To book, or to get more details, telephone Xephon on 0635 33823,
or fax them on 0635 38345.


                         *****


From rar0659@hertz.njit.edu (R A Rodgers MSM)
Newsgroups: comp.groupware
Subject: Decision Support Systems
Message-ID: <1993Apr25.203359.22569@njitgw.njit.edu>
Date: 25 Apr 93 20:33:59 GMT
Sender: news@njit.edu
Organization: New Jersey Institute of Technology, Newark, N.J.
Lines: 8
Nntp-Posting-Host: hertz.njit.edu

Where is the best place to find information about Decision support
systems on the internet?

Regards
Roy

attmail!drawback
rar0659@hertz.njit.edu


From schayne@acs.ucalgary.ca (Stephen Hayne)
Subject: Re: groupware in soft. development wanted
Message-ID: <93Apr24.134832.23627@acs.ucalgary.ca>
Date: Sat, 24 Apr 93 13:48:32 GMT
References: <1q4hu0$erp@gondor.sdsu.edu> <9396@laas.laas.fr>
Nntp-Posting-Host: acs2.acs.ucalgary.ca
Organization: The University of Calgary, Alberta
Lines: 52

>In article erp@gondor.sdsu.edu, mario@ucssun1.sdsu.edu (Marito Villarreal) writes:
>Does someone know about information of how to use groupware in a 
>distributed software engineering environment ???? This can be
>(group of people working on a module, or working in the low-level
>desing phase, even, they could be working using a object oriented
>design approach, etc ,et)
>Do you know an article, a book, a commercial product, a journal paper, etc.

As part of my dissertation, I built a prototype Group Design System
based on an Object-Oriented Model in MS-Windows for Novell Nets.  It
was full featured but had limited robustness (learnt a bunch about the
limitations of Windows!).  The paper is still under review for
publication, but here is the title and abstract.

Basically, I found that groups of 4 people were easily able to "divide
and conquer" and take the design to something quite coherent and
correct in a very short time.  Single individuals were woefully unable
to perform as well as the group.  One of these days I will
re-implement the system and run more experiments.

  Group Database Design: Addressing the View Modeling Problem

Today's organizations are increasingly dependent on the use of
database technology to manage their operations. Advances in technology
have resulted in increasing the number and complexity of these
databases.  Despite their growing complexity, all databases have one
thing in common: each must have gone through either a formal or an
informal design process.  Databases are being increasingly required to
mirror reality accurately and thus the design process must better
capture that reality.  The heart of the design process is the
conceptual design, data model mapping and physical design.  Our
research focuses on providing automated support for the first of
these, e.g.  conceptual design. Conceptual design is known to be a
very difficult and time consuming phase in the development of database
applications.  This paper describes the architecture, implementation
and use of a {\em distributed graphical group} database design system.
The Group View Modeling System (GVMS) is implemented in Microsoft
Windows for networked personal computers.  The main purpose of GVMS is
to allow {\em multiple designers} (or users) to share conceptual
design information in real-time and resolve design conflicts through
the electronic medium.  The underlying data model, an Extended Entity
Relationship Model, include distribution information as well as
transactions.  Diagram management techniques are implemented (linkage,
design suppression and zooming/scrolling) to aid in simplifying large
complex designs.  A small study demonstrated that groups of database
designers defining their view collectively outperform individuals.


-- 
Stephen C. Hayne, Assistant Professor, MIS, University of Calgary
    __!__       (403)220-7161    schayne@acs.ucalgary.ca
_____(_)_____   "I love to fly - my banker will verify."  BL30-GZJS


From rslade@fraser.sfu.ca (Robert Slade)
Subject: Groupware (In)security followup
Message-ID: <1993Apr26.204835.15274@sfu.ca>
Followup-To: roberts@decus.ca
Summary: de nada
Keywords: groupware security vendors
Sender: roberts@decus.ca
Cc: carol.smykowski@emc2-tao.fisc.com,5165627@mcimail.com,kaplan@bpa.arizona.edu
Organization: Simon Fraser University, Burnaby, B.C., Canada
Date: Mon, 26 Apr 1993 20:48:35 GMT
Lines: 29

Just a followup to my request for groupware security comments and
experiences:

Apparently, there are any  :-)

Requests through comp.groupware, RISKS, comp.security.misc, and
alt.security resulted in one request for all responses, one query
about where the article was to be published (Info Security News), and
repeated, multitudinous, redundant (from one person yet) copies of a
message saying that I should contact Lotus.

I did contact Lotus.  As well as Apple, Word Perfect, Microsoft, DEC
and RSA Data Security.  I haven't had any response from any of them
except DEC, who sent me a fax about VSWEEP.

Bob Bierman, of the Conference Group (602-661-1260), was very helpful
with respect to contacts: the contacts were, unfortunately, less
helpful.  Fischer International, primarily through the person of Carol
Smykowski, were very helpful indeed.  Kaplan Kovara and Associates
have recently held a conference on authentication, and Ray Kaplan gave
me some helpful pointers as well.
 
==============
Vancouver      p1@arkham.wimsey.bc.ca   | You realize, of
Institute for  Robert_Slade@sfu.ca      | course, that these
Research into  rslade@cue.bc.ca         | new facts do not 
User           p1@CyberStore.ca         | coincide with my
Security       Canada V7K 2G6           | preconceived ideas



From chiu@brahms.udel.edu (Stanley Chung- Chiu)
Subject: A questionnarie about Notes
Message-ID: <C65su3.DIK@news.udel.edu>
Sender: usenet@news.udel.edu
Nntp-Posting-Host: brahms.udel.edu
Organization: University of Delaware
Date: Tue, 27 Apr 1993 20:27:39 GMT
Lines: 22

I am a system administrator for a company in Delaware.  In the meantime,
I am trying to do a academic research for the University of Delaware
about the usage of "Groupware".

There is a survey of about 20 questions and it is designed for the user
of any "groupware" product like Notes, Pathworks, etc.  I am look for 
people interested to help for this 5 minute favor and would be 
grateful for your help.  Please send me a message and your address
if you are interested.

My address are :
Internet chiu @ brahms.udel.edu
CompuServe:  70550,2452

There are some success story about Notes from Ford, CitiBank ,Coopers etc.
If you know anyone that is a groupware user, please pass the message along to 
see if they are interested to help.

Thanks for your time.

Stanley Chiu



From zakon@hicup.mitre.org (Robert H Zakon)
Subject: CSCW Research Summary
Message-ID: <1993Apr27.221012.27786@linus.mitre.org>
Sender: news@linus.mitre.org (News Service)
Nntp-Posting-Host: hicup.mitre.org
Reply-To: zakon@hicup.mitre.org
Organization: The MITRE Corporation
Date: Tue, 27 Apr 1993 22:10:12 GMT
Lines: 361

Below is a summary of replies I received from a query regarding CSCW
research.  As enough information is added to this list, I will post
updates. 

If you are aware of other research (not prodcuts!) in the CSCW area
or happen to notice incorrect information in this summary, please
send an e-mail to cscw@hicup.mitre.org.

Robert H Zakon, rzakon@mitre.org
The MITRE Corporation, Reston VA

PS: Apologies for the format - a MS Word file saved as text.  If this
    starts getting bigger, I will generate different formats.

-----------------------------------------------


CSCW Research Projects Summary

April 23, 1993  The MITRE Corporation  Robert H Zakon, W033


FORMAT:
	Organization - Project name
	Organization/Location:
	Project:
	Researchers/POC:
	Platforms:
	Funding:
	Scope:



CWRU - Spider

Organization:   Information Environments Group, Weatherhead School of
Management, Case Western Reserve University, Cleveland, Ohio.

Project:        Spider - collaborative technology for distributed decision
making in a corporate planning environment

Researchers:    Richard J. Boland Jr. (boland@spider.cwru.,edu), Dov Te'eni
(teeni@pyrite.cwru.edu)

Platform(s):    UNIX

Funding:        National Science Foundation, Digital Equipment Corporation

Scope:  "In this project we are working with business unit planners to
develop Spider, a software environment for enhancing communication and
coordination of their distributed decision making.  By distributed decision
making we mean that these individuals are autonomous agents, making
independent plans, yet each has interdependencies with other business units
which should be taken into account  in their decisions.  The managers will
use Spider to represent knowledge of their planning decisions and to
exchange and critique that knowledge among themselves.  This is an action
research project in which we are working with real managers to identify
their needs for representing knowledge of this situation and to develop
software that supports rich forms of communication in order to achieve a
more coordinated outcome for the organizations as a whole."




NCSA - Collage

Organization:   National Center for Supercomputing Applications, University
of Illinois, Urbana, IL

Project:        Collage

Researchers:    

Platform(s):    UNIX, Macintosh, PC (under development)

Funding:        

Scope:  "NCSA Collage is the next generation of scientific data analysis
tool from the Software Development Group at the National Center for
Supercomputing Applications. This tool provides image display and analysis,
color table editing, and spreadsheet display of floating-point numbers in
much the same way that NCSA Image, NCSA PalEdit, and NCSA DataScope did in
the past.

        In the presence of a network, this tool provides the capability to
distribute most of these data analysis and visualization functions among a
number of users. This is the foundation for the collaborative aspects of
this tool's functionality. "




MIT - OVAL

Organization:   Center for Coordination Science, Massachusetts Institute of
Technology, Cambridge, Mass.

Project:        OVAL (formerly Object Lens)

Researchers:    Thomas W. Malone, Kum-Yew Lai

Platform(s):    Macintosh

Funding:        Digital Equipment Corporation, National Science Foundation,
Apple Computer, International Financial Services Research Center (MIT),
Wang Laboratories, Xerox, General Motors/Electronic Data Systems, Bankers
Trust, Development Bank of Singapore, and Management in the 1990's Program
at the Sloan School of Management (MIT)

Scope:  "OVALT allows unsophisticated computer users to create their own
cooperative work application using a set of simple, but powerful, building
blocks.  The name OVAL is an acronym for the four key components of the
systems: Objects, Views, Agents, Links.  By defining and modifying
templates for various semistructured objects, users can represent
information about people, tasks, products, messages, and many other kinds
of information in a form that can be processed intelligently by both people
and their computers,  By collecting these objects in customizable folders,
users can create their own views which summarize selected information from
the objects.  By creating semi-autonomous agents, users can specify rules
for automatically processing this information in different ways at
different times.  Finally, links, are used for connecting and relating
different objects.

        The combination of these primitives provides a single consistent
interface that integrates facilities for object-oriented databases,
hypertext, electronic messaging, and rule-based intelligent agents."




Bull Research - KoalaBus

Organization:   Bull Research, Sophia Antipolis, France

Project:        Koala Bus

Researchers:    Cedric Beust (beust@sa.inria.fr), Colas Nahaboo
(colas@sa.inria.fr)

Platform(s):    UNIX

Funding:        

Scope:  "The Koala Bus system provides an easy way to allow communications
between heterogeneous applications that don't need to know about each
other.  Specifically, each application sends messages with a textual tag on
them without knowing who will be answering its queries.  Interested clients
merely express interest in a set of tags via regular expressions and then
listen to incoming messages, handling them as they arrive.

        The Koala Bus is based on Simon Kaplan's Message Bus (from the
University of Illinois) and Tooltalk (Sunsoft). This bus is fully
functional at the moment.  We are also developing a conferencing software
(xforum) using this bus that allows several users to "talk" with each other
interactively."




University of Illinois - ConversationalBuilder

Organization:   Department of Computer Science, University of Illinois

Project:        ConversationalBuilder

Researchers:    Simon Kaplan (kaplan@cs.uiuc.edu)

Platform(s):    UNIX, X Windows, Motif, CLOS, C

Funding:        Industry and Federal sources interacting in a consortium.

Scope:  "Basically, the idea in CB is the construction of a generic
collaboration kernel and set of UI management tools, and then applying
these to various domain-specific collaboration tasks through tailoring the
generic tool, by means of collaboration protocol specifications.

        We have applied this idea to a wide range of problems, asynchronous
and synchronous, including IBIS-type brainstorming, Design-Rationale type
brainstorming, WYSIWIS document editing, Configuration Management/Version
control, structured negotiation, workflow support, bug tracking and code
inspection/document review.  It works fairly well.

        We're strongly inspired by the Winograd and Flores Language/Action
approach, in that we believe each tailoring to a particular domain via a
protocol is pattern of recurrent `actions' in some `conversation', and can
be modeled as such.  This technique turns out to be extremely generic and
powerful (much more so that W&F seem to have inferred in their own work,
which has tended to focus exclusively on the structured negotiation
framework). 

        We're currently working on issues such as flexibility/reflection in
protocols to allow for more power and specification of more dynamic
protocols, interface-builder-like tools for ease of protocol specification,
and issues to do with wide-area distribution.  We're also working on
integrating video and audio-conferencing properly into our system."




University of Michigan - DistEdit

Organization:   University of Michigan

Project:        DistEdit

Researchers:    Atul Prakash (aprakash@dost.eecs.umich.edu)

Platform(s):    

Funding:        

Scope:  "I am leading the effort on the design of the DistEdit toolkit for
building group editors. The project has led to exploration of issues of
structuring of groupware systems, issues of locking and transactions, and
handling of undo. There are papers on the work in the last two proceedings
of the CSCW."








University of Michigan - UARC

Organization:   University of Michigan

Project:        UARC

Researchers:    Dan Atkins (atkins@eecs.umich.edu)

Platform(s):    

Funding:        National Science Foundation

Scope:  This is a multi-disciplinary project involving researchers from
computer science, behavioral science, and space science with the goal of
supporting real collaborative work among space scientists.





West Virginia University - MONET

Organization:   Concurrent Engineering Research Center, West Virginia University

Project:        MONET

Researchers:    Ramana Reddy

Platform(s):    UNIX

Funding:        DARPA

Scope:  "Meeting-On-The-Network (MONET) is a network-based conference tool
that facilitates semi-structured communication among the virtual team
members using multimedia, while providing simultaneous access to the work
environment."





West Virginia University - COMIX

Organization:   Concurrent Engineering Research Center, West Virginia University

Project:        COMIX

Researchers:    Ramana Reddy

Platform(s):    UNIX

Funding:        DARPA

Scope:  "Multiuser Interface to X-applications (COMIX) is a system that
facilitates sharing of a single user X-window based application by multiple
users across the network."





West Virginia University - Project Coordination Board

Organization:   Concurrent Engineering Research Center, West Virginia University

Project:        Project Coordination Board

Researchers:    Ramana Reddy

Platform(s):    UNIX

Funding:        DARPA

Scope:  "The Project Coordination Board is a system that provides common
visibility of an evolving design.  It promotes the reaching of consensus
and facilitates management of the product development work flow."




West Virginia University - Electronic Design Notebook

Organization:   Concurrent Engineering Research Center, West Virginia University

Project:        Electronic Design Notebook

Researchers:    Ramana Reddy

Platform(s):    UNIX

Funding:        DARPA

Scope:  "A tool that enables recording and retrieval of design problems,
alternative solution, and design intent.  This tool is based on the
Framemaker hypertext editor."




West Virginia University - Shared Information Server

Organization:   Concurrent Engineering Research Center, West Virginia University

Project:        Shared Information Server (formerly Knowledge Server)

Researchers:    Ramana Reddy

Platform(s):    UNIX

Funding:        DARPA

Scope:  "Shared Information Server is a tool that provides a virtual
team-member with uniform and transparent access to information distributed
in the enterprise at various locations and repositories."




West Virginia University - Communications Manager

Organization:   Concurrent Engineering Research Center, West Virginia University

Project:        Communications Manager

Researchers:    Ramana Reddy

Platform(s):    UNIX

Funding:        DARPA

Scope:  "A collection of modules that facilitates distributed computing in
a heterogeneous network.  It promotes the notion of a virtual notebook of
resources, which the project team members can exploit, without prior
knowledge of the underlying physical network."





From bob@grebyn.com (Robert A. Baumann)
Subject: New Mail Server dispenses PC products
Message-ID: <1993Apr29.005518.14531@grebyn.com>
Organization: Grebyn Timesharing
Date: Thu, 29 Apr 1993 00:55:18 GMT
Lines: 220

WHAT IS THIS FILE?
==================
This is an announcement of the availability by Mail Server of many of Joan
Riff's most popular software packages for the PC.

WHAT SOFTWARE PACKAGES ARE THESE?
=================================
These are packages which we have developed and added to our "software
toolbox" during 12 years of computer consulting. Many of them came into
existence because we needed a specific tool and could not find an existing
one for the PC which (1) worked, and (2) met our professional standards.
The packages run the gamut from low-level PC utilities to high-level
applications of general interest.

   BYTE magazine featured one of these packages - the original Z80MU - as
   one of its "Public Domain Powerhouses" of 1986 (see the Oct '86 issue).
   The upgraded version of this package has since become the most-used Z80
   and CP/M emulator *IN THE WORLD*.

   A bank vice president who uses our FM File Manager says "FM's a *LOT*
   more useful to me than XTree!".

   An eastern university uses our Chatterbox network chat program as their
   standard groupware conferencing software.

   Since much of our work involves Unix development, we have also
   developed many Unix-like utilities for the PC to support the massive
   amount of cross-development that we do between the PC and Unix.

   Certain offices of the U.S. Government use our UUENCODE and UUDECODE
   programs to allow their internal email system to attach binary files to
   email messages.

WHY YET ANOTHER TAR/GREP/WHATEVER?
==================================
We're not in the habit of wasting time writing utilities when acceptable
versions already exist. You may rest assured that we only generate a new
PC utility when a survey of existing PC packages shows that no such
capability exists, or that existing utilities are not up to our standards.

A PC version of TAR, for example, is not very useful if it contains no
provision for mapping long Unix filenames into unique DOS filenames, or if
it fails to recognize /dev/xxx as a special device, or if it fails to
recognize Posix-compatible as well as older tar files. Having canvassed
available TARs for the PC and found flaws in them all, we [regretfully]
set about writing one from scratch. We think that we have addressed some
of these TAR issues, and are offering the resulting utility to the world.
We think that some folks who import TAR files from Unix to the PC (which
we do a *LOT* of) might also want a copy of this tool.

Likewise with GREP and CRLF and DUMP and WHEREIS and SHAR and UNSHAR and
UUENCODE and UUDECODE and our "No Wimps Need Apply" KILLDIR directory
killer. We're not claiming that these are the Be-All and End-All of such
PC packages. All that we're saying is this:

    "Yo, Zeke! We've been there. We know what it's like to need some tool
    REAL QUICK, to download it from WUARCHIVE or SIMTEL20 or CompuServe,
    and then to run it, only to find out that it doesn't work on *YOUR*
    system, or with *YOUR* files, or whatever. We have addressed this
    need, and have written our own versions which we think *DO* work, and
    we think that you might like them also..."

WHY DO I HAVE TO GET THEM FROM YOU?
===================================
Many of our packages have been on the marker for several years. And yes,
you *COULD* get copies "from a buddy" or "from some BBS" or "from
CompuServe". You will want to obtain them via email directly from us,
however, for the following reasons:

  1) We can guarantee that what leaves our modem is virus-free and
     correctly wrapped. We have found a *LOT* of our packages on BBS
     systems in defective ARC and ZIP files, and we spend an inordinate
     amount of time fielding calls from users who somehow got a bad copy,
     or a copy in which our Z80MU was bundled in the same ZIP file with
     some bogus COBOL compiler (true story) and the irate user of the
     defective compiler vented his spleen at us "because your name and
     address was in the ZIP file somewhere."

     This way what you receive is *EXACTLY* what we developed, which is
     good for *ALL* concerned.

  2) You will receive the very latest version of whatever package you
     request. In other words, you will be getting a version which is more
     up-to-date than that which is available on *ANY* BBS or even
     comp.binaries.ibm.pc archive system. When we release a new version of
     a program, it will be updated on our system, but will (by definition)
     be out of date everywhere else.

  3) We have made the process of obtaining these packages as painless
     as it can possibly be. Obtaining a package via email is much
     easier than having to log on to various BBS systems looking
     for the latest Z80MU, etc. Just drop us an email note saying,
     in effect, "Send me the latest Z80MU", and in a few minutes or
     hours it will arrive in your electronic mailbox!

SO HOW DO I OBTAIN CCS SOFTWARE PACKAGES BY EMAIL?
==================================================
Basically, you just send us email, and receive whatever packages you want
by return email.

Because this process is automated, requests to our Mail Server must
conform to the following conventions or else the server software won't
recognize your request:

  1) Email must be addressed to the Internet address "joan@grebyn.com".

     NOTE: CompuServe users should send it through CompuServe's Internet
     gateway by addressing it to ">INTERNET:joan@grebyn.com".

     NOTE: Users of other networks (PRODIGY, GENIE, FidoNet, etc) should
     similarly route the mail to your network's Internet gateway (contact
     your network's local expert for details), and then to the Internet
     address "joan@grebyn.com". Note that not all networks are connected
     to Internet yet.

  2) The "Subject:" line must contain "Mail Server, Please", although
     case is not significant.

  3) The body must consist of commands selected from the following:

     Command      Description
     -------      ---------------------------------------------------
     PATH path    Overrides the return email path that the email server
                  will use to reply to you. Use this if it might be hard to
                  deduce your proper email address from your email message
                  to the server.

                  NOTE: For Internet users, your return path is simply
                  your Internet email address, so use a command like
                  this:         PATH joe@gatech.cs.edu

                  NOTE: For CompuServe users, your Internet address is
                  just your CompuServe ID (12345,678 for example) with a
                  period (.) instead of a comma (,), followed by the
                  Internet site name "@CompuServe.com", so use a command
                  like this:    PATH 12345.678@CompuServe.com

     Command      Description
     -------      ---------------------------------------------------
     HELP    -or-
     INDEX   -or-
     CATALOG      Asks the server to email the latest catalog to you,
                  listing files which are available via email and
                  giving instructions for using the server.

     Command      Description
     -------      ---------------------------------------------------
     SEND name    Asks the server to email the product 'name' to you. For
                  a list of available names, obtain the CCS Mail Server
                  catalog. More than one 'name' may be specified on each
                  SEND line.

Case is not significant. You may include as many PATH/CATALOG/SEND lines
as you like. Each, however, must be on its own line. Lines which start
with anything else might cause the *ENTIRE* message to be thrown into the
discard pile for eventual reading by a human. This will not get you what
you want.

If you want the latest version of Z80MU, for example, then one line of
your message body should be:

  SEND Z80MU

Sometimes return email addresses are too convoluted to be automatically
deduced. If yours is such (meaning that you don't hear from us in a
reasonable period of time), then your return address is probably
bozobular, and you should try including a PATH command with an alternate
Internet email address for you.

Here's a sample email message which will cause the latest catalog *AND*
the product "FM" to be sent to CompuServe user 12345,678:

    To: >INTERNET:joan@grebyn.com             <- Note CompuServe version
    Subject: Mail Server, Please              <- This stays the same

    PATH 12345.678@CompuServe.com             <- Note CompuServe path
    CATALOG                                   <- Requests our catalog
    SEND FM                                   <- Requests product "FM"

Requests will be recognized immediately, but outgoing mail will be
throttled to a megabyte per hour or so, and this may delay the actual
mailing of the package to you. Requests are queued on a first-come
first-served basis, but REGISTERED USERS OF CCS SOFTWARE WILL OF COURSE
GET PREFERENTIAL TREATMENT OVER NON-REGISTERED USERS.

Requests which involve an inordinate amount of mail traffic will be
politely declined, with a return request that you please narrow your
request down to a subset of your original list.

HELP US GET THE NEWS TO COMP.BINARIES.IBM.PC READERS!
=====================================================
For reasons known only to himself, the moderator of the Internet newsgroup
comp.binaries.ibm.pc has refused to post this notice to that newsgroup.
Unfortunately, the logical audience for this article is *EXACTLY* those in
the Internet community who monitor comp.binaries.ibm.pc.

As a result, we have had to post this article to other newsgroups to which
we hope that comp.binaries.ibm.pc readers subscribe. This indirect
approach is admittedly a tad silly, and does waste bandwidth, but under
the circumstances what's a girl to do? We have something (the above
announcement) that we'd like to disseminate to comp.binaries.ibm.pc, but
the moderator/censor of that newsgroup refuses to pass it through.

Do *YOU* find anything objectionable in this article? If not, then strike
a blow for freedom (and against techno-nazi censorship) by passing this
article along to folks who monitor the comp.binaries.ibm.pc newsgroup, or
anyone who might want access to our mail server.

Thanks for your support.

***************************************************************************
* Robert A. Baumann <bob@grebyn.com> * Computerwise Consulting Services   *
* Joan Riff        <joan@grebyn.com> * P.O. Box 813, McLean, VA 22101 USA *
*                                    * Voice Mail: (703) 450-7175         *
***************************************************************************

-- 
Robert A. Baumann, CCP, CDP       <bob@grebyn.com>
Computerwise Consulting Services
P.O. Box 813, McLean, VA 22101    (703) 450-7175


From rgs861@huxley.anu.edu.au (Jerry Schwab)
Newsgroups: comp.groupware
Subject: looking for shareware project mgt.
Date: 29 Apr 1993 06:44:16 GMT
Organization: Australian National University
Lines: 4
Distribution: world
Message-ID: <1rntg0INN32a@manuel.anu.edu.au>
NNTP-Posting-Host: 150.203.2.12
Originator: rgs861@huxley

I'm looking for a shareware version of something akin
to MacProject.  I would appreciate pointers if any
of you know where I might find such a thing.  Thanks!



From schwartz@ils.nwu.edu (diane schwartz)
Newsgroups: comp.groupware
Subject: re: SIGKids Research Showcase Call
Followup-To: comp.groupware
Date: 29 Apr 1993 16:34:27 GMT
Organization: institute for the learning sciences
Lines: 15
Distribution: world
Message-ID: <schwartz-290493114353@schwartz.ils.nwu.edu>
NNTP-Posting-Host: schwartz.ils.nwu.edu

It was brought to my attention that there was an oversight in the SIGKids
Research Showcase Call for Participation and Entry Form.

Please note that the SIGKids Research Showcase is part of 
SIGGRAPH '93, August 1-6, 1993 Anaheim, California.

Thank you,

Diane Schwartz
SIGKids Committee Member
Institute for the Learning Sciences
1890 Maple Avenue, Suite 150
Evanston, Illinois 60201

schwartz@ils.nwu.edu


From BPRASAD@cmsa.gmr.com
Newsgroups: comp.groupware
Subject: CFP: Concurrent Eng. Journal
Date: Thu, 29 Apr 93 17:26:51 EDT
Organization: GM Research Labs
Lines: 153
Message-ID: <16BBFF55B.BPRASAD@cmsa.gmr.com>
NNTP-Posting-Host: cmsa.gmr.com





Subject:  CONCURRENT  ENGINEERING: RESEARCH & APPLICATIONS  (CERA)  --
International Journal --  An Announcement


Dear Fellow Researcher:


We are pleased to inform you that Concurrent Engineering (CE)  Institute
of International Society of Productivity Enhancement (ISPE) in collab-
oration  with Academic Press, London has started a new  journal  enti-
tled:  Concurrent  Engineering: Research & Applications (CERA)  --  An
International  Journal." CERA is a refereed archival quality  publica-
tion.  This journal fills a void for a very important and timely  sub-
ject  matter.  "Concurrent Engineering" has been recognized  for  some
time  to be a major force behind achieving international  competitive-
ness,   responsiveness  and improving productivity. If you  have
worked  in  this area, we would like to seek your inputs  in  making
this endeavor a success.


We take this opportunity to invite you to submit your original  contri-
bution  to CERA for possible publication. Please inform  your  friends
and colleagues or write to me, who can contribute. A "Call for  Paper"
is enclosed.

If  you are interested in subscribing CERA Journal in 1993,  or  would
like  to  get a free sample copy for review please  write/call/fax  or
EMAIL your request to Academic Press, London. They would send you  the
required  information.  If you have further question,  please  do  not
hesitate to write to us or EMAIL at CERA editorial office in USA.

Thanking you and looking forward to hearing from you soon,


Sincerely,


Biren Prasad, Ph.D.
Managing Editor
Chairman, CERA J. Task Force.
Email ID: BPRASAD@CMSA.GMR.COM


       _____________________________________________________________

                    ANNOUNCEMENT & CALL FOR PAPERS


           CONCURRENT ENGINEERING: RESEARCH & APPLICATIONS

                  (CERA) - An International Journal


CERA  is a new international, multidisciplinary journal to  promote  a
better  understanding of Concurrency in enterprise modeling,  informa-
tion  processing  and  computing. The purpose of this  journal  is  to
provide  an  international forum for the dissemination  of  scientific
work on Concurrent Engineering based on computer technologies. Concur-
rent  Engineering (CE) is an official journal of the Concurrent  Engi-
neering  Institute of the International Society for  Productivity  En-
hancement (ISPE). CERA is the key publication for the newest and  most
exciting  research  arising from parallelism of product's  life  cycle
functions.  CERA deals with all basic tracks that enable CE  including
aspects  of  Information Modeling,  Teaming &  Sharing,  Networking  &
Distribution, Planning & Scheduling,  Reasoning & Negotiation, Collab-
orative  Decision Making, Organization and Management of CE.  Emphasis
is  placed on CE technologies that result in faster  product  develop-
ment,  higher quality, lower costs, improved productivity  and  better
customer value. The journal is an important source of information  for
design, engineering and manufacturing personnel and those with  inter-
est  in research, development and applications of productivity  tools,
methods and concepts.

The  distinguishing  nature of the journal will be to foster  the  ex-
change   and integration of concepts and theories from  these  diverse
areas,  and cross-fertilization of enabling CE technologies to  stimu-
late  thinking  that can generate new insights. A second  goal  is  to
publish  interdisciplinary research that advances  interactions  among
these  are well known researchers and practitioners in the field  from
industy,  university  and government laboratories.  The  distinguished
Editorial Board reflects the excellence of this important journal  and
the  commitment  to publish quality articles on the  most  timely  and
significant  trends, issues, problems and applications  of  Concurrent
Engineering in modern manufacturing.







Research Areas include:

o  Principles of Concurrent Engineering
o  CE Process Characterization & Matrix
o  Enterprise Modeling
o  Requirements, Constraints, Workflow Tracking & Management
o  Multi-Enterprise Integration
o  Information Sharing and Collaboration
o  Project & Team Coordination
o  Decision Support & Design Assessment
o  Networked Collocation
o  Tools for Multi-media Conference on the Network
o  Distributed Computing Environments
o  Corporate Technical Memory
o  Capturing Design Intent
o  Integration Frameworks for CE
o  CE Languages and Tools
o  Intelligent Retrieval of Corporate Knowledge
o  Virtual Team Support Environments
o  Blackboard and other AI Architectures
o  Emerging Standards & Practices
o  Case Histories & Research Briefs

The journal is published by Academic Press four times a year beginning
January  1993.  Potential authors should submit papers  or  write  for
instructions  to any of the editors or managing editor.  Requests  for
subscriptions and other information can be obtained from the  managing
editor or the publisher.

Managing Editor:                       Associate Editor:
                                       DR. MARK S. FOX
Dr. Biren Prasad                       Computer Science & Mgt. Science
CERA Institute                         University of Toronto
P.O. Box 250254,                       4 Taddle Creek; Roseburgh Bldg.
West Bloomfield, MI 48325, USA.        Toronto, Ontario, Canada M5S 1A4
Tel:  (313)492-0551;   Fax:(313)       Tel: (416) 978-6823;
661-8333                               Fax: (416) 971-1373
Email: bprasad@cmsa.gmr.com

Associate Editors:                     Prof. Shuichi Fukuda
Dr. Philip Barkan                      Tokyo Metropolitan Inst. of Tech.
Dept. of Mechanical Engineering        Dept. of Management Eng.
Stanford University                    6-6, Asahigaoka, Hino
Design Division                        Tokyo 191, JAPAN
Stanford, CA 94305, USA                Tel: +81 425-83-5111 ext. 266
Tel: (415) 967-8534 (O)                /Fax: +81-425-83-5119


Associate Editors:                     Publisher:
Dr. A.M. Agogino                       Academic Press Ltd.
Professor (Room # 5136)                24-28 Oval Road
Mechanical Engineering Department      London, NW1 7DX, U.K.
University of California Berkeley      Tel: 71-267-4466
Berkeley, CA 94720, USA                Fax: 71-482-2293  or
Tel:(510)642-6450(O)/ 642 3458(M)      Fax:  71-485-4752;
/ (510) 642 1338(D)                    EMAIL: AC2@IB.RL.AC.UK




From S.M.Clark@lut.ac.uk (Sean Clark)
Subject: Where can I get Shredit?
Message-ID: <S.M.Clark-300493111130@eta.lut.ac.uk>
Followup-To: comp.groupware
Sender: @lut.ac.uk
Nntp-Posting-Host: eta.lut.ac.uk
Organization: LUTCHI
Date: Fri, 30 Apr 93 10:11:28 GMT
Lines: 8

Does anyone know where I can get hold of a copy "Shredit" - the
collaborative
writing tool for the Mac?

Thanks,

Sean Clark,
Loughborough University


From ashley@chaz.demon.co.uk (Charles Ashley)
Path: doppler!concert!gatech!paladin.american.edu!howland.reston.ans.net!noc.near.net!uunet!pipex!demon!chaz.demon.co.uk!ashley
Subject: Re: RESUME : Notes, WorkFlow modelling, ATI
Reply-To: ed@chaz.demon.co.uk
References: <1993Apr19.095059.1@uni2a.unige.ch> <735322985snx@chaz.demon.co.uk>
Distribution: world
X-Mailer: cppnews $Revision: 1.34 $
Organization: Learned Information (Europe) Ltd.
Lines: 66
Date: Thu, 29 Apr 1993 09:12:54 +0000
Message-ID: <736099974snx@chaz.demon.co.uk>
Sender: usenet@demon.co.uk

In article <735322985snx@chaz.demon.co.uk> ed@chaz.demon.co.uk writes:
>In article <1993Apr19.095059.1@uni2a.unige.ch> you write:
>>
>>Hi,
>>
>>Late February I posted a request for information about Lotus Notes,
>>WorkFlow modelling and the Action Tech. Inc. add on. 
>>
>[deleated]
>>
>>                Michel 
>>
>>----------------------------------------------------------------------------
>>Michel Prevel                       Phone   : 41-22/705 81 16
>>Universite de Geneve               Fax     : 41-22/781 41 00
>>Dpt. COMIN                         E. Mail : prevel@uni2a.unige.ch
>>102, Bd. Carl-Vogt
>>1211 Geneve 4 - SWITZERLAND
>>----------------------------------------------------------------------------
>>--
>>
>
>I've offered before in this group.  The response at that time was so strong 
>that I felt I should offer it again.
>
>Lotus Notes 3.0, Action Technologies, and a range of other manufacturers are 
>covered in the April 93 edition of Electronic Documents, a monthly print 
>journal focused on themes relevant to electronic publishing.  
>
>The April 93 issue of Electronic Documents, entitled Workflow & Collaboration, 
>looks at a number of angles associated with groupware/collaboration/workflow
>systems.  Other companies in this report include XSoft, Interleaf, Frame, 
>IBM, and PictureTel.  The report totals 32 pages in length, and is not based 
>on advertising.
>
>If you want a free copy, e-mail your request to the following: 
>       
>       ed@chaz.demon.co.uk
>
>Please include your terrestrial address!
>
>*****************************************************************************
>*                          - Charles Ashley -                               *
>*    Reporter                                                               *
>*    Internet:   ashley@chaz.demon.co.uk        Learned Information Ltd.    *
>*    CompuServe: 71333,624                      tel: +44 (0)71-336-7344     *
>*****************************************************************************


To everybody who responded to the message above:

Thank you all for your interest!

We are trying to process your requests as fast as possible.  I was caught off 
guard by the sheer number of responses, but am working to make sure your 
requests reach the right person.  Usually I would e-mail replies directly to
sender, but as time is of the essence the quicker way was to reply via 
comp.groupware.

Watch your mailbox!
*****************************************************************************
*                          - Charles Ashley -                               *
*    Reporter, _Electronic Documents_                                       *
*    Internet:   ashley@chaz.demon.co.uk        Learned Information Ltd.    *
*    CompuServe: 71333,624                      tel: +44 (0)71-336-7344     *
*****************************************************************************


From alsalqan@bert.eecs.uic.edu (Yahya Alsalqan)
Subject: CF Participation  PN93/Chicago, Final Prog
Message-ID: <1993Apr30.203441.24514@bert.eecs.uic.edu>
Organization: University of Illinois at Chicago
Date: Fri, 30 Apr 1993 20:34:41 GMT
Lines: 836




CALL-FOR-PARTICIPATION in PN93/Chicago

This is a reminder that if you want and/or need to present a short talk 
at Petri Nets 1993, you can do so in the WORK-IN-PROGRESS Session 
on Wednesday evening, June 23 1993. Just send us the title of your talk, 
your name and affiliation via e-mail or fax.before June 18.

Thank you  - Tad Murata and Sol Shatz, pn93@eecs.uic.edu

PS. Attached below is an electronic version of the final program.
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

        The Final Program for
        PETRI NETS 1993 / CHICAGO   Version March 25, 1993

        14th International Conference on
        Application and Theory of Petri Nets
        June 21 - 25, 1993, Bismark Hotel, Chicago

Dear Colleagues:

It  is our great pleasure to invite you to attend the 14th International
Conference on Application and Theory of Petri Nets, which will be held at
the Bismarck Hotel in Chicago, Illinois during the week of June 21-25, 1993.
The selection of Chicago as the 1993 conference site marks the first time
that this international body will hold its annual meeting in the United States.
Come to Chicago, the heart of the midwest, which has something for everyone
to enjoy, including miles of beautiful lakefront parks and beaches, renowned
museums, superb theatre, outdoor concerts, sports events, and great ethnic
dining. Make your visit a vacation. We look forward to seeing you in June.

Petri Net 1993 Organizing Committee

In this electronic version, we present the information in the following order:
        1.  General Information 
        2.  Tutorial Program, June 21-22 
        3.  Tool Presentation, June 21 
        4.  Conference Program, June 23-25
        5.  Committees
        6.  Registration Form

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

GENERAL INFORMATION

Conference Site
The tutorials and conference will take place at the Bismarck Hotel,
171 W. Randolph St., Chicago, IL 60601.
Telephone (312)236-0123, 1-800-643-1500
(outside Chicago, but within continental U.S.), fax (312)236-3177.
Located in the center of Chicago's cultural and financial districts,
this downtown hotel is easily accessible by auto or public transportation.

>> Continental Air Transport provides bus service between the Bismarck hotel
   and O'Hare ($12.50 one way) and Midway ($9.50 one way) Airports.
>> RTA subway service is available to and from O'Hare airport for $1.50.
   The subway stop (Lake Transfer station) is located one block east of
   the hotel, in the State of Illinois Building.
>> Union and Northwestern train stations are five short blocks from the
   hotel.
>> Valet parking is available at a rate of $10.50/for 24 hours (no in or out
   privileges.)  In addition there are 13 public garages within a 10 block
   radius.  Parking rates range  from $6-$12 per day and a maximum of $16 for
   24 hours.  All rates are subject to change without notice.

Accommodations
A  block of rooms has been reserved at the Bismarck Hotel at the special rate
of $65/single, $75 double or twin, and $85/triple, $95/Quad plus  city taxes
(currently 14.9%.)  Check-out time is 1:00  p.m.  A deposit equal to one
night's lodging is required with reservation. Deposits may be made by
personal check or money order, (U.S. currency only, payable to the Bismarck
Hotel),  or by credit card. Full refunds will be issued when notice is given
48 hours prior to arrival.

A hotel reservation form will be included in the conference program
(hard copy version).  If you prefer, you may fax or phone your
reservation with credit card payment. Be sure to identify yourself as
a participant in "Petri Nets '93," to receive the special rate.
Your reservation should be made no later than June 5, 1993.
After that date, reservations will be accepted on a space available
basis and the special rate may not apply.

REGISTRATION/INFORMATION DESK

The registration desk will be open throughout the week, beginning on
Sunday, June 20.  All participants should check-in at the registration
desk. Registration desk hours are:

>> Sunday, June 20 from 5 p.m. to 8 p.m., Blackhawk Room
>> Monday-Tuesday, June 21-22, 8 a.m. to 5 p.m., Blackhawk Room
>> Wednesday-Friday, June 23-25, 8 a.m. to 5 p.m., Pavilion Foyer

Registration
Please complete and return the registration form found at the end
no later than May 24.  The form may be photocopied as needed.
Confirmation will be sent to participants upon receipt of the registration
form and payment.

Registration Fees
Tutorial and Conference registration fees, excluding accommodations,
are provided below.

                 Members*                            Non-Members
                 On or Before   After                On or Before   After
                 May 24         May 24               May 24         May 24

June 21-22
2-day Tutorial   $300           $350                 $320           $370

June 23-25
3-day Conference $395           $445                 $415           $465

*Members of ACM, AFCET, AICA, BCS, EATCS, GI or IEEE.

The tutorial fee includes texts (one for each day),  refreshments (but not
lunches), a tool presentation on Monday, and  a  tool exhibition.

The conference fee includes a copy of the conference proceedings,
refreshments, three lunches, and one ticket for the conference dinner on
Thursday evening. (No refunds will be made for not attending lunches or
dinner). Guest dinner tickets may be purchased with your registration or on
site for $45. All conference participants are entitled to attend the tool
presentation on Monday and the tool exhibition.

Conference Proceedings
The conference fee includes a copy of the proceedings. Additional copies
will be on sale at the registration desk.

Scholarships
A limited number of scholarships providing about 50% reduction off the
conference/tutorial registration fees are available to non-author students
with limited funds. This reduction does not cover transportation,
accommodation, or food. To apply for a scholarship, please send a letter
of explanation, including e-mail address or fax number, and a letter of
recommendation from a major advisor to:  Tadao Murata, UIC
Dept. of EECS (m/c 154) 851 S. Morgan St., Rm.1120 SEO, Chicago, IL
60607 USA;  E-mail: pn93@eecs.uic.edu, Fax: (312)413-0024, Tel: (312)
996-5488. The deadline for submission of materials is May 14, 1993
Applicants will be notified by May 21, 1993.

Payment
Your registration form must be accompanied by full payment.  Payment is
accepted in U.S. dollars only. Foreign currency is unacceptable and will be
returned. Funds must be drawn on a U.S. bank. Do not send cash. All checks
or money orders should be made payable to the University of Illinois
- PETRI NETS 1993

Note: Foreign checks and money orders are subject to a handling charge by
the correspondent bank in the U.S. Any shortage that results must be paid
upon checking in at PETRI NETS 1993.

3 ways to register:
>>By mail, with credit card authorization (Discover, MasterCard or
  Visa) or check (payable to the University of Illinois - PETRI NETS 1993, U.S.
  currency only) to:

        PETRI NETS REGISTRAR 
        UIC CONFERENCES and INSTITUTES (M/C 607)
        1033 W. VAN BUREN ST., SUITE 700N, 7TH FLOOR
        CHICAGO, IL  60607 USA

>>By fax: (312) 996-5227 with signed Discover, MasterCard or
  Visa authorization

>>By phone: (312) 996-5225 with Discover, MasterCard or Visa
  authorization

>>No registrations by e-mails.

Refund Policy
Payment will be refunded, less a $25 processing, fee if notification of
cancellation is made by June 5, 1992.  Refunds must be requested in writing.
No refunds will be made after June 5.

Questions?
Contact, UIC conferences and Institutes, telephone (312)996-5225, fax (312)
996-5227.

Social Program
All activities will take place at the Bismarck Hotel.

>>An informal gathering will be held Tuesday evening from
  6 - 7 p.m.  This reception is open to all tutorial and
  conference participants.
>>The conference reception and banquet will be held on 
  Thursday evening beginning at 6:30 p.m. Guest tickets at $45
  may be purchased with your registration or on site.

If there is interest on the part of participants, an informal dinner may be
planned for Friday evening, June 25. More information will be available on
your arrival at the conference.

Tool Presentation and Exhibit
On Monday, June 21, there will be an oral presentation of the tools that
will be exhibited on Tuesday to Thursday. Tuesday will be the main day
of the exhibition.  Periods will be set aside during the conference in which
tools can be demonstrated for small groups.

Workshop
On Tuesday, June 22, Giorgio De Michelis and Clarence Ellis will be
offering a one-day workshop, "Computer Supported Cooperative Work,
Petri Nets and Related Formalisms."  To attend, you must register for
the three-day conference and pay the conference fee.
For all information concerning the workshop, contact:

Giorgio De Michelis             or       Clarence Ellis
DSI                                      Dept. of Computer Science
University of Milano                     Campus Box 430
Via Comclico 30                          University of Colorado at
21035 Milano, Italy                      Boulder
                                         Boulder, CO 80309-0430

                                         Phone: (303) 492-5984
Fax: +39 2 55006276                      Fax: (303) 492-2844
E-mail:gdemich@hermes.dsi.unimi.it       E-mail: skip@cs.colorado.edu
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

         TUTORIAL PROGRAM

Three types of tutorials - Introductory, Advanced and Case Studies - will be
presented by  internationally well-known experts on Petri nets.

The Introductory Tutorials are designed for newcomers to the field, or those
with rudimentary knowledge of Petri nets. Introductory I ( Monday,
June 21) and Introductory II (Tuesday, June 22) cover the most fundamental
features of system modeling and system analysis based on Petri nets. This
introduction will help the participants to understand the basic ideas in many
of the conference contributions.

Advanced Tutorials are designed for more experienced participants and
provides a comprehensive insight into the state of the art, discussing
specific topics of Petri nets and the relationship to other models of
concurrency  A tutorials:that is practical in orientation will be offered on
Monday, June 21 and another that is theoretical in orientation,
will be offered on Tuesday, June 22.

Practical examples of applying Petri nets will be discussed in a one-day
case study tutorial offered on Tuesday, June 22.

INTRODUCTORY TUTORIALS (Monday and Tuesday)

1. INTRODUCTORY TUTORIAL I (Monday, June 21)

9:00 - 9:30   Informal Introduction to Petri Nets (W. Reisig)
Based on a couple of intuitive examples, the basic principles of system
modeling using Petri nets are informally introduced. In particular the role of
concurrency in realistic systems, and their models, are discussed. Different
versions of Petri nets are introduced and their modeling features compared.

9:30 - 10:30   Elementary Net Systems I (G. Rozenberg)
The basic model of elementary net systems is introduced and motivated.
Through the discussion of fundamental situations it is shown how the basic
aspects of concurrent systems are identified both conceptually and
mathematically within this model. Also, state spaces of elementary net
systems are discussed.

10:30 - 11:00   Coffee Break

11:00 - 12:00   Place / Transition Nets I (W. Reisig)
Place transition nets form a useful and natural extension of the elementary net
system model. Using such nets, one can model a wider variety of systems, and
more importantly, useful and non-trivial analysis techniques are available.
Many analysis techniques are discussed, including coverability graphs and
invariants.

12:00 - 2:00   Lunch (participants on their own)

2:00 - 3:30   High-level Nets I (K. Jensen)
High-level nets allow a Petri net model to have a data part with arbitrary
complex data types. This means that it is possible to make much more succinct
and comprehensible models.The lecture will present the basic ideas behind high-
level Petri nets and it will present a number of large-scale industrial
applications.

3:30 - 4:00   Coffee Break

4:00 - 5:00   Timed and Stochastic Nets  (M. Ajmone Marsan)
The introduction of temporal concepts into Petri net models allows the
application of Petri nets to performance analysis.Several approaches based on
either deterministic or stochastic timing are reviewed and illustrated
with simple examples.The analysis techniques required by each approach
are outlined, and the results that can be obtained are discussed.

2. INTRODUCTORY TUTORIAL II (Tuesday, June 22)

9:00 - 10:30   Elementary Net Systems II (G. Rozenberg)
This lecture discusses the behavior of elementary net systems. It presents two
approaches towards considering the behavior of an elementary net system:
one based on sequential observations, and the other based on non-sequential
observations. The former case leads to firing sequences, while the latter
leads to traces and partial orders.

10:30 - 11:00   Coffee Break

11:00 - 12:00   Place / Transition Nets II (M. Silva)
A  number of  analysis  techniques  for  place  transition nets are presented.
They  include  property  preserving reductions of nets, graph theoretical
arguments, linear programming,  and  techniques  exploiting the special
structure of distinguished net classes.

12:00 - 2:00   Lunch (participants on their own)

2:00 - 3:30   High-level  Nets II (K. Jensen)
This lecture will present some of the most important validation methods for
high-level nets, such as simulation, occurrence graphs and place invariants.
It will discuss how the different validation methods are used throughout the
different phases of system development.

3:30 - 4:00   Coffee Break

4:00 - 4:45   Introduction to GSPNs (M. Ajmone Marsan)
GSPNs are a class of Petri nets with exponentially timed transitions that are
widely used for performance analysis of discrete-event dynamic systems. The
lecture will present the basic concepts relating to GSPNs and their underlying
Petri net models with no timing. An example of application of the GSPN
approach to the performance analysis of systems will be illustrated
in some detail.

4:45 - 5:30   Levels of Petri Nets (H. J. Genrich)
In net theory, we can identify several conceptual levels and various types
of models that are used on these levels. We will discuss in an informal and
eclectic way some of the working tools and principles that have supported
the development of net theory with all its models and applications.
Examples of such principles are continuity, duality, extensionality, local
determinacy, or just one simple (meta) principle, namely conceptual and
formal economy.

ADVANCED TUTORIALS (Monday and Tuesday)

More experienced participants are offered advanced practical and theoretical
tutorials to be presented on Monday and Tuesday. These will provide a
comprehensive insight into the state of the art of specific topics and into
the relationship of Petri nets to other models of concurrency.

1. ADVANCED PRACTICAL TUTORIAL (Monday,  June 21):

PETRI NETS, ARTIFICIAL INTELLIGENCE AND THEIR APPLICATION
TO COMPUTER INTEGRATED MANUFACTURING
(Robert Valette, LAAS-CNRS, Toulouse, France)

Computer integrated manufacturing and engineering (CIME) is aimed at
improving the productivity of manufacturing and engineering industries.
This is accomplished through an integrated approach embracing process
automation and business systems in a way which takes social, organizational,
economic and environmental concerns into full account. To achieve this,
the simultaneous use of a large variety of mathematical tools and semi-formal
approaches is necessary.   This tutorial will cover two approaches;
Petri nets, and artificial intelligence techniques.

Petri nets are known to be suitable for real-time control and global
evaluation of flexible manufacturing systems. Artificial intelligence
techniques (rule-based systems, fuzzy sets, probabilistic theory, etc.) are
used for management as well as diagnosis in case of production disruption.
In fact, the concept of decision rules and imprecise information are required
for flexible management, and that of uncertainty for diagnosis.

The purpose of the tutorial is twofold.   First, some relationships between
Petri nets, considered as a knowledge representation technique, and AI
techniques (rule-based systems, temporal knowledge, timeliness constraint
satisfaction programs, etc.) will be explained and used in order to derive
consistent combined approaches. Second, it will be shown that these combined
approaches (Petri nets and fuzzy markings, rule compilation based Petri net
implementations, etc.) are suitable to solve some specific problems
belonging to CIME (management and real-time control integration,
real-time diagnosis, etc.).

 9:00 - 10:30    Supervision in CIME
10:30 - 11:00    Break
11:00 - 12:30    Petri Nets and Logic
12:30 -  2:00    Lunch  (participants on their own)
 2:00 -  3:30    Fuzzy Petri Nets
 3:30 -  4:00    Break
 4:00 -  5:30    Rule Based System Compilation


2. ADVANCED THEORETICAL TUTORIAL (Tuesday, June 22):

THE RELATIONSHIPS BETWEEN DIFFERENT MODELS OF
CONCURRENCY (Mogens Nielsen, Aarhus Univ., Denmark)

Petri nets are today one of the best known and most widely used formal models
in the area of distributed systems. However, there are many (some would say
too many!) other formalisms around. The choice of a model for a concrete
application is often based on a mixture of pragmatic and formal
considerations.
As an aid to this process the structure of the variety of models is explained
in terms of classifications based on their expressive power, e.g., interleaving
versus non-interleaving, linear time versus branching time, etc.
Recently this kind of classification has been supported by research aimed at
understanding formally the general notion of relationships between models.
The results are often expressed categorically in terms of certain types of
adjunction between (categories of) models, based on functors viewed as
translations between individual models. This tutorial will give a
non-technical introduction to, and a survey of, results provided by this
line of work. In particular, the tutorial will aim to:

* motivate this categorical approach to the study of relationships between
models and offer a guide to an intuitive  interpretation of
the results provided.

* give a brief introduction to some fundamental models of concurrency
including (elementary) net systems, (asynchronous/ elementary) transition
systems, synchronization trees, Hoare traces, event structures and
Mazurkiewicz traces

* present and interpret a number of formal (categorical) relationships between
these models, focusing on the presentation of net systems as the central model

9:00 - 10:30    Introduction and Motivation
10:30 - 11:00   Coffee Break
11:00 - 12:30   Classification of Models for Concurrency
12:30 - 2:00    Lunch (participants on their own)
2:00 - 3:30     Relationships Between Petri Nets and Other Models
3:30 - 4:00     Coffee Break
4:00 - 5:30     Process Algebra and Their Models

CASE STUDIES TUTORIAL (Tuesday, June 22)

The aim of this one day tutorial is to demonstrate the practical use of Petri
nets in the design, specification and verification of concurrent systems.
The tutorial presents four different Petri nets projects, covering rather
different application areas. Most of the projects have been conducted
in an industrial environment, and all of them have produced rather large
and complex Petri net models. Some of the models use hierarchical
high-level nets, while others use timed and stochastic Petri nets.

9:00 - 10:30    Asynchronous Circuit Design
                Robert Shapiro, Meta Software, Cambridge, Massachusetts

10:30 - 11:00   Coffee Break

11:00 - 12:30   Simulation of Communication Protocols
                Marco Ajmone Marsan and Fabio Neri, Politecnico di Torino, Italy

12:30 - 2:00    Lunch (participants on their own)

2:00 - 3:30     Work Flow Analysis of Business Processes
                Valerio Pinci, Meta Software, Cambridge, Massachusetts

3:30 - 4:00     Coffee Break

4:00 -5:30      Reliability Modeling of a Heterogeneous Multiprocessor
                Kishor Trivedi, Duke University, North Carolina

Each presentation will give an overview of the application area, the Petri net
model, and its verification. The presentation will describe the practical
experiences, such as the quality of the results, the use of man-power, the
background of the project group, the main problems and the main
achievements. Finally, the presentations will compare the Petri net project
to similar projects where other methods were used. None of the
presentations will require a prior knowledge of the application area,
but it will be assumed that the participants have a general knowledge
of Petri nets.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

TOOL PRESENTATION, Monday June 21
(Open to all conference and tutorial participants)

 10:00   GreatSPN 1.6
        Giovanni Chiola, University of Torino, Italy

 10:30   Coffee Break

 11:00   ASE Activity Sequence Editor
        C. M. Woodside and Yao Li,
        Carleton University, Ottawa, Canada.

 11:30   ExSpect
        Lou Somers, Eindhoven University of Technology, Holland

 12:00   DSPNexpress
        Christoph Lindemann, Technical University of Berlin, Germany

 12:30   Lunch Break

 2:00   Design/CPN, Design/IDEF, and META Work Flow Analyzer
        Valerio Pinci, Meta Software Corporation, Cambridge, MA USA

 2:30    SANDS
        Didier Buchs, Jacques Flumet, and Pascal Racloz,
        University of Paris-Sud, France

 3:00   PROD
        Kimmo Varpaaniemi, Helsinki Univ. of Technology, Finland

 3:30   Coffee Break

 4:00   AMI
        Fabrice Kordon, Universite Pierre et Marie Curie, France

4:30   Handy Net-Tool for Beginners and Educational Use
        Hisao Shiizuka, Kogakuin University, Tokyo, Japan

5:00   Compositional Petri Net Environment
        N. A. Anisimov, Russian Academy of Sciences, Vladivostock, Russia.

5:30    Adjourn

TOOL EXHIBITION
Tuesday, Wednesday, Thursday, June 22 - 24

 The Tool Exhibition will be open Tuesday through Thursday. Demonstrations 
 for small groups and individual participants can be arranged at the conference.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

CONFERENCE PROGRAM

Wednesday June 23

8:00    Registration

8:55    Welcome and Remarks

9:00    "Groupware and Concurrency Modeling"
        Invited Speaker - C.. Ellis (U. of Colorado, Boulder,
        USA)

10:00   "Bridging the Gap between Place- and Floyd-Invariants with
        Applications to Preemptive Scheduling"
        R. Valk (Univ. Hamburg, Germany)

10:30   Break

11:00   "Interval Timed Coloured Petri Nets and their Analysis"
        W. M. P. van der Aalst (Eindhoven Univ. of Tech., The Netherlands)

11:30   "Hierarchies in Colored GSPNs"
        P. Buchholz (Univ. Dortmund, Germany)

12:00   "Analysis of Place-Transition Nets with Timed Arcs and its
        Application to Batch Process Control"
        H.-M. Hanisch (Univ. Dortmund, Germany)

12:30 - 2:00  Lunch

2:00    "Liveness and Home States in Equal Conflict Systems"
        E. Teruel and M. Silva (Univ. of Zaragoza, Spain)

2:30    "Shortest Paths in Reachability Graphs"
        J. Desel and J. Esparza (TU Munchen / Univ. Hildesheim,
        Germany)

3:00    "A Unified Approach for Reasoning About Conflict-Free Petri
        Nets"  H.-C. Yen, B. Y. Wang, and M.-S. Yang (National
        Taiwan U., Taiwan)

3:30    Coffee Break

4:00 - 6:00  Project Presentations

4:00    "On Net Modeling of Industrial Size Concurrent Systems"
        L. Cherkasova, V. Kotov, and T. Rokicki (H.-P. Lab, Palo Alto /
        Stanford Univ., USA)

4:20    "Petri Net Based Specification of Services in an Intelligent Network
        - Experiences Gained from a Test Case Application"
        C. Capellmann and H. Dibold (DBP Telekom, Darmstadt, Germany)

4:40    "A Colored Petri Net Model for a Naval Command and Control
        System"
        J. Berger and L. Lamontagne (DREV, Quebec city, Canada)

5:00    "Analysis of the TMS320C40 Communication Channels Using
        Timed Petri Nets" D.  A. Hartley and D. M. Harvey
        (Liverpool J. Moores Univ., U.K.)

5:20    "Protocol Optimization for a Packet-Switched Bus in case of
        Burst Traffic by means of GSPN"
        G. Klas (Siemens R & D, Munchen, Germany)

5:40    "Petri Nets Modeling in Pipelined Microprocessor Design"
        Q. Zhang and H. Grunbacher (Vienna Univ. of Tech., Vienna,
        Austria)

6:00    Adjourn

8:00  - 9:30  WORK-IN-PROGRESS SESSION

        The conference participants are invited to make short (approximately 10
        minutes) presentation of their ongoing work. Those who wish to
        contribute should contact the organizing committee (T. Murata or S. M.
        Shatz) before the conference (June 18). E-mail: pn93@eecs.uic.edu, 
        fax:: (312)413-0024, Phone: (312)996-5488.

Thursday June 24

8:30    "Applications of qualitative and quantitative structural analysis of
        net models"
        Invited Speaker - M. Silva (Univ. of Zaragoza, Spain)

9:30    "A subset of Lotos with the Computational Power of
        Place/Transition-Nets" M. Barbeau and G. v. Bochmann
        (Uinv. of Sherbrooke / Univ. of Montreal, Canada)

10:00   Coffee Break

10:30   "Integrating Software Engineering Methods and Petri Nets for the
        Specification and Prototyping of Complex Information Systems"
        Y. Deng, S.-K. Chang, J. C.A. de Figueiredo and A. Perkusich
        (Florida Int. Univ.-Miami / Univ. of Pittsburg, USA)

11:00   A Client-Server Protocol for the Composition of Petri Nets
        C. Sibertin-Blanc (Univ. of Toulouse, France)

11:30   Integration of Specification for Modeling and Specification for
        System Design
        C.-Y. Wang and K. S. Trivedi (Duke Univ. Durham, USA)

12:00   Lunch

1:30    "Linear Time Algorithm to Find a Minimal Deadlock in a
        Strongly Connected Free-Choice Net"
        P. Kemper (Univ. Dortmund, Germany)

2:00    "An Efficient Algorithm for Finding Deadlocks in Colored
        Petri Nets"  K. Barkaoui, C. Dutheillet and S. Haddad
        (CNAM / U. of P&M Curie, Paris France)

2:30    "Construction of S-invariants and S-components for Refined
        Petri Boxes" R. Devillers (Universite Libre de Bruxelles, Belgium)

3:00    Coffee Break

3:30    "Coloured Petri Nets Extended with Place Capacities,
        Test Arcs and Inhibitor Arcs"
        S. Christensen and N. D. Hansen (Aarhus Univ., Denmark)

4:00    "Variable Reasoning and Analysis about Uncertainty with
        Fuzzy Petri Nets"
        T. Cao and A. C. Sanderson (RPI, Troy, NY USA)

4:30    "Exploiting T-Invariant Analysis in Diagnostic Reasoning
        on a Petri Net Model" L. Portinale (Univ. of Torino, Italy)
5:00    Adjourn

6:30    SOCIAL HOURS AND RECEPTION

7:30    BANQUET


Friday June 25

8:30    "Petri Nets with Continuous-State Marking Processes"
        Invited Speaker - K. S. Trivedi (Duke Univ., Durham, NC, USA

9:30    "New Priority-Lists for Scheduling in Timed Petri Nets"
        T. Watanabe and M. Yamauchi (Hiroshima Univ., Japan)

10:00   Coffee Break

10:30   "Distributed Simulation of Timed Petri Nets: Exploiting
        the Net Structure to Obtain Efficiency"
        G. Chiola and A. Ferscha (Univ. of Torino, Italy 
	/Univ. of Vienna, Austria)

11:00   "On Well-Formed Nets and Optimal Firing Test"
        J.-M. Ilie' and O. Rojas (Univ. of P&M Curie, Paris, France)

11:30   "Taking Advantages of Temporal Redundancy in High Level
        Petri Nets Implementations" J.A. Banares, P.R. Muro-Medrano
        and J.L. Villaroel (Univ. of Zaragoza, Spain)

12:00   Lunch

1:30    "Marking Optimization of Stochastic Timed Event Graphs"
        N.  Sauer and X.-L. Xie ( INRIA, Metz, France)

2:00    "Transient Analysis of Deterministic and Stochastic Petri Nets"
        H. Choi, V. G. Kulkarni and K. S. Trivedi (Duke Univ.,
        Durham, NC, USA)

2:30    "Analysis of Dynamic Load Balancing Strategies Using
        a Combination of Stochastic Petri Nets and Queueing Networks"
        C.R.M. Sundaram and Y. Narahari (U. of Saskatchewan, Canada /
        IIS, Bangalore, India)

3:00    Coffee Beak

3:30    "Compositional Liveness Properties of EN-Systems"
        D. Gomm, E. Kindler, B. Paech and R. Walter
        (TU-Munchen, Germany)

4:00    "Synthesis of Net Systems"
        L. Bernadiello (Univ. of Milan, Italy)

4:30 - 5:00     Closing session

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
PETRI NETS 1993 COMMITTEES

Program Committee
M. Ajmone-Marsan        Italy (Chair)
E. Best                 Germany
J. Billington           Australia
M. Diaz                 France
S. Donatelli            Italy
C. Girault              France
K. Jensen               Denmark
H.C.M. Kleijn           The Netherlands
B. Krogh                USA
A. Mazurkiewicz         Poland
J.F. Meyer              USA
M. Molloy               USA
T. Murata               USA
G. Nutt                 USA
K. Onaga                Japan
L. Pomello              Italy
W. Reisig               Germany
M. Silva                Spain
P.S. Thiagarajan        India
W.M. Zuberek            Canada

Steering Committee
M. Ajmone-Marsan        Italy
J. Billington           Australia
H.J. Genrich            Germany
C. Girault              France
K. Jensen               Denmark
G. De Michelis          Italy
T. Murata               USA
C.A. Petri              Germany (Honorary Member)
W. Reisig               Germany
G. Roucairol            France
G. Rozenberg            The Netherlands (Chair)
M. Silva                Spain

Organizing Committee
Tadao Murata  
Sol Shatz 
Ugo Buy 

Organized and hosted by
Department of Electrical Engineering and Computer Science
The University of Illinois at Chicago, with the assistance of
Meta Software Corporation

In Cooperation with
IEEE Computer Society,
AFCET SIG "Systemes Paralleles et Distribues", CNRS-C , AICA, BCS
SIG "Formal Aspects of Computer Science", EATCS, and GI SIG "Petri
Nets and Related System Models"

Corporate Sponsors: Bull, Fujitsu, Hitachi Software, Sun Micro
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

REGISTRATION FORM

To register, return this form to

        PETRI NETS REGISTRAR 
        UIC CONFERENCES and INSTITUTES (M/C 607)
        1033 W. VAN BUREN ST., SUITE 700N, 7TH FLOOR
        CHICAGO, IL  60607 USA

With credit card payment, you can register by
Phone (312) 996-5225 or FAX (312) 996-5227,
but not via e-mail.

Please type or print
Last Name ________________________ First Name _____________________
Organization ______________________________________________________
Address ___________________________________________________________
__________________________________________________________________
__________________________________________________________________
Phone: ________________________ Fax: _____________________________
E-mail: __________________________________________________________
(If you don't want your phone number, etc. to appear on
the participant list, please so indicate.)

Please circle membership information, as appropriate.
I am a member of: ACM AFCET AICA  BCS  EATCS  GI  IEEE.

I wish to register for the following:

___ Two-Day Tutorial, June 21-22   Fees (Check one):
Member (by May 24) ___$300, (after May 24) ____$350;
Non-Members (by May 24) ___$320, (after May 24) ___$370

    Check which session you plan to attend each day
        Monday, June 21 (check one)
        _____ Introductory I
        _____ Advanced Practical

        Tuesday June 22 (check one)
        _____ Introductory II
        _____ Advanced Theory
        _____ Case Studies

___ Three-Day Conference (June 23-25)  Fees (Check one):
Member (by May 24) ___$395, (after May 24) ___$445;
Non-Members (by May 24) ___$415, (after May 24) ___$465

Do you wish to register for the workshop, "Computer Supported
Cooperative Work: Petri Nets and Related Formalisms", on June 22?
(Circle one)  YES   NO
(Note: To register for this workshop, you must also be registered for
the conference.)

__ Additional/guest banquet tickets  Number ___@ $45 each = $_____

Total Payment Enclosed $_______________________________________

PAYMENT METHOD:____ Check or money order, payable to
                the University of Illinois - PETRI NETS 1993.
U.S. currency only. Funds must be drawn on a U.S. bank; or

__ Discover   __ MasterCard   __ Visa Exp. Date _____/_________
Credit Card Number ____________________________________________
Cardholder's Signature ________________________________________

Refunds, less $25 processing fee, available for requests received
in writing by June 5, 1993.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
        MAKE YOUR OWN ROOM RESERVATIONS
by June 5, 1993 at

     The Bismark Hotel,
     171 W. Randolph Street
     Chicago  Illinois 60601, U.S.A.

     FAX (312) 236-3177
     Phone (312) 236-0123,
     Outside Chicago, but within Continental U.S. 1-800-643-1500

Ask for special Petri Nets '93 rates:
$65 Single, $75 Double, $85 Triple, $95 Quad. plus tax
Identify yourself as a participant in Petri Nets' 93.

**************END*********************************



