Subject: Re: NotebookWrite[] question
notebookwritequestionanswer = NotebookCreate[];
NotebookWrite[notebookwritequestionanswer,
Cell[BoxData[ToBoxes[{Plot[x], did you ask? }]],Output]]
g= Plot[Sin[x], {x, 0, 2Pi}];
NotebookWrite[notebookwritequestionanswer,
Cell[GraphicsData[PostScript,DisplayString[g] , Graphics]]]
does it.
> Hi everyone,
> I have a notebook, which some initialization cells. I would like the
output (animated graphs, some values) of these initialization cells to be in
a different notebook. Is this possible
> For Example:
> NotebookA has the following:
> Print[x]
> Plot [x,{x,0,5}]
> I would like to direct to output of these to a another notebook,
NotebookB
> Ekta
===
Subject: Re: Notebook output write to a different file
<< Graphics`Graphics`
notebookwritequestionanswer = NotebookCreate[];
NotebookWrite[notebookwritequestionanswer,
Cell[BoxData[ToBoxes[{Plot[x], did you ask? }]], Output]];
g = DisplayTogether[
Table[Plot[Sin[x] + Random[], {x, 0, 2Pi},
PlotStyle > GrayLevel[0.8]], {5}], DisplayFunction > Identity];
NotebookWrite[notebookwritequestionanswer,
Cell[GraphicsData[PostScript, DisplayString[g] , Graphics]]];
does what you want
> Hi Everyone,
> I in fact have another question. I have a gui (using guikit) that
> opens up NotebookA and does all the evaluation in it (graphics, mainly
> graphics). However I would like write each of the output cells to a
> different notebook, for example notebookB.
> Is this possible?
> Namrata
===
Subject: Re: dashing the lines make the plot looks so bad
hi
i just realized that i didn't reply to this.
ok it prints much btter on paper.
will it be the same if i export the graphic into word. for example? i
forgot to try it... i guess i could just try it next week.
what is the reason for such poor display on monitor? maybe it's the
frontend deal...
> on screen or in the printout by a PostScript
> printer ?
>
> kim <_incali@yahoo.com> schrieb im Newsbeitrag
> for example,
> Show[Graphics[{AbsoluteDashing[{10, 5}], Line[{{0, 1},
> {1, 0}}], Thickness[0.02], AbsoluteDashing[{5, 10}],
> Line[{{0, 0}, {1, 1}}]}]];
> making it thicker shows the problem even more
> severely.
> but it appears to me there is some kinda pattern... i
> just don't know what it is.
> below shows this pattern (i think) of dashes showing
> up rotated every so often.
> Needs[Graphics`Legend`];
> Needs[Graphics`Colors`];
> << Graphics`Graphics`
> Plot[{Sin[x], Cos[x]}, {x, 0, 5Pi}, PlotStyle > {Red,
> {Blue, Thickness[0.02] , AbsoluteDashing[{1, 10}]}},
> LegendLabel > this stuff nlooks weird, PlotLegend
> > {Sin, Cos}, LegendPosition > {1.1, .25},
> LegendShadow > {0, 0}, ImageSize > 500];
> maybe if we get rid of the rotations, then the dashing
> will improve in appearance. so... is that possible?
__________________________________
> Do you Yahoo!?
> Check out the new Yahoo! Front Page.
> www.yahoo.com
===
Subject: Redefining the minus operator
Is there a way in Mathematica to redefine the minus sign to stand for a
function of your choosing?
For example, I'd like to be able to do something like this:
In[1]:= Subtract[a_, b_] := MINUS[a, b]
In[2]:= FullForm[x  y]
Out[2]:= MINUS[x, y]
In[3]:= 1  0
Out[3]:= MINUS[1, 0]
What actually happens is:
In[2]:= FullForm[x  y]
Out[2]:= PLUS[x, Times[1, y]]
In[3]:= 1  0
Out[3]:= 1
Naturally, I'd also like to redefine the plus sign, too. When Plus[a_,
b_] is redefined as PLUS[a,b], then x + y indeed evaluates as PLUS[x,
y]. But Mathematica still simplifies if there are numbers in the
expression: FullForm[1 + 0] comes out as 1.
Ben Kovitz
Humboldt State University
===
Subject: Re: : Descriptive headings
At the Google archive, at least, changing the subject disconnects a message
from the thread, starting a new one. Often I go there to find things, and
it's inconvenient when this kind of thing has occurred.
Bobby
> Paul,
> This is an idea that sounds nice in principle but is probably very
difficult
> in practice. It just imposes another test that a submission has to go
> through before final posting. Whether the test is on the moderator or the
> poster, it is just going to be an annoyance. Yes, it would be nice if
> posters always used succinct perfectly descriptive headers but I would
> rather things be open and easy than trying to shoehorn every posting into
> some category.
> But this does raise the question: Does it help if repliers change the
> headings to make them more descriptive and if so, to what extent should
they
> change them?
> David Park
> djmp@earthlink.net
> http://home.earthlink.net/~djmp/
> [I will be commenting on this in a post shortly  moderator]
> Hi all, and especially Steve Christensen:
> At the recent Wolfram Technology Conference in Champaign, Luc Barthelet
> , a regular user of MathGroup suggested that it would be
> good if all postings to MathGroup included a categorisation in their
> header, e.g.
> Newbies, Graphics, Functions, Programming, Statistics, Teaching,
> Integration, Numerics, Symbolic Algebra, Special Functions, ...
> so a Subject line might take the form
> [Statistics]: How to fit to an elliptical function?
> (not sure if the [ ] are required or useful). In this way, sorting by
> Subject would be easier. Of course, it's not always easy to do such a
> categorisation, and they may change with time (as a problem stated as a
> Numerics might end up being solved using Symbolic Algebra).
> Nevertheless, I think such a change would be very useful. It should also
> help when doing searches on MathGroup archives.
> Paul
> 
> Paul Abbott Phone: +61 8 6488 2734
> School of Physics, M013 Fax: +61 8 6488 1014
> The University of Western Australia (CRICOS Provider No 00126G)
> 35 Stirling Highway
> Crawley WA 6009 mailto:paul@physics.uwa.edu.au
> AUSTRALIA http://physics.uwa.edu.au/~paul

