text:
Mayor's Office
Mayor Chris Beutler today said he would reduce the City's property tax levy by three cents or more if voters approve a half-cent sales tax increase, an election that would be allowed by LB 956 now being debated by the Legislature. Beutler said recent state and federal action have resulted in the need for higher property taxes to fund local government, and passage of the bill would be a step in the right direction.
"The trend of passing the buck to local governments to solve national and state budget challenges has shifted the burden of taxation away from non-essential services to one of the most essential living expenses to any family - the roof over your head," Beutler said. "Sales taxes shift the tax burden from savings and investment to consumption, better rewarding those who work hard and make responsible choices. But the best feature of allowing people to choose the sales tax as a local taxing option is property tax relief."
LB 956 requires that the ballot language to increase the sales tax inform voters precisely how the new funds will be spent, and Beutler said that gives people greater control on local government spending without tying the hands of local officials. The Legislature's Revenue Committee is scheduled to hold a public hearing on LB 956 Thursday. A three-cent reduction in the property tax levy would be a 10-percent reduction in the City levy and would reduce the City's portion of the property tax bill by about $45 a year for the owner of a home valued at $150,000.
Beutler said State action last year that resulted in greater reliance on property taxes includes the elimination of State aid to municipalities and restriction on the ability of cities to apply the telecommunications tax. Those actions, he said, led to the City increasing its property tax levy from 28.8 to 31.6 cents per $100 of assessed valuation.
In the current legislative session, proposed bills would eliminate the inheritance tax which goes to counties and require a vote for any occupation tax imposed or increased after the effective date of the bill. Beutler said that would require Lincoln to have expensive elections on raising occupation taxes that generate a few thousand dollars. "The expense and complication of holding elections for every minor occupation tax would be clearly unreasonable and will simply force a shift to, and a greater reliance on property taxes," he said.
The federal government, Beutler said, has caused pressure on property taxes by sharply reducing the Community Development Block Grant and HOME programs to improve housing and revitalize neighborhoods and business districts.
Beutler said Lincoln has cut about $5.5 million in personnel spending, cutting the non-public safety workforce by 9 percent or about 132 jobs over five years. The City cut police officers in schools, bus routes, parks maintenance, library hours, senior centers and the retirement match for new employees.
"They were tough choices, but choices that had to be made for the survival of other key public services," Beutler said. "We did it because we strongly believe that a fiscally conservative approach was the right strategy in these times. And our reward for our fiscal prudence? A brick by brick dismantling of the property tax relief that was so carefully constructed by state leaders of the past.
"We need a better solution for local government than the increased property tax approach being advocated by recent state and federal revenue shifts," he said. "We need the fairer solution to the challenge of funding police, fire, roads and other critical local services represented in LB 956."


text:
Ivy Tech Online Classes
Today, you don't need to travel to campus to get a college degree. Ivy Tech online programs allow you to take classes on your schedule, at your own pace. You'll still interact with your instructors and classmates — and you'll still have to work hard — but you'll save time and gas money along the way to graduation. And if you want to go to class in your pajamas, no one will ever know.
Ivy Tech Community College offers more than 1,000 online courses statewide, and the following degree programs can be completed entirely online:
- Accounting
- Business Administration
- Business Operations, Applications and Technology
- Computer Science
- Criminal Justice
- Cyber Security/Information Assurance
- Database Management and Administration
- Entrepreneurship
- General Education Transfer Core
- General Studies
- Informatics
- Information Technology Support
- Library Technical Assistant
- Manufacturing Production and Operations (MPRO)
- Software Development
- Supply Chain Management/Logistics
We also offer programs that use a mix of face-to-face, online and video instruction. In these programs, on-campus classes, internships, and other on-site requirements exist, but the majority of your time is spent in a "virtual" classroom. Please discuss these with your advisor to be sure you understand the specific requirements of the degree and course offerings:

subset: commoncrawl


text:
Jay Rice '86 Earns Bronze Star in Combatby Tom Runge • August 4, 2008 Share:
Marine Major Jay Rice, a 1986 graduate of Wabash College, has been awarded the Bronze Star for his courage and leadership during combat operations in Afghanistan.
Rice currently serves as the Operations Officer for the 12th Marine Regiment which is permanently stationed in Okinawa, Japan and deployed for combat operations in Afghanistan.
On June 10, 2006, Rice was part of a convoy ambushed by Taliban fighters. Rice immediately took charge of the situation and through his leadership repulsed the attack causing heavy losses to the Taliban.
Rice graduated with a degree in psychology - he was a three time All American in swimming while at Wabash. Jay and his wife Anita have three children: Samuel, Jacob, and Mary.
Congratulations Jay - keep your speed up and your head down!


text:
The AACR Cancer Epigenome Task Force (CETF) will investigate the feasibility of an integrated International Cancer Epigenome Project modeled after the successful genomics projects already underway to define cancer genomes. The CETF will define the tumor types to be investigated, the scope of epigenomic marks to be studied, the incorporation of the data into publicly accessible databases, and explore the potentials for the use of epigenomic information for the detection, prevention, prognostication, and treatment of human cancers.
Recently there has been a massive increase in the amount of information published on the roles of epigenetic processes in human cancer. Additionally, international projects such as the International Cancer Genome Consortium (ICGC) and The Cancer Genome Atlas (TCGA) project have uncovered mutations previously unrecognized in human cancers, which directly impact epigenomic information. The interaction between the epigenome and the genome is now accepted as having a major causative role in human cancers. Thus, the time is now ripe to derive integrated epigenomic maps which define the effects of these mutations, investigate the timing of epigenomic events in the causation of cancer, and utilize this knowledge for the prevention and treatment of these dreaded diseases.
The CETF will use an integrated approach to determine how the epigenetic marks, including DNA methylation, histone modifications and variants, nucleosomes and non-coding RNAs, are distributed in the genomes of the various cancers under study and determine the role of these changes in carcinogenesis. Further, the CETF will define standards for the production of such maps and provide publicly accessible databases with the goal of accelerating the development of new cancer treatments. By identifying key questions, such as the timing of the events relative to the establishment of a precancerous phenotype as well as potential approaches for providing the solutions to these questions, the CETF will have a major impact on the development of new cancer prevention and treatment approaches.
Task Force Members
Read the special report on the AACR Human Epigenome Workshop, an initiative of the AACR Human Epigenome Task Force (relaunched as the CETF).
Read the task force's proposal for an International AHEAD Pilot Project.
Shawn Sweeney, PhDSenior Program AdministratorExecutive OfficePhone: 215-440-9300Email: email@example.com


text:
Mayor Don Wesely said today he is "deeply disappointed" by the Goodyear Tire and Rubber Company's plans to "replace long-standing Lincoln employees with low-wage workers in Mexico."
"I am personally saddened by today's announcement," Wesely said. "Since Goodyear first indicated last January that it might relocate the hose manufacturing facility, I have worked hard to encourage the company and labor leaders to seek an agreement that would keep these quality jobs in our community."
Goodyear announced Friday it would build an automotive rubber hose plant near Chihuahua, Mexico and employ more than 200 people there by 2004. The phase-out in Lincoln ultimately will affect about 480 jobs at the Lincoln plant, which currently employs more than 1,200 people.
When Goodyear announced its intentions last January, Wesely immediately contacted Goodyear management at the local level, Sam Gibara, CEO of Goodyear, local and international Steelworkers Union officials and Nebraska's state and federal elected representatives to save the hose operation in Lincoln.
The City had worked with the state and had offered up to $1.5 million in state job training funds to help Goodyear through these difficult economic times and to keep the jobs in the Lincoln plant.
On October 6, members of the Steelworkers Local 286 union representing Goodyear employees in Lincoln rejected a company package that would have cut wages but retained jobs. Following the vote, Wesely contacted Goodyear labor and management and urged their return to the table for further discussions everyone could accept.
Wesely thanked U.S. Senator Ben Nelson, Governor Mike Johanns, Congressman Doug Bereuter and U.S. Senator Chuck Hagel for their support and efforts to retain Goodyear's hose operation in Lincoln.
Wesely, whose father retired from Goodyear after many years in the local Goodyear plant, said low wages in Mexico and Goodyear's declining stock price have put pressure on the company to make this decision. Goodyear's stock shares have dropped from $60 in 1998 to $9.34 this month.
"We will work with the Congressional delegation to help secure the federal assistance available under NAFTA to assist the Lincoln workers," Wesely said.
Because the jobs are being relocated to Mexico, local workers who are laid off will be eligible for retraining under the terms of the North American Free Trade Agreement (NAFTA). Each employee may have access to up to $12,000 in federal funds for retraining during the next few years. The Lincoln One Stop Career Center, working in partnership with the state Department of Labor, would administer the NAFTA services. Those wanting more information can contact the Career Center at 441-7111.
The city will also continue to work with Goodyear officials to encourage investment in the remaining belt production line at the Lincoln Goodyear plant.
"Goodyear has been a fixture in Lincoln since 1943," Wesely said. "Lincoln and Goodyear have prospered and grown together, and we all have benefitted from the relationship. I respect Goodyear's goal of remaining competitive, but I cannot accept that the hose manufacturing facility could not be competitive in Lincoln."
Goodyear's Lincoln plant was built in about 1920 and first was home to Hebb Manufacturing, which produced trucks. It later was Arrow Aircraft. Goodyear took over in 1943 for wartime manufacturing and bought the facility after the war. Goodyear started making hoses there in 1950.
Media Release


text:
|July 30, 1997
|Agency Addressed
|William O. Monroe, Director
Division of Accounting and Auditing
Office of the Comptroller
Effective July 1, 1997, the Recurring Payment System was made available for use by State agencies. The Recurring Payment System is for use when making payments that are identical or similar in nature. State agencies are encouraged to use the Recurring Payment System in order to eliminate duplication of efforts and to minimize use of paper.
The Recurring Payment System may be used for payments to State agencies as well as payments to vendors on a fiscal year basis. These payments include, but are not limited to; rents, utilities, maintenance services, etc. The Recurring Payment System may also be used for annual contracts paid out as a fixed monthly rate.
The Recurring Payment System allows an agency to schedule their repetitive payments once prior to the initial payment. Payments may be on a monthly or quarterly cycle and be a fixed or variable amount. Agency input of the required payment information will be done by accessing the "RE" Function on the Main Accounting Menu. Updating of the recurring payment file is immediate once an agency has completed their "input" and "approval" of the payment information.
The Bureau of Auditing has developed a certification checklist to be completed by State agencies for each recurring payment ID number. Please call the Bureau of Auditing contacts listed below for copies of the certification form. Agency certifications for commodities and contracts should be completed and submitted to your respective Bureau of Auditing audit section or appropriate field office for all recurring payment requests. No additional documentation will be required at this time for recurring payment requests. In lieu of submission of the agency certification for private sector lease payments, agencies should input the lease number in the appropriate field on the recurring payment input screen. Upon receipt of the agency certification and/or system notification of the payment request, the Bureau of Auditing will review and approve or disapprove the recurring payment request. Once a recurring payment request has been approved by the Bureau of Auditing, the initial payment and all subsequent payments for the fiscal year will be automatically processed by the system, unless information in certain Comptroller sensitive data elements is changed by the agency. A change in any of the Comptroller sensitive data elements will require the recurring payment request to be re-approved by the Bureau of Auditing. A listing of the Comptroller sensitive data elements is included in the SAMAS Recurring Payment handout.
A SAMAS Recurring Payment handout with input instructions is available upon request from the SAMAS Help Desk. If you have any questions concerning Recurring Payment entries, please call the SAMAS Help Desk at 487-2627 or Suncom 277-2627. You may also call Cheri Greene at 850-414-7861 (SUNCOM 994-7861), Sharon Schrader at 850-414-7835 ( SUNCOM 994-7835), or the appropriate Bureau of Auditing Field Office.


