HDTenEightyP/NetNews huggingface dataset:
From: dfair@octel.com (Donald Fair)
Subject: Re: housing question: avoiding suburbia in Silicon Valley
Organization: Octel Communications Inc., Milpitas Ca.
Date: Tue, 18 Aug 1992 18:44:55 GMT

In article <4681@bacon.IMSI.COM> jordan@IMSI.COM (Jordan Hayes) writes:
>Charleen Bunjiovianna <charleen@ADS.COM> writes:
>
>	Of course, those of us who live in the suburban sprawl do so
>	because we're hopelessly addicted to double knit polyester
>	slacks, Wonder bread and strip malls.  That it's convenient to
>	our jobs is just an added blessing, ya know?
>
>What you're really saying is that you just don't care enough about your
>quality of life to do anything constructive about it, right?  I'm
>assuming that you're trying to imply that you don't live in suburbia
>because you *like* it but rather you see time-to-work as more important
>than what-else-besides-work, right?
>
>To the original poster: get yerself a comfy car with a nice stereo and
>get used to sitting in traffic.  I did it for almost 2 years (Rockridge
>to Mountain View), and would do it again (in fact I did it Berkeley ->
>Manhattan for a while, and probably will again at some point).
>
>Or: look *harder* for a job outside of Sillycon Valley ...
>

	Or you could move somewhere were you make good money
	and living conditions are good. The Bay Area is not
	the only work area.

-- 
_____________________________________________
Donald H. Fair       Software Sanitation Eng.
dfair@octel.com     "They're all small when 
standard disclaimer  They're blue." papa smurf 
---------------------------------------------
From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ucb.icsi,ucb.cs.msgs,ba.seminars,ucb.seminars
Subject: 8/28/92 J. Herzberger Talk at ICSI
Date: 18 Aug 92 19:59:33 GMT
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsia.icsi.berkeley.edu
Originator: kempson@icsia


              The International Computer Science Institute
                     is pleased to present a talk:

                   Friday, August 28, 1992  2:00 p.m.

                          PROF. J. HERZBERGER
                         Fachbereich Mathematik
                    Universitaet Oldenburg, GERMANY

           On Some Classes of Simultaneous Inclusion Methods
                          for Polynomial Zeros

           We are investigating a general model for the  construc-
      tion  of  higher-order  simultaneous  inclusion  methods for
      polynomial zeros based on fixed-point relations.   In  order
      to  calculate guaranteed bounds for the zeros we make use of
      interval operations in the definition of the iteration  for-
      mulas.  We are considering:

      (i)  a total-step approach (convenient for parallel computa-
           tion)

      (ii) a single-step approach (convenient for serial  computa-
           tion)

           As special cases many well-known  iteration methods  in
      the  literature  are  included.  For the families under con-
      sideration it is shown that their order of  convergence  can
      easily be determined.  The single-step methods are proved to
      be superior to the total-step methods with  respect  to  the
      R-order of convergence.

           The methods derived in that way  are  producing  nested
      sequences of inclusion intervals for the zeros.  If a proper
      machine interval arithmetic is used,  for  example,  with  a
      PASCAL-XSC compiler, then these bounds are guaranteed in the
      presence of round-off errors.  Besides the general treatment
      of the methods in recent literature, some new methods can be
      derived which are requiring a rather complicated analysis to
      prove their basic properties without using our model.

           Some examples are given showing how  this  model  works
      when applied to concrete methods.


        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)


      ----------------------------------------------------------
      Requests to be added to or deleted from the "talk" mailing 
      list should be directed to talk-request@icsi.Berkeley.EDU.
      ----------------------------------------------------------
Xref: sparky ba.seminars:539 comp.sys.mac.programmer:14186 comp.std.internat:624 sci.lang.japan:3773
From: norbert@apple.com (Norbert Lindenberg)
Newsgroups: ba.seminars,comp.sys.mac.programmer,comp.std.internat,sci.lang.japan
Subject: IMUG meeting 8/20/92 - Unicode
Date: 19 Aug 92 01:34:26 GMT
Distribution: ba
Organization: Apple Computer Inc, Cupertino, CA


Group:      International Macintosh Users Group (IMUG)
            (A Forum for Multilingual / Multiscript Computing)
