text:
Serving and leading as a military officer for over a decade helped Amy develop, not only a great work ethic, but a passion for helping others. After giving birth to her second child, she hung up her boots, so to say, and committed to pursuing her heart's true passion…helping others change their lives by taking a holistic approach to health! Amy arrived at the profession of health coach and birth doula after her own journey to motherhood led her there. She struggled most of her adult life with an auto-immune condition that was wreaking havoc on both her physical and mental well being; a condition that only intensified with each pregnancy. Through study and diligent application of holistic nutrition, Amy was able to take control of her life. No longer was each day a struggle to survive—she was thriving and wanted others to feel the same. Amy offers health coaching services tailored to clients experiencing a transition to motherhood, be it physical wellness preparation for pregnancy, personal training and nutritional guidance throughout pregnancy, and/or the adjustment to postpartum body and family wellness. It is a program for those wishing to create change in their life, health, relationships, and beyond. In conjunction with facilitating a woman's physical wellness needs, Amy is passionate about being a birth doula and believes irrevocably in the power of birth to completely transform and empower a woman. Amy's foremost goal is to make the birth a positive milestone for the mother and her family. Amy is blessed to be the mother of three children, ages four and under, and wife to an amazing Army Officer. When she's not helping birthing mothers or leading her local non-profit Mom's group, Amy enjoys cooking, reading, walking their family mastiff, and training for her black belt in Ju Ki Do.
Beth Hawkins has been supporting her friends and family members during labor since 2005, the year the first of her two wonderful children was born. Her own experience of a wonderful birth with a midwife led her to want others to have a birth that they will cherish and remember fondly. Beth became a certified DONA Birth Doula in 2014, and is currently working towards her bereavement doula certification to help families cope with the loss of their child, and she is in training to become a lactation counselor. Beth and her husband own a small Pygmy and Nigerian Dwarf goat farm, where she and her children, born in 2005 & 2009, doula for the nannies every year—the easiest of doula jobs! As the former director and current chaplain of a small preschool in Comfort, Beth gets to enjoy watching some of the babies she doula-ed for grow up! Beth says that there is nothing like that moment a baby is born and all is right with the world—it's truly magnificent! Beth lives outside of Boerne, where she teaches Bradley® Method of Natural Childbirth classes. She will travel to San Antonio and anywhere in the Hill Country to doula.
Beth Sims is a mother to three amazing children and wife to a super cool guy. She has been practicing as a Doula for the last 8 years and has attended over 100 births and served dozens of families as a Postpartum Doula. Beth is also a Lamaze Certified Childbirth Educator. She was drawn to become a Doula after the birth of her second child, a VBAC that was attended by an amazing Doula. After appreciating what a gift a great Doula is, it became obvious she wanted to gift that to other women.
Over the years Beth has learned that it isn't the type of birth a woman has that defines satisfaction in her birth experience, it is whether that woman felt her voice was heard and her choices respected that brings satisfaction. Beth is a straight talking Doula who is very honest about the challenges faced in childbirth. She also really enjoys assisting partners so they can better support the laboring mother and preparing them on the challenges they will face watching their loved one on her journey to motherhood. Beth believes, as a Doula, she serves the entire family managing the adjustment of bringing a new life into their unique family.
Beth is a founding member of Viva Doulas. She served on the board for 3 years and is proud to be a part of such an amazing group of women. Please call, text or email Beth for availability in her schedule.
Bethany Cain is mama to three beautiful children. She has been a doula since 2012, shortly after the birth of her second. She has become a passionate champion of babywearing since becoming a mother: she is a Certified Babywearing Educator (Babywearing Institute) and a Volunteer Babywearing Educator for the local Babywearing International chapter. She has personal and professional experience in home and hospital settings, and high-risk pregnancies and births. She works closely with her mom and business partner, Toni Cadena. Call Bethany at 210-445-6488 to inquire about birth, postpartum, babywearing or cloth diapering services.
Rebecca began her motherhood journey as a single mama striving to earn her bachelor's degree with a toddler in tow. Her personal experience made me feel both edified in her personal abilities and deeply aware that all mothers need support from a community, especially from other women providing hands-on care with perspective and empathy. With the love and never-ending support from her family, Rebecca earned her B.A. from UTSA in Anthropology and went on to graduate school focusing on maternal and infant health and the anthropology of gender, reproduction, motherhood, breastfeeding, and birth. In graduate school, she fell head-over-heels in love with her husband (a handsome guy researching primates) and welcomed another beautiful daughter into their family. Her intellectual interests combined with her applied sensibilities when Rebecca completed an internship, and later obtained a permanent position as a long-term advocate and parenting educator for teens and young mothers with a local non-profit organization. During her time as a case worker, she found that she excelled at serving new mothers and growing families experiencing all of the changes pregnancy, birth, and the postpartum period can bring. Her transition to full-time doula work has been a perfect fit! Rebecca can provide in-depth, personalized, holistic support to each family and watch them thrive and become empowered within themselves during their birth and transition to parenthood. She sees sharing the birth experience with families as a complete privilege and is grateful for the 50 (plus) families that have chosen her to be their birth journey companion. She is amazed by all of the women that have shown her so much strength, vulnerability, and beauty bringing their new babes earthside and blooming into mothers. Rebecca is a Certified DONA doula and Birthing From Within Mentor and Doula. Please call or text at 210-323-1702
Ruth is a trained birth doula with an interest in supporting families through the full spectrum of reproductive needs; her goal is to help every mama birth in an aura of love and respect. Ruth offers private childbirth education classes; baby shower/mother blessing planning and hostessing; and antenatal, labor and postpartum doula support services. She has a special interest in working with mamas diagnosed with diabetes as she has lived with a Type II Diabetes diagnosis since her teen years. Ruth currently has availability through October 2015. You can follow Ruth's blog at saltymamabirth.com/blog or follow her on Facebook at www.facebook.com/saltybirth.
Susan Allick is a United States Air Force retiree, who received her Bachelor's degree from Wayland Baptist University. She has birthed four children without pain medication in four different countries (first one pitocin induced). She has 17 grandchildren; and has been supporting and assisting moms with the birthing process for 8 years. She is a certified birth doula with DONA, CAPPA and Hypnobabies. She is a volunteer with Operation Special Delivery (OSD) providing free Doula service to those military wives whose spouses are deployed. She also works with San Antonio Birth Doulas, a non-profit organization providing free birth support for teens and low-income women, during their pregnancy and birthing time. She serves women who choose to birth in hospitals, birth centers or in the comfort of their own homes in San Antonio and surrounding areas.
Tina's journey into birth work started after she became a Mother in 1996. Tina began working to empower mothers and families in 1999 when she became a La Leche League Leader. Through her work as a La Leche League Leader she has assisted thousands of families in getting their first weeks and months off to a great start. Tina's love of working with mothers, babies and families led her to her career as a Birth Doula, Childbirth Educator and Lactation Consultant. Tina is a Bradley® Natural Childbirth Educator teaching classes weekly. She continues to work with LLL leading a local group and also sitting on the Council of LLL USA. Tina serves the San Antonio area as a Board Certified Lactation Consultant through her work with The MILC Group.
Tina's greatest accomplishment by far is being the mother of three fantastic children! Her children range from college aged to middle school and they are each special and unique in their passions and future goals.
Tina feels honored to be welcomed into the most important experiences that a family will ever have…the birth of their children. It brings her amazing joy to work with so many families and she is awed each time she watches a new life come into this world.
Tina is always working to further her education and was Voted Best Doula in San Antonio in the San Antonio Current.
I am a birth and postpartum doula trained by DONA. I am comfortable attending medicated as well as non-medicated births and support a mother's right to choose her birth path and follow it. I have had 4 unmedicated births and am a grandparent of 7. I have breastfed all of my children and am an advocate for breastfeeding. I also am happy to provide information on cloth diapering and babywearing. I enjoy all aspects of child bearing and rearing. I am bilingual English/Spanish
As a labor and postpartum doula, Valerie Lopez serves families who are planning a home birth, hospital birth, vaginal birth after cesarean (VBAC), or a scheduled cesarean birth. She enjoys working with Certified Professional Midwives, Certified Nurse Midwives, and Obstetricians. Each woman and family is unique and has different hopes and desires for their pregnancy, birth, and postpartum time. She works with women to design a plan and goals that best suits the mother and her family. You have your goals and she helps you meet them.
Valerie has served families since 2008. During pregnancy, each client has unlimited access to her. During the birth, the mother and her partner have her full support in whatever capacity the couple desires. After the birth, she helps the mother and partner navigate breastfeeding or bottle-feeding, newborn care, and help the family transition to this new life smoothly.
As a person, Valerie is known to be knowledgeable, nurturing, and hilarious. Prior to working with families as a doula and childbirth educator, she was a high school dance director and teacher in the public school system. Valerie married her husband, Salvador, in 2004, while he was serving in the Navy. They have four incredibly vibrant children. Salvador and Valerie have lived in different cities in the U.S. while having and raising their children. While she is grateful for her many experiences living in Charleston, Chicago, Dallas/Ft.Worth, and Houston, she is proud to call San Antonio home.
To contact Valerie about taking a Birth Boot Camp® Childbirth Class or to schedule a free consultation for labor and/or postpartum doula services, visit AlamoCityBirth.com, Alamo City Birth on Facebook, call or text at (210) 396-2754.
Yvette, a native of San Antonio, is a proud mother to two amazing children, Derek (14) and Makayla (10). She has been a Birth and Postpartum Doula for the past 7 years during which she was the assistant director of San Antonio Birth Doulas. Mothers speak highly of her ability of bringing calm to an intense situation with her strong verbal skills, of using physical manipulations to help encourage the body to open more effectively, and of creatively incorporating partners in the process. She also highly skilled in many rebozo techniques. Outside from being a Doula, Yvette also teaches childbirth, breastfeeding, and newborn care classes at St. Luke's Baptist hospital. When not caring for her children and supporting families during labor, you can find Yvette caring for her mind and body cycling all around Bexar county up to 30 miles a day.