text:
Translating Song of the day: the office theme song!
Drink of the week: Pudding Shots
P.S. As always, the read chapter button is in the bottom right! Interested in seeing what some soul pets look like? Or maybe you want to snag a cool chong mei collectible, or a cyan dragon! Or maybeee you want to read just a litttleee ahead! Either way, hit up that patreon if you're interested 🙂


text:
when a man sticks his super long penis into a vagina when the girl is in cow-girl position. When she leans back with the penis still inserted, the mans legs kick out like a recliner.
"Dude, I was totally bangin this chick yesterday and she leaned back on me and gave me a recliner handle. My legs totally kicked back!
by shavo13 November 07, 2008


text:
Depression Self Help Hypnosis Downloads
I was completely despairing and suicidal... The Depression Program didn't feel like a struggle - it felt like being gently led toward the light.
Letitia, Australia *
Read the full testimonial »
Depression self help is not a contradiction in terms, but a strategy for recovery. However you are affected by depression, whether you are a sufferer, or a relative, friend or carer of a depressed person, there is much you can do to influence and improve your situation.
Our depression self help hypnosis downloads tackle issues ranging from coming off antidepressants to coping with a depressed relative. And in pride of place is our ground-breaking full depression treatment program.
Depression afflicts us when, for whatever reason, a gulf opens up in our lives and we realize that we can no longer continue living in the way we did before. In many cases, it goes away by itself after some time. But in some cases it can persist, and then it's really vital to understand the physiological and psychological impact - and what exactly to do about them.
If you or someone you know is affected by the blight of depression, one of our downloads will make a huge difference.
For a full step by step depression treatment program, see the Depression Recovery Program here.
Our recommendations for money-saving hypnosis packs...
Insomnia Beater Pack
Give sleep a chance with deeply relaxing hypnosis
Overcome Your Nervous Breakdown Pack
Relax deeply with hypnosis, then start to feel better
Beat Fear and Anxiety Hypnosis Pack
5 carefully selected downloads to help you overcome excess fear and anxiety for good
All our 'Depression Self Help' hypnosis downloads...
* Results may vary from person to person. This is why we provide a no-questions asked 90-day money-back guarantee to ensure you feel comfortable trying our downloads out. We believe they are the best available, and hope you will too.


text:
Nerissa played by Sonia Ritter
The Merchant Of Venice (1998)
Written by: William Shakespeare
Sonia Ritter played Nerissa in the 1998 production of The Merchant Of Venice.
latest updates
Sonia enjoys the technical and preview part of the production period as this allows her to be practical about her role, she finds that little details develop very quickly at the end of the rehearsal process.
Nerissa listens to a great deal of dialogue, but does not contribute unless necessary or appropriate.
Sonia has been considering the effect that working on the Globe stage will have on her performance.
Sonia has played the role of Nerissa before for the Original Shakespeare Company at Globe Neus.
The rehearsals for the Globe's 1998 Theatre Season take place in a converted warehouse in O'Meara Street; about 5 minutes walk from the Globe theatre itself.


text:
Lisa2 needed a new logo design and created a contest on 99designs.
A winner was selected from 229 designs submitted by 85 freelance designers.
Oasys Water
Oasys Water is a 2-yr old, well funded start-up that has received acclaim in Forbes, Nature, New Scientist and other major publications as a company with a breakthrough in water treatment, specifically for desalination. Our forward osmosis technology is a building block in the path to providing low cost, energy efficient water for a sustainable future.
Our major advantage is the use of an "engineered" salt solution which can be vaporized at extremely low temperature. We produce a beneficial product at 60-90% less than the cost of technologies available today.
FO (forward osmosis) is natural diffusion. It is how you, plants and most living things take in water. We replace natural salt with our salt, thus creating an equilibrium or balance.
The water industry is very conservative. We like to think outside the box to develop ways to use available resources to treat water for a thirsty world. Our team is comprised of young talent with 10-20 years experience in either water or venture capital. We do not want our image to be perceived as young or naive, but rather innovative and fresh.
We need a new logo and new website. Here is the link to our existing "stealth" page (the logo now says Oasys Resource Recovery):
We have two initial target audiences. First, we are appealing to industrial water users who need to reduce the total cost or water and/or recycle water. Buyers are typically educated, age 40-60, who are willing to adopt newer technologies based on some commitment for reliability and robustness.
Second audience is the investment community. We are interested in companies looking at clean-tech that see the value in water resources.
We have an existing logo that has been in print for roughly 2-years. It feels very young and "techy", especially the water droplet. We need to be more polished and innovative.
We do not want a total departure from the logo. The basic colors of blue and green, in new shades, should be used for an image. We prefer the font to be dark/black, although we are open to alternatives.
The logo should read "Oasys Water", although water does not need to be the same font on point size. "OASYS" is an acronym for Osmotic Applications and Systems. Thus, we'd like to see options with this in capital letters.
Finally, there are other companies that use a similar name. They typically spell Oasis with an "i". We have looked at trying to make the "y" stand out, but this has proven difficult. We are open to suggestions.
We will need .eps and .jpg files that can be used for printing and reproduction for large graphics.
Thanks for your help!
Find out how a design contest works or learn more about our logo design services.


text:
3 Skinheads Give A Black Man A Brutal Beating In Maryland!
Baltimore, MARYLAND--- A 76-year-old black man is in serious condition after 3 white monsters brutally beat him with a bat or a stick. The elderly man and his wife were out fishing when the attack occurred. One of the savages involved in the attack is Calvin E. Lockner, a 28-year-old cowardly miscreant. Lockner was previously arrested for beating his wife for talking to black people. According to online court records, Lockner was charged with rape, but pleaded guilty to a lesser charge of second-degree sex offense in 2000 and was sentenced to eight years in prison. He got another two years in 2007 for violating his probation.
Please click the "Report" button below if the video on this page is not working properly.
Comments will only be displayed by verified emails. No Spamming or Racism.


text:
The tear down has begun.
Join us as we celebrate the 25th Anniversary of our first Oktoberfest Visit. We will once again be visiting Munich in 2018, and we are "getting the band back together". We will reassemble the original Oktoberfestian team, and will once again set the standard for a visit to the land of enchantment. Please follow our planning and execution of another World Class Event, full of fun, frivolity and Gemütlichkeit.
Countdown until opening day .....
Finlay's Oktoberfest Resources site to learn more about our past visits,
some history and interesting anecdotes.
another friendly Oktoberfest Blog;
The Bros
Oktoberfest. Alcoholische and Betrunken learned everything they know from
Click Above to See the Status of the Wiesn.
Oktoberfest Visits is an Amazon Affiliates member. Please use Amazon for your purchases; both Oktoberfest and all your other needs. Just click the logo below.
Thursday, October 05, 2017
Isn't this depressing?
Posted by Chugger at 10/05/2017 11:17:00 AM
No comments:
Subscribe to: Post Comments (Atom)


text:
Send me eNewsletter
Receive updates via SMS
Describe Yourself
Summary of the GARVEE ProgramThe Treasurer of State issues Grant Anticipation Revenue Vehicle (or GARVEE) bonds for the Ohio Department of Transportation for selected highway construction projects that have been approved by the U.S. Department of Transportation. The debt service charges are secured by and paid from federal transportation funds allocated to the state.AuthorityOhio Revised Code, Section 5531.10 (B)Link to the Ohio Department of Transportationwww.dot.state.oh.us Links to Past GARVEE Program IssuesSeries 1998 ($70,000,000) Series 1999 ($20,000,000) Series 2001 ($100,000,000)Series 2002 ($135,000,000)Series 2003 ($113,765,000)Series 2005 ($99,270,000)Series 2006 ($180,000,000)Series 2007 ($210,000,000)Series 2008 ($375,000,000)Series 2010-1 ($78,185,000)Series 2010-2 ($136,815,000)Series 2010-3 ($184,000,000)Series 2010-4 ($46,000,000)Series 2012-1 ($183,530,000)Series 2014-1A ($155,875,000)Series 2014-1B ($62,265,000)Series 2016-1 ($217,565,000)
*By clicking on a provided link you will be leaving the Ohio Treasurer's office website for another website. The Ohio Treasurer's office is not responsible for the content or for any problems you may have in connecting to it. We are providing a link only as a convenience and the inclusion of such link does not imply any endorsement, approval, investigation, verification or monitoring by the Ohio Treasurer's office of any content or information contained within or accessible from the linked site. The Ohio Treasurer's office does not control the accuracy, completeness, timeliness or appropriateness of the content or information on the linked site. If you choose to visit the linked site you will be subject to its terms of use and privacy policies, over which the Ohio Treasurer's office has no control. In no event will the Ohio Treasurer's office or the state of Ohio be responsible for any information or content within the linked site or your use of the linked site. By continuing to the linked site you agree to the foregoing.


text:
0 Members and 1 Guest are viewing this topic.
How in Mor's good nameone hundred fifty four postsNo Rachel Weisz picSelam
Don't believe everything you think.
The more I know, the less I know.
O Lord our God, Who by word alone did heal all diseases, Who did cure the kinswoman of Peter, You Who chastise with pity and heal according to Your goodness; Who are able to put aside every malady and infirmity, do You Yourself, the same Lord, grant aid to this Your servant Rosehip and cure her of every sickness of which she is grieved; lift her up from her bed of pain, and send down upon her Your great mercy, and if it be Your Will, give to her health and a complete recovery; for You are the Physician of our souls and bodies, and to You do we send up Glory: to the Father, and to the Son, and to the Holy Spirit, both now and ever, and to the ages of ages. Amen
Page created in 0.125 seconds with 25 queries.


