text:
Just Between Friends Announces Three Spring Sales in Metro Area and Tie-In This Year with Salvation Army
Just Between Friends (JBF) has announced three Spring Community Children's and Maternity Consignment Events in the metro area. The Germantown/Port Washington sale will be held March 6 through 10, at the Washington County Fairgrounds; the Milwaukee County sale on April 21 through 26, at the Wisconsin Exposition Center at Wisconsin State Fair Park; and the Waukesha County sale from May 2 through 5, at the Waukesha Expo Center.
New this year is that JBF is working with the Salvation Army of Milwaukee County to further awareness of the Salvation Army's efforts to help those in need. Salvation Army will also be among the community organizations that will receive donations of unsold items following the JBF sales.
JBF's Germantown/Port Washington sale will be open to the public on Wednesday and Thursday, March 6 and 7, from 9 a.m. to 7 p.m., Friday, March 8, from 10 a.m. to 8 p.m. A half-price sale will be held Saturday, March 9, from 8 a.m. to 5 p.m., and Sunday, March 10, from 9 a.m. to 1 p.m. Admission to Wednesday is $3. For Thursday, Friday, Saturday, and Sunday sales, admission is free.
The Milwaukee County event will be open to the public Sunday through Friday, April 21 through 26, with these hours: Sunday, 10 a.m. to 9 p.m. Monday, April 22 and Tuesday, April 23, 10 a.m. to 7 p.m., Wednesday, April 24, 10 a.m. to 5 p.m. A Half Price Sale will take place on Thursday, April 25, 10 a.m. to 9 p.m. and Friday, April 26, from 10 a.m. to 2 p.m. On Sunday, a $3.00 admission fee will be charged and benefits "Check up for Chicks," a local women's health initiative. For the remaining day's sales, admission is free.
JBF's Waukesha County sale will be open to the public Thursday, May 2 through Saturday, May 4, from 8 a.m. to 7 p.m., and Sunday, May 5, from 9 a.m. to 2 p.m. Admission to Thursday's sale is $3; other days admission is free.
JBF events offer "gently used" and "new" children's clothing in sizes 0 to 18, maternity clothes in sizes XS to plus, shoes in sizes infant to 3, as well as toys, board and electronic games, DVDs, and books. All clothing items and shoes are inspected before the event for current fashion, stains, and tears. Items will be organized like a children's store, where everything is divided by gender, size, category, and brand name. Each event features new and different items.
"Every family is feeling the economic pinch at this time and the service Just Between Friends sales bring to the community is extremely valuable," said Ammie Maltz, organizer of the JBF Germantown sale. "Our purpose is two-fold: to offer opportunities for families to purchase gently used clothes and toys for their children at very reasonable prices, and to offer families the opportunity to sell their used items in a carefully managed atmosphere and make a few dollars doing so."
"JBF spring sales are great opportunities for families to purchase a new wardrobe for their children and fill toy boxes," said Stephanie Suring, organizer of the Waukesha County sale. "Typical sales offer a wide range of items for moms-to-be, new mothers, and families of all ages and sizes."
"We usually have just about everything! From maternity clothing to breast pumps and wipes warmers to the latest fashions from Justice or Gymboree to Fisher Price, Little Tikes playground toys, and other high interest toys and children's electronics," Melissa Monsoor, organizer of the Milwaukee County sale said.
JBF team members staff each sale and earn various benefits for working the sales. To learn more about opportunities and rewards of joining the team for each individual sale, visit www.jbfsale.com. Consignors utilize an exclusive, free barcode tagging system to tag items, keep track daily sales, and manage an accurate, itemized list of any unsold, fashionable, and desirable items that are then donated on behalf of JBF and the consignors to organizations, including the Salvation Army, for area families in need.
Just Between Friends serves more than 260,000 American families in 22 states and provides an opportunity for families to recycle their kids' clothing and toys. Wisconsin currently offers six JBF sales events with each independently operated. The Salvation Army is an international movement located in over 100 countries around the world. It has been serving communities in the Greater Milwaukee for over 100 years.
For more information on an upcoming sale, visit www.jbfsale.com.
More from Your Stories
- Ebenezer's Pareting Tip: What is Helicopter Parenting?
- Build a Lego City!
- Anansi Puppet Story and Craft
- MCW researchers to study airway management in out-of-hospital cardiac arrest
- Milwaukee Backgammon Club to hold 3 tournaments in August!
- 4th Annual Cruisin' the Grove Scheduled for Aug. 7
- MCW awarded $1.9 million to investigate disease prevention utilizing slime mold
- Dublin the Fun Partner Promotions Make Milwaukee Irish Fest Even More Affordable
- September Fashion Show in Washington County
- Back to School...BBB Reminds You to Shop Smart!


text:
Speaking of offensive playmakers, i like torrey smith. reminds me of percy harvin, amazing speed, electric burst, great acceleration.. he's going to be a GREAT returner in the NFL. He also had a monster game against north carolina
tho doubt the giants take him. he's a 2nd round pick definitely. he's going to be electric in the nfl

subset: commoncrawl