text:
Active Tags
Click tags to the right to narrow your search. Unclick tags to remove.
Artiface of Strength Ch. 14— Final Chapter
Artiface of Strength Ch. 12— In war there is death.
Artiface of Strength Ch. 11— The army arrives.
Artiface of Strength Ch. 09— Beth finally gets her boots.
Artiface of Strength Ch. 07— Florence goes to visit William's grandfather.
Artiface of Strength Ch. 06— Showdown at the mountain pool.
Vague Warnings— Kyle's subconscious is trying to run his life.
Artiface of Strength Ch. 05— Florence makes a challenge.
Artiface of Strength Ch. 04— A date with William.
Artiface of Strength Ch. 03— Florence returns to the Clubhouse after a long absence.
Artiface of Strength Ch. 02— Florence's family tries to help.
Artiface of Strength Ch. 01— Un-mated and lonely, a Were bitch desperately runs onward.
Sister's Needs Ch. 02— Maggie gets punished for trying to deny her sister.
Sister's Needs— Beth exchanges a cherry for a cherry.
Reconciliation Ch. 03: Redemption— The final chapter.
Black Star Ch.04: Sinful Ways— Avril Lavigne's sinful getaway concludes.
Black Star Ch. 03: Temptation— Avril Lavigne returns to her favourite, sinful city.
The Bigger They Are— Beth Phoenix gets a taste of her own medicine.
Rule of Thumb (and Fingers) Pt. 01— An unexpected erotic interlude.
A Lady's Choice— Beth and Eric finally go all the way.
Uptight Woman Turns Sexy— Sexy animal convinces her to change.
Just the Six of Us Ch. 16— Mike, his sisters, and the voice in his head.
Pool Payments Ch. 04— Beth's late fee - reluctantly paid in full.
CvsN 16: Beth's Last Virgin Hole— Sisters, Amie, and Beth's last hole - what a night.
A Tempting Vacation Ch. 10— Beth keeps up the tease, but who's tempting who?
Beth and Sam Ch. 03— Beth, Sam, & Steve: continuation of family relationships.
Melina's Balcony Fantasy— Beth fulfils one of Melina's fantasies.
Beth's Seduction into Porn Ch. 02— Beth is beginning to discover things about herself.
New Horizons Ch. 08— Samantha begins training but who's training who?
New Horizons Ch. 07— Samantha's sapphic journey continues.
Best Friends With A Twist— Beth and Amanda get friendlier.
Bar Shots— She gets release from a tense day.
Therapy and Hotel Rooms— Everyone should have this therapy.
One Hundred Percent Loving— Eddie becomes the third triangle member.
Crowded House Ch. 01— The first chapter of Jonas' experiences at home.
Sarah's Slut Experience Ch. 01-02— Sarah learns to share herself with others.
Beth & Bill— It was the best sex he have ever had.
Beth Vacation Ch. 02— Beth takes him out.
Helping Out— A friend in need...
Beth Vacation Ch. 01— Sexy older woman breaks stud with sex.
Lani— Surprising step-daughter gets what she's after.
The Pool Girl— Young lady at the pool entices Neighborhood Man.
The Master Ch. 06— Beth joins in the new sub's training.
Grant's Opinion of Beth— Following on from Beth's view.
Meeting— A romantic meeting between first time on line lovers.
Naturally New Zealand - Beth— Outdoor arousal.
Mature Woman Conquest: Beth Ch. 02— Beth deflowers a timid young man.
Mature Woman Conquest: Beth Ch. 01— They dominate and deflower virgins.
Raped!...Breeding Time— A Man and six beauties all alone for the winter.
Pizza Ch. 02— Beth the pizza girl goes to confess her sins.
Callie's Summer— No one knows you like your best friend...
Loving Amy— Weary traveler gets refreshed.
A Christmas Eve Surprise— A boring Christmas Eve turns wild.
A Almost Perfect Awakening Ch. 52— Carly's Coming Out Party
A Almost Perfect Awakening Ch. 37— Beth is the second feature at the drive-in.
First Impressions— There is no denying chemistry.
A Almost Perfect Awakening Ch. 11— Sisters rub each other the right way.
A Almost Perfect Awakening Ch. 09— Daughter sees what she wants in the stable.
Forgetting Him— Gwen helps a friend in need.
Bathroom Whore— Dad takes his daughter, until she likes it.
Cocktail Party— Jenna attends party with Sir James.
Submissive Beth Ch. 5— Whipping is followed by anal sex.
Going To School— He & his wife take new student to flashing shopping.
Karen's All-Girl Party Ch. 2— Linda's shares her story.
Color Guard Ch. 3— He's even more horny as another girl is taken.
Crossing The Line Ch. 1— Ally learns to enjoy women too.
Beth & Friends Ch. 1— Beth gets together with new friends.
He Could Go All the Way!— A woman pleases the man during a game.
The Pleasures of Beth: End— Beth reminisces about her many experiences.
The Evil Doctor Avery— Nnscrupulous doctor enjoys naive bride-to-be.
The Meeting— Beth, Craig, and Andy share a meal to remember.
Too Long Apart, One Last Time— Alan turns up the heat on their last night.
The First Time Ch. 3— Wife's shorts turn see-through in the sun.
The First Time Was An Accident— Beth exposes herself to other campers.
Fucking My Step Mom-To-Be— His fantasy comes true with dad's girl.
Getting Well Ch. 3— Aunt Beth starts the healing.
Beth Improvises— She really loves vegetables.
A Turn of Events— Beth is forced to watch Lisa seduce her guy.
Getting Well Ch. 1— Aunt cares for nephew after car accident
Teens Today— Older man experiences youth.
Beth— Student falls for petite recent college grad.
Active Tags
Click tags to the right to narrow your search. Unclick tags to remove.
Please, separate your tags with comma: anal orgasm, oral sex.
Read the Literotica Story Tag FAQ for more information on these tags.

subset: commoncrawl


text:
What is Windows UAC you ask … Windows User Account Control (UAC) is a technology and security infrastructure introduced with Microsoft's Windows Vista and Windows Server 2008 operating systems. Microsoft has added an extra layer of security that suspends all applications that are running as an application by the user who is logged in, and then requires the user to reply to a dialog box to either allow or cancel the action requested.
What is Run as a Service? Run as a Service is a feature of GoToAssist Corporate that enables you to have your remote support service run beyond the basic application level to more easily support end users. Running GoToAssist Corporate as a service and logging in as an administrator will not violate or circumvent the security model on the customer's PC. Access is granted only if the customer is able to log in with the proper credentials of a local or domain administrator.
Did you know … GoToAssist Corporate can be run either as an application on a remote machine or as a service? Your GoToAssist Corporate account may be set by default to initially run the customer software as an application for all sessions. When the UAC dialog box appears, all software that is running as an application is suspended. You are not able to reply to the UAC dialog box and cannot continue with the session until the customer selects Continue, which can be annoying and can impact the customer service experience.
You can now change GoToAssist Corporate setting to run as a service directly from the portal settings tab in the Online Management Center.
When "Allow run as a service" is enabled for a portal, the reps can turn on Run as a Service on when in a remote support session by simply clicking on the System tab and selecting Run as a Service. An additional piece of software is downloaded onto that remote machine, which gives the representative even more access to the computer.
Running GoToAssist Corporate as a service provides the following benefits:
- Windows Vista ,Windows 7 and Windows 8: Support the customer without having their sessions limited by User Account Control (UAC)
- Allows the representative to request and use the customer's credentials to unlock a system or to login after a system reboot
- Allows the representative to reboot using SafeMode
- Send Ctrl-Alt-Delete commands to the customer's machine
- Permit the customer to switch user profiles without locking you out
- Automatically reconnect to the welcome screen when the Reboot/Reconnect feature is used
If you desire to change your GoToAssist Corporate settings, view these step by step instructions.


text:
Joseph F.wrote a review of Demon United Shield Short Hardtail - Men's on December 31, 2012
Wish some of the other pads were as thick as the tailbone bad. quarter inch just doesn't do a lot. But it does help, especially the 1/2 inch pad with hard case for your tail bone. I also wish the pads came up a little higher. From the picture it looks like they would but the pads actually hang kind of low. No Protection in that lower back meets butt area.