text:
Your child awakens in the middle of the night crying inconsolably. She feels hot to the touch, and you quickly take her temperature. 103 degrees! (39.5 Celcius) You are understandably worried! Should you call your doctor? Should you rush her to the emergency room?
Here are some helpful tips about fevers that will get you safely and comfortably through the night.
- Remember, fevers are your body's natural response to infection, and not necessarily a sign that something serious is taking place.
- Low-grade fevers are generally not serious, are easily treated, and can wait until the morning to be evaluated by your doctor.
- Fevers of 101 to 103 (38.4 to 39.5 Celcius) are also generally not serious and can wait until morning to be evaluated, except as indicated below.
- High fevers of 104 (40 Celcius) or higher that quickly come down to 100 or 101 (37.8 to 38.3 Celcius) with the treatment measures below are also generally not serious and can wait until morning, except as indicated below.
So for now, don't rush to page your doctor. Read through this section, and call your doctor during office hours, or page your doctor according to the following guidelines:
Here are the situations that usually warrant an urgent call to your doctor. If none of these fit your current situation, then you probably don't need to page your doctor. Follow our treatment advice below and call your doctor during office hours.
- If your infant is 6 weeks or younger, and has a fever of 101 or higher, this is considered a medical emergency. Your doctor should evaluate your infant right away, either during business hours, or in an emergency room after hours. Do not give any fever-reducing medications in this situation (you don't want to hide the fever until after a doctor has evaluated your baby). Be sure to confirm any fevers with a rectal thermometer (if available) before contacting your doctor.
- Infants age 7 weeks to three months with a fever over 101 warrant an appointment with your doctor within the next several hours. You generally don't need to page your doctor in the middle of the night in this situation if the office opens within the next few hours. Simply follow our recommendations on treating fever below and call your doctor in the morning. If it is the early evening you should probably page your doctor, since the office won't be open until the following day. Be sure to confirm any fevers with a rectal thermometer (if available) before contacting your doctor.
- If your child of any age has one or more of the following symptoms, you should probably call your doctor right away:
- High fevers of 104 (40 Celcius) or higher that don't come down to 101 or 102 (38.3 to 38.9 Celcius) with the treatment measures below.
- Lethargy – this means more than your child just isn't acting right or laying quietly in your arms. Lethargy actually refers to your child being limp, lifeless, unresponsive, or won't make eye contact.
- Irritability - this means more than just fussiness. A truly irritable child will cry for hours with minimal verbal interaction, and is almost impossible to console.
- Meningitis – symptoms are high fever, stiff neck or pain in the back of the neck, vomiting, headache, bright light hurts the eyes. Before paging your doctor, you should also look up any other symptoms your child has, such as cough, vomiting, rash, etc and read those guidelines to determine your best course of action.
No. Many parents have a misconception that fevers are a bad thing and a sign that there is some serious underlying illness. This simply is not true. Fever is a normal and healthy response of the body to an illness. The body's immune system releases chemicals that raise the body temperature. This is part of the normal infection-fighting process.
- Normal temperature – 97 to 99 degrees (36 to 37.2 Celcius).
- Low-grade fever – 99 to 100.9 degrees (37.3 to 38.3 Celcius).
- Common fever – 101 to 103.5 degrees (38.4 to 39.7 Celcius).
- High fever – any fever over 103.6 degrees (39.8 Celcius).
No. Low-grade fevers are helpful in fighting off infection. You should only treat a fever when it is making your child miserable. Treat your child, not the fever.
- Viral infection – this is the most common cause of fever in children. Examples are: Roseola, Colds, Flu, Coxsackie (hand, foot and mouth disease), Chicken Pox, Fifth Disease, and many others. Most viruses are not dangerous. They simply need to run their course over several days. They are not treatable with antibiotics.
- Bacterial infection – Some examples include ear infection, sinus infection, pneumonia, bladder infection, and strep throat. These are treatable with antibiotics, although treatment can usually wait 12 hours until you can contact you doctor in the morning.
- Teething– this can cause fevers, though usually not higher than 101.
- Regular glass underarm thermometer– this seemingly "old fashioned" method is still probably the most accurate, although difficult to do with a crying, squirming child. Try to hold in place for 3 minutes, making sure the tip is deep in the soft underarm skin.
- Ear thermometer – this quick and easy method has become more popular. The accuracy of these thermometers varies, however. One ear may read 98, the other 103. Which do you believe? If it reads close to normal, then it's probably true. If it reads 103 (39.5 Celcius) or greater, you may want to confirm this with a glass under thermometer! Readings between 99 and 102 (37.2 to 38.9 Celcius) are more reliable.
- Rectal glass thermometer – this method should only be used for newborns through age 3 months since accuracy is crucial for this age. Gently insert the thermometer approximately ½ inch into the anus and hold in place for 3 minutes.
- Digital thermometer – these are oral, underarm or rectal. They are much faster than a glass thermometer, although you do lose some accuracy as with the ear thermometer.
- First step – decide if the fever warrants treatment as discussed above.
- Medications
- Acetaminophen– this fever reducer/pain reliever has been around a long time and is effective is most cases. It can be given every 4 hours. Click on it for dosing chart.
- New research in 2001 has shown that giving an initial double dose of acetaminophen for high fevers is both safe and more effective to bring down that high fever fast. Only give a double dose if the fever is high. You can only give a double dose once every few days if needed. Any other doses should be the regular dose.
- Ibuprofen– this newer medication is also effective for fever and pain. It often works better for higher fevers, and lasts longer too. It can be given every 6 hours. It was previously only approved for children 6 months and older. Recently it was approved safe and effective for infants down to two months of age. Click on it for dosing chart.
- Using both medications – it is best to only use one of these two medications. However, if one by itself isn't enough or wears off too soon, then it is safe to give the other medication on top of the first without waiting. Another option is to alternate between them every 3 hours. Give acetaminophen at 8:00, ibuprofen at 11:00, acetaminophen at 2:00 and so on.
- WARNING – don't give ASPIRIN to children 12 and under.
- Vomiting - if your child is vomiting and won't keep down any medication, you can use acetaminophen suppositories available over the counter. Click here for the acetaminophen dosing chart.
- Lukewarm bath and cool washcloth – this can help get a fever down fast, especially if it is high, but only use along with, not instead of fever lowing medication.
- Cool liquids to drink can help cool down a fever and keep your child well hydrated.
- Remember, fevers are your body's natural response to infection, and not necessarily a sign that something serious is taking place.
- Low-grade fevers are generally not serious, are easily treated, and can wait until the morning to be evaluated by your doctor.
- Fevers of 101 to 103 (38.4 to 39.5 Celcius) are also generally not serious and can wait until morning to be evaluated, except as indicated below.
- High fevers of 104 (40 Celcius) or higher that quickly come down to 100 or 101 (37.8 to 38.3 Celcius) with the above measures are also generally not serious and can wait until morning, except as indicated below.


text:
The Big O. There's nothing better than an incredible orgasm to relax, rejuvenate, and revive you after a long day of work. But what happens when sex becomes ... dull? Same position, different day. How can you get out of your rut? What are some easy ways to spice up your sex life?
Simple! Amazing new sex positions that don't require a trapeze artist! Read on for the secret to a mind-blowing orgasm ...
1) Using Your Table - No, seriously! Rather than wait until later, when you're both tired and ready for bed, get hot and heavy in the kitchen. Lie down on the counter top and put your legs on your guy's shoulders to allow him access to your vagina. It's sexy, hot, and rough!
2) Butterflies Are Free to Fly - This is a modification on table sex. Instead of allowing your butt to lie flat on the surface, have your guy pull it up toward him as you rock back and forth.
3) Missionary Plus - Begin having sex in the missionary position. When he's inside you, bring your legs together between his, so that his penis can produce amazing friction to the clitoris, allowing for an amazing orgasm!
4) Grabbing the Shaft - While you're in the middle of some hot freaky sex, reach down and grab the base of the penis using your thumb and first finger and pull back, allowing for greater orgasm and feeling for your guy.
5) Using the V - Because the clitoris is sorta buried under the clitoral hood, many women don't get the friction there that they'd like. Use your first two fingers (or his!) and spread your clitoral hood, allowing for better access and hotter-than-hot sex!
What sex positions do you recommend for an incredible orgasm?
Image via tuppus/Flickr


