Re: OT: telephone black box

Jim Thompson wrote:

On Wed, 07 Jan 2009 19:47:52 -0600, krw <krw@xxxxxxxxxxxxxxxxx> wrote:


On Wed, 07 Jan 2009 11:28:17 -0700, Jim Thompson
<To-Email-Use-The-Envelope-Icon@xxxxxxxxxxxxxxx> wrote:


On Wed, 7 Jan 2009 12:12:15 -0600, krw <krw@xxxxxxxxxxxxx> wrote:


In article <oup9m4deh93gnru8caqboc2puqgquv3au8@xxxxxxx>, To-Email-
Use-The-Envelope-Icon@xxxxxxxxxxxxxxx says...>

On Wed, 7 Jan 2009 11:26:06 -0600, krw <krw@xxxxxxxxxxxxx> wrote:


In article <ccl9m45g9h6cd25oumgud30asofaasl2im@xxxxxxx>, To-Email-
Use-The-Envelope-Icon@xxxxxxxxxxxxxxx says...>

On 4 Jan 2009 23:19:34 GMT, Jasen Betts <jasen@xxxxxxxxxx> wrote:


On 2009-01-02, osr@xxxxxxxxxx <osr@xxxxxxxxxx> wrote:


Possible Sorting structure.

don't sort, hash instead.

Why do we need to sort at all?

Can't one of you digital gurus devise a memory addressing scheme
derived from the caller ID?

Sure, we can build anything you're prepared to pay for, but CAMs tend to be expensive and suck power.

Huh? At these slow speeds?

It's the nature of the beast so one doesn't use them at these speeds. There are *always* better solutions.


Can't you devise a simple x-y addressing>

In ten dimensions?

10-DIGITS! Split into perhaps 5x5, or 3x3x4 (but binary equivalent)

But there are 10x10x10x10x10x10x10x10x10x10 numbers.


Don't you digital guys use any imagination ?:-)

Sure, but we can count too.


Not very well.

Do a tree comparison of area code, prefix, and station, separately and
AND together.


If the bit is "1" at that address, kill the number.

Sure, for this application simply search the black directory. If the number is there kill it. If it's in the white directory pass it immediately. ...but that isn't nearly as fun for the programmer weenies as arguing about sort algorithms and hash tables. ;-)



Digital types do tend to make problems more difficult than necessary,
don't they ?:-)

Hey! I sorta resemble that remark!

Yep. You do ;-)

For *your* information, I've been doing nothing but analog for the
past five months. Harumph!


Good! Learned anything yet ?:-)


Maybe I'll get back to FPGAs soon, but I don't see much but fighting
fires for the next few months. :-(


...Jim Thompson
A simple (1) an instant check for no name (or garbage name) and/or no number for magic 3-tone and hangup, next (2) simple comparison scan in blacklist for same response on match, THEN (3) simple comparison scan in whitelist for passthru, FINALLY failing all of that, simple recorded message similar to "please leave name and number" and hangup after message receipt )3 min max).
.

Relevant Pages

  • Re: test two hash(refs) for equality
    ... The sort routine uses two variables with names ... RW> return an emtpy list and in this case, either $ka or $kb will be undef ... Scan each hash ... I specifically didn't ask for 'download files from the internet' ...
    (comp.lang.perl.misc)
  • Re: [Full-disclosure] JavaScript exploits via source code disclosure
    ... Hash: SHA1 ... If his users are authenticated via say regular form login, ... pass some sort of hash which identifies the user and session to the ... authentication, your webservice's are just as public as any ...
    (Full-Disclosure)
  • Re: Sorting columns in a Transform/crosstab query
    ... Hash: SHA1 ... sort the column headers by project name within a project type. ... You can't sort the PIVOT values and it doesn't matter if the source is ...
    (microsoft.public.access.queries)
  • Re: MRI Machines
    ... Jim Thompson wrote: ... While I sort of understand the theory of the MRI, what I don't understand is what creates all the noise and racket. ... They scanned my head last year, with the gradient coils around my head ... "Treason doth never prosper: what's the reason? ...
    (sci.electronics.design)
  • Re: Sorting a Hash of Arrays by an Element in the Array
    ... > Alf McLaughlin wrote: ... >> element of the array will be sorted in. ... > Your example would only sort numbers correctly. ... but since you can always sort a hash who really cares? ...
    (comp.lang.perl.misc)