text:
It all comes down to the numbers - at least it does according to Dr. Ric Crossman. You'd be amazed at what can be explained by fractions, decimals, percentages and statistics; let Dr. Ric guide you…
Cast your mind back to before this column existed, when I was just a penniless mathematician penning my first GeekPlanet article. I suggested then that those believing mathematics a language were in error. It is, I insisted, a form of literature, a method for harnessing the language of arithmetic, allowing us to deliver concepts and ideas beyond what we see immediately upon the page.
This is not a truth without its difficulties, however. The most troublesome is this: every damn fool is convinced that they can write.
There is no bright line dividing simple stories from true literature, but the latter has at least conventions. They can be broken, sure, indeed some of the greatest works of literature do just that, but you need to know those rules before you can safely break them. The writing should matter no less than the plot, and that plot should be recognisably unique, not merely the latest iteration of boy meets girl/detective meets case/space prince meets intergalactic dark lord. Granted, you can stumble into the realms of literature entirely by accident, but people shouldn't fool themselves that their latest chapter of "Fatal Passion" or "Harry Potter and the Caves of Androzani" is going to cut the mustard.
So it is with statistics. Ask a layman for the airspeed velocity of an unladen swallow, and they will shrug their shoulders (once they're done quoting Monty Python). They're not zoologists. Enquire how best one might whip up a batch of sulphuric acid, and they will confess ignorance. They're not chemists. Press them for a figure on the speed required to escape the Earth's pull and they give you happily blank looks. They're not physicists (even though in truth that particular slice of rocket science isn't exactly rocket science).
Ask them how likely Wayne Rooney is to score three times in his next five attempts, though, and suddenly everyone's a goddamn expert.
Obviously, I don't care how inaccurate people's football predictions are. Nor am I claiming some kind of secret insight into Rooney that only statistics can provide (though I could give you a figure that would be, no pun intended, in the ball-park). However, the principle extends to far more serious issues, and more insidious phrasing. Instead of goal tallies, it's Muslim participation in and relations with society in general. Instead of "How plausible is it that this will happen", it's "How plausible is it that this did happen without it suggesting Muslims are benefiting from positive discrimination/actually have it easy/all part of an international conspiracy to destroy the West headed by Osama Bin Laden, Imran Khan, and Art Malik?"
I've highlighted two examples of this before. In both cases, what made their clumsy number-crunching so disgraceful is that methods already exist to consider such things dispassionately and precisely. Indeed, such articles tend to be laden with such weasel words as "It would at least appear" and "Might it not be the case that" precisely because they are afraid to submit their ideas to proper analysis, at which time they're liable to fall apart. Rather than strengthen their argument (which, of course, they can't) they weaken their conclusions, hoping that the message will still come across. That the damage will still be done.
By way of an example, let's return to Paul, the allegedly psychic German octopus. Let's ask a question: "Could he have gotten so many correct answers if he was just picking teams without preference?", and see what the data reveals.
First, let's look at his record. In 14 games, Paul picked the winning side 12 times. That certainly seems like a lot *. Is it, though? We turn to the endlessly useful binomial distribution. For those who don't remember, the binomial distribution allows us to calculate how likely a specific number of trials are going to succeed, assuming we know how many trials there are, that each one can either succeed (with the same chance) or fail (with the same chance), and that no trial has an effect on any other.
This seems to fit Paul's situation pretty well. The trials are the process of picking, with success when the winning team is chosen. We can assume his chances of guessing right do not change; either because he really is just a humble sea creature picking at random, or because the ancestral ghosts of the octopus civilisation are equally likely to whisper the answer to him each time. It also seems likely that the result of one trial will not affect any other; octopuses are evil and mendacious creatures, and unlikely to suffer a crisis of confidence.
Unfortunately, we don't actually know what the chance of a correct guess actually is. We do know that if Paul isn't psychic, and his handlers aren't pulling a fast one, then he should have had a 50% chance of succeeding with each guess.
This is a null hypothesis, something we assume is true until overwhelming evidence changes our mind. So how plausible is it that Paul received no help either from overly enthusiastic German patriots or cephalopodic forces beyond the ken of mortal man? Put another way, assuming we are right, how likely is it that Paul would do so well entirely by chance?
We need to calculate the probability that 14 trials with a 50% chance of success will succeed at least 12 times. Why at least 12? For the same reason if you toss a coin 20 times to check whether it was fair you wouldn't be expecting exactly 10 heads. Indeed, even for a fair coin, the chance of exactly 10 heads in 20 is only 17.6%, because although it's the most likely of the 21 possible results (from no heads through to 20), you're still much more likely to not get exactly 10 heads. On the other hand, the probability of getting at least ten heads is 58.8%.
If our null hypothesis is true, there is no ultimate difference between letting Paul pick a team and simply deciding by a coin toss. As it turns out, the chance of 14 tosses resulting in at least 12 heads is 0.65%. Clearly, that's pretty damn low. In fact, it's so low that our assumption that Paul is just as likely to pick the loser as the winner now seems distinctly implausible. The vast majority of people who use statistics would suggest any value below 5% (and certainly 1%) is sufficiently unlikely as to make us reject our null hypothesis. On the other hand, if we'd decided for some reason that Paul's chance of success was 70% (he chooses the winner seven time out of ten), he would have a 16% chance of providing at least 12 correct guesses. That's greater than 5% or even 10%, and so in that event we'd conclude that there is insufficient reason to change our minds about Paul's chances of guessing correctly.
Naturally, this isn't the end of the story. We're satisfied that Paul's chance of success can't be 50%, but we still don't know what it actually is (there is a wide range of possible answers, none of which the above method would have rejected; part of the appeal of hypothesis testing is that it requires overwhelming evidence before you can claim something is true). Nor do we know why the chance isn't 50%. Most likely, his handlers are stacking the metaphorical deck, deciding which team they find most likely to win offering that box first. Or perhaps they always offer Germany toward him, making him much more likely (though not certain) to choose it. That shifts the question from "Why is Paul so uncannily accurate?" to "Why can't our national team be as good as Germany's?"
Those are questions for another time, though. The critical point here is that hypothesis testing isn't difficult, especially with websites like this one which reduce the process to merely plugging in numbers. In other words, even if you never learn to apply it yourself, you now know to always be suspicious of anyone like Pipes and Goldberg who pose questions for which hypothesis testing is ideally suited, but don't bother applying it. Either they don't know what they're doing, or they very much do know, and are hoping you don't notice.
Hopefully I've now made that a little bit harder for them.
* For the purposes of the example we'll ignore my previous points about the fact that we'd never have heard of him had he not already racked up a fairly impressive tally.


text:
Artist description:
The republic encounters a small fleet of CIS rogues who where guarding the space around a planet. in the upper right corner you can see an special camouflaged republican ship wich opens fire and slightly loses its camoflage.
Flash Draw Created Apr 21, 2009 470 x 338px Unless noted Copyright 2009 sarcavo.
We encourage you to submit a comment and let the artist know what you think of this drawing. Please log in or join to post a comment.
Post a comment
wow cool ! :D 5hearts please rate my drawings x


text:
Artist description:
this is an updated version of my other 'alone' drawing.
Java Draw Created Jun 06, 2010 470 x 338px Unless noted Copyright 2010 bigmama1016.
We encourage you to submit a comment and let the artist know what you think of this drawing. Please log in or join to post a comment.
Post a comment
Nobody has commented on this drawing yet. Be the first!


text:
Below is the "instructional design" description of the first in a series of implementation studies, looking for instances of Parallel Design Patterns in actual code. Feedback welcome!
1.Module Name: Parallel Pattern Implementation Studies: structured grids as implemented in the Lattice-Boltzmann project OpenLB
2. Writers: Michael Wrinn
3.Targeted availability: EOQ Q4 2008
4.Brief Module Description
Proposed duration: ~ 1 hour, self-guided
The ISC module Architecting Parallel Software described in detail the concepts of organizing software patterns into Structural and Computational categories, and linking those to a set of Concurrency Patterns; the result is the Parallel Pattern Language (PPL) being explored and refined by researchers at UC Berkeley, UIUC, and Intel. The module described here is one of a number of case studies intended to demonstrate, with working parallel programs, PPLs mapping to actual solutions.
This particular case study in pattern mining examines a category of algorithms, Lattice-Boltzmann solutions for fluid flow simulation. Compared to the fluid simulation methods currently used in game physics, Lattice-Boltzmann methods show promise as both more general and more sophisticated approaches to physics solutions for fluids and smoke; for real-time use, they require computing capability just beyond typical current desktop systems, but just within reach of anticipated multicore and manycore systems anticipated in the near future.
The specific patterns involved are: the Computational Pattern Structured Grids, and the Concurrency Patterns Data Parallelism and supporting structures Loop Parallelism, and SPMD. (please see the Architecting Parallel Software module for definitions and further explanation).
The coding examples to be used were developed in the OpenLB project under Dr Jonas Latt in Lausanne; Dr Latt has enthusiastically agreed to work with us on this project, and considers the OpenLB implementation to be an excellent example. The concurrency was implemented in two different ways, so the merits of those choices will be compared. The project has the potential, in the future, of being tested in still a third way, using Intels Ct.
The module will consist, explicitly, of descriptions of the Lattice-Boltzmann algorithms, their mapping to the proposed Berkeley Pattern Language for Parallel Programming, code fragments illustrating those mappings, and comparative performance discussion. Users will be able to download the OpenLB code, and run the illustrations themselves, at their own pace.
5.Needs Analysis
The current shift from sequential to multicore and manycore processors presents seriouschallenges to software developers. A significant part of the industrial andresearch communities continues to believe that either a) they can make do with incremental approaches, or b) theright compiler, parallel language and so forth will save them. Such ad hoc responsesare likely to prove neither correct nor sustainable. To systematically findand exploit parallelism, and to achieve forward scalability that is,designs which efficiently scale to much larger numbers of cores -- willrequire re-architecting software applications.
The key to re-architecting software is the use of design patterns and a pattern language. We divide these into Structural (akaarchitectural styles) Computational (originally presented in the View from Berkeley as thirteen dwarfs)and Concurrent (originally presented in the book, Patterns for Parallel Programming). More information, with links to updates, is available here.
This implementation study looks at a specific use of the proposed pattern language to illustrate concurrency design choices made in the OpenLB project.
6.Subject Matter Experts (SMEs):
Prof Jonas Latt (Ecole Polytechnique, Lausanne), Michael Wrinn
7.Learner Analysis
The ideal student for this module is an adult learner at a university, who in addition to exhibiting the learning characteristics of adult learners as described in ACM documentation. In particular:
- Has some software design experience, using any standard programming language (e.g. Java, .NET, C, C++).
- Has the ability to learn from lecture/discussion environment only.
- Has an ability to generalize from examples.
- Demonstrates a willingness to tackle a difficult concept and deal with complexity.
- May or may not have an understanding of the issues of parallel programming and are at least familiar with one concurrent programming method; this implies an advanced student, typically in the 3rd or 4th year of an undergraduate program.
- Currently instruct or plan to instruct adult students who fit in the learner description earlier in this section.
- Currently using a successful programming curriculum, or intend to soon create or teach one.
8.Context Analysis
The purpose of a Context Analysis is to identify and describe the environmental factors that inform the design of this module. Environmental factors include:
- Media Selection: lecture presentation will in Microsoft* Power Point* format including speaker notes and references to more detailed content. The lab itself is a self-directed; the source code and basic documentation will be downloaded from the OpenLB project site at www.openlb.org. We will provide supplemental documentation explaining the steps to build and run the code successfully with the Intel compiler, and for controlling the parallel execution levels.
- Learning Activities: Lecture-only presentation; discussion of similarities and differences between models presented is encouraged between students and between students and instructor.
- Participant Materials and Instructor/Leader Guides: Instructor notes are included in Power Point Notes sections. Recorded presentation and lecture notes for the slides, narrated by course author, will be made available to external academics through the Intel Academic Community website.
- Transcript of expert delivery (audio recording)
- Packaging and production of training materials: Materials are posted to Intel Academic Community website, for worldwide use and alteration
- Training Schedule: The module is 2.5 to 3 hours of lecture.
- ACM curriculum positioning: anticipated to be senior undergraduate level (analysis ongoing, as this is new research).
9.Task Analysis
The primary Bodies of Knowledge (BKs) include, but are not limited to:
- Shaw & Garlan, Software Architecture: Perspectives on an Emerging Discipline, Prentice Hall 1996
- Mattson et al, Patterns for Parallel Programming, Addison Wesley 2004
- The Landscape of Parallel Computing Research: a View From Berkeley
- Design Patterns (several books, especially Gamma et al, Addison Wesley, 1995)
- ACM Computing Curricula 2001
- Partially defined by the Software Engineering Body of Knowledge (SWEBOK): http://www.swebok.org
10. Concept Analysis
Software Design Patterns as a means to approach concurrency.
11. Learning Objectives
Given concepts and the examples (currently 6) from the module, students will be able to describe and recognize instances of:
The structured grid Computational Patterns
The decomposition Concurrency patterns (3 levels of detail)
as defined by the UC Berkeley / Intel research effort.
12. Criterion Items
Q: What are the key aspects the pattern Structured Grids, and how are they used in the OpenLB programs?.
Q: What are the criteria for selecting one or another Concurrency pattern?
Q. Are loop-parallel and SPMD implementation choices interchangeable? Does either have a strong dependency on the underlying platform architecture?.
13. Expert Appraisal
This Content Design Document will be posted to the Intel Academic Community forum with an invitation to solicit comments from readers of the forum. Additionally, new focused SME review from outside the company will be solicited and used. The planned Academic Community Advisory Council will get a look at this in Dec.
14. Developmental Testing
Planned beta material will be posted to the ISC WIKI will in December 2008.
15. Production
Upon completion and successful passing of the Product Readiness Approval in the PDT, the materials produced for this module will be posted to the Intel Academic Community (IAC) website. There they will be available for download by IAC registered participants. This short, introductory module will be taught as appropriate (by SMEs as well as CAT)


