HDTenEightyP/NetNews huggingface dataset:
From: coleman@rocky.cs.ucla.edu (Mike Coleman)
Subject: Re: ucla's library system/access
Organization: UCLA, Computer Science Department
Distribution: la
Date: Sat, 11 Apr 92 02:29:26 GMT

rkou@skat.usc.edu (Roger H. Kou) writes:
>is there a way to telnet, or any other way, to ucla's library system and
>check what books/periodicals are available? 

UCLA's equipment and/or mentality seems to be too obsolete to allow this, but
you can telnet to melvyl.ucop.edu to access the UC catalog, which includes
UCLA records.

Mike
-- 
--Mike Coleman (coleman@cs.ucla.edu), Ringmaster, Boelter Hall Roach Circus--
              Hell has a name.  Its name is "Murphy Hall".
From: kdlin@laplace.scd.ucar.edu (K. David Lin)
Newsgroups: la.general
Subject: Re: ucla's library system/access
Date: 12 Apr 92 02:25:42 GMT
Distribution: la
Organization: UCLA School of Engineering and Applied Science

In article <kud734INNeo6@skat.usc.edu> tli@skat.usc.edu (Tony Li) writes:
#
#    >is there a way to telnet, or any other way, to ucla's library system and
#    >check what books/periodicals are available? 
#    
#    UCLA's equipment and/or mentality seems to be too obsolete to allow this, but
#    you can telnet to melvyl.ucop.edu to access the UC catalog, which includes
#    UCLA records.

This is a *VERY* ignorant reply. You can telnet to our ORION system,
which runs on IBM 3090, to find what you want. The Internet address
is oac.ucla.edu. Our recent upgrade on this system supports AIX, which
is America's first super computing in UNIX environment. I'm sure that 
you Trogans are jealous. ;)

#And then you can go to USC's library and ask them to get you the book
#by interlibrary loan.  It works...  It's slow, but it has worked.

Again, this is another data point saying that UCLA has more resources. :)

David
--
Defend your life with style -- shoot a Beretta!!        K. David Lin
							UCLA EE Dept.
							kdlin@ee.ucla.edu
From: epark@aludra.usc.edu (Eugene Park)
Newsgroups: la.general
Subject: SUMMER SUBLET
Date: 8 Apr 1992 10:22:53 -0700
Organization: University of Southern California, Los Angeles, CA
Distribution: la
NNTP-Posting-Host: aludra.usc.edu

Furnished BR in a 3BR duplex available June 1 - Sept 15.
Located in Venice (Marina Del Rey Adjacent) 5-10 min to beach by bike.
$400/mo.

If anyone is interested, email me or leave a message at (310) 823-6819.

Eugene


-- 
<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
Eugene Park      University of Southern California > National Center for <
epark@usc.edu    Center for Laser Studies          > Integrated Photonics<
(213) 740-4249   Los Angeles, CA 90089-1112        >     Technology      <
From: tli@skat.usc.edu (Tony Li)
Newsgroups: la.general
Subject: Re: ucla's library system/access
Date: 11 Apr 1992 00:59:32 -0700
Organization: University of Southern California, Los Angeles, CA
Distribution: la
NNTP-Posting-Host: skat.usc.edu

    >is there a way to telnet, or any other way, to ucla's library system and
    >check what books/periodicals are available? 
    
    UCLA's equipment and/or mentality seems to be too obsolete to allow this, but
    you can telnet to melvyl.ucop.edu to access the UC catalog, which includes
    UCLA records.
    
And then you can go to USC's library and ask them to get you the book
by interlibrary loan.  It works...  It's slow, but it has worked.

-- 
Tony Li - Escapee from the USC Computer Science Department          tli@usc.edu
		       The net is not what it seems.
From: spanki@bernini.ced.berkeley.edu (Frank Goodman)
Newsgroups: la.general
Subject: Looking for an Apt.
Keywords: Apartment, West L.A., June 1st.
Date: 10 Apr 92 18:59:01 GMT
Article-I.D.: agate.s4ohlINNd3q
Reply-To: spanki@bernini.ced.berkeley.edu (Frank Goodman)
Distribution: ca
Organization: UC Berkeley Center of Environmental Design Research
NNTP-Posting-Host: bernini.ced.berkeley.edu