Date:       August 20, 1992, 7-9 pm
Speakers:   Joe Becker (Xerox), Lee Collins (Taligent)
Topic:      Unicode
Location:   Xerox Corp., 3400 Hillview Ave. Bldg. One, Palo Alto, CA 94303
            (corner of Foothill Expressway, new facility down the hill from
            Xerox Palo Alto Research Center).
            From Page Mill Road (accessible from 101 and 280), turn south
            onto Foothill Expressway. Go about 150 yards; turn right at
            Xerox entrance. Take driveway along the front of the complex
            parallel to Foothill. Park near the middle, where there is a
            fountain. IMUG will meet in Building One opposite Foothill from
            the fountain.  Look for large glass double doors.  Sign in with
            the receptionist. (There is also an entrance on Hillview.)
Admission:  $2, free for IMUG members (membership $15/year)
Contact:    Roger Sherman, (415) 859-5146
 
Unicode is a standard international character code for multilingual
information processing. Like the ASCII character code, it defines
simple, unambiguous, fixed width character codes. Since ASCII's
7-bit character size is inadequate to handle multilingual text,
Unicode adopts a 16-bit architecture that can uniquely specify any
character in any language worldwide that is currently used or is
likely to be used in the foreseeable future. Unicode is being
developed by the Unicode Consortium, whose membership includes
companies such as Apple, Digital, Hewlett-Packard, IBM, Microsoft,
Novell, Sun, Taligent, and Xerox. Recently, Unicode has been merged
with ISO international standard 10646.
 
                        ***
 
The International Macintosh Users Group (IMUG) is a forum organized to
promote greater use of languages other than English on the major computer
platforms - Macintosh, IBM-compatibles, etc.
 
Topics of interest discussed at IMUG meetings (every third Thursday of the
month) include:
    fonts, character sets, and encoding schemes
    development, localization, and marketing / distribution issues
    specific products available for various languages, including
        programs for learning foreign languages.
From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ucb.icsi,ucb.cs.msgs,ba.seminars,ucb.seminars
Subject: 8/25/92 Thomas Koch Talk at ICSI
Date: 18 Aug 1992 19:19:48 GMT
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsia.icsi.berkeley.edu
Originator: kempson@icsia


              The International Computer Science Institute
                     is pleased to present a talk:

                  Tuesday, August 25, 1992  3:30 p.m.

                              THOMAS KOCH
                              Krupp & ICSI

        ``Application of Inductive Rule Generation Techniques''

           An  example  of  the  inductive  rule  learning  system
      RULEARN  will  be  described, showing how a compact rule set
      can be automaticly generated from  a  given  database.  This
      technique  can  be  used  as a knowledge acqusition tool for
      construction and/or maintenance of expert systems.  Indepen-
      dent  from  this  it  can  also be used as a data evaluation
      method which can find dependencies which are  hard  to  find
      with statistical analysis.


        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)

       ----------------------------------------------------------
       Requests to be added to or deleted from the "talk" mailing
       list should be directed to talk-request@icsi.Berkeley.EDU.
       ----------------------------------------------------------
From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ucb.icsi,ucb.cs.msgs,ba.seminars,ucb.seminars
Subject: 8/26/92 Persi Diaconis Talk at ICSI
Date: 19 Aug 1992 21:33:14 GMT
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsia.icsi.berkeley.edu
Originator: kempson@icsia


              The International Computer Science Institute
                     is pleased to present a talk:

                 Wednesday, August 26, 1992  3:00 p.m.

                             PERSI DIACONIS
                          Dept. of Mathematics
                           Harvard University

                      ``Geometry and Randomness''

           Random walks on graphs are used in a host  of  applica-
      tions  in  Computer Science. A new class of techniques, sup-
      plements  to  classical  eigenvalue  bounds,  has   recently
      emerged  which allow a sharp analysis in fairly general cir-
      cumstances.  These techniques exploit the  geometry  of  the
      underlying  graph  in  a crucial way. The power of the tech-
      niques will be illustrated by several examples.


        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)

       ----------------------------------------------------------
       Requests to be added to or deleted from the "talk" mailing
       list should be directed to talk-request@icsi.Berkeley.EDU.
       ----------------------------------------------------------