text:
SYRACUSE, N.Y. — C.J. Fair had 18 points and 10 rebounds, freshman Jerami Grant scored a season-high 14 points, and No. 9 Syracuse beat No. 25 Notre Dame 63-47 on Monday to snap a two-game losing streak that had dropped the Orange three spots in the rankings.
Syracuse (19-3, 7-2 Big East) was coming off consecutive road losses against Villanova and Pittsburgh and has only three conference losses in its last 32 Big East games. The Orange have now won a school-record 36 consecutive games at home, the longest active streak in Division I. Notre Dame (18-5, 6-4) had won three in row.
In Pittsburgh, Lamar Patterson scored 11 points and Pittsburgh pulled away late for a win over Seton Hall.
Freshman center Steven Adams added eight points, 15 rebounds and two blocks for the Panthers (19-5, 7-4 Big East), who won for the sixth time in their past seven games.
AP POLL: For the fifth consecutive week there is a new No. 1 in The Associated Press' college basketball poll. This time it's Indiana.
The Hoosiers, the preseason No. 1 who held the top spot for the first five weeks of the regular season, moved up two spots Monday, following their weekend win over No. 1 Michigan and No. 2 Kansas' loss to Oklahoma State.
Duke started the current streak of new No. 1s and was followed by Louisville, Duke again, Michigan and Indiana.
NORTH CAROLINA STATE: Coach Mark Gottfried says he doesn't know if point guard Lorenzo Brown will be ready for Thursday's trip to No. 4 Duke.
Brown sprained his left ankle during last week's loss at Virginia, then sat out of Saturday's home loss to Miami.
NORTH CAROLINA: Coach Roy Williams says P.J. Hairston is doubtful for tonight's game against Wake Forest.
The sophomore suffered a concussion last week at Boston College and missed Saturday's overtime win against Virginia Tech.


text:
BEST WESTERN Coastal Waters Motor Inn3
635 Esplanade, Lakes Entrance, VIC 3909
Price FromView Rooms
This hotel doesn't have any reviews yet.
About the hotel
Stay at this picturesque Lakes Entrance motel situated on landscaped gardens and located opposite the foreshore and close to Ocean Beach. The Lakes Entrance town center, shops and restaurants are only a short stroll away. The BEST WESTERN Coastal Waters Motor Inn is the most superbly-appointed accommodation in Lakes Entrance with luxurious ground floor rooms and spa suites.
In-room amenities at this Lakes Entrance motel include wireless broadband access and Austar cable TV. Relax by the solar heated pool set in tropical gardens and enjoy the private BBQ area. Scenic lake walks, wineries and golf clubs are all located nearby. It is also an easy 50km to the famous Buchan Caves. For outstanding customer service and an ideal location in Lakes Entrance, make a reservation at BEST WESTERN Coastal Waters Motor Inn today!
Read MoreLess
We currently have no rooms available for this hotel that match what you're looking for. Try changing your search, selecting an alternative hotel, or give us a call on 0333 0146275 where we'll be happy to help.
Facilities Show/hide
- Leisure
- Outdoor Pool
- Main
- Safety Deposit Box
Useful Info Show/hide
- From 14:00 hours
- By 10:00 hours
- Up to 0 years old
- The price shown is based on the occupancy and dates you have searched for. Prices and availability are subject to change based on the arrival date, number of nights and occupancy searched for. All prices are inclusive of all local taxes.
- Pets are not allowed
Customer Reviews
Our reviews are from genuine LateRooms.com customers. We verify that the customer has stayed before leaving a review.
No reviews yet


text:
Nutrition Plan + 1 on 1 Dietitian Support
Nutrition Plan + 1 on 1 Dietitian Support
Within 24 hours after purchase we will contact you to pair you with one of our dietitians. There is a 16 week minimum commitment for this program. Your billing will begin THIS coming Monday after purchase. However, you will be granted access to our full member area to view the member resources within 1 day of purchase. All billing pauses, stops, and restarts should be discussed with your nutritionist, and madeby youvia your "My Account" area on the Core Diet website. There are no refunds for billings once they are made.
This package includes:
- One-on-one call with your dietitian to learn coach Jesse's ground breaking and proven Core Diet for athletes. Face to face meetings available; please inquire!
- Nutrition plan developed and signed off by your registered dietitian. Your initial plan and consultation is identical to that of our Nutrition Plan service. ($275 value)
- Contact with your dietitian by phone on an as needed basis including two scheduled 30 minute calls each month. Your own personal dietitian!
- Unlimited daily contact with your dietitian via email on an as needed basis.
- Access to our member area on the Core Diet website including tips, nutrition calculators, interactive Core Diet recipe database, ALL previously recorded webinars, and other Core Diet documents!
- FREE access to all live Core Diet webinars which include a 30-40 minute presentation, and then a 10-20 minute Q&A session where any participant may ask our RDs questions related to the webinar topic.
- Can include several example daily menus each month based on your specific needs, and workouts that month. You decide which days you would like menus for ahead of time!
- Body fat and optimal body weight goals will be determined for what is best for performance. Refinement of these goals throughout the season including periodic body fat check-ups.
- Race fueling analysis and written plan for triathlons, running races and more. This package includes what to eat the morning of your race and race week. ($215 value)
- Bloodwork analysisincluded and performed in the 3rd or 4th month of this program. ($215 value)
- Access to our forum, including full access to our general discussion forum to discuss nutrition related topics with other athletes and our RD's on a daily basis!
- 10% discount on the popular QT2 Systems Mission Plan training service.
Daily Meal Plan Add-on:
- PDF delivery of daily menus each week including exactly what you should each each day.
- Menus incorporate workouts, workout fuels, training stress impact on caloric expenditure, and body composition goals.
- Each daily menu includes the food items you should eat, the times you should eat them, and the macronutriant profiles for each food item with totals for the day.