Hello,
    I am a Graduate Student at U.C. Berkeley, I will be studying at
    U.C.L.A for the academic year of 1992-1993. I am looking for a 
    1 or 2 bedroom apartment in the West L.A. Area (Westwood, Venice,
    Santa Monica, etc...). If you are graduating, or moving out, I would
    really appreciate any information about apartments that might be
    available. I am looking to move in around June 1st, but I do have a
    temporary place to stay, so it could be a little later.

    I can be reached fastest by email, but you can call me if you want
    at (510) 849-1166.

    Thanks,
    Frank.

    P.S. I can afford approx. $500.00 per bedroom (i.e. a 1 bdrm, or 
         studio @ ~$500.00/mnth, or a two bdrm @ ~$1000.00/mnth).

+---------------------------------------------------------------------+
| Frank M. Goodman,                    | spanki@ced.berkeley.edu      |
| Design Theory and Methods Group,     | spanki%ced@jade.berkeley.edu |
| College of Environmental Design,     | ...!ucbvax!ced!spanki        |
| University of California, Berkeley.  | (510) 849-1166               |
+---------------------------------------------------------------------+
Newsgroups: seminars,la.seminars
From: gpham@lanai.cs.ucla.edu (Gisele Pham)
Subject: A SOFTWARE ENVIRONMENT TO SUPPORT EXPLORATORY MODELING
Originator: gpham@lanai.cs.ucla.edu
Keywords: CS201 Seminar
Organization: UCLA Computer Science Department
Distribution: la
Date: Mon, 13 Apr 92 23:08:25 GMT

DATE Thursday, April 23 1992
TIME 4:30-6:00 P.M.
PLACE 3400 Boelter Hall
Cookies & Coffee Will Be Served
Starting at 4:00 PM

A SOFTWARE ENVIRONMENT TO SUPPORT EXPLORATORY MODELING
Steven C. Bankes
RAND

ABSTRACT 
Exploratory modeling is the use of computational experiments to 
solve problems of scientific or practical interest.  With the 
increasing availability of computer power, exploratory modeling 
is becoming increasingly common, but remains poorly understood.  
This talk will discuss the methodological characteristics of 
problem solving by computational experiment, and describe the 
design of a software environment to better support exploratory 
modeling.

Exploratory modeling differs strongly from "classical" modeling 
approaches designed to produce a single model whose predictions 
can be experimentally validated.  During exploration, large numbers 
of cases and model variants may be generated and related to each 
other in complex ways.  Thus, exploratory modeling requires not 
just tools for representing model constructs, but also means for 
managing the complexity of the experimental process.

Tasks requiring an exploratory approach can be thought of as 
inverse problems whose solution requires search among model 
alternatives.  Examples of such tasks include searching for models 
adequate to explain observed data (hypothesis generation), surveying 
the effects of model attributes on behavior (sensitivity analysis), 
and reasoning cogently over (infinite) ensembles of plausible 
models (policy analysis).  A software environment designed to 
improve man/machine collaboration in this search process is under 
construction at RAND.  When complete, it will facilitate more
aggressive and more effective use of computational experiments 
for problems of this kind.
Newsgroups: seminars,la.seminars
From: gpham@lanai.cs.ucla.edu (Gisele Pham)
Subject: REAL-TIME COMMUNICATION IN MULTICOMPUTER SYSTEMS
Originator: gpham@lanai.cs.ucla.edu
Keywords: Recruiting Seminar
Organization: UCLA Computer Science Department
Distribution: la
Date: Tue, 7 Apr 92 17:54:17 GMT

DATE Tuesday, April 14 1992
TIME 12:30-2:00 P.M.
PLACE 3440 Boelter Hall-The Archives

REAL-TIME COMMUNICATION IN MULTICOMPUTER SYSTEMS
Kang G. Shin
Real-Time Computing Laboratory
Department of Elec. Engr. and Computer Science
The University of Michigan