text:
forum: Campaigns and Community
Pages: 1 2 3 … 59 | Home » Campaigns and Community » Chat about Jamie's Food Revolution and connect with others
#1 Thu 18 Feb 10 11:43am
- Jamie Oliver Food Foundation
- From Jamie's Office
- Member since Tue 06 Jul 04
Chat about Jamie's Food Revolution and connect with others
Hi everyone,
Since Jamie's TED acceptance speech last week we have had amny emails from people wanting to offer their support and also asking for assistance. This is the place to share your ideas and connect with anyone else in your local area who may be doing great things with food as well. In time we will create specific threads for regions and countries so that it will be easy for you to connect with others wherever you are.
Thanks for your support
#2 Sat 20 Feb 10 6:47pm
- Member
- Member since Wed 01 Jul 09
Re: Chat about Jamie's Food Revolution and connect with others
Hello, Do you know if Jamie will be at the opening of Cambridge Jamie's Italian... Me his biggest fan, only 14 Thanks x
#3 Mon 01 Mar 10 3:07pm
- Member
- Member since Wed 27 Jan 10
Re: Chat about Jamie's Food Revolution and connect with others
Hi Danny,
Writing to you from Toronto, Canada. I love your food revolution and really feel that we need a program here. I got a call from my step-daughter who is 26 and married and asked me how to cook. She lives off take-out food. Now that she has a child she is really getting concerned. I told her I would spend a day with her cooking some simple meals. I brought over tons of ground chicken(free-range, inexpensive)>Simple-We made meatballs, chili, lasagne,meatball soup. (all from ground chicken)She couldnt believe how easy and inexpensive it all was. She had food for a week. I think we need to build a school cook book for all the schools around the world and have people bringing it to the schools. Cooking needs to become a lifelong habit.
#4 Tue 02 Mar 10 7:08pm
- Member
- Member since Tue 02 Mar 10
Re: Chat about Jamie's Food Revolution and connect with others
Hi Jamie,
I just wanted to write to you and let you know how exited I am that you are going to be educating the world about the importance of good nutrition and health through your TV show "Jamie Oliver's, Food Revolution". I am so proud that you (like me) have joined forces to make a difference in the lives of others about the importance of eating more fruits and vegetables every day. The health benefits of this are numerous as you know, some of them being: protection against cancer, builds a stronger immune system, prevention of chronic illness, protection against heart disease and the ability to slow down the effects of aging.
How many people actually eat the required servings of "raw" fruit and vegetables every day? Virtually all of us fall short of the quantity of raw fruits and vegetables required to protect us from illness and disease. Making a difference in our children's lives has been a mission of mine (like yours) ever since my recent battle with a Giant Cell Tumor of bone. My children were 4 months and 20 months old at the time I headed for surgery and I was determined to have a new lease on life. My husband is my rock and my children are my world and I was determined to live for them. This is when I started studying the connection between diet and health.
Realizing that all major diseases are influenced by diet, I was determined not to let my medical problem repeat itself. This is why I have decided to educate everyone about the importance of eating whole foods, exercising and taking the right supplements everyday to help protect you from illness and disease.
Once I increased my diet rich in fruits and vegetables I started to feel better, my healing time decreased and I had more energy. The answer was clear to me. I found my whole food supplement in Juice Plus and added it to my diet immediately as I knew I still wasn't getting enough fruits and vegetables into my diet. However, Juice Plus is NOT a substitute for fruits and vegetables. It just helps me bridge the gap between what I should eat and what I am actually eating every day. Juice Plus contains 17 of the healthiest fruits and vegetables and is dried at low temperatures, removing the water, sugar, salt and bulk. These nutritious juice powders are then put into capsules, chewables and gummies! Since I discovered that one of the secrets to good health is to eat a lot of fruits and vegetables that contain disease fighting chemicals called "phytonutrients" my health has never been better. Juice Plus has great science behind it and it made good sense. Since changing my diet and adding Juice Plus to my daily routine I rarely get sick even with my little angels coming home from school with germs everyday. This is why I am pleased to educate and recommend to everyone the importance of good nutrition and Juice Plus!
Congratulations on your quest....I know you will have a dramatic impact on those you educate and can't wait to come on board with you and start a "food revolution"!
Your dear friend,
Trina B
#5 Thu 04 Mar 10 1:11am
- Member
- Member since Wed 03 Mar 10
Re: Chat about Jamie's Food Revolution and connect with others
I haven't really kept up with Jamie Oliver since I lived in Australia but the TED speech was great. I saw an ad for the TV show and got on the web to find out more. When did home ec stop being taught in American schools??? Kids are not taught how to cook, how to buy a house or open a bank account anymore! Life skills should be taught from the beginning at elementary school. I am a chef. I am a teacher in a culinary school, some of our students who want to be chefs don't know where food comes from... I am trying to design a summer camp program for kids at the school, for young kids 9 - 12 ish. We have to start somewhere. Jamie Oliver if you are ever in Memphis stop by and talk to us.
Thanks for the hard work, you've come a long way since the Naked Chef!
#6 Tue 09 Mar 10 6:16pm
- Member
- Member since Tue 09 Mar 10
Re: Chat about Jamie's Food Revolution and connect with others
The HTML code isn't anywhere to be found. so I can't post it on my facebook. Help!!!
#7 Wed 10 Mar 10 5:55am
- Member
- Member since Wed 10 Mar 10
Re: Chat about Jamie's Food Revolution and connect with others
Hello from San Francisco. I'm a Chef here in the City and I know a great many of us would love to volunteer and help in any capacity, from cooking to giving demos to washing pots and pans. Is there a time frame on when things will be starting up?
#8 Wed 10 Mar 10 3:50pm
- Member
- Member since Wed 10 Mar 10
Re: Chat about Jamie's Food Revolution and connect with others
Hi, Jamie!!
I'm 14, coming from Poulsbo, Washington.
For most of my life, I was in the public school, consuming their idea of a "well balanced school lunch".
One day, we noticed that the truck delivering the food to our school was marked, noting that they supply food to the prison!
Believable, indeed! The food was ridiculous! You could form a ball out of the "cheese" and it would bounce about 5 feet off the ground. The only salad dressing they offered was ranch, and the salad only contained ice burg lettuce, so it was very lacking in green.
Don't even get me started on their meat and cheese nachos.
I transfered to a private school about two years ago.
Recently, I have become quite the foodie! I went vegetarian and I'm also a pretty firm believer in homeopathy! So, I REALLY love your cause! I wish I could sign your petition a thousand times over! I put the link on my facebook
#9 Thu 11 Mar 10 12:41am
- Forum super champ
- From Melbourne Australia
- Member since Sun 12 Apr 09
Re: Chat about Jamie's Food Revolution and connect with others
Welcome here Aubrizzle,
Poor students, and poor prisoners! We need a prison food revolution too!
14 is a great age to be getting into cooking, you will be set for life! Cheers!
#10 Thu 11 Mar 10 8:56am
- Member Occupation Engineering student + pastry trainee
- From London
- Member since Thu 11 Mar 10
Re: Chat about Jamie's Food Revolution and connect with others
Hi everyone,
I am from Malaysia studying in UK at the moment. Just joined the forum and started recently checking out Jamie's campaigns past and present. Really appreciate Jamie for stepping forward and taking the lead.
There were many people in the past who have started their our campaigns just like Jamie and some are considered successful I would say. However, the scale and impact was small. This time, the timing seems to the right (with more and more people getting into cooking nowadays) and with Jamie's status known quite widely across the world, really looking forward to see if this campaign can cause a big enough push to get the ball rolling.
Does anyone know if the show is airing in the UK?


text:
Tervis® Sigma Alpha Epsilon 16-oz. Tumbler
We're sorry, but this particular item has sold out online, so you will not be able to add it to your shopping bag. Please try a different color or size, if applicable.
The most popular one of the bunch. It's 16-oz. of refillable fun. Great for both hot and cold beverages.
- 6-in. H x 3.375-in. diameter - top x 2.625-diameter - bottom
- Microwave/freezer/dishwasher safe
- Greatly reduces condensation and sweating
- Fits in most cup holders
- Acrylic
- Made In U.S.A.
Shipping & Returns
Shipping your purchase is easy on belk.com. Depending on the destination of your package, you can expect it to arrive within 4-7 business days. Shipping Information
Returns are easy on belk.com. Easy returns
Tervis® has been making high-quality insulated drinkware right here in America since 1946. With a variety of designs that celebrate every passion, and sizes that fit every lifestyle, it's the everyday, on-the-go way to express yourself.
More from: Tervis®


text:
Northland Teal Run planned Aug. 4 in Brainerd
The Brainerd area is expected to be home to more than 500 runners and walkers in this year's Northland Teal Run, a 5K race that benefits the Minnesota Ovarian Cancer Alliance (MOCA).
MOCA is a Minnesota-based non-profit dedicated to funding research and providing support for women and families affected by ovarian cancer. Since its founding in 1999, MOCA has awarded more than $4 million to cancer research in Minnesota and it represents more than 800 survivors.
The Northland Teal Run is a fun, family-friendly 5K race starting at 8 a.m. Sunday, Aug. 4, at the Northland Arboretum in Brainerd. The run will incorporate a "Diva" theme.
The race is open to runners and walkers of all abilities; $5 of each registration fee benefits MOCA. Participants also have the option of collecting additional pledges, all of which go directly to MOCA.
Participants can register online at http://mnovarian.org/event/northland-teal-run/. Early registration through Wednesday, July 31, is $27 per racer. From Aug. 1 to the morning of the race it is $32.
Racers will receive a T-shirt and race bag as well as food and beverages the morning of the event.
Volunteers are needed for the race. Contact Lauren Donna at firstname.lastname@example.com with any questions about volunteer registration.