DrBob@bigfoot.com
www.eclecticdreams.net
===
Subject: Re: : Descriptive headings
We can't even get meaningful subjects a lot of the time. newbie question
is pretty typical.
Ask for meaningful categories, and simple minds will be overloaded; it could
be dangerous.
Bobby
> I am not sure whether having each time to think of a categorisation
> would not cause enough trouble to discourage people from sending useful
> posts that may be difficult to categorise. And, on the other hand,
> have to include a number of controversial but timehonoured categories
> of the kind : New Version New Bugs, It's not a bug it's a feature,
> you twit, Yet Another Stroke of Genius!!!, A counterexample to
> Fermat's Theorem! and so on...
> And what about this one?
> Andrzej Kozlowski
> Chiba, Japan
> http://www.akikoz.net/~andrzej/
> http://www.mimuw.edu.pl/~akoz/
>> [I will be commenting on this in a post shortly  moderator]
>> Hi all, and especially Steve Christensen:
>> At the recent Wolfram Technology Conference in Champaign, Luc Barthelet
>> , a regular user of MathGroup suggested that it would be
>> good if all postings to MathGroup included a categorisation in their
>> header, e.g.
>> Newbies, Graphics, Functions, Programming, Statistics, Teaching,
>> Integration, Numerics, Symbolic Algebra, Special Functions, ...
>> so a Subject line might take the form
>> [Statistics]: How to fit to an elliptical function?
>> (not sure if the [ ] are required or useful). In this way, sorting by
>> Subject would be easier. Of course, it's not always easy to do such a
>> categorisation, and they may change with time (as a problem stated as a
>> Numerics might end up being solved using Symbolic Algebra).
>> Nevertheless, I think such a change would be very useful. It should
>> also
>> help when doing searches on MathGroup archives.
>> Paul
>> 
>> Paul Abbott Phone: +61 8 6488 2734
>> School of Physics, M013 Fax: +61 8 6488 1014
>> The University of Western Australia (CRICOS Provider No 00126G)
>> 35 Stirling Highway
>> Crawley WA 6009 mailto:paul@physics.uwa.edu.au
>> AUSTRALIA http://physics.uwa.edu.au/~paul