ABSTRACT 
Communication in real-time systems has to be predictable, because
unpredictable delays in the delivery of messages can adversely
affect the execution of tasks dependent on these messages.  We
have developed a scheme for providing predictable inter-process
communication in real-time systems with (partially connected) 
point-to-point interconnection networks, which provides guarantees
on the maximum delivery time for messages.  This scheme is based 
on the concept of a real-time channel, a unidirectional connection 
between source and destination.  A real-time channel has parameters 
which describe the performance requirements of the source-destination
communication, e.g., from a sensor station to a control site.
Once such a channel is established, the communications subsystem 
guarantees that these performance requirements will be met.
This talk concentrates on methods to compute guarantees for
the delivery time of messages belonging to real-time channels
and their implementation on HARTS, an experimental distributed
real-time system.
From: stivers@panda.usc.edu (Lucille Stivers)
Newsgroups: la.seminars
Subject: Seminar, Friday, April 10, 10:30 am. EEB248, Fadi J. Kurdahi
Date: 6 Apr 92 23:23:14 GMT
Distribution: la
Organization: USC Mail-To-News Gateway



                  COMPUTER ENGINEERING SEMINAR


                System Level Automatic Synthesis of Controllers
                     for High Speed ASIC Data Paths



                                   by


                            Fadi J. Kurdahi


             Electrical and Computer Engineering Department
                University Of California At Irvine



                                Abstract


We address the problem of control synthesis of pipelined data paths.
Two basic control schemes are possible: data-stationary and
time-stationary.  In this work, we consider the latter scheme.  We
developed an approach to automatically synthesize time-stationary
controllers for pipelined data paths which are produced by high level
synthesis tools such as Sehwa.  First a scheduled control/data flow
graph is analyzed and the various states are identified.  Overlapped
states are grouped together to produce $L$ groups where $L$ is the
pipeline initiation interval.  Next, state transitions are identified
and hence a state table is generated.  A highly optimized FSM
controller is then implemented by performing horizontal partitioning
and the corresponding state encoding so as to minimize the total
controller area.  Existing logic optimization programs (MIS and
ESPRESSO) are finally used to optimize the logic inside each partition
and generate PLA or standard cell implementations.  Experimental
results indicate that our methods result in large savings in total
controller area and tend to improve overall controller delay.






		 DATE:		 Friday, April 10, 1992

		 TIME:		 10:30 A.M. SEMINAR

		 LOCATION:	     EEB 248

		 HOST:		 Prof. Sandeep Gupta

				    (213)740-2251
From: suhler@pollux.usc.edu (Paul A. Suhler)
Newsgroups: la.seminars
Subject: The Rewrite Rule Machine and the Maude Language, USC 4/9/92
Date: 7 Apr 1992 10:48:48 -0700
Organization: University of Southern California, Los Angeles, CA
Distribution: la
NNTP-Posting-Host: pollux.usc.edu
Summary: by Jose Meseguer, SRI


          The Rewrite Rule Machine and the Maude Language


                        Jose Meseguer
                  Computer Science Laboratory
                      SRI International


The Rewrite Rule Machine (RRM) is a massively parallel computer that we are
currently developing at SRI.  Because of its very fine grain SIMD parallelism
at the chip level combined with its flexible coarser grain MIMD parallelism at
the network level that allows different chips to work on different subtasks of
the same problem at once, the RRM can exploit a problem's parallelism at
several levels.  This makes the RRM very well suited for solving complex,
locally homogeneous but globally inhomogeneous, problems in many areas,
including discrete event simulation, expert systems, rapid prototyping,
vision, computational geometry, automated deduction, finite element methods,
hardware simulation, and neural networks.

Finding simple high level programming languages well suited for programming
MIMD machines is an important research problem; in the case of the RRM a
further requirement is that the language should also be well suited for data
parallelism.  Because of its flexible abstract model of computation called
concurrent rewriting, the RRM is programmable in a wide variety of declarative
high level languages that permit massive exploitation of implicit parallelism.
In particular, the RRM is programmable in Maude, a declarative language that
unifies the paradigms of functional and concurrent object-oriented
programming.

