text
stringlengths 1
2.31M
| meta
dict |
|---|---|
Q:
How to resolve this issue in json object into php array
here i call one API,so they will return some response in json object,now i want convert the json into array so i am trying like json_decode($response,true); but i am getting error
Notice: Array to string conversion in C:\xampp\htdocs\he\rest.php on line 16
Array
i don't know how to resolve this error,
<?php
$request_url = 'http://www.domain.com/api/method/properties';
$ch = curl_init();
curl_setopt($ch, CURLOPT_URL, $request_url);
curl_setopt($ch, CURLOPT_CONNECTTIMEOUT, 10);
curl_setopt($ch, CURLOPT_RETURNTRANSFER, 1);
$response = curl_exec($ch);
curl_close ($ch);
echo "<pre>";
print_r($response);// Here we can get the respoonse in
echo "</pre>";
echo json_decode($response,true)//Notice: Array to string conversion in C:\xampp\htdocs\he\rest.php on line 16
Array
?>
//Resposnse coming like this
[ {
"createdBy" : "agent",
"createdDate" : "2016-09-20T08:13:30.418Z",
"lastModifiedBy" : null,
"lastModifiedDate" : "2016-10-12T09:10:20.847Z",
"id" : "57e387cef1a8a02f7a0c9613",
"name" : "2BHK Apartment in Sanjay Nagar",
"contactName" : null,
"propertyPurpose" : "RESIDENTIAL"
},
{
"createdBy" : "agent",
"createdDate" : "2016-09-20T08:13:30.418Z",
"lastModifiedBy" : null,
"lastModifiedDate" : "2016-09-20T08:13:30.539Z",
"id" : "57e387e1f1a8a02f7a0c9616",
"name" : "2BHK Apartment in Mira Road",
"contactName" : null,
"propertyPurpose" : "RESIDENTIAL",
}
]
A:
Now that you've showed the exact code, it's pretty obvious!
When you write echo json_decode($response,true);:
first json_decode($response,true) executes what you wanted, i.e. return an array
then you try to echo this array, hence the notice: "Array to string conversion" (since echo expects a string).
|
{
"pile_set_name": "StackExchange"
}
|
Ah, summer. That special time of year when those good spatula-wielding folks who only cook for one season out of the year (let's call 'em what they are: dads) dust off the old grill to burn a few steaks and serve up some medium-rare chicken. Okay, perhaps I'm being unfair here. There are plenty of amazing backyard cooks who take a structured, scientific approach to good grilling and reap the flavorful rewards because of it, but there are just as many who think that all it takes to put together a successful backyard cookout is the ability to buy some steaks and light a fire.
I've been to enough cookouts in my time to recognize the warning signs of tough, sooty, or downright dangerous meat to come. Here are some of the most common mistakes beginning grillers make and how to avoid them.
Mistake #1: You Used Lighter Fluid or Match-Light Coals
The Thinking: If I douse my coals in liquid fuel, of course they'll light faster! It's logical and it's a mistake most beginning grillers make. It doesn't help that match-light coals and lighter fluid are heavily marketed in the grilling aisle at the home centers and supermarkets. It's easy to understand why so many people buy lighter fluid: Try holding a match underneath a coal and you won't get very far.
The Reality: After erupting in a mushroom cloud of fire, the flames quickly subside and die. You end up squirting more lighter fluid on the coals in a desperate attempt to keep the fire going (and perhaps even after the fire is alive and kicking because it's just so damn fun to set things on fire). All seems to be going well until you take that first gasoline-scented bite of a hamburger. Truth is, no matter how long you let a fire that was started with lighter fluid burn, you can taste it on your food, and it's not pleasant.
The Fix: What you really need is a chimney starter. You place some crumpled newspaper underneath it, pack the top with coals, set the newspaper on fire with a single match or lighter, then let it work its magic as oxygen is drawn up and through the coals, lighting them efficiently without the need for any lighter fluid at all.
Your coals will be lit in record time with no risk of adding off-flavors to your food.
Mistake #2: You Spread the Coals Before They Were Fully Gray
The Thinking: But I'm hungry now! I get it. When you have a spatula in your hand, everything looks like a burger. You just can't wait to get that food on the grill, gray ash be damned.
The Reality: You start cooking before your coals are ready leading to inconsistent heat, off-flavors, and unpredictable cook times.
The Fix: Have patience! There's a reason the bag tells you to wait until the coals are covered in gray ash. A fire that might seem moderately hot while the coals still have some black will very rapidly rise to inferno levels as the coals continue to ignite. Temperature control is priority number one when it comes to grilling, and waiting until those coals stabilize is the best way to avoid any surprises.
Mistake #3: You Didn't Preheat the Grill
The Thinking: That fire is hella hot. It's ready to cook on NOW.
The Reality: That fire might be producing plenty of radiant heat—that's the infrared heat you can feel on your hand when you hold it above the grill—but the grill grates themselves are still relatively cool, which means that your food will not receive much conductive heat—the heat transferred directly by the grill grates. Rather than picking up dark, attractive grill marks and releasing easily, your food will stick to the metal. And meat sticking to metal is an actual chemical bond that is nearly impossible to cleanly break. Instead of coming up cleanly, your food tears and shreds.
The Fix: After your fire is lit, cover the grill and let it preheat for at least five to 10 minutes in order for the fire to transfer heat to the grill grates. With pre-heated grill grates, your food has much less of a chance of sticking as its proteins alter their shape before they even come in direct contact with the metal.
Hot grills are also easier to clean, which takes us to...
Mistake #4: You Forgot to Clean the Grates, Dummy!
The Thinking: Fire kills everything. Burnt-on food adds flavor. Nobody will notice. Take your pick.
The Reality: Your chicken comes off the grill with carbonized bits of last night's pork chops stuck to it or, worse, tonight's chicken ends up sticking to last night's pork chops, leaving its outer layers behind on the grill. Tomorrow night part of your asparagus is gonna stick to that chicken. The burnt-on layer of food is going to grow and grow like a katamari until eventually entire prime ribs and turkeys are going to get stuck to it.
The Fix: Clean those darned grill grates! All you need is a grill brush and the smallest amount of elbow grease.
Pro-tip: If you cook on your grill regularly, don't bother cleaning your grill when you are finished cooking and all you want to do is focus on feeding your hungry guests and getting to that next beer. And don't bother trying to clean the grill at the end of the evening when it's already cooled down and the gunk has hardened. Instead, clean your grill after preheating it just before you start to cook. The heated grease and food remains should scrape right off.
The rather pricey Tool Wizard Grill Brush that comes recommended from Cook's Illustrated lasted all of two weeks on my grill a few seasons ago. Instead, I recommend the Weber Three-Sided Grill Brush, which like all Weber products, is built to last.
Mistake #5: You're Using Too Much Direct Heat
The Thinking: Me Like Meat. Me Like Fire. Me Like Big Meat With Big Fire. The bigger the fire, the better the searing and charring and the tastier the meat.
The Reality: Your fire is too hot and your steak starts to burn on the outside before it's even begun to hit medium rare in the center. You desperately look around for a place to move it to but your entire grill is as hot as the eighth level of hell.
The Fix: Build yourself a two-zone fire. On a coal grill, this means evenly distributing the coals under only half of the grill, leaving the other half either empty or covered with a very, very thin layer of coals. In a gas grill this means lighting the burners on one side, leaving the other side off or on very low heat. With two zones you have much more control over your cooking. Place meat and vegetables over the hot side for fast searing, or shift them over to the cooler side for more gently cooking. With your meat on the cool side of the grill and the grill covered, you can even create an oven-like setting inside for grill-roasting large cuts of meat like prime rib or a leg of lamb.
Read more about two-zone fires in our grilling guide here.
Mistake #6: You Keep Futzing With That Lid
The Thinking: Is it done yet?... Nope. Is it done yet?... Nope. Is it done yet?... Nope. Is it done yet?... You know what I'm talking about. That unbreakable, irresistible urge you get to keep checking on that big ol' pork chop.
The Reality: Repeatedly lifting the lid with a gas grill will cause it to lose heat, making your food sear and cook more slowly. Repeatedly lifting with a coal grill will do the opposite, allowing in oxygen that causes the coals to bun hotter than you'd like them to, resulting in burnt meat.
The Fix: Be patient! It's not a crime to flip your burgers or steaks multiple times as they cook, but just bear in mind that every time you open and close that lid, you're adding inconsistencies to your cooking temperature. Remember this basic rule of thumb: If you're cooking on a gas grill, opening the lid will make it cooler. If you're cooking on a charcoal grill, opening the lid will make it hotter.
Mistake #7: You Think that Awesome Looking Flames Make for Awesome Tasting Meat
The Thinking: The difference between cooking indoors and cooking outside is that live fire right? So it must be good to let your burgers and steaks get engulfed in flames.
The Reality: Flames engulfing your meat end up leaving sooty, nasty-tasting deposits on the surface of your food. Small flames and minor flare-ups are ok, but you definitely don't want that fire licking your steak before you do.
The Fix: Fire requires three things to burn: fuel, energy, and oxygen. Flare-ups are generally caused by fat dripping out of your meat and igniting on the coals or the grill bars below—adding fuel. Trimming off excess fat can help mitigate some of the issues, but the fact is that with a well-marbled steak or a nice juicy burger, you want that fat to be there from the start. The easiest way to control a flare-up if you aren't cooking too many things at once is to simply move the meat off of the hot side and onto the cool side of the grill until the flare-up subsides before carefully returning it.
But what if your grill is too full to effectively shift things around? This scenario leaves you with two options: reduce the energy in the system or cut off oxygen supply. Squirting water from a spray bottle at little flare ups will do a good job of reducing energy—that energy that was going to feeding the flare-up instead goes into evaporating the water. But it's also a good way to spray up excess soot or worse, to spread around the fat, exacerbating the flare-up problem down the line.
Better is to simply do what you should be doing anyway: close that lid and cut off the oxygen supply. A few moments with the lid and vents closed should choke off any flame.
Mistake #8: You Think the Vents are for Decoration
The Thinking: What effect could these little fiddly things possibly have on my man-sized flame?
The Reality: Adjusting the position of the vents is the best way to control oxygen and heat flow within your charcoal grill.
The Fix: Access to oxygen can have a major impact on how efficiently your coals combust. Too much and they can erupt into soot-inducing flames. Too little and they choke themselves out. The lower and upper vents on your charcoal grill can be used to adjust the flow of oxygen, thereby adjusting the heat generated inside your grill. Cooking chicken, ribs, or brisket low and slow over indirect heat? Keep those vents closed. Searing the outside of a big fat steak or a burger? Keep them open to encourage higher heat (just don't let those flames lick the meat!).
The relative positioning of the top and bottom vents can also make a difference! I like to position my vents with the lower vent on the opposite side of the food and the lid vents directly above the food to promote convection currents inside that more efficiently take hot air above and around the food.
Mistake #9: You're Adding the Barbecue Sauce Too Early!
The Thinking: I'm gonna paint this sucker with multiple layers of barbecue sauce and let each one cook on because it'll give everything more flavor.
The Reality: The barbecue sauce starts to burn and turns acrid way before your meat is even close to completion. Your guests sheepishly scrape off the layer of blackened soot from what used to be chicken before adding extra sauce straight from the bottle to cover up that bitterness, but it doesn't help. The bitterness stays. All. Night. Long.
The Fix: Barbecue sauce does very little penetrating no matter how early you apply it. At most it's a surface treatment, which means that you can add it towards the end of cooking and still get just as much flavor out of it without risking burning it. If you are using a sweet barbecue sauce, wait until the final five to 10 minutes of cooking to paint it onto your meat with a brush.
Mistake #10: You're Cooking Too Many Different Things at Once
The Thinking: Some people like chicken, some people like sausages, some people like burgers, why not cook them all at once?
The Reality: Your burgers overcook, your chicken is undercooked, everything is cross-contaminated, and nothing is as good as it should be.
The Fix: Stick to grilling one type of food at a time but focus on really nailing it. The high heat you need for perfectly seared burgers or steaks is different from the low-and-slow heat you need for chicken or sausages. When I'm hosting a cookout, I'll focus on cooking one type of meat at a time before moving on to the next, making sure that I have plenty of side dishes and snacks for folks who don't like the particular thing I'm cooking at the moment. The result is better food and happier guests all around.
Mistake #11: You're Poking Your Meat to Tell if it's Done
The Thinking: I've seen those guys on TV poke their steak with their finger to see if it's done, that must be the way professionals do it. You know the drill. Hold your forefinger to your thumb and poke the ball of your thumb with your other hand. That's what rare feels like. Hold your middle finger and that's medium. Hold your third finger and that's well-done.
The Reality: You probably are not a professional, which means you probably haven't cooked the hundreds or thousands of steaks required to fine tune your poke-test finger. Your steak ends up well done or raw.
The Fix: Forget about the whole poke test. First off, different people have different fingers, different hands, entirely different sets of calibration. Not only that, but different steaks all feel, well, different. Without tons and tons of experience, there's no way to reliably tell if your steak is done by poking it. You know what is reliable? A thermometer. Get yourself either a Thermapen or its inexpensive cousin the Thermopop and say goodbye to over- or undercooked meat forever.
Check out Myth #7 in my piece on common steak myths for some more details.
Mistake #12: You're Serving Your Food Too Soon
The Thinking: The meat is hot, my guests are hungry, let's get this food on the table NOW.
The Reality: Cutting into a steak that's too hot not only ends up burning your guests' mouths, but it also causes the meat to unleash a torrent of juices that run all over the cutting board or plate.
The Fix: Let your meat rest off of the grill for a few minutes before serving it. This will allow the internal juices to thicken and redistribute, which in turn reduces the amount of spillage you get after cutting into them. So you like the outside of your meat to be hot and sizzling right when you serve it? No problem: rest your meat as usual, then right before serving it toss it back over the highest possible heat on your grill for just around 30 seconds per side. You'll end up with perfectly rested, juicy meat and a nice crisp, sizzling crust.
Check out my piece on the importance of resting meat for more details.
All products linked here have been independently selected by our editors. We may earn a commission on purchases, as described in our affiliate policy.
|
{
"pile_set_name": "OpenWebText2"
}
|
Just one more perk of flying multi-million dollar jet fighters. That and playing One Vision in your 1986 Walkman every time you get into combat. I wish I could be inside one for the Atlantis launch. [Photo via Gregory H. Johnson]
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Fill select field options from custom product field values in Woocommerce checkout
EDIT: Solved. I edited the post with the solution. =)
I am trying to populate a select field on checkout page with values from a custom product field. Most of it works like a charm, but there is a problem with retrieving the value on checkout page.
Create and save custom field
// Display Fields in Backend
add_action( 'woocommerce_product_options_general_product_data', 'srd_add_custom_general_fields' );
// Save Fields
add_action( 'woocommerce_process_product_meta', 'srd_add_custom_general_fields_save' );
// Create Fields
function srd_add_custom_general_fields() {
global $woocommerce, $post;
echo '<div class="options_group">';
woocommerce_wp_textarea_input(
array(
'id' => '_einstiegsorte',
'label' => __( 'Einstiegsorte', 'woocommerce' ),
'placeholder' => '',
'description' => __( '', 'woocommerce' )
)
);
}
Save Data
function srd_add_custom_general_fields_save( $post_id ){
$woocommerce_textarea = $_POST['_einstiegsorte'];
if( !empty( $woocommerce_textarea ) )
update_post_meta( $post_id, '_einstiegsorte', esc_html( $woocommerce_textarea ) );
Output data on Single Product & Archive
add_action( 'woocommerce_after_shop_loop_item_title', 'custom_fields_ausgabe_archive', 2 );
add_action( 'woocommerce_single_product_summary', 'custom_fields_ausgabe', 6);
function custom_fields_ausgabe(){
$list_items = get_post_meta(get_the_ID(), '_einstiegsorte', true);
if($list_items){?>
$list_items = explode("\n", $list_items);
echo '<ul>';
foreach($list_items as $list_item) {
echo '<li>' . $list_item . '</li>';
}
echo '</ul>';
}
}
Add select field to checkout page and populate with data '_einstiegsorte'
add_action('woocommerce_before_checkout_form', 'einstiegswahl_select');
function einstiegswahl_select() {
foreach ( WC()->cart->get_cart() as $cart_item ) {
$item = $cart_item['data'];
if(!empty($item)){
$product = new WC_product($item->id);
//$pd_numbers = get_post_meta( $cart_item[ 'product_id' ], '_einstiegsorte', true );
$list_items['choices'] = array();
$list_items = get_post_meta( $cart_item[ 'product_id' ], '_einstiegsorte', true );
if($list_items){
$list_items = explode("\n", $list_items);
echo '<select name=einstiegswahl>';
foreach($list_items as $list_item) {
echo '<option>' . $list_item . '</option>';
}
echo '</select>';
}}}}
A:
Try this simply that instead:
add_action('woocommerce_before_checkout_form', 'display_einstieg_meta');
function display_einstieg_meta() {
foreach ( WC()->cart->get_cart() as $cart_item ) {
echo get_post_meta( $cart_item['data']->get_id(), '_einstiegsorte', true );
}
}
It should work now. Note: $cart_item['data'] is already the WC_Product object instance...
So as you can have many items in cart, your select field code will be:
add_action( 'woocommerce_before_checkout_billing_form', 'custom_einstiegswahl');
function custom_einstiegswahl(){
echo '<select name=einstiegswahl>';
// Loop through cart items
foreach ( WC()->cart->get_cart() as $cart_item ) {
// Get the custom field data
$einstiegsorte = get_post_meta( $cart_item['data']->get_id(), '_einstiegsorte', true );
if( ! empty($einstiegsorte) ){
// if it's multiline we split it in an array
$select_field_items = explode( '\n', $einstiegsorte );
// If the array has more than one item
if( sizeof( $select_field_items ) > 1 ){
foreach( $select_field_items as $value )
echo '<option value="'. $value .'">' . $value . '</option>';
}
// If there is only one line
else {
// we clean it
$value = str_replace('\n', '', $einstiegsorte);
echo '<option value="'. $value .'">' . $value . '</option>';
}
}
}
echo '</select>';
}
|
{
"pile_set_name": "StackExchange"
}
|
Brandon Lynch
Brandon Lynch (born January 31, 1982 in Augusta, Georgia) is a former gridiron football linebacker who played for the Saskatchewan Roughriders of the Canadian Football League. Brandon played high school football at Hephzibah High School. He was originally signed by the Tennessee Titans as an undrafted free agent in 2004. He played college football at Middle Tennessee State.
Lynch has also been a member of the Indianapolis Colts.
External links
Just Sports Stats
Category:1982 births
Category:Living people
Category:Sportspeople from Augusta, Georgia
Category:American players of Canadian football
Category:Middle Tennessee Blue Raiders football players
Category:Canadian football linebackers
Category:American football linebackers
Category:Tennessee Titans players
Category:Indianapolis Colts players
|
{
"pile_set_name": "Wikipedia (en)"
}
|
name: UnicodePropList_Terminal_Punctuation_3_0
description:
Tests character class syntax of the Unicode 3.0 'Terminal Punctuation' property,
defined in PropList(-X.X.X).txt.
jflex: -q
input-file-encoding: UTF-8
common-input-file: ../../resources/All.Unicode.characters.input
|
{
"pile_set_name": "Github"
}
|
Telstra's NBN payday could be worth $100 billion
Telstra could receive almost $100 billion in total nominal pre-tax payments from NBN Co over the next 55 years, telco industry publication CommsDay reports, citing confidential advice provided by Goldman Sachs in May 2013.
According to Goldman Sachs, NBN Co would have to pay out $98.2bn in nominal pre-tax payments to Telstra between FY2011 and FY2067, with the bulk of the payments -- some $88bn -- related to access to Telstra’s infrastructure.
The advice was sought by NBN Co following the release of the then Opposition Coalition’s alternative broadband policy in April 2013, CommsDay reports.
The report, citing Goldman Sachs data, adds that the value of payments will continue to edge up as NBN Co’s footprint expands -- from $400 million annually this financial year, to $1bn in FY2019 and to $1.6bn a year by FY2042.
By 2067, NBN Co would be paying Telstra some $2.9bn a year in lease commitments, CommsDay reports.
|
{
"pile_set_name": "OpenWebText2"
}
|
News U.S. Government Receives Approval to Sell Bitcoin, Bitcoin Cash Seized From Dark Web Dealer
The U.S. government has received approval from a judge in Utah to sell off 513 Bitcoin and 512 Bitcoin Cash seized from an investigation involving Aaron Michael Shamo, a dealer on the dark web.
$10 Million in Bitcoin and Bitcoin Cash Seized
The U.S government is preparing to liquidate all assets of Aaron Michael Shamo following his recent arrest, including his Ford pickup truck, BMW, and his nearly $10 million worth of Bitcoin and Bitcoin Cash. Shamo was arrested in November 2016 for allegedly selling counterfeit pharmaceuticals as well as using the US mail system to distribute his products.
Shamo, along with other dark web operators Drew Wilson Crandall, Mario Anthony Noble, and Sean Michael Gygi, was found guilty on May 31, 2017 of conspiracy to distribute a controlled substance, aiding the importation of a controlled substance, intentional adulteration of drugs, use of the US mail in drug trafficking, conspiracy to commit money laundering, and engaging in monetary transaction in property derived from specified unlawful activity. The charges racked up by the conspirators carry a 10-year minimum sentence.
Immediately following the verdict, the dark web operators’ holdings in Bitcoin and Bitcoin Cash were seized and transferred to the custody of the United States Marshals Service (USMS). The government expressed concerns over the cost of securely storing the seized currency for a long period of time, favoring the sale of the coins instead.
“Here, there is a good cause for the sale because each of the following vehicles are accruing monthly payments pf storage and maintenance fees – which would total several hundred dollars a month for the vehicles – during the pendency of sentencing and forfeiture proceedings would significantly reduce the value received for these items.”
The U.S. government must wait a period of 60 days before they may proceed with the sale, a period which will land in early 2018.
Not U.S. Government’s First Crypto Sale
In October, the U.S. government disclosed the sale of 144,336 bitcoins that they seized after shutting down the Silk Road. Officials cited concerns over the volatility of the currency and felt that it was likely to depreciate in value, prompting the government to sell off the coins. At the time of the 2014 sale, Bitcoin was valued at $336 per coin, making the total value of the seized coins more than $48 million. Had the government possessed itself in patience, however, and instead held onto those bitcoins, they would be worth $2.4 billion at current value.
Large fluctuations in the price of the currency, as well as rocketing transaction fees, have caused officials to push for a prompt sale of the coins. The U.S. government intends to sell the 513 Bitcoins and 512 Bitcoin Cash in upcoming weeks at the current combined market value of approximately $9.9 million.
Is the government selling at a good time or should they HODL? Tell us what you think of the pending sale in the comments below!
Images courtesy of Pixabay, Justice.gov
|
{
"pile_set_name": "OpenWebText2"
}
|
We Also Recommend:
Description:
Do you have a taste for something saucy? Then we suggest titillating your taste buds with some risqué pasta. This erotic penis shaped pasta is made from high quality durum wheat and is absolutely edible. Each box features a risqué recipe, but feel free to whip up some suggestive specialties of your own! These fun and flirty foodstuffs are the perfect menu item for bachelors, bachelorettes, birthdays or even a slightly naughty date night dinner party for two. No matter how you serve it, our Risque Pasta is sure to spice up any meal.
|
{
"pile_set_name": "Pile-CC"
}
|
%YAML 1.1
%TAG !u! tag:unity3d.com,2011:
--- !u!1001 &100100000
Prefab:
m_ObjectHideFlags: 1
serializedVersion: 2
m_Modification:
m_TransformParent: {fileID: 0}
m_Modifications: []
m_RemovedComponents: []
m_ParentPrefab: {fileID: 0}
m_RootGameObject: {fileID: 1000013620819214}
m_IsPrefabParent: 1
--- !u!1 &1000013620819214
GameObject:
m_ObjectHideFlags: 0
m_PrefabParentObject: {fileID: 0}
m_PrefabInternal: {fileID: 100100000}
serializedVersion: 5
m_Component:
- component: {fileID: 4000012095563858}
- component: {fileID: 114000012251198856}
- component: {fileID: 61000011755287342}
m_Layer: 0
m_Name: Trigger Zoom
m_TagString: Untagged
m_Icon: {fileID: 0}
m_NavMeshLayer: 0
m_StaticEditorFlags: 0
m_IsActive: 1
--- !u!4 &4000012095563858
Transform:
m_ObjectHideFlags: 1
m_PrefabParentObject: {fileID: 0}
m_PrefabInternal: {fileID: 100100000}
m_GameObject: {fileID: 1000013620819214}
m_LocalRotation: {x: 0, y: 0, z: 0, w: 1}
m_LocalPosition: {x: 0, y: 0, z: 0}
m_LocalScale: {x: 1, y: 1, z: 1}
m_Children: []
m_Father: {fileID: 0}
m_RootOrder: 0
m_LocalEulerAnglesHint: {x: 0, y: 0, z: 0}
--- !u!61 &61000011755287342
BoxCollider2D:
m_ObjectHideFlags: 1
m_PrefabParentObject: {fileID: 0}
m_PrefabInternal: {fileID: 100100000}
m_GameObject: {fileID: 1000013620819214}
m_Enabled: 1
m_Density: 1
m_Material: {fileID: 0}
m_IsTrigger: 1
m_UsedByEffector: 0
m_UsedByComposite: 0
m_Offset: {x: 0, y: 0}
m_SpriteTilingProperty:
border: {x: 0, y: 0, z: 0, w: 0}
pivot: {x: 0, y: 0}
oldSize: {x: 0, y: 0}
newSize: {x: 0, y: 0}
adaptiveTilingThreshold: 0
drawMode: 0
adaptiveTiling: 0
m_AutoTiling: 0
serializedVersion: 2
m_Size: {x: 1, y: 1}
m_EdgeRadius: 0
--- !u!114 &114000012251198856
MonoBehaviour:
m_ObjectHideFlags: 1
m_PrefabParentObject: {fileID: 0}
m_PrefabInternal: {fileID: 100100000}
m_GameObject: {fileID: 1000013620819214}
m_Enabled: 1
m_EditorHideFlags: 0
m_Script: {fileID: 11500000, guid: 22ce1d5a52005864089231b9cc2e1aa6, type: 3}
m_Name:
m_EditorClassIdentifier:
m_Camera2D: {fileID: 0}
m_TagThatTriggers: Player
m_EnterZoom: 5
m_ExitZoom: 5
m_TransitionTime: 0
m_DrawDebug: 0
|
{
"pile_set_name": "Github"
}
|
Linda Kelley, 18, was discovered in August at her parents' home covered in blackened bedsores so deep that her bones and organs could be seen. She was surrounded by dog feces, trash and soiled adult diapers. Cigarette butts littered the floor and bugs were seen crawling in the refrigerator.
|
{
"pile_set_name": "OpenWebText2"
}
|
West Coast Eagles AFL Garden Fan Gnome 2017 Edition
Seller: onelittlefootyfan(63,677)99.8%,
Location:Botany, New South Wales,
Ships to: AU, NZ,
Item:401439248727Home | About Us | Payment | Shipping | Returns | Contact Us ALL CATEGORIES NRL AFL Rugby Union Football Cricket CAR RACING GOLF Tennis Giftware NRL Balmain Tigers Brisbane Broncos Canberra Raiders Canterbury Bulldogs Centenary of Rugby League Cronulla Sharks Gold Coast Titans Illawarra Steelers International Test Teams Manly Sea Eagles Melbourne Storm New Zealand Warriors Newcastle Knights Newtown Jets North Queensland Cowboys North Sydney Bears Parramatta Eels Penrith Panthers South Sydney Rabbitohs St George Dragons State of Origin - NSW State of Origin - QLD Sydney Roosters Wests Magpies Wests Tigers AFL Adelaide Crows Brisbane Lions Carlton Blues Collingwood Magpies Essendon Bombers Fremantle Dockers Geelong Cats Gold Coast Suns Greater Western Sydney Giants Hawthorn Hawks Melbourne Demons North Melbourne Kangaroos Port Adelaide Power Richmond Tigers St Kilda Saints Sydney Swans West Coast Eagles Western Bulldogs A-League Adelaide United Brisbane Roar Central Coast Mariners Gold Coast United Melbourne Heart / City Melbourne Victory Newcastle Jets Northern Fury Perth Glory Sydney FC Wellington Phoenix Western Sydney Wanderers Rugby Union British Irish Lions New Zealand Other International Teams Super 15 Wallabies Football Arsenal Aston Villa Australia Barcelona Birmingham City British Celtic Chelsea European Everton Internationale Milano Italia National Juventus Lazio Liverpool Manchester City Manchester United New Zealand Newcastle United Roma Tottenham Hotspur West Ham United Cricket Adelaide Strikers Brisbane Heat Cricket Australia Cricket World Cup Hobart Hurricanes Melbourne Renegades Melbourne Stars Perth Scorchers Sydney Sixers Sydney Thunder The Ashes CAR RACING Ford - FPV Holden GOLF Tennis Giftware Giftware West Coast Eagles AFL Fan Gnome 2017 ITEM DESCRIPTION West Coast Eagles AFL Fan Gnome 2017. Features: Garden Gnome with sign and team name on the sign with the word fan. Looks great in your garden! Size: 28cm high Material: Resin. This product is an official AFL endorsed product. About Us Payment Shipping Returns Contact Us About Us We are a small family owned and operated business. We have been trading on eBay for over 10 years as both a buyer and a seller. We specialize in licensed sports merchandise, and manly Australian based teams. We try to have a great selection with all the newly released items. If there is something you are after that you can not find in out store, please contact us and we will try to help you. All the items that are listed are in stock, if your team does not show up i may be out of stock. Please feel free to message me via eBay messages to see when a new shipment is arriving. Payment If buying more than one item DO NOT checkout (click the PAY NOW button) but contact us for a combined invoice otherwise your postage price may be incorrect. Australian Buyers: You are more than welcome to pay for your item using PayPal and Bank Deposit/Direct deposit. Please ensure you leave your eBay ID or item number as a reference. This will speed up the amount of time it will take us to post your order. Most payments made on a Friday, Saturday and Sunday will not be cleared until Tuesday morning, “ but i will have them in Tuesday's post. International Buyers: We are very sorry but at this stage we only post to New Zealand, all item are send Express Courier, and should take 2-4 business days to arrive. Payment to be finalised within 3 DAYS (unless otherwise arranged). Non-paying bidders are automatically referred to eBay to ensure that eBay remains a safe marketplace for all. If you are having any problems making your payment obligations, please contact us ASAP, as things can always be worked out. Shipping We post Daily, to ensure you receive your items as quickly as possible. All items are in stock and are being shipped from Sydney, NSW. Combined shipping is available on all items, To be charged correctly it is important you do not checkout (ie do NOT click the PAY NOW button) before receiving a final invoice from us. All our items are shipped through Australia Post. We recommend you take out tracking on all your items, as items with free post are not sent with tracking. Express Post is also available for all domestic items, and should appear on check-out of your item and a postage option.. We do charge under Australia post rates, with packaging costs. You ( as the buyer) are responsible for picking up the item from Australia post or Courier locations. If the item is returned due to non pick-up then i am charged a return fee, which i will have to pass on to you the buyer. The subsequent re-postage of this item will also be the buyers responsibility. Returns We accept returns on all items, as long as they are in the original packaging with tags. You have 30 days to return the item for a refund. If you get the item and it is not what you were expecting, you have changed your mind or it doesn't fit, please return it. Please note there is a re-stock fee for items returned due to change of mind. Contact Us For the fastest response via eBay messages any time, A phone number will be provided via ebay when you have purchased an item. Please note we only have customer service 9-3 Monday to Friday. An Address for returns will also be provided via ebay. Thankyou, we look forward to processing your order! ebay listing template design by ebay mobile responsive template byCondition:New, UPC:9327644056936, Team:West Coast Eagles, Sporting Code:AFL, Size:28 cm, MPN:GN17WEAGLES, Year Released:2017, Colour:Black, Secondary Colour:Yellow, Material:Resin, Age Range:All Ages, Product Type:Gnome, Number of Items:1, Brand:AFL, era:2010s
|
{
"pile_set_name": "Pile-CC"
}
|
Today Micron is announcing their first client/OEM SSDs with 3D NAND. First mentioned at an enterprise announcement event in April, the Micron 1100 and 2100 SSDs are part of an aggressive transition strategy that has switched almost all of their flash production capacity over to 3D NAND and left only enough 16nm output to fulfill their obligations for existing product lines.
The Micron 1100 is a mainstream client SATA drive in M.2 and 2.5" form factors. It uses Marvell's 88SS1074 controller and Micron's 384Gb 32-layer TLC NAND and is the replacement for the Micron M600, which used their 16nm MLC. Micron's 3D TLC is unusual in having a capacity (48GB) that is not a power of two, but the 1100 retains the traditional drive capacity points of 256GB, 512GB and 1TB, and extends the line to 2TB. Micron hasn't yet disclosed how many dies and how much overprovisioning each model will have, but the 256GB model will probably include 6 dies giving a raw capacity of 288 GiB.
Micron 1100 Specifications Capacity 256GB 512GB 1TB 2TB Controller Marvell 88SS1074 NAND Micron 384Gb 32-layer 3D TLC Form Factors 2.5" 7mm, M.2 2280 single-sided 2.5" 7mm Sequential Read 530MB/s 530MB/s 530MB/s 530MB/s Sequential Write 500MB/s 500MB/s 500MB/s 500MB/s 4KB Random Read 55K IOPS 92K IOPS 92K IOPS 92K IOPS 4KB Random Write 83K IOPS 83K IOPS 83K IOPS 83K IOPS DevSlp Idle Power 2mW 2mW 4mW 25mW Encryption TCG Opal Endurance 120TB 240TB 400TB 400TB
The Micron 1100 has slightly reduced performance and endurance specifications relative to the M600, but it retains the full feature set including TCG Opal encryption, partial power loss protection and SLC caching. The Marvell 88SS1074 was designed with TLC NAND in mind and thus also brings LDPC error correction support.
The Micron 2100 M.2 PCIe NVME will be Micron's first client PCIe SSD and their first PCIe SSD with 3D NAND. Micron has not yet finalized the technical specifications for the 2100, but we do know it will be available in capacities up to 1TB as a double-sided M.2 2280 card.
The Micron 1100 will begin mass production in July, followed by the 2100 by the end of summer.
|
{
"pile_set_name": "OpenWebText2"
}
|
Colin and Matt are nothing short of amazing. This experience could not have been better. I cannot thank you all enough and I will never forget your true kindness and patience. I will send all of my friends your way for sure God bless. Kelly Stickley
Consumer Review
I AM AN AUDI BRAND WARRIOR
by PHASTPHREDDIE from Woodland Hills
December 19, 2018
This car does what I bought it for, meets all of my needs and desires. The only problem I have with it is the the door height; (rail to roof) is too short for my liking.
This is the second time I have purchased a BMW from Sewickley. Gregg was very friendly l, easy to work with, helpful and prompt in reply. Nick explained the updated features in the BMW very well, he was very knowledgeable and friendly.
Consumer Review
Pretty car but
by Anna from Pasadena Maryland
January 11, 2019
I bought a 2016 A3 convertible premium plus package. While it is very stylish and pretty car. Inside there is no voice activation and Siri on apple phones gets shut off every time phone syncs to car . Also no power seats. It was A pricey car for the little options you get. Performance and style are the two big winners with this car.
I am very pleased with my experience with Lucas Fellers and the rest of the folks at Sewickley Porsche. Lucas was helpful, friendly and never pushy. I felt that i was treated fairly, efficiently and I am very happy with my first 911. Looking forward to more in the future.
Consumer Review
Best convertible with ample trunk space!
by bmkinney from Redlands, CA
December 7, 2018
Love the body style, trunk space with lay-flat back seats, and the super fast convertible top that I can put up or down 20mph or less. The sound system was clear even while driving on the highway with the top down. Friends could fit in the back two seats comfortably. Plus, it had all the luxury you'd expect from an Audi!
Its been five years since I got my first cayenne at sewickley Porsche. Now just purchased my 3rd generation one. Extremely satisfied with my car and the crew that helped me with the design of my new car. It???s the friendliness and unselfish desire to look out for my best interest what makes this agency so amazing. Thanks to Ronnie Keane and everyone else who has made me respect you guys as true friends!
Consumer Review
Audi A3 Premium is better than I thought
by Geneelder from San Juan, TX
December 31, 2018
This car met all my needs. Good leg room in the back for a small car. Excellent gas mileage and extremely comfortable with more amenities than you would expect at the price point.
Had a wonderful experience at LW. When I asked Zach if the car had any mechanical issues, he said "we stand behind our cars", and LW did not disappoint. I highly recommend, and will consider a future car purchase at this locally owned dealership.
Consumer Review
Great SUV with style
by Audi fan from Belleville, NJ
March 27, 2018
I love the design of the old Q7. Spacious, very comfortable! Lots of extras. It can seat 7. Perfect family getaway car for the whole family.
We take our van there after many years of us going to our dealership we realized that car sense is a reliable and trustworthy company who are honest and have fair prices. We highly recommend this dealership.
Consumer Review
Great car
by Roderick from Ft Polk, la
January 4, 2019
Very reliable vehicle. Car is truly in a class of its own. I enjoy my 2018 Audi A6. Highly recommend everyone get one or at least test drive this beautiful vehicle.
I worked with Jan from Carvana- she was able to explain to me the process, make sure I was comfortable with where it was at, was able to be reached and kept communication open. The pick up process went smoothly and I was able to sell my car without any glitches.
Consumer Review
Fun to Drive
by Douglas from Brick
December 10, 2018
The car is quick, handles well and fun to drive. I was a BMW snob before acquiring this vehicle. I am now hooked on Audi.
Steve is amazing, simply amazing. He brought the cars to us so we could try them at home (hard to carve time to test drive with two young kids). He also guided us through the entire process to make sure we were getting what we wanted and could afford. Refreshing in the car buying process.
Consumer Review
This is the 4th Audi we have leased
by ALeeS from Ballwin, MO
January 10, 2019
Excellent quality inside and out. A pleasure to drive. Great service from West County Audi. Performance exceeds my expectations to the max. Like to be seen driving this car.
After visiting several of the typical dealerships I walked away confused and Unsatisfied. After visiting Carvana.com I picked out a vehicle to my liking and price point fill out the paperwork got approval I had my new vehicle delivered to my front door. Most typical dealerships you spend half a day walking away with an overpriced vehicle in an overpriced interest-rate. Carvana has made it an enjoyable experience and it can be done from the luxury of your Home. Thanks Carvana.
Consumer Review
Great Car Lots of fun, Tech and luxury
by tshrtkng from Massapequa, NY
December 24, 2018
This car has it all
The Tech is second to none
Performance is great
Ride is good and gas mileage is ok too
service is on par with Mercedes and BMW
It was a positive experience buying my new Audi Q5 from Audi Pittsburgh. Mr. Steven Catalo made the experience hassle free and efficient. He was informative, courteous and professional throughout the car buying process. I am satisfied with my decision to purchase the new car from this dealership. I will recommend Steven Catalo to future prospective buyers.
Consumer Review
Great car so far! I love it!
by Wiley14 from Cape Coral, fl
December 21, 2018
This has been a great car since I have bought it. Performs very well and looks great. Gas mileage has been spot on. Very clean and sporty lines.
My husband went in on a Thursday afternoon to look at a used Volvo that was advertised on their website. We really loved the car. By Friday afternoon, we were driving the car home! It was so easy. Mike gave us a more than fair deal on our trade in. They got us very low payments. We will always do business at Mike T's Auto Sales.
Consumer Review
I should have bought a Used Car before !!
by Kristadej47 from Arizona (winter) and Colorado (summer)
December 26, 2018
With the exception of the back seat which really has no leg room, the car is super. It actually has more pep than my TTs, is very comfortable, and looks great. It does not have an electronic garage door opener which I would have expected to be standard on a Prestige model, but it really has everything else that I wanted, including all- wheel drive, all-weather tires, a convertible top,very low miles, and it's red with chocolate interior (all of the other red cars had black interiors, a no-no for Arizona), so I'm thrilled. I miss my TT, especially the first one which was stick shift, but it's much easier for this older body to get into to A3!
We loved Andy Ebel who helped us select a new Kia. He was very knowledgeable on what brand is reliable. And we loved the warrenty he presented to us. Great place to shop for a new vechile.
Consumer Review
Minimal features but does the job.
by Justin from EL PASO
December 29, 2018
This car has minimal features but the performace exceeds my expectations. The pleasure of driving it is amazing for a entry level luxury car. Also the car is quick for a 1.8L engine, gas saver etc. I love this car.
Marc was a great guy to work with worked with me every step of the way on my vehicle purchase. Will definately go back for my next vehicle!
Consumer Review
amaizing
by VISSI NYC RESALES from NEW YORK
December 30, 2018
i own this car now for 3 months ,it drives great looks great , gets up to 30 mpg also it goes pretty fast ,at this moment has aroung 100900
does not have any check engine light on and no problems what so ever
i recomand this to anyone that is interested
* Title, other fees, and incentives are not included in this calculation, which is an estimate only. Monthly payment estimates are for illustrative purposes only and do not represent a financing offer from the seller. Other taxes may apply.
The information on vehicles provided in this service is supplied by the seller or other third
parties; Cars.com is not responsible for the accuracy of such information. Cars.com provides
this
service and materials without representations or warranties of any kind, either expressed or
implied.
See our terms of service for more details.
|
{
"pile_set_name": "Pile-CC"
}
|
//=- WebAssemblyInstrInfo.h - WebAssembly Instruction Information -*- C++ -*-=//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
///
/// \file
/// \brief This file contains the WebAssembly implementation of the
/// TargetInstrInfo class.
///
//===----------------------------------------------------------------------===//
#ifndef LLVM_LIB_TARGET_WEBASSEMBLY_WEBASSEMBLYINSTRINFO_H
#define LLVM_LIB_TARGET_WEBASSEMBLY_WEBASSEMBLYINSTRINFO_H
#include "WebAssemblyRegisterInfo.h"
#include "llvm/Target/TargetInstrInfo.h"
#define GET_INSTRINFO_HEADER
#include "WebAssemblyGenInstrInfo.inc"
namespace llvm {
class WebAssemblySubtarget;
class WebAssemblyInstrInfo final : public WebAssemblyGenInstrInfo {
const WebAssemblyRegisterInfo RI;
public:
explicit WebAssemblyInstrInfo(const WebAssemblySubtarget &STI);
const WebAssemblyRegisterInfo &getRegisterInfo() const { return RI; }
bool isReallyTriviallyReMaterializable(const MachineInstr &MI,
AliasAnalysis *AA) const override;
void copyPhysReg(MachineBasicBlock &MBB, MachineBasicBlock::iterator MI,
const DebugLoc &DL, unsigned DestReg, unsigned SrcReg,
bool KillSrc) const override;
MachineInstr *commuteInstructionImpl(MachineInstr &MI, bool NewMI,
unsigned OpIdx1,
unsigned OpIdx2) const override;
bool analyzeBranch(MachineBasicBlock &MBB, MachineBasicBlock *&TBB,
MachineBasicBlock *&FBB,
SmallVectorImpl<MachineOperand> &Cond,
bool AllowModify = false) const override;
unsigned removeBranch(MachineBasicBlock &MBB,
int *BytesRemoved = nullptr) const override;
unsigned insertBranch(MachineBasicBlock &MBB, MachineBasicBlock *TBB,
MachineBasicBlock *FBB, ArrayRef<MachineOperand> Cond,
const DebugLoc &DL,
int *BytesAdded = nullptr) const override;
bool
reverseBranchCondition(SmallVectorImpl<MachineOperand> &Cond) const override;
};
} // end namespace llvm
#endif
|
{
"pile_set_name": "Github"
}
|
We’re excited for “Megan the Vegan,” a new children’s book out of Ireland
Like us on Facebook:
Fewer things are better for a child than reading out loud to them. Going over storybooks with your little one is an excellent way to teach them about the world around them, enrich their vocabulary, and promote excellent cognitive skills. Children’s books about veganism are more popular now than they’ve ever been, and a brand-new one out of Ireland is about the hit the shelves. Megan the Vegan is a collaboration between Paul Finan, a writer out of County Wicklow, and illustrator Áine McGuinness, who lives off the east Irish coast.
Released just last December, the book is a story of a girl’s journey into lifelong vegan habits. “Megan The Vegan Is a beautifully illustrated book about a young girl who discovers where meat comes from for the first time. This marks her first steps into her life’s adventures as an animal rescuer.” Now, if that doesn’t give you the feel-goods, I don’t know what will! Children are compassionate and empathetic, and a world with more vegan children looks absolutely wonderful.
The book is available for purchase in both paper and audio formats, and can be ordered immediately.
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
What is that gooey stuff from okra?
When cooking okra in a bit of water, the water becomes gooey. What does the okra release that makes the water slimy? Would the goo have other culinary uses (as an additive to thicken sauces or improve the texture of ice-creams)?
A:
The slime is called mucilage. It is around the seeds on the inside of the pod. It is made of protein and carbohydrates including fiber.
The mucilage is (as you alluded in your question) used for thickening gumbos and similar stews. Besides this, I've only ever seen it referred to as an annoyance and avoided by leaving the pod whole or dry cooking like frying.
I imagine there could be some creative halloween uses of mucilage but those would be off topic for this site. :)
EDIT
I was embarrassed that this answer was the accepted answer. I don't like answers that are (as mine was) "no that isn't possible because I've never heard of it." I was hoping someone else would shatter my world with some amazing new use of okra slime.
My curiosity piqued I used some of my copious free time while code compiled to do some more research.
I was able to find a couple of non traditional okra recipes that seemed interesting- such as candied okra slices or using the seeds from pickled okra as a caviar-like dish. But none of them took advantage of the mucilage- they all avoided it.
Carbohydrate based mucilage is used in ice cream and for other reasons. I found the following study about food health that did experiments with replacing milk fat with specifically okra mucilage (they refer to it as "okra gum")
Okra gum is acceptable milk-fat ingredient substitute in dessert
Two pertinent quotes:
"Although not currently produced by food manufacturers, previous studies produced fat-free chocolate bar cookies with acceptable sensory characteristics using okra gum as a fat ingredient substitute."
"Specifically, color and smell of frozen dairy desserts containing okra gum replacement for milk fat did not significantly differ from the control product. Texture, flavor, aftertaste, and overall acceptability ratings also averaged five or higher (neutral to like) for all products."
The study was about replacing milk fat where I think it would be more interesting as an enhancer as you asked in your question.
It seems perfectly reasonable that okra mucilage could find a place in more modern recipes.
But I couldn't find anyone doing it.
A:
While researching okra for an article (I'm a freelance writer) I came across this page by seridipity and thought I'd share what I've found (so far) in my quest: The mucilage in okra is a desired trait in West African (and, by extension, Brazilian, Caribbean and southeastern U.S.) cuisine. Baobab leaves also produce mucilage when cooked. It is used as a thickening agent in soups, stews and some stuffed okra pod dishes (also in South and Southeast Asia).
The only other use I've found is as a hair conditioner, which is a traditional Indian treatment that has become into some use in the United States.
There's some investigation into using it industrially as a low-friction lubricant.
Bryan Johnson
|
{
"pile_set_name": "StackExchange"
}
|
Ion mobility mass spectrometry of peptide, protein, and protein complex ions using a radio-frequency confining drift cell.
Ion mobility mass spectrometry experiments enable the characterization of mass, assembly, and shape of biological molecules and assemblies. Here, a new radio-frequency confining drift cell is characterized and used to measure the mobilities of peptide, protein, and protein complex ions. The new drift cell replaced the traveling-wave ion mobility cell in a Waters Synapt G2 HDMS. Methods for operating the drift cell and determining collision cross section values using this experimental set up are presented within the context of the original instrument control software. Collision cross sections for 349 cations and anions are reported, 155 of which are for ions that have not been characterized previously using ion mobility. The values for the remaining ions are similar to those determined using a previous radio-frequency confining drift cell and drift tubes without radial confinement. Using this device under 2 Torr of helium gas and an optimized drift voltage, denatured and native-like ions exhibited average apparent resolving powers of 14.2 and 16.5, respectively. For ions with high mobility, which are also low in mass, the apparent resolving power is limited by contributions from ion gating. In contrast, the arrival-time distributions of low-mobility, native-like ions are not well explained using only contributions from ion gating and diffusion. For those species, the widths of arrival-time distributions are most consistent with the presence of multiple structures in the gas phase.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Hi!
I'm an illustrator from Finland, currently living in the UK. I work predominantly in Photoshop and focus on digital painting/realism, my favourite subjects being anything to do with nature, animals and fantasy.
I do not do art trades, requests or point commissions, sorry!
Contact me:
If you have any questions or are interested in a commission (private or commercial), feel free to contact me!
Email: johiscomms@gmail.com OR contact@johannatarkela.com
Website: www.johannatarkela.com
Twitter: www.twitter.com/johisart
Facebook: www.facebook.com/pages/Johanna…
Prints available at: www.inprnt.com/gallery/johis/
Apparel (t-shirts, bags etc.) available at: society6.com/lhuin
Instagram: instagram.com/lhuin
Youtube: www.youtube.com/johannatarkela
|
{
"pile_set_name": "OpenWebText2"
}
|
West Virginia Football: Head Coach Bill Stewart Dislikes Giving Gifts
West Virginia University’s bid for an undefeated season wilted in the Louisiana humidity on Saturday night.
Ryan Clarke, spelling an injured Noel Devine, fumbled and Louisiana State returned it to the WVU seven-yard line. That fumble allowed LSU to take a 7-0 lead in the first quarter. The only touchdown scored by the LSU offense all night.
In the second quarter, Mountaineer quarterback Geno Smith threw an interception in WVU’s territory that LSU turned into a field goal and a 10-0 lead.
Then later in the second quarter, WVU’s special teams allowed Patrick Peterson to return a punt 60 yards for a touchdown and a 17-0 lead.
Those were all the points LSU would need to win the game, LSU added another field goal in the third quarter to push their final score to 20.
Add a blocked field goal by the Tigers in the first quarter, and a missed field goal by the Mountaineers in the fourth quarter, and the outcome was decided.
With all due respect to the LSU Tigers, without the Mountaineers' penchant for gift-giving, this game could have had an entirely different outcome.
To be fair, the LSU defense showed just how dominant they can be throughout this game. Still, the Mountaineers had opportunities they did not capitalize on.
An injury to Noel Devine’s foot limited his effectiveness midway through the first quarter. The fact that it happened during an illegal tackle out of bounds had head coach Bill Stewart up in arms.
Ryan Clarke had been pegged as Devine’s backup. With Clarke’s fumble late in the first quarter, the Mountaineer running game disappeared. WVU rushed 27 times for a paltry 58 yards.
Stewart and running backs coach Chris Beatty must address depth behind Devine. The players are apparently on the roster, and they must be given the opportunity to prove themselves in game situations.
After Saturday’s loss in Death Valley, Devine may become a marked man for WVU opponents.
With no running game to keep the LSU defense honest, Geno Smith was in for a long night. Smith completed 14 of 29 passes for 177 yards, two touchdowns, and one interception.
The Mountaineer offensive line was out-manned in this game.
Smith was harassed the entire night, and seldom did he have time to set and go through his progressions. The pressure eventually got to Smith in the fourth quarter. After setting the offense and reviewing the defensive alignment by LSU, Smith lined up under right guard.
Noel Devine, who had returned to action, had to direct Smith to his proper place behind center. Suffice to say that WVU’s youth on offense showed itself in Death Valley.
Devine returned in the second half, but he was not the Noel Devine that WVU fans have witnessed in the past. How Devine’s foot will affect his future play remains to be seen.
The Mountaineer defense performed admirably, but Stevan Ridley appeared to be able to put the LSU offense on his back and carry it at will, had LSU offensive coordinator Gary Crouton decided to let him loose.
Ridley carried 20 times for 116 yards and one touchdown. The Mountaineer defense repeatedly displayed an inability to tackle Ridley.
WVU defenders were often seen attempting to strip the football, or trying to come up with the big hit instead of wrapping up and making the tackle.
Forced turnovers often decide the game in favor of the team forcing the turnover. Still, solid tackling by defenders is more important.
Allowing an opposing ball carrier to gain additional yardage when the fumble is not forced will lose ball games faster than forcing the turnover will win them.
If the Mountaineers do not get this corrected, it will haunt them again in the future.
Once again, the special teams the Mountaineers fielded were anything but special. LSU posted an average starting field position at the 50-yard line for the entire first half.
The Mountaineers simply did not play good enough to win this game.
Stewart fell to 7-8 in road games during his tenure as head coach. The last time the Mountaineers beat a ranked non-conference opponent on the road was in 1988 at Pitt.
The Mountaineers’ next game is October 9 against the University of Nevada Las Vegas in the comfortable confines of Milan Puskar Stadium.
The Mountaineers last loss at home was in 2008 to the University of Cincinnati in overtime. Stewart is 15-1 at home as head coach.
Bill Stewart and his coaching staff have two weeks to digest and formulate a plan for improved play by his charges.
More importantly, the Mountaineer players will have time to rest and lick their wounds in preparation for the Rebels of UNLV.
The Mountaineer injury report has been growing weekly; the bye will be a welcome respite to the players on that list.
WVU lost one football game to the LSU Tigers; one game does not a season make. How the Mountaineers respond after this loss will decide the remainder of the season.
Based on Bill Stewart’s terse answers to reporters questions in the postgame press conference, the Mountaineer football team is in for a long two weeks of preparation.
|
{
"pile_set_name": "Pile-CC"
}
|
June 1, 2017 8:25 AM PT9:25 AM MT10:25 AM CT11:25 AM ET15:25 GMT23:25 8:25 AM MST10:25 AM EST10:25 AM CT19:25 UAE11:25 ETNaN:� - Davis is returning to the New York Jets after being traded Thursday by the Browns for safety Calvin Pryor.Analysis: The 28-year-old Davis spent four seasons with the Jets, who drafted him in the third round in 2012. He signed a two-year, $8 million contract with Cleveland as an unrestricted free agent before the 2016 season, which ended with the Browns going 1-15. Davis made 15 starts and finished second on the Browns with 99 tackles and two sacks last season.
|
{
"pile_set_name": "Pile-CC"
}
|
I. Field
The present disclosure relates generally to communication, and more specifically to techniques for high rate data transmission.
II. Background
Wireless communication systems are widely deployed to provide various communication services such as voice, packet data, broadcast, messaging, and so on. These systems may be multiple-access systems capable of supporting communication for multiple users by sharing the available system resources. Examples of such multiple-access systems include Code Division Multiple Access (CDMA) systems, Time Division Multiple Access (TDMA) systems, Frequency Division Multiple Access (FDMA) systems, and Orthogonal Frequency Division Multiple Access (OFDMA) systems.
Data usage for wireless communication systems continually grows due to increasing number of users as well as emergence of new applications with higher data requirements. However, a given system typically has limited transmission capacity, which is determined by the design of the system. A substantial increase in transmission capacity is often realized by deploying a new generation or a new design of a system. For example, the transition from second generation (2G) to third generation (3G) in cellular systems provides substantial improvements in data rate and features. However, new system deployment is capital intensive and often complicated.
There is therefore a need in the art for techniques to improve transmission capacity of a wireless communication system in an efficient and cost effective manner.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
Registration Now Open for Canes 5k
Race set for Sept. 14 at PNC Arena
Registration Now Open for Canes 5kThe race is set for Sept. 14 at PNC Arena.
RALEIGH, NC – Doug Warf, Vice President of Marketing and Executive Director of the Kids ‘N Community Foundation, today announced that registration is now open for the second annual Canes 5k presented by Blue Cross and Blue Shield of North Carolina and assisted by Raleigh Orthopaedic. The race will take place at PNC Arena on Sunday, Sept. 14 at 9 a.m., and all proceeds will benefit the Kids ‘N Community Foundation.
The Canes 5k presented by Blue Cross and Blue Shield of North Carolina and assisted by Raleigh Orthopaedic will include a 5k race around PNC Arena and surrounding areas, 100- and 200-yard kids’ dashes, multiple inflatables, and appearances by Hurricanes mascot Stormy and the Eye Care Associates Storm Squad. Members of the Carolina Hurricanes as well as the team’s staff and alumni are scheduled to participate. A pancake breakfast for all participants will follow the 5k race.
For information about registration, the race-day schedule, fundraising opportunities and more, please visit http://www.CarolinaHurricanes.com/Canes5k. New for 2014, racers can build and join their own running and walking teams to raise funds for the Kids ‘N Community Foundation.
All proceeds from the Canes 5k will benefit the Carolina Hurricanes Kids ‘N Community Foundation, which provides much needed funding to children’s charities and education programs throughout North Carolina. The Foundation has funded scholarship programs, youth hockey, educational and literacy efforts, children’s health programs, the arts and other children’s-related initiatives. Annually, the Foundation provides cash and in-kind contributions of more than $1 million to charitable and educational programs in North Carolina. Every member of the Hurricanes organization is actively involved in community activities, and the Hurricanes take great pride in the ability to have a positive impact in our state.
|
{
"pile_set_name": "Pile-CC"
}
|
Welcome!
I love creating recipes, restaurant reviews and travel guides, but to keep this site going I sometimes feature sponsored posts (which are all clearly marked) and I also use cookies and affiliate links (so if I link to a product I love, and you click my link and buy it, I make a bit of money!) Additionally, I use Google Analytics to collect some (anonymised!) data about your visit. You can find out more by reading my Privacy Policy.
By hitting okay and proceeding to my site, you are agreeing to your data being used in this way.
50 Ways To Enjoy A Solitary Christmas
I have a confession to make. My best friend was horrified when I admitted it. This year, for the first time every I’m spending the Christmas period by myself, in my empty Los Angeles apartment. Flights back to the UK are expensive and I’d be working all Christmas at the holiday cottages if I were to fly back, and I have a few projects I want the peace and quiet when I don’t have anything else in the world to do. When I started to rationalise it, I realised while I was still worried about being lonely so far away from the Christmasses I’d grown up with at my parents house in the crisp Kentish countryside, there were a few upsides to having the season to myself. Is it bad that the first thing that popped into my head was that I could cook myself whatever I wanted? I absolutely loathe roast dinner, and therefore Christmas dinner!
With this impending solitude during what is usually my favourite time of year, with none of my usual culinary and tree decorating traditions to uphold, I started to think up what I could do to keep myself festively occupied during the downtime – I can’t work all the time! As I doubt I’m the only one out there spending the day by myself, I thought I’d put together a handy guide of 50 ways to enjoy a solitary Christmas!
Treat yourself to a few Philosophy festive shower gels to get you into the Christmas spirit, or to take long luxurious baths in. They have some great scents such as Gingerbread, Candy Cane and Egg Nog this year.
Make your own Christmas decorations. Not only is this a great afternoon craft project, but you will reap the festive benefits until the end of the season! Personally, I am going to make one of my DIY Tissue Paper Tassel Garlands in red, purple and gold.
Make a list of all your favourite Christmas films, rent them on DVD or on iTunes, or borrow them from friends and watch one every evening. Love Actually and The Nightmare before Christmas anyone?
Craft the perfect Mulled Wine recipe.
Read A Christmas Carol by Charles Dickens. I usually don’t like his writing, but this tale is so festive – I went to a reading of it one December and it has to be one of my best Christmas memories of my teens.
Make a sales hit list. Loads of things being reduced on Boxing Day, sometimes by lunchtime on Christmas Day can tempt you into buying stuff you don’t need just because it looks like a good bargain. Spend some time online making a list of only the things you really want or need, so you can sale shop with focus and not go in blind.
If you don’t want to be by yourself on the day itself, go volunteer at a shelter or a soup kitchen on Christmas Day and help spread the festive cheer.
Buy, rent or borrow a complete DVD box set of a TV Show you never saw but regret not getting into and have a marathon with it over the holidays. I think I’m going to watch either the whole of Breaking Bad or Rome this Christmas.
Take something from your usual Christmas indulgence traditions and indulge yourself. My parents and I usually share a big festive themed box of Hotel Chocolate truffles; this year I’m going to treat myself to a box and not have to fight over who gets the most popular flavours!
Find somewhere festive to go on Christmas Eve like a Christmas market to soak up some of the festive atmosphere and enjoy a nice hot cup of mulled wine from a street vendor.
Re-watch all of your favourite Christmas specials from some of your favourite TV shows. Personally, the original Chrismukkah episode of The O.C and last years Downton Abbey Christmas special are going to be on my watch list.
Bake something festive like mince pies, gingerbread of festive iced sugar cookies. It does not matter that you’ve made a big batch for just one person, you can take the leftovers to a shelter.
Set yourself a challenge. I absolutely adore marshmallows, but I’ve never tried making them before. Joy The Baker has a great and festive peppermint marshmallow recipe in her cookbook, which I’m setting myself the challenge of making!
Read your favourite blog from start to finish, from their very first post.
Get ahead. I know it is not ideal to study over Christmas, but think how much free time you’ll have when you are not alone at home if you getting everything you need to do for January done way ahead of your deadlines.
Take the time to write handwritten letters to your long distance friends and elderly family members.
Do an epic jigsaw puzzle, imagine the sense of accomplishment when you finish a 5,000 piece!
Read the years bestsellers list. Either for Kindle, iPad, from the library or treat yourself to a pile of paperbacks. Every book that was supped to be great in 2012, and you never had the time to read.
Make and decorate a gingerbread house. It is Christmas, so it does not matter if you eat it all by yourself!
Treat yourself to an adult Lego structure and build it. My childhood Lego memories may be of building Hogwarts castle out of Lego, but you can get some pretty intricate sets where you can build things like London’s Tower Bridge.
Start a blog. If you don’t already write one, Christmas when you have time on your hands is the perfect time to start one – I think starting this site has to be sone of the most rewarding things I’ve ever done.
Break out the nail art pens and glitter nail polish and brush up on your nail art skills by practising drawing delicate snowflakes and tiny snowmen on your digits.
Make a handmade Christmas wreath for your door. Even if you’re alone for the holidays, other people in your street or in your building will still be able to enjoy it!
Read all of the Harry Potter books.
Learn to knit. Who knows, you could be making everyone scarfs or jumpers by next year!
Make paper snowflakes, especially if you live somewhere like Los Angeles like I do, and you won’t be seeing any actual snow. I used to sit in class doing this in December when I was still at school all the time!
If you live somewhere populated, take a walk or a drive around and admire the Christmas lights other people have decorated the front of their houses with – without incurring the electricity bill!
Also if you live in the big city, take a stroll to admire all of the Christmas windows in your favourite designer stores or big department stores. Jealous of people who can do this in NYC!
However, if you live in the countryside, get up early, wrap up warm, grab your camera and head outside. Lucky if you have fresh snow, but even not things in the countryside look so crisp and magical covered with frost, and it is so silent – perfect for a refreshing wake up walk!
Watch A Muppets Christmas Carol.
Go see a film on Christmas Day. I’m planning on going to see The Hobbit!
Update your iPod with music from 2012 you forgot to download, and clear out old tunes you always skip when you’re playing it on shuffle.
Google some homemade face mask recipes and have a pampering session.
Sort out your closet and donate clothes you don’t wear anymore to charity.
Read a biography of someone you really admire, or find amusing. I read great books on David Cameron, and Michael McIntyre’s biography last year.
Make a list of places you’ve always wanted to travel to, and plan your next Summer holiday.
Hi, I'm Rachel!
I'm a food writer living in London and the English Countryside. Welcome to my online diary where I share easy, weeknight recipes, foodie travel diaries and some of the best places I've eaten out recently.
Newsletter
Free weeknight recipe eBook!
Sign up to receive my monthly newsletter in your inbox on the first Sunday of every month, full of seasonal recipes, links I love, mini cookbook reviews, and a few extra little updates and I'lll email you five brand new, delicious weeknight recipes!
I agree that my data will be used and stored in accordance to the terms laid out in Rachel Phipps' Privacy Policy and that I may unsubscribe at any time.
My Book
Student Eats
My first cookbook includes +120 easy, cheap and delicious recipes for anyone who wants to learn to cook food from scratch at home, who may be pressed for time, existing in a tiny kitchen, or keeping to a tight budget.
|
{
"pile_set_name": "Pile-CC"
}
|
Original Forensic Drawings of Jane Doe Found Near Manson Killings Were 'Inaccurate,' Sister Says Reet Jurvetson's sister provided new details into her past.
-- The sister of the Jane Doe who was found near the Charles Manson killings in 1969 in Los Angeles said the original forensic sketches of the body were "inaccurate."
The Los Angeles Police Department announced on Wednesday that "Jane Doe No. 59" had finally been identified as 19-year-old Reet Silvia Jurvetson, who was discovered in brush off Mulholland Drive on Nov. 16, 1969, more than three months after Manson ordered his followers to brutally murder five people at the home of director Roman Polanski.
Jurvetson had been stabbed numerous times in the upper torso and neck area, the LAPD said, and efforts to identify her failed. Her 73-year-old sister, Anne, said the composite drawings of Jurvetson's body bore little resemblance to her.
"Some people thought they recognized her," Anne wrote in a memorial. "Unfortunately, these drawings were clearly inaccurate, as anyone can see, and did not resemble her in the least."
The 19-year-old had just moved to Los Angeles from Montreal when she was killed, Anne wrote. She had lost contact with her family shortly after the move, according to police.
In December 2003, an LAPD detective submitted a piece of biological evidence to be uploaded into NamUs, a national database for unidentified missing and deceased victims. In June of last year, a family friend was browsing through the database when she saw a post-mortem photograph of Jane Doe No. 59 and notified the Jurvetson family, police said.
A DNA test was compared to members of the Jurvetson family, finally revealing Jane Doe No. 59 as Jurvetson more than 46 years after her death. Investigators interviewed Manson in prison and were unable to make a connection to the notorious murders, the LAPD said.
Jurvetson was born on Sept. 23, 1950 and was the youngest in the family, who had fled Estonia in 1944 during World War II, her sister wrote. The family moved to Canada one year after Jurvetson was born.
Anne described her sister as a "lovely, free-spirited and happy girl." She said Reet enjoyed art and sewing her own clothes.
She "developed a taste for adventure and freedom" during her teenage years and was "naive and trusting of others," Anne wrote. She had visited California in the fall of 1969, and the family found out she decided to stay after receiving a postcard from her describing her "nice apartment in Los Angeles." She told them not to worry and that she was happy, Anne said.
As time passed, the family stopped hearing from her. They figured she was "making a new life for herself."
"Attempts were made to reach her, but they proved fruitless," Anne wrote. "Initially, we believed that Reet was probably in search of more autonomy, and therefore we waited for her to get in touch with us."
Anne said the family did not suspect she had been killed and never thought to report her missing to the police.
"They thought that she was just living her life somewhere and that eventually news from her would turn up," she wrote. "But sadly, we did not know how to find someone on the other side of the continent, in another country, if that was even where she still was."
The coroner's report said Jurvetson had not been raped but stated she'd been stabbed more than 150 times, Anne wrote. There were no traces of drugs or alcohol in her system and her internal organs were "unremarkable," she added.
Anne shared details of her sister's life in hopes that the murderer will be identified, she said. The investigation into Jurvetson's death is ongoing, police said.
|
{
"pile_set_name": "OpenWebText2"
}
|
In the early hours of Saturday morning, the U.S. Senate narrowly passed a tax reform bill with a vote of 51-49. The dramatic passage took place after days of last-minute modifications behind closed doors to sway several Republican holdouts.
On Tuesday, Democratic leaders — Rep. Nancy Pelosi and Sen. Chuck Schumer — refused to show up to a meeting with President Trump and congressional Republicans to hammer out a tax plan that satisfied both parties. They cited Trump’s tweets that he didn’t think a deal could be made as the reason for their absence.
Not a single Democrat voted in favor of the tax plan. Sen. Bob Corker, who recently announced he would not seek re-election, was the only Republican to vote against the tax reform bill. Commentators on the left said the bill was “akin to rape” and suggested that Republican policy ideas will end America.
MSNBC Guest: GOP Tax Cuts ‘Akin To Rape’ [VIDEO] https://t.co/oqTqNynm8P pic.twitter.com/3PhUc5Sn8P — The Daily Caller (@DailyCaller) December 2, 2017
Is there any going back after this #TaxBillScam? To America? Does it matter now if Trump is impeached? There’s no America now. Not the one we knew. Sorry, feeling real despair this morning — Patton Oswalt (@pattonoswalt) December 2, 2017
Before the bill reaches President Trump’s desk to be signed into law, it must first be reconciled with the House of Representatives’ version of the tax reform plan, which was passed in November.
|
{
"pile_set_name": "OpenWebText2"
}
|
English: Finaly the day is here! After months of waiting it's now finally going to happend: my trip to Sri Lanka together with my boyfriend. In May I got the offer from my work to make a two-week trip in Sri Lanka. This way I will get to know the country and after the trip I can advise travellers which route to take in Sri Lanka based on my own experiences. I really doubted wether I would go or not. I've never been to a country like Sri Lanka before and frankly I don't see myself walking around there either... But tomorrow that will change because our flight leaves in the early morning. I'm excited, nerveus and curious at the same time, and also so happy that my boyfriend is comine with me! Like I said; I really don't know what to expect from this trip! When I'm in December I'll write about my experiences for sure. Now I'm going to pack the last things and then we're ready. 11 hours until take- off! Ahhhh!
|
{
"pile_set_name": "Pile-CC"
}
|
/*
* Copyright 2017 Google, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License")
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.netflix.spinnaker.halyard.config.validate.v1.providers.appengine;
import com.google.api.client.googleapis.json.GoogleJsonResponseException;
import com.jcraft.jsch.JSch;
import com.jcraft.jsch.JSchException;
import com.jcraft.jsch.KeyPair;
import com.netflix.spinnaker.clouddriver.appengine.security.AppengineNamedAccountCredentials;
import com.netflix.spinnaker.halyard.config.model.v1.node.Validator;
import com.netflix.spinnaker.halyard.config.model.v1.providers.appengine.AppengineAccount;
import com.netflix.spinnaker.halyard.config.problem.v1.ConfigProblemSetBuilder;
import com.netflix.spinnaker.halyard.core.problem.v1.Problem.Severity;
import java.nio.file.Path;
import org.springframework.beans.factory.annotation.Autowired;
import org.springframework.stereotype.Component;
@Component
public class AppengineAccountValidator extends Validator<AppengineAccount> {
@Autowired String halyardVersion;
@Override
public void validate(ConfigProblemSetBuilder p, AppengineAccount account) {
String jsonKey = null;
String jsonPath = account.getJsonPath();
String project = account.getProject();
String knownHostsPath = account.getSshKnownHostsFilePath();
AppengineNamedAccountCredentials credentials = null;
boolean hasPassword = account.getGitHttpsPassword() != null;
boolean hasUsername =
account.getGitHttpsUsername() != null && !account.getGitHttpsUsername().isEmpty();
if (hasPassword != hasUsername) {
if (!hasUsername) {
p.addProblem(Severity.ERROR, "Git HTTPS password supplied without git HTTPS username.");
} else {
p.addProblem(Severity.ERROR, "Git HTTPS username supplied without git HTTPS password.");
}
}
boolean hasSshPrivateKeyPassphrase = account.getSshPrivateKeyPassphrase() != null;
boolean hasSshPrivateKeyFilePath =
account.getSshPrivateKeyFilePath() != null && !account.getSshPrivateKeyFilePath().isEmpty();
if (hasSshPrivateKeyPassphrase != hasSshPrivateKeyFilePath) {
if (!hasSshPrivateKeyFilePath) {
p.addProblem(
Severity.ERROR,
"SSH private key passphrase supplied without SSH private key filepath.");
} else {
p.addProblem(
Severity.ERROR,
"SSH private key filepath supplied without SSH private key passphrase.");
}
} else if (hasSshPrivateKeyPassphrase && hasSshPrivateKeyFilePath) {
Path sshPrivateKeyFilePath = validatingFileDecryptPath(account.getSshPrivateKeyFilePath());
if (sshPrivateKeyFilePath == null) {
return;
}
String sshPrivateKey = validatingFileDecrypt(p, sshPrivateKeyFilePath.toString());
if (sshPrivateKey == null) {
return;
} else if (sshPrivateKey.isEmpty()) {
p.addProblem(Severity.WARNING, "The supplied SSH private key file is empty.");
} else {
try {
// Assumes that the public key is sitting next to the private key with the extension
// ".pub".
KeyPair keyPair = KeyPair.load(new JSch(), sshPrivateKeyFilePath.toString());
boolean decrypted =
keyPair.decrypt(secretSessionManager.decrypt(account.getSshPrivateKeyPassphrase()));
if (!decrypted) {
p.addProblem(
Severity.ERROR,
"Could not unlock SSH public/private keypair with supplied passphrase.");
}
} catch (JSchException e) {
p.addProblem(
Severity.ERROR,
"Could not unlock SSH public/private keypair: " + e.getMessage() + ".");
}
}
}
if (knownHostsPath != null && !knownHostsPath.isEmpty()) {
String knownHosts = validatingFileDecrypt(p, knownHostsPath);
if (knownHosts == null) {
return;
}
if (knownHosts.isEmpty()) {
p.addProblem(Severity.WARNING, "The supplied known_hosts file is empty.");
}
}
if (jsonPath != null && !jsonPath.isEmpty()) {
jsonKey = validatingFileDecrypt(p, jsonPath);
if (jsonKey == null) {
return;
}
if (jsonKey.isEmpty()) {
p.addProblem(Severity.WARNING, "The supplied credentials file is empty.");
}
}
if (jsonPath != null && !jsonPath.isEmpty() && account.isSshTrustUnknownHosts()) {
p.addProblem(
Severity.WARNING,
"You have supplied a known_hosts file path and set the `--ssh-trust-unknown-hosts` flag to true."
+ " Spinnaker will ignore your `--ssh-trust-unknown-hosts` flag.")
.setRemediation("Run `--ssh-trust-unknown-hosts false`.");
}
if (account.getProject() == null || account.getProject().isEmpty()) {
p.addProblem(Severity.ERROR, "No appengine project supplied.");
return;
}
try {
credentials =
new AppengineNamedAccountCredentials.Builder()
.jsonKey(jsonKey)
.project(project)
.region("halyard")
.applicationName("halyard " + halyardVersion)
.build();
} catch (Exception e) {
p.addProblem(
Severity.ERROR, "Error instantiating appengine credentials: " + e.getMessage() + ".");
return;
}
try {
credentials.getAppengine().apps().get(project).execute();
} catch (GoogleJsonResponseException e) {
if (e.getStatusCode() == 404) {
p.addProblem(Severity.ERROR, "No appengine application found for project " + project + ".")
.setRemediation(
"Run `gcloud app create --region <region>` to create an appengine application.");
} else {
p.addProblem(
Severity.ERROR, "Failed to connect to appengine Admin API: " + e.getMessage() + ".");
}
} catch (Exception e) {
p.addProblem(
Severity.ERROR, "Failed to connect to appengine Admin API: " + e.getMessage() + ".");
}
}
}
|
{
"pile_set_name": "Github"
}
|
Turkish crew returning home after 2 months at sea
Turkish crew returning home after 2 months at sea
ANKARA- Anadolu Agency
Fifteen Turkish crew members from a cruise ship headed home on May 22 from Barcelona, Spain after spending 65 days at sea during a coronavirusquarantine.
The group working on a ship affiliated with a large U.S.-based company was forced into quarantine after cruise ships stopped operations.
The trip home for the group, some of whom have been offshore for five months, began in the Bahamas, and passed respectively through Barcelona, Amsterdam and Sofia, Bulgaria.
In Bulgaria, they will board a bus for the last leg of their journey where they are expected Saturday to enter Turkey via northwestern Edirne province, which borders Bulgaria and Greece.
Deputy General Manager on the ships, Zafer Dal, told Anadolu Agency more than 10,000 personnel from 45 countries work at the company and the ship docked in a port in Barcelona. Thanks to the "great help and dedication" of
Turkey's Consulate General, the crew members managed to get return permission. "If our Foreign Affairs Ministry and our Consulate General in Barcelona did not care so much about us, we couldn't return to Turkey now. If we can return home, it is thanks to them," he said.
Turkey's Consul General in Barcelona Güçlü Kalafat said the evacuation was possible because of the coordination of the Foreign Affairs Ministry through a coordinated operation with embassies in Madrid, the Hague and Sofia and the Consulate General in Amsterdam.
"We are delighted to have our citizens meet their families during Ramadan feast," Kalafat said, referring to the end of the holy month of Ramadan which will be celebrated on May 24.
|
{
"pile_set_name": "Pile-CC"
}
|
The present invention relates to safety devices, and more particularly relates to a vehicle safety device, such as for bicycles or the like, which is adapted to be detachably mounted adjacent the rear end thereof to provide a safety and warning signal for oncoming traffic.
Presently, with the increased demand for and popularity of vehicles, such as bicycles, motorcycles, or the like, there has been a similar need for warning and/or signal devices for use therewith. Heretofor, various types of objects, such as reflectors, or flags, have been employed for this purpose. Such devices have generally included light colored reflectors, or flags, mounted by supporting wands or rods mounted adjacent the rear of the vehicle so as to not interfere with the rideroperator. For example, one such flag-type arrangement is disclosed in U.S. Pat. No. 3,947,059.
Heretofor, such prior devices have not been completely satisfactory. Purely reflective type devices are generally helpful during night usage, but do not incorporate features which draw one's attention to same during daytime usage. Similarly, flag-type devices have the disadvantage, for example, that when becoming wet or moist, they have a tendency to stick, and hence, often do not provide the degree of movement required to attract the attention of oncoming traffic.
|
{
"pile_set_name": "USPTO Backgrounds"
}
|
[Experiment of wet FGD process with waste marble].
The wet FGD process with waste marble was studied experimentally, and the mass transfer reaction mechanism was analyzed. Main parameters including liquid/gas ratio, pH value of the absorbent slurry and inlet SO2 concentration, etc. affecting SO2 removal efficiency were studied for the process. The results show that the suitable operating conditions were recommended as follows: pH0 = 5.5-6.5, L/G = 3L/m3, a = 2%; the sulfur dioxide removal efficiency can reach more than 60% when the inlet SO2 concentration was 1000 ml/m3. In addition, the industrial application potential for this process was discussed.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
1.. Introduction {#s1}
================
Biological interactions are far more complex than the interpretations we make from the one-time 'screen-shots' we usually use to portray them and the simplistic classification in which we force them. This is even truer when humans come into action. Humans have been part of the interaction networks characterizing most natural ecosystems for thousands of years \[[@RSOS171456C1]\]. However, ever since human populations began to increase exponentially, and especially, since humans started gathering in societies and using new technologies, ecosystem overexploitation and disruption of ecological interactions began \[[@RSOS171456C2]--[@RSOS171456C4]\]. In the last decades, the recognition of widespread human--nature interactions and human intrinsic need of intensive resource consumption have changed conservation practices, from the preservation of biodiversity by creating protected areas free of people to the inclusion of the humans in the design of conservation strategies.
Despite these efforts, humans have been proved to be drivers of manifold negative impacts on species interactions worldwide through activities that lead to global change \[[@RSOS171456C5]\]. For instance, habitat fragmentation, a consequence of man-driven land use conversion, disrupts species interactions by altering species and gene movements and differentially contributing to the mortality of interacting species \[[@RSOS171456C6]\]. Global anthropogenic warming and plant invasions break plant--pollinator interactions by altering plant phenology or by introducing new resources for pollinators \[[@RSOS171456C7]--[@RSOS171456C9]\]. Also, species overexploitation directly disrupts interactions between species through the differential population decrease of the target species, affecting all the species associations in the ecosystem \[[@RSOS171456C10]\]. In these ways, humans alter species interactions threatening the conservation of whole ecosystem processes and the maintenance of biodiversity \[[@RSOS171456C5],[@RSOS171456C11]\].
The antagonistic effect of humans on exploited species and interactions might be alleviated under a scenario of complex interactions. Complex interactions and their outcomes have been well studied in the case of apparent competition \[[@RSOS171456C12]--[@RSOS171456C14]\]. An analogous scenario can occur with predation. Predation has always been considered a negative outcome for one of the interacting species. However, a third party can modify the sign and magnitude of an antagonistic interaction. More specifically, when two predators share a prey species, one of the negative interactions could ameliorate the other negative interaction if non-lethal predation by one predator species reduces the prey likelihood of being chosen by the other predator species. In the case of seed consumers, even sporadic incomplete consumption of single seeds may be advantageous for a plant, when partially eaten seeds retain at least some germination potential while they become less attractive for other seed predators. Large seeds may be more resistant to damage by seed consumers as they may retain germination potential after being damaged \[[@RSOS171456C15]\]. Thus, partial consumption of seeds from a large-seeded species may help to reduce further seed consumption by a second predator species, which could lead to an increase in seed dispersal and germination potentials.
One of the most evident interactions in the monkey puzzle (*Araucaria araucana* (Mol) K. Koch) forests of southern South America occurs between this charismatic conifer and the Austral parakeet (*Enicognathus ferrugineus*). The globally endangered *A. araucana* tree occupies a restricted range across the eastern (Argentina) and western (Chile) slopes of the northern Patagonian Andes \[[@RSOS171456C16]\]. The geographic range of these forests is considered among the 200 areas of the world with the highest conservation interest \[[@RSOS171456C17]\]. These temperate forests have historically been affected by fires, overgrazing, wood exploitations and, more recently, by land fragmentation. These threats lead to a current distribution area of only around 400 km^2^ out of a potential past distribution of 5000 km^2^ \[[@RSOS171456C18]\] with the most obvious sign of forest degradation being the lack of natural regeneration \[[@RSOS171456C19]\]. The Austral parakeet concentrates in *A. araucana* forests during autumn--winter, when it mostly forages on *A. araucana* seeds, thus contributing to their secondary dispersal after being primarily dispersed by barochory. A recent study showed that at least 57% of the seeds produced are moved by Austral parakeets up to 50 m from the maternal tree to be consumed in distant perch trees. Whereas this parakeet eats most seeds completely, some of them are dropped without damage when they are handled for consumption, thus providing a mutualist service \[[@RSOS171456C20]\], and others are eaten incompletely. This opens the question that at least some of these incompletely consumed seeds could retain germination potential (given that *A. araucana* is a large-seeded species), as was recently shown for the sister species *Araucaria angustifolia* \[[@RSOS171456C20]\]. To increase complexity, humans also harvest and consume *A. araucana\'s* seeds, and thus can play an important role, at least in relative terms, in determining the outcome of the interaction between the endangered tree and the parakeet.
Humans represent a direct threat as seed consumers, and an indirect threat through the introduction of other seed predators into *A. araucana* forests such as cattle, wild boars and deer that feed on *A. araucana* seeds \[[@RSOS171456C21],[@RSOS171456C22]\]. Both processes result in a reduction in the availability of *A. araucana* seeds for their consumption and dispersal by Austral parakeet and for *A. araucana* forest regeneration \[[@RSOS171456C21]\]. The traditional consumption of seeds by original human gatherers changed drastically as collection extended to other social groups and with the onset of a commercial trade of *A. araucana* seeds \[[@RSOS171456C23]\]. Though the impact of human collection has not been properly measured across the whole *A. araucana* distribution range, this activity has been recognized as an important threat impairing forest regeneration, particularly for the tree populations most accessible to humans \[[@RSOS171456C24]\]. *A. araucana* is listed as an Endangered species by the IUCN Red List and its international trade is not allowed as it was listed on Appendix I of CITES \[[@RSOS171456C16]\]. Despite this status, human collection takes place every autumn, the period of maximum seed production and dispersal. Collection is allowed by the Argentinian government, which yearly regulates collection quotas and areas allowed for extraction, although with almost null capacity to enforce these measures. In 2016, by resolution 042/16, the government of Neuquén province in Argentina allowed a collection rate up to 20 kg/person and 100 kg/family for personal consumption after obtaining a permit that cost 0.35 US\$/kg. Collection for commercialization was taxed at 0.7 US\$/kg and each person allowed to harvest up to 300 kg. Worryingly, there were neither restrictions in the number of permits sold nor studies on sustainable extraction rates.
The multiple ecological interactions involving *A. araucana* trees, parakeets and humans constitute an excellent system to address whether partial seed damage might constitute an escape from human harvesting. This will be the case if humans avoid collecting seeds partially damaged by parakeets, provided these seeds retain germination potential. In our study system, the antagonistic--mutualistic continuum between Austral parakeets and *A. araucana* trees could move towards mutualism in the presence of human predation, constituting an overlooked case of plant--animal mutualism. So, focusing solely on the antagonistic aspect *A. araucana*--parakeet seed predation interaction, we ask whether seed partially consumed by parakeets could increase the potential fitness of female trees by reducing the amount of seeds removed by humans while not compromising the germination potential of seeds. Human seed collection may impact female fitness negatively because it reduces potential regeneration under seed-producing trees \[[@RSOS171456C20],[@RSOS171456C25],[@RSOS171456C26]\] and the seed pool available for secondary dispersal by Austral parakeets and mice \[[@RSOS171456C20],[@RSOS171456C27]\]. We hypothesized that seeds damaged by Austral parakeets are not attractive for humans and thus they escape from anthropic seed collection, increasing the amount of seeds available for *in situ* germination and secondary dispersal despite human seed exploitation pressure. Based on this hypothesis, we predicted that (i) humans will collect intact seeds; (ii) *A. araucana* trees subjected to human collection will show much lower density of intact seeds underneath than trees not subject to human seed collection; (iii) seeds damaged by Austral parakeets will retain germination potential, (iv) the presence of seeds partially damaged by parakeets will increase seed dispersal efficiency (SDE) and (v) this increment in SDE will be more important in those areas subject to human seed collection. Results supporting these predictions would demonstrate that in the presence of humans, parakeet seed predation behaviour can increase recruitment potential of an endangered and emblematic tree.
2.. Material and methods {#s2}
========================
2.1.. Study area and species {#s2a}
----------------------------
The native geographic range of *A. araucana* is located in the south of Argentina and Chile and comprises two separate areas, the Andes Cordillera (37°30′ to 40°02′ S) and the coastal Cordillera of Nahuelbuta (between 37°20′ and 38°40′ S) \[[@RSOS171456C28]\]. Our study was conducted in Lanin National Park, Argentina (39°12\'37′′ to 39°14\'27′′ S and 71°09\'15′′ to 71°9\'35′′ W and close surroundings). The *A. araucana* tree ('monkey puzzle' in English, 'Araucaria' in Spanish and 'Pehuen' in Mapudungun), an endangered and highly endemic conifer tree \[[@RSOS171456C16],[@RSOS171456C29]\], is dioecious (rarely monoecious) and reaches sexual maturity after 20--30 years \[[@RSOS171456C24]\]. It is a masting species with highly variable seed production among years, most likely a strategy to satiate predators \[[@RSOS171456C30]\]. Female cones produce between 100 and 200 seeds \[[@RSOS171456C24],[@RSOS171456C30]\], each weighing 3.5 g, on average ([figure 1](#RSOS171456F1){ref-type="fig"}) \[[@RSOS171456C30]\]. Seeds are dispersed by barochory; they are dispersed naturally or when they fall as Austral parakeets feed on female cones, falling under or a few metres away from the seed-producing tree. Seed ripening occurs from February to May, peaking in April \[[@RSOS171456C18]\]. Long- distance dispersal is performed by Austral parakeets up to at least 50 m, but most probably to longer distances \[[@RSOS171456C21]\] and rodents up to 40 m \[[@RSOS171456C27]\]. However, among rodents, only one mice species (*Abrothrix longipilis)* deposits seeds in potential good places for germination. Nevertheless, germination normally occurs when seeds are on top soil while this rodent buries them under soil or leaf litter between 7 and 9.4 cm deep \[[@RSOS171456C27]\]. Figure 1.(*a*) Austral parakeets perching on *Araucaria araucana*. (*b*) Group of gatherers collecting seeds. (*c*) Seeds commonly found on the ground, intact, partially eaten and completely eaten by parakeets. *Araucaria araucana* seeds sold in markets in (*d*) Chile and (*e*) Argentina.
The seeds are rich in carbohydrates, particularly starch \[[@RSOS171456C31]\], and germinate soon after dispersal, which coincides with the onset of the rainy season \[[@RSOS171456C32]\]. Thus, the large, recalcitrant seeds of *A. araucana* do not form a persistent seed bank and recruitment depends on the number of seeds produced and surviving each year \[[@RSOS171456C33]\]. *A. araucana* is shade tolerant when young, germinating in any type of microhabitat, including the ground under the maternal tree \[[@RSOS171456C18],[@RSOS171456C25],[@RSOS171456C34],[@RSOS171456C35]\]. In fact, in a recent study we recorded a total of 3305 saplings and 550 young trees growing under the putative parental trees, when carefully inspecting under the canopy of 516 female *A. araucana* trees \[[@RSOS171456C21]\].
*A. araucana* seeds have traditionally constituted an important source of carbohydrates for the Pehuenche/Mapuche people living in the south of Argentina and Chile \[[@RSOS171456C22]\]. Seeds are consumed in many different ways: raw, boiled, toasted, ground as flour and as an alcoholic beverage called 'mudai' \[[@RSOS171456C28],[@RSOS171456C36]\]. Moreover, this staple is used to feed cattle particularly during winter time \[[@RSOS171456C22],[@RSOS171456C28]\]. In addition to native seed predators (including Austral parakeets, native rodents and some invertebrates), several introduced, non-native vertebrates besides men (e.g. wild boar, rabbit, red deer, European hare, livestock) consume *A. araucana* seeds \[[@RSOS171456C20],[@RSOS171456C31],[@RSOS171456C37]\].
In the study area, humans used three different techniques to collect seeds not dispersed naturally: (i) hitting female cones with long sticks, a technique that only allowed access to the lower cones; (ii) using ropes for accessing some higher female cones; (iii) climbing up to the top of female trees and hitting cones, which was the most effective and destructive method.
2.2.. Field sampling {#s2b}
--------------------
We visited four *A. araucana* forest patches (=stands) in the Tromen area of Lanin National Park (*ca* 39°36′52′′ S, 71°20′59′′ W) in northwestern Argentinian Patagonia at the peak of the seed dispersal period in autumn 2016. Even though the selected study area is not listed among those allowed for collection, it was interesting to test our hypothesis in an area that was subjected to human overharvesting within a National Park in which seed collection occurs intensively regardless of being forbidden. Three of these patches were subject to anthropogenic seed collection, while the remaining one, experiencing no collection because of being close to the park ranger station and customs office, was used as control. At each area, whenever we saw people collecting *A. araucana* seeds, we asked for permission to randomly inspect 50 of the seeds collected in their bags (*N* = 10), and we recorded the number of entire seeds and of those partially eaten by parakeets (with part of the seed lost due to the bite of a parakeet). We asked collectors that accepted to be interviewed whether they selected seeds based on any characteristic (*N* = 10 groups of people). Additionally, we randomly collected 30 seeds from the ground under each tree (the number of collected seeds was limited by the small number of seeds remaining underneath trees) where humans have been previously collecting, recording also the number of entire seeds and of those partially damaged by parakeets.
Additionally, we estimated seed density by sampling seeds underneath the crown of a total of 50 seed-producing *A. araucana* trees right after the seed collectors left the tree (20 trees in each of two of the patches and 10 trees in the third one). We also sampled seeds under the canopy of 10 trees in the control area. We estimated seed density by haphazardly throwing 10 times a 40 × 50 cm frame within the area projected by the crown of each of the sampled trees, and counting each time the number of intact and partially damaged seeds within the area delimited by the frame. Finally, under each tree we collected intact and partially eaten seeds, which we stored for later use in the germination laboratory experiment.
2.3.. Germination trials {#s2c}
------------------------
We assessed the germination potential of seeds partially eaten by parakeets under laboratory conditions. We considered as damaged seeds those with less than 50% of the seed consumed. We calculated the germination rate of three different seed types (with 50 replicates each): (i) intact seeds, (ii) seeds partially eaten by parakeets, and (iii) seeds in which we simulated the effect of parakeet damage by manually cutting the distal portion of the seed in similar proportions as those munched by parakeets. This third treatment was included to assess whether parakeet predation affects seed germination beyond any effect related to the partial removal of tegument and endosperm. We randomly selected the seeds from the seed pool collected under 22 of the sampled trees. We weighed and measured the length of each seed, and then placed them individually in a 10 × 15 cm plastic tray on a layer of moist paper towel contained in a 10 × 15 cm plastic tray. The tray was then sealed with a plastic film to avoid dehydration. Trays were randomly mixed and incubated in a germination chamber set at 23°C and with a cycle of 14/10 light/dark hours, as recommended by Duplancic \[[@RSOS171456C38]\]. Seeds were treated with Fungoxan (Carbendazim, 1 ml l^−1^), a common procedure in germination experiments to avoid seed moulding, and paper towels changed regularly \[[@RSOS171456C38]\]. We inspected seeds twice a week (i.e. each 3--4 days) during 57 days after the start of the germination trials, recording the number of seeds that showed a protruded radicle.
2.4.. Data analysis {#s2d}
-------------------
Data (electronic supplementary material) were analysed using generalized linear mixed effects models (GLMMs). First, we assessed whether the proportion of partially eaten seeds differed between seed pools collected from people\'s bags and those collected underneath trees considering a logit-link function and a Binomial error distribution, and including 'group' (i.e. gatherer or tree) as a random term. Second, we assessed whether the number of intact seeds differed between trees in areas free and not free from human seed harvesting using a log-link function and a Poisson error distribution. Third, we assessed whether seed germination (coded as a binary variable) differed among treatments (i.e. intact, partially consumed predated by parakeets and hand-cut) at the end of the trial, using a GLMM with logit-link function and Binomial error distribution, including seed weight and seed length as covariates and 'tree' as a random term to account for any potential maternal effect in seed quality. In a fourth analysis, we used a GLMM with a similar structure as the previous analysis, but with a Gamma error distribution, to analyse whether the germination speed (number of days that elapsed until each seed germinated) differed among the three treatments. This analysis was restricted to those seeds that germinated. All analyses were performed using the package 'lme4' \[[@RSOS171456C39]\] in R \[[@RSOS171456C40]\].
We then compared *A. araucana* seed dispersal efficiency (SDE) \[[@RSOS171456C41]\] to provide estimates of seedling recruitment in four scenarios: (i) intact seeds in control area (without human seed collection), (ii) partially consumed seeds in control area, (iii) intact seeds in areas subject to human collection and (iv) partially consumed seeds plus intact seeds in areas subject to human collection. The analysis of SDE is a good approach to evaluate dispersal success \[[@RSOS171456C42]\]. We measured this SDE index only for the seeds primarily dispersed by barochory or by parakeets under maternal trees. Given that we did not quantify the proportion of germinated seeds turning into saplings we could only estimate SDE by considering germination potential of primarily dispersed seeds (i.e. not considering long-distance dispersal by parakeets \[[@RSOS171456C21]\]). As a consequence, this index was estimated by multiplying the median seed density found under trees in each scenario (a quantitative component of dispersal) by the germination potential of intact or partially consumed seeds obtained from our previous results (a qualitative component of dispersal \[[@RSOS171456C43]\]). We expected that SDE of partially consumed seeds will not contribute to increase total SDE significantly in control areas. On the other hand, its contribution to total seedling recruitment would be significant in areas subject to human seed collection given that SDE of intact seeds in this area would be very low.
3.. Results {#s3}
===========
A small number of illegal collectors accepted to be interviewed (*N* = 10 groups); all of them stated that they avoided collecting partially eaten seeds. Accordingly, the mean proportion of partially eaten seeds in people\'s bags was 2% (range= 0--8%), whereas the mean proportion of partially eaten seeds below trees where people collected seeds was 49% (range= 6.7--83.3%; *z* = 11.88; *p* \< 0.001; [figure 2](#RSOS171456F2){ref-type="fig"}, inset). Because of human gathering behaviour, the density of intact seeds was much lower underneath trees subject to human collection (median 2 seeds m^−2^; range 0--14.5 seeds m^−2^, average 3.24 seeds m^−2^) than underneath trees without collection (median 21 seeds m^−2^; range 4--121 seeds m^−2^; average 42.5 seeds m^−2^, [figure 2](#RSOS171456F2){ref-type="fig"}) (z = 7.14, *p *\< 0.001). The density of partially damaged seeds underneath trees subject to human collection was similar to that of intact seeds (median 1 partially damaged seeds m^−2^, range 0--27 seeds m^−2^, average 2.47 seeds m^−2^). Figure 2.Differences in intact seed density among the four study areas. R1 (*N* = 20), R2 (*N* = 20) and R3 (*N* = 10): three sites with human collection; NoR: site without human collection (*N* = 10). *N* = number of trees sampled in each site. Inset: box plot showing partially eaten seed proportion (eaten/intact seed pools) measured on the ground under *Araucaria araucana* trees subject to human collection and inside gatherers\' bags. Both box plots show median values (central horizontal lines), 25th and 75th percentile regions around the median value (box limits), 10th and 90th percentiles (whiskers) and outliers (circles).
The experimental trials showed that germination strongly differed among seed types ([figure 3](#RSOS171456F3){ref-type="fig"}). The greatest germination success (86% of seeds) was obtained from those seeds that were hand-cut before being sown ([table 1](#RSOS171456TB1){ref-type="table"} and [figure 3](#RSOS171456F3){ref-type="fig"}). Hand-cut seeds germinated faster than partially eaten seeds, whereas intact seeds germinated at the lowest rate. However, germination success was similar for both intact and partially eaten seeds (28% of germinated seeds for both treatments). Seed germination was neither affected by seed weight nor by length in any of the three treatments after controlling for maternal tree ([table 1](#RSOS171456TB1){ref-type="table"} and [figure 3](#RSOS171456F3){ref-type="fig"}). Figure 3.Proportion of germinated seeds in relation to days passed after sowing for three treatments. Total seeds in each treatment = 50. Table 1.Generalized linear mixed models explaining differences in: (*a*) germination success (yes/no); (*b*) germination speed (number of days elapsed until germination).fixed effectsestimates.e.*z*-value*p*(*a*) germination yes/no (intercept)−1.601.85−0.810.389 weight0.510.341.410.149 length−0.020.05−0.480.633 hand-cut2.360.504.68\<0.001 partially predated−0.420.53−0.800.422(*b*) germination speed (intercept)2.050.653.130.001 weight0.050.100.480.63 length0.0040.020.260.80 hand-cut−1.790.16−11.51\<0.001 partially predated−1.020.18−5.68\<0.001
Given the median seeds m^−2^ and germination success shown above, the SDE was 5.88 seedlings m^−2^ in control areas, 0.56 seedlings m^−2^ in control areas for partially consumed seeds, 0.7 seedlings m^−2^ for intact seeds in areas subject to human collection, and 1.26 seedlings m^−2^ when considering the combined effect of intact and partially damaged seeds in areas subject to human collection. Thus, in areas with high seed collection by humans, SDE was almost 80% higher when partially damaged seeds are included.
4.. Discussion {#s4}
==============
Human overexploitation of natural resources can disrupt interactions and drive species to extinction \[[@RSOS171456C44],[@RSOS171456C45]\]. However, here we show how interactions with third parties can buffer human impact. Because people avoided harvesting seeds munched by parakeets, incomplete seed consumption could represent an important escape from human predation for *A. araucana* seeds. As damaged seeds germinated in similar proportions as intact seeds, the escape from human exploitation promoted by parakeets\' predation behaviour could become critical for maintaining the population viability of *A. araucana* forests, particularly in those areas subject to anthropic seed collection. In areas under heavy harvesting by humans, the increment of almost 80% in SDE of seeds partially consumed by parakeets could promote a significant demographic effect given that an increment in recruitment at low seed densities could disproportionally improve growth rate in long-lived species. Most seeds produced during inter-mast years are expected to be lost due to predation by parakeets. These birds predate completely up to 20% of the seeds produced by a tree, and 52% of seeds are greater than 50% damaged \[[@RSOS171456C37]\]. Thus, parakeets have been considered as antagonistic interactors until their mutualistic role as dispersers was recently discovered \[[@RSOS171456C20]\] and their role as pollinators was suggested \[[@RSOS171456C46]\]. Moreover, parakeet feeding behaviour (i.e. partially eating and discarding many of the seeds, up to 40% in masting years \[[@RSOS171456C37]\]) plus the avoidance of collection by humans of partially eaten seeds may enhance *A. araucana* regeneration. This increases the mutualistic component in the antagonistic--mutualistic continuum of a plant--bird interaction.
The partial removal of the coat (and of part of the embryo) by parakeets enhanced the germination speed of *A. araucana* seeds. Seed coat removal by frugivores has also been observed in other plant species manipulated by primates and macaws, which scratch, scarify or remove parts of the fruit and often drop seeds or fruit during manipulation \[[@RSOS171456C47]\]. For instance, in forests of *Araucaria angustifolia*, in Brazil, a high proportion of seeds that were damaged by several parakeet and parrot species \[[@RSOS171456C20]\] germinated in the field, suggesting that partial consumption is a common feeding behaviour among parrots and that in many instances is a non-lethal seed predation behaviour \[[@RSOS171456C48]--[@RSOS171456C50]\]. The germination success of hand-cut seeds was greater than that of those partially damaged by parakeets ([figure 3](#RSOS171456F3){ref-type="fig"}); this could be explained by the time at which seed pericarp was partially removed in each case. Pericarps from hand-cut seeds were removed just before the start of the *in vitro* experiment, whereas partially eaten seeds have remained as such in the field for variable time periods, being probably exposed, on average, for longer times to fungus, dehydration or other factors negatively affecting germination \[[@RSOS171456C38]\]. Also, germination success of hand-cut seeds was greater than that of intact seeds, demonstrating that partial removal of the seed coat increases germination success. Apart from not affecting germination potential, partial consumption of seeds increased germination speed and the time window for germination as damaged seeds started germinating much earlier. This could increase the chances of recruitment through limiting the time window for seed predation by terrestrial vertebrates (e.g. wild boars, rodents, etc.) and environmental stress, reinforcing the idea that the interaction between *A. araucana* trees and Austral parakeets has a novel mutualistic component not recognized till now.
The importance of this parakeet--*A. araucana* mutualism seems to be widespread across *A. araucana*\'s geographical range, as signs of parakeet feeding were recorded in 85% out of 516 trees distributed throughout this tree range distribution, whereas human seed collection was recorded in 10 out of 24 areas surveyed in both Chile and Argentina (\[[@RSOS171456C21]\]; authors\' unpublished data). During the annual *A. araucana* seed harvesting period, families can collect up to 2000--3000 kg of seeds \[[@RSOS171456C51]\]. Mapuche-Pewenche people might have acted as seed dispersers while moving them across the landscape \[[@RSOS171456C52]\]. However, some groups of Mapuche-Pewenche people changed their interaction with *A. araucana* forests due to recent cultural changes \[[@RSOS171456C51]\]. Additionally, new groups of city-dweller collectors visit the area during weekends to collect seeds. The fact that current seed collection depletes seed availability represents an excessive cost for *A. araucana* trees, Austral parakeets, and for the whole assemblage of native seed predators. However, the fact that collectors are selective against damaged seeds turns partial seed consumption by parakeets into an effective mechanism for this tree to escape human predation. Thus, the persistence of partially eaten seeds on the ground is relevant as it reduces human negative impact and promotes germination under or close to the parental tree \[[@RSOS171456C24]\].
Until recently, the antagonistic role of parakeets and parrots in general as seed predators has been emphasized in detriment of the recognition of other plant--parrot mutualisms \[[@RSOS171456C20],[@RSOS171456C21],[@RSOS171456C53]\]. In particular, the germination potential of partially eaten seeds has been rarely addressed \[[@RSOS171456C15],[@RSOS171456C47],[@RSOS171456C54],[@RSOS171456C55]\], and, to our knowledge, partial seed predation has never been considered as a possible mechanism rescuing wild plant populations subjected to human exploitation. Thus, along the continuum antagonism--mutualism, partial seed consumption turns the outcome of the interaction towards a more positive result. In this context, our study suggests that conservation of the anthropogenic-threatened *A. araucana* forests could be favoured by Austral parakeet partial seed consumption, particularly, in the presence of human overharvesting. However, forest conservation in human-impacted areas cannot only rely on the feeding behaviour of an endemic parakeet. Fostering education and human behavioural change to reduce the number of illegal harvesters, particularly in protected areas, and enforcement of conservation laws are needed. Restoration initiatives are already taking place in Chile, where Mapuche communities are planting seeds and nursing seedlings \[[@RSOS171456C28]\]. Also, the study and monitoring of the sustainability of human collection merit special attention, to better predict its impact on Araucaria forests regeneration potential and to provide scientific means to regulate harvesting as it is suggested for other tree species in South America \[[@RSOS171456C26]\]. In any event, the interaction between *A. araucana* and parakeets we describe here could be a key element in developing a realistic conservation strategy focused on these emblematic forests.
Human seed collection, a selection mechanism directed particularly towards perfect and intact items, is a widespread phenomenon \[[@RSOS171456C56],[@RSOS171456C57]\], common even since prehistorical times \[[@RSOS171456C58]\]. In fact, escape from human harvesting could also occur in other regions of the world where wild seeds and fruits are collected by human inhabitants. Thus, partial seed consumption by wild frugivores when seeds retain germination potential, increase total SDE, and could favour ecosystems survival when subject to human intense harvesting. Both behaviours, partial seed damage by frugivorous species together with selection against predated fruits or seeds by humans, may enhance regeneration possibilities for many plant species worldwide, having relevance at a global scale beyond our study system.
Supplementary Material
======================
###### Proportion of partially eaten seeds between people\'s bags and those collected underneath trees;Intact seed density comparison;Influence of seed size and weight on the germination results;Proportion of germinated seeds in relation to days passed after sowing
We thank the National Park administration and Lanin Park rangers for their assistance, María Pastor for helping during laboratory work, Orlando Mastrantuoni and Agustina Lambertucci for helping during fieldwork, and Alexander V. Christianini for his helpful suggestions on a previous version of the manuscript.
Ethics {#s5}
======
We were allowed by the National Park administration to conduct our investigation (Permit 1527) and we had the informed consent of the people interviewed.
Data accessibility {#s6}
==================
Data are available to download from Dryad Digital Repository: <http://dx.doi.org/10.5061/dryad.9g263> \[[@RSOS171456C59]\].
Authors\' contributions {#s7}
=======================
K.L.S. and S.A.L. participated in the design of the study, coordinated the study, collected field data, carried out the laboratory work, participated in data analysis and drafted the manuscript; G.G. helped with the statistical analyses; M.A.A. participated in the design of the study, and helped draft the manuscript; J.L.T. and F.H. revised it critically for important intellectual content. All authors gave final approval for publication.
Competing interests {#s8}
===================
We have no competing interests.
Funding {#s9}
=======
K.L.S. and S.A.L. thank CONICET PIP 2014-0758.
[^1]: Electronic supplementary material is available online at <https://doi.org/10.6084/m9.figshare.c.3980790>.
|
{
"pile_set_name": "PubMed Central"
}
|
“In addition to endometrial disease, an odd hump-like protrusion and a septum running down the middle, I have retrograde bleeding, a.k.a. my period running in reverse so that my stomach is full of blood,” she wrote.
“My ovary has settled in on the muscles around the sacral nerves in my back that allow us to walk.
“Let’s please not even talk about my uterine lining. The only beautiful detail is that the organ – which is meant to be shaped like a light bulb – was shaped like a heart, ” she added.
Endometriosis is a painful condition that occurs when tissue that lines the uterus is found outside it.
|
{
"pile_set_name": "Pile-CC"
}
|
Delhi HC bars Indian firm from selling Louis Vuitton goods
Delhi High Court has restrained a Ludhiana-based firm and three individuals from manufacturing, selling or dealing in goods bearing the trademarks and logos of well-known French fashion house Louis Vuitton Malletier.
The interim order was passed by Justice Manmohan Singh on the plea of the global fashion house which had alleged that the three individuals and their company, Guru Kripa, has been dealing in huge quantities of counterfeit goods bearing its registered trademarks.
Taking note of this, the court said Louis Vuitton (LV), which makes and sells luxury trunks and leather goods including ready to wear shoes, watches, jewellery and accessories, “has been able to make out a prima facie case for grant of an ex-parte ad-interim order. In case the interim order is not passed, the plaintiff (LV) will suffer irreparable loss and injury.”
“Till the next date of hearing, the defendants (firm), their partners, if any, officers, servants, agents, distributors, stockists and representatives are restrained from manufacturing, selling and/or offering for sale,…. or directly or indirectly dealing in goods/labels, … bearing the trademarks Louis Vuitton, the LV logo, the Toile monogram pattern, the Damier pattern and the LV Flower pattern, or any similar trademark amounting to an infringement of plaintiff s registered trademarks, copyrights as also passing off,” the court said.
It also issued summons to the defendants (Guru Kripa and its proprietors) and listed the matter for further hearing on October 4.
The court appointed two local commissioners who were asked to visit the Ludhiana-based firm and make an inventory of all the infringing goods and demand disclosure of the outlets “from where the infringing goods are sourced, stocked and sold by the defendants within Ludhiana and any other cities in India”.
LV in its plea has sought a permanent injunction against the firm and its proprietors from making or selling or dealing in any manner in goods bearing any of the registered trademarks and logos of the fashion house.
LV has also sought damages of over Rs one crore from the firm and its proprietors.
|
{
"pile_set_name": "Pile-CC"
}
|
Steelers hoping to slow record penalty pace
The four-time Pro Bowler and former Defensive Player of the Year added he's not sure all teams are being treated equally, saying he frequently sees players from different teams commit similar acts. One player will get fined while the other avoids trouble altogether.
"I just think they need to display or execute the rules evenly across the board," Harrison said.
"You try to hit a guy that's moving full speed and see if you're not going to hit him in the head every now and then," Hampton said. "It's just part of this business, something you've got to work on. Not sure how much more you can do."
What the Steelers know they have to do, however, is be on their best behavior. Colon, who switched from right tackle to left guard this season, admits he didn't make it difficult on the refs against the Eagles. He allowed his four holding calls were all pretty blatant and blamed his own poor technique and overaggression for drawing the attention of the umpire.
"I've got to do a better job," Colon said. "If they're targeting me, I've got to give them a reason not to."
Tomlin remains optimistic his team will fall back into the norm and while players like Colon can work on their form, Tomlin will never make his players apologize for playing hard.
|
{
"pile_set_name": "Pile-CC"
}
|
Only in Lawrence 2013
Most in town know Bob Newton as the radio producer alongside broadcaster Bob Davis at Kansas basketball games. Newton, however, has spent years volunteering his efforts at Theatre Lawrence, the Douglas County Emergency Management board, the Douglas County extension council and also runs lights and sound at Plymouth Congregational Church.
For decades now, Bob Newton has had a center-court seat at nearly every Kansas University basketball game, and a bird’s-eye view from the press box at KU football games.
But as he enters his 30th season as the producer/engineer for the radio broadcasts of KU men’s football and basketball, Newton has a confession to make.
“People always assume I’m a big sports guy,” Newton said. “While I have become a bit of a fan, I’m really not a sports guy. I’m a radio guy.”
Folks who know Newton say he is more than that: He’s the ultimate detail guy.
“If you need to know that something is going to be done right, you call Bob,” said Hank Booth, who worked with Newton for more than 20 years when both were executives at Lawrence radio stations KLWN and KLZR. “When I would come up with an outlandish promotional idea, Bob’s role was to nod and tell me what a great idea it was, except that it was illegal or the FCC wouldn’t think much of it.
“He was the detail guy, and he is great at that.”
Word has gotten out, because Newton is nearly in constant demand from groups and organizations that want him to serve on their board or provide some sort of assistance.
“At one point, I was on 13 boards at once,” Newton said. “Once you start doing that stuff, then they start asking you to do it more.”
Newton said the key is to find ways to volunteer on projects that you have a natural interest in. For example, Newton had always been fascinated with severe weather. So, he ended up serving on the Douglas County Emergency Management Board and now is a part-time duty officer for the organization. From 1979 to 1994, Newton served as chairman of the Emergency Management Board and continues to serve as a board member today.
Then there are airplanes. Newton likes them, and he got his pilot’s license at the Lawrence Municipal Airport. The only logical thing for Newton to do was to spend the next 26 years serving on the city’s Aviation Advisory Board, which oversees issues at the airport. Newton served on the board from 1985 to 1990, took a one year break, and then he served again from 1991 to 2012.
And there is theater as well. Newton has loved plays and live performances since his days in high school. Now that Newton, 65, no longer is working at either KLWN or KLZR, he has more time to devote to that passion at Theatre Lawrence.
“Lately I’ve been designing sound for the shows,” Newton said. “On our production of ‘Footloose,’ I’m responsible for 14 wireless microphones, two keyboards, drums and a whole bunch else.”
On a day that he stopped to talk with a reporter, he actually was preparing to write a new program for the theater’s heating and cooling systems.
“It is always useful to have somebody who can connect and operate equipment, and that is not a lot of people’s favorite thing to do,” Newton said.
But Newton has made a career of it and is getting high accolades for it these days. The Kansas Association of Broadcasters in October will induct Newton into the Kansas Broadcasters Hall of Fame and will award him the KAB’s distinguished service award.
In his role as producer/engineer, Newton runs everything from the commercial breaks to the set-up and operation of all the equipment that sends the broadcast from the game site back to the network’s broadcast center.
“It is important stuff in Lawrence,” Newton said of ensuring KU fans can hear their Jayhawks. “We hear about it when we screw up, but fortunately it doesn’t happen a lot. In 29 years, I have never failed to get the broadcast on the air. Knock on a lot of wood for that.”
|
{
"pile_set_name": "Pile-CC"
}
|
Hickory 70s bands
Book a 70s Band on GigMasters and you’ll be in for a blast from the past! No matter the event, 70s Bands can make for great entertainment. Choose from our extensive database of professional performers in the Hickory County, MO area today.
BOOK WITH CONFIDENCE
MultiPhonic: High Energy Horns & Harmonies, Because Life is a Celebration! Packing dance floors since 2005.
We play swing to current dance music, so there's something for everyone at your event. We can also provide classic jazz during cocktail hour and/or dinner.
Multiphonic, a six piece variety band, has the widest variety of music available of any live act in the Midwest. We specialize in making wedding receptions and corporate events memorable. We feature both male and female lead...(more)
"Beauty & the McBeest" is a female/male vocal project with a single acoustic guitar & hand-held percussion; providing the listener with an eclectic mix of favorite cover songs in multiple genres, and original songs co-written by Crystal Gatewood and Scotty McBee. We provide a living room stage design as pictured in photos, providing for a unique, intimate and inviting atmosphere.
Offering an extensive & very diverse song list, requests are welcomed and Setlists can be chosen ahead of time...(more)
The M80s are the favorite 80s band in Kansas City! Get ready for an amped up, ragin' 80s adventure with the hottest dance hits of the iconic decade! A night with The M80s band starts with high-caliber, highly energetic group who know how to pack the dance floor and keep the totally righteous party going. The M80s are not just another 80s band. This is a nonstop, pumped up party to remember. No parking on this dance floor!
You want it...we got it...and more! The M80s band has been...(more)
The Midnight Piano Band is all about the live, musical performance. They are a throwback to when bands actually played their instruments and sang on stage. It seems hard to believe, but a band with this level of commitment to live sound is becoming quite rare. In the Midnight Piano Band, there are no laptops, no backing tracks, no tricks, and no gimmicks. What you see is what you hear, and what you hear is awesome. The band loves playing classic piano rock hits from the 70s and 80s by artists...(more)
Emerson Entertainment is a full service entertainment provider serving Oklahoma, Arkansas, Texas and Missouri for over 20 years! We provide live bands, DJ services, solo artists, and novelty entertainment such as clowns, jugglers, dancers, and comedians. Emerson Entertainment is unique because of our ability to provide a wide range of professional musicians and bands to customers. For example, we can provide a string quartet and a band/DJ for a wedding and the reception at great prices! Our...(more)
MOST REQUESTED BAND FOR WEDDINGS & PARTIES!!!~Eby Entertainment Agency -- Top Dance Band!!! No hype needed on this band!!
Performing the best hits from Motown to now!!!Super Hot DJ mixes!!! Soft Dinner Cocktail Music To A Packed Dance Floor!!!
The Blue Silk Band delivers the perfect blend of your favorite music, incorporating professional musicianship and stage presence into a dynamic and engaging performance. Your guests will undoubtedly find our music familiar and...(more)
Don't let the cool name fool you! Retro Boogie plays everything from way back when to top 40 including pop, rock, R&B, disco, soul and rock & roll. This 6-piece high energy group will have you stomping your feet and grooving to the beat with the vocal talents of sisters (yep, real sisters) Roz Moore & Bev Boyd. These sisters even let the guys in the back sing, too! Your musical ride will be funky-fabulous, yet classy! RETRO BOOGIE promises to deliver an enjoyable non-stop musical experience...(more)
Welcome to the Islands,join the conga line!! Caribbean Steel Drum Music,played solo, duo or with a band. Looking for the Cruise ship atmosphere? No need to look any further. Playing the best of Buffett,Marley,Belefonte,UB40 and many more(WITH VOCALS if desired). Have played for: Disney, Carnival Cruise lines, Six Flags, Budweiser, STL Cardinals, McCormick and Schmicks, Bahama Breeze, Cheesburger in Paradise, wineries, pool parties etc.(more)
Steel Drum Band from
Maryland Heights,
MO (166 miles from Hickory County, MO)
Flashback was formed by a group of dedicated pop/rock musicians who love rock and pop music, and grew up learning the original classic rock during that era. Our songlist will appeal to a wide ranging age group because we play the best music from the 60's, 70's & 80's classic rock and country.(more)
Griffin and the Gargoyles is the premier high-energy party and dance band from the Midwest. Recently awarded "best cover band" by the St. Louis Riverfront Times, musicianship, customer service, and style is the reason Griffin and the Gargoyles have played to packed houses for over 20 years. Their extensive play-list and freshness keeps the crowds coming back for more.
Griffin and the Gargoyles easily provides the widest variety of music in the area and depending on the venue or crowd can...(more)
Charles Glenn is an entertainer who draws upon his vast wealth of knowledge and training to create unforgettable musical experiences for his audiences.
The son of an accomplished opera singer, Charles received early training in voice and percussion. Charles has utilized both his strong vocal and percussion talents as the opening act for such national groups as Smokey Robinson, Huey Lewis and the News, and the Allman Brothers, as well as for countless regional and local acts. Charles was...(more)
Spectrum is proud to announce that we are a recipient of the 2018 “Best of Weddings” award from The Knot! We were also inducted into The Knot "Hall of Fame" for consistently receiving outstanding reviews from past clients for so many years in a row. We were also honored to receive the WeddingWire 2018 "Couple's Choice Award" as well as this same award for the past 10 years. We are proud to be the only St. Louis band to win both of these awards for the past 6 years in a row! We also have...(more)
Variety Band from
Chesterfield,
MO (159 miles from Hickory County, MO)
Fanfare with Kittie Moller play a variety of styles of music with a great deal of, well...Fanfare! Fanfare is a four piece group that features the lead vocalist Kittie Moller whose vocals will capture and enthrall you. They have appeared all over the country at the top clubs, hotels, conventions, fairs, festivals and concerts. Some of their past clients included General Motors, Monsanto The St. Louis Ram's and even an USO tour to Africa. Kittie has had two number 1 Independent Chart hits...(more)
The LustreLights is a dedicated group of professional musicians and entertainers who have performed in a variety of musical settings. Whether it be a ceremony, a reception, an outdoor concert, or a corporate function, The LustreLights will always bring your party playlist to life. From pop/rock/Dance to classical and jazz, our versatility and years of experience will ensure that your event will be the talk of the town. And how can you enjoy all of these talented musicians without a high...(more)
The Remedies is Nashville's coolest party band focused on energizing every event with impeccably-crafted renditions and super-tight arrangements of current hits and popular classics! Three equally-talented, yet stylistically-unique lead vocalists allow the group to nail an amazing range of current and classic hits. In addition, the Remedies' girls work the crowd to ensure your reception is full of fist-pumping fun! The band's rhythm section makes the dance floor shake with deep grooves and...(more)
Thank you to all of our clients for helping us to win the GigMasters "Best of 2016" award!! That is 5 consecutive years you have helped us achieve that award and we are most honored!
Hire The Wonderfuls and you will be hiring a professional band that will make all of your guests glad they came to the celebration! The Wonderfuls expertly cover groups like Black Eyed Peas, Chain Smokers, Maroon 5, Sia, Lady Gaga, Ke$ha, Bruno Mars, Jason Derulo, The Commodores, Montel Jordan, Daft Punk,...(more)
The Rhythm Kings are a 5 STAR GigMaster performer and your best choice for entertainment at your event.
If you're looking for a top rated all Inclusive entertainment package to play your next wedding, corporate function, private event or festival…you've found the perfect group! Our band brings a interactive style to the stage and is guaranteed to have you and your guests dancing, singing and partying the night away!
When you book The Rhythm Kings for your event you'll have all of your...(more)
*Upscale features the nephew of local legend Al Sofia of the Al Sofia Band as well as jingle singer for Jim Gaynor Music. Jim Gaynor's music can be found on History Channel, A&E, Whether Channel, Delta Airlines and a handful of movies. The Drummer of Upscale studied under Rusty Jones (Isham Jones' great nephew who played on a Chet Baker Album. All members have studied at prestigious schools of music as well but most importantly just love to have a great time.
Upscale Is a high quality...(more)
The Breakfast Club is a high energy rock / dance
'80s tribute band, whose every song is a hit that
brings the house down with spontaneous,
exuberant 'I know this song!' singalongs.
Moonwalk down memory lane with The Breakfast
Club as they spin you right round to all the radical
sounds, styles, and way cool dance steps from the
1980's In over-the-top retro 80's attire. One of a few
bands to play in 5 markets (Festival, Club, College,
Weddings, Corporate).
"The Breakfast Club"...(more)
Winner of Best of Gigmasters 2017 Award
CLIENT REVIEWS
I really liked More Love Band after hearing their demo online but loved them after my initial phone call with Yvette. Since my first contact with the band they have been nothing but accommodating. When they came to set up for our outdoor reception I was having a problem with the venue and the band helped put my mind at ease and worked with the coordinator to make sure things went off without a hitch. Their music was upbeat and had...(more)
Nationwide Coverage is the #1 dance band on Gigmasters within a 450 mile radius (the Southeast!). Check out the audio and video demos to see why. Read what the people that hired us had to say about the band.
NWC is a dance-driven cover band with strong roots in 80's Rock, Motown, and Top 40. With female and male lead singers, the sky is the limit as to songs and styles we can play. We enjoy performing for weddings, corporate events, fraternity/sorority parties, school dances, private...(more)
GENERATION Z brings the party like no other! You have selected the high energy band that will make your next event a night to remember.
We are ready to do your next Wedding, Festival, Corporate event and/or Birthday Party.
The band plays a wide variety of music ranging from Bruno Mars to Lynyrd Skynyrd. We are dedicated to keeping the dance floor full. Large or small, we have the musical packages to accommodate all. Your guests will be dancing and singing along to their favorite dance...(more)
TOP TIER is live music at the highest level! We provide the best of both worlds—a fun, high-energy party band and a smooth, light jazz band all in one! So whether you just want a great dance band, or you also want some relaxing dinner/cocktail music before the party really heats up, look no further. Top Tier has 5 vocalists and an incredible repertoire that spans 7 decades and encompasses almost every genre of music.
Top Tier consists of top notch, experienced musicians with a passion...(more)
Awarded GIGMASTERS "Best Of the YEAR" Award for 5 years. If an exciting, professional, charismatic,variety, guest engaging, interactive customer focused performance and a packed dance floor is what you are seeking for your party,wedding reception, fraternal, civic or corporate event, look no further than "UTOPIA".
Make your event truly "One of a Kind" and as special as the occasion you are celebrating. Whether you like the unforgettable hits of Motown, Get Down on it to current hits or...(more)
Proudly represented by Bandstand Entertainment, The WORLD FAMOUS Beale St All Star Band is "THE BAND" that will make your event exceptional. They are one of the hottest acts around and are in a class by themselves. The bands raw high energy, super tight vocal harmonies, rhythms bring your event to life like never before!
They rock the classic covers that everyone loves to dance and sing along with..their energy is infectious and a crowded dance floor becomes inevitable as you hear the...(more)
Lady Patice, The Motown Reflections and the Fantasy Band performs in and around Chicago and nationally as a top Show Band, Motown Band, R & B Band, Blues Band, Funk Band, Jazz Band, Soul Band and Wedding Band. As one of the best dance bands in Chicago the Fantasy Band has performed in concert with some of the most notable entertainers including blues legends BB King, Buddy Guy and Bobby "Blue" Bland. Lady Patice, a Chicago and nationally known show artist, has performed in numerous concerts...(more)
Voted "BEST LIVE BAND in TENNESSEE" and "BEST LIVE BAND in UNITED STATES" by The 2015 Wedding Industry Expert Awards! The Downtown Band has opened for Elton John, Sting, Robin Thicke, Santana, Neil Young, Lana Del Rey, Kevin Costner, Bryan Adams, Enrique Iglesias, and Tom Jones, among many others.
The Downtown Band delivers the highest quality live music experience, specializing in hit music from every generation. Tailoring each show to their client's needs, this four to ten-piece group...(more)
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
How to configure webproxy settings to bypass hosts and networks in the shell?
Can I manage this setting in the Terminal?
A:
To configure proxy settings in the shell use the command networksetup.
To get help enter networksetup -help.
To bypass networks, hosts and domains use the command:
sudo networksetup -setproxybypassdomains <networkservice> <domain1> [domain2] [...]
The default items in the list are *.local and 169.254/16.
So if you want to add a domain (abc.com) and a host (17.12.3.5) but keep current items in the list use (example network service: en1 - to get a list of network services enter: networksetup -listallnetworkservices):
sudo networksetup -setproxybypassdomains en1 *.local 169.254/16 abc.com 17.12.3.5
To clear the list use:
sudo networksetup -setproxybypassdomains en1 Empty
|
{
"pile_set_name": "StackExchange"
}
|
Q:
jQuery stop animation
So I have a list of news items that have AJAX controls to create, edit, or delete. Upon one of these actions a small message is shown at the top confirming whatever they did. So if they add a new post, it pops up with "Added News: title". It slides down, then after 10 seconds slides up back. The problem is that if multiple actions are done before the 10 seconds is up, it animates multiple times.
For example:
Create news with title "one" - message comes down.
After 4 seconds, Create news with title "two" - message comes down.
After 6 seconds, message for "one" slides up, and then after another 4 seconds the message for "two" slides up.
I want it to only ever slide up once, so you can queue as many actions you want and then 10 seconds after the last action, it slides up.
Here's what I got:
$('#ajax-message').html('Added News: ' + title);
$('#ajax-message').slideDown('1000').delay('10000').slideUp('1000');
A:
What I would do is use setTimeout, and each time a new action is done, clear the previous timeout and create a new one.
Something like:
var timerID;
...
// when an action occurs
clearTimeout(timerID);
timerID=setTimeout(function(){
$('#ajax-message').slideUp('1000');
},10000);
|
{
"pile_set_name": "StackExchange"
}
|
TWO-DIMENSIONAL GEL ELECTROPHORESIS ANALYSIS OF BROWN ALGAL PROTEIN EXTRACTS(1).
High-quality protein extracts are required for proteomic studies, a field that is poorly developed for marine macroalgae. A reliable phenol extraction protocol using Scytosiphon gracilis Kogame and Ectocarpus siliculosus (Dillwyn) Lyngb. (Phaeophyceae) as algal models resulted in high-quality protein extracts. The performance of the new protocol was tested against four methods available for vascular plants and a seaweed. The protocol, which includes an initial step to remove salts from the algal tissues, allowed the use of highly resolving two-dimensional gel electrophoresis (2-DE) protein analyses, providing the opportunity to unravel potentially novel physiological processes unique to this group of marine organisms.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
E-step Meeting in Ireland
At the beginning of this week we attended our two-day E-step meeting in Ireland. As usually time was too short to visit around, but at least we’re propud to have managed getting things done and checking all through our agenda.
Definitly the name of our hotel (Kilmore) was a big hint for the meeting that would come, although we were a bit picky about the fact it did not state a very specific, nor measurable objective. It should have been “kill all” instead of “more”! 😉
Killing did involve tasks so no actual violence was recored. We had two good days of hard work and managed to get a lot of things done, starting with our comparative research, road map, reports, evaluations and plannig our next steps.
We would like to thank again the Irish team who did a great job in welcoming us and making us feel so great during our short stay!
Needless to say it was amazing seeing everyone again and we’re already looking forward for our next meeting in October, although unfortunately it will be the last one in this project!
|
{
"pile_set_name": "Pile-CC"
}
|
According to Japan's nuclear watchdog group, highly radioactive water from the now-destroyed Fukushima nuclear plant has leaked into the ocean through an underground barrier and is now quickly rising towards the surface. Today, that same group reported that the toxic water has caused the ocean to exceed levels far above the legal radioactive limit.
The head of of a Nuclear Regulatory Authority, Shinji Kinjo, told Reuters that the radioactive leakage has created an emergency they're struggling to contain. What's more, any attempts at countering the problem from the Tokyo Electric Power Co are only a temporary solution, as Tepco's "sense of crisis is weak."
In the first few weeks after the tsunami and earthquake that destroyed Fukushima and sent Japan into a state of crisis, the Japanese government, citing the emergency situation, allowed Tepco to drop thousands of metric tons of radioactive water into the Pacific. Until now, Tepco had been attempting to prevent groundwater from coming into contact with the plant, but now, the levels of radioactive waste in the ocean have forced them to admit that tainted water has, in fact, been leaking at a troubling pace.
Workers had injected chemicals into the ground to harden the shoreline along the No. 1 reactor building, but that only effectively solidifies ground at least 1.8 meters below the surface. And as Masashi Goto, a retired Toshiba Crop nuclear engineer who worked on several Tepco plants, told Reuters:
If you build a wall, of course the water is going to accumulate there. And there is no other way for the water to go but up or sideways and eventually lead to the ocean. So now, the question is how long do we have?
Contaminated water could easily rise to the surface within three weeks and once it does "it would flow extremely fast." Which makes the claim of the task force overseeing Fukushima's accident measures that "new measures are need to stop the water from flowing into the sea that way" seem like a vast, vast understatement. [Reuters]
|
{
"pile_set_name": "OpenWebText2"
}
|
Jennifer Willoughby, the second wife of President Trump's staff secretary Rob Porter has spoken on the record to DailyMail.com about her abusive marriage to the man described as one of the most important players in the Oval Office.
Willoughby, 39, told DailyMail.com she was 'walking on eggshells' during their marriage due to his explosive anger.
Porter's first wife Colbie Holderness confirmed to DailyMail.com: 'He was verbally, emotionally and physically abusive and that is why I left.'
Last week, DailyMail.com revealed that Porter has been dating White House Director of Communications Hope Hicks.
When reached for comment, Porter told DailyMail.com: 'I will not comment about these matters, beyond stating that many of these allegations are slanderous and simply false.'
John Kelly, Chief of Staff, commented: 'Rob Porter is a man of true integrity and honor, and I can't say enough good things about him. He is a friend, a confidante and a trusted professional. I am proud to serve alongside him.'
'I have worked directly with Rob Porter nearly every day for the last year and the person I know is someone of the highest integrity and exemplary character,' Press Secretary Sarah Sanders told DailyMail.com.
'Those of us who have the privilege of knowing him are better people because of it.'
Willoughby - who bears more than a passing resemblance to glamorous Hicks - claims that on December 22, 2010, Porter pulled her naked from the shower by the shoulders and yelled at her.
She refused to join his family on a vacation after that.
Jennifer Willoughby, the second wife of President Trump's staff secretary Rob Porter has spoken on the record to DailyMail.com about her abusive marriage
Porter has been described as one of the most important players in the Oval Office
Hope Hicks, 29, was spotted stepping out of her D.C. apartment with White House Staff Secretary Rob Porter ten days ago
'I want to be very clear when I say this,' Willoughby said. 'I don't want to be married to him. I would not recommend anyone to date him or marry him. But I definitely want him in the White House and the position he is in. I think his integrity and ability to do his job is impeccable. And the majority of the issues he suffers from are very personal and intimate.'
The couple married at Thanksgiving 2009.
He called her a 'f**king b***h' on their honeymoon at Myrtle Beach between Christmas and New Year, she says.
'We had already been fighting. I had already seen more extreme versions of the overreactions of anger that I had seen back in August,' which was before they were married.
Willoughby continued: 'I can't remember what triggered it. He lashed out and was really angry, and both under his breath and explicitly to me called me a ''f***ing b***h'' and ''f***ing ridiculous''. He accused me of not caring about him or not caring about his needs.
'That whole week, or however long it was, several days, [of honeymoon] was spent with me trying not to make him upset.'
Jennie, as she's known to her friends, said that his anger would be unpredictable.
She said: 'I frequently would do favors for friends, like watch their dog or go pick up their daughter, and he would be angry that I would do that.
'In the first weeks and months, his explanation for his anger was that his first marriage had been very toxic, rooted in arguments, accusations and manipulation and he was carrying over from that relationship.
'He would say that he was so used to being treated this way by his ex-wife that he was projecting that on to me. That was the explanation.'
Jennie said that she felt manipulated throughout the marriage.
'He's very intelligent, extremely good with his words and is a lawyer by profession and is able to take words that I had said and use them in a way that it would confuse me as to what I meant,' she told DailyMail.com in the bombshell interview.
'He would challenge my intelligence or a statement that I had made by implying that I couldn't have possibly come up with it on my own and that I must have been influenced by someone.
'I would start to doubt myself. He was using words against me. It was his norm in dealing with behavior he didn't like.'
Jennie said that she never saw Rob take his anger out on other people - 'not even road rage' – but that is was all behind closed doors.
'That was something that was interesting to me, from a case study perspective. It does seem to be very much focused in an intimate, romantic relationship. It's almost as though the anger that could have been placed on his father was placed on the romantic partner.'
'Fairly soon after New Year in 2010, I started seeing a therapist and requested that Rob see a therapist because I was so distressed about his anger,' she revealed.
'I also had met with a bishop in the Mormon Church about his anger. It came to a head and in February or March 2010. I was so worn down and exhausted by the anger that I requested we have a separation.
'I never received specific threats from Rob, he was just often angry and it was oppressive. I started to take on the blame and the weight of his lack of self-worth.
'Over the course of the years of our marriage, I can think of several times where I was collapsing on the ground in tears and saying, ''just leave me alone, just stop'' because the anger and the insults were too much.
'[He would say] that I was worthless, that I was a liar. This is not one instance, these are things that he might have said in a rage. That I always got my way, that I was selfish, that I didn't care about him, about his needs. Any version of those types of statements, heard enough times, with enough force behind them are devastating.'
She had a miscarriage at six weeks pregnant towards the end of their marriage.
'The stress of being pregnant in that marriage was hard and then the shame and depression of not being pregnant anymore was also hard,' she said.
On June 19, 2010, she filed a protective order against Rob because he violated their separation agreement at the time, and would not leave their apartment.
According to a complaint filed with the police, he punched the glass on the door to their home, cutting his hand in the process, at which point she called the police. He then left and following that she filed a temporary protective order.
Willoughby claims that on December 22, 2010, Porter pulled her naked from the shower by the shoulders and yelled at her: '[It happened] just after our first anniversary....It was a glass shower door, he opened it and dragged me by my shoulders out of the shower to yell. Immediately upon seeing my reaction to that, he released me and apologized but it doesn't take away that he was angry enough that that happened'
On June 19, 2010, Jennifer filed a protective order against Rob because he violated their separation agreement and refused to leave their apartment
Willoughby wrote in a criminal complaint that Porter would not leave after she asked him to leave her apartment
She claims Porter punched the glass on the door to their home, cutting his hand in the process at which point she called the police
The couple married in 2009, but the marriage ended in divorce in 2013
A physical assault took place on December 22, 2010.
Willoughby said: '[It happened] just after our first anniversary. I cannot remember what the fight was about but I excused myself from the fight in a way that was typical at that time. I certainly was not meek and mild and said, ''I'm not going to fight you anymore'' and stormed off and went to take a shower.
'He was not done fighting with me. It was a glass shower door, he opened it and dragged me by my shoulders out of the shower to yell. Immediately upon seeing my reaction to that, he released me and apologized but it doesn't take away that he was angry enough that that happened.'
The attack upset her so greatly that she refused to join his family on a Christmas vacation that they were leaving for the following day. She also asked him to leave their home.
'He was very contrite and apologetic at that point. In all of the anger and all of the name-calling, he had never been physical with me.'
Willoughby tells DailyMail.com that Porter called her last year and demanded she take down her blog posts that referred to their marriage - she did not name him.
He asked her what she had told the FBI about their relationship during her interview with the agency over his security clearance in February 2017.
She said that his first wife was also interviewed.
'My experience of our entire marriage was being with a man who could be both charming and romantic and fun - and even thoughtful and kind; and horribly angry and manipulative. It was the duality of both of those things existing at the same time and not necessarily knowing what in his life would trigger the anger,' Willoughby said
At that time they talked, she claims, she spoke with his first wife Colbie and she said that they had both experienced the same abuse.
Willoughby also received a message from his previous girlfriend, before Hicks, telling her that Rob was considering hiring a private investigator to look into her and 'employ' a journalist to write about her.
DailyMail.com could not reach Porter's ex-girlfriend for comment.
'My experience of our entire marriage was being with a man who could be both charming and romantic and fun - and even thoughtful and kind; and horribly angry and manipulative. It was the duality of both of those things existing at the same time and not necessarily knowing what in his life would trigger the anger.
'Or what in his life would draw out the kindness and the chivalry. That's a crazy-making space for a spouse to be in, that I somehow have no control over the quality of my relationship.
'The terminology is ''walking on eggshells'' – you don't know which man is going to walk in the door. Or you don't know what seemingly innocuous comment is going to be interpreted differently.
'I had a friend's daughter over to carve pumpkins for Halloween and he sulked and pouted and didn't join us. And of course after she left, he was angry – ''why would I have someone over, why would you help her [my friend] out when she could be doing this herself?'' There was no rational explanation as to why that would make him angry at that particular moment.'
Porter is a Massachusetts-born Harvard graduate who went to the Ivy League school with presidential son-in-law Jared Kushner.
Hicks and Porter were seen smiling and laughing over drinks as they enjoyed each other's company at Rosa Mexicano in Washington D.C., hours before they went home together
He also went to Oxford University as a Rhodes Scholar and spent two years as a Mormon missionary in London.
Before being tapped to join the new administration, he had been chief of staff for veteran Utah Senator Orrin Hatch. He has also worked for Republican senators Rob Portman of Ohio and Mike Lee of Utah.
His job has been described as one of the most important in the Oval Office as he, working with Chief of Staff John Kelly, controls the information that reaches the president.
'Porter, a little-known White House aide who has avoided getting caught up in any of the West Wing drama that has plagued the administration for the better part of seven months, serves to review everything before it makes it to the president's desk,' Business Insider wrote in September.
'Given how the president has shared dubious information at times when aides have presented him with reports from less-than-credible sources, Porter's role has an outsized importance,' the paper added.
'Talk to people who worked with him in the past, and they'll repeatedly mention his intelligence, experience, and team-first attitude.'
His father, Roger Porter, was an aide to President George H.W. Bush.
Hope Hicks, 29, and Porter had doing their best to keep their romance under wraps when they were spotted together with friends at low-key restaurant Rosa Mexicano near downtown Washington two weeks ago.
They did not show any sign of affection and did not sit next to each other at the restaurant.
But the moment they got in the cab to go back to Hicks' D.C. apartment they started cuddling and kissing in the back seat.
At the end of their evening together, Hicks and Porter hailed a cab, but as soon as it took off, the pair moved from their sides of the car to the middle and began kissing
During the taxi ride the secret lovers Hicks and Porter could be seen cuddling in the back seat. One eyewitness said Porter could be seen kissing Hope's neck
Hope exited the taxi while Rob pays for the ride before they both enter her D.C. apartment at the end of the evening
'As soon as the taxi took off they both moved from their sides of the cab to the middle. Rob was kissing Hope's neck all the way home,' an eyewitness to the red-hot White House couple said.
Porter had been living with a willowy blonde political appointee, sources say before he began dating Hicks.
Public records document that the woman was living in his apartment in Arlington, Virginia.
The woman split with Porter around Thanksgiving, a White House source tells DailyMailTV exclusively.
Senator Orrin Hatch, commented: 'It's incredibly discouraging to see such a vile attack on such a decent man. Shame on any publication that would print this—and shame on the politically motivated, morally bankrupt character assassins that would attempt to sully a man's good name.
'I know Rob. I've known him for years, both as a close friend and as a personal advisor. He is kind and considerate towards all. The country needs more honest, principled people like Rob Porter, which is why I hope that this cynical campaign to discredit his character ultimately fails.'
|
{
"pile_set_name": "OpenWebText2"
}
|
Share This Page
By Urza - 1st February 2008Updated by Urza on 26th February 2008
Skinning now works, and the fitting flush issue only affected the first batch of carts.
Review Contents & Index:
Introduction
- Official feature list
Packaging and Contents
- Box Contents
Cart Design
Setting Up & Using
- GUI (OS)
Performance
- Download Play compatibility
- Homebrew Support
Additional Features
Conclusion
Introduction
EDGE, almost completely unknown until it appeared on DX. At first glance it would appear to be strictly a poor clone of the CycloDS, mimicking only the menus and lacking any of the enhanced features. Read on to find out that's not as bad as it sounds.
Official Feature List:
Supports MicroSDHC cards up to 32GB
Plays Commercial NDS ROM
MicroSD support
PDA-style interface
Video/Mp3 playback
Plays Homebrew NDS ROMS
Touch to execute OS system
Works with Moonshell for multimedia playback such as movies and MP3’s
Frequently updated OS for best compatibility
Action Replay compatible cheat system
Brightness adjustment for NDSL
In game reset
Full download play support
Supports slot 2 expansions
Multi language user interface
Save game saves directly to Micro SD
Automatic save game type detection
Supports clean ROMs
Robust non-spring loaded Micro SD slot
Micro SDHC card reader included
Packaging and Contents
The first thing you'll probably notice is the unique packaging. Why did they choose a shape as deadly as the triangle? To protect yourself against DS thieves? Just marketing of course, but I quite like it. The bottom half of the packaging is made of about half an inch of cut cardboard, with a single sheet of much harder cardboard fastened to the top with a single screw. The top sheet of cardboard slides open, and is held closed with a slightly-elastic fabric band. The backside of the packaging gives the very basic instructions on usage.
Box Contents
1x EDGE slot-1 cart
1x MicroSDHC card reader
No freebies here. Inside contains the EDGE cart and your standard TF card reader (SDHC compatible). Both are held very securely by the cardboard cutouts.
Cart Design
Currently only available in black, the label has a slight rough quality to it, and isn't reflective or glossy like most cart stickers we've been seeing.
After sufficient pawing and attempted bending of the cart, the EDGE shows itself as one of the more sturdy. It feels solidly built, moreso than any other slot-1 solution I've had the chance to play with. Running you finger over the label you can feel a slight bump from a chip concealed underneath, although to a lesser extent than the one present on the Supercard DS One and earlier DSTopToy. This doesn't seem to add to the resistance at all; it slides into the DS almost as smoothly as a commercial game card.
Unfortunately, two of the three units I've received have a very noticeable defect. The MicroSD won't fit flush in its springless slot. In those two units, the MicroSD sticks out about 3mm from the top of the EDGE, while on the third it only sticks out about half a millimeter. While aesthetics-wise this would seem like a no-no, it actually makes MicroSD card alot easier to remove (when compared to the M3DS Real) while still holding it fast. Nonetheless, I hope this gets fixed in future batches (or was only present in mine).
The internals. Under the sticker (which is easily peeled off and reattached) is three screws.
Setting Up & Using
Setup is as simple as downloading the firmware from the EDGE website and placing it on your MicroSD card. The team claims compatibility with MicroSDHC cards up to 32Gb, but I currently don't have any to test with, so I'll be using 1Gb and 2Gb Kingston Japan cards.
The firmware consists of an "EDGE.dat" file, and an "EDGE" folder. Inside the folder is a "cheat.dat" that contains cheat codes, and a "config.xml" that is generated after first boot and stores all your settings. At first boot you will be presented with a language selection screen, which presents: English, Bahasa Indonesia, Tagalog, Chinese, Korean, as language options.
GUI (OS)
Like most slot-1 cards, the DS will jump right to loading the EDGE menu regardless of which settings you have set on your DS. From completely off to the menu takes about 8 seconds, 4 seconds after the health screen disappears.
Once loaded, the main menu presents four buttons to you. One of the things I like about the EDGE is that everything is accessible with both the touch screen and buttons. The buttons (in order) are:
"Games / Homebrew", which takes you to a list of games on your card.
"Media", which boots moonshell.nds in the moonshl folder.
"Settings / Misc", which lets you adjust the settings and activate PassMe mode.
The game list is where the EDGE really excels. Only .nds files will be displayed, alphabetically, folders are supported and can be hidden. Pressing the 'X' button (or tapping the "View: " text) will cycle through three display modes. ROM view will display the game's icon next to the game name (from the database) and publisher. File view will display the game's icon next to the file's name and size. List view will just display the file name without any icon. ROM and file view will show 4 games per page, while list view will show 10. 'L' and 'R' will go back and forth by page respectively. Pressing 'A' on the game (or tapping it) will load it, and 'B' (or tapping the top folder icon) will bring you back to the main menu.
Now the great thing about the EDGE's menu, is how snappy and responsive it is. Even with ROM or file view active, there is no lag or delay when navigating through. It supports key repeat, and will speed up after you've held it for about a second. Holding the stylus near the top or bottom of the screen will also scroll the list.
Blurry blur is blurry. Demo of the interface using the stylus. When the menu doesn't go the first time, it's because I didn't press hard enough. No sound.
The settings menu contains options to enable or disable cheats (more detail on this in the "Additional Features" portion of the review), toggle through 4 brightness settings, switch the language, cycle through skins, boot the slot-2 in NDS mode (PassMe), and return to the main menu. Like the other menus, this can be navigated with either the buttons or stylus, pressing 'A' or tapping will activate the respective settings.
The top screen is unused, and just displays a static image.
Performance
All tests were conducted with a 1Gb Japanese Kingston and EDGE OS v1.03
ROM compatibility seems to be 100%. 20/20 games ran perfect. Only noticeable mentions are that Contra 4 and Advance Wars: Days of Ruin both run flawlessly. Commercial ROMs take 3-4 seconds to load.
Download Play Compatibility
From testing, it appears all or most games are working great with download play.
42 All-Time Classics/Club House Games
- PASS
Bleach 2nd
- PASS
Mario Kart DS
- PASS
Metroid Prime Hunters
- PASS
Moero! Nekketsu Rhythm Damashii Osu! Tatakae! Ouendan 2
- PASS
New Super Mario Bros.
- PASS
Tetris DS
- PASS
The Legend of Zelda - Phantom Hourglass
- PASS
Worms - Open Warfare 2
- PASS
Homebrew Support
Auto-DLDI patching works great.
3 in 1 ExpPack Tool
- PASS
DSliver
- PASS
DSOrganize 3.2
- PASS
MegaETk 1.03 (nofat)
- PASS
NetHackDS 1.17
- PASS
Pocket Physics 0.3
- PASS
POWDER 100
- PASS
SneMulDS 0.6
- PASS
Warcraft: Tower Defense
- PASS
Win2DS Fusion
- PASS
Saving
The EDGE cart uses the 512k save for all games. The saves are identical to (and compatible with) the saving system that the R4, DSTT, and any other flashcarts that use forced 512k saving.
Additional Features
Auto-DLDI Patching
Works fine. See "Homebrew Support" under the "Performance" section of this review.
Boot to slot-2 (PassMe mode)
Works fine. This will allow you to boot any slot-2 flashcart in DS mode. Not compatible with commercial GBA carts.
Language Support
English, Indonesian, Tagalog, Chinese, and Korean are all supported by the EDGE, and can be cycled through from the settings menu. I can only read English, but it appears that all 5 languages are integrated into every menu. Game names and cheats will be displayed in the language they were transferred over.
Soft Reset
Works with 20/20 games tested. Press A+B+X+Y+L+R to go back to the game list.
Skinning
Probably the biggest disappointment when testing the EDGE. While skinning support is listed as a feature, it doesn't work. Instructions are even listed in the online menu! Supposedly, the EDGE is compatible with all CycloDS skins. Placing them in the correct folders does nothing, and tapping the "Skins" option in the settings menu does nothing. I hope this gets fixed in a future software revision.
Update:
With the release of OS v1.31, skinning support has been enabled. You can place any number of skins (each in their own folder) in the "EDGE/skins" directory, and cycle through them via the Settings/Misc menu.
Cheat Support
Once enabled from the settings menu, a dialogue will pop-up every time you load a game that has cheats available in the database. Yes, every time. There is currently no way to disable this (aside from turning off cheats altogether), although it is only mildly annoying. Selecting "Yes" will bring you to the cheat menu, which is similiar to those found in other carts. Button support works fine, but I find that you are unable to scroll the cheat list with the stylus without activating/deactivating the cheats scrolled over. While it does remember which cheats you have selected from the last time, once again you must go through this menu every time you load the game with cheats.
Conclusion
I'll keep this short and sweet. The EDGE team appeared virtually out of nowhere. People were skeptical. It looked like a CycloDS clone (and is to a point). In the end, it is a great little cart with a fantastic GUI. Cheap, ROM compatibility is perfect, download play, cheat support, MicroSDHC support. A few things hold it back, such as the currently broken skinning, and a few annoying flaws in the menus. Quality control will be something to watch and only time will tell if my 'MicroSD fitting flush' issue is widespread. Overall, I think I would recommend this as the best in the sub-30USD price range.
Cons- MicroSD may not fit flush on units from first batch- Can't disable "Do you want to enable cheats?" prompt while cheats are enabled- Stylus doesn't work correctly in cheat selection menu- No software CD
This review was written for GBAtemp.net ONLY. The article and all included photos are property of GBAtemp.net
If you see this review on any other site please let the admin know via e-mail - shaunj66 [@at@] GBAtemp [.dot.] net
EDGE, almost completely unknown until it appeared on DX. At first glance it would appear to be strictly a poor clone of the CycloDS, mimicking only the menus and lacking any of the enhanced features. Read on to find out that's not as bad as it sounds.
EDGE, almost completely unknown until it appeared on DX. At first glance it would appear to be strictly a poor clone of the CycloDS, mimicking only the menus and lacking any of the enhanced features. Read on to find out that's not as bad as it sounds.
i have both EDGE and iEDGE. i've had the EDGE on my DSphat for more than 4 years now, and it's had at least 3 different microSD fail on it. i've had the iEDGE for a little over 2 years, and it's still working great.
the only real problem with this brand was the sharp decline of updates. they've only recently been back, but updates are few and far between. maybe the staff downsized from a team to 1 guy doing all the legwork? haha, who knows.
but yeah, back in its heydays, compatibility was the best selling point for this.
Since its launch in 2017, the Switch has been lacking one particular feature that is available on pretty much every other modern device these days: A simple web browser. Shortly after it's release, it...
Super Mario Advance 4 is an enhanced remake of the NES game Super Mario Brothers 3, released for the GBA. The NES original, and its SNES remake which this shares something of a codebase with, is often...
|
{
"pile_set_name": "Pile-CC"
}
|
Bệnh thần kinh do rượu
Nhiều người không biết rượu có thể gây hại như thế nào. Nhiều người nghiện rượu nặng phải đối mặt với vấn đề rất lớn là bệnh thần kinh do rượu, bắt đầu bằng cảm giác đau và ngứa ran ở tay chân. Hiện tượng này do các dây thần kinh ngoại biên truyền tín hiệu giữa cơ thể, tủy sống và não đã bị tổn thương do uống quá nhiều rượu.
Uống rượu quá nhiều có thể làm thiếu hụt các chất dinh dưỡng cần thiết như thiamine, folate, niacin, vitamin B6 và B12, và vitamin E, tất cả đều cần thiết cho các chức năng thần kinh, khiến lan truyền bệnh thần kinh do rượu. Để điều chỉnh và khôi phục các chất dinh dưỡng này đến mức phù hợp thì chỉ có cách kiêng rượu. Chúng ta sẽ thấy sự cải thiện các triệu chứng của bệnh thần kinh do rượu và ngăn ngừa bất kỳ tổn thương thần kinh nào khác. Thật không may, một số tổn thương thần kinh có thể tồn tại vĩnh viễn.
Nguyên nhân gây bệnh thần kinh do rượu?
Các dây thần kinh ngoại biên trong cơ thể giúp chúng ta quản lý chức năng cảm giác và vận động quan trọng như: đào thải các chất độc; đi lại; kích thích tình dục; cử động tay và chân và khả năng nói. Nghiện rượu nặng, mạn tính thường dẫn đến tổn thương các dây thần kinh này, gây bệnh thần kinh do rượu. Ngoài ra, các vấn đề về dinh dưỡng cũng có thể gây tổn thương thần kinh hoặc tăng mức độ tổn thương do uống rượu.
Các triệu chứng tàn phá của bệnh thần kinh do rượu
Những người mắc bệnh thần kinh do rượu thường bị ảnh hưởng đến chuyển động và cảm giác. Các triệu chứng họ gặp phải có thể từ khó chịu nhẹ đến đau không chịu nổi. Khiến chất lượng cuộc sống giảm, mặc dù tình trạng này không được coi là đe dọa đến tính mạng.
Các vùng cơ thể bị ảnh hưởng bởi bệnh thần kinh do rượu bao gồm:
• Tay và chân.
- Tê.
- Ngứa ran.
- Cảm giác châm chích.
- Co thắt cơ bắp và chuột rút.
- Yếu cơ và teo.
- Mất chức năng cơ bắp.
- Rối loạn chuyển động.
• Hệ bài tiết.
- Không tự chủ
- Táo bón
- Tiêu chảy
- Khó tiểu
- Cảm thấy bàng quang đã không được làm trống hoàn toàn.
• Những ảnh hưởng khác.
- Rối loạn chức năng tình dục.
- Bất lực.
- Khó nói .
- Khó nuốt.
- Không có khả năng chịu nhiệt, đặc biệt là sau khi tập thể dục.
- Nôn và buồn nôn.
- Chóng mặt hoặc nôn nao.
Nếu phát hiên bản thân có bất kỳ dấu hiệu hoặc triệu chứng của bệnh thần kinh do rượu hãy gọi bác sĩ ngay lập tức. Đó là chìa khóa để điều trị tình trạng này ngay lập tức và ngăn chặn không để xảy ra những thiệt hại nặng nề hơn.
Chẩn đoán bệnh thần kinh do rượu
Nếu lo lắng rằng bản thân đang gặp phải các triệu chứng của bệnh thần kinh do rượu, chúng ta nên liên hệ với bác sĩ, người sẽ kiểm tra và đưa ra chẩn đoán xác định. Điều quan trọng là chia sẻ trung thực về sự thật tình trạng uống rượu cho bác sĩ, điều này giúp chẩn đoán chính xác, loại trừ các nguyên nhân tiềm ẩn của triệu chứng.
Các xét nghiệm được sử dụng để xác định các nguyên nhân tiềm năng khác của bệnh thần kin.
• Sinh thiết thần kinh.
• Xét nghiệm dẫn truyền thần kinh.
• Chỉ số đường huyết và ruột non.
• Kiểm tra thần kinh.
• Điện cơ.
• Nội soi thực quản.
• Xét nghiệm chức năng thận, tuyến giáp và gan.
• Xét nghiệm máu xác định thiếu hụt vitamin.
Những chất dinh dưỡng quan trọng này thường liên quan đến bệnh lý thần kinh ở người nghiện rượu mạn tính: niacin, thiamine, Folate, vitamin B6 và B12, biotin và axit pantothenic, vitamin E và A.
Điều trị bệnh thần kinh do rượu
Nếu gặp triệu chứng bệnh thần kinh do rượu, việc đầu tiên cần làm là NGỪNG UỐNG. Ngừng uống rượu thường đòi hỏi sự giúp đỡ của chuyên gia cai nghiện trong giai đoạn điều trị đầu tiên.
Ngay khi vấn đề về rượu đã được giải quyết, bác sĩ sẽ bắt đầu tập trung vào bệnh lý thần kinh. Bác sĩ sẽ đưa ra các lựa chọn xử lý triệu chứng, giúp bệnh nhân tìm thấy sự nhẹ nhõm để có thể thực hiện các chức năng hàng ngày bình thường và giảm nguy cơ chấn thương.
Mỗi bệnh nhân được điều trị theo nhu cầu cá nhân, thường thì điều trị bằng cách sử dụng một hoặc nhiều loại chăm sóc sau:
Bổ sung vitamin có thể cải thiện sức khỏe thần kinh. Folate, thiamine, niacin và vitamin B6, B12 và E thường được khuyên dùng.
• Thuốc kê dơn có thể được sử dụng để giảm đau. Các bác sĩ thông thường sẽ kê đơn thuốc chống trầm cảm và thuốc chống co giật để giảm bớt sự khó chịu.
• Thuốc giảm đau khác mà không cần kê đơn có thể giúp bệnh nhân tìm thấy sự giảm bớt các triệu chứng.
• Vấn đề bài tiết cũng có thể được điều trị bằng thuốc, tuy nhiên một số được yêu cầu đặt ống thông tiểu.
• Vật lý trị liệu có thể giúp bệnh nhân bị teo cơ.
• Dụng cụ chỉnh hình thường được sử dụng để ổn định tứ chi.
• Thiết bị an toàn thường được sử dụng để ngăn ngừa thương tích. Bệnh nhân có thể cần kiểm tra bàn chân và bàn tay thường xuyên để tìm ra thiệt hại.
• Tất đặc biệt, tiêu thụ thêm muối và nâng cao đầu khi ngủ có thể giúp ngăn ngừa chóng mặt ở một số bệnh nhân.
Tiên lượng của những người mắc bệnh thần kinh do rượu là gì?
Thật không may, tổn thương thần kinh vì bệnh thần kinh do rượu thường là vĩnh viễn và nếu bạn tiếp tục uống, các triệu chứng sẽ chỉ trở nên tồi tệ hơn. Nhiều người được chẩn đoán mắc chứng suy nhược thần kinh do rượu, đau mạn tính và tổn thương ở tay và chân.
Tuy nhiên, khi bệnh thần kinh do rượu được phát hiện sớm, các triệu chứng có thể giảm và ngăn ngừa thiệt hại thêm. Bằng cách bỏ rượu và bắt đầu một chế độ ăn uống dinh dưỡng hơn sẽ giúp phục hồi.
Trực tiếp tư vấn và điều trị nghiện rượu, nghiện heroin, trầm cảm, lo âu, rối loạn tâm thần nội sinh hoặc do sử dụng rượu, cần sa, cỏ Mỹ, ma túy đá (nghiện đá, ngáo đá), thuốc lắc, ketamin. Tiến sĩ, Bác sĩ Trần thị Hồng Thu, hiện đang công tác tại Bệnh viện Tâm thần ban ngày Mai Hương - Điện thoại, Zalo, Viber, SMS 0988 079 038
|
{
"pile_set_name": "OpenWebText2"
}
|
Neonatal exposure of female ferrets to testosterone alters sociosexual preferences in adulthood.
Sociosexual preferences in adult female ferrets, as measured in a choice arena, were altered by neonatal exposure to exogenous testosterone. Adult female ferrets showed a preference for males which did not depend on the presence of gonadal steroids, because gonadectomized and gonadectomized estrogen-treated females showed identical preferences for males. Adult castrated males showed no preference for females unless these males were treated with testosterone. A similar no-preference pattern was found in adult females that had received testosterone neonatally. Females exposed neonatally to dihydrotestosterone or estradiol exhibited the normal females' male-oriented preference. These results indicate that testosterone secreted by the testes in the developing male may interrupt the phenotypic female development pattern and hence prevent the emergence of a homosexual preference in adulthood in the male ferret.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Ask HN: Best way to find front-end/UI developers? - capkutay
My company has spent some time trying to recruit front-end and UI developers in the Bay Area. We want to spend at least another month searching before we go through a recruiter.<p>Does anybody have any advice as to which job sites work best specifically for finding front-end/UI devs? dice.com? stackoverflow.com? Thanks! Ping me if you have any other ideas.<p>john@webaction.com
======
zinssmeister
A good front-end/UI engineer is in general hard to find, because these
individuals ideally need to live at the intersection of development and
design. You should also consider searching <http://dribbble.com/> for
engineers with design/UI interest. Another good destination would be to post a
job at <http://jobs.37signals.com> and make sure you have the right job
description. Good front-end guys/girls are usually looking for specific
requirements in a job post, to make sure their potential employer is aware of
their unique position within the technology stack. Feel free to reach out to
me if you wanna know more...
------
mnicole
I'm going to piggyback onto this and hopefully get a good collective together.
As someone that mostly fits this description I've been trying to find similar
folks on Dribbble to add to my Developer inspiration list
(<http://dribbble.com/mandynicole/lists/4584-Developers>). If you have an
account and fancy yourself a dev/designer combo (or even just a dev with a
Dribbble account), let me know so I can add you!
~~~
capkutay
Thanks! I am a dev but not a designer. Just created a dribbble account and
added you!
------
michaelpinto
You might really be looking for two people: Separate out the UI from the
front-end development. Yes there are some people who can do both tasks well,
but even then they tend to be stronger on one side than the other.
Also in the Bay Area there would be a ton of competition, so you may want to
broaden your geographic scope (or even recruit people to come to the Bay Area
if you hit a wall).
------
whichdan
I maintain a small ad-free site that links to a bunch of job boards[1]. There
are definitely a few good sites out there.
You can also wait until tomorrow morning and post in the monthly WhoIsHiring
thread.
[1] <http://careers.sh>
|
{
"pile_set_name": "HackerNews"
}
|
603 F.2d 1310
102 L.R.R.M. (BNA) 2128, 86 Lab.Cas. P 11,520
The PROCTER & GAMBLE MANUFACTURING COMPANY, Petitioner,v.NATIONAL LABOR RELATIONS BOARD, Respondent,Association of Employees of the Procter & GambleManufacturing Company's St. Louis Plant,Intervenor-respondent.
No. 78-1716.
United States Court of Appeals,Eighth Circuit.
Submitted March 12, 1979.Decided Aug. 23, 1979.
Harold S. Freeman of Dinsmore, Shohl, Coates & Deupree, Cincinnati, Ohio, argued and Michael S. Glassman, Cincinnati, Ohio, on appendix and briefs, for petitioner.
Edward S. Dorsey, Atty., N. L. R. B., Washington, D.C. argued, and Andrew E. Tranovich, Atty., John S. Irving, Gen. Counsel; John E. Higgins, Jr., Deputy Gen. Counsel; Robert E. Allen, Acting Assoc. Gen. Counsel; and Elliott Moore, Deputy Assoc. Gen. Counsel, Washington, D.C., on brief, for respondent.
Before LAY, ROSS and McMILLIAN, Circuit Judges.
McMILLIAN, Circuit Judge.
1
The Procter & Gamble Manufacturing Company (the Company) petitions this court, pursuant to § 10(f) of the National Labor Relations Act, 29 U.S.C. § 151, Et seq., (the Act) to review a decision and order of the National Labor Relations Board (the Board). The Board affirmed the rulings and findings of the Administrative Law Judge (ALJ) and adopted her recommended order.1 The decision and order found that the Company violated § 8(a)(5) and (1) of the Act by refusing to comply with a union request for job evaluation information, where the requested information was needed by the union to evaluate whether to pursue salary-related grievances to arbitration. The Board ordered the Company to turn over the disputed information, post compliance notices, and cease and desist from like or related practices. The Board, pursuant to § 10(e) of the Act, cross-appeals for enforcement of its order. On October 24, 1978, we permitted the Association of Employees of the Procter & Gamble Manufacturing Company's St. Louis plant (the Union) to intervene in these proceedings.
2
We find that there is substantial evidence on the record as a whole to support the Board's decision, and, accordingly, deny the petition for review and order enforcement of the order.
3
Since 1937, the Union has been the exclusive representative for the bargaining unit of production and salaried office clerical employees at the Company's St. Louis plant. The present controversy arose in June, 1976, when two clerical employees filed separate written grievances alleging discrimination in job evaluation. Both employees alleged that their duties and job descriptions were the same as higher job classifications but both were classified in lower salary ranges.
4
The parties' collective bargaining agreement contains two sections relevant to this case. Article III, § 6, permits the Job Evaluation Representative, a representative of the Union, to be heard before and after the evaluation or reevaluation of a job, but not to sit in on the evaluation itself. It also permits the Union representative to present his views concerning the job descriptions and evaluations, but does not permit him to participate in the actual rating. Finally, this section provides that the employer will train the Union representative in the theory and practice of job evaluations. Article VIII of the agreement provides for a four-step grievance procedure covering any matter involving The interpretation or application of any provision of the agreement, or any matter affecting the employee in respect to work, wages or working conditions, culminating in final and binding arbitration. (Emphasis added).
5
Since 1940 the Company has had a job evaluation plan. Although the agreement refers to job evaluation, the provisions of the job evaluation plan are not specifically set forth in the agreement. The job evaluation plan is a complicated, highly sophisticated plan used by the Company to determine job classifications and salaries. The job evaluation committee determines the salary range for each position. The committee is chaired by the Company's personnel manager, who appoints four other department heads. When a job is to be evaluated or reevaluated, the five management representatives rate each of eight factors on a one to ten scale: (1) complexity; (2) experience and training; (3) contact with others; (4) dexterity; (5) concentration; (6) accuracy; (7) working conditions; and (8) responsibility. After rating each factor, the management representatives refer to a ladder chart which contains a breakdown of where each job falls within the ten point spread for each of the eight factors.
6
After the management representatives have rated a factor, the points for that factor are averaged and the average for each factor is multiplied by a weighted percentage factor. The weighted points for each of the eight factors are then totalled and placed in a rate group based upon the total points. There are seven pay groups for the salaried jobs Groups A to G. Each group has a different wage range. The seven pay groups have a one hundred point spread. If a job falls near the top of the point range, and additional duties are added so that when the job is evaluated or reevaluated the total points go into the point range of the next pay group, the job will receive higher wages.
7
Although the Union representative is permitted to attend job evaluations and reevaluations, he does not have a copy of the twenty-page job evaluation manual, does not have copies of the job descriptions, and does not have copies of the summary sheets or the ladder charts. The Union's representative is neither given anything in writing nor permitted to take notes. Nor, because of the Company's policy that rating factors and point information are confidential, is the Union's representative permitted to make copies of this material or to disclose any information received pertaining to the job evaluations to any other person, including the members of the grievance committee.
8
Both grievances filed by the two employees proceeded along parallel paths through the four-step grievance procedure. At each step the Company denied each grievance. Upon receipt of the fourth-step answer or denial, the Union's grievance committee asserted that it was unable to decide whether to recommend that these grievances go to arbitration. Consequently, it turned over all the information it had on file to the Union's attorney, who also was an industrial engineer, with extensive experience in job evaluations. After the Union's attorney had reviewed the files, he requested from the grievance committee chairperson other information and documents that he considered necessary to evaluate the merits of the grievances.
9
Being unable to obtain the sought after information from the chairperson, the attorney drafted a letter for the chairperson's signature and mailed it to the plant manager. After informing the Company that the requested information was necessary in order to evaluate the grievance and to decide whether to process it for arbitration, the letter requested copies of the applicable job evaluation manual, which set forth the rating procedure, the rating factors, factor definitions, current job descriptions for clerk positions and any changes in job descriptions in the previous five years; the original evaluation sheet; the original reevaluation comparison sheet for those positions and fact breakdowns for the past three years; the most recent rating sheets used by the evaluators in reevaluating these positions; and the point spread for each rate group.
10
In response to the Union's request, the Company, after a reference to Article III, § 6, of the agreement, replied that the Company would be happy to meet with the Union representative and answer questions. The Company further directed the Union representative to contact the job evaluation plan chairperson to arrange a meeting.
11
Upon the receipt of the Company's reply, the Union filed an unfair labor charge, alleging a § 8(a)(5) and (1) violation of the Act by the Company's refusal to furnish the requested information.
12
The Board found that the Union had a statutory right to the requested information, because it was relevant to the Union's role as bargaining representative; that each requested document was an integral part of the job evaluation scheme which concerns the compensation of bargaining unit employees and was directly relevant to the Union's evaluation whether to submit the grievances to arbitration; and that no waiver of the right of access to this job evaluation information occurred. The Board further found that the Company's obligation to furnish the requested information was not fulfilled by its offer to meet and answer questions because (1) the job evaluation representative was not a member of the grievance committee, and (2) the job evaluation representative was prohibited from releasing most of the information to anyone.
13
The question for decision is whether substantial evidence on the record as a whole supports the Board's finding that the Company violated § 8(a)(5) and (1) of the Act by refusing to supply requested relevant job evaluation information that was needed by the Union to pursue a salary-related grievance to arbitration.
14
The duty to bargain in good faith requires an employer to furnish information that the bargaining representative needs for the proper performance of its duty. A failure to so provide constitutes a refusal to bargain in violation of § 8(a)(5) and (1) of the Act. NLRB v. Acme Industrial Co., 385 U.S. 432, 435-36, 87 S.Ct. 565, 17 L.Ed.2d 495 (1967); NLRB v. Truitt Mfg. Co., 351 U.S. 149, 151-54, 76 S.Ct. 753, 100 L.Ed. 1027 (1956). This obligation extends to the Union's need for information during the administering and policing of a contract as well as during contract negotiations. NLRB v. Acme Industrial Co., supra, 385 U.S. at 435-36, 87 S.Ct. 565; Western Massachusetts Electric Co. v. NLRB, 589 F.2d 42, 46 (1st Cir. 1978); Puerto Rico Telephone Co. v. NLRB, 359 F.2d 983, 986 (1st Cir. 1966). To refuse to furnish such relevant information violates the Act, irrespective of the employer's good or bad faith, because it conflicts with the statutory policy to facilitate effective collective bargaining. Curtiss-Wright Corp. v. NLRB,347 F.2d 61, 68 (3d Cir. 1965); Accord, NLRB v. Ramona's Mexican Food Products, Inc., 531 F.2d 390, 394 (9th Cir. 1975).
15
Information pertaining to the wages, hours and working conditions of employees in the bargaining unit is so intrinsic to the core of the employer-employee relationship that it is considered presumptively relevant. San Diego Newspaper Guild v. NLRB, 548 F.2d 863, 867 (9th Cir. 1977); Accord, Teleprompter Corp. v. NLRB, 570 F.2d 4, 8 (1st Cir. 1977); NLRB v. Western Electric, Inc., 559 F.2d 1131, 1133 (8th Cir. 1977); Curtiss-Wright Corp. v. NLRB, supra, 347 F.2d at 69. When dealing with such information for bargaining unit employees, the Ninth Circuit held in San Diego Newspaper Guild that the employer had the burden of proving a lack of relevance. 548 F.2d at 867. See also Prudential Insurance Co. v. NLRB, 412 F.2d 77, 84 (2d Cir.), Cert. denied, 396 U.S. 928, 90 S.Ct. 263, 24 L.Ed.2d 226 (1969). Moreover, as to this type of information, the union is not required to show the precise relevancy of the requested information to particular current bargaining issues. Teleprompter Corp. v. NLRB, supra, 570 F.2d at 8, Citing Boston Herald-Traveler v. NLRB, 223 F.2d 58, 63 (1st Cir. 1955). And, as the Supreme Court stated in United Steelworkers v. Warrior & Gulf Navigation Co., 363 U.S. 574, 581, 80 S.Ct. 1347, 1352, 4 L.Ed.2d 1409 (1960), "(t)he grievance procedure is . . . part of the continuous collective bargaining process."
16
In determining whether an employer is obligated under the statute to supply particular information, the Board need only find a probability that the desired information is relevant and that it will be of use to the union in carrying out its statutory duties and responsibilities. NLRB v. Rockwell-Standard Corp., 410 F.2d 953, 957 (6th Cir. 1969), Citing with approval NLRB v. Acme Industrial Co., supra, 385 U.S. at 437, 87 S.Ct. 565. The Supreme Court in Acme Industrial noted that the relevancy issue should be determined under a "discovery-type standard," 385 U.S. at 437, 87 S.Ct. 565, not a trial-type standard; hence, a broad range of potentially useful information should be allowed to the union for the purpose of effectuating the bargaining process, unless it is clearly irrelevant. Once relevance is established, a refusal to furnish the requested information is per se a violation of the Act. C-B Buick, Inc. v. NLRB, 506 F.2d 1086, 1091 (3d Cir. 1974); Curtiss-Wright Corp. v. NLRB, supra, 347 F.2d at 69.
17
What is or is not relevant depends on the particular facts in each case. E. g., NLRB v. Pearl Bookbinding Co., 517 F.2d 1108, 1113 (1st Cir. 1975). Accordingly,
18
the Board's determination as to whether the requested information in a particular case is given great weight by the (Court) either because it is a question of fact, which is conclusively supported by substantial evidence . . . , or because it is a finding on a mixed question of law and fact which is within the peculiar expertise of the Board.
19
San Diego Newspaper Guild v. NLRB, supra, 548 F.2d at 867 (footnotes omitted). Using this liberal standard of presumptive relevance as a guideline, we hold that the Board could properly conclude that, because the requested information concerned the compensation of bargaining unit employees and was needed to evaluate whether to arbitrate grievances alleging discriminatory job evaluations, the Company breached its statutory duty by failing to provide such relevant information.
20
Even the Company does not deny that a grievance can be filed over the results of a job evaluation. The Company argues, however, that the job evaluation program is not subject to arbitration because job evaluation does not involve an application or interpretation of any provision of the bargaining agreement in that the Company's job evaluation plan is not incorporated in the agreement. The Company further cites us to our case of Brown v. Sterling Aluminum Products Corp., 365 F.2d 651 (8th Cir. 1966), Cert. denied, 386 U.S. 957, 87 S.Ct. 1023, 18 L.Ed.2d 105 (1967), for the proposition that the arbitration clause in the agreement limits arbitration to questions involving the application or interpretation of provisions of the agreement. From this the Company concludes that if its job evaluation plan is not included in the agreement, but rather is a separate plan, then there is no obligation to submit disputes regarding the plan to arbitration. Our present case is distinguishable, because in the Brown case we found that there was "No agreement contained in the collective bargaining contract to submit any question of interpretation of the contract to arbitration, nor (was) there any agreement (in the contract) to settle disputes thereunder by submission to an arbitrator or some other board." 365 F.2d at 658. Because of this we said there was a fatal defect in the contract. Id. Here, however, compulsory arbitration is provided for in Article VIII of the agreement.
21
Nor do we find United Steelworkers v. General Steel Industries, Inc., 363 F.Supp. 840 (E.D.Mo.1973), Aff'd in part and rev'd in part, 499 F.2d 215 (8th Cir. 1974), apposite. In General Steel Industries we held that grievances were arbitrable even though the insurance, pension and supplemental unemployment benefits were contained in agreements separate from the bargaining agreement. 499 F.2d at 218, 219. We also noted that the grievances involved not only the plans but also the interpretation of provisions of the agreement. In the present case, the agreement provides for job evaluation, in Article III, § 6, and further provides that neither the Union nor the Company will discriminate against any employee. Article I, § 8, p. 7. Here, both grievances alleged discrimination in job evaluations, and discrimination against the grievants was discussed in Steps 3 and 4 of the grievance procedure. Thus, whether the two grievants were discriminated against in the evaluation of their jobs in relation to other clerical jobs is a matter, in our opinion, that involves the interpretation of provisions of the agreement.
22
In any event, the sole purpose of the Company's job evaluation plan is to determine the salary range for each clerical position by placing each position into one of seven lettered categories. The placement of a clerical position into a lower instead of a higher lettered category causes a salary differential. When the two grievants filed grievances contending that their positions were improperly placed in a lower lettered category than each employee thought appropriate, in effect they were contending that the Company was not paying them enough money for the work they were performing. To determine whether to submit these grievances to arbitration, the Union needed the requested information to determine whether, as the grievants contended, the duties they performed were similar to other clerk positions which were placed into a higher grade.
23
The job evaluation manual is relevant because it explains the operation of the job evaluation plan, including the factors used to evaluate clerical positions, the definition of these factors, and the weight assigned to each factor. The current job descriptions for departmental clerks are needed to compare duties with those duties performed by the grievants. The changes to the departmental clerks positions are needed to determine whether any additional duties or responsibilities were added to these positions resulting in their being placed into a higher letter category and when reevaluations are deemed necessary. The original evaluation sheets, reevaluation comparison sheets, summary sheets, and the most recent rating sheets are needed to determine possible discrepancies in evaluating the positions and to compare how the members of the evaluation committee evaluated similar job duties found in the job descriptions of the two grievants and the higher-evaluated departmental clerk positions. Finally, the point spread for each lettered category is needed to assess whether the jobs of the two grievants are so near the breakpoint that one evaluation factor might place it into a higher salary range.
24
We attach no merit to the Company's assertion that the information sought was available from other sources. True, the employees were permitted to see their own job descriptions on request, but they were not allowed to have a copy. Similarly, the Union's grievance committee is permitted to see only the grievants' job descriptions, but they are not allowed to have copies or to see the job descriptions for any alleged positions having similar duties but in a higher lettered category. The grievance committee is permitted neither to see the job evaluation manual, the evaluation sheets, the summary sheets, the rating sheets, the ladder chart, the spread for each letter category, nor any of the other requested documents. None of the requested documents is in the possession of the job evaluation representative, the grievance committee or any other union member. Even the Company admits that copies of the requested document can only be obtained from it, and stipulated that duplication of the requested documents would not be burdensome. By the Company withholding this requested information, the Board could have reasonably assumed that it did so either to force the Union to abandon the two grievances, and thereby risk a breach of its duty of fair representation or to force the Union to take the grievances all the way through to arbitration without an opportunity to evaluate the merits of the claim. "Nothing in federal labor law requires such a result." NLRB v. Acme Industrial Co., supra, 385 U.S. at 438-39, 87 S.Ct. at 569.
25
We reject the Company's argument that it had fulfilled its bargaining obligation to the Union by offering to meet with the Union's job evaluation representative and answer questions. As found by the Board, we too find this unresponsive to the Union's request. First, it is the grievance committee, not the Union's representative, which has the obligation on behalf of the Union to evaluate the two grievances and to recommend whether to submit them to arbitration.
26
Simply meeting with the job evaluation representative as offered by the Company will not suffice because the job evaluation representative is permitted only to look at the requested documents, but not to make any copies. In fact, the Union's job evaluation representative is precluded by the Company from taking notes or divulging to anyone the rating process. These restrictions make it impossible for the Union to evaluate the bargaining unit employees' grievances and insure that, even if the Union submits them to arbitration, there would be no way that the Union could sustain its burden of proving that the classification of the jobs of the two grievants was discriminatory. Under these circumstances, the alleged confidentiality of relevant economic data needed for informed bargaining is no defense for the Company's refusal to supply the disputed information. NLRB v. Arkansas Rice Growers Cooperative Ass'n, 400 F.2d 565, 567 (8th Cir. 1968); NLRB v. Frontier Homes Corp., 371 F.2d 974, 979 (8th Cir. 1967).
27
Finally, we hold that the Board properly rejected the Company's argument that the Union was not entitled to the data and information because of a waiver. For there to be a waiver of a right to information, the language used must be clear and unmistakable. Likewise, there must be a conscious relinquishment by the Union, clearly intended and expressed to give up the right. Timken Roller Bearing Co. v. NLRB, 325 F.2d 746, 750-51 (6th Cir. 1963), Cert. denied, 376 U.S. 971, 84 S.Ct. 1135, 12 L.Ed.2d 85 (1964); NLRB v. Item Co., 220 F.2d 956, 958-59 (5th Cir.), Cert. denied, 350 U.S. 836, 76 S.Ct. 73, 100 L.Ed. 746 (1955); See also General Electric Co. v. NLRB, 414 F.2d 918, 923-24 (4th Cir. 1969), Cert. denied, 396 U.S. 1005, 90 S.Ct. 557, 24 L.Ed.2d 496 (1970). Here the Company's defense of waiver is not founded on any clear and unmistakable language in the agreement because there is no express language therein to support its position that the Union had waived its statutory right to the requested job evaluation data and information for purposes of investigating and evaluating grievances. Nor do we find any side agreement wherein the Union waived its statutory right to the disputed information.
28
The Company's reliance upon the 1958 collective bargaining negotiation to support its contract waiver argument is misplaced. First, it must show more than that the Union yielded its initial bargaining position during the 1958 negotiations that it should have all the Company's job evaluation information for all purposes. It must go further to show that the parties intended to limit the Union's statutory right to the information. Yet, at no point in the negotiations did either party even discuss the Union's statutory right to job evaluation information. Likewise, we find no indication in the record that the Union bargained for a concession from the Company in exchange for a limitation on its statutory right to information. Indeed, the selective portions of the transcripts of the 1958 negotiations show nothing more than that the Union believed that a signed bargaining agreement without a contractual right to information was better than continued insistence upon a possible strike to force acceptance of such a provision. E. g., NLRB v. Yawman & Erbe Mfg. Co., 187 F.2d 947, 949 (2d Cir. 1951) (per curiam). Secondly, we find no support for the Company's contention for waiver in the monthly meetings between the parties. From 1946 to 1977, the Union continuously confronted the Company with the necessity of having contractual access to the job evaluation information to review each job evaluation or else only those job evaluations that might be grieved. We have considered at length all the arguments made by the Company to support waiver and find them to be without merit.
29
We have fully considered each of the Company's contentions and find them to be non-meritorious. Accordingly, we deny the Company's petition for review and order enforcement of the Board's order.
30
ROSS, Circuit Judge, concurring.
31
I concur reluctantly in the result reached by the majority opinion. I have grave doubts that the grievances in question are arbitrable and if they are not, this would be a valid defense to the production of the documents requested solely for the purpose of determining whether to arbitrate. However, because the contract does not specifically deny the right to arbitrate grievances of this nature and because of the rebuttable presumption of arbitrability in § 301 type cases, United Steelworkers v. General Steel Industries, Inc., 499 F.2d 215, 219 (8th Cir. 1974), I believe the arbitrator must make the initial decision in this case as to arbitrability. This result, although somewhat unfair, was dictated by the Supreme Court in NLRB v. Acme Industrial Co., 385 U.S. 432, 436-39, 87 S.Ct. 565, 17 L.Ed.2d 495 (1967), where the Court upheld the Union's statutory right to discovery prior to arbitration. If the arbitrator decides that the grievances are not arbitrable, I assume that the Company will then be free to resume its position that information of the type requested need not be made available to the Union in future grievance cases.
1
The Board's decision and order are reported at 237 NLRB No. 110
|
{
"pile_set_name": "FreeLaw"
}
|
The year is 1692. The town is Salem. The mood is dark, since last night, little Abigail Parris died of convulsions and speaking in tongues, the third child to do so in as many days. The people are paranoid, and there's only one logical conclusion for the townsfolk to have come to: there are witches thinning out the population.
The Game
The object of this game, for the townspeople, is to find and kill the witch. The object of the game for the witch is to kill all the townspeople.
Once applications close I will run a random number generator to select the witch and the angel, and an NPC will be killed by the witches.
Someone- probably an NPC- will get all of the townspeople to come into the courthouse, and the accusations will begin. A player, who will be randomly selected or related to the NPC, will start the process by saying something to the effect of "I accuse so and so, on account of they have octagonal ear lobes." Accusations can be much more creative and verbose of course.
The next person can then do one of three things: they can accuse someone else, including the first person, they can defend themselves if they were accused, or they can agree with the first speaker. Each player will be able to speak during the accusation process once, and after the first speaker, whom I will select, it is a free for all. Conversations can be had in the background with other townsfolk at any time of course, just make sure that your character has accused or is planning on it.
Once the mob has decided who they will put on trial, the accused will have an opportunity to speak, and any townsfolk who would like to speak for them, against them, or against the whole ridiculous notion of witchcraft, is welcome to, as many times as they want. Then everyone will vote, in the thread, as to whether they are innocent or guilty.
If the accused is found innocent, then the townspeople will get a week of real time to walk around town and mull things over. If the accused is found guilty, they will be hung or burned, and then the townspeople will have a week to wander around, until night falls.
When night falls, I will contact the witch and the angel. The witch will pick someone to kill, and the angel will pick someone to save. If they pick the same person, then the person will live through a harrowing incident in the night. If they pick different people, then the townsperson will die the next morning. Night will last one or two real life days, and will have no posts in the thread.
The entire process repeats in the morning, until either everyone is dead, or the witch is killed.
At any point characters can converse freeform with one another, and at times when the people are not accusing or trying, there will be time given for freeform RPing around the town.
The Parts
There are three types of people in Salem:The townsfolk: These are nice, normal puritans, just trying to live their lives. The Angel: This is a nice normal puritan, who happens to have the power to save one life each night. They are randomly selected, and no one knows who they are.The Witch: This person might seem like a nice normal puritan, but they have the power to kill one person each night. They are randomly selected, and no one knows who they are, though everyone would love to find out so to end the reign of terror of this supernatural brat.
The Rules
-No GMing. Unless you are the game host, or have worked it out in PMs, don't make other people's characters do stuff.
-All forum and roleplay rules apply
-Keep cursing to a minimum. You're playing as a puritan, what possible reason could they have to swear during a witch trial?
-I don't mind spammy OOC posts too much, but try and keep it to a minimum.
-No double posting. No exceptions.
-One character per player
-Characters can be male or female, but must be human and over the age of 15.
-If you don't post during the accusation part without letting me know in advance, that counts as an accusation against yourself. If you don't post in a fortnight, without telling me that you'll be gone, your character will be killed off. A brief OOC post saying you're sorry you can't post is fine, but something to say you haven't dropped off the face of the internetz.
-If you are the witch or the angel and you don't answer your witch/angel PMs within 46 hours, I will select randomly, if this happens two RP days in a row I will switch the witchiness or angel powers to someone who would probably have the same picking style as you.
-If you are NOT willing to be the witch or angel, PM me when you send in your app.
Applications
Please include the following in your app:
Name:
Age:
Occupation:
Brief Biography:
Picture (can be sim or otherwise):
If you have any questions, feel free to ask.
The humor of a story on the internet is in direct inverse proportion to how accurate the reporting is.
(((ooc: Still trying to decide whether or not I have the time/stamina to join this. If I do, it'll be with the same character from the old Salem thread. However, first I have a question; what pace are you planning for this rp, Furry? How long do you estimate one RP day will last?)))
((Gears: Thank you very much for applying, I will add your character's name to the list!
Atropa: I plan on keeping this fairly small scale [I'd like the RP to actually, y'know, end because the story ends, rather than because it dies], so I'm going to close apps once I have 6 people. I would like it to be fairly quick, so about a week for freeforming in the morning, a week for the accusation process, though I could probably easily be convinced to spread that to three weeks if its nescessary, then a week to two weeks for the trial, as needed, and a week for freeforming in the evening. Then two days for night time.
So a full RP day, from morning to morning would be somewhere between a month and change to a month and a half.
Does that answer your question? I would be more than willing to give extensions if needed, I just don't want this to be completely laconic and have a day take 5 months ala' Sweet 16. It's perfectly fun like that, but I think that a game based RP needs to move a heckuva lot faster than that.))
The humor of a story on the internet is in direct inverse proportion to how accurate the reporting is.
(((ooc: Furry - Yes, that does answer my question perfectly, and it all sounds very reasonable, the amount of players as well as the timeframe. Thank you. Will still have to think about it some more though. )))
In 1692, the largest witch hunt in American history gripped the town of Salem, Massachusetts. 150 people were imprisoned, and twenty executed. The witchcraft hysteria started in late February, when several young girls began acting strangely. On March 1, one of the girls confessed to witchcraft during an interrogation. The witchcraft scare spun out of control for about a year, until Governor William Phips pardoned the remaining prisoners in 1693.
I hate to bump my own thread, but for all of the new people that I've noticed lurking about in the forum, if you're intimidated by the already established, free form, intricate RPs that are active presently, then this one is brand spanking new, and I need four more people to get it started. Don't take this as a knock on the free forms though.
Also, just to point it out, if this goes on schedule it will be nice and short, with six players, mathematically the longest it can take is four and a half months.
The humor of a story on the internet is in direct inverse proportion to how accurate the reporting is.
I can pretend to be 4 more people. What I mean is, I can take the roles of 5 characters, including my own, temporarily, until 4 people will join. That way, the roleplay can run.
With this game that wouldn't work, for the same reason as I cannot have a character. If five out of six characters are held by one person, then statistics say that you will be both the witch and the angel. In addition to that, all of your characters would know who the witch and angel are (if on the off chance gears' character winds up as either one, it won't take a great stretch of the imagination for you to figure it out) and then their accusations and votes would not be based on the character's, but on what people think of you. ("Would he accuse the actual witch? No he wants this to last a while, so maybe he accused the angel? Well, his posts are typically written to center around Character A, so maybe he's particularly important?") And also, if you have 5 characters, your characters would have 5 of 6 votes.
And back when I first posted this in the planning thread, slytherin-girl did say she'd apply, so I'm waiting the polite amount of time to poke her (by my standards of polite, which I have been told are leagues beyond the border of spineless, but whatever).
Quote:
In my opinion, the best "clique" would be a clique where all the members would be overachievers in high school and they would study hard and help each other. That's what high school is about.
Yeah, but that would be a pretty dull RP. Low conflict friendships are (IMO) really hard to make interesting in an RP.
The humor of a story on the internet is in direct inverse proportion to how accurate the reporting is.
Name:Marilla Lambert
Age:32
Occupation:Shoe Maker
Brief Biography:Dear Diary,
It is May 4th of 1692.About 3 days ago my Husband Mattheuw Lambert passed away.He was attempting to get bear for our Supper.My 3 children were very hurt by it but my boy,Michael,did not seemed to be as hurt as the girls.
Picture (can be sim or otherwise):
((OOC: siesiem1, thank you for your app!
I don't want to be a stickler for historical accuracy {actually, I'm not}, but in puritanical Salem, everyone would have had a job to benefit the community, rather than a {to loosely quote a somewhat amusing, somewhat grim diary from the same era different edge of the country} "job of sitting at home with the children, contributing nothing to the general good and eating the fruits of my labors" They really didn't have people whose only job was to be a mother and maintain their own home, such a person would have an orchard or a shop or something to contribute.
Also, if she's 32, in puritanical times, and a widow with kids that still require a mother's attention (reasonable marriage age is 15-19), her husband logically would have died recently, and information about that and her kids reactions to it should be in her bio. Or if he died a long time ago, then why she didn't have kids until so late.
But thank you for the app, and I will add you to the list now!))
The humor of a story on the internet is in direct inverse proportion to how accurate the reporting is.
Name: Alvina CobyAge: 17Occupation: Helps out on parent’s farmBrief Biography: Alvina (Alvy) Coby is daughter to Jonathon and Shelia Coby, sister to Derick. She lives a few miles out from the village and helps at her parents farm. Her mom has managed to find a man who is interested at courting her and she will be his fiancée soon enough (even though she despises him). But most girls her age are already wed and she finds herself lucky enough that she made it this was far without anyone interested in her. She is quite a looker with her long, wavy black hair and dark brown eyes. Her friends say she has a baby face but she is far from innocent. Ever since she somehow tagged along with her brother to school, she fell in love in love with learning and reading. Alvy secretly “borrows” her brother books and taught herself many things. She is highly intelligent and quite cunning but tries not to let it show. Especially since all these witch accusations have started. Alvy loves children and is stricken by what has happened, her cousin being one of the children who have died. She is determined to find out who is the witch to prevent more innocent people from being killed.Picture (can be sim or otherwise): Still looking for it. Will be up soon :D
((Is this alright?? It seems really cool and I can’t wait for it to start!))
Thanks for your app AnnalyneHopes. I'm pretty sure that this RP is dead, since of the four people who have applied, one is known to be off of the RP forum (gears), one hasn't posted in the RP forum since the end of july and when they did they painted themselves out as an epic git and sent me several nasty and/or stupid PM (siesim1). So there's two to three players presently, and as I said above, this will start when there are 6 apps, but they do have to be from people who are here. If I get 4 more apps I will find out if siesim is still interested, but I don't forsee this getting 4 more apps any time in the near future.
If it does though, then I'm pretty darned excited to start this myself since its been what, half a year since I put this up?
The humor of a story on the internet is in direct inverse proportion to how accurate the reporting is.
|
{
"pile_set_name": "Pile-CC"
}
|
#
# DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
#
# Copyright (c) 2009-2013 Oracle and/or its affiliates. All rights reserved.
#
# The contents of this file are subject to the terms of either the GNU
# General Public License Version 2 only ("GPL") or the Common Development
# and Distribution License("CDDL") (collectively, the "License"). You
# may not use this file except in compliance with the License. You can
# obtain a copy of the License at
# https://glassfish.dev.java.net/public/CDDL+GPL_1_1.html
# or packager/legal/LICENSE.txt. See the License for the specific
# language governing permissions and limitations under the License.
#
# When distributing the software, include this License Header Notice in each
# file and include the License file at packager/legal/LICENSE.txt.
#
# GPL Classpath Exception:
# Oracle designates this particular file as subject to the "Classpath"
# exception as provided by Oracle in the GPL Version 2 section of the License
# file that accompanied this code.
#
# Modifications:
# If applicable, add the following below the License Header, with the fields
# enclosed by brackets [] replaced by your own identifying information:
# "Portions Copyright [year] [name of copyright owner]"
#
# Contributor(s):
# If you wish your version of this file to be governed by only the CDDL or
# only the GPL Version 2, indicate your decision by adding "[Contributor]
# elects to include this software in this distribution under the [CDDL or GPL
# Version 2] license." If you don't indicate a single choice of license, a
# recipient has the option to distribute your version of this file under
# either the CDDL, the GPL Version 2 or to extend the choice of license to
# its licensees as provided above. However, if you add GPL Version 2 code
# and therefore, elected the GPL Version 2 license, then the option applies
# only if the new code is made subject to such option by the copyright
# holder.
#
# Portions Copyright [2016] [Payara Foundation]
tree.transactionService=Service de transaction
tree.transactionService.tooltip=Service de transaction
#transaction Service
ts.TransactionService=Service de transaction
ts.PageHelp=Modifiez les param\u00E8tres g\u00E9n\u00E9raux du service de transaction.
ts.OnRestart=Au red\u00E9marrage :
ts.OnRestartHelp=Tentative de finalisation des transactions incompl\u00E8tes au d\u00E9marrage du service
ts.AutoRecovery=R\u00E9cup\u00E9ration automatique :
ts.Timeout=Expiration de transaction :
ts.TimeoutHelp=Annuler (rollback) la transaction en cas d'absence de r\u00E9ponse ; affecter la valeur 0 \u00E0 ce param\u00E8tre pour d\u00E9sactiver l'expiration
ts.Retry=Expiration des tentatives :
ts.RetryHelp=Dur\u00E9e, en secondes, pendant laquelle Payara Server essaie de se connecter \u00E0 un serveur inaccessible. La valeur par d\u00E9faut est 600 secondes
ts.LogLocation=Emplacement des journaux des transactions :
ts.HeuristicDesc=D\u00E9cision heuristique :
ts.HeuristicDescHelp=Action \u00E0 effectuer si le statut de la transaction est ind\u00E9termin\u00E9 pendant la r\u00E9cup\u00E9ration ; la valeur par d\u00E9faut est Annuler
ts.KeypointInterval=Intervalle entre points cl\u00E9s :
ts.KeypointIntervalHelp=Nombre de transactions entre les op\u00E9rations de point cl\u00E9 journalis\u00E9es
#this is the label of a dropdown, for rolling back transaction.
ts.rollback=Annuler
ts.commit=Valider
|
{
"pile_set_name": "Github"
}
|
There is, however, another narrative, one far more shadowy than the virtuous tale Orr served up in his University of Michigan presentation.
Detroit Emergency Manager Kevyn Orr stood behind a lectern in a ballroom on the University of Michigan’s campus, telling an attentive crowd how the civic-minded values absorbed here at his alma mater helped lead to a job that, when first offered, he wanted no part of. His initial response wasn’t just no, but an emphatic “Hell no.”
ISDA Master Agreement
The ISDA master agreement is the most commonly used master contract for OTC derivative transactions internationally. It is used to govern many of the financial transactions between the City of Detroit and Wall Street. Below are links to the agreement and sites with explanations.
|
{
"pile_set_name": "Pile-CC"
}
|
List of ship launches in 1963
The list of ship launches in 1963 includes a chronological list of all ships launched in 1963.
__NOTOC__
References
See also
1963
Ship launches
|
{
"pile_set_name": "Wikipedia (en)"
}
|
<?php
declare(strict_types=1);
namespace League\OpenAPIValidation\PSR15;
use League\OpenAPIValidation\PSR7\ValidatorBuilder;
use Psr\Http\Server\MiddlewareInterface;
class ValidationMiddlewareBuilder extends ValidatorBuilder
{
public function getValidationMiddleware() : MiddlewareInterface
{
return new ValidationMiddleware(
$this->getServerRequestValidator(),
$this->getResponseValidator()
);
}
}
|
{
"pile_set_name": "Github"
}
|
The cancellation of an unannounced title resulted in a staff reduction at Tim Schafer's development studio.
Just about a month after the release of Costume Quest 2, developer Double Fine has laid off 12 employees. This isn't another case of the post-release staff reductions that are all too common in the industry, however; studio head Tim Schafer told GamesIndustry.biz that the layoffs were due to the unexpected cancellation of an unannounced game.
"One of our unannounced projects was unexpectedly canceled by its publisher, forcing us to reduce our staff by 12 people," according to Schafer. The silver lining is that this isn't bad news for the Double Fine games that have been announced; development will continue as usual for Broken Age, Massive Chalice, and Grim Fandango Remastered.
Layoffs are an unfortunate reality of the gaming industry, but that doesn't make the news any less sad to hear. It's a shame Double Fine's canceled project won't come to fruition, and even worse that a dozen staffers are out of a job. We wish them the best of luck.
I guess it's hard to keep finances secure when you somehow manage to overspend a 3.3 million dollar budget for a $400,000 game and only have enough to make half of it, begging fans for more money to finish the second part.
And when you release a game as Early Access as a means of financing it then just shut down all development when you've made enough money.
And when you host a huge, open-door party 2 years in a row.
And when you're stationed in San Fran-fucking-cisco.
Double Fine needs better management. Tim is obviously not cut out for this shit, he's just the idea guy. Idea guys can be great, but they need a leash to keep them in line.
I'm legitimately curious, when were they ever in talks with Phil fish?
OT: have to meet that bottom line, eh Tim? I'm sure that there were mitigating circumstances for why the publisher dropped you, but at least a few of those mitigating circumstances probably related to your abhorrent mismanagement as a developer. Even as an indi-dev, Schaffer can't seem to keep it together. He's been banking on his fans goodwill, but all he's delivered so far are IOU's and broken promises. You're overdrawn, Schaffer.
I'm legitimately curious, when were they ever in talks with Phil fish?
OT: have to meet that bottom line, eh Tim? I'm sure that there were mitigating circumstances for why the publisher dropped you, but at least a few of those mitigating circumstances probably related to your abhorrent mismanagement as a developer. Even as an indi-dev, Schaffer can't seem to keep it together. He's been banking on his fans goodwill, but all he's delivered so far are IOU's and broken promises. You're overdrawn, Schaffer.
Didn't you hear? Fish quit again and is now actually a DJ, he was at the party that appears to have fired 12 people.
It seems Double Fine has fallen onto some hard times of late. Shame, they're one of the few developers I actually enjoy. Hearing them lay off staff makes me think the chance for a sequel to Brutal Legends is getting farther and farther away.
Elfgore:It seems Double Fine has fallen onto some hard times of late. Shame, they're one of the few developers I actually enjoy. Hearing them lay off staff makes me think the chance for a sequel to Brutal Legends is getting farther and farther away.
Davroth:Kind of disgusted that gamesindustry.biz saw fit to plug Massive Chalice steam early access in a news story about people loosing their job. Whatever happened to common decency.
I don't think DF OR the games industry beesknees in general has any decency left.
On a side note, after seeing the let's plays of Massive Chalice, I doubt it'll save the company. For a squad level game it looks like it has design level issues that can't be overcome this late in development. It won't have the depth of XCom, and XCom wasn't particularly deep to being with.
I can't help but think that fans are just watching Tim Schafer John Romero himself at this point.
Yup. Making your customers look at Bobby Kotick's words about you as correct is damning enough. Timmy Boy not being able to handle money might be the reason Notch said screw it to funding Psychonauts 2.
Quadocky:I like how people keep spreading unsourced rumors of him and his business. No wait, I don't like it. Stop that please.
Tim schafer gets 3 Million dollars for game, doesnt finish game, asks for more money, makes half a game. Well documented across multiple sources that Broken age didnt cost anywhere near what he got (Outside of tims idiotic twitter sperg about apparently paying the people who work for him way too much fucking money) so the only logical conclusion is that Tim is a singularity into which sensible use of money dissapears.
Tim has scooted along on his past successes for too long and his absolute failure to manage his company (again) needs to be talked about more. Preferably before some tards give him more money.
Also he claims Broken age 2: Revengeance is already financed, but theres been absolutely no proof provided and news just keeps coming that Double fine is broke as fuck.
Yup. Making your customers look at Bobby Kotick's words about you as correct is damning enough. Timmy Boy not being able to handle money might be the reason Notch said screw it to funding Psychonauts 2.
And this is what i hate Schafer for more than anything. He made me realise bobby kotick was right about everything. Kotick is the hero we need.
I've no more patience for him. He makes really good games, but man does he suck at money. HE KNEW he was going to have to let these people go, so why rub salt in their fucking wounds of firing them just before Christmas by holding an extravagant expensive party?
It's just.. The money used for the party should have been divided between the 12 of them so that they could have a decent christmas until they find a new job.
I've no more patience for him. He makes really good games, but man does he suck at money. HE KNEW he was going to have to let these people go, so why rub salt in their fucking wounds of firing them just before Christmas by holding an extravagant expensive party?
It's just.. The money used for the party should have been divided between the 12 of them so that they could have a decent christmas until they find a new job.
Bad Tim, bad!
You know the party was completely funded by external sponsorships right?
Are you suggesting Tim Schafer should have taken money off of Sony and Microsoft under false pretences to be given to the poor developers who were fired? A noble gesture, but would have resulted in many more layoffs due to the resultant law suites.
Firing people at the termination of a project is not something unique to Tim Schafer in this business.
Quadocky:I like how people keep spreading unsourced rumors of him and his business. No wait, I don't like it. Stop that please.
I hear he steals candy from babies and uses the sugar to fuel engines of destruction.
bat32391:I haven't really been following them lately, but didn't they get a shit ton of cash from a kickstarter awhile back? What the hell happened to that?
That was for a specific game. If they were spending that on other games, it'd be...Well, fraud, to start. But it's worth noting that that game got nearly ten times its Kickstarter goal, and Schafer didn't have the money to finish it, so we've only seen part one thus far. Not exactly a ringing endorsement in the first place.
I like pretty much most games he is or was involved in, but it seems like he needs a higher up to manage the budget.I really wonder how he planned to release broken age with ~300k if he pays his staff ~6k per month, that would mean he planned to develop this game within 2 months or something if you adapt voice acting and other costs?
How much does anyone want to bet that the reason why their project was canceled was because investors finally caught on to the fact he can't deliver anywhere close to on budget?
I guess he didn't buddy up enough with Kellie Santiago/Indiefund to get more seed money like he did for DF-9.
You guys heard about that right?
He got VC funding from Indiefund for DF-9, then went out to crowdsource funds from the public. He then goes on to release a half completed game on Steam early access, and handing over all the early access money to Kellie Santiago/Indiefund instead of putting it into finishing the game like he said he would.
Of course, his buddies in the Indiefund "mafia" made all their cash back, but all the poor customers who trusted Tim got the shaft.
Tim Schafer doesn't deserve a single ounce of pity from anyone. He actively screwed over his "fans" with DF-9 so that his buddies would get their money back.
|
{
"pile_set_name": "Pile-CC"
}
|
import logging
import math
import tkinter as tk
from typing import TYPE_CHECKING, Optional, Tuple
from core.api.grpc.wrappers import Interface, Link
from core.gui import themes
from core.gui.dialogs.linkconfig import LinkConfigurationDialog
from core.gui.frames.link import EdgeInfoFrame, WirelessEdgeInfoFrame
from core.gui.graph import tags
from core.gui.nodeutils import NodeUtils
from core.gui.utils import bandwidth_text, delay_jitter_text
if TYPE_CHECKING:
from core.gui.graph.graph import CanvasGraph
TEXT_DISTANCE: float = 0.30
EDGE_WIDTH: int = 3
EDGE_COLOR: str = "#ff0000"
WIRELESS_WIDTH: float = 3
WIRELESS_COLOR: str = "#009933"
ARC_DISTANCE: int = 50
def create_edge_token(src: int, dst: int, network: int = None) -> Tuple[int, ...]:
values = [src, dst]
if network is not None:
values.append(network)
return tuple(sorted(values))
def arc_edges(edges) -> None:
if not edges:
return
mid_index = len(edges) // 2
if mid_index == 0:
arc_step = ARC_DISTANCE
else:
arc_step = ARC_DISTANCE / mid_index
# below edges
arc = 0
for edge in edges[:mid_index]:
arc -= arc_step
edge.arc = arc
edge.redraw()
# mid edge
if len(edges) % 2 != 0:
arc = 0
edge = edges[mid_index]
edge.arc = arc
edge.redraw()
mid_index += 1
# above edges
arc = 0
for edge in edges[mid_index:]:
arc += arc_step
edge.arc = arc
edge.redraw()
class Edge:
tag: str = tags.EDGE
def __init__(self, canvas: "CanvasGraph", src: int, dst: int = None) -> None:
self.canvas = canvas
self.id: Optional[int] = None
self.src: int = src
self.dst: int = dst
self.arc: int = 0
self.token: Optional[Tuple[int, ...]] = None
self.src_label: Optional[int] = None
self.middle_label: Optional[int] = None
self.dst_label: Optional[int] = None
self.color: str = EDGE_COLOR
self.width: int = EDGE_WIDTH
@classmethod
def create_token(cls, src: int, dst: int) -> Tuple[int, ...]:
return tuple(sorted([src, dst]))
def scaled_width(self) -> float:
return self.width * self.canvas.app.app_scale
def _get_arcpoint(
self, src_pos: Tuple[float, float], dst_pos: Tuple[float, float]
) -> Tuple[float, float]:
src_x, src_y = src_pos
dst_x, dst_y = dst_pos
mp_x = (src_x + dst_x) / 2
mp_y = (src_y + dst_y) / 2
slope_denominator = src_x - dst_x
slope_numerator = src_y - dst_y
# vertical line
if slope_denominator == 0:
return mp_x + self.arc, mp_y
# horizontal line
if slope_numerator == 0:
return mp_x, mp_y + self.arc
# everything else
m = slope_numerator / slope_denominator
perp_m = -1 / m
b = mp_y - (perp_m * mp_x)
# get arc x and y
offset = math.sqrt(self.arc ** 2 / (1 + (1 / m ** 2)))
arc_x = mp_x
if self.arc >= 0:
arc_x += offset
else:
arc_x -= offset
arc_y = (perp_m * arc_x) + b
return arc_x, arc_y
def draw(
self, src_pos: Tuple[float, float], dst_pos: Tuple[float, float], state: str
) -> None:
arc_pos = self._get_arcpoint(src_pos, dst_pos)
self.id = self.canvas.create_line(
*src_pos,
*arc_pos,
*dst_pos,
smooth=True,
tags=self.tag,
width=self.scaled_width(),
fill=self.color,
state=state,
)
def redraw(self) -> None:
self.canvas.itemconfig(self.id, width=self.scaled_width(), fill=self.color)
src_x, src_y, _, _, _, _ = self.canvas.coords(self.id)
src_pos = src_x, src_y
self.move_src(src_pos)
def middle_label_pos(self) -> Tuple[float, float]:
_, _, x, y, _, _ = self.canvas.coords(self.id)
return x, y
def middle_label_text(self, text: str) -> None:
if self.middle_label is None:
x, y = self.middle_label_pos()
self.middle_label = self.canvas.create_text(
x,
y,
font=self.canvas.app.edge_font,
text=text,
tags=tags.LINK_LABEL,
justify=tk.CENTER,
state=self.canvas.show_link_labels.state(),
)
else:
self.canvas.itemconfig(self.middle_label, text=text)
def clear_middle_label(self) -> None:
self.canvas.delete(self.middle_label)
self.middle_label = None
def node_label_positions(self) -> Tuple[Tuple[float, float], Tuple[float, float]]:
src_x, src_y, _, _, dst_x, dst_y = self.canvas.coords(self.id)
v1 = dst_x - src_x
v2 = dst_y - src_y
ux = TEXT_DISTANCE * v1
uy = TEXT_DISTANCE * v2
src_x = src_x + ux
src_y = src_y + uy
dst_x = dst_x - ux
dst_y = dst_y - uy
return (src_x, src_y), (dst_x, dst_y)
def src_label_text(self, text: str) -> None:
if self.src_label is None:
src_pos, _ = self.node_label_positions()
self.src_label = self.canvas.create_text(
*src_pos,
text=text,
justify=tk.CENTER,
font=self.canvas.app.edge_font,
tags=tags.LINK_LABEL,
state=self.canvas.show_link_labels.state(),
)
else:
self.canvas.itemconfig(self.src_label, text=text)
def dst_label_text(self, text: str) -> None:
if self.dst_label is None:
_, dst_pos = self.node_label_positions()
self.dst_label = self.canvas.create_text(
*dst_pos,
text=text,
justify=tk.CENTER,
font=self.canvas.app.edge_font,
tags=tags.LINK_LABEL,
state=self.canvas.show_link_labels.state(),
)
else:
self.canvas.itemconfig(self.dst_label, text=text)
def move_node(self, node_id: int, pos: Tuple[float, float]) -> None:
if self.src == node_id:
self.move_src(pos)
else:
self.move_dst(pos)
def move_dst(self, dst_pos: Tuple[float, float]) -> None:
src_x, src_y, _, _, _, _ = self.canvas.coords(self.id)
src_pos = src_x, src_y
self.moved(src_pos, dst_pos)
def move_src(self, src_pos: Tuple[float, float]) -> None:
_, _, _, _, dst_x, dst_y = self.canvas.coords(self.id)
dst_pos = dst_x, dst_y
self.moved(src_pos, dst_pos)
def moved(self, src_pos: Tuple[float, float], dst_pos: Tuple[float, float]) -> None:
arc_pos = self._get_arcpoint(src_pos, dst_pos)
self.canvas.coords(self.id, *src_pos, *arc_pos, *dst_pos)
if self.middle_label:
self.canvas.coords(self.middle_label, *arc_pos)
src_pos, dst_pos = self.node_label_positions()
if self.src_label:
self.canvas.coords(self.src_label, *src_pos)
if self.dst_label:
self.canvas.coords(self.dst_label, *dst_pos)
def delete(self) -> None:
logging.debug("deleting canvas edge, id: %s", self.id)
self.canvas.delete(self.id)
self.canvas.delete(self.src_label)
self.canvas.delete(self.dst_label)
self.clear_middle_label()
self.id = None
self.src_label = None
self.dst_label = None
class CanvasWirelessEdge(Edge):
tag = tags.WIRELESS_EDGE
def __init__(
self,
canvas: "CanvasGraph",
src: int,
dst: int,
src_pos: Tuple[float, float],
dst_pos: Tuple[float, float],
token: Tuple[int, ...],
link: Link,
) -> None:
logging.debug("drawing wireless link from node %s to node %s", src, dst)
super().__init__(canvas, src, dst)
self.link: Link = link
self.token: Tuple[int, ...] = token
self.width: float = WIRELESS_WIDTH
color = link.color if link.color else WIRELESS_COLOR
self.color: str = color
self.draw(src_pos, dst_pos, self.canvas.show_wireless.state())
if link.label:
self.middle_label_text(link.label)
self.set_binding()
def set_binding(self) -> None:
self.canvas.tag_bind(self.id, "<Button-1>", self.show_info)
def show_info(self, _event: tk.Event) -> None:
self.canvas.app.display_info(
WirelessEdgeInfoFrame, app=self.canvas.app, edge=self
)
class CanvasEdge(Edge):
"""
Canvas edge class
"""
def __init__(
self,
canvas: "CanvasGraph",
src: int,
src_pos: Tuple[float, float],
dst_pos: Tuple[float, float],
) -> None:
"""
Create an instance of canvas edge object
"""
super().__init__(canvas, src)
self.src_iface: Optional[Interface] = None
self.dst_iface: Optional[Interface] = None
self.text_src: Optional[int] = None
self.text_dst: Optional[int] = None
self.link: Optional[Link] = None
self.asymmetric_link: Optional[Link] = None
self.throughput: Optional[float] = None
self.draw(src_pos, dst_pos, tk.NORMAL)
self.set_binding()
self.context: tk.Menu = tk.Menu(self.canvas)
self.create_context()
def create_context(self) -> None:
themes.style_menu(self.context)
self.context.add_command(label="Configure", command=self.click_configure)
self.context.add_command(label="Delete", command=self.click_delete)
def set_binding(self) -> None:
self.canvas.tag_bind(self.id, "<ButtonRelease-3>", self.show_context)
self.canvas.tag_bind(self.id, "<Button-1>", self.show_info)
def set_link(self, link: Link) -> None:
self.link = link
self.draw_labels()
def iface_label(self, iface: Interface) -> str:
label = ""
if iface.name and self.canvas.show_iface_names.get():
label = f"{iface.name}"
if iface.ip4 and self.canvas.show_ip4s.get():
label = f"{label}\n" if label else ""
label += f"{iface.ip4}/{iface.ip4_mask}"
if iface.ip6 and self.canvas.show_ip6s.get():
label = f"{label}\n" if label else ""
label += f"{iface.ip6}/{iface.ip6_mask}"
return label
def create_node_labels(self) -> Tuple[str, str]:
label1 = None
if self.link.iface1:
label1 = self.iface_label(self.link.iface1)
label2 = None
if self.link.iface2:
label2 = self.iface_label(self.link.iface2)
return label1, label2
def draw_labels(self) -> None:
src_text, dst_text = self.create_node_labels()
self.src_label_text(src_text)
self.dst_label_text(dst_text)
self.draw_link_options()
def redraw(self) -> None:
super().redraw()
self.draw_labels()
def set_throughput(self, throughput: float) -> None:
throughput = 0.001 * throughput
text = f"{throughput:.3f} kbps"
self.middle_label_text(text)
if throughput > self.canvas.throughput_threshold:
color = self.canvas.throughput_color
width = self.canvas.throughput_width
else:
color = self.color
width = self.scaled_width()
self.canvas.itemconfig(self.id, fill=color, width=width)
def complete(self, dst: int) -> None:
self.dst = dst
self.token = create_edge_token(self.src, self.dst)
dst_pos = self.canvas.coords(self.dst)
self.move_dst(dst_pos)
self.check_wireless()
logging.debug("Draw wired link from node %s to node %s", self.src, dst)
def is_wireless(self) -> bool:
src_node = self.canvas.nodes[self.src]
dst_node = self.canvas.nodes[self.dst]
src_node_type = src_node.core_node.type
dst_node_type = dst_node.core_node.type
is_src_wireless = NodeUtils.is_wireless_node(src_node_type)
is_dst_wireless = NodeUtils.is_wireless_node(dst_node_type)
# update the wlan/EMANE network
wlan_network = self.canvas.wireless_network
if is_src_wireless and not is_dst_wireless:
if self.src not in wlan_network:
wlan_network[self.src] = set()
wlan_network[self.src].add(self.dst)
elif not is_src_wireless and is_dst_wireless:
if self.dst not in wlan_network:
wlan_network[self.dst] = set()
wlan_network[self.dst].add(self.src)
return is_src_wireless or is_dst_wireless
def check_wireless(self) -> None:
if self.is_wireless():
self.canvas.itemconfig(self.id, state=tk.HIDDEN)
self.canvas.dtag(self.id, tags.EDGE)
self._check_antenna()
def _check_antenna(self) -> None:
src_node = self.canvas.nodes[self.src]
dst_node = self.canvas.nodes[self.dst]
src_node_type = src_node.core_node.type
dst_node_type = dst_node.core_node.type
is_src_wireless = NodeUtils.is_wireless_node(src_node_type)
is_dst_wireless = NodeUtils.is_wireless_node(dst_node_type)
if is_src_wireless or is_dst_wireless:
if is_src_wireless and not is_dst_wireless:
dst_node.add_antenna()
elif not is_src_wireless and is_dst_wireless:
src_node.add_antenna()
else:
src_node.add_antenna()
def reset(self) -> None:
self.canvas.delete(self.middle_label)
self.middle_label = None
self.canvas.itemconfig(self.id, fill=self.color, width=self.scaled_width())
def show_info(self, _event: tk.Event) -> None:
self.canvas.app.display_info(EdgeInfoFrame, app=self.canvas.app, edge=self)
def show_context(self, event: tk.Event) -> None:
state = tk.DISABLED if self.canvas.core.is_runtime() else tk.NORMAL
self.context.entryconfigure(1, state=state)
self.context.tk_popup(event.x_root, event.y_root)
def click_delete(self) -> None:
self.canvas.delete_edge(self)
def click_configure(self) -> None:
dialog = LinkConfigurationDialog(self.canvas.app, self)
dialog.show()
def draw_link_options(self):
if not self.link.options:
return
options = self.link.options
asym_options = None
if self.asymmetric_link and self.asymmetric_link.options:
asym_options = self.asymmetric_link.options
lines = []
# bandwidth
if options.bandwidth > 0:
bandwidth_line = bandwidth_text(options.bandwidth)
if asym_options and asym_options.bandwidth > 0:
bandwidth_line += f" / {bandwidth_text(asym_options.bandwidth)}"
lines.append(bandwidth_line)
# delay/jitter
dj_line = delay_jitter_text(options.delay, options.jitter)
if dj_line and asym_options:
asym_dj_line = delay_jitter_text(asym_options.delay, asym_options.jitter)
if asym_dj_line:
dj_line += f" / {asym_dj_line}"
if dj_line:
lines.append(dj_line)
# loss
if options.loss > 0:
loss_line = f"loss={options.loss}%"
if asym_options and asym_options.loss > 0:
loss_line += f" / loss={asym_options.loss}%"
lines.append(loss_line)
# duplicate
if options.dup > 0:
dup_line = f"dup={options.dup}%"
if asym_options and asym_options.dup > 0:
dup_line += f" / dup={asym_options.dup}%"
lines.append(dup_line)
label = "\n".join(lines)
self.middle_label_text(label)
|
{
"pile_set_name": "Github"
}
|
Q:
recursive find number in between in C
I want to find the number within a range in an array and must be in a recursive way. The function variables couldn't be modified.
Let's say in the range of 2 and 3
The input is : int a[] = {4, 1, 3, 1, 3, 2};
and the output will be = {3,3,2} , 3 found
Not sure how to code the recursive function in this case. The below I have tried not working.
int within(int a[], int N, int lower, int upper, int result[])
{
if(N == 1 && N <= upper && N>= lower)
return a[0];
return within(&a[1], N-1, lower, upper, result);
}
int main()
{
int a[] = {4, 1, 3, 1, 3, 2};
int result[6] = {0};
int i, nResult;
nResult = within(a, 6, 2, 3, result);
printf("%d data passed the bounds\n", nResult);
for (i = 0; i < nResult; i++){
printf("%d ", result[i]);
}
printf("\n");
return 0;
}
A:
I want to find the number within a range in an array
Let's say in the range of 2 and 3
Normally a for loop or similar would be so much easier here
If it has to be recursive....
// need to have another number - r - number in range
// r starts at zero
//
// normally lower case for variable and capitals for things you #define
// N starts at the number of elements of a less one
//
int within(int a[], int N, int lower, int upper, int r, int result[])
{
if(a[0] <= upper && a[0]>= lower) {
result[r]= a[0];
r++;
}
if(N==0) {
return r;
} else {
r = within(&a[1], N-1, lower, upper, r, result);
return r;
}
}
the function will give a return value of the number of values found within the range.
The code above is recursive, but so much more complicated and fragile than a simple loop... such as the fragment below
for (i=0;i<N;i++) {
if(a[i] <= upper && a[i]>= lower) {
result[r]= a[i];
r++;
}
}
If it has to be recursive wihtout r...
// need to have another number - result[0] - number in range
// result[0] starts at zero
//
// normally lower case for variable and capitals for things you #define
// N starts at the number of elements of a less one
//
int within(int a[], int N, int lower, int upper, int result[])
{
if(a[0] <= upper && a[0]>= lower) {
result[0]++;
result[result[0]]= a[0];
}
if(N==0) {
return result[0];
} else {
result[0] = within(&a[1], N-1, lower, upper, result);
return result[0];
}
}
now result conatins
{number in range, first number in range, second number in range....}
|
{
"pile_set_name": "StackExchange"
}
|
Argentina ready to take Mercosur chair: priority is the trade accord with Europe
Not ignoring controversy over Venezuela, Malcorra insisted that priority are talks with the EU and advancing on a common agenda.
Argentina's priority as chair of Mercosur which it will officially take over this week will be to advance negotiations with the European Union for a wide ranging trade agreement which will not include Venezuela, anticipated foreign minister Susana Malcorra .
One of the most important issues for Mercosur, if not the most pressing are negotiations with the European Union, this is a priority, and Venezuela has always being absent of these talks pointed out the Argentine minister who on Wednesday in a low key ceremony will be taking the Mercosur chair.
Not ignoring the fact that the suspension of a country member is something very serious, (in reference to Venezuela), Malcorra insisted that what must be ensured is that the four founding members of the group advance on a common agenda.
The four founding members, (Argentina, Brazil, Paraguay and Uruguay) last December first suspended Venezuela when the three months timetable for the regime of president Nicolas Maduro to incorporate rules and rulings of Mercosur was up and non complied, particularly those referred to trade and human rights. However Venezuela has rejected the suspension and argues it was motivated on political grounds.
Argentina is scheduled to take the Mercosur chair Wednesday at the Foreign Ministry, in Buenos Aires, an event at foreign ministers levels, not presidential summit as usual, and to which Venezuelan minister Delcy Rodríguez has promised to attend.
These six months which should have had Venezuela at the chair were particularly controversial, since the founding members disagreed on having Maduro representing Mercosur given the political turmoil in the country and violation of human rights. But Maduro self proclaimed it held the chair while the other members created a transition council with four representatives to keep the common agenda alive.
Supposedly Wednesday should put an end to the controversial period, which had three members decisively willing to condemn Venezuela, while Uruguay, whose ruling coalition is divided on the issue had a more hesitant, foot dragging attitude, to the extent that Maduro has demanded to have a personal meeting with Uruguay's Tabare Vázquez as soon as possible on the matter.
President Vázquez has argued that dialogue is the only path possible and admits that the three branches of government in Venezuela exist and function to the extent that one of them is held by the opposition, the legislative Assembly.
|
{
"pile_set_name": "Pile-CC"
}
|
Pharmacodynamics of high-dose vecuronium in children during balanced anesthesia.
To compare the speed of onset, intubating conditions, duration of action, and recovery from neuromuscular blockade with vecuronium to those with succinylcholine, 40 ASA physical status 1 or 2 children (ages 2-9 yr) were studied during N2O-O2-opioid anesthesia. Each child was randomly assigned to receive a bolus dose of one of the following muscle relaxants: succinylcholine 2.0 mg/kg (n = 10), vecuronium 0.1 mg/kg (n = 10), vecuronium 0.2 mg/kg (n = 10), or vecuronium 0.4 mg/kg (n = 10). The evoked electromyogram of the abductor digiti minimi to train-of-four stimulation was monitored. We found that with succinylcholine, the time to 95% twitch depression (speed of onset, mean +/- SD), 24 +/- 7 s, was significantly less than that with each dose of vecuronium: 0.1 mg/kg, 83 +/- 21 s; 0.2 mg/kg, 58 +/- 17 s; and 0.4 mg/kg, 39 +/- 11 s, respectively (P less than 0.05). The time to laryngoscopy and intubation did not differ significantly between succinylcholine (48 +/- 10 s) and vecuronium 0.4 mg/kg (57 +/- 13 s); however, both were significantly less than than with vecuronium 0.1 and 0.2 mg/kg (P less than 0.005). The intubating conditions were excellent in 100% of patients. The duration of action was least with succinylcholine (5.7 +/- 1.5 min) and increased with increasing doses of vecuronium: 0.1 mg/kg, 23.9 +/- 5.1 min; 0.2 mg/kg, 55.2 +/- 11.6 min; and 0.4 mg/kg, 74.6 +/- 9.9 min, respectively (P less than 0.001). The recovery index was most rapid with succinylcholine (1.6 +/- 0.4 min) and was slowest with vecuronium 0.4 mg/kg (22.6 +/- 2.1 min) (P less than 0.005).(ABSTRACT TRUNCATED AT 250 WORDS)
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Disney Gets OK To Break Ground In China
A Walt Disneytheme park and resort project in Shanghai that has been in the planning stages since the late 1990s looks like it’s finally received a green light. The Wall Street Journal reported today that invitations went out over the weekend to a “special event in Shanghai” set for Friday, which would be a groundbreaking ceremony that Disney CEO Bob Iger is expected to attend. As designed, the park would be 963 acres and feature two hotels, shops and restaurants, and a lake. During Disney’s recent shareholders meeting in Salt Lake City, Parks and Resorts boss Tom Staggs said the park would take five years to finish. The total cost has not been disclosed, but Disney is expected to be a minority stakeholder. It would be the sixth Disney theme park and resort and the first in mainland China (Hong Kong Disneyland opened in 2005).
|
{
"pile_set_name": "Pile-CC"
}
|
Destiny 2‘s Black Armory DLC is now available, and from early reactions, it seems it’s not what many Guardians expected. We all know that the Destiny franchise has had problems when it came to content droughts. The wait between The Taken King and Rise of Iron contained several weeks and months when there was nothing left to do. And so, on the heels of Forsaken, Bungie aims to drip-feed content every now and then via Black Armory. Whether it’ll work out, in the end, is still up in the air. For now, let’s check out what you can do in the game.
Right off the bat, you’ve got a couple of new quests. The first one is to visit Tess Everis to get an Eververse freebie after killing a few enemies. You’ll probably notice quite a lot of new cosmetics like ships, sparrows, ghost shells, and emotes. Just remember that, as before, you’ve got the new “knockout” system where you can’t get duplicates anymore from major rewards.
From here, you’ll need to find the Black Armory that’s hidden in the Tower. Just follow the path from the Bazaar until you reach a very suspicious looking door. Don’t forget to take in the sights as well.
Forging A Machine Gun
After a short cutscene, you’ll meet up with the curator of the titular Black Armory, Ada-1. She’s keeping her wares away from prying hands, but she does need your help. You’re going to have to forge a machine gun.
Defeat Forge Saboteur/Compound Ether
The first step is to find a Forge Saboteur and take them out. You’ll easily find these guys in the EDZ – Outskirts, and Gulch. If they don’t spawn, just enter and exit the zone or wait for them to pop up. Do note that there’s a chest that you need to open afterward. Make sure no other Guardians are around, since you’ll have to be the one to open this chest. You’ll also need to gather some Compound Ether, and this automatically happens when you or other friendlies kill Fallen in the EDZ.
Power Weapon Multikills/Hive Multikills
Next up, you’ll need to get some Hive multikills with a power weapon. Your best option would be an Escalation Protocol on Mars. Bring a Thunderlord to get things done faster. Alternatively, bring a sword (even if a sword has no more ammo, your regular/non-Hive multikills still count).
Defeat Powerful Enemies/Radiant Seeds
Once you’re done, you’ll need to beat down some powerful enemies (yellow bar mobs) with power weapons. Your best bet would be Glimmer Extraction (EDZ) or Witches Ritual (Titan) public events. Alternatively, you can just head on over to the Leviathan and kill the Cabal on the landing area (just head back to orbit and fly back in to reset). As for me, I headed all the way to the Engine Room in the Underbelly to kill turrets and Incendiors. I found that more efficient.
The next step will then task you with gathering Radiant Seeds also from powerful enemies. The same process/locations still apply. Once you’re done, you’ll finally have access to the Volundr Forge.
Volundr Forge – What’s In The Box?
The first Forge that’s available in Black Armory is in the EDZ. Just head over to the Gulch or the Sunken Isles and follow the Cabal tunnels. There’s a short pathway over on the side that takes you to the Volundr Forge. Before you start the activity by touching that floating stalactite, you’ll want to pick up a secret exotic quest from a nearby ledge.
There’s a quick video below made by Esoterickk. Now, we still don’t know what this quest leads to so we’ll keep you updated once more details surface. In any case, head on over to that floating stalactite to start matchmaking for Volundr Forge.
Volundr Forge – Ouch!
That’s probably the reaction you’ll have once matchmaking is done. That’s because Volundr Forge (and likely all Forges in Black Armory) has matchmaking enabled but the enemies are at way higher levels. This horde mode has very simple mechanics:
Kill glowing enemies so they drop orbs.
Throw those orbs to the Forge/floating pillar so it charges.
You need to fully charge the Forge before the timer runs out. Do note that each glowing enemy you kill will add a few seconds to the timer.
That’s just Round 1, and the enemies are already 615 Power Level (PL). Round 2 follows the same mechanics, but the enemies are at 620 PL. Lastly, Round 3 will pit you against a boss that’s at 630 PL! Needless to say, you’ve got your work cut out for you.
You’ll need some hard-hitting weapons that can drop enemies quick. The One Thousand Voices from the Last Wish raid might help out for the regular rounds. Once you get to the boss, you’re definitely going to need the Whisper of the Worm… and a Warlock or two.
It’s possible to complete this while undergeared, but you’ll need a competent and coordinated team. Here’s a video from GladdHeAteHer’s team (presumably the world’s first completion):
Once completed, players will get the Hammerhead legendary machine gun. You’ll also want to go back to Ada-1 to see if you can pick up some more of her bounties. That’s pretty much what you’ll get for today, and that’s what’s gotten many Destiny 2 players agitated.
Make It Harder… But Not That Hard!
The Destiny community has often become conflicted in wanting a harder grind versus progression that’s more accessible. It’s worth noting that a majority of the game’s player base is comprised of casual gamers. For instance, only a small percentage of users have completed the Last Wish raid. Given that many in the community are keen on trying out and completing new content, that’s led to a number of complaints about the Volundr Forge having an extremely high Power Level requirement.
In a way, this is somewhat similar to the early reactions to Warmind and Escalation Protocol. Destiny 2‘s player base found it too hard, and only the top players/teams in the world were able to complete it in the first week. Bungie eventually had to lower the Power Level requirement just so more players can partake in the activity.
It’s also not confined to the difficulty, but also to the progression itself. That’s because the only way you can reliably grind to a higher PL is by repeating the same progression that you’ve done in Forsaken. Yes, that means doing your Vanguard Strikes, Nightfall, Gambit, Crucible milestones, and other activities for powerful engrams. There’s just nothing else that’s left unless you want to keep farming majors that will hopefully drop Prime Engrams.
There’s Definitely Something Wrong
Something is oddly wrong with how Destiny 2: Black Armory has been presented, especially after the success of Forsaken. We know that these small, drip-fed contents are just to avoid content droughts, but the way it’s been implemented is a little off-putting. It’s also going to be a slog for solo players. With the new raid going live this Friday, this type of progression is also going to pose a problem for PvE players. Remember, with how the powerful engrams work in “tiers,” that means you’ll only get drops that boost you at small increments now.
That being said, Black Armory has only been out for only a few hours. Plus, it’s technically only $10 (combined with Joker’s Wild and Penumbra, the Annual Pass is $30). We already knew there wouldn’t be an in-depth campaign and that these mini DLCs would only focus on the endgame. For now, we’re just grinding to see what the future holds. My Warlock is currently 611 PL and eagerly waiting for whatever Bungie decides to throw our way.
In any case, if you do wish to increase your Power Level a bit more, do check out our guide to hitting max PL. Even though the content is from Forsaken, the progression system remains relevant. Another tip would be to quickly kill Riven on three characters — you can even cheese if you want to. Then, once you’re done with three kills (and three Ethereal Keys), run the Heart checkpoint on your highest PL character. You get to open three chests which, hopefully, give you the upgrades you need.
|
{
"pile_set_name": "OpenWebText2"
}
|
Before You Go (film)
Before You Go is a 2002 comedy film directed by Lewis Gilbert (his final directorial effort). The imperfect lives of three sisters are revealed at their unloved mother's funeral.
Cast
Julie Walters as Teresa
John Hannah as Mike
Joanne Whalley as Mary
Victoria Hamilton as Catherine
Tom Wilkinson as Frank
Patricia Hodge as Mother
References
External links
Category:2002 films
Category:Films directed by Lewis Gilbert
Category:British films
Category:British comedy films
Category:2000s comedy films
|
{
"pile_set_name": "Wikipedia (en)"
}
|
--- xprompt/Imakefile.orig Thu Jun 29 12:48:41 1995
+++ xprompt/Imakefile Wed Nov 1 08:13:28 2000
@@ -2,14 +2,14 @@
SRCS = xprompt.c xprompt_cb.c xprompt_main.c
OBJS = xprompt.o xprompt_cb.o xprompt_main.o
XCOMM for LINUX:
-EXTRA_LIBRARIES = -L/usr/local/lib -L/u/grad/mitnits/lib -lforms -lXpm -lm XCOMM
+XCOMM EXTRA_LIBRARIES = -L/usr/local/lib -lforms -lXpm -lm XCOMM
-XCOMM FOR Solaris
-XCOMM EXTRA_LIBRARIES = -L/usr/local/lib -L/u/grad/mitnits/lib -lforms -lXpm -lm -lnsl
+XCOMM FOR FreeBSD
+EXTRA_LIBRARIES = -lforms -lXpm -lm
-EXTRA_INCLUDES = -I/usr/local/include -I/u/grad/mitnits/lib -I.
-EXTRA_DEFINES = -DICON_DIR=\"/usr/include/X11/pixmaps\"
+EXTRA_INCLUDES = -I. -I${INCDIR}/X11
+EXTRA_DEFINES = -DICON_DIR=\"${INCDIR}/pixmaps\"
LDLIBS = $(EXTRA_LIBRARIES) $(EXTENSIONLIB) $(XLIB)
-ComplexProgramTarget(xprompt)
+ComplexProgramTargetNoMan(xprompt)
|
{
"pile_set_name": "Github"
}
|
Cambridge Central Mosque
The Cambridge Central Mosque is Europe's first eco-friendly mosque and the first purpose-built mosque within the city of Cambridge, England. Its mandate is to meet the needs of the Muslim community in the UK and beyond by facilitating good practice in faith, community development, social cohesion & interfaith dialogue. The Cambridge Central Mosque was opened to the public on 24 April 2019.
Background
The Muslim Academic Trust (MAT) proposed the site location to be situated in the Romsey area of Mill Road in Cambridge. Thereafter, the Cambridge Mosque Project was established in 2008 by Dr Timothy Winter, a lecturer in Islamic studies at the University of Cambridge, to raise funds for the project.
After the £4m purchase of a one-acre site in 2009 on Mill Road, Marks Barfield Architects was appointed to design the new mosque in association with Professor Keith Critchlow, a world leading expert in sacred architecture and Islamic geometry along with the UK's leading Islamic garden designer Emma Clark. Marks Barfield Architects are known for innovative designs such as the London Eye and Kew Gardens Treetop Walk, to name a few. Plans for the mosque were submitted to the Cambridge City Council by the MAT and it was approved by the council in 2012. The project however was controversial and it was met with objections.
With its emphasis on sustainability and high reliance on green energy, the mosque will be Europe's first eco-mosque. In addition to the mosque's dedicated areas (ablution, teaching, children's area, morgue) there will be a café, teaching area and meeting rooms for use by the local Muslim and non-Muslim communities and will accommodate up to 1000 worshippers.
Donors from Europe, Middle East, Asia and the Americas have supported the project, but most of the donations, around two-third of the total, have come from Turkey. Construction started in September 2016, was completed in March 2019, and the mosque opened to the public on 24 April 2019.
Gallery
See also
Cambridge Muslim College
References
External links
Cambridge Central Mosque
Cambridge Islamic Art - A sister project in aid of Europe's 1st eco-mosque!
Cambridge Muslim College
Videos
Cambridge Mosque Project - YouTube.com
Shaykh Hamza Yusuf on the Cambridge Mosque Project - YouTube.com
First Look Video The Cambridge Mosque Experience - YouTube.com
Cambridge Mosque 2011 Summer Stroll Trailer - YouTube.com
Category:Mosques in England
Category:Buildings and structures in Cambridge
Category:Religion in Cambridge
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Don’t Pee on My Leg and Tell Me It’s Just Berlin
November 22, 2016
Yeah, I went there. No, I didn’t actually go there. Maybe that guy did. Or probably that guy. But no, not me. What am I talking about? I’m talking about peeing. In public. In Berlin.
Walk around the city any time of day or night and guys are just whipping it out and peeing wherever the hell they like whenever the hell the urge comes. But I’m guessing it’s not just Berlin. I think this is a German thing. Mostly because I’ve seen non-native Berliners who are German partake in this.
Now there are lots of things I expected when I moved to Germany. Heavy food, bad weather, beer drinking…more beer drinking. But I assumed that Germany was refined, classy. That with all the beer drinking, there would be plenty of legitimate places for one to, uh, relieve, themselves. Germany prides itself on its beer–purity laws and all. Wouldn’t they take pride in the…um, disposal of it, too? Then again, Germany is known for these:
Go ahead. Think about it for a second or, ahem, two.
Turns out there are plenty of legitimate places to pee. If you count any street, bush, alley, trash receptacle, lamp post, or just about any open air space to be legitimate. Just the other day I passed by the Alexa Center, that unfortunate eyesore of a mall near Alexanderplatz, where hoards of people are going in and out all day long. Some guy was pissing right by the fence in full view of everyone. The guy couldn’t walk a few meters to the freaking toilets in the mall?! Granted, it costs 50 cents. But c’mon.
The only thing between the public and a full view of the family jewels? An angle.
I was with a friend recently and we were walking to the S-Bahn and he goes, “Wait a second, I gotta take a piss.” I looked around at the open space and immediately wondered, uh, where? But before I could contemplate a strategic location, urination had commenced. Just off the sidewalk. In broad daylight. I wasn’t sure if I was supposed to try to shield any oncoming traffic, maintain normal conversation, or let him finish in silence. I never had to contemplate these conundrums before.
Me? I just can’t do it. Those who know me know I have a fear (well, loathing) of public bathrooms (My motto? “For god’s sake, courtesy flush!”). There was a time when, having no good alternative, I literally broke out in a cold sweat in a stall. And as one who hates the overuse of the word “literally,” for me to say “literally” means “literally.” And there’s that sense of dread that comes over me when I’m greeted with a trough instead of urinals. Usually bars and stadiums. Right, places where aim is often impaired.
So the thought of just doing it in a public space wouldn’t be a matter of not wanting to. It’s that I know nothing would happen. Even if my bladder were bursting.
And there have been times when I’ve been walking home and nature was calling. Loud and strong. So bad, my teeth ached! And I would keep walking, thinking maybe behind that tree way, way off the path. Or, wow it’s really quiet around here. I could just…nah. I can hold it in. Not much further to go. Of course, the more I thought about it, the worse it felt.
Hey, Paris offers free toilets around the city. And Parisians primarily just drink wine. So what is it about Germany? A shortage of public toilets or is it a self-fulfilling prophecy that they aren’t needed? Is it my puritanical American way of thinking that a normal bodily function should be hidden away? Or is it that who cares attitude that lets Germans parade around in parks completely naked?
One of the first phrases I learned when coming to Germany was, “Haben Sie eine Toilette?” Who knew it should have been “Wo ist der nächste Baum?”
|
{
"pile_set_name": "Pile-CC"
}
|
//
// Main Stylesheet
//
@import "compass"
@import "h5bp"
// HTML5 Boilerplate Styles
@include h5bp-normalize
@include h5bp-base-styles
// Susy Grid Systems - choose one to customize
// @import "grid/fixed"
@import "grid/magic"
// Font Awesome icons
@import "font-awesome"
// Your own styles go here.
h1
color: #999
text-transform: uppercase
line-height: 1em
h2
line-height: 1.3em
kbd
background-color: #f5f5f5
border: 1px solid #dedede
padding: 0px 3px 2px
footer
margin-top: 3em
text-align: right
.container
// Force images to scale down to their container widths.
img
max-width: 100%
height: auto
// H5BP helper classes & mixins.
// @include h5bp-helpers
// Print styles.
@include h5bp-media
|
{
"pile_set_name": "Github"
}
|
Ionic dependence of glycylsarcosine uptake by isolated chicken enterocytes.
Dipeptide transport was studied in chicken enterocytes and its properties compared with those of Na+-dependent sugar transport. Results showed that 1) isolated cells were capable of accumulating glycylsarcosine (Gly-Sar) against a concentration gradient (2.5- to 3.0-fold accumulation). This uptake was maximal at pH 6.0, and it was inhibited by Na+-free medium and by ouabain; 2) uptake of Gly-Sar was not affected by methionine and was competitively inhibited by carnosine, with a Ki of 12 mM; 3) the protonophore FCCP inhibited both Gly-Sar and 3-oxy-methyl-D-glucose (3-OMG) uptake by the cells; 4) amiloride, a well-known inhibitor of the Na+/H+ exchanger system stimulated 3-OMG uptake and inhibited Gly-Sar uptake, its effects being greater at pH 7.4; 5) and monensin prevents the effects of amiloride on both sugar and dipeptide uptake. In summary, Gly-Sar uptake depends on extracellular Na+ in an indirect manner via its effect on H+ efflux, and it appears to be dependent on an inward H+ gradient.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
/*
*
* Copyright 2016 gRPC authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#ifndef GRPC_CORE_LIB_SECURITY_CREDENTIALS_JWT_JWT_CREDENTIALS_H
#define GRPC_CORE_LIB_SECURITY_CREDENTIALS_JWT_JWT_CREDENTIALS_H
#include <grpc/support/port_platform.h>
#include "src/core/lib/security/credentials/credentials.h"
#include "src/core/lib/security/credentials/jwt/json_token.h"
class grpc_service_account_jwt_access_credentials
: public grpc_call_credentials {
public:
grpc_service_account_jwt_access_credentials(grpc_auth_json_key key,
gpr_timespec token_lifetime);
~grpc_service_account_jwt_access_credentials() override;
bool get_request_metadata(grpc_polling_entity* pollent,
grpc_auth_metadata_context context,
grpc_credentials_mdelem_array* md_array,
grpc_closure* on_request_metadata,
grpc_error** error) override;
void cancel_get_request_metadata(grpc_credentials_mdelem_array* md_array,
grpc_error* error) override;
const gpr_timespec& jwt_lifetime() const { return jwt_lifetime_; }
const grpc_auth_json_key& key() const { return key_; }
private:
void reset_cache();
// Have a simple cache for now with just 1 entry. We could have a map based on
// the service_url for a more sophisticated one.
gpr_mu cache_mu_;
struct {
grpc_mdelem jwt_md = GRPC_MDNULL;
char* service_url = nullptr;
gpr_timespec jwt_expiration;
} cached_;
grpc_auth_json_key key_;
gpr_timespec jwt_lifetime_;
};
// Private constructor for jwt credentials from an already parsed json key.
// Takes ownership of the key.
grpc_core::RefCountedPtr<grpc_call_credentials>
grpc_service_account_jwt_access_credentials_create_from_auth_json_key(
grpc_auth_json_key key, gpr_timespec token_lifetime);
#endif /* GRPC_CORE_LIB_SECURITY_CREDENTIALS_JWT_JWT_CREDENTIALS_H */
|
{
"pile_set_name": "Github"
}
|
Are you facing problems in sourcing branded news for your publication? Get current, exclusive reports and analysis from Hindustan Times and Hindustan, two of Indias most respected and leading English and Hindi dailies!
Hindustan Times, the flagship newspaper of HT Media, is today the newspaper of choice of over 3.7 million Indians. It is the market leader of the National Capital Region and has in the last decade rapidly expanded its footprint across the length and breadth of the country. The newspaper has editions published from Delhi, Mumbai, Lucknow, Patna, Ranchi and Kolkata, thus dominating most of the country. On the other hand, Hindustan is one of the most widely read newspapers in the Hindi segment. It is known for its unflinching commitment to journalistic integrity and its fair, unbiased and balanced news reporting and analyses.
|
{
"pile_set_name": "OpenWebText2"
}
|
Knowing VPN Connection and the Different Choices Out there on the Market
VPN connection stands out as the formation of the non-public network in just a general public network that works just as if one’s machine was on the private relationship. VPN is definitely the way that many women and men go after they would love to encrypt their details and continue to keep them nameless on the net when they accessibility internet websites and whenever they deliver or receive some details. The nice factor is always that though this might seem like a domain for any privileged very few women and men, any one can subscribe for your assistance, realize the way to arrange their VPN and shortly, they may be on their own process to safeguarding their privateness on the internet. When using the on line turning out to be a gateway for dollars trade and trade, lots of individuals are trying to find a way to transact properly, to help keep their particulars dependable from hackers and spy ware applications. The nice information is the fact for any small-scale payment, all of that is now plausible.
VPN takes advantage of authentication methods to make certain that only approved buyers can hook up your network. Simply just, explained this is the safest solutions for anyone to maintain their details intact and secure because devoid of authentication, then it means that not one person goes to generally be equipped to accessibility your network. Putting together VPN may be very relatively easy while the method will differ a little bit depending on the company that a particular is making use of. When 1 is seeking the very best company via the internet, they are simply recommended to search for person critical reviews so they do not actually buy blindly. To attain this stage of stability, the service provider will use systems like L2TP (Layer Two Tunneling Protocol) or PPTP (Point-to-Point Tunneling Protocol. They're primarily made use of for Microsoft Home windows they usually make the transfer of knowledge from a single laptop to a different by using the world-wide-web extremely safe. It doesn't make a difference how big a link a single would really like to keep up given that VPN allows for manufacturers to attach for their branches countrywide also to link to other firms securely.
When establishing VPN in one’s home pc, the method that 1 should always abide by, whilst it can be merely a shorter a particular, will vary. As an illustration, if just one is connecting to a specialist network, they are going to be required to receive the proper server address with the systems administrator. Just enter the server address/domain name with the server that you just are connecting to. At times, you could possibly just would like to create the relationship and never hook up instantly by which scenario you'd just put in place but pick the “Do not join now” selection. Bear in mind these opportunities as talked about listed here are for home windows only. Other Working techniques would require several practices although not to fret as there is a lot more than adequate information on the internet. Since the VPN networks will cost financial resources, a single is suggested to be sure that they get theirs with the preferred to obtain enough price for his or her finances. VPN connections vary depending on the conditions. As an example, they can be site-to-site connections just where two or even more networks are connected to one another securely. The opposite style of VPN often is the remote connection just where one can hook up their own personal computer or cell product into a community, say agency network and accessibility tips from anywhere.
|
{
"pile_set_name": "Pile-CC"
}
|
---
abstract: 'FNCMa is visually double with a separation of $\sim$0.6arcsec. Sixty high-cadence VLT/[*UVES*]{} spectra permit the A and B components to be disentangled, as the relative contribution of each star to the total light entering the spectrograph fluctuates between exposures due to changes in seeing. Component A exhibits rapid line-profile variations, leading us to attribute the photometric variability seen by HIPPARCOS (with a derived $P=0.08866$d) to this component. From a total of 122 archival and new echelle spectra it is shown that component A is an SB1 binary with an orbital period of 117.55 days. The eccentricity of 0.6 may result in tidal modulation of the pulsation(s) of component Aa.'
---
Introducing FNCMa
=================
FNCMa (HD53974) is a bright ($V=5.4$mag) B0.5III star and visually double. Within about a century, the relative position of components A and B, which are separated by $\sim$0.6 arcsec, has changed marginally at most. A is brighter than B by about 1.2 mag.
Observations and data reduction
===============================
The ESO Science Archive contains 60 VLT/[*UVES*]{} echelle spectra of FNCMa obtained within 1.4 hours for a study of interstellar medium, and three more spectra from [*FEROS*]{} at the 2.2-m ESO/MPG telescope, La Silla. In 2009 and 2010, an additional 59 echelle spectra were secured with the [*BESO*]{} spectrograph, a clone of [*FEROS*]{} mounted on the Bochum 1.5-m Hexapod Telescope on Cerro Armazones.
As a result of variable seeing and imperfect guiding, some UVES spectra contain a significantly higher fraction of light from component B than others. Since the light combination is geometric it has no spectral dependency, and thus, under the assumption that certain spectral features are due to either A (e.g., Si[iii]{} 4553) or B (e.g., He[ii]{} 4540) alone, a simple linear set of equations can be used for the disentangling of the spectra from the two stars over the entire wavelength range. The inferred spectral light ratios, between 0.75 and 0.85, are in good agreement with the known magnitude difference.
Results
=======
[**FNCMa B:**]{} This component has a spectrum typical of mid-O main-sequence stars. Compared to the B0.5III primary, it would be considerably underluminous if the pair were physical. However, assuming an O subdwarf companion does not help because, then, component B would be about 2 mag [ *over*]{}luminous. Components A and B display the same set of interstellar Ca[sc ii]{} K lines except that the redmost one is significantly stronger in B. Considering also incipient emission in N[iii]{} and H$\alpha$, we conclude that component B is best described as an O6V((f)) background star.
[**FNCMa A:**]{} In the literature, FNCMa has a record of low-amplitude photometric variability and modulated spectral line profiles. But there is no consensus about its nature. Our analysis of the [*HIPPARCOS*]{} photometry yields a period of 0.08866d (2.13h; see left panel of Fig. \[FNCMa\]) with $\sim$0.02mag amplitude. The combination of spectral type, period, and amplitude makes FNCMa a $\beta$ Cephei star candidate, as already suggested by other observers. This is further supported by the rapid spectral line-profile variability of component A (however, at just 1.4h, the [ *UVES*]{} data string is too short and the [*BESO*]{} spectra are not sufficiently densely sampled to attempt an independent period determination). In any case, given the spectral variations seen in component A, we attribute the photometric variability to this component as well.
Much larger-amplitude long-term radial-velocity variability is apparent from the [*BESO*]{} data: FNCMaA is itself an SB1 binary with the following properties:
------------------------------ -------------------
Period \[d\] 117.55 $\pm$ 0.33
Periastron epoch \[JD\] 2453779.5 $\pm$ 4
Periastron longitude \[deg\] 247 $\pm$ 7
$e$ 0.60 $\pm$ 0.05
$K_1$ \[km/s\] 49.8 $\pm$ 3.5
$\gamma$ \[km/s\] 5.9 $\pm$ 1.5
------------------------------ -------------------
The radial-velocity curve of FNCMaAa is shown in Fig. \[FNCMa\] (right panel). Its relatively large amplitude suggests that the so-far (directly) undetected component FNCMAb is a fairly massive star. However, it appears too faint to be the carrier of the rapid variability.
Discussion
==========
The high eccentricity and moderate orbital period of the subsystem FNCMaAa$+$Ab may enable searches for a tidal modulation of the pulsation of component Aa. Since FNCMa is bright and situated in a region with numerous other pulsating OB stars, it might be worthwhile including it in the target lists of wide-angle asteroseismology satellites such as BRITE.
|
{
"pile_set_name": "ArXiv"
}
|
Quantitative study of osteoporosis model based on synchrotron radiation.
To investigate the changes of different periods of primary osteoporosis, we made quantitative analysis of osteoporosis using synchrotron radiation computed tomography (SRCT), together with histomorphometry analysis and finite element analysis (FEA). Tibias, femurs and lumbar vertebras were dissected from sham-ovariectomy rats and ovariectomized rats suffering from osteoporosis at certain time points. The samples were scanned by SRCT and then FEA was applied based on reconstructed slices. Histomorphometry analysis showed that the structure of some trabecular in osteoporosis degraded as the bone volume decreased, for femurs, the bone volume fraction (BV/TV) decreased from 69% to 43%. That led to the increase of the thickness of trabecular separation (from 45.05μm to 97.09μm) and the reduction of the number of trabecular (from 7.99 mm(-1) to 5.97mm(-1)). Simulation of various mechanical tests indicated that, with the exacerbation of osteoporosis, the bones' ability of resistance to compression, bending and torsion gradually became weaker. The compression stiffness decreased from 1770.96 Fμm(-1) to 697.41 Fμm(-1), and it matched the histomorphometry analysis. This study suggested that the combination of both analysis could quantitatively analyze the bone strength in good accuracy.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
1st time participating in the Holiday Card exchange, and what a wonderful introduction! Not only was it nice to receive an international Christmas Card, but it was extra nice/cool receiving one with the Country incorporated into the card itself.
Thanks and Cheers MhairiLC!
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
How do I unit test model validation in controllers decorated with [ApiController]?
As pointed out in this anwer to Asp.Net Core 2.1 ApiController does not automatically validate model under unit test, the automatic ModelState validation that ASP.NET Core 2.1's ApiControllerAttribute gives us only works when actualyy requestion the action at runtime, not by calling it with an invalid parameter in a unit test.
However, I still want to test if my action actually returns a BadRequestResult when supplying an incorrect model. Is there any way of doing this? I get that I can still manually check if ModelState.IsValid is false, and returning BadRequest() myself, but that kind of defeats the point of the automatic validation.
Am I stuck manually checking ModelState.IsValid after all, or is there a way to make use of the new ApiControllerAttribute model validation in a unit test?
A:
If you want to validate that the api's are returning a badrequest when the data annotations are broken then you need to do an api integration test.
One nice option is to run the integration tests via an in-memory client using the TestServer
Here's an example:
//arrange
var b = new WebHostBuilder()
.UseStartup<YourMainApplication.Startup>()
.UseEnvironment("development");
var server = new TestServer(b) { BaseAddress = new Uri(url) };
var client = server.CreateClient();
var json = JsonConvert.SerializeObject(yourInvalidModel);
var content = new StringContent(json, Encoding.UTF8, "application/json");
//act
var result = await client.PostAsync("api/yourController", content);
//assert
Assert.AreEqual(400, (int)result.StatusCode);
If you only need to make sure that the annotations is proper setup you can manually trigger the validation via the TryValidateObject method
var obj = new YourClass();
var context = new ValidationContext(obj);
var results = new List<ValidationResult>();
var valid = Validator.TryValidateObject(obj, context, results, true);
|
{
"pile_set_name": "StackExchange"
}
|
The TV drama has already left millions of viewers terrified with some claiming it was going to give them sleepless nights.
But two billboards advertising the new BBC adaptation of Dracula in London and Birmingham which come to life in the dark are likely to do exactly the same.
Bram Stoker's character cannot be seen in daylight on the posters, but he suddenly appears at night in a shadow thanks to specially-arranged lighting over stakes.
Bram Stoker's character cannot be seen in the daylight on a poster on Brixton Road in South London promoting the BBC's new gruesome adaptation of Dracula
Dracula appears at night in a shadow thanks to the specially-arranged lighting over stakes
An 'In case of vampires – break glass' box containing a stake also sits below the billboards – on Brixton Road in South London and Upper Dean Street in Birmingham.
The work was created by a creative team including Reuben Dangoor, a London-based Instagram artist known for his interpretations of British grime artists as gentry.
The BBC has created a number of unusual adverts for major series in recent years, including a polar bear appearing to jump out of a billboard for His Dark Materials.
It also came up with a Peaky Blinders advert using fan art and a Killing Eve poster campaign which simply said: 'Has anyone seen my girlfriend? #Crazy4Eve'.
Also involved in the Dracula campaign before the series began yesterday were Vikki Stephenson, James Fairfield, Dominic Lea and Mathew Rees from BBC Creative.
Reuben Dangoor: Artist who portrayed Stormzy as aristocrat and Diane Abbott as Kim Kardashian Reuben Dangoor is a graphic designer who became known in 2015 thanks to oil paintings depicting grime artists as aristocrats. The series, Legends Of The Scene, went on display at Tate Britain. He has designed a set for Stormzy's tour and wrote a satirical video in 2010 on hipsters called 'Being a D***head's Cool', which has had 12million views. Dangoor also produced a series of art around England at the 2018 World Cup, including manager Gareth Southgate putting his arm around his younger self missing a penalty at Euro 1996. Another of his famous works parodies when MP Diane Abbott was spotted drinking an M&S mojito on a London Overground train in April 2019, in the style of Kim Kardashian's iconic 2016 Paper magazine front cover. Dangoor has nearly 40,000 followers on Instagram, where the majority of his work is posted. Advertisement
The advert has been praised on Twitter, with one social media user saying: 'Dracula billboard that only comes alive - or undead - at night?! Genius.'
Others called it 'next level advertising' and 'pretty clever', while a fourth called it 'inventive, unique marketing'.
BBC Creative creative boss Olly Harnett told The Drum: 'Our campaign for Dracula leaves the audience in no doubt they can expect something fresh and unexpected from this extraordinary adaptation of the vampire classic.
'Our unique campaign is one of the most ambitious special builds we've ever undertaken – by day, a random assortment of stakes hammered into a billboard but by night, transformed, as the Count springs to life in the form of a looming shadow.'
Chris Hooper, head of marketing at BBC One, added: 'Coming from the makers of Sherlock, this version of Dracula is laced with dark humour and rock star swagger.
'We wanted our campaign to reflect Steven and Mark's fresh take on a classic character.
'So each element has been designed to surprise - from the cheeky campaign line, 'Bloody Legend', to the use of Lust For Life on the trailers, and this special build, which takes a playful, tongue-in-cheek approach to the legend.'
Dracula is played by Claes Bang in the new BBC adaptation, with Dolly Wells as Sister Agatha
Claes Bang, who has been tipped as a future James Bond, stars in the lead role as Dracula
The spooky billboard in London has been advertising the new BBC adaptation of Dracula
Aritst Reuben Dangoor put up this Instagram post last week featuring some of his artwork
Another of Dangoor's works parodies when MP Diane Abbott was spotted drinking a mojito on a train in April 2019, in the style of Kim Kardashian's iconic 2016 Paper magazine front cover
The much-anticipated gruesome adaptation, created by Mark Gatiss and Steven Moffat, who were behind Sherlock, kicked off on New Year's Day.
Yesterday's episode carried on the bloodshed with scene after scene of vampire gore, as the crew and passengers on a ship were stuck with Dracula on board.
The scenes have featured repeated shots of the vampire gorging on human blood across the first two episodes along with other gruesome images of the undead.
But despite the heavy promotion of the drama by the BBC, the opening episode was only the fourth most watched show on BBC One on New Year's Day with 3.6million.
However it created a huge impression with many viewers, who claimed it had been terrifying. One wrote on Twitter: 'How the hell am I supposed to sleep tonight?'
|
{
"pile_set_name": "OpenWebText2"
}
|
A Florida used car dealership was targeted by a team of thieves who used identity theft to "purchase" vehicles. By the time the dealer got the alert that the paperwork was falsified, the cars were gone. The dealership was able to recover one of the cars due to a bone-headed thief who returned about a dead key battery.
According to CBS Miami, on two separate incidents thieves posing as other people came in to purchase vehicles with falsified documents. The first vehicle that was stolen was an Infititi G37; suspects were captured by dealership cameras, but that car has yet to be recovered.
Another heist occurred when detectives say that Miskea Smith-Gray, 38, walked into The Connection Motors dealership with a younger woman and kids and gave a false driver's license then made off with a Cadillac SUV.
"Everything checked out…. the picture looked legit everything matches perfectly. The hologram and everything was to the "T" down perfectly...I'm astonished I couldn't believe someone would Go through with that so calmly and family like…she had two kids with her including a baby. Terrible." - Felipe Pereira, dealership employee.
The next day Smith-Gray returned to the dealer because the key-fob wasn't working correctly. Dealership staff told her to wait while they fixed it, that is when they called the police to come and have her arrested. Authorities charged Smith-Gray on grand theft charges and and organized fraud. They also arrested Corey Wilson, 35, on unlawful possession of ids.
If you have a question, a tip, or something you would like to to share about car-buying, drop me a line at AutomatchConsulting@gmail.com and be sure to include your Kinja handle.
|
{
"pile_set_name": "OpenWebText2"
}
|
Beware, festivals ahead
We’ve been through bad times, sad times, maddening times. Name it, we can claim it: terror attacks, truant monsoon, metro collapses, swine flu, and – horror! – the frisking of the sacrosanct SRK. But now the season of celebrations is upon us. The drought may still be a damper, but nothing can really wash out the big, fattening Indian festival. These are going to descend on us with the exuberant determination of dance show contestants.
Am I complaining? Pulverize the thought like a kilo ofpista, and serve it up in a barfi. It’s about time we had something to be joyous about. Yesterday was Parsi new year, and we celebrated without a care for the extinct vultures or the Veras/Virafs lost to an unending epidemic of emigration. We propitiated the universal festive trilogy: we prayed, we feasted, and we schmoozed schmaltzily with the larger clan. The name is Bonding. Jamshed Bonding.
Over the previous weekend there was dahi-handi, Gokul Ashtami and for thosewho send out Independence Day sms greetings, that as well. However, patriotic versions are no patch on the parochial brand of celebration. It’s not tough to flag the reasons.
One, I-Day is a wannabe newbie. Two, it is artificially created instead of having naturallyevolved deep in the bowels of time. Three, while it may have developed a ritual, this does not include a must-have dish, which is the mark of a true, steeped-in-the-basundiethnic or religious occasion. Sorry, but a tri-colored khichdi is simply not the real thing.
This coming Sunday, an undeterred, if not unmasked Maharashtra will celebrate Ganesh Chaturthi. This is the first after 26/11 and all the unrelated calamities which crushed us under their buggernaut wheels. However, more than the god of auspicious beginnings, we need the guy who presides over the end of an inauspicious cycle. Our multi-tasking ‘Ganpati bappa’ is also the remover of obstacles, Vighneshvara, so he should be able to do that too without missing a beat or a modak. Fortunately, he does not subscribe to the exclusivist agenda of the Shiv Sena or MNS. In fact, he is as secular as a Mumbai local.
The political Ganeshotsav’s counterpart, the Sarbojonik Pujo will arrive along with Ma Durga a month later, culminating in Dussehra. Again, there has seldom been such pressing need for the triumph of good treatment over swine flu and assorted evils. Ramzan Eid will be ushered in around the same time as the mother goddess, riding on its own shakti ofa month of ritual fasting.
In fact it’s serial celebration from August to December, and beyond. There’s Diwali to lighten the darkness, the peace-on-earth promise ofChristmas, and the obligatory, if ersatz, cheer ofNew Year’seve. No doubt, ringing in the first decade of Y2K will give us more reason to say ‘Why to care?’ as we overdose on the bubby and lunge to embrace the nearest bunch of balloons.
Grudge us not our festive excesses. We need them as surely as a TV show needs TRPs and Sehwag doesn’t need the DDCA. A sociologist once predicted that if there was no mass celebration of Durga Puja, there would be mass suicides in Bengal. True, the old pattern of flood and famine there has ended, but we all still want festivals to unshackle us momentarily from the unrelenting cycle of dearth and redearth.
They are the safety valve ofpressured times.We need insane celebration to preserve our sanity. We need the gorging on mithai and the forging of community bonds. The first because we know we’ll be back to the treadmill soon after; the second to nurture the hope that brothers must, at some point, stop being enemies.
***
Alec Smart said: “What was the immigration officer’s retort to SRK’s ‘My name is Khan’? ‘Kaminey!’”
DISCLAIMER : Views expressed above are the author's own.
Author
Bachi Karkaria's Erratica and its cheeky sign-off character, Alec Smart, have had a growing league of followers since 1994 when the column began in the Metropolis on Saturday. It now appears on the Edit Page of the Times of India, every Thursday. It takes a sly dig at whatever has inflated political/celebrity egos, and got public knickers in a twist that week. It makes you chuckle, think and marvel at the elasticity of the English language. Bachi Karkaria also writes Giving Gyan in the Mumbai Mirror, and its fellow publications in other cities. It is a shooting-from-the-lip advice column to the lovelorn and otherwise torn, telling them to stop cribbing and start living -- all in her her branded pithy, witty style.
Bachi Karkaria's Erratica and its cheeky sign-off character, Alec Smart, have had a growing league of followers since 1994 when the column began in the Metr. . .
From around the web
More from The Times of India
Comments
Top Comment
()
Author
Bachi Karkaria's Erratica and its cheeky sign-off character, Alec Smart, have had a growing league of followers since 1994 when the column began in the Metropolis on Saturday. It now appears on the Edit Page of the Times of India, every Thursday. It takes a sly dig at whatever has inflated political/celebrity egos, and got public knickers in a twist that week. It makes you chuckle, think and marvel at the elasticity of the English language. Bachi Karkaria also writes Giving Gyan in the Mumbai Mirror, and its fellow publications in other cities. It is a shooting-from-the-lip advice column to the lovelorn and otherwise torn, telling them to stop cribbing and start living -- all in her her branded pithy, witty style.
Bachi Karkaria's Erratica and its cheeky sign-off character, Alec Smart, have had a growing league of followers since 1994 when the column began in the Metr. . .
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
asp.net mvc jquery clientside validation for dynamic forms
ok i have a complete form in my database as row for example name of the field ,is mandatory, sortid, regularexpression, datatype, maxlength , default value etc. So the form is completely dynamic.
now i want to perform the client side validation on the form . What will be the best practice for doing that? like i have to see that if the field is mandatory check it for null and if not then leave it on the client side . i am thinking about setting hidden field for it .
can u guys guide me better in this scenario.
A:
You could dynamically construct javascript to test this form on client. Or you could use jquery.validate plugin and do right mark-up of your html.
|
{
"pile_set_name": "StackExchange"
}
|
This circa 1870 cottage is located in the heart of town. It's a quiet house with 2 small poodles and 3 chickens who will welcome you into our home. Easy walk to pubs and restaurants for your evening meal. Or relax on the beautiful back deck enjoying the peace.
Large bedroom with comfy queen sized bed.
The house is in a residential and centrally located part of town. It is within easy walking distance to pubs, cafes and restaurants.
Great place to stay, Fiona was layed back and comfortable to be around, as were her 2 dogs, house was clean and the bed was comfy, highly recommend if you're looking to stay in Muswellbrook, value +.
Keone2017-05-26T00:00:00Z
Fiona's place was just as we had hoped-quiet, clean, and had everything we needed. Fiona is a very accommodating and thoughtful host, and I would definitely recommend this listing for those needing a comfortable overnight stay in Muswellbrook.
Lucinda2017-04-09T00:00:00Z
Good place to stay. Fiona is a friendly host and the two poodle like attention
Frank2017-07-14T00:00:00Z
Awesom place, will definitely be booking again
marvin2017-08-17T00:00:00Z
Fiona was a welcoming and friendly host! Her place is lovely - cosy, comfortable and clean!
Erin-Jane2017-05-27T00:00:00Z
I really enjoyed my stay at Fiona's place. Just my second Airbnb station in my just started Australia visit (from Germany) I felt like home, warmly welcomed by Fiona and her nice poodles. Fiona guided me very well, what to visit in Muswellbrook, and I enjoyed the conversation with her and started learning about Australia … Many thanks!
Welcome to the Upper Hunter Valley! We invite you to stay at our sweet home in Muswellbrook. We offer a clean, comfortable space where guests should feel right at home. This space is perfect for couples or solo travellers or business travellers. Located near the nature reserve areas. There are few nice walking paths in the nature reserve areas near our house. You can have a nice short walk in the afternoon or in the morning. You also can fly a kite in the beautiful area.
We have one newly renovated room available for the guests, which lovely, sunny, airy with a Paris double-size 4 poster bed, pool view windows. You also can use the built-in wardrobe in your room.
It is comfortable cool in the night. You can open the window in the night and a breeze rolls in if you like in the summer time. The reverse cycle air conditioner just installed in 2017. You can have a warm room in the winter or the cool room in the summer. You also have the 36" TV at your room. Just remember lower the volume after 10:00 pm. You will be the only guests to enjoy the guest bathroom and the toilet if we don't have any visitor. There is a heating lamp in the guest bathroom.
A stay with us includes breakfast of toasts, cereal, Vegemite, jam, butter, milk, tea and coffee.
Your room is not next to our room. Our bedroom is at the end of the hallway. We always close the hallway door, then the guests can keep your own space.
Our amenities include:
-Air conditioning and heateing in your room & living room
-Tower fan for the warm months in your room
-36" TV in your room
-fold down desk in the wardrobe for the laptop or book
-Swimming Pool
-The breakfast bar can become your laptop working area
-Free WIFI
-Free Off-street parking
-BBQ area and facilities
-Laundry
-Newly renovated bathroom
-hair dryer in the bathroom
-Affordable rate
You will be dining in our dining room or the breakfast bar or the outdoor dining area or the front yard.
Our home is located in a safe, friendly neighborhood. It's just a short drive to the shopping centres, cafes, restaurants, cinema, pubs. It's also an easy drive to the Upper Hunter Valley main attractions (the hunter belle cheese factory, Lake Liddell, Lake Glenbawn and the wineries).
We are a multicultural family. Paul is local from Muswellbrook, Australia and I am from Taipei, Taiwan. We have an 1 year old baby girl named Aurora. I also have some beautiful, good quality Taiwanese merchandises which you can buy it from me if you are interested it.
I'd love to make you a Taiwanese or Chinese tea if I have the time. We can drink the tea and talk.
We welcome babies and child. We have a baby bassinet for your baby. We also have a change table, a playmat and a highchair.
We welcome cheerful, well-intentioned travellers!!
Come along.
Look forward to meeting you soon!
Our home just 1.5 hours drive from Newcastle and 3 hours drive from Sydney. We do recommend guests have a car when staying at our house. We have the free off street parking. Or you can take the taxi or bus from the Muswellrbook train station. There are many Upper Hunter Valley attractions near our home. There are always some events around the Upper Hunter Valley. Muswellbrook is a great place to spend your weekend or holiday.
5 mins walk to the nature reserve area
10 mins walk to a cafe
3 mins drive to the Hosptial
4 mins drive to the Marketplace Shopping Centre
7 mins drive to the Hunter Belle Cheese Factory
17 mins drive to Pukara Estate- Taste the grove, olive oil and vinegar
18 mins drive to Lake Liddell Recreation Park
28 mins drive to Two Rivers Wines
28 mins drive to Lake Glenbawn national Park
46 mins drive to the Burning Mountain
Una and Paul's house is a very clean and tidy one. The house and the room have all you need for a comfortable and happy stay. But what makes it special is the hosts; Una is really kind, hospitable and helpful with all kind of local information. Definitively a very good experience.
Silvia2017-04-27T00:00:00Z
Lovely bright room in a clean and friendly family home. Una took great care of us and was a very attentive host. I recommend as stay with Una and Paul!
Sally2017-03-15T00:00:00Z
Una and Paul were friendly and left me to do my own thing as I had hoped they would. Very happy with my stay.
Merrick2017-05-15T00:00:00Z
Una and Paul will look after your every need. They are fantastic hosts and we couldn't have asked for more. The location is great and handy to some wonderful wineries, as well as a terrific cheese factory, Yum. Thanks
Wendy2017-07-01T00:00:00Z
可爱的干净和安静的地方。
Demus2016-11-03T00:00:00Z
very clean house
Owen2017-04-04T00:00:00Z
Una and Paul were so welcoming and they made me ferl comfortable straight away. The room is very well equipped with air conditioning, a flat screen TV, bedside lamp and alarm clock and even a desk and stool. Una and Paul's home is spotlessly clean. Una had breakfast set out for me which I appreciated. A great place to stay.
Annabel2017-06-21T00:00:00Z
Una and Paul warmly welcomed us into their family home. Breakfast items were all made easily accessible and the table was beautifully set for dinner and breakfast as required. Although we were late arriving and made an early departure nothing was too much trouble for Una.
Margaret2017-04-30T00:00:00Z
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
Jeff and I are "empty nesters" so have the time and space to share with fellow travellers.
Our place ticks all the boxes for the solo traveler, couples and traveling business people looking for a quiet place with a nice clean comfy bed to rest your head.
I've said it before and I'll say it again, our aim is for you to arrive as a guest but leave as a friend!
Home style 2 course meal is available on request @ $20 per person, meals must be ordered/arranged prior to your arrival please.
We have undercover/carport parking for your vehicle only, however we do have ample room for a caravan/trailer etc here also.
Only motorbikes get locked in our garage.
We stayed for two nights at Tami and Jeff place and we absolutely enjoyed it! Everything was super clean, and the bedroom was perfect as it had everything we needed from cold water to chocolates and very comfortable bed. Tami set up breakfast for us in the morning which was such a delight and tasty too. There was much laughter in the evening as we shared glass of red in beautiful garden. We utterly enjoyed both of Tami and Jeff's company..and they really are the perfect hosts. Thank you so much for your hospitality and we would highly recommend this place to anyone!
Alan2016-10-27T00:00:00Z
Tami and Geoff were exceptionally generous hosts and made our stay very special. We were running late and on our way asked for restaurant recommendations in the area. They arranged a lovely home baked meal delivery for us so we could eat and chat with them in the evening. The room was lovely, the bed super comfortable, their home a delight. I'd strongly recommend Tami to anyone.
Laura2016-10-05T00:00:00Z
My partner and I stayed for one night on a long drive from Melbourne to Brisbane and I must say it was exactly the rest and revival stop we were after! Tami and Jeff were so warm and welcoming as we arrived at their peaceful and picturesque property. The room provided was absolutely beautiful, with a vey comfortable bed to match! A freshly made continental breakfast was laid out on the table as we awoke the next morning, including freshly squeezed orange juice and barista made coffee. Overall the experience was great, our hosts provided everything we needed at no extra hassle and made us feel like we were part of the extended family, and we would definitely recommend them to anyone passing through!
Lexi2016-09-26T00:00:00Z
Tam dazzled us with hospitality, expansiveness, and chatter. You will love the venue, the quiet and the natural setting. Take the time to spend time at Muscle Creek with Jeff and Tam's place. you won't be disappointed.
We had a fantastic experience with Tami & Jeff. They couldn't have been more welcoming and the appointment to detail from Tami was better than a 5 star Hotel! The house being on acreage not far from town was so tranquil. The room, bed and private bathroom were spotlessly clean as was the rest of the house. The very comfortable bed and fresh linen was just what we needed after a long motorbike ride and the bike was put in the garage over night. Breakfast was a feast with new, individual packaging just for us. They knew just when to leave us alone and provided great chats when we wanted that too. I was particularly impressed with the tea and water tray all set up on the kitchen bench for us to help ourselves whenever we wanted and the chocolates on the dresser in our room. A lovely couple, highly recommend!!
Shauna2016-10-01T00:00:00Z
Fantastic place with a garage for our motorcycles, and roo's hopping around. The dogs are very entertaining! Tam and Jeff are great hosts, thank you so much for having us!
Elmer2017-06-12T00:00:00Z
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
New House in new estate. Own bedroom with King single bed, own bathroom and toilate. Use of whole house, cooking,laundry and garage if required. Breakfast included.
Close to all ameneties with Muswellbrook Fair 1 klm away.
Available Monday to Friday.
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
1
Bilik tidur
Russley Cottage c. 1895 is nestled under the Segenhoe Mountain on the banks of the Upper Hunter River.
Immerse yourself in nature and enjoy an abundance of native birds and wildlife and reinvigorate your senses.
Russley Cottage is charming and bursting with character. It is private and overlooks river flats and lush paddocks. The neighbouring properties include the world renowned thoroughbred studs of the Segenhoe Valley.
8 minutes south of Scone and a 2 hour 50 minute drive from Sydney, via the Hunterlink and New England Highway.
Russley Cottage is fully self contained and includes wrap around verandas, a rustic eat-in kitchen and living room, complete with romantic open fire place. BBQ available on request.
Go fishing on the Glenbawn Dam (15 mins drive) or fish in our secret bass hole just a few moments walk over our Poplar Paddock.
You don't need to go far to find historic pubs offering great lunches and dinners or step it up for a fabulous meal at the "Cottage Restaurant" in Scone or the award winning best country pub in 2014 "Graze" at Willow Tree.
If polo is your thing you will find the Scone Polo Fields on the Waverly Road, Gundy, only 20 minutes drive.
For the golf enthusiast Aberdeen offers a 9 hole (18 Tee) golf course set on the banks of the Hunter River, 5 minutes down the road.
Walk the Burning Mountain or brave it and explore the Barrington Tops World Heritage National Park.
Or just take it easy and lie by the river or lounge in the park like gardens and watch the clouds waft gently across the sky.
We had such a peaceful and relaxing weekend away staying at Jen's cute country cottage. Surrounded by beautiful countryside and fresh air, it was just the break we needed and the accommodation had everything we needed. Loved that we could take the dog too! Thanks Jen. We'll be back.
Merran2017-07-09T00:00:00Z
We booked Russley Cottage for a couple's weekend away and we couldn't have been happier with our stay. Jen was such a welcoming host and instantly made us feel at home. The Cottage was situated amongst the most scenic countryside you could imagine. The rooms were gorgeously decorated, clean and cosy. We enjoyed sitting by the fire sipping wine, playing board games and exploring the surrounding areas. We can't wait to return and savour Jen's delicious lemon drizzle cake again! Could not recommend Russley Cottage more!
Annalisa2017-07-30T00:00:00Z
Had an amazing Stay. Jennifer is a wonderful host who went above and beyond especially with our late check-in. Highly recommend this stay to anyone in the region. The property has all the makings of many great things to come. Tastefully decorated with a wonderful feel. Thanks again xx
Bec2017-05-15T00:00:00Z
An amazing and charming place!
Lena2017-07-04T00:00:00Z
A fantastic cottage, wonderful host, gorgeous surrounds, quiet, cozy and beautiful. We had a great weekend with our family at Jen's cottage, and would highly recommend anyone wanting a secluded (yet close to enough to the shops if you need anything), time away in this cozy little cottage. My family and I loved it so much we are talking about coming back again for our next holiday! 5 stars!
jessica2017-06-12T00:00:00Z
Russley cottage was beautiful and peaceful, the cake left by host Jen was delicious! We will definitely be back!
Nikki2017-05-07T00:00:00Z
Beautiful spot, lovely old cozy cottage. Loved the open fire and the quiet starry night.
Dave2017-07-22T00:00:00Z
The house was lovely, very clean and tastefully decorated. Jen also made us a cake on arrival, which was so welcoming and delicious. Lovely quiet neighborhood and beautiful surrounds. A great stay!
Georgie2017-07-06T00:00:00Z
Jenis bilik
Keseluruhan rumah/apt
Jenis Penginapan
Rumah
Memuatkan
6
Bilik tidur
I am an experienced SUPER HOST.
This king master bedroom is great for a couple and a single. With this room you get:
- million dollar views with private access to the alfresco
- huge comfy king bed with fresh linen, towels and soap
- private use of its ensuite, which has a double-sized shower and seperate toilet
- shared use of two TV/Foxtel (Entertainment, Movies, Sports, Racing) rooms.
- shared use of the fully appointed kitchen, laundry and all other amenities
It's a home-away-from home!
Short and long stays are welcome :))
Check out our amazing discounts on our Airbnb page, or the RATES page of our TRIG POINT ESTATE AIRBNB website - you will need to search the Internet for it but its worth looking at.
This master bedroom has a walk-in-robe. It also has bedside tables and lamps, and a ceiling light fan - great for staying cool on hot nights. As well it has a beautiful full sized ensuite - which makes the room bigger than most London or Sydney apartments!
The fully appointed kitchen has everything you need to make delicious meals, including crockery, cutlery, cookware, spices, sauces and condiments.
The house is nestled on the side of a hill overlooking the Segenhoe Valley. It is approximately 17 kms from Scone, 10 kms from Aberdeen and 25 kms from Muswellbrook. For more information about the house and its LOCATION, search the Internet for TRIG POINT ESTATE AIRBNB.
Karla is a lovely host, and we thoroughly enjoyed our stay! She has a gorgeous home and her puppy Shiloh is a darling! A must stay if you are in the upper hunter region!
Dan2017-05-21T00:00:00Z
Karla is an amazing host. She made me feel very welcome and created a wonderful environment for my stay. I recommend stayng in her place very highly.
Vinton2017-07-14T00:00:00Z
Absolutely wonderful experience in Karla's beautiful home to stay. We are amazed by the beautiful rural view around the area... Karla is so friendly n kind n offer great service.
Jing 2017-06-02T00:00:00Z
A lovely spacious family home in a lovely quiet location. K your host is very accomodating and makes you feel very welcome. Oh yeah so does lil Shiloh, her pet staffy! I would recommend whether you are looking for short or long term stay with very reasonable rates
Dan2017-06-19T00:00:00Z
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
Treat yourself and your family/friends to an enjoyable weekend getaway in the Hunter Valley while having a marvellous stay at this stunning, fully renovated 4 bedroom vacation home.
This home is perfect for families with kids, couples, singles, group of friends or anyone who would like to have a relaxing treat any day of the week.
Each room is fitted with NEW beds (Room 1&4 Queen/Room 2&3 Double). An extra single sleeping mattress can be provided if necessary.
Each room has its own key and you will experience absolute privacy. The living area is spacious and comes with a big TV, couches, air conditioner/heater. Brand new kitchen comes fully equipped with all the cooking utensils including stove, oven, refrigerator, freezer, microwave, toaster, slow cooker. BRAND NEW Bathroom with fresh towels provided daily. Enjoy the sunrise on the lovely veranda while you sip your favourite cup of coffee/tea. This is your home away from home!
Welcome to Denman- The pride of the Hunter
Welcome to one of New South Wales best-kept secrets, nestled in the heartland of the Upper Hunter's vineyards, horse studs and olive groves with the magnificent Wollemi National Park to the South West and the Goulburn National Park to the West.
Situated on the Golden Highway and part of the Greater Blue Mountains Drive, near the banks of the Hunter River, Denman is a welcoming community presenting the true charm of yesteryear.
Denman is a growing town that features many opportunities for visitors and potential residents, with a relaxing country experience, fine food, outstanding wines, friendly people, excellent shopping and spectacular scenery.
Denman has become popular with day trippers to experience the wineries and fine food the district has to offer.
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
'The Depot' is in the heart of the Hunter Valley horse stud & wine country . Set up as a gallery/house, it is brimming with art ,books ,furniture and bespoke pieces . Inviting and spacious , super cool &nestled within park like grounds .The house is owned by an Australian artist and her husband and set up as their family base. The Depot is unique ;-a converted army warehouse dating 1940s. A magical escape for couples, solo adventurers, business travellers, and families .
Jenis bilik
Keseluruhan rumah/apt
Jenis Penginapan
Rumah
Memuatkan
8
Bilik tidur
Situated within a stunning 300 Acre farm, this beautifully furnished, spacious home has multiple open-plan living areas. With several open fireplaces and an array of outdoor living areas this luxurious dwelling is versatile and accommodating no matter the season.
The high ceilings and bright open spaces of this single story home provides an array of living areas to entertain or retreat to. Every one of the five bedrooms within the main house boasts spectacular views of the hunter valley landscapes and is luxuriously furnished with high quality linen.
The panoramic vista of the surrounding hills is the perfect back drop for Al Fresco dining on the extensive veranda which surrounds the house; perfect for winter and summer, as it is complete with an outdoor fireplace.
Alternatively, enjoy your evening relaxing by one of the houses two indoor open fire places.
The house also offers a swimming pool with cabana, which is ideal for unwinding on a warm day.
As an equestrian property we are able to offer guests the chance to stay with their OWN horses. Both stables and paddocks are available for lease during your stay and with the ample country to explore, you wont be lost for places to ride.
No matter the season, the charm and tranquil surroundings of this beautifully appointed home will ensure you have a wonderful stay.
20 minutes drive from Scone and 5 minutes to our local village of Gundy, which has a local store and popular pub - The Linga Longa Inn
Jenis bilik
Bilik berkongsi
Jenis Penginapan
Rumah
Memuatkan
10
Bilik tidur
Within a mature three acre garden with mountain views with near by famous Australian Thoroughbred breeding studs, Barrington Tops National Park, Ellerston Polo & Gundy Polo grounds and of course all the Hunter Valley Vinyards. Your horse welcomed,
You may bring your horse to enjoy the horse riding around Gundy or if you are playing polo Gundy is handy to stay. The 3DE course is also near by.
An extra charge will be made if you bring a horse, field or stable.
Village has famous Linga Longa Pub which does bar food as well as restaurant. Local shop, tennis courts, Anglican Church, river to swim in.
A very cute cottage with lovely gardens nestled away in Gundy. Family friendly as well. 15 min to Scone town centre. A lovely place to relax and recoup!
Dan2017-05-13T00:00:00Z
Great little cottage, simple but convenient. Beautiful garden full of flowers and trees. 50min away fron Barrington tops National park. We had a wonferdul stay.
Laurence2017-04-17T00:00:00Z
Jenis bilik
Keseluruhan rumah/apt
Jenis Penginapan
Rumah
Memuatkan
3
Bilik tidur
The Mitchell Cottage is a freshly renovated Country Cottage ideal for families or group of friends. It is situated along side the Hunter River within an old established working family property of some 30,000 acres. Plenty of history to explore.
Our family had an absolutely amazing Easter weekend at Belltrees staying in White Cottage right next door to Mitchell Cottage. Serena couldn't have been a more accommodating host, looking after our large extended family and graciously giving her time to show us around this magnificent and historic station. It really is a breathtaking place - especially the view from the top of one of the property's hills. There's plenty to explore from the old church to the historic sheering shed and of course the property's grand home and pioneer buildings which Serena gave us a tour of. White House is the original homestead built on the property and is very cosy and tastefully restored with lovely touches. We spent a lot of time chilling on the lawn in the sun, looking out over the hills and hearing the cockatoos sing up a chorus as they fley overhead. We also enjoyed a traditional lunch at the very country Gundy pub, the Linga Longa Inn. I've grown up in the country (now city dweller) and this was an experience I won't forget. I'll definitely be back. A must for international visitors and city folk keen to get a taste of Australian history.
Jane2016-03-30T00:00:00Z
We are so glad we picked Michell Cottage, Gundy for our weekend getaway and it is worth every bit of the 3+hours drive to get there. This is a special place - sitting right next to us is the original White Cottage built 1832! The Mitchell Cottage is very clean, tidy, comfortable and cosy and it is surrounded by this incredible serenity of Belltrees and its rich history. The highlight of the trip is the Belltrees Homestead - please don't leave without visiting this incredible residence. And the host, Serena, thank you so much for looking after us well, showing us around, taking us to the hill top to see the amazing view of the property and introducing us to the rich history of the area. You are the best! It is an unforgettable stay!
Luis2016-04-05T00:00:00Z
Jenis bilik
Keseluruhan rumah/apt
Jenis Penginapan
Rumah
Memuatkan
6
Bilik tidur
The comfortable cottage is situated in a private tranquil location amongst an olive grove giving it a peaceful and relaxing ambience. Yet it is only 10 mins drive to Singleton CBD and 30mins to the Hunter Valley vineyards, concerts, & gardens.
The cottage is comfortable and character filled. It features a modern TV and comfortable bedding - 2 queen beds and 2 single beds - sleeping 6. The private large covered rear deck has a BBQ and table setting making a great location for relaxing outdoors amongst the tranquil olive trees.
The cottage is located on a 105 property which is mostly an olive grove and has cattle grazing. Several kangaroos reside amongst the olive grove and are usually sighted near the dam most evenings. The elevated property has views over the neighbouring diary farms and cattle properties. The sunsets are spectacular over the distant ranges and it is highly recommend arriving in time to enjoy them.
A little far from hunter valley, but it's only 15 mins drive from the town where you can find restaurants and supermarkets. The house is nice and clean, as shown on the pictures. The only thing I would comment is there is a lot of flies within the house ( which I think it's probably quite common in countryside).
Julia2016-10-09T00:00:00Z
Great stay. David's cottage was presented exactly how it was advertised.
Faris2016-09-22T00:00:00Z
We had the best stay at the cottage! The olive groves were beautiful and we enjoyed a great picnic whilst watching the sunset- heavenly! Charlie the dog was amazing, we loved him! Overall, great stay, we would definitely love to stay again!!!
Giverny2016-10-03T00:00:00Z
My partner and I really enjoyed our stay at this gorgeous cottage. The hosts were very accommodating and the cottage was in a lovely spot with plenty of space and privacy, lots of nice extra touches and a great view. We would definitely stay there again.
Danielle2016-05-02T00:00:00Z
David's place was really nice, The property was perfectly ready for our arrival, awesome location and just what we wanted for a quite night away from everything else.
Scott2016-08-27T00:00:00Z
David was a great host - easy communication leading up to the stay and made our quick stop over very easy! Nice verandah and outlook onto property.
Duncan2016-10-07T00:00:00Z
Very nice house~ the dog is very cute !
Shu2017-06-28T00:00:00Z
Quiet, spacious and very comfortable
Ruth2017-05-04T00:00:00Z
Jenis bilik
Keseluruhan rumah/apt
Jenis Penginapan
Rumah
Memuatkan
6
Bilik tidur
RUSSLEY RURAL RETREAT - The Giddy-Up Room
A charming country homestead set in 17 acres of rolling pasture and established gardens. Bordered by the Hunter River and Segenhoe Road amidst renowned thoroughbred horse studs, polo fields, historic pubs, wineries, great restaurants, picturesque walking/horse trails and close to Scone township.
Accommodation: Four private guest rooms for one big group or individually. The rooms are of period design with a funky twist and lead onto wrap-around verandas. All rooms have access to the shared lounge with open fire and large established gardens.
Included: Light breakfast, WIFI, swimming pool, tennis court, river access, horse paddocks. (The Maharani and The Boho rooms have their own en-suites.)
** Should you wish to book more rooms for other guests in addition to the Giddy-Up Room please do so via airbnb Russley Rural Retreat -The Maharani Room, The Bobby Dazzler Room or The Boho Room
The neighbours are horse studs and lucerne farms.
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
Treat yourself and your family/friends to an enjoyable weekend getaway in the Hunter Valley while having a marvellous stay at this stunning, fully renovated 4 bedroom vacation home.
This home is perfect for families with kids, couples, singles, group of friends or anyone who would like to have a relaxing treat any day of the week.
Each room is fitted with NEW beds (Room 1&4 Queen/Room 2&3 Double). An extra single sleeping mattress can be provided if necessary.
Each room has its own key and you will experience absolute privacy. The living area is spacious and comes with a big TV, couches, air conditioner/heater. Brand new kitchen comes fully equipped with all the cooking utensils including stove, oven, refrigerator, freezer, microwave, toaster, slow cooker. BRAND NEW Bathroom with fresh towels provided daily. Enjoy the sunrise on the lovely veranda while you sip your favourite cup of coffee/tea. This is your home away from home!
Welcome to Denman- The pride of the Hunter! Welcome to one of New South Wales best-kept secrets, nestled in the heartland of the Upper Hunter's vineyards, horse studs and olive groves with the magnificent Wollemi National Park to the South West and the Goulburn National Park to the West. Situated on the Golden Highway and part of the Greater Blue Mountains Drive, near the banks of the Hunter River, Denman is a welcoming community presenting the true charm of yesteryear. Denman is a growing town that features many opportunities for visitors and potential residents, with a relaxing country experience, fine food, outstanding wines, friendly people, excellent shopping and spectacular scenery. Denman has become popular with day trippers to experience the wineries and fine food the district has to offer.
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
Situated within a 300 Acre farm, this elegant country annex adjoins the main house, yet offers its own entrance, bathroom and sitting room. With views overlooking the stunning Upper Hunter landscapes and abundant wildlife; twitchers paradise.
The Country House Annex has a private sitting room with TV - fridge and tea making facilities.
As an equestrian property we are able to offer guests the chance to stay with their OWN horses. Both stables and paddocks are available for lease during your stay and with the ample country to explore, you wont be lost for places to ride.
20 minutes drive from Scone and 5 minutes to our local village of Gundy, which has a local store and popular pub - The Linga Longa Inn
A lovely family home with spacious guest room, very comfy bed and lovely ensuite bathroom. Very warm hosts ( Peter and Harry) made us feel very welcome. I wouldn't hesitate on returning in the near future.
Dan2017-08-27T00:00:00Z
A beautiful rural retreat. Perfect stay as a getaway from the hustle and bustle. All needs were catered for.
Jane2017-03-05T00:00:00Z
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
Early Australian pioneer, settler's Cottage over looking the Hunter River nestled within a 30,00 acre working rural Property; BELLTREES. Three separate bedrooms with ensuite bathrooms. Open fire place , sitting room and kitchen. Quiet and romantic.
Serena is a terrific host. On arrival the fire was roaring and the accommodation beautifully presented. She then made a time to take us on a tour of her property in her 4WD, and explained some of the history of Belltrees. The estate is a great place to spend time, and the surrounding area needs some time to explore - we planned too short a stay but will hopefully return for longer one day.
Rob2016-10-01T00:00:00Z
A rustic rural cottage of great historic significance . Don't book if you want state of the art facilities or luxury but do stay if you want a peaceful break in beautiful countryside and enjoy nothing more than a glass of wine with a book by an open fire and a simple meal and be woken by birdsong. Bell tree is a delightful way to step back in time and unwind.
victoria 2017-08-06T00:00:00Z
We had an amazing weekend at the White Cottage. Despite some booking issues Serena was incredibly accommodating. The open fire place is what sold it for us. We were even given a tour of the beautiful property by Serena who was super knowledgeable on the history of Belltrees and the family. We enjoyed a lovely walk around the farm, fed some donkeys and visited the old shearing sheds. Highly recommend a weekend here. We will definitely return!!
Rebecca2016-06-26T00:00:00Z
We had such a lovely stay at The White Cottage. The house was lovely and the setting picturesque. We arrived to a warm house and a fire set. We would definitely stay again.
Jo2017-08-19T00:00:00Z
We had the most incredible weekend away with my parents at Belltrees. We stayed at the White Cottage. It was absolutely gorgeous and really well maintained! Serena did a tour of the farm and the homestead. As an architect I found this very inspiring and informative. I would highly recommend this property for a quiet weekend away. I am already planning to go back in a couple of months! Loved it so much :)
Liven2016-01-10T00:00:00Z
A truly memorable cottage in a stunning location. Serena was an impeccable host - attentive, kind and helpful. The added bonus of the tour of the property was a true highlight to hear of the family history. Loved it
Catherine2017-07-07T00:00:00Z
We drove up from Sydney with our 4 children and stayed at the lovely Michelle cottage in Belltrees. It was a wonderful relaxing weekend even with the kids. The cottage was so cosy and warm with lovely little touches and books to read about the history of the property which has a very long and interesting story having been in the family for generations. The property was beautiful. The cottage itself was made of many different materials and had all the original materials as well has being renovated really nicely to suit the style of the cottage and also to make it open and fresh. The bathroom has the best bath! Serena was a kind, warm and generous host making sure we found our way to the station ok and giving us a tour of the historic buildings answering all our questions and showing us the lovely views and once the tour was done she left us to it and gave us our space and privacy which was great. We explored the river side and the children loved it, the small church thats on the property and the huge old shearing shed which was very fun for them too as they ran around in the huge old rustic space. The kitchen at the cottage was excellent and provided all I needed to cook up a storm for the family, but we also had lunch at the local pub which was quirky and quaint. All and all a fabulous weekend much needed for the family to reconnect and reset.
Rebecca2016-06-14T00:00:00Z
What an amazing week-end at Belltrees Cottage house! Serena is simply the best host I have had the chance to meet in Australia. Serena took time to share with us her passion about her region, her house and the story of her family. She recommended nice places and great activities. The cottages are fully equipped, nicely decorated and immaculately cleaned: We definitely felt at home. We were a group of 11 guests with 6 french people. We have all been impressed about the 5 stars quality of our cottages. Can't wait to spend another great week-end at Belltrees...
Damien2015-10-06T00:00:00Z
Jenis bilik
Keseluruhan rumah/apt
Jenis Penginapan
Rumah
Memuatkan
6
Bilik tidur
RUSSLEY RURAL RETREAT - The Maharani Room
A charming country homestead set in 17 acres of rolling pasture and established gardens. Bordered by the Hunter River and Segenhoe Road amidst renowned thoroughbred horse studs, polo fields, historic pubs, wineries, great restaurants, picturesque walking/horse trails, and close to Scone township.
Accommodation: Four private guest rooms for one big group or individually. The rooms are of period design with a funky twist and lead onto wrap-around verandas. All rooms have access to the shared lounge with open fire and large established gardens.
Included: Light breakfast, WIFI, swimming pool, tennis court, river access, horse paddocks. (The Maharani and The Boho rooms have their own en-suites.)
** Should you wish to book other rooms in addition to the Maharani Room for more guests please do so via airbnb Russley Rural Retreat The Boho Room, The Bobby Dazzler Room, The Giddy-up Room
The neighbours are horse studs and lucerne farms.
Jenis bilik
Bilik persendirian
Jenis Penginapan
Rumah
Memuatkan
2
Bilik tidur
Treat yourself and your family/friends to an enjoyable weekend getaway in the Hunter Valley while having a marvellous stay at this stunning, fully renovated 4 bedroom vacation home.
This home is perfect for families with kids, couples, singles, group of friends or anyone who would like to have a relaxing treat any day of the week.
Each room is fitted with NEW beds (Room 1&4 Queen/Room 2&3 Double). An extra single sleeping mattress can be provided if necessary.
Each room has its own key and you will experience absolute privacy. The living area is spacious and comes with a big TV, couches, air conditioner/heater. Brand new kitchen comes fully equipped with all the cooking utensils including stove, oven, refrigerator, freezer, microwave, toaster, slow cooker. BRAND NEW Bathroom with fresh towels provided daily. Enjoy the sunrise on the lovely veranda while you sip your favourite cup of coffee/tea. This is your home away from home!
Welcome to Denman- The pride of the Hunter
Welcome to one of New South Wales best-kept secrets, nestled in the heartland of the Upper Hunter's vineyards, horse studs and olive groves with the magnificent Wollemi National Park to the South West and the Goulburn National Park to the West. Situated on the Golden Highway and part of the Greater Blue Mountains Drive, near the banks of the Hunter River, Denman is a welcoming community presenting the true charm of yesteryear. Denman is a growing town that features many opportunities for visitors and potential residents, with a relaxing country experience, fine food, outstanding wines, friendly people, excellent shopping and spectacular scenery. Denman has become popular with day trippers to experience the wineries and fine food the district has to offer.
The house is being renovated - the paint is fresh and the house is clean. It is situated right next to the railway line which we did not realise. The check in was a bit of a chore as no-one seemed to know anything about our arrival.
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
Opencv build do not set tbb as ON
I have downloaded latest source of tbb and run the following commands (working on raspbian):
sudo make CXXFLAGS="-DTBB_USE_GCC_BUILTINS=1 -D__TBB_64BIT_ATOMICS=0"
source tbbvars.sh (in the related folder)
but when I do
cmake -D CMAKE_BUILD_TYPE=RELEASE -D CMAKE_INSTALL_PREFIX=/usr/local -D WITH_TBB=ON
it do not actually set TBB:ON. So I do not continue with make, make install. What am I missing?
A:
Seems like it takes much work to make tbb visible
mkdir build
cd build
cmake -D CMAKE_BUILD_TYPE=RELEASE -D CMAKE_INSTALL_PREFIX=/usr/local -D WITH_TBB=ON -D BUILD_TBB=ON ..
just does the trick. Hope this will help other beginners as well.
|
{
"pile_set_name": "StackExchange"
}
|
Peace of Mind
Wednesday, April 22, 2015
"A flower does not think of competing to the flower next to it. It just blooms."
Last week, I got the chance to visit the Botanical Garden to see the Orchid Show taking place this year. Being only about 15minutes away from it, I really feel guilty for not taking advantage of going there more often. I mean, sometime all you really need is a long walk in the park to stop and smell the flowers.
With so many great things happening as of lately, I'm over-filled with excitement, joy, and gratitude to everything and everyone beautiful in my life.
I actually wore this outfit to Shun's birthday dinner a week ago, but I loved it so much that I didn't mind repeating it for this post. By now, you have probably seen me wear this blazer for the 5th time already, but I guess it goes to show how much I love it. Because the weather suddenly became really nice, I haven't had the chance to prepare my Spring wardrobe, so, I've been wearing a lot of old pieces that I still adore.
I've worn this top a few times before (here, and here), but this is probably my most favorite way to wear it thus far.
Spring is often considered a fresh start, but for me, it's more of a continuous process. You can grow and change without completely neglecting everything prior -- because everything good or bad that happens only makes you a stronger and smarter person. With so much going on and social media setting the pace for new standards of pretty and good, we often forget that we have a choice about who we are, and where we ultimately want to be and it's sad that some people settle for what's temporary. The same can be applied to fashion/style, trends come and go, and you can always try to keep up and copy as much as you'd like -- but style is long lasting and speaks about who you are as a person.
Regardless, I personally believe that it's necessary to be aware of what's going on around you, but remain true to yourself as well. What's important is that you should always have a peace of mind. Be content with having enough, and happy when you feel like you have more than enough.
I've also included some photos from the Orchid Show, because I really want to share with you guys how beautiful these flowers were. Enjoy xx
|
{
"pile_set_name": "Pile-CC"
}
|
Q:
How do I make Makefile to recompile only changed files?
I have been struggling a bit to get make to compile only the files that have been edited. However I didn't have much success and all the files get recompiled. Can someone explain me why?
My files are:
main.c
a_functions.c
where main.c includes main.h
and a_functions.c includes a.h
Here is my makefile:
CC=gcc
CFLAGS=-Wall -I. -c
EXEC_FILE=program1
all: program
a_functions.o: a_functions.c
a_functions.c: a.h
main.o: main.c
main.c: main.h
objects: a_functions.c main.c
$(CC) a_functions.c main.c $(CFLAGS)
program: a_functions.o main.o
$(CC) a_functions.o main.o -o $(EXEC_FILE)
Changing the makefile as per suggestions seems to have the same problem::
all: program
a_functions.o: a_functions.c a.h
gcc a_functions.c -c
main.o: main.c main.h
gcc main.c -c
program: a_functions.o main.o
gcc a_functions.o main.o -o program1
A:
The specific problem you're talking about -- Make rebuilds program1 (by relinking the objects) even when nothing has changed -- is in this rule:
program: a_functions.o main.o
gcc a_functions.o main.o -o program1
The target of this rule is program, and Make assumes that it is a file. But since there is no such file, every time you run Make, Make thinks that this file needs to be rebuilt, and executes the rule. I suggest this:
program1: a_functions.o main.o
gcc a_functions.o main.o -o program1
Or better, this:
program1: a_functions.o main.o
gcc $^ -o $@
Or better still this:
$(EXEC_FILE): a_functions.o main.o
$(CC) $^ -o $@
(And don't forget to change the all rule to match.)
A few other points:
As @paxdiablo pointed out,
a_functions.o: a_functions.c a.h
main.o: main.c main.h
It doesn't make sense to link these objects together unless something in one (probably main.o) calls something in the other (probably a_functions.o), so I would expect to see a dependency like this:
main.o: a.h
So I suspect that you have some misplaced declarations.
You declare an objects rule, but never refer to it. So you never actually use it; Make uses the default rule for %.o: %.c. I suggest this:
OBJECTS = a_functions.o main.o
$(OBJECTS): %: %.c
$(CC) $< $(CFLAGS) -o $@
(In which case you can change $(EXEC_FILE): a_functions.o main.o to $(EXEC_FILE): $(OBJECTS).) Or just this:
%.o: %.c
$(CC) $< $(CFLAGS) -o $@
A:
Not sure if this is causing your specific problem but the two lines:
a_functions.c: a.h
main.c: main.h
are definitely wrong, because there's generally no command to re-create a C file based on a header it includes.
C files don't depend on their header files, the objects created by those C files do.
For example, a main.c of:
#include <hdr1.h>
#include <hdr2.h>
int main (void) { return 0; }
would be in the makefile as something like:
main.o: main.c hdr1.h hdr2.h
gcc -c -o main.o main.c
Change:
a_functions.o: a_functions.c
a_functions.c: a.h
main.o: main.c
main.c: main.h
to:
a_functions.o: a_functions.c a.h
main.o: main.c main.h
(assuming that a_functions.c includes a.h and main.c includes main.h) and try again.
If that assumption above is wrong, you'll have to tell us what C files include what headers so we can tell you the correct rules.
If your contention is that the makefile is still building everything even after those changes, you need look at two things.
The first is the output from ls -l on all relevant files so that you can see what dates and times they have.
The second is the actual output from make. The output of make -d will be especially helpful since it shows what files and dates make is using to figure out what to do.
In terms of investigation, make seems to work fine as per the following transcript:
=====
pax$ cat qq.h
#define QQ 1
=====
pax$ cat qq.c
#include "qq.h"
int main(void) { return 0; }
=====
pax$ cat qq.mk
qq: qq.o
gcc -o qq qq.o
qq.o: qq.c qq.h
gcc -c -o qq.o qq.c
=====
pax$ touch qq.c qq.h
=====
pax$ make -f qq.mk
gcc -c -o qq.o qq.c
gcc -o qq qq.o
=====
pax$ make -f qq.mk
make: `qq' is up to date.
|
{
"pile_set_name": "StackExchange"
}
|
Q:
PHP & json_decode - how to get property of object
CONTEXT
I'm using json_decode to convert the contents of an Facebook open graph call into a php object.
EDIT to add code
My code looks like this:
$json = json_decode(file_get_contents("http://graph.facebook.com/http://example.com"),true);
var_dump($json);
A var_dump of the resulting object looks like this:
ARRAY(3) { ["ID"]=> STRING(18) "HTTP://EXAMPLE.COM" ["SHARES"]=> INT(14604317) ["COMMENTS"]=> INT(11300) }
PROBLEM
I would like to get the 12 from this object. I assumed that $json->shares would return 12, but instead it returns null. Any idea what the correct syntax for retrieving the 12 would be?
A:
Your array doesn't look right. Check out http://graph.facebook.com/http://example.com in a browser, notice how the keys and values are all lowercase, not uppercase like you have.
If you really are testing http://graph.facebook.com/http://example.com, then this will just work:
$array = json_decode(file_get_contents('http://graph.facebook.com/http://example.com'), true);
echo $array['shares'];
This gives me 14604317 which I can see in my browser is the correct result.
Note you have an array, not an object. So use array notation:
|
{
"pile_set_name": "StackExchange"
}
|
Q:
How to set predefined time in jspinner
I have some pre defined time in mysql database in varchar format for example - 16:45, 00:30, 09:15, 20:50 and 10 more.
I want to display any one of these time in jspinner I am trying but getting error
this my jspinner setup where I am displaying the time this is inside constructor-
Date date = new Date();
SpinnerDateModel sm = new SpinnerDateModel(date, null, null, Calendar.HOUR_OF_DAY);
arr_time.setModel(sm);
JSpinner.DateEditor ar = new JSpinner.DateEditor(arr_time, "HH:mm");
arr_time.setEditor(ar);
and this my modify button code where I fetching the time as string from database trying to show them in jspinner
try {
if (evt.getActionCommand().equals("Modify")) {
String flno=JOptionPane.showInputDialog(this, "Enter Flight Number");
String sql="SELECT * FROM flights WHERE flightno='"+flno+"'";
smt = con.createStatement(ResultSet.TYPE_SCROLL_INSENSITIVE,ResultSet.CONCUR_READ_ONLY);
rs = smt.executeQuery(sql);
while (rs.next()) {
jTextField1.setText(rs.getString(1));
arr_time.setValue(rs.getString(2));
jTextField4.setText(rs.getString(4));
jTextField5.setText(rs.getString(5));
}
} else if(evt.getActionCommand().equals("Update")) {
}
run: illegal value
Error is coming in netbeans 7.1
A:
Although not obvious, the error is telling you the type used to set the JSpinner and the String read in from the database are incompatible. SpinnerDateModel uses a Date as the underlying object type
Try
SimpleDateFormat format = new SimpleDateFormat("HH:mm");
arr_time.setValue(format.parseObject(rs.getString(2))); // e.g. input 16:45
|
{
"pile_set_name": "StackExchange"
}
|
Wild Arms 4
Wild Arms 4, known in Japan as , is a role-playing video game developed by Media.Vision and the fourth installment in the Wild Arms video game series. The game's overall look and feel is a departure from the Wild West feel of the previous games in the series, to a more modern look.
Story
Jude Maverick has grown up in an isolated town called Ciel, which is completely enclosed in a large sphere floating thousands of feet above the surface of Filgaia. His sheltered world changes forever when he sees the sky "tear" and ships enter his homeland. Upon inspecting the campsite set up by the intruders, he sees something else that he has never seen before: a girl.
The girl's name is Yulie and she is being held captive by the intruders after being captured by a "Drifter" for hire, Arnaud G. Vasquez. After the invading army attacks Ciel and brings the sphere crashing down, Jude, Yulie and Arnaud join forces to find the army's true intention behind Yulie's abduction. With the help of another Drifter, Raquel, these four idealistic teens travel the war-torn land of Filgaia in search of truth, their own identities, and their separate paths to adulthood.
Gameplay
Action elements on the field map such as double-jumps, using the new "Accelerator" ability to manipulate time, and equipping items to solve puzzles maintains the excitement between battles. Movie events are presented in a distinctive use of polygons and shading with voice-actors. Dialog takes place using various character illustrations that change and reposition frequently.
Dialog takes place using various character illustrations that change and reposition frequently like a digital comic book, making it easier to deeply understand the emotions of each character.
The HEX battle system is composed of seven hexagons on the battle field, with random beginning placement for all characters and enemies. What makes the HEX battle system so unique is that it is area based instead of character based. This means that any attacks or spells given to certain hexagon, or HEX, will affect all characters on that HEX. Multiple allies or enemies can occupy a single HEX, but enemies and allies can't occupy the same HEX.
Reception
IGN: 7.8/10
GameRankings: 73% (42 reviews)
Metacritic 69/100 (38 reviews)
Famitsu: 32 out of 40
Gamespot: 7.8/10
Localization
In the North American version, two monsters (Dalawa Bunny and Accident Rabbit) were taken out of the game, but not out of the monsters list, making it impossible to finish the game with 100% completion. The PAL version still contains this error, and is also known to crash in certain places when played in 50 Hz mode, leaving those areas potentially impassable to players whose television does not support 60 Hz PAL signals.
Some PAL copies also have another issue where triggering specific Material summons would freeze the game. A workaround is to disable the battle movies in the game's options. This bug affects both PAL and NTSC modes.
The English localization copy is known to freeze when loading the area at the top of a ladder at "The Great Wall" roughly 5 hours into the game when played in PAL mode. A workaround can be achieved by saving the game in the area prior and loading the game in NTSC mode, going past and saving on the world map. No other areas are known to have this problem.
External links
XSEED's Official Wild Arms 4 site
References
Category:2005 video games
Category:J.C.Staff
Category:PlayStation 2 games
Category:PlayStation 2-only games
Category:Video games developed in Japan
Category:Wild Arms video games
|
{
"pile_set_name": "Wikipedia (en)"
}
|
Battle of the blondes! Taylor Swift, Carrie Underwood and Miranda Lambert lead CMT Music Awards nominations
There will be plenty of blonde ambition at this year's CMT Music Awards.
Carrie Underwood, Miranda Lambert and Taylor Swift top the nominations which were announced this morning on the Today show.
Blonde ambition: Taylor Swift, Carrie Underwood and Miranda Lambert have all been nominated for CMT Music Awards
Underwood earned five nominations, Lambert had four as a solo artist and as part of her trio Pistol Annies, and Swift led a group of stars earning three nominations apiece for the 11th annual video awards show.
Other artists with three nominations include Jason Aldean, Lady Antebellum, Rascal Flatts, Blake Shelton, Thompson Square and The Civil Wars.
Underwood's Good Girl and her Remind Me collaboration with Brad Paisley, Lambert's Over You and Swift's collaboration with The Civil Wars on The Hunger Games soundtrack entry Safe & Sound are among the 10 nominees for top honour video of the year.
He's got The Voice: Miranda's husband Blake Shelton received three nominations
Underwood also is up for female video, CMT performance and collaborative video of the year.
Lambert is up for female video as a solo artist and for group video and breakthrough video for Hell on Heels with her friends Angaleena Presley and Ashley Monroe in Pistol Annies.
|
{
"pile_set_name": "OpenWebText2"
}
|
Q:
Mock same method with different return value called twice in a function in python
I have a method to be tested using pytest. The method is calling same database model twice.
def function:
ids = database_model.object.filter(user="user1").filter(group="admin").values_list(ids, flat=True).allow_filtering()
response_list = []
unquie_ids = list(set(ids))
for ids in unique_ids:
response = database_model.object.filter(ids=ids).limit(1)
for res in response:
temp_dict = {}
temp_dict['name'] = res.name
temp_dict['description'] = res.description
response_list.append(temp_dict)
return response_list
This works well. I am tring to write unit test case for this.
As the same database_model requires return value twice. It does not work for me.
@patch('database_model')
def test_function(mock_model):
mock_model.objects.filter.return_value.filter.return_value.values_list.return_value.allow_filtering_return_value = [Mock_id]
mock_model.objects.filter.limit.return_value = mock_dict
response = function()
assert len(response) > 0
mock_id and mock_dict are values created for test case.
My question is first time i am assigning a return_value to mock_model.objects.filter.return_value.filter.return_value.values_list.return_value.allow_filtering.return_value to [Mock_id] which gets assigned properly. But the next line i am trying to assign a return_value again to the same method. This takes as a magic mock object. So my test case fails because it is getting a empty list. I would like to know how can i assign two different return_values to the same method.
A:
You should write a side_effect for database_model.object.filter mock that gives you a Mock() configured to return the correct ids list after a mock to use in for cycle.
mock_filter_get_ids = Mock()
mock_filter_ids = Mock()
mock_model.objects.filter.side_effect = [mock_filter_get_ids, mock_filter_ids]
mock_filter_get_ids.filter.return_value.values_list.return_value.allow_filtering_return_value = [Mock_id]
mock_filter_ids.limit.return_value = mock_dict
But...
Forget it: refactor your code, at least extract:
database_model.object.filter(user="user1").filter(group="admin").values_list(ids, flat=True).allow_filtering()
In something like get_user_ids() and
database_model.object.filter(ids=ids).limit(1)
in get_ids_response().
You can mock the new methods and make your code simpler to read, simple to test means simple to read almost every time.
|
{
"pile_set_name": "StackExchange"
}
|
---
abstract: |
We study the capacitated $k$-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number $k$. It costs $f_i$ to open facility $i$, and $c_{ij}$ for facility $i$ to serve one unit of demand from client $j$. The objective is to open at most $k$ facilities serving all the demands and satisfying the capacity constraints while minimizing the sum of service and opening costs.
In this paper, we give the first fully polynomial time approximation scheme (FPTAS) for the single-sink (single-client) capacitated $k$-facility location problem. Then, we show that the capacitated $k$-facility location problem with uniform capacities is solvable in polynomial time if the number of clients is fixed by reducing it to a collection of transportation problems. Third, we analyze the structure of extreme point solutions, and examine the efficiency of this structure in designing approximation algorithms for capacitated $k$-facility location problems. Finally, we extend our results to obtain an improved approximation algorithm for the capacitated facility location problem with uniform opening cost.
author:
- Karen Aardal
- Pieter van den Berg
- Dion Gijswijt
- 'Shanfei Li [^1]'
bibliography:
- 'KFL.bib'
title: 'Approximation Algorithms for Hard Capacitated $k$-facility Location Problems'
---
Introduction
============
In the capacitated $k$-facility location problem (CKFL), we are given a set $D$ of clients and a set $F$ of potential facilities (locations where we can potentially open a facility) in a metric space. Each facility $i\in F$ has a capacity $s_i$. Each client $j$ has a demand $d_j$ that must be served. Establishing facility $i$ incurs an opening cost $f_i$. Shipping $x_{ij}$ units from facility $i$ to client $j$ incurs service costs $c_{ij} x_{ij}$, where $c_{ij}$ is proportional to the distance between $i$ and $j$. The goal is to serve all the clients by using at most $k$ facilities and satisfying the capacity constraints such that the total cost is minimized. In this paper, we consider the *hard* capacities, that is, we allow at most one facility to be opened at any location. (Note that in the *soft* capacities case multiple facilities can be opened in a single location [@MahdianYZ].)
CKFL can be formulated as the following mixed integer program (MIP), where variable $x_{ij}$ indicates the amount of the demand of client $j$ that is served by facility $i$, and $y_{i}$ indicates whether facility $i$ is open.
$$\begin{aligned}
{2}
\min\quad&\sum_{i\in F}\sum_{j\in D}c_{ij} x_{ij}+\sum_{i\in F}f_i y_i \label{eq:MIP}\\
\text{subject to:}\quad&\sum_{i\in F}{x_{ij}} = d_j,&\forall j\in D,\label{eq:demand constraint}\\
&\sum_{j\in D}{x_{ij}} \leq s_i y_i,&\forall i\in F,\label{eq:capacity constraint}\\
&\sum_{i\in F}{y_i} \leq k,\label{eq:cardinality constraint}\\
&x_{ij}\geq 0,&\forall i\in F, \forall j\in D,\label{eq:nonegative constraint}\\
&y_{i} \in \{0,1\},&\forall i\in F.\label{eq:binary constraint}\end{aligned}$$
If we replace constraints (\[eq:binary constraint\]) by $$\begin{aligned}
{2}
0 \leq y_{i}\leq 1, i\in F, \label{binary relaxation}\end{aligned}$$ we obtain the LP-relaxation of CKFL. Without loss of generality we suppose that $s_i$, $d_j$ for each $i\in F, j\in D$ are all integral.
CKFL is related to the capacitated $k$-median problem (CKM), in which inputs and goal are the same as CKFL except that there is no opening cost for facilities. A constant factor approximation algorithm is still unknown for CKM, let alone CKFL. All the previous attempts with constant approximation ratios for these problems violate the capacity constraint, or cardinality constraint that at most $k$ facilities are allowed to be used. We call these approximation algorithms *pesudo-approximation algorithms*. Recently, Byrka et al. [@ByrkaFRS] gave a constant factor approximation algorithm for CKM with uniform capacities while violating the capacities with a factor $2+\epsilon$, where $\epsilon>0$ can be arbitrarily small. Although most researchers believe that relaxing the cardinality constraint makes the problem simpler than relaxing the capacity constraint with respect to designing pesudo-approximation algorithms, the best known violation ratio for cardinality constraint is still $5+\epsilon$ to get a constant factor approximation algorithm [@KorupoluPR] for CKM with uniform capacities. It seems that to obtain a better constant factor approximation algorithm with violating the cardinality constraint has not received much attention yet.
In this paper, we give an improved approximation algorithm for CKFL (with arbitrary capacities) with uniform opening cost by using at most $2k$ facilities. To show the potential power of this algorithm, we improve the approximation ratio for the capacitated facility location problem with uniform opening cost [@LeviSS], by combining this algorithm with a pesudo-approximation algorithm for the $k$-median problem derived from a bifactor approximation algorithm for the uncapacitated facility location problem [@CharikarG]. That is, pesudo-approximation algorithms for capacitated $k$-facility location problems may be extended to get approximation algorithms for well-studied capacitated facility location problems. We believe that this technique has the potential to further improve approximation ratios for capacitated facility location problems.
Additionally, in Section \[sec:SCKF\] we give the first fully polynomial time approximation scheme (FPTAS) for the single-sink (hard) capacitated $k$-facility location problem. In Section \[sec:CKFLU\], we give a [polynomial time]{} algorithm for the uniform capacitated $k$-facility location problem with a fixed number of clients.
Related Work
------------
The $k$-facility location problem has already been studied since the early 90s [@CornuejolsNW; @HsuLT]. It is a common generalization of the $k$-median problem (in which at most $k$ facilities are allowed to be opened, and there is no opening costs) and the uncapacitated facility location problem, which are classical problems in computer science and operations research and have a wide variety of applications in clustering, data mining, logistics [@BradleyFM; @JainD; @KuehnH], even for the single-sink (single client) case [@HererRH].
For the uncapacitated $k$-facility location problem (UKFL), Charikar et al. [@CharikarGTS] gave the first constant factor approximation algorithm with performance guarantee 9.8, by modifying their $6\tfrac{2}{3}$-approximation algorithm for the uncapacitated $k$-median problem. Later, the approximation ratio was improved by Jain and Vazirani [@JainV], who made use of a primal-dual scheme and Lagrangian relaxation techniques to obtain a $6$-approximation algorithm. Jain et al. [@JainMMSV; @JainMS] further improved the ratio to $4$ by using a greedy approach and the so-called Lagrangian Multiplier Preserving property of the algorithms. The best known approximation algorithm for this problem, due to Zhang [@Zhang], achieves a factor of $2+\sqrt{3}+\epsilon$ using a local search technique. The $k$-median problem, as a special case of UKFL, was studied extensively [@ArcherRS; @AryaGKMMP; @ByrkaPRST; @CharikarG; @CharikarGTS; @JainMS; @JainV; @LiS] and the best known approximation algorithm was recently given by Byrka et al. [@ByrkaPRST] with approximation ratio $2.611+\epsilon$ by improving the algorithm of Li and Svensson [@LiS]. In addition, Edwards [@Edwards] gave a $7.814$-approximation algorithm for the multi-level uncapacitated $k$-facility location problem by extending the $6\frac{2}{3}$-approximation algorithm by Charikar et al. [@CharikarGTS] for the uncapacitated $k$-median problem.
Unfortunately, the capacitated $k$-facility location problem is much less understood although the presence of capacity constraints is natural in practice. The difficulty of the problem lies in the fact that two kinds of hard constraints appear together: the cardinality constraint, and the capacity constraints. This seems to result in hardness of the methods such as LP-rounding, primal-dual method used to solve the $k$-median problem, and even local search algorithms used to solve the capacitated facility location problem and the $k$-median problem.
The capacitated $k$-facility location problem is related to the capacitated facility location problem (CFL), whose inputs and goal are the same as for CKFL but without the cardinality constraint. Most known approximation algorithms for CFL are based on local search technique since the natural linear programming relaxation has an unbounded integrality gap for the general case [@PalTW]. For nonuniform capacities, P[á]{}l, Tardos, and Wexler [@PalTW] proposed the first constant factor approximation algorithm with a factor of $8.53$. Later, Mahdian and P[á]{}l [@MahdianP] improved this factor to $7.88$. Zhang, Chen, and Ye [@ZhangCY] reduced this factor to $(3+2 \sqrt{2}+\varepsilon)$ by introducing a multi-exchange operation. The currently best known approximation algorithm, due to Bansal, Garg, and Gupta [@BansalGG], achieves the approximation ratio $5$. As it was expected that the problem is easier for uniform capacities, Korupolu, Plaxton, and Rajaraman (KPR) [@KorupoluPR] gave the first constant factor approximation algorithm with a factor of $8$. Later, this factor was improved to $5.83$ by Chudak and Williamson [@ChudakW]. The currently best approximation algorithm due to Aggarwal et al. [@AggarwalLBGGGJ] has performance guarantee of 3.
Additionally, Levi, Shmoys, and Swamy [@LeviSS] showed that the linear programming relaxation has a bounded integrality gap for CFL with uniform opening costs, and gave a $5$-approximation algorithm for this case by an LP-rounding technique.
The capacitated $k$-median problem (CKM), which is a special case of CKFL, is already difficult to handle. The natural linear programming relaxation has an unbounded integrality gap (see Remark \[unbounded gap of SCKFL\]). We have to blow up the capacity or increase the number of opening facilities by a factor of at least 2 if we use the cost of the LP solution as a lower bound to obtain an integral solution [@CharikarGTS].
For the hard uniform capacity case, Charikar et al. [@CharikarGTS] gave a constant factor approximation algorithm while violating the capacities within a constant factor $3$ by LP-rounding. Recently, Byrka et al. [@ByrkaFRS] improved this violation ratio to $2+\epsilon$ by designing a $(32 l^2+28l+7)$-approximation algorithm increasing the capacity by a factor of $2+\frac{3}{l-1}$, $l\in \{2,3,4,\cdots\}$. Based on a local search technique, Korupolu et al. [@KorupoluPR] proposed a $(1+{5}/{\epsilon})$-approximation algorithm by using at most $(5+\epsilon)k$ facilities, and a $(1+{\epsilon})$-approximation algorithm by using at most $(5+5/\epsilon)k$ facilities.
For soft non-uniform capacities, based on primal-dual and Lagrangian relaxation methods, Chuzhoy and Rabani [@ChuzhoyR] presented a $40$-approximation algorithm by violating the capacities within a constant factor of $50$. Bartal et al. [@BartalCR] proposed a $19.3(1+\delta)/\delta^2$-approximation algorithm ($\delta>0$) by using at most $(1+\delta)k$ facilities.
To the best of our knowledge, for hard non-uniform capacities, a constant factor approximation algorithm is still unknown if we allow for a violation of the two kinds of hard constraints: the cardinality constraint and capacity constraints. Without violating any constraint, a constant factor approximation algorithm remains unknown even for the single-sink capacitated $k$-median problem in which $|D|=1$, let alone the capacitated $k$-facility location problem.
Our Contributions and Techniques
--------------------------------
\(1) The single-sink facility location problem has several applications in practice [@HererRH]. We show that the single-sink hard capacitated $k$-facility location problem, in which $D$ contains exactly one client, is NP-hard even when $f_i=0, i\in F$. We give the first FPTAS for SCKFL by extending the FPTAS for the knapsack problem. To the best of our knowledge, this is also the fist FPTAS for the single-sink capacitated facility location problem, which answers a question by G[ö]{}rtz and Klose [@GortzK].
\(2) For the hard capacitated $k$-facility location problem with uniform capacities, in which $s_i=s, i\in F$, we observe that for $|D|$=1, it is easy to find an optimal solution. A natural question is to extend this to any fixed number $m:=|D|$ of clients. We give a [polynomial time]{} algorithm for this setting that runs in time $O({\binom{n}{m}} \cdot n^3)$, where $n=|F|$. Using the structure of the graph consisting of [the fractional valued edges]{} in any extreme solution, the problem is reduced to a number of [transportation problems]{}.
\(3) We observe that the number of fractionally open facilities can be bounded by analyzing the rank of the constraint matrix corresponding to the tight constraints at a fractional extreme point solution. Then, we give approximation algorithms for two variants of the hard capacitated $k$-facility location problem based on this upper bound. Another example to show the potential power of the structure of extreme point solutions is that we can slightly improve the previous best approximation ratio 5 obtained by Levi, Shmoys, and Swamy [@LeviSS], and Bansal, Garg, and Gupta [@BansalGG] for the capacitated facility location problem with uniform opening costs, by combining our technique with a pesudo-approximation algorithm for the $k$-median problem.
The Single-sink Capacitated $k$-facility Location Problem {#sec:SCKF}
=========================================================
In this section, we consider the single-sink capacitated $k$-facility location problem (SCKF). Since we only have one client with demand $d$, the formulation for the CKF is reduced to the following mixed integer program.
$$\begin{aligned}
{2}
Z_{\mathrm{MIP}}=\min &\sum_{i\in F} {(c_i x_i+f_i y_i)} \label{MIP}\\
\text{subject to:\quad}&\sum_{i\in F}{x_{i}} = d, \label{demand constraint} \\
& \sum_{i\in F}{y_i}\leq k,\label{cardinality constraint} \\
&0\leq {x_{i}} \leq s_i y_i,&&\forall i\in F,\label{capacity constraint} \\
&y_{i} \in \{0,1\},&&\forall i\in F.\label{binary constraint}\end{aligned}$$
Again, the natural LP relaxation of SCKFL can be obtained by replacing constraints (\[binary constraint\]) by (\[binary relaxation\]).
The single-sink capacitated $k$-facility location problem is NP-hard even when $f_i=0$ for all $i\in F$.
Consider the case that $s_i>1$, $c_i:=1-\frac{1}{s_i}$ and $f_i=0$ for all $i\in F$. We claim that $$\label{subsetsum}
Z_\mathrm{MIP}\leq d-k\iff \text{there exists $I\subseteq F$ with $|I|=k$ and $\sum_{i\in I}s_i=d.$}$$ Indeed, for the objective value we find $$\sum_{i\in F}{c_{i} x_{i}}=d-\sum_{i\in F}{\frac{x_i}{s_i}}=d-\sum_{i\mid y_i=1}\frac{x_i}{s_i}\geq d-k,$$ where the last inequality holds because $x_i\leq s_i$ and $y_i=1$ for $k$ values of $i$. Equality holds if and only if $x_i=s_i$ for all $i\in F$ with $y_i=1$. That is, if and only if $\sum\{s_i\mid y_i=1\}=d$.
The claim above allows to reduce SUBSET-SUM to SCKFL as follows. Let positive integers $s_1,\cdots, s_n>1$ and $d$ form an instance of SUBSET-SUM. Now there [exists]{} a subset $I\subseteq \{1,2,\cdots,n\}$ such that $\sum_{i\in I}{s_i}=d$ if and only if the objective value of SCKFL is at most $d-k$ for some $k\in \{1,\cdots,n\}$.
\[unbounded gap of SCKFL\] The integrality gap $Z_{\mathrm{MIP}}/Z_{\mathrm{LP}}$ is unbounded.
Take the instance shown in Figure \[fig:instance\] with four facilities $\{1,2,3,4\}$, $s_{1}=s_{2}=s, s_{3}=Ms, s_{4}=s+1$, $d=2s+1$, $f_{1}=f_{2}=f_{3}=f_{4}=0$, and $c_{1}=c_{2}=0, c_{3}=100, c_{4}=1, k=2$ and $M\gg s \gg 100$. For this instance, we have $Z_{\mathrm{MIP}}=s+1$ and $Z_{\mathrm{LP}}=\frac{100M}{M-1}$. Thus, $Z_{\mathrm{MIP}}/Z_{\mathrm{LP}}=\frac{s+1}{\frac{100M}{M-1}}>\frac{s+1}{200}$, which can be arbitrarily large. In addition, a simple LP-rounding technique does not work for SCKFL. For the above instance, an optimal solution for LP-relaxation is $y_{1}=1,y_2=\frac{Ms-s-1}{(M-1)s}, y_3=\frac{1}{(M-1)s}, x_1=s,x_2=\frac{Ms-s-1}{M-1}, x_3=\frac{M}{M-1}$. A natural idea is to round $y_3$ to be $1$, $y_2$ to be $0$. It is clear that the objective value of the solution obtained by this simple rounding is still really large.
![*An instance for SCKFL. An optimal solution for the LP-relaxation of this instance is $y_{1}=1,y_2=\frac{Ms-s-1}{(M-1)s}, y_3=\frac{1}{(M-1)s}, x_1=s,x_2=\frac{Ms-s-1}{M-1}, x_3=\frac{M}{M-1}$, with the total cost $\frac{100M}{M-1}$. An optimal solution for the MIP is $y_1=y_4=1, x_{1}=s, x_{4}=s+1$ with the total cost $s+1$.* []{data-label="fig:instance"}](FIG.pdf)
We aim to design a fully polynomial time approximation scheme (FPTAS) for SCKFL. Before introducing our algorithm, we present a key observation (P[á]{}l, Tardos, and Wexler gave a similar observation in the proof of Lemma 3.3 in [@PalTW]).
For the single-sink capacitated $k$-facility location problem, there is an optimal solution $(x^*,y^*)$ in which at most one open facility $t^0$ is not fully used, i.e., $x^*_{i}\in\{0, s_{i}\}$ for $i\neq t^0$.
Without loss of generality we suppose that $c_{ij}$ and $f_i$, for each $i\in F, j\in D$, are all integral. Given $t^0$, which is allowed not to be fully used in an optimal integral solution $(x^*,y^*)$, in order to solve SCKFL it is sufficient to solve the following problem for a given integer $p$: $$\label{goal}
\max \big\{\sum_{i\in F'}s_i \mid F'\subseteq F\setminus\{t^0\}, |F'|\leq k-1, \sum_{i\in F'}(c_is_i+f_i)=p\big\}.$$ In words, we find for each total cost $p$ a set of at most $k-1$ facilities (not containing $t^0$) to open and use to full capacity, maximizing the total capacity.
We can recursively solve the above problem by dynamic programming. Without loss of generality, suppose $F\setminus \{t^0\}=\{1,2,\cdots,n-1\}$, where $n=|F|$. For nonnegative integers $p$ and $g\leq b\leq n-1$ define $$S_g(b,p):=\max \big\{\sum_{i\in F'}s_i\mid F'\subseteq \{1,\ldots, b\}, |F'|\leq g, \sum_{i\in F'}(c_is_i+f_i)=p\big\},$$ and let $F_g(b,p)$ be an optimal solution $F'$. If $\sum_{i\in F'}(c_is_i+f_i)=p$ does not hold for any $F'\subseteq \{1,\ldots, b\}$ with $|F'|\leq g$, we set $S_g(b,p):=-\infty$ and $F_g(b,p):=\emptyset$. Clearly, $S_g(0,0)=0$ and $S_g(0,p)=-\infty$ for $p>0$. The other values $S_g(b,p)$, and the corresponding optimum solutions $F_g(b,p)$, can be computed recursively since $$S_g(b+1,p)=\max \big(S_g(b,p),\ s_{b+1}+S_{g-1}(b,p-(f_{b+1}+c_{b+1} s_{b+1})\big)$$ for $0<g\leq b$. In the maximum, the two values correspond to not opening and opening facility $b+1$, respectively.
For computing the maximum in (\[goal\]), it suffices to restrict to values $0\leq p\leq (k-1)\mathcal{P}\leq n\mathcal{P}$, where $\mathcal{P}=\max \{c_is_i+f_i\mid i\in \{1,\ldots, n-1\}\}$. Hence we can solve (\[goal\]) in time $O(n^3 \mathcal{P})$.
Since $\mathcal{P}$ may be exponential in the size of the input of SCKFL, the computing time could be non-polynomial. We overcome this difficulty by a scaling-and-rounding technique. The resulting Algorithm \[FPTAS\] may be seen as a generalization of the FPTAS for the knapsack problem (with cardinality constraints) [@CapraraKPP; @Lawler].
For each $i\in F, C_i>0$, where $C_i:=c_i s_i+f_i$.
Note that if $C_i=0$ and $s_i< d$ we directly open $i$ and serve demand $s_i$ of the single client by $i$ without increasing any cost. If $C_i=0$ and $s_i\geq d$, the optimal total cost is 0.
Input
: Finite set $F$ of facilities, costs $c\in {\mathbb{Z}}_{\geq 0}^F$, costs $f\in {\mathbb{Z}}_{\geq 0}^F$, demand $d\in {\mathbb{Z}}_{\geq 0}$, capacities $s\in {\mathbb{Z}}_{\geq 0}^F$, integer $1\leq k\leq n:=|F|$, $\epsilon>0$.
Output
: A feasible solution $(x,y)$ that is within a factor $1+\epsilon$ of optimum, if a feasible solution exists.
Description
: \
- Order facilities such that $C_1\leq C_2\leq \cdots \leq C_n$, where $C_i:=c_i s_i+f_i$.
- for $t=1$ to $n$ do
- for $r=1$ to $n$ do
- if $\{1,\cdots,r\}-\{t\}=\emptyset$,
- Let $C_{r}^0=0,$ $\bar{f}_t={f_t}$, $\bar{c}_t={c_t}$, $W=1$.
- end if
- if $\{1,\cdots,r\}-\{t\}\neq \emptyset$
- Let $W=\frac{\epsilon C_{r}^0 }{k}$, where $C_{r}^0=\max \{C_i \mid i\in\{1,\cdots,r\}-\{t\} \}$.
- For each facility $i\in \{1,\cdots,r\}- \{t\}$, define $\bar{C}_i=\lfloor\frac{C_i}{W}\rfloor$.
- Let $\bar{f}_t=\frac{f_t}{W}$, $\bar{c}_t=\frac{c_t}{W}$.
- end if
- Consider the subproblem $P_{rt}$ involving items $\{1,\cdots,r\}\cup \{t\}$, in which
- only $t$ can be not fully used, that is, $x_i\in \{0,s_i\}, i\in \{1,\cdots,r\}-\{t\}$;
- $0\leq x_t \leq s_t$. With the above scaled costs, compute $S_g(\bar{r},p)$ for each
- $0\leq g\leq k-1$, $0\leq p\leq (k-1) \lfloor \frac{C_{r}^0}{W} \rfloor$, where $\bar{r}=r$ if $r\neq t$, $\bar{r}=r-1$
- otherwise. Then, find a solution with total scaled cost:
- $\min\{p+(d-S_g(\bar{r},p))\bar{c}_t+\bar{f}_t \mid 0\leq d-S_g(\bar{r},p)\leq s_t,0\leq g\leq k-1,$
- $0\leq p\leq (k-1)\lfloor \frac{C_{r}^0}{W} \rfloor \},$ if a feasible solution exists.
- end for
- end for
- for $r=1$ to $n$ do
- if $s_r\geq d$,
- find a solution with total cost $d c_r+f_r$.
- end if
- end for
- Output the solution with the minimum total original cost.
Note that in Algorithm \[FPTAS\] for nonnegative integers $p$ and $g\leq b\leq \bar{r}$, $$S_g(b,p):=\max \big\{\sum_{i\in F'}s_i\mid F'\subseteq \{1,\ldots, b\}-\{t\}, |F'|\leq g, \sum_{i\in F'}(c_is_i+f_i)=p\big\}.$$
Let $OPT$ be the cost of an optimal solution, $SOL$ be the cost of the solution returned by Algorithm \[FPTAS\]. Then, $SOL\leq (1+\epsilon)OPT$. The running time of Algorithm \[FPTAS\] is $O(\frac{n^6}{\epsilon})$, for any $\epsilon>0$.
Suppose $(x^*,y^*)$ is an optimal solution in which at most one open facility is not fully used. Let $t^0$ be the open facility in $(x^*,y^*)$ that is not fully used if it exists. Otherwise, let $t^0$ be some open facility in $(x^*,y^*)$. Then, we define $F^*_1=\{i\in F \mid y^*_i=1\}-\{t^0\}$ as the set of opened facilities in $(x^*,y^*)$ excluding $t^0.$
If $F^*_1=\emptyset$, clearly our algorithm can find an optimal solution in Step 3. If $F^*_1\neq \emptyset$, let $C_{i}^0=\max \{C_i \mid i\neq t^0, y^*_i=1\}$. Note that $C_{i}^0\leq OPT$. Moreover, let $i^0=\max \{i\in F^*_1 \mid C_i=C_{i}^0\}$. Thus, $C_{i^0}=C_{i}^0.$
Suppose in iteration $t=t^0,r=i^0$ of Step 2 we get an optimal solution $(x,y)$. Let $F_1=\{i\in F \mid y_i=1\}-\{t^0\}.$ Let $Cost(x,y)$ and $Scaled\_cost(x,y)$ be the original and scaled total cost of solution $(x,y)$ respectively. So, $Cost(x,y)=(\sum_{i\in F_1}{C_i})+x_{t^0} c_{t^0}+f_{t^0}$, and $Scaled\_cost(x,y)=(\sum_{i\in F_1}{\bar{C}_i})+x_{t^0} \bar{c}_{t^0} +\bar{f}_{t^0},$ where the definition of $\bar{C}_i$ is given in Algorithm \[FPTAS\]. We will show that $Cost(x,y)\leq (1+\epsilon)OPT$, which then implies $SOL\leq (1+\epsilon)OPT$.
Recall that $W=\frac{\epsilon C_{r}^0}{k}$. We have $$\begin{aligned}
Cost(x,y)&&=(\sum_{i\in F_1}{C_i})+x_{t^0} c_{t^0}+f_{t^0}\\
&& \leq (\sum_{i\in F_1}{(W \bar{C}_i+W)})+W x_{t^0} \bar{c}_{t^0}+W \bar{f}_{t^0}\\
&& \leq W((\sum_{i\in F_1}{\bar{C}_i})+x_{t^0} \bar{c}_{t^0} +\bar{f}_{t^0})+kW\\
&& \leq {W} \cdot Scaled\_cost(x,y) + kW,\end{aligned}$$ where the second inequality holds as $|F_1|\leq k-1$.
The scaled total cost of solution $(x^*,y^*)$ in this iteration is $(\sum_{i\in F^*_1}{\bar{C}_i})+x^*_{t^0} \bar{c}_{t^0}+\bar{f}_{t^0}$. Clearly, $$Scaled\_cost(x,y)\leq (\sum_{i\in F^*_1}{\bar{C}_i})+x^*_{t^0} \bar{c}_{t^0}+\bar{f}_{t^0},$$ since $(x,y)$ is optimal in this iteration. That is, $$Scaled\_cost(x,y)\leq (\sum_{i\in F^*_1}{\lfloor\frac{C_i}{W}\rfloor})+x^*_{t^0} \frac{c_{t^0}}{W}+\frac{f_{t^0}}{W}.$$
Then, we have $${W}\cdot Scaled\_cost(x,y)\leq {W} (\sum_{i\in F^*_1}{\lfloor\frac{C_i}{W}\rfloor})
+{W} x^*_{t^0} \frac{c_{t^0}}{W}+{W}\frac{f_{t^0}}{W}$$ $$\Rightarrow {W} \cdot Scaled\_cost(x,y) + kW \leq (\sum_{i\in F^*_1}{C_i})+ x^*_{t^0} {c_{t^0}}+ {f_{t^0}}+kW.$$
Therefore, we get $$Cost(x,y) \leq (\sum_{i\in F^*_1}{C_i})+ x^*_{t^0} {c_{t^0}}+ {f_{t^0}}+kW= OPT+\epsilon C_{i}^0\leq (1+\epsilon)OPT,$$ where the equality holds by the definition of $W$ and the last inequality holds as $C_{i}^0\leq OPT$.
For fixed $t$, the running time of the subproblem $P_{rt}, r=1,\cdots,n$ is $O(n^3 \lfloor\frac{C_{r}^0}{W}\rfloor)$. That is, $O(n^3 \frac{k}{\epsilon})$. Thus, the total running time of our algorithm is $O(\frac{n^6}{\epsilon})$ as we have $O(n^2)$ subproblems.
The Capacitated $k$-facility Location Problem with Uniform Capacities {#sec:CKFLU}
=====================================================================
In this section, we aim to show the following result for the capacitated $k$-facility location problem with uniform capacities (CKFU). Let $m=|D|$, $n=|F|$ and $s_i=s, i\in F$.
\[CKP with uniform capacity\] For fixed $m$, the capacitated $k$-facility location problem with uniform capacities can be solved in polynomial time $O({\binom{n}{m}} \cdot n^3)$.
We need new notation to describe our idea. We consider an optimal solution $(x,y)$ for CKFLU as a weighted bipartite graph $G=(V,E)$, where $V=\{i\in F \mid y_i=1\}\cup D$ and $E=\{\{i,j\} \mid x_{ij}>0,i\in F, j\in D\}$. To be more precise, if $x_{ij}>0$, we add an edge $\{i,j\}$ between facility $i$ and client $j$ with weight $x_{ij}$. Moreover, let $\bar{E}=\{\{i,j\}\in E \mid 0< x_{ij}<s\}$ and $\bar{V}=\bigcup_{e\in \bar{E}}{e}$. We call $(\bar{V},\bar{E})$ the *untight* weighted subgraph of $G$.
Define $r_j:=d_j/s$ for all $j \in D$. If all $r_j$ are integral, we say that the CKFLU is *divisible*.
\[demand is multiple of capacity\] The divisible capacitated $k$-facility location problem with uniform capacities can be solved in $O(n^3)$ time.
We transform the divisible CKFLU to a balanced transportation problem, in which the total capacity is equal to total demand. Then, to get an integer solution to this transportation problem, we can consider this problem as a minimum weight perfect matching problem that can be solved in $O(n^3)$ time [@Gabow], by splitting the demands. Since the problem is infeasible if $k< \sum_{j\in D}{r_j}$, we only consider the case: $|F|\geq k \geq \sum_{j\in D}{r_j}$.
By dividing the capacity and demand constraints by $s$, we can get an equivalent formulation for the divisible CKFLU, in which the new capacity of each facility is $1$ and the new demand of each client $j$ is $r_j$.
First, we show that there exists an optimal integral solution for this equivalent formulation. We add a dummy client $j^\prime$ to $D$ with demand $r_{j^\prime}=n-\sum_{j\in D}{r_j}$. Take the cost of shipping one unit from $i\in F$ to $j\in D\setminus \{j'\}$ to be $s c_{ij}+ f_i$, from $i\in F$ to $j'$ to be $0$. Now the divisible CKFLU can be considered as a balanced transportation problem with total demand $n$. Since $r_j, j\in D$ are integers, there is an integer optimal solution for this transportation problem (see for instance [@HoffmanK], or Theorem 21.14 in [@Schrijver]). Note that based on the optimal integer solution for this transportation problem, we can easily construct an optimal solution for our original problem.
Then, to get an optimal integer solution for the constructed transportation problem, we can split each $j\in D$ to $r_{j}$ copies each with demand $1$. Now we can consider the balanced transportation problem as a minimum weight perfect matching problem that can be solved in $O(n^3)$ time[@Gabow].
Note that if we know the exact structure of $(\bar{V},\bar{E})$, then according to the definition of $G$ the remaining part $(V,E\setminus \bar{E})$ can be generated by an optimal integer solution to an instance of the divisible CKFLU problem. Thus, the high-level idea is that we reduce our original problem to a collection of divisible CKFLU problems by checking all the possible structures of $(\bar{V},\bar{E})$. [To prove that we can examine all the structures in polynomial time, we show some useful properties of the untight weighted subgraph of $G$ first.]{}
\[properties for untight graph\] Let $G=(V,E)$ be the graph corresponding to a vertex $(x,y)$ of the convex hull of feasible solutions of the MIP to CKFLU, and $H=(\bar{V},\bar{E})$ be its corresponding untight subgraph. Then,
- $G$ is acyclic;
- in each connected component of $H$, there is at most one $i\in F\cap \bar{V}$ with $0<\sum_{j\in D}{x_{ij}}<s$;
- $H$ contains at most $m$ facilities and $2m-1$ edges.
(a). Suppose that there is a cycle $O=(e_1,e_2,\ldots, e_{2p-1},e_{2p})$ in $G$. Note that $O$ must have even number of edges as $G$ is bipartite. Let $\chi^O\in \mathbb{R}^E$ be the signed incidence vector of this path: $$\begin{aligned}
&&\chi^O(e_i)=(-1)^i\text{ for $i=1,3\ldots,2p-1$}; \chi^O(e_i)=(1)^i\text{ for $i=2,4\ldots,2p$};\\
&&\chi^O(e)=0\text{ for } e\in E\setminus\{e_1,\ldots,e_{2p}\}.\end{aligned}$$
For sufficiently small $\epsilon >0$ both $(x+\epsilon \chi^O,y)$ and $(x-\epsilon \chi^O,y)$ are feasible solutions, contradicting the fact that $(x,y)$ is a vertex.
(b). The idea is similar to (a). Consider any connected component $B$ of $H$. Suppose for contradiction that we have two facilities $i_1,i_2$ in $B$ with $0<\sum_{j\in D}{x_{i_1 j}}<s, 0<\sum_{j\in D}{x_{i_2 j}}<s$. Since $B$ is connected, there is a path $P=(e_1,e_2,\ldots, e_{2p-1},e_{2p})$ from $i_1$ to $i_2$. Again, we can construct two feasible solutions $(x+\epsilon \chi^P,y)$ and $(x-\epsilon \chi^P,y)$, contradicting the fact that $(x,y)$ is a vertex.
(c). Consider any connected component of $H$ with at least one edge. Note that each component is a tree with $0<x_{ij}<s$ for each edge $\{i,j\}$. If there is a facility $i^*$ in this component with $0<\sum_{j\in D}{x_{i^* j}}<s$, then take $i^*$ as the root. Otherwise, take an arbitrary facility as the root. Since $0<x_{ij}<s$ for each edge $\{i,j\}$ and $\sum_{j\in D}{x_{ij}}=s$ for each facility $i\neq i^*$, each facility except $i^*$ has at least two neighbors. Then, each facility in this connected component has at least one child (client) as each facility has at most one parent. Moreover, no two facilities have a common child (by the definition of a rooted tree). Therefore, the number of facilities in each connected component is at most the number of clients. Thus, we have at most $m$ facilities in $H$ as there are at most $m$ clients. Clearly, the number of edges is at most $2m-1$ since $H$ is a forest.
\[unique weight for untight graph\] For any untight and acyclic subgraph $H=(\bar{V},\bar{E})$, given the set $I=\{i\in F\cap \bar{V} \mid 0<\sum_{j\in D}{x_{ij}}<s \}$, we can get the unique weight $x_{ij}$ for each edge $\{i,j\}\in \bar{E}$ in $O(m)$ time.
Consider any connected component of $H$. Note that each connected component must be in the form of a tree. If there is a facility $i^*\in I$ in this component, then take $i^*$ as the root. Otherwise, take an arbitrary facility $i^*$ in this component as the root. Then, all leaves are clients since $\sum_{j\in D}{x_{ij}}=s$ for each facility $i\neq i^*$ in the considered connected component (Lemma \[properties for untight graph\](b)) and $0<x_{ij}<s$ for each edge $\{i,j\}$.
We will show that in each connected component, if node (client) $j$ is a leaf, we can obtain the exact value of $x_{ij}$, where $i$ is the father of $j$; and for each other node in this tree, we can compute the value of the edge between this node and its father based on the values of edges between this node and its children. Then, we can obtain the values of all edges in the tree by induction.
Consider a client $j$. Let $f(j)$ be the father node (facility) of $j$ in the tree and $c(j)$ be the set of children (facilities) of $j$. If $j$ is a leaf, that is $c(j)=\emptyset$, then we know $|\{i\in F \mid 0<x_{ij}<s\}|=1$. Otherwise, $j$ cannot be a leaf. Thus, we can get the exact value for $x_{f(j),j}=d_j-\lfloor \frac{d_j}{s} \rfloor \cdot s$ since $j$ has exactly one father. If $j$ is not a leaf, the value $x_{f(j),j}=(d_j-\sum_{i\in c(j)}{x_{ij}})-\lfloor \frac{d_j-\sum_{i\in c(j)}{x_{ij}}}{s} \rfloor \cdot s$ as $x_{tj}\in \{0,s\}, \forall t\in V\setminus \bar{V}$.
Consider a facility $i\neq i^*$. Let $f(i)$ be the father node (client) of $i$ in the tree and $c(i)$ be the set of children (clients) of $i$. We can obtain the value of $x_{i,f(i)}$ as long as all values of $x_{ij}, j \in c(i)$ are known, since $i$ must be fully used by Lemma \[properties for untight graph\]. That is, $x_{i,f(i)}=s-\sum_{j\in c(i)}{x_{ij}}$. Note that if $i=i^*$, we can stop since $f(i^*)=\emptyset$.
Moreover, the computing time is $O(m)$ since each edge is only examined once.
Consider an optimal integer vertex $(x,y)$ of the convex hull of feasible solutions for CKFLU whose corresponding graph $G=(V,E)$ is a forest. The graph $H=(\bar{V},\bar{E})$ (the untight subgraph of $G$) can be viewed as a subgraph of some spanning tree of the complete bipartite graph $K_{\bar{F},D}$, where $\bar{F}=F\cap \bar{V}$. Consequently, checking all the possible structures of $H$ means checking all the subgraphs of these spanning trees. Note that $H$ and $K_{\bar{F},D}$ have the same vertices. Then, it now suffices to answer the following questions:
- how many different complete bipartite graphs do we have for $K_{\bar{F},D}$?
- how to list all the spanning trees for a complete bipartite graph?
- how many subgraphs, that have the same vertices as the considered spanning tree, does a spanning tree have?
- for a fixed structure of $H$, how to compute the corresponding total cost?
If all the above questions can be solved in polynomial time, we can get all the possibilities of $H$ in polynomial time. Consequently, Theorem \[CKP with uniform capacity\] can be proved by Lemma \[demand is multiple of capacity\] and \[unique weight for untight graph\].
#### Proof of Theorem \[CKP with uniform capacity\].
Because $H=(\bar{V},\bar{E})$ contains at most $m$ facilities by Lemma \[properties for untight graph\], the number of all the possible cases for $K_{\bar{F},{D}}$ can be bounded by $\sum_{t=1}^{m}{\binom{n}{t}}\leq m \cdot {\binom{n}{m}}$. So, we can answer question 1.
Lemma \[list all spanning tree\] and \[the number of spanning trees for bipartite graph\] answer question 2. The time to list all the spanning trees for the complete bipartite graph is $O(m^{2m-2}+2m+m^2)$ since we have at most $m$ facilities and $m$ clients in $K_{\bar{F},{D}}$ by Lemma \[properties for untight graph\]. Note that at this stage, we do not need to consider the weight $x_{ij}$ of edge $\{i,j\}$.
By Lemma \[properties for untight graph\], we know that the number of edges is at most $2m-1$ in a spanning tree. Thus, each spanning tree has at most $2^{2m-1}$ subgraphs that have the same vertices as the spanning tree. This answers question 3.
Then, the total time to list all the possible untight subgraphs is $O( m \cdot {\binom{n}{m}} \cdot (m^{2m-2}+2m+m^2) \cdot 2^{2m-1})$.
By Lemma \[unique weight for untight graph\], we can get the cost for any untight subgraph in polynomial time $O(m)$ as long as $I=\{i\in F\cap \bar{V} \mid 0<\sum_{j\in D}{x_{ij}}<s \}$ is fixed. [Note that the opening costs for facilities are easy to get if we know the structure of $H$. Indeed, it is $\sum_{i\in F\cap \bar{V}}{f_i}$]{}. The remaining part $(V,E\setminus \bar{E})$ can be considered as an optimal integer solution to a divisible CKFLU, which means we can get the total cost in polynomial time $O(n^3)+O(m)$ by Lemma \[demand is multiple of capacity\]. This answers question 4. Moreover, the number of all the choices for $I$ is bounded by $2^m$ since there are at most $m$ facilities in each spanning tree by Lemma \[properties for untight graph\].
Combining all the pieces together, we can get all the possibilities of solutions in computing time $O( m \cdot {\binom{n}{m}} \cdot (m^{2m-2}+2m+m^2) \cdot 2^{2m-1} \cdot 2^m \cdot (m + n^3))= O({\binom{n}{m}} \cdot (m^{2m-1}+2 m^2+m^3) \cdot 2^{3m-1} \cdot (m+n^3))$, that is, $O({\binom{n}{m}} \cdot n^3)$. Finally, we output the solution with at most $k$ open facilities and the smallest total cost.
\[list all spanning tree\] *[@KapoorR]* For an undirected graph without weight $G=({V},{E})$, all spanning trees can be correctly generated in $O(N+|{V}|+|{E}|)$ time, where $N$ is the number of spanning trees.
\[the number of spanning trees for bipartite graph\] *[@Scoins]* The number of spanning trees of a complete bipartite graph is $m^{n-1} n^{m-1}$, where $m$ and $n$ are respectively the cardinalities of two disjoint sets in this bipartite graph.
The Hard Capacitated $k$-facility Location Problem with Non-uniform Capacities
==============================================================================
In this section, we show how to bound the number of fractionally open facilities by a simple rank-counting argument on an extreme point solution. Then, together with an algorithm to group clients, we give a simple constant factor approximation algorithm for the hard capacitated $k$-facility location problem with non-uniform capacities (CKFL) (with uniform opening cost) with approximation ratio $7+\epsilon$ by using at most $2k$ facilities. As a simple illustration of the techniques used, we first give a 2-approximation algorithm for the single-sink hard capacitated $k$-facility location problem (SCKFL). Note that this ratio is worse than that of the FPTAS in Section \[sec:SCKF\]. Here we aim to show that this upper bound is helpful to design approximation algorithms. And the approach is totally different from the FPTAS.
A Simple Illustration of Using the Structure of Extreme Point Solutions
-----------------------------------------------------------------------
**The Structure of Extreme Point Solutions to SCKFL**
Let $Ax\leq a, Bx\geq b, Cx=c$ be a system of linear (in)equalities. For a feasible solution $z$ we define *the rank at $z$* of the system to be the (row)rank of $\begin{bmatrix}A_z^{\mathsf{T}}&B_z^{\mathsf{T}}&C^{\mathsf{T}}\end{bmatrix}^{\mathsf{T}}$, where $A_zx\leq a_z, B_zx\geq b_z, Cx=c$ is the subsystem consisting of the (in)equalities that are satisfied with equality by $z$.
Note that for two subsystems, the sum of the ranks at $z$ of those two subsystems is at least the rank at $z$ of their union.
Let $P$ be the set of feasible solutions to the system SCKFL-LP consisting of (\[binary relaxation\]), (\[demand constraint\]),(\[capacity constraint\]) and $\sum_{i\in F}{y_i}=k$ (Note that in this section we consider constraint $\sum_{i\in F}{y_i}=k$ instead of the corresponding inequality (\[cardinality constraint\])). That is, $$P:=\{(x,y) : \text{SCKFL-LP}\},$$ where SCKFL-LP is a system of constraints given below: $$\begin{aligned}
{2}
&\sum_{i\in F}{x_{i}} = d,\quad \sum_{i\in F}{y_i}&& = k,\label{SCKF-LP}\\
&0\leq {x_{i}} \leq s_i y_i,&&\forall i\in F,\nonumber\\
&0\leq y_i\leq 1,&&\forall i\in F.\nonumber\end{aligned}$$
\[twofractional\] Let $(x,y)$ be a vertex of $P$. Then either $y$ is integer, or $y$ has exactly two noninteger components and for every $i\in F$ we have $x_i=0$ or $x_i=s_iy_i$.
Let $F':=\{i\in F\mid 0<y_i<1\}$. If $|F'|=0$ we are done. As $|F'|=1$ is ruled out because the sum of the $y_i$ is $k, k\in {\mathbb{Z}}$, we may assume that $|F'|\geq 2$.
The rank of system SCKFL-LP at $(x,y)$ is equal to $2n, n=|F|$(Theorem 5.7 in [@Schrijver]). We partition the (in)equalities in this system and bound the rank at $(x,y)$ for each subsystem:
- The rank at $(x,y)$ of the subsystem $\sum_{i\in F} x_i=d,\sum_{i\in F} y_i=k$ is at most $2$.
- For every $i\in F'$, the rank at $(x,y)$ of the subsystem $0\leq x_i, x_i\leq s_iy_i, 0\leq y_i, y_i\leq 1$ is at most $1$ and equality holds if and only if $x_i=0$ or $x_i=s_iy_i$.
- For every $i\in F\setminus F'$, the rank at $(x,y)$ of the subsystem $0\leq x_i, x_i\leq s_iy_i, 0\leq y_i, y_i\leq 1$ is at most $2$ and equality holds if and only if $x_i=0$ or $x_i=s_iy_i$.
Since the rank is subadditive, we find that the rank at $(x,y)$ of SCKFL-LP is at most $$2+|F'|+2|F\setminus F'|=2n+2-|F'|\leq 2n,\nonumber$$ where the inequality holds as $|F'|\geq 2,$ with equality only if $|F'|=2$ and for each $i$ we have $x_i=0$ or $x_i=s_i y_i$.
We give a 2-approximation algorithms for SCKFL to show the potential power of this nice structure.
**2-Approximation Algorithm for SCKFL**
We give an alternative approach to get an approximate solution for SCKFL, compared to the FPTAS in Section \[sec:SCKF\]. This approach can be viewed as incomplete implement of a branch and bound technique, branching on the 0-1 variables $y_i$. To obtain a $2$-approximation algorithm that runs in polynomial time, we use two key ideas. First, by Lemma \[twofractional\], we know in any vertex of the feasible region of the LP-relaxation that either 0 or 2 components of $y$ are fractional. We exploit this to guide the branching. Secondly, we show that for a branch $y_i=1$ either there is no 2-approximation solution, or we can find a 2-approximation solution in polynomial time by again exploiting the structure of the vertices of the feasible region to the LP-relaxation. A precise description of this algorithm is given in Algorithm \[2-approx\].
Input
: Finite set $F$ of facilities, costs $c\in {\mathbb{Z}}_{\geq 0}^F$, costs $f\in {\mathbb{Z}}_{\geq 0}^F$, capacities $s\in {\mathbb{Z}}_{\geq 1}^F$, demand $d\in {\mathbb{Z}}_{\geq 1}$, integer $k\in {\mathbb{Z}}_{\geq 1}$.
Output
: A feasible solution $(x,y)$ to MIP: (\[MIP\]),(\[capacity constraint\]),(\[binary constraint\]), and (\[SCKF-LP\]), that is within a factor $2$ of optimum, if a feasible solution exists.
Description
: \
- Find an optimal vertex $(x,y)$ of the feasible region of the LP-relaxation.\
If no solution exists then stop. If $y$ is integer then return $(x,y)$ and stop.
- Let $i_1\neq i_2$ in $F$ with $y_{i_1},y_{i_2}\in (0,1)$ and $s_{i_1}\geq s_{i_2}$.
- Define $x^1$ by $x^1_{i_1}:=x_{i_1}+x_{i_2}$, $x^1_{i_2}:=0$ and $x^1_i:=x_i$ for $i\neq i_1,i_2$.\
Define $y^1$ by $y^1_{i_1}:=1$, $y^1_{i_2}:=0$, $y^1_i:=y_i$ for $i\neq i_1,i_2$.
- Recursively compute a 2-approximation solution $(x^0,y^0)$ for the restriction to $F\setminus\{i_1\}$ and extend it by setting $x^0_{i_1}:=0$ and $y^0_{i_1}:=0$.\
- Set $F_0:=\emptyset$. While $|F_0|\leq |F|-k$ do:
- Find an optimal vertex $(x',y')$ of the feasible region of the LP-relaxation intersected with $\{(x,y)\mid y_{i_1}=1, y_i=0\ \forall i\in F_0\}$.
- If $y'$ is integer, return the best solution among $(x',y')$, $(x^0,y^0)$ and $(x^1,y^1)$ and stop.
- If $x'_{i_1}=s_{i_1}$, return the best solution among $(x^0,y^0)$ and $(x^1,y^1)$ and stop.
- Let $i_3\neq i_4$ in $F$ with $y'_{i_3},y'_{i_4}\in (0,1)$ and $f_{i_3}\leq f_{i_4}$.
- Define $y''$ by $y''_{i_1}:=0$, $y''_{i_3}:=y''_{i_4}:=1$ and $y''_i:=y'_i$ for $i\neq i_1,i_3,i_4$.\
If $(x',y'')$ has smaller value than $(x^0,y^0)$, set $(x^0,y^0)\leftarrow (x',y'')$.
- Set $F_0\leftarrow F_0\cup \{i_4\}$.
For the single-sink hard capacitated $k$-facility location problem, Algorithm \[2-approx\] finds a solution that is within a factor $2$ of optimum, or it concludes correctly that there is no feasible solution. The running time is polynomially bounded in the number $|F|$ of facilities.
Notice that an optimal vertex of the feasible region of the LP-relaxation can be found in polynomial time (see for instance [@GrotschelLS]). Furthermore, since the number of recursive calls is no more than $|F|-1$, the polynomial running time is evident. It now suffices to show that when the MIP: (\[MIP\]),(\[capacity constraint\]),(\[binary constraint\]), and (\[SCKF-LP\]) is feasible, the solution given by Algorithm \[2-approx\] is within a factor two of optimum.
Clearly, if $y$ is integer in Step 1 of Algorithm \[2-approx\], then the output $(x,y)$ is an optimal feasible solution. Hence, by Lemma \[twofractional\], we may assume that $y$ has exactly two fractional components $y_{i_1}$ and $y_{i_2}$. Then, we know $y_{i_1}+y_{i_2}=1$ since $\sum_{i\in F} y_i=k$, and all $y_i, i\in F$ are integer except $y_{i_1}$ and $y_{i_2}$. Without loss of generality we can assume that $s_{i_1}\geq s_{i_2}$.
To see that $(x^1,y^1)$ defined in Step 3 of Algorithm \[2-approx\] is indeed a feasible solution, it suffices to show that $x^1_{i_1}\leq s_{i_1}$. This follows directly from the fact that $s_{i_1}\geq s_{i_2}$, since $$\begin{aligned}
x^1_{i_1}=x_{i_1}+x_{i_2}&\leq& y_{i_1}s_{i_1}+y_{i_2}s_{i_2}\leq y_{i_1}s_{i_1}+y_{i_2}s_{i_1} =s_{i_1}.\end{aligned}$$ Further, we find an upper bound for the value of $(x^1,y^1)$, $$\label{xhatyhat}
c^{\mathsf{T}}x^1+f^{\mathsf{T}}y^1\leq (c^{\mathsf{T}}x+f^{\mathsf{T}}y)+(c_{i_1}s_{i_1}+f_{i_1}),$$ which is at most the optimum plus $c_{i_1}s_{i_1}+f_{i_1}$.
To conclude the proof, we analyse Step 5 of Algorithm \[2-approx\]. Observe that the initial solution $(x^0,y^0)$ may be replaced, but only by a better solution. Also observe, that the solution that is returned is always at least as good as $(x^0,y^0)$ and $(x^1,y^1)$. Hence, we may assume that $(x^0,y^0)$ (at the end of the algorithm) and $(x^1,y^1)$ are not $2$-approximations. Let $(x^*,y^*)$ be an optimal solution. We have $y^*_{i_1}=1$, since otherwise $(x^0,y^0)$ would be a 2-approximation already at Step 4. It suffices to show that $(x^*,y^*)$ remains feasible throughout the iterations of Step 5, until a solution of the same value is returned in Step 5b. For this, we observe that while $(x^*,y^*)$ is feasible, the situation $x'_{i_1}=s_{i_1}$ as in Step 5c cannot occur, because otherwise, by (\[xhatyhat\]), we would have $$c^{\mathsf{T}}x^1+f^{\mathsf{T}}y^1\leq c^{\mathsf{T}}x+f^{\mathsf{T}}y+(c_{i_1}s_{i_1}+f_{i_1})\leq c^{\mathsf{T}}x+f^{\mathsf{T}}y+ c^{\mathsf{T}}x'+f^{\mathsf{T}}y'\leq 2(c^{\mathsf{T}}x^*+f^{\mathsf{T}}y^*),$$ contradicting the fact that $(x^1,y^1)$ is not a $2$-approximation.
In Step 5d, the fact that $y'$ has exactly two fractional components follows from Lemma \[twofractional\] as $y'$ is a vertex of a face of the feasible region of SCKFL-LP, and hence of that region itself. Observe that this implies that $y'_{i_3}+y'_{i_4}=1$, hence $(x',y'')$ defined in Step 5e is a feasible solution.
In Step 5f, we have $y^*_{i_4}=0$. Indeed, for the cost of $(x',y'')$ we find: $$\begin{aligned}
c^{\mathsf{T}}x'+f^{\mathsf{T}}y''&=&(c^{\mathsf{T}}x'+f^{\mathsf{T}}y')-f_{i_1}+(1-y'_{i_3})f_{i_3}+(1-y'_{i_4})f_{i_4}\\
&\leq& (c^{\mathsf{T}}x'+f^{\mathsf{T}}y')+f_{i_4} \leq (c^{\mathsf{T}}x^*+f^{\mathsf{T}}y^*)+f_{i_4}.\end{aligned}$$ Since $(x^0,y^0)$ and hence $(x',y'')$ is not a $2$-approximation, we find that $f_{i_4}> c^{\mathsf{T}}x^*+f^{\mathsf{T}}y^*$ and hence $y^*_{i_4}=0$. This shows that $(x^*,y^*)$ remains feasible after adding $i_4$ to $F_0$.
An Approximation Algorithm for CKFL with Uniform Opening Costs {#sec:CKFLNU_uniform_opening_costs}
--------------------------------------------------------------
In this section, we consider the capacitated $k$-facility location problem with uniform opening costs, i.e., $f_i=f, i\in F$. Since we have an upper bound on the number of fractionally open facilities based on Lemma \[CKPfractional\] below, a [natural]{} idea is to design a constant factor approximation algorithm for CKFL by relaxing the cardinality constraint with a constant factor. We give a simple algorithmic framework that can extend any $\alpha$-approximation algorithm for the (uncapacitated) $k$-median problem (UKM) to a $(1+2\alpha)$-approximation algorithm for CKFL using at most $2k$ facilities ($2k-1$ for uniform capacities).
The (uncapacitated) $k$-median problem (UKM) can be formulated as follows, where variable $x_{ij}$ indicates the fraction of the demand of client $j$ that is served by facility $i$, and $y_{i}$ indicates whether facility $i$ is open. $$\begin{aligned}
{2}
\min\ &\sum_{i\in F}{\sum_{j\in D}{d_j c_{ij} x_{ij}}}\\
\text{subject to:\quad}&\sum_{i\in F}{x_{ij}} = 1, &&\forall j\in D,\\
&x_{ij} \leq y_i, &&\forall i\in F,\forall j\in D,\\
&\sum_{i\in F} y_i \leq k,\\
&x_{ij}, y_{i} \in \{0,1\}, &&\forall i\in F,\forall j\in D.\end{aligned}$$
**The Structure of Extreme Point Solutions to CKFL**
Let $Q$ be the set of feasible solutions $(x,y)$ to the system CKFL-LP consisting of (\[eq:demand constraint\]), (\[eq:capacity constraint\]), (\[eq:cardinality constraint\]), (\[eq:nonegative constraint\]) and (\[binary relaxation\]). That is, $$Q:=\{(x,y) : \text{CKFL-LP}\},$$ where CKFL-LP is a system of constraints given below: $$\begin{aligned}
&\sum_{i\in F}{x_{ij}}=d_j,\quad \forall j\in D; \quad \sum_{i\in F} y_i\leq k, \nonumber \\
&\sum_{j\in D}{x_{ij}} \leq s_iy_i,\quad \forall i\in F,\nonumber\\
& x_{ij}\geq 0, \quad \forall i\in F, \forall j\in D,\nonumber\\
&0\leq y_i\leq 1,\quad \forall i\in F \nonumber.\end{aligned}$$
\[CKPfractional\] Let $(x,y)$ be a vertex of $Q$. Then $y$ has at most $m+1$ noninteger components, where $m=|D|$.
The proof is similar to the proof of Lemma \[twofractional\]. Let $F'=\{i\in F \mid 0<y_i<1\}$. The rank of system CKFL-LP at $(x,y)$ is equal to $(m+1)n, n=|F|,m=|D|$. We partition the (in)equalities in this system and bound the rank at $(x,y)$ for each subsystem:
- The rank at $(x,y)$ of the subsystem $\sum_{i\in F}{x_{ij}}=d_j, \forall j\in D;\sum_{i\in F} y_i\leq k$ is at most $m+1$.
- For every $i\in F'$, the rank at $(x,y)$ of the subsystem $\sum_{j\in D}{x_{ij}} \leq s_iy_i; 0\leq x_{ij}, j\in D; 0\leq y_i; y_i\leq 1$ is at most $m$ and equality holds if and only if $x_{ij}=0$ or $x_{ij}=s_i y_i$ for each $x_{ij}$.
- For every $i\in F\setminus F'$, the rank at $(x,y)$ of the subsystem $\sum_{j\in D}{x_{ij}} \leq s_iy_i; 0\leq x_{ij},j\in D; 0\leq y_i; y_i\leq 1$ is at most $m+1$ and equality holds if and only if $x_{ij}=0$ or $x_{ij}=s_i y_i$ for each $x_{ij}$.
Since the rank is subadditive, we find that the rank of CKFL-LP is at most $$m+1+m|F'|+(m+1)|F\setminus F'|=m+1+(m+1)n-|F'|.\nonumber$$ So, we have $|F'|\leq m+1$ as $m+1+(m+1)n-|F'|\geq (m+1)n$.
For the uniform capacities case ($s_i=s>0, \forall i\in F$), we will show a stronger property that there is an optimal solution $(x,y)$ to the LP-relaxation with at most $m$ noninteger components in $y$. Indeed, consider an optimal solution $(x,y)$ with $|\{i\mid 0<y_i<1\}|$ minimal. Suppose for contradiction that $y$ has more than $m$ fractional components. Then there exist a client $j$ and two facilities $i_1, i_2$ such that $y_{i_1}$ and $y_{i_2}$ are fractional and $x_{i_1 j}, x_{i_2 j}>0$, and $x_{i_1 j}=s y_{i_1}, x_{i_2 j}=s y_{i_2}$ by Lemma \[CKPfractional\]. Without loss of generality assume that $c_{i_1 j}\leq c_{i_2 j}$. Let $\epsilon:=\min\{sy_{i_2},s(1-y_{i_1})\}$. Now modify $(x,y)$ by setting $$\begin{aligned}
x_{i_1 j}:=x_{i_1 j}+\epsilon&&y_{i_1}:=y_{i_1}+\epsilon/s\\
x_{i_2 j}:=x_{i_2 j}-\epsilon&&y_{i_2}:=y_{i_2}-\epsilon/s,\end{aligned}$$ to obtain a new optimal solution, while $|\{i\mid 0<y_i<1\}|$ decreases, a contradiction. Thus, we can find an optimal solution $(x,y)$ to the LP-relaxation for which $y$ has at most $m$ noninteger components.
**The Algorithm**
We convert our original instance to a new instance with at most $k$ clients while incurring some bounded extra costs. Then, at most $2k$ facilities are (fractionally or fully) opened for the new instance according to Lemma \[CKPfractional\].
Input
: Finite set $F$ of facilities, $D$ of clients, costs $c\in {\mathbb{Q}}_{\geq 0}^{F\times D}$, opening cost $f\in {\mathbb{Q}}_{\geq 0}$, capacities $s\in {\mathbb{Q}}_{\geq 0}^F$, demands $d\in {\mathbb{Q}}_{\geq 0}^D$, integer $k\in {\mathbb{Z}}_{\geq 1}$.
Output
: A solution $(x,y)$ to MIP (\[eq:MIP\])-(\[eq:binary constraint\]) using at most $2k$ facilities that is within a factor $1+2\alpha$ of optimum, if a feasible solution exists.
Description
: \
Suppose exactly $l$ facilities are opened in an optimal solution. That is, we can consider a stronger constraint $\sum_{i\in F} y_i\leq l.$
**Step 1**. Reduce the input instance $I_0$ of CKFL to an instance $I_1$ of UKM as follows.\
Let $F$ and $D$ be the set of facilities and clients of our input instance $I_0$ respectively. Let $F^\prime=F$ (located at the same sites) be the set of facilities of UKM while with infinite capacities and without opening costs. Let $D^\prime=D$ be the set of clients of UKM. Solve this constructed instance (denoted by $I_1$) by the existing $\alpha$-approximation algorithm for UKM. Suppose we get an integer solution $(x^\prime,y^\prime)$. Note that for UKM, there is an optimal solution in a form of so-called stars. That is, each client is served by exactly one open facility. Without loss of generality, suppose $y^\prime_1=\cdots=y^\prime_l=1$. Then, we can consider $(x^\prime,y^\prime)$ as $l$ stars $\{T_1,\cdots, T_l\}$, where $T_r=\{j \in D^\prime \mid x^\prime_{r j}=1\}$ and the center of $T_r$ is the facility $r$.
**Step 2**. Consolidate clients and construct a new instance $I_2$ of CKFL with at most $l$ clients as follows.\
For each star $T_r$ in $(x^\prime,y^\prime)$, we set a client $t_r$ at the location of facility $r$ with the total demand of clients in $T_r$, i.e., $d_{t_r}=\sum_{j\in T_r}{d_{j}}$. Let $\bar{D}=\{t_1,\cdots,t_l\}$ be the set of our new clients. Now we get a new instance of CKFL, denoted by $I_2$, with facilities $F$ and clients $\bar{D}$.
**Step 3**. Find an optimal vertex $({x},{y})$ of the feasible region of the LP-relaxation to the constructed instance $I_2$ in step 2 with $\sum_{i\in F} y_i=l$.
**Step 4**. We simply open all the facilities with $y_i>0$ in our original instance $I_0$ and then solve a transportation problem to get an integer solution $(x^*,y^*)$.\
Since we do not know how many facilities are opened in an optimal solution in advance, we repeat the above 4 steps for $l:=1,\cdots,k$. Then, output the solution with smallest total cost.
\[theorem:CKFNU\] By Algorithm \[CKFL-approx\], each $\alpha$-approximation algorithm for UKM can be extended to get a $(1+2\alpha)$-approximation algorithm for CKFL with uniform opening costs using at most $2k$ facilities.
Without loss of generality, suppose exactly $k$ facilities are opened in an optimal solution to our original problem (as we check all the cases in our algorithm).
Let $OPT(\ast)$ denote the optimal cost of the instance $\ast$. We consider the following instances.
[ c | l ]{} $I_0$ & the original instance.\
$I_1$ &
-----------------------------------------------
the constructed instance in Step 1,
that is a (uncapacitated) $k$-median problem.
-----------------------------------------------
\
$I_2$ &
---------------------------------------------
the constructed instance in Step 2 in which
we have at most $k$ clients.
---------------------------------------------
\
Let $COST(\cdot,\cdot)$ be the total cost of obtained solution $(\cdot,\cdot)$. We consider the following solutions
[ c | l ]{} $(x',y')$ & the obtained integral solution by $\alpha$-approx. alg. for instance $I_1$.\
$(x,y)$ &
---------------------------------------------------
an optimal fractional solution of instance $I_2$.
---------------------------------------------------
\
$(x^*,y^*)$ &
-----------------------------------------------------------------------------
an integral solution of instance $I_0$ while using at most $2k$ facilities.
-----------------------------------------------------------------------------
\
Clearly, we have $COST(x,y)\leq OPT(I_2),$ and $COST(x',y')\leq \alpha OPT(I_1).$ By the process to construct instance $I_2$, we have $OPT(I_0)+COST(x',y')\geq OPT(I_2)$. Moreover, we know that $OPT(I_0)\geq OPT(I_1)+k f$.
We will prove $$COST(x^*,y^*) \leq COST(x',y') + COST(x,y)+k f.$$
We first show that we can obtain an integer solution for $I_2$ with the total cost at most $COST(x,y)+k f$ in Step 4 of Algorithm \[CKFL-approx\]. We have $|\{i\mid 0<y_i<1\}|\leq k+1$, since Lemma \[CKPfractional\] still holds when $\sum_{i\in F} y_i=k$. Moreover, if $|\{i\mid 0<y_i<1\}|>0,$ then $|\{i\mid y_i=1\}|\leq k-1$. So, we open at most $2k$ facilities. Thus, the total cost of the obtained solution for $I_2$ is at most $COST(x,y)+kf$.
Then, based on the above solution for $I_2$ we can construct an integer solution for $I_0$ by moving the demand of $t_r$, which is located at the same position with facility $r$, back to all clients in $T_r=\{j\in D^\prime | x^\prime_{r j}=1\}$ with increasing at most $COST(x',y')$ cost as $COST(x',y')=\sum_{r=1}^k {\sum_{j\in D^\prime}{d_j c_{r,j} x^\prime_{r,j}}}$. Therefore, the solution obtained by Step 4 has $COST(x^*,y^*) \leq COST(x',y') + COST(x,y)+k f$.
Then, we have $$\begin{aligned}
COST(x^*,y^*) &\leq & COST(x',y')+ OPT(I_2)+kf \\
&= & (OPT(I_2)- COST(x',y'))+ 2 COST(x',y')+kf \\
&\leq & OPT(I_0)+ 2 COST(x',y')+kf \\
&\leq & OPT(I_0)+ 2 \alpha OPT(I_1)+kf \\
&\leq & OPT(I_0)+ 2 \alpha (OPT(I_1)+ kf)\leq (1+2\alpha) OPT(I_0).\end{aligned}$$ That is, the approximation ratio is $1+2\alpha$.
We can obtain the following result as there is a $(3+\epsilon)$-approximation algorithm for the (uncapacitated) $k$-median problem in [@AryaGKMMP], and we can make sure that at most $2k-1$ facilities are opened in step 4 if all capacities are equal.
Algorithm \[CKFL-approx\] can get an integer solution within $7+\epsilon$ times of the optimal cost by using at most $2k$ facilities ($2k-1$ facilities) for the hard capacitated $k$-facility location problem with uniform opening costs (with uniform opening costs and uniform capacities).
Extension
---------
We show how to combine the algorithm in Section \[sec:CKFLNU\_uniform\_opening\_costs\] with the algorithm of Charikar and Guha [@CharikarG] to improve the approximation ratio for the capacitated facility location problem (CFL) with uniform opening cost. In this section, we only consider uniform opening cost. To simplify the description, sometimes we omit “with uniform opening cost” when we refer to the problems.
A $(\beta,\delta)$-approximation algorithm for the (uncapacitated) $k$-median problem (UKM) outputs an integer solution by using at most $\delta k$ facilities, with service cost at most $\beta$ times the optimal total cost.
\[theorem:CFL\] Each $(\beta,\delta)$-approximation algorithm for the $k$-median problem gives rise to a $\max\{2\beta+1, \delta+1\}$-approximation algorithm for the CFL with uniform opening costs.
A crucial observation is that if exactly $k$ facilities are opened in the optimal solution for an instance $I$ of CFL, then this solution is also an optimal solution to the corresponding instance of CKFL, where the input is the same as that in $I$ but with an extra constraint that at most $k$ facilities can be opened. Thus, if for each $k=1,\cdots,n, n=|F|$ we can obtain the optimal solution for CKFL, then the solution with smallest total cost is the optimal solution for CFL.
Our algorithm for CFL is as follows: Repeat the 4 steps in Algorithm \[CKFL-approx\] for $l:=1,\cdots,n$, $n=|F|$. In each iteration, we consider the constraint $\sum_{i\in F} y_i\leq l.$ Then, output the solution with smallest total cost.
To get a better approximation ratio for CFL, we replace the $\alpha$-approximation algorithm for the $k$-median problem in Step 1 of Algorithm \[CKFL-approx\] by a $(\beta,\delta)$-approximation algorithm. Then, for each iteration $l$, we obtain an integer solution for the instance $I_1$ with at most $\delta l$ open facilities. Thus, we have at most $\delta l$ clients in instance $I_2$.
Again, without loss of generality, suppose exactly $k$ facilities are opened in an optimal solution for the original instance $I_0$.
We maintain all the notations in the proof of Theorem \[theorem:CKFNU\]. Notice that we have $COST(x,y)\leq OPT(I_2),$ $OPT(I_0)+COST(x',y')\geq OPT(I_2)$ and $OPT(I_0)\geq OPT(I_1)+k f$ still hold. Moreover, $COST(x',y')\leq \beta OPT(I_1)$,
We will prove $$COST(x^*,y^*) \leq COST(x',y') + COST(x,y)+\delta k f.$$
The proof is similar to that in proof of Theorem \[theorem:CKFNU\]. We first show that we can obtain an integer solution for $I_2$ with the total cost at most $COST(x,y)+\delta k f$ in step 4. Note that $|\{i\mid 0<y_i<1\}|\leq \delta k+1$, since Lemma \[CKPfractional\] still holds when $\sum_{i\in F} y_i=k$. So, at most $(\delta+1) k$ facilities are opened at the end, since if $|\{i\mid 0<y_i<1\}|>0,$ then $|\{i\mid y_i=1\}|\leq k-1$. Thus, the total cost of the obtained solution for $I_2$ is at most $COST(x,y)+ \delta k f$.
Then, by moving the demand of $t_r$ back to all clients in $T_r=\{j\in D^\prime | x^\prime_{r j}=1\}$, we can construct an integer solution for $I_0$. This operation increases at most $COST(x',y')$ cost as $COST(x',y')=\sum_{r=1}^k {\sum_{j\in D^\prime}{d_j c_{r,j} x^\prime_{r,j}}}$. Therefore, the solution obtained by Step 4 has $COST(x^*,y^*) \leq COST(x',y') + COST(x,y)+ \delta k f$.
Then, we have $$\begin{aligned}
COST(x^*,y^*) &\leq & COST(x',y')+ OPT(I_2)+\delta kf\\
&\leq & COST(x',y')+ OPT(I_0)+ COST(x',y')+ \delta kf \\
&= & OPT(I_0)+ 2 COST(x',y')+\delta kf\\
&\leq & OPT(I_0)+ 2 \beta OPT(I_1)+\delta kf \\
&\leq & OPT(I_0)+ 2 \beta (OPT(I_0)-kf)+\delta kf \\
&\leq & (1+2 \beta) (OPT(I_0)-kf)+(\delta+1) kf.\end{aligned}$$ Recall that we assume that exactly $k$ facilities are opened in the optimal solution to $I_0$. So, the total service cost of the optimal solution to $I_0$ is $OPT(I_0)-kf$. Then, $COST(x^*,y^*)\leq \max\{2\beta+1, \delta+1\} OPT(I_0).$
([@CharikarG])\[theorem:bifactor\_UFL\] Let $SOL$ be any solution to the uncapacitated facility location problem (possibly fractional), with facility cost $F_{SOL}$ and service cost $C_{SOL}$. For any $\gamma>0$, the local search heuristic proposed (together with scaling) gives a solution with facility cost at most $(1+\frac{2}{\gamma})F_{SOL}$ and service cost at most $(1+\gamma)C_{SOL}.$ The approximation is up to multiplicative factors of $(1+\epsilon)$ for arbitrarily small $\epsilon>0.$
Based on Theorem \[theorem:bifactor\_UFL\], we can obtain the following corollary.
\[corollary:UKM\] For any $\gamma>0$, there exists a $((1+\epsilon)(1+\gamma),(1+\epsilon)(1+\frac{2}{\gamma}))$-approximation algorithm for the $k$-median problem, where $\epsilon>0$ can be arbitrarily small.
Let $(x',y')$ be an optimal solution with total cost $T$ to the LP relaxation of UKM. A crucial observation is that $(x',y')$ is also a feasible fractional solution to UFL with uniform opening cost $f>0$. Let $SOL=(x',y')$ with total facility cost $F_{SOL}$ and total service cost $C_{SOL}$. Note that $C_{SOL}=T$ and $F_{SOL}\leq kf.$
Now, it is easy to see that, based on the Charikar and Guha algorithm [@CharikarG], we could get an integer solution with at most $(1+\gamma)(1+\epsilon)$ times the optimal cost while using at most $(1+\frac{2}{\gamma})(1+\epsilon)k$ facilities for the $k$-median problem. That is, there exists a $((1+\epsilon)(1+\gamma),(1+\epsilon)(1+\frac{2}{\gamma}))$-approximation algorithm for the $k$-median problem, where $\epsilon>0$ can be arbitrarily small.
The following theorem can be obtained by combining Corollary \[corollary:UKM\] with Theorem \[theorem:CFL\] and setting $\gamma=0.78078.$
There is a $4.562(1+\epsilon)$-approximation algorithm for the capacitated facility location problem with uniform opening costs, where $\epsilon>0$ can be arbitrarily small.
[^1]: Corresponding authors: shanfei.li@tudelft.nl
|
{
"pile_set_name": "ArXiv"
}
|
In China, amid a backlash against the increasing wealth and rampant consumerism of the past several decades, people are turning to religion to find deeper meaning.
Key points: Daoism takes in elements of calligraphy, medicine and Feng Shui
Daoism takes in elements of calligraphy, medicine and Feng Shui The faith is 2,000 years old
The faith is 2,000 years old Its revival is being tolerated by the Communist Party, for now
Christians are said to number 100 million in China but the biggest growth has been in traditional religions like Daoism.
One key Daoist temple, the Central Peak in Beijing, has been restored, with a parade of Chinese martial artists, bands of cymbal players and drummers celebrating the occasion.
The 2,000-year-old Chinese faith of Daoism is a force once more. It's a celebration of harmony, a blending of opposites.
The Communist Party tried to crush Daoism but now it's encouraged by the Government.
Daoist elder Zhao Baoqi says "we have restored" Daoist culture. ( ABC News )
Daoist elder Zhao Baoqi says Daoism is the first religion of China.
"In civil society traditional Chinese culture is Daoism, the people are now back to Daoist culture, we have restored it," he said.
Author and journalist Ian Johnson has been investigating the revival of Chinese folk religions like Daoism for the past two decades, and he says to understand Daoism is fundamental to understanding China.
"It's the DNA of Chinese culture, it includes the ideas like calligraphy, Chinese medicine, things like Feng Shui — all of these things come out of Daoist ideas," he said.
Younger people rediscovering Daoist faith
Daoist worshipper Wang Qun making offerings at the Central Peak Temple. ( ABC News )
Central Peak Temple is the home of the fertility goddess Guanyin, and hundreds of people like Wang Qun turned up for the opening to pray and make offerings.
"When I was pregnant I came to pray for a healthy baby, so now it's open I've come to offer my gratitude," she said.
The younger generation are rediscovering the faith.
Bus driver Lei Peng says he has found a deeper meaning through Daoism. ( ABC News )
Lei Peng, a bus driver, has found no comfort in China's new wealth and rampant consumerism, but says he has found a deeper meaning in Daoism.
"People are lacking in faith, they've lost their cultural base, lost it all," he said.
"Daoism gives it back, we are reconnecting to our cultural inheritance."
Government watching rise of Daoism carefully
For the moment, the Government is supporting the rise of Daoism.
They see it as a part of Chinese culture, and a much better alternative than the foreign religion of Christianity, which is also growing rapidly.
The younger generation is rediscovering Daoism. ( ABC News )
Mr Johnson says there is much more suspicion of Western religions.
"Religions can grow as long as they walk lock and step with the Government," he said.
"You can provide values, an escape for people, or turn inward to piety, but you cannot challenge the Government. You can't be an alternative source of values or the Government will turn against you."
The Government is watching the growth of Daoism carefully.
It wants to ensure it does not turn into another Falun Gong type movement that could threaten the Government and lead to another brutal crackdown like that which happened two decades ago.
|
{
"pile_set_name": "OpenWebText2"
}
|
Neidhart
Neidhart is both a surname and a given name. Notable people with the name include:
Christian Neidhart, German football manager
Jim Neidhart, Canadian professional wrestler
Natalya Neidhart, Canadian professional wrestler (daughter of Jim)
Neidhart von Reuental, a 13th-century German minnesinger
Nico Neidhart, German footballer
|
{
"pile_set_name": "Wikipedia (en)"
}
|
BAYTOWN, TX (KTRK) -- A Baytown teen's mother says her daughter is the victim of racial discrimination by her high school cheer coach.Fifteen-year-old Kemirah Jn-Marie is a flyer on the Ross S. Sterling High School varsity cheer squad."The coach makes it hard to be on varsity," she said, telling Eyewitness News the coach has been on her repeatedly about her hair. "She makes me feel bad about myself," said Jn-Marie.This year, she says, she had special braids done in the hope of meeting cheer requirements. Her mother says things really got out of hand last week when the coach told Kemirah she wouldn't be able to perform at Saturday's football game if she showed up as she did at school - with her hair in braids. "I said, 'If that's the case, put it in writing. Just put it in writing,'" said Mayra Jn-Marie. She says the school district refused.What is in writing are these Sterling High cheer guidelines: Hair must be "pulled back in a secure pony tail" and hair "must not distract from the cheer environment." The policy also states that an administrator will determine if a hair style is disruptive.Nowhere in the guidelines does it say anything specifically about prohibiting braids. "I feel like she singles me out," said Kemirah.Kemirah says other girls are given more leeway in hairstyles. As the only African-American on the cheer squad, she and her mother say the coach seems to be more adamant about complaints against her."She's been harassed. She's been bullied by her teacher, and I'm tired of it," said Mayra Jn-Marie.A spokesperson for Goose Creek Consolidated Independent School District says this was only a simple disagreement over hairstyles.Beth Dombrowa, Director of Communications for Goose Creek CISD, issued a statement on the matter. "This student is not the only cheerleader who has been asked to correct her hairstyle, or other parts of her uniform; further, she was in no way reprimanded, punished or kept from participating - she was simply reminded to use the agreed-upon hairstyle. In no way do we discriminate, or tolerate, discrimination of any student."Kemirah says she did go to that game Saturday with braids in her hair, and that she still was allowed to perform.
|
{
"pile_set_name": "OpenWebText2"
}
|
...excellent performances. Unfortunately, the information about speed has not yet available. The others detailed information about the specifications will be announced sooner. 2016 Honda Grace LX price reviews This Honda...
...or six-speed manual transmission systems. Its AWD unit is options and available with intelligent control systems to improve all-weather tractions. For Honda HR-V 2016 price, the information is still predictable....
|
{
"pile_set_name": "Pile-CC"
}
|
The number of African-Americans involved. Police are more likely to deploy against African-American protesters than white ones, according to a 2011 study published in the American Sociological Review. And as Washington Post columnist Kim Yi Dionne keenly points out, the massive police crackdown on the mostly black community of Ferguson, Mo., is a prime example.
In sampling over 15,000 protests from 1960-1990, researchers discovered that police were more likely to arrest people, use force or both when black protesters were involved. While the disparity in the use-of-force has lessened since 1970, the researchers emphasize that the effect of "protesting while black" varies over time, but does not disappear.
It's hard to argue that this is not a pattern of overt and systemic mistreatment.
Just look at Ferguson: This is happening in Missouri right now.
The study doesn't prove police arrive to beat up black people, but it demonstrates they're more likely to consider protests involving them as threats to public order. What's more, the tactics police use can easily anger or provoke the crowd, and therefore create the perfect opportunity for authorities to justify force.
In Ferguson, media and community members said that police crackdowns on protests preceded and helped trigger the breakdown of order across the community.
As policing expert Jason Fritz told Vox, "Trying to intimidate the crowds off the street, especially considering that it's a protest against police aggression — well, it's just stupid. It's going to exacerbate the problem."
He suspects there's an additional reason that cops reacted so violently in Ferguson: The billions of dollars in high-grade military hardware the Pentagon has handed out to American police departments. "They have the toys, and they just want to play with them, to put it bluntly," Fritz said to Vox.
Finally, besides the terrifying implications of bringing military hardware to bear on protesters, less-lethal weapons like rubber bullets, tear gas and batons are still instruments of harm that can cause horrible injuries. Black Americans are disproportionately more likely to have these weapons brought to bear on them.
Why you should care: If you're wondering why this still occasionally happens ...
... remember that it has a lot to do with an entrenched legacy of police brutality against and repression of black Americans.
h/t the Washington Post
|
{
"pile_set_name": "OpenWebText2"
}
|
Predictors of CD34+ cell mobilization and collection in adult men with germ cell tumors: implications for the salvage treatment strategy.
High-dose chemotherapy with tandem or triple carboplatin and etoposide course is currently the first curative choice for relapsing GCT. The collection of an adequate amount of hematopoietic (CD34(+)) stem cells is a priority. We analyzed data of patients who underwent HDCT at 2 referral institutions. Chemotherapy followed by myeloid growth factors was applied in all cases. Uni- and multivariable models were used to evaluate the association between 2 prespecified variables and mobilization parameters. Analyses included only the first mobilizing course of chemotherapy and mobilization failures. A total of 116 consecutive patients underwent a mobilization attempt from December 1995 to November 2012. Mobilizing regimens included cyclophosphamide (CTX) 7 gr/m(2) (n = 39), cisplatin, etoposide, and ifosfamide (PEI) (n = 42), paclitaxel, cisplatin, and gemcitabine (TPG) (n = 11), and mixed regimens (n = 24). Thirty-seven percent were treated in first-line, 50% (n = 58) in second-line, 9.5% (n = 11) and 3.4% (n = 4) in third- and fourth-line settings, respectively. Six patients did not undergo HDCT because they were poor mobilizers, 2 in first- and second-line (1.9%), and 4 beyond the second-line (26.7%). In the multivariable model, third-line or later setting was associated with a lower CD34(+) cell peak/μL (P = .028) and a lower total CD34(+)/kg collected (P = .008). The latter was also influenced by the type of mobilizing regimen (P < .001). A decline in significant mobilization parameters was found, primarily depending on the pretreatment load. Results lend support to the role of CD34(+) cell mobilization in the therapeutic algorithm of relapsing GCT, for whom multiple HDCT courses are still an option, and potentially a cure.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
{
"info" : {
"version" : 1,
"author" : "xcode"
}
}
|
{
"pile_set_name": "Github"
}
|
Q:
A simple Spark app with problems of MojoExecutionException
I'm studying Apache Spark and trying to run a Spark in Java program, but I get some problems.
I use Maven to build the program and I created a new maven project. Here is the pom.xml
<groupId>spark</groupId>
<artifactId>testspark</artifactId>
<version>0.0.1-SNAPSHOT</version>
<packaging>jar</packaging>
<name>testspark</name>
<url>http://maven.apache.org</url>
<properties>
<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
</properties>
<repositories>
<repository>
<id>Akka repository</id>
<url>http://repo.akka.io/releases</url>
</repository>
</repositories>
<dependencies>
<dependency>
<groupId>junit</groupId>
<artifactId>junit</artifactId>
<version>3.8.1</version>
<scope>test</scope>
</dependency>
<dependency>
<groupId>org.apache.spark</groupId>
<artifactId>spark-core_2.10</artifactId>
<version>0.9.0-incubating</version>
</dependency>
</dependencies>
And my Spark program in Java is here:
public class SimpleApp{
public static void main(String[] args) {
String logFile = "/usr/Java/spark-0.9.0/README.md";
JavaSparkContext sc = new JavaSparkContext("local", "Simple App","/usr/Java/spark-0.9.0",new String[] { "target/testspark-0.0.1-SNAPSHOT.jar" });
JavaRDD<String> logData = sc.textFile(logFile).cache();
long numAs = logData.filter(new Function<String, Boolean>() {
public Boolean call(String s) {
return s.contains("a");
}
}).count();
long numBs = logData.filter(new Function<String, Boolean>() {
public Boolean call(String s) {
return s.contains("b");
}
}).count();
System.out.println("Lines with a: " + numAs + ", lines with b: " + numBs);
}
}
I use mvn package and mvn -X exec:java -Dexec.mainClass="spark.testspark.SimpleApp" to run the program. I can get the program result:Lines with a: 70, lines with b: 44, but after this there are problems as follows:
[ERROR] Failed to execute goal org.codehaus.mojo:exec-maven-plugin:1.3:java (default-cli) on project testspark: An exception occured while executing the Java class. null: InterruptedException -> [Help 1]
org.apache.maven.lifecycle.LifecycleExecutionException: Failed to execute goal org.codehaus.mojo:exec-maven-plugin:1.3:java (default-cli) on project testspark: An exception occured while executing the Java class. null
at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:216)
at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:153)
at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:145)
at org.apache.maven.lifecycle.internal.LifecycleModuleBuilder.buildProject(LifecycleModuleBuilder.java:108)
at org.apache.maven.lifecycle.internal.LifecycleModuleBuilder.buildProject(LifecycleModuleBuilder.java:76)
at org.apache.maven.lifecycle.internal.builder.singlethreaded.SingleThreadedBuilder.build(SingleThreadedBuilder.java:51)
at org.apache.maven.lifecycle.internal.LifecycleStarter.execute(LifecycleStarter.java:116)
at org.apache.maven.DefaultMaven.doExecute(DefaultMaven.java:361)
at org.apache.maven.DefaultMaven.execute(DefaultMaven.java:155)
at org.apache.maven.cli.MavenCli.execute(MavenCli.java:584)
at org.apache.maven.cli.MavenCli.doMain(MavenCli.java:213)
at org.apache.maven.cli.MavenCli.main(MavenCli.java:157)
at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:57)
at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.lang.reflect.Method.invoke(Method.java:606)
at org.codehaus.plexus.classworlds.launcher.Launcher.launchEnhanced(Launcher.java:289)
at org.codehaus.plexus.classworlds.launcher.Launcher.launch(Launcher.java:229)
at org.codehaus.plexus.classworlds.launcher.Launcher.mainWithExitCode(Launcher.java:415)
at org.codehaus.plexus.classworlds.launcher.Launcher.main(Launcher.java:356)
Caused by: org.apache.maven.plugin.MojoExecutionException: An exception occured while executing the Java class. null
at org.codehaus.mojo.exec.ExecJavaMojo.execute(ExecJavaMojo.java:345)
at org.apache.maven.plugin.DefaultBuildPluginManager.executeMojo(DefaultBuildPluginManager.java:133)
at org.apache.maven.lifecycle.internal.MojoExecutor.execute(MojoExecutor.java:208)
... 19 more
Caused by: java.lang.InterruptedException
at java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject.reportInterruptAfterWait(AbstractQueuedSynchronizer.java:2017)
at java.util.concurrent.locks.AbstractQueuedSynchronizer$ConditionObject.await(AbstractQueuedSynchronizer.java:2052)
at java.util.concurrent.LinkedBlockingQueue.take(LinkedBlockingQueue.java:442)
at org.apache.spark.scheduler.SparkListenerBus$$anon$2.run(SparkListenerBus.scala:42)
[ERROR]
[ERROR]
[ERROR] For more information about the errors and possible solutions, please read the following articles:
[ERROR] [Help 1] http://cwiki.apache.org/confluence/display/MAVEN/MojoExecutionException
root@ubuntu:~/workspace/testspark# mvn -X exec:java -Dexec.mainClass="spark.testspark.SimpleApp"
I am confused by these problems. Any idea? Thank you!
A:
I think you have forgotten to call the JavaSparkContext stop() method at the end. Would the following also give you error?
public class SimpleApp{
public static void main(String[] args) {
String logFile = "/usr/Java/spark-0.9.0/README.md";
JavaSparkContext sc = new JavaSparkContext("local", "Simple App","/usr/Java/spark-0.9.0",new String[] { "target/testspark-0.0.1-SNAPSHOT.jar" });
JavaRDD<String> logData = sc.textFile(logFile).cache();
long numAs = logData.filter(new Function<String, Boolean>() {
public Boolean call(String s) {
return s.contains("a");
}
}).count();
long numBs = logData.filter(new Function<String, Boolean>() {
public Boolean call(String s) {
return s.contains("b");
}
}).count();
System.out.println("Lines with a: " + numAs + ", lines with b: " + numBs);
sc.stop();
}
}
|
{
"pile_set_name": "StackExchange"
}
|
GSM (disambiguation)
GSM (Global System for Mobile communications) is a European standard for mobile devices.
GSM may also refer to:
Education
GSM London, a higher education provider
Guildhall School of Music and Drama, formerly Guildhall School of Music
Graduate Studies in Mathematics, textbooks by the American Mathematical Society
IILM Graduate School of Management, Greater Noida, India
Graduate School of Management (GSM Barcelona)
Military
Garrison Sergeant Major, in the British Army
General Service Medal (disambiguation), various campaign medals
Gas turbine system technician (mechanical), a U.S. Navy rating
Places
Church of St Mary the Great, Cambridge, known as GSM
Qeshm International Airport, Qeshm Island, Iran, IATA code GSM
Għajnsielem, Gozo, Malta, postcode GSM
Other uses
Grams per square metre, a measure of paper or density or grammage
GSM blends, Australian wine, with Grenache, Shiraz and Mourvèdre
Glass Sport Motors, a former South African car company
Flyglobespan, ICAO airline code GSM
Gender and sexual/sexuality minorities, an alternative term to LGBT
Ginebra San Miguel, a subsidiary of San Miguel Corporation
Guatemalan Sign Language, ISO 639 language code gsm)
See also
|
{
"pile_set_name": "Wikipedia (en)"
}
|
[Representation of self-care of health at work among urban bus drivers in Guadalajara, Mexico].
This study aimed to analyze the social representations of health self-care at work among urban bus drivers in Guadalajara, Mexico. The methodology was qualitative, with a multi-method design based on the theory of social representations. The first stage involved active observation sessions with the information recorded in field notes; in the second stage, the associative letter technique and successively hierarchized trees technique were applied to 20 drivers, submitting the data to a classical analysis of the free associations; a third stage involved semi-structured interviews with 4 drivers, submitted to content analysis. The results indicate that structurally, the representation is centered on alimentation, presenting the concepts rest and corrective health care at peripheral levels. Procedurally, the represeentation centers in the psychosocial factors derived from the working conditions, while the rest of the work characteristics are seen as low risk to health. The self-care actions mentioned by the participants only focus on the workinging conditions perceived as risky. The social representation of health self-care at work is a collective mental construction, developed and modified through social interactions, which influences self-care measures used against the risks perceived in the workplace.
|
{
"pile_set_name": "PubMed Abstracts"
}
|
Welcome to the Hotel California
Having peered down the slope of Egypt’s dark side in el Hussein yesterday I decided to launch myself fully down it by attending a protest tonight, downtown.
Organised by Kefaya it was a demonstration against torture, against the imprisonment of journalists, against corruption and was also an expression of solidarity with the courageous workers on strike in Mahalla. Essentially, it was against everything and sought to deliver the usual two fingers to the regime.
Arriving in Talaat Harb Square, comrade Sharshar and I found it devoid of all dissent other than the disembodied voice of protestors with a loudspeaker standing on the balcony above Groppi in the Ghad Party headquarters. At ground-level however the pavements had been entirely occupied by the police: battalions of the boys in black, officers in white, plain-clothes officers with their walkie-talkies and pen and paper writing down what was being chanted above, and the rows upon rows of baltageyya, plain-clothed moustachioed soldiers who are called in to dispense order when things heat up. Some of these men were sitting down on the length of the pavement lining Groppi, others were standing outside the Madbouly bookshop. Meanwhile, Thursday evening strolling families cut through this scene of mass mobilisation as if it wasn’t even there, impervious to the yosqot yosqot [down down] Hosny Mobarak being bawled out above their heads.
Word eventually reached us that another demo was being held outside the journalists’ syndicate. Arriving there, we found a scene of much greater animation on the syndicate’s steps: some 150 people carrying banners and led by protest leaders leading the chants with gusto. All was contained by the usual black banner of soldiers standing behind the metal barriers, and on the other side of the road the officers in white uniforms or no uniforms milling about and making notes. We joined the demo, and as we passed through the narrow gap in the barrier I noticed that people already there were not being allowed out, but didn’t give it too much thought. Sharshar helped me to (inelegantly) mount a ledge on either side of the steps which gave an excellent view of the proceedings and which, above the crush of bodies, proved mercifully cool.
The passion on display during the protest was impressive, even if the slogans were largely anti- the status quo without being obviously very pro anything: I have heard this criticism of the Egyptian opposition movement on numerous occasions, and while it does seem to be a serious weakness I nonetheless admired the courage of the individuals leading the chants, men and women, sometimes with their children. To be so publicly visible, to risk all and identify yourself to the men watching across the road with their pens and papers and know that they when the media and the crowds leave you are completely isolated – that requires guts, or desperation, or perhaps both.
Some forty minutes into the protest it became obvious that only camera crews and journalists were being let out of the protest, and with difficulty. Some sixty people were assembled at the exit, arguing with the policemen who were dictating who and who could not be let out. Tensions inevitably escalated and one woman began punching the soldiers trying to force her way out. Down the line a white-haired veteran activist mounted the shoulders of a man and literally tried to climb her way over the soldiers, unsuccessfully of course.
As the situation heated up more soldiers in black were brought in to act as back up behind those stationed at the barriers, and the foreign journalists started to make their exits. It was at this point that I began to realise to what extent we were at the mercy of the police, whose approach to crowd control is to hit anything which moves. And the terrifying thing is that there is absolutely no-one who can help protestors if demonstrations turn nasty, hence the importance of a media presence, and in particular the foreign media, who are able to both publicise and (to some extent) prevent the worst excesses by security forces.
We were kept there for nearly three hours, watching the police mobilise outside and wondering what for. It was an odd mixture of tension and boredom, but the Mahalla workers and Kefaya activists remained undaunted, and if anything seemed spurred on by it all. Eventually however people began queuing up at the ‘exit’ in an attempt to leave, and we joined them.
While waiting I amused myself by taking photos of the soldiers acting as a human barricade. In these unfortunate youths the regime has succeeded in creating automatons, programmed to stand for hours on end or to sit in their furnace-like trucks until required or beat people. But they are entirely uncomprehending of what is going on before them because they are voiceless, disenfranchised, poorly-educated kids without choices. I larked about with them while waiting to get out, took pictures of them. They posed, put their baseball hats on back to front, smiled, laughed, asked for more pictures, complained that they didn’t stand out in the picture, told me I was ‘honey’. These men were exactly like children, emasculated. Empty vessels, and just as at the mercy of the regime as ‘we’ the protestors are.
The police said goodbye to us by letting us out one by one, through a space roughly half a metre wide. It was a petty, pathetic and entirely unnecessary gesture, the act of a bully. It would have been annoying but bearable, if it wasn’t also dangerous. The legendary volatility of crowds is surely known to the Egyptian police, the way they can take on a life of their own suddenly and without warning. As someone who remembers Hilsborough, the danger was certainly very present in my mind. People were frightened, and angry at the humiliation and as a result pushing, and meanwhile at the exit the police were picking and choosing who could leave: ‘known’ faces were turned away, as behind them the crush worsened. Eventually it was decided that women should be allowed out first (which made me briefly feel like I was on the Titanic), and lovely Sandmonkey identified to the police which girls were in his group and held back the police as Umm Nakad and I literally fought our way through the gap. Sandmonkey came out later, followed by Sharshar.
I said salaamo 3aleikoo to the police as I tumbled out of the tunnel, out of curiosity to see if they would respond, and they did return the greeting while they watched me flying across the pavement. One officer said to Umm Nakad ‘aih ya mama, bete3mely aih hena enty, rawwa7y baytek.’ [what are you doing here, love? Go home]. I have no doubt that if given the orders to these same officers would have happily beaten us both to a pulp, but it was nonetheless a reminder that it is not these men who are issuing orders, and to direct wrath against them is to miss the point, somehow. Tonight it wasn’t just the protestors who were humiliated but also the pitiful kids in black and the police, driven by corruption and low-wages to make a mockery of themselves and their profession while doing the dirty work for a regime which has lost all credibility.
Would it be trite to say that Egypt and Egyptians deserve far, far better than this?
|
{
"pile_set_name": "Pile-CC"
}
|
McCain: Sen. Ted Stevens should quit
Pennsylvania Republican presidential candidate John McCain said Tuesday that Republican Sen. Ted Stevens of Alaska has "broken his trust with the people" and should resign now that he has been convicted in a federal corruption case.
McCain's running mate, Alaska Gov. Sarah Palin, said Stevens should "step aside" but did not call for him to drop out of Tuesday's race for re-election. Her comments to CNBC left unclear whether she thinks Stevens should remain in the Senate while he appeals the case against him.
A jury on Monday found Stevens, 84, guilty on seven counts of trying to hide more than $250,000 in free home renovations and other gifts that he received from a wealthy oil contractor. He has asked his Senate colleagues as well as Alaska's voters to stand by him as he appeals the convictions.
Palin, who had supported Stevens during his long career in Alaska politics, told CNBC that Stevens should do "the right thing."
|
{
"pile_set_name": "Pile-CC"
}
|
I just thought of one other thing we need to discuss with Credit in our
meeting. I've asked them to get back to me about this several times and
haven't heard.
In the collateral annexes, we have interest on collateral computed at 360
days. So we don't have problems with Canadian counterparties, I would like
to change that to 365/366 accross the board. I asked them if there was any
specific reason why we've got interest on collateral at 360, like maybe it's
the custom in the bank/dealer markets. Anyway, I'd like to get that
answered.
|
{
"pile_set_name": "Enron Emails"
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.