text:
- Home
- News
- Sports
- Opinion
- Obituaries
- Features
- Special Sections
- Classifieds
- Public Notices
Forgot Password? | Not a User? Sign up
At Baptist Hospital Northeast. The meeting will be a Christmas social. Bring a diabetes-friendly dish and a recipe to exchange. Free. For more information on the support group, call Sharon Adcock at (502) 222-3344.


text:
Meet the Logitech Wireless Solar Keyboard K760, the successor to Logitech's first solar keyboard, the
From a design standpoint, the K760 is more compact than the K750 and more closely resembles Apple's own
The key feature upgrade here is something that Logitech calls "Bluetooth connectivity with easy-switching capability." What that means is you can pair multiple devices -- such as a Mac, iPad, or iPhone -- and quickly switch among them with the push of a button without having to reconnect.
To test it out, I paired the keyboard with an iMac, iPad, and iPhone. To switch among the devices I simply pressed the "1," "2," or "3" function keys at the top left of the keyboard (each has a Bluetooth logo on it). A blue LED lit up when I touched the button, letting me know I was now paired with its corresponding device. It worked flawlessly and is a nice option if you're working with a couple of different Macs or a Mac and and iPad. I don't see all that many folks using this with their iPhones or iPod Touches, but the option is there.
Like the earlier K750 and Logitech's just-introduced


text:
Thirty Old Master prints will be on view in the Hoopes Gallery from February 28 to May 25, 2009. The collection was recently donated by the family of Leon H. and Marie Buttlar Sparling to The Hyde Collection in memory of the couple. The prints, which consist of engravings, woodcuts, and etchings, survey the major printmaking styles and techniques from the fifteenth through the eighteenth centuries in both Northern and Southern Europe. Included are impressions by some of the most influential artists working in this period, such as Marcantonio Raimondi (1475/80-1527/34), Albrecht Altdorfer (ca. 1480-1538), Hendrik Goltzius (1558-1616), Jacques Callot (1592-1635), François Boucher (1703-1770), Jean-Honoré Fragonard (1732-1806), and Francisco de Goya (1746-1825).
"Our family always considered The Hyde Collection our home museum," stated the Sparlings' son, Tobin, of Houston, Texas, who arranged the donation. "It remained important to my parents throughout their lives. One of my father's last outings was to The Hyde and my mother quizzed me right up to the very end about the exhibitions I saw at the museum during my visits with her," he said.


text:
Mr. Weill transitions to new role as President.
Carnegie Hall today announced that Sanford I. Weill, Chairman of Carnegie Hall's Board of Trustees since 1991, will retire from this post after 24 remarkable years of service and a total of 32 years as a Carnegie Hall trustee. Mr. Weill will continue to serve as a member of Carnegie Hall's board, transitioning to a new role as President, a title formerly held by the late violinist Isaac Stern.