The talk will give a brief overview of Maude and the concurrent rewriting
model of computation, will summarize the architectural design of the RRM, and
will discuss performance estimates for the RRM based on detailed simulations
at the chip level together with additional simulations and modelling for
higher levels.

=-=-=-=-=-=-=-=-=-=-=
Location:	Electrical Engineering Building room 248, USC Campus
Time:		3:30 PM, Thursday, 9 April 1992
Host:		Prof. Alvin M. Despain, Advanced Computer Architecture Lab
Information:	Ms. Susan Moore, 213-740-4462, susanm@usc.edu
From: stivers@panda.usc.edu (Lucille Stivers)
Newsgroups: la.seminars
Subject: Seminar, Friday, April 10, Fadi J. Kurdahi
Date: 8 Apr 92 21:42:03 GMT
Distribution: la
Organization: USC Mail-To-News Gateway

has been postponed and will be rescheduled.  (Exact date has not been set yet.)
Newsgroups: seminars,la.seminars
From: gpham@lanai.cs.ucla.edu (Gisele Pham)
Subject: LOWER BOUNDS FOR RANDOMIZED K-SERVER AND MOTION-PLANNING ALG.
Originator: gpham@lanai.cs.ucla.edu
Keywords: Recruiting Seminar
Organization: UCLA Computer Science Department
Distribution: la
Date: Tue, 7 Apr 92 17:52:10 GMT

DATE Thurday, April 16 1992
TIME 12:30-2:00 P.M.
PLACE 3440 Boelter Hall - The Archives

LOWER BOUNDS FOR RANDOMIZED K-SERVER AND MOTION-PLANNING ALGORITHMS
Howard Karloff
University of Chicago

ABSTRACT 
The k-server problem is the problem of scheduling the motion of
k robots, also known as "servers".  The robots move among the points 
of a metric space, in response to requests for service.  When a
request for service occurs, one of the servers must move to the 
location of the request, incurring a cost equal to the distance 
moved.  The catch is that the choice of robot (which may be random) 
must depend only on the past requests, and not on any of the 
unknown future requests:  the requests are served "on-line."  We 
measure the performance of an on-line server algorithm relative 
to the cost incurred by a prescient adversary who knows the entire 
request sequence in advance and serves it optimally.  The 
"competitive ratio" is the worst-case ratio between the expected 
cost incurred by the algorithm and the cost incurred by the adversary.  

It was an open question whether there was a k-server algorithm
whose cost was bounded by a constant times the optimal cost, 
independent of k.  We will prove that this is impossible.  In fact, 
if the metric space is large enough relative to k, we give an 
exact bound on how much worse an on-line algorithm must be than 
the (unrealistic) off-line algorithm.

Next, we will study an on-line robot-motion problem.  Here, the 
robot moves from a point s in the Euclidean plane to a known 
target t.  However, the plane is peppered with disjoint, opaque, 
rectangular obstacles which obstruct the vision of the robot.  
The robot learns about obstacles only as they come in to view;
like the server algorithm, it is on-line.   We show how to apply 
the k-server lower bounds to prove that no on-line algorithm can 
guarantee an expected cost bounded by a constant times optimal.

This is joint work with Yuval Rabani and Yiftach Ravid from
Tel-Aviv University.
Newsgroups: la.seminars
From: hbe@sonia.math.ucla.edu (H. Enderton)
Subject: UCLA Logic Colloquium, April 17
Organization: UCLA Mathematics Department
Distribution: la
Date: Thu, 9 Apr 92 16:15:22 GMT

                    UCLA LOGIC COLLOQUIUM
                    Friday, April 17, 1992
                           4:00 p.m.
                   Mathematical Sciences 6627
                             UCLA
                                                  
                       ALEXANDRA SOSKOVA
                      (Sofia University)

               "EFFECTIVE FIRST ORDER STRUCTURES"

		           Abstract

In our talk we shall discuss the notion of abstract data type from a
recursion theoretical point of view.  Our results are mainly
concentrated on the definition and on the characterization of the
effective abstract data types.

The main tool is a notion of computability over many-sorted first order
structure which puts together two non-deterministic notions of
computability -- search computability of Moschovakis and computability
of Friedman and Shepherdson.