text:
Distributed computing
Distributed computing is a field of computer science that studies distributed systems. A distributed system is a software system in which components located on networked computers communicate and coordinate their actions by passing messages.[1] The components interact with each other in order to achieve a common goal. Three significant characteristics of distributed systems are: concurrency of components, lack of a global clock, and independent failure of components.[1] Examples of distributed systems vary from SOA-based systems to massively multiplayer online games to peer-to-peer applications.
A computer program that runs in a distributed system is called a distributed program, and distributed programming is the process of writing such programs.[2] There are many alternatives for the message passing mechanism, including pure HTTP, RPC-like connectors and message queues.
A goal and challenge pursued by some computer scientists and practitioners in distributed systems is location transparency; however, this goal has fallen out of favour in industry, as distributed systems are different from conventional non-distributed systems, and the differences, such as network partitions, partial system failures, and partial upgrades, cannot simply be "papered over" by attempts at "transparency" - see CAP theorem.
Distributed computing also refers to the use of distributed systems to solve computational problems. In distributed computing, a problem is divided into many tasks, each of which is solved by one or more computers,[3] which communicate with each other by message passing.[4]
Introduction 1
- Architecture 1.1
- Parallel and distributed computing 2
- History 3
- Applications 4
- Examples 5
Theoretical foundations 6
- Models 6.1
- An example 6.2
- Complexity measures 6.3
- Other problems 6.4
- Properties of distributed systems 6.5
Coordinator election 7
- Bully algorithm 7.1
- Chang and Roberts algorithm 7.2
- Architectures 8
- See also 9
- Notes 10
- References 11
- Further reading 12
- External links 13
The word distributed in terms such as "distributed system", "distributed programming", and "distributed algorithm" originally referred to computer networks where individual computers were physically distributed within some geographical area.[5] The terms are nowadays used in a much wider sense, even referring to autonomous processes that run on the same physical computer and interact with each other by message passing.[4] While there is no single definition of a distributed system,[6] the following defining properties are commonly used:
- There are several autonomous computational entities, each of which has its own local memory.[7]
- The entities communicate with each other by message passing.[8]
In this article, the computational entities are called computers or nodes.
A distributed system may have a common goal, such as solving a large computational problem.[9] Alternatively, each computer may have its own user with individual needs, and the purpose of the distributed system is to coordinate the use of shared resources or provide communication services to the users.[10]
Other typical properties of distributed systems include the following:
- The system has to tolerate failures in individual computers.[11]
- The structure of the system (network topology, network latency, number of computers) is not known in advance, the system may consist of different kinds of computers and network links, and the system may change during the execution of a distributed program.[12]
- Each computer has only a limited, incomplete view of the system. Each computer may know only one part of the input.[13]
Client/Server System : The Client-server architecture is a way to provide a service from a central source. There is a single server that provides a service, and many clients that communicate with the server to consume its products. In this architecture, clients and servers have different jobs. The server's job is to respond to service requests from clients, while a client's job is to use the data provided in response in order to perform some tasks.
Peer-to-Peer System : The term peer-to-peer is used to describe distributed systems in which labour is divided among all the components of the system. All the computers send and receive data, and they all contribute some processing power and memory to a distributed computation. As a distributed system increases in size, its capacity of computational resources increases.
Parallel and distributed computing
Distributed systems are groups of networked computers, which have the same goal for their work. The terms "concurrent computing", "parallel computing", and "distributed computing" have a lot of overlap, and no clear distinction exists between them.[14] The same system may be characterized both as "parallel" and "distributed"; the processors in a typical distributed system run concurrently in parallel.[15] Parallel computing may be seen as a particular tightly coupled form of distributed computing,[16] and distributed computing may be seen as a loosely coupled form of parallel computing.[6] Nevertheless, it is possible to roughly classify concurrent systems as "parallel" or "distributed" using the following criteria:
- In parallel computing, all processors may have access to a shared memory to exchange information between processors.[17]
- In distributed computing, each processor has its own private memory (distributed memory). Information is exchanged by passing messages between the processors.[18]
The figure on the right illustrates the difference between distributed and parallel systems. Figure (a) is a schematic view of a typical distributed system; as usual, the system is represented as a network topology in which each node is a computer and each line connecting the nodes is a communication link. Figure (b) shows the same distributed system in more detail: each computer has its own local memory, and information can be exchanged only by passing messages from one node to another by using the available communication links. Figure (c) shows a parallel system in which each processor has a direct access to a shared memory.
The situation is further complicated by the traditional uses of the terms parallel and distributed algorithm that do not quite match the above definitions of parallel and distributed systems; see the section Theoretical foundations below for more detailed discussion. Nevertheless, as a rule of thumb, high-performance parallel computation in a shared-memory multiprocessor uses parallel algorithms while the coordination of a large-scale distributed system uses distributed algorithms.
The use of concurrent processes that communicate by message-passing has its roots in operating system architectures studied in the 1960s.[19] The first widespread distributed systems were local-area networks such as Ethernet, which was invented in the 1970s.[20]
ARPANET, the predecessor of the Internet, was introduced in the late 1960s, and ARPANET e-mail was invented in the early 1970s. E-mail became the most successful application of ARPANET,[21] and it is probably the earliest example of a large-scale distributed application. In addition to ARPANET, and its successor, the Internet, other early worldwide computer networks included Usenet and FidoNet from 1980s, both of which were used to support distributed discussion systems.
The study of distributed computing became its own branch of computer science in the late 1970s and early 1980s. The first conference in the field, Symposium on Principles of Distributed Computing (PODC), dates back to 1982, and its European counterpart International Symposium on Distributed Computing (DISC) was first held in 1985.
Reasons for using distributed systems and distributed computing may include:
- The very nature of an application may require the use of a communication network that connects several computers: for example, data produced in one physical location and required in another location.
- There are many cases in which the use of a single computer would be possible in principle, but the use of a distributed system is beneficial for practical reasons. For example, it may be more cost-efficient to obtain the desired level of performance by using a cluster of several low-end computers, in comparison with a single high-end computer. A distributed system can provide more reliability than a non-distributed system, as there is no single point of failure. Moreover, a distributed system may be easier to expand and manage than a monolithic uniprocessor system.[22]
Ghaemi et al. define a distributed query as a query "that selects data from databases located at multiple sites in a network" and offer as an SQL example:
- SELECT ename, dname
- FROM company.emp e, email@example.com d
- WHERE e.deptno = d.deptno[23]
Examples of distributed systems and applications of distributed computing include the following:[24]
- Telecommunication networks:
Network applications:
- World wide web and peer-to-peer networks
- Massively multiplayer online games and virtual reality communities
- Distributed databases and distributed database management systems
- Network file systems
- Distributed information processing systems such as banking systems and airline reservation systems
Real-time process control:
- Aircraft control systems
- Industrial control systems
Parallel computation:
- Scientific computing, including cluster computing and grid computing and various volunteer computing projects; see the list of distributed computing projects
- Distributed rendering in computer graphics
Theoretical foundations
Many tasks that we would like to automate by using a computer are of question–answer type: we would like to ask a question and the computer should produce an answer. In theoretical computer science, such tasks are called computational problems. Formally, a computational problem consists of instances together with a solution for each instance. Instances are questions that we can ask, and solutions are desired answers to these questions.
Theoretical computer science seeks to understand which computational problems can be solved by using a computer (computability theory) and how efficiently (computational complexity theory). Traditionally, it is said that a problem can be solved by using a computer if we can design an algorithm that produces a correct solution for any given instance. Such an algorithm can be implemented as a computer program that runs on a general-purpose computer: the program reads a problem instance from input, performs some computation, and produces the solution as output. Formalisms such as random access machines or universal Turing machines can be used as abstract models of a sequential general-purpose computer executing such an algorithm.
The field of concurrent and distributed computing studies similar questions in the case of either multiple computers, or a computer that executes a network of interacting processes: which computational problems can be solved in such a network and how efficiently? However, it is not at all obvious what is meant by "solving a problem" in the case of a concurrent or distributed system: for example, what is the task of the algorithm designer, and what is the concurrent or distributed equivalent of a sequential general-purpose computer?
The discussion below focuses on the case of multiple computers, although many of the issues are the same for concurrent processes running on a single computer.
Three viewpoints are commonly used:
- Parallel algorithms in shared-memory model
- All processors have access to a shared memory. The algorithm designer chooses the program executed by each processor.
- One theoretical model is the parallel random access machines (PRAM) that are used.[25] However, the classical PRAM model assumes synchronous access to the shared memory.
- Shared-memory programs can be extended to distributed systems if the underlying operating system encapsulates the communication between nodes and virtually unifies the memory across all individual systems.
- A model that is closer to the behavior of real-world multiprocessor machines and takes into account the use of machine instructions, such as Compare-and-swap (CAS), is that of asynchronous shared memory. There is a wide body of work on this model, a summary of which can be found in the literature.[26][27]
- Parallel algorithms in message-passing model
- The algorithm designer chooses the structure of the network, as well as the program executed by each computer.
- Models such as Boolean circuits and sorting networks are used.[28] A Boolean circuit can be seen as a computer network: each gate is a computer that runs an extremely simple computer program. Similarly, a sorting network can be seen as a computer network: each comparator is a computer.
- Distributed algorithms in message-passing model
- The algorithm designer only chooses the computer program. All computers run the same program. The system must work correctly regardless of the structure of the network.
- A commonly used model is a graph with one finite-state machine per node.
In the case of distributed algorithms, computational problems are typically related to graphs. Often the graph that describes the structure of the computer network is the problem instance. This is illustrated in the following example.
An example
Consider the computational problem of finding a coloring of a given graph G. Different fields might take the following approaches:
- Centralized algorithms
- The graph G is encoded as a string, and the string is given as input to a computer. The computer program finds a coloring of the graph, encodes the coloring as a string, and outputs the result.
- Parallel algorithms
- Again, the graph G is encoded as a string. However, multiple computers can access the same string in parallel. Each computer might focus on one part of the graph and produce a coloring for that part.
- The main focus is on high-performance computation that exploits the processing power of multiple computers in parallel.
- Distributed algorithms
- The graph G is the structure of the computer network. There is one computer for each node of G and one communication link for each edge of G. Initially, each computer only knows about its immediate neighbors in the graph G; the computers must exchange messages with each other to discover more about the structure of G. Each computer must produce its own color as output.
- The main focus is on coordinating the operation of an arbitrary distributed system.
While the field of parallel algorithms has a different focus than the field of distributed algorithms, there is a lot of interaction between the two fields. For example, the Cole–Vishkin algorithm for graph coloring[29] was originally presented as a parallel algorithm, but the same technique can also be used directly as a distributed algorithm.
Moreover, a parallel algorithm can be implemented either in a parallel system (using shared memory) or in a distributed system (using message passing).[30] The traditional boundary between parallel and distributed algorithms (choose a suitable network vs. run in any given network) does not lie in the same place as the boundary between parallel and distributed systems (shared memory vs. message passing).
Complexity measures
In parallel algorithms, yet another resource in addition to time and space is the number of computers. Indeed, often there is a trade-off between the running time and the number of computers: the problem can be solved faster if there are more computers running in parallel (see speedup). If a decision problem can be solved in polylogarithmic time by using a polynomial number of processors, then the problem is said to be in the class NC.[31] The class NC can be defined equally well by using the PRAM formalism or Boolean circuits – PRAM machines can simulate Boolean circuits efficiently and vice versa.[32]
In the analysis of distributed algorithms, more attention is usually paid on communication operations than computational steps. Perhaps the simplest model of distributed computing is a synchronous system where all nodes operate in a lockstep fashion. During each communication round, all nodes in parallel (1) receive the latest messages from their neighbours, (2) perform arbitrary local computation, and (3) send new messages to their neighbours. In such systems, a central complexity measure is the number of synchronous communication rounds required to complete the task.[33]
This complexity measure is closely related to the diameter of the network. Let D be the diameter of the network. On the one hand, any computable problem can be solved trivially in a synchronous distributed system in approximately 2D communication rounds: simply gather all information in one location (D rounds), solve the problem, and inform each node about the solution (D rounds).
On the other hand, if the running time of the algorithm is much smaller than D communication rounds, then the nodes in the network must produce their output without having the possibility to obtain information about distant parts of the network. In other words, the nodes must make globally consistent decisions based on information that is available in their local neighbourhood. Many distributed algorithms are known with the running time much smaller than D rounds, and understanding which problems can be solved by such algorithms is one of the central research questions of the field.[34]
Other commonly used measures are the total number of bits transmitted in the network (cf. communication complexity).
Other problems
Traditional computational problems take the perspective that we ask a question, a computer (or a distributed system) processes the question for a while, and then produces an answer and stops. However, there are also problems where we do not want the system to ever stop. Examples of such problems include the dining philosophers problem and other similar mutual exclusion problems. In these problems, the distributed system is supposed to continuously coordinate the use of shared resources so that no conflicts or deadlocks occur.
There are also fundamental challenges that are unique to distributed computing. The first example is challenges that are related to fault-tolerance. Examples of related problems include consensus problems,[35] Byzantine fault tolerance,[36] and self-stabilisation.[37]
A lot of research is also focused on understanding the asynchronous nature of distributed systems:
- Synchronizers can be used to run synchronous algorithms in asynchronous systems.[38]
- Logical clocks provide a causal happened-before ordering of events.[39]
- Clock synchronization algorithms provide globally consistent physical time stamps.[40]
Properties of distributed systems
So far the focus has been on designing a distributed system that solves a given problem. A complementary research problem is studying the properties of a given distributed system.
The halting problem is an analogous example from the field of centralised computation: we are given a computer program and the task is to decide whether it halts or runs forever. The halting problem is undecidable in the general case, and naturally understanding the behaviour of a computer network is at least as hard as understanding the behaviour of one computer.
However, there are many interesting special cases that are decidable. In particular, it is possible to reason about the behaviour of a network of finite-state machines. One example is telling whether a given network of interacting (asynchronous and non-deterministic) finite-state machines can reach a deadlock. This problem is PSPACE-complete,[41] i.e., it is decidable, but it is not likely that there is an efficient (centralised, parallel or distributed) algorithm that solves the problem in the case of large networks.
Coordinator election
Coordinator election (sometimes called leader election) is the process of designating a single
The network nodes communicate among themselves in order to decide which of them will get into the "coordinator" state. For that, they need some method in order to break the symmetry among them. For example, if each node has unique and comparable identities, then the nodes can compare their identities, and decide that the node with the highest identity is the coordinator.
The definition of this problem is often attributed to LeLann, who formalized it as a method to create a new token in a token ring network in which the token has been lost.
Coordinator election algorithms are designed to be economical in terms of total bytes transmitted, and time. The algorithm suggested by Gallager, Humblet, and Spira [42] for general undirected graphs has had a strong impact on the design of distributed algorithms in general, and won the Dijkstra Prize for an influential paper in distributed computing.
Many other algorithms were suggested for different kind of network graphs, such as undirected rings, unidirectional rings, complete graphs, grids, directed Euler graphs, and others. A general method that decouples the issue of the graph family from the design of the coordinator election algorithm was suggested by Korach, Kutten, and Moran.[43]
In order to perform coordination, distributed systems employ the concept of coordinators. The coordinator election problem is to choose a process from among a group of processes on different processors in a distributed system to act as the central coordinator. Several central coordinator election algorithms exist.[44]
Bully algorithm
When using the Bully algorithm, any process sends a message to the current coordinator. If there is no response within a given time limit, the process tries to elect itself as leader.
Chang and Roberts algorithm
The Chang and Roberts algorithm (or "Ring Algorithm") is a ring-based election algorithm used to find a process with the largest unique identification number .
Various hardware and software architectures are used for distributed computing. At a lower level, it is necessary to interconnect multiple CPUs with some sort of network, regardless of whether that network is printed onto a circuit board or made up of loosely coupled devices and cables. At a higher level, it is necessary to interconnect processes running on those CPUs with some sort of communication system.
Distributed programming typically falls into one of several basic architectures or categories: client–server, 3-tier architecture, n-tier architecture, distributed objects, loose coupling, or tight coupling.
- Client–server: Smart client code contacts the server for data then formats and displays it to the user. Input at the client is committed back to the server when it represents a permanent change.
- 3-tier architecture: Three tier systems move the client intelligence to a middle tier so that stateless clients can be used. This simplifies application deployment. Most web applications are 3-Tier.
- n-tier architecture: n-tier refers typically to web applications which further forward their requests to other enterprise services. This type of application is the one most responsible for the success of application servers.
- highly coupled (clustered): refers typically to a cluster of machines that closely work together, running a shared process in parallel. The task is subdivided in parts that are made individually by each one and then put back together to make the final result.
- Peer-to-peer: an architecture where there is no special machine or machines that provide a service or manage the network resources. Instead all responsibilities are uniformly divided among all machines, known as peers. Peers can serve both as clients and servers.
- Space based: refers to an infrastructure that creates the illusion (virtualization) of one single address-space. Data are transparently replicated according to application needs. Decoupling in time, space and reference is achieved.
Another basic aspect of distributed computing architecture is the method of communicating and coordinating work among concurrent processes. Through various message passing protocols, processes may communicate directly with one another, typically in a master/slave relationship. Alternatively, a "database-centric" architecture can enable distributed computing to be done without any form of direct inter-process communication, by utilizing a shared database.[45]
See also
- AppScale
- Code mobility
- Decentralized computing
- Distributed algorithmic mechanism design
- Distributed cache
- Distributed operating system
- Edsger W. Dijkstra Prize in Distributed Computing
- Folding@home
- Inferno
- Jungle computing
- Layered queueing network
- Library Oriented Architecture - LOA
- List of distributed computing conferences
- List of important publications in concurrent, parallel, and distributed computing
- Parallel distributed processing
- Parallel programming model
- Plan 9 from Bell Labs
- ^ a b
- ^ Andrews (2000). Dolev (2000). Ghosh (2007), p. 10.
- ^ Godfrey (2002).
- ^ a b Andrews (2000), p. 291–292. Dolev (2000), p. 5.
- ^ Lynch (1996), p. 1.
- ^ a b Ghosh (2007), p. 10.
- ^ Andrews (2000), p. 8–9, 291. Dolev (2000), p. 5. Ghosh (2007), p. 3. Lynch (1996), p. xix, 1. Peleg (2000), p. xv.
- ^ Andrews (2000), p. 291. Ghosh (2007), p. 3. Peleg (2000), p. 4.
- ^ Ghosh (2007), p. 3–4. Peleg (2000), p. 1.
- ^ Ghosh (2007), p. 4. Peleg (2000), p. 2.
- ^ Ghosh (2007), p. 4, 8. Lynch (1996), p. 2–3. Peleg (2000), p. 4.
- ^ Lynch (1996), p. 2. Peleg (2000), p. 1.
- ^ Ghosh (2007), p. 7. Lynch (1996), p. xix, 2. Peleg (2000), p. 4.
- ^ Ghosh (2007), p. 10. Keidar (2008).
- ^ Lynch (1996), p. xix, 1–2. Peleg (2000), p. 1.
- ^ Peleg (2000), p. 1.
- ^ Papadimitriou (1994), Chapter 15. Keidar (2008).
- ^ See references in Introduction.
- ^ Andrews (2000), p. 348.
- ^ Andrews (2000), p. 32.
- ^ Peter (2004), The history of email.
- ^ Elmasri & Navathe (2000), Section 24.1.2.
- ^
- ^ Andrews (2000), p. 10–11. Ghosh (2007), p. 4–6. Lynch (1996), p. xix, 1. Peleg (2000), p. xv. Elmasri & Navathe (2000), Section 24.
- ^ Cormen, Leiserson & Rivest (1990), Section 30.
- ^ Herlihy & Shavit (2008), Chapters 2-6.
- ^ Lynch (1996)
- ^ Cormen, Leiserson & Rivest (1990), Sections 28 and 29.
- ^ Cole & Vishkin (1986). Cormen, Leiserson & Rivest (1990), Section 30.5.
- ^ Andrews (2000), p. ix.
- ^ Arora & Barak (2009), Section 6.7. Papadimitriou (1994), Section 15.3.
- ^ Papadimitriou (1994), Section 15.2.
- ^ Lynch (1996), p. 17–23.
- ^ Peleg (2000), Sections 2.3 and 7. Linial (1992). Naor & Stockmeyer (1995).
- ^ Lynch (1996), Sections 5–7. Ghosh (2007), Chapter 13.
- ^ Lynch (1996), p. 99–102. Ghosh (2007), p. 192–193.
- ^ Dolev (2000). Ghosh (2007), Chapter 17.
- ^ Lynch (1996), Section 16. Peleg (2000), Section 6.
- ^ Lynch (1996), Section 18. Ghosh (2007), Sections 6.2–6.3.
- ^ Ghosh (2007), Section 6.4.
- ^ Papadimitriou (1994), Section 19.3.
- ^
- ^
- ^
- ^
- Books
- .
- .
- .
- .
- .
- .
- .
- .
- .
- .
- Articles
- .
- .
- .
- .
- Web sites
Further reading
- Books
- : Java Distributed Computing by Jim Faber, 1998
- Articles
- .
- Conference Papers
- C. Rodríguez, M. Villagra and B. Barán, Asynchronous team algorithms for Boolean Satisfiability, Bionetics2007, pp. 66–69, 2007.
External links