text:
|Publication number
|Publication type
|Application number
|Publication date
|23 Aug 2011
|Filing date
|23 Sep 2005
|Priority date
|23 Sep 2005
|Fee status
|Also published as
|Publication number
|Alan Hamor
|Original Assignee
|Alan Hamor
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (67), Non-Patent Citations (14), Referenced by (8), Classifications (10), Legal Events (5)
|External Links: USPTO, USPTO Assignment, Espacenet
The invention relates generally to commercial transactions, and more particularly to bidding systems.
In today's world, there are numerous products and services available for purchase. There are also more choices than ever on how to purchase the products and services. For example a buyer can purchase items in a store or on the Internet, conventionally or through an auction process, using cash or other forms of payment, etc.
Sellers use various techniques to motivate buyers to make purchases. For example, sellers provide discount coupons, mark down prices during a sale, sponsor various inventory liquidation events and/or allow customers to bid on items in an auction. Many of these sales techniques encourage buyers to 'hold out' for anticipated low pricing, causing not only an erosion of profit margins for the seller, but also an increase in the inventory holding costs to a seller.
Sellers have embraced dynamic pricing, for example in the form of auctions, as a way to increased levels of interest from customers while maintaining desirable profit margins. Various types of auctions are known. The most common type of auction is an English auction where the bidder who places the highest bid over the reserve price, a price set by the seller, wins the item at the end of the bidding period. In a variation of the English auction known as a quick win auction, the auction ends when the bid reaches a predetermined threshold set by the seller. In a turbo auction, also a variation of the English auction, a starting price is specified, no reserve price is allowed and the highest bidder wins.
In a Dutch auction, the auctioneer begins with a high asking price which is lowered in increments. The price lowering continues until a bidder is willing to pay the asking price or a predetermined minimum price is reached. If multiple items are being sold, as successful bidders reserve their quantities to be purchased, the auctioneer continues lowering the asking price until all items are sold. In a uniform or second price auction (sometimes also called a Dutch auction) an item is awarded to the highest bidder at a price equal to the second highest bid. In a variation of the uniform price auction for multiple identical items (also sometimes called a Dutch or multiple auction), bidders specify their bids and how many of the available items they would like to purchase. At the end of the bidding period all winning bidders pay the lowest winning bid per item. In a variation of the uniform price auction for multiple identical items, known as a Yankee auction, at the end of the bidding period all winning bidders pay their exact winning bid.
In a fixed price auction, a bidder who first bids the fixed price wins. In a variation of a fixed price auction, known as an auto markdown auction, the fixed price drops over time. In a Chinese auction, typically employed in a charity event with donated items, each bidder bids the same amount on an item, typically using a pre-printed ticket, and the winner is selected by lottery. The charity selects the winning bid from a pool of bids for the item. In a silent or sealed bid auction, all bids are secret and the highest bidder wins. In a procurement auction, a buyer puts out a request for proposal RFQ, providers offer progressively lower prices and at the end of the auction the lowest bid wins.
Despite their variety and their common acceptance and usage, auctions pose many problems for both buyers and sellers. In many types of auctions, the seller loses control of the final price of the auctioned item, which is determined by the bidder and auction process. Many types of auctions are competitive; forcing winning bidders to successfully compete against other bidders in a sometimes uncomfortable and expensive process. In many types of auctions, there is a waiting period between the time a bidder bids for an item and the time the bidder knows if his bid is successful, leaving the bidder in uncertainty. These characteristics often make existing auctions less than desirable for buyers and sellers of items.
The present invention provides methods and systems which overcome many of the drawbacks and disadvantages of existing auctions, while providing many of the benefits and motivations of the auction format.
In accordance with an embodiment of the present invention, there are provided methods and systems to process bids, an exemplary method comprising: identifying for sale an item having a floor price; displaying, using the computer, the item for bidding by at least one bidder; suppressing, during the displaying, the floor price such that the floor price is not available to the at least one bidder; limiting the at least one bidder to a predetermined number of bids on the item; receiving from the at least one bidder at least one bid on the item, the bid within the predetermined number of bids, the bid including a bid price; comparing on the computer the bid price to the floor price; and if the bid price for the item is at least equal to the floor price, then substantially immediately notifying the at least one bidder of the success of the at least one bid.
In accordance with another embodiment of the present invention, there are provided methods and systems to bid on an item, an exemplary method comprising: displaying, using the computer, an item for bidding, the item having a suppressed floor price not available for viewing; receiving an opportunity to place up to a predetermined number of bids for the item; submitting at least one bid on the item, the bid within the predetermined number of bids, the bid including a bid price; and receiving, if the bid price for the item is at least equal to the floor price, a substantially immediate notice of the success of the bid.
In accordance with yet another embodiment of the present invention, there are provided methods and systems to sell an item, an exemplary method comprising: identifying for sale an item; identifying a floor price for the item; authorizing, using the computer, the item for display for bidding by at least one bidder with the floor price of the item suppressed by the computer to the at least one bidder; authorizing the receipt of a predetermined number of bids on the item by the at least one bidder; and authorizing, if a bid is received from the at least one bidder within the predetermined number of bids and including a bid price at least equal to the floor price, the substantially immediate transmission of a success indicator to the at least one bidder.
These and other objects, features and advantages of the present invention will be apparent from a consideration of the following Detailed Description of the Invention when considered with the drawing Figures, in which:
Provided herein are new and improved bidding methods and systems that guarantee sellers receipt of at least a desired price while providing buyers with the motivation of naming their own bid price along with the instant gratification of knowing whether or not they have tendered an accepted bid. The invention is flexible as to the type of products and services that can be offered for bid, and can be implemented in a variety of different commerce scenarios, including, but not limited to: on a website where it facilitates commerce, on a website where it is the commerce, on websites offering product searches and listings, in a peer-to-peer network environment, through online advertisements and in an actual physical retail environment. Buyers using the present invention, also referred to as users or bidders, receive instant feedback as to whether their bids have been accepted and what quantities of goods they have purchased. New and innovative pricing mechanisms enable sellers to optionally offer and buyers to receive favorable pricing, often below the actual, accepted bid price.
It will be appreciated by the reader from a consideration of the following description of the invention that, in contrast to an auction, the present invention is better described as a bidding system. Generally, with respect to an auction, the function of the auction is to drive up of the price of the bids for items, maximizing the amount received by the seller. In contrast, with respect to the bidding system of the present invention, the function of the system is to encourage buyers to buy items within price ranges preset and acceptable to sellers. Thus, the bidding system of the present invention functions to encourage buyers to buy goods in a manner motivational to the buyer while meeting the pricing requirements of the seller.
As used herein, the phrases "for example," "such as" and variants thereof describing illustrative implementations of the present invention are exemplary in nature and not limiting.
In the description below, the term "item" and variants thereof as used to describe products and services transacted using the present invention include any tangible or intangible object of value. For example, items sold or purchased with the present invention can include: a product, a service, a warranty, a naturally occurring object, an animal, a financial instrument, a right to purchase an object under defined circumstances, a right to sell an object under defined circumstances, and others as will now be apparent to the reader. Depending on the embodiment, the condition of the item can be any condition, for example new, used or refurbished. For ease of description the singular form of item is used below to connote one item or a plurality of items which can be bid upon as one unit, as appropriate.
In the description below the meaning of the term "price range" and variants thereof as used to describe the price of items include: one price only, a plurality of prices and ranges of prices. "Sellers" and variants thereof refer to parties selling items using the present invention, while "buyers," "bidders," and variants thereof refer to parties placing bids to buy items using the present invention.
With reference now to
With reference now to
A seller 220, a fulfillment house 222 and a payment processor 224 are connected to communicate with bid processor 250. As described in detail herein, seller 220 comprises a party(s) placing items for bid in accordance with the present invention. Fulfillment house 222 comprises a conventional service for providing goods or services to purchasers, while payment processor 224 comprises a conventional credit card, bank, debit card or other payment account processor.
Bid processor 250 may comprise any combination of conventional components, for example an Intel� microprocessor operating a conventional operating system with appropriate software to perform the functions described herein. Bid processing engine 256 may comprise a separate processor from processor 254, functionality provided by the processor 254 itself, or a combination of both. Tools 252 may be contained in database 258 and operated by processor 254 and/or bid processing engine 256. While, for purposes of description, bid processor 250 has been shown as a simple, consolidated system, it will be apparent to the reader that the invention is not thus limited. Bid processor 250 can be located in any appropriate location and can be operated by any entity. Bid processor 250 may, in a manner well known in the art, comprise a decentralized system utilizing interconnected components from a variety of geographically disparate locations. Exemplary configurations of bid processor 250 are described below.
While, for purposes of illustration, only a single one each of bidder system 202, seller 220, fulfillment house 222 and payment processor 224 are shown, it will be understood that any number of such parties, the functions of which are described below, may be included in system 200.
Each bidder system 202 is shown to include a bidder interface 210 and a bidder processor 204. In different embodiments, a bidder system 202 may be personal to an individual bidder, or a group of inter-related bidders, or may be shared by unrelated bidders. Examples of a personal bidder system 202 include inter-alia: a programmable cellular phone, telephone, fax machine, computer, television, and personal digital assistant, which is owned by or typically used by a particular individual or a limited group of individuals. Alternatively, each bidder system 202 may be shared by unrelated individuals. Examples of a shareable bidder system 202 includes inter-alia: a programmable cellular phone, telephone, fax machine, computer, television, and personal digital assistant, which is set up in a store or in another public location where it is available for use by multiple, typically unrelated individuals. Another example of a shareable bidder system 202 includes a visible programmable tag attached to or which promotes an item available for bids. Examples of such visible, programmable tags include portable digital devices, LCD tags, etc.
It will be understood by the reader that, in the various embodiments of the bidder systems 202 described above, the various bidder interfaces 210 and processors 204 comprise the user interfaces and processors contained in the described devices, respectively. It will further be understood that, while a single bidder system 202 has been shown and described, any number of bidder systems may be included in system 200.
Facilitating tools 252 can vary depending on the embodiment and can be made up of any combination of software, hardware and/or firmware that performs the functions as defined and explained herein. In one embodiment tools 252 include any of the following inter-alia: tools to help a bidder search for an appropriate item on which to bid (for example by asking evaluation questions to a bidder), tools to suggest an appropriate item for a bidder to bid on, tools to allow bidders to form bidding teams, tools to provide information to team members and others about an item available for bidding, tools to allow a bidder to rate an item, a bid initiator, the bidding process, etc, and tools to provide messages to bidders. More details on facilitating tools 252 are provided herein below. Facilitating tools 252 can similarly provide tools for sellers to use, the details of which are described herein below.
Communication interface 212 can provide any single communication channel or combination of communication channels appropriate for the various parties to communicate with each other and with processor 250. Communication interface 212 can thus comprise, for example: the Internet, a different public network, a private network, a telephone network, a peer-to-peer software network, various types of wireless networks, combinations thereof and others as will now be apparent to the reader.
With reference back to
As determined by the seller to meet the needs of the seller and to motivate buyers, the bidding opportunity that is presented to the bidder includes some amount of information about the item, the seller, the bidding process, etc. For example, the presented bid opportunity may include one or more of the following, inter-alia: the identity of the seller, the name of the item, the quantity of the item available for bidding, whether the item is grouped with other similar items for the bidding, any limit on how many bids may be taken by the bidder and how many by the bidding team, the condition of the item (e.g. new, used, refurbished), the allowed locale of the bidder (e.g. local, regional, national or international relative to the location of the item), the suggested retail price for the item, a buy it now price (i.e. a price in which the item can be bought or sold without bidding), ratings on the seller, ratings about the item, any constraints on bidding amounts (for example minimum or maximum allowable bidding amounts, a plurality of predetermined amounts one of which must be selected as the bidding amount, etc), and the associated success rule (i.e. what relationship the bidding amount bid by a bidder has to have with a predetermined price range in order to be successful). However, in accordance with another feature of the invention, in all embodiments, the bidding opportunity is presented without presenting the predetermined price range for the item, where a bid will be successful if the relationship between the amount bid and the predetermined price range conforms to a predetermined associated success rule.
It will be understood by the reader that the "buy it now" price is separate and distinct from a predetermined, successful bid amount or range. More particularly, the "buy it now" price represents a fixed amount at which an item may be purchased. It need have no particular relationship to the bid amount or bid range at or within which the item may be purchased by bidding. It will thus be understood that the display of a "buy it now" purchase price is not inconsistent with the feature of the invention that the successful bid price or range is suppressed and not made available to buyers.
As the reader is aware, it is difficult to keep information secret, and the security surrounding the predetermined price of the item may vary depending on individual situations. In some cases, bidders may be able to acquire knowledge of the predetermined price range, for example from previous bidders, from an over-eager seller of the item, etc. Therefore, while it is a feature of the invention that the price range is not presented (i.e. disclosed) to the bidder as part of the bidding process, there is no limitation on whether the bidder may obtain knowledge of the price range through means other than presentation through the bidding process described herein.
In the described embodiment, the bidding opportunity is provided in stage 102 to the bidder through a bidder system 202. For example in one embodiment, bidder interface 210 includes a web browser and when the operator of the web browser accesses a web site with bidding engine bidder interface 210, the item and related bid information is received through network 212 and displayed on the interface by bidder processor 204. As another example, bidder interface 210 can comprise an electronic tag attached to the item, and when there is an opportunity to bid on the item, the bid processor and interface in the electronic tag signal to indicate that bidding is allowed on the item, for example through a visual or audio cue. As another example, bidder interface 210 includes an email server, receiving e-mail information from bid processing engine 256 through network 212 for display by bidder processor 204 on bidder interface 210. As yet another example, the bidder can learn about the bidding opportunity through an advertisement, for example on TV, on radio, on a billboard, on the World Wide Web or in a mailing, via telephone, via instant messaging, emailing or other form of communication.
In some embodiments facilitating tools 252 may have been used prior to or subsequent to the bidder being presented with the opportunity to bid in stage 102. For example, the bidder may use facilitating tools 252 to search for suitable items up for bidding. The bidder may use facilitating tools 252 to find out more information on the item in order to decide whether and how much to bid. The bid processor 250 may use facilitating tools 252 to tailor the bid opportunity to the bidder. As another example, the bidder may have received a message through facilitating tools 252 from another bidder about the bidding. The bidder may use facilitating tools 252 to generate or access bidding information about bids placed by other members of a bidding team to which the bidder belongs or to provide members with bidding strategies or actual bids to be made. Many different types of facilitating tools will now be apparent which facilitate the initiation of the bidding process by a bidder.
In stage 104, a bid on the item is received and evaluated. The bid includes inter-alia the bidding amount as bid by the potential buyer and optionally the desired quantity of items. As noted above, there may be variation or constraint in the number of units of an item on which a bidder can bid out of the total quantity of that item available for bidding. For example in one embodiment, a bidder can only bid on a limited number of units of an item whereas in another embodiment a bidder can bid on as many units of the item as the bidder desires up to the total quantity available for bidding. In one embodiment, the quantity of units of an item available for bidding must derive from one bidder, whereas in another embodiment the quantity of available units of an item can derive from one or more bidders (for example belonging to a bid initiator group).
In the described embodiment bidders submit bids through bidder system 202. The bid is received by bidder processor 204 and transmitted to bid processing engine 256 through communications link 212. Depending on the rules for the particular item up for bid, a bidder can bid any amount desired, choose from a selection of possible bidding amounts, or otherwise determine how much to bid in accordance with the rules for the particular item.
Once the bid is received, the bid is analyzed by bid processing engine 256. In one embodiment, there is a predetermined price range and a success rule associated with the item. For example, there may be a specified floor price per item and if the bidding amount per item is above the floor price per item, the bid is successful. As another example, there may be a specified floor span or range for an acceptable bid per item, and if the bidding amount per item is within the bounds of the range, the bid is successful. As another example, there may be a specified ceiling price per item and if the bidding amount per item is below the ceiling price per item, the bid is successful. Numerous pricing schemes and rules for successful bidding will now be apparent to the reader.
As noted above, in the described embodiment, bidders are limited to a single bid on an item (or group of items) so as to prevent 'trolling' to determine the lowest acceptable price. The bidder and/or bidder system 202 can be identified through any suitable method including inter-alia: cookies, email addresses, IP addresses, name, phone number, mailing address, credit card number, etc. It should be evident that the more unique the identifier used to check the identity of the bidder, the more likely to prevent bids by the same bidder over the allowed number of times. For example if identity is established through email addresses, a bidder who has more than one email address could potentially bid the allowed number of times more than once, using different email addresses.
In another embodiment, the bidder could theoretically bid as many times as desired, presumably within rules established for such bidding. For example, the bidder may have the right to bid two times and, if still unsuccessful, obtain supporting bids from bidding team members, who may have the right to bid one or more times on that item until either a successful bid has been made or all bidding rights have been exhausted. In yet another embodiment, team bidding may not be allowed and so the bidder may have the right to bid three times on an item and if unsuccessful, may have to bid the "Buy It Now" price in order to purchase that item. In any embodiment, either the bidder or the seller may decide what are the bidding rules for a specific item.
It is a feature and advantage of the invention that the success of a bid for an item is independent of the bidding amounts of other bidders for that item. That is, the success rules for a bid on an item are predetermined by the seller and do not change based upon the bids of others. Therefore whether a bid is successful can be determined once a bid has been made and independently of other bids. Continuing with reference still to stage 104 of
In some instances, a bidder may be required to purchase the item once the bid has been accepted. In another instance, the bidder receives the option to purchase the item once the bid has been accepted and the bidder can decline or ignore the option. In yet another instance, the bidder may have the right to transfer or even sell the right to purchase the successfully bid item to a third party. For ease of explanation it is assumed below that the bidder is required to purchase the item once the bid has been accepted.
The success indicator can include any indication that the bidder has submitted a successful bid and has the right to complete a transaction to procure possession of the item. For example, the success indicator can include a success code, i.e. e-commerce promotion code, which can be used by the bidder to purchase the item. As another example the success indicator can include a voucher or coupon, which can be used by the bidder to purchase the item, for example in a store or on the Internet. As another example, the success indicator can include a contract stating that the bid initiator agrees to sell the item to the bidder. As another example, if the bidder had previously provided account information, the success indicator can include a notice of payment charged to the account (credit received). As yet another example, the success indicator can include shipping/tracking information for receiving (sending) the item or a receipt for picking-up (having picked up) the item which was purchased (sold). In yet another example, the success indicator may include future purchase or sale rights for the specified item or other items in a peer-to-peer environment.
The success indicator may have intrinsic value and be transferable to others by the bidder. In another embodiment the success indicator is non-transferable.
In one embodiment, the success indicator indicates an extra reward if the bidding amount meets a predetermined price or price range. For example, if the predetermined price range is a floor price or ceiling price there could be an extra reward for a bid equal to the floor price or ceiling price. The extra reward can be one or more items related to or unrelated to the item bid upon. For example the reward can be a product related to the bid upon item, service for the bid upon item, a warranty for the bid upon item, and/or a gift unrelated to the bid upon item.
Continuing with reference to
As shown in stage 108, the price paid by the bidder may differ from the successful bid price and must be determined. In one embodiment, the bidder pays the amount successfully bid for the item. In another embodiment, if a quantity greater than one unit of an item is available for bidding and the predetermined price is a range, each successful bidder pays the amount they have bid. In another embodiment, if a quantity greater than one unit of an item is available for bidding and the predetermined price is a range, each successful bidder pays the lowest successful bidding amount out of a plurality of successful bids placed for the item. In other words, in this latter embodiment, the price the bidder pays or receives is the bidding amount of the successful bid which is closest to the predetermined price floor. In this latter embodiment, the bidder may receive a success indicator which does not state the final price or the bidder may receive a success indicator with a temporary price and then when the final price is determined the bidder receives a credit or charge for the difference.
In some embodiments, bidders can use facilitating tools 252 to register and take advantage of bidding groups. For example, each bidding group member may have a home page with activity reports, messaging capability and other functions relating to creating and coordinating bidding teams. In this embodiment, members can communicate with each other regarding the bids, and bid processing engine 256 may transmit messages to members relating to the bidding activity of members of the group. In another group embodiment, any communication device or methodology including inter-alia email, instant message, system messaging, and cell phone text messaging can be used by bid processing engine 256 to communicate with team members, or by team members to communicate with each other. For example, if one member of a bidding group is successful, other members may decide to bid on an item using the same bidding amount used by the successful member or the other members may try to adapt the price in order to get closer to a lower price still within the success price range. As another example, if one member of a bidding group is unsuccessful, other members may know not to use the same bidding amount when bidding on the item.
In some embodiments, there may be more than one (not necessarily identical) item grouped together for bidding purposes. The group of items may derive from one or more sellers. There may be multiple price ranges associated with the group of items. Depending on the amount bid by a bidder, the bid may be successful for one or more of the items in the group, based on the associated rules for the predetermined price range for the items. For example, assume there are 5 Honda Civics which three car dealers are making available for bidding. Assume a black Civic from dealer 1 has the highest associated price range (in this case a floor of $14,000), two white Civics from dealer 1 and dealer 2 have the next highest price range (in this case a floor of $12,000), and two red Civics from dealers 2 and 3 have the lowest price range (in this case a floor of $11,000). Assume a bidding amount placed by a bidder of $12,500. In this case a white Civic or a red Civic can be bought by the bidder but not the black Civic. Depending on the rules for that bidding instance, the bidder may choose which of the qualifying items the bidder desires at any appropriate stage of the bidding process. Assume for simplicity of explanation that the bidder specifies a desired quantity of one unit in the bid. In one embodiment, the bidder can arrange the preferred order of grouped items (e.g. black, white, red) and submit the order with the bid in stage 104, and the success code returned in stage 106 would include the most preferred item for which the bid was successful (in this example white). As another example the bidder can be informed in stage 106 for which of the grouped items the bid was successful (white, red), and the bidder can choose one of the grouped items for which the bid was successful. As another example, the bidder in stage 110 (described below) can select one of the items for which the bid was successful as part of the transaction fulfillment stage. In embodiments where items are grouped together for bidding purposes, bid processing engine 256 may update the total number of units of all grouped items remaining after a successful bid.
Stage 110 of method 100 illustrates the execution of a transaction whereby a winning bidder(s) receives the goods or services successfully bid for. This stage 110 may be executed in one or more of many different embodiments as are described in detail below.
As mentioned above, bid processor 250 can be located in any appropriate location and operated by any appropriate operator.
The present invention may be operated in many different configurations as between the various parties. For example, in one embodiment, the bid processor 250 is operated by a centralized manager separate from sellers, typically an application service provider (ASP). In a second embodiment, the bid processor is operated by a seller, for example an online or store-front retailer or service provider. In yet another embodiment, the bid processor is operated by a centralized manager of a peer-to-peer networking environment or, in another variation, by the peers themselves. The reader will understand that, as used herein, peer-to-peer means in the conventional sense the sharing of files and information between users as enabled by an appropriate file sharing program such as Napster� or Gnutella�.
In this peer-to-peer configuration, the invention may be used by one or more peers (manufacturers, resellers, retailers, individuals or other entities) to buy and sell goods and services from one another. Thus, an individual bidder (1) might purchase an item from Sears, for example, and then sell it to a local hardware store, which, in turn, sells it to another individual bidder (2). The invention allows for the bidding and actual purchase to take place in the peer-to-peer network, while delivery of the goods might be made by Sears, in this example, directly to the individual bidder (2).
Facilitating tools 252 may include other tools which variously assist in the interaction between sellers, buyers and bid processor 250.
For example such facilitating tools may include one or more of the following functions inter-alia: tools to enable a seller to input data on an item up for bidding, tools to enable a seller to input data relating to the bidding process, tools to enable buyers to form buying groups or teams, tools to enable sellers and/or buyers to group items for bidding, tools to enable sellers to rate the bidders, tools to enable buyers to rate items and/or bidding processes, tools for facilitating message exchanges between buyers and sellers, tools to enable both buyers and sellers to analyze past bid processes, and a royalty calculation tool.
Other useful facilitating tools supported by 252 may enable bidders to register and take advantage of the buyer groups described above. For example, each buying group member may have a home page with activity reports, messaging capability and other functions relating to creating and coordinating one or more buying groups. In this embodiment, buyers can communicate with each other regarding the bids, and bid processing engine 256 may communicate messages amongst buyers relating to activity involving members of one or more buyer groups. It will be appreciated that any communication device or methodology including inter-alia telephone, email, instant message, system messaging, and cell phone text messaging can be used by bid processing engine 256 to communicate with buyer and/or seller group members, or enable group members to communicate with each other.
Examples of tools facilitating analysis of past bid processes include, inter-alia, tools for: viewing past bids for a comparable item to determine if the price range for future similar items should be adjusted, viewing location information of past bidders to determine if item listing or advertising information should be adjusted accordingly, and viewing profiles of past bidders to determine if items became available in their target market.
The data used to formulate a bid opportunity which is presented in stage 102 to a bidder, can originate from the seller, from the operator of bid processor 250, or if the two are different parties as a result of a consensus between both.
Facilitating tools may be used to automatically process, limit or alter seller's introduction of item information into bid processor 250, for example: limiting item listings from sellers with past bad histories or negative ratings, limiting item listings based upon known or anticipated buyer demographics, and others as will be apparent to the reader.
In other embodiments, facilitating tools 252 may include search capabilities that enable bidders to search for items. Other tools may enable automatic generation of bid opportunities for suitable items, for example pursuant to an ongoing agreement between the operator of system 200 and a buyer.
In one embodiment the price range for the items which can be bid on is input by the seller. In another embodiment, the operator of bid processor 250, if different than the seller, may select a price range or may reach a consensus with the seller on an appropriate price range.
In one embodiment, the bid initiator can input the quantity of units of each item which is available for bidding and/or any staggering schedule for how the quantity of items will be made available for bidding. For example, a staggering schedule could allow for a fixed number of units to be up for bidding each month out of the total quantity available. In another embodiment the seller indicates the total quantity of units of the items which the seller wishes to sell, and in some cases the operator of bid processor 250 may determine the number of units to be put up for bidding out of the total quantity which the seller wishes to sell or buy, and/or any staggering schedule. In yet another embodiment, the operator of bid processor 250 may with the seller reach a consensus on the number of units up for bidding and any staggering schedule.
In one embodiment, the seller can also indicate if any (not necessarily identical) items should be combined in a bid opportunity with other item(s) from the same seller or from one or more different sellers. In yet another embodiment, the operator of bid processor 250 may decide or may reach a consensus with one or more sellers on whether to combine items in a bid opportunity.
With reference again back to
Transaction fulfillment can include any of the following actions inter-alia: determining a bidder account to charge or credit, determining necessary financing, determining the location of the bidder for example for shipment or pick up, and determining a preferred shipment or pickup method of the bidder. Payment collection may be performed in different embodiments by: the operator of bid processor 250, the seller, a designated third-party payment processor 224, or others as will now be apparent to the reader.
In stage 112, if the quantity of units of the item up for auction has not been depleted by successful bidders, or the quantity of (not necessarily identical) items grouped together for bidding purposes has not yet been depleted the auction continues for other bidders. In some embodiments, the auction can be ended prior to the depletion of the quantity. Depending on the embodiment, the auction can be interrupted, for example, by the seller, the operator of bid processor 250, and/or by a third party operating transaction fulfillment system 222.
There has thus been provided new and improved bidding processes and systems, which includes many of the benefits of both an auction and a traditional retail environment. Like an auction, the invention motivates buyers to purchase items by allowing them to determine and place bids on items, providing them the excitement and satisfaction of a bidding process. Like a more traditional retail sale, the invention provides instant gratification, informing the buyer immediately as to whether a bid is successful. Further, the retailer will be able to utilize existing systems of logistics, customer service and extended warranty, for example, to deliver the best possible value to the customer. The present invention enables sellers to control the minimum price of an item, insuring they obtain their desired price, without placing buyers in the uncomfortable and less-than-desirable position of having to bid against other buyers. The invention provides many different tools and features for facilitating the bidding process, including multiple item sales and buyer group support. The invention further enables new and innovative pricing mechanisms, enabling a buyer to know instantly if they have tendered a successful bid, while still providing a lower price at a later time. The invention has application in the field of commerce and particularly in the field of sales.
While the invention has been shown and described with respect to particular embodiments, it is not thus limited. Numerous modifications, changes and improvements within the scope of the invention will now occur to the reader.
|Cited Patent
|Filing date
|Publication date
|30 Jan 1987
|6 Dec 1988
|Flex Japan Inc.
|Auction information transmission processing
|7 Mar 1989
|29 Jan 1991
|Carfax, Inc.
|Method and system for identifying and displaying discrepancies in vehicle titles
|26 May 1989
|4 Aug 1992
|Reuters Limited
|Anonymous matching system
|16 Feb 1994
|2 Sep 1997
|Honicorp, Inc.
|Computerized, multimedia, network, real time, interactive marketing and transactional system
|4 Sep 1996
|11 Aug 1998
|Walker Asset Management Limited Partnership
|Method and apparatus for a cryptographically assisted commercial network system designed to facilitate buyer-driven conditional purchase offers
|20 Feb 1996
|11 Aug 1998
|Health Hero Network, Inc.
|Method of conducting an on-line auction with bid pooling
|29 Mar 1996
|10 Nov 1998
|Onsale, Inc.
|Method and system for processing and transmitting electronic auction information
|26 Aug 1996
|30 Mar 1999
|Bid.Com International Inc.
|Computer auction system
|3 Jul 1997
|21 Dec 1999
|Adt Automotive, Inc.
|Electronic on-line motor vehicle auction and information system
|1 Jul 1997
|4 Jan 2000
|Barzilai; Nizan
|Computer-based electronic bid, auction and sale system, and a system to teach new/non-registered customers how bidding, auction purchasing works
|4 Jan 1996
|15 Feb 2000
|Ausubel; Lawrence M.
|System and method for an efficient dynamic auction for multiple objects
|12 Nov 1996
|25 Apr 2000
|At&T Corporation
|Secure auction systems
|1 Nov 1993
|29 Aug 2000
|Hartnett; William J.
|Privatization marketplace
|5 Nov 1998
|10 Oct 2000
|The Planning Solutions Group, Inc.
|Method for automatically identifying, matching, and near-matching buyers and sellers in electronic market transactions
|29 May 1998
|12 Dec 2000
|Muniauction, Inc.
|Process and apparatus for conducting auctions over electronic networks
|3 May 1999
|26 Dec 2000
|Health Hero Network, Inc.
|Method for conducting an on-line bidding session with bid pooling
|14 May 1999
|6 Mar 2001
|Freemarkets Online Inc.
|Method and system for bidding in electronic auctions using flexible bidder-determined line-item guidelines
|19 Feb 1999
|13 Mar 2001
|Merc Exchange Llc
|Facilitating internet commerce through internetworked auctions
|14 May 1999
|10 Apr 2001
|Freemarkets, Inc.
|Method and system for controlling the initiation and duration of overtime intervals in electronic auctions
|14 May 1999
|24 Apr 2001
|Freemarkets, Inc.
|Method and system for handling disruptions in the management of electronic auctions
|29 Mar 1996
|5 Jun 2001
|Onsale, Inc.
|Method and system for processing and transmitting electronic auction information
|9 Mar 1999
|24 Jul 2001
|Bid.Com International Inc.
|Computer auction system
|18 Aug 1999
|31 Jul 2001
|Mobshop, Inc.
|On-line marketing system and method
|7 Apr 2000
|2 Apr 2002
|Vanberg & Dewulf
|Data processing system for conducting a modified on-line auction
|14 May 1999
|18 Jun 2002
|Freemarkets, Inc.
|Method and system for maintaining the integrity of electronic auctions using a configurable bid monitoring agent
|13 Apr 1999
|10 Dec 2002
|Daleen Technologies, Inc.
|Billing system for distributing third party messages to form a community of subscribers to negotiate a group purchase from the third party
|14 May 1999
|24 Dec 2002
|Freemarkets, Inc.
|Method and system for controlling bidding in electronic auctions using bidder-specific bid limitations
|4 May 2000
|11 Feb 2003
|Keen.Com, Inc. A Corp. Of Ca.
|System and method for conducting a time auction
|2 Oct 2001
|11 Feb 2003
|Ikimbo, Inc.
|System for creating a community for users with common interests to interact in
|8 Jun 1999
|13 May 2003
|Freemarkets, Inc.
|Method and system for differential index bidding in online auctions
|19 Jun 2001
|20 May 2003
|Cariocas, Inc.
|System and method for enhanced online transactions using shopping games
|13 Apr 2000
|10 Jun 2003
|Thomas Murcko, Jr.
|Method and apparatus for post-transaction pricing system
|8 Jun 1999
|24 Jun 2003
|Ariba, Inc.
|Facilitator for aggregating buyer power in an on-line market system
|30 Dec 1999
|5 Aug 2003
|Vulcan, Inc.
|Demand aggregation through online buying group
|17 Jun 1999
|12 Aug 2003
|Mcj Ventures, Inc.
|Individualized, real-time, interactive e-commerce auction
|19 Jul 1999
|12 Aug 2003
|Amazon.Com, Inc.
|Method and system for providing a discount at an auction
|22 May 2000
|19 Aug 2003
|Dovebid, Inc.
|System and method for providing proxy-based online Dutch auction services
|15 Mar 1999
|7 Oct 2003
|Vulcan Portals, Inc.
|Demand aggregation through online buying groups
|14 Jun 1999
|11 Nov 2003
|John Carlton-Foss
|Method and system for processing and transmitting electronic reverse auction information
|10 Mar 2000
|16 Dec 2003
|International Business Machines Corporation
|Smooth end of auction on the internet
|16 Mar 2000
|30 Dec 2003
|Claude T. Anderson
|Computer-based auction and sale system
|5 Jun 2000
|9 Mar 2004
|Ita Investments, Llc
|Computer controlled event ticket auctioning system
|8 Sep 2000
|9 Mar 2004
|Mindepper, Llc
|Method and system for conducting an online transaction that allows the seller and bidder to negotiate
|12 Oct 1999
|6 Apr 2004
|Market Design Group, Inc.
|Method and system for combinatorial auctions with bid composition restrictions
|22 Jun 1999
|22 Jun 2004
|Walker Digital, Llc
|Purchasing systems and methods wherein a buyer takes possession at a retailer of a product purchased using a communication network
|29 Dec 2000
|2 Nov 2004
|Vert, Inc.
|Apparatuses for displaying information on vehicles
|25 May 2001
|2 Nov 2004
|Nancy J. Rabenold
|Remote bidding supplement for traditional live auctions
|21 Nov 2001
|4 Jan 2005
|Symbol Technologies, Inc.
|Consumer interactive shopping system
|18 Nov 1999
|25 Jan 2005
|Olsale.Com Ltd.
|System and method of conducting on-line auctions
|29 Dec 2000
|1 Feb 2005
|Vert, Inc.
|Apparatuses, methods, and computer programs for displaying information on vehicles
|18 Dec 1998
|1 Feb 2005
|Cantor Fitzgerald, L.P.
|Automated price improvement protocol processor
|21 Oct 1999
|15 Feb 2005
|Mercexchange, Llc
|Generating and navigating streaming dynamic pricing information
|14 Sep 1999
|22 Mar 2005
|Ncr Corporation
|System and method for conducting an electronic auction over an open communications network
|24 Jan 2000
|22 Mar 2005
|Sam E. Kinney, Jr.
|Method and system for partial quantity evaluated rank bidding in online auctions
|19 Jan 2000
|5 Apr 2005
|Opher Goddard
|System and method for facilitating aggregate shopping
|7 Nov 2000
|5 Apr 2005
|Collaborative Decision Platforms, Llc.
|System, method and computer program product for a collaborative decision platform
|13 Sep 2000
|10 May 2005
|Hewlett-Packard Development Company, L.P.
|Auction method and apparatus for electronic commerce
|4 May 2001
|10 May 2005
|International Business Machines Corporation
|System and method for configuring sell bids
|13 Mar 2000
|14 Jun 2005
|Verizon Corporate Services Group Inc.
|Portal switch for electronic commerce
|7 Feb 2001
|14 Jun 2005
|Ita Investments, Llc
|Computer controlled priority right auctioning system
|20 Dec 2001
|19 Jul 2005
|Gateway Inc.
|Computer user interface for product selection
|27 Oct 1997
|2 Aug 2005
|Marketswitch Corp.
|System and method of targeted marketing
|8 Mar 2001
|12 Sep 2002
|International Business Machines Corporation
|Apparatus, method and computer program product for creating and using a priced object
|26 Jul 2001
|30 Jan 2003
|Joshi Rohit Ricky
|System and method for negotiating prices in an automated auction forum
|19 Jul 2006
|25 Jan 2007
|Raz Gordon
|System and Method for Facilitating Network Based Commerce
|19 Jul 2006
|25 Jan 2007
|Junichiro Nishi
|Real-time internet auction system
|11 Jul 2007
|17 Jan 2008
|Terry Erisman
|Internet Auction System
|"Auction Types and Auction Terms", AuctionTamer, (2005),3 pages.
|"Auction", Wikipedia, (Aug. 7, 2005),3 pages.
|"Dutch Auction", eBay, Inc., (2005),2 pages.
|"Dutch Auction", Epiq Technologies, Inc., (2004),2 pages.
|"Player Auctions-Help for Users", Player Auctions, LLC, (Aug. 10, 2005),2 pages.
|"Second Price Auctions", Epiq Technologies, Inc., (2004),2 pages.
|"Ticket Auctions FAQ's", MLB Advanced Media, (2005),4 pages.
|"UK Auction Help: Auction Types", [www.UKAuctionHelp.co.uk], (2005),3 pages.
|"Yankee Auction", Global Investor, (2005),2 pages.
|"Player Auctions—Help for Users", Player Auctions, LLC, (Aug. 10, 2005),2 pages.
|Reynolds, Kate , "Auction-The Vickrey Auction", Agorics, Inc., (1996),3 pages.
|Reynolds, Kate , "Auction—The Vickrey Auction", Agorics, Inc., (1996),3 pages.
|Second Price Auctions, http://web.archive.org/web/*/http://www.epiqtech.com/auction-software-Second-Price-Auction.htm dated Aug. 24, 2004.
|Second Price Auctions, http://web.archive.org/web/*/http://www.epiqtech.com/auction—software-Second-Price-Auction.htm dated Aug. 24, 2004.
|Citing Patent
|Filing date
|Publication date
|11 Nov 2008
|7 Feb 2012
|Ebay, Inc.
|Escrow payment to faciliate on-line transactions
|4 May 2012
|19 Mar 2013
|Transengine Technologies, LLC
|Method for a ticket exchange across different systems of record
|16 Dec 2011
|28 May 2013
|Ebay Inc.
|Escrow payment to faciliate on-line transactions
|8 Jan 2007
|29 Jan 2009
|Governing Dynamics Llc
|System and Method for Locating Rewards and Discounts in E-Commerce
|11 Nov 2008
|31 Dec 2009
|Ebay Inc.
|Escrow payment to faciliate on-line transactions
|1 Jun 2010
|2 Dec 2010
|Richard Hui
|Automated sell system
|17 May 2012
|23 May 2013
|John Robert Krukowski
|E-commerce valuation system and method
|9 Dec 2013
|10 Apr 2014
|Ebay Inc.
|Electronic publication system
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|23 Sep 2005
Owner name: WK NETWORKS, INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:HAMOR, ALAN;REEL/FRAME:017036/0494
Effective date: 20050922
|15 Dec 2009
Owner name: KALIKO & YEAGER, LLC, NEW JERSEY
Free format text: LIEN;ASSIGNOR:WK NETWORKS;REEL/FRAME:023653/0406
Effective date: 20090924
|3 Apr 2015
|Maintenance fee reminder mailed
|24 Aug 2015
|Fee payment
Year of fee payment: 4
|24 Aug 2015
|Surcharge for late payment