text:
Brian Hayes
Every Sunday morning you go for a walk in the city, heading nowhere in particular, with just one rule to your rambling: You never retrace your steps or cross your own path. If you have already walked along a certain block or passed through an intersection, you refuse to set foot there again.
This recipe for tracing a loopless path through a grid of city streets leads into some surprisingly dark back alleys of mathematics—not to mention byways of physics, chemistry, computer science and biology. Avoiding yourself, it turns out, is a hard problem. The exact analysis of self-avoiding walks has stumped mathematicians for half a century; even counting the walks is a challenge.
My own initiation into the trials of self-avoidance came when I began experimenting with a simple model of the folding of protein molecules, a story I told in an earlier "Computing Science" column (see Hayes 1998). Protein folding is close to the historical roots of the self-avoiding walk, which was first conceived as a tool for understanding the geometry of long-chain polymer molecules. A polymer writhing and wriggling in solution forms a random tangle—random, that is, except that no two atoms can occupy the same position at the same time. This "excluded volume effect" in the polymer is modeled by the walk's insistence on avoiding itself.
Self-avoiding walks have also found applications elsewhere in the sciences, such as the physics of magnetic materials and the study of phase transitions. And they are of interest as purely mathematical objects. Many of the obvious questions about them have resisted rigorous analysis, and so the best answers known so far come from computer-intensive methods.
All of the walks I shall describe here take place on a two-dimensional square lattice, which is a grid of city streets reduced to its mathematical essence. The lattice consists of all points on the plane that have integer x and y coordinates. Walks begin at the origin, the point with coordinates x=0 and y=0. A single step always moves from the current lattice site to one of the four nearest-neighbor sites. By convention the length of a walk, n, is defined as the number of steps, and so the number of lattice sites visited is n + 1.
In trying to understand the self-avoiding walk, a good place to begin is with a walk that doesn't bother to avoid itself but lurches over the landscape entirely at random. At each step of such a walk you choose one of the four neighboring lattice sites with equal probability, and move there. If you repeat this process a few hundred times, and draw a line behind you as you go, the result is a scribble with a random but nonetheless distinctive and recognizable geometry.
How many different random paths can be traced on a square lattice? They are easy to count. From any fixed point of origin there are just four walks consisting of a single step, namely those going one unit north, east, south or west. On the second step each of these walks can be continued in any of four directions, and so there are 16 two-step walks. For every further step the number of walks is again multiplied by 4, so that the number of n-step walks is 4n.
An interesting question to ask about random walks is whether the walker ever returns to the starting point. Eighty years ago George Pólya showed that the answer depends on the dimensionality of the lattice. In one or two dimensions a random walker is certain to come back home if the walk continues long enough. But three or more dimensions offer enough room to get lost in, and a return cannot be guaranteed no matter how long the walk goes on.
Pólya's result immediately tells us something about self-avoiding walks on a two-dimensional lattice. If a random walk's probability of returning home is 1, the probability of not revisiting the origin must be 0. And since the origin is one of the places that self-avoiding walks avoid, an arbitrarily long self-avoiding walk must be highly improbable—so rare and exceptional that you have almost no chance of finding one. This scarcity is one reason self-avoiding walks are so hard to study. And yet, paradoxically, another reason is that they're so numerous it's a challenge to count them all.
An intermediate stage between a purely random walk and a self-avoiding walk is the nonreversing walk. As a recipe for an urban perambulation, it allows you to go left, right or forward at each intersection, but not to make a U-turn and go back the way you just came. Thus a nonreversing walker on a square lattice has four choices for the first step, but only three choices for each step thereafter. The number of n-step walks is 4 x 3n–1, which for large n converges to 3n.
Typical examples of random walks, nonreversing walks and self-avoiding walks can be distinguished at a glance. The random walk usually consists of dense regions, where most of the lattice points have been visited at least once, connected by tendrils through more sparsely settled territory. A trace of the walk looks something like a map of towns and cities along a river. The nonreversing walk is similar but suggests a more open landscape—perhaps suburban sprawl rather than the city center. And the trace of a self-avoiding walk looks not like cities along a river but like the river itself, or like a coastline.
These differences in appearance are reflected in quantitative measures of the walks' geometry. One important measure is the square of the distance between the end points of the walk. For n-step random walks the mean-squared displacement is n; for nonreversing walks it is 2n. Self-avoiding walks are qualitatively different. The mean-squared displacement grows as a nonlinear function of n, which appears to be n3/2.
There is another important difference between random walks and self-avoiding walks. Every random walk can go on forever; you can always take one more step. But a self-avoiding walk can stumble into a blind alley, getting trapped at a lattice site where none of the neighbors are unvisited. In other words, sometimes you can't avoid yourself no matter how hard you try. On any given step the probability of getting boxed in is small—a little less than 1 percent—but if you extend a walk indefinitely, it is certain to wander into a dead end eventually. This is another way of saying that self-avoiding walks are rare and special; they have to beat the odds to survive.
Just how many distinct n-step self-avoiding walks can you take on a square lattice? There is no simple exact formula, analogous to the expression 4n that enumerates random walks, but upper and lower bounds can be stated. The number of self-avoiding walks has to be less than 3n because that is the number of nonreversing walks, which include the self-avoiding walks as a subset. Similarly, it's easy to construct subsets of the self-avoiding walks whose numbers grow as 2n; an example is the family of walks that move only north or east at each step. Thus the number of n-step self-avoiding walks should lie between 2n and 3n. Tighter bounds than these have been established, but still the only known way to get an exact tally is to actually trace out all the n-step walks and count them.
If you were asked to enumerate all the self-avoiding walks of, say, 15 steps, how would you answer? One useful rejoinder would be: Show me all the 14-step walks and I'll construct the 15-step ones. Adding the final step to each walk is straightforward: Just try each of the four possible directions, accepting a move if the neighboring site is vacant, and otherwise rejecting it. Then the question becomes how do you generate all the 14-step walks, and of course the answer is first to produce the 13-step walks. This regress continues back to the 0-step walk, which is just the single point at the origin.
The procedure is uncomplicated, but the counting itself is arduous. There are 284 walks of five steps, and 44,100 of 10 steps. By n=15 the number of walks has reached 6,416,596, and at n=20 it is 897,697,164. The rate of growth is so steep and relentless that merely fine-tuning a program to improve its efficiency yields only a paltry reward. Counting the walks of n+1 steps takes longer than counting all the walks from 1 through n steps.
Most of the records for counting self-avoiding walks belong to A. J. Guttmann and his colleagues at the University of Melbourne. As early as 1972 Guttmann was part of a group (led by M. F. Sykes of the University of London) that counted all walks of up to 24 steps. In 1987 Guttmann raised the bar to 27 steps, then later to 29. Others then reached 30 and 34 steps, and Guttmann's group went on to 39. Then in 1996, in an extraordinary feat of computing, A. R. Conway and Guttmann enumerated all the self-avoiding walks through n=51. There are 14,059,415,980,606,050,644,844 walks of 51 steps. Performing this computation required an algorithm more sophisticated than the one sketched here, as well as an Intel Paragon supercomputer that dedicated 1,024 processors and 10 gigabytes of memory to the task.
Guttmann's long series of enumerations yields an estimate of the asymptotic growth rate in the number of walks—the rate to which the series apparently converges in the limit of large n. Based on the known data, increasing n by 1 multiplies the number of self-avoiding walks by about 2.638; in other words, the number of n-step walks is proportional to 2.638n.
Even though self-avoiding walks are so numerous we can't count any but the shortest of them, they still remain rarities among all possible lattice walks. At n=20 fewer than one walk in 1,200 is self-avoiding. At n=50, the ratio is one out of 240 million.
If you look at a complete set of n-step self-avoiding walks, the first thing you're likely to notice is a lot of repetition. Many of the walks have the same basic shape; they differ only by a rotation or reflection.
On the square lattice any path can be rotated into four orientations and reflected across four axes (vertical, horizontal and two diagonals). Should the results of these transformations be considered eight distinct walks or eight variations on a single walk? The answer depends on what you want to do with the walks, but if you're merely counting them, it's clearly foolish to count by ones when you can count by eights. Programs for walk counting generate just one of the eight configurations, and then multiply to get the total number.
To eliminate the fourfold rotational symmetry of the lattice, you can generate only those walks that start with a step in some particular direction, say east. The four mirror symmetries disappear if you consider only walks whose first turn after the initial step is in one specified direction, say north. In this way the number of walks to be counted is reduced to approximately one-eighth the total number. Why approximately? Because of one small complication: A straight walk makes no turns away from its initial direction and is therefore left unchanged by mirror reflection. Hence there are only four distinguishable straight walks instead of eight, and the total number of walks is reduced by 4.
In the symmetries described so far, walks are considered to be rooted, that is, one end of each walk is distinguished as the starting end, as if it were planted in the ground. In many contexts, however, the direction in which a walk is traversed has no significance. For example, if you were folding a polymer along the path of a self-avoiding walk, you could start at either end of the walk. Viewing self-avoiding walks as unrooted paths makes many pairs of walks indistinguishable, so that the number of distinct n-step walks is reduced by a further factor of approximately 2.
I have been unable to find any published literature on enumerating unrooted self-avoiding walks, although it seems unlikely I am the first to consider the problem. The search for a practical algorithm proved an interesting challenge.
For unrooted walks, two paths through the lattice are identical if traversing one of them forward yields the same path as following the other one backward. The symmetry is easiest to understand when you represent a walk not as a list of lattice sites or as absolute directions but as instructions telling you what turns to take at every intersection along the path. Suppose the route from your home to your office is abbreviated [lfrff], where l stands for left, r for right and f for forward. (The notation is borrowed from the turtle graphics system of the Logo programming language.) On your way home, if you want to retrace your steps, you would obey the turtle-graphics commands [fflfr]. The two lists of instructions are related by a transformation I shall call retroreflection: The sequence is letters are reversed, and all the lefts and rights are interchanged.
In writing a program to enumerate the unrooted self-avoiding walks, the aim is to select one member of each retroreflected pair and discard the other. (It doesn't matter which one is kept.) The direct solution would be to maintain an archive of all the walks seen so far. Then as you generate each new walk, you reverse the list of turtle-graphics commands, flip the lefts and rights, and compare the result with the archive of stored walks, keeping the new walk only if the retroreflected version hasn't been seen already. This strategy would work, but it would be hideously slow and a memory hog.
There is a better way. The key idea is to transform the list of turtle-graphics commands into a number, specifically a ternary (base 3) number, with the digit 0 representing forward, 1 representing left and 2 representing right. Then every n-step self-avoiding walk has a unique encoding as an (n–1)-digit ternary number; equally important, every (n–1)-digit ternary number specifies an n-step nonreversing (though not necessarily self-avoiding) walk. For example, counting in ternary from 0000, 0001, 0002, 0010 up to 2222 generates every five-step nonreversing walk. Discarding the walks that fail a test for self-intersections leaves just the self-avoiding five-step walks. (In practice, it's better to write the walk numbers in "balanced ternary" notation, where the digits are –1, 0 and +1; then interchanging left and right is just multiplying by –1. Balanced ternary is the only numbering system I know that has its own Web page.)
The reason for treating the walks as numbers is that it imposes a total ordering on them. Given any two distinct finite numbers, there is always a larger and a smaller. Likewise, given any two distinct walks related by the retroreflective symmetry, one walk's ternary encoding must be less than the other's. This immediately suggests an efficient algorithm for splitting the symmetrical pairs: As you generate each walk, compare the ternary representation with its retroreflection. If the original number is greater, discard the walk; otherwise keep it. In this scheme there is no need to maintain and search an archive of walks; every decision is made with a single numerical comparison.
Figure 5 gives the number of unrooted self-avoiding walks of up to 24 steps. As would be expected, the numbers are approximately one-sixteenth the number of all self-avoiding walks of the same length, and the ratio approaches 1:16 more closely as n increases; and yet the ratio is not exact. The reason is another little complication, analogous to the problem of straight walks that are invariant under reflection. In this case a class of walks pass through retroreflection unchanged. They are the palindromic walks. Consider the path [flfrf]; if you reverse the sequence of instructions and interchange lefts and rights, you wind up with the same sequence of commands again. The path is its own retroreflection. To get a correct census of the unrooted walks it's crucial that such paths be counted once and only once.
Unless a new algorithm comes along, exhaustive enumerations of self-avoiding walks seem unlikely to advance much beyond the current limit of n=51. Knowledge of longer walks has come mainly from random sampling. This process too is computationally intensive.
For most purposes, a random sample is meant to be selected with uniform probability from the set of all n-step self-avoiding walks. Unfortunately, the most obvious algorithm does not yield walks with this distribution. It's easy enough to build an n-step walk one step at a time by choosing directions at random; the question is what to do if the walk collides with itself before reaching n steps. The temptation is simply to back up one step and try another direction, but that practice leads to a biased sample of walks. To ensure a fair sample you have to abandon a failed walk entirely and start over.
My own experiments with random sampling have relied on the ternary-number representation. I choose an n-digit balanced-ternary number at random, then check the corresponding walk for self-intersections. If the walk fails the test, I generate a new random number and try again.
Algorithms like this one readily produce large samples of 60- or 70-step walks, or smaller numbers of 100-step walks. As the walks get longer, however, the proportion of candidates that pass the self-avoidance test declines sharply. At n=100 you are proposing more than 50,000 walks for every one that turns out to be self-avoiding. At n=200 the acceptable walks would be rarer than one in a billion.
Other algorithms extend the range of exploration into the thousands of steps. Thirty years ago Zeev Alexandrowicz of the Weizmann Institute of Science suggested a method called dimerization, which exploits a divide-and-conquer strategy familiar in many other areas of computer science. Dimerization works because it's much easier to create two 50-step walks than a single 100-step walk. You build the two shorter walks, and string them together end-to-end. Of course the two half-walks may collide, in which case you have to start over, but failure turns out to be much less likely than in the step-by-step technique. The procedure can be invoked recursively to build the 50-step walks from 25-step components, and so on. What's particularly sweet about this algorithm is that it lends itself to a very simple and transparent implementation; I found it easier to get right than the less-efficient step-by-step methods.
Another technique, called the pivot algorithm, also goes back 30 years; it was first described by Moti Lal of the Unilever Research Laboratory and more recently has been refined and extended by Neal Madras of York University and Alan D. Sokal of New York University. The pivot algorithm is quite different from all the others described here. It does not actually generate a self-avoiding walk but instead takes one walk and transforms it into another. The idea is to randomly choose a pivot point somewhere along the walk, and then rotate or reflect or reverse the segment on one side of the pivot. If the result is a self-avoiding path, the move is accepted; otherwise you choose a new pivot and try again. Successive walks in the sequence are highly correlated, but repeating the transformation many times wipes out all memory of former configurations.
Computational studies of self-avoiding walks have produced a rich harvest of empirical results. Theorems have been harder to come by. For example, studies of the mean-squared end-to-end displacement, based on both complete enumerations and on random samples, strongly support the hypothesis mentioned above that the displacement grows as n3/2. Indeed, everyone "knows" that this result is correct and exact. But so far no one has proved it; no one has even proved that the exponent must be greater than 1 or less than 2.
Rigorous results on the counting of self-avoiding walks are also scarce. The empirical evidence suggests that for large n the number of walks grows as n2.638, but this growth law has not been explained from first principles. Until recently, it wasn't even certain that the number of walks invariably increases as n gets larger; because walks can become trapped, it seemed possible that there might be some range of values where there are fewer (n + 1)-step walks than n-step walks. In 1990, however, George L. O'Brien proved that the series increases monotonically.
Even if the asymptotic growth law is correct, however, it is only an approximation—perhaps good enough for chemists and physicists but not wholly satisfying to mathematicians. Ideally, one would like a formula for calculating the exact number of walks for any value of n, without all the laborious counting. Is that too much to ask? Most likely it is. Conway and Guttmann have given compelling arguments (though not quite a proof) that no simple analytic function predicts the exact number of self-avoiding walks.
Perhaps the absence of such a function tells us something important about the nature of self-avoiding walks. The number of walks is perfectly definite and knowable; there is nothing random or uncertain about the number of ways to arrange a nonintersecting path on a lattice. So why can't we calculate it? I don't know the answer, but I would point out that there are many objects in mathematics that exhibit the same curious mixture of determinism and unpredictability. The prime example is the prime numbers. Again there is nothing uncertain or statistical about what makes a number prime, but if there is any pattern in the distribution of the primes, it remains totally inscrutable. As with the self-avoiding walks, there are good approximations for the number of primes, but no one has found (or expects to find) an exact formula that will reliably point to every prime. This stubborn resistance to total analysis is part of what makes the primes interesting. Perhaps self-avoiding walks belong in the same category of perpetually tantalizing mathematical structures.
© Brian Hayes
You can find this online at http://www.americanscientist.org/issues/num2/1998/7/how-to-avoid-yourself/1
© 2016 Sigma Xi, The Scientific Research Society


text:
Posted by Mike Gualtieri on October 1, 2012
Every year the Center For Digital Strategies at Tuck chooses a technology topic to "provide MBA candidates and the Tuck and Darthmouth communities with insights into how changes in technology affect individuals, impact enterprises and reshape industries." This academic year the topic is "Big Data: The Information Explosion That Will Reshape Our World". I had the honor and privilege to kick off the series about big data at the Tuck School of Business at Dartmouth. I am thrilled that our future business leaders are considering how big data can help companies, communities, and government make smarter decisions and provide better customer experiences. The combination of big data and predictive analytics is already changing the world. Below is the edited video of my talk on big data predictive analytics at Tuck in Hanover, NH.
Mike Gualtieri, Principal Analyst, Forrester Research


text:
A very Brady felony
The press release from the Suffolk County DA's Office about the arrest of Boston College . . . er, make that former Boston College defensive linemen Brady Smith read as follows:
"Evidence suggests that Smith entered the 21-year-old victim's residence shortly after 4 am on April 19. Smith allegedly proceeded to her bedroom, where he sexually assaulted her as she slept, then fled when she awoke and screamed."
Smith is a big dude (6-2, 285 pounds) with a '70s mustache who got trashed this past week and hit on a girl — the roommate of an ex-girlfriend — at the Kells, in Allston. The girl refused his advances, but Smith was increasingly beered up and, apparently, couldn't believe he was being rejected. Eventually the girl had to leave the bar because, reportedly, Smith wouldn't leave her alone.
Unfortunately, the story didn't end there. Around 4 am, Smith entered her apartment through a sliding door — first going into the room of his ex-girlfriend. When he found her brother in there, he went on to the other girl's room. She awoke to find him "standing over me in inappropriate ways," and subsequently it hit home that "it was Brady Smith and I realized that his hand was down my pants." She screamed for him to "get the fuck out" of her apartment, waking up her roommate, who called police. Cops later found Smith drunk and stupid in a parking lot. He was arraigned on rape charges and dismissed from the BC football team.
Smith's lawyer, Philip A. Tracy Jr., said he thought "this case revolves around alcohol," noting sagely that sometimes "alcohol fuels a whole host of problems."
BC isn't traditionally a high-arrest environment, though it has had its share of head cases, with former star running back William Green perhaps its most noteworthy. A pair of picks from this past weekend's NFL draft, lineman Gosder Cherilus (17th overall) and defensive back DeJuan Tribble (6th rounder), were arrested this past year in a scuffle at the Greatest Bar. Running back A.J. Brooks was also busted for assault and battery with a dangerous weapon — the dangerous weapon being his shoe — after he allegedly kicked a campus residential advisor this past fall.
Attempted rape is no joke, particularly a premeditated home-invasion-type sex assault. Give Smith the big 89, shooting him near the top of the list.
I drink, I get drunk, I fall down
Not that we're bitter or anything, but we in Patriot land always make time to report the arrest of a current or former Indianapolis Colt. Donald Strickland now dons the colors of the sad-sack San Francisco 49ers, but he'll forever be an enemy in our eyes.
On April 13 cops spotted him being held back on the street by a bunch of guys who apparently thought he was going to get in a fight. Cops then approached Strickland and were going to arrest him on the spurious charge of being drunk in public, but being an NFL cornerback with NFL cornerback speed, Strickland took off. Being smashed, he didn't get far. Strickland fell down after about half a block, then got up and took off again. He was taken into custody and slapped with whatever charges were handy, including resisting arrest and public intoxication.
Table of Contents
Cover Archive
Masthead | Authors | Contact us
See all articles by:
All Slideshows


text:
Study shows more people moving to Idaho than leaving
POCATELLO, Idaho - More and more senior citizens are moving into Idaho, according to a new study from Atlas Van Lines. The study tracked the numbers of households travelling from one state to another, and found more people came to Idaho than left.
But what draws the 55 and older crowd into Idaho? Dan Cravens, economist with the Idaho Department of Labor said the low cost of living and the high quality of life are just two reasons.
"You can own a nice home here and it's a lot more affordable to do that than in many other areas of the country," Cravens said. "I think the most important driving factor is just the quality of life."
Many in Idaho, however, would say 'quality of life' is a relative term, as Idaho ranks the highest in low-paying jobs, and has a lack of college graduates. Cravens said that low number of highly-educated people has an effect on the highly-paying jobs that want to come to Idaho - employers look for an educated workforce, and Idaho is low on that list.
"Not having a post-secondary education is a barrier to higher paying jobs for a lot of individuals in the state."
But Cravens said while that is one of the detractors, low crime rates, the low cost of living and high medical quality drives people to move here or move back, especially those thinking of settling down to start a family or start their retirement.
He also said if you're looking to have a high-paying job, think about all the retirees and the aging population that will be here. They'll need medical care, and nursing is in-demand.
"And this is our number one in demand hot job right now. Physical therapy is another one, and obviously medical doctors have been in demand for quite some time."
Cravens also said when discussing reasons to move to Idaho, it's important to remember the scenic views and many outdoor opportunities available all year.


text:
Our campus is constantly under attack by a barrage of attempts to steal personal information (aka phishing). Often these attacks come during holidays when campus IT support is unavailable. Even when you can't contact the IT Service Center there are still clues and resources to help you figure out if the e-mail you have received is legitimate or a phishing attempt. More at www.colorado.edu/oit/news/holiday-phishing.
The most important thing to remember is that the university will never send e-mail asking for your private data (e.g. passwords, SSNs, credit card numbers, etc.) and you should be suspicious of messages that direct you to provide this information. If you think it might be a phishing attempt, it probably is.
Our campus lists recently reported phishing attempts on the Phishing E-mails page (http://www.colorado.edu/oit/it-security/email-phishing). You can report messages that you believe might be phishing attempts by following the steps on the Report Suspicious Messages page (http://www.colorado.edu/oit/it-security/email-phishing). Although the university uses technology to block malicious e-mails and phishing websites, this technology is no substitute for being a conscientious Internet user.
Many phishing attempts try to lure you in by saying you must respond to keep your e-mail account active because you have reached your quota limit. If you're account resides on the campus Microsoft Exchange service (this applies to most faculty and staff), you can check your quota by logging into https://exchangequota.colorado.edu/quotawebapp. If your account resides on CULink, you can check your quota in the web app (https://culink.colorado.edu/) in the top blue bar.
More information about phishing and how to stay out of harm's way is on the OIT Security Awareness site (http://www.colorado.edu/oit/it-security/security-awareness/phishing).


text:
Overnights Book Reading : Ching Chong China Girl
Our current Book Reading is Ching Chong China Girl - from Fruitshop to Foreign Correspondent, written and read by Helene Chung
Ching Chong China Girl is a bittersweet memoir of growing up different in Tasmania in the 1950s.
Helene Chung survived the taunts of childhood and went on to become the first women correspondent posted abroad by the ABC
If you've missed episodes, or you're a listener in those states who are missing out because of daylight saving changes you can now catch up with recent episodes here :
Episode 27 : SINGAPORE
Helene is enjoying her time in Singapore, including her first taste of 'yum cha' (played Monday 7th April)
Episode 28 : COLONIAL HONG KONG
Helene voyages by cargo ship to her next stop, Hong Kong . (8th April)
Ep 29 : HONG KONG : NEW YEAR, PARTIES AND DANCES.
Helene celebrates New Year in Hong Kong - but gives up on speaking the language! (9th April)
Ep 30 : WORKING IN HONG KONG
Helene starts work in Hong Kong and visits Macao...
Ep 31 : PING PONG DIPLOMACY
Helene is working as a reporter in Hong Kong and watches events unfolding in China.
Ep 32 : GOURMET HONG KONG
Helene enjoys some of the food delights of Hong Kong .
Ep 33 : SWINGING LONDON
Helene arrives in London.
Ep 34 : SCOOP
Helene scores a scoop - an interview with royalty!
Ep 35 : BUCKINGHAM PALACE
Helene arrives at Buckingham Palace to interview Princess Ann.
Ep 36 : CENSORED
Helene's interview with Princess Ann is cut - but we learn what was censored!
Ep 37 : EGYPT
Helene heads to Egypt on a family holiday
Ep 38 : EGYPTIAN ANTIQUITIES
Helene and her sister explore some of the ruins of Ancient Egypt
Ep 39 : REPORTING A TRAGEDY
Helene is working in Egypt and sees at first hand the reality of Mid East politics.
Ep 40 : SHOT ON THE NILE
Helene's sister battles illness - meanwhile Helene discovers the eateries of Cairo.
Ep 41 : DOWN UNDER AGAIN
Helene comes home .. to a job at ABC Current Affairs
Ep 42 : ME JANE !
Helene is back in Hobart, working for This Day Tonight - and falls in love!
Ep 43 : RACE SLUR
Has Helene been discriminated against because of her appearance?
Ep 44: DREAMS OF JAPAN
Helene applies for a job in Japan .. but that posting is not to be ..
Ep 45 : BULLET TRAIN TO CHINA
Helene prepares for her posting to China
Ep 46 : ARRIVING IN CHINA
Helene arrives in China and causes confusion for those sent to meet her!
Ep 47 : ALIEN IN THE MOTHERLAND
Helene's partner John joins her in China .
Ep 48 : THE OVERSEAS CHINESE
Helene pays the prices of being an "Overseas Chinese" !
Ep 49 : DRAGON FIELD VILLAGE
Helene is in China, working as the ABC Correspondent. She has gone in search of her ancestor's home village - and the locals are keen to please.
Ep 50 : PUZZLING THE TIN TRAIL
Helene heads back to Tasmania in search of her forebears . She heads to the tin mining disctrict.
Ep 51 : A CHINESE CUPID'S ARROW
Helene discovers relatives - and a love story - as she sorts out the family tree
Ep 52 : MYSTERY OF THE RED ENVELOPE
Helene discovers more about both sides of her family.
Ep 53 : MERLE OBERON
Was Hollywood actress Merle Oberon born in Tasmania? Helene hears the story .
Ep 54 : Double Ninth
Helene and her partner John settle back in Melbourne in a newly renovated home - but her life is to take a sad turn ..
Ep 55 : Twelve Apostles
Will a family funeral bring Helene's family together for the first time?
Ep 56: Jekyll and Hyde
Helene, in London, learns more about her mother's partner, Rex.
Ep 57 : A Heart-wrenching Decision
Helene remembers her sister Lehene - and a heart-wrenching decision that was made.
Ep 58 : Requiem
Helene's sister has found her lost son .. but loses her fight with cancer
Ep 59 : Epilogue (Final Episode)
Helene visits India - and comes home to a welcome from the next 'Ching Chong' generation.
Please note :
1) These episodes will only be available for a limited period.
2) Our readings are abridged for radio, a lot more awaits you in the book!


text:
GOOG Rising: Q1 Rev Misses, EPS Beats; Sets New Class of Stock
Google (GOOG) this afternoon reported Q1 revenue below consensus but beat on the bottom line. It also said it would split its stock two-for-one via a new class of shares to be distributed to shareholders.
Revenue in the three months ended in March rose 24% to $8.14 billion, after subtracting Google's cost to acquire traffic, or "TAC," yielding EPS of $10.08.
Analysts had been modeling $8.15 billion and $9.66 per share, according to FactSet.
Google's owned and operated site revenue rose 24%, while partner sites brought in a 20% rise in revenue.
Paid click growth was 39% compared to the year-earlier period, and 7% compared to Q4's level.
The company's closely watched "cost per click" metric, the amount it gets paid for search ads, on average, fell 12%, year over year, and 6% from Q4's level, it said.
The company generated $3.09 billion in free cash flow in the quarter, after subtracting for $607 million in capital expenditures. That brought total cash, equivalents, and marketable securities to $49.3 billion at the end of the quarter.
Google's headcount rose by about 2% from Q4 to total 33,077.
In a letter to shareholders, founders Sergey Brin and Larry Page, CEO, said they have accomplished what is "effectively a stock split," by creating a "new class of non-voting capital stock," to be listed on Nasdaq.
After a long defense of many of the company's founding principles, as the two see it, including a stock structure that "prevents outside parties from taking over or unduly influencing our management decisions," Brin and Page lay out the perceived appeal of the new shares:
These shares will be distributed via a stock dividend to all existing stockholders: the owner of each existing share will receive one new share of the non-voting stock, giving investors twice the number of shares they had before. It's effectively a two-for-one stock split—something many of our investors have long asked us for. These non-voting shares will be available for corporate uses, like equity-based employee compensation, that might otherwise dilute our governance structure.
We recognize that some people, particularly those who opposed this structure at the start, won't support this change—and we understand that other companies have been very successful with more traditional governance models. But after careful consideration with our board of directors, we have decided that maintaining this founder-led approach is in the best interests of Google, our shareholders and our users. Having the flexibility to use stock without diluting our structure will help ensure we are set up for success for decades to come.
Google shares are up $8, or 1%, at $659.01 in late trading.
Google's conference call with analysts is ongoing, having gotten underway at 4:30 pm, Eastern time. You can catch the webcast of it here.


text:
You guys should have taken the other manning, if he can make the brocos wrs look good he can make manningham into Jerry Rice.
Still think we'll have to go thru the same 3 teams in the playoffs that we beat last yr to get to the SB again.
the media crowning the "champs" already, and
the number of "well, that hasn't happened to the
almighty Noners in X # of games, records we broke
(rushing #'s, rushing TD, # of consecutive successfull
rushes, pics, points held to, etc...)
it sure made it a heck of a lot of fun for me.
game was exciting quarters 1-3. You knew the Giants were going to win half way into the 3rd quarter.


text:
Introducing GF Machining Solutions
Georg Fischer AG, the global industrial firm based in Switzerland, has a new name for the division that supplies well-known brands of electrical discharge machines, high speed milling, automation/tooling, spindles and more.
Georg Fischer AG is a global industrial firm based in Switzerland. Georg Fischer, however, is not a name that is widely recognized among manufacturing companies in the United States. In fact, it's the parent of the companies that produce manufacturing equipment under brand names such as AgieCharmilles (electrical discharge machines), Mikron (high-speed milling), System 3R (automation and tooling) and Step-Tec (milling spindles). Georg Fischer AG is also a major player in piping systems and automotive components—two areas in which it is well-known, especially in Europe.
So even if the name isn't as strong as it could be in the U.S. and other regions of the Americas, the company is eager to promote its unified corporate identity without diminishing the value of its familiar brand names of manufacturing equipment. For this reason, Georg Fisher has given a new name to the division that offers these brands. As of January 1, 2014, the division is now known as GF Machining Solutions. A recent Webcast press conference with Glynn Fletcher, president of GF Machining Solutions Americas, revealed further details about the new name usage, logos and branding. For example, the corporate logo, +GF+, will appear on machine enclosures, nameplates and labels, along with the product-specific brand name such as AgieCharmilles for EDM and laser technology, Mikron for high speed milling, and so on. The Step-Tec and System 3R brand names will also still be used under the umbrella of the GF Machining Solutions portfolio, Fletcher explained.
"While EDM remains a vital part of our company, we have grown to offer a much more comprehensive portfolio of products and services. This change communicates to the market what our customers already know: that we offer world-class, comprehensive solutions for every aspect of their operations," Fletcher said. In addition to the name change, Fletcher said a new design style will be implemented for the GF Machining Solutions website, sales literature, business cards and other external communications.


text:
[quote user="Morehead State"][quote user="Kruunch"][quote user="TuckYou"]
[quote user="michaelkhan3"][quote user="Shockeyitus"]1 - Coby Fleener 2 - Doug Martin 3 - Donta Hightower 4 - Devon Still 5 - Chandler Jones One of these guys will be on our roster Thursday night.[/quote]
I really dislike Chandler Jones. And I just don't get why people like Doug Martin better than David Wilson and Lamar Miller especially for the Giants.* *
Why dont you like Chandler Jones? IMO, he is another Tuck. I dont like how he shot up the boards though. He was a 3rd rounder after last season. Now he is a 1st rounder?
And We WILL NOT draft a TE with the #1 pick, unless we trade back.
[/quote] I think that's why he doesn't like Chandler Jones ... he's been over hyped of late. I'm not a huge fan either ... decent guy but he doesn't have the athleticism that Tuck has, nor the elite pass rush skills the Giants cherish. i tend to agree with you about the TE position ... I don't see the Giants drafting one in the first but Reese still has a small enough draft sampling to surprise us I think. I equate it to us drafting Nicks in the first round in 2009. Obvious need, obvious value.[/quote]
Thats why I'm hoping he goes with Wilson or Doug Martin.* He has shown a willingness to go with need.* He went KP in 08 and Nicks in 09.* The last two drafts however have been BPA.* Only because our targeted guys were gone.* (at least in '10 with Mclain)[/quote]
Yep yep.
Although I don't think JPP was BPA (Iupati was concensus BPA at the time of our pick AND a need). JPP was more potential then anything else.
But boy they got that one right.