The relationships between some special properties of the class of the
computable functions in an abstract structure and the existence of some
special enumerations of it will be presented.

Newsgroups: seminars,la.seminars
From: gpham@lanai.cs.ucla.edu (Gisele Pham)
Subject: RUNTIME COMPILATION METHODS FOR SCALABLE MULTIPROCESSORS.
Originator: gpham@lanai.cs.ucla.edu
Keywords: Seminar
Organization: UCLA Computer Science Department
Distribution: la
Date: Wed, 15 Apr 92 21:40:39 GMT

DATE Tuesday, April 21 1992
TIME 12:30-2:00 P.M.
PLACE 3440 Boelter Hall - The Archives

RUNTIME COMPILATION METHODS FOR SCALABLE MULTIPROCESSORS.
Joel Saltz
Institute for Computer Applications 
in Science and Engineering
NASA Langley Research Center
Hampton, VA

ABSTRACT 
Over the past few years, we have developed methods that make
it possible for a compiler to efficiently map many sparse and
unstructured scientific problems to scalable multiprocessor
architectures. These methods are implemented using embeddable
PARTI (Parallel Automated Runtime Toolkit at ICASE) runtime 
preprocessing procedures.  These procedures (1) coordinate 
interprocessor data movement, (2) manage the storage of and 
access to copies of off-processor data, (3) support a shared 
name space, and (4) couple runtime data and workload partitioners 
to compilers.  We will describe a prototype Fortran D compiler 
which uses PARTI procedures to handle unstructured computations.
We will also describe experimental results obtained using the
PARTI procedures to port  unstructured mesh Euler solvers to the
Intel iPSC/860, Delta and Maspar.
From: marthae%pollux.usc.edu@usc.edu (Martha Escobar)
Newsgroups: la.seminars
Subject: CSGO seminar - Thur 4/16/92 - 11:00
Date: 10 Apr 92 21:25:58 GMT
Distribution: la
Organization: USC Mail-To-News Gateway

                     CSGO Research Seminar
	
		CSGO, the Computer Science Graduate Organization, 
sponsors  seminars to bring together students and 
researches in the areas of Computer Science and Engineering, 
introducing the students to the researchers and providing a 
chance for the researches to get to know the students.  
Next week the seminar will be:



          Backward Assembly Planning

                  Sukhan Lee
           USC EE Systems Department  

  After an overview of my research activities in
  robotics, AI, and neural networks at USC (with several
  Ph.D. students of CS and EE), I will talk about 
  some details of Backward Assembly Planning.

  Backward assembly planning is based on recursive
  deomposition of an assembly into subassemblies
  under the consideration of assemblability and
  assembly cost. Merging and grouping priniples
  are introduced to efficiently identify legitimate
  subassemblies. Furthermore, analysis of stability
  and directionality associated with assembly leads
  to the identification of the number of fixtures and
  reorientations required for assembly. This allows
  to evaluate assembly cost in assembly planning,
  which enables not only the AO* search of a cost-effective
  assembly plan but also the evauation of an assembly
  in term of DFA(design for assembly).


			Date:  Thursday, 4/16/92
			Time:  11:00 - 12:00
			Place: SAL 324
			Host:  CSGO
From: polecat!steve@cacti.mcws.fidonet.org
Newsgroups: la.test
Subject: test
Date: Tue, 07 Apr 92 17:45:56 PDT
Organization: The Wacko Family, Tujunga CA

this is a test. not a big test, but a test all the same.
ANOTHER TUJUNGA SECRET CULT MEMBER..........
From: steve@presoft.com (Steve Kohlenberger)
Newsgroups: la.test
Subject: LA LA LA LA LA
Date: Fri, 10 Apr 92 18:45:17 PDT
Distribution: la
Organization: Presoft Architects (Novell Developer)

So... whereabout am I not getting.  Seems distribution is fragmented.

Steve


   Steve Kohlenberger, PreSoft Architects  Internet: steve@presoft.com
   Novell Professional Developer                        (714) 538-6002
   Specialists in NLM and Disk/Tape Driver development for NetWare 3.X
