OT - bored with gaming ? Get philosophy!

#1 August 29th, 2001, 08:25 AM

I now point out the combats between fantasy and reality, between order and chaos, between the scientific method and superstition. I like them ALL! I do not discriminate. If you want to do things as I do then be flexible.....

CyC · #2 August 29th, 2001, 09:02 AM

LCC you just trying to increase the number of post you have done or something ?

how many Posts did you do in a row there ?

------------------
CyC
L+++ GdX $!+ Fr+ C--- Sd T!- Sf++ Tcp++ A? M++ MpM RV Pw+ Fq++ Nd+++++ Rp++ G

#3 August 29th, 2001, 09:02 PM

quote:
Originally posted by CyC:
LCC you just trying to increase the number of post you have done or something ?
how many Posts did you do in a row there ?

I am just posting what comes to mind.
Here is the latest installment.
http://w3.access.gpo.gov/usbudget/fy2002/pdf/mgmt.pdf

Dry Reading Indeedy
So Many And So Needy
I Got Lost At Se*
On Page Fifty Three

I Strike A Happy Medium
To Help Relieve The Tedium
There Is Nothing So Boring
As Endless Childish Whoring

I Lie Like A Dog
With Cunning Wit
Ann Frankly Starlit
I Dont Give A *it

Its A Fine And Private Place
Full Of Arsenic And Old Lace
I May Stop Beating Sacred Cows
If You Will Enact All The Nows

The Muse I Use Refuses To Choose
If You Will Turn Over A New Leaf
Then You Will Find Its Beyond Belief

* Before *

The Hammers Are Getting Bigger!
Check the story behind Beethoven's IV Symphony.......
http://www.shf.org/beethoven/fourth_symphony.htm

I want some rent!
Lonnie Courtney Clay

#4 August 30th, 2001, 02:43 AM

There are many variations on this theme. I use 'C' language structures here. I use [n] to indicate an array. The size for any particular "n" depends on the span of the set.

struct node
{
lea_node struct leaf*;
twi_node struct twig*;
bra_node struct branch*;
tru_node struct trunk*;
}

struct link
{
traffic_cur int;/* number of packets sent during current time cycle */
traffic_pre int[n];/* number of packets sent during previous time cycles */
tra_index int;/* index to traffic_pre */
bandwidth int;/* load factor allocation */
timestamp long;/* time at which counter traffic_cur began to run */
}
Note : A history buffer is used to avoid thrashing caused by transient traffic spikes

struct trunk
{
tru_trunk struct trunk*;/* pointer to next processor partition */
capacity int;/* Processor instruction execution ability in current partition */
utilization int;/* useful operations performed during current time cycle */
running_total int;/* total utilization during Last n cycles */
timestamp long;/* time at which counter utilization began to run */
branches struct branch *[n];
links struct link [n];
}
Note : new running_total = utilization + running_total * (n-1)/n.

struct branch
{
twigs struct twig * [n];
links struct link [n];
}

struct twig
{
leaves struct leaf * [n];
links struct link [n];
}

struct leaf
{
linkup struct node * [n];
links struct link [n];
}

If someone else is already doing this, then PROVE it by pointing to a history.

In any case, this is the Last "that" you get for free...

#5 August 30th, 2001, 02:55 AM

http://musicmusicals.ofpmovies.com/opera/opera.htm

dogscoff · #6 August 30th, 2001, 10:38 AM

*narf*

------------------
SE4 Code:
L GdY $ Fr- C- Sd T!+ Sf-- Tcp-- A% M>M+ MpD! RV Pw Fq+ Nd- Rp+ G-
/SE4 Code
Work out your code at http://www.sandman43.fsnet.co.uk/se4main.htm

#7 August 31st, 2001, 01:21 AM