text:
thehockeyguru wrote:The fact that the seer was able to repel the first night attack was a huge blow to us. I had tried to kill Canaan on night 3 and it failed. This not only allowed him to make his findings public, but allowed the Angel to protect him in the future. If Canaan dies Night 3 this is a completely different game. Slappy used another kill night 4 which was again unsuccessful.
I also dont understand why Mac could only see every other night while Canaan was able to see every night. To me, the powers were heavily in favor of the Good RP's


text:
seriously? I don't want to join any of those websites! I pay a bunch of money every year for servers, I don't see why I have to use some other stupid server! ugh!
Dumb rule
I'm using a Mac. No right click. Joined photobucket. Still cant get images to load. Since these are the new rules there should be a HELP section with directions.
no, it isn't. and imageshack is free, unlimited, and easy to use.
everyone needs to quit bitching
I use the same URL for every web forum I go to, and to update my avatar I just FTP and overwrite it.
I have to be a member of a web site and go out of my way to update my avatar on here.
I have been an admin on several different message boards and have never heard of this kind of rule. I cannot understand a single "security" reason for not being able to link an image onto this forum unless the boards themselves are seriously poorly designed and can somehow allow cross site scripting just from linking an image.
And Chicken is still allowing images to be linked from anywhere on the web in posts, so I don't see how there's less of a risk now if there ever even was one.
Advertising Info
Privacy Policy
Where to Watch LSU
Contact Us
© 2017 TigerDroppings.com. All Rights Reserved