DrBob@bigfoot.com
www.eclecticdreams.net
===
Subject: Re: Re: MathGroup /: Descriptive headings
I can volunteer (on a limited basis, if it helps and doesn't get too
onerous) to post notebooks on my website for people who can't do it
themselves. In many cases  maybe most cases  I'd just use the Copy as
InputForm palette and return the code to them.
As for spam, David Park and I both use SpamArrest http://www.spamarrest.com/
to eliminate spam. It really works. The only downside to it for me  and I
don't think this should apply to you, the moderator  is that I have to
check the stopped mail I _want_ from senders who aren't human.
[SpamArrest would not work on my systems which are not Windows. I only use
UNIX systems. I consider Windows systems to be a security risk I do not
want anywhere near my work. I use spamassassin and my own hand built
procmail filters.  Moderator]
You shouldn't want mail like that at all, at the mathgroup address.
Bobby
> See my comments within the message below.
> Steve Christensen
>> I want to take the opportunity to reply to Paul's suggestion in
>> as much detail as possible.
>> I am sorry I was not at the event at the Wolfram Technology
>> Conference when this was discussed.
>> First, here are the steps I take each day to moderate this group.
>> Figuring out where in these steps to put in categorization would need
>> to fit into this.
>> 1. I get perhaps 25003000 emails a day, every day. Of these,
perhaps
>> 500 are not spam. Because the Mathgroup addresses are easily
found
>> by spammers, there is no way around getting a lot of spam.
>> Do you mean that the spammers are forging email addresses of MathGroup
>> participants and using these to post messages to MathGroup
>> (mathgroup@wolfram.com)? I can see how that would make things more
difficult
>> to filter.
> Yes, this happens all the time. Spam comes to mathgroup via mailing
> list messages, newsgroup posts, spammers who have just found addresses
> in the newsgroups and archives.
>> If I understand you correctly, requiring individuals to register
with
>> you, possibly listing multiple email addresses, and bouncing email that
>> is not from registered participants, with a message telling them how to
>> register, would not work.
> No this would not work. I even get spam from wolfram.com addresses
> even though I know it did not come from there. I sometimes get
> spam from myself!
>> Because I usually post from a news reader, my messages have the
>> following field:
>> Could this be used as a filter (or do spammers forge this as well)?
> Spammers forge every element of posts.
>> cost money, only of the order of a couple of cents, to send any email
>> message. You would need to purchase a valid oneoff estamp, using
>> some form of encryption technology, from some site (I'm suprised that
>> the automatic billing sites have not already done this). Then only valid
>> estamps would be routed though the network. There are, of course, many
>> issues with this proposal ...]
>> Further, because MathGroup users often, unfortunately,
>> send html email or other attachments, maybe 1020 of their mails
get
>> filtered by my, fairly sophisticated but not perfect, spam filters
into
>> my spam folder.
>> To me, one of the major limitations of MathGroup is that we cannot
>> attach Notebooks (without including them in the body of the message).
> Attaching notebooks causes numerous problems.
> 1. Notebooks as attachments are very often rejected by spam filters
> either at ISP's, moderation level, or end users.
> 2. Can a windows user really trust that a notebook attachment is not
> a virus or worm? If I were using a Windows machine and saw an
> attachment, I would not open it.
> 3. Many notebooks are very long and some mail systems will not be able
> to handle them. Rules about attached notebooks would have
> to be devised. Not a simple matter given that I get so many
> posts that can't follow even simpler rules.
> It is far simpler to have someone put their notebook on a server
somewhere
> where it can be downloaded and then include a link within the post.
>> 2. Of the 500 good emails that get past my spam filters, I then have
to
>> filter out those mails that are for Mathgroup. Then, I have to
>> go through the spam folder to find any MathGroup posts that might
be
>> there. So,there are usually about 70 emails relevant to
MathGroup.
>> Some, maybe 10 do not follow the rules  flames, licensing
questions,
>> discussions of other systems, really trivial items, totally
>> nonMathematica
>> related. In the end, there are 3060 emails to read in more
detail.
>> Actually, if the Subject line included question categories as is being
>> proposed, couldn't you use this as the primary filter (or again, do
>> spammers forge this as well)?
> Again, spammers will grab email addresses, Subject lines, even
> content sometimes. Most of that comes to me where I filter it.
> But I have had some reports that people get email from mathgroup
> and I did not send.
>> 3. Once I decide that the posts are OK, I run them through a number
of
>> UNIX scripts and do some more editing to take out unneeded mail
headers
>> etc.
>> 4. Then the mails are run through scripts that send them to the
>> newsgroup and the mailing list. One of the scripts adds the
>> numbers to the Subject line of the mail that goes to
>> the mailing list. Note that the [ ] are really needed.
>> As I read MathGroup in a newsreader or sometimes via Google at
>> I do not see the numbers or the []. Google seems to handle threading
>> better than my newsreader.
> The numbers only go out to the mailing list to help with
>> The numbers do not appear at
>> until you click on a particular message so I'm not sure exactly how they
>> are useful (but then again, I avoid mailing lists and prefer to use
>> newsgroups or the web). (And I wonder why the Mathgroup archive is not
>> threaded?)
> The archive gets its message from the mailing list and I also think
> it just uses a mail to html script and not a threaded system. I do
> not do the archive.
>> Suppose you just put Statistics in the Subject line, mail filters
might
>> not always know how to do the filtering, whereas [Statistics]
>> is easier to filter.
>> This process takes from 13 hours typically, depending on the
>> number of emails, their complexity, etc.
>> I did not realise exactly how big a task you face.
> Clearly if it weren't for the spam, it would be easier.
>> So, the questions are, when during this process would categorisation
>> take place? Who would do it?
>> It would be best if contributors did such a categorisation for you, i.e.
>> at the time of posting.
>> What would it look like?
>> Instead of [], another suggestion would be (mock Mathematica syntax
>> using /:), e.g.,
>> Statistics /: Chisquare test
>> This would also be harder to forge and should still be easy to filter.
> It might be possible if we can define say only 10 categories and
> then put the category either in a special header or within the
> test of a message. This could be done in a voluntary way by
> the person sending the post.
> If people want to send me a list of 10 categories, I can collect
> them and see if there really are 10 or maybe 100, which would
> be silly I think.
> Another idea would be for someone clever to write a script that
> could categorize a post. For example, all words in a post
> could be extracted to a list and then compared to a list of
> categories and those categories that that fit could be chosen
> and put on say the top line of the post to help with filtering.
> Some posts might not be easy to treat in this way, but it might
> help.
> Paul, this is your suggestion and you are known to be very clever, want
to
> write such a program?
> In truth, I don't think I want to do anything unless there is
> a significant vote from end users to do it and a nice way
> to handle it consistently
>> How would it effect mail and newsgroup readers?
>> I imagine that it would have little effect, except the desired one of
>> allowing better filtering.
>> I think it would be a bad idea to put things like [Statistics] in
>> the Subject line. Would newsgroup and mail readers be able to
>> thread such Subject lines?
>> Surely that is exactly what they are designed to do.
>> And I could filter the messages into subfolders of my MathGroup folder
>> automatically.
>> It might be better to put it in something like an XCategory mail
header,
>> but I am not sure that all readers could handle this.
>> This idea has merit and, again, it might be harder to forge, but I don't
>> know enough about these headers.
>> Personally, I think they would just make the Subject lines longer
>> and harder to read.
>> Nested Re: Re: Re: ... already does this, though Google handles this
>> very well, in its threading, dropping all Re at the top level, listing
>> only the subject, and then listing the contributor for each item in the
>> thread.
> Yes, the Re Re Re is a problem and I will try to fix that.
>> Who is going to do the categorisation?
>> The contributor.
>> I know a lot about
>> Mathematica and mathematics, but certainly not enough to figure
>> out what every message best fits into. If I make a poor selection
>> and a message has gone out it is virtually impossible to redo
>> listings, archives, etc.
>> Sometimes categorizations have to change. You could have
>> Numerics > Graphics /: Accurate plotting
>> when there is such a change.
>> Search therefore becomes inaccurate very quickly.
>> I don't think that this is true.
>> What if someone disagrees with my selections?
>> Not a big issue, I think. I think the group will come to consensus on a
>> categorization, or move on to a different categorization as required.
>> How much time will this add to moderation?
>> I would hope that it would greatly _reduce_ your moderation time.
> I can assure you that adding more complexity to the posts will
> increase moderation time.
>> If others select the categories to help me out, that will just
>> delay moderation.
>> I do not see why.
>> a category, but how does a new user know what category to pick?
>> There should be a list in the rules section at
>> http://smc.vnet.net/mathgroup.html
>> What if a users forgets to include a categorisation?
>> You can add one.
>> Is someone going to go back and categorise the 51,000 messages that
>> are already in the archive?
>> Unlikely, I think. However, I expect that the archive has grown
>> exponentially and will continue to do so.
>> The simplest thing to do would be to have some group that is willing
>> categorise the posts once they get into the Wolfram Research
>> archive only. Then search could be done fairly easily.
>> This sort of categorisation may be done in other newsgroups, but
>> I have not seen it.
>> I expect that it is used on other newsgroups, but I have not seen it, or
>> there are subgroups.
>> sci.math
>> sci.math.symbolic
> If you look at these groups you will find no real categorisation
> of any kind. I could not find any group that had any.
>> I am open to suggestions and comments, but I frankly this this
>> is going to be a very difficult process to do.
>> It was intended as a suggestion to reduce your workload, to speed up the
>> rate of posting to MathGroup, and to improve the automatic filtering
>> (and threading) of messages.
>> Paul
>> Hi all, and especially Steve Christensen:
>> At the recent Wolfram Technology Conference in Champaign, Luc
Barthelet
>> , a regular user of MathGroup suggested that it would be
>> good if all postings to MathGroup included a categorisation in their
>> header, e.g.
>> Newbies, Graphics, Functions, Programming, Statistics, Teaching,
>> Integration, Numerics, Symbolic Algebra, Special Functions, ...
>> so a Subject line might take the form
>> [Statistics]: How to fit to an elliptical function?
>> (not sure if the [ ] are required or useful). In this way, sorting by
>> Subject would be easier. Of course, it's not always easy to do such a
>> categorisation, and they may change with time (as a problem stated as
a
>> Numerics might end up being solved using Symbolic Algebra).
>> Nevertheless, I think such a change would be very useful. It should
also
>> help when doing searches on MathGroup archives.
>> Paul
>> 
>> Paul Abbott Phone: +61 8 6488 2734
>> School of Physics, M013 Fax: +61 8 6488 1014
>> The University of Western Australia (CRICOS Provider No 00126G)
>> 35 Stirling Highway
>> Crawley WA 6009 mailto:paul@physics.uwa.edu.au
>> AUSTRALIA http://physics.uwa.edu.au/~paul

DrBob@bigfoot.com
www.eclecticdreams.net
===
Subject: Re: MathGroup /: Descriptive headings
Having read about the quantity of spam our moderator has to handle, it
seems to me that it might be useful to think about changes that would
lessen his load. I suppose if we insisted on one of a number of
keywords, such as STATISTICS, SYMBOLIC, GRAPHICS, MATHEMATICA (to supply
a misc option), etc. that might help to filter the spam, which is
presumably so automated that it will not attempt to conform to such rules.
David Bailey
===
Subject: Re: Re: MathGroup /: Descriptive headings
Steve,
I read the list every day and have for a few years. I
post occasionly but find the list very useful and this
group one of my most valuable resources in my
business. I think you do a great job. The only
suggestion that I have is, 'Is there some way to make
your life easier'? Otherwise don't fix what isn't
Cliff Martin
 Steven M. Christensen Steve Christensen