From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ucb.icsi,ucb.cs.msgs,ba.seminars,ucb.seminars
Subject: 8/20/92 Paul Vitanyi Talk at ICSI
Date: 13 Aug 92 23:36:09 GMT
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsia.icsi.berkeley.edu
Originator: kempson@icsia


              The International Computer Science Institute
                     is pleased to present a talk:

                  Thursday, August 20, 1992  2:00 p.m.

                              PAUL VITANYI
                                  CWI
                                  and
                University of Amsterdam, The Netherlands

        ``Mathematical Theory of Thermodynamics of Computation''

           We investigate a new research area: we  are  interested
      in the ultimate thermodynamic cost of computing from x to y.
      Other than its fundamental  importance,  such  research  has
      potential  implications in miniaturization of VLSI chips and
      applications in pattern recognition.

           It turns out that the theory of thermodynamic  cost  of
      computation can be axiomatically developed.  Our fundamental
      theorem connects physics to mathematics, providing  the  key
      that  makes  such a theory possible.  It establishes optimal
      upper and lower bounds on the ultimate thermodynamic cost of
      computation.

           By computing longer and longer, the  amount  of  dissi-
      pated  energy  gets closer to these limits. In fact, one can
      trade time for  energy:  there  is  a  provable  time-energy
      trade-off hierarchy.  The fundamental theorem also induces a
      thermodynamic distance metric.  The  topological  properties
      of  this  metric show that neighborhoods are sparse, and get
      even sparser if they are centered on  random  elements.  The
      proofs use Symmetry of Information in a basic way.

           These notions  also  find  an  application  in  pattern
      recognition.   People  have been looking without success for
      an objective notion of cognitive distance to account for the
      intuitive  notion  of  ``similarity''  of  pictures. Thermo-
      dynamic  considerations  lead  to  a  recursively  invariant
      notion  of cognitive distances.  It turns out that the ther-
      modynamic distance is a universal cognitive  distance  which
      discovers  all effective features used by any cognitive dis-
      tance whatsoever.

                       (Joint work with Ming Li)


        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)

       ----------------------------------------------------------
       Requests to be added to or deleted from the "talk" mailing
       list should be directed to talk-request@icsi.Berkeley.EDU.
       ----------------------------------------------------------
Newsgroups: ba.seminars,comp.human-factors,comp.cog-eng,comp.infosystems,comp.groupware
From: nb@Sunburn.Stanford.EDU (Nancy Blachman)
Subject:  Noontime Seminar: How to Get a Technical Book Published
Originator: nb@Sunburn.Stanford.EDU
Keywords:  technical books, publish, discussion, ucb
Organization: Computer Science Department, Stanford University
Distribution: ba
Date: Fri, 21 Aug 1992 01:25:20 GMT

                  How to Get a Technical Book Published

                            Discussion with

                            Nancy Blachman
                               Author of 
          "Mathematica: A Practical Approach" (Prentice-Hall, 1992)
  "Mathematica Quick Reference"  (Addison-Wesley and Variable Symbols, 1992)
              "Maple V Quick Reference" (to be published in 1993)

                            Bernard Aboba
                              Author of 
          BMUG Guide to Bulletin Boards and Beyond (BMUG, 1992)

                             Tay Vaughan
                              Author of 
             MULTIMEDIA: Making it Work (Osborne/McGraw-Hill) 

                             Jeff Pepper
                Editor and Chief, Osborne/McGraw-Hill

                     Wednesday September 9, 1992
                            12 noon - 1 pm
                           Bechtel Room 120
                             UC Berkeley


In this session, three authors and a publisher share their experience 
getting technical books published.  They will answer questions such as: 
Why write a book? How do you get started? What does a publisher do 
(and not do)? What does a publisher want from you? How can you get 
an offer from more than one publisher? What is a typical offer? What 
is a good offer?  What is a great offer? How can you negotiate a better 
deal? Where can you turn to get help with writing, negotiating, and 
publishing a book?

                           Sponsored by the
                     Engineering Alumni Society
                   and the Blue Network Committee


Bechtel 120 is in the basement of the Bechtel Engineering Building
behind the elevator.