text: Ok Boys and Girls here it is.. 1 rule I can not post up the price But it will be the same for all members. The reason for this is that if some Warehouse or dealer sees it they will NOT be happy.. Pm me and the price will be sent..This is the way it has to be for these Group Buys. Lets not make our Sponsors or these Vendors mad.... The shipping is about $15.00 to the lower 48 states Plus any Adp you may need for your Trailer plug.. go here to see what you may need.. http://www.whitenight.com/ Payments will be taken by Check or Paypal (add $3.00 for their fees) Thanks Glenn


text: Jon Gruden's playbook was the one that Callahan used in his time with the Raiders. There is no "Bill Callahan" offense per se but it was all Gruden's WCO. I browsed through a minicamp playbook from the 1998 Oakland Raiders and the terminology is completely different from the Coryell offense. There is no practical way to implement that offense without having the players learn the terminology. While it may be easy for the wide receivers, the OL will have to learn two new sets of protection calls which again is pretty impractical. The only way I can see it work is if Callahan actually translates one play at a time and converts into Coryell terminology. That is entirely way too much work on one person to do by themselves and if the protection schemes are different in any way, well now Callahan is "making up" new terminology. WCO's do not use a numbering system to designate routes but instead use the actual word like "dig, corner, go...etc" so it would be pretty easy for the WRs to pick it up, however, some of the playcalls are incredibly lengthy. This presents a problem for Romo having to digest this and the Coryell while relaying the plays on the field. For example: HARVEY FAR WEST RIGHT ZOOM 200 JET HAMMER is play from a 3WR set that attacks the seams with TE and slot WR while the outside corners running stop routes or fade routes on cloud coverage (cover 3). Callahan should be able to use the most basic plays in Gruden's scheme and find something in the Coryell book that has the same attacking concept. All playbooks have the same principles when attacking the defense (man or zone) The differences are how they do it in the formations. Something else to consider is that with Callahan calling plays it gives a new "set of eyes" to look at the Coryell scheme and figure out the strong suits of it with our current personnel/future personnel. Sometimes when you do something a certain way for a long time you can get complacent with it. I've had that happen to me a few times in my job and I'm always open to learning a new method of doing things. Hope this clears up some confusion.


