text:
- About Us
- Book Recommendations
- Signed Editions
- Kepler's Recommends
- Bestsellers
- Staff Picks
- Angela's Picks
- Becca's Picks
- Caitlin's Picks
- Christin's Picks
- Cressida's Picks
- Cynthia's Picks
- Jenna's Picks
- Julie's Picks
- Lane's Picks
- Lee's Picks
- Leigh's Picks
- Marilyn's Picks
- Molly's Picks
- Nancy's Picks
- Nicola's Picks
- Nicole's Picks
- Pam's PIcks
- Praveen's Picks
- Ron's Picks
- Sina's Picks
- Todd's Pics
- Tori's PIcks
- Award Winners
- Kepler's Events
- Community Partners
- Book Clubs
- Literary Circle Membership
Darkest Mercy (Paperback)
On Our Shelves Now
The Summer King is missing; the Dark Court is bleeding; and a deadly stranger walks the streets of Huntsdale. . . .
Aislinn tends to the Summer Court, searching for her absent king and yearning for Seth. Torn between his new queen and his old love, Keenan braces for the coming war. Donia longs for fiery passion and readies the Winter Court for battle. And Seth, heir to the High Queen, is about to make a mistake that could cost his life.
Love, despair, and betrayal ignite the Faerie Courts, and in the thrilling conclusion of the bestselling Wicked Lovely series, some will win . . . and some will lose everything.
About the Author
Melissa Marr is the author of the bestselling Wicked Lovely series as well as the adult fantasy novels Graveminder and The Arrivals. When not writing, editing, or traveling, Melissa is buried under a plethora of books, dogs, and children in Virginia or online at www.melissa-marr.com.
Praise For…
"Complex and involving."
-New York Times Book Review
"Marr has created a world both harsh and lush, at once urban and natural."
-School Library Journal
"Sexy, charming, sometimes harrowing fantasy."
"Impossible to put down."
-School Library Journal (starred review)
"A fully imagined faery world which even non-fantasy (or faerie) lovers will want to delve into."
-Publishers Weekly (starred review)


text:
Originally Posted by gmen0820
I'm willing to take this league out to 12, or 14 people (at some point, we can discuss/debate it amongst ourselves). As of now, though, we have six player:
-Morehead St.
-Flip Empty (possibly)
If anyone is worried about not getting a spot because of returning members, don't; first come, first serve. Many of last year's players don't really post here much, anyway.
If we, for some reason, have trouble filling out the league, I have a few friends who are unaware of this league, but would definitely play if I asked. But, if we all collectively decide to add a small league fee, I will not ask any friends to play, as to avoid any concerns of a conspiracy.
What about Ryan12?
Lifetime member of the "specific element" and proud of it.
Forum Rules

subset: commoncrawl


text:
The Little Kiwi That Wants To Grow
Kiwibank Group, with around 14 billion New Zealand dollars (US11.2 billion) worth of assets, is dwarfed by the four major Australian banks that dominate New Zealand's financial landscape.
But the little bank is now making a play for a bigger share of that market.
Kiwibank said Wednesday it will purchase Gareth Morgan's Investments for an undisclosed sum in move expected to bring high-net-worth investors to the New Zealand government-owned bank and improve its margins.
"There are a whole lot of high net worth individuals that Gareth Morgan has on its books, who I would assume wouldn't be Kiwibank customers so I would have thought one of the attractions would be firstly to get bigger in the wealth management… and the potential to cross sell their other services to these other clients," said Milford Asset Management analyst Anthony Quirk.
The increase in the size of the company's wealth management business is also a strong move for the bank that has consistently struggled with poor margins.
Bell Potter banking analyst TS Lim said that it was understandable that Kiwibank would want to increase its wealth management business as it was more capital efficient than their current operations and would also help it to meet ongoing liquidity requirements.
Kiwibank was set up by the New Zealand government in 2002 as a nationwide alternative to the Australian-owned Westpac Banking Corp., Australia & New Zealand Banking Group, Commonwealth Bank of Australia, which own ASB Bank, and National Australia Bank, the owner of Bank of New Zealand.
Operating out of post offices, the bank consistently provides lower mortgage rates to customers but is seen by some as a pared-down version of the bigger banks.
The purchase will bring NZ$1.5 billion of Gareth Morgan's investments under the umbrella Kiwibank Wealth and Insurance business and increased the size of its KiwiSaver investment portfolio. KiwiSaver is the New Zealand government supported retirement savings scheme.
"We started our own KiwiSaver scheme just over a year ago and while the growth has been impressive we were aware of the need to extend our investment management capability, says Kiwibank chief executive Peter Brock in a statement.
Clearly this little Kiwi lender has bigger ambitions.
Like us on Facebook or follow us on Twitter @WSJAustralia.


text:
This event has expired. This may be a recurring event, so please check the calendar in the future for updated occurrences.
Annual Strawberry Fest & Craft Fair
Sun Prairie
Family friendly strawberry festival featuring craft fair, run/walk, breakfast/lunch, raffles, children's carnival, computer arcade, book sale, lots of delicious strawberries, and much more!
Fair/Festival Type
- Arts & Crafts
- Food & Drink


text:
Narrow your search
The disk partitioning utility built into Windows 7 doesn't let you extend partitions to the left, so to enlarge your leftmost partition, you need a free repartitioning program.
Sometimes installing OS X may result in odd behavior if the partition scheme on the drive is not set up properly. If you are experiencing problems, a simple repartition during setup may be an easy fix.
It's possible to keep your working copy of Windows XP and perform a clean install of Windows Vista. Here's how.
Let Ubuntu repartition your hard drive so you can jump between Windows and Linux on the same PC.


text:
At New Year's, Cairns is hot—literally. The average high temperatures in December reach around 88 degrees Fahrenheit in the tropical north of Queensland. Whether you're a local, a backpacker, or a baby boomer, Cairns screams for a visit during the holiday season, and it also puts up a good party or two for New Year's and even Christmas. So, if you're a traveler looking to bask in nothing but warm sunshine and tropical surrounds this holiday season, keep in mind the following events for ringing in the New Year's Eve in Cairns.
Planning a Trip? Browse Viator's Cairns tours and things to do, Cairns attractions, and Cairns travel recommendations.
New Year's Eve Family Concert & Fireworks
Sure, nothing is going to be quite as impressive as the big fireworks extravaganza that has made Sydney's New Year's famous, but Cairns doesn't shy away from a good show. Join others at the Cairns Esplanade Lagoon for a night of family-friendly entertainment culminating with a fireworks display when the ball drops. Party-goers are encouraged to bring some sparklers, snacks, and picnic blankets to the festivities.
Fitzroy Island New Years Eve Party
The lovely Fitzroy Island lies about 45 minutes away from Cairns via ferry, and, given its seclusion from the mainland, it offers the perfect location for a New Year's party. The Fitzroy Island New Years Eve Party is a ticket-only event and involves live music and DJs, ferry transfer, games, prizes and a light meal. Even better is the free entry to several Cairns clubs when the night on the island ends.
As with New Year's anywhere, it is important to keep in mind that many establishments and Cairns tours will be closed on New Year's Day, and with the influx of travelers passing through the area, the importance of planning and booking ahead cannot be stressed.
Enjoy ringing in the New Year in Cairns!


text:
- WebMD Physician Directory of Iowa City Doctors
- Iowa City Emergency Contacts
- Nearby Iowa City Hospitals
- Find a Local Pharmacy on RxList - Iowa City
Iowa City Doctors and Specialists for Dog Bite Treatment
Dog Bite (Treatment)
Dog bite facts
- Dog bites account for more than 90% of all animal bites. 4.5 million dog bites occur each year in the U.S., and more than 30,000 victims require reconstructive surgery.
- Injuries may involve structures deep...
Other Related Dog Bite Treatment Articles
Emergency Contact for Iowa City
- In case of Emergency, call 911
Nearby Iowa City Hospitals results
- 1Mercy Hospital
500 E Market St
Iowa City, Iowa 52245
(319) 339-030
- 2University Of Iowa Hospital
200 Hawkins Dr
Iowa City, Iowa 52242
(319) 356-161
- 3VA Medical Center-Iowa City
601 Highway 6 W
Iowa City, Iowa 52246
(319) 338-058
- 4Iowa Medical Classification Ctr
2700 Coral Ridge Ave
Iowa City, Iowa 52241
(319) 626-239
- 5Mercy Medical Center
701 10th St SE
Iowa City, Iowa 52403
(319) 398-601
- 6St Luke's Hospital
1026 A Ave NE
Iowa City, Iowa 52402
(319) 369-721
- 7Washington County Hospital
400 E Polk St
Iowa City, Iowa 52353
(319) 653-548
- 8Trinity Muscatine
1518 Mulberry Ave
Iowa City, Iowa 52761
(563) 264-910
- 9Marengo Memorial Hospital
300 W May St
Iowa City, Iowa 52301
(319) 642-554
- 10Jones Regional Medical Center
1795 Highway 64 E
Iowa City, Iowa 52205
(319) 462-613
* Provider Directory Terms of Use:
The WebMD 'Provider Directory' is provided by WebMD for use by the general public as a quick reference of information about Providers. The Provider Directory is not intended as a tool for verifying the credentials, qualifications, or abilities of any Provider contained therein. Inclusion in the Provider Directory does not imply recommendation or endorsement nor does omission in the Provider Directory imply WebMD disapproval.
You are prohibited from using, downloading, republishing, selling, duplicating, or "scraping" for commercial or any other purpose whatsoever, the Provider Directory or any of the data listings or other information contained therein, in whole or in part, in any medium whatsoever.
The Provider Directory is provided on an "AS-IS" basis. WebMD disclaims all warranties, either express or implied, including but not limited to the implied warranties of merchantability and fitness for particular purpose. Without limiting the foregoing, WebMD does not warrant or represent that the Provider Directory or any part thereof is accurate or complete. You assume full responsibility for the communications with any Provider you contact through the Provider Directory. WebMD shall in no event be liable to you or to anyone for any decision made or action taken by you in the reliance on information provided in the Provider Directory.
The use of WebMD Provider Directory by any entity or individual to verify the credentials of Providers is prohibited. The database of Provider information which drives WebMD Provider Directory does not contain sufficient information with which to verify Provider credentials under the standards of the Joint Commission on Accreditation of Healthcare Organizations (JCAHO), National Committee for Quality Assurance (NCQA) of the Utilization Review Accreditation Committee (URAC).
By using the WebMD Provider Directory, you agree to these Terms and Conditions.


text:
Indiana State University has announced its dean's list for the 2014 spring semester and Sasha McCormick of Carmi is among the students recognized for academic achievement.
To be eligible for the dean's list at Indiana State, students must be full-time and maintain a cumulative grade point average of 3.5 or higher on a 4.0 scale.
Location, ST | website.com