From: hardman@throb.mcws.fidonet.org (Bill Hardman)
Newsgroups: la.test
Subject: Re: test
Date: Tue, 07 Apr 92 19:24:57 PDT
Organization: Bark At The Moon Productions

>blarson@blars.UUCP writes:

> (I assume this was meat to test a posting with distribution "local".
> "local" is not a special case to c news and apparently your site sends
> local messages elsewhere.)

Meat??  My system won't touch meat!!  It is petro-chemical fueled.  Of
course the backup power system is nuclear.  The weather is so nice,
I'm going fission.

stay here was not meat to test anything.  I just put that there
because my fingers talked me into it.  No other reason.  Just having
some early morning laughs.

bill

------------------------------- :) -----------------------------------
            hardman = hardman@throb.mcws.fidonet.org
                (Bark At The Moon Productions)
                        *A Secret Cult*
If you don't have anything nice to say....Say something Rude!!!!
From: john@cacti.mcws.fidonet.org (John Coffman)
Newsgroups: la.test
Subject: test (not)
Date: Tue, 07 Apr 92 20:27:15 PDT
Organization: Coffman Cactus, Tujunga CA

Is there a sig here?

John Coffman
john@cacti.mcws.fidonet.org   ***  Another cult member from Tujunga
From: john@cacti.mcws.fidonet.org (John Coffman)
Newsgroups: la.test
Subject: not a test
Date: Tue, 07 Apr 92 20:14:44 PDT
Organization: Coffman Cactus, Tujunga CA

this is not a test
From: john@cacti.mcws.fidonet.org (John Coffman)
Newsgroups: la.test
Subject: Re: test
Date: Tue, 07 Apr 92 20:16:07 PDT
Organization: Coffman Cactus, Tujunga CA

hardman@throb.mcws.fidonet.org (Bill Hardman) writes:

> This is a test.  I am seizing control of the net.  Do not try to
> adjust your CRT.  This is only a test.  You have now entered
> "The Tujunga Zone".
>         I am now turning control back over to you.  Thanks for your
> patience.
>
> bill

If I follow up on this test, will I really see it at work?
Newsgroups: la.test,from.socal.com
From: mporter@pro-palmtree.socal.com (System Administrator)
Subject: Test
Organization: The Palmtree BBS - 310/450-9394 - Santa Monica, CA
Date: Thu, 9 Apr 1992 19:39:58 GMT


This is a test.



-----
UUCP: hatch!pro-palmtree!mporter                    The Palmtree BBS
Inet: mporter@pro-palmtree.socal.com                310-450-9394 v.32
Newsgroups: la.test
From: ariel@lanai.cs.ucla.edu (Ariel Rogson)
Subject: Test post.
Reply-To: ariel@CS.UCLA.EDU
Organization: UCLA Computer Science Dept.
Distribution: la
Date: Mon, 13 Apr 92 17:02:14 GMT

Just a test, please ignore.
-- 
Ariel "The Rogue" Rogson | "Cleaver, you may be younger.  You may be faster.
ariel@CS.UCLA.EDU        | You may even be smarter.  But you will never, ever,
-------------------------+ be crazier than me!" -- Judge Stone, "Night Court"
From: IMI7BKL@mvs.oac.ucla.edu (Woody)
Newsgroups: la.test
Subject: Woodchucks
Date: 10 Apr 92 23:19:39 PDT

How much wood
     Could a Woodchuck chuck
          If a Woodchuck could chuck wood?
From: steve@presoft.com (Steve Kohlenberger)
Newsgroups: la.test
Subject: On a clear day..tests can take forever
Keywords: non at this time thank you
Date: Fri, 10 Apr 92 03:30:39 PDT
Followup-To: Any other test message
Distribution: la
Organization: Presoft Architects (Novell Developer)

I don't feel like talking here


   Steve Kohlenberger, PreSoft Architects  Internet: steve@presoft.com
   Novell Professional Developer                        (714) 538-6002
   Specialists in NLM and Disk/Tape Driver development for NetWare 3.X
Newsgroups: la.eats