text:
Thanks! :DQuote:
Originally Posted by Grama Lehr
Printable View
Thanks! :DQuote:
Originally Posted by Grama Lehr
What a great idea!! Thanks!!
Keep an eye on my daily calendar entries. There are often good tips.
Originally Posted by ChubbyBunny
LOTS of pages--- send email by pm!
Thanks for doing this for all of us!!
You're welcome, everyone!
Good idea
This is great - wondered what some of the abbreviations meant. Now I know thanks
Thank you, appreciate the effort you put into it!
I read that if you use pinking shears to "trim" a fabric before you wash it that it will not fray too much. I tested this yesterday and it worked! Usually I have a mass of knots if I wash more than a few fabs. I washed a lot that I trimmed with the shears and there was just a slight fraying on a few fabs. The rest were almost perfect! Plus-you have the added benefit of knowing which fabrics have been washed already!
Nice job! This will be very helpful for us "newbies". thanks


text:
Someone wants $195 buy now price for Ppsh 41 drums on Gunbroker, Another has 2 for $150.
just watched five glock 9mm 17rd USED factory mags go for 400 bucks
crazy man !!!
Someone wants $195 buy now price for Ppsh 41 drums on Gunbroker, Another has 2 for $150.
yea it is getting a bit nutz.
$499 stripped ar lowers and $100 each for mags? $250 for an 80%?
i think there is some kind of 'mass manic mania " episode going on in the US -
-maybe some Rx drug side effect causing people to not be able to add and subtract?
of some kind of compulsive spending spree?
i don't know but anybody that would pay that much for a mag or a lower has got to be off his rocker--
Its got to be a location thing. We have backpage to advertise stuff for sale, there are still $700 AKs that arent selling. Lots of AR's advertised for 1200 and up but the same rifles keep getting relisted. Korean AK drums for $200 and not selling. (I think apex has them in stock for 150?).
I did have 3 of those korean glock 33 rd mags, I did manage to trade for a old winchester shotgun. I even told the guy I thought he was getting the shorter end of the deal, so I threw in a 10 round glock mag. But he was more than happy. Jim
I just went to walleyworld, they had 1 box of .45 left the 100 round federal box was 32.96. I just shot a box last weekend so decided to restock. If they had more I still would have only bought the one. jim