text:
Historic Meet Attracts World-Class Athletes
NEW HAVEN, Conn. – Several members of the Yale men's track and field team have earned the right to represent the university in competition at the fabled Penn Relays, which begin on Thursday. The meet is the oldest track and field competition in the United States, running continuously since 1895. Over the course of three days, cumulative attendance regularly exceeds 100,000 spectators and the meet features some of the best athletes in the world.
The Bulldogs will send their 4x200-meter, 4x400-meter and distance medley relay teams along with three individuals to Philadelphia. The Elis have competed in neither the 4x200-meter relay nor the distance medley relay this year outdoors, but have selected a strong group of runners for both races.
Senior captain Matthew Bieszard, who two weeks ago ran a personal record of 47.98 in the 400-meter run, will anchor both the 4x200-meter and All-East 4x400-meter relay teams. Joining him in the shorter race will be the other members of the Yale 4x100-meter relay team that strung together its best performance of the season last weekend: freshman Dylan Hurley and sophomores Daniel Jones and Nnamdi Udeh. In the latter event, Bieszard will be accompanied by the regular crew of Hurley, freshman Mario Kranjac and freshman William Rowe. That team placed second at the IC4A Indoor Championships and has run a time of 3:14.06.
Rowe will also run the 400-meter run as a member of the distance medley team, along with a trio of middle distance aces. Sophomore half-miler James Shirvell returned from injury only a couple of weeks ago, but proved that he has not lost a step by posting a time of 1:52.69 in the 800-meter run last weekend. Meanwhile, freshman John McGowan will represent the Elis in the 1200-meter component of the race, a distance he has not yet run this year. Based on his performance in the 1500-meter run, in which he has improved in every single outing this year, he should be able to have the Bulldogs in a strong position heading into the anchor leg, which will be run by junior Timothy Hillas. Hillas cut more than five seconds off of his personal best last weekend to qualify for IC4As in the 1500-meter run with a time of 3:48.12.
In addition to its relay teams, three Elis will compete individually. Junior Mike Levine threw his personal record of 54.41m in the discus at the Penn Relays as a freshman to take third place. To reach the podium this year, he will have to exceed his current season-best of 51.78m, and he clearly has the potential to do so.
Senior Nathan Richards has also qualified in the 3000-meter steeplechase, an event for which he went to NCAA Regionals last year. Richards' best time this year (9:05.08) is not far off from the time that took him to that destination last year (8:54.15), and he will be looking to punch his return ticket this weekend against some of the strongest competition he will face all year.
Finally, sophomore Paul Chandler will compete in the pole vault, entering with a best leap of 4.65m.
Also on the docket this weekend is the Yale Springtime Invitational, for which the Bulldogs will rest many of its premier runners, allowing an opportunity for its underclassmen and graduating seniors to shine in the final home meet of the season. In particular, many Yale runners who have not raced much this season will get a chance in the middle distance and distance runners. Sophomore John Cocco, senior Conor Dooney, freshman Michael Grace and senior Julian Sheinbaum will all run the 800-meter run; freshman Tom Harrison, senior Jake McKenzie, freshman Matt Nussbaum and Sheinbaum will race in the 1500-meter run; sophomore Michele Gama Sosa, Harrison and senior Samuel Lynch will all try the 5000-meter run for the first time this season.
Freshman Daniel Kemp will compete in the 110-meter high hurdles, but most of Yale's other sprinters and hurdlers are questionable depending on how they feel after Penn Relays.
Junior Mark Kaczor and sophomore Stefan Palios will compete in both the shot put and discus throw, and Palios will also compete in the hammer throw. Rounding out the field events will be sophomore Clifford Van Meter in the javelin throw, Chandler in the pole vault, and junior Tommy Winger in the long jump.
With the exception of Richards (who will race on Thursday night at 7:30 p.m.), the all Elis competing in the Penn Relays will compete on Friday, beginning with the discus at 1:30 p.m. and ending with the 4x400-meter relay at 5:15 p.m. Results will be available afterwards at www.thepennrelays.com and at www.yalebulldogs.com. The Yale Springtime Invitational will be on Saturday, with running events beginning at 11:00 a.m. Meet information and a full schedule of events is available here and results will be available afterwards on www.yalebulldogs.com.
Report by Eian Katz '13, Yale Sports Publicity