text:
The Securities Industry and Financial Markets Association (SIFMA) has appointed T. Timothy Ryan, Jr. as its chief executive officer to be based in New York. Ryan replaces Marc Lackritz who retired December 31, 2007.
"After a thorough six month search, it became crystal clear to the SIFMA search committee that Tim had the right mix of hands-on industry and product knowledge, keen command of domestic and global public policy, and proven leadership skills," says SIFMA Chairman Blythe Masters, who is also head of global commodities at J.P. Morgan. "His experience and expertise will be of great value in further establishing SIFMA as the powerful voice of the securities industry and global financial markets."
Ryan has been vice chairman of investment banking for financial institutions and governments at J.P. Morgan and a member of the firm's investment banking coverage management committee. Prior to joining J.P. Morgan in 1993, he was the director of the Office of Thrift Supervision (OTS) at the U.S. Department of the Treasury. As OTS director, he served as the banking and securities regulator for the nation's 2,000 thrifts and managed an office of 3,000 employees in 11 offices; he was also a principal manager of the savings and loan cleanup, which involved closing some 700 insolvent institutions, improving capital bases and selling over $300 billion of assets.
"SIFMA will continue to play an essential role as the industry's single powerful voice," says Ryan. "I look forward to working with the Board and SIFMA's senior management to drive their goals of ensuring the public's trust in the securities industry and financial markets; promoting effective, efficient regulation; facilitating more open and competitive global capital markets, as well as championing investor education and retirement savings."
Janet Levaux is the managing editor of Research; reach her at firstname.lastname@example.com.


