text:
Tour Highlights
Awesome scenery and terrace fields on the typical real trek adventure to the bests of Sapa, Vietnam
Wonderful view of Muong Hoa valley - the most beautiful one of Sapa
Moderate portion combining with tough paths that make this suitable for all hikers
Meet colorful minority groups such as Red Dzao, Thai ect
Stay in homestays in minority villages with warm, friendly hosts
Brief Itinerary
Night 1: Overnight train to Laocai
Day 1: Drive to Sapa/Trek to Giang Ta Chai Village
Day 2: Trek Sapa village - Thanh Phu
Day 3: Trek/drive back to Sapa. Overnight train back to Hanoi
Day 4: Arrive in Hanoi. Tour concludes
AC sleeper cabin on train for two ways
Road transfer two ways in Sapa
Road transfer one way in Hanoi
Professional trekking English speaking guide
Meals as indicated in the itinerary
Homestay permission
First-aid kit
Water & Snacks
Entrance & sightseeing fees
Service charges and taxes
Trekking grade: Moderate Grade that means this trekking tour involve in active, physical-required activities can be up to 4 - 5 hours a day at a steady pace. The tour is going to involve a considerable amount of ascent or descent under different weather conditions. Support facilities may not be available on-site and there are some occasional difficult days. You will need a good level of fitness.
* Suggested preparation: 30 - 45 minutes of aerobic, physical exercise, 3-4 times per week for a few weeks leading up to your adventure are recommended.
Who suits: For outdoor novices and above.
Activity: 4-5 hours most days
Distances: Hike up to 8 miles (or 13km) most days, cycle 20-40 miles (or 32 �" 68km) most days
Surfaces: rolling or mountainous terrain with some steep ascents/descents and uneven trails
Elevation change: up to 3,000 ft/day (about 900m)
Altitude: up to 8,000 ft (about 2500m)
Meals and food
- Day 1,2: Breakfast, Lunch, Dinner
- Day 3: Breakfast
All meals, which are indicated in the itinerary, are included in the price of this trip. On this trip our tour guide or local host will cook dinner for you. Picnic lunch would be prepared by a local restaurant in Sapa. The emphasis will be on healthy and nutritious fresh local produce.
Train travel
On our tour, we use first class trains of King Express, Orient Express, Fanxipan Express or Sapaly Train. These trains all offer Deluxe cabin with clean, comfortable, air �" conditioned sleeper. All trains are designed with 4 soft berths in each cabin and individual reading light. For more information, please see our Quality Services.
The homestay
Homestay in villages is simple in term of bedding condition and amenities. We will sleep on floor or on beds with mattress, clean sheet, pillows and mosquito nets. Toilet is usually western style.
Our tour guide
The tour will be guided by one of our tour guides who are experienced in guiding trekking tours in Vietnam. He has been carefully trained in this field and is fully licensed in tour guiding by the government. In addition, he has been trained in first-aid by SOS International and he knows how to deal with difficult situations. You will have a great time traveling with him.
The transfers
In Hanoi, one ATA staff will accompany you to the train to show you your cabin and tell you how to deal with night train travelling in Vietnam.
In Lao Cai, our guide will meet you at Lao Cai Railway Station in the morning of the first day. He also sees you off at Lao Cai Railway Station on the third day.
When you get back to Hanoi on day 4, you can easily find a taxi to get to your hotel.
The trekking day
A typical trekking day start at about 8.30 am after breakfast. Lunch times can vary depending on the terrain. We aim to reach the next overnight stop by 4.30 or 5. During the trek we will have short breaks for rest, snack and photographing.
What to bring
Trekking boot, sun block, hat, anti-insect repellent, sunglasses, rain coat, toiletries, original passport.
Note on client safety
We reserve the right to deviate from this itinerary for any reasons, including road and weather conditions, frequency of visits to a village, or for any other factor which may influence client safety.
Travel insurance
Visa process and stamp
Tips and gratitude
Personal expenses
Others not mentioned
Trekking poles: manufactured by Coleman, USA. Telescoping pole extends from 27 to 53 inches. Contoured handle grip features adjustable nylon strap and compass. Aluminum pole has steel tip with removable cover and basket for various terrains
Sleeping bags and/or mattresses in homestay
Summer sleeping bags: Satin sleeping bag 60cm x 180cm. Used for home stay and camping in hot weather
Winter sleeping bags: manufactured by Landus, France. Winter bag (5 degree) 60cm x 200cm. Used for home stay and camping in cold weather
Waterproof blue bag for luggage
Radio: manufactured by Kenwood, Malaysia. 16-channel VHF FM Transceiver. Used for jungle trek with group from 5 passengers up. Help to manage group
ATA first-aid kit: Available on any ATA trip
Origin passport to declare for homestay permission
Hiking Shoes
Flip flops/string-back sandals or river boots
Small backpack with rain cover
Clothes: trekking pants, thermal underwear (top/bottom), t-shirts, long-sleeved shirt, pajama/sleeping pants, underwear (what you're comfortable with), pairs of socks
Rest and sleeping clothes.
Hat, sunglasses, sun protection.
Waterproof pants and jackets
Rain coats
Bottle of water
Sunscreen, hat and sunglasses
Anti-insect repellent
Common medicines in your personal first aid kits
|Map Legend
|Sapa trek & Topas Eco Lodge
Level 2, No 17/167, Tay Sơn, Hanoi
|Ethnic Villages
hồ Sa Pa, tt. Sa Pa, Sa Pa, Lào Cai, Vietnam
|Night Train to Sapa
|Giang Ta Chai village - Sapa
|Thanh Kim Thanh Phu - Sapa
|2 pers
|4 pers
|Valide till Dec 2016
|Package price
|per person


text:
CNF necesitaba un nuevo diseño de logotipo y lanzó un concurso de diseño en 99designs.
Un ganador ha sido elegido entre 133 diseños de 36 diseñadores freelance.
RecordTV is a Web 2.0 company. It offers a 'TiVo' or a VCR/DVR "on the Cloud" (or Internet) It allows anyone to record regular, broadcast over-the-air TV using nothing but a web browser on any internet-connected device with a 'single click'. We call this "one click recording". There is also a "social element" to the recording.
Recorded TV shows are stored on the Internet (and not in a hard disk at the users home). The original logo was meaningful - with the "O" in RecordTV representing a "Record" button. The "TV" resembled the TV's of the old days - essentially we were helping bring *real TV* to the Internet.
I liked the original logo, because the "O" and the "TV" part represented what the company did very well. The only downside was that red seems a little harsh and I do not see many websites with red as the main theme.
1. There might be occasions when the logo is white on a "reversed" background, like Twitter and Facebook.
2. There might be occasions when the logo needs to be replaced by pictorial mark of 50 by 50 pixels.
The target user base are Internet users - anyone who uses Twitter, Facebook and YouTube. Some other ideas are that the "cloud" aspect could be emphasized in the logo or the "play" button that one sees when one can play a file.
In addition to the logo below, I had another logo with a mouse pointer over the "O" or "record" button.
I've been thinking that a bluish logo that incorporates sky, clouds, recording and/or playback might work... but I don't want to constrain your ideas.
We do *not* want a slogan incorporated, but "Never miss a show again" or "One-Click Recording" might represent the essence of the site.
Descubre cómo funciona un concurso de diseño u obtén más información sobre nuestros servicios de diseño de logo.

subset: commoncrawl


text:
Kings Mountain�s Austin Toney, Crest�s Garrett Simpson and Shelby�s Parker Campbell will be competing in the Speedo Winter Junior Nationals for swimming this Thursday through Saturday in Greensboro.
Toney is competing in the 100 and 200 breaststroke events and medley relays, Simpson in the 100 and 200 backstroke events and medley relays and Campbell in the 100 and 200 backstroke.
The meet is expected to have about 1,400 swimmers.
Parker Campbell hit his Junior Nationals cuts in a Charlotte meet and is the second-fastest 16-year-old in the state and sixth-fastest in the country in the 200 backstroke.
School records at KM
Toney set a Kings Mountain record with a 55.55 in the 100 butterfly on Tuesday, and Kaitlyn Moss set a Mountaineer record in the 500 freestyle with a 5:33.
Also, the Kings Mountain girls set a school mark in the 200 freestyle relay.
Sharks Aquatic Club
Eight Sharks Aquatic Club swimmers competed in the New South Swimming Age Group and Senior Winter Invitational at the Mecklenburg Aquatic Center in Charlotte.
Parker Campbell was meet champion in the 100 (50.93) and 200 backstroke (1:49.65) events.
Other top-10 finishers were Madeyln Martelle (100 backstroke, 2nd, 59.63; 50 freestyle, 3rd, 24.95; 100 freestyle, 4th, 54.63; 100 breaststroke, 6th, 1:11.55), Kaitlyn Moss (50 freestyle, 4th, 25.07; 500 freestyle, 6th, 5:26.28; 200 freestyle, 6th, 1:59.81), Riley Brock (50 freestyle, 3rd, 21.46), Matt Campbell (50 freestyle, 7th, 22.02; 100 freestyle, 6th, 48.18) and Annie Shirk (50 freestyle, 9th, 24.98).


text:
Lent Videos
Our Bloggers on Lent
- Prayer Plain and Simple 3/9/2011 1:07 PMThe Deacon's Bench is no longer active, please visit Catholic By Choice with Deacon Keith Fournier, our new featured Catholic blogger. 3/30/2010 11:07 AMRod Dreher 3/27/2010 12:18 AM
What Do You Know About Ash Wednesday?
Take our quiz and find out!
More »
Lent Resources and Features
Lent as Divine Therapy
A look at the dynamics that keep us from a deep relationship with God.
Lent Prayers for Strength and Endurance
These prayers will bring light into you Lent season!
Ash Wednesday Reflection
A Biblical reflection on the beginning of Lent
Lenten Loopholes in Orthodox Fasting
How to avoid breaking the spirit of a fast.
Lent Prayers for Light
These prayers will bring light into you Lent season!
What Are Ash Wednesday and Lent?
Learn the basics of this important Christian observance.
Journey Into Orthodox Christian Lent
Discover an exhilarating kick-start for a time that just gets harder.
Giving Up Sex for Lent
A fast from sex gets to the heart of Lenten discipline.
Lent CalendarUse the calendar below as part of your Lenten observances. As you move your mouse over each day, click on the highlighted text that pops up. You'll discover inspirational stories, galleries to help you on your spiritual journey and a few fun quizzes.
Sun Mon Tue Wed Thu Fri Sat23Nov24252627Ash Weds.
Ash Weds.
Bible Verses for Lent
How to PrayHow to pray during Lent
Christian IdentityWhat kind of Christian are you?
Prayer21 Ways to Pray
Caring KidsHow to raise caring kids
Bible on FearBible Verses to overcome fear
Nurture HopeChristian quotes to nurture hope
Fasting QuizHow much do you know about fasting?
TriviaAre you a bible expert? Find out.
PrayerLearn more about prayer and healing
AdviceChristian tips for a better, healthy life
BibleBible verses to help you keep going
Envy QuizHow envious are you?
ForgivingTips on how to forgive
Church LadyAre you a closet church lady?
Green BibleEnvironment-friendly bible verses.13Prayer
PrayerHow to pray when you're depressed
LoveQuotes about God and love
Is gossip ever good?
Greed Quiz
How greedy are you?
SoulLearn how to listen for God
HopeA priest and a homeless man
BlogVisit the Jesus Creed blog
PrayerQuick ways to pray
JourneyA Spiritual Walk with Kathleen Norris
FamilyRaising kids in a Facebook generation
BibleHow to practice Lectio Divina
PsalmsPsalms for Depression
Bible Learn from Biblical characters
How to pray the Bible
Prayer HomeLearn how to make your home prayer friendly
FaithRecharge your faith life
RelaxDiscover the power of pause.
QuizHow slothful are you?
SufferingDoes God care about suffering?
HopeGod and second chances
BlogVisit Prayer Plain and Simple
ChangeTips to turn your life around
HopeGod is good, even in hard times
Palm SundayWhy is this day significant?
ImagesImages of Jesus.
DiscussWhat is Lent good for?
The CrossA reflection on Simon and Jesus
BibleTen healing Bible verses
A meditation on Jesus' last hours
Bitter Journey: A meditation on the way of the Cross
EasterAnne Lamott on the Resurrection
MondayLive the Resurrection14151617
Move your mouse over the calendar to find an article, quiz, gallery or video for each day of the Lenten season.


text:
Changes in office design over the past 30 years are a mere shadow of what these workspaces will look like in the future. Back then, several trends in the design of commercial office space emerged. The building envelope was sealed tight to save energy (no operable windows), and interior walls disappeared in favor of the cubicle, which proliferated into an open office concept. Soon afterward, computers started to appear on desktops — and things have only evolved from there.
What does the future hold? The tablet PC and the smartphone, with their inherent versatility and swift access to Internet-based "cloud" services, will inevitably alter the way business information is generated and exchanged. Office networks will be supporting both live streaming video as well as financial and health care transactions. Telecommuting, virtual project teams, and communications across time zones will call for the simultaneous contribution of many staffers.
Consider this scenario: As workers gather for a meeting in a conference room, flat screen message boards and elaborate projection systems deliver images on dividers, walls, and even conference tables, so that any vertical or horizontal plane can be used as a viewing screen. One big challenge surrounding this scene is the lighting system is expected to adapt to these changing visual tasks at a moment's notice.
Tomorrow's offices will feature areas for staff collaboration and interaction. The idea is to break down the typical barriers of office design and provide spaces that are more comfortable, less static, and hierarchical. Research institutions discovered long ago that the most important work often gets done in the "in-between" spaces, such as a lounge or break room.
Looking ahead, we may also see designers of office lighting systems using the term "health per watt" instead of "lumens per watt" as a way of recognizing the health-related aspects of lighting for office workers. Dr. Joan Roberts, Chair of the Department of Natural Sciences, Fordham University, notes that new research indicates we do not know as much as we thought about light and lighting. Studies indicate that the circadian system is not a one-size-fits-all proposition. People need different amounts of light at different times of the day for various durations of time in their work. Thus, the rise of green legislation and light/health discoveries will help determine the lighting products of the future that get specified for workspaces. For these reasons, we will see less general lighting and more purposeful task lighting, suited to each worker's personal preferences.
Energy codes, such as ASHRAE Standard 90.1 – Energy Standard for Buildings Except Low-Rise Residential Buildings and the ASHRAE Standard 189.1 – Standard for the Design of High-Performance, Green Buildings, are two important reasons why high-efficiency lighting fixtures and integrated controls will be mandated. In addition, the next-generation standards will want to know where and for how long the lighting is in use — not just the watts per square foot in the design.
In summary, electrical contractors can prepare for these new concepts by developing an understanding of basic sensing and control technologies and the communications systems that will support tomorrow's lighting systems.
Improving the Old
Linear fluorescent lamp and ballast manufacturers continue to improve the efficiency of "older technology" light sources, and they will continue to be specified for some time. Look for important new concepts, such as parallel lamp operation for programmed-start electronic ballasts, RoHS-compliant lamps and ballasts, T8 instant-start ballasts with a 1.0 ballast factor, 4-lamp T5 programmed-start ballasts, DALI ballast for T5 lamps, and new dimming and light level switching ballasts. Applying some of these products can reduce the number of luminaires required for an office project by at least 10%.
Manufacturers will generally be settling on two types of control systems for general office lighting: the analog 0V to 10VDC system (useful for conference rooms and similar spaces) and a digital control network (suitable for building-wide application).
Although digital lighting systems have been available for a number of years, it has taken all this time for the technology to become good enough, small enough, cheap enough, and powerful enough to embed a full-featured microprocessor and network interface into a wall switch or a luminaire. It also took something else — ease of installation.
The most popular protocol for a digital lighting control system will be some form of the Digital Addressable Lighting Interface (DALI) design, which uses a simple, 2-wire bus circuit to connect sensors, ballasts, and input ports. Programming is stored throughout the circuit's devices. Although each bus is limited to 64 nodes, you can use multiple buses. The control components are relatively simple to install, and you can move the devices with considerable ease. However, up to this point, commissioning the system has been an expensive and time-consuming task. Nevertheless, manufacturers are working to simplify this effort.
Most end-users, recognizing the value proposition for light-emitting diodes (LEDs), will be requesting this light source despite the higher initial cost of solid-state lighting. Why? The LED source is inherently controllable, the color of the light can be modified, it uses no mercury, and it foregoes the limitations of all the traditional light sources.
Rethinking the Ceiling Plane
New design possibilities for the sensing and control of lighting, unrestricted by the traditional grid ceiling, are being studied and considered as well in an effort to picture the office of the future. Here is one concept: Today's office is packed with a variety of electronic digital devices. Services, such as environmental sensors, HVAC actuators, motors for window shades, signage, security system elements, and A/V systems, also assist in making the office useful and comfortable. Because these devices are usually low-voltage DC operated — and delivering this DC electric power system requires a number of transformations and rectifications from the AC electrical power distribution system — electrical energy is consumed (wasted) at each conversion point.
So, in addition to the AC electric power system, it might be practical to have a dedicated DC electric power distribution system available to serve the electronic equipment and avoid all of the power transformations. With that idea, a number of companies — energy service and building product firms as well as many lighting and lighting control vendors — formed the EMerge Alliance in 2008 to create a practical DC power delivery method for tomorrow's buildings. Less than two years later, the Alliance completed its 24VDC Occupied Space standard for the office interior, which calls for using a 24VDC power distribution system for the electronic equipment. It has since registered dozens of products that support this Emerge Alliance standard.
Another important consideration is that LEDs and organic LEDs (OLED), which are usually served at 12VDC or 24VDC, will most likely be the dominant light source of the future for any Emerge Alliance-type projects. LED luminaries would typically be smaller and lighter than standard fluorescent ceiling luminaires, easier to install, and easier to reconfigure without incurring a complete rewiring project.
The EMerge system design has provision for a wireless receiver within each luminaire. The addressable fixtures could be controlled via a wireless battery-less switch, occupancy sensor, or a wireless system that uses batteries.
Computers andLighting Merge
Another design concept blurs the lines between lighting systems and IT communications systems, using a completely disruptive approach. This lighting control system recognizes that any network or system-based control technique to measure or optimize light has to be added as an overlay to the AC power system. That is, another low-voltage wiring scheme must be installed to implement adequate energy-saving strategies.
In this case, a chassis, containing a power supply and controller (LED driver) for up to 64 fixtures, collects information from sensors and controls to determine the light level for each fixture. The central controller unit can further be connected to a data network and other controllers for expanded capacity.
A single pair of conductors (a Class 2 cabling system) carries both the constant current DC power for a single fixture and a proprietary communication network, which provides sensing and control for the lighting equipment.
A cylindrical module containing a number of sensors is mounted next to each luminaire in the ceiling. Also called an adapter, the module (about 1 inch in diameter and 3 inches long) connects the luminaire to the DC power supply and also to the data network. The sensor array detects voltage, current, light level, and motion, along with LED and room temperature. Additional sensors (e.g. carbon monoxide, air quality, and light color measurement) can be added at negligible cost.
Because every luminaire in the lighting network is essentially a data gathering point — and given the fact that luminaires are usually set in a grid pattern in the ceiling plane — the system has a Web-based software program that can display the power usage, occupancy, and temperature in a room or an open plan area. Typically, there might be 3,000 to 6,000 data connections in a 250,000-square-foot building. This lighting control system could add about 12,000 more connections.
For identification, each fixture has a radio frequency identification (RFID) tag and also includes either a matching hardwired ID chip or an RFID reader capable of reading the RFID tag. The tags allow for rapidly commissioning the lighting system.
Although there is some resemblance, this lighting system differs from the Power-over-Ethernet (PoE) standard, which carries DC power on one or two twisted pair in a data network cable and uses a voltage-driven architecture. This lighting system uses a current-driven architecture. The network protocol is simple, offers a low cost, and features appropriate latency and adequate bandwidth for the application. The control strategies handled by this lighting system include:
- Scheduling. Turns off or dims lighting systems automatically at predetermined times for various locations throughout the office building during workdays, evenings, and weekends. If a building has a regular pattern of use, the system can be used to control other systems (HVAC) based on that occupancy.
- Occupancy sensors. The presence or absence of persons in a space is determined. In addition to the general lighting, task lighting and plug loads can also be controlled.
- Dimming and task tuning. The light level is based on occupant requirement in the space and the preference of the user.
- Daylight harvesting. Large windows or skylights can capture sunlight and naturally illuminate the space. The system responds to changing ambient light levels throughout the day, allowing electric lighting to be reduced.
- Visibility and reporting. The operation status, the efficiency, and the installation date of each fixture is retained.
- Lumen depreciation and fault management. All light levels are recorded along with the AC and DC voltage.
- Load shedding for demand response. The system reduces the building's lighting load in response to utility rate changes, pricing signals, or incentives by automatically or dynamically changing lighting use.


text:
A 2-day conference held at UCLA and UC Irvine on November 8 and 9, 2012.
The destruction of the giant Buddha statues at Bamiyan in March 2001 briefly brought the world's attention to the rich pre-Islamic heritage of Afghanistan. Appalling as it was, the tragedy at Bamiyan has overshadowed the larger stories that surround the Buddhas, both in terms of the longer history of archaeological excavation in Afghanistan and the plurality of ancient cultures that flourished in the region. Bringing together archaeologists and historians, these two half-day conferences at UCLA and UC Irvine explore two related issues. First, what archaeological, art historical and philological research can tell us about the evolution and interaction of societies and religious groups in the ancient and late antique Persianate world. And secondly, what roles have domestic and international politics had to play in the sponsorship or reception of historical and archaeological research on pre-Islamic Afghanistan. By addressing these questions, the conferences aim to understand the larger issues that surrounded both the creation and the destruction of the great Buddhas of Bamiyan.
Showcasing the cutting-edge of international research on Afghanistan's archaeology and history, Beyond the Bamiyan Buddhas is jointly organized by Nile Green, chair of the UCLA Program on Central Asia, and Touraj Daryaee, Director of the UCI Samuel Jordan Center for Persian Studies and Culture, with support from the American Institute of Afghanistan Studies, the UCLA Center for Buddhist Studies, the Center for Near Eastern Studies, the Center for the Study of Religion, and the Musa Sabi Term Chair in Iranian Studies (2004-2009).
An introduction by Nile Green, UCLA
Keynote lecture by Llewelyn Morgan, Brasenose College, Oxford
Ali Mousavi, Los Angeles County Museum of Art (LACMA)
Alka Patel, Associate Professor, Department of Art History, UC Irvine
Phillipe Marquis, Director, Délégation Archéologique Française en Afghanistan (DAFA), Kabul
Closing remarks by Monica Smith, UCLA
Fredrik Hiebert: "The Bronze Age of Afghanistan" (National Geographic Society, Washington D.C.) from UCI Persian Studies on Vimeo.
Cosponsored by Center for Buddhist Studies, Center for Near Eastern Studies, Asia Institute, Center for the Study of Religion, UCI Samuel Jordan Center for Persian Studies and Culture, American Institute for Afghanistan Studies, Musa Sabi Term Chair in Iranian Studies (2004-2009)
Published: Monday, December 3, 2012
Thursday, November 8, 2012
Friday, November 9, 2012
International Conference on Afghanistan Aims to Develop Central Asian Studies at UCLA"Beyond the Bamiyan Buddhas: Archaeology and History in the Modern and Ancient Persianate World" is an upcoming 2-day conference to be held at UCLA and UC Irvine on November 8 and 9, 2012.
Sign up for our Newsletter
© 1997 - 2019 Asia Pacific Center, UC Regents All rights reserved.


text:
ADDISON COUNTY — It's no secret that Vermont's population, on average, is aging, and Addison County is being affected almost as much as any of the rural counties.
In the past 10 years, three new senior living facilities opened in Addison County (Armory Lane Senior Housing in Vergennes and Eastview and the Lodge at Otter Creek in Middlebury), indicating an increase in the county's elderly population. During the same period, high school enrollment dropped to its lowest levels since the early 1990s.
The full text of this article is only available to online subscribers.
Are you an online subscriber? Click to login.
Click here to learn more about our subscription options.
If you have a print subscription, you can now add an online subscription at no additional charge! Just email us with your name and mailing address to set it up.
NEW HAVEN –– The fact that the Green Mountain State faces an aging population and a declining number of young people in the work force is an issue that concerns many Vermonters, including former Gov. Jim Douglas.
STARKSBORO — Starksboro selectmen are skeptical about U.S. Census results that show a population drop in their town, and they plan to contact Census officials to question the data.
According to the 2010 Census, Starksboro's population is 1,787, down 121 from the 2000 number of 1,898.
But according to Town Clerk Cheryl Estey, the town's voter checklist increased by 257 in the same decade, from 986 to 1,243.
"I was actually flabbergasted when I saw the (Census) numbers," Estey said.
Subscribe to Online Edition
Online PDF Print Edition
Copyright 2011 Addison Independent | 58 Maple Street, Middlebury, Vt. 05753 | All Rights Reserved
Site Development by Surf New Media


text:
Create a traditional look and feel without losing any of the convenience of an electric fire. Benefit from a 360 degree viewing angle on most stoves.
Electric Stoves
Products In Electric Stoves (Total Products 11, Showing: 1 -> 11)
Sort By: Product Code | Product Name | Price Low to High | Price High to Low


text:
rapid! PayCard
« All Events
Green Dot Corporation HQ:
Pasadena, CA
Birmingham, AL
5300 W. Cypress Street, Suite 150
Tampa, FL 33607
Cincinnati, OH
rapid! PayCard® Visa® Payroll Card is issued by The Bancorp Bank pursuant to a license from Visa U.S.A. Inc. and may be used everywhere Visa debit cards are accepted. The Bancorp Bank; Member FDIC.
The rapid! PayCard® MasterCard® is issued by MetaBank®, Member FDIC, pursuant to license by MasterCard International Incorporated. Prepaid card can be used wherever Debit MasterCard is accepted. MasterCard and the MasterCard Brand Mark are registered trademarks of MasterCard International Incorporated.
The rapid! PayCard blog and any information contained within do not reflect the views of MetaBank or MasterCard, nor are they endorsed by MetaBank or MasterCard.
Copyright 2019 UniRush, LLC. All Rights Reserved.


text:
Nov 20th 2012
The Giz Wiz 1391
Black and Blue Friday
Roku streaming projector, Wi-Fi for plants, 70" smart TV, and more.
Download or subscribe to this show at twit.tv/giz.
We invite you to read, add to, and amend the show notes.
For more details and a chance to win the Mad Magazine "What The Heck Is It?" contest, visit GizWiz.Biz.
Audio bandwidth for The Giz Wiz is provided by the new Winamp for Android... featuring wireless sync and one-click iTunes support. Now with FREE daily music downloads and full length CD listening parties. Download it for free at Winamp.com/Android.


text:
|By Admin1 (admin) (adsl-70-233-229-64.dsl.okcyok.sbcglobal.net - 18.104.22.168) on Sunday, August 12, 2007 - 8:07 am: Edit Post
1985: jeffrey rein served as a Peace Corps Volunteer in central african republic in berberati, bangui beginning in 1985
Returned Peace Corps Volunteer jeffrey rein can be contacted at jeffrey_reinahotmaildcom
Country of Service: central african republic
Training Group: 1985
Cities you served in: berberati, bangui
Arrival Year: 1985
Departure Year: 1988
Work Description:
biology teacher, berberati; Eaux et Forets, bangui
Any message for returned volunteers?:
Kodro te e aba pasi mingi!
Originally posted: August 12, 2007
Related Links:
Peace Corps Central African Republic; Directory of Central African Republic RPCVs; Messages and Announcements for Central African Republic RPCVs; Peace Corps Annual Report: 1985
Reconnect with this Peace Corps Volunteer
Leave a message above where it says "Create New Conversation."
If this is your profile, post any additions, updates or corrections to your profile below where it says "Add a Message."
RPCVs: To add your own RPCV profile click here.
| The Peace Corps Library
The Peace Corps Library is now available online with over 40,000 index entries in 500 categories. Looking for a Returned Volunteer? Check our RPCV Directory or leave a message on our Bulletin Board. New: Sign up to receive our free Monthly Magazine by email, research the History of the Peace Corps, or sign up for a daily news summary of Peace Corps stories. Visit our FAQ for more information about PCOL.
| Subscribe to Peace Corps News
Don't miss our new web site, Peace Corps News, for the latest news about the Returned Volunteer community and what is going on with the Peace Corps around the world. Subscribe to our news feed to get Peace Corps news delivered to your desk as it happens. Then visit the Peace Corps Library, History of the Peace Corps, the worldwide RPCV Directory or leave a message for the RPCV community on the RPCV Bulletin Board.
| Help document the History of the Peace Corps
PCOL is proud to announce that Phase One of the "History of the Peace Corps" is now available online containing over 5,000 pages of primary source documents from the archives of the Peace Corps. Help: Do you have copies of in-country newsletters from your Country of Service. Mail copies to "Ask Not" - Box 1960 - Ponca City, OK 74601. If you can, send them on a CD in jpeg format; if not, send us hard copies.


text:
Choose a currency for product pricing
"ex VAT" prices apply outside of the EU
For non-UK overseas customers, please note that our exchange rates sometimes vary from those used by your payment provider, so the final amount charged may differ slightly from that shown on the site
Millefiori - 50g pack (M030) 5mm, white & blue
Approximate diameter 5mm; Coefficient of Expansion (CoE) 104
Our millefiori is handmade in Murano and is ideal for enamelling and fused glass work. The coe is 104.
Millefiori is Italian for a thousand flowers. These glass beads are sliced from sticks that are manufactured in a complex process that originates from the Venetian island of Murano. The best examples are still made there by hand.
Harrison & Harrison - Enamelling Supplies


text:
Welcome to YMCA Norfolk Website
We are a local charity that has been supporting people in Norfolk since 1856. We focus on young people, helping them to play an active role within their community.
We work with disadvantaged young people and families who are at a point of crisis in their lives, including those who have been affected by homelessness and support them towards a brighter future. Every night we provide a safe home and support for over 260 vulnerable homeless young people across the county, offering opportunities to develop their life skills, education and employability to help prepare them for independent living.
We offer services and support to young people and their families in the wider Norfolk community to enable them to fulfil their potential.
We help people to believe in themselves, inspire them to raise their aspirations and support them to achieve their goals so they have a brighter future.
Latest News
Lives Transformed


text:
the 'risque' thread is doing ok......
Yea I guess but I think it would be more exciting for me if I wasn't the only one suppling the pics.lol
You are here: Home ‹ Board index ‹ General Discussion ‹ Site / Forum Discussion
Ok people lets put our heads together
We are always interested in hearing what you think of JCO or come with suggestions for new site features.
I'm going to put one on there for you.
"When in doubt, tell the truth."
Mark Twain
If it is of your feet please wear your clog dancing shoes this time.lol The last pic you put on there was too daring of you. How did you get the courage to post an all skin pic of yourself?lol
Maybe we should auction off one of those alien babies.
But if he comes off as all cerebral....I'm going to pop with joy.
"When in doubt, tell the truth."
Mark Twain
let's put OUR heads together?!
til now I must say it have been mostly fluffy, quirky and cotton heads together...
But the auction thing sound fun!
"Here I come to 'seize' the day!"
Littel family photo, please...
"I really want to love somebody. I do. I just don't know if it's possible forever and ever." JC
Return to Site / Forum Discussion
Who is online
Users browsing this forum: No registered users and 2 guests


text:
Bursledon Surgery , The Lowford Centre, Lowford, Southampton, SO31 8ESTel: 023 8040 4671
We acknowledge our recent CQC report results and are working hard to correct areas which it was felt needed improvement. The full report is available to read at Reception should you like to see what the assessors had to say about our surgery. We will soon be implementing an update area so you can see how and where the improvements have been made. If you have any questions or queries about this, please do not hesitate to speak to either Clare (Interim Practice Manager) or Daniel (Office Manager).
These and other additional services are in line with BMA recommended rates as of 1st April, 2011.
Copyright 2006 - 2019 My Surgery Website | Privacy & Usage | Edit | Staff Home | Site Map | Accessibility | Site T&C's | Service T&C's


text:
- Software
- Open Access
High-throughput sequence alignment using Graphics Processing Units
© Schatz et al; licensee BioMed Central Ltd. 2007
- Received: 20 August 2007
- Accepted: 10 December 2007
- Published: 10 December 2007
The recent availability of new, less expensive high-throughput DNA sequencing technologies has yielded a dramatic increase in the volume of sequence data that must be analyzed. These data are being generated for several purposes, including genotyping, genome resequencing, metagenomics, and de novo genome assembly projects. Sequence alignment programs such as MUMmer have proven essential for analysis of these data, but researchers will need ever faster, high-throughput alignment tools running on inexpensive hardware to keep up with new sequence technologies.
This paper describes MUMmerGPU, an open-source high-throughput parallel pairwise local sequence alignment program that runs on commodity Graphics Processing Units (GPUs) in common workstations. MUMmerGPU uses the new Compute Unified Device Architecture (CUDA) from nVidia to align multiple query sequences against a single reference sequence stored as a suffix tree. By processing the queries in parallel on the highly parallel graphics card, MUMmerGPU achieves more than a 10-fold speedup over a serial CPU version of the sequence alignment kernel, and outperforms the exact alignment component of MUMmer on a high end CPU by 3.5-fold in total application time when aligning reads from recent sequencing projects using Solexa/Illumina, 454, and Sanger sequencing technologies.
MUMmerGPU is a low cost, ultra-fast sequence alignment program designed to handle the increasing volume of data produced by new, high-throughput sequencing technologies. MUMmerGPU demonstrates that even memory-intensive applications can run significantly faster on the relatively low-cost GPU than on the CPU.
- Graphic Processing Unit
- Suffix Tree
- Compute Unify Device Architecture
- Stream Processor
- Alignment Kernel
Sequence alignment has a long history in genomics research and continues to be a key component in the analysis of genes and genomes. Simply stated, sequence alignment algorithms find regions in one sequence, called here the query sequence, that are similar or identical to regions in another sequence, called the reference sequence. Such regions may represent genes, conserved regulatory regions, or any of a host of other sequence features. Alignment also plays a central role in de novo and comparative genome assembly [1, 2], where thousands or millions of sequencing reads are aligned to each other or to a previously sequenced reference genome. New, inexpensive large-scale sequencing technologies [3] can now generate enormous amounts of sequence data in a very short time, enabling researchers to attempt genome sequencing projects on a much larger scale than previously. Aligning these sequence data using current algorithms will require very high-performance computers, of the type currently available only at the largest sequencing and bioinformatics centers. Furthermore, realizing the dream of widespread personal genomics at hospitals and other clinical settings requires sequence alignment to be low cost in addition to high-throughput.
Most personal computer workstations today contain hardware for 3D graphics acceleration called Graphics Processing Units (GPUs). Recently, GPUs have been harnessed for non-graphical, general purpose (GPGPU) applications. GPUs feature hardware optimized for simultaneously performing many independent floating-point arithmetic operations for displaying 3D models and other graphics tasks. Thus, GPGPU programming has been successful primarily in the scientific computing disciplines which involve a high level of numeric computation. However, other applications could be successful, provided those applications feature significant parallelism.
In this paper, we describe a GPGPU program called MUMmerGPU that performs exact sequence alignment using suffix trees on graphics hardware. Our implementation runs on recent hardware available from nVidia using a new software development kit (SDK) for GPGPU progamming called Compute Unified Device Architecture (CUDA). MUMmerGPU is targeted to tasks in which many small queries, such as reads from a sequencing project, are aligned to a large reference sequence. To assess the performance of MUMmerGPU we compare it to the exact alignment component of MUMmer called mummer. MUMmer is a very fast and widely used application for this type of task [4], and is also used as the alignment engine for the comparative assembler AMOScmp [2]. Overall MUMmerGPU is more than three times faster than mummer on typical sequence alignment tasks involving data from three recent sequencing projects. As implemented, MUMmerGPU is a direct replacement for mummer and can be used with any other programs that process mummer output, including the other components of MUMmer that post-process the exact alignments computed by mummer into larger inexact alignments.
Sequence alignment
One of the most successful algorithms for computing alignments between sequences is MUMmer [4–6]. The first stage of MUMmer is performed by a component called mummer, which computes exact alignments between the pair of sequences. These alignments can be used directly to infer large-scale sequence structure, or they can be used to seed extensions to longer inexact alignments using the post-processing tools bundled with MUMmer. Unlike other popular sequence alignment programs such as BLAST [7], FASTA [8], and LAGAN [9], which use fixed length seeds for constructing their alignments, mummer alignments are variable-length maximal exact matches, where maximal means that they cannot be extended on either end without introducing a mismatch. First, mummer pre-processes the reference sequence to create a data structure, called a suffix tree. This data structure allows mummer to then compute all maximal exact substring alignments of a query sequence in time proportional to the length of the query. The time to pre-process the reference sequence is proportional to its length (which may be considerable for very long sequences), but this time becomes insignificant when amortized across many query searches. Consequently, suffix trees are used in several alignment algorithms, including MGA [10] and REPuter [11]. The suffix tree [12] for string S is a tree that encodes every suffix of S with a unique path from the root to a leaf. For a string of length n, there are n leaf nodes for each of the n suffixes in S. Each edge in T is labeled with a substring of variable length of S called an edge-label. Concatenating edge-labels along a path from the root to a node i forms a substring, called i's path-label in S. Leaves in the tree are labeled with the position where the path-label begins in S. Internal nodes have at least 2 children, representing positions where repeated substrings diverge. The edge-labels of the children of a node each begin with a different character from the alphabet, so there is at most one child for each letter of the reference string's alphabet. Consequently, the depth of any leaf is at most n, and there are O(n) nodes in the tree.
A suffix tree can be constructed in O(n) time and O(n) space for a string over a fixed alphabet, such as for DNA or amino acids, by using additional pointers in the tree called suffix links. The suffix link of node v with path-label xα points to node v' with path-label α where x is a single character and α is a substring [13, 14]. Suffix links are used to navigate between equivalent nodes of consecutive suffixes without returning to the root of the tree.
All substrings of a query string Q of length m that occur in a string S can be determined in time proportional to m by navigating the suffix tree T of S to follow the characters in Q. The algorithm begins by finding the longest prefix of Q that occurs in T, descending from the root of T and following exactly aligning characters in Q for as long as possible. Assume that substring Q[1, i] is found in T along the path-label to node v, but there is no edge from v labeled with the next character in Q because Q[1, i + 1] is not present in S. The algorithm can then report the occurrences of Q[1, i] at the positions represented by all leaves in the subtree rooted at v after checking the alignments are maximal by comparing the left flanking base of the query and reference. The algorithm then continues by finding the longest substrings for each of the m - 1 remaining start positions in Q. However, instead of navigating the tree from the root each time, the algorithm resumes aligning with Q[i + 1] after following the suffix link from v to v' and without reprocessing previously aligned characters.
GPGPU programming
As the GPU has become increasingly more powerful and ubiquitous, researchers have begun exploring ways to tap its power for non-graphics, or general-purpose (GPGPU) applications [15]. This has proven challenging for a variety of reasons. Traditionally, GPUs have been highly specialized with two distinct classes of graphics stream processors: vertex processors, which compute geometric transformations on meshes, and fragment processors, which shade and illuminate the rasterized products of the vertex processors. The GPUs are organized in a streaming, data-parallel model in which the processors execute the same instructions on multiple data streams simultaneously. Modern GPUs include several (tens to hundreds) of each type of stream processor, so both graphical and GPGPU applications are faced with parallelization challenges [16]. Furthermore, on-chip caches for the processing units on GPUs are very small (often limited to what is needed for texture filtering operations) compared to general purpose processors, which feature caches measured in megabytes. Thus, read and write operations can have very high latency relative to the same operations when performed by a CPU in main memory.
Most GPGPU successes stem from scientific computing or other areas with a homogeneous numerical computational component [17, 18]. These applications are well suited for running on graphics hardware because they have high arithmetic intensity – the ratio of time spent performing arithmetic to the time spent transferring data to and from memory [19]. In general, the applications that have performed well as a GPGPU application are those that can decompose their problems into highly independent components each having high arithmetic intensity [20]. Some bioinformatics applications with these properties have been successfully ported to graphics hardware. Liu et al. implemented the Smith-Waterman local sequence alignment algorithm to run on the nVidia GeForce 6800 GTO and GeForce 7800 GTX, and reported an approximate 16× speedup by computing the alignment score of multiple cells simultaneously [21]. Charalambous et al. ported an expensive loop from RAxML, an application for phylogenetic tree construction, and achieved a 1.2× speedup on the nVidia GeForce 5700 LE [22].
The improved flexibility of CUDA does not solve the more fundamental problems caused by the G80's stream-computing organization: the relatively small cache and associated high memory latency for memory intensive programs. However, the G80's texture memory is cached to speed up memory intensive texture mapping operations, and can be used by GPGPU programs. GPGPU programs can pack their data structures into one-, two-, or three-dimensional arrays stored in texture memory, and thus use the cache for read-only memory accesses to these data structures [23]. Performance is further improved by utilizing one of several software techniques for maximizing the benefit offered by even a small cache. One such class of techniques involves reordering either the data in memory or the operations on those data to maximize data and temporal locality. Mellor-Crummey et al. reported significant speedup in particle interaction simulations, which feature highly irregular access patterns, by reordering both the locations of particles in memory and the order in which interactions were processed. They tested a reordering strategy based on space-filling curves, such as the Hilbert and Morton curves [24].
The G80 has a relatively small amount of on-board memory, so the data are partitioned into large blocks so that the reference suffix tree, query sequences, and output buffers will fit on the GPU. As of this writing, the amount of on-board memory for a G80 ranges from 256 MB to 768 MB. A suffix tree built from a large reference sequence, such as a human chromosome, will exceed this size, so MUMmerGPU builds k smaller suffix trees from overlapping segments of the reference. MUMmerGPU computes k at runtime to fill approximately one third of the total GPU device memory with tree data. The trees overlap in the reference sequence by the maximum query length m supported by MUMmerGPU (currently 8192 bp) to guarantee all alignments in the reference are found, but alignments in the overlapping regions are reported only once.
After building the trees, MUMmerGPU computes the amount of GPU memory available for storing query data and alignment results. The queries are read from disk in blocks that will fill the remaining memory, concatenated into a single large buffer (separated by null characters), and transferred to the GPU. An auxiliary 1D array, also transfered to the GPU, stores the offset of each query in the query buffer. Each multiprocessor on the GPU is assigned a subset of queries to process in parallel, depending on the number of multiprocessors and processors available. The executable code running on each processor, the kernel, aligns a single query sequence from the multiprocessor's subset to the reference. The kernel aligns the query to the reference by navigating the tree using the suffix-links to avoid reprocessing the same character of the query, as described above. Reverse complement alignments are computed using a second version of the kernel which reverse complements the query sequences on-the-fly while aligning, allowing for computing both forward and reverse alignments without any additional data transfer overhead. The output buffer contains a slot to record the alignment result for each of the m - l + 1 substrings for a query of length m. The fixed size alignment result consists of the node id of the last visited node in the tree and length of the substring that exactly aligns. This information is sufficient to print all positions in the reference that exactly align the substring on the CPU.
After the kernel is complete for all the queries, the output buffer on the GPU is transfered to host RAM and the alignments are printed by the CPU. Each slot in the output buffer corresponds to a specific substring of a query. If multiple trees were built from the reference (k > 1), then the output slots for each tree are preserved until the queries in a block have been aligned against each tree. This way all of the alignments for a given query can be printed in a single block, following the syntax used by mummer.
GPU Memory Layout
The suffix tree is "flattened" into two 2D textures, the node texture and the child texture. Each tree node is stored in a pair of 16-byte texels (texture elements) in these two textures. The node texture stores half the information for a node, including the start and end coordinates of the edge sequence in the reference, and the suffix link for the node. The remaining information for a node – the pointers to its A, C, G & T children – is stored in the child texture, addressed in parallel to the node texture. An auxiliary table containing each node's edge length, sequence depth, parent pointer, and suffix number for leaf nodes, is stored in RAM and is used during the output phase.
The reference sequence for the tree is transferred to the GPU as a third 2D texture, and is reordered along a simple 2D space-filling curve to maximize the cache hit rate for subsequent accesses along a node's edge. The sequence is reordered so that beginning with the first character, every four characters in the reference become the topmost four characters in the columns of the 2D array. Once the array contains 4 × 65,536 characters, successive four-character chunks become the next four characters in the columns, left-to-right, and so on. We experimented with a variety of other data reordering schemes, including along a Morton curve and other space filling curves, and found this to have the best performance on several reference sequences. Altogether, using cache memory organized with the spacing-filing curves for the suffix tree and reference sequence improved the kernel execution speed by several fold.
Complexity of MUMmerGPU
MUMmerGPU constructs its suffix trees in O(n) time with Ukkonen's algorithm, where n is the length of the reference. The alignment kernel running on the card computes all exact substring alignments for each query in time linear in the length of the query. The kernel is an implementation of existing alignment methods [14], but with many independent instances running simultaneously on the GPU.
MUMmerGPU uses both GPU memory and main system memory. Suffix trees use an amount of memory linear in the length of the reference from which they are constructed [14]. The suffix trees in MUMmerGPU thus each occupy O(n/k + m) space, where k is the number of overlapping trees specified by the user, and m is the maximum query length supported by MUMmerGPU. Note that for most expected uses of MUMmerGPU n ≫ m. Only a fraction of that total space is actually transferred to the GPU. In the current implementation, 32 out of every 48 bytes per node are transferred. The remaining bytes are stored in the host-only auxiliary table used only for printing results by the CPU. For each query, MUMmerGPU transfers the null terminated query sequence prepended with a special mismatch character, along with two 4-byte entries in auxiliary tables used by the kernel. For a query of length m, and a minimum substring length l, m - l + 1 output slots are reserved to record the query's substring alignments, and each output slot occupies 8 bytes. The total space required on both the CPU and the GPU for each query is 8(m - l + 1) + (m + 10) bytes. On a G80 with 768 MB of on-board RAM, there is sufficient RAM to store a tree for a 5 Mbp reference sequence, and 5 million 25 bp or 500,000 100 bp query sequences.
Results and Discussion
We measured the relative performance of MUMmerGPU by comparing the execution time of the GPU and CPU version of the alignment code, and the total application runtime of MUMmerGPU versus the serial application mummer. The test machine has a 3.0 GHz dual-core Intel Xeon 5160 with 2 GB of RAM, and an nVidia GeForce 8800 GTX. The 8800 GTX has 768 MB of on-board RAM and a G80 with 16 multiprocessors, each of which has 8 stream processors. At the time of this writing, the retail price of the 8800 GTX card is $529, and a retail-boxed Intel Xeon 5160 CPU is $882 [25]. Input and output was to a local 15,000 RPM SATA disk. The machine was running Red Hat Enterprise Linux release 4 update 5 (32 bit), CUDA 1.0, and mummer 3.19.
We ported the MUMmerGPU alignment kernel to use the CPU instead of the GPU to isolate the benefit of using graphics hardware over running the same algorithm on the CPU. CUDA allows programmers to write in a variant of C, so porting MUMmerGPU to the CPU required only straightforward syntactic changes, and involved no algorithmic changes. Where the CUDA runtime invokes many instances of the kernel on the GPU simultaneously, the CPU executes each query in the block sequentially.
The first test scenario was to align synthetically constructed reads to a bacterial genome. We used synthetic reads in order to explore MUMmerGPU's performance in the absence of errors and over a wider variety of query lengths then are available with genuine reads. The synthetic test reads consisted of 50-, 100-, 200-, 400-, and 800-character substrings (uniformly randomly) sampled from the Bacillus anthracis genome (GenBank ID: NC_003997.3). Thus, each read exactly aligns to the genome end-to-end at least once, and possibly more depending on the repeat content of the genome. When aligning each of the five sets of reads, we used l equal to the read size for the set. Each set contained exactly 250,000,000 base pairs of query sequence divided evenly among all the reads in the set.
For longer reads, the speedup of using the GPU is diminished, because of poor cache performance and thread divergence, both of which are acknowledged as potential performance problems on the G80 [23]. All queries begin at the root of the tree, and many queries will share common nodes on their paths in the tree. However, as the kernel travels deeper into the tree for longer reads, the texture elements stored in the cache are reused less often, thus reducing the cache hit rate, and increasing the overall average access time. In addition, even though queries are the same length, the alignment kernel may not visit the same number of nodes, nor spend the same amount of time comparing to edges, because edges in suffix trees have variable length. This creates divergence among the threads processing queries, and the multiprocessor will be forced to serialize their instruction streams. It is difficult to quantify the relative contribution of these effects, but it is likely that both are significant sources of performance loss.
Runtime parameters and speedup for MUMmerGPU test workloads. MUMmerGPU is consistently more than 3 times faster than mummer for a variety of sequencing data.
Reference length (bp)
# of queries
Query length mean ± stdev.
Min alignment length (l)
# of suffix trees (k)
C. briggsae Chr. III (Sanger)
717.84 ± 159.44
L. monocytogenes (454)
200.54 ± 60.51
S. suis (Illumina/Solexa)
35.96 ± 0.27
For each of the alignment tasks, MUMmerGPU was between 3.47 and 3.79 times faster than mummer. For C. briggsae, MUMmerGPU spent most of its time aligning queries on the GPU. Because we aligned all of the reads from the sequence project against chromosome III of the C. briggsae, many of the reads did not align anywhere in the reference. As a result, a relatively short amount of time was spent in writing alignment output to disk. For other alignments, such as for the L. monocytogenes and S. suis test sets, the output phase dominates the running time of MUMmerGPU. For these tasks, printing the output in parallel with aligning a block of queries would provide substantial speedup, as it would hide much of the time spent aligning queries on the card. We plan to adopt this strategy in a future release of MUMmerGPU.
Despite the performance hazards experienced for longer simulated reads, MUMmerGPU on the GPU consistently outperforms mummer on real sequencing data by more than a factor of three in wall-clock application running time. Unlike the idealized simulated reads, these reads are variable length and have sequencing error, which will cause further divergence in the kernel executions. Furthermore, the C. briggsae alignment required the use of a segmented suffix tree and associated data transfer overhead. In general, MUMmerGPU confers significant speedup over mummer on tasks in which many short queries are aligned to a single long reference.
Operations on the suffix tree have extremely low arithmetic intensity – they consist mostly of following a series of pointers. Thus, sequence alignment with a suffix tree might be expected to be a poor candidate for a parallel GPGPU application. However, our results show that a significant speedup, as much as a 10-fold speedup, can be achieved through the use of cached texture memory and data reordering to improve access locality. This speedup is realized only for large sets of short queries, but these read characteristics are beginning to dominate the marketplace for genome sequencing. For example Solexa/Illumina sequencing machines create on the order of 20 million 50 bp reads in a single run. For a single human genotyping application, reads from a few such runs need to be aligned against the entire human reference genome. Thus our application should perform extremely well on workloads commonly found in the near future. The success of our application is in large part the result of the first truly general purpose GPU programming environment, CUDA, which allowed us to directly formulate and implement our algorithm in terms of suffix tree navigation and not geometric or graphics operations. This environment made it possible to efficiently utilize the highly parallel and high speed 8800 GTX. An 8800 GTX is similar in price to a single 3.0 Ghz Xeon core, but offers up to 3.79× speedup in total application runtime. Furthermore, in the near future, a common commodity workstation is likely to contain a CUDA compliant GPU that could be used without any additional cost.
Even though MUMmerGPU is a low arithmetic memory intensive program, and the size of the stream processor cache on the G80 is limited, MUMmerGPU achieved a significant speedup, in part, by reordering the nodes to match the access patterns and fully use the cache. We therefore expect with careful analysis of the access pattern, essentially any highly parallel algorithm to perform extremely well on a relatively inexpensive GPU, and anticipate widespread use of GPGPU and other highly parallel multicore technologies in the near future. We hope by making MUMmerGPU available open source, it will act as a roadmap for a wide class of bioinformatics algorithms for multi-processor environments.
Availability and requirements
Project name: MUMmerGPU
Project home page: http://mummergpu.sourceforge.net
Operating system(s): Linux, UNIX
Programming language: C, C++, CUDA
Other requirements: nVidia G80 GPU, CUDA 1.0
License: Artistic License
Restrictions to use by non-academics: none.
The authors would like to thank David Luebke from nVidia Research for providing an early release of CUDA, Julian Parkhill from the Sanger Institute for making the S. suis data available, Mihai Pop from CBCB for his assistance obtaining data, and Steven Salzberg from CBCB for editing the manuscript. This work was supported in part by National Institutes of Health grants R01-LM006845 and R01-LM007938, and National Science Foundation CISE RI grant CNS 04-03313.
Authors' Affiliations
- Myers EW, Sutton GG, Delcher AL, Dew IM, Fasulo DP, Flanigan MJ, Kravitz SA, Mobarry CM, Reinert KH, Remington KA, Anson EL, Bolanos RA, Chou HH, Jordan CM, Halpern AL, Lonardi S, Beasley EM, Brandon RC, Chen L, Dunn PJ, Lai Z, Liang Y, Nusskern DR, Zhan M, Zhang Q, Zheng X, Rubin GM, Adams MD, Venter JC: A Whole-Genome Assembly of Drosophila. Science 2000, 287(5461):2196–2204.View ArticlePubMedGoogle Scholar
- Pop M, Phillippy A, Delcher AL, Salzberg SL: Comparative genome assembly. Briefings in Bioinformatics 2004, 5(3):237–248.View ArticlePubMedGoogle Scholar
- Shaffer C: Next-generation sequencing outpaces expectations. Nat Biotechnol 2007, 25(2):149.View ArticlePubMedGoogle Scholar
- Kurtz S, Phillippy A, Delcher AL, Smoot M, Shumway M, Antonescu C, Salzberg SL: Versatile and open software for comparing large genomes. Genome Biol 2004, 5(2):R12.PubMed CentralView ArticlePubMedGoogle Scholar
- Delcher AL, Kasif S, Fleischmann RD, Peterson J, White O, Salzberg SL: Alignment of whole genomes. Nucleic Acids Res 1999, 27(11):2369–76.PubMed CentralView ArticlePubMedGoogle Scholar
- Delcher AL, Phillippy A, Carlton J, Salzberg SL: Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Res 2002, 30(11):2478–2483.PubMed CentralView ArticlePubMedGoogle Scholar
- Atschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. J Mol Biol 1990, 215: 403–410.View ArticleGoogle Scholar
- Pearson W, Lipman D: Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 1988, 85: 2444–2448.PubMed CentralView ArticlePubMedGoogle Scholar
- Brudno M, Do C, Cooper G, Kim M, Davydov E, Green E, Sidow A, Batzoglou S: LAGAN and Multi-LAGAN: efficient tools for large-scale alignment of genomic DNA. Genome Res 2003, 13: 721–731.PubMed CentralView ArticlePubMedGoogle Scholar
- Hohl M, Kurtz S, Ohlebusch E: Efficient multiple genome alignment. Bioinformatics 2002, 18(Suppl 1):S312-S320.View ArticlePubMedGoogle Scholar
- Kurtz S, Choudhuri J, Ohlebusch E, Schleiermacher C, Stoye J, Giegerich R: REPuter: the manifold applications of repeat analysis on a genomic scale. Nucleic Acids Res 2001, 29: 4633–4642.PubMed CentralView ArticlePubMedGoogle Scholar
- Weiner P: Linear pattern matching algorithms. Proceedings of the 14th IEEE Symposium on Switching and Automata Theory 1973, 1–11.View ArticleGoogle Scholar
- Ukkonen E: On-line construction of suffix-trees. Algorithmica 1995, 14: 249–260.View ArticleGoogle Scholar
- Gusfield D: Algorithms on strings, trees, and sequences: computer science and computational biology. New York: Cambridge University Press; 1997.View ArticleGoogle Scholar
- Owens JD, Luebke D, Govindaraju N, Harris M, Krüger J, Lefohn AE, Purcell T: A Survey of General-Purpose Computation on Graphics Hardware. Computer Graphics Forum 2007, 26: 80–113.View ArticleGoogle Scholar
- Govindaraju NK, Larsen S, Gray J, Manocha D: A memory model for scientific algorithms on graphics processors. In SC'06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing. New York, NY, USA: ACM Press; 2006:89.View ArticleGoogle Scholar
- Harris MJ, Coombe G, Scheuermann T, Lastra A: Physically-Based Visual Simulation on Graphics Hardware. Proc 2002 SIGGRAPH/Eurographics Workshop on Graphics Hardware 2002.Google Scholar
- Juekuan Y, Yujuan W, Yunfei C: GPU accelerated molecular dynamics simulation of thermal conductivities. J Comput Phys 2007, 221(2):799–804.View ArticleGoogle Scholar
- Dally WJ, Labonte F, Das A, Hanrahan P, Ahn JH, Gummaraju J, Erez M, Jayasena N, Buck I, Knight TJ, Kapasi UJ: Merrimac: Supercomputing with Streams. In SC'03: Proceedings of the 2003 ACM/IEEE conference on Supercomputing. Washington, DC, USA: IEEE Computer Society; 2003:35.View ArticleGoogle Scholar
- Buck I: Taking the Plunge into GPU Computing. In GPU Gems 2. Edited by: Pharr M. Addison-Wesley; 2005:509–519.Google Scholar
- Liu W, Schmidt B, Voss G, Schroder A, Muller-Wittig W: Bio-Sequence Database Scanning on a GPU. 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2006) (HICOMB Workshop), Rhode Island, Greece 2006.Google Scholar
- Charalambous M, Trancoso P, Stamatakis A: Initial Experiences Porting a Bioinformatics Application to a Graphics Processor. In Proceedings of the 10th Panhellenic Conference on Informatics (PCI 2005). Volos, Greece: Springer LNCS; 2005:415–425.Google Scholar
- nVidia: nVidia Compute Unified Device Architecture (CUDA) Programming Guide, version 1.0. 2007.Google Scholar
- Mellor-Crummey J, Whalley D, Kennedy K: Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings. Int J Parallel Program 2001, 29(3):217–247.View ArticleGoogle Scholar
- Newegg.com[http://www.newegg.com]
- Streptococcus suis sequencing project[http://www.sanger.ac.uk/Projects/S_suis/]
- Stein LD, Bao Z, Blasiar D, Blumenthal T, Brent MR, Chen N, Chinwalla A, Clarke L, Clee C, Coghlan A, Coulson A, D'Eustachio1 P, Fitch DHA, Fulton LA, Fulton RE, Griffiths-Jones S, Harris TW, Hillier LW, Kamath R, Kuwabara PE, Mardis ER, Marra MA, Miner TL, Minx P, Mullikin JC, Plumb RW, Rogers J, Schein JE, Sohrmann M, Spieth J, Stajich JE, Wei C, Willey D, Wilson RK, Durbin R, Waterston RH: The Genome Sequence of Caenorhabditis briggsae: A Platform for Comparative Genomics. PLoS Biology 2003., 1(2):Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


text:
Joan at Chocolate, Chocolate and more made Grasshopper Pie
Carrie at Carrie's Experimental Kitchen made an Irish Feast
Kimiko at Beachside Baker made a Shamrock Shake
Melissa at Chin Deep made Apple Bramble Cake with Bushmill's Custard
Lesa at Edesia's Notebook made Corn Beef and Cabbage Soup
Michaela at Affair from the Heart made Irish Cream Cheesecake
I usually end up baking something to blog but this time, I wanted to share Irish Stew and Colcannon instead. I went on a search for St. Patty's Day recipes and Colcannon was included. Having no idea what it was, I took a look and so glad I did. Mashed potatoes, cabbage, ham...foods I love all mixed together with a lot of butter and milk. Mmmmm Mmmmmm Mmmmmmm! To add to the yumminess of the dish, I found a folk song to go with it. LOVE! After you view the recipes and listen to the great song that is stuck in my head now, please visit my lovely friends in our...St. Patty's Day Blog Hop! <3 and hUgs!
6-8 medium potatoes
1 head cabbage, cored and shredded
3/4 to 1 pound smoked ham, diced
4 scallions, sliced
1 stick butter, cut in slices..room temperature
1/2 to 1 cup warm milk
salt and pepper to taste
fresh, or dried, parsley for topping
Play song while you cook this great dish. Boil potatoes in salted water until fork tender. Drain. Mash together with butter and enough milk to your desired consistency. Cover cabbage with water, add ham and boil until tender. Take cabbage out of pot and chop into small pieces along with ham. Gently mix cabbage, ham and scallions with mashed potatoes. When you serve, make an indentation in the middle, add butter and sprinkle with parsley.
Did you ever eat Colcannon, made from lovely pickled cream?
With the greens and scallions mingled like a picture in a dream.
Did you ever make a hole on top to hold the melting flake
Of the creamy, flavoured butter that your mother used to make?
Yes you did, so you did, so did he and so did I.
And the more I think about it, sure, the nearer I'm to cry.
Oh, wasn't it the happy days when troubles we had not,
And our mothers made Colcannon in the little skillet pot.
Did you ever take potato cake in a basket to the school,
Tucked underneath your arm with your book, your slate and rule?
And when the teacher wasn't looking, sure, a great big bite you'd take,
Of the creamy flavoured buttered soft and sweet potato cake.
Did you ever go a-courting as the evening sun went down,
And the moon began a-peeping from behind the Hill o' Down?
As you wandered down the boreen where the leprechaun was seen,
And you whispered loving phrases to your little fair colleen
|This is all that was left to take a picture of. :D
Irish Stew
1 1/2 pounds stew meat or chuck roast cut in cubes
1 onion, cut in large pieces
4-6 potatoes, cut in cubes
3 carrots, sliced
3 stalks celery, sliced
6 cups beef broth
1 teaspoon garlic powder
1 teaspoon thyme
1 large bay leaf
salt and pepper to taste
1/2 cup seasoned flour or flour
Toss stew meat in flour. Cover bottom of heavy pot or skillet with oil and brown meat. Add onion and cook until lightly browned. Add 4 cups beef broth, 1 1/2 stalks sliced celery, garlic, thyme and bay leaf. Bring to a boil and simmer for 1 1/2 hours. Stirring occasionally. Add potatoes, carrots, remaining celery and broth. Cook until vegetables are tender, around 20 minutes. Enjoy! <3 and hUgS!
You may enjoy these also:
Corned Beef, Cabbage and Portobello Wheat Pizza
Non-Traditional Irish Soda Bread
You may enjoy these also:
Corned Beef, Cabbage and Portobello Wheat Pizza
Non-Traditional Irish Soda Bread


text:
Atlantic 03 are a Fitout Contractor specialising in the Interior Fitout or refurbishment of your workplace weather it be an Office / Industrial unit / Public Building / School / College or Live-workspace etc
We offer a complete Planning, design and installation service with the added advantage of a comprehensive aftercare service. All aspects of the Project can be carried out by Atlantic, providing a full turnkey package for all our Clients needs.
Atlantic aim to become a trusted and innovative Business partner with all our Clients, with the goal of ensuring a repeat business culture beneficial to both parties in the short and long term.
Our comprehensive list of Services can be assessed in the following pages and any queries can be dealt with through our e-mail link or by contacting us directly.
Atlantic proudly hold full membership of the AIS - our trade association and undergo a stringent ongoing vetting process as part of our Membership conditions.


text:
The City of McCleary is governed by a Mayor and five Councilmembers. The Mayor is elected directly by the voters and is the principal administrator. He leads Council meetings and votes only to break ties.
Meetings are held every 2nd and 4th Wednesday. Meetings start at 7:00 p.m.
Council will be on the summer meeting schedule, which is the 4th Wednesday of the month only during the months of June, July and August.


text:
ASUS Eee PC 1215N
|atl1c [1]
|brcmsmac[broken link: invalid section]; broadcom-wl
|i915; nvidia[broken link: invalid section]; noveau[broken link: invalid section]
|uvcvideo[broken link: invalid section]
|Card Reader
|Function Keys
|eeepc-wmi [2]
This page includes general information regarding ASUS Eee PC 1215N and related notes on installing/using Arch Linux on it.
System Specs
CPU: Intel Atom D525 (Dual Core; 1.8GHz; Codename Pineview)
RAM: 1-2 x 1GB DDR3 SO-DIMM; 800 MHz (Maximum 4 GB)
GPU: nVidia ION2 (GT218; 16 CUDA cores; 475 MHz; 256 MB DDR3) wikipedia:Nvidia_Ion#Ion_2_.28next-generation_Nvidia_Ion.29 / Intel Graphics Media Accelerator on CPU die (Intel GMA 3150; 400 MHz; 256 MB Max Shared Memory [3])
South Bridge: Intel ICH7-M wikipedia:List_of_Intel_chipsets#Southbridge_9xx_and_3.2F4_Series_chipsets
Audio: Intel High Definition Audio Controller
Display: 12.1" 1366x768 LED display
Wireless: Broadcom BCM4313 802.11b/g/n
Ethernet: Qualcomm Atheros AR8152 v2.0 10/100 Mb
Bluetooth: BCM4313 Bluetooth v3.0 + HS
Webcam: Azurewave 0.3 MP (VGA)
Expansion / Connectivity: USB (3 x USB 2.0); Video Ports (VGA, HDMI); Audio Ports (Out 3.5 mm, In 3.5 mm); Card Reader (SD/ SDHC/ SDXC/ MMC)
Extras: Two USB 3.0 ports (optional)
Wireless and Bluetooth
With the Kernel 3.0 and after, there is no need for any of the procedure below, because Wireless and Bluetooth work out of box.
Media- and FN-keys
example ~/.xbindkeysrc configuration
#Muter/UnMute "amixer set "Master" toggle" m:0x0 + c:121 XF86AudioMute #Volume up "amixer set "Master" 5%+" m:0x0 + c:123 XF86AudioRaiseVolume #Volume down "amixer set "Master" 5%-" m:0x0 + c:122 XF86AudioLowerVolume #MPD next song "mpc next" m:0x0 + c:171 XF86AudioNext #MPD stop playing "mpc stop" m:0x0 + c:174 XF86AudioStop #MPD prev song "mpc prev" m:0x0 + c:173 XF86AudioPrev #MPD pase/unpause "mpc toggle" m:0x0 + c:172 XF86AudioPlay
nVidia ION 2 with Optimus
nVidia Optimus is basically a software configuration that utilizes an Intel IGP + an nVidia GPU that writes to the Intel IGP's framebuffer. This is all done on the software side. The nVidia GPU is not wired to the outputs (VGA, HDMI etc.) At the time of this writing (September 27, 2010) Optimus on Linux sucks (i.e. doesn't work at all). You can still use the Intel IGP, but there is no way to access the discrete GPU. DO NOT try to install the nVidia binary driver, you have been warned.
Things are not that bad however. There is a kernel module called "acpi_call" which enables you to power off the nVidia GPU, hence you can significantly improve battery life.
David Airlie seems to be working on PRIME support (google it). You can also try "bumblebee-git" from the aur, which is the first working soloution to get the nvidia-card besides the intel gpu working.
Module auto-detection may load the nouveau module, but this sometimes seems to cause X to crash after boot-up, so try blacklisting this module if you encounter this problem.
There is a new project, called Bumblebee (Transformers reference) that allows you to use the Nvidia Optimus ION2, but not natively, you have to instale it, and then call each program on the terminal with a command.
Bumblebee Installation
Recently tested Bumblebee installation with kernel 3.1.8 and nvidia driver 290.10, which is installed as part of bumblebee package.
Install Bumblebee from AUR and follow instructions here
Output from Optirun Test
After installation, use
# glxgears
# optirun glxgears
for comparison of integrated and dedicated GPU rendering (integrated GPU ~60 FPS)
The default compression method for the dedicated GPU is "proxy" (lower compression).
By changing the compression method while using Nvidia Optimus, the FPS can be increased or decreased, some results (by compression method and approx. FPS, respectively):
proxy 220, jpeg 340, rgb 280, yuv 330.
Power Management
On the wiki page, there are warnings about using power management with Bumblebee, essentially turning the card on and off using "acpi_call" module. Testing so far hasn't produced any problems....
The two files, cardon and cardoff, containing the commands used to control Nvidia Optimus need to be created in "/etc/bumblebee" for the 1215n with the following commands:
\_SB.PCI0.P0P4.GFX0._DSM {0xF8,0xD8,0x86,0xA4,0xDA,0x0B,0x1B,0x47,0xA7,0x2B,0x60,0x42,0xA6,0xB5,0xBE,0xE0} 0x100 0x1A {0x1,0x0,0x0,0x3} \_SB.PCI0.P0P4.GFX0._PS3
Relevant links
https://aur.archlinux.org/packages.php?ID=48866 (AUR for Bumblebee)
https://github.com/MrMEEE/bumblebee/ (Bumblebee Project Git)
Nvidia graphic card
On the default kernel (2.6.36 branch) you cannot suspend system after disabling nvidia card with "acpi_call" module (nor after turning it on once you disabed it). This bug affects also turning off laptop (you'll have to manually power off laptop with power button). Using LTS 2.6.32 kernel ("kernel26-lts" package) allows you to safely power off/suspend netbook with disabled nvidia card (but with older kernel you won't be able to use some eee Fn hotkeys: disabling LCD/external output, volume controls, playback controls).
Update (after a little testing):
With the latest kernel running (3.0) and the "acpi_call" module installed from AUR, the suspend and hibernate scripts used by pm-utils will work (from commandline and in Gnome 3) as long as the acpi_call module is added to the suspend modules list used by the scripts.
Create a file
modules in
/etc/pm/config.d and paste in the line below.
Turning on bluetooth freezes the system. Need to do hard reset. No more info about this atm.
CPU power consumption
There is a kernel parameter which must be added in linux 3.0 kernel to use energy saving feature of the intel driver:
pcie_aspm=force i915.i915_enable_rc6=1, see this thread.


text:
In the June 1851 issue of Household Words, Henry Morley provides a mid-Victorian view of Chinese culture in the course of describing his experience of tea gardens, tea houses, and Chinese cuisine. Morely explains that the "tea-gardens are in the centre of the town; we will go thither and rest. We might have dined with a hospitable townsman, where we could have been present at a theatrical entertainment, in which the Chinese delight like children." The narrowmindedness that usually accompanied Victorian imperial thought appears in Morely's last remark, since he doesn't make atoying all clear why taking pleasure in "theatrical entertainment" should be childish or childlike — a thought that comes immediately to mind when one recalls the passion of Dickens, Collins, and their friends for such entertainment, both amateur and professional! The writer for Household Words
But a dinner in this country is a work of many hours; the list is very long of things that we should have to touch or eat. Chinese eat almost anything; their carte includes birds' nests, delicate meal-fed puppies, sea-slugs, sharks' fins and tails, frogs, worms, lizards, tortoises, and water-snakes, with many things that we should better understand, and a great many disguised vegetables. A Chinese dinner is so tediously long that we escape it altogether. Milk is not used; it is thought improper to take it from the calves; and meat plays no very large part in the Chinese diet. During our late war it was seriously stated, by several advisers of the Emperor, that to forbid the English tea and rhubarb would go a great way to destroy the nation; "for it is well known that the barbarians feed grossly on the flesh of animals, by which their bodies are so bound and obstructed," that rhubarb and warm tea were necessary to be taken, daily, as correctives. Now we are in the tea-gardens, and have passed through a happy crowd, sipping tea, smoking, eating melon pips, walking or looking at the jugglers. Into a fairy-like house of bamboo, perched over water, we ascend. Here is an elegant apartment, we claim as private. We recline, and take our cups of tea; the cups that have been are wiped, not washed; for washing, say the people here, would spoil their capacity for preserving the pure flavour of this delicate young Hyson; upon a spoonful of which, placed in the cup, hot water is now poured.
Morley, Henry. "Our Phantom Ship. China." Household Words Vol. 3, No. 66 (28 June 1851): 331.
Last modified 24 June 2006


text:
How we establish Escorts girls in Dwarka Agency & favorite in recent this year
Delhi is famous for business companies, night clubs and 5 Star hotels for VVIP and hi-class people. As a top place for tourist and technical peoples, you will find several top businessmen hi-fi society citizens in Dwarka, so businessmen want relaxation here the demand for High profile Model girls is increasing day for entertainment these great industry men. It will strengthen our interest in making reliability and utmost our Escorts Agency in Dwarka More. The Dwarka Escorts Service infinitely attempts the highest level of content to you who were treated clients with top reliability and the utmost honesty. That is why we believe we are different than other agencies because we treat you with regard, girlishness care. Actually we know how important to keep your life more un joyful. College girls in Dwarka More Our top escorts girls are selected to provide the best companionship for every possible occasion. Whether you are looking for a discreet new college girl, a high-profile girls Classical housewife, Russian model a striking beauty for your business meeting or a real girlfriend experience not feel you other partners working with me, reserve a meeting of ultimate pleasure with VVIP Escort in Dwarka in working very high class Punjabi girl so gentlemen if you want good profile and good services so you book our agency in Dwarka new Delhi.
Quantity and Quality Escorts available our Agency Delhi & Make us favorite Hotel the city
We provide female Escort Services in Dwarka More new Delhi to those clients who are keen to meet a clean mind, high profile model and classical escort hotel sensual escorts women, who can please image in bed and can provide an ultimate full satisfaction. Escorts Service in Dwarka More , Good profile most of the independent housewife and girls are having their niche in such service & surprisingly their client demanding increasing every weekend. Mostly girls who are working in the best area like Mahipalpur, Dwarka, Chanakyapuri, Cp , Karolbagh, paharganj and saket here available Independently come from different professional field like modeling, acting, call center, Air-hostess, BPOs, colleges, hotel industry & many others and have their ambitions. And they best would like to perform good during the services in the our escorts agency working best to best service in Delhi.
Best Escorts Service Available in Dwarka Hotel and Flats Both Services
Beautiful Escorts Agency is working long time in Delhi my company want only client satisfaction in Escorts Services, Some of the most amazing model babes we have here with us at our Dwarka agency at working good Profile Indian and Foreigners Sexy College Call Girls in Dwarka, Independent Escorts service in Dwarka new Delhi, Russian girls in Dwarka, hi-profile escorts in Dwarka More, top escorts girls in Delhi Dwarka, are the sexy college babes. Dwarka More is a beautiful city in Delhi and there is whole lot of things that you can explore. This is the reason we here at our erotic agency at Sexy model college Call Girls in Dwarka More have some of the most sexy amazing babes and some of the juiciest hot call girls at who are all in their youth. Obviously these girls in their youth have some of the most special skills while in bed with their clients so guys enjoying good time for the best time with partners. Hey each of these young girls from the house of Sexy College call girls in Dwarka More have some of the most girls amazing bodies and all thanks to the top beautiful parlors they visit on a regular basis. Escorts beauty girls from the house of escorts in Dwarka More have some of the most stunning personalities and so spending a night with one of these young girl would be an experience that would be entirely different & thrilling.
Safe and Secure available Our Escorts Services in Dwarka More New Delhi
We know first your privacy, safety and security most important to our purchasers. we confirm that our consumer is safe and secure that we prepare the Dwarka More Indian capital Escorts service in 5-star hotels Dwarka Chanakyapuri,CP, Dwarka, and Vasant kunj, we don't require any identity of our client, and rather we just confirm the consumer is real through the meeting with beauty sexy babes. therefore our client privacy and security is the highest priority for us and our agency working Delhi.
Hot Female know very well how to bring boys exotioness
Our beautiful state Delhi India so are here working good profile escorts girls and independent housewife classical in the escorts hub hot that of their body will offer you a tough on feelings. however few men would like some further in order that they are able to bring out the sexy animal of independent they will ensure your satisfaction and check out to bring your lust at the highest and provides you a heavenly feeling. we are going to prepare meeting with Female Escorts in Dwarka More as your companion at your door inside a time unit. If you are initial time client, then it's necessary for North American country to form your expertise additional gratifying. we tend to serve with heart, and our Escorts look just for hardcore love creating.
Escorts Dwarka ! Fun Time With a Escorts companion/ how to get services
Capital of India in we offer a wide VIP variety of times fun Escort girls hot and sexy services to keep you refreshment and tension free time for the enjoy. Our Escorts Company makes you happy in a way that you internal escorts animal gets satisfied dear you have a best great chance to you enjoy our famous Dwarka in Escorts Service to book it online with our manager service response call with a phone. Dear friend this is my contact number 99xx99XX21 so any time you can calls actually we will ask you requirements and according to you here available all type of category like Indian foreigner and VIP Model escorts girls available private place and hotels, and dear erotic fun do you want any type profile so tell me your budget and hot profiles. We will arrange a Female model escorts in Dwarka More and will rich at your place with short time and longs time you can come my private flats and 1,2,3,4,5 star hotels rooms. We let see the High-Profile, Celebrity and TV actress south models so let choose as per your need. We make the Best fast service and give all kink of support and we try to fulfill all our clients need and time in the working days 24hour and 7days.
Best Location we are deals in Hotel near IGI Airport Delhi, beautiful escorts girls, top model girls, high profile girls, Independent girls, Punjabi escorts girls, college girls, top escort agency in Dwarka More, nepali escorts, Russian girls, Model Russian
Sexy Female Escorts in Dwarka More can be a Perfect Companion for Business Tours in Delhi
Best Dwarka More Escort girls are always in great demand due to the versatility & excellent good service quality. The Call and escort girl in Dwarka More escorts are really appealing and seductive. The escort housewife independent model in Dwarka More belongs to various categories. These may include blonde, busty women, brunette, slim, gorgeous tall and many curve body more. The wide range of category allows an independent model to make a choice on his own depending on his preference. This is actually quite helpful for people who want the availability of good categories come to our escorts in-call and our call place in Delhi/NCR.
SOCIAL MEDIA SITES ON Escorts Service in Dwarka More
Call Us -->> +91-99xx99XX21 Bansal
Escorts Location
- Escorts Service in Dwarka
- Dwarka Escorts
- Escorts girls in Sector-1
- Escorts girls in Sector-2
- Escorts girls in Sector-3
- Escorts girls in Sector-7
- Escorts girls in Sector-10
- Escorts girls in Sector-13
- Escorts girls in Sector-18
- Escorts girls in Sector-21
- IGI10 12 21mohan gardenom viharsagarpurhigh profile escorts in dwarka Escort in Aerocity Hotel Escorts in Aerocity Metroin-calls mahipalpur
In-Calls Dwarka
- Escorts in Mahipalpur
- Escorts in Uttam Nagar
- Escorts in Nawada
- Escorts in Palam
- Escorts in Dwarka mor
- Escorts in Om Vihar
- Escorts in Uttam nagar East Escorts in Uttam Nagar west Escorts in mahavir Enclave Escorts in Sagarpur Escorts in Delhi cantt Escorts in Dhaula Kuan Escorts in Aerocityrussian in mahipalpurnear redissionrussian escorts in dwarka Call girl in Tilak Nagar
Call On Mahipalpur
- Call girl in Dwarka
- Call girls in Uttam nagar
- Call girls in Hotel Dwarka
- Call girls in Janakpuri
- Call girls in Palam
- Call girl in Mahavir Enclave
- Call girl in Dhaula kuan Call girl in Mahipalpur Call Girl in Aerocity Call girls in Airport Delhi Call girl in Delhi Cantt Call girls in Sector-21 Dwarka Call Girl in Dabari more Call girls in Nawadaindependent escorts Call girl in IGI Airport Delhi
Other location
- Call girl in Rajapuri
- Call girls in Jivan park
- Call girls in DC
- Call girls Dwarka Metro
- Call girls Sector-12 Metro
- Call girl in Sector-10 Metro
- Call girl in Amarai Village Hotel Taj 22 Sector Dwarka Near redission blue Near Welcome 19 sector Call girl in Palam Colony Call girls in Vasant Vihar Call Girl in Shankar vihar Call girls in Vasant kunjhousewife escorts in dwarka


text:
MBRAUN's High Pressure (HP) Gas Purifiers are utilized in a variety of applications and is most often used as a pre-purifier of all in-house gas supplies along with providing oxygen free dry gas for inert gas purge boxes. Unlike other inertgas purifiers, systems of the HP-series are able to supply highly pure gas at pressure levels of up to 6 bar.
The HP series gas purifiers include a double filter setup allowing one filter column to be regenerated while the other stays active. A zeolite with a specific pore size allows obtaining moisture levels of less than 1 ppm whereas oxygen is removed to the same concentration by means of a copper catalyst.
The HP series gas purifier can also be connected to a compressor for the recirculation of pneumatic operation gases for application in inert gloveboxes. Special configurations can be provided for the removal of other contaminants from ambient air. Please contact us for more information.
- Available version for clean dry air (CDA)
- Pre-purification of an in-house gas supply
- Pressurized inert gas supply for purge boxes
- In connection with a compressor for the recirculation of pneumatic operation gases for applications in inert gloveboxes
- Special applications on request (e.g. removal of moisture and other contaminations from ambient air)
- Stainless Steel dual filter columns
- CE compliant


text:
If you have forgotten your password please contact the branch either by
Email: email@example.com
Phone: (08) 8948 0994
Member Number
Forgot Password?
MyScout® works best on browsers that meet our minimum requirements. Click here for the environment test.
MyScout® is a registered trademark of The Scout Association of Australia, South Australian Branch Incorporated.


text:
THE ''Mean Machine'' gold medallist Neil Brooks is busking on the streets of London trying to earn a living.
Brooks, part of the 1980 Moscow Olympics gold medal-winning swimming relay team, went on to become a high-profile Channel Seven presenter before fleeing Australia with his wife, Linda, and son, Levi, and daughter, Brooke, in September 2010, after multimillion-dollar business deals collapsed amid claims and counter-claims of fraud.
Brooks was attacked on the Gold Coast by two men and he claimed his life had been threatened, forcing him to go into hiding, first in France and then in England.
The former swimmer is now preparing to visit Australia with plans to sue Channel Nine's A Current Affair for defamation over stories it ran on his business collapse.
Brooks said he is putting his Olympic gold, silver and bronze and four Commonwealth Games gold and silver medals up as surety to pay legal fees.
Speaking from London, he said he was finding it impossible to get work because of media reports on his business dealings.
Brooks said it was unlikely he would return to live in Australia, at least for now.
''The perception of being a fraud - albeit not true - is really difficult to live with. It hangs over my head every day like the toxic cloud that it is.''
Brooks agrees that many of his problems throughout his media career were self-induced, and related to alcohol - a battle he now claims he has won.
A major reason for Brooks's departure from Australia was his fear for the safety of his family. He's less anxious now.
''I totally have the booze under control,'' he said.
''There was a time when drinking was simply habit, but I lead a much healthier lifestyle now. I've started doing triathlon again and want to compete at the 2015 world championships in Adelaide for my age group, so I'm back training twice a day.
The perception of being a fraud - albeit not true - is really difficult to live with. It hangs over my head every day like the toxic cloud that it is.
''Since leaving Australia in 2010, I've become an instructor in hand-to-hand combat specialising in knife and gun attacks and trained with guys that work with the CIA, Mossad and Secret Service.''
Now music dominates Brooks's life. ''I've been a social musician most of my life, which was always just a bit of boozed-up fun most of the time in pubs and clubs,'' he said. ''But now I take it really seriously and because I've had so much spare time over the last couple of years I've worked really hard on my guitar playing to get to a level where I can seriously put something to market and my songwriting has started to really develop.
''Before the weather got too cold in the UK I was busking in town most days and making a few bob, putting food on the table.
''I had an Aussie bloke walk past me one day with a few of his mates - they were backpacking around Europe - and he says: 'Hey mate, do you know Khe Sanh by Cold Chisel?' … They thought I was just a local geezer, so I said back to him in a cockney accent, 'put five quid in me guitar case and I'll give it a go'. Easiest fiver ever made.''
Brooks admitted that many of his problems were down to his own reckless nature.
''I was always a flawed human being that generally came undone through not managing a serious drinking problem, particularly in my later swimming days and media career,'' he said.
''At the end of the day I can live with that but I'm not a fraud and I didn't steal $2 million.''
Neil Brooks's autobiography In The Deep End will be released through Amazon on March 20.