text:
Rising Sun
Credits & Info
- Date
- 04/09/2012
- File Info
- Song
- 2 min 44 sec
- Score
- 4.62 / 5.00
Related Content
Heard in 7 Entries!
View all submissions featuring this audio file.
You might also enjoy:
Licensing Terms
You may not use this work for commercial purposes without making specific arrangements with the artist UNLESS your work is a web-based game or animation, in which case you may use this freely.
- Score:
- Rated 4.62 / 5 stars
- Plays & Downloads:
- 58,065 Plays | 5,225 Downloads
- Share Links:
- Genres:
- Electronic - Video Game
- None
Author Comments
Rated 5 / 5 stars
I really like the sound of this one. Ever since I listened to it for the first time, I've always thought about industry and the blistering sun in the desert in a scorching summer day. I personally think that this would be very suitable for a boss fight in the middle of the desert. Great job, NemesisTheory! I will make sure to listen to more of your amazing work!
Rated 5 / 5 stars
I have another idea for this song. Make a new Fear Unlimited game. Fear Unlimited 3: Written in Blood. This theme could be Waru's theme. You know, like in a samurai warlord who's skilled like a ninja. Wary wears black armor and has glowing blue eyes. His name means evil in Japanese and he uses a katana of glowing blue energy. If his health is low, he swings downwards causing it to send waves of glowing blue energy at the player. The boss of mission 4. I'd think it's a good idea.
Rated 5 / 5 stars
kinda a remix of rose at eclipse
Rated 5 / 5 stars
This song makes me think a lot about Sonic '06 and Ratchet: Deadlocked. I love the industrial sound of this song. It'd make for a really good/epic fight scene or something. xD 6/5! :D Or I would if I could. Keep up the good music, NT.
Rated 5 / 5 stars
Just wanted you to know, I played this song using two tabs (for an echo effect), and it sounded even better! You should try it!


text:
The Nationals are signing infielder Alex Cora to a deal worth $900,000 plus $600,000 in incentives, according to Adam Kilgore of the Washington Post. He says it's a minor-league deal, but unless they're planning on paying a 13-year veteran $900,000 to play at Syracuse, it looks like Cora will take the big-league utility spot that opened up when Willie Harris signed with the Mets.
Kilgore also makes the interesting observation that Cora is the ninth member of the Nationals roster represented by agent Scott Boras. By my quick math, those nine players will make a little under $20 million in salary this year. If you figure conservatively that Boras takes 5 percent, that means the Nationals alone are putting a million dollars into Darth Vader's pocket this year. I bet Nationals general manager Mike Rizzo gets a nice Christmas gift from Boras this year.
-- David Andriesen
For more baseball news, rumors and analysis, follow @cbssportsmlb on Twitter or subscribe to the RSS feed.

subset: commoncrawl


text:
"Will definitely order again. Super fast shipment and reasonably priced. Customer service was great also. " (E193)
"Daughter loves them....will be a hit on the lax field..." (E99058)
"AWESOME VALUE and QUALITY!! Wasn't sure what to expect, but, my high school age son is VERY satisfied with this product!" (E15024)
Epic Sports
A4 Adult 9" Color Block Performance Shorts [E67825]


text:
Video: Ronda Rousey on Jimmy Fallon, talks Holly Holm, Mario Kart trove.com/me/content/ZwZ… pic.twitter.com/SGhLDBKpAH
Upcoming Guests
Thu 10/8:Brie Larson
Thu 10/8:CeeLo Green
Thu 10/8:Michael Fassbender
Thu 10/8:Speaker John Boehner
Fri 10/9:Jeff Daniels
Fri 10/9:Nelly
Fri 10/9:Whoopi Goldberg
Mon 10/12:Clive Owen
Mon 10/12:Gabrielle Union
Mon 10/12:Neon Indian
Tue 10/13:Charles Kelley feat. Dierks Bentley & Eric Paslay
Tue 10/13:Eve Hewson
Tue 10/13:Michael Strahan
"Be silly. You're allowed to be silly. There's nothing wrong with it." -- Jimmy Fallon
TweetMichael Fassbender @Fassbender_WayMichael Fassbender, Jimmy Fallon @FallonTonight Talk #SteveJobs and #Macbeth pic.twitter.com/BaOjcN13CqHollywood Reporter @THRMichael Fassbender Talks 'Steve Jobs' With Jimmy Fallon: I'm "Numb When I Watch It" thr.cm/qkjNNJ pic.twitter.com/cnMfTfF9fE0 minutes agoRetweeted by Liz CM Fassbender | MFO @MFOnlineMichael Fassbender on tonight's @FallonTonight with Jimmy Fallon! #SteveJobs #Fassbender credit: fassbender-m http://t.co/02c…M Fassbender | MFO @MFOnlineMichael Fassbender on tonight's @FallonTonight with Jimmy Fallon! #SteveJobs #Fassbender credit: fassbender-m http://t.co/1CL…Hollywood Reporter @THRMichael Fassbender Talks 'Steve Jobs' With Jimmy Fallon: I'm "Numb When I Watch It" thr.cm/qkjNNJ pic.twitter.com/cnMfTfF9fE1 minute agoRetweeted by WHRJasmine || 8 @XsuperfruitflyXOoommmfgg Pentatonix will be on Jimmy Fallon, aaaaaa@!a $%÷/& I WISHED FOR THIS SOOÒ LONG! Jimmy is great!!!jimmy fallon News @jimmyfalIonNewsFranklin High senior wants to shadow Jimmy Fallon - The Tennessean bit.ly/1QcETms1 minute agoRetweeted by Jacc Crackstoneѕαν @Vanna_OJimmy Fallon is my spirit animal
2000 Almost Famous Dennis Hope
2002 The Rutles 2: Can't Buy Me Lunch Reporter
2003 Anything Else Bob
2003 The Entrepreneur Ray filmed in 1998 but released in 2003
2004 Taxi Det. Andrew "Andy" Washburn
2005 Fever Pitch Ben
2006 Doogal Dylan Voice role
2006 Arthur and the Invisibles Betameche Voice role
2006 Factory Girl Chuck Wein
2008 The Year of Getting to Know Us Christopher Rocket
2009 Whip It Johnny Rocket
2009 Arthur and the Revenge of Maltazard Prince Betameche Voice role
2010 Arthur 3: The War of the Two Worlds Prince Betameche Voice role
2011 Bucky Larson: Born to Be a Star Himself Cameo
2004 Saturday Night Live Himself / Various 120 episodes
1998 Spin City Photographer Episode: "The Marrying Men"
2001 Band of Brothers 2nd Lt. George C. Rice Episode: "Crossroads"
2002 2002 MTV Video Music Awards Himself / Host TV Special
2005 2005 MTV Movie Awards Himself / Host TV Special
2006 Night of Too Many Stars: An Overbooked Event for Autism Education Barry Gibb TV Special
2009–12 30 Rock Himself / Young Jack 4 episodes
2009–14 Late Night with Jimmy Fallon Himself / Host Also writer & executive producer
2009 The Electric Company Himself 8 episodes
2009 Sesame Street Wild Nature Survivor Guy Episode: "Wild Nature Survivor Guy"
2009 Family Guy Himself (voice) Episode: "We Love You Conrad"
2010 62nd Primetime Emmy Awards Himself / Host TV Special
2011 Saturday Night Live Himself / Host Episode: "Jimmy Fallon/Michael Bublé"
2011 Silent Library Himself Episode: "Jimmy Fallon/The Roots"
2011 Top Chef Himself Episode: "Feeding Fallon"
2012 iCarly Himself Episode: "iShock America"
2013 Saturday Night Live Himself / Host Episode: "Jimmy Fallon/Justin Timberlake"
2014 The Tonight Show Starring Jimmy Fallon Himself / Host Also writer & executive producer
Source: Wikipedia


text:
Resolution: standard / high
Figure 1.
Hazard ratio for risk of all-cause death by different values of the mortality score. The model was adjusted for age, gender, poverty to income ratio, race/ethnicity, smoking behavior, alcohol consumption, vigorous physical activity, Charlson Comorbidity Index, and BMI.
Van Hemelrijck et al. BMC Public Health 2012 12:895 doi:10.1186/1471-2458-12-895


text:
Euro zone finmins back Asmussen for ECB: source
Oct 3, 2011, 8:56 a.m.
Luxembourg (Reuters) - Euro zone finance ministers on Monday endorsed Joerg Asmussen as the candidate to replace Juergen Stark on the executive board of the European Central Bank, a euro zone source said.
A European Union summit is set to decide on October 17 on Asmussen's nomination.
(Reporting by Ilona Wissenbach)
Most Recent
Creedence Clearwater Revisited takes fans back 45 yearsFor Creedence Clearwater Revisited drummer Doug Clifford, playing in the Valley is ...
One person...Six questions with Debbie Rich"One person...Six questions" is a continuing series of columns about Tucson-area residents ...
- My nightmare is always the same.


text:
Ratings based on 354 Verified Reviews
They paid and stayed. We double-checked.
4.4 Room cleanliness
4.3 Service & staff
4.4 Room comfort
4.3 Hotel condition
They paid and stayed.
We double-checked.
We double-checked.
for Everyoneby A verified traveler from WA
Posted Oct 11, 2015
Quiet location, good staff, Bean the dog was a kick, and the cookies were great.
for Everyoneby A verified traveler
Posted Sep 12, 2015
Wonderful stay, would recommend it. King bed was very comfortable.
for Everyoneby A verified traveler
Posted Sep 3, 2015
Nice place to stay Needs airport shuttle service
for Everyoneby A verified traveler
Posted Aug 17, 2015
They provided essentials I forgot - razor, toothpaste
by A verified traveler from Tallahassee
Are you kidding me?Posted Aug 6, 2015
Pros: Location near airport.
Cons: Use odor free chemicals to clean your carpets in rooms and hallways.
Location: Didn't stay long enough to notice.
When I booked a hotel room in Kalispell for over $100 more than that same room has run in many other cities, I assumed i would at least be getting some value for the extra cost. Boy was I wrong! We were leaving at 4:00am to catch our flight home and was just looking for a decent hotel for a quick night's sleep. The room smelled like a wet dog and flea shampoo. Now it was on me that I forgot that La Quinta was the dog friendly hotel...but for $229 per night in Montana, was not expecting this. Now I wish I had sprung for the extra $50 and stayed at the much nicer Hampton Inn that started our trip to Glacier NP. The staff seemed like they wished they were somewhere else also. So, I survived the 12 hour adventure without and flea bites but that is the best I can say.
for Couplesby Pam from Lundbreck, Alberta
Posted Jul 2, 2015 on Hotels
This was our first stay at this hotel and we will definitely be back. The room was spacious, clean and the beds were very comfy. Nice hotels are notoriously expensive in Kalispell and this was a great hotel for the price.
for Couplesby Morten from Varde
Godt hotel, med meget fin servicePosted Jul 1, 2015 on Hotels
Godt hotel, med fin morgenmad. WIFI super og P-forhold også gode. Dejligt at ankomme til hotel og aircondition bare kører, således at værelset er kølet ned. Super service på hotellet med meget venlig personale. God spisemuligheder i nærheden af hotellet.
for Everyoneby A verified traveler from Apharetta Ga
Posted Jun 29, 2015
Nice hotel right in the Kalispell area. Close to everything. Great staff , room was very nice. Real cold A.C Happen to use this property on first and last day of a week touring Glaicier park and Canada. Ended up in same room both times. How cool.
for Getaway With Friendsby Cesare from Bollate
Hotel di qualitàPosted Jun 29, 2015 on Hotels
Hotel decisamente di qualità che si presenta subito bene con due ragazze gentilissima alla reception. Camere pulite ed ordinate con tutti comfort necessari . Posizione centrale.
for Familiesby Cindy from Montana
Okay, but not great...Posted Jun 27, 2015 on Hotels
We booked a night here so our kids could use the pool after a long, hot day in Kalispell. The pool was great. The person that checked us in was in lala land, but finally got us checked in. There were peanut skins on the floor around the table, so it hadn't been vacuumed well. The beds seemed comfortable at first, but after awhile felt too firm and neither my husband or I slept well. The hotel is pet friendly, but the outside pet area is full of weeks with stickers. Overall I would probably stay here again, but it wouldn't be my first choice.


text:
OSI-Approved Open Source (155)
- GNU General Public License version 2.0 (125)
- BSD License (15)
- GNU General Public License version 3.0 (14)
- GNU Library or Lesser General Public License version 2.0 (2)
- Apache License V2.0 (1)
- Common Public License 1.0 (1)
- GNU Library or Lesser General Public License version 3.0 (1)
- MIT License (1)
- Mozilla Public License 1.1 (1)
- Open Software License 3.0 (1)
- Other License (2)
- Public Domain (2)
- Creative Commons Attribution License (1)
- Linux (151)
- Modern (129)
- Grouping and Descriptive Categories (93)
- Mac (27)
- Windows (19)
- Other Operating Systems (4)
- Embedded Operating Systems (3)
Firewalls Software
- Programming Language: Unix Shell ×
IPCop Firewall
Linux firewall distribution geared towards home and SOHO users.4,469 weekly downloads
Smoothwall is a best-of-breed Internet firewall/router, designed to run on commodity hardware and to provide an easy-to-use administration interface to those using it. Built using open source and Free software, it's distributed under the GNU Public License.7,780 weekly downloads
BASE is the Basic Analysis and Security Engine. It is based on the code from the Analysis Console for Intrusion Databases (ACID) project. This application provides a web front-end to query and analyze the alerts coming from a SNORT IDS system.292 weekly downloads
Shoreline Firewall (Shorewall)
An iptables based firewall for systems running the Linux 2.4 or later kernel. Very flexible configuration allows the firewall to be used in a wide variety of firewall/gateway/router and VPN environments.16 weekly downloads
FREESCO router
FREESCO, a NAT/firewall router/server based on Linux and runs on a single 1.44MB floppy. Freesco is very powerful and versatile and can connect multiple home or small office networks to most types of Internet connections including dialup.251 weekly downloads
Anti Spam SMTP Gateway9 weekly downloads
BrazilFW Firewall and Router
A powerful network security tool, easy, safe and totally free.986 weekly downloads
Please see http://firehol.org/ for up-to-date releases and information. FireHOL is a stateful iptables packet filtering firewall configurator. It is abstracted, extensible, easy and powerful. It can handle any kind of firewall, but most importantly, it gives you the means to configure it, the same way you think of it.1 weekly downloads
The WRT54GL Tarifa enhanced firmware. Linksys WRT54G/WRT54GS models V1 to V4 and the WRT54GL V1.x This Third Party Firmware is functionaly the same as the original, the improvements are to make this router more scaleable, by increasing the capacity.13 weekly downloads
PeerGuardian and MoBlock Debian packages
Debian packages for PeerGuardian Linux (including the GUI) and its precessor moblock/blockcontrol/mobloquer. PeerGuardian is a privacy oriented firewall application. It blocks connections to and from hosts specified in huge blocklists (thousands or millions of IP ranges). Its origins lie in targeting aggressive IPs while you use P2P. See http://sourceforge.net/projects/peerguardian/39 weekly downloads
Squid Access Lists Framework
This project consist of a simple framework for creating and managing access rules for the Squid proxy server.1 weekly downloads
SmoothWall Homebrew Mods
This project will serve as a central hosting/bug tracking center for modifications to the SmoothWall.org firewall distribution. Support and information for the "mods" posted here can be found on the SmoothWall.org forums, the SmoothWall.org IRC server, or10 weekly downloads
Kharon Firewall
Kharon Firewall is a shell script based on Iptables and written for Linux 2.4.x and 2.6.x. It can be used for a personnal or a professionnal usage and fully commented on in french.2 weekly downloads
Human Configurator for iptables and tc [traffic control], in order to obtain a traffic-shaping system with a few of click. Basically, it's a perl script which parse an xml config file, where you can put your shaping and filtering rules for your net(s)/h1 weekly downloads
Simple Iptables Firewall
Simple Iptables Firewall2 weekly downloads
GNU Firewalling tools. Formerly known on Freshmeat as ipchains-firewall.1 weekly downloads
HardWall Firewall
HardWall Firewall: Is an iptables script that does the following:- Port Forwarding, Packet Filtering, Statefull Packet Inspection, Port Redirection, Masqurade, SNAT, DNAT, NAT & Bridging - Functions as both a Workstation and IP Forwarding Firewall3 weekly downloads
This is an NIDS/HIDS, Network plus Host based Intrusion Detection System. Este é um NIDS / HIDS, Sistema de Detecção de Invasões Baseado em Redes e em Máquinas.0 weekly downloads
An iptables firewall script for Linux written in bash. Supporting stateful rules, NAT, LOG, MAC matching, VPN, traffic shaping, multiple ext. interfaces, packet marking, syslog logging, sysctl settings, different levels of (coloured) output verbosity1 weekly downloads
A firewall is used to control access to services (eg proxy) depending on the time of day, the day and the hosts the requests come from -- as the need may arise in a school or university. A web interface delegates control of activation to authorized users.1 weekly downloads
chainssh is a shell script to smplify the ssh login via multiple sshgateways/firewallgateaways. e.g. connect from homehost via sshgateway to a clusternode with one command.8 weekly downloads
deface-no-tnx is an anti-defacement system that monitors your Web files and notifies you about unallowed changes. It also replaces the defaced page with a standard "error" page,so that no offensive/joking content can be frauodolently added to your site1 weekly downloads
jRouter is a Web-based Linux router management system. It's designed to be a simple all-in-one router setup and management utility. Allows configuration of network interfaces, dhcpd, iptables, port forwarding, IP/MAC address filters.9 weekly downloads
Alfandega Firewall
Alfandega is a strong and Modular IpTables Firewall. It provides NAT, port-forwarding, spoofing list, blacklist of crackers and spywares sites, protection for tcp/udp scans, DOS/DDOS and Smurf attacks, TCP tuning, DHCP and PPP support and much more.7 weekly downloads
This is an easily configurable firewall which runs under ipchains or iptables (2.2 kernel, or 2.4). Requires no knowledge of iptables/ipchains.1 weekly downloads


text:
Teal Wallpapers by eBook Apps Color lovers: get excited! Color-themed wallpapers are here – and this one is all about teal! If teal is your favorite … 10,000+ downloads, Rating 4.14 (322) Free
31 Free by DKL Games Thirty one game, play it now for free! Enjoy now from hours of entertainment with our smooth gameplay in the 31! Frien … 500+ downloads, Rating 3.83 (6) Free
Transmission by Science Museum Connect to communicate! Transmission is a mind-bending puzzle game where you create communication networks and reveal th … 100,000+ downloads, Rating 4.27 (20596) Free
WYFF News 4 and weather by HTVMA Solutions, Inc. Get real-time access to Greenville, South Carolina local news, national news, sports, traffic, politics, entertainment s … 100,000+ downloads, Rating 4.12 (1008) Free
Loop Alarm Messenger by TOGISOFT 設定したメッセージを指定した一定時間間隔で通知を出し続けます。 … 100+ downloads, Rating 4.00 (2) Free
Collider Quest by beActive Interactive Mysteriously transported to a post-apocalyptic future, six people find themselves involved in a race against time to fin … 10,000+ downloads, Rating 3.52 (170) Free
Mazda Assist by Agero, Inc. Mazda keeps you moving forward with our new free Android app. Say hello to Mazda Assist, a new app designed to help get … 10,000+ downloads, Rating 3.65 (218) Free
Mechanical GO Keyboard by Atisu The "Mechanical" theme for GO Keyboard was specially crafted for you by Atisu. Mechanical. This GO Keyboard theme drawn … 500+ downloads, Rating 3.68 (19) Free
Brick Crusher by Dalmax.Net Brick crusher is a pinball like game, where you move your tablet on the bottom of the screen to hit a ball mantaining it … 50,000+ downloads, Rating 3.79 (295) Free
TradeRev by NthGen Software Inc. TradeRev, an automotive remarketing tool, is redefining the automotive wholesale landscape as one of the most trusted on … 1,000+ downloads, Rating 4.70 (20) Free
Motif Messenger Updated by Mobile Focus (mo-focus.com) Motif Messenger by Mobile Focus is the Android app that lets you configure your ringtone, notification sound and contact … 10+ downloads, Rating 0.00 (0) Free
Lenceria Casa Mario by Polen Comunicaciones El 70 % de las personas en Argentina ya han realizado o realizan compras de ropa o de otros productos en tiendas online … 100+ downloads, Rating 1.00 (2) Free
KATA KATA HIKMAH LAWAK 2015 by Lizdin Enterprise Dapatkan aplikasi android kata - kata hikmah lawak, ayat ayat nasihat dan peringatan yang santai dan bermanfaat. Moga be … 5,000+ downloads, Rating 4.18 (33) Free
Learn Animals by VcareAll Learn Animals Application for Junior Kids invites preschool kids to learn about animals in an attractive way. With Kids … 100+ downloads, Rating 4.50 (8) Free
Verdes Mares - Arroio do Silva New by Streaming Brasil Radio Verdes Mares FM - Arroio do Silva - SC … 0+ downloads, Rating 5.00 (2)


text:
- Find a rental
- Manage your booking
- South Coast rentals
- How to book
- Help Center
- Write a review
Sunrise Villa - Grenada
From $2,000 / week
Description from the manager
Description from the manager
Bedrooms: 4/
Bathrooms: 4/
Sleeps: 9/
Type: House
Sunrise Villa
Fort Jeudy
Breathtaking Verandah Views
This villa is aptly named as the views from the spacious verandah are spectacular. Comfortably accommodating up to 8 guests Sunrise offers a wonderful outside space, ideal for dining, entertaining and cocktails.
4 Comfortable Bedrooms
3 Queen size bedrooms all have private bathrooms. one queen sized bed can be used as a family suite with a shared bathroom with the twin bedroom . This suite would be ideal for a small family.
1 master ensuite with private deck
2 x queen sized bedrooms en suite
1 x twin bedroom annexed to one of the two queens - together form a family suite also has a balcony ...Read more
About the manager
About the manager
Grenadine Island Villas
Grenadine Island Villas
- Response rate: n/a
- Response time: n/a
- Calendar updated: 6 weeks ago
Overall rating:


text:
Ask Us About Our 30-Year Fixed Rates starting at 4.25%
Which apartment/multifamily loan is right for you? 30-year fixed rates starting at 4.25%. Since 1997, we have shopped our network of affiliated lenders to land our clients the best deals on apartment building loans of 5 units or more, and $500,000 plus.
Commercial Loan Blog
September 29, 2014
This is part 4 in a series about hard money commercial lending. For a bit of a review, hard money loans have quite a bit more risk involved than conventional loans, but their purpose is to help you acquire properties that you would not be able to get with a conventional loan. Keep in mind that hard money loans are also called bridge loans.
One example of a hard money commercial loan could be seen in the following scenario: an investor looking to purchase an apartment complex that only has 50% occupancy. She is interested in the apartment complex because... more
September 16, 2015
Recently, I have written two blogs on the topic, "What is Hard Money Commercial Lending?" In this blog, I'm writing Part 3 on the topic. It has to do with 2 very important ways to soften risk when you are acquiring a bridge loan.
In the meanwhile, why do a bridge loan with us? Visit www.bridgeloanstore.com and you will be able to see some competitive bridge loan products. They may surprise you – rates and terms to help you save money. And importantly, check with us to see if we can pre-qualify you for a bridge... more
September 09, 2015
In the previous blog, I covered what hard money commercial lending is as well as how it is different from traditional lending.
Go to www.bridgeloanstore.com to discover what may be important information for you about our commercial bridge loan products. You will be able to learn that we are competitive regarding rates and terms.
A hard money loan (which is often referred to as a bridge loan) is an non-bankable loan. A bank doesn't want to do a hard money commercial loan because there is too much risk for... more
September 04, 2015
Commercial Construction Loans (5 Critical Steps for Success)
It's not easy to obtain a commercial construction loan. People who are successful have learned from experience these 5 critical steps. I have been doing commercial construction lending for 17 years. I have found that many deserving projects fail to produce a loan. This is simply because the... more
August 18, 2015
What is Hard Money Commercial Lending? And how does it differ from traditional lending? Keep in mind that the term bridge loan is often used interchangeably with hard money loan.
Be sure to visit our website: www.bridgeloanstore.com to learn about our great commercial bridge loan products. You can discover how we are competitive when it comes to rates and terms.
Fairview Commercial Lending (www.fairviewlending.com) gives the following definition: "The definition... more


text:
Superman and the Other-Worldly Challenges of Adopting that Baby Who Has Landed in Your Life
Man of Steel
Man of Steel
by Rob Kerby, Senior Editor
So, a small spacecraft crashes into your Kansas cornfield. Inside is a baby. What do you do? If you're familiar with the Superman story, you know that Smallville farmers Jonathan and Martha Kent – played by Kevin Kostner and Diane Lane in the latest retelling, "Man of Steel," from Warner Bros. – accept the child into their home and name him Clark.
page 1 of 16
leave comments
Prayer Quotes for the Sick and the DisappointedThey say that prayer opens door and is a divine connection with God. We should...
11 Weird Things Said to PastorsHere are the 11 weirdest true things said to pastors… many of which are funny,...
Wounded? Tips on How to Empower YourselfIt's important to know how to empower yourself and the actions you'll need to...
More from Beliefnet


text:
Restart of MS SQL Server with EV 10.X
Sorry if this is a newbie question, but I did a bit of searching and did not find best practice discussion on this. I inherited the EV application support at our company when the main EV person left and I am not sure that all the right best practices were being observed with respect to coordination of processes between servers.
I have EV 10.x server. I also have a MS SQL 2008 server servicing the EV 10.x server. When I apply Microsoft Updates to the MS SQL Server and then issue a restart (we do this weekly to refresh the servers and make sure they get updated) I would like to understand what the EV main server is going to do when the SQL Server restarts.
Will the EV server be able to gracefully detect the SQL server is down and just stop attempting to write to the SQL Server (thereby suspending any activities that require SQL server, until it is back up and then autoresume from where it left off) or will this cause major issues (i.e. corruption, EV services will fail and not restart when MS SQL server comes back up, etc...) ?
If it will likely cause issues, is the recommended best practice to stop the VaultStore processes on the EV server for the duration of the SQL Server upate/restart and then issue a restart ?
Is there a technical article on this (as I said, I did look for one) ?
Any information you can provide would be greatly appreciated.
Comments 3 Comments • Jump to latest comment
best practice is to stop all EV services or before making any changes that take down SQL or affect it's availability, especially patching.
Andy Becker | Authorized Symantec Consultant | Trace3 | Symantec National Partner | www.trace3.com


text:
Le Méridien Destinations: All Hotels
Le Méridien PunePhotos
Le Méridien PuneRaja Bahadur Mill RoadPune, Maharashtra, India (91)(20) 6641 1111
SPG Category 2
Le Méridien Bali JimbaranPhotos
Le Méridien Bali JimbaranJalan Bukit PermaiJimbaran, Bali, Indonesia (62)(361) 8466888
SPG Category 4
Le Méridien St. Julians Hotel & SpaPhotos
Le Méridien St. Julians Hotel & Spa39 Main StreetBalluta BaySt. Julians, Malta (356) 2311 0000
SPG Category 3
The information detailed on these pages is subject to change. No representation is made and no warranty given as to the validity of the content, including road conditions, route usability and expeditiousness. The user assumes all risk of use. Microsoft, Starwood Hotels and Resorts, Inc., and their suppliers assume no responsibility for any loss or delay resulting from such use.


text:
and the studying the problems right in Walmarts corporate headquarters area. You idiots should have listened when everyone tried to tell you that Walmart destroys communities. I hope they don't miss Shep when they do their count. http://www.nwaonline.com/news/2011/jan/25/survey-takes-streets-shelters-20110125/
>.Walmart destroys communities<,,,WALMART builds communities by lowering prices! Ofcourse some mom and pop stores cant compete with them, and perhaps unions loose. Sorry if they dont like the WALMART jobs please quit, others will be happy to accept those jobs.
Glad to see you back Larry. I enjoy your posts.


text:
Top tutors from Georgetown and other respected universities serving DC, MD and VA. 98% satisfaction rate
Award Winning Private GMAT Tutoring in Washington DC
We require the most rigorous qualifications from GMAT tutors, in addition to a background check.
Tutors deliver personally tailored GMAT lessons in a one-on-one setting.
We offer an unparalleled satisfaction guarantee with your Washington DC GMAT tutors.
GMAT Tutoring in Washington DC
Customized private in-home and online tutoring
Experience GMAT tutoring by highly credentialed tutors in Washington DC. Top tutors will help you prepare for GMAT through one-on-one tutoring in the comfort of your home, online, or any other location of your choice.
Selected Washington DC GMAT Tutors
We can help you connect with GMAT tutors near you who are ideally qualified to help you. The tutors hail from colleges like MIT, Stanford, UChicago, Yale, Harvard, UPenn, Notre Dame, Amherst, UC Berkeley, Northwestern, Rice, Columbia, WashU, Emory, Brown, Johns Hopkins, Vanderbilt, UNC, Michigan, UCLA, and other leading schools.
Undergraduate Degree:
Hampton University - Business Administration
Graduate Degree:
Hampton University - Business Administration
Undergraduate Degree:
University Of Illinois - Liberal Arts
Graduate Degree:
University Of Maryland - Philosophy
Undergraduate Degree:
University Of Maryland, College Park - Civil Engineering And Geography (Double Degree)
How we help you master: GMAT Prep
You will have learning objectives mapped out by our educational director based on your specific academic needs.
Your tutor will quickly assess your proficiency with the material, and identify areas for improvement.
Your tutor's individualized lesson plans will assist you in realizing your educational goals.
Recent Tutoring Session Reviews
We had a quick review on data sufficiency problems. I gave the students some guidance and strategies on this type of questions. Then I gave her DS problems from different categories (arithmetic, algebra, geometry, statistics & probabilities) to work on and explained the problems to her. This was our last session and I hope Audrey can continue practicing and scores high on the test.
Examined data from the student's past actual and practice tests. Reviewed Quant questions missed on Manhattan test. Introduce 12TEN and other DS methods. Discuss multiple approaches to problem solving and calculation
The student and I covered math concepts involving arithmetic and the properties of numbers. He is definitely improving.
Geometry: lines and angles and triangles. I gave the student some overall E-books about the test. I assigned him some problems and some diagnostic tests that will give us both a better sense of how he's doing.
We covered comparing fractions, multiple fractional subtractions, systems of equations involving fractional amounts. The student is planning on taking a practice verbal and quantitative computerized test on Monday to gauge his current proficiency, test-taking strategies, ways to minimize stress and anxiety prior to testing, and what scores would constitute a below average, an average, and an above average performance.
Numerous problems involving geometry and ratios were carefully reviewed and analyzed in order to illustrate the recurrent themes of admission test's geometry concepts. For example, circles, triangles, or squares are often intertwined in complex geometry problems. Many problems require the test-taker to visualize relationships that are implicit (not drawn) within the given figures or other question stimuli. In other words, successful test-takers must learn to see the "hidden figures" behind each drawing, diagram, or figure. The student is making significant progress, and he must continue to practice.
Tonight we went over ratios and interest examples. We also went through several examples where the student practiced setting up the problems and then we worked through most of them. She will complete a practice test before our next session and will practice a few more examples of applied arithmetic.
The student and I did a quick recap of our math strategies by going over some of the data sufficiency problems he completed over the weekend. We then turned to basic math definitions and arithmetic. Next class we will continue arithmetic and start our review of algebra, in which we will continue to apply our plugging in strategies.
Did plenty of math problems (involving data sufficiency and word problems) today. We'll work on ramping up the difficulty of those problems. Also did a good number of sentence correction.
This is my first session with the student. We reviewed her school choices and the GMAT goals aligned with those school choices. She has not taken recent GMAT practice tests to truly gauge her starting point, so we used a test from a while back to zero in on the areas of improvement to focus on. During the session we solved together Math problems that she had gotten wrong in the practice test to discuss how to solve these problems as well as shortcuts to use (if there were any). We jointly agreed to focus the next 3 weeks on Math primarily (2hrs) and Verbal secondarily (1hr) before we switch and begin intensely focusing on Verbal for the following 5 weeks. We concluded the session by agreeing that the student would find 10-12 exams to take between now and the actual test day. As immediate homework, she would complete 1 Math actual practice test and 2 more practice tests on Math (by picking 36 problems from test prep GMAT books), so that we can use that as a basis for our next session to focus on areas where she still might be having issues.
My second tutoring session with the student went well. We started by reviewing questions from the Reading Comprehension section, and we went over his answers. We moved to the Critical Reasoning section. He identified the boldface questions as the ones he wanted to review, so we reviewed some examples. Then we reviewed quantitative questions, starting with work problems and probability questions in the problem solving section. Next we discussed how to approach data sufficiency questions. I reminded him that he only needs to determine whether there is enough information to solve the problem. We also reviewed Sentence Correction questions and focused on the use of idioms, matching the correct subject to the correct verb, and employing active verbs. For our next session, we will review Reading Comprehension, Critical Reasoning, and Sentence Correction.
Walked through some more complex assessment quant problems as he prepares to take the test again this Saturday.
How can GMAT tutoring help you?
Alexandria GMAT Tutoring, Arlington GMAT Tutoring, Bethesda GMAT Tutoring, College Park GMAT Tutoring, Fairfax GMAT Tutoring, Prince George's County GMAT Tutoring, Reston GMAT Tutoring, Silver Spring GMAT Tutoring, Wilmington GMAT Tutoring, Chester County GMAT Tutoring, Maryland GMAT Tutoring, Baltimore GMAT Tutoring, Columbia GMAT Tutoring, Towson GMAT Tutoring, Rockville GMAT Tutoring
Alexandria GMAT Tutors, Arlington GMAT Tutors, Bethesda GMAT Tutors, College Park GMAT Tutors, Fairfax GMAT Tutors, Prince George's County GMAT Tutors, Reston GMAT Tutors, Silver Spring GMAT Tutors, Wilmington GMAT Tutors, Chester County GMAT Tutors, Maryland GMAT Tutors, Baltimore GMAT Tutors, Columbia GMAT Tutors, Towson GMAT Tutors, Rockville GMAT Tutors
Call us today to connect with a top
GMAT tutor in Washington DC


text:
Medley: Strani Amori - Lettera - Il Mondo Che Vorrei - Il Tuo Nome in Maiuscolo - Laura Pausini (Music Video)
by Muzu (08/24/11) 33 views
Official music video for the track Medley: Strani amori - Lettera -...
There's a new meme -- and these guys are going to stop it. Maybe.
Food that's so comfortable, it'll make you pass out.
In honor of Halloween, which apparently occurs at some point in the near future, we thought we'd go back to one of the classic horror films, A Nightmare on Elm Street.
Ownage Pranks put up a Craigslist ad offering free voice acting lessons. An enthusiastic man responded back right away, and the things they got him to repeat were absolutely hilarious.
We're going the Hollywood route and releasing this video in two parts. You can give us a sin for that, but frankly, we had no choice.


text:
Many Automatic Function Prediction (AFP) methods were developed to cope with an increasing growth of the number of gene sequences that are available from high throughput sequencing experiments. To support the development of AFP methods, it is essential to have community wide experiments for evaluating performance of existing AFP methods. Critical Assessment of Function Annotation (CAFA) is one such community experiment. The meeting of CAFA was held as a Special Interest Group (SIG) meeting at the Intelligent Systems in Molecular Biology (ISMB) conference in 2011. Here, we perform a detailed analysis of two sequence-based function prediction methods, PFP and ESG, which were developed in our lab, using the predictions submitted to CAFA.
We evaluate PFP and ESG using four different measures in comparison with BLAST, Prior, and GOtcha. In addition to the predictions submitted to CAFA, we further investigate performance of a different scoring function to rank order predictions by PFP as well as PFP/ESG predictions enriched with Priors that simply adds frequently occurring Gene Ontology terms as a part of predictions. Prediction accuracies of each method were also evaluated separately for different functional categories. Successful and unsuccessful predictions by PFP and ESG are also discussed in comparison with BLAST.
The in-depth analysis discussed here will complement the overall assessment by the CAFA organizers. Since PFP and ESG are based on sequence database search results, our analyses are not only useful for PFP and ESG users but will also shed light on the relationship of the sequence similarity space and functions that can be inferred from the sequences.
New technologies have resulted in the abundance of sequence data that needs to be assigned with functional annotations. For example, the number of completely sequenced genomes in KEGG [1] database has more than doubled from 2007 (634 genomes) to 2012 (1646 genomes). This rapid growth in the sequenced data coupled with the lack of human resources to manually curate these genomes have resulted into the need to develop computational function annotation techniques [2-6]. The Automatic Function Prediction (AFP) community is attempting to bridge this gap by developing techniques that predict function annotations for proteins. In addition to conventional homology search methods, e.g. BLAST [7], FASTA [8], SSEARCH [9], and motif/domain searches, e.g. PRINTS [10], ProDom [11], Pfam [12], InterPro [13], and BLOCKS [14], several advanced methods were developed that extract function information thoroughly from sequence database search results. These methods include PFP [15,16], ESG [17], GOtcha [18], GOPET [19], OntoBlast [20], GOFigure [21], and ConFunc [22]. On the other hand, SIFTER [23], FlowerPower [24], and Orthostrapper [25] employ phylogenetic trees to transfer functions to target genes in the evolutionary context. There are other function prediction methods considering co-expression patterns of genes [26-30], 3D structures of proteins [31-39] as well as interacting proteins in large-scale protein-protein interaction networks [40-45].
For the advancement of such computational techniques it is very important that there are community wide efforts for objective evaluation of prediction accuracy. Community-wide prediction assessments have become popular in several computational prediction areas. Such experiments include CASP (Critical Assessment of techniques for Structure Prediction) [46] CAPRI (Critical Assessment of PRediction of Interactions) [47], and CAGI (Critical Assessment of Genome Interpretation) (http://cagi2010.org/ webcite). For the field of AFP, some experiments have been held in the past, which include MouseFunc 2006 (http://hugheslab.med.utoronto.ca/supplementary-data/mouseFunc_I/ webcite), ISMB (Intelligent Systems in Molecular Biology) AFP SIG (Special Interest Group) 2005 [48], the 2006 AFP meeting [49], and also the function prediction category in CASP6 [50] and CASP7 [51]. As a part of recently concluded ISMB conference 2011, CAFA (Critical Assessment of Function Prediction) experiment was conducted to gauge the Gene Ontology (GO) [52] prediction accuracy of various AFP methods (http://biofunctionprediction.org/ webcite).
In the CAFA experiment in 2011, in total of 48,298 target protein sequences were released for prediction, which consist of seven eukaryotic genomes, eleven prokaryotic genomes, and a supplementary set of additional sequences. The participating predictor groups were expected to submit GO annotations for these targets in Biological Process (BP) and Molecular Function (MF) domains. Out of these set, the organizers selected 436 targets in BP domain and 366 targets in MF domain that newly obtained experimental annotation in the SWISS-PROT database from January to May 2011, which is after the closing of the submission. Submitted predictions were evaluated using different prediction accuracy measures described in Methods.
We have submitted predictions using two methods developed in our group, the Protein Function Prediction (PFP) method [15,16] or the Extended Similarity Group (ESG) method [17]. PFP and ESG use PSI-BLAST sequence database search results, from which function information is extracted extensively, even from weakly similar sequences. In this article, we analyze the prediction performance of these two methods in comparison with BLAST, the Prior method, and GOtcha [18], whose predictions are provided by the CAFA organizers. Prediction performance evaluation employed four metrics used by the organizers; the threshold method, the top N method, the weighted threshold method, and the semantic similarity method (see Methods). Besides evaluating original predictions by PFP and ESG submitted to CAFA, we further investigated the following to have a better understanding of their performance: 1) For PFP predictions, we reranked predicted GO terms using a different score from the originally used score and compared the performances; 2) We combined PFP and ESG predictions with those from the Prior method that simply ranks GO term by the background frequency in a database; 3) We evaluated prediction accuracies of each method separately for different functional categories; and 4) We examined successful and unsuccessful predictions by PFP and ESG in comparison with BLAST. The in-depth analysis discussed here will complement the overall assessment by the CAFA organizers that will be published elsewhere. Since PFP and ESG are based on sequence database search results, our analyses are not only useful for PFP and ESG users but will also shed light on the relationship of the sequence similarity space and functions that can be inferred from the sequences.
Function prediction methods
In this section we briefly describe the AFP methods that are compared in this study. First we explain the PFP and ESG methods. Then BLAST, the Prior method, and GOtcha, whose prediction results were provided by CAFA organizers, are also described. Predictions in the MF and the BP domain were evaluated by comparing them with annotations with experimental evidences (i.e. non Inferred Electronic Annotations; non-IEA) in the UniProt database. For each target, predictions were restricted to 1000 highest score predictions with the score ranging between 0 and 1.
Protein function prediction (PFP) algorithm
The PFP algorithm [15,16] uses PSI-BLAST to obtain sequence hits for a target sequence and computes the score to GO term fa as follows:
where N is the number of sequence hits considered in the PSI-BLAST hits, Nfunc(i) is the number of GO annotations for the sequence hit i, E-value(i) is the PSI-BLAST E-value for the sequence hit i, fj is the j-th annotation of the sequence hit i, and constant b takes value 2 (= log10100) to keep the score positive when retrieved sequences up to E-value of 100 are used. The conditional probabilities P(fa|fj) are to consider co-occurrence of GO terms in single sequence annotation, which are computed as the ratio of number of proteins co-annotated with GO terms fa and fj as compared with ones annotated only with the term fj. To take into account the hierarchical structure of the GO, PFP transfers the raw score to the parental terms by computing the proportion of proteins annotated with fa relative to all proteins that belong to the parental GO term in the database. The score of a GO term computed as the sum of the directly computed score by Eqn. 1 and the ones from the parental propagation is called the raw score.
In addition to the raw score, we also compute the p-value and the confidence score for a GO term. The purpose of computing the p-value of a GO term is to consider the background distribution of the raw scores of the GO term. It is computed using a term specific raw score distribution obtained from predictions made for protein sequences in a benchmarking dataset of eleven genomes. Then, the confidence score is further computed from the p-value by considering the percentage of correct predictions at each p-value within 0, 2, and 4 edge distance of the target term on the GO structure. In CAFA, predicted GO terms by PFP were sorted by the confidence score.
Extended Similarity Group (ESG) algorithm
ESG [17] recursively performs PSI-BLAST searches from sequence hits obtained in the initial search from the target sequence, thereby performing multi-level exploration of the sequence similarity space around the target protein. Each sequence hit in a search is assigned a weight that is computed as the proportion of the -log (E-value) of the sequence relative to the sum of -log (E-value) from all the sequence hits considered in the search of the same level; and this weight is assigned for GO terms annotating the sequence hit. The weights for GO terms found in the second level search are computed in the same fashion. Ultimately the score for a GO term is computed as the total weight from the two levels of the searches. The score for each GO term ranges from 0 to 1.0.
The prior method
In the prior method, each GO term is assigned the frequency of its occurrence in SWISS-PROT (January 2011 version) including a pseudo count of 1. For a given target sequence, top 1000 GO terms with highest frequencies were selected as predictions. Thus, all target sequences have the same set of predictions by this method. The prior predictions for each target were provided by the organizers.
We have also combined the prior predictions with predictions by PFP and ESG. These predictions are called the enriched PFP/ESG or PFP/ESG + Prior. In PFP + Prior, we added GO terms to PFP predictions that were not predicted by PFP (the expected accuracy was used for the PFP score). The score (i.e. frequency) for GO terms imported from the prior method was rescaled by considering maximum and minimum scores of PFP predictions for that target. GO terms originally predicted by PFP and ones imported from the prior method were sorted by the score. Similar to the PFP + Prior, ESG + Prior also combined the original ESG predictions and GO terms from the prior method that were not predicted by ESG. Since both the ESG score and the frequency in the prior method range from 0 to 1, GO terms from the two methods were sorted by the score without rescaling.
BLAST search [7] with default parameters was performed for each target sequence. The score for a particular annotation term was the maximum sequence identity with the hit annotated with that term. Predictions by BLAST were provided by the organizers.
GOtcha [18] incorporates the hierarchical structure of GO vocabulary with the idea of homology based annotation transfer to achieve improved coverage. It uses BLAST [7] to search similar sequence hits and assigns a score, -log(E-value), to each GO annotation of the sequence hits and its less specific ancestors in the GO hierarchy. The scores assigned to each GO node from all the sequence hits are summed and then normalized using the score of the root of either MF or BP ontology. The normalized score thus obtained is referred as I-score, which was used for selecting target annotations. Predictions by GOtcha were provided by the organizers.
Assessment methods for prediction accuracy
In CAFA, predictions were evaluated using four different methods. The threshold and the top N methods count exact match of predicted and the actual annotations, punishing any predictions that are more or less specific than the actual annotations. On the other hand, the weighted threshold and the semantic similarity take into account the information content of terms being matched on the GO hierarchy. Please refer to the organizers' paper in the same journal issue for more details. We have used Gene Ontology version October 2011 for obtaining ancestors for each GO term.
Threshold method
For each prediction method we use thresholds ranging from 0.01 to 1.0 to calculate the average precision, recall, and specificity for all targets. For each target if a particular prediction has a score above the threshold, the predicted GO term is propagated to the root of the ontology. The performances are analyzed in terms of precision-recall curve and the receiver operator characteristic (ROC). For the threshold method, when using PFP raw scores that are not scaled between 0 and 1, we selected 1 to 1000 GO term predictions by the increments of 5 and compute average precision, recall and specificity for all targets.
Top N
The top N highest scoring predictions for a prediction method are taken into consideration with N varying from 1 to 20. For all the predictions within top N, parental annotations until the root of the ontology are included. All predicted annotations with a tie score at a particular ranking are considered for the cutoff.
Weighted threshold
As shown in Equation 2, frequency of a GO term c in the database is computed as the number of gene products annotated by term c and its children h in the GO hierarchy.
where annot(c) is the number of gene products annotated by non IEA evidence codes in September 2011 version of SWISS-PROT database. Probability of a particular term c, p(c) = freq(c)/freq(root), is computed as the ratio of the frequency of c against the frequency of the root term of the MF or BP ontology. Information content of term c is given by IC(c) = -log10(p(c)). Using this information content, weighted precision is calculated as the sum of information content of the terms in the true positive set divided by the sum of information content of the terms in the true and false positive sets. Similarly, weighted recall is computed as the sum of information content of the terms in the true positive set divided by the sum of information content of the terms in the true positive and false negative sets. As with the previous methods, if a particular prediction is above the given threshold, then its ancestors till the root of the ontology are included in the prediction set.
Semantic similarity
Semantic similarity for a pair of GO terms is given by the maximum information content of a shared ancestor of both terms and it is averaged between all pairs of true and predicted terms to obtain the semantic similarity for a target. We calculate the semantic precision for a target protein as the average of the difference between the IC of a predicted term and the maximum of the IC of common parental terms between the predicted term and any correct term. Similarly, semantic recall is calculated for a target as the average of the difference between the IC of a true term and the maximum of the IC of common parental terms between the true term and any predicted term. Here the information content values are based on the Prior probabilities for each term provided by the CAFA organizers. The average semantic similarity, semantic precision and semantic recall are computed across all targets at each threshold varying from 0.01 to 1.0.
PFP with raw scores
In the CAFA experiment we submitted PFP predictions sorted by the confidence score. In this section, we ranked predicted GO terms by PFP according to the raw score and examined how its performance compared with the confidence score and the other methods. From ranked list of PFP predictions by their raw score, precision, recall, and specificity were calculated at each of the top N predictions taken with an interval of 5.
Figure 1 shows the precision-recall curve and the ROC of PFP with raw score compared with the other methods. For the BP domain, we observe that PFP with raw score (PFP_RAW in the plots) has slightly higher precision for a given recall value than PFP predictions ranked by the confidence score (PFP). PFP with raw score has clearly better performance than PFP with confidence score in the ROC curve (Figure 1B), particularly at lower false positive range (x-axis). The similar behavior of PFP raw score is observed for predictions in the MF domain (Figure 1C &1D). These results indicate that the confidence score of PFP, which is computed in two steps from the raw score via the p-score distribution (see Methods), was not very successful in ranking predicted GO terms especially at top ranks (lower false positive regions). Thus, derivation of the confidence score need s to be reexamined and probably revised.
Figure 1. Performance of PFP (confidence score), PFP prediction sorted by the raw score (PFP_RAW), ESG, PRIOR, BLAST, and GOtcha. A, Precision - Recall plot for the BP domain. B, ROC for the BP domain. C, Precision - Recall plot for the MF domain. D, ROC for the MF domain.
PFP and ESG with enriched priors
Next, we combined the PFP and ESG predictions with the prior predictions (PFP + Prior, ESG + Prior) to see if PFP/ESG predictions were missing obvious GO terms (Figure 2). We show the performance of the methods is evaluated with the top N method, where N ranges from 1 to 20.
Figure 2. Performance of PFP and ESG with enriched priors (PFP/ESG+PRIOR), PFP, ESG, Prior, BLAST and GOtcha. The top N method was used for this evaluation. A, Precision - Recall plot for the BP domain; B, ROC for the BP domain; C, Precision - Recall plot for the MF domain; D, ROC for the MF domain.
ESG with enriched priors (ESG + Prior) shows the best performance among all the methods in BP domain when evaluate by the precision-recall plot (Figure 2A). The improvement by ESG + Prior over ESG is also observed in terms of ROC (Figure 2B). ESG + Prior also performed better than ESG in the MF domain (Figures 2C &2D). ESG tends to predict fewer GO terms than even BLAST since its algorithm essentially selects terms that are consistently identified by iterative searches. The results in Figure 2 indicate that obvious GO terms in Prior were not included in ESG predictions. Since some GO terms may be lost in the iterative process of the ESG algorithm, the scoring scheme needs to have a close inspection as a future work. On the other hand, adding Prior prediction to PFP did not show any improvement over PFP, which indicates that PFP's predictions already include correct terms from Prior.
PFP and ESG with semantic similarity
In Figure 3 the performance of the methods are evaluated in terms of the semantic similarity. The average of the semantic similarity between all pairs of true and predicted GO terms for each method is plotted relative to thresholds in Figure 3A and 3C for the BP and MF domain, respectively. It is shown that ESG's performance is significantly better than the other methods for both BP and MF targets. PFP performance is average among all the teams in this measure. On the other hand, PFP stands out in the semantic precision and recall plots (Figures 3B &3D). ESG comes second in the BP domain (Figure 3B) but shows worst performance among all in the prediction of MF terms (Figure 3D).
Figure 3. Performance of PFP and ESG as compared with Prior, BLAST, and GOtcha using semantic similarity method. A, Semantic similarity relative to the score threshold. Predictions in the BP domain are evaluated; B, semantic precision vs semantic recall for the BP domain; C, Semantic similarity relative to the score threshold in the MF domain; D, semantic precision vs semantic recall for the MF domain.
Prediction accuracy for different GO terms
In Figure 4, we analyze the prediction accuracy for different GO terms. Only GO terms and their child terms that are used for annotating 25 or more targets are considered. This results in 77 BP terms and 11 MF terms for this analysis.
Figure 4. Prediction accuracy evaluated for each functional category. Each row represents a GO term category and each column represents a prediction method. Count refers to the number of target proteins that were annotated by the given a GO term in the category. The F1 measure was used for evaluation. The color ranges from white (minimum) to red (maximum score). A, the BP domain. Results of a sample of 20 terms are shown, which are taken out of the 77 BP terms annotating 25 or more targets. B, the MF domain. Results for 11 MF terms each annotating 25 or more targets are shown.
For each GO term under consideration, we identified target proteins that are annotated by the GO term and counted how many were correctly predicted to have the same annotation by each of the prediction methods. For example, there were 38 out of 436 BP targets that were annotated by the BP GO term GO:0006810 transport. The number of targets out of 38 that were predicted by a method to have the same annotation were considered as true positives (TP) and the targets that were not predicted were considered as false negatives (FN). The rest of the 398 targets that do not have actual annotation (GO:0006810 transport) but were predicted to have this annotation were considered as false positives (FP). To take into account of the fact that parental terms of a GO term were less specific descriptions of the same function, we have included all the ancestors of each predicted term shortlisted based on the cutoff score used. For each selected term at the cutoffs ranging from 0.01 to 1.00, precision, TP/(TP+FP), and recall, TP/(TP+FN), were computed. Further, F1 measure for the term is calculated as the maximum harmonic mean at each cutoff, which is given by
We compared PFP (using the confidence score) and ESG predictions submitted to CAFA, BLAST, Priors, GOtcha and enriched PFP and enriched ESG predictions.
Out of the 77 BP terms, ESG showed the highest F1 measure among the seven methods for 31 terms. PFP, Priors, BLAST, GOtcha, enriched PFP, and enriched ESG showed highest F1 measure for 3, 1, 22,20, 3, and 19 (ESG has 19 ties with enriched ESG and PFP has 3 ties with enriched PFP) terms, respectively. The average F1 measures across the 77 BP terms by PFP, ESG, Prior, BLAST, GOtcha, enriched PFP, and enriched ESG were 0.288, 0.367, 0.222, 0.329, 0.329, 0.291, and 0.342, respectively. In Figure 4A a sample of 20 BP terms out of 77 is shown. For the term GO:0006950 response to stress that is used to annotate 69 proteins, ESG showed the best F1 measure value of 0.36 followed by PFP (0.30) and GOtcha (0.31). On the other hand, for GO:0016043 cellular component organization that shares annotations with 64 BP targets, all five methods except Priors and enriched ESG showed comparable performance with F1 measure around 0.35. Overall, the enriched PFP method showed almost identical F1 scores to PFP whereas the enriched ESG showed slightly lower average F1 score as compared to ESG. Enriched ESG showed a higher recall than ESG but with a lower precision, which overall decreased the F1 score than ESG.
Figure 4B shows the results for the eleven MF terms. In six out of eleven terms annotating more than 25 targets, ESG showed the best F1 measure. PFP, Prior, BLAST, GOtcha, enriched PFP, and enriched ESG had the highest F1 score for 0, 0, 1, 5, 0, and 4 categories, respectively (ESG, enriched ESG, and GOtcha have tie for one case as well as ESG and enriched ESG tie for 4 cases). The average F1 scores across the eleven terms for PFP, ESG, Prior, BLAST, GOtcha, enriched PFP, and enriched ESG are 0.374, 0.484, 0.298, 0.386, 0.474, 0.375, and 0.474 respectively. Thus, overall ESG performed best for both BP and MF domains. In this analysis (Figure 4), generally it is observed for both BP and MF domains that all sequence database search-based methods showed higher average F1 scores than Prior for most of the terms. Also for many terms, PFP, ESG, and GOtcha, which are built on (PSI-)BLAST performed better than BLAST.
Examples of successful and failed of PFP and ESG predictions
Finally, we discuss the prediction examples (Table 1) where PFP, ESG, and BLAST succeeded at different levels that provide insights into the advantages and shortcomings of our methods. Each case in Table 1 shows correct target annotations propagated till the root of the ontology which were predicted by PFP, ESG, and BLAST. Since the number of actual and predicted GO terms for a target can be very large (over 100) when predictions of low scores are included, Table 1 includes only terms that are relevant to discussion.
Table 1. CAFA target prediction examples for PFP, ESG, and BLAST
The first example is T06450, Escherichia coli protein trbA, which is annotated with GO:0042026 protein refolding as per the CAFA target annotations. BLAST search finds only one sequence hit O26024 that does not have any non-IEA annotation in the database resulting in no predictions. As for ESG, some of the correct low resolution annotations are extracted from a sequence hit Q9UZ03 retrieved in the first iteration of PSI-BLAST search with very large E-value (above 1) and its second level hits, including Q8A608, Q64PS6, Q5L9I8. These predicted annotations are parental terms of actual annotations. For example, a predicted term, GO:0008152 metabolic process, is a parental term of GO:0042026 protein refolding, and GO:0008652 amino acid biosynthetic process shares a common ancestor GO:0044237 cellular metabolic process with the target annotation GO:0042026 protein refolding. PFP was able to predict some low resolution parental terms of the correct annotation such as GO:0046483 cellular macromolecule metabolic process and GO:0044260 cellular protein metabolic process, with significantly high confidence scores of 0.81 and 0.99. Both these terms are not part of annotations of any of the PSI-BLAST hit but received partial scores by considering co-occurrence of GO terms (i.e. P(fa|fj) in Eq. 1).
The second example, T06299, rutE from E. coli, is annotated by two leaf terms GO:0019740 nitrogen utilization and GO:0019860 uracil metabolic process. For this target BLAST again does not predict anything as there are no search hits with non IEA annotations. Using IEA annotation of highly similar PSI-BLAST hits, ESG predicted GO:0055114 oxidation-reduction process, which shares a shallow common ancestor GO:0008152 metabolic process with a target term GO:0006212 uracil catabolic process. Similar to the previous example, PFP again predicted low resolution annotations GO:0006139 nucleobase, nucleoside, nucleotide and nucleic acid metabolism and GO:0046131 pyrimidine ribonucleoside metabolism thereby showing higher sensitivity when no close homologs are available for annotation transfer.
The third target T05345 is sensor protein CpxA from E. coli with leaf annotation GO:0046777 protein amino acid autophosphorylation. ESG predicted GO:0018106 peptidyl-histidine phosphorylation, which shares an immediate parent GO:0006468 protein amino acid phosphorylation with the target term GO:0046777 protein amino acid autophosphorylation. Also another term GO:0016310 phosphorylation, which is an ancestor of the target annotation is predicted by ESG with a high score of 0.93. PFP correctly predicts the ancestors of the target term, GO:0016310 phosphorylation, GO:0006464 protein modification and GO:0006468 protein amino acid phosphorylation with very high scores. BLAST predicts the target term and its ancestors with lower scores along with a number of unrelated predictions with high scores. Overall all the methods are able to predict the target term or its close ancestors, but the total number of terms predicted by BLAST (193 terms) and PFP (134 terms) are significantly higher than ESG (7 terms), resulting into more precise predictions by ESG.
The last example, T18799, Homo sapiens Ribonuclease H2 subunit B, is annotated by a leaf term GO:0006401 RNA catabolic process which has been accurately predicted by BLAST. BLAST obtains this correct annotation from sequence hits such as Q5TBB1, Q5XI96, Q3ZBI3, Q80ZV0, Q28GD9, and Q5HZP1. These sequences were also found by ESG, however, due to use of an older database that do not have updated annotations for these sequences, no correct annotation was retrieved. There are some shared ancestors, e.g. GO:0016070 RNA metabolic process, GO:0090304 nucleic acid metabolic process, GO:0044260 cellular macromolecule metabolic process between the low scoring ESG prediction GO:0006429 leucyl-tRNA aminoacylation and the target annotation GO:0006401 RNA catabolic process. PFP was able to correctly predict low resolution terms, GO:0044260 cellular macromolecule metabolism and GO:0016070 RNA metabolism.
To summarize, the first and the second examples illustrate a situation where PFP predicts low resolution parental terms of actual annotations while BLAST can only find 1 or 0 terms. There are PFP's successful prediction which were found indirectly by using the GO term co-occurrence. In the second example, IEA annotations lead to correct predictions for ESG and PFP. The third example is the case that ESG made predictions with higher precision with smaller number of false positives than BLAST and ESG. The last example is that ESG missed to make correct prediction because the sequence database which was searched was not up-to-date.
In this work we have analyzed the prediction performance of PFP and ESG in the CAFA 2011 experiment. In addition to the original submission of PFP and ESG, we have investigated the performance of a different scoring function (the raw score) for PFP, to examine if quick improvement is possible by considering prior knowledge of frequency of GO terms in the database (i.e. PFP + Prior, ESG + Prior). Moreover, we evaluated prediction accuracy at each functional categories and provided illustrative examples to understand successful and failed predictions by PFP and ESG.
Several points can be concluded from this study: Firstly, correct function information can be extracted from BLAST results more extensively than simply taking GO terms from top hits as demonstrated in some of the results that show superior performance by PFP, ESG, and GOtcha over BLAST. However, there are situations where PFP and ESG's performance compared unfavorably to BLAST and Prior depending on how performance is evaluated. Also we observed that ESG predictions are improved by simply adding Prior. Thus, we believe there is still room for improvement by devising techniques for consistently extracting accurate information thoroughly from (PSI-)BLAST results. It is observed that IEA terms provided correct information in several cases, which led to better performance by PFP/ESG over BLAST that only considered non-IEA hits. Keeping IEA information in the database would enlarge areas in the sequence similarity space with functional information, and thus increase the chance to retrieve correct function information, although one should always keep in mind that IEA may be incorrect, and moreover, careless applications of computational function prediction methods would increase incorrect IEA and propagate erroneous annotation through databases [53,54].
We have analyzed function predictions by PFP and ESG that were submitted to CAFA 2011. Overall ESG and PFP showed better performance than BLAST and Prior, but there are also opposite situations. Some of the lessons learned would be generally useful for developers and users of computational function prediction methods.
Competing Interests
The authors declare that they have no competing interests.
Financial Competing Interests
The authors declare that they have no financial competing interests.
Authors' Contributions
MC submitted predictions to CAFA. In addition, MC participated in design, implementation of evaluation programs for the study, performed the analysis, and drafted the paper. IK coded some of the evaluation programs, performed the analysis, and drafted the paper. DK conceived of the study, participated in its design, and finalized the manuscript. All authors read and approved the final manuscript.
We would like to thank the CAFA 2011 organizers for providing target annotations, prediction and analysis results for Prior, BLAST and GOtcha methods. This work has been supported by grants from the National Institutes of Health (R01GM075004, R01GM097528) and from National Science Foundation (DMS0800568, EF0850009, IIS0915801). MC is a recipient of Bilsland Dissertation fellowship at Purdue University.
This article has been published as part of BMC Bioinformatics Volume 14 Supplement 3, 2013: Proceedings of Automated Function Prediction SIG 2011 featuring the CAFA Challenge: Critical Assessment of Function Annotations. The full contents of the supplement are available online at URL. http://www.biomedcentral.com/bmcbioinformatics/supplements/14/S3.
Kanehisa M, Goto S: KEGG: Kyoto encyclopedia of genes and genomes.
Nucleic acids research 2000, 28:27-30. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Bujnicki JM: Prediction of protein structures, functions, and interactions. Wiley Online Library; 2009.
Chitale M, Kihara D: Computational protein function prediction: Framework and challenges.
In Protein function prediction for omis era Edited by Kihara D. Springer Verlag. 2011, 1-17.
Eisenberg D, Marcotte EM, Xenarios I, Yeates TO: Protein function in the post-genomic era.
Nature 2000, 405:823-826. PubMed Abstract | Publisher Full Text
Friedberg I: Automated protein function prediction--the genomic challenge.
Briefings in bioinformatics 2006, 7:225-242. PubMed Abstract | Publisher Full Text
Hawkins T, Kihara D: Function prediction of uncharacterized proteins.
Journal of bioinformatics and computational biology 2007, 5:1-30. PubMed Abstract | Publisher Full Text
Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool.
Journal of molecular biology 1990, 215:403-410. PubMed Abstract | Publisher Full Text
Pearson WR: Rapid and sensitive sequence comparison with FASTP and FASTA.
Methods in enzymology 1990, 183:63-98. PubMed Abstract | Publisher Full Text
Pearson WR, Lipman DJ: Improved tools for biological sequence comparison.
Proceedings of the National Academy of Sciences 1988, 85:2444-2448. Publisher Full Text
Attwood TK, Bradley P, Flower DR, Gaulton A, Maudling N, Mitchell AL, et al.: PRINTS and its automatic supplement, prePRINTS.
Nucleic acids research 2003, 31:400-402. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Bru C, Courcelle E, Carrere S, Beausse Y, Dalmar S, Kahn D: The ProDom database of protein domain families: more emphasis on 3D.
Nucleic acids research 2005, 33:D212-D215. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Finn RD, Mistry J, Schuster-Bockler B, Griffiths-Jones S, Hollich V, Lassmann T, et al.: Pfam: clans, web tools and services.
Nucleic acids research 2006, 34:D247-D251. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Hunter S, Apweiler R, Attwood TK, Bairoch A, Bateman A, Binns D, et al.: InterPro: the integrative protein signature database.
Nucleic acids research 2009, 37:D211-D215. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Pietrokovski S, Henikoff JG, Henikoff S: The Blocks database -- a system for protein classification.
Nucleic acids research 1996, 24:197-200. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Hawkins T, Luban S, Kihara D: Enhanced automated function prediction using distantly related sequences and contextual association by PFP.
Protein Science 2006, 15:1550-1556. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Hawkins T, Chitale M, Luban S, Kihara D: PFP: Automated prediction of gene ontology functional annotations with confidence scores using protein sequence data.
Proteins: Structure, Function, and Bioinformatics 2009, 74:566-582. Publisher Full Text
Chitale M, Hawkins T, Park C, Kihara D: ESG: extended similarity group method for automated protein function prediction.
Bioinformatics 2009, 25:1739-1745. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Martin D, Berriman M, Barton G: GOtcha: a new method for prediction of protein function assessed by the annotation of seven genomes.
BMC Bioinformatics 2004, 5:178-194. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text
Vinayagam A, del Val C, Schubert F, Eils R, Glatting KH, Suhai S, et al.: GOPET: a tool for automated predictions of Gene Ontology terms.
BMC Bioinformatics 2006, 7:161-167. PubMed Abstract | BioMed Central Full Text | PubMed Central Full Text
Zehetner G: OntoBlast function: From sequence similarities directly to potential functional annotations by ontology terms.
Nucleic Acids Res 2003, 31:3799-3803. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Khan S, Situ G, Decker K, Schmidt CJ: GoFigure: Automated Gene Ontology annotation.
Bioinformatics 2003, 19:2484-2485. PubMed Abstract | Publisher Full Text
Wass MN, Sternberg MJ: ConFunc--functional annotation in the twilight zone.
Bioinformatics 2008, 24:798-806. PubMed Abstract | Publisher Full Text
Engelhardt BE, Jordan MI, Muratore KE, Brenner SE: Protein molecular function prediction by Bayesian phylogenomics.
PLoS Comput Biol 2005, 1:e45. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Krishnamurthy N, Brown D, Sj+¦lander K: FlowerPower: clustering proteins into domain architecture classes for phylogenomic inference of protein function.
BMC Evolutionary Biology 2007, 7:S12. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Storm CEV, Sonnhammer ELL: Automated ortholog inference from phylogenetic trees and calculation of orthology reliability.
Bioinformatics 2002, 18:92. PubMed Abstract | Publisher Full Text
Brown MPS, Grundy WN, Lin D, Cristianini N, Sugnet CW, Furey TS, et al.: Knowledge-based analysis of microarray gene expression data by using support vector machines.
Proceedings of the National Academy of Sciences 2000, 97:262. Publisher Full Text
Eisen MB, Spellman PT, Brown PO, Botstein D: Cluster analysis and display of genome-wide expression patterns.
Proceedings of the National Academy of Sciences 1998, 95:14863. Publisher Full Text
Gao L, Li X, Guo Z, Zhu M, Li Y, Rao S: Widely predicting specific protein functions based on protein-protein interaction data and gene expression profile.
Sci China C Life Sci 2007, 50:125-134. PubMed Abstract | Publisher Full Text
Khatri P, Dr-âghici S: Ontological analysis of gene expression data: current tools, limitations, and open problems.
Bioinformatics 2005, 21:3587-3595. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
van Noort V, Snel B, Huynen MA: Predicting gene function by conserved co-expression.
TRENDS in Genetics 2003, 19:238-242. PubMed Abstract | Publisher Full Text
Gherardini PF, Helmer-Citterich M: Structure-based function prediction: approaches and applications.
Briefings in functional genomics & proteomics 2008, 7:291-302. PubMed Abstract | Publisher Full Text
Marti-Renom M, Rossi A, Al-Shahrour F, Davis F, Pieper U, Dopazo J, et al.: The AnnoLite and AnnoLyze programs for comparative annotation of protein structures.
BMC Bioinformatics 2007, 8:S4. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Martin ACR, Orengo CA, Hutchinson EG, Jones S, Karmirantzou M, Laskowski RA, et al.: Protein folds and functions.
Structure 1998, 6:875-884. PubMed Abstract | Publisher Full Text
Pal D, Eisenberg D: Inference of protein function from protein structure.
Structure 2005, 13:121-130. PubMed Abstract | Publisher Full Text
Ponomarenko JV, Bourne PE, Shindyalov IN: Assigning new GO annotations to protein data bank sequences by combining structure and sequence homology.
Proteins: Structure, Function, and Bioinformatics 2005, 58:855-865. Publisher Full Text
Thornton JM, Todd AE, Milburn D, Borkakoti N, Orengo CA: From structure to function: approaches and limitations.
nature structural biology 2000, 7:991-994. PubMed Abstract | Publisher Full Text
Chikhi R, Sael L, Kihara D: Real-time ligand binding pocket database search using local surface descriptors.
Proteins: Structure, Function, and Bioinformatics 2010, 78:2007-2028. Publisher Full Text
Sael L, Kihara D: Binding ligand prediction for proteins using partial matching of local surface patches.
International Journal of Molecular Sciences 2010, 11:5009-5026. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Sael L, Chitale M, Kihara D: Structure- and sequence-based function prediction for non-homologous proteins. Journal of Structural and Functional Genomics.
Journal of Structural and Functional Genomics 2012, in press.
Brun C, Chevenet F, Martin D, Wojcik J, Guenoche A, Jacq B: Functional classification of proteins for the prediction of cellular function from a protein-protein interaction network.
Chua HN, Sung WK, Wong L: Exploiting indirect neighbours and topological weight to predict protein function from protein-protein interactions.
Bioinformatics 2006, 22:1623-1630. PubMed Abstract | Publisher Full Text
Letovsky S, Kasif S: Predicting protein function from protein/protein interaction data: a probabilistic approach.
Bioinformatics 2003, 19(Suppl 1):i197-i204. PubMed Abstract | Publisher Full Text
Nariai N, Kolaczyk ED, Kasif S: Probabilistic protein function prediction from heterogeneous genome-wide data.
Sharan R, Ulitsky I, Shamir R: Network-based prediction of protein function.
Mol Syst Biol 2007, 3:88-100. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Deng M, Tu Z, Sun F, Chen T: Mapping gene ontology to proteins based on proteinGÇôprotein interaction data.
Bioinformatics 2004, 20:895-902. PubMed Abstract | Publisher Full Text
Moult J, Hubbard T, Fidelis K, Pedersen JT: Critical assessment of methods of protein structure prediction (CASP): round III.
Proteins: Structure, Function, and Bioinformatics 1999, 37:2-6. Publisher Full Text
Janin J: Protein-protein docking tested in blind predictions: the CAPRI experiment.
Mol BioSyst 2010, 6:2351-2362. PubMed Abstract | Publisher Full Text
Friedberg I, Jambon M, Godzik A: New avenues in protein function prediction.
Protein Science 2006, 15:1527-1529. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Rodrigues A, Grant B, Godzik A, Friedberg I: The 2006 automated function prediction meeting.
BMC Bioinformatics 2007, 8:S1. PubMed Abstract | Publisher Full Text
Soro S, Tramontano A: The prediction of protein function at CASP6.
Proteins: Structure, Function, and Bioinformatics 2005, 61:201-213. Publisher Full Text
Lopez G, Rojas A, Tress M, Valencia A: Assessment of predictions submitted for the CASP7 function prediction category.
Proteins: Structure, Function, and Bioinformatics 2007, 69:165-174. Publisher Full Text
The Gene Ontology in 2010: extensions and refinements
Nucleic Acids Res 2010, 38:D331-D335. PubMed Abstract | Publisher Full Text | PubMed Central Full Text
Karp PD: What we do not know about sequence analysis and sequence databases.
Bioinformatics (Oxford, England) 1998, 14:753. Publisher Full Text
Schnoes AM, Brown SD, Dodevski I, Babbitt PC: Annotation error in public databases: misannotation of molecular function in enzyme superfamilies.
PLoS computational biology 2009, 5:e1000605. PubMed Abstract | Publisher Full Text | PubMed Central Full Text


text:
Ganesha Games: Song of Blades: Hammer and Forge Miniature Range Kickstarter Launched
Wargame News and Terrain is a growing wargame news blog featuring new miniature releases, wargame promotions, miniature reviews and terrain tutorials. To check out all of our news posts filled with amazing new miniatures and much more. Check us out over at http://wargameterrain.blogspot.com


text:
Embassy Address in India
Tel: 2611 4355/ 59/ 53Fax: 2687 3889Office Timings: Mon to Thu, 0900 to 1700 hrs (Mon to Thurs) & 0900 to 1300 hrs (Fri)Note : Visa is handled for Haryana, Himachal Pradesh, Jammu & Kashmir, Punjab, Rajasthan, Uttar Pradesh and Uttaranchal.
MUMBAI Consulate General of ItalyKanchanjunga, 1st Floor, 72 G Deshmukh Road,Mumbai - 400 026
Tel: 2380 4071/4073/2387 4072Fax: 2387 4074Office Timings: Mon to Fri, 0830 to 1530 hrsNote : Visa is handled for Andhra Pradesh, Chhattisgarh, Madhya Pradesh, Goa, Gujarat, Karnataka, Kerala, Maharashtra and Tamil Nadu; the Union Territories of Daman, Diu, Dadra and Nagar Haveli, Lakshadweep and Pondicherry.
KOLKATA Consulate General of Italy3 Raja Santosh Marg, Alipore,Kolkata - 700 027
Tel: 2479 2414/ 26Fax: 2479 3892Office Timings: Mon to Fri, 0930 to 1700 hrs
Note : Visa is handled for Assam, Arunachal Pradesh, Bihar, Jharkhand, Manipur, Meghalaya, Mizoram, Nagaland, Orissa, Tripura and West Bengal; the Union Territory of the Andaman & Nicobar Islands
CHENNAI Honorary Vice Consulate of ItalyC/o. Ashok Leyland Ltd., 19 Rajaji Salai,Chennai - 600 001
Tel: 044- 2433 1120 , 2433 7224Fax: 044- 2534 1136Office Timings: Mon to Fri, 0900 to 1200 hrs
Note : Visa is handled for Southindian States
GOA Honorary Vice Consulate of ItalyC/o. Guala Closures (I) Pvt. Ltd., D-1, Sesa Ghor, 20 EDC Complex, P.O. Box: 101 Patto, Panjim,Goa- 403 001
Tel: 0832- 223 0697 / 98Fax: 0832- 222 9907Office Timings: Mon to Fri, 0900 to 1700 hrsNotes: Visa is not handled. Passports are sent to Mumbai.
Indian Nationals can obtain short stay visa for a period ranging from one to ninety days, valid for all countries of the Schengen Territory i.e. Austria, Benelux (Belgium, Netherlands, Luxembourg), Czech Republic, Denmark, Estonia, Finland, France, Germany, Greece, Hungary, Iceland, Italy, Latvia, Lithuania, Malta, Norway, Poland, Portugal, Slovakia, Slovenia, Spain, Sweden & Switzerland. The Schengen Convention is a great step towards freedom of circulation of people. Foreigners bearing a valid stay permit delivered by one of the Schengen states can leave and later re-enter the Schengen Territory without having to ask for a visa again, on condition that they have a valid passport and relevant travel document and a multiple entry visa. Application for visas have to be submitted with the competent Consular authorities, which are to be determined according to the following criteria.
A Schengen short stay visa entitles the holder to visit the Schengen countries for Tourism, visiting friends / family or other non-business related purposes up to 90 days within a 180 day period from date of first entry. The stay me be either continuous or several visits depending upon whether the visa is single or multiple entry.
With effect from 7th July 2014, the Embassy of Italy, New Delhi has implemented a change in arrangements for the collection of passport from visa application centres. Now, it will be no longer possible for third parties to collect the documents on behalf of an applicant, except in the following cases:-
Applicants/Representatives who do not wish to collect their documents in person and whose documents cannot be collected by one of the above should select pass back by courier at the time they make their visa application.
Note :-Embassy may asked for additional documents or personal presence at the time of submission or after the submission
Minimum 10-15 working days
Minimum 10-15 working days
Visa Form - Delhi Visa Form - Kolkata Visa Form - Mumbai Invitation Letter - North East Invitation Letter - South West Invitation Letter - Touris / Busines Declaration Form Waiver Declaration


text:
: Prospect Info:
The Memorial Cup 2013 Thread! (Portland vs Halifax on Sportsnet tonight - 7pm)
View Single Post
Steel your Habs away
Join Date: Jan 2003
Location: Lorraine, QC
Posts: 54,253
vCash: 725
I kept saying for quite some time now that Dietz was a monster. Do people remember all that panic over his minuses at the start of the season? Good times...But let's be careful in our analysis based on this tournament and even the past season. 'Cause if not....we'd be stated that Dietz is a future top 4 but that Thrower is alraedy a bust....which we won't do. Something is sure though....Thrower, next year, will need to get back to what he looked like in his draft year. If not...the kid will not be signed when due.
And another thing....I was high on him in his draft year, though I don't think he'll ever amount to anything but a bottom 6....but we need players like Ferland to fill that bottom 6.
View Public Profile
Whitesnake's albums
Find More Posts by Whitesnake