text: HomeGames for Kids & FamilyBingo GamesBingo Bears Game Bingo Bears Game Rate This Item... $19.95Learning Resources • In Stock • 81934QuantityHave a question? Chat Live!Add to CartShare Via Facebook Share on Pintrest Share Via Twiter Email to a Friend About4 years & up. Every time you play it's a different game! Puzzle format allows children to create game cards and play at various levels. Reinforces early learning concepts such as color, number, and size. Includes 36 bear counters in 3 sizes and 6 colors, reversible game spinner, 4 bingo cards, 32 bingo tiles, and instructions.RecommendedBasic Spanish Bingo Game$9.99Clue Game$16.95Wooden Abacus$14.95Bead Sequencing Set$29.95Zingo Game$19.95Bilingual Zingo (English/Spanish)$19.95


text:
My wish for each reader today is a day filled with good times, good food and an attitude of gratitude as we celebrate Thanksgiving.
Those of us fortunate enough to be born in the United States, we are so blessed when compared with the vast majority of the world's inhabitants. Please remember that we enjoy a standard of living and personal freedoms beyond the dreams of people living elsewhere, particularly in the Third World. Can it be better, yes, but let's be grateful for how good it is and count our multitude of blessings.


text:
How I Ditched My Inner Christmas Scrooge
Nikki Thomas | Posted 02.04.2013 | Canada Impact
Read More: Christmas, Gift Christmas, Charity Christmas, Christmas Charity, Giving to Charity Christmas, Gift Guide Christmas, Gifts Christmas, Video, Canada Impact News
As I got older, the so-called "Christmas Spirit" started to wane, and eventually disappeared altogether. I couldn't stand the sound of Christmas music, I hated fighting for parking spots at the mall, and anxiety over whether I had purchased appropriate gifts for friends and family became overwhelming. Surprisingly, I found that the "Christmas Spirit" was restored in me, from an entirely unexpected source.


text: Hi everyone, I would like to know if anyone can point me to a source for purchasing blue orchard bees? I want to add them to the bee yard. I have contacted two groups but have not had any response from them...I am in Virginia, on the coast. All advice will be gratefully received. Thanks NB