From owner-reliable_computing [at] interval [dot] usl.edu Mon May 1 03:16:12 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id DAA00541 for reliable_computing-outgoing; Mon, 1 May 2000 03:16:12 -0500 (CDT) Received: from unknown (ip248.atlanta14.ga.pub-ip.psi.net [38.30.162.248]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with SMTP id DAA00527; Mon, 1 May 2000 03:16:03 -0500 (CDT) From: bench1 [at] hotpop [dot] com Subject: your imaging supplies Date: Mon, 1 May 2000 12:34:46 Message-Id: <221.353869.171555@> Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk BENCHMARK SUPPLY 5334 LAKE VIEW CLUB ATLANTA GA 30338 ***LASER PRINTER TONER CARTRIDGES*** ***FAX AND COPIER TONER*** WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS CHECK OUT OUR NEW CARTRIDGE PRICES : APPLE LASER WRITER PRO 600 OR 16/600 $69 LASER WRITER SELECT 300,310.360 $69 LASER WRITER 300, 320 $54 LASER WRITER LS,NT,2NTX,2F,2G & 2SC $54 LASER WRITER 12/640 $79 HEWLETT PACKARD LASERJET SERIES 2,3 & 3D (95A) $49 LASERJET SERIES 2P AND 3P (75A) $54 LASERJET SERIES 3SI AND 4SI (91A) $75 LASERJET SERIES 4L AND 4P $49 LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A) $59 LASERJET SERIES 4000 HIGH YIELD (27X) $99 LASERJET SERIES 4V $95 LASERJET SERIES 5SI , 8000 $95 LASERJET SERIES 5L AND 6L $49 LASERJET SERIES 5P, 5MP, 6P, 6MP $59 LASERJET SERIES 5000 (29A) $135 LASERJET SERIES 1100 (92A) $49 LASERJET SERIES 2100 (96A) $84 LASERJET SERIES 8100 (82X) $145 HP LASERFAX LASERFAX 500, 700, FX1, $59 LASERFAX 5000, 7000, FX2, $59 LASERFAX FX3 $69 LASERFAX FX4 $79 LEXMARK OPTRA 4019, 4029 HIGH YIELD $135 OPTRA R, 4039, 4049 HIGH YIELD $135 OPTRA S 4059 HIGH YIELD $135 OPTRA E $59 OPTRA N $115 EPSON EPL-7000, 8000 $105 EPL-1000, 1500 $105 CANON LBP-430 $49 LBP-460, 465 $59 LBP-8 II $54 LBP-LX $54 LBP-MX $95 LBP-AX $49 LBP-EX $59 LBP-SX $49 LBP-BX $95 LBP-PX $49 LBP-WX $95 LBP-VX $59 CANON FAX L700 THRU L790 FX1 $59 CANONFAX L5000 L70000 FX2 $59 CANON COPIERS PC 20, 25 ETC.... $89 PC 3, 6RE, 7, 11 (A30) $69 PC 320 THRU 780 (E40) $89 NEC SERIES 2 LASER MODEL 90,95 $105 PLEASE NOTE: 1) ALL OUR CARTRIDGES ARE GENUINE OEM CARTRIDGES. 2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS 3) WE DO NOT FAX QUOTES OR PRICE LISTS. 4) WE DO NOT SELL TO RESELLERS OR BUY FROM DISTRIBUTERS 5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS 6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS 7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES 8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES 9) WE DO NOT BUY FROM OR SELL TO RECYCLERS OR REMANUFACTURERS ****OUR ORDER LINE IS 770-399-0953 **** ****OUR CUSTOMER SERVICE LINE IS 800-586-0540**** ****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597**** ****PLACE YOUR ORDER AS FOLLOWS**** : BY PHONE 770-399-0953 BY FAX: 770-698-9700 BY MAIL: BENCHMARK PRINT SUPPLY 7540 BRIDGEGATE COURT , ATLANTA GA 30350 MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: 1) YOUR PHONE NUMBER 2) COMPANY NAME 3) SHIPPING ADDRESS 4) YOUR NAME 5) ITEMS NEEDED WITH QUANTITIES 6) METHOD OF PAYMENT. (COD OR CREDIT CARD) 7) CREDIT CARD NUMBER WITH EXPIRATION DATE 1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING. 2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST. 2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS. 3) OUR STANDARD MERCHANDISE REFUND POLICY IS NET 30 DAYS 4) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. NOTE NUMBER (1): PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND COMPLAINT LINE TO DO THAT. NOTE NUMBER (2): OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR CUSTOMER SERCICE LINE. From owner-reliable_computing [at] interval [dot] usl.edu Mon May 1 07:08:40 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA01959 for reliable_computing-outgoing; Mon, 1 May 2000 07:08:40 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA01954 for ; Mon, 1 May 2000 07:08:37 -0500 (CDT) Received: from liberty (liberty.usl.edu [130.70.46.171]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id HAA01741; Mon, 1 May 2000 07:08:24 -0500 (CDT) Message-Id: <2.2.32.20000501120945.012d0798 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 01 May 2000 07:09:45 -0500 To: bench1 [at] hotpop [dot] com, reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Re: spam Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, I recommend you not do business with these people. They have not honored repeated requests to remove the "reliable_computing" address from their list, despite my following their outlined procedure. Sincerely, R. Baker Kearfott At 12:34 PM 5/1/00, you wrote: >BENCHMARK SUPPLY >5334 LAKE VIEW CLUB >ATLANTA GA 30338 > >***LASER PRINTER TONER CARTRIDGES*** >***FAX AND COPIER TONER*** > >WE ACCEPT GOVERNMENT, SCHOOL & UNIVERSITY PURCHASE ORDERS >JUST LEAVE YOUR PO # WITH CORRECT BILLING & SHIPPING ADDRESS > > CHECK OUT OUR NEW CARTRIDGE PRICES : > > >APPLE > > LASER WRITER PRO 600 OR 16/600 $69 > LASER WRITER SELECT 300,310.360 $69 > LASER WRITER 300, 320 $54 > LASER WRITER LS,NT,2NTX,2F,2G & 2SC $54 > LASER WRITER 12/640 $79 > >HEWLETT PACKARD > > LASERJET SERIES 2,3 & 3D (95A) $49 > LASERJET SERIES 2P AND 3P (75A) $54 > LASERJET SERIES 3SI AND 4SI (91A) $75 > LASERJET SERIES 4L AND 4P $49 > LASERJET SERIES 4, 4M, 5, 5M, 4+ (98A) $59 > LASERJET SERIES 4000 HIGH YIELD (27X) $99 > LASERJET SERIES 4V $95 > LASERJET SERIES 5SI , 8000 $95 > LASERJET SERIES 5L AND 6L $49 > LASERJET SERIES 5P, 5MP, 6P, 6MP $59 > LASERJET SERIES 5000 (29A) $135 > LASERJET SERIES 1100 (92A) $49 > LASERJET SERIES 2100 (96A) $84 > LASERJET SERIES 8100 (82X) $145 > > >HP LASERFAX > > LASERFAX 500, 700, FX1, $59 > LASERFAX 5000, 7000, FX2, $59 > LASERFAX FX3 $69 > LASERFAX FX4 $79 > > >LEXMARK > > OPTRA 4019, 4029 HIGH YIELD $135 > OPTRA R, 4039, 4049 HIGH YIELD $135 > OPTRA S 4059 HIGH YIELD $135 > OPTRA E $59 > OPTRA N $115 > > >EPSON > > EPL-7000, 8000 $105 > EPL-1000, 1500 $105 > > >CANON > > LBP-430 $49 > LBP-460, 465 $59 > LBP-8 II $54 > LBP-LX $54 > LBP-MX $95 > LBP-AX $49 > LBP-EX $59 > LBP-SX $49 > LBP-BX $95 > LBP-PX $49 > LBP-WX $95 > LBP-VX $59 > CANON FAX L700 THRU L790 FX1 $59 > CANONFAX L5000 L70000 FX2 $59 > > >CANON COPIERS > > PC 20, 25 ETC.... $89 > PC 3, 6RE, 7, 11 (A30) $69 > PC 320 THRU 780 (E40) $89 > > >NEC > > SERIES 2 LASER MODEL 90,95 $105 > > >PLEASE NOTE: > >1) ALL OUR CARTRIDGES ARE GENUINE OEM CARTRIDGES. >2) WE DO NOT SEND OUT CATALOGS OR PRICE LISTS >3) WE DO NOT FAX QUOTES OR PRICE LISTS. >4) WE DO NOT SELL TO RESELLERS OR BUY FROM DISTRIBUTERS >5) WE DO NOT CARRY: BROTHER-MINOLTA-KYOSERA-PANASONIC PRODUCTS >6) WE DO NOT CARRY: XEROX-FUJITSU-OKIDATA OR SHARP PRODUCTS >7) WE DO NOT CARRY ANY COLOR PRINTER SUPPLIES >8) WE DO NOT CARRY DESKJET/INKJET OR BUBBLEJET SUPPLIES >9) WE DO NOT BUY FROM OR SELL TO RECYCLERS OR REMANUFACTURERS > > > > > >****OUR ORDER LINE IS 770-399-0953 **** > >****OUR CUSTOMER SERVICE LINE IS 800-586-0540**** >****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597**** > >****PLACE YOUR ORDER AS FOLLOWS**** : > >BY PHONE 770-399-0953 > >BY FAX: 770-698-9700 >BY MAIL: BENCHMARK PRINT SUPPLY > 7540 BRIDGEGATE COURT >, ATLANTA GA 30350 > >MAKE SURE YOU INCLUDE THE FOLLOWING INFORMATION IN YOUR ORDER: > > 1) YOUR PHONE NUMBER > 2) COMPANY NAME > 3) SHIPPING ADDRESS > 4) YOUR NAME > 5) ITEMS NEEDED WITH QUANTITIES > 6) METHOD OF PAYMENT. (COD OR CREDIT CARD) > 7) CREDIT CARD NUMBER WITH EXPIRATION DATE > > >1) WE SHIP UPS GROUND. ADD $4.5 FOR SHIPPING AND HANDLING. >2) COD CHECK ORDERS ADD $3.5 TO YOUR SHIPPING COST. >2) WE ACCEPT ALL MAJOR CREDIT CARD OR "COD" ORDERS. >3) OUR STANDARD MERCHANDISE REFUND POLICY IS NET 30 DAYS >4) OUR STANDARD MERCHANDISE REPLCAMENT POLICY IS NET 90 DAYS. > > >NOTE NUMBER (1): > >PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL >ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD >YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR >COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS >WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE >HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND >COMPLAINT LINE TO DO THAT. > >NOTE NUMBER (2): > >OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY >QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL >RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT >THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER > OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR >CUSTOMER SERCICE LINE. > > > > > > > > > > > > > > > --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Mon May 1 07:46:06 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA02365 for reliable_computing-outgoing; Mon, 1 May 2000 07:46:05 -0500 (CDT) Received: from zmit1.ippt.gov.pl (zmit1.ippt.gov.pl [148.81.53.8]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA02360 for ; Mon, 1 May 2000 07:46:02 -0500 (CDT) Received: (from zkulpa@localhost) by zmit1.ippt.gov.pl (8.8.5/8.7.3-zmit) id OAA04023 for reliable_computing [at] interval [dot] louisiana.edu; Mon, 1 May 2000 14:45:25 +0200 (MET DST) Date: Mon, 1 May 2000 14:45:25 +0200 (MET DST) From: Zenon Kulpa Message-Id: <200005011245.OAA04023 [at] zmit1 [dot] ippt.gov.pl> To: reliable_computing [at] interval [dot] louisiana.edu Subject: Re: spam Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk > From owner-reliable_computing [at] interval [dot] usl.edu Mon May 1 14:08:39 2000 > From: "R. Baker Kearfott" > > I recommend you not do business with these people. They have not > honored repeated requests to remove the "reliable_computing" address > from their list, despite my following their outlined procedure. > I second that suggestion. They were sending their messages to my private address too - and I cannot use their "removal line" from Poland... Hence, if they will persist, I will be forced to figure a way to become a real nuisance to them through the Internet... -- Zenon Kulpa > >BENCHMARK SUPPLY > >5334 LAKE VIEW CLUB > >ATLANTA GA 30338 [...] > > >****OUR ORDER LINE IS 770-399-0953 **** > > > >****OUR CUSTOMER SERVICE LINE IS 800-586-0540**** > >****OUR E-MAIL REMOVAL AND COMPLAINT LINE IS 888-494-8597**** > > > >****PLACE YOUR ORDER AS FOLLOWS**** : > > > >BY PHONE 770-399-0953 > > > >BY FAX: 770-698-9700 > >BY MAIL: BENCHMARK PRINT SUPPLY > > 7540 BRIDGEGATE COURT > >, ATLANTA GA 30350 [...]> > > >NOTE NUMBER (1): > > > >PLEASE DO NOT CALL OUR ORDER LINE TO REMOVE YOUR E-MAIL > >ADDRESS OR COMPLAIN. OUR ORDER LINE IS NOT SETUP TO FORWARD > >YOUR E-MAIL ADDRESS REMOVAL REQUESTS OR PROCESS YOUR > >COMPLAINTS..IT WOULD BE A WASTED PHONE CALL.YOUR ADDRESS > >WOULD NOT BE REMOVED AND YOUR COMPLAINTS WOULD NOT BE > >HANDLED.PLEASE CALL OUR TOLL FREE E-MAIL REMOVAL AND > >COMPLAINT LINE TO DO THAT. > > > >NOTE NUMBER (2): > > > >OUR E-MAIL RETURN ADDRESS IS NOT SETUP TO ANSWER ANY > >QUESTIONS YOU MIGHT HAVE REGARDING OUR PRODUCTS. OUR E-MAIL > >RETURN ADDRESS IS ALSO NOT SETUP TO TAKE ANY ORDERS AT > >THIS TIME. PLEASE CALL THE ORDER LINE TO PLACE YOUR ORDER > > OR HAVE ANY QUESTIONS ANSWERED. OTHERWISE PLEASE CALL OUR > >CUSTOMER SERCICE LINE. > > From owner-reliable_computing [at] interval [dot] usl.edu Wed May 3 09:18:24 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id JAA06346 for reliable_computing-outgoing; Wed, 3 May 2000 09:18:23 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id JAA06341 for ; Wed, 3 May 2000 09:18:19 -0500 (CDT) Received: from u8174 (rbk5287 [at] goedel [dot] usl.edu [130.70.49.203]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-mx-host_1.3) with SMTP id JAA05466 for ; Wed, 3 May 2000 09:18:11 -0500 (CDT) Message-Id: <2.2.32.20000503141723.00748458 [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 03 May 2000 09:17:23 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: Clarification -- "spam" Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, I apologize if I may have offended anyone concerning my "recommendation" about the agressive email advertiser. In all fairness, the "reliable_computing.usl.edu" address may have been removed, possibly to be found again when we changed it to "reliable_computing.louisiana.edu" In other words, the advertiser, although agressive in mailing ad's unsolicited to a huge number of addresses, may have acted in good faith in trying to remove the address. I hadn't thought of that when I sent my thoughts yesterday. I repeat, I do not wish to inhibit genuine interest and discussion on this list. Also, I'm preparing to send a little "ad" concerning the next version of GlobSol.... stay tuned :-) Sincerely, R. Baker Kearfott --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Thu May 4 11:59:50 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA08951 for reliable_computing-outgoing; Thu, 4 May 2000 11:59:50 -0500 (CDT) Received: from marnier.ucs.usl.edu (root@ucs-gw.usl.edu [130.70.40.2]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA08946 for ; Thu, 4 May 2000 11:59:47 -0500 (CDT) Received: from liberty (liberty.usl.edu [130.70.46.171]) by marnier.ucs.usl.edu (8.9.1/8.9.1/ucs-server-melissa_1.3) with SMTP id LAA23379 for ; Thu, 4 May 2000 11:59:41 -0500 (CDT) Message-Id: <2.2.32.20000504170111.012ec6ec [at] pop [dot] usl.edu> X-Sender: rbk5287 [at] pop [dot] usl.edu X-Mailer: Windows Eudora Pro Version 2.2 (32) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 04 May 2000 12:01:11 -0500 To: reliable_computing [at] interval [dot] louisiana.edu From: "R. Baker Kearfott" Subject: New version of GlobSol posted Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Colleagues, I have just uploaded a new version of GlobSol. I have run my integration tests on five machine-compiler-make utility combinations, except I have not run the tests with the NAG compiler on Sun machines. (If someone cares to do this, I would be grateful for the output, that I can peruse. Also, if someone cares to try it on a machine I haven't listed on the download page, I would be grateful to receive copies of the modified makefile, etc.) I remind you that GlobSol may be obtained from http://interval.louisiana.edu/GlobSol/download_GlobSol.html I append the portion of the release notes dealing with the new version. Best regards, Baker ========================================================================= May 2, 2000 -- Differences between the version dated Dec. 7 and the version dated May 2: 1. Generally, installation use of GlobSol have been further simplified. (a) For Unix systems, the "unpack" macros now automatically change the root directory for GlobSol to the directory in which the macros are being run. (b) The read.me file has been changed to install.html (c) A script (or, a batch file on MS-based systems) "globsol" (or globsol.bat) now runs GlobSol's optimizer more nearly automatically. (Thank you, George Corliss, for providing this, and also for making various other suggestions leading to changes in this version.) This script has significant user input checking on unix systems. 2. A bug dealing with bound constraints has been fixed. The error was in listops/cmpldopt.f90, the routine that takes the complement of a box in another box. THe problem was that a box corresponding to a boundary was deleted as part of the complement of an interior box that is being put on the list. The interior box was later rejected as not containing critical points. Now, when the complementation of a box in a list is taken, only those members of the list with the same boundary status as the original box are possibly altered. Thank you, Uri Zwick, for your interest and diligence. 3. Versions of unpack, makefile, etc. are now provided for SGI with the MIPS compiler. (These versions are very close to other unix-based versions.) 4. Additional technical changes: (a) Changed a "slope" utility routine so that portions of the Fritz-John matrix now are computed using slope arithmetic. This had earlier been disabled during a search for a bug. (b) Changed the default way the code list creation process writes the code list files, to better interface with the script globsol. (c) Changed the *.f90 files in the integration_test_data directory so they no longer contain the line "CODELIST_FILE_NAME = ..." The default when running the "globsol" script is not to make the code list file name equal to the name of the *.f90 file. (d) f90intbi/rigorous_global_search.f90 now purges the output lists immediately before returning, to catch certain boxes that were not caught before. (e) A configuration file variable WANT_TABLE now exists. This switch turns on and off production of OPTTEST.TBL, a table giving data from multiple runs of GlobSol; the data is in a form that can be imported into spreadsheets. (f) Made a minor change to random_GN.f90 so it closes unit 10 after it opens it. ========================================================================= --------------------------------------------------------------- R. Baker Kearfott, rbk [at] louisiana [dot] edu (337) 482-5346 (fax) (337) 482-5270 (work) (337) 981-9744 (home) URL: http://interval.louisiana.edu/kearfott.html Department of Mathematics, University of Louisiana at Lafayette Box 4-1010, Lafayette, LA 70504-1010, USA --------------------------------------------------------------- From owner-reliable_computing [at] interval [dot] usl.edu Sat May 6 13:51:17 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA12590 for reliable_computing-outgoing; Sat, 6 May 2000 13:51:17 -0500 (CDT) Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA12585 for ; Sat, 6 May 2000 13:51:14 -0500 (CDT) Received: from localhost (fayad@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id NAA9072316; Sat, 6 May 2000 13:29:27 -0500 (CDT) Date: Sat, 6 May 2000 13:29:27 -0500 From: Mohamed Fayad To: Undisclosed recipients: ; Subject: CFCs for S/W Arch., Components, and Frameworks Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Greetings, Apologies if you recieve multitple copies of this cfcs. Enclosed, please find a call for chapters and reviewers. Please post. Thank you. Cheers, M. Fayad ---------------------- 3-volume book on Software Architectures, Components, and Frameworks Call for Chapters and Reviewers Authors and Editors: Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org, URL: http://www.cse.unl.edu/~fayad Dr. David Garlan: garlan [at] cs [dot] cmu.edu URL: http://www.cs.cmu.edu/~garlan Professor Wolfgang Pree: pree [at] acm [dot] org URL: www.informatik.uni-konstanz.de/swe We are developing three-volume series of books on software architectures, components, and frameworks. If this is your area of interest/research, I would like to invite you to submit a chapter. This series of books will serve as a complete reference set for academics and practitioners. Volume 1: Software Architectures The working title of the first-volume is "Software Architectures." Architecture-based software engineering research has yielded an impressive array of technologies and demonstrations over the past decade. Using an architecture-based approach, applications have been built which: - Are understandable - Are expected to evolve - Exhibit remarkable flexibility - Demonstrate significant reuse of off-the-shelf components - Leverage experience from related applications in the same problem domain - Are analyzable earlier in their development than ever before - Are key milestones in software managerial and development processes Currently, there is relatively little guidance for software developers on how to develop software architectures. This volume addresses several topics crucial to the state of the art and practice of software architecture. The book presents a complete reference on how to develop a good software architecture and provides guidelines for resolving key software architecture issues, such as evolving software architectures, leveraging existing investment in software architecture artifacts, representing architecture description languages, introducing formal models for software architectures, addressing architectural analysis techniques & development methods, transitioning from software architecture to coding and surveying architectural design tools and environments. In addition, the book will include sections on: accessing of software architectures, testing and validating software architectures, improving software architecture quality, documenting software architectures, and many more. This is a pragmatic book that is specifically designed to help organizations develop software architectures for real projects in the real world. Comprehensive technical and management guidelines are thoroughly discussed, ranging from specifying software architecture elements and their behaviors, to the impact of software architecture on the job. Likewise, technical issues (such as documenting and utilizing software architectures) are discussed in detail. Volume 2: Product-Line Architectures The working title of the second-volume is "Product-Line Architectures". Software product lines are emerging as a new and important software development paradigm. A Product-Line Architecture (PLA) is a design for a family of related applications, and its motivation is to simplify the design and maintenance of program families and to address the needs of highly customizable applications in an economical manner. Companies are realizing that the practice of building sets of related systems from common assets can yield remarkable improvements in productivity, time to market, product quality and customer satisfaction. But these gains are only a part of the picture; organizational, technical and management issues are other factors that should be considered. Although there are encouraging research experiences with PLAs and some guidelines exist to help in the development process, some issues about component-based development in PLAs are still under study. The goal of this book is to examine the foundational concepts underlying product lines and address the essential activities developers should consider to apply a PLA to a number of lines of products. The book will include sections on: lessons learned in PLA-based development, architectural specification, tools and process for software development, core asset management, domain analysis, configuration management, evaluation methods, quality factors involved, implementation strategies, and many more. Volume 3: Component-Based Software Developments & Enterprise Frameworks The working title of the third-volume is "Component-Based Software Development and Enterprise Frameworks". Nowadays, software engineering is moving forward on an architecture-based development conception where systems are built by composing or assembling components that are often developed independently. The key to making a large variety of software products and reducing time to market is to build pieces of software where the development effort can serve in other products as well. Thus, large-grained components are becoming a practical part of an enterprise component strategy. Such generic components usually include interactions with other components, code, design models, design patterns and specifications. In addition, they must provide ways to be adaptable and customizable according with the client's needs. In this context, enterprise frameworks offer an appropriate base for waving the software architectures, components, and core requirements into one container that is adaptable, customizable, extensible, and reusable. The technology of component-based systems is quite well established, but it is not the same with the methods to develop them. The need of well-defined techniques, notations and architectural support is still pending. The book will cover all these issues. This book is intended to provide valuable, real world insight into successful development and/or adaptation of OO Enterprise Frameworks, by describing the problems with frameworks, explaining the issues related to the development and adaptation of enterprise frameworks, selecting the right methods and tools for building frameworks. The book will be derived from actual experiences, successes and failures, and is presented in a practical, easy to understand manner. This is information that readers can apply today. The key issues are: + What are the key enterprise-oriented framework issues? + How to develop enterprise frameworks and what are the framework design guidelines? + What kind of evolution does an Enterprise Framework undergo and how is it correlated with the enterprise life span? + How can the adaptation of OO enterprise framework be accomplished with minimum impact on the cost and schedule? + Understand make vs. buy decisions, selection guidelines, and how to select and adapt the right enterprise framework for the job. + Understand the implication of enterprise business requirements on the framework design. + How to use your large-scale enterprise framework and how to protect your investment. + How to deal with resource requirements, enterprise framework integration problems, framework reporting, and others. + What are the impacts of enterprise frameworks on the national and global economy? This volume helps organizations apply component-based technology effectively by citing examples from the real world. This book combines the actual experiences and lessons learned from developing and/or adapting component-based enterprise framework developments. Reviewers: Please e-mail your contact information and your area of interests to the lead author and editor. Authors: Please submit one electronic copy in RTF interchange or Microsoft Word document formats by August 1, 2000 or sooner to the lead author and editor: Dr. Mohamed E. Fayad J.D. Edwards Professor Computer Science & Engineering Dept., University of Nebraska, Lincoln 108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115 Ph: (402) 472-2615, Fax: (402) 472-7767 E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org URL: http://www.cse.unl.edu/~fayad Submissions: Submissions should be presented in a practical, easy to understand manner, providing information that readers can apply today. We seek original articles on specific practical and research issues related to software architectures, product-line architectures, component-based software developments and enterprise application frameworks. Chapters may be of any length, ranging from a few pages (2-3 pages or 1,200 words - sidebars) to a full treatment of substantial software architectures, components, or frameworks (ranging from 10 pages to say 40 pages or 25,000 words - Chapters), including illustrations. Submissions are peer-reviewed and are subject to editing for style, clarity, and space. We also encourage authors to submit supplement materials, such as documentation and portions of the detailed implementation of their frameworks or complete documentation or portions of the software architecture or product-line architecture. All submissions should identify a principal contact author by e-mail address and/or fax and/or telephone number and postal address. Please keep in mind that each volume will be the only complete work on this topic. We received excellent responses from most of the authors that we contacted for this project. We promise a high-quality and an extremely useful publication for the computer and software industries. Your chapter should have appendixes of annotated references, notation, process, and definitions. Each chapter will include the biographies of the authors. We will also ask you to perform a final review for two or three chapters, collect opinions from you related to the organization of each volume and keep you up-to-date about the progress of this project. If a chapter is accepted, the authors will be asked to provide the following sections: 1. Review questions, 2. Problem sets, and/or 3. Projects, and 4. Key solutions. We would like to finish the work related to this project in twelve to fifteen months. Currently, we have over 10 chapters for the first volume,10 papers for the second volume, and 5 papers for the third volume. All papers are under review. Questions regarding the suitability of a topic should be sent to: fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org If you are considering submitting a chapter, I would like to receive the following information immediately for starting the review process for your chapter: 1. The title of your chapter 2. The list of authors and their contact information 3. The abstract 4. The point of contact For further information about this series of books, please contact me at , , or For detailed author guidelines, check the following web site: www.cse.unl.edu/~fayad Book Projects From owner-reliable_computing [at] interval [dot] usl.edu Sun May 7 14:11:07 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id OAA13917 for reliable_computing-outgoing; Sun, 7 May 2000 14:11:07 -0500 (CDT) Received: from gauss.Mines.EDU (gauss.Mines.EDU [138.67.22.33]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id OAA13912 for ; Sun, 7 May 2000 14:11:04 -0500 (CDT) Received: (from xwu@localhost) by gauss.Mines.EDU (8.9.3/8.9.3) id NAA23057 for reliable_computing [at] interval [dot] usl.edu; Sun, 7 May 2000 13:06:54 -0600 (MDT) From: Xindong Wu Message-Id: <200005071906.NAA23057 [at] gauss [dot] Mines.EDU> Subject: Knowledge and Information Systems: Vol 2 No 2 (2000) To: reliable_computing [at] interval [dot] usl.edu Date: Sun, 7 May 100 13:06:54 -0600 (MDT) X-Mailer: ELM [version 2.4 PL25] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Knowledge and Information Systems: An International Journal ----------------------------------------------------------- ISSN 0219-1377 by Springer-Verlag Home Page: http://kais.mines.edu/~kais/ ======================================= Volume 2, Number 2 (May 2000): Table of Contents ------------------------------------------------ Regular Papers - A Mathematical Foundation for Improved Reduct Generation in Information Systems by Janusz Starzyk, Dale E. Nelson, and Kirk Sturtz - Fast Association Discovery in Derivative Transaction Collections by Li Shen, Hong Shen, Ling Cheng and Paul Pritchard - An Index Structure for Data Mining and Clustering by Xiong Wang, Jason T.L. Wang, King-Ip Lin, Dennis Shasha, Bruce A. Shapiro, and Kaizhong Zhang - Pattern Analysis and Analogy in Shogi: Predicting Shogi Moves from Prior Experience by Steven Walczak and Reijer Grimbergen - Comparison between Lamarckian and Darwinian Evolution on a Model using Neural Networks and GAs by Takahiro Sasaki and Mario Tokoro - Re-investigating Dempster's Idea on Evidence Combination by Weiru Liu and Jun Hong Short Papers - Pest Control Expert System for Tomato (PCEST) by EL-Sayed El-Azhary, Hesham A. Hassan, and A. Rafea From owner-reliable_computing [at] interval [dot] usl.edu Sun May 7 22:11:17 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id WAA14537 for reliable_computing-outgoing; Sun, 7 May 2000 22:11:17 -0500 (CDT) Received: from cse.unl.edu (root [at] cse [dot] unl.edu [129.93.33.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id WAA14532 for ; Sun, 7 May 2000 22:10:54 -0500 (CDT) Received: from localhost (fayad@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id VAA8975424; Sun, 7 May 2000 21:56:08 -0500 (CDT) Date: Sun, 7 May 2000 21:56:08 -0500 From: Mohamed Fayad To: Undisclosed recipients: ; Subject: CFCs - SW Arch., Components, and Frameworks Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Greetings, Apologies if you recieve multitple copies of this cfcs. Enclosed, please find a call for chapters and reviewers. Please post. Thank you. Cheers, M. Fayad ---------------------- 3-volume book on Software Architectures, Components, and Frameworks Call for Chapters and Reviewers Authors and Editors: Dr. Mohamed Fayad: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org, URL: http://www.cse.unl.edu/~fayad Dr. David Garlan: garlan [at] cs [dot] cmu.edu URL: http://www.cs.cmu.edu/~garlan Professor Wolfgang Pree: pree [at] acm [dot] org URL: www.informatik.uni-konstanz.de/swe We are developing three-volume series of books on software architectures, components, and frameworks. If this is your area of interest/research, I would like to invite you to submit a chapter. This series of books will serve as a complete reference set for academics and practitioners. Volume 1: Software Architectures The working title of the first-volume is "Software Architectures." Architecture-based software engineering research has yielded an impressive array of technologies and demonstrations over the past decade. Using an architecture-based approach, applications have been built which: - Are understandable - Are expected to evolve - Exhibit remarkable flexibility - Demonstrate significant reuse of off-the-shelf components - Leverage experience from related applications in the same problem domain - Are analyzable earlier in their development than ever before - Are key milestones in software managerial and development processes Currently, there is relatively little guidance for software developers on how to develop software architectures. This volume addresses several topics crucial to the state of the art and practice of software architecture. The book presents a complete reference on how to develop a good software architecture and provides guidelines for resolving key software architecture issues, such as evolving software architectures, leveraging existing investment in software architecture artifacts, representing architecture description languages, introducing formal models for software architectures, addressing architectural analysis techniques & development methods, transitioning from software architecture to coding and surveying architectural design tools and environments. In addition, the book will include sections on: accessing of software architectures, testing and validating software architectures, improving software architecture quality, documenting software architectures, and many more. This is a pragmatic book that is specifically designed to help organizations develop software architectures for real projects in the real world. Comprehensive technical and management guidelines are thoroughly discussed, ranging from specifying software architecture elements and their behaviors, to the impact of software architecture on the job. Likewise, technical issues (such as documenting and utilizing software architectures) are discussed in detail. Volume 2: Product-Line Architectures The working title of the second-volume is "Product-Line Architectures". Software product lines are emerging as a new and important software development paradigm. A Product-Line Architecture (PLA) is a design for a family of related applications, and its motivation is to simplify the design and maintenance of program families and to address the needs of highly customizable applications in an economical manner. Companies are realizing that the practice of building sets of related systems from common assets can yield remarkable improvements in productivity, time to market, product quality and customer satisfaction. But these gains are only a part of the picture; organizational, technical and management issues are other factors that should be considered. Although there are encouraging research experiences with PLAs and some guidelines exist to help in the development process, some issues about component-based development in PLAs are still under study. The goal of this book is to examine the foundational concepts underlying product lines and address the essential activities developers should consider to apply a PLA to a number of lines of products. The book will include sections on: lessons learned in PLA-based development, architectural specification, tools and process for software development, core asset management, domain analysis, configuration management, evaluation methods, quality factors involved, implementation strategies, and many more. Volume 3: Component-Based Software Developments & Enterprise Frameworks The working title of the third-volume is "Component-Based Software Development and Enterprise Frameworks". Nowadays, software engineering is moving forward on an architecture-based development conception where systems are built by composing or assembling components that are often developed independently. The key to making a large variety of software products and reducing time to market is to build pieces of software where the development effort can serve in other products as well. Thus, large-grained components are becoming a practical part of an enterprise component strategy. Such generic components usually include interactions with other components, code, design models, design patterns and specifications. In addition, they must provide ways to be adaptable and customizable according with the client's needs. In this context, enterprise frameworks offer an appropriate base for waving the software architectures, components, and core requirements into one container that is adaptable, customizable, extensible, and reusable. The technology of component-based systems is quite well established, but it is not the same with the methods to develop them. The need of well-defined techniques, notations and architectural support is still pending. The book will cover all these issues. This book is intended to provide valuable, real world insight into successful development and/or adaptation of OO Enterprise Frameworks, by describing the problems with frameworks, explaining the issues related to the development and adaptation of enterprise frameworks, selecting the right methods and tools for building frameworks. The book will be derived from actual experiences, successes and failures, and is presented in a practical, easy to understand manner. This is information that readers can apply today. The key issues are: + What are the key enterprise-oriented framework issues? + How to develop enterprise frameworks and what are the framework design guidelines? + What kind of evolution does an Enterprise Framework undergo and how is it correlated with the enterprise life span? + How can the adaptation of OO enterprise framework be accomplished with minimum impact on the cost and schedule? + Understand make vs. buy decisions, selection guidelines, and how to select and adapt the right enterprise framework for the job. + Understand the implication of enterprise business requirements on the framework design. + How to use your large-scale enterprise framework and how to protect your investment. + How to deal with resource requirements, enterprise framework integration problems, framework reporting, and others. + What are the impacts of enterprise frameworks on the national and global economy? This volume helps organizations apply component-based technology effectively by citing examples from the real world. This book combines the actual experiences and lessons learned from developing and/or adapting component-based enterprise framework developments. Reviewers: Please e-mail your contact information and your area of interests to the lead author and editor. Authors: Please submit one electronic copy in RTF interchange or Microsoft Word document formats by August 1, 2000 or sooner to the lead author and editor: Dr. Mohamed E. Fayad J.D. Edwards Professor Computer Science & Engineering Dept., University of Nebraska, Lincoln 108 Ferguson Hall, P.O. Box 880115, Lincoln, NE 68588-0115 Ph: (402) 472-2615, Fax: (402) 472-7767 E-mail: fayad [at] cse [dot] unl.edu, m.fayad [at] computer [dot] org, fayadm [at] acm [dot] org URL: http://www.cse.unl.edu/~fayad Submissions: Submissions should be presented in a practical, easy to understand manner, providing information that readers can apply today. We seek original articles on specific practical and research issues related to software architectures, product-line architectures, component-based software developments and enterprise application frameworks. Chapters may be of any length, ranging from a few pages (2-3 pages or 1,200 words - sidebars) to a full treatment of substantial software architectures, components, or frameworks (ranging from 10 pages to say 40 pages or 25,000 words - Chapters), including illustrations. Submissions are peer-reviewed and are subject to editing for style, clarity, and space. We also encourage authors to submit supplement materials, such as documentation and portions of the detailed implementation of their frameworks or complete documentation or portions of the software architecture or product-line architecture. All submissions should identify a principal contact author by e-mail address and/or fax and/or telephone number and postal address. Please keep in mind that each volume will be the only complete work on this topic. We received excellent responses from most of the authors that we contacted for this project. We promise a high-quality and an extremely useful publication for the computer and software industries. Your chapter should have appendixes of annotated references, notation, process, and definitions. Each chapter will include the biographies of the authors. We will also ask you to perform a final review for two or three chapters, collect opinions from you related to the organization of each volume and keep you up-to-date about the progress of this project. If a chapter is accepted, the authors will be asked to provide the following sections: 1. Review questions, 2. Problem sets, and/or 3. Projects, and 4. Key solutions. We would like to finish the work related to this project in twelve to fifteen months. Currently, we have over 10 chapters for the first volume,10 papers for the second volume, and 5 papers for the third volume. All papers are under review. Questions regarding the suitability of a topic should be sent to: fayad [at] cse [dot] un1.edu, garlan [at] cs [dot] cmu.edu, or pree [at] acm [dot] org If you are considering submitting a chapter, I would like to receive the following information immediately for starting the review process for your chapter: 1. The title of your chapter 2. The list of authors and their contact information 3. The abstract 4. The point of contact For further information about this series of books, please contact me at , , or For detailed author guidelines, check the following web site: www.cse.unl.edu/~fayad Book Projects From owner-reliable_computing [at] interval [dot] usl.edu Mon May 8 06:24:05 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id GAA16115 for reliable_computing-outgoing; Mon, 8 May 2000 06:24:05 -0500 (CDT) Received: from animal.cs.chalmers.se (animal.cs.chalmers.se [129.16.225.30]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id GAA16110 for ; Mon, 8 May 2000 06:24:01 -0500 (CDT) Received: from muppet70.cs.chalmers.se (muppet70.cs.chalmers.se [129.16.226.211]) by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id NAA14658; Mon, 8 May 2000 13:22:43 +0200 (MET DST) Received: from localhost (taha@localhost) by muppet70.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id NAA16689; Mon, 8 May 2000 13:22:44 +0200 (MET DST) X-Authentication-Warning: muppet70.cs.chalmers.se: taha owned process doing -bs Newsgroups: comp.lang.ml,comp.lang.functional,comp.compilers,comp.lang.scheme Date: Mon, 8 May 2000 13:22:37 +0200 (MET DST) From: Walid Taha Reply-To: saig [at] cs [dot] chalmers.se To: appsem [at] cs [dot] chalmers.se, concurrency [at] cwi [dot] nl, theorynt [at] listserv [dot] nodak.edu, types [at] cis [dot] upenn.edu, haskell [at] dcs [dot] gla.ac.uk, haskell [at] haskell [dot] org Subject: CFP: Workshop on Program Generation Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk [Reminder: Deadline in two weeks.] LAST CALL FOR PAPERS Semantics, Applications and Implementation of Program Generation (SAIG) ICFP Workshop, Montreal, September 20th, 2000. (Deadline: May 22, 2000) http://www.md.chalmers.se/~taha/saig/ Numerous recent studies investigate different aspects of program generation systems, including their semantics, their applications, and their implementation. Existing theories and systems address both high-level (source) language and low-level (machine) language generation. A number of programming languages now supports program generation and manipulation, with different goals, implementation techniques, and targeted at different applications. The goal of this workshop is to provide a meeting place for researchers and practitioners interested in this research area, and in program generation in general. Scope: The workshop solicits submissions related to one or more of the following topics: - Multi-level and multi-stage languages, staged computation, - Partial evaluation (of e.g. functional, logical, imperative programs), - Run-time specialization (in e.g. compilers, operating systems), - High-level program generation (applications, foundations, environments), - Symbolic computation, in-lining and macros, Submissions are especially welcome if they relate ideas and concepts from several topics, bridge the gap between theory and practice, cover new ground, or report exciting applications. The program committee will be happy to advise on the appropriateness of a particular subject. Distribution: Accepted papers will be published as a Chalmers technical report, and will be made available online. A special issue of the Journal of Higher Order and Symbolic Computation (HOSC) is planned afterwards. Format: The one-day workshop will contain slots for participants to present accepted papers. In addition, there will be time allocated for open discussions during the workshop. Invited speakers will be announced in the near future. Invited Speaker: Frank Pfenning, CMU Submission Details: Authors are invited to submit papers of at most 5000 words (excluding figures), in postscript format (letter or A4), to saig [at] cs [dot] chalmers.se by 22nd May 2000. Both position and technical papers are welcome. Please indicate at time of submission. Position papers are expected to describe ongoing work, future directions, and/or survey previous results. Technical papers are expected to contain novel results. All papers will be reviewed by the program committee for the above mentioned criteria, in addition to correctness and clarity. Authors will be notified of acceptance by 3 July 2000. Final version of the papers must be submitted by 31 July 2000. Program Committee: Cliff Click, Sun Micro Systems Rowan Davies, CMU Torben Mogensen, DIKU Suresh Jagannathan, NEC Research Tim Sheard, OGI Walid Taha, Chalmers (workshop chair) Peter Thiemann, Freiburg From owner-reliable_computing [at] interval [dot] usl.edu Wed May 10 08:50:13 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id IAA20995 for reliable_computing-outgoing; Wed, 10 May 2000 08:50:12 -0500 (CDT) Received: from kleene.math.wisc.edu (kleene.math.wisc.edu [144.92.166.90]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id IAA20989 for ; Wed, 10 May 2000 08:49:51 -0500 (CDT) Received: from bing.math.wisc.edu (bing.math.wisc.edu [144.92.166.133]) by kleene.math.wisc.edu (8.9.3/8.9.3) with SMTP id IAA25298; Wed, 10 May 2000 08:34:52 -0500 (CDT) Date: Wed, 10 May 2000 08:27:42 -0500 (CDT) From: Hans Schneider To: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu cc: LAA/IS special editors -- Patrick Dewilde , "prof. P.M. Dewilde" , Vadim Olshevsky , Sally + Hans -- Hans Schneider , Sally Rear , "Ali H. Sayed" Subject: LAA announcment Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net-organizer: Please circulate the attached LAA announcement over your net. best hans ------------------------------------------------------------------------------ Hans Schneider hans [at] math [dot] wisc.edu. Department of Mathematics 608-262-1402 (Work) Van Vleck Hall 608-271-7252 (Home) 480 Lincoln Drive 608-263-8891 (Work FAX) University of Wisconsin-Madison 608-271-8477 (Home FAX) Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) ------------------------------------------------------------------------------ Linear Algebra and its Applications Special Issue on STRUCTURED AND INFINITE SYSTEMS OF LINEAR EQUATIONS Deadline extension The scope of the 'Special Issue on 'Infinite Linear Systems of Equations finitely specified' with deadline June 1st has been slightly extended to include very large structured systems and methods that may lead to the treatment of infinite systems. There have already been submissions to the previously announced special issue which fit the extended scope. We wish to give all potential authors the chance to submit papers fitting the broader scope and are therefore extending the deadline for submission to August 31st. The new, slightly adapted description of the special session reads as follows: One of the traditional hunting grounds of linear algebra is the area of finite systems of linear equations, as described by a matrix equation $Ax = b$. Here $A$ is a known matrix, $b$ a known vector of finite dimensions, and $x$ is an unknown vector of finite dimensions, which is to be determined such that the equation is either satisfied, or, if that is not possible, approximately satisfied. Many techniques are known for finding solutions or approximate solutions, depending on the properties of the given data and the approximation technique choosen. If the system of equations is not finite, i.e. $A$ is not a matrix but an operator, and $b$ and $x$ are of infinite dimension, then algebraic and numerical techniques can still be used provided the given data are finitely specified. Operators with such a property are often called 'structured operators', and it turns out that one can solve such infinite equations in an exact or approximate sense using finite methods and algorithms. Also in the case of very large structured matrices, methods can be devised that are in principle extendable to the infinite case. The conjunction of linear algebra and inversion theory for finitely specified infinite operators brings interesting connections to the forefront: algebraic equivalents of inner-outer factorizations e.g., or the algebraic significance of Kalman filtering. Structured matrices can be of many types, e.g. systems with finite displacement ranks or time-varying systems with state spaces of finite dimensions and whose limiting behaviour is known, e.g. as a time invariant system. A non-limiting list of topics of interest in this area is (assuming $A$ is an infinite but finitely described operator of some kind): - inversion methods - decomposition methods for the operator A - quadratic approximation methods - complexity reduction - equivalencies - canonical forms - transform techniques. Examples of operator structure: - systems with low displacement rank - finitely described time-varying systems - finitely described almost-periodic systems - differentials of non-linear systems. Interested authors are kindly invited to submit full papers with significant contributions to this area to any of the three guest editors listed below before August 31st, 2000. Patrick Dewilde DIMES, Delft University of Technology POB 5031, 2600GA Delft, the Netherlands. Fax: +31 15 262 3271 email: dewilde [at] DIMES [dot] tudelft.nl Vadim Olshevsky Department of Mathematics and Computer Science Georgia State University University Plaza Atlanta, GA 30303, USA Fax: +1 404 651 2246 email: volshevsky [at] cs [dot] gsu.edu Ali Sayed Rm 44-123A Engr. IV Bldg Dept. of Electrical Engineering University of California Los Angeles, CA 90095-1594, USA Fax: +1 310 206 8495 email: sayed [at] biruni [dot] icsl.ucla.edu From owner-reliable_computing [at] interval [dot] usl.edu Wed May 10 10:43:11 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id KAA21426 for reliable_computing-outgoing; Wed, 10 May 2000 10:43:11 -0500 (CDT) Received: from biruni.icsl.ucla.edu (biruni.ICSL.UCLA.EDU [128.97.90.234]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id KAA21421 for ; Wed, 10 May 2000 10:43:07 -0500 (CDT) Received: from biruni.icsl.ucla.edu (localhost [127.0.0.1]) by biruni.icsl.ucla.edu (8.8.8/8.8.8) with ESMTP id IAA21195; Wed, 10 May 2000 08:37:04 -0700 (PDT) Message-ID: <3919821F.B1A58437 [at] biruni [dot] icsl.ucla.edu> Date: Wed, 10 May 2000 08:37:03 -0700 From: "Ali H. Sayed" Organization: UCLA X-Mailer: Mozilla 4.61 [en] (X11; I; IRIX 6.3 IP32) X-Accept-Language: en MIME-Version: 1.0 To: Hans Schneider CC: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu, LAA/IS special editors -- Patrick Dewilde , "prof. P.M. Dewilde" , Vadim Olshevsky , Sally Rear , "Ali H. Sayed" Subject: Re: LAA announcment References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk I forgot to say that the submission date (i.e., received by my) was March 20, 2000. Hans Schneider wrote: > > Dear Net-organizer: > > Please circulate the attached LAA announcement over your net. > > best > > hans > > ------------------------------------------------------------------------------ > Hans Schneider hans [at] math [dot] wisc.edu. > Department of Mathematics 608-262-1402 (Work) > Van Vleck Hall 608-271-7252 (Home) > 480 Lincoln Drive 608-263-8891 (Work FAX) > University of Wisconsin-Madison 608-271-8477 (Home FAX) > Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) > ------------------------------------------------------------------------------ > > Linear Algebra and its Applications > > Special Issue on > > STRUCTURED AND INFINITE SYSTEMS OF LINEAR EQUATIONS > > Deadline extension > > The scope of the 'Special Issue on 'Infinite Linear Systems > of Equations finitely specified' with deadline June 1st > has been slightly extended to include very large structured > systems and methods that may lead to the treatment of > infinite systems. There have already been submissions > to the previously announced special issue which > fit the extended scope. We wish to give all potential authors > the chance to submit papers fitting the broader scope and > are therefore extending the deadline for submission > to August 31st. The new, slightly adapted description of > the special session reads as follows: > > One of the traditional hunting grounds of linear algebra is > the area of finite systems of linear equations, as described by a > matrix equation $Ax = b$. Here $A$ is a known matrix, > $b$ a known vector of finite dimensions, and $x$ is an unknown > vector of finite dimensions, which is to be determined such > that the equation is either satisfied, or, if that is not possible, > approximately satisfied. Many techniques are known for finding solutions > or approximate solutions, depending on the properties of the > given data and the approximation technique choosen. > > If the system of equations is not finite, i.e. $A$ is not a matrix > but an operator, and $b$ and $x$ are of infinite dimension, then > algebraic and numerical techniques can still be used provided the > given data are finitely specified. Operators with such a property > are often called 'structured operators', and it turns out that > one can solve such infinite equations in an exact or approximate sense using > finite methods and algorithms. Also in the case of very large > structured matrices, methods can be devised that are in principle > extendable to the infinite case. > > The conjunction of linear algebra and inversion theory for finitely > specified infinite operators brings interesting connections to the > forefront: algebraic equivalents of inner-outer factorizations e.g., > or the algebraic significance of Kalman filtering. Structured matrices > can be of many types, e.g. systems with finite displacement ranks or > time-varying systems with state spaces of finite dimensions and whose > limiting behaviour is known, e.g. as a time invariant system. > > A non-limiting list of topics of interest in this area is (assuming > $A$ is an infinite but finitely described operator of some kind): > - inversion methods > - decomposition methods for the operator A > - quadratic approximation methods > - complexity reduction > - equivalencies > - canonical forms > - transform techniques. > > Examples of operator structure: > - systems with low displacement rank > - finitely described time-varying systems > - finitely described almost-periodic systems > - differentials of non-linear systems. > > Interested authors are kindly invited to submit full papers with > significant contributions to this area to any of the three > guest editors listed below before August 31st, 2000. > > Patrick Dewilde > DIMES, Delft University of Technology > POB 5031, > 2600GA Delft, the Netherlands. > Fax: +31 15 262 3271 > email: dewilde [at] DIMES [dot] tudelft.nl > > Vadim Olshevsky > Department of Mathematics and Computer Science > Georgia State University > University Plaza > Atlanta, GA 30303, USA > Fax: +1 404 651 2246 > email: volshevsky [at] cs [dot] gsu.edu > > Ali Sayed > Rm 44-123A Engr. IV Bldg > Dept. of Electrical Engineering > University of California > Los Angeles, CA 90095-1594, USA > Fax: +1 310 206 8495 > email: sayed [at] biruni [dot] icsl.ucla.edu -- _________________________________________________________ Ali H. Sayed Phone (310)267-2142 Electrical Engineering Dept. Fax (310)206-8495 University of California Email sayed [at] ee [dot] ucla.edu Los Angeles, CA 90095-1594 http://www.ee.ucla.edu/asl From owner-reliable_computing [at] interval [dot] usl.edu Wed May 10 12:10:50 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id MAA21825 for reliable_computing-outgoing; Wed, 10 May 2000 12:10:49 -0500 (CDT) Received: from biruni.icsl.ucla.edu (biruni.ICSL.UCLA.EDU [128.97.90.234]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id MAA21820 for ; Wed, 10 May 2000 12:10:46 -0500 (CDT) Received: from biruni.icsl.ucla.edu (localhost [127.0.0.1]) by biruni.icsl.ucla.edu (8.8.8/8.8.8) with ESMTP id JAA21328; Wed, 10 May 2000 09:30:26 -0700 (PDT) Message-ID: <39198EA1.CA4707B7 [at] biruni [dot] icsl.ucla.edu> Date: Wed, 10 May 2000 09:30:25 -0700 From: "Ali H. Sayed" Organization: UCLA X-Mailer: Mozilla 4.61 [en] (X11; I; IRIX 6.3 IP32) X-Accept-Language: en MIME-Version: 1.0 To: Hans Schneider CC: NETS -- at-net , "Hershkowitz, Danny -- Hershkowitz Daniel" , Danny Hershkowitz , E-LETTER , "na.digest" , ipnet-digest [at] math [dot] msu.edu, wim@bell-labs.com, hjt [at] eos [dot] ncsu.edu, vkm [at] eedsp [dot] gatech.edu, reliable_computing [at] interval [dot] louisiana.edu, LAA/IS special editors -- Patrick Dewilde , "prof. P.M. Dewilde" , Vadim Olshevsky , Sally Rear , "Ali H. Sayed" , na.digest@na-net.ornl.gov Subject: Re: LAA announcment References: Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear Net-Organizers: It seems that by mistake I copied a message to you all that was supposed to be sent only to Prof. Schneider and to Sally Rear. I simply replied to the wrong e-mail. My message was about the date of receipt of a manuscript, saying something like: "I forgot to say that the submission date (i.e., received by me) was March 20, 2000." Please ignore this message. Make sure it does not appear on your (automated) net anouncements! Please confirm. Thank you Ali H. Sayed Hans Schneider wrote: > > Dear Net-organizer: > > Please circulate the attached LAA announcement over your net. > > best > > hans > > ------------------------------------------------------------------------------ > Hans Schneider hans [at] math [dot] wisc.edu. > Department of Mathematics 608-262-1402 (Work) > Van Vleck Hall 608-271-7252 (Home) > 480 Lincoln Drive 608-263-8891 (Work FAX) > University of Wisconsin-Madison 608-271-8477 (Home FAX) > Madison WI 53706 USA http://www.math.wisc.edu/~hans (URL) > ------------------------------------------------------------------------------ > > Linear Algebra and its Applications > > Special Issue on > > STRUCTURED AND INFINITE SYSTEMS OF LINEAR EQUATIONS > > Deadline extension > > The scope of the 'Special Issue on 'Infinite Linear Systems > of Equations finitely specified' with deadline June 1st > has been slightly extended to include very large structured > systems and methods that may lead to the treatment of > infinite systems. There have already been submissions > to the previously announced special issue which > fit the extended scope. We wish to give all potential authors > the chance to submit papers fitting the broader scope and > are therefore extending the deadline for submission > to August 31st. The new, slightly adapted description of > the special session reads as follows: > > One of the traditional hunting grounds of linear algebra is > the area of finite systems of linear equations, as described by a > matrix equation $Ax = b$. Here $A$ is a known matrix, > $b$ a known vector of finite dimensions, and $x$ is an unknown > vector of finite dimensions, which is to be determined such > that the equation is either satisfied, or, if that is not possible, > approximately satisfied. Many techniques are known for finding solutions > or approximate solutions, depending on the properties of the > given data and the approximation technique choosen. > > If the system of equations is not finite, i.e. $A$ is not a matrix > but an operator, and $b$ and $x$ are of infinite dimension, then > algebraic and numerical techniques can still be used provided the > given data are finitely specified. Operators with such a property > are often called 'structured operators', and it turns out that > one can solve such infinite equations in an exact or approximate sense using > finite methods and algorithms. Also in the case of very large > structured matrices, methods can be devised that are in principle > extendable to the infinite case. > > The conjunction of linear algebra and inversion theory for finitely > specified infinite operators brings interesting connections to the > forefront: algebraic equivalents of inner-outer factorizations e.g., > or the algebraic significance of Kalman filtering. Structured matrices > can be of many types, e.g. systems with finite displacement ranks or > time-varying systems with state spaces of finite dimensions and whose > limiting behaviour is known, e.g. as a time invariant system. > > A non-limiting list of topics of interest in this area is (assuming > $A$ is an infinite but finitely described operator of some kind): > - inversion methods > - decomposition methods for the operator A > - quadratic approximation methods > - complexity reduction > - equivalencies > - canonical forms > - transform techniques. > > Examples of operator structure: > - systems with low displacement rank > - finitely described time-varying systems > - finitely described almost-periodic systems > - differentials of non-linear systems. > > Interested authors are kindly invited to submit full papers with > significant contributions to this area to any of the three > guest editors listed below before August 31st, 2000. > > Patrick Dewilde > DIMES, Delft University of Technology > POB 5031, > 2600GA Delft, the Netherlands. > Fax: +31 15 262 3271 > email: dewilde [at] DIMES [dot] tudelft.nl > > Vadim Olshevsky > Department of Mathematics and Computer Science > Georgia State University > University Plaza > Atlanta, GA 30303, USA > Fax: +1 404 651 2246 > email: volshevsky [at] cs [dot] gsu.edu > > Ali Sayed > Rm 44-123A Engr. IV Bldg > Dept. of Electrical Engineering > University of California > Los Angeles, CA 90095-1594, USA > Fax: +1 310 206 8495 > email: sayed [at] biruni [dot] icsl.ucla.edu -- _________________________________________________________ Ali H. Sayed Phone (310)267-2142 Electrical Engineering Dept. Fax (310)206-8495 University of California Email sayed [at] ee [dot] ucla.edu Los Angeles, CA 90095-1594 http://www.ee.ucla.edu/asl From owner-reliable_computing [at] interval [dot] usl.edu Fri May 12 00:29:26 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA25926 for reliable_computing-outgoing; Fri, 12 May 2000 00:29:26 -0500 (CDT) Received: from ness.arch.usyd.EDU.AU (ness.arch.usyd.EDU.AU [129.78.92.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA25921 for ; Fri, 12 May 2000 00:29:15 -0500 (CDT) Received: from kasanova.arch.usyd.edu.au (arch-096.arch.usyd.EDU.AU [129.78.92.196]) by ness.arch.usyd.EDU.AU (8.8.8/8.8.8) with SMTP id PAA03228 for ; Fri, 12 May 2000 15:29:10 +1000 (EST) Message-ID: <022b01bfbbd2$cc7e0380$c45c4e81 [at] kasanova [dot] arch.usyd.edu.au> From: "Simeon Simoff" To: Subject: Reminder: KDD2000 Workshop on Multimedia Data Mining (MDM/KDD2000) Date: Fri, 12 May 2000 15:27:42 +1000 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3612.1700 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3612.1700 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Gentle reminder - less than a week to the dealine ******************************************************** Workshop on Multimedia Data Mining (MDM/KDD2000) in conjunction with Sixth ACM SIGKDD International Conference on Knowledge Discovery & Data Mining August 20-23, 2000, Boston, MA, USA (KDD2000) IMPORTANT DATES - May 15 : Submissions Due - June 15 : Acceptance Notification - July 15 : Camera Ready Copy Due - August 20: Workshop Day For more information see the workshop web site: http://www.cs.ualberta.ca/~zaiane/mdm_kdd2000/ From owner-reliable_computing [at] interval [dot] usl.edu Sun May 14 11:00:26 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA02297 for reliable_computing-outgoing; Sun, 14 May 2000 11:00:25 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA02292 for ; Sun, 14 May 2000 11:00:21 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e4EG0FC18923 for ; Sun, 14 May 2000 10:00:16 -0600 (MDT) Message-Id: <200005141600.e4EG0FC18923 [at] cs [dot] utep.edu> Date: Sun, 14 May 2000 10:00:16 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Re: ISACA'2000: deadline extended To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: oyh3popBp4OvDedjEvdSVg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk X-Originating-IP: [134.96.50.58] From: "RAJENDRA AKERKAR" To: vladik [at] cs [dot] utep.edu Subject: Re: ISACA'2000 First call for papers Date: Sun, 14 May 2000 17:58:27 IST Mime-Version: 1.0 Please send this to your friends, colleauges, students. ----------------- Second call for papers: ISACA'2000 will be held in Goa,India from 3rd to 5th October 2000. The International Symposium on Applications of Computer Algebra (ISACA'2000) focus on actual or possible applications of computer algebra techniques to other fields and substantial interactions of computer algebra with other fields. You are invited to submit a proposal to organize a special session for this meeting and also invited to submit research papers for conference proceedings before June 15th, 2000. See http://tmrf.homepage.com/isaca.html for more information and registration. From owner-reliable_computing [at] interval [dot] usl.edu Tue May 16 13:42:50 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id NAA07858 for reliable_computing-outgoing; Tue, 16 May 2000 13:42:50 -0500 (CDT) Received: from pompeii.ise (troy.eiffel.com [198.68.147.5]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id NAA07853 for ; Tue, 16 May 2000 13:42:45 -0500 (CDT) Received: from lannion.ise ([10.0.10.105]) by pompeii.ise with smtp (Exim 3.02 #2) id 12rmJ4-00082i-00 for reliable_computing [at] interval [dot] usl.edu; Tue, 16 May 2000 11:43:02 -0700 Received: by lannion.ise (SMI-8.6/SMI-SVR4) id LAA17928; Tue, 16 May 2000 11:42:38 -0700 Date: Tue, 16 May 2000 11:42:38 -0700 Message-Id: <200005161842.LAA17928 [at] lannion [dot] ise> From: TOOLS Conferences Reply-to: info@tools-conferences.com To: reliable_computing [at] interval [dot] usl.edu Subject: TOOLS EUROPE & TOOLS USA Conference Programs Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The program of TOOLS EUROPE 2000 -- Mont Saint-Michel, 5-8 June and the program for TOOLS USA 2000 -- Santa Barbara, 30 July - 4 August, are available online: http://www.tools-conferences.com/europe http://www.tools-conferences.com/usa Both conferences have particularly attractive programs with the most prestigious keynote and tutorial speakers in the field. Both are held in stunning places. TOOLS is the major international conference series devoted to applications of object and component technology, with a commitment to excellence renewed by more than 30 sessions in the US, Europe, Australia and Asia. TOOLS Europe will be held in France from June 5 to June 8 in one of the world's heritage masterpieces, the Mont Saint-Michel abbey off the coast of Normandy and Brittany, an easy reach from Paris. The program (see http://tools-conferences.com/europe) includes: - Top keynotes by J. Coplien, B. Meyer, W. Pree, J. Daniels, I. Graham - 18 tutorials by leading experts in Enterprise Architecture, Patterns, Components, UML, Java, Embedded Software, and more... - 4 workshops, including J. Coplien's two day "Mastery of Patterns" workshop - 7 technical sessions by selected industry and academic presenters, architecture panel etc. - An exciting social program, with a cocktail diner at the famous "La Mere Poulard" restaurant, a visit of the of Mt St Michel Abbey, and a visit and banquet in St Malo. TOOLS USA will be the most exciting ever. The conference is sponsored by Microsoft and there will be a special track about Microsoft component technologies, with Clemens Szyperski and Jim Miller (Microsoft Research) as keynote speakers. Among the other highlights: - Keynotes also include Don Box, Martin Fowler, Kent Beck, Martin Griss and Bertrand Meyer. - Panels: Component-Based Development, with Clemens Szyperski Bertrand Meyer and other panelists, led by Roger Smith of Software Development magazine; the TOOLS language panel; Project Management panel led by Bill Duncan, former Director of Standards for the Project Management Institute (PMI); Software Technology for E-commerce panel led by Dennison Bollay, a pioneer in e-commerce technology ... - Workshops: Business Modeling; Refactoring; eXtreme Programming ... - Tutorials: the most impressive list ever, from eXtreme Programming to CORBA 3, Refactoring by Martin Fowler, Advanced Microsoft COM technologies, Idiomatic Java by Angelika Langer, Adding value to the Unified Process, JINI, Real-time critical systems, Mobile Agents systems, Use Case Patterns and many more (see http://tools-conferences.com/usa for more details). - over 25 technical contributions - Great social program in the gorgeous Santa Barbara area. We hope to see you at either or both conference. For any information please consult the Web pages or write to . From owner-reliable_computing [at] interval [dot] usl.edu Tue May 16 17:10:10 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id RAA08377 for reliable_computing-outgoing; Tue, 16 May 2000 17:10:10 -0500 (CDT) Received: from genie.eecs.lehigh.edu (genie.eecs.lehigh.edu [128.180.98.9]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id RAA08372 for ; Tue, 16 May 2000 17:10:06 -0500 (CDT) Received: (from majordom@localhost) by genie.eecs.lehigh.edu (8.8.5/8.8.5) id MAA08430 for asap-announce-outgoing; Tue, 16 May 2000 12:43:56 -0400 (EDT) X-Authentication-Warning: genie.eecs.lehigh.edu: majordom set sender to owner-asap-announce [at] majordomo [dot] eecs.lehigh.edu using -f From: ASAP User Date: Tue, 16 May 2000 12:43:51 -0400 (EDT) Message-Id: <200005161643.MAA29435 [at] pamir [dot] eecs.lehigh.edu> To: asap-announce [at] EECS [dot] Lehigh.EDU Subject: [ASAP] Conference Program for ASAP 2000 Cc: mschulte [at] EECS [dot] Lehigh.EDU Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk The program for the IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP 2000) is now available from the conference web page at: http://www.eecs.lehigh.edu/ASAP/ This year's program includes a rich set of topics and outstanding papers by distinguished authors. Topics covered include video and multimedia processors, reconfigurable computing, modeling and synthesis, cryptography, digital signal processing, computer arithmetic, multiprocessor systems, application-specific architectures, and design methodology. In addition to thirty-three contributed papers, the conference features a keynote address by Dr. William S. Song of MIT Lincoln Laboratory on "High-Performance Front-End Signal Processors for Adaptive Sensor Arrays". The conference web page also has links to (1) Conference Registration (2) Hotel/Travel Information (3) Airline Travel Information More information about each of these topics is given below. If you have any questions, please send email to asap [at] eecs [dot] lehigh.edu or mschulte [at] eecs [dot] lehigh.edu. We look forward to seeing you at ASAP 2000! Best regards, Mike Schulte ASAP 2000 Program Co-chair ----------------------------------------------------------------------- Conference Registration: Online conference registration for ASAP'2000 is available from https://secure.computer.org/conf/asap/register.htm Advance registration fees apply through 19 June 2000. After 19 June, late fees will apply. If you are unable to access the online registration, please send email to asap [at] eecs [dot] lehigh.edu, along with your FAX number, and we will send you a copy of the registration form. ----------------------------------------------------------------------- Hotel/Travel Information: ASAP'2000 will be held in the the Fairmont Copley Plaza Hotel, which is located at 138 St. James Avenue in Boston, Massachusetts. The hotel is about 30 minutes by taxi, car or shuttle from Boston's Logan International Airport. For conference attendees who are flying into Logan Airport, you can rent a car, take a taxi (about $25 each way), or take the Back Bay Coach Shuttle (about $7.50 each way). Additional information about the hotel, including a map and directions are available from: http://www.fairmont.com/Hotels/Index_B.html Room reservations should be made by calling 800-441-1414 or +1-617-267-5300. Attendees should reference IEEE Computer Society ASAP when making reservations. The cut-off date will be Friday, 9 June 2000 at 5:00 p.m. Eastern time. Reservations received after 9 June will be accepted by the Hotel on a space available basis at the conference rates. The Hotel confirms the following special rates for ASAP. Single/Double: $189 Suites: $389 These rates are exclusive of applicable sales/room tax, currently twelve point four five (12.45) percent, and are net non-commissionable. These special rates will apply at least three (3) days prior to and three (3) days after the Meeting dates based on availability to accommodate those who wish to extend their visits and these nights will be credited back to the room block. ----------------------------------------------------------------------- Airline Travel Information: Conference attendees who plan to fly to the conference may want to consider flying into the Logan International Airport, since it is about 30 minutes (by car) from the conference hotel. IEEE Computer Society is pleased to announce that it has been able to secure a special discount agreement with United Airlines unavailable to the general public. A 5% discount off the lowest applicable fare will be offered ONLY when you or your travel agent call United's toll-free number 1-800-521-4041 and refer to the Meeting ID Number 538IQ. A 10% discount off the unrestricted mid-week coach fares is available when purchased 7 days in advance. An additional 5% discount will apply when you purchase your tickets at least 60 days in advance of your travel date. Discounts apply on United, Shuttle by United, and United Express. Dedicated reservationists are on duty 7 days a week, 7:00am to 12:00 midnight Eastern time. Book early to take advantage of promotional fares that give you the greatest discount. Mileage Plus members receive full credit for all miles flown to this meeting. From owner-reliable_computing [at] interval [dot] usl.edu Wed May 17 00:04:00 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id AAA09279 for reliable_computing-outgoing; Wed, 17 May 2000 00:04:00 -0500 (CDT) Received: from into.nit.spb.ru (ns.nit.spb.ru [212.193.6.225]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id AAA09274 for ; Wed, 17 May 2000 00:03:54 -0500 (CDT) Received: from slava.UUCP (uucp@localhost) by into.nit.spb.ru (8.8.7/8.8.7) with UUCP id JAA29982 for reliable_computing [at] interval [dot] usl.edu; Wed, 17 May 2000 09:05:30 +0400 (MSD) (envelope-from slava.nit.spb.su!nest [at] slava [dot] nit.spb.su) Received: by slava.nit.spb.su (dMail for DOS v1.23, 15Jun94); Wed, 17 May 2000 08:57:32 +0400 To: reliable_computing [at] interval [dot] usl.edu Message-Id: Organization: Slava Nesterov Date: Wed, 17 May 2000 08:57:32 +0400 (MSD) Reply-To: nest [at] into [dot] nit.spb.su From: "Slava Nesterov" X-Mailer: dMail [Demos Mail for DOS v1.23] Subject: new schedule for 2001 Lines: 13 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Dear colleagues, I am glad to inform you that in accordance to new agreement with Kluwer Academic Publishers, beginning on 2001 issues of the journal RELIABLE COMPUTING will appear each 2 months (6 times per year). In particular, this means that now we are able to publish papers faster. I think, it is a good news for our community. The year page limit will be equal to 500 pages approximately. Sincerely yours, Slava Nesterov  From owner-reliable_computing [at] interval [dot] usl.edu Wed May 17 02:05:19 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id CAA09716 for reliable_computing-outgoing; Wed, 17 May 2000 02:05:19 -0500 (CDT) Received: from apollon.ito.ecei.tohoku.ac.jp (apollon.ito.ecei.tohoku.ac.jp [130.34.197.37]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id CAA09711 for ; Wed, 17 May 2000 02:04:52 -0500 (CDT) Received: from localhost (micrus [130.34.197.15]) by apollon.ito.ecei.tohoku.ac.jp (8.8.8/3.6W-) with ESMTP id QAA25837; Wed, 17 May 2000 16:05:24 +0900 (JST) To: haskell [at] haskell [dot] org, csl [at] dbai [dot] tuwien.ac.at, prolog-vendors [at] sics [dot] se, papm [at] dcs [dot] ed.ac.uk, clp [at] comp [dot] nus.edu.sg, amast [at] cs [dot] utwente.nl, ikbs [at] caad [dot] ed.ac.uk, fsdm [at] it [dot] uq.edu.au, rewrting@ens-lyon.fr, skeletons [at] dcs [dot] ed.ac.uk, lprolog [at] cis [dot] upenn.edu, lics [at] research [dot] bell-labs.com, idss [at] socs [dot] uts.edu.au, forum [at] jsoftware [dot] com, dss [at] cs [dot] auc.dk, erlang-questions [at] erlang [dot] org, brics-vip [at] daimi [dot] aau.dk, vdm-forum [at] mailbase [dot] ac.uk, nl-kr [at] cs [dot] rpi.edu, ecoopws [at] cui [dot] unige.ch, clean-list [at] cs [dot] kun.nl, reliable_computing [at] interval [dot] usl.edu, facs [at] lboro [dot] ac.uk, atp_alias [at] cs [dot] jcu.edu.au, prolog-pe [at] bach [dot] ces.cwru.edu, clp [at] cis [dot] ohio-state.edu, dantchev [at] brics [dot] dk, brimkov.as [at] mozart [dot] emu.edu.tr cc: miyakawa [at] ito [dot] ecei.tohoku.ac.jp Subject: IFIP TCS2000 X-Mailer: Mew version 1.94.1 on XEmacs 20.4 (Emerald) Mime-Version: 1.0 Content-Type: Text/Plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: <20000517160014S.miyakawa [at] ito [dot] ecei.tohoku.ac.jp> Date: Wed, 17 May 2000 16:00:14 +0900 From: Shinya MIYAKAWA X-Dispatcher: imput version 990905(IM130) Lines: 627 Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk [Apologies for multiple copies] IFIP TCS2000 PROGRAM AND REGISTRATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ -------------------------------------------------------------------------- IFIP International Conference on Theoretical Computer Science (IFIP TCS2000) --- Exploring New Frontiers of Theoretical Informatics --- August 17 - 19, 2000 Aoba Memorial Bldg., Tohoku University, Sendai, Japan Further Information about IFIP TCS2000 can be obtained on the Web, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Any inquiry on IFIP TCS2000 Program and Registration may be directed to TCS2000 [at] ito [dot] ecei.tohoku.ac.jp -------------------------------------------------------------------------- PRELIMINARY PROGRAM ^^^^^^^^^^^^^^^^^^^ [Outline] AUGUST 16: 15:00 Registration at Sendai Tokyu Hotel till 20:00 18:00 Welcome at Sendai Tokyu Hotel till 19:00 AUGUST 17: 9:30 Opening Session 10:00 Keynote Plenary Talk 1 ----------------------------------------- 11:10 - 17:30 TRACK (1) || TRACK (2) ----------------------------------------- AUGUST 18: 9:10 Keynote Plenary Talk 2 ----------------------------------------- 10:20 - 15:30 TRACK (1) || TRACK (2) ----------------------------------------- 15:50 Panel Discussion till 17:10 ----------------------------------------- 18:30 Banquet at Sendai Tokyu Hotel AUGUST 19: 9:10 Keynote Plenary Talk 3 ----------------------------------------- 10:20 - 14:20 TRACK (1) || TRACK (2) ----------------------------------------- 14:30 Closing Session till 14:40 ----------------------------------------- 15:00 Open Lectures till 17:00 ----------------------------------------- 18:30 Japanese Dinner Party till 20:00 ----------------------------------------- AUGUST 16 WEDNESDAY ^^^^^^^^^^^^^^^^^^^ 15:00 REGISTRATION at Sendai Tokyu Hotel till 20:00 18:00 WELCOME with light snack at Sendai Tokyu Hotel till 19:00 AUGUST 17 THURSDAY ^^^^^^^^^^^^^^^^^^ 9:30 OPENING SESSION Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) 10:00 KEYNOTE PLENARY TALK Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) Martin Abadi (Bell Labs, Lucent)*, Phillip Rogaway (UC Davis) (*: speaker) 10:50 Break [TRACK (1)] SESSION (1.1), 11:10 - 12:00 11:10 Approximation Algorithms for String Folding Problems Giancarlo Mauri, Giulio Pavesi 11:35 An Index for Two Dimensional String Matching Allowing Rotations Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen 12:00 Lunch Break SESSION (1.2), 13:30 - 14:20 13:30 Parallel Edge Coloring of a Tree on a Mesh Connected Computer Chang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi-Young Choi 13:55 Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs Ryuhei Uehara, Zhi-Zhong Chen 14:20 Break 14:40 TRACK (1) INVITED TALK It is on the Boundary: Complexity Considerations for Polynomial Ideals Ernst Mayr (TU Muenchen) 15:30 Break SESSION (1.3), 15:50 - 17:30 15:50 An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks Yoojin Chung, Kunsoo Park, Hyuk-Chul Kwon 16:15 Task Distributions on Multiprocessor Systems Evgeny V. Shchepin, Nodari N. Vakhania 16:40 Fast Interpolation using Kohonen Self-Organizing Neural Networks Olivier Sarzeaud, Yann Stephan 17:05 Steganography Using Modern Arts Carlo Blundo, Clemente Galdi 17:30 Break -----------// [TRACK (2)] SESSION (2.1), 11:10 - 12:00 11:10 Ambient Groups and Mobility Types Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon 11:35 An Asynchronous, Distributed Implementation of Mobile Ambients Cedric Fournet, Jean-Jacques Levy, Alan Schmitt 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness Naoki Kobayashi (U. Tokyo) 14:20 Break SESSION (2.2), 14:40 - 15:30 14:40 Local pi-Calculus at Work: Mobile Objects as Mobile Processes Massimo Merro, Josva Kleist, Uwe Nestmann 15:05 An Interpretation of Typed Concurrent Objects in the Blue Calculus Silvano Dal Zilio 15:30 Break SESSION (2.3), 15:50 - 17:30 15:50 A Higher-Order Specification of the pi-Calculus Joelle Despeyroux 16:15 Open Ended Systems, Dynamic Bisimulation, and Tile Logic Roberto Bruni, Ugo Montanari, Vladimiro Sassone 16:40 Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems Marcelo P. Fiore 17:05 On the Complexity of Bisimulation Problems for Pushdown Automata Richard Mayr 17:30 Break AUGUST 18 FRIDAY ^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK Theory and Construction of Molecular Computers Masami Hagiya (U. Tokyo) 10:00 Break [TRACK (1)] SESSION (1.4), 10:20 - 12:00 10:20 Trade-offs between Density and Robustness in Random Interconnection Graphs P. Flajolet, K. Hatzis, S. Nikoletseas, P. Spirakis 10:45 The ($\sigma$+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph Satoshi Taoka, Toshimasa Watababe 11:10 On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem Sounaka Mishra, Kripasindhu Sikdar 11:35 Maximum Clique and Minimum Clique Partition in Visibility Graphs Stephan Eidenbenz, Christoph Stamm 12:00 Lunch Break SESSION (1.5), 13:30 - 14:20 13:30 Real-Time Language Recognition by Alternating Cellular Automata Thomas Buchholz, Andreas Klein, Martin Kutrib 13:55 Damage Spreading and $\mu$-Sensitivity on Cellular Automata Bruno Martin 14:20 Break 14:40 TRACK (1) INVITED TALK Discrepancy Theory and its Applications to Finance Shu Tezuka (IBM Tokyo Research Lab) 15:30 Break -----------// [TRACK (2)] SESSION (2.4), 10:20 - 12:00 10:20 A Type-theoretic Study on Partial Continuations Yukiyoshi Kameyama 10:45 Partially Typed Terms between Church-Style and Curry-Style Ken-etsu Fujita, Aleksy Schubert 11:10 Alternating Automata and Logics over Infinite Words Christof Loeding, Wolfgang Thomas 11:35 Hypothesis Support for Information Integration in Four-Valued Logics Yann Loyer, Nicolas Spyratos, Daniel Stamate 12:00 Lunch Break 13:30 TRACK (2) INVITED TALK Masaccio: A Formal Model for Embedded Components Thomas A. Henzinger (UC Berkeley) 14:20 Break SESSION (2.5), 14:40 - 15:30 14:40 A Single Complete Refinement Rule for Demonic Specifications Karl Lermer, Paul Strooper 15:05 Reasoning about Composition using Property Transformers and their Conjugates Michel Charpentier, K. Mani Chandy 15:30 Break ----------------------- 15:50 PANEL DISCUSSION on "New Challenges for TCS" Panelists: Giorgio Ausiello (U. Roma "La Sapienza") Jozef Gruska (Masaryk U.) Ugo Montanari (U. Pisa) Takao Nishizeki (Tohoku U.) Yoshihito Toyama (Tohoku U.) Jiri Wiedermann (Inst. Informatics, Prague) 17:10 Break 18:30 BANQUET at Sendai Tokyu Hotel till 20:45 BANQUET SPEECH Non-Random Thoughts about Randomization Michael O. Rabin (Harvard U.) AUGUST 19 SATURDAY ^^^^^^^^^^^^^^^^^^ 9:10 KEYNOTE PLENARY TALK List Decoding: Algorithms and Applications Madhu Sudan (MIT) 10:00 Break [TRACK (1)] SESSION (1.6), 10:20 - 12:00 10:20 Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits Endre Boros, Toshihide Ibaraki, Kazuhisa Makino 10:45 Characterization of Optimal Key Set Protocols Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki 11:10 On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model Valentin E. Brimkov, Stefan S. Dantchev 11:35 On Logarithmic Simulated Annealing A. Albrecht, C. K. Wong 12:00 Lunch Break 13:30 TRACK (1) INVITED TALK Hierarchical State Machines Mihalis Yannakakis (Bell Labs, Lucent) 14:20 Break -----------// [TRACK (2)] 10:20 TRACK (2) INVITED TALK Some New Directions in the Syntax and Semantics of Formal Languages Gordon D. Plotkin (Edinburgh U.) 11:10 Break 11:20 DEMO SESSION (1) on Verification Tools 12:00 Lunch Break 13:30 DEMO SESSION (2) on Verification Tools 14:20 Break ------------------------ 14:30 CLOSING SESSION till 14:40 Giorgio Ausiello (TC1 Chair and IFIP TCS2000 Co-Chair) Takayasu Ito (IFIP TCS2000 Co-Chair) ------------------------ [OPEN LECTURES] 15:00 On the Power of Interactive Computing Jan van Leeuwen (U. Utrecht)*, Jiri Wiedermann (Acad. Sciences, Czech) (*: speaker) 16:00 The Varieties of Programming Language Semantics Peter D. Mosses (U. Aarhus) 17:00 Break ------------------------ 18:30 JAPANESE DINNER PARTY till 20:00 ========================================================================== GENERAL INFORMATION ^^^^^^^^^^^^^^^^^^^ IFIP TCS2000 is the first International Conference on Theoretical Computer Science organized by IFIP TC1 on Foundations of Computer Science, and it consists of two tracks: TRACK (1) on Algorithms, Complexity and Models of Computation, and TRACK (2) on Logic, Semantics, Specification, and Verification. The conference proceedings will be published as a volume of Lecture Notes in Computer Science, Springer-Verlag. IFIP TCS2000 will be held on the campus of Tohoku University, Sendai, Japan. The invited talks and contributed talks will be presented at the Aoba Memorial Building and Engineering Conference Hall, Faculty of Engineering located on the Aoba Hill about 3 km west of downtown Sendai. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel, located at downtown Sendai. Please, register and make reservations by returning the completed form by email and fax, following the instructions below. There will also be on-site registration at: * Sendai Tokyu Hotel, 15:00 - 20:00, August 16 * Aoba Memorial Bldg., Tohoku Univ., 9:00 - 17:00 on August 17 - 19. Transportation Conference participants arriving at the new Tokyo International (Narita) Airport are advised to take the JR Narita Express train from Narita Airport to Tokyo Station. Then, take the Yamabiko super express train of Tohoku Shinkansen (Tohoku Bullet Train) to Sendai from Tokyo Station. The Yamabiko runs every 20 - 30 min. and takes about 2 hours from Tokyo to Sendai. Making reservation at Narita Station for the Yamabiko is recommended, since it will be the summer tourist season. Those arriving at the new Osaka International Airport (Kansai Airport) can fly to Sendai Airport, and take Limousine Bus service to Sendai Station. The bus takes about 30 min. to go from the Airport to Sendai Station. You can also take a shuttle bus service from Kansai Airport to the Osaka-Itami Airport to fly from there to Sendai Airport. Alternatively, you can take a local train from the Kansai Airport to JR Shin Osaka Station, then take the Tokaido Shinkansen from Osaka to Tokyo Station and change at Tokyo Station to Tohoku Shinkansen. Some details on transportation will be available on the TCS2000 Web page, at http://tcs2000.ito.ecei.tohoku.ac.jp/tcs2000/ Note: (1) In Japan, mid-August is the busiest tourist time during summer, including domestic and international flights. (2) No flight service is available from Narita to Sendai Airport, since the train service is convenient. There is another train service from Narita Airport to downtown Tokyo (Ueno) by Skyliner of the Keisei-Narita Line. At Ueno you can take the Yamabiko super express of Tohoku Shinkansen to Sendai, but you have to walk about 10 min. from Keisei-Ueno Station to JR Ueno Station to take Tohoku Shinkansen. (3) If you are going to travel in Japan by JR lines before/after the IFIP TCS2000 conference, it will be convenient and economical to get a JR PASS before your departure. Contact your travel agent for more information on JR PASS (Japan Rail Pass). Hotels Two hotels are arranged to offer special discount rates to IFIP TCS2000 participants: Sendai Tokyu Hotel and Sendai Washington Hotel. They are 1.2 km west of Sendai Station and about 800 Yen by taxi from the station. These hotels are located within 5 min. walk from each other. The conference welcome reception and banquet will be held at Sendai Tokyu Hotel. Sendai and Climate Sendai is the largest city in the northern part of the Honshu Island of Japan, with a population of about a million. The City is known in Japan as "City of Trees". Sendai is a modern, safe city with a temperate climate blessed by four distinct seasons; even in mid August it is quite seldom that the highest temperature exceeds 30 C (86 F). Usually, the weather in mid August would be mostly sunny with temperatures ranging from 20 C (68 F) to 30 C (86 F), and rain, if any, would rarely be heavy. Note: Average temperatures in August at Sendai, Tokyo and Osaka are about 23.5 C, 26.5 C and 27.5, respectively. REGISTRATION AND RESERVATION INFORMATION ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ REGISTRATION FEES Registration fees cover attendance in all sessions, a copy of the proceedings, refreshments, the welcome reception and banquet, but not the Japanese dinner party on August 19. The reduced author rate applies to all authors of the accepted papers, and the reduced committee member rate applies to all TC1 members and to all members of the Program Committee and the Organizing Committee. The student rate applies to full time students. Registrants paying reduced rates have full privileges at the conference. The companion rate covers the reception and banquet only. Through July 1st, 2000 From July 2nd, 2000 Regular 40,000 Yen 50,000 Yen Author 30,000 Yen 40,000 Yen Committee Member 30,000 Yen 40,000 Yen Student 25,000 Yen 30,000 Yen Companion 5,000 Yen 7,000 Yen HOTELS Two convenient Western Style hotels offer special IFIP TCS2000 discount rates. Rates are per person, per night, and include service charge and tax (not including breakfast). Single Room Twin Room Sendai Tokyu Hotel 10,500 Yen 8,400 Yen Sendai Washington Hotel II 8,400 Yen 7,350 Yen Sendai Washington Hotel I 7,350 Yen --------- Note: Twin room reservations are available for two persons. No roommate matching service is available, so that twin room reservations remain the registrant's responsibility. JAPANESE DINNER PARTY A Japanese dinner party for participants from abroad will be arranged at SHOZANKAN in the evening of August 19. The invited speakers, some Steering Committee members, PC members and conference organizers will attend. A limited number of reservations will be available for this dinner party. The rates are as follows. Conference registrant: 10,000 Yen Companion: 7,000 Yen ============================================================================= Cut here to send your registration form after filling in the required items. ============================================================================= IFIP TCS2000 REGISTRATION AND RESERVATION FORM ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Please register and make reservations by completing the form below and returning it by email to tcs02 [at] thk [dot] jtb.co.jp Registrants are advised to email a copy of their completed form to TCS2000 [at] ito [dot] ecei.tohoku.ac.jp They are also encouraged to send a signed, printed copy of their completed form by fax to 022-262-5002 (domestic) +81-22-262-5002 (from abroad) which is the fax number of the following agent to take care of the conference registration and reservation. JTB (Japan Travel Bureau) Tohoku Communications Inc. Kotsukosha Bldg 3F, 3-6-Chuo Aoba-Ku, Sendai 980-0021, Japan (Fax) 022-262-5002 (domestic) +81-22-262-5002 (from abroad) (Phone) 022-262-5055 (domestic) +81-22-262-5055 (from abroad) (Email) tcs02 [at] thk [dot] jtb.co.jp Registration and reservations will be completed by your payment, whose method is described below. IMPORTANT NOTE: As described below, from the standpoint of the safety, registrants are advised to pay fees by Bank Transfer. When the payment is made by a credit card, they are advised to send the required information including Credit Card numbers by FAX; that is, do NOT send Credit Card numbers by email. REGISTRATION FOR IFIP TCS2000 ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Last (Family) Name: First (Given) Name: Middle: Affiliation: Postal Address: City/State/Zip: Country: Phone: Fax: Email: Registration Status : Number of Companions: Companions' names (if applicable): (A) Total Registration Fee(s) in Yen: HOTEL RESERVATION Hotel First Choice: Hotel Second Choice: Number of Single Room(s): Number of Twin Room(s): Roommate's Name(s) for Twin Room(s): Check-in Date: Check-out Date: Number of Nights: Special Room or other Request: JAPANESE DINNER PARTY A limited number of reservations are available for the Japanese dinner party at SHOZANKAN on August 19 to be arranged for participants from abroad. (B) 10,000 Yen x [ ] conference registrant(s): (C) 7,000 Yen x [ ] companion(s): TOTAL FEE IN YEN (A) + (B) + (C): Signature (not needed for email): METHOD OF PAYMENT FOR IFIP TCS2000 From the standpoint of the safety and security, participants are encouraged to pay via Bank Transfer. When they pay via credit card, they are advised to send the required information (in particular, Credit Card numbers) by FAX; that is, do NOT send your Credit Card numbers by email. In credit card payment Visa card, MasterCard, and Diners card will be accepted. Personal checks cannot be accepted. All payments must be made in Japanese Yen. Indicate method of payment below: [ ] Bank Transfer to Bank: Tokyo Mitsubishi Bank, Sendai Branch Account Name: IFIP TCS2000 Chair Takayasu Ito Account No. 1108671 From : Date of transfer: Payer's name: Note: In Japan the bank number of Tokyo Mitsubishi Bank is 0005, and the number of its Sendai Branch is 320. [ ] Payment by Credit Card Credit Card Type : Card Number: Expiration Date: Signature (not needed for email): : When your payment is via Credit Card, send the above information by FAX to +81-22-262-5002, the fax no. of JTB Communications Inc. Even when you send the above form by fax, send it by EMAIL without filling in Credit Card number for safety. ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Registration and reservations will be confirmed upon receipt of payment. Refunds will be made upon written request received through July 31st, 2000 by JTB Tohoku Communications Inc. From owner-reliable_computing [at] interval [dot] usl.edu Wed May 17 11:37:09 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA11538 for reliable_computing-outgoing; Wed, 17 May 2000 11:37:09 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA11533 for ; Wed, 17 May 2000 11:37:04 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e4HGatr00313 for ; Wed, 17 May 2000 10:36:55 -0600 (MDT) Message-Id: <200005171636.e4HGatr00313 [at] cs [dot] utep.edu> Date: Wed, 17 May 2000 10:36:56 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Forte Developer 6 is LIVE! (Fwd) To: reliable_computing [at] interval [dot] usl.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: XHAxUYS4caWIjgbbzUUd3A== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------- Begin Forwarded Message ------------- Date: Wed, 17 May 2000 08:40:12 -0700 (PDT) From: William Walster Subject: Forte Developer 6 is LIVE! (Fwd) Dear members of "The Interval Community." Many people have contributed to this event. Special thanks to: Ray Moore Eldon Hansen George Corliss Baker Kearfott Mike Schulte Wolfgang Walter Dmitri Chiriaev Please see ==>, below. Please send comments, and suggestions for improvement to the interval email alias that has been established for this purpose. Spread the word! Best regards, Bill Walster ------------------- The Forte Developer 6/Sun WorkShop 6 suite of products has been released today electronically, with the physical release following the end of this week. The release makes available a suite of products: Forte C 6 Forte C++ Personal Edition 6 Forte C++ Enterprise Edition 6 Forte TeamWare 6 Forte Fortran Desktop Edition 6 Forte for High Performance Computing 6 Forte University Edition 6 Go to the following url to find information about these products. Note, Forte Developer 6 products are available for eTry/eBuy on the SunStore and the Download Center. http://www.sun.com/forte/ Here is a summary of what's new in Forte Developer 6: - Additional ANSI/ISO C++ compliance - Fortran 95 compiler with OpenMP parallelization directives - Support for the UltraSPARCTM III instruction set architecture - Easier-to-use programming environment - New Performance Analysis tool ==> - Fortran 95 interval arithmetic - Installation improvements - Manuals, man pages, READMEs, and online help in HTML ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Wed May 17 11:40:01 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA11639 for reliable_computing-outgoing; Wed, 17 May 2000 11:40:00 -0500 (CDT) Received: from cs.utep.edu (mail.cs.utep.edu [129.108.5.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA11628 for ; Wed, 17 May 2000 11:39:54 -0500 (CDT) Received: from earth (earth [129.108.5.21]) by cs.utep.edu (8.10.1/8.10.1) with SMTP id e4HGdg300346 for ; Wed, 17 May 2000 10:39:48 -0600 (MDT) Message-Id: <200005171639.e4HGdg300346 [at] cs [dot] utep.edu> Date: Wed, 17 May 2000 10:39:43 -0600 (MDT) From: Vladik Kreinovich Reply-To: Vladik Kreinovich Subject: Forte Developer 6 is LIVE! (Fwd) To: reliable_computing [at] interval [dot] louisiana.edu MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: WPwXPPdv0ncdv78GSVRctw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4 SunOS 5.7 sun4u sparc Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------- Begin Forwarded Message ------------- Date: Wed, 17 May 2000 08:40:12 -0700 (PDT) From: William Walster Dear members of "The Interval Community." Many people have contributed to this event. Special thanks to: Ray Moore Eldon Hansen George Corliss Baker Kearfott Mike Schulte Wolfgang Walter Dmitri Chiriaev Please see ==>, below. Please send comments, and suggestions for improvement to the interval email alias that has been established for this purpose. Spread the word! Best regards, Bill Walster ------------------- The Forte Developer 6/Sun WorkShop 6 suite of products has been released today electronically, with the physical release following the end of this week. The release makes available a suite of products: Forte C 6 Forte C++ Personal Edition 6 Forte C++ Enterprise Edition 6 Forte TeamWare 6 Forte Fortran Desktop Edition 6 Forte for High Performance Computing 6 Forte University Edition 6 Go to the following url to find information about these products. Note, Forte Developer 6 products are available for eTry/eBuy on the SunStore and the Download Center. http://www.sun.com/forte/ Here is a summary of what's new in Forte Developer 6: - Additional ANSI/ISO C++ compliance - Fortran 95 compiler with OpenMP parallelization directives - Support for the UltraSPARCTM III instruction set architecture - Easier-to-use programming environment - New Performance Analysis tool ==> - Fortran 95 interval arithmetic - Installation improvements - Manuals, man pages, READMEs, and online help in HTML ------------- End Forwarded Message ------------- From owner-reliable_computing [at] interval [dot] usl.edu Fri May 19 07:15:31 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA02267 for reliable_computing-outgoing; Fri, 19 May 2000 07:15:30 -0500 (CDT) Received: from desh.cse.iitd.ernet.in (mailer.cse.iitd.ac.in [202.141.68.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA02262 for ; Fri, 19 May 2000 07:15:09 -0500 (CDT) Received: from cse.iitd.ernet.in (root [at] sanjiva [dot] cse.iitd.ernet.in [10.20.2.48]) by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id RAA22161; Fri, 19 May 2000 17:37:33 +0530 Received: (from sanjiva@localhost) by cse.iitd.ernet.in (8.9.3/8.9.3) id IAA07183; Sat, 20 May 2000 08:15:05 +0530 Date: Sat, 20 May 2000 08:15:05 +0530 Message-Id: <200005200245.IAA07183 [at] cse [dot] iitd.ernet.in> X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva [at] sanjiva [dot] cse.iitd.ernet.in using -f From: Sanjiva Prasad To: skapoor [at] cse [dot] iitd.ernet.in Subject: FSTTCS 2000: revised Call for Papers Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk --text follows this line-- *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** New: Electronic Submission Guidelines Revised list of Invited Speakers ********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Tentatively planned satellite events include include two workshops: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - -------------------- Electronic submission is very strongly encouraged. You may submit your paper using Rich Gerber's system START by visiting the URL for the conference and following the appropriate links. The URL for submissions is http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html In case you ar eunable to submit using START, self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20 [at] cse [dot] iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Martin Groetschel (ZIB) Jose Meseguer (SRI) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Agrawal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Madhavan Mukund (CMI, Chennai) Gopalan Nadathur (Loyola) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandu Rangan (IIT, Chennai) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajagopalan (IBM, Almaden) Abhiram Ranade (IIT, Mumbai) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organizing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20 [at] cse [dot] iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva [at] cse [dot] iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva From owner-reliable_computing [at] interval [dot] usl.edu Mon May 22 07:09:05 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA06370 for reliable_computing-outgoing; Mon, 22 May 2000 07:09:05 -0500 (CDT) Received: from mailhost.uni-koblenz.de (mailhost.uni-koblenz.de [141.26.64.1]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA06365 for ; Mon, 22 May 2000 07:09:00 -0500 (CDT) Received: from nostromo.uni-koblenz.de.uni-koblenz.de (peter [at] nostromo [dot] uni-koblenz.de [141.26.66.122]) by mailhost.uni-koblenz.de (8.9.3/8.9.3) with SMTP id OAA23918; Mon, 22 May 2000 14:02:20 +0200 (MET DST) From: Peter Baumgartner MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Message-ID: <14633.8642.599242.823009 [at] nostromo [dot] uni-koblenz.de> Date: Mon, 22 May 2000 14:02:10 +0200 (CEST) Subject: FTP 2000 and TABLEAUX 2000 - Call for Participation X-Mailer: VM 6.75 under 21.1 (patch 8) "Bryce Canyon" XEmacs Lucid Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk ------------------------------------------------------------------------- FTP 2000 and TABLEAUX 2000 Call for Participation University of St Andrews St Andrews, Scotland July 3-7, 2000 FTP 2000: http://www.uni-koblenz.de/ftp00/ TABLEAUX 2000: http://www-theory.dcs.st-and.ac.uk/~rd/tab2000/ --------------------------------------------------------------------- Contents: 1 - Scope 2 - Registration 3 - Contact 4 - Technical Program (including list of accepted contributions) --------------------------------------------------------------------- 1 - Scope FTP 2000 (First-Order Theorem Proving), July 3-5, is the third in a series of workshops intended to focus effort on First-Order Theorem Proving as a core theme of Automated Deduction, and to provide a forum for presentation of very recent work and discussion of research in progress. TABLEAUX 2000, July 4-7, is a continuation of international meetings on Automated Reasoning with Analytic Tableaux and Related Methods held since 1992. The conference brings together researchers interested in all aspects - theoretical foundations, implementation techniques, systems development and applications - of the mechanization of reasoning with tableaux and related methods. FTP 2000 is held in conjunction with TABLEAUX 2000. The FTP 2000 and TABLEAUX 2000 sessions will be partly in series, partly shared and partly in parallel. --------------------------------------------------------------------- 2 - Registration To register for FTP 2000 and/or TABLEAUX 2000 please use the online registration form at http://www.dcs.st-and.ac.uk/~tab2000/register.html Joint registration at reduced rate is possible. Early registration ends at May, 31. --------------------------------------------------------------------- 3 - Contact FTP 2000 related: ftp00 [at] cs [dot] uiowa.edu TABLEAUX 2000 related: rd [at] dcs [dot] st-and.ac.uk Local Organisation: rd [at] dcs [dot] st-and.ac.uk --------------------------------------------------------------------- 4 - Technical Program FTP 2000 and TABLEAUX 2000 schedule: http://www.dcs.st-and.ac.uk/~tab2000/schedule.html Invited Talks ------------- FTP 2000 TABLEAUX 2000 -------- ------------- David Crocker Melvin Fitting (CUNY) (Intelligent Micro Modality and Databases Software Ltd) First Order Theorem Proving in Software Verification Deepak Kapur (New Mexico) Alasdair Urquhart (Toronto) 'Hardware Verification' Local Symmetries in (exact title to be announced) Propositional Logic Franz Baader (Aachen) (Joint invited speaker) Tableau Algorithms for Description Logics FTP 2000 accepted contributions: -------------------------------- J. Avenhaus, T. Hillenbrand, B. Loechner On Using Ground Joinable Equations in Equational Theorem Proving Johan Belinfante The Unifying Concept of Subvariance Domenico Cantone The decision problem in graph theory with reachability related constructs Michael Dierkes Defining a Unique Herbrand Model for Sets of Guarded Clauses Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt Hyperresolution for Guarded Formulae Martin Giese A First-Order Simplification Rule with Constraints Koji Iwanuma, Katsumi Inoue, Ken Satoh Completeness of Pruning Methods for Consequence Finding Procedure SOL James J. Lu, Jeffrey S. Rosenthal, Andrew Shaffer Crossword Puzzles: A Case Study in Compute-Intensive Meta-Reasoning Nicolas Peltier Combining Resolution and Enumeration for Finite Model Building Reinhard Pichler Equational Problems over a Finite Domain Regimantas Pliuskevicius On \omega­decidability for a restricted FTL with Unless J.-L. Ruiz-Reina, J.-A. Alonso, M.-J. Hidalgo, F. Martin A mechanical proof of Knuth-Bendix critical pair theorem (using ACL2) Nicolas Peltier Model Building with Ordered Resolution Cesare Tinelli Cooperation of Background Reasoners in Theory Reasoning by Residue Sharing Bernhard Gramlich Extending First-Order Unification by Tractable Second-Order Features Kahlil Hodgson, John Slaney Semantic Guidance for Saturation­Based Theorem Proving Bernhard Beckert Depth­first Proof Search without Backtracking for Free Variable Clausal Tableaux Jens Otten, Wolfgang Bibel leanCoP: Lean Connection­Based Theorem Proving (system description) Position Papers Chris Fermueller Automated Model Building for Non-Classical Logics Martin Giese Proof Search without Backtracking using Instance Streams Markus Moschner Towards Finite Model Building for Propositional Gödel-Logics TABLEAUX 2000 accepted contributions ------------------------------------ Comparison of Theorem Provers for non-classical logics: Fabio Massacci and Francesco M. Donini Design and results of TANCS-2000 non-classical (modal) systems comparison Volker Haarslev and Ralf Möller Consistency testing: the RACE experience Ian Horrocks Benchmark analysis with FaCT Ullrich Hustadt and Renate Schmidt MSPASS Modal reasoning by translation and first-order resolution Peter F. Patel-Schneider TANCS-2000 results for DLP Armando Tacchella Evaluating *SAT on TANCS 2000 benchmarks Research Papers: Alberto Artosi, Guido Governatori and Antonino Rotolo A labelled tableau calculus for nonmonotonic (cumulative) consequence relations Arnon Avron A tableau system for Gödel-Dummett logic based on a hypersequent calculus Matthias Baaz, Christian Fermüller and Helmut Veith An analytic calculus for quantified propositional Gödel logic Diderik Batens and Joke Meheus A tableau method for inconsistency-adaptive logics Domenico Cantone and Calogero G. Zarba A tableau calculus for integrating first-order reasoning with elementary set theory reasoning Agata Ciabattoni and Mauro Ferrari Hypertableau and path-hypertableau calculi for some families of intermediate logics Marta Cialdea Mayer and Serenella Cerrito Variants of first-order modal logics Stéphane Demri Complexity of simple dependent bimodal logics Uwe Egly Properties of Embeddings from Int to S4 Melvin Fitting, Lars Thalmann and Andrei Voronkov Term-modal logics Enrico Giunchiglia and Armando Tacchella A subset-matching size-bounded cache for satisfiability in modal logics Rajeev Goré Dual intuitionistic logic revisited Ray Gumb Model sets in a nonconstructive logic of partial terms with definite descriptions Ortrun Ibens Search space compression in connection tableau calculi using disjunctive constraints Christoph Kreitz and Brigitte Pientka Matrix-based inductive theorem proving Pedro J. Martín and Antonio Gavilanes Monotonic preorders for free variable tableaux Maarten Marx, Szabolcs Mikulás and Mark Reynolds The mosaic method for temporal logics Linh Anh Nguyen Sequent-like tableau systems with the analytic superformula property for the modal logics KB, KDB, K5, KD5 David Pearce, Inmaculada P. de Guzmán and Agustín Valverde A tableau calculus for equilibrium entailment Carla Piazza and Alberto Policriti Towards tableau-based decision procedures for non-well-founded fragments of set theory Riccardo Rosati Tableau calculus for only knowing and knowing at most Stephan Schmitt A tableau-like representation framework for efficient proof reconstruction Dan Willard The semantic tableaux version of the second incompleteness theorem extends almost to Robinson's arithmetic Q System Descriptions: Joachim Draeger Redundancy-free lemmatization in the automated model-elimination theorem prover AI-SETHEO Gernot Stenz and Andreas Wolf E-SETHEO: An automated3 theorem prover --------------------------------------------------------------------- -- Peter Baumgartner phone: +49 261 287 2777 mail: peter@uni-koblenz.de fax: +49 261 287 2731 WWW: http://www.uni-koblenz.de/~peter/ From owner-reliable_computing [at] interval [dot] usl.edu Wed May 24 11:19:16 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id LAA10589 for reliable_computing-outgoing; Wed, 24 May 2000 11:19:16 -0500 (CDT) Received: from animal.cs.chalmers.se (root [at] animal [dot] cs.chalmers.se [129.16.225.30]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id LAA10584 for ; Wed, 24 May 2000 11:18:53 -0500 (CDT) Received: from muppet70.cs.chalmers.se (muppet70.cs.chalmers.se [129.16.226.211]) by animal.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id SAA24453; Wed, 24 May 2000 18:13:39 +0200 (MET DST) Received: from localhost (taha@localhost) by muppet70.cs.chalmers.se (8.8.5/8.8.5) with ESMTP id SAA04782; Wed, 24 May 2000 18:13:38 +0200 (MET DST) X-Authentication-Warning: muppet70.cs.chalmers.se: taha owned process doing -bs Newsgroups: comp.lang.ml,comp.lang.functional,comp.compilers,comp.lang.scheme Date: Wed, 24 May 2000 18:13:34 +0200 (MET DST) From: Walid Taha Reply-To: saig [at] cs [dot] chalmers.se To: appsem [at] cs [dot] chalmers.se, concurrency [at] cwi [dot] nl, theorynt [at] listserv [dot] nodak.edu, types [at] cis [dot] upenn.edu, haskell [at] haskell [dot] org, ecoop-info [at] ecoop [dot] org, seworld [at] cs [dot] colorado.edu, pept [at] venus [dot] is.s.u-tokyo.ac.jp Subject: SAIG Deadline Extended to June 5th In-Reply-To: Message-ID: References: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk DEADLINE EXTENDED Semantics, Applications and Implementation of Program Generation (SAIG) ( http://www.md.chalmers.se/~taha/saig/ ) ICFP Workshop, Montreal, September 20th, 2000. NEW DEADLINE: June 5th, 2000 is final and firm. Numerous recent studies investigate different aspects of program generation systems, including their semantics, their applications, and their implementation. Existing theories and systems address both high-level (source) language and low-level (machine) language generation. A number of programming languages now supports program generation and manipulation, with different goals, implementation techniques, and targeted at different applications. The goal of this workshop is to provide a meeting place for researchers and practitioners interested in this research area, and in program generation in general. Scope: The workshop solicits submissions related to one or more of the following topics: * Multi-level and multi-stage languages, staged computation, * Partial evaluation (of e.g. functional, logical, imperative programs), * Run-time specialization (in e.g. compilers, operating systems), * High-level program generation (applications, foundations, environments), * Symbolic computation, in-lining and macros, Submissions are especially welcome if they relate ideas and concepts from several topics, bridge the gap between theory and practice, cover new ground, or report exciting applications. The program committee will be happy to advise on the appropriateness of a particular subject. Distribution: Accepted papers will be published as a Chalmers technical report, and will be made available online. A special issue of the Journal of Higher Order and Symbolic Computation (HOSC) is planned afterwards. Format: The one-day workshop will contain slots for participants to present accepted papers. In addition, there will be time allocated for open discussions during the workshop. Invited speakers will be announced in the near future. Invited Speakers: * Gilles Muller, IRISA * Dick Kieburtz, OGI * Frank Pfenning, CMU Submission Details: Authors are invited to submit papers of at most 5000 words (excluding figures), in postscript format (letter or A4), to saig [at] cs [dot] chalmers.se by June 5th 2000. Both position and technical papers are welcome. Please indicate at time of submission. Position papers are expected to describe ongoing work, future directions, and/or survey previous results. Technical papers are expected to contain novel results. All papers will be reviewed by the program committee for the above mentioned criteria, in addition to correctness and clarity. Authors will be notified of acceptance by 3 July 2000. Final version of the papers must be submitted by 31 July 2000. Program Committee: Cliff Click, Sun Micro Systems Rowan Davies, CMU Torben Mogensen, DIKU Suresh Jagannathan, NEC Research Tim Sheard, OGI Walid Taha, Chalmers (workshop chair) Peter Thiemann, Freiburg From owner-reliable_computing [at] interval [dot] usl.edu Tue May 30 07:41:45 2000 Received: (from root@localhost) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) id HAA18837 for reliable_computing-outgoing; Tue, 30 May 2000 07:41:45 -0500 (CDT) Received: from desh.cse.iitd.ernet.in (IDENT:root [at] mailer [dot] cse.iitd.ac.in [202.141.68.3]) by interval.usl.edu (8.9.1/8.9.1/interval-math-majordomo-1.0) with ESMTP id HAA18832 for ; Tue, 30 May 2000 07:41:34 -0500 (CDT) Received: from cse.iitd.ernet.in (root [at] sanjiva [dot] cse.iitd.ernet.in [10.20.2.48]) by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id RAA06448; Tue, 30 May 2000 17:54:14 +0530 Received: (from sanjiva@localhost) by cse.iitd.ernet.in (8.9.3/8.9.3) id RAA02069; Tue, 30 May 2000 17:44:10 +0530 Date: Tue, 30 May 2000 17:44:10 +0530 Message-Id: <200005301214.RAA02069 [at] cse [dot] iitd.ernet.in> X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva [at] sanjiva [dot] cse.iitd.ernet.in using -f From: Sanjiva Prasad To: skapoor [at] cse [dot] iitd.ernet.in Subject: FST TCS 2000: One week extension on the submission deadline Sender: owner-reliable_computing [at] interval [dot] usl.edu Precedence: bulk Anticipating down time at our site, and to give interested authors the benefit of a weekend, we are extending the deadline for submission to June 6, 2000. We also encourange authors to submit using the START program that can be accessed from the home page of the FST TCS 2000 conference http://www.cse.iitd.ernet.in/fsttcs20 *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. We advise authors to employ Springer-Verlag's LNCS style file "llncs.sty". Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - -------------------- Electronic submission is very strongly encouraged. You may submit your paper using Rich Gerber's system START by visiting the URL for the conference and following the appropriate links. The URL for submissions is http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html In case you ar eunable to submit using START, self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20 [at] cse [dot] iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva [at] cse [dot] iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva