From Michael.Paoli at cal.berkeley.edu  Thu Feb  3 21:41:13 2011
From: Michael.Paoli at cal.berkeley.edu (Michael Paoli)
Date: Thu, 03 Feb 2011 21:41:13 -0800
Subject: [buug] $HOME/.Xdefaults
Message-ID: <20110203214113.126628i2kh60bgro@webmail.rawbw.com>

$ cat $HOME/.Xdefaults
XTerm*ttyModes: erase ^H
XTerm*background: black
#ifdef COLOR
XTerm*foreground: yellow
#else
XTerm*foreground: white
#endif
XTerm*loginShell: true
XTerm*saveLines: 2048
XTerm*scrollTtyOutput: false
.xterm.vt100.titeInhibit: true
*VT100.Translations: #override ~Meta <Key>Home: string("\033OH")\n\
                                <Key>End: string("\033OF")
! Change some /etc/X11/app-defaults/XTerm Debian package customizations
! *backarrowKeyIsErase: true
*backarrowKeyIsErase: false
! *ptyInitialErase: true
$



From itz at buug.org  Thu Feb  3 22:20:50 2011
From: itz at buug.org (Ian Zimmerman)
Date: Thu, 03 Feb 2011 22:20:50 -0800
Subject: [buug] $HOME/.Xdefaults
In-Reply-To: <20110203214113.126628i2kh60bgro@webmail.rawbw.com> (Michael
	Paoli's message of "Thu, 03 Feb 2011 21:41:13 -0800")
References: <20110203214113.126628i2kh60bgro@webmail.rawbw.com>
Message-ID: <87wrlg5ni5.fsf@matica.localdomain>


And here's how I make it easy to type foreign characters:

echo 'keycode 110 = Multi_key' | xmodmap -

(the keycode has to be determined with xev - it is different for the
little netbook keyboard even for the same key, which is what I meant
when I said that its keyboard was different)

-- 
Ian Zimmerman <itz at buug.org>
gpg public key: 1024D/C6FF61AD 
fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
Ham is for reading, not for eating.


From khogoboom at gmail.com  Fri Feb  4 05:47:42 2011
From: khogoboom at gmail.com (Karen Hogoboom)
Date: Fri, 4 Feb 2011 05:47:42 -0800
Subject: [buug] substring of integers problem
Message-ID: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>

You may find this helpful:

http://en.wikipedia.org/wiki/Longest_common_substring_problem

Just substitute digits with minus (and plus too if you allow it) as the
alphabet instead of letters.  I think you'd make two copies of the string
and find the common substrings that don't start at the same position.

These algorithms were what I was originally thinking of, but that's if you
know the substring you're searching for:

http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=stringSearching
http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm


Karen
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://buug.org/pipermail/buug/attachments/20110204/835c7ce3/attachment.html>

From itz at buug.org  Fri Feb  4 22:04:20 2011
From: itz at buug.org (Ian Zimmerman)
Date: Fri, 04 Feb 2011 22:04:20 -0800
Subject: [buug] substring of integers problem
In-Reply-To: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	(Karen Hogoboom's message of "Fri, 4 Feb 2011 05:47:42 -0800")
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
Message-ID: <87vd0zt3t3.fsf@matica.localdomain>


Karen> You may find this helpful:
Karen> http://en.wikipedia.org/wiki/Longest_common_substring_problem

That's an interesting problem too, but I don't think it is relevant to
mine :-P  I must have not explained it clearly, so I'll do it again
here.  Apologies to those who have already seen this.

The problem is:  given a list (array, finite sequence, vector - whatever
you want to call it) of integers, positive and negative, find a slice
(contiguous subsequence) which maximizes the *sum* of the integers in
the slice.

Examples: if the input list is [1, 2, 3, -8, 5], then there's exactly one
solution, namely [1, 2, 3].  If the input list is [1, 2, 3, -8, 5, 8]
there's again a unique solution, [5, 8].  If I change the -8 to a -6,
there are now 2 solutions: [5, 8] and the full input list.  Only one
solution is required if there are multiple ones.

-- 
Ian Zimmerman <itz at buug.org>
gpg public key: 1024D/C6FF61AD 
fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
Ham is for reading, not for eating.


From jzitt at josephzitt.com  Sat Feb  5 08:51:57 2011
From: jzitt at josephzitt.com (Joseph Zitt)
Date: Sat, 5 Feb 2011 11:51:57 -0500
Subject: [buug] substring of integers problem
In-Reply-To: <87vd0zt3t3.fsf@matica.localdomain>
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	<87vd0zt3t3.fsf@matica.localdomain>
Message-ID: <AANLkTik57pdgcTPoA0HJe8mV2QnK5EaEOpnmWzFMgUeg@mail.gmail.com>

I didn't see the original post, but for small cases, there's a simple
if inelegant solution.

If the arrays aren't too large and there aren't too many of them, it
might be worthwhile to use relative brute force on them with a Perl
script or something like it. Just add up each of the possible slices
in turn, and choose the one with the largest result. For the sample
set of five items, there are only fifteen possible slices (or ten, if
you don't allow slices of only one item).

But this seems sufficiently obvious that I'm probably making an
incorrect assumption about the actual size of the data being
processed.

On Sat, Feb 5, 2011 at 1:04 AM, Ian Zimmerman <itz at buug.org> wrote:
>
> Karen> You may find this helpful:
> Karen> http://en.wikipedia.org/wiki/Longest_common_substring_problem
>
> That's an interesting problem too, but I don't think it is relevant to
> mine :-P ?I must have not explained it clearly, so I'll do it again
> here. ?Apologies to those who have already seen this.
>
> The problem is: ?given a list (array, finite sequence, vector - whatever
> you want to call it) of integers, positive and negative, find a slice
> (contiguous subsequence) which maximizes the *sum* of the integers in
> the slice.
>
> Examples: if the input list is [1, 2, 3, -8, 5], then there's exactly one
> solution, namely [1, 2, 3]. ?If the input list is [1, 2, 3, -8, 5, 8]
> there's again a unique solution, [5, 8]. ?If I change the -8 to a -6,
> there are now 2 solutions: [5, 8] and the full input list. ?Only one
> solution is required if there are multiple ones.
>
> --
> Ian Zimmerman <itz at buug.org>
> gpg public key: 1024D/C6FF61AD
> fingerprint: 66DC D68F 5C1B 4D71 2EE5 ?BD03 8A00 786C C6FF 61AD
> Ham is for reading, not for eating.
> _______________________________________________
> Buug mailing list
> Buug at weak.org
> http://www.weak.org/mailman/listinfo/buug
>



-- 
Joseph Zitt ::http://www.josephzitt.com


From khogoboom at gmail.com  Sat Feb  5 08:53:10 2011
From: khogoboom at gmail.com (Karen Hogoboom)
Date: Sat, 5 Feb 2011 08:53:10 -0800
Subject: [buug] substring of integers problem
In-Reply-To: <87vd0zt3t3.fsf@matica.localdomain>
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	<87vd0zt3t3.fsf@matica.localdomain>
Message-ID: <AANLkTikCUT-hvJYB8kfAdteMuWg_X89aY0vf4gXyvhFU@mail.gmail.com>

Oh.  O.k.  Hmm.  And you don't think it's NP-Complete...if not then dynamic
programming will probably solve it, but I would have to think awhile, maybe
a long while, to figure out how.

On Fri, Feb 4, 2011 at 10:04 PM, Ian Zimmerman <itz at buug.org> wrote:

>
> Karen> You may find this helpful:
> Karen> http://en.wikipedia.org/wiki/Longest_common_substring_problem
>
> That's an interesting problem too, but I don't think it is relevant to
> mine :-P  I must have not explained it clearly, so I'll do it again
> here.  Apologies to those who have already seen this.
>
> The problem is:  given a list (array, finite sequence, vector - whatever
> you want to call it) of integers, positive and negative, find a slice
> (contiguous subsequence) which maximizes the *sum* of the integers in
> the slice.
>
> Examples: if the input list is [1, 2, 3, -8, 5], then there's exactly one
> solution, namely [1, 2, 3].  If the input list is [1, 2, 3, -8, 5, 8]
> there's again a unique solution, [5, 8].  If I change the -8 to a -6,
> there are now 2 solutions: [5, 8] and the full input list.  Only one
> solution is required if there are multiple ones.
>
> --
> Ian Zimmerman <itz at buug.org>
> gpg public key: 1024D/C6FF61AD
> fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
> Ham is for reading, not for eating.
>



-- 
Karen L. Hogoboom

http://www.linkedin.com/in/karenlhogoboom
http://www.facebook.com/klhogoboom
http://boomtownbits.livejournal.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://buug.org/pipermail/buug/attachments/20110205/b1c758a5/attachment.html>

From itz at buug.org  Sat Feb  5 20:26:25 2011
From: itz at buug.org (Ian Zimmerman)
Date: Sat, 05 Feb 2011 20:26:25 -0800
Subject: [buug] substring of integers problem
In-Reply-To: <AANLkTikCUT-hvJYB8kfAdteMuWg_X89aY0vf4gXyvhFU@mail.gmail.com>
	(Karen Hogoboom's message of "Sat, 5 Feb 2011 08:53:10 -0800")
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	<87vd0zt3t3.fsf@matica.localdomain>
	<AANLkTikCUT-hvJYB8kfAdteMuWg_X89aY0vf4gXyvhFU@mail.gmail.com>
Message-ID: <87ei7lbxfy.fsf@matica.localdomain>


Karen> Oh.  O.k.  Hmm.  And you don't think it's NP-Complete...if not
Karen> then dynamic programming will probably solve it, but I would have
Karen> to think awhile, maybe a long while, to figure out how.

My solution is O(n log n) where n is the size of the input - I didn't do
a formal proof, but it's clear from the structure of it and I did run
huge randomized tests with multiple input sizes which confirmed it.

-- 
Ian Zimmerman <itz at buug.org>
gpg public key: 1024D/C6FF61AD 
fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
Ham is for reading, not for eating.


From khogoboom at gmail.com  Tue Feb  8 09:04:45 2011
From: khogoboom at gmail.com (Karen Hogoboom)
Date: Tue, 8 Feb 2011 09:04:45 -0800
Subject: [buug] substring of integers problem
In-Reply-To: <87vd0zt3t3.fsf@matica.localdomain>
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	<87vd0zt3t3.fsf@matica.localdomain>
Message-ID: <AANLkTimSa_5qodwiy-XEsm550SpRcMTqq2i9cDY6HK6m@mail.gmail.com>

>
> That's an interesting problem too, but I don't think it is relevant to
> mine :-P  I must have not explained it clearly, so I'll do it again
> here.  Apologies to those who have already seen this.
>
> The problem is:  given a list (array, finite sequence, vector - whatever
> you want to call it) of integers, positive and negative, find a slice
> (contiguous subsequence) which maximizes the *sum* of the integers in
> the slice.
>
> Ian,

I think the Knuth-Morris-Pratt Algorithm would be best to solve this.  I
don't have time still to think this through.

LeConte Hall....

Anyway,,,

Remind me to let you draw on my paper next time.

Karen
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://buug.org/pipermail/buug/attachments/20110208/d15b7e9b/attachment.html>

From itz at buug.org  Thu Feb 10 23:46:11 2011
From: itz at buug.org (Ian Zimmerman)
Date: Thu, 10 Feb 2011 23:46:11 -0800
Subject: [buug] substring of integers problem
In-Reply-To: <87ei7lbxfy.fsf@matica.localdomain> (Ian Zimmerman's message of
	"Sat, 05 Feb 2011 20:26:25 -0800")
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	<87vd0zt3t3.fsf@matica.localdomain>
	<AANLkTikCUT-hvJYB8kfAdteMuWg_X89aY0vf4gXyvhFU@mail.gmail.com>
	<87ei7lbxfy.fsf@matica.localdomain>
Message-ID: <87oc6jau9o.fsf@matica.localdomain>


Karen> Oh.  O.k.  Hmm.  And you don't think it's NP-Complete...if not
Karen> then dynamic programming will probably solve it, but I would have
Karen> to think awhile, maybe a long while, to figure out how.

Ian> My solution is O(n log n) where n is the size of the input - I
Ian> didn't do a formal proof, but it's clear from the structure of it
Ian> and I did run huge randomized tests with multiple input sizes which
Ian> confirmed it.

Gee, I just got a book and it says:

"The maximum segment sum problem enjoyed a burst of popularity at the
end of the 1980s, mostly as a showcase for programmers to illustrate
their favourite [sic!] style of program development or their particular
theorem prover."

This book doesn't give the solution, but it refers to Bentley's
Programming Pearls which presumably does.

-- 
Ian Zimmerman <itz at buug.org>
gpg public key: 1024D/C6FF61AD 
fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
Ham is for reading, not for eating.


From khogoboom at gmail.com  Fri Feb 11 08:33:36 2011
From: khogoboom at gmail.com (Karen Hogoboom)
Date: Fri, 11 Feb 2011 08:33:36 -0800
Subject: [buug] substring of integers problem
In-Reply-To: <87oc6jau9o.fsf@matica.localdomain>
References: <AANLkTi=VkbwZQJUFWpz-WOBZ2Z53gAnwhu_kv-u9idBK@mail.gmail.com>
	<87vd0zt3t3.fsf@matica.localdomain>
	<AANLkTikCUT-hvJYB8kfAdteMuWg_X89aY0vf4gXyvhFU@mail.gmail.com>
	<87ei7lbxfy.fsf@matica.localdomain>
	<87oc6jau9o.fsf@matica.localdomain>
Message-ID: <AANLkTi=XYC4NAmHqSVGt-UV5Yqv_G+LVjK+gQe0-+tn2@mail.gmail.com>

I am unemployed, so I was trying networking to get a job, but since I had
applied to NSA and just recently to CIA, LBL and a few other places for a
job, things are apparently being counterfeited...just remind me what to
bring on Thursday.  I plan to be there.

On Thu, Feb 10, 2011 at 11:46 PM, Ian Zimmerman <itz at buug.org> wrote:

>
> Karen> Oh.  O.k.  Hmm.  And you don't think it's NP-Complete...if not
> Karen> then dynamic programming will probably solve it, but I would have
> Karen> to think awhile, maybe a long while, to figure out how.
>
> Ian> My solution is O(n log n) where n is the size of the input - I
> Ian> didn't do a formal proof, but it's clear from the structure of it
> Ian> and I did run huge randomized tests with multiple input sizes which
> Ian> confirmed it.
>
> Gee, I just got a book and it says:
>
> "The maximum segment sum problem enjoyed a burst of popularity at the
> end of the 1980s, mostly as a showcase for programmers to illustrate
> their favourite [sic!] style of program development or their particular
> theorem prover."
>
> This book doesn't give the solution, but it refers to Bentley's
> Programming Pearls which presumably does.
>
> --
> Ian Zimmerman <itz at buug.org>
> gpg public key: 1024D/C6FF61AD
> fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
> Ham is for reading, not for eating.
>



-- 
Karen L. Hogoboom

http://www.linkedin.com/in/karenlhogoboom
http://www.facebook.com/klhogoboom
http://boomtownbits.livejournal.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://buug.org/pipermail/buug/attachments/20110211/59a87a80/attachment.html>

From Michael.Paoli at cal.berkeley.edu  Mon Feb 14 13:19:38 2011
From: Michael.Paoli at cal.berkeley.edu (Michael Paoli)
Date: Mon, 14 Feb 2011 13:19:38 -0800
Subject: [buug] BALUG TOMRROW! Tu 2011-02-15 BALUG meeting
Message-ID: <20110214131938.13094cak3crlsby8@webmail.rawbw.com>

BALUG TOMRROW! Tu 2011-02-15 BALUG meeting

Bay Area Linux User Group (BALUG) meeting
Tuesday 6:30 P.M. 2011-02-15

Please RSVP if you're planning to come (see further below).

For our 2011-02-15 BALUG meeting, at least presently we don't have a
specific speaker/presentation lined up for this meeting, but that
doesn't prevent us from having interesting and exciting meetings.
Sometimes we also manage to secure/confirm a speaker too late for us to
announce or fully publicise the speaker (that's happened at least twice
in the past five or so years).  Got questions, answers, and/or
opinions?  We typically have some expert(s) and/or relative expert(s)
present to cover LINUX and related topic areas.  Want to hear some
interesting discussions on LINUX and other topics?  Show up at the
meeting, and feel free to bring an agenda if you wish.  Want to help
ensure BALUG has speakers/presentations lined up for future meetings?
Help refer speakers to us and/or volunteer to be one of the speaker
coordinators.  Good food, good people, and interesting conversations to
be had.

So, if you'd like to join us please RSVP to:

                       rsvp at balug.org

**Why RSVP??**

Well, don't worry we won't turn you away, but the RSVPs really help
BALUG and the Four Seas Restaurant plan the meal and meeting, and with
sufficient attendance, they also help ensure that we'll be able to eat
upstairs in the private banquet room.

Meeting Details...

                       6:30pm
                       Tuesday, February 15th, 2011 2011-02-15

                       Four Seas Restaurant http://www.fourseasr.com/
                       731 Grant Ave.
                       San Francisco, CA 94108
                       Easy PARKING:
                         Portsmouth Square Garage at 733 Kearny:
                         http://www.sfpsg.com/

Cost: The meetings are always free, but for dinner, for your gift of $13
             cash, we give you a gift of dinner - joining us for a yummy
             family-style Chinese dinner - tax and tip included (your gift
             also helps in our patronizing the restaurant venue and helping
             to defray BALUG costs such treating our speakers to dinner).

Feedback on our publicity/announcements (e.g. contacts or lists where we
should get our information out that we're not presently reaching, or
things we should do differently): publicity-feedback at balug.org

http://www.balug.org/



From Michael.Paoli at cal.berkeley.edu  Wed Feb 16 19:04:11 2011
From: Michael.Paoli at cal.berkeley.edu (Michael Paoli)
Date: Wed, 16 Feb 2011 19:04:11 -0800
Subject: [buug] Debian CDs @ BUUG Thursday
Message-ID: <20110216190411.75111gutrgebs940@webmail.rawbw.com>

I have some Debian GNU/Linux 6.0.0 "Squeeze" CDs that I'll be bringing
to this Thursday's BUUG meeting.  That's the latest
"stable"(/production) Debian release, Debian 6.0 "Squeeze" released
2011-02-06

The CDs I have are i386 and amd64:
Debian GNU/Linux 6.0.0 "Squeeze" - Official i386 CD Binary-1
Debian GNU/Linux 6.0.0 "Squeeze" - Official amd64 CD Binary-1

http://www.debian.org/News/2011/20110205a
http://www.balug.org/



From itz at buug.org  Thu Feb 17 07:00:09 2011
From: itz at buug.org (Ian Zimmerman)
Date: Thu, 17 Feb 2011 07:00:09 -0800
Subject: [buug] Debian CDs @ BUUG Thursday
In-Reply-To: <20110216190411.75111gutrgebs940@webmail.rawbw.com> (Michael
	Paoli's message of "Wed, 16 Feb 2011 19:04:11 -0800")
References: <20110216190411.75111gutrgebs940@webmail.rawbw.com>
Message-ID: <8739nmln9i.fsf@matica.localdomain>


Michael> I have some Debian GNU/Linux 6.0.0 "Squeeze" CDs that I'll be
Michael> bringing to this Thursday's BUUG meeting.  That's the latest
Michael> "stable"(/production) Debian release, Debian 6.0 "Squeeze"
Michael> released 2011-02-06

I'm not coming this time, so just a reminder: even though squeeze is
barely 2 weeks old there have already been security updates.  If you
pick up Michael's CDs don't forget to configure the packaging machinery
to subscribe to them.

-- 
Ian Zimmerman <itz at buug.org>
gpg public key: 1024D/C6FF61AD 
fingerprint: 66DC D68F 5C1B 4D71 2EE5  BD03 8A00 786C C6FF 61AD
Ham is for reading, not for eating.


From khogoboom at gmail.com  Mon Feb 21 09:45:10 2011
From: khogoboom at gmail.com (Karen Hogoboom)
Date: Mon, 21 Feb 2011 09:45:10 -0800
Subject: [buug] Smalltalk
Message-ID: <AANLkTikVsdHBcgZS+Hr+uw47AVnDsXMGJrHxr5PdTdvV@mail.gmail.com>

Thank you John for directing me to squeak.  I tried to play it on my Dell,
but it wouldn?t build under my (now hacked) installation of FreeBSD.

Michael, thank you for recommending OpenBSD last night   It was nice to have
you ?make mommy happy"enough that the sun came out and kept us warm for
quite awhile.

Karen
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://buug.org/pipermail/buug/attachments/20110221/617b1729/attachment.html>