text:
Nefeli Hotel - Alexandroupolis Greece
At Nefeli Hotel in Alexandroupolis you will discover the true meaning of Greek hospitality with this excellent choice of accommodation.
We are confident that you will find our accommodation and services more than suitable for your holidays.
If would like to search for prices and availability for Nefeli Hotel, simply use the form below.
Nefeli Hotel - Alexandroupolis Hotels
5th Klm National Road Alexandroupolis - Komotini 681 00
Alexandroupolis, Greece
Nefeli Hotel overlooks the Aegean Sea and Samothrace and is situated at the entrance of Alexandroupolis. It offers spacious rooms with free internet access and breakfast included...... [ Read more ..... ]
Number of Rooms - 37
Prices from € 54.4
|More Information, Photos and Customer Reviews about Nefeli Hotel
Location of Nefeli Hotel in Alexandroupolis Greece
= ?>


text:
Published: Thursday, August 25, 2005 at 4:30 a.m.
Last Modified: Thursday, August 25, 2005 at 12:00 a.m.
Breakfast and Bird-Watching Guided Tour will begin at 8 a.m. at the Highland Lake Inn and Season's Restaurant, Flat Rock. Bring binoculars, hats, walking shoes, bird books. Cost: $25 per person. Information, reservations: 693-6812.
What's Growing on at the Arboretum? will begin at 9:30 a.m. at the N.C. Arboretum, Bent Creek. Walk highlighting new facilities under construction and garden improvements under way. Information: 665-2492, www.ncarboretum.org.
Lipid, Glucose and Blood Pressure Screenings will be held from 2 to 4 p.m. in Park Ridge Hospital's Wellness on Wheels Van at the Ingles in Fletcher. Fasting recommended.
Bon Voyage, a French film, will be shown at 3 p.m. in Kaplan Auditorium, Henderson County Public Library. Foreign Film Series. Free. Information: 697-4725.
Business After Hours of Greater Hendersonville Chamber of Commerce will meet from 5:30 to 7 p.m. at Beverly Healthcare, 1510 Hebron St. Food, door prizes, networking. Reservations: 692-1413.
The Best of Broadway, the opening season concert of the Hendersonville Symphony Orchestra, will be performed at 7:30 p.m. in the auditorium of Hendersonville High School. Featuring Scott Treadway, associate director of the Flat Rock Playhouse, and vocal soloists from the Playhouse. Tickets: $30; may be available at door with cancellations.
Fools by Neil Simon will be performed at 8:15 p.m. today through Saturday and 2:15 p.m. today, Saturday and Sunday at the Flat Rock Playhouse. Tickets: $26; $24, seniors, students, Groups. Information, reservations: 693-0731.
Reader comments posted to this article may be published in our print edition. All rights reserved. This copyrighted material may not be re-published without permission. Links are encouraged.
Comments are currently unavailable on this article


text:
Speeding Rampage
Credits & Info
- Uploaded
- Dec 16, 2005 | 12:27 AM EST
- File Info
- Song
- 2 min 37 sec
- Score
- 4.17 / 5.00
Related Content
Heard in 12 Entries!
View all submissions featuring this audio file.
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.17 / 5 stars
- Plays & Downloads:
- 25,125 Plays | 4,549 Downloads
- Share Links:
- Genres:
- Metal, Rock - Heavy Metal
- None
Author Comments
Rated 5 / 5 stars
Rated 1.5 / 5 stars
Melodic solo at the end?
It was good, but my friend and I have heard heavier, and there was nothing melodic about it. I did'nt really even hear a solo, especially not a melodic one. Only the best will stand out when you have listened to as much metal as us..
Hey, I didn't mean melodic in that gay "In Flames" Kind of way, I meant it had a melody to it. Yeah, I got it wrong, I should have said "Lead", instead of "Solo". Also, what the fuck is that, "Only the best will stand out when you have listened to as much metal as us.." comment all about? I've been listening to metal since I was dick high, so don't try and tell me that the fuck I should be listening to. I hate that gay fucking Bodom and in Flames shit. The vocals are aweful, and there is no aggression in the music whatsoever.
"When you have listened to as much metal as us"... Fuck you.
You obviously havn't heared £NOUGH bands to have posted a comment as ignorant as that.
Rated 5 / 5 stars
Awesome! but not your best...
awesome stuff here i heard this and the rest of your music cause of territory war! keep up the (pretty good) work!
Thanks alot mate. Yeah, this would have been better if I didn't have that shitty end bit. I don't like the end part at all!!!
Thanks for checking it out. Territory wars is cool.
Rated 5 / 5 stars
ALL HAIL SAtAN
Sweet song its as evil as they get im listening to it right now man.
but you need to pay for my medicine my tummy hurts : (
HAIL satin
Hail satin!!! Haharrr!
If you have stomach pains, you should eat some rotted corpse innards. That will get you right back on track!
Cheers for checking it out mate!
Rated 5 / 5 stars
yay hooray
this rocks so much it busted off someone's transsexual girlfriends plastic balls off or sumtin lik dat.
Wow, awesome, that's exactly what I had in mind when I made it! hahaha! If Arnold Schwarzenoodle was here, he'd say, "GOOOOO, GET TO THE CHOPPER".
Hey, you have Anthrax in your fav bands profile. You are cool as fuck.
Anthrax rule.


text:
New member of the portable production team
As part of a more complex integrated setup
A beautiful looking step sequencer with no menu diving!
AES67 Standard, multichannel playback, record, sync
Copyright Sonic State Ltd © 1995-2016. All rights reserved.
Reproduction in whole or in part in any form or medium without express written permission from Sonic State is prohibited.


text:
Pick your battles
Iranian President Mahmoud Ahmadinejad, the man who in previous weeks has publicly referred to the Holocaust as a "myth," and called for Israel to be wiped off the map, has now banned Western music from Iran.
Is President Ahmadinejad threatened by The Hip Hop, or The Rap? Is he afraid of bootylicious singers like Beyonce bouncing their way into the hearts of deviant teens and ruining his designs for an ultra-conservative Iran?
Songs by artists such as Eric Clapton and George Michael will be affected… Clapton's Rush, Michael's Careless Whisper and The Eagles' Hotel California are often used as background music on Iranian TV programmes. Songs by American easy-listening artist Kenny G are also often featured.
Relax said the nightman
We are programed to recieve
You can check out any time you like
But you can never leave


text:
Hello everybody there,
I have installed a front page for my site and I wonder how to optimize it in order to get it loaded as fast as possible.
Many stuff is loaded by the user browser (even if not displayed), which is not necessary for this very simple page, (like header image...)
I thought maybe the tip would be to customize the page-templates/full-width.php (after copying it into my child theme of course) but I really don't know what to add there. Or a plugin maybe?
Any idea?
Thanks a lot, in advance.


text:
I would very much appreciate an answer to these (for you pros) simple questions!
I have managed to install the Swedish language files, so that my administration panel in WordPress, is shown in Swedish.
However, there are, as you understand, several words on my homepage that are still in English which I need to translate.
Since I am a complete newbie please don´t assume that I have any pre knowledge as you explain this to me. Imagine explaining to a five year old monkey if you will! :-)
I am using notepad, and have identified that the words I need to translate are found in my theme directory in the php-files. So far so good. :-)
Translating a term like "blog roll" for example seems easy enough, since I use the "search all files" function in notepad, and it only finds one php-file containing the words blog roll (in a h5 heading). So I just go in to that file, and line, and replace the words "blog roll" with the Swedish spelling bloggrulle". This is correct, right?
However for some words it becomes a bit more tricky. For instance when I search for "Archives" my notepad finds this word in quite a few files, and lines. Now, I am not sure if I should replace ALL instances of the word (both in singular and in plural) or just try to identify the words ("archive", "archives") which are visible on my homepage.
My questions here are: If I only replace "archives" with the Swedish words "Arkiv" in for instance
Archives/h3> and
Archives
 Will this not screw up some code/command lines (or whatever it might be called)? in other lines and files? Like for example: Line 5 : <?php wp_get_archives('type=monthly&limit=8'); ?>
I will publish all the findings in my theme directory of the word "archive" and perhaps someone could explain to me which words to replace, and which words to leave alone, with this example:
Line 25 :
Author Archives

Line 27 :
News Archives

Line 3 : Template Name: archives
Line 16 :
Archives

Line 21 : <?php wp_get_archives('type=monthly'); ?>
Line 27 : <?php wp_get_archives('type=yearly'); ?>
Line 3 :
Recent Archives

Line 5 : <?php wp_get_archives('type=monthly&limit=8'); ?>
Line 28 :


text:
Fundamental Limits on the Mobility of Nanotube-Based Semiconducting Inks
High mobility and high on/off ratio thin-film transistors are fabricated using solution-based deposition of purified semiconducting carbon nanotubes. A comprehensive spectrum of the density starting from less than 10 tubes μm−2 to the high end of around 100 tubes μm−2 is investigated. This study provides the first important roadmap for the tradeoffs between mobility and on/off ratio in nanotube-based semiconducting inks.
If you can't find a tool you're looking for, please click the link at the top of the page to "Go to old article view". Alternatively, view our Knowledge Base articles for additional help. Your feedback is important to us, so please let us know if you have comments or ideas for improvement.