text:
La Toya Jackson and Debbie Rowe showed up at an L.A. hospital Wednesday night to spend time with Paris Jackson.
We're told Debbie was inconsolable after she learned her biological daughter took a meat cleaver to her arm and downed a bunch of Motrin in what authorities called a suicide attempt.
In addition to Debbie and La Toya, Katherine Jackson was also present.
Paris is going to be physically ok, but as we first reported, she's currently being held on a 5150 -- a 72-hour psychiatric hold -- so professionals can attempt to get to the bottom of her troubles.


text:
On WBS, when the end date of the task is changed, edited 'Unit cost price' and 'Unit sales price' on the 'Details' page reverts backs to the old defaulted price.
The changes in the hotfix considers the updated unit cost price and updated unit sales price by avoiding the deletion of estimates.
More information
Note This is a "FAST PUBLISH" article created directly from within the Microsoft support organization. The information contained here in is provided as-is in response to emerging issues. As a result of the speed in making it available, the materials may include typographical errors and may be revised at any time without notice. See Terms of Use for other considerations.


text:
Tuesday, February 23, 2010
Spicy Black Bean & Sweet Potato Soup
It's a warm sunny day here on Costa del Sol after days and days of wet, dark, stormy days and floods. In fact, it's like Swedish summer. It's one of those breezy days filled with sunlight. There are yellow flowers blooming in the verdant fields and the sky above you is a perfect shade of blue. It's one of those nearly perfect days when you can simply enjoy the weather and be happy that you are in this place and have the time to take a walk.
It's perhaps not the ideal weather for a piping hot bowl of spicy soup, but since I already had some black beans soaking in some water in a bowl, I thought I'd go ahead and make soup anyway.
Some people like their soups devoid of texture or fiber and always use a blender and sieve, and although I do use the blender from time to time (depending on the soup), I prefer a chunky wholesome soup where the ingredients have managed to retain some semblance of their former glory.
If you're vegetarian or freaked out by bouillon cubes, just omit the beef bouillon and I'm sure it will still be fine. If you or someone in your family is freaked out by texture, you can also put the soup through the blender before serving it. Remember to remove the bay leaves and dried chilies if you're blending it, and if you are afraid that 2 chilies might be too much, use 1 chili. Well, you know the drill?
Spicy Black Bean & Sweet Potato Soup
2 Cups Black Beans (soaked overnight and cooked for 1 hour or until soft)
1 Large Sweet Potato (peeled and diced)
1 Medium Potato (peeled and diced)
4 Medium Tomatoes (diced)
1/4 Onion (chopped finely)
2 Cloves Garlic (chopped finely)
2 Bay Leaves
1 Tsp Cumin Seeds
1 Tsp Coriander Powder
Pinch Nutmeg
2 Whole Red Chilies (Dried or Fresh - Seeded)
1 Tsp Smoked Paprika Powder
2 Tbsp Extra Virgin Olive Oil
Whipped Cream (1 spoonful on top of each serving)
Fresh Cilantro (chopped and sprinkled on top, a sprig for garnishing or none if you hate it!)
1 Beef Bouillon Cube*
Salt & Black Pepper (to taste)
Whipped Cream (unsweetened)
*Optional. I used half a cube.
Step 1: Heat up the oil in your soup pot and when the oil is hot enough throw in the cumin seeds and let them pop a bit before putting in the garlic and onion. Sautee a bit and then add the rest of the spices to help them release their aroma.
Step 2: Put in the rest of the ingredients and blend them with the oil and spice mixture well first, and then add the tomatoes.
Step 3: Add enough water to cover the ingredients and lower the heat to simmer it for 1 hour. Add the bay leaves and beef bouillon if you wish.
Step 4: After around 60 minutes taste the soup and add salt & black pepper to taste.
Step 5: Serve with a dollop of whipped unsweetened cream on top and enjoy!
7 comments:
- Elra said...
Down to earth meal, healthy and lots of fiber. This really delicious too.
- February 24, 2010 at 3:14 AM
- Anncoo said...
Thanks for sharing this healthy meal. Looks beautiful.
- February 24, 2010 at 3:04 PM
- Soma said...
I absolutely love this combination. I had done a pumpkin and black bean, and a spicy one (not a soup) and loved it.. yours sounds so close to that. Beautiful!
- February 26, 2010 at 4:56 AM
- Dorte said...
I don´t mind eating soup in nice weather :)
Looks like a soup I would like ... love all the ingredients!
- February 26, 2010 at 6:07 PM
- Taste of Beirut said...
Great soup! I like the chunkiness and mixing the wo types of potatoes!
- February 27, 2010 at 11:57 PM
- Lori said...
Black bean and sweet potato is such a rockin combination! And of course you know me- I love my beans.
- March 1, 2010 at 5:12 PM
- Trish said...
Grin...oh my husband would be glad of a soup like this...I blend the smithereens out of everything and he does not like the 'pablum' effect. Lovely spices. Yummers!
- March 8, 2010 at 1:49 AM