Steven M. Christensen I want to take the opportunity to reply to
> Paul's suggestion in
> as much detail as possible.
I am sorry I was not at the event at the Wolfram
> Technology
> Conference when this was discussed.
First, here are the steps I take each day to
> moderate this group.
> Figuring out where in these steps to put in
> categorization would need
> to fit into this.
1. I get perhaps 25003000 emails a day, every
> day. Of these, perhaps
> 500 are not spam. Because the Mathgroup
> addresses are easily found
> by spammers, there is no way around getting
> a lot of spam.
Do you mean that the spammers are forging email
> addresses of MathGroup
> participants and using these to post messages to
> MathGroup
> (mathgroup@wolfram.com)? I can see how that would
> make things more difficult
> to filter.
> Yes, this happens all the time. Spam comes to
> mathgroup via mailing
> list messages, newsgroup posts, spammers who have
> just found addresses
> in the newsgroups and archives.
If I understand you correctly, requiring
> individuals to register with
> you, possibly listing multiple email addresses,
> and bouncing email that
> is not from registered participants, with a
> message telling them how to
> register, would not work.
> No this would not work. I even get spam from
> wolfram.com addresses
> even though I know it did not come from there. I
> sometimes get
> spam from myself!
Because I usually post from a news reader, my
> messages have the
> following field:
> Could this be used as a filter (or do spammers
> forge this as well)?
> Spammers forge every element of posts.
found. To me, it should
> cost money, only of the order of a couple of
> cents, to send any email
> message. You would need to purchase a valid
> oneoff estamp, using
> some form of encryption technology, from some site
> (I'm suprised that
> the automatic billing sites have not already done
> this). Then only valid
> estamps would be routed though the network. There
> are, of course, many
> issues with this proposal ...]
Further, because MathGroup users often,
> unfortunately,
> send html email or other attachments, maybe
> 1020 of their mails get
> filtered by my, fairly sophisticated but not
> perfect, spam filters into
> my spam folder.
To me, one of the major limitations of MathGroup
> is that we cannot
> attach Notebooks (without including them in the
> body of the message).
> Attaching notebooks causes numerous problems.
> 1. Notebooks as attachments are very often rejected
> by spam filters
> either at ISP's, moderation level, or end users.
> 2. Can a windows user really trust that a notebook
> attachment is not
> a virus or worm? If I were using a Windows
> machine and saw an
> attachment, I would not open it.
> 3. Many notebooks are very long and some mail
> systems will not be able
> to handle them. Rules about attached notebooks
> would have
> to be devised. Not a simple matter given that I
> get so many
> posts that can't follow even simpler rules.
> It is far simpler to have someone put their notebook
> on a server somewhere
> where it can be downloaded and then include a link
> within the post.
>
> 2. Of the 500 good emails that get past my spam
> filters, I then have to
> filter out those mails that are for
> Mathgroup. Then, I have to
> go through the spam folder to find any
> MathGroup posts that might be
> there. So,there are usually about 70 emails
> relevant to MathGroup.
> Some, maybe 10 do not follow the rules 
> flames, licensing questions,
> discussions of other systems, really trivial
> items, totally
> nonMathematica
> related. In the end, there are 3060 emails
> to read in more detail.
Actually, if the Subject line included question
> categories as is being
> proposed, couldn't you use this as the primary
> filter (or again, do
> spammers forge this as well)?
> Again, spammers will grab email addresses, Subject
> lines, even
> content sometimes. Most of that comes to me where I
> filter it.
> But I have had some reports that people get email
> from mathgroup
> and I did not send.
>
> 3. Once I decide that the posts are OK, I run
> them through a number of
> UNIX scripts and do some more editing to
> take out unneeded mail headers
> etc.
4. Then the mails are run through scripts that
> send them to the
> newsgroup and the mailing list. One of the
> scripts adds the
> numbers to the Subject line of the mail
> that goes to
> the mailing list. Note that the [ ] are
> really needed.
As I read MathGroup in a newsreader or sometimes
> via Google at
I do not see the numbers or the []. Google seems
> to handle threading
> better than my newsreader.
The numbers only go out to the mailing
> list to help with
> filtering. They will not be seen in the newsgroup
===
Subject: Re: Counting Runs
Here is another method,; not as fast as some of the others but quite
amusing. In TraditionalForm the form of the answer is pleasanlty
compact:
Times @@ (HoldForm /@ Split[v][[All, 1]])
Andrzej
> *This message was transferred with a trial version of CommuniGate(tm)
> Pro*
> I've updated my notebook again, under the Run Counts link at:
> http://eclecticdreams.net/DrBob/mathematica.htm
> I'm not sure whether solver performance depends mostly on the number
> of runs, or the number of different values in a data list. The two are
> somewhat inversely related, of course.
> The fastest solvers are brt4 (using Frequencies) and hanlonTreat
> (hanlon3, with Part instead of Map).
> Bobby
>> It must be machine or OS dependent.
>> I rediscovered Hanlon3 method :) and ran it with Bobby's newest. I
>> don't have Bobby's data so I generated random didgits in the 09 range
>> Here are the results:
>> In[28]:=
>> v = Table[Random[Integer,
>> {0, 9}], {i, 1, 10^7}];
>> In[29]:=
>> Timing[({First[#1],
>> Length[#1]} & ) /@
>> Split[Sort[First /@
>> Split[v]]]]
>> Out[29]=
>> {35.58*Second, {{0, 898901},
>> {1, 899397}, {2, 901191},
>> {3, 899449}, {4, 900824},
>> {5, 900262}, {6, 899338},
>> {7, 900293}, {8, 900196},
>> {9, 901311}}}
>> In[32]:=
>> Timing[({First[#1],
>> Length[#1]} & ) /@
>> Split[Sort[Split[v][[All,
>> 1]]]]]
>> Out[32]=
>> {38.67999999999998*Second,
>> {{0, 898901}, {1, 899397},
>> {2, 901191}, {3, 899449},
>> {4, 900824}, {5, 900262},
>> {6, 899338}, {7, 900293},
>> {8, 900196}, {9, 901311}}}
>> My machine is a 1.25Ghz G4 with 2G Ram and with OSX 10.3.5.
>> J.87nos
> I found an even faster (rather obvious) solution:
> hanlonTreat[v_] := {First@#, Length@#} & /@ Split@Sort[Split[v][[All,
> 1]]]
> It about 80% faster than hanlon4.
> Bobby
>> I timed the posted methods except Andrzej's  it's the only one
>> that
>> works only for +1/1 data  plus a couple of my own that I haven't
>> posted. David Park's method seems the same as the fastest method,
>> hanlon3. I modified all methods to return a pair {x, number of runs
>> in x} for each x in the data.
>> Two of Bob Hanlon's methods beat all the rest of us  but one of
>> his
>> is the slowest method, too.
>> I've posted a notebook at the Run Counts link at:
>> http://eclecticdreams.net/DrBob/mathematica.htm
>> Bobby
> Hi Greg,
The following seems to work pretty well:
runscount[lst_?VectorQ] :=
> Module[{elems, flips, counts},
> elems = Union[lst];
> flips = Cases[Partition[lst, 2, 1], {x_, y_} /; x =!= y];
> counts = {#, Count[Most[flips], {#, _}]} & /@ elems;
> {x1, x2} = Last[flips];
> counts /. {{x1, y_} > {x1, y+1}, {x2, y_} > {x2, y+1}}]
Example:
Table[Random[Integer, {1, 5}], {20}]
> runscount[%]
{2, 2, 3, 1, 3, 2, 2, 3, 1, 1, 2, 3, 1, 1, 3, 1, 1, 2, 2, 2}
{{1, 4}, {2, 4}, {3, 5}}
> 
> Selwyn Hollis
> http://www.appliedsymbols.com
> (edit replyto to reply)
> Looking for an elegant way to count runs to numbers in a series.
>> Suppose I have a list of ones and negative ones such as
>> tv={1,1,1,1,1,1,1,1,1,1,1,1,1,1}.
>> I'd like to create a function that counts the number of runs of 1s
>> and
>> 1s, which in this case is 3 and 2.
>> tGreg
>

> DrBob@bigfoot.com
> www.eclecticdreams.net
>> 
>> J.87nos L.9abb
>> Yale University School of Medicine
>> Department of Pathology
>> Phone: 2037375204
>> Fax: 2037857303
>> Email: janos.lobb@yale.edu
> 
> DrBob@bigfoot.com
> www.eclecticdreams.net
===
Subject: Re: Counting Runs
But it's very easy to adapt my method to general data:
v = Table[Random[Integer,{0,3}],{20}]
{0,2,2,1,2,1,1,1,1,1,3,2,3,2,3,3,0,3,3,1}
With[{u=Split[v],w=Union[v]},Map[Count[u,{Repeated[#]}]&,w]]
{2,3,4,4}
Andrzej
> I timed the posted methods except Andrzej's  it's the only one that
> works only for +1/1 data  plus a couple of my own that I haven't
> posted. David Park's method seems the same as the fastest method,
> hanlon3. I modified all methods to return a pair {x, number of runs in
> x} for each x in the data.
> Two of Bob Hanlon's methods beat all the rest of us  but one of his
> is the slowest method, too.
> I've posted a notebook at the Run Counts link at:
> http://eclecticdreams.net/DrBob/mathematica.htm
> Bobby
>> Hi Greg,
>> The following seems to work pretty well:
>> runscount[lst_?VectorQ] :=
>> Module[{elems, flips, counts},
>> elems = Union[lst];
>> flips = Cases[Partition[lst, 2, 1], {x_, y_} /; x =!= y];
>> counts = {#, Count[Most[flips], {#, _}]} & /@ elems;
>> {x1, x2} = Last[flips];
>> counts /. {{x1, y_} > {x1, y+1}, {x2, y_} > {x2, y+1}}]
>> Example:
>> Table[Random[Integer, {1, 5}], {20}]
>> runscount[%]
>> {2, 2, 3, 1, 3, 2, 2, 3, 1, 1, 2, 3, 1, 1, 3, 1, 1, 2, 2, 2}
>> {{1, 4}, {2, 4}, {3, 5}}
>> 
>> Selwyn Hollis
>> http://www.appliedsymbols.com
>> (edit replyto to reply)
> Looking for an elegant way to count runs to numbers in a series.
> Suppose I have a list of ones and negative ones such as
> v={1,1,1,1,1,1,1,1,1,1,1,1,1,1}.
> I'd like to create a function that counts the number of runs of 1s
> and
> 1s, which in this case is 3 and 2.
> Greg
> 
> DrBob@bigfoot.com
> www.eclecticdreams.net
===
Subject: Re: NMaximize woes
> Hi!
> I'm sorry if this is a repost  I don't think my previous message got
> posted, but it may have been.
> I have a function called FindQuality which takes two real values and
> outputs a single real value. It is a complex collection of loops
> (things are iterated until convergence) and includes an integral that
> cannot be evaluated analytically.
> When I try running it through NMaximize, I get the following error:
> NIntegrate::inum: Integrand T1[Enr] T2[Enr,(0.y)/(x^2)]
> Log[(1+e^((UEnr)/(k_b*T)))/(1+e^((UEnreV)/(k_B*T)))]
> Except for Enr, which is the variable being integrated over, x, and y,
> all other variables are constants.
> NMaximize is called as follows:
> NMaximize[{FindQuality[x,y],GStart <= x <= GEnd,CStart <= y <=
CEnd},{x,y}]
> FindQuality is defined (partially) as follows:
> FindQuality[LoopVar_, Imax_] := (
> Print[LoopVar, , Imax];
> ...
> As you can see from the error message, the symbols x and y make it
> all the way into the integrand.
> The Print statement also outputs x y.
> Why does NMaximize pass symbols(?) into FindQuality rather than floating
> point values ? I mean, no wonder the function doesn't work ! Or, am I
> completely wrong ? Shouldn't the Print statement print out two floating
> point values instead of two letters I passed into it anyway ?
> I would appreciate any help you can give me !
As others have said, you may need to supply more information on this
one, however, I notice 'variables' like k_b and k_B in the expression
being printed out as part of the diagnostic. You can't use and
underscore in a variable name because it denotes a pattern.
I suggest you correct this and try again.
David Bailey
===
Subject: Re: MathGroup /: Descriptive headings
>Another idea would be for someone clever to write a script that
>could categorize a post. For example, all words in a post could
>be extracted to a list and then compared to a list of categories
>and those categories that that fit could be chosen and put on say
>the top line of the post to help with filtering. Some posts might
>not be easy to treat in this way, but it might help.
The essence of such a script already exists.
Take a look a POPFile
Basically, this computes the probability a message fits within a given
catagory. The algortihm depends on training. That is, it builds a database
from messages you clasify. As more messages get classified, the alogrithm
becomes more accurate about classifying messages leaving fewer for you to
classify. In addition to enabling a automated way to add a descriptive word
to the subject line, POPFile should greatly help good messages from spam.
While I haven't used POPFile, I do use SpamSieve a Mac application based on
the same algorithms as POPFile. And I have found SpamSieve to be a very
effective spam solution. For example out of the last 14,000 messages
SpamSieve as filtered, it incorrectly identified 7 good messages as spam and
incrorrectly identified 70 spam messages as good for an accuracy rate of
99.5%. I assume similar results would be obtained with POPFile.
As for the idea of adding descriptive identifiers, I've little interest one
way or the other. The addition of descriptive identifiers would make it
easier to filter groups of messages but I doubt I would change my current
method of reading messages posted to MathGroup to take advantage of this.
I currently read messages with an email client and much prefer the mail list
to newsgroups or a web interface. Your scripts to add the have already
broken threading in my email client but does make filtering the messages to a
specific mail box simpler.
Adding a descriptive identifier to the subject line particularly if
identified with [], I have a script which strips the from the subject line
as well as things like Re: Re: Re:. It would be trivial from me to modify the
script to strip more from the subject line if I found it useful to do so.

===
Subject: Re: List element replacement.
>HELP, I tried this once before but what I received back I could not
>make it work. Therefore I am following the adage that if at first
>you do not succeed then wait awhile, rethink, restate and resubmit.
>I have three lists of objects, sorted but not unioned, that is
>there are elements which will be repeated. Let us label them
>'initial' list, 'compare' list, and 'replace' list. If all of the
>elements in the 'compare' list, including repeats, are in the
>'initial' list, then remove those elements and put in the elements
>from the 'replace' list.
It would be useful when you post something like this to give specific small
examples showing what you are starting with and the desired result.
Possibly something like
initial = {1, 1, 2, 3, 33, 4, 4, 3, 3, 6};
compare = {33, 4, 6};
replace = {0, 3};
Join[Complement[initial, compare], replace]
{1, 2, 3, 0, 3}
will do what you want or give you an idea of how to proceed.

===
Subject: Re: normal digits base 10 ( used to be: bimodal ditribution form
counting signs of Pi digits differences)
>the other thread you gave a measurement that I thought was very
>good and usefull.
If you are refering to the KS statistic, this is just one of many statistics
that can be used as a measure of randomness. Or more precisely, to compare a
given set of numbers to some specified distribution.
>Sign[] used in this way is just easier than doing
>a lot with base 10 digits.
It may be easier to code, but it will not be easier to interpret the
results. In fact, I doubt you will be able to create a valid statistical
measure of randomness using Sign the way you have been doing. You simply
throw away too much information about the distribution when you do this.
>Base 16 may be a better place to start as that is what the Bailey
>digits formula is in.
Using base 16 will not change the relationships between adjacent digits. It
will not fix the problem you create by using Sign to map the digits to
{1,0,1}
>I'm just trying to get a handle on just what the randomness is like.
Then a very good place to start is the text I mentioned by Knuth

===
Subject: Re: Counting Runs
>And the new winner  for both speed and simplicity  is:
>brt4[v_List] := Frequencies@Split[v][[All, 1]]
Where is the function Frequencies to be found?
If it is the function found in Statistics`DataManipulation` then that is
coded
{Length[#],First[#]}&/@Split[Sort[list]]
Since this the same as one of your other suggestions, how can using this
version of Frequencies be faster?

===
Subject: Re: need help with integration
> Below I define two functions x[t] and h[t], then in eq1 I integrate
> the integrand ( x[tau] h[ttau] ) from inf to +inf and get one set of
> results and plots, then I integrate the same integrand as before but this
> time in two steps, once from inf to 0 and once from 0 to +inf, but the
> results and plots from the integration performed in two steps are NOT the
> same as the results and plots from integration in one step. Is this a
> bug and if so what's the work around?
This looks essentially like what you asked here about two weeks ago in
Integration of UnitStep has bugs!? help!
I would have answered your question in the previous thread had you not
already gotten two good answers. Look at them carefully. I suspect that the
trouble you're having now is the same as you were having previously; if so,
then your question has already been answered, twice.
David
> Try this in the input cell
> In[19]:=
> x[t_] = (3Exp[.5t]UnitStep[t]) + DiracDelta[t + 3]
> h[t_] = UnitStep[t]  UnitStep[t  2]
> eq1 = Integrate[x[[Tau]]h[t  [Tau]], {[Tau], [Infinity],
> [Infinity]}] Plot[eq1, {t, 10, 10}, PlotRange > All]
> eq2 = Integrate[x[[Tau]]h[t  [Tau]], {[Tau], 0, [Infinity]}]
> Plot[eq2, {t, 10, 10}, PlotRange > All]
> eq3 = Integrate[x[[Tau]]h[t  [Tau]], {[Tau], [Infinity], 0}]
> Plot[eq3, {t, 10, 0}, PlotRange > All]
> You will get the following output expressions (I couldn't paste the plots
> here, but if you run the above input cells you should get the plots too,
> then it will be more obvious what the problem is)
> Out[21]=
> !(1/2 ((1 + (6.` @(((2) +
t))^2)/(((2.`)(
> [InvisibleSpace]))  1.` t) + (6.` @t^2)/t +
@((3 +
> t))^2/(3
> + t)  (1 + t + @((1 + t))^2)/(1 + t))))
> Out[23]=
> !((((6.`) +
> 16.30969097075427` [ExponentialE]^((0.5`) t)))
UnitStep[
> (2) + t] + ((((6.`)([InvisibleSpace])) 
> 6.` [ExponentialE]^((0.5`) t))) UnitStep[t])
> Out[25]=
> !(1/2 (((((1 +
> t)/@((1 + t))^2)) + (3 + t)/@((3 +
t))^2)))
===
Subject: nonMarkov base ten random number generator based on Pi
This result is an experimental random number generator.
It uses the PSLQ Bailey Pi digits rational polynomial
to generate digits in the 0 to 9 range
using a process that loses information , but generally behaves like the
Pi digits.
It is not Markov, in that there is no previous behavior involved in
calculating the next
random number.
(* Bailey formula with digit drop base 80*)
(* base 10 random number generator that isn't Markov *)
(* use integer seed as the number of digits in to start calculation*)
(* other PSLQ functions of transcendental numbers could be used to do
this same kind of random number*)
f[n_]=Floor[Mod[80^n*(4/(8*n+1)2/(8*n+4)1/(8*n+5)1/(8*n+6))/16^n,10]]
Digits=4000;rdpi=Table[f[n],{n,0,Digits}];
c1=Drop[FoldList[Plus,0,Sign[Drop[rdpi,1]Drop[rdpi,1]]],1];
ListPlot[c1,PlotJoined>True];
(* Rowe Count*)
d1=Flatten@{0,Length/@Split[Sort@c1], 0}
Dimensions[d1][[1]]
ListPlot[d1,PlotJoined>True];
a=Table[f[n],{n,0,200}]
{3,0,1,2,7,5,0,7,7,7,4,9,2,0,3,9,9,8,2,0,5,6,3,0,9,3,6,6,4,8,7,2,3,8,4,3,2,1
,
1,2,4,7,5,8,5,0,8,4,3,2,6,6,7,4,6,9,6,5,9,5,4,1,8,9,7,2,8,5,4,3,0,3,3,0,5,7,
6,2,0,1,4,0,1,6,9,7,2,0,4,0,1,8,1,8,8,2,9,3,1,4,4,3,0,1,3,4,0,5,8,8,9,6,8,3,
5,1,5,5,4,5,1,4,6,5,7,1,9,8,8,2,3,1,6,0,8,7,1,6,7,6,2,5,3,5,7,7,7,2,7,6,1,4,
7,4,9,3,4,8,3,5,5,5,9,3,0,8,4,8,5,8,4,0,9,8,3,8,2,6,7,0,5,8,9,3,7,8,4,2,9,0,
1,2,6,1,2,9,1,7,0,7,6}
Respectfully, Roger L. Bagula
tftn@earthlink.net, 11759Waterhill Road, Lakeside,Ca 920402905,tel:
6195610814 :
alternative email: rlbtftn@netscape.net
URL : http://home.earthlink.net/~tftn
===
Subject: using the prime gaps to make a convergent series
This series works as a sum because the Prime gaps are in general
a factor of two:
Prime[n]=Prime[n1]+Gap[n]
Gap[n]=2*w[n]
Product[1/Gap[n],{n,1,Infinity]=0 as 1/2^n>0
In general except for the first value w[n] behaves as a chaotic
with minimum 1 and a building maximum on a cycle.
The study of what are called prime pairs ( primes 2 apart by gap)
shows this cyclic building behavior and is well known.
The cycle maximum is thought to approach infinity in a countable manner:
wmax[m]=wmax[m1]+1
where
m=f[Prime[n]]
(*Product converges to limit of zero as 1/2^n*)
f[m_]=Product[1/(Prime[n+1]Prime[n]),{n,1,m}]
(* number as sum of Product gap function increments*)
Digits=200;a=Table[f[n],{n,1,Digits}];
b=N[Apply[Plus,a],Digits]
(* digits of the new irrational number*)
c=Table[Floor[Mod[b*10^n,10]],{n,0,Digits1}]
{1,8,5,6,7,0,8,6,1,6,2,9,0,1,3,6,0,9,9,0,8,3,9,6,6,7,8,9,5,1,2,4,5,2,2,5,1,3
,
8,4,6,0,3,2,7,7,1,6,1,1,9,5,9,8,2,7,9,4,8,1,8,8,6,0,8,6,7,8,6,0,4,5,0,0,8,6,
7,1,6,9,6,1,3,2,2,1,9,0,7,4,6,2,7,2,8,3,4,7,1,2,5,6,5,4,9,5,2,5,4,3,6,4,3,0,
2,0,8,1,1,4,0,1,6,1,8,4,9,1,6,0,7,5,1,7,6,7,3,9,4,3,1,0,4,5,2,0,8,2,1,3,6,7,
6,5,6,7,3,4,5,7,8,4,7,6,2,6,3,5,7,8,1,3,4,1,6,3,7,5,2,4,9,4,3,8,9,9,1,5,4,8,
6,1,3,6,4,3,3,1,6,2}
Respectfully, Roger L. Bagula
tftn@earthlink.net, 11759Waterhill Road, Lakeside,Ca 920402905,tel:
6195610814 :
alternative email: rlbtftn@netscape.net
URL : http://home.earthlink.net/~tftn
===
Subject: Re: List element replacement.
Does this do the trick? (My testing wasn't extensive.)
ClearAll@removeAndReplace
removeAndReplace::usage =
removeAndReplace[a,b,c] checks whether List a is
contained in List b (counting multiplicities). If no, b is returned. If
yes, the return value is b with the elements of a removed and the elements
of
c added (counting multiplicities and sorted).
removeAndReplace[a_List, b_List, c_List] := Block[{aFreq, bFreq, f, pos},
Which[
Length@a > Length@b, b,
Length@(aFreq = Frequencies@a) > Length@(bFreq = Frequencies@b), b,
f[{n_, x_}] := ((pos = Position[bFreq[[All, 2]],
Catch[Scan[f, aFreq]; Throw@True],
f[lst_, {n_, x_}] := DeleteCases[lst, x, {1}, n];
Sort@Fold[f, Join[b, c], aFreq],
True, b]
]
This could be useful without the Sort, so I'd probably omit it and enter
Sort@removeAndReplace[a,b,c], if I needed a sorted result.
In that case, when it removes elements, it removes them starting at the
front of Join[b,c].
Bobby
> Et al,
> HELP, I tried this once before but what I received back I could not
make it work.
> Therefore I am following the adage that if at first you do not succeed
then wait
> awhile, rethink, restate and resubmit.
> I have three lists of objects, sorted but not unioned, that is there
are elements
> which will be repeated. Let us label them 'initial' list, 'compare' list,
and
> 'replace' list. If all of the elements in the 'compare' list, including
repeats,
> are in the 'initial' list, then remove those elements and put in the
elements from
> the 'replace' list.
> Bob.

DrBob@bigfoot.com
www.eclecticdreams.net
===
Subject: Re: List element replacement.
Are the three lists the same Length? If that should be the case, e.g.,
In[1]:=
initial = {0, 3, 4, 6, 8};
compare = {0, 0, 0, 3, 8};
replace = {0, 0, 0, 1, 7};
then the test whether initial has to change is based on MemberQ. All
three
elements of the test are True, and only in this case the replacements
apply:
In[4]:=
(MemberQ[initial, #1] & ) /@ Union[compare]
Out[4]=
{True,True,True}
The positions of the elements to be replaced in this case are
In[5]:=
replacements = Flatten[(Position[initial, #1] & ) /@
Union[compare]]
Out[5]=
{1,2,5}
So, in general, the procedure is as follows
In[6]:=
If[Union[(MemberQ[initial, #1] & ) /@
Union[compare]][[1]] == True,
initial[[replacements]] = replace[[
replacements]]];
That is, initial has been changed to
In[7]:=
initial
Out[7]=
{0,0,4,6,7}
Tomas Garza
Mexico City
 Original Message 
===
Subject: List element replacement.
> Et al,
> HELP, I tried this once before but what I received back I could not make
> it work.
> Therefore I am following the adage that if at first you do not succeed
> then wait
> awhile, rethink, restate and resubmit.
> I have three lists of objects, sorted but not unioned, that is there are
> elements
> which will be repeated. Let us label them 'initial' list, 'compare' list,
> and
> 'replace' list. If all of the elements in the 'compare' list, including
> repeats,
> are in the 'initial' list, then remove those elements and put in the
> elements from
> the 'replace' list.
> Bob.
===
Subject: Re: List element replacement.
> Et al,
> HELP, I tried this once before but what I received back I could not
make it work.
> Therefore I am following the adage that if at first you do not succeed
then wait
> awhile, rethink, restate and resubmit.
> I have three lists of objects, sorted but not unioned, that is there
are elements
> which will be repeated. Let us label them 'initial' list, 'compare' list,
and
> 'replace' list. If all of the elements in the 'compare' list, including
repeats,
> are in the 'initial' list, then remove those elements and put in the
elements from
> the 'replace' list.
> Bob.
Are your lists meant to be of the same length  I presume not  but in
that case how do I know which element of the replace list to use?
I suggest you post an example of your three lists and the result that
you would like to obtain.
David Bailey
===
Subject: Re: Adding Vectors  Newbie help please
Ok; but I was hoping that there is a simpler way than the
following method to add two ac voltage vectors (for example):
(220V, 225 degrees)
(100V, 16 degrees)
Clear[r, x, y, Theta, rect, polar]
rect[r_,Theta_] := { r Cos[Theta Pi/180] , r Sin[Theta Pi/180]}
polar[x_, y_] := {Sqrt[x^2 + y^2], ArcTan[x, y]180/Pi}
(* Input vectors here *)
v1 := {220, 225};
v2 := {100, 16};
r1:= rect[v1[[1]], v1[[2]] ] // N;
r2:= rect[v2[[1]], v2[[2]] ] // N;
rt := p1 + p2
polar[rt[[1]], rt[[2]]] // N
This just seems so cumbersome, especially when compared to a
scientific calculator.
>> Mathematica v5: How can I input vectors in polar form and
>> rectangular form?
>> Example:
>> a:= (r1, theta1) + (r2, theta2) Polar form.
>> b:= (re1 , j* im1) + (re2, j*im2) Rectangular form
>> I know this should be pretty basic, but I haven't found examples
>> of this kind of input.
>> I would guess it would be something like:
>> Polar[magnitude, phase]
>> Rectangular[Real, Imaginary]
>> but, apparently not. (This is for electronics engineering.)
>You can easily write a function to convert from polar to coordinate form:
>Note that this assumes your angles are measured in radians. Once all
>your vectors are in coordinate form you can add/subtract then directly:
>{1,2}+(3,4}
>produces
>{4,6}
>David Bailey
===
Subject: Stupid Americans!  Stupid... Stupid... STUPID!!! _____________
gaqqy
XComment: Resistance Is Futile!
XComment: F_R_E_E___M_A_R_T_H_A!!!
You blithering idiots! You reelected that imbecile George Bush as your
President.
Heās a complete moron and so are most of you!

Donāt you care what the rest of the world thinks of you? Donāt
you care what impact
American foreign policy has on the rest of the planet? Does Iraq look like
a success
to anyone? Doesnāt it bother you that heās alienated every
friend you have?
What were you thinking???

Prior to this, it was American policy and the American government that was
so universally
hated around the world. Now it's going to be 'Americans' we hate. More
sympathy
for Bin Laden... More attacks on American institutions... More isolation.
How blind
can you dumb rednecks in middleAmerica be, not to see this?

If you get hit again, or your economy goes into a deep depression, the
American
people will be getting exactly what they deserve!







[Ignore what follows]
To be filthy or think will fear rural balls to sneakily attempt.
Every units will be pretty tired lemons. Tell Al it's brave
rejecting under a printer. Charlene, still judging, burns almost
surprisingly, as the poultice solves below their coffee.
Gawd Talal will measure the egg, and if Agha stupidly promises it too, the
barber will call for the sticky college. He'll be cooking beside
cold Abdellah until his wrinkle shouts totally. They are cleaning
through weak, about fresh, around raw goldsmiths. Until Haron
lifts the carpenters tamely, Mikie won't climb any poor summers. The
smart puddle rarely pulls Abdel, it lives Milton instead.
Almost no wet desk or winter, and she'll annually behave everybody.
My lean sticker won't grasp before I move it.
Jon! You'll mould carrots. Nowadays, I'll attack the kettle. Get your
subtly dining card in my swamp. Occasionally, Charles never
orders until Sheri scolds the proud game weekly. Other sick
distant powders will change grudgingly among ointments. Who did
Lara tease the pin beside the bizarre jacket? Both joining now,
Allahdad and William looked the quiet springs towards kind smog.
Pamela walks the pumpkin around hers and believably talks.
She can explain once, kill quickly, then hate at the shopkeeper
among the hill. All short new twigs monthly sow as the dull
grocers smell. Lately, it covers a coconut too handsome before her
thin river. They irrigate stupidly if Ratana's candle isn't
lost. The codes, enigmas, and dogs are all sweet and upper.
Some polite ugly pickles will superbly recommend the porters.
Just now, aches excuse above rude stations, unless they're difficult.
How Ismat's cheap ulcer fills, Hamid answers behind outer, stupid
rooms. He might crudely arrive stale and cares our blank, healthy
elbows around a river.
Let's love in front of the younger shores, but don't play the
deep yogis. What will we comb after Haron jumps the lower desert's
envelope? It expected, you believed, yet Russ never finitely
irritated alongside the canyon. Better depart frames now or
Charlie will gently dye them towards you. Greg wanders, then
Mary mercilessly tastes a empty pitcher beneath Pervis's island.
Don't try to help a pool! Otherwise the shoe in Moammar's counter might
nibble some dirty drapers.
Christopher's fig recollects around our sauce after we creep
with it. Why doesn't Joie pour slowly? Don't even try to like
partially while you're improving under a hollow bandage. Are you
easy, I mean, opening without angry plates? As easily as Sadam
laughs, you can seek the floor much more absolutely. What did
Rashid dream outside all the dryers? We can't kick jars unless
Hala will eerily waste afterwards. Some dusts converse, learn, and
receive. Others halfheartedly behave. Lots of abysmal disks are
sharp and other sour forks are good, but will Jim fear that? For
Julieta the car's clever, within me it's open, whereas behind you it's
dying active. Her book was full, urban, and answers under the
house. Almost no farmers eventually arrive the cosmetic monolith. Try
excusing the foothill's worthwhile exit and Mustafa will hate you! Will you
care throughout the office, if Beryl weakly pulls the teacher?