text:
According to Yelp. How many of these have you been to? (Pictured: http://goo.gl/QZxPxy )
1. Da Poke Shack, Kailua-Kona, HI
2. Paseo, Seattle, WA
3. Oklahoma Joe's Barbecue, Kansas City, KS
4. The Cinnamon Snail, New York, NY
5. Porto's Bakery, Burbank, CA
6. Dametra Cafe, Carmel by the Sea, CA
7. Alinea, Chicago, IL
8. Franklin Barbecue, Austin, TX
9. Gary Danko, San Francisco, CA
10. Joe's Falafel, Los Angeles, CA
11. Sushi Izakaya Gaku, Honolulu, HI
12. Biker Jim's Gourmet Dogs, Denver, CO
13. Oscar's Mexican Seafood, San Diego, CA
14. Coop's West Texas Barbeque, Lemon Grove, CA
15. Tacos El Gordo, Chula Vista, CA
16. Cheese Board Pizza, Berkeley, CA
17. Ricky's Fish Tacos, Los Angeles, CA
18. Ono Seafood, Honolulu, HI
19. Bogart's Smoke House, Saint Louis, MO
20. Bakery Nouveau, Seattle, WA
21. Baguette Cafe, Las Vegas, NV
22. Eleven Madison Park, New York, NY
23. T-Deli, San Diego, CA
24. Built to Grill, Portland, OR
25. Alforon, San Diego, CA
26. Daniel, New York, NY
27. Hot Doug's, Chicago, IL
28. Sal, Kris, & Charlie's Deli, Astoria, NY
29. Blues City Deli, Saint Louis, MO
30. The Kitchen Restaurant, Sacramento, CA
31. Cream Pan, Tustin, CA
32. Dave's Fresh Pasta, Somerville, MA
33. Café Besalu, Seattle, WA
34. The French Laundry, Yountville, CA
35. Turf N' Surf Po Boy, Austin, TX
36. Café Rolle, Sacramento, CA
37. Chama Gaucha Brazilian Steakhouse, Downers Grove, IL
38. Yoshino Japanese Deli, Carlsbad, CA
39. Opal Thai Food, Haleiwa, HI
40. Lou's Cafe, San Francisco, CA
41. Marukame Udon, Honolulu, HI
42. Monell's Dining & Catering, Nashville, TN
43. Roxie Food Center, San Francisco, CA
44. Graham Avenue Meats And Deli, Brooklyn, NY
45. Le Bernardin, New York, NY
46. El Chato Taco Truck, Los Angeles, CA
47. Mr. Gyros, Seattle, WA
48. The Waffle Window, Portland, OR
49. Per Se, New York, NY
50. Geste Shrimp Truck, Kahului, HI
51. Frostbites Crepes & Frozen Delights, Cypress, CA
52. Sushi Ota, San Diego, CA
53. Arizmendi Bakery, San Francisco, CA
54. Sweet Potato Stall, Santa Clara, CA
55. Gramercy Tavern, New York, NY
56. Peter's Kettle Corn, Oakland, CA
57. Johnny Pacific, Winnetka, CA
58. El Chilango, Arlington, VA
59. Ike's Place, San Francisco, CA
60. Fishermen's Grill, Portland, ME
61. Sabroso! Mexican Grill, Garden Grove, CA
62. District Wine, Long Beach, CA
63. Chama Gaúcha Brazilian Steakhouse, Houston, TX
64. Bludso's BBQ, Compton, CA
65. Tiki Juice Bar, Anaheim, CA
66. Wally's Cafe, Emeryville, CA
67. Vinh Loi Tofu, Reseda, CA
68. Mama D's Italian Kitchen, Newport Beach, CA
69. Los Andes Restaurant, Providence, RI
70. Little Luca Sandwich Shop & Deli, South San Francisco, CA
71. Pho 95, Denver, CO
72. Garbo's Grill, Key West, FL
73. Ono Tacos, Lahaina, HI
74. Mattern Sausage & Deli, Orange, CA
75. The Market Grill, Monrovia, CA
76. Urasawa, Beverly Hills, CA
77. Dat Cajun Guy, Haleiwa, HI
78. Los Agaves, Santa Barbara, CA
79. Outlaws Cafe, Van Nuys, CA
80. Gus's World Famous Hot & Spicy Chicken, Memphis, TN
81. Short Leash Dogs Food Truck, Phoenix, AZ
82. Pono Market, Kapaa, HI
83. Wafels & Dinges, New York, NY
84. Bell Street Farm, Los Alamos, CA
85. Uchiko, Austin, TX
86. Little Deli & Pizzeria, Austin, TX
87. Kokkari Estiatorio, San Francisco, CA
88. Kang Hodong Baekjeong, Los Angeles, CA
89. Komi, Washington, DC
90. Stuff I Eat, Inglewood, CA
91. Taste of Ethiopia, Pflugerville, TX
92. Hy Mart Sandwiches, North Hollywood, CA
93. The Codmother Fish and Chips, San Francisco, CA
94. Mastro's Steakhouse, Beverly Hills, CA
95. Sushi Sasabune, Honolulu, HI
96. Bern's Steak House, Tampa, FL
97. Postino Arcadia, Phoenix, AZ
98. Pappy's Smokehouse, Saint Louis, MO
99. Uchi, Austin, TX
100. Zia Gourmet Pizza, San Diego, CA
Our research shows athletic people tend to be more adventurous, assertive, optimistic and extroverted. Sporty people also rate their health higher, and even rate themselves as more attractive, and better at math.
Are you a tennis ace and a whiz with geometry? http://bit.ly/1eYwO05
- Qwikipresent
- UC IrvineComputer Science MS
- UC San DiegoComputer Engineering BS
23andme hack
One of the best things about 23andme is its transparency!! In addition to its awesome api that allows users to build tools to analyze their
Yahoo Finance
The Ultimate AdvantageFollow the stocks you care about most and get personalized news and alerts. Access real-time stock information and inv
Yahoo Search
Localize exatamente o que você está procurando, mais rapidamenteLocalize facilmente as informações que você precisa onde você estiver. O nov
Yahoo Sports
Follow your favorite leagues, teams, and players with real-time coverage of NFL, NBA, MLB, NHL, NCAA, NASCAR, MLS, PGA, international soccer
• Publique o que quiser, de qualquer lugar. • Compartilhe fotos, gifs, vídeos, citações, chats, links e textos. Encontre blogs e conteúdos i
Yahoo Weather
The forecast is beautiful. Prepare for your day with the most accurate hourly, 5-day, and 10-day forecasts. Stunning Flickr photos match you
Dining Etiquette and Eating Customs Around the World
Eating at restaurants abroad can be a minefield of dining customs and etiquette faux pas. Brush up on the table manners of your chosen desti
Eagle Cafe: From fishermen breakfasts to happy-hour destination
The building was originally a ticket office on Powell Street, morphing into a cafe that served early breakfasts to those working long hours
Baking Steel
The Story On the clock, I work for a family-owned steel manufacturing company. Outside the office I consider myself a food enthusiast. Prior
Home Page - Baking Steel
One day, while reading comments in Modernist Cuisine by Nathan Myhrvold, explaining the most efficient surfaces for making home baked pizza,
Yahoo Inc.
Yahoo Inc. hasn't shared anything on this page with you.
Git tips from the trenches
Get better at git with some pro tips. Learn these tricks and rock your daily vcs routine! git learn git git tips git howto git branch git di
Charge! How A Father-Daughter Duo Gambled On Tesla And Beat Out Elon Mus...
Imagine this for a prize fight. In one corner, billionaire Elon Musk, the man who runs the company that builds the Tesla Model S. In the oth
We spent a week making Trello boards load extremely fast. Here's how we ...
We Help the World's Best Developers Make Better Software.
How Netflix Reverse Engineered Hollywood
To understand how people look for movies, the video service created 76,897 micro-genres. We took the genre descriptions, broke them down to
The Science of Sleep
Everything we know about sleep.
Hidup ini indah, fotomu juga harus indah! Gunakan penyesuaian filter dan sarana pengeditan yang hebat dari Flickr untuk menghasilkan dan ber
From a Model S owner in Tennessee | Blog | Tesla Motors
I was driving home from work on the interstate in the right lane at approximately 70 miles per hour, following a truck. In the middle of the


text:
What's News
Business & Finance
Japan's legions of mom-and-pop currency traders are unwinding a favorite strategy, helping to drive the yen higher as they try to limit losses and increase their cash holdings. Haven currencies such as the Swiss franc rose as well as fears grew about Japan's nuclear crisis.
BOJ officials kept up their strong response to events. Fragile markets and the economic toll of the disaster could force the bank to do more in coming weeks.
The Nikkei Stock Average gained 5.7% as the selloff of the two previous days attracted buyers. Markets rose across Asia, but U.S. stocks fell after a warning from the EU's nuclear chief.
France called for meetings with ministers of the G-7 and the G-20 to discuss the Japan crisis and global energy resources.
Worries continued about supply-chain disruptions, with some Asian businesses saying they were slowing output to preserve component stockpiles.
Some Japanese auto factories were set to reopen Thursday, while halts on output at other auto factories were extended.
A global move away from nuclear power in response to the atomic-plant crisis unfolding in Japan will likely spur a scramble for Australian energy.
Goldman is buying India's Benchmark Asset Management, a provider of exchange-traded funds. It also is forming an asset-management partnership with a South Korean company.
China Mobile's profit rose 3.9% last year, as tougher competition and additions of low-income mobile subscribers in rural areas balanced out growth in the company's 3G wireless business.
Tencent's earnings rose 46% in the fourth quarter as the Chinese online game and messaging firm pledged to step up investments in existing and new businesses.
SJM's profit and revenue soared last year, amid a gaming boom in Macau.
A judge rejected pleas by Las Vegas Sands to dismiss a high-profile employment case that pits the casino giant against a former Macau manager.
A Renault security agent had money in a Swiss bank, but his lawyer said it was there to pay an informant in the car maker's industrial-spying probe.
Motorola will start selling a Wi-Fi-only version of its Xoom tablet at U.S. retailers on March 27, at the same price as an equivalent iPad version from Apple.
Political opposition to the takeover of ASX by Singapore Exchange mounted as the leader of one of Australia's main opposition parties expressed reservations.
U.S. wholesale prices surged last month, while home construction fell by the most in years.
Japan's emperor urged the country not to give up and said he was "deeply concerned" about the unfolding nuclear crisis in an unprecedented video address.
China halted approvals of new nuclear-power plants pending changes to safety standards.
Gadhafi's forces attacked the last rebel-held major city in western Libya and expanded territory near Benghazi in the east.
Palestinian leader Abbas offered to visit the Hamas-ruled Gaza Strip in four years in a bid to help reunite the rival Palestinian governments.


text: Description~Vinny Gambini (Pesci), a lawyer who took the bar exam six times before passing, goes to Wahzoo City, Alabama to get his cousin and a friend off the hook when they're accused of killing a store clerk. Leather jackets, gold chains, Brooklyn accents, and his fiancee Tomei's penchant for big hair and bold clothing don't go over well with conservative judge Gwynne, causing plenty of misunderstandings. Surprising hit with simplistic story reaches popular heights via entertaining performances by the entire cast. Tomei in particular steals every scene she's in and has an Oscar to prove it.|


text: DSpace Community: http://hdl.handle.net/2381/316 2016-07-28T18:22:29Z 2016-07-28T18:22:29Z Generalised distributivity and the logic of metric spaces Babus, Octavian Vladut http://hdl.handle.net/2381/37701 2016-06-09T02:16:35Z 2016-06-08T09:27:55Z Title: Generalised distributivity and the logic of metric spaces Authors: Babus, Octavian Vladut Abstract: The aim of the thesis is to work towards a many-valued logic over a commutative unital quantale and, at the same time, towards a generalisation of coalgebraic logic enriched over a commutative unital quantale Ω. This is done by noticing that the contravariant powerset adjunction can be generalised to categories enriched over a commutative unital quantale. From here we define categorical algebras for the monad generated by this adjunction. We finish by showing that these categorical algebras are algebras over Set with operations and equations, and show that in some cases we can restrict the arity of those operations to be finite. 2016-06-08T09:27:55Z Descriptions of Groups using Formal Language Theory Rino Nesin, Gabriela Asli http://hdl.handle.net/2381/37684 2016-06-03T02:18:13Z 2016-06-02T12:13:04Z Title: Descriptions of Groups using Formal Language Theory Authors: Rino Nesin, Gabriela Asli Abstract: This work treats word problems of finitely generated groups and variations thereof, such as word problems of pairs of groups and irreducible word problems of groups. These problems can be seen as formal languages on the generators of the group and as such they can be members of certain well-known language classes, such as the class of regular, one-counter, context-free, recursively enumerable or recursive languages, or less well known ones such as the class of terminal Petri net languages. We investigate what effect the class of these various problems has on the algebraic structure of the relevant group or groups. We first generalize some results on pairs of groups, which were previously proven for context-free pairs of groups only. We then proceed to look at irreducible word problems, where our main contribution is the fact that a group for which all irreducible word problems are recursively enumerable must necessarily have solvable word problem. We then investigate groups for which membership of the irreducible word problem in the class of recursively enumerable languages is not independent of generating set. Lastly, we prove that groups whose word problem is a terminal Petri net language are exactly the virtually abelian groups. 2016-06-02T12:13:04Z Digital Educational Games: Methodologies for Evaluating the Impact of Game Type Heintz, Stephanie Alexandra http://hdl.handle.net/2381/37613 2016-05-20T02:16:26Z 2016-05-19T15:22:27Z Title: Digital Educational Games: Methodologies for Evaluating the Impact of Game Type Authors: Heintz, Stephanie Alexandra Abstract: The main research question addressed in this thesis is how the choice of game type influences the success of digital educational games (DEG), where success is defined as significant knowledge gain in combination with positive player experience. Games differ in type if they differ at least by one game feature. As a first step we identified a comprehensive set of unique game features, summarised in the Game Elements-Attributes Model (GEAM), where elements are the defining components that all games share (e.g. Challenges) and attributes are their possible implementation (e.g. time pressure). To deepen the understanding of relationships amongst game features, we conducted a survey based on the GEAM and received 321 responses. Using hierarchical clustering, we grouped 67 games, selected by the survey respondents, in terms of similarity and mapped the identified clusters on a 2D space to visualise their difference in distance from each other. On the resulting Game Genre Map, five main areas were detected, which proved to conform mostly to a selection of existing game genres. By specifying their GEAM attributes, we redefined these genres: Mini-game, Action, Adventure, Resource, and Role-play. Based on the aforementioned groundwork, two empirical studies were conducted. Study 1 compared three DEGs of the Mini-game genre, differing in a single GEAM attribute - time pressure vs. puzzle solving and abstract vs. realistic graphics. Study 2 compared DEGs of different genres which vary in the implementation of several GEAM attributes. For both studies, statistically significant differences were found in learning outcome, for Study 2 also in the player experience dimensions: Flow, Tension, Challenge, and Negative Affect. However, the influences of the covariates - learning and play preconditions, learning style, and personality traits - were not confirmed. Further research based on the methodological frameworks developed is needed. 2016-05-19T15:22:27Z Data Collection in Wireless Sensor Networks Rasul, Aram Mohammed http://hdl.handle.net/2381/37606 2016-05-20T02:16:03Z 2016-05-19T12:03:50Z Title: Data Collection in Wireless Sensor Networks Authors: Rasul, Aram Mohammed Abstract: This thesis is principally concerned with effcient energy consumption in wireless sensor networks from two distinct aspects from a theoretical point of view. The thesis addresses the issue of reducing idle listening states in a restricted tree topology to minimise energy consumption by proposing an optimisation technique: the extra-bit technique. This thesis also focuses on showing lower bounds on the optimal schedule length, which are derived for some special cases of the tree, such as a single chain, balanced chains, imbalanced chains, three and four level k-ary trees and Rhizome trees. Then, we propose an algorithm which can exactly match the lower bound for a single chain, balanced chains and Rhizome trees individually and which is a few steps away from the optimal solution for imbalanced chains. Finally, we propose the use of two frequencies to further save energy and minimize latency. Recent research has shown that significant energy improvements can be achieved in WSNs by exploiting a mobile sink for data collection via single hop communications. A mobile sink approaches the transmission range of sensors to receive their data and deposit the data at the base station. The thesis, as a second problem, focuses on the design issues of an energy efficient restricted tour construction for sink mobility. We propose two different techniques. The first one is heuristic and uses a criterion based on maximum coverage and minimum energy consumption called the "max-ratio". Although its time complexity is polynomial, this heuristic algorithm cannot always produce a good solution. As a result, we propose the sec- ond algorithm. Despite the time complexity of the second algorithm being pseudo polynomial, the optimal solution can be found if one exists. For each algorithm men- tioned, two scenarios are taken into account with regard to the transmission. In the first scenario, one assumes that there is no upper bound on the transmission range while in the second setting the nodes can adjust their transmission range between 0 and the maximum range. The algorithms have been implemented and simulated in Matlab. 2016-05-19T12:03:50Z Complexities of Computation: A Survey Report Jain, A. K. Jain, Nitin Kumar http://hdl.handle.net/2381/37604 2016-05-20T02:16:24Z 2016-05-19T10:59:37Z Title: Complexities of Computation: A Survey Report Authors: Jain, A. K.; Jain, Nitin Kumar Abstract: Computation of real numbers has been a challenging task for many years. Because of its unique nature of infinity, it is considered as a very good area of research. This paper tries to convey the nature of the real numbers and the difficulty to compute them i.e. to approximate the value and some respective development processes related to the real numbers. While making a general calculation the approximation can go on and on, this still doesn't give the exact value. Computer system's memory is finite. Goal is to approximate the real numbers but the problem arises where to stop and which basis they are subjected for approximation on. 2016-05-19T10:59:37Z Interaction Models and Automated Control under Partial Observable Environments Braberman, Victor D'Ippolito, Nicolas Piterman, Nir Uchitel, Sebastian Ciolek, Daniel http://hdl.handle.net/2381/37602 2016-05-19T02:16:49Z 2016-05-18T15:21:12Z Title: Interaction Models and Automated Control under Partial Observable Environments Authors: Braberman, Victor; D'Ippolito, Nicolas; Piterman, Nir; Uchitel, Sebastian; Ciolek, Daniel Abstract: The problem of automatically constructing a software component such that when executed in a given environment satisfies a goal, is recurrent in software engineering. Controller synthesis is a field which fits into this vision. In this paper we study controller synthesis for partially observable LTS models. We exploit the link between partially observable control and non-determinism and show that, unlike fully observable LTS or Kripke structure control problems, in this setting the existence of a solution depends on the interaction model between the controller-to-be and its environment. We identify two interaction models, namely Interface Automata and Weak Interface Automata, define appropriate control problems and describe synthesis algorithms for each of them. 2016-05-18T15:21:12Z T2: Temporal Property Verification Brockschmidt, Mark Cook, Byron Ishtiaq, Samin Khlaaf, Heidy Piterman, Nir http://hdl.handle.net/2381/37601 2016-05-19T02:07:54Z 2016-05-18T14:45:25Z Title: T2: Temporal Property Verification Authors: Brockschmidt, Mark; Cook, Byron; Ishtiaq, Samin; Khlaaf, Heidy; Piterman, Nir Abstract: We present the open-source tool T2, the first public release from the TERMINATOR project. T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties. Input can be provided in a native format and in C, via the support of the LLVM compiler framework. We briefly discuss T2's architecture, its underlying techniques, and conclude with an experimental illustration of its competitiveness and directions for future extensions. Description: This is an extended version of a paper presented at the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems and published in the Proceedings as Brockschmidt, M., Cook, B. et. al., T2: Temporal Property Verification, Lecture Notes in Computer Science, 2016, 9636, pp 387-393. 2016-05-18T14:45:25Z Development of Design Heuristics for Digital Educational Games for School Children of 7 to 11 Years Old Khanana, Kornchulee http://hdl.handle.net/2381/37526 2016-05-13T02:15:00Z 2016-05-12T11:51:14Z Title: Development of Design Heuristics for Digital Educational Games for School Children of 7 to 11 Years Old Authors: Khanana, Kornchulee Abstract: To design a digital educational game (DEG) for children aged 7-11, it is necessary to know which game features are powerful for motivating them to play and learn. In the Pilot Study of my research project, playability heuristics of the GameFlow model were employed as an analytic tool. The heuristics, which were translated into a set of understandable statements for children, were useful for identifying preferable as well as less preferable game features. Based on the reviews of relevant theoretical frameworks from psychology, pedagogy and design, gaps of the GameFlow model were analysed. This led to the development of a set of eight design heuristics named DEG-7-11 v1. The heuristics were then applied to guide the creation of two new DEGs: FoodGroups-A following all the eight heuristics whereas FoodGroups-B following only two of them. To verify the hypotheses that FoodGroups-A was more educationally effective and enjoyable than FoodGroups-B, the Main Study involving two methods was conducted. For the first method, 182 participating children were randomly assigned to play FoodGroups-A or FoodGroups-B on an individual basis. By comparing the results of pre-tests and post-tests, the educational effect of FoodGroups-A was found to be higher than that of FoodGroups-B. Similarly, based on the results of the validated questionnaire KidsGEQ and the child-friendly statements derived from the GameFlow model, the experiential value of FoodGroups-A was perceived to be higher than that of FoodGroups-B. For the second method, the participating children were asked to rate their agreement with a set of child-friendly statements converted from the heuristics of DEG-7-11 v1, and the children agreed with most of them. The method of producing a child-friendly version of design heuristics originally meant for professional users was shown to be an alternative useful evaluation approach. Furthermore, Heuristic Evaluation was also employed to evaluate fifteen existing DEGs. The results implied that if game designers considered DEG-7-11 v1 in designing DEGs, the games could have a higher level of user acceptance. Finally, the wording of some DEG-7-11 v1 heuristics was modified to improve their understandability, resulting in DEG-7-11 v2. 2016-05-12T11:51:14Z Two Dimensional Range Minimum Queries and Fibonacci Lattices Brodal, Gerth Stølting Davoodi, Pooya Lewenstein, Moshe Raman, Rajeev Srinivasa Rao, Satti http://hdl.handle.net/2381/37491 2016-05-07T02:33:45Z 2016-05-06T09:25:06Z Title: Two Dimensional Range Minimum Queries and Fibonacci Lattices Authors: Brodal, Gerth Stølting; Davoodi, Pooya; Lewenstein, Moshe; Raman, Rajeev; Srinivasa Rao, Satti Abstract: Given a matrix of size N , two dimensional range minimum queries (2D-RMQs) ask for the position of the minimum element in a rectangular range within the matrix. We study trade-offs between the query time and the additional space used by indexing data structures that support 2D-RMQs. Using a novel technique—the discrepancy properties of Fibonacci lattices—we give an indexing data structure for 2D-RMQs that uses O(N/c) bits additional space with O(clog c(log log c) ²) query time, for any parameter c , 4≤c≤N. Also, when the entries of the input matrix are from {0,1}, we show that the query time can be improved to O(clog c) with the same space usage. Description: The file associated with this record is under a 24-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-05-06T09:25:06Z Beating the Harmonic lower bound for online bin packing Van Stee, Rob Heydrich, Sandy http://hdl.handle.net/2381/37490 2016-05-07T02:33:50Z 2016-05-06T08:41:55Z Title: Beating the Harmonic lower bound for online bin packing Authors: Van Stee, Rob; Heydrich, Sandy Abstract: In the online bin packing problem, items of sizes in (0, 1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. Harmonic++ achieves a competitive ratio of 1.58889 and belongs to the Super Harmonic framework [Seiden, J. ACM, 2002]; a lower bound of Ramanan et al. shows that within this framework, no competitive ratio below 1.58333 can be achieved [Ramanan et al., J. Algorithms, 1989]. In this paper, we present an online bin packing algorithm with asymptotic performance ratio of 1.5815, which constitutes the first improvement in fifteen years and reduces the gap to the lower bound by roughly 15%. We make two crucial changes to the Super Harmonic framework. First, some of the decisions of the algorithm will depend on exact sizes of items, instead of only their types. In particular, for item pairs where the size of one item is in (1/3, 1/2] and the other is larger than 1/2 (a large item), when deciding whether to pack such a pair together in one bin, our algorithm does not consider their types, but only checks whether their total size is at most 1. Second, for items with sizes in (1/3, 1/2] (medium items), we try to pack the larger items of every type in pairs, while combining the smallest items with large items whenever possible. To do this, we postpone the coloring of medium items (i.e., the decision which items to pack in pairs and which to pack alone) where possible, and later select the smallest ones to be reserved for combining with large items. Additionally, in case such large items arrive early, we pack medium items with them whenever possible. This is a highly unusual idea in the context of Harmonic-like algorithms, which initially seems to preclude analysis (the ratio of items combined with large items is no longer a fixed constant). For the analysis, we carefully mark medium items depending on how they end up packed, enabling us to add crucial constraints to the linear program used by Seiden. We consider the dual, eliminate all but one variable and then solve it with the ellipsoid method using a separation oracle. Our implementation uses additional algorithmic ideas to determine previously hand set parameters automatically and gives certificates for easy verification of the results. We give a lower bound of 1.5766 for algorithms like ours. This shows that fundamentally different ideas will be required to make further improvements. 2016-05-06T08:41:55Z Bin packing in multiple dimensions van Stee, Rob http://hdl.handle.net/2381/37457 2016-04-27T13:55:06Z 2016-04-27T13:54:43Z Title: Bin packing in multiple dimensions Authors: van Stee, Rob Abstract: I mentioned in a previous column [22] that the best known lower bound for the two-dimensional online bin packing problem is 1.907 by Blitz, van Vliet, Woeginger [2], which is an unpublished (and now lost [24]) manuscript. I have realized since then that even the penultimate result, 1.856, was published only in Andre van Vliet's Ph.D. thesis [23] and is not readily available. It therefore seems like a good idea to describe his methods here, though not in full detail. This will include a discussion of the three-dimensional case. I will also survey other results in multidimensional packing, that were left out in my previous column. 2016-04-27T13:54:43Z Online algorithms with advice for bin packing and scheduling problems Renault, Marc P. Rosén, Adi van Stee, Rob http://hdl.handle.net/2381/37456 2016-04-27T13:45:56Z 2016-04-27T13:45:14Z Title: Online algorithms with advice for bin packing and scheduling problems Authors: Renault, Marc P.; Rosén, Adi; van Stee, Rob Abstract: We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a constant number of bits of advice per request. For the bin packing problem, we give an online algorithm with advice that is (1+ε)-competitive and uses O(1εlog 1ε) bits of advice per request. For scheduling on m identical machines, with the objective function of any of makespan, machine covering and the minimization of the ℓ<inf>p</inf> norm, p>1, we give similar results. We give online algorithms with advice which are (1+ε)-competitive ((1/(1-ε))-competitive for machine covering) and also use O(1εlog 1ε) bits of advice per request. We complement our results by giving a lower bound that shows that for any online algorithm with advice to be optimal, for any of the above scheduling problems, a non-constant number (namely, at least (1-2mn)log m, where n is the number of jobs and m is the number of machines) of bits of advice per request is needed. 2016-04-27T13:45:14Z Efficient Embedded Software Migration towards Clusterized Distributed-Memory Architectures Garibotti, Rafael Butko, Anastasiia Ost, Luciano Gamatie, Abdoulaye Sassatelli, Gilles Adeniyi-Jones, Chris http://hdl.handle.net/2381/37451 2016-04-27T02:05:20Z 2016-04-26T14:07:53Z Title: Efficient Embedded Software Migration towards Clusterized Distributed-Memory Architectures Authors: Garibotti, Rafael; Butko, Anastasiia; Ost, Luciano; Gamatie, Abdoulaye; Sassatelli, Gilles; Adeniyi-Jones, Chris Abstract: A large portion of existing multithreaded embedded sofware has been programmed according to symmetric shared memory platforms where a monolithic memory block is shared by all cores. Such platforms accommodate popular parallel programming models such as POSIX threads and OpenMP. However with the growing number of cores in modern manycore embedded architectures, they present a bottleneck related to their centralized memory accesses. This paper proposes a solution tailored for an efficient execution of applications defined with shared-memory programming models onto on-chip distributed-memory multicore architectures. It shows how performance, area and energy consumption are significantly improved thanks to the scalability of these architectures. This is illustrated in an open-source realistic design framework, including tools from ASIC to microkernel. 2016-04-26T14:07:53Z The cost of selfishness for maximizing the minimum load on uniformly related machines Epstein, L. Kleiman, E. Van Stee, Rob http://hdl.handle.net/2381/37390 2016-04-20T09:17:08Z 2016-04-20T09:17:00Z Title: The cost of selfishness for maximizing the minimum load on uniformly related machines Authors: Epstein, L.; Kleiman, E.; Van Stee, Rob Abstract: Consider the following scheduling game. A set of jobs, each controlled by a selfish agent, are to be assigned to m uniformly related machines. The cost of a job is defined as the total load of the machine that its job is assigned to. A job is interested in minimizing its cost, while the social objective is maximizing the minimum load (the value of the cover) over the machines. This goal is different from the regular makespan minimization goal, which was extensively studied in a game theoretic context. We study the price of anarchy (poa) and the price of stability (pos) for uniformly related machines. The results are expressed in terms of s, which is the maximum speed ratio between any two machines. For uniformly related machines, we prove that the pos is unbounded for s>2, and the poa is unbounded for s≥2. For the remaining cases we show that while the poa grows to infinity as s tends to 2, the pos is at most 2 for any s≤2. © 2012 Springer Science+Business Media New York. 2016-04-20T09:17:00Z SIGACT news online algorithms column 23 van Stee, Rob http://hdl.handle.net/2381/37389 2016-04-20T09:14:50Z 2016-04-20T09:13:06Z Title: SIGACT news online algorithms column 23 Authors: van Stee, Rob Description: timestamp: Sun, 04 May 2014 01:00:00 +0200 biburl: http://dblp.uni-trier.de/rec/bib/journals/sigact/Stee14 bibsource: dblp computer science bibliography, http://dblp.org 2016-04-20T09:13:06Z Dividing connected chores fairly Heydrich, S. van Stee, Rob http://hdl.handle.net/2381/37387 2016-04-20T09:04:49Z 2016-04-20T09:04:38Z Title: Dividing connected chores fairly Authors: Heydrich, S.; van Stee, Rob Abstract: In this paper we consider the fair division of chores (tasks that need to be performed by agents, with negative utility for them), and study the loss in social welfare due to fairness. Previous work has been done on this so-called price of fairness, concerning fair division of cakes and chores with non-connected pieces and of cakes with connected pieces. In this paper, we consider situations where each player has to receive one connected piece of the chores. We provide tight or nearly tight bounds on the price of fairness with respect to the three main fairness criteria proportionality, envy-freeness and equitability and for utilitarian and egalitarian welfare. We also give the first proof of the existence of equitable divisions for chores with connected pieces. Description: The file associated with this record is under a 24-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-04-20T09:04:38Z Dealing with Multiple Classes in Online Class Imbalance Learning Wang, S. Minku, Leandro Lei Yao, X. http://hdl.handle.net/2381/37337 2016-04-19T02:04:38Z 2016-04-18T11:17:55Z Title: Dealing with Multiple Classes in Online Class Imbalance Learning Authors: Wang, S.; Minku, Leandro Lei; Yao, X. Abstract: x 2016-04-18T11:17:55Z SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1 Van Stee, Rob http://hdl.handle.net/2381/37327 2016-04-18T09:47:12Z 2016-04-18T09:47:02Z Title: SIGACT News Online Algorithms Column 27: Online Matching on the Line, Part 1 Authors: Van Stee, Rob 2016-04-18T09:47:02Z A Unified Approach to Truthful Scheduling on Related Machines Van Stee, Rob Epstein, L. Levin, A. http://hdl.handle.net/2381/37326 2016-04-18T09:34:03Z 2016-04-18T09:33:53Z Title: A Unified Approach to Truthful Scheduling on Related Machines Authors: Van Stee, Rob; Epstein, L.; Levin, A. Abstract: We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTASs) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the p-norm of the machine loads vector. Previously, this kind of result was only known for the makespan objective. Monotone algorithms have the property that an increase in the speed of a machine cannot decrease the amount of work assigned to it. Our results imply the existence of a truthful mechanism that can be implemented in polynomial time, where the social goal is approximated within arbitrary precision. Description: The file associated with this record is under a 12-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-04-18T09:33:53Z A calculus for local reversibility Kuhn, Stefan Ulidowski, Irek http://hdl.handle.net/2381/37276 2016-04-14T10:02:18Z 2016-04-13T08:52:30Z Title: A calculus for local reversibility Authors: Kuhn, Stefan; Ulidowski, Irek Abstract: x Description: The file associated with this record is under a 12-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-04-13T08:52:30Z Run-Time Resolution of Service Property Conflicts in Web Service Composition Xu, J. Ning, X. Reiff-Marganiec, Stephan Duan, Q. Zheng, Z. http://hdl.handle.net/2381/37275 2016-04-14T02:15:31Z 2016-04-13T08:38:30Z Title: Run-Time Resolution of Service Property Conflicts in Web Service Composition Authors: Xu, J.; Ning, X.; Reiff-Marganiec, Stephan; Duan, Q.; Zheng, Z. Abstract: With rapid development of Web service technologies, service composition has become a common approach to realizing complex business processes. Due to the large number of services developed and deployed independently by various providers, undesirable interactions between properties of different service components may occur when they are composed into a composite service. Such service property conflicts become a serious obstacle for service composition to meet users' requirements. Although traditional feature interaction techniques may prevent some property conflicts in service design stage, many conflicts occur during execution based on certain run-time data; therefore must be resolved online. In this paper, we propose a scheme to address the problem of run-time resolution of service property conflicts. We first formulate the conflict resolution problem with a bi-objective optimization model based on user's revenue, which represents the QoS and success rate of a service. Then we solve the bi-objective optimization model to obtain a set of Pareto solutions and rank the solutions to identify the optimal one, which gives the best roll back strategy and alternative service plan for resolving a service property conflict. We also implement the proposed scheme in a prototype of online shopping application and evaluate performance of the scheme through experiments. The obtained experimental results indicate that our scheme is effective and efficient in resolving service property conflicts at runtime. Description: The file associated with this record is under a 6-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-04-13T08:38:30Z Extracting Visual Contracts from Java Programs Heckel, Reiko Alshanqiti, Abdullah http://hdl.handle.net/2381/37262 2016-04-13T02:06:19Z 2016-04-12T09:57:44Z Title: Extracting Visual Contracts from Java Programs Authors: Heckel, Reiko; Alshanqiti, Abdullah Abstract: Visual contracts model the operations of components or services by pre-and post-conditions formalised as graph transformation rules. They provide a precise intuitive notation to support testing, understanding and analysis of software. However, due to their detailed specification of data states and transformations, modelling real applications is an error-prone process. In this paper we propose a dynamic approach to reverse engineering visual contracts from Java based on tracing the execution of Java operations. The resulting contracts give an accurate description of the observed object transformations, their effects and preconditions in terms of object structures, parameter and attribute values, and their generalised specification by universally quantified (multi) objects. While this paper focusses on the fundamental technique rather than a particular application, we explore potential uses in our evaluation, including in program understanding, review of test reports and debugging. 2016-04-12T09:57:44Z Which Data Mining Method Do You Need? Minku, Leandro Lei http://hdl.handle.net/2381/37240 2016-04-12T02:25:36Z 2016-04-11T10:47:56Z Title: Which Data Mining Method Do You Need? Authors: Minku, Leandro Lei 2016-04-11T10:47:56Z The Wisdom of the Crowds in Software Engineering Predictive Modelling Minku, Leandro Lei http://hdl.handle.net/2381/37239 2016-04-12T02:25:35Z 2016-04-11T10:42:29Z Title: The Wisdom of the Crowds in Software Engineering Predictive Modelling Authors: Minku, Leandro Lei 2016-04-11T10:42:29Z The Best Two-Phase Algorithm for Bin Stretching Böhm, M. Sgall, J. Van Stee, Rob Veselý, P. http://hdl.handle.net/2381/37201 2016-04-09T03:32:45Z 2016-04-08T09:22:21Z Title: The Best Two-Phase Algorithm for Bin Stretching Authors: Böhm, M.; Sgall, J.; Van Stee, Rob; Veselý, P. Abstract: Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of $1.5$ for any number of bins. We build on previous algorithms and use a two-phase approach. We also show that this approach cannot give better results by proving a matching lower bound. Description: Preprint of a journal version. The conference version can be found at arXiv:1404.5569 2016-04-08T09:22:21Z Finitary Logics for Coalgebras with Branching Kissig, Christian http://hdl.handle.net/2381/37190 2016-04-08T02:26:49Z 2016-04-07T11:33:58Z Title: Finitary Logics for Coalgebras with Branching Authors: Kissig, Christian Abstract: The purpose of this dissertation is to further previous work on coalgebras as infinite statebased transition systems and their logical characterisation with particular focus on infinite regular behaviour and branching. Finite trace semantics is well understood [DR95] for nondeterministic labelled transition systems, and has recently [Jac04, HJS06] been generalised to a coalgebraic level where monads act as branching types for instance, of nondeterministic choice. Finite trace semantics then arises through an inductive construction in the Kleisli-category of the monad. We provide a more comprehensive definition of finite trace semantics, allowing for finitary branching types in Chapter 5. In Chapter 6 we carry over the ideas behind our definition of finite trace semantics to define infinite trace semantics. Coalgebraic logics [Mos99] provide one approach to characterising states in coalgebras up to bisimilarity. Coalgebraic logics are Boolean logics with the modality r. We define the Boolean dual of r in the negation-free fragment of finitary coalgebraic logics in Chapter 7, showing that finitary coalgebraic logics are essentially negation free. Our proof is largely based on the previously established completeness of finitary coalgebraic logics [KKV08]. Finite trace semantics induces the notion of finite trace equivalence. In Chapter 8 we define coalgebraic logics for many relevant branching and transition types characterising states of coalgebras with branching up to finite trace equivalence. Under further assumptions we show that these logics are expressive. Coalgebra automata allow us to state finitary properties over infinite structures essentially by a fix-point style construction. We use the dualisation of r from Chapter 7 to prove that coalgebra automata are closed under complementation in Chapter 10. This result completes a Rabin style [Rab69] correspondence between finitary coalgebraic logics and coalgebra automata for finitary transition types, begun in [Ven04, KV05]. The semantics of coalgebra automata is given in terms of parity graph games [GTW02]. In Chapter 9 we show how to structure parity graph games into rounds using the notion of players power [vB02] and how to normalise the interaction pattern between the players per round. From the latter we obtain the coinductive principle of game bisimulation. Languages accepted by coalgebra automata are called regular. Regularity is commonly [Sip96, HMU03] disproved using the pumping lemma for regular languages. We define regular languages of coalgebras and prove a pumping lemma for these languages in Chapter 11. 2016-04-07T11:33:58Z FEDD: Feature Extraction for Explicit Concept Drift Detection in Time Series Cavalcante, R. Minku, Leandro Lei Oliveira, A. http://hdl.handle.net/2381/37187 2016-04-08T02:24:59Z 2016-04-07T11:09:51Z Title: FEDD: Feature Extraction for Explicit Concept Drift Detection in Time Series Authors: Cavalcante, R.; Minku, Leandro Lei; Oliveira, A. Abstract: A time series is a sequence of observations col- lected over fixed sampling intervals. Several real-world dynamic processes can be modeled as a time series, such as stock price movements, exchange rates, temperatures, among others. As a special kind of data stream, a time series may present concept drift, which affects negatively time series analysis and forecasting. Explicit drift detection methods based on monitoring the time series features may provide a better understanding of how concepts evolve over time than methods based on monitoring the forecasting error of a base predictor. In this paper, we propose an online explicit drift detection method that identifies concept drifts in time series by monitoring time series features, called Feature Extraction for Explicit Concept Drift Detection (FEDD). Computational experiments showed that FEDD performed better than error-based approaches in several linear and nonlinear artificial time series with abrupt and gradual concept drifts. 2016-04-07T11:09:51Z Dynamic Selection of Evolutionary Operators Based on Online Learning and Fitness Landscape Analysis Consoli, P. A. Mei, Y. Minku, Leandro Lei Yao, X. http://hdl.handle.net/2381/37186 2016-04-08T02:24:53Z 2016-04-07T10:51:27Z Title: Dynamic Selection of Evolutionary Operators Based on Online Learning and Fitness Landscape Analysis Authors: Consoli, P. A.; Mei, Y.; Minku, Leandro Lei; Yao, X. Abstract: Self-adaptive mechanisms for the identification of the most suitable variation operator in evolutionary algorithms rely almost exclusively on the measurement of the fitness of the offspring, which may not be sufficient to assess the optimality of an operator (e.g., in a landscape with an high degree of neutrality). This paper proposes a novel adaptive operator selection mechanism which uses a set of four fitness landscape analysis techniques and an online learning algorithm, dynamic weighted majority, to provide more detailed information about the search space to better determine the most suitable crossover operator. Experimental analysis on the capacitated arc routing problem has demonstrated that different crossover operators behave differently during the search process, and selecting the proper one adaptively can lead to more promising results. 2016-04-07T10:51:27Z On Recovering from Run-time Misbehaviour in ADR Poyias, Kyriakos Tuosto, Emilio http://hdl.handle.net/2381/37181 2016-04-08T02:24:48Z 2016-04-07T10:19:40Z Title: On Recovering from Run-time Misbehaviour in ADR Authors: Poyias, Kyriakos; Tuosto, Emilio Abstract: We propose a monitoring mechanism for recording the evolution of systems after certain computations, maintaining the history in a tree-like structure. Technically, we develop the monitoring mechanism in a variant of ADR (after Architectural Design Rewriting), a rule-based formal framework for modelling the evolution of architectures of systems. The hierarchical nature of ADR allows us to take full advantage of the tree-like structure of the monitoring mechanism. We exploit this mechanism to formally define new rewriting mechanisms for ADR reconfiguration rules. Also, by monitoring the evolution we propose a way of identifying which part of a system has been affected when unexpected run-time behaviours emerge. Moreover, we propose a methodology to suggest reconfigurations that could potentially lead the system in a non-erroneous state. Description: In Proceedings ICE 2013, arXiv:1310.4019 2016-04-07T10:19:40Z Honesty by typing Bartoletti, M. Scalas, A. Tuosto, Emilio Zunino, R. http://hdl.handle.net/2381/37180 2016-04-08T02:24:50Z 2016-04-07T10:15:59Z Title: Honesty by typing Authors: Bartoletti, M.; Scalas, A.; Tuosto, Emilio; Zunino, R. Abstract: We propose a type system for a calculus of contracting processes. Processes may stipulate contracts, and then either behave honestly, by keeping the promises made, or not. Type safety guarantees that a typeable process is honest - that is, the process abides by the contract it has stipulated in all possible contexts, even those containing dishonest adversaries. © 2013 IFIP International Federation for Information Processing. 2016-04-07T10:15:59Z From orchestration to choreography through contract automata Basile, D. Degano, P. Ferrari, G-L. Tuosto, Emilio http://hdl.handle.net/2381/37178 2016-04-08T02:24:41Z 2016-04-07T09:40:52Z Title: From orchestration to choreography through contract automata Authors: Basile, D.; Degano, P.; Ferrari, G-L.; Tuosto, Emilio Abstract: We study the relations between a contract automata and an interaction model. In the former model, distributed services are abstracted away as automata - oblivious of their partners - that coordinate with each other through an orchestrator. The interaction model relies on channel-based asynchronous communication and choreography to coordinate distributed services. We define a notion of strong agreement on the contract model, exhibit a natural mapping from the contract model to the interaction model, and give conditions to ensure that strong agreement corresponds to well-formed choreography. 2016-04-07T09:40:52Z Communicating machines as a dynamic binding mechanism of services Vissani, I. Pombo, C. G. L. Tuosto, Emilio http://hdl.handle.net/2381/37177 2016-04-08T02:24:47Z 2016-04-07T09:08:49Z Title: Communicating machines as a dynamic binding mechanism of services Authors: Vissani, I.; Pombo, C. G. L.; Tuosto, Emilio Abstract: Distributed software is becoming more and more dynamic to support applications able to respond and adapt to the changes of their execution environment. For instance, service-oriented computing (SOC) envisages applications as services running over globally available computational resources where discovery and binding between them is transparently performed by a middleware. Asynchronous Relational Networks (ARNs) is a well-known formal orchestration model, based on hypergraphs, for the description of service-oriented software artefacts. Choreography and orchestration are the two main design principles for the development of distributed software. In this work, we propose Communicating Relational Networks (CRNs), which is a variant of ARNs, but relies on choreographies for the characterisation of the communicational aspects of a software artefact, and for making their automated analysis more efficient. 2016-04-07T09:08:49Z Choreography-Based Analysis of Distributed Message Passing Programs Taylor, R. Tuosto, E. Walkinshaw, Neil Derrick, J. http://hdl.handle.net/2381/37150 2016-04-07T02:25:17Z 2016-04-06T08:45:42Z Title: Choreography-Based Analysis of Distributed Message Passing Programs Authors: Taylor, R.; Tuosto, E.; Walkinshaw, Neil; Derrick, J. Abstract: x 2016-04-06T08:45:42Z Data Mining for Software Engineering and Humans in the Loop Minku, Leandro L. Mendes, E. Turhan, B. http://hdl.handle.net/2381/37102 2016-04-01T02:31:42Z 2016-03-31T08:54:54Z Title: Data Mining for Software Engineering and Humans in the Loop Authors: Minku, Leandro L.; Mendes, E.; Turhan, B. Abstract: The field of data mining for software engineering has been growing over the last decade. This field is concerned with the use of data mining to provide useful insights into how to improve software engineering processes and software itself, supporting decision making. For that, data produced by software engineering processes and products during and after software development is used. Despite promising results, there is frequently a lack of discussion on the role of software engineering practitioners amidst the data mining approaches. This makes adoption of data mining by software engineering practitioners difficult. Moreover, the fact that experts' knowledge is frequently ignored by data mining approaches, together with the lack of transparency of such approaches, can hinder the acceptability of data mining by software engineering practitioners. In order to overcome these problems, this position paper provides a discussion of the role of software engineering experts when adopting data mining approaches. It also argues that this role can be extended in order to increase experts' involvement in the process of building data mining models. We believe that such extended involvement is not only likely to increase software engineers' acceptability of the resulting models, but also improve the models themselves. We also provide some recommendations aimed at increasing the success of experts involvement and model acceptability. 2016-03-31T08:54:54Z Understanding the Relationship between Frustration and the Severity of Usability Problems : What can Psychophysiological Data (Not) Tell Us? Law, Lai-Chong Bruun, A. Heintz, M. Alkly, L. http://hdl.handle.net/2381/36765 2016-02-19T03:23:57Z 2016-02-18T09:47:35Z Title: Understanding the Relationship between Frustration and the Severity of Usability Problems : What can Psychophysiological Data (Not) Tell Us? Authors: Law, Lai-Chong; Bruun, A.; Heintz, M.; Alkly, L. Abstract: x Description: The file associated with this record is under a permanent embargo while publication is In Press in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-02-18T09:47:35Z Discovering "unknown known" security requirements Rashid, A. Naqvi, A. Ramdhany, R. Edwards, M. Chitchyan, Ruzanna Babar, M. A. http://hdl.handle.net/2381/36764 2016-02-19T03:24:05Z 2016-02-18T09:27:58Z Title: Discovering "unknown known" security requirements Authors: Rashid, A.; Naqvi, A.; Ramdhany, R.; Edwards, M.; Chitchyan, Ruzanna; Babar, M. A. Abstract: x Description: The file associated with this record is under a permanent embargo while publication is In Press in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-02-18T09:27:58Z Managing Emergent Ethical Concerns for Software Engineering in Society Rashid, A. Moore, K. May-Chahal, C. Chitchyan, Ruzanna http://hdl.handle.net/2381/36763 2016-02-19T03:24:05Z 2016-02-18T09:23:34Z Title: Managing Emergent Ethical Concerns for Software Engineering in Society Authors: Rashid, A.; Moore, K.; May-Chahal, C.; Chitchyan, Ruzanna Abstract: This paper presents an initial framework for managing emergent ethical concerns during software engineering in society projects. We argue that such emergent considerations can neither be framed as absolute rules about how to act in relation to fixed and measurable conditions. Nor can they be addressed by simply framing them as non-functional requirements to be satisficed. Instead, a continuous process is needed that accepts the 'messiness' of social life and social research, seeks to understand complexity (rather than seek clarity), demands collective (not just individual) responsibility and focuses on dialogue over solutions. The framework has been derived based on retrospective analysis of ethical considerations in four software engineering in society projects in three different domains. 2016-02-18T09:23:34Z Sustainability Design and Software: The Karlskrona Manifesto Becker, C. Chitchyan, Ruzanna Duboc, L. Easterbrook, S. Penzenstadler, B. Seyff, N. Venters, C. C. http://hdl.handle.net/2381/36732 2016-02-17T03:19:13Z 2016-02-16T15:25:04Z Title: Sustainability Design and Software: The Karlskrona Manifesto Authors: Becker, C.; Chitchyan, Ruzanna; Duboc, L.; Easterbrook, S.; Penzenstadler, B.; Seyff, N.; Venters, C. C. Abstract: Sustainability has emerged as a broad concern for society. Many engineering disciplines have been grappling with challenges in how we sustain technical, social and ecological systems. In the software engineering community, for example, maintainability has been a concern for a long time. But too often, these issues are treated in isolation from one another. Misperceptions among practitioners and research communities persist, rooted in a lack of coherent understanding of sustainability, and how it relates to software systems research and practice. This article presents a cross-disciplinary initiative to create a common ground and a point of reference for the global community of research and practice in software and sustainability, to be used for effectively communicating key issues, goals, values and principles of sustainability design for software-intensive systems.The centrepiece of this effort is the Karlskrona Manifesto for Sustainability Design, a vehicle for a much needed conversation about sustainability within and beyond the software community, and an articulation of the fundamental principles underpinning design choices that affect sustainability. We describe the motivation for developing this manifesto, including some considerations of the genre of the manifesto as well as the dynamics of its creation. We illustrate the collaborative reflective writing process and present the current edition of the manifesto itself. We assess immediate implications and applications of the articulated principles, compare these to current practice, and suggest future steps. 2016-02-16T15:25:04Z Engineering Sustainability Through Language Chitchyan, Ruzanna Cazzola, W. Rashid, A. http://hdl.handle.net/2381/36729 2016-02-17T03:19:13Z 2016-02-16T13:26:19Z Title: Engineering Sustainability Through Language Authors: Chitchyan, Ruzanna; Cazzola, W.; Rashid, A. Abstract: As our understanding and care for sustainability concerns increases, so does the demand for incorporating these concerns into software. Yet, existing programming language constructs are not well-aligned with concepts of the sustainability domain. This undermines what we term technical sustainability of the software due to (i) increased complexity in programming of such concerns and (ii) continuous code changes to keep up with changes in (environmental, social, legal and other) sustainability-related requirements. In this paper we present a proof-of-concept approach on how technical sustainability support for new and existing concerns can be provided through flexible language-level programming. We propose to incorporate sustainability-related behaviour into programs through micro-languages enabling such behaviour to be updated and/or redefined as and when required. 2016-02-16T13:26:19Z Online Ensemble Learning of Data Streams with Gradually Evolved Classes Sun, Y. Tang, K. Minku, Leandro Lei Wang, S. Yao, X. http://hdl.handle.net/2381/36721 2016-02-17T03:18:41Z 2016-02-16T11:35:26Z Title: Online Ensemble Learning of Data Streams with Gradually Evolved Classes Authors: Sun, Y.; Tang, K.; Minku, Leandro Lei; Wang, S.; Yao, X. Abstract: Class evolution, the phenomenon of class emergence and disappearance, is an important research topic for data stream mining. All previous studies implicitly regard class evolution as a transient change, which is not true for many real-world problems. This paper concerns the scenario where classes emerge or disappear gradually. A class-based ensemble approach, namely Class-Based ensemble for Class Evolution (CBCE), is proposed. By maintaining a base learner for each class and dynamically updating the base learners with new data, CBCE can rapidly adjust to class evolution. A novel under-sampling method for the base learners is also proposed to handle the dynamic class-imbalance problem caused by the gradual evolution of classes. Empirical studies demonstrate the effectiveness of CBCE in various class evolution scenarios in comparison to existing class evolution adaptation methods. 2016-02-16T11:35:26Z Quasivarieties and varieties of ordered algebras : Regularity and exactness Kurz, Alexander Herbert Velebil, J. http://hdl.handle.net/2381/36716 2016-07-18T01:45:07Z 2016-02-15T11:57:40Z Title: Quasivarieties and varieties of ordered algebras : Regularity and exactness Authors: Kurz, Alexander Herbert; Velebil, J. Abstract: We characterise quasivarieties and varieties of ordered algebras categorically in terms of regularity, exactness and the existence of a suitable generator. The notions of regularity and exactness need to be understood in the sense of category theory enriched over posets. We also prove that finitary varieties of ordered algebras are cocompletions of their theories under sifted colimits (again, in the enriched sense). Description: The file associated with this record is under a 6-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-02-15T11:57:40Z Multi-type display calculus for propositional dynamic logic Frittella, S. Greco, G. Kurz, Alexander Herbert Palmigiano, A. http://hdl.handle.net/2381/36715 2016-02-16T03:27:11Z 2016-02-15T11:50:32Z Title: Multi-type display calculus for propositional dynamic logic Authors: Frittella, S.; Greco, G.; Kurz, Alexander Herbert; Palmigiano, A. Abstract: We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property. 2016-02-15T11:50:32Z Autonomous and Self Controlling Smart Objects for the Future Internet. Hernandez, Marco E. Perez Reiff-Marganiec, Stephan http://hdl.handle.net/2381/36714 2016-02-16T03:27:12Z 2016-02-15T11:41:04Z Title: Autonomous and Self Controlling Smart Objects for the Future Internet. Authors: Hernandez, Marco E. Perez; Reiff-Marganiec, Stephan Abstract: Development of IoT applications relies heavily on middleware architectures. Multiple solutions have been proposed using service and agent paradigms, which consequently impose a specific application development model. We observe a trend towards a data-feeder approach in which smart objects are simple data gatherers and senders. This approach reduces the autonomy of smart objects and brings privacy concerns about the data and service manipulation by remote applications and services. We propose a new approach for middleware and application development for smart objects based on Web agents and services. Specifically, we integrate services as part of activities included in roles of a web agent allowing us to keep control of the service and data generated on-object, in contrast to delegating to remote applications or services. In addition, our P2P-inspired method for service discovery gives autonomy to smart objects since a central directory is not required to interact with others. We completed an initial implementation of our architecture and demonstrated its feasibility in a case study in the smart home domain. Description: Deposited with reference to the publisher's copyright and archiving policy. 2016-02-15T11:41:04Z Efficient web services selection based on QoS through a distributed parallel semantic approach Nakamura, L. H. V. Prado, P. F. D. Libardi, R. M. D. O. Nunes, L. H. Meneguette, R. I. Estrella, J. C. Santana, R. H. C. Santana, M. J. Reiff-Marganiec, Stephan http://hdl.handle.net/2381/36713 2016-02-16T03:26:56Z 2016-02-15T11:36:44Z Title: Efficient web services selection based on QoS through a distributed parallel semantic approach Authors: Nakamura, L. H. V.; Prado, P. F. D.; Libardi, R. M. D. O.; Nunes, L. H.; Meneguette, R. I.; Estrella, J. C.; Santana, R. H. C.; Santana, M. J.; Reiff-Marganiec, Stephan Editors: Badra, M.; Boukerche, A.; Urien, P. Abstract: This paper proposes a solution to performance issues in the selection of Web services based on Quality of Service (QoS) that uses inference mechanisms from Semantic Web resources. Although several researchers highlight the benefits provided by the use of the Semantic Web techniques for searching and compose Web services with QoS, it can become costly when it depends on the approach adopted. Thus, we present a web service selection that uses QoS information in a replicated and distributed ontologies over different service providers. The results point to a significant improvement in the ontology inference process and thus makes the use of semantic resources viable in distributed systems to provide better QoS. Description: Deposited with reference to the publisher's copyright and archiving policy. 2016-02-15T11:36:44Z Positive Fragments Of Coalgebraic Logics Balan, A. Kurz, Alexander Herbert Velebil, J. http://hdl.handle.net/2381/36575 2016-02-05T03:27:16Z 2016-02-04T12:46:07Z Title: Positive Fragments Of Coalgebraic Logics Authors: Balan, A.; Kurz, Alexander Herbert; Velebil, J. Abstract: Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem, which not only gives a conceptual proof based on duality theory, but also generalizes Dunn's result from Kripke frames to coalgebras for weak-pullback preserving functors. To facilitate this analysis we prove a number of category theoretic results on functors on the categories $mathsf{Set}$ of sets and $mathsf{Pos}$ of posets: Every functor $mathsf{Set} to mathsf{Pos}$ has a $mathsf{Pos}$-enriched left Kan extension $mathsf{Pos} to mathsf{Pos}$. Functors arising in this way are said to have a presentation in discrete arities. In the case that $mathsf{Set} to mathsf{Pos}$ is actually $mathsf{Set}$-valued, we call the corresponding left Kan extension $mathsf{Pos} to mathsf{Pos}$ its posetification. A $mathsf{Set}$-functor preserves weak pullbacks if and only if its posetification preserves exact squares. A $mathsf{Pos}$-functor with a presentation in discrete arities preserves surjections. The inclusion $mathsf{Set} to mathsf{Pos}$ is dense. A functor $mathsf{Pos} to mathsf{Pos}$ has a presentation in discrete arities if and only if it preserves coinserters of `truncated nerves of posets'. A functor $mathsf{Pos} to mathsf{Pos}$ is a posetification if and only if it preserves coinserters of truncated nerves of posets and discrete posets. A locally monotone endofunctor of an ordered variety has a presentation by monotone operations and equations if and only if it preserves $mathsf{Pos}$-enriched sifted colimits. 2016-02-04T12:46:07Z Presenting Distributive Laws Bonsangue, M. M. Hansen, H. H. Kurz, Alexander Herbert Rot, J. http://hdl.handle.net/2381/36574 2016-02-05T03:27:17Z 2016-02-04T12:43:36Z Title: Presenting Distributive Laws Authors: Bonsangue, M. M.; Hansen, H. H.; Kurz, Alexander Herbert; Rot, J. Abstract: Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If T is a free monad, then such distributive laws correspond to simple natural transformations. However, when T is not free it can be rather difficult to prove the defining axioms of a distributive law. In this paper we describe how to obtain a distributive law for a monad with an equational presentation from a distributive law for the underlying free monad. We apply this result to show the equivalence between two different representations of context-free languages. 2016-02-04T12:43:36Z Obligation Blackwell Games and p-Automata Piterman, Nir Chatterjee, Krishnendu http://hdl.handle.net/2381/36416 2016-01-27T11:09:27Z 2016-01-27T11:09:15Z Title: Obligation Blackwell Games and p-Automata Authors: Piterman, Nir; Chatterjee, Krishnendu Abstract: We generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP\co-NP.We also show that obligation games provide a game framework for reasoning about p-automata. Description: The file associated with this record is under a permanent embargo while publication is In Press in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above. 2016-01-27T11:09:15Z Finding Recurrent Sets with Backward Analysis and Trace Partitioning Piterman, Nir Bakhirkin, Alexey http://hdl.handle.net/2381/36303 2016-01-18T14:58:11Z 2016-01-18T14:57:54Z Title: Finding Recurrent Sets with Backward Analysis and Trace Partitioning Authors: Piterman, Nir; Bakhirkin, Alexey Abstract: We propose an abstract-interpretation-based analysis for recurrent sets. A recurrent set is a set of states from which the execution of a program cannot or might not (as in our case) escape. A recurrent set is a part of a program's nontermination proof (that needs to be complemented by reachability analysis). We find recurrent sets by performing a potentially over-approximate backward analysis that produces an initial candidate. We then perform over-approximate forward analysis on the candidate to check and refine it and ensure soundness. In practice, the analysis relies on trace partitioning that predicts future paths through the program that non-terminating executions will take. Using our technique, we were able to find recurrent sets in many benchmarks found in the literature including some that, to our knowledge, cannot be handled by existing tools. In addition, we note that typically, analyses that search for recurrent sets are applied to linear under-approximations of programs or employ some form of non-approximate numeric reasoning. In contrast, our analysis uses standard abstract-interpretation techniques and is potentially applicable to a larger class of abstract domains (and therefore – programs). Description: The file is under embargo for 12 months from publication. 2016-01-18T14:57:54Z Drug target optimization in chronic myeloid leukemia using innovative computational platform. Chuang, Ryan Hall, Benjamin A. Benque, David Cook, Byron Ishtiaq, Samin Piterman, Nir Taylor, Alex Vardi, Moshe Koschmieder, Steffen Gottgens, Berthold Fisher, Jasmin http://hdl.handle.net/2381/36302 2016-01-19T03:08:06Z 2016-01-18T14:25:25Z Title: Drug target optimization in chronic myeloid leukemia using innovative computational platform. Authors: Chuang, Ryan; Hall, Benjamin A.; Benque, David; Cook, Byron; Ishtiaq, Samin; Piterman, Nir; Taylor, Alex; Vardi, Moshe; Koschmieder, Steffen; Gottgens, Berthold; Fisher, Jasmin Abstract: Chronic Myeloid Leukemia (CML) represents a paradigm for the wider cancer field. Despite the fact that tyrosine kinase inhibitors have established targeted molecular therapy in CML, patients often face the risk of developing drug resistance, caused by mutations and/or activation of alternative cellular pathways. To optimize drug development, one needs to systematically test all possible combinations of drug targets within the genetic network that regulates the disease. The BioModelAnalyzer (BMA) is a user-friendly computational tool that allows us to do exactly that. We used BMA to build a CML network-model composed of 54 nodes linked by 104 interactions that encapsulates experimental data collected from 160 publications. While previous studies were limited by their focus on a single pathway or cellular process, our executable model allowed us to probe dynamic interactions between multiple pathways and cellular outcomes, suggest new combinatorial therapeutic targets, and highlight previously unexplored sensitivities to Interleukin-3. 2016-01-18T14:25:25Z T2: Temporal Property Verification Brockschmidt, Mark Cook, Byron Ishtiaq, Samin Khlaaf, Heidy Piterman, Nir http://hdl.handle.net/2381/36301 2016-05-18T14:21:39Z 2016-01-18T14:14:13Z Title: T2: Temporal Property Verification Authors: Brockschmidt, Mark; Cook, Byron; Ishtiaq, Samin; Khlaaf, Heidy; Piterman, Nir Abstract: We present the open-source tool T2, the first public release from the TERMINATOR project. T2 has been extended over the past decade to support automatic temporal-logic proving techniques and to handle a general class of user-provided liveness and safety properties. Input can be provided in a native format and in C, via the support of the LLVM compiler framework. We briefly discuss T2's architecture, its underlying techniques, and conclude with an experimental illustration of its competitiveness and directions for future extensions. 2016-01-18T14:14:13Z


text:
Harold Perrineau Sees Something UnusualWhit Honea
Harold Perrineau and his wife Brittany seem rather distracted by something in front of their house. I'm guessing it has flashes and twelve feet. Daughter Wynter isn't fazed at all.
In other news, I can't believe Perrineau's new show The Unusuals was canceled already. In fact, the only non-surprise about the whole thing is that was canceled by ABC which has a record of killing quality shows, see Pushing Daisies.
Better luck next time, Harold.
Article Posted 7 years Ago


text:
Weather tech's side window deflector
2005 Honda Civic
Crutchfield Customer Review (What's this?)
Product looks nice on my car. Kind of disappointed in how the fitment of the side window deflectors were designed. The first pair i ordered, after installing both side deflectors in and closing my windows, I heard a snapping sound and took off the deflectors to see what had happen. i saw that on the driver side deflector, the back end of the deflector had chipped off a bit. I decided to put it back on and close my windows to see what would happen. This time i heard a snapping noise from both sides of the deflectors. Took them both off and had seen that the back end of each deflectors had chipped. I let Crutchfield know and they sent me a brand new pair. Same thing happen again on the passenger side, which leads to me believe that their not perfect fits. I heard my window motor working much harder to close my windows. The good thing is that the deflectors stayed in place when driving 65 mph, i was actually quite scared that they would come out. This isn't Crutchfield's fault at all, but the weather tech's design. Hence the three stars
Pros: Looks nice. Holds up at highway speeds
Cons: Design flaw for my car at least.