For further information on the Engineering Alumni Society noontime
seminar series, please contact:

        Nancy Blachman
        Director, UCB Engineering Alumni Society
        Variable Symbols, Inc.
        2161 Shattuck Ave., Suite 202
        Berkeley, CA  94704-1313
        Email: nb@eris.berkeley.edu
        Tel: 510-843-8701
From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ucb.icsi,ucb.cs.msgs,ba.seminars,ucb.seminars
Subject: 8/14/92 Silvio Micali Talk at ICSI
Date: 13 Aug 92 19:42:38 GMT
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsia.icsi.berkeley.edu
Originator: kempson@icsia


              The International Computer Science Institute
                     is pleased to present a talk:

                   Friday, August 14, 1992  2:00 p.m.

                             SILVIO MICALI
                    Laboratory for Computer Science
                                  MIT

                 ``A Mechanism for AIDS' T4-Cell Loss''

           We wish to suggest that the massive T4-cell  loss  that
      is  the hallmark of AIDS is due to the production of antibo-
      dies blocking the generation of T4 cells.

           We will present the theoretical reasons for our  expla-
      nation as well as its underlying biological mechanisms.

           A special effort will be made to make the  talk  under-
      standable to non-biologists.


        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)

       ----------------------------------------------------------
       Requests to be added to or deleted from the "talk" mailing
       list should be directed to talk-request@icsi.Berkeley.EDU.
       ----------------------------------------------------------
From: kempson@ICSI.Berkeley.EDU (Mark Kempson)
Newsgroups: ucb.icsi,ucb.cs.msgs,ba.seminars,ucb.seminars
Subject: 8/25/92 Amos Beimel Talk at ICSI
Date: 18 Aug 92 19:44:36 GMT
Organization: International Computer Science Institute, Berkeley, CA, U.S.A.
NNTP-Posting-Host: icsia.icsi.berkeley.edu
Originator: kempson@icsia


              The International Computer Science Institute
                     is pleased to present a talk:

                  Tuesday, August 25, 1992  2:00 p.m.

                              AMOS BEIMEL
                                Technion
                             Haifa, Israel

              ``Universally Ideal Secret Sharing Schemes''

           Given a set of parties {1,...,n}, an  access  structure
      is  a  monotone collection of subsets of the parties.  For a
      certain domain of secrets, a secret sharing  scheme  for  an
      access  structure  is  a  method  for a dealer to distribute
      shares to the parties, such that only subsets in the  access
      structure can reconstruct the secret.

           A secret sharing scheme is ideal if the domains of  the
      shares  are the same as the domain of the secrets. An access
      structure is universally ideal if there is an  ideal  secret
      sharing  scheme  for it over every finite domain of secrets.
      An obvious necessary condition for an access structure to be
      universally ideal is to be ideal over the binary and ternary
      domains of secrets.  In this work, we prove that this condi-
      tion  is  also  sufficient.   In  addition, we give an exact
      characterization for each of these two conditions, and  show
      that  each condition by itself is not sufficient for univer-
      sally ideal access structures.

        This talk will be held in the Main Lecture Hall at ICSI.
          1947 Center Street, Sixth Floor, Berkeley, CA 94704
       (On Center between Milvia and Martin Luther King Jr. Way)

      ----------------------------------------------------------
      Requests to be added to or deleted from the "talk" mailing 
      list should be directed to talk-request@icsi.Berkeley.EDU.
      ----------------------------------------------------------
From: pal@xanadu.wpd.sgi.com (Anil Pal)
Newsgroups: ba.singles
Subject: Re: New Yorkers Club
Date: 14 Aug 92 23:02:12 GMT
Reply-To: pal@wpd.sgi.com
Organization: Silicon Graphics, Inc.

In article <Aug.14.15.36.00.1992.6852@presto.ig.com>, stuczyns@presto.ig.com (Martin Stuczynski) writes:
|> 
|> Earth pizza sucks.  :(

Well, of course.  Who puts earth on their pizza?  Sausage, yes.  Maybe
even anchovies.  But earth?

-- 
Anil A. Pal
pal@sgi.com	(415)-390-5279
From: johnf@Auspex.COM (John Fereira)
Newsgroups: ba.singles
Subject: Re: New Yorkers Club
Date: 15 Aug 92 00:01:39 GMT
Organization: Auspex Systems, Inc.

In article <1992Aug14.201716.2470@overload.lbl.gov> asya@ux5.lbl.gov (Asya Kamsky) writes:
>In article <1992Aug13.193747.21444@odin.corp.sgi.com> pal@wpd.sgi.com writes:
>>Sheesh.  And I even put smileys on the end.  You know another thing
>>about California?  You can't find a decent sense of humor here.
>
>Well, Anil, I wouldn't worry about your sense of humor. Seems fine to me.
>However, some of the fifth generation Californians clearly need a refresher
>course.
>
>No :-)'s here, John.