text:
Kabir Project
From Library of Congress Name Authority File
Kabir Project
Instance Of
Scheme Membership(s)
Collection Membership(s)
- Kabīra Projecta
Additional Information
Exact Matching Concepts from Other Schemes
- found: Hada anahada, c2008: title frames (Kabir Project)
- found: www.kabirproject.org, Jan 19, 2010 (The Kabir Project brings together the experiences of a series of ongoing journeys in quest of this 15th century North Indian mystic poet in our contemporary worlds. Started in 2003, these journeys inquire into the spiritual and socio-political resonances of Kabir's poetry through songs, images and conversations. This is a 6-year initiative undertaken by filmmaker Shabnam Virmani as an artist-in-residency project at the Srishti School of Art, Design and Technology in Bangalore, India; supported by the Ford Foundation, New Delhi)
- found: Pākistāna meṃ Kabīra, 2008: p. 3 of accompanying book (Kabīra Projecta)
Change Notes
- 2010-01-19: new
- 2010-03-12: revised
Alternate Formats


text:
Written on: 29/11/2008 by JJonesRN3 (1 review written)
Good Points
Creative, affordable and fast turn around time.
General Comments
Websquash provided me with a logo for my web business that I can be proud of. The logo they created will represent the positive and successfurl business image that I am presenting to the on line business community. Websquash service is inexpensive, creative, and reliable. Well recommend websquash.com.