text:
Puppy Linux Discussion Forum
Puppy HOME page :
"THE" alternative forum :
Log in to check your private messages
Log in
The time now is Mon 18 Feb 2019, 20:23
All times are UTC - 4
Forum index
Off-Topic Area
A compressed Puppy SAVE file?
View previous topic
View next topic
Page 1 of 1
[13 Posts]
Joined: 08 Jun 2005
Posts: 5087
Location: Arizona, U.S.A.
Posted: Sat 08 Sep 2012, 23:09
Post subject:
A compressed Puppy SAVE file?
There`s many advantages to Puppy`s Save file being compressed.
It would take less space on the media, and in ram ( usb install ).
It also allows faster file access, and faster save/restore ( usb install ).
Btrfs is the Ext4 FS replacement, and will become the new Linux FS.
e2compr is light and fast, and maybe better suited for a Save file.
Both do on-the-fly transparent compression of the FS.
Both require compiling a new kernel and some of the FS tools.
I`ve never succeeded at compiling a kernel, and it`s far too critical.
# If anyone with experience is willing, it seems to be a worthy task...
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Sun 09 Sep 2012, 00:03
Post subject:
Linux/i386 3.4.0 Kernel Configuration :
Symbol: BTRFS_FS [=n]
Type : tristate
Prompt: Btrfs filesystem (EXPERIMENTAL) Unstable disk format
Depends on: BLOCK [=y] && EXPERIMENTAL [=y]
Selects: LIBCRC32C [=n] && ZLIB_INFLATE [=y] && ZLIB_DEFLATE [=n] && LZO_COMPRESS [=y] && LZO_DECOMPRESS [=y]
Symbol: BTRFS_FS_CHECK_INTEGRITY [=n]
Prompt: Btrfs with integrity check tool compiled in (DANGEROUS)
I the beginning i did not choose btrfs, guess because of these statements .
Worth to read about kernel-2.6.30 btrfs version compatibility threshold :
And about compression since kernel-2.6.38 :
Some tables :
I am thinking of compiling a new kernel since the last had been in
2.6.39-KRG-i486-cp-DELL running .. HURRAY
(4 posts) (3 voices)
Started 8 months ago by Karl Godt
And since i have a Core2Duo as -iXeon .
Back to top
Bruce B
Joined: 18 May 2005
Posts: 11488
Location: The Peoples Republic of California
Posted: Sun 09 Sep 2012, 02:00
Post subject:
You have the kernel software available and the config file.
Maybe you only need to make one or two additions.
The hard part is getting a good set of instructions and following them.
There are some instructionals on the Internet and Barry has one, I don't know if it is current, you can check.
I say
compile the kernel
. If we never hear from you again, we can figure things didn't go well.
Puppy Linux Links Page
Back to top
Joined: 08 Jul 2009
Posts: 5485
Location: Finland
Posted: Sun 09 Sep 2012, 05:05
Post subject:
Kernel compiling has never before been this easy. Read the instructions. Edit build.conf file. Launch ./build.sh script. Choose ready DOTconfig as template. There are several to choose from. Use terminal gui editor with tickable choices to add that btrfs and possible dependent choices as Karl Godt cut showed. Called make menuconfig. It is ncurses based terminal gui. Just choose number one while executing the ./build.sh script.
Let the script do the job. You get kernel in one folder, dir2pet it to the kernel pet. An other folder called kernel_headers. Dir2pet it. And kernel source sfs has been created already. Done.
Then you need to switch the kernel of course. I use woof2 for that. I create new puppy with that new kernel. Has been easiest for me.
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Sun 09 Sep 2012, 08:12
Post subject:
I say compile the kernel. If we never hear from you again, we can figure things didn't go well.
make ARCH=x64_64 menuconfig
makes now the kernel while i just wanted to create a second dotConfig
My reboot problems with recent kernels seems to be related to the fact that the menuconfig autoselects "CONFIG_X86_REBOOTFIXUPS=y" if "ARCH=x86 (_32)" .
grep -i 'not set' .config >not_set
bash-3.2# wc -l not_set
618 not_set
bash-3.2# wc -l .config
6850 .config
Guess 2hrs from now will make finish . Will try to create a simple install script that i buried sometime somewhere . AUFS is missing . Also a 3.4.X-version patch .
Xz compression for kernel , Server and 1000 Hz . Also enabled nearly everything related to boot into kernel even flash nand devices, scsi, ide, tape, raid so i don't have to add drivers to the initrd.gz .
Let 's look if the kernel becomes less then 5MB .
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Sun 09 Sep 2012, 09:23
Post subject:
Nope, seems problems with at least one driver :
So 9. Sep 14:37:07 GMT+1 2012
as68k: Kommando nicht gefunden.
make.bin[3]: *** [drivers/net/wan/wanxlfw.inc] Error 127
driver as command ? looks like some makefile syntax problem .
Also my make wrapper script to doublequote everything beyond = let make complain :
So 9. Sep 13:48:27 GMT+1 2012 ARCH=x86_64 menuconfig
Makefile:484: /root/Downloads/KERNEL/linux-3.4/arch/
/Makefile: No such file or directory
make.bin: *** No rule to make target `/root/Downloads/KERNEL/linux-3.4/arch/"x86_64"/Makefile'. Stop.
and for _64 bit i need recent binutils it seems :
/root/Downloads/KERNEL/linux-3.4/arch/x86/Makefile:96: CONFIG_X86_X32 enabled but no binutils support
You will need a recent binutils (2.22 or later) with
elf32_x86_64 support enabled to compile a kernel with
bash-3.2# objcopy --version
GNU objcopy (Linux/GNU Binutils) 22.214.171.124.2.20071001
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Sun 09 Sep 2012, 12:30
Post subject:
make finished with '0' ; modpost WARNING: modpost: Found 20 section mismatch(es) : sometimes i had only one and sometimes more than 50 for a kernel compile . Average . The driver error related to missing assembler binary as68k which seems to compile if binutils are compiled for Motorola target . First thought as68 would be a typo cos i have as86 installed :
Allows you to rebuild firmware run by the QUICC processor.
It requires as68k, ld68k and hexdump programs.
You should never need this option, say N.
Have also applied the .9 version patch now .
And at least the Makefile did not like busybox xz cos too few -options :
xz: unrecognized option `--check=crc32'
BusyBox v1.18.3 (2011-05-01 19:45:13 CEST) multi-call binary.
Usage: xz -d [-cf] [FILE]...
Decompress FILE (or stdin)
-d Decompress
-c Write to stdout
-f Force
arch/x86/boot/compressed/vmlinux.bin.xz: No such file or directory
gcc: arch/x86/boot/compressed/piggy.S: No such file or directory
gcc: no input files
make.bin[2]: *** [arch/x86/boot/compressed/piggy.o] Error 1
make.bin[1]: *** [arch/x86/boot/compressed/vmlinux] Error 2
make.bin: *** [bzImage] Error 2
So 9. Sep 18:00:42 GMT+1 2012
Setup is 15168 bytes (padded to 15360 bytes).
System is 8244 kB
CRC f3be5482
WARNING: modpost: Found 20 section mismatch(es).
To see full details build your kernel with:
'make CONFIG_DEBUG_SECTION_MISMATCH=y'
Did not set
Enabling this option will pass "-Os" instead of "-O2" to gcc
resulting in a smaller kernel.
Symbol: CC_OPTIMIZE_FOR_SIZE [=n]
Next time with aufs added will set it, aufs driver is not so big :
Back to top
Joined: 08 Jun 2005
Posts: 5087
Location: Arizona, U.S.A.
Posted: Sun 09 Sep 2012, 19:01
Post subject:
I knew this would get a response, I`m glad there`s interest.
Karl; The LWN article was 3 years old, the wiki page was up to date..
Web pages should have to be dated by law.
Looking at your posts, it`s like one of my worst jobs piecing an app. together.
Endless chasing of details and finding parts that might actually work.
Most of the dialog is unfamiliar to me, I wouldn`t know where to start.
Btrfs will become the new Linux FS, so using it`s forward looking.
But may not be stable enough, and it may be overkill for a Save file.
e2compr might be in keeping with Puppy`s motto of fast and small.
I figure there`s folks that are already setup for building a Puppy kernel.
Folks that know the tools and the build scripts from repeated use.
BruceB; I like your optimism...
But I know it`s hard for an experienced person to get it right (ie: Karl).
I`d be starting from scratch for the files and tools, and knowledge.
To integrate it into Puppy as an option, then it has to be done right.
pemasu; I assume a different kernel is needed for each Puppy type.
I hadn`t even thought about building a new Puppy around the kernel.
I figured to use one Puppy variant as a test bed, "Perfect" is good.
I got the kit you posted, now to begin reading and reading.
Back to top
Joined: 08 Jul 2009
Posts: 5485
Location: Finland
Posted: Mon 10 Sep 2012, 01:19
Post subject:
You need to compile kernel using devx sfs of that Puppy. Used gcc version needs to be same for compiling kernel and when using the puppy. Otherwise extra third party kernel module drivers compile might fail.
Besides that. Those included DOTconfigs are all tested to work. Using Dotconfig from Puppy version you are going to use is safest pet. But all of the included ones have been used for compiling working Puppy kernel.
I know that there are guidelines in this forum to switch the kernel by remastering or by unsquashing, I dont know which way..... I havent tested that. James C frequently has posted about his experiments with kernel switching.
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Mon 10 Sep 2012, 06:59
Post subject:
More news : Grub says 'Staring up ...' and the kernel says it is ' edd ' ing , also vga=ask works and than the kernel waits forever for something .
Recompile with a working dotConfig now with USB into kernel, more drivers, less debug : same symptoms .
There are actually several new features while make install regarding lilo+boot which had been always some sort of warning but now things error :
* Fatal: Cannot open: /etc/lilo.conf
* Warning: LBA32 addressing assumed
* Warning: Partition 3 on /dev/sda is not marked Active.
* Fatal: No images have been defined.
* Warning: LBA32 addressing assumed
* Fatal: Can't put the boot sector on logical partition 0xC0010300
which i went around by
make -i install
Few things to remember :
* BLK_DEV_LOOP_MIN_COUNT seems to be newish and is set to 8 by default .
* CONFIG_BLK_DEV_RAM_SIZE is currently set to some 16384 by BK (Macpup-529/Precise-5.2.60) though i had read on his block that it would be
Posted on 17 Jul 2012, 7:57 by BarryK
Re advanced /sbin/init
K Godt,
My init script now checks the size of the ramdisk and requires >= 20000 KB.
I like your extra logic to look at filesystem check interval.
In the whiletime i have compiled binutils-2.22 as
./configure --build=x86_64-pc-linux-gnu
and this gives me a objcopy with :
supported targets: elf64-x86-64 elf32-i386
a.out-i386-linux pei-i386 pei-x86-64 elf64-l1om elf64-k1om elf64-little elf64-big elf32-little elf32-big srec symbolsrec verilog tekhex binary ihex
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Tue 11 Sep 2012, 06:52
Post subject:
bash-3.2# uname -a
Linux puppypc 3.4.9-KRG-iCore2-64gb #1 SMP Mon Sep 10 19:19:24 GMT+1 2012 i686 GNU/Linux
Finally up and running .
Then dl
source . Did not apply the debian patch , nor looked into it .
Compiled fine, simply make && make install . Installs by default all bins into /usr/local/bin . No bins into some */sbin .
mkfs.btrfs /dev/ram5
WARNING! - Btrfs Btrfs v0.19 IS EXPERIMENTAL
WARNING! - see http://btrfs.wiki.kernel.org before using
SMALL VOLUME: forcing mixed metadata/data groups
Created a data/metadata chunk of size 3342336
fs created label (null) on /dev/ram5
nodesize 4096 leafsize 4096 sectorsize 4096 size 32.00MB
Btrfs Btrfs v0.19
mkdir /mnt/ram5
lsmod | grep btrfs
modinfo btrfs
filename: /lib/modules/3.4.9-KRG-iCore2-64gb/kernel/fs/btrfs/btrfs.ko
license: GPL
alias: devname:btrfs-control
alias: char-major-10-234
depends: libcrc32c
intree: Y
vermagic: 3.4.9-KRG-iCore2-64gb SMP mod_unload CORE2
mount -t btrfs /dev/ram5 /mnt/ram5
lsmod | grep btrfs
btrfs 567896 1
libcrc32c 758 1 btrfs
mount | grep btrfs
"/dev/ram5" on "/mnt/ram5" type "btrfs" (rw,relatime,space_cache)
echo "HiAll RAM" >/mnt/ram5/Welcomest.text
cat !$
cat /mnt/ram5/Welcomest.text
HiAll RAM
df /mnt/ram5
Filesystem 1K-blocks Used Available Use% Mounted on
/dev/ram5 32768 28 28656 1% /mnt/ram5
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Tue 11 Sep 2012, 07:33
Post subject:
And one thing had delayed everything while compiling the kernel :
# CONFIG_PSS_HAVE_BOOT is not set
In the " OSS sound modules " section there is the menu choice :
* [ ] Have DSPxxx.LD firmware file
and the Help shows
* If you have the DSPxxx.LD file or SYNTH.LD file for you card, say Y
* to include this file. Without this file the synth device (OPL) may
* not work.
When i checked it, a sub-menu is shown :
* (/etc/sound/dsp001.ld) Full pathname of DSPxxx.LD firmware file (NEW)
I did not have this file but choose the default .
That led to compile error :
make.bin[2]: *** No rule to make target `/etc/sound/dsp001.ld', needed by `sound/oss/pss_boot.h'. Stop.
The file sound/oss/pss_boot.h gets temporarily created from a Makefile and deleted again . Took me some time to figure things :
* /root/Downloads/KERNEL/linux-3.4/Documentation/sound/oss/PSS
* The PSS cards and other ECHO based cards provide an onboard DSP with
* downloadable programs and also has an AD1848 "Microsoft Sound System"
* device. The PSS driver enables MSS and MPU401 modes of the card. SB
* is not enabled since it doesn't work concurrently with MSS.
* CONFIG_SOUND_MSS=m
linux-3.4/sound/oss/Kconfig wrote:
config SOUND_MSS
tristate "Microsoft Sound System support"
Again think carefully before answering Y to this question. It's
safe to answer Y if you have the original Windows Sound System card
made by Microsoft or Aztech SG 16 Pro (or NX16 Pro). Also you may
say Y in case your card is NOT among these:
ATI Stereo F/X, AdLib, Audio Excell DSP16, Cardinal DSP16,
Ensoniq SoundScape (and compatibles made by Reveal and Spea),
Gravis Ultrasound, Gravis Ultrasound ACE, Gravis Ultrasound Max,
Gravis Ultrasound with 16 bit option, Logitech Sound Man 16,
Logitech SoundMan Games, Logitech SoundMan Wave, MAD16 Pro (OPTi
82C929), Media Vision Jazz16, MediaTriX AudioTriX Pro, Microsoft
Windows Sound System (MSS/WSS), Mozart (OAK OTI-601), Orchid
SW32, Personal Sound System (PSS), Pro Audio Spectrum 16, Pro
Audio Studio 16, Pro Sonic 16, Roland MPU-401 MIDI interface,
Sound Blaster 1.0, Sound Blaster 16, Sound Blaster 16ASP, Sound
Blaster 2.0, Sound Blaster AWE32, Sound Blaster Pro, TI TM4000M
notebook, ThunderBoard, Turtle Beach Tropez, Yamaha FM
synthesizers (OPL2, OPL3 and OPL4), 6850 UART MIDI Interface.
For cards having native support in VoxWare, consult the card
specific instructions in <file:Documentation/sound/oss/README.OSS>.
Some drivers have their own MSS support and saying Y to this option
will cause a conflict.
If you compile the driver into the kernel, you have to add
"ad1848=<io>,<irq>,<dma>,<dma2>[,<type>]" to the kernel command
I don't have any Windows installation disks with drivers to use for '/etc/sound/dsp001.ld' firmware file so it would not build if enabled .
But i could enable everything other OSS related as module with the intergrated =y .
Back to top
Karl Godt
Joined: 20 Jun 2010
Posts: 4208
Location: Kiel,Germany
Posted: Tue 11 Sep 2012, 08:09
Post subject:
And short : technosaurus new guess_fstype snapshot works for me on btrfs :
Back to top
Display posts from previous:
All Posts
1 Day
7 Days
2 Weeks
1 Month
3 Months
6 Months
1 Year
Sort by:
Post Time
Post Subject
Page 1 of 1
[13 Posts]
View previous topic
View next topic
Forum index
Off-Topic Area
Jump to:
Select a forum
Forum index
|___ House Training
| |___ Beginners Help ( Start Here)
| |___ Users ( For the regulars )
| | |___ Usuarios de habla Hispana
| | |___ Für deutschsprachige Anhänger
| | |___ Pour les francophones
| |
| |___ HOWTO ( Solutions )
| |___ Bugs ( Submit bugs )
|___ Advanced Topics
| |___ Additional Software (PETs, n' stuff)
| | |___ Package Collections / Repositories
| | |___ Browsers and Internet
| | |___ Business
| | |___ Compiling
| | |___ Desktop
| | |___ Documents
| | |___ Drivers
| | |___ Educational
| | |___ Engineering/Science/Simulation
| | |___ Eye Candy
| | |___ Filesystem
| | |___ Games
| | |___ Graphics
| | |___ Multimedia
| | |___ Network
| | |___ Security/Privacy
| | |___ System
| | |___ Utilities
| | |___ Virtualization
| | |___ Unsorted
| |
| |___ Cutting edge
| | |___ Multi-session live-CD/DVD
| |
| |___ Hardware
| | |___ Audio
| | |___ Networking
| | | |___ Dialup
| | | |___ Ethernet
| | | |___ Wireless
| | |
| | |___ Printers
| | |___ Video
| |
| |___ Puppy Derivatives
| |___ Puppy Projects
| |___ Next Puppy Development
| | |___ 4.x
| | | |___ Bugs (4.x dev)
| | | |___ Usability Issues (4.x dev)
| | |
| | |___ 5.x
| | |___ Bugs (5.x dev)
| | |___ Usability Issues (5.x dev)
| |
| |___ Localization Project
| |___ Documentation Project
|___ Taking the Puppy out for a walk
| |___ Announcements
| |___ Puppy Power
| |___ Suggestions
| |___ Misc
|___ Off-Topic Area
|___ Programming
|___ Security
post new topics in this forum
reply to topics in this forum
edit your posts in this forum
delete your posts in this forum
vote in polls in this forum
attach files in this forum
download files in this forum
Powered by
© 2001, 2005 phpBB Group
[ Time: 0.0594s ][ Queries: 12 (0.0104s) ][ GZIP on ]


text:
Chocoholics - overcome chocolate addiction now!
When it comes to chocolate addiction, chocoholics usually find the best of intentions get thrown out the window. No matter how hard you 'put your foot down', the chocolate usually finds some way to convince you to eat more.
So why is it that mere motivation or willpower is not enough?
Anybody who experiences cravings for any substance finds that simply trying not to eat it falls short of what is required to quit successfully.
This is because this 'decision' is made at a conscious level whereas the chocolate addiction is being driven unconsciously.
What you need is a boost to your unconscious determination so that the desire to remain free of chocolate addiction becomes stronger than the desire to eat chocolate.
Overcome Chocolate Addiction will help you gently re-educate your unconscious mind to give you more freedom to choose when it comes to chocolate.
Download it now and experience those cravings simply melt away...
Chocolate Addiction has been purchased by 655 customers.
Why you can relax about buying from Hypnosis Downloads...
Chocolate Addiction
Narrator: Mark Tyrrell
Length: 17:42
Download Size: 8.11 MB
Buy these together Chocolate AddictionImprove Impulse Control and save $6.95
(These products are specially selected to maximize your results from your hypnosis.)
Most popular sessions in Addiction Help
Why we're different to other self hypnosis programs:
We're experienced and dedicated therapist trainers
Uncommon Knowledge was formed in 1995, and since then we've trained over 24,000 people at face-to-face events. We've served over 600,000 hypnosis downloads and treated more than 5,000 patients in 1:1 therapy.
We have a vibrant and friendly global community
With more than 300,000 customers and 30,000 fans of our Facebook page, we are proud to serve people from countries as far afield as New Zealand, India, South Africa, as well as Europe, the US and Canada. (And our shipping is free worldwide, did you know?)


text:
Photo Flash: First Look at Velocity's BRIDGE PROJECT 2013, Now thru Feb 3
Born in Seattle, Elia Mrak returns after years of performing and choreographing in Western Europe, working with legendary Venezuelan dance artist David Zambrano, recently seen at The Walker. Mrak will develop his new work on four dancers, among them The YC's Erica Badgeley. Amy Johnson, a recent graduate of Cornish, is already developing a reputation for her solo work and collaborative "environmental sculptures" while Chris McCallister, who has collaborated with Collectif Entre Deux Mondes in France as part of Khambatta Dance Company, will work with a cast including City Arts Festival favorite Paris Hurley. Newcomer Britt Karhoff studied with San Francisco's esteemed Joe Goode Performance Group and has performed locally with zoe|juniper.
The Bridge Project Creative Residency showcases Velocity's fierce commitment to supporting new generations of dance artists. Each choreographer receives the creative, financial and administrative support they need to develop their work before it reaches the stage, with Choreographic Mentorship from celebrated dance artist Mark Haim.
Amy Johnson is a dancer, performer and choreographer residing in Seattle, WA. Her choreography has been performed at Velocity Dance Center's 2012 Fall Kick-Off, Stitch Movement Collective's Concert Series, Centerstage Theatre, and the Intiman Playhouse Studio. Amy also choreographs and works collaboratively with the interdisciplinary work of The Eternal Glow Project. She holds a BFA in Dance From Cornish College of the Arts.
Elia Mrak is a Watson Fellow who toured Western Europe as a member of David Zambrano's SHOCK (2009) and assisted Zambrano's workshops at ImPulsTanz (Vienna). He is a founder of 50collective, which has since toured in the US, Spain, Sweden, Argentina and Mexico. He now lives in Seattle where he creates, performs, and teaches.
Britt Karhoff, UCSB Dance B.F.A. 2006, creates site-specific work for non-dance spaces. Incorporating song and personal stories, her work responds to her own curiosity with the human experience. She has performed in San Francisco with Joe Goode Performance Group, Project Bandaloop, Flyaway Productions, Cielo Vertical Arts and locally with zoe | juniper.
Sacramento-born Chris McCallister studied at Cornish College of the Arts. Since his arrival in Seattle, he has danced for choreographers Deborah Wolf, KT Niehoff, Geoffrey Johnson, Bianca Cabrera, and Cyrus Khambatta of Khambatta Dance Company. His work has been produced by Seattle International Dance Festival's Art on the Fly, Cornish College of the Arts, Khambatta Dance Company, and Stitch Movement Collective, of which he is a founding member.
Joyce Liao is a Seattle-based dance artist interested in the relationship between movement, text, rhythm, emotions, and stories. Her work has been seen at On the Boards' 12 Minutes Max and she has performed in Seattle Center's The Next 50, Seattle International Dance Festival, On the Boards' Northwest New Works, and in the Seattle Art Museum Elles:sam "Women Take Over" reception. She is proud to be part of the 2013 Flower Season residency at Studio Current.
Mayor's Arts Award and Genius Award winning Velocity Dance Center is Seattle's forward-
thinking laboratory and essential incubator for dance and emerging ideas. With artist-driven,
community-centered artistic programs, Velocity is instrumental in making Seattle a destination
city with one of the most active dance communities in the nation. With artist-led classes and
workshops every day, performances every week, three annual dance festivals, ongoing humanities programs that activate thoughtful conversations, as well as weekly community events from social dances to family-style dinners, Velocity is a portal for those new to dance and an important community resource. Home to hundreds of independent dance artists and renowned for producing innovative, cutting-edge work, Velocity has featured performances and master classes by art stars Pat Graney, Reggie Watts, Miguel Gutierrez, Tere O'Conner, Anouk van Dijk, Deborah Hay, Faye Driscoll, 33 Fainting Spells, KT Niehoff, Zoe Scofield/Juniper Shuey, Danielle Agami and many more. Velocity is Seattle's only dedicated contemporary dance venue where groundbreaking work and disciplined practice coexist.
For more about Velocity, visit www.velocitydancecenter.org or call 206.325.8773.
Britt Karhoff by David Levitt (pictured: Julia Cross)
Chris McCallister, courtesy of the artist
Amy Johnson by Joseph Lambert (pictured: Chantael Duke)
Elia Mrak, courtesy of the artist