And bridge is a card game that a baboon could master. :-) :-)

-- 
+============================================================================++
| John Fereira            "Is that all you ever think about?"                |
| johnf@auspex.com                                                           |
+============================================================================++
From: asya@ux5.lbl.gov (Asya Kamsky)
Newsgroups: ba.singles
Subject: Re: New Yorkers Club
Date: 14 Aug 92 20:17:16 GMT
Reply-To: asya@ux5.lbl.gov (Asya Kamsky)
Organization: Lawrence Berkeley Laboratory

In article <1992Aug13.193747.21444@odin.corp.sgi.com> pal@wpd.sgi.com writes:
>Sheesh.  And I even put smileys on the end.  You know another thing
>about California?  You can't find a decent sense of humor here.

Well, Anil, I wouldn't worry about your sense of humor. Seems fine to me.
However, some of the fifth generation Californians clearly need a refresher
course.

No :-)'s here, John.
-- 
"In nature there are no rewards or punishments, only consequences"

Asya Kamsky	      e-mail: asya@ux5.lbl.gov                   Go Red Sox
"In order to command you must first learn to submit" - chinese fortune cookie
Newsgroups: ba.singles
From: pal@xanadu.wpd.sgi.com (Anil Pal)
Subject: Re: New Yorkers Club
Reply-To: pal@wpd.sgi.com
Organization: Silicon Graphics, Inc.
Date: Fri, 14 Aug 1992 22:54:59 GMT

In article <Aug.14.15.36.00.1992.6852@presto.ig.com>, stuczyns@presto.ig.com (Martin Stuczynski) writes:
|> 
|> Earth pizza sucks.  :(

You think Martian pizza is any better?  Now Venusians, they know how to
make pizza.  There's this place in sector 17 that claims to serve
Venusian style pizza, but don't you believe it...

Anyway, this discussion clearly belongs in sci.astronomy.  I've set the
Followup-To:  line to re-direct the discussion over there.

-- 
Anil A. Pal
pal@sgi.com	(415)-390-5279
From: pal@xanadu.wpd.sgi.com (Anil Pal)
Newsgroups: ba.singles
Subject: Re: New Yorkers Club
Date: 14 Aug 92 18:16:58 GMT
Reply-To: pal@wpd.sgi.com
Organization: Silicon Graphics, Inc.

In article <14040@auspex-gw.auspex.com>, johnf@Auspex.COM (John Fereira) writes:
|> 
|> Unfortunately you didn't know me as well as you thought you did.  You
|> didn't know that I'm a fifth generation native Californian and when someone
|> from wherever moves to the bay area, subscribes to ba.food, and then bitches
|> that you can't get real XXX here like they have from wherever they're from
|> that I take it a little more to to heart than someone that has been 
|> "temporarily transplanted" here.  When someone bitches about a place that
|> my family has chosen to live for five generations I have no qualms about 
|> telling them to go back to wherever they came from.  So basically you
|> struck a nerve and no amount of smileys makes up for it.   

Well, I wasn't actually the one asking about NY stuff (I've only
visited NY once, btw), but I'm sorry I pushed your buttons.  In all
sincerity, though, why be so touchy?  California has enough positives
that there should be no embarrassment in acknowledging the positives of
other places.

I don't know if it is possible, without personally experiencing it, to
really appreciate how immigrants can love a new home while still
missing some part of what was left behind.  I'm sure that people
expressing a yearning for New York Pizza intend no slight to your
family, but since I have never been in the situation of having an
ancestral home (for three generations, no-one in my family has lived in
their country of birth - I'm on my third country), perhaps I cannot
fully appreciate the depth of your feelings for yours.

-- 
Anil A. Pal
pal@sgi.com	(415)-390-5279