High Quality. Low Prices. Quick Turnaround. Made in the USA.
1" Round is very popular with artists and bands. The small size is fashionable for backpacks, coats, and anywhere a small accent of color would fit nicely. This size of button features a free-floating backing pin that lets you rotate the design when it is affixed.
Our 1" round custom buttons are our smallest sized button and perfect for just about any event or occasion you're looking for. Ringing in at about the size of a quarter, our 1" round custom buttons are small and economical.
1.25" Round is slightly larger and offers a sturdier backing pin which is locked in one position. 1.25" Round buttons are a favorite among artists, designers, musicians, fundraisers, and churches. This size is the perfect combination of form and function.
Our 1.25" round custom buttons are our second smallest buttons. If you're looking for something small but need that extra space to make your message or image standout better, we suggest the 1.25" round custom buttons.
1.5" Round is a nice mid-size, which offers good readability and is great for promotions on restaurant staff, fundraising, charities, churches, schools, and conferences. This size is also big enough to grab attention for political campaigns when a larger sizes seem too big.
Our 1.5" round custom buttons spread your message for you. Perfect for novelty products, logos, simple images, or whatever you had in mind. Our 1.5" round custom buttons may be one of our smaller buttons, but they never cease to be seen!
1.75" Round is a great larger shape without dominating like the largest sizes do. This size is perfect for political campaigns, charities, churches, sports teams, conferences, and tradeshows.
Include our 1.75" Round Custom Buttons with your next school function, promotional giveaway, or fun event and you're sure to catch eyes to your message. The 1.75" Round Custom Buttons is a perfect way to spread your events message!
2.25" Round is a nice large size which never feels 'too big' but still is impossible to miss. These sizes are primarily used by customers looking to promote themselves at tradeshows, political events, and in retail. This size offers enough space for highly detailed artwork, or big bold statements. This larger size is also great for keepsakes and souvenirs.
The sky is the limit when adding your message to our 2.25" round custom buttons. Perfect for political campaigns, birthday parties or however you wish to dress it up, our 2.25" round custom buttons spread your word for you.
2.5" Round Custom Buttons are a new size we offer in our quest to have something for every need! Our 2.5" Round custom buttons have quickly become a very popular size, and are perfect for promoting Events or as School Fundraiser buttons.
Our 2.5" Round size is available as custom buttons, fridge magnets, clothing magnets and bulldog clip buttons!
3" Round is the largest size we offer. This size DEMANDS ATTENTION. When you can't afford to have your message overlooked, you need to go with a 3" round size. This button is perfect for charities, fundraisers, commercial promotions, restaurant specials, event tickets, name tags and more. This massive size is perfect for keepsakes or souvenirs.
Getting your message out is made simple and effective with our 3" round custom buttons. Large enough for detailed photographs and perfect for events such as sport events, retail promotions, and business conventions, any message you want to spread, our 3" round custom buttons can help.
3.5" Round Custom Buttons are a new size that really gets noticed! Our 3.5" Round size is available as custom buttons, fridge magnets, clothing magnets, bulldog clip buttons, pocket mirrors and our new custom coasters!
4" Round is THE BIG ONE. Great for getting attention in any scenario. Our 4" Round custom button is the head of the pack with the most real estate of any of our custom buttons. Our 4" Round custom buttons are great as collectables. Print your team photo on them, use them for political campaign buttons, or any other events buttons you may need. This giant new button size is affordable and impressive!
1.75" x 2.75" Oval is a great, unique shape that is often used for retail and restaurant promotions. The oval custom button is also great as a name tag or membership card.
There's no telling what our 1.75" X 2.75" oval custom buttons can do. Oval is a great shape for name badges, conferences and restaurants alike. But don't stop there, make our 1.75" X 2.75" oval custom buttons a part of your next event or campaign.
1" Square is the little sharp edged brother of our classic 1" round button. For those looking for a tiny canvas that maximizes the available space, choose our NEW 1" Square Custom Buttons. These buttons give you the same tiny charm as our 1" Round custom buttons but offer a unique shape not seen very often. People will be drawn to your 1" Square Custom Buttons. Great for artists and bands. The small size is fashionable for bags, coats, and anywhere that could use a little flair!
1.5" Square is our most unique shape. The 1.5" Square offers more surface area than the 1.5" Round does, and it also draws more attention due to the unique shape. This size is great for promoting album covers, restaurant specials, and for any purpose where you need to draw attention with your button. Square buttons can also be designed to hang on the side with points facing up, a diamond shape. This lets you have yet another option when creating your design!
Stepping outside the box, have your message hit the town in our 1.5" square custom buttons. Found to be perfect for events like clubs, organizations and logos, when you're looking for a smaller way to say a something big, pick our 1.5" square custom buttons.
2" Square custom buttons are NEW and a very popular way to maximize your message. 2" Squares are popular for Bands, Events, Conferences and Restaurants.
The 2" Square uses the full surface area of the shape compared to similarly-sized round buttons. This shape can be an effective advertisement for album releases.
2.5" Square Custom Buttons are a new size we offer in our quest to have something for every need! Our 2.5" Square custom buttons have quickly become a very popular size, and are perfect for promoting School Fundraiser buttons or as Events.
Our 2.5" Square size is available as custom buttons, fridge magnets, clothing magnets and bulldog clip buttons!
3" Square custom buttons are the NEW, large and square way to stand out! 3" Squares are popular for Bands, Events, Conferences and Restaurants.
The 3" Square uses the full surface area of the shape compared to similarly-sized round buttons. This shape can be an effective advertisement for album releases. Get the top dog in the square button lineup! Our large 3" Square Custom Button is the perfect choice for when you want to be seen!
1.75" x 2.75" Rectangle is the baby of our rectangle buttons lineup, but it's not little! This shape is great for designs with a lot of text or a message that needs to be seen in a larger wide format. The rectangle is also a great business card replacement. This shape can also be effective at promoting movie and music releases.
The 1.75" X 2.75" rectangular custom buttons helps you switch it up! The 1.75" X 2.75" rectangular shaped buttons help you spread your message to the masses. Get your logo, advertisement, message, or event out there in an easy to see and read button size and shape.
2" x 3" Rectangle is the newest member of our rectangle buttons lineup. Filling the gap between the other two sizes. This shape is business card replacement. This shape can also be effective at promoting Movie and Video Game releases.
The 2" X 3" rectangular custom buttons helps you switch it up! The 2" X 3" rectangular shaped buttons help you spread your message to the masses. Get your logo, advertisement, message, or event out there in an easy to see and read button size and shape.
2.5" X 3.5" Rectangle is the biggest rectangle in our buttons lineup. This shape is great for designs with a lot of text or a message that needs to be seen in a larger wide format. The big rectangle is great for fridge magnets as well and is often used for large collectables in souvenir shops. This shape can also be effective at promoting Video Game, Movie and Music releases.
The 2.5" X 3.5" rectangular custom buttons are big! The 2.5" X 3.5" rectangular shaped buttons are available as custom buttons, fridge magnets, and clothing magnets. This big and diverse size is perfect for your needs when you want to be seen!
1.5" X 4.5" Rectangle is our newest rectangle button! Whether hung horizontally or vertically, this panoramic shape is perfect for photography or logos or information based designs like business cards, contact information or menus and coupons. Get noticed with this unique new shape!


Marie Josee is the perfect realtor. On top of being an amazing human being she is the best professional you can find here in South Florida. Since I have moved to South Florida back in 2001 she helped me finding my rentals (3 times), buying my first home and selling my property. She is simply the best. She is always aware of the new rules and regulations in the real estate business. I highly recommend Marie Josee to anyone that is looking for buying, selling or renting a property!
I would like to thank you for your hard work and professionalism in handling the sale of my house.
I would like to thank you for your hard work and professionalism in handling the sale of my house. I know that we had a very difficult closing which would not have happened at all if it were not for you having micromanaged every step of the process and done the work of the other real estate agent and being on the back of the mortgage broker. Your determination to do "Whatever" it takes to close made this happen for me. I know that in this market it is very optimistic to close in under six months from date of the listing, but you were somehow able to pull that off while getting me the sale price that i needed. I really appreciate your dedication on my behalf. Please stay in touch; you have my new numbers. i will call you when i am back in Miami. Thanks again for everything.
Your knowledge of the business and even more importantly of the building itself and your persistence was a great part of the success of both ventures.
Marie-Josee, thank you for being so helpful during the purchase of my condo in the Roney 3 years ago and again now for the sale of the same apartment this month . Your knowledge of the business and even more importantly of the building itself and your persistence was a great part of the success of both ventures. Please continue to look for properties for me now you know what I like.
You are so very excellent! I do not know if i would survive real estate without you.
Thank you …. you are so very excellent …I do not know if i would survive real estate without you ….. i appreciate all your hard work!
She is the best, fast, serious,professional!
Anyone who want to buy properties in South Florida has to contact Marie-Josee! She is the best, fast, serious,professional! Thanks so much Marie-Josee for the work you have done for me, I hope it is only the beginning of a long collaboration!!
I enjoyed working with you. You are the most reliable, honest, diligent hard working agent that I know of.
I enjoyed working with you. You are the most reliable, honest, diligent hard working agent that I know of. I highly recommend you to anyone.
Your motivation, professionalism and connections were just what the unit needed.
The difference in the Marie Josee experience for me was: Only a couple of potential buyers a month, to a couple of buyers in a single day! Your motivation, professionalism and connections were just what the unit needed. Without your efforts, I would have had to have taken different measures (price dropping) to sell the unit. Thank you again. I will definitely recommend you with highest regards!


Long before Christopher Columbus reached the Bahamas, Portuguese explorers were colonizing islands in the eastern Atlantic and trading in Africa for slaves and gold. Later they reached India, Brazil, China and Japan. All this adventurous traveling and trading led Europeans and their foreign cohorts to create new and hybrid forms of art. Encompassing the Globe: Portugal and the World in the 16th and 17th Centuries, a blockbuster exhibit at the Sackler Gallery that extends into the adjacent National Museum of African Art, reveals the diversity and sometime awkwardness of this cross-cultural interchange. The sprawling, dimly lit show is packed with treasures from nearly every continent, 264 objects that represent the earliest globalists and their encounters with peoples around the world. Hint: Brush up on your geography before you go.
At the Arthur M. Sackler Gallery, 1050 Independence Ave. SW. 10 a.m. to 5:30 p.m. daily through Sept. 16. Free. 202/633-1000.
The National Gallery of Art has begun its major retrospective series of the summer, Modernity and Tradition: Film in Interwar Central Europe, which continues with weekend programs through Sept. 2. Intended to supplement a photographic exhibition, "Foto: Modernity in Central Europe, 1918-1945," the film program offers an abundance of rare and legendary titles from the 1920s and '30s. Three selections are scheduled for Saturday afternoon in the auditorium of the East Building: Leni Riefenstahl's The Blue Light at 1 p.m., Paul Fejos' Spring Shower at 2:30 p.m. and Vladislav Vancura's Faithless Marijka at 4 p.m. Paul Leni's Waxworks will be revived on July 22, Michal Waszynski's The Dybbuk on July 29, Walter Ruttmann's Berlin: Symphony of a Big City on Aug. 4 and F.W. Murnau's The Last Laugh on Aug. 18. All programs are free, but an early arrival is often advisable. Fourth Street and Constitution Avenue Northwest. 202/842-6799.
The Smithsonian American Art Museum has announced a pair of free summer movie series. A revival of An American in Paris on Tuesday at 5 p.m. begins a quartet devoted to celebrated film musicals with big cities in their titles. It will be followed by West Side Story, Meet Me in St. Louis and Chicago, also shown on Tuesdays at 5 p.m. A cycle devoted to Westerns begins Aug. 7 with John Ford's The Searchers. McEvoy Auditorium, Eighth and G streets Northwest. 202/633-1000.


More Details Mazel Tov! Celebrate your daughter's Bat Mitzvah with a personalized Bat Mitzvah invitation. Just add her photos and event details.
If you're planning a special celebration, pink floral invitations from Shutterfly are a stylish way to notify friends and family. They're an excellent choice for bridal and baby showers, birthday parties and bat mitzvahs. We have an array of charming designs from which to choose, all of which can be customized with text and/or photos.
The cardstock we use is acid-free, so your guests can save their invitations as a souvenir of the occasion for years to come. Another great thing about ordering from Shutterfly is the flexible quantity. We don't require you to purchase a minimum number of invitations -- order as few or as many as you like. To make event planning hassle-free, we can even address and mail the invitations for you.
When ordering pink floral invitations for your event, consider picking up a gift to go with them. We have a vast selection of gift items that can be personalized with photos, text and monograms. One of our photo mugs makes an excellent all-purpose present for any occasion, and some of them include the option of adding Ghiradelli chocolates for a sweet finishing touch. If you're shopping for a student, check out our photo mouse pads. While you're gift shopping, pick up something for yourself -- we have customizable accent pieces for every room of your home.
Ordering custom invitations from Shutterfly is easy and takes only minutes. Simply select your preferred design, then click "Personalize" to navigate to the customization screen. From there, you can choose the color palette for your pink floral invitations and upload any photos you want to feature if your design supports them. Once your order is placed, we'll promptly print your invitations and mail them to the specified address. All of our items come with a 100% Happiness Guarantee, so there's no risk when ordering your pink floral invitations.


text:
Marché's Daisley Gordon and Cameron Williams
by Ronald Holden Oct 25, 2012, 3:00am PDT
Share All sharing options for: Marché's Daisley Gordon and Cameron Williams
Welcome back to One Year In, a feature in which Eater sits down for a chat with the chefs and owners of restaurants celebrating their one year anniversary. Cameron Williams & Daisley Gordon [Photo: S Pratt]
The origins of Marché, a lively spot in the courtyard of the Inn at the Market, go back to a 30-seat Provençal café called Campagne on Capitol Hill owned by Ted Furst and Peter Lewis. They moved Campagne into the Market in the 1980s. Furst left to became a consultant, and Lewis sold out to San Francisco real estate developer Simon Snellgrove in 2005. After a six-month remodel, the premises was renamed Marché Bistro & Wine Bar, and Snellgrove turned the keys over to longtime executive chef, Daisley Gordon and general manager Cameron Williams. Eater sat down with them in the comfortable bar.
Tell us what you were doing before Campagne became Marché.
DG: I was born in Jamaica and raised in Kentucky, then went through the program at the CIA. I started in Seattle at Etta's in March of 1995 and moved over to Campagne very soon thereafter. Tamara Murphy was in the kitchen, she'd just won the James Beard Award (for best chef, Pacific Northwest), Jim Drohman was here, too. Then Tamara opened Brasa, Jim opened Le Pichet, and I moved into the exec chef spot.
You were a contestant on Iron Chef America.
DG: Yes, in the 2009 season. The secret ingredient was berries. I let Bobby Flay win.
Everything was going along just fine, and then?
DG: Simon Snellgrove had bought the restaurant from Peter Lewis. He wanted to retire and he made it possible for me to take over with a fresh start for the restaurant. We had been very country-French; we wanted to be more market-centered, more urban-French.
By then, you'd agreed on Cameron Williams as GM?
CW I'd been at Barrio for four years and I came on board about a month before Marché opened. I'm from Tucson, originally, and I'd spent some time in Europe racing bicycles.
What are the physical changes in the space?
CW Downstairs is pretty much unchanged. (The name is sitll Cafe Campagne) Upstairs, we changed maybe 95 percent of the design and decor. The bar used to have six seats, now it has 12 at the counter, two high-tops, several comfortable wing-back chairs and these lounge-style couches.
DG: There's no wall anymore between the bar and the dining room. No more linens. You can have a drink or a full dinner anywhere in the restaurant.
CW: The bar is now an extremely hospitable place with a steady late-night clientele. It's a neighborhood hangout. Right now, I've got Françoise Hardy on the sound system. Our two bartenders, Tyler Stamon and Travis Ulrich don't have a trace of pretension.
You call your happy hour "l'heure verte"?
DG: The green hour, because of the absinthe drinkers in the Paris cafés in the 19th century. The original happy hour!
How would you compare upstairs and downstairs?
DG: Well, as you know, we used to have these Bastille Day celebrations where upstairs, the formal Campagne dining room was for the aristocracy, and the less formal Cafe Campagne down in the alley was for the people. That's not the case anymore.
CW: We think of the upstairs menu as "playful and urbane," because there's a market at the center of almost every urban space in France. Downstairs is more like a classic French brasserie.
DG: There's a steak-frites at Café Campagne, and there's a Wagyu steak at Marché, for example.
What are some other menu items?
DG: A lot of the menu at Marché comes from my trips to France, to Provence, to Bordeaux. The Bouillabaisse, for example. I was in Marseille, where bouillabaisse originated as a dish the fishermen cooked with the catch they couldn't sell. Nowadays there are restaurants up and down the Mediterranean coast that specialize in it. One place in Marseille called Chez Michel charges 50 euros (about $65) for its bouillabaisse. It's a very elegant and formal service. But ours at Marché is $28.
CW: We try to avoid the fancy and pretentious, but if you want foie gras on your Wagyu steak, or on your salad, we'll shave it onto your plate, tableside, for $10.
DG: It's up to the guest. We want everyone to have a good time.
Where do you like to go "after hours"?
CW: I like ZigZag, Le Pichet and Il Bistro on my own. Or Ten Mercer. The last full meal I had at a restaurant was at Harvest Vine. Lovely.
DG: I don't get a lot of time off, so my wife and I will often just pick up a few things at the farmers market and cook at home. But, sure, I'll drop in at Le Pichet, or have Dim Sum in the ID. I haven't been to Rione yet, but I'll get there.
What are your plans for Marché in the coming year?
CW: We just started donig weekend brunch, 11 to 3:30, with a do-it-yourself mimosa bar.
DG: We're going to stay with our seasonal promotions. So there will be mussels in spring, along with asparagus, and tomatoes in summer and so on. We're right in the Market, and that's our mission. And let's not forget the wine promotions: Beaujolais Nouveau in November and Muscadet in spring, among others.
CW: We have something really genuine here. There are no chain stores at the Pike Place Market. That's unique for a major tourist attraction.
DG: We talk a lot about "genuine." Good food, a great time. It begins and ends there.
· All Marché Coverage on Eater Seattle [-ESEA-]
· All One Year In Coverage on Eater Seattle [-ESEA-]
86 Pine Street, Seattle, WA 98101 206 728 2800 Visit Website
Marché
86 Pine Street, Seattle, WA
An Eater's Guide to Seattle Where to eat and drink right now in the Emerald City

redpajama_set_name: RedPajamaCommonCrawl


This is a quiet top floor 1 and den(could be second bedroom) home with 11 ft vaulted ceilings that has been totally renovated. The kitchen features stainless steel appliances, granite counters and modern tile backsplash. The sleekbathroom has all new white modern fixtures and is sure to please. Other features include: Laminate flooring, recessed pot lights throughout, freshly painted, frosted glass doors, APPROVED in suite laundry, 2 cats ok (sorry no dogs, no rentals) all in a sound building ,with a pro active strata, that just steps to all Granville has to offer.


Ronald Richards began his career in litigation by breaking Beverly Hills High School's record for debate wins. He then went on to UCLA to join the debate team in CIDA. At UCLA, he won the national championship two years in a row. He also won numerous individual event titles and honors. In law school he was elected to Student Faculty Representative where he was an advocate for students facing discipline. He won the American Jurisprudence Award in Bankruptcy. As a lawyer, he is the only published attorney in the country on Proposition 215, the medical marijuana statute. His article is cited by West Publishing and is found in the annotations to 11362.5 of the Health and Safety Code. He has been qualified as an expert witness on marijuana in the Los Angeles Superior Court.
U.S. District Court Judge Richard Seeborg on Tuesday (Aug. 8, 2017) stayed the prosecution of Humboldt County growers Anthony Pisarski and Sonny Moore, so the case is closed unless the Rohrabacher-Farr amendment expires and fails to be re-enacted and federal prosecutors want to resume their case. The defendants' Beverly Hills attorney, Ronald Richards, says: "This is the first time in my 23-year career I've had a case stopped because of an appropriations rider. Richards sought an evidentiary hearing based on legislation, first enacted in 2014, that prohibits the U.S. Department of Justice from cracking down on cannabis suspects who are otherwise following their state laws. The Rohrabacher-Farr amendment is a budget rider, co-authored by SoCal U.S. Rep. Dana Rohrabacher, that prevents enforcement and prosecution in medical marijuana states by stripping funding for such endeavors.
"What the court did in this case may be used as a blueprint for other cases," he says. "It opens the door for people not to get scared."


text:
Martin L. Dunn
Dean and Professor
Martin L. Dunn is a professor and dean of the College of Engineering, Design and Computing at the University of Colorado Denver. He joined CU Denver in 2018 after serving as the founding associate provost for research at the Singapore University of Technology and Design (SUTD) where he oversaw the design and operation of the research and innovation enterprise. He was also a professor at SUTD and the founding director of the National Research Foundation-supported Digital Manufacturing and Design Center. Prior to joining SUTD, he served as a program director (mechanics of materials) in the Civil, Mechanical and Manufacturing Innovation Division at the U.S. National Science Foundation (NSF), where he was also the founding program director for the Design of Engineering Materials Systems program. He served the NSF while on leave from the University of Colorado Boulder where he was the associate dean of research in the College of Engineering, Design and Computing, chair of the Department of Mechanical Engineering and a professor of mechanical engineering, holding the Victor Schelke Endowed Chair.
Dunn's research has focused on understanding the mechanics and physics of complex heterogeneous materials through a combination of theory and experiment and using this understanding to create methods and tools to design and manufacture new materials and components. This includes constitutive modeling of the nonlinear multiphysics response (thermal, optical, mechanical) of active polymers and polymer composites, computational design automation approaches based on shape and topology optimization and additive manufacturing based on SLA, DLP and FDM technologies. Most recently this has involved the development of computational design and manufacturing methodologies for multimaterial additive manufacturing, including the creation of a technology called 4D printing – an approach that integrates new computational design, manufacturing process and materials technologies to create environmentally responsive printed components.
Dunn has received international recognition and awards for his research accomplishments as well as awards for products designed with the methods and tools developed from his research. Dunn received his PhD in mechanical engineering from the University of Washington and held positions at Sandia National Laboratories and the Boeing Company before joining academia.
Wood, Kristin
Kristin Wood
Senior Associate Dean of Innovation and Engagement and Executive Director, Comcast Center
Email: kristin.wood@ucdenver.edu
Jones, Keith
Keith Jones, PhD
Associate Dean for Academic Initiatives
Email: keith.jones@ucdenver.edu
Janson, Bruce
Bruce Janson, PhD
Associate Dean of Student Affairs
Email: bruce.janson@ucdenver.edu
Morgan, Petrina
Petrina Morgan
College Administrator
Email: petrina.morgan@ucdenver.edu
Dean's office staff


text:
import static org.mockito.BDDMockito.given;
import static org.mockito.Mockito.inOrder;
import static org.mockito.Mockito.mock;
import static org.mockito.Mockito.verify;

import core.GuessGame;
import core.NumberMatcher;
import core.RandomNumberGenerator;
import org.junit.Before;
import org.junit.Test;
import org.mockito.InOrder;
import shell.CommandInvoke;
import shell.Route;

import java.io.BufferedReader;
import java.io.PrintStream;

/**
 * Created by lianghuang on 7/20/16.
 */
public class RouteTest {

    private RandomNumberGenerator randomNumberGenerator;
    private GuessGame game;
    private PrintStream out;
    private BufferedReader reader;
    private CommandInvoke commandInvoke;
    private Route route;

    @Before
    public void befor() throws Exception {
        randomNumberGenerator = mock(RandomNumberGenerator.class);
        out = mock(PrintStream.class);
        reader = mock(BufferedReader.class);
        game = new GuessGame(out, reader, new NumberMatcher(), randomNumberGenerator);
        commandInvoke = new CommandInvoke(game, out);
        route = new Route(out, game, commandInvoke);
        given(reader.readLine()).willReturn("1234");
        given(randomNumberGenerator.generateAnswer()).willReturn("4321");
    }

    @Test
    public void shoud_start_a_game() {

        route.route("1");

        InOrder inOrder = inOrder(out);
        inOrder.verify(out).printf("Please input 1 to start a new game or input 2 quit the game:");
        inOrder.verify(out).println("Welcome");
    }

    @Test
    public void shoud_exit_a_game() {

        route.route("2");

        InOrder inOrder = inOrder(out);
        inOrder.verify(out).printf("Please input 1 to start a new game or input 2 quit the game:");
        inOrder.verify(out).println("Good bye!");
    }

}

redpajama_set_name: RedPajamaGithub


The start of Day #3 sent us to our northern most dives sites on the trip. Both on Elbow Reef, Mike's Wreck and City of Washington are popular spots. Mike's Wreck is the remains of an unknown steel ship. Contrasting that is City of Washington, which in 1898 was anchored in Havana Harbor near the USS Maine when it blew up. The Washington was damaged by burning debris from the Maine. After being a troop transport during the Spanish-American war, she was converted to a coal barge. While being towed in 1917, she struck Elbow Reef and quickly sank.


text:
Paterson shooting leaves Garfield man dead, another wounded in first killing in 110 days
Jai Agnish/Northjersey.com, Joe Malinconico/Paterson Press
PATERSON — A 22-year-old Garfield man was shot and killed in an early morning shooting at a nightclub, ending a 110-day streak in the city without a killing, officials said Saturday.
The victim, Parker Sams, was found by police wounded in a parking lot outside D'Classico Restaurant and Lounge on Saturday at about 2 a.m. on Ellison Street, Passaic County Prosecutor Camelia M. Valdes and Paterson Police Chief Troy Oswald said in a joint statement.
Sams was transported to St. Joseph's Regional Medical Center in Paterson where he died from his wounds, according to Valdes.
Another person was wounded at the scene, said two senior city officials briefed on the details of the shooting, who spoke on a condition of anonymity because they were not authorized to speak publicly.
The prosecutor's office said the presence of other potential victims at the scene cannot be confirmed, and that the investigation is ongoing. Authorities haven't disclosed what prompted the shooting or identified the shooter.
The Passaic County Prosecutor's Office, which has barred municipal police departments from disclosing details of homicides, said more information will be released once it becomes available.
Later Saturday morning at 10:30 a.m., areas of the parking lot were still stained with blood and there was broken glass and spray-painted evidence markers about. A young man, 20, who claimed that the victim was his best friend, was sitting down quietly next to some blood-stained pavement.
"This is where he got hit," said the man, who asked not to be identified. "There was shooting all over the parking lot. They just hit him right here."
The man said he was in the club with the victim when a fight broke out inside and everybody left the building.
"We came outside," he said. "They started shooting."
The suspects then got into a car and left the scene, he said, pointing to an area in the parking lot where he said the car was.
Elvis Durham, an employee with the Paterson Parking Authority, who he said owns the parking lot, began his shift at 7 a.m. He said the lot closed around 9 p.m. and club patrons should not be using it.
Durham was cleaning up the shards of glass left on the asphalt as a result of the shooting. He said he was surprised to hear of a shooting in downtown Paterson.
"Music, entertainment, parties draw revenue," Durham said. "We need this in the downtown area but we don't need this type of media attention. We need good media attention in the city of Paterson."
When Paterson passed 90 days without a homicide, it was the longest lull in fatal violence in more than nine years, according to law enforcement officials.
The last homicide in the city was on Dec. 11, 2017. A 37-year-old city resident, Keyantay Deas, was shot and killed when he was confronted by two men wielding handguns on 12th Avenue.
Paterson also has seen a drop in the number of non-fatal shootings in recent months, according to statistics compiled by Paterson Press.
The Passaic County Prosecutor's Office asks anyone with additional information about this incident to contact them at 1-877-370-PCPO or tips@passaiccountynj.org, or contact the Paterson Police Detective Bureau at 973-321-1120.
Reporter Keldy Ortiz contributed.
Email: Agnish@northjersey.com
More Paterson news
SCHOOLS:16 Paterson schools taken off state's problem lists
PASSION PLAY:In Paterson, a Passion Play like the city itself
CRIME:Paterson delivery driver robbed at gunpoint, police say


text:
Trump Announces 88 Top Former Military Officials Backing Him. Romney Had 500.
A YUGE drop!
Ross D. Franklin/AP
Remember the Democratic convention, when Hillary Clinton was ringingly endorsed by a squad of top former military officials, led by retired General John Allen, who delivered one of the more rousing speeches of the week? That event and a host of subsequent endorsements from former military leaders and foreign policy experts have made it seem that Clinton has the edge over Donald Trump in drawing national security professionals to her cause. (Last month, a group of 50 GOP national security wonks signed a letter declaring that Trump "would be a dangerous President and would put at risk our country's national security and well-being.") Now Trump is fighting back. On Monday, he released a list of 88 former generals and admirals who back his presidential bid.
The New York Times notes that a handful of these Trumpers are "known for making controversial statements. The paper cites retired Lt. General William Boykin, "who was criticized by President George W. Bush for describing the battle against Islamist terrorists as a religious proxy fight between a 'Christian nation' and the 'idol' of Islam." It also points out that retired Lt. Gen. Thomas G. McInerney, a Fox News analyst who is on the list, "has previously submitted court documents challenging President Obama's eligibility to serve as president, accusing him of not having been born in the United States, an accusation Mr. Trump himself once raised." (Once raised? How about championed like a conspiracy-theory wingnut?)
It's no surprise that a Republican candidate who has bashed the Iran nuclear deal and called for spending more money on the military could round up this band of former generals and admirals. But here's the real story: Mitt Romney, during the 2012 campaign, had 500 retired generals and admirals on his side. That group took out an ad in the Washington Times to show their support for the then-Republican nominee. And the Romney crew had much more star power than Trump's posse. As the Washington Times then reported, "The [Romney] list contains a number of prominent four-star admirals and generals, including five former members of the Joint Chiefs of Staff."
So as Trump preps—or doesn't prep—for a candidates forum on national security hosted by NBC and MSNBC on Wednesday night, the news really isn't that he found four score and eight retired military officers to back him; it's that this is a significant drop from the amount of support that the last GOP nominee attracted from retired military bigwigs. In fact, it's a huge retreat.
Did Donald Trump Try to Bribe the Attorney General of Florida?
The Trump Files: "Always Be Around Unsuccessful People," Donald Recommends
The Trump Campaign Just Hired a Notorious Clinton Antagonist
A List of the Lawmakers Who Joined Pro-Trump Crowds on the Day of the Capitol Riot


Voting Period: Voting begins February 6, 2019 and closes February 27, at 5pm Eastern Time.
Winner selection and notification: The overall winner will be recognized at the Public Lands Alliance Partnership Awards Ceremony on February 27 in Denver, CO.
By voting, you agree to receive emails periodically from the Public Lands Alliance. You can opt-out of receiving this communication at any time by clicking the unsubscribe link at the bottom of the emails.


The FFA Student toolbox is your place to find links and tools for managing your FFA experience including: managing your FFA profile, links to scholarship and grant opportunities, and other opportunities to participate in FFA.
Get information on how to apply for the Give the Gift of Blue Program.
New to FFA? Request a membership. Returning member? Request to renew your membership.
A map of the four National FFA Organization regions.
Now available for free download in English and Spanish.
The most recent edition of the shop FFA Blue catalog.
Quickly create FFA branded business cards to print on an office printer using commercial card stock.


text:
Retrospection: Agassiz's Expeditions in Brazil
But for Agassiz, the trip to Brazil was about more than science. Not only was evolution—a process not immediately observable to the human eye—deeply antithetical to Agassiz's staunch empiricism, evolution was profoundly at odds with his perceived world order.
By Michelle Y. Raji
Three decades after the then-obscure scientist Charles Darwin quietly sketched his now-famous finches aboard the HMS Beagle in the Galapagos, influential Harvard professor Louis Rodolphe Agassiz set out with much greater fanfare on a lesser-known expedition. In 1865, Agassiz and his wife, accompanied by a small group of Harvard scientists and students, set sail from New York to Rio de Janeiro on The Colorado.
In a lecture en route to Brazil, Agassiz challenged Darwin's revolutionary theory of evolution on the grounds that the theory relied too much on argument and too little on fact. Agassiz posited that evolution was not plausible according to the geologic record. The trip to Brazil was an attempt to disprove Darwin once and for all. Agassiz saw in the unique biodiversity of Brazil a perfect laboratory to test his counter-theories of phylogenetic embryology and glacial catastrophe in the tropics.
But for Agassiz, the trip to Brazil was about more than science. Not only was evolution—a process not immediately observable to the human eye—deeply antithetical to Agassiz's staunch empiricism, evolution was profoundly at odds with his perceived world order. Though only moderately religious, Agassiz believed in the existence of a creator in all his work. Fortunately for Agassiz, this belief fit well with comparative zoology, which at the time focused heavily on hierarchal classification.
Agassiz applied this penchant for classification to his views on race. Part of the expedition involved sketching and describing mixed-race Brazilians. Agassiz saw the rampant miscegenation in Brazil as a "mongrelization" of pure racial types that would ultimately result in sterility. Agassiz categorized humans into different "species." In his book on the Brazil trip, Agassiz notes, "the fact that [the races] differ by constant permanent features is in itself sufficient to justify a comparison between the human races and animal species."
Director of David Rockefeller Center for Latin American Studies and Organismic and Evolutionary Biology professor Brian D. Farrell says that Agassiz's trip typified the paternalistic approach of Latin American studies at the time. In an essay appended to his wife's travelogue, "Journey in Brazil," Agassiz gives his general impressions on Brazilian society and suggestions for improvement. Though he felt a "warm sympathy, a deep-rooted belief in her future progress and prosperity," he didn't see "among them something of the stronger and more persistent qualities of the Northern races"—a distinction that fit his divided view of nature—"as ancient as the tropical and temperate zones themselves."
For Agassiz, the expedition was also profoundly personal. Agassiz's founding of the Museum of Comparative Zoology in 1859 coincided with the publishing of the momentous "On the Origin of Species."
The high point of Agassiz's professional career and physical culmination of his particular brand of empirical pedagogy in a museum also marked the beginning of a professional fall from grace. At the time of the expedition, Darwin's theory of evolution had gained significant intellectual traction at Harvard. According to Museum of Comparative Zoology director and OEB professor Jim Hanken, even the students in the unofficial Agassiz Zoological Society (a kind of Agassiz fan club) were beginning to embrace Darwin's theories.
Hanken describes Agassiz as a "sensational figure in his day" for his unique pedagogy which combined engaging lectures with specimen-based study. One of Agassiz's students, Samuel Scudder, wrote that on his first day of class Agassiz simply gave him a fish to describe and draw. After three days, Scudder turned in his assignment. A nonplussed Agassiz advised him to "look again. Look again!"
Under the patronage of Nathaniel Thayer and Emperor of Brazil Pedro II, Agassiz set out on his 16-month long expedition to Brazil with the aim of proving Darwin wrong. According to Louis Menand's "Metaphysical Club," Agassiz got a hero's welcome in Rio, even though he arrived with his entire academic career at stake.
Agassiz travelled along Amazon for over 2,000 miles. Over the course of the trip, more than 80,000 specimens were collected and shipped to the Museum of Comparative Zoology in Cambridge. In his final lecture, Agassiz claimed that the fact that fish do not migrate upstream disproved Darwin's idea of evolution by exposure to different environments. His unlikely observations drew criticism from his colleagues, and his findings were disproved shortly after publication. Agassiz's attempt to save his career became its death knell.
In Farrell's mind, Agassiz "saw what he wanted to see." The autocratic Agassiz, darling of the Boston intelligentsia and the face of American professional science, never acknowledged his mistakes.
Among the students in Agassiz's lectures was future psychologist and philosopher Henry James, who was largely disgusted by the way Agassiz's biases infused his passion and professed empiricism. In James's view, according to Menand, Agassiz should have opened possibilities for inquiry in Brazil rather than try to close them. James also believed that science was never properly independent of a society's interests and preferences—no one could ever profess pure empiricism.
On his deathbed, the man who failed to see the truth in Darwin's theory was asked to name his greatest achievement. His response? "I have taught men to observe."
Harvard in the WorldHistoryHistory of ScienceBiologyRetrospection
The magazine of The Harvard Crimson


China today executed the former leading justice official in the Chongqing municipality after he became the highest-ranking person to be caught in a huge crackdown on violent gangs and the corrupt officials who protect them.
Wen Qiang, the 55-year-old ex-director of the Chongqing Municipal Judicial Bureau, was convicted of corruption charges involving organised crime in April, according to the Chongqing court website.
Wen took bribes, shielded criminal gangs, hid his financial assets and raped a university student, China's official Xinhua news agency cited court documents as saying.
The supreme people's court, which reviews all death penalty cases, rejected Wen's appeal and upheld the sentence in May.
"The facts are quite clear, the evidence is concrete and abundant, the conviction is accurate and the punishment is proper," a court statement said.
Wen served as the deputy police chief of Chongqing from 1992-2008 and then as the director of the judicial bureau until being arrested in September 2009, Xinhua said.
He was also the brother-in-law of the so-called "godmother" of Chongqing's criminal underworld, 46-year-old Xie Caiping, who was sentenced to 18 years for running illegal casinos and bribing government officials.
The high-profile crackdown on organised crime was set in motion by the Chongqing's communist party boss, Bo Xilai, who gained a national following with the campaign.
Nearly 100 local officials and police were prosecuted, with 42 found guilty of sheltering criminal gangs, Xinhua said. Hundreds of gang members were also arrested and tried.


text:
Virtual Home Tours
Agent Profiles
Sponsored Columns
Pacific Beach Professional Services Spotlight
Copyright © 2023, PB Monthly | CA Notice of Collection
Pacific Beach Town Council expresses concerns with joining La Jolla in city's District 1
(Richelle / stock.adobe.com)
By Steven Mihailovich
Nov. 24, 2021 9:56 AM PT
The likelihood that Pacific Beach will be moved into another San Diego City Council was the dominant topic among PB Town Council members.
The redistricting scenario being proposed moves Pacific Beach from District 2 into District 1. The latter includes La Jolla.
With the adoption of a final preliminary map by the nine-member Redistricting Commission (one member from each city district), a lively discussion during the PB Town Council's Nov. 17 meeting revolved around the implications of the move and what actions the community could take before the commission's Dec. 15 deadline for submitting a definitive map demarcating the nine City Council districts.
Although the final preliminary map is the result of a campaign to unite the Clairemont neighborhood into a single district, a recent push by a La Jolla-based group named "D1 United" to split Pacific Beach into two council districts produced fervent reactions from the audience.
"I've described this process as kind of a Whack-A-Mole," said Karl Rand, PBTC vice president and chair of the PB Planning Group. "It's like something pops up and then they deal with it, but then it causes something else to pop up and da-da-da. We're very, very near the end of the process."
Pacific Beach currently sits in District 2, along with Mission Beach, Ocean Beach, Point Loma and parts of Clairemont, and is represented by City Council President Jennifer Campbell. Although the district's population increased by 3.3 percent in the 2020 census, it fell short of the target 154,000 residents per district by 4.5 percent.
Five criteria guide the redistricting process: the districts must be contiguous, geographically compact, share common interests, use physical boundaries such as canyons or interstate highways, and have equal population within a 2 percent margin.
The commission considered six previous maps before voting 7-2 to approve the final preliminary map that consolidates the approximately 80,000 residents of Clairemont into District 2, thereby sending the 45,000 Pacific Beach residents into District 1.
"The Clairemont people want to have District 2, and they kind of want to separate from Pacific Beach and then have the Peninsula and all that," Rand said. "So this is kind of their map."
The probable transfer into District 1 was not fully embraced by all. Council member Eve Anderson expressed worries that issues such as homelessness, which PB shares with the other beach communities in District 2, will get short shrift in a district dominated by the more affluent and influential La Jolla community, where such problems aren't prevalent.
"La Jolla is going to rule," Anderson said. "We're going to be the orphans. We're the people who have 'those' kinds of problems, like lots of homeless and all the other things. ... So we're going to be kind of the poor folks at the end of the line."
Plenty of debate centered on ways to remain in District 2 as well as keeping Mission Beach, which shares similar issues as well as a common beach and bay, in the same district with PB. The neighboring community was joined with PB in all the previously proposed maps except the final one that was adopted.
However, Rand noted the redistricting process was too far advanced, and the deadline fast approaching, for the commission to reconsider its final preliminary map.
"There might be prior maps or other maps that we would have preferred, but we're past that stage," Rand said. "You can't go back to a whole completely different map. ... The current map is acceptable. It's not ideal because we're split from Mission Beach. But it's acceptable because it keeps us whole."
The last concept — the cohesion of Pacific Beach — is being challenged by D1 United. In her presentation on the status of the current redistricting, PB Town Council President Marcella Bothwell read from a Nov. 16 La Jolla Light article in which the group proposed "tweaking" the adopted preliminary map by adding the territory north of Grand Avenue to District 1, thereby keeping La Jolla in tact by dividing Pacific Beach.
"These minor tweaks, they affect us a lot; completely divides our community," Bothwell said. "The whole idea was to unite Clairemont, unite Linda Vista, unite; and then to just divide us in half. I can't imagine."
Council member Jim Marshall expressed outrage, suggesting the concept was akin to turning PB into an accessory for La Jolla.
"What they're looking to do is have a Baja La Jolla included in La Jolla," he said. "It's absurd."
"I still think with La Jollans in charge, we're going to lose and I don't see a way out of that one," added Anderson. "But we'll lose big time if we're divided in half. I'm not looking forward to being part of them. That may sound awful, but I'm trying to be practical. ... Having observed La Jollans, I don't want to get stepped on."
Rand tried to tamp down the incendiary indignation by saying that he checked the Redistricting Commission website before the meeting and no map had been submitted by D1 United.
"To a certain extent, right now we have their words but we don't have their map yet," Rand said. "It does make it difficult for us to get ahead because really, what we're doing is we're opposing something that somebody hasn't fully proposed. ... At this point, there is an official tentative map. Unless somebody can convince the commissioners to change it, then that's what the map is going to be."
Before deciding a course of action in the limited time left, the group first determined its goals. Although the top priority was that Pacific Beach remain unified, other stipulations included keeping Mission Beach in the same district and ensuring that Mission Bay remain in PB's district.
"We have to include Mission Bay," said council Treasurer Denise Friedman. "We're talking about land. We're not talking about population. Mission Bay is us, not Clairemont."
The council agreed to blitz the commission with emails and phone calls in order to make the members' position clear. Most importantly, residents were encouraged to attend the remaining public meetings in droves.
"We need to speak up with lots of people doing two-minute comments, not trying to do a group presentation," Friedman said. "It's far more powerful if you have 20, 30, 40 people say you can't divide our community."
Bothwell said she would write a template letter that residents could cut and paste into their messages to the commission. The template will be available on the town council's Facebook page.
"We could all just bounce that same message off the same people over and over again and repeat it endlessly," said council member Iain Richardson. "I think that may be helpful if that's where we want to end up, which is to keep PB together, support the current tentative map and resist anyone's attempt to subdivide PB."
In other business:
• In the president's report, Bothwell announced the Parks and Recreation Department planned to place portable restrooms in certain locations across the city to help combat the shigellosis outbreak, particularly among the homeless.
In PB, the washroom will be located at the northwest corner of the library and include 24-hour security guards. Bothwell asked the audience to observe the plan's effectiveness and report to the council.
"If people over the next couple of months can send in some comments to me, that way I can take it and build a case for saying a security presence at the library may be helpful to the community," she said.
• During his report, Fire Capt. Rich Marcello was asked whether his department would suffer workforce losses if the proposed COVID-19 vaccine mandate is enacted.
"I see in the news that they talk about hundreds and hundreds," Marcello said. "I don't know that to be true at all, if any. I'm sure there are a few that are going to refuse and possibly end up leaving. ... But as far as I know, it's maybe a handful or so. There's definitely not hundreds, I can tell you that."
• With no public meeting in December, Bothwell announced the Jan. 19 meeting will be held in-person at St. Brigid Parish in addition to a Zoom streaming component. However, that ambition will depend on the continuing decline of the pandemic.
"They're saying that the COVID cases are going back up again, so I reserve the right to bring us back just to Zoom," Bothwell said. "But I would really like to see everybody in person again. So fingers crossed, we meet together Jan. 19."
Get PB Monthly in your inbox every month
News and features about Pacific Beach every month for free
You may occasionally receive promotional content from the PB Monthly.
City Councilmember Joe LaCava discusses priorities, issues in Pacific Beach
Club Spotlight: Kiwanis Club of Pacific Beach focuses on honoring, helping children
Man arrested for suspected DUI after striking pedestrian in Pacific Beach
22-year-old woman killed in suspected DUI crash in Pacific Beach
Police arrest man suspected of torching lifeguard vehicles in Pacific Beach
San Diego libraries could soon reopen on Sundays, starting with these 13
Frustrated with its ambulance service, San Diego explores adding second provider, triage changes
11 people rescued from storm-swollen waterways across San Diego County
La Jolla Light E-Edition
PB Monthly E-Edition


text:
Signorile ist der Familienname folgender Personen:

 James Signorile (* 1952), US-amerikanischer Komponist
 Michelangelo Signorile (* 1960), US-amerikanischer Schriftsteller und Rundfunksprecher

redpajama_set_name: RedPajamaWikipedia


Egyptian officials on Saturday disclosed that the word "fire" is clearly audible on the cockpit voice recording from EgyptAir Flight 804, but safety experts and a person involved in the investigation said there are no clear-cut answers so far about the sequence of events that brought down the jetliner almost two months ago.
Data downloaded from the Airbus A320's black boxes, these people said, at this juncture haven't provided conclusive information about where the fire started or why it apparently spread so quickly that it may have overwhelmed the crew and knocked out key electronic circuits, possibly affecting the black box recording devices themselves.
As a result, they said, barring some sudden breakthrough, investigators are preparing for a long slog to determine why the plane, cruising in the early morning hours over the Mediterranean Sea, crashed without a distress call from the cockpit, killing all 66 people on board.
According to these people, the probe is further complicated by tensions among the international team of investigators, which includes experts from Egypt, plane maker Airbus Group SE and France's air-accident agency.
The Egyptian investigators leading the effort, they said, often appear reluctant to share details with Airbus and French crash experts partly due to fears that details prematurely may be disclosed or leak out to the media.
The upshot, according to these people, is that Airbus hasn't had a central role in analyzing the cockpit-voice recording, and the company has relied largely on Egyptian authorities to alert it if some finding warrants sending emergency safety messages to other A320 operators.
No such messages have been issued. But by the same token, according to one person involved in the investigation, Airbus officials remain uncertain about where Egyptian investigators are focusing efforts to pin down the source of the fire.
Despite weeks of extensive analysis of data downloaded from the black boxes, supplemented by forensic examination of pieces of wreckage, some safety experts and investigators increasingly worry the recorders may have stopped working too soon to yield definitive answers.


A stainless steel water pump outlet designed as a direct replacement for the original unit and modeled on a rusty Lancia pattern unit. Nearly all the original ones are now too far gone so this is a sensible modification. Check yours now! This is made with the correct shape swaging to ensure a good pipe seal. If you no longer have a 4 outlet thermostat a simple modification to the pipework will allow you to continue using this design. I have this on my own car and it is 100% reliable.


This morning's Oscar nominations announcement recycled many of the season's usual suspects, while it also provided us with quite a few surprising snubs.
First of all, let's stop pretending Moneyball is a good movie. No matter how many awards it gets nominated for, or performances that are oddly complimented, this is a poor movie that offers no compelling story and two of the biggest phoned-in performances from last year from Brad Pitt and Jonah Hill. What version of this movie did Oscar see? I need that dvd.
Speaking of lost in translation, it seems like the handwriting is on the wall for The Help. Clearly this award season is all about throwing the maids some love, even though we all know both Viola Davis and Octavia Spencer are better than their okay performances in a lackluster movie. I blame the source material.
But since we're talking about it, if we're going to surprise nominate anyone from The Help, it would have been more settling to see Allison Janey on the nominations ballot and not Jessica Chastain's underwhelming performance of a caricature in the movie. It's also worth noting that at today's announcement ceremony, a picture of Chastain in The Tree of Life flashed on the screen, in lieu of a picture of her in The Help. Coincidence? She was indeed better in The Tree of Life, even though the movie itself is downright frustrating to watch.
Notable surprises include Rooney Mara's nod in the best actress category for her performance in The Girl with the Dragon Tattoo and Demián Bichir for best actor in the very quiet but solid movie A Better Life. While both were impressive, I can't help but to think Adepero Oduye's touching performance in Pariah could have aced this category in lieu of Mara's solid performance of character to whom she brought nothing. By the way, Pariah received NO nominations, in any category. Zilch. Nada. Who can I write to about this tragedy?
Let's talk about some of the other snubs. Albert Brooks for Drive and and the entire institutes of Young Adult and Shame were robbed! There is NO reason for them not to be here. Michael Fassbender? Diablo Cody for the wonderfully daring Young Adult? But Jonah Hill and Brad Pitt are here? Stop the madness. And nothing for Carey Mulligan. These are all crimes against humanity.
In other news, thankfully Midnight in Paris, Nick Nolte (the best part about Warrior) and Christopher Plummer (for his touching portrayal in Beginners) all received well-deserved nods. We can take comfort in at least that.
Demián Bichir, "A Better Life"
Max von Sydow "Extremely Loud & Incredibly Close"
Young Adult should have AT LEAST received a nod for Best Orig. Screenplay. Also, I think Patton Oswalt should've received the nod instead of Jonah Hill. Oswalt was WAY better than Hill.
And I'm wearing black in mourning for the Shame snub.
This year I have only seen The Tree of Life out of all the best picture nominees, so I can't really comment on the quality of the films yet, but surely it can't be as awful as the overrated bunch of films nominated last year?


text:
Q: Testing an app by faking NFC tag scan I am new to Android, working on Near Field Communication for reading data from NFC tags. Neither I have NFC supported Android mobile nor NFC tags to test the application I created.
I found the below two posts which says about faking NFC tag scans by triggering an Intent.

*

*Possibility for Fake NFC(Near Field Communication) Launch

*Need To Fake an NFC Tag Being Scanned In Android
I changed my code according to the first post, where on click of a button I am triggering the required Intent in the 1st activity. Whereas I have created one more activity capable of handling that same intent. The reading of NFC tag and handling data is based on a button click on the 2nd activity.
The problem is: Whenever I am triggering the fake NFC tag scan intent from the 1st activity, it is throwing an error "No Activity found to handle Intent { act=android.nfc.action.NDEF_DISCOVERED (has extras) }".
The Manifest file goes like this:
<?xml version="1.0" encoding="utf-8"?>
<manifest xmlns:android="http://schemas.android.com/apk/res/android"
package="com.expensemanager.saubhattacharya">

<uses-permission android:name="android.permission.WRITE_EXTERNAL_STORAGE"/>
<uses-permission android:name="android.permission.READ_EXTERNAL_STORAGE"/>
<uses-permission android:name="android.permission.NFC"/>

<uses-feature android:name="android.hardware.nfc" android:required="false" />

<application
    android:allowBackup="true"
    android:icon="@mipmap/icon1"
    android:label="@string/app_name"
    android:supportsRtl="true"
    android:theme="@style/AppTheme">
    <activity
        android:name=".MainActivity"
        android:label="@string/app_name"
        android:theme="@style/AppTheme.NoActionBar">
        <intent-filter>
            <action android:name="android.intent.action.MAIN" />

            <category android:name="android.intent.category.LAUNCHER" />
        </intent-filter>
    </activity>
    <activity
        android:name=".Set_Monthly_Target"
        android:label="@string/title_activity_set__monthly__target"
        android:parentActivityName=".MainActivity">
        <meta-data
            android:name="android.support.PARENT_ACTIVITY"
            android:value="com.expensemanager.saubhattacharya.MainActivity" />
        <intent-filter>
            <action android:name="android.nfc.action.NDEF_DISCOVERED" />
            <category android:name="android.intent.category.DEFAULT" />
            <data android:mimeType="text/plain"/>
            <data android:mimeType="image/*" />
        </intent-filter>
    </activity>
    <activity
        android:name=".Add_Daily_Expense"
        android:label="@string/add_daily_expense_activity"
        android:parentActivityName=".MainActivity">
        <meta-data
            android:name="android.support.PARENT_ACTIVITY"
            android:value="com.expensemanager.saubhattacharya.MainActivity" />
        <intent-filter>
            <action android:name="android.nfc.action.NDEF_DISCOVERED" />
            <category android:name="android.intent.category.DEFAULT" />
            <data android:mimeType="text/plain"/>
            <data android:mimeType="image/*" />
        </intent-filter>
    </activity>
</application>

</manifest>

The intent trigger code snippet from the 1st activity is below:
public void scan_tag (View view)
{
    final Intent intent = new Intent(NfcAdapter.ACTION_NDEF_DISCOVERED);
    intent.putExtra(NfcAdapter.EXTRA_NDEF_MESSAGES, "Custom Messages");
    startActivity(intent);
}

The code snippet from the 2nd activity, which handles the above trigger is below:
public class Add_Daily_Expense extends AppCompatActivity {

Button read_data;
TextView show_data;
Tag detected_tag;
NfcAdapter nfcAdapter;
IntentFilter[] intentFilters;
public static final String MIME_TEXT_PLAIN = "text/plain";
public static final String MIME_IMAGE_ALL = "image/*";

@Override
protected void onCreate(Bundle savedInstanceState) {
    super.onCreate(savedInstanceState);
    setContentView(R.layout.activity_add__daily__expense);
    final PackageManager pm = this.getPackageManager();
    show_data = (TextView) findViewById(R.id.show_data);
    nfcAdapter = NfcAdapter.getDefaultAdapter(getApplicationContext());
    read_data = (Button) findViewById(R.id.read_nfc);
    read_data.setOnClickListener(new View.OnClickListener() {
        @Override
        public void onClick(View v) {
            if (!pm.hasSystemFeature(PackageManager.FEATURE_NFC)) {
                try {
                    AlertDialog.Builder builder = new AlertDialog.Builder(Add_Daily_Expense.this);
                    builder.setMessage("NFC feature is not available on this device!")
                            .setCancelable(false)
                            .setPositiveButton("OK", new DialogInterface.OnClickListener() {
                                public void onClick(DialogInterface dialog, int id) {
                                    dialog.cancel();
                                }
                            });
                    AlertDialog alert = builder.create();
                    alert.show();
                } catch (Exception e) {
                    e.printStackTrace();
                }
            } else {
                Toast.makeText(getApplicationContext(), "NFC feature is available on this device!", Toast.LENGTH_SHORT).show();
                HandleIntent(getIntent());
            }
        }
    });
}

public void HandleIntent(Intent intent)
{
    String action = intent.getAction();
    if(NfcAdapter.ACTION_NDEF_DISCOVERED.equals(action))
    {
        detected_tag = getIntent().getParcelableExtra(nfcAdapter.EXTRA_TAG);
        NDefReaderTask NDefReader = new NDefReaderTask();
        NDefReader.execute();
    }
}

public void onResume()
{
    super.onResume();
    if(nfcAdapter != null)
    setupForeGroundDispatch(this, nfcAdapter);
}

public void onPause()
{
    super.onPause();
    if(nfcAdapter != null)
    stopForeGroundDispatch(this, nfcAdapter);
}

public void onNewIntent(Intent intent)
{
    HandleIntent(intent);
}

public void setupForeGroundDispatch (final Activity activity, NfcAdapter nfcAdapter)
{
    Intent new_intent = new Intent(getApplicationContext(),Add_Daily_Expense.class);
    new_intent.setFlags(Intent.FLAG_ACTIVITY_SINGLE_TOP);

    PendingIntent pendingIntent = PendingIntent.getActivity(getApplicationContext(),0,new_intent,0);
    intentFilters = new IntentFilter[1];
    String[][] techList = new String[][]{};

    intentFilters[0] = new IntentFilter();
    intentFilters[0].addAction(NfcAdapter.ACTION_NDEF_DISCOVERED);
    intentFilters[0].addCategory(Intent.CATEGORY_DEFAULT);
    try {
        intentFilters[0].addDataType(MIME_TEXT_PLAIN);
        intentFilters[0].addDataType(MIME_IMAGE_ALL);
    }
    catch(IntentFilter.MalformedMimeTypeException me)
    {
        me.printStackTrace();
    }

    nfcAdapter.enableForegroundDispatch(activity, pendingIntent, intentFilters, techList);
}

public void stopForeGroundDispatch (final Activity activity, NfcAdapter nfcAdapter)
{
    nfcAdapter.disableForegroundDispatch(activity);
}

public class NDefReaderTask extends AsyncTask <Tag, Void, String>
{
    @Override
    protected String doInBackground(Tag... params)
    {
        try
        {
            detected_tag = params[0];
            Ndef ndef = Ndef.get(detected_tag);
            ndef.connect();
            if(ndef != null)
            {
                NdefMessage ndefMessage = ndef.getCachedNdefMessage();
                NdefRecord[] records = ndefMessage.getRecords();
                for(NdefRecord ndefRecord : records)
                {
                    if((ndefRecord.getTnf() == NdefRecord.TNF_ABSOLUTE_URI) || (ndefRecord.getTnf() == NdefRecord.TNF_WELL_KNOWN))
                    {
                        byte[] payload = ndefRecord.getPayload();
                        String encoding1 = "UTF-8";
                        String encoding2 = "UTF-16";
                        String textEncoding = ((payload[0] & 128) == 0) ? encoding1 : encoding2;
                        int languageCodeLength = payload[0] & 0063;
                        return new String(payload, languageCodeLength + 1, payload.length - languageCodeLength - 1, textEncoding);
                    }
                }
            }
            ndef.close();
        }
        catch (UnsupportedEncodingException UE)
        {
            UE.printStackTrace();
        }
        catch (IOException IE)
        {
            IE.printStackTrace();
        }
        return null;
    }

    @Override
    protected void onPreExecute()
    {

    }

    protected void onPostExecute(String result)
    {
        if(result != null)
        {
            show_data.setText(result);
        }
    }
}
}

My question is: What is wrong I am doing here? Is there any other way to test my app by faking the NFC tag scan?

A: You specify a MIME type filter for the NDEF_DISCOVERED intent filter:
<data android:mimeType="text/plain"/>
<data android:mimeType="image/*" />

Consequently, the fake NFC intent needs to contain one of these MIME types to match the intent filter. You can add the type information to the intent using the setType() method:
public void scan_tag (View view) {
    final Intent intent = new Intent(NfcAdapter.ACTION_NDEF_DISCOVERED);
    intent.setType("text/plain");
    intent.putExtra(NfcAdapter.EXTRA_NDEF_MESSAGES, ...);
    startActivity(intent);
}

Also note that the above code won't add a tag handle to the NFC intent. Hence, you can't obtain a Tag object with
detected_tag = getIntent().getParcelableExtra(nfcAdapter.EXTRA_TAG);

Consequently, you also can't obtain an instance of the Ndef connection class using
Ndef ndef = Ndef.get(detected_tag);

You might want to look into the following questions/answers regarding mock tag objects:

*

*How to mock a Android NFC Tag object for unit testing

*Is there a way to create an ACTION_NDEF_DISCOVERED intent from code

*How to simulate the tag touch from other application
Finally, be aware that there are several other issues in your code.

redpajama_set_name: RedPajamaStackExchange


text:
Le vignoble de Virginie produit des vins élaborés principalement à partir de raisins cultivés dans le Commonwealth, en Virginie. Le vin est produit dans la région depuis les débuts de la colonisation européenne au . La Virginie a des étés chauds et humides qui peuvent représenter un défi pour la viticulture, et ce n'est que depuis vingt ans que l'industrie a développé son statut de nouveauté.

En tonnage, les variétés de Vitis vinifera représentent 75 % de la production totale. Les variétés hybrides françaises représentent près de 20 % de la production totale de raisin de cuve dans le Commonwealth, tandis que les variétés américaines ne représentent qu'environ 5 % de la production totale. À partir de 2012, les 5 principaux cépages produits sont le chardonnay, le cabernet franc, le merlot, le vidal blanc et le viognier.

En 2016, le Commonwealth compte environ 1 100 hectares de vignes plantées, avec une récolte totale de plus de 6 500 tonnes. Le Commonwealth se classe au cinquième rang des nations au regard de la superficie de production et de la production de raisin. Les comtés du centre et du nord de la Virginie, en particulier ceux situés juste à l'est des Blue Ridge Mountains, représentent la grande majorité de la production du Commonwealth.

Histoire
La Virginie a une histoire viticole qui remonte à l'ère coloniale. En 1619, lors de la réunion de la première assemblée représentative de l'Amérique anglaise, les bourgeois se trouvant dans l'église de Jamestown votent l'« Acte 12 », qui oblige les colons de Virginie à planter des vignes.

Vers 1807, Thomas Jefferson, considéré comme l'un des plus grands mécènes du vin aux États-Unis, établi deux vignobles dans sa propriété du sud. Son objectif de faire du vin dans son domaine de Virginia Monticello est contrecarré par la culture infructueuse des cépages européens classiques, en raison de son incapacité à lutter contre la pourriture noire et par le phylloxéra, un puceron racinaire vecteur de maladie.

Au début des années 1900, la Monticello Wine Company de Charlottesville et son vin Virginia Claret est si bien considérée que la ville se déclare être la « capitale de la ceinture viticole en Virginie ».

La renaissance est due en partie à l'investissement de la famille italienne Zonin, dans un nouveau vignoble à Barboursville en 1976. Les vignobles de Barboursville ont servi de catalyseur dans les années 1970, aux côtés des vignobles désormais disparus d'Oakencroft. Au cours des années 1980 et 1990, de nombreux autres vignobles et établissements vinicoles ont rejoint le groupe. En 2009, plus de 163 établissements vinicoles étaient en activité en Virginie. En 2012, il y avait plus de 230 établissements vinicoles en activité en Virginie. La quasi-totalité d'entre eux sont de petits vignobles et établissements vinicoles, appartenant à une famille, et seuls les plus grands ont développé des réseaux de distribution. En conséquence, les établissements vinicoles dépendent de l'œnotourisme et de la vente directe pour la majeure partie de leurs recettes. Pour se faire connaitre auprès des visiteurs, ils organisent souvent des événements spéciaux avec de la musique, de la restauration et d'autres activités. Un vignoble du comté de Floyd a étendu ses activités en cinq ans, grâce à un contrat d'exportation de ses vins vers la Chine. Le Château Morrisette, avec l'aide du bureau du gouverneur Bob McDonnell, exporte son merlot en Chine et prévoit d'y vendre d'autres vins ultérieurement.

Industrie du vin
Un nombre croissant d'organisations à but non lucratif et à but lucratif sont créées depuis les années 1980, pour promouvoir le vin de Virginie. Les associations les plus connues sont la Virginia Vineyards Association (VVA) et la Virginia Wineries Association (VWA). L'État de Virginie joue un rôle actif dans la promotion de l'industrie viti-vinicole, allant même jusqu'à gérer une société de distribution à l'échelle de l'état pour les établissements vinicoles de la Virginie, appelée Virginia Winery Distribution Company (VWDC), créée par le département de l'agriculture de la Virginie et du service aux consommateurs. La VWDC a pour objectif de fournir des services de distribution de vin en vrac pour les établissements vinicoles de Virginie, dont beaucoup sont trop petits pour le gérer eux-mêmes.

Le nombre de vignobles et d'établissements vinicoles en Virginie augmente chaque année. En 2019, il y avait plus de 250 vignobles et établissements vinicoles enregistrés dans l'État.

Voir aussi

Articles connexes
 Région viticole américaine
 Viticulture aux États-Unis
 Virginia's Eastern Shore (AVA)

Notes et références

Région viticole aux États-Unis (AVA)
Virginie


Mr. P – Wokie Wokie Ft. Nyanda MP3.
Mr. P Wokie Wokie Ft. Nyanda, Mr. P discharge a fresh music which was titled Wokie Wokie and makes a collaboration of the song with Nyanda.
Wokie Wokie by Mr. P is completely afrobeat and dancehall song get it below.
The full mp3 of Wokie Wokie by Mr. P ft Nyanda is available to stream or download below. Don't forget to share on facebook or twitter by using the sharer above or below.


text:
Moeen Ali appointed Birmingham Phoenix leader for The Hundred
Moeen Ali is due to begin a spell with Multan Sultans in the Pakistan Super League this week, having turned down a spot on England's upcoming tour of Sri Lanka.
London Published on: February 18, 2020 15:09 IST
Image Source : GETTY IMAGES
England all-rounder Moeen Ali has been named captain of the Birmingham Phoenix men's team for the inaugural season of The Hundred.
Moeen, who captained Worcestershire to the T20 Blast title in 2018 and last year's runners-up position, said: "Every time that I come to Edgbaston it takes me back to some great first memories of coming here at a very young age."
"I grew up in this area and to be the first men's captain of Birmingham Phoenix in a new and inclusive competition that will reach out to communities and welcome them in is very special for me," he was quoted as saying by the Guardian.
"We're a tight-knit city in Birmingham. We have so much around us that brings the people together, no matter who you are or your background. I know how much of a uniting game cricket is and as a leader of the Birmingham Phoenix that is something I definitely want to promote," he added.
Moeen is due to begin a spell with Multan Sultans in the Pakistan Super League this week, having turned down a spot on England's upcoming tour of Sri Lanka, and will then spend the early part of the home summer playing in the Indian Premier League.


text:
\section{Introduction}

In this paper, we consider finite simple undirected graphs.
An edge-coloring of a graph $G$ is a mapping $c: E(G)\rightarrow \mathbb{N}$,
where $\mathbb{N}$ denotes the set of natural numbers.
A graph $G$ is called an \emph{edge-colored graph}
if $G$ is assigned an edge-coloring.
The color of an edge $e$ of $G$ and the set of colors assigned to $E(G)$
are denoted by $c(e)$ and $C(G)$, respectively. For subset $X$
of vertices of $G$, we use $G[X]$ to denote the subgraph of $G$ induced by
$X$. For $V_1,V_2\subset V(G)$ and $V_1\cap V_2=\emptyset$,
we set $E(V_1,V_2)=\{xy\in E(G),x\in V_1,y\in V_2\}$,
and when $V_1=\{v\}$, we write $E(u,V_2)$ for $E(\{u\},V_2)$.
The set of colors appearing on the edges between $V_1$ and $V_2$ in $G$
is denoted by $C(V_1,V_2)$.
When $V_1=\{v\}$, use $C(v,V_2)$ instead of $C(\{v\},V_2)$.
The set of colors appearing on the edges of a subgraph $H$ of $G$,
is denoted by $C(H)$; moreover if $H=G[V_1]$,
we write $C(V_1)$ for $C(G[V_1])$.
A subset $F$ of edges of $G$ is called \emph{rainbow}
if no pair of edges in $F$ receive the same color,
and a graph is called \emph{rainbow} if its edge-set is rainbow.
In this paper, we only consider rainbow triangles in an edge-colored complete graph.

For a vertex $v\in V(G)$, the \emph{color-degree}
of $v$ in $G$ is the number of distinct colors assigned to the edges incident to $v$,
denoted by $d^c_G(v)$.
We use $\delta^c(G)=\mbox{min}\{d^c_G(v):v\in V(G)\}$
to denote the \emph{minimum color-degree} of $G$.
The set of neighbors of a vertex $v$
in a graph $G$ is denoted by $N_G(v)$.
Let $N_i(v)$ denote the set of vertices with edges of
color $i$ adjacent to $v$ for $1\leq i\leq d^c(v)$,
that is $N_i(v)=\{u\in N_G(v),c(uv)=i\}$.
Let $\Delta^{mon}(v)$ be the maximum number of incident edges of $v$
with the same color,
that is $\Delta^{mon}(v)=\mbox{max}\{|N_i(v)|,1\leq i\leq d^c(v)\}$.
Then the \emph{monochromatic-degree} of $G$ is the maximum
$\Delta^{mon}(v)$ over all vertices $v$ in $G$, denoted by $\Delta^{mon}(G)$.
Let $\psi$ be the incidence function
that associates with each edge of $G$ an unordered pair of (not necessarily
distinct) vertices of $G$.
If $e$ is an edge and $u$ and $v$ are vertices such that $\psi (e) =
\{u,v\}$, then $e$ is said to join $u$ and $v$, and the vertices $u$ and $v$ are called the ends
of $e$. Let $R$ be a subset of $E(G)$.
Then $\psi(R)$ denotes the set of all vertices incident with the edges in $R$,
that is $\psi(R)=\cup _{e\in R}\psi(e)$.
For other notation and terminology not defined here, we refer to \cite{B}.

There have been many results on rainbow triangles in the existing literature.
These results can be divided into two parts:
local property and global property on rainbow triangles.
As for local property, Fujita and Magnant showed the following result.

\begin{theorem}[\cite{FM}]\label{1}
Let $G$ be an edge-colored complete graph of order $n$.
If $\delta^c(G)\geq \frac{n+1}{2}$,
then every vertex of $G$ is contained in a rainbow triangle.
\end{theorem}

The lower bound on $\delta^c(G)$ in Theorem \ref{1} is sharp.
To see this, we obtain the following construction.
It will show that $v$ is not contained in any rainbow triangle.

\begin{cons}\label{2}
Consider a complete graph $G=K_{2n}$.
Let $v$ be a vertex of $G$ such that $d^c(v)=n$.
Set $|N_1(v)|=1$ and $|N_i(v)|=2$ for $2\leq i\leq n$.
Color the edges between $N_1(v)$ and $N_i(v)$
by $i$ for $2\leq i\leq n$.
For any vertex $u\in N_i(v)$,
color two edges between $u$ and $N_j(v)$ by $i$ and $j$, respectively,
for $2\leq i\neq j\leq n$.
Color the edge in $G[N_i(v)]$ by a new color different from the colors of edges incident with $v$.
Then we get an edge-colored complete graph with
$\delta^c(G)=n$; see Figure \ref{fig1}.
\end{cons}

\begin{figure}[htbp]
  \centering

 \scalebox{1}{\includegraphics[width=2.4in,height=1.5in]{2.eps}}\\
 \captionsetup{font={scriptsize}}
  \caption{The structure of $G$ in Construction \ref{2}}\label{fig1}
\end{figure}

Using Theorem \ref{1}, and repeatedly deleting the vertices
of rainbow triangles at $v$,
it is easy to obtain the following sufficient condition for the
existence of $k$ edge-disjoint rainbow triangles at $v$
and the lower bound is sharp.

\begin{fact}\label{4}
Let $G$ be an edge-colored complete graph of order $n$.
If $\delta^c(G)\geq \frac{n-1}{2}+k$,
then every vertex of $G$ is contained in at least $k$ edge-disjoint rainbow triangles.
\end{fact}

In this paper, we will show the following result,
which can be seen as a generalization of Theorem \ref{1}.

\begin{theorem}\label{3}
Let $G$ be an edge-colored complete graph of order $n$.
If $\delta^c(G)\geq \frac{n+k}{2}$,
then every vertex of $G$ is contained in at least $k$ rainbow triangles.
\end{theorem}

As for global property on rainbow triangle,
there are some results in an edge-colored general graph.

\begin{theorem}[\cite{L}] \label{15}
Let $G$ be an edge-colored graph of order $n$.
If $\delta^c(G)\geq \frac{n+1}{2}$,
then $G$ contains a rainbow triangle.
\end{theorem}

\begin{theorem}[\cite{LNXZ}]\label{16}
Let $G$ be an edge-colored graph of order $n$.
If $\delta^c(G)\geq \frac{n}{2}$ and $G$ contains no rainbow triangles,
then $n$ is even and $G$ is the complete bipartite graph $K_{\frac{n}{2},\frac{n}{2}}$, unless $G=K_4-e$ or $K_4$  when $n=4$.
\end{theorem}

Recently, Hu et al. proved the following result in an edge-colored general graph.

\begin{theorem}[\cite{HLY}]\label{12}
Let $G$ be an edge-colored graph of order $n\geq 20$.
If $\delta^c(G)\geq \frac{n+2}{2}$,
then $G$ contains two vertex-disjoint rainbow triangles.
\end{theorem}

In this paper, we are seeking for sufficient condition
for the existence of rainbow triangles in an edge-colored complete graph.

\begin{theorem}\label{8}
Let $G$ be an edge-colored complete graph of order $n$.
If $\delta^c(G)\geq \frac{n}{2}$,
then $G$ contains a rainbow triangle.
\end{theorem}

With more effort, we can obtain the following stronger theorem.

\begin{theorem}\label{10}
Let $G$ be an edge-colored complete graph of order $n$.
If $\delta^c(G)\geq \frac{n-1}{2}$ and $G$ contains no rainbow triangle,
then $V(G)$ can be partitioned into $\frac{n+1}{2}$ parts $\{A_0,A_1,\cdots, A_{\frac{n-1}{2}}\}$ (see Figure \ref{fig2}),
such that the following properties hold:

(1) $n$ is odd and $d^c(v)=\frac{n-1}{2}$ for all $v\in V(G)$;

(2) $|A_0|=1$ and $|A_i|=2$ for $1\leq i\leq \frac{n-1}{2}$;

(3) for any vertex $u\in A_i$, $C(u,A_i)= \{i,j\}$ for $1\leq i\neq j\leq \frac{n-1}{2}$;

(4) if $\frac{n-1}{2}\leq 2$, then $C(A_i)\in \{1,2\}$, $i=1,2$;
if $\frac{n-1}{2}\geq 3$, then $C(A_i)=\{i\}$, $1\leq i\leq \frac{n-1}{2}$.
\end{theorem}

\begin{figure}[htbp]
  \centering

 \scalebox{1}{\includegraphics[width=2.2in,height=1.8in]{3.eps}}\\
 \captionsetup{font={scriptsize}}
  \caption{The structure of $G$ in Theorem \ref{10}}\label{fig2}
\end{figure}

Theorem \ref{10} shows that the lower bound on $\delta^c(G)$ in Theorem \ref{8}
is tight.
Using Theorem \ref{8}, and repeatedly deleting the vertices
of rainbow triangles
it is easy to obtain the following sufficient condition for
the existence of $k$ vertex-disjoint rainbow triangles.

\begin{fact}\label{13}
Let $G$ be an edge-colored complete graph of order $n$.
If $\delta^c(G)\geq \frac{n-3+3k}{2}$,
then $G$ has at least $k$ vertex-disjoint rainbow triangles.
\end{fact}

The lower bound on $\delta^c(G)$ is far from tight.
We will investigate the minimum color-degree condition that
guarantees the existence of two vertex-disjoint rainbow triangles in an edge-colored complete graph.

\begin{theorem}\label{11}
Let $G$ be an edge-colored complete graph of order $n$.
If $n\geq 8$ and $\delta^c(G)\geq \frac{n+1}{2}$,
then $G$ contains two vertex-disjoint rainbow triangles,
and the bound $n\geq 8$ cannot be improved (see Figure \ref{fig3}).
\end{theorem}

\begin{figure}[htbp]
  \centering

 \scalebox{1}{\includegraphics[width=1.5in,height=1.3in]{1.eps}}\\
 \captionsetup{font={scriptsize}}
  \caption{A counterexample for $n=7$ in Theorem \ref{11}}\label{fig3}
\end{figure}

We will also improve the result of Theorem \ref{12} as follows.

\begin{theorem}\label{14}
Let $G$ be an edge-colored graph of order $n$.
If $n\geq 7$ and $\delta^c(G)\geq \frac{n+2}{2}$,
then $G$ contains two vertex-disjoint rainbow triangles, and
the bound $n\geq 7$ cannot be improved (see Figure \ref{fig4}).
\end{theorem}

\begin{figure}[htbp]
  \centering

 \scalebox{1}{\includegraphics[width=1.2in,height=1.2in]{4.eps}}\\
 \captionsetup{font={scriptsize}}
  \caption{A counterexample for $n=6$ in Theorem \ref{14}}\label{fig4}
\end{figure}

As far as short cycles are concerned in an edge-colored complete graph,
Li et al. showed the following results.

\begin{theorem}[\cite{LBZ}]\label{5}
Let $G$ be an edge-colored complete graph of order $n$.
If $\Delta^{mon}(G)\leq n-2$,
then $G$ contains a properly colored cycle of length at most $4$.
\end{theorem}

\begin{theorem}[\cite{LBZ}]\label{6}
Let $G$ be an edge-colored complete graph of order $n$.
If $\Delta^{mon}(G)\leq n-5$,
then $G$ contains two disjoint properly colored cycle of length at most $4$.
\end{theorem}

In the following sections, we will give the proofs of our Theorems \ref{3}, \ref{8},
\ref{10}, \ref{11} and \ref{14}, separately.

\section{Proof of Theorem \ref{3}}

\textbf{{Proof of Theorem \ref{3}}:}
Let $G$ be a graph satisfying the assumptions of Theorem \ref{3}
and $v$ be a vertex of $G$, and let $t=d^c(v)$.
Suppose $|N_1(v)|=\cdots =|N_s(v)|=1$
and $2\leq |N_{s+1}(v)|\leq \cdots \leq |N_t(v)|$.
Clearly $t-s\leq \frac{n-1-s}{2}$.
Let $N_1=\cup _{1\leq i\leq s}N_i(v)$ and
$N_2=\cup_{s+1\leq i\leq t}N_i(v)$.
Let $R(v)$ be a maximum subset of $E(G)$ such
that for any edge $xy\in R(v)$, $vxyv$ is rainbow.
Then the number of rainbow triangles containing $v$
is equal to $|R(v)|$.
Now we give an orientation to $G[N_1]$ in such a way:
for an edge $xy$, if $c(xy)=c(vx)$,
then the orientation of the edge is from $y$ to $x$,
(if $c(xy)=c(vx)=c(vy)$, then we give the orientation arbitrarily);
if $xy\in R(v)$, then we give the orientation arbitrarily.
The oriented graph is denoted by $D$.
Now we proceed by proving the following claims.

Apparently, all out-arcs from a vertex $u\in N_1$ are assigned colors different from $c(uv)$.
Then we can get the following claim.

\begin{claim}\label{c1}
For all $u\in N_1$, $d^c_{N_1\cup \{v\}}(u)\leq d^+_D(u)+1$.
\end{claim}

\begin{claim}\label{c2}
$C(N_i(v),N_j(v))\setminus R(v)\subseteq \{i,j\}$ for $1\leq i\neq j\leq t$.
\end{claim}

\begin{claim}\label{c3}
$\psi (R(v))\cap N_1\neq \emptyset$.
\end{claim}

\begin{proof}
Suppose not, then all in-arcs to $u\in N_1$ are assigned color $c(uv)$ in $D$.
Then from Claim \ref{c1}, there is a vertex $w$ in $N_1$,
such that $d^c_{N_1\cup \{v\}}(w)\leq \frac{s+1}{2}$.
Since there is no edge in $R(v)$ incident with $w$,
from Claim \ref{c2}, we have $C(w,N_j(v))\subseteq \{c(vw),j\}$.
Hence, $d^c(w)\leq \frac{s+1}{2}+t-s\leq \frac{n}{2}$,
a contradiction.
\end{proof}

Now we proceed the proof of Theorem \ref{3} by induction
on $k$. The case $k=1$ follows from Theorem \ref{1}.
Let $k\geq 2$ and suppose Theorem \ref{3} holds for $k-1$.
Suppose to the contrary, that there is a vertex $v$ such that $|R(v)|<k$.
Since $\delta^c(G)\geq \frac{n+k}{2}\geq \frac{n+k-1}{2}$, we have
$|R(v)|=k-1$.
Certainly, $s\geq k+1$ since $\delta^c(G)\geq \frac{n+k}{2}$.
For $u\in N_1$, let $R_u(v)$ be the subset of $R(v)$ in which each edge is an in-arc to
$u$ and $\psi(R_u(v))\subseteq N_1$
and $R_u'(v)$ be the subset of $R(v)$ in which each edge is incident
with $u$ and $\psi(R_u'(v))\setminus \{u\}\subseteq N_2$,
that is, $R_u(v)=\{uw\in R(v)~|~\overleftarrow{uw}\in D\}$
and $R_u(v)=\{uw\in R(v)~|~w\in N_2\}$.
Hence, from Claims \ref{c1} and \ref{c2},
we have $d^c_{N_1}(u)\leq d^+_{D}(u)+1+|R_u(v)|$ and
$|C(u,N_2)\setminus \{c(uv)\}|\leq t-s+|R_u'(v)|$.
Then,
$$\begin{array}{ll}
d^c(u)&\leq d^+_{D}(u)+1+|R_u(v)|+|R_u'(v)|+t-s.
\end{array}$$
Since $|R_u(v)|+|R_u'(v)|\leq k-1$, if $d^+_{D}(u)\leq \frac{s-k}{2}$,
we have $d^c(u)\leq \frac{n+k-1}{2}$,
a contradiction.
Therefore, $d^+_{D}(u)\geq \frac{s-k+1}{2}$ for $u\in N_1$.
Let $w$ be a vertex with minimum out-degree in $D$.
Then $\frac{s-k+1}{2}\leq d^+_{N_1}(w)\leq \frac{s-1}{2}$.
Assume that $d^+_{D}(w)=\frac{s-k+a}{2}$, $1\leq a\leq k-1$.
Then $|R_w(v)|+|R_w'(v)|\geq k-\frac{a+1}{2}$,
otherwise $d^c(w)<\frac{n+k}{2}$.
Since the edges in $R_w(v)$ are in-arcs to $w$,
they are out-arcs from the vertices in $\psi(R_w(v))\setminus\{w\}$.
Then for $u\in N_1\setminus\{w\}$,
we have $|R_u(v)|+|R_u'(v)|\leq\frac{a-1}{2}$.
So, $d^+_{D}(u)\geq \frac{s+k-a}{2}$ for all $u\in N_1\setminus \{w\}$.
Hence, $\sum_{u\in N_1}d^+_{D}(u)\geq (s-1)\frac{s+k-a}{2}+\frac{s-k+a}{2}$.
Since $s\geq k+1$ and $1\leq a\leq k-1$,
we have $\sum_{u\in N_1}d^+_{D}(u)>\frac{s(s-1)}{2}$,
a contradiction.
$\hfill\qedsymbol$

\section{Proofs of Theorems \ref{8} and \ref{10}}

\textbf{Proof of Theorem \ref{8}:}
Let $G$ be a graph satisfying the assumptions of Theorem \ref{8}
and $v$ be a vertex of $G$.
Suppose, to the contrary, that $G$ has no rainbow triangle.
Assume that $|N_1(v)|=\cdots =|N_s(v)|=1$ and $2\leq |N_{s+1}(v)|\leq \cdots \leq |N_t(v)|$ ($t=d^c(v)$).
Clearly, $t-s\leq \frac{n-1-s}{2}$.
Let $N_1=\cup _{1\leq i\leq s}N_i(v)$ and
$N_2=\cup_{s+1\leq i\leq t}N_i(v)$.
Now we proceed by proving the following claims.

\begin{claim}\label{c4}
$C(N_i(v),N_j(v))\subseteq \{i,j\}$, for $1\leq i\neq j\leq t$.
\end{claim}

\begin{claim}\label{c5}
If $|N_1|\geq 2$, then there is a vertex $u\in N_1$
such that $C(u,N_1\setminus \{u\})=\{c(vu)\}$.
\end{claim}

\begin{proof}
Suppose not, let $u$ be a vertex in $N_1$
with minimum color-degree in $G[N_1]$.
Set $W_1=\{w\in N_1~|~c(uw)=c(vu)\}$
and $W_2=\{w\in N_1~|~c(uw)= c(vw)\}$.
From Claim \ref{c4}
we have $N_1\setminus\{u\}=W_1\cup W_2$.
For any vertex $w_1\in W_1$ and $w_2\in W_2$,
from Claim \ref{c4},
we have $c(w_1w_2)\in \{c(vw_1),c(vw_2)\}$.
According to the definitions of $N_1$, $W_1$ and $W_2$,
we have $c(uw_1)\neq c(uw_2)$.
Then, $c(w_1w_2)=c(uw_2)$,
otherwise $uw_1w_2u$ is a rainbow triangle, a contradiction.
Hence, for any vertex $w\in W_2$,
$C(w,W_1)=\{c(vw)\}$.
Then, there is a vertex $w$ in $W_2$ such that
$d^c_{N_1}(w)<d^c_{N_1}(u)$.
Therefore, we can find a vertex $u\in N_1$
such that $C(u,N_1\setminus \{u\})=\{c(vu)\}$.
\end{proof}

Next we distinguish two cases.

\textbf{Case 1.} $|N_1|\geq 2$.

Let $u$ be a vertex in $N_1$ such that $C(u,N_1\setminus \{u\})=\{c(vu)\}$.
From Claim \ref{c4}, we have $C(u,N_j(v))\subseteq \{c(vu),j\}$ for $s+1\leq j\leq t$.
Hence, $d^c(u)\leq t-s+1\leq \frac{n-1-s}{2}+1\leq \frac{n-1}{2}$,
a contradiction.

\textbf{Case 2.} $|N_1|=1$.

Let $N_1=\{u\}$. Then $|N_j(v)|=2$ and $j\in C(u,N_j(v))$ for $2\leq j\leq t$,
otherwise $d^c(u)<\frac{n}{2}$.
Assume there is a set $N_k(v)=\{x,y\}$.
W.l.o.g., suppose $c(ux)=c(vx)=k$.
Since $n\geq 8$, there exists a vertex $z\in N_2\setminus N_k(v)$
such that $c(xz)=c(vz)$.
Hence, $c(uz)=c(vz)$,
otherwise from Claim \ref{c4},
$uxzu$ is a rainbow triangle.
Therefore,
$c(zy)=c(vy)=k$,
otherwise $d^c(z)\leq t-s-2+2\leq \frac{n}{2}-1$, a contradiction.
Hence, $c(zx)\neq c(zy)$.
Then, $c(xy)\in\{c(zx),c(zy)\}= \{c(vx),c(vz)\}$,
otherwise $xyzx$ is a rainbow triangle.
So, $d^c(x)\leq t-s-1+1\leq \frac{n}{2}-1$, a contradiction.

$\hfill\qedsymbol$

\textbf{{Proof of Theorem \ref{10}}:}
Let $G$ be a graph satisfying the assumptions of Theorem \ref{10}.
Since $G$ has no rainbow triangle and $\delta^c(G)\geq \frac{n-1}{2}$,
there exist a vertex $v$ such that $d^{c}(v)=\frac{n-1}{2}=t$ in $G$.
Assume that $|N_1(v)|=\cdots =|N_s(v)|=1$
and $2\leq |N_{s+1}(v)|\leq \cdots \leq |N_t(v)|$.
Let $N_1=\cup _{1\leq i\leq s}N_i(v)$ and
$N_2=\cup_{s+1\leq i\leq t}N_i(v)$.
Now we proceed by proving the following claims.

\begin{claim}\label{c7}
$C(N_i(v),N_j(v))\subseteq \{i,j\}$, for $1\leq i\neq j\leq t$.
\end{claim}

\begin{claim}\label{c8}
$N_1=\emptyset$.
\end{claim}

\begin{proof}
Suppose not, since $d^c(v)=\frac{n-1}{2}$,
there is a set $N_k(v)$, $s+1\leq k\leq t$,
such that $|N_k(v)|\geq 3$.
Thus, $s-t\leq \frac{n-s-2}{2}$.
From Claim \ref{c7}, $C(u,N_j(v))\subseteq \{c(vu),j\}$ for $s+1\leq j\leq t$.

If $|N_1|\geq 2$,
as in the proof of Theorem \ref{8},
there is a vertex $u\in N_1$
such that $C(u,N_1\setminus \{u\})=\{c(vu)\}$.
Then, $d^c(u)\leq t-s+1\leq \frac{n-2-s}{2}+1\leq \frac{n}{2}-1$,
a contradiction.
If $|N_1|=1$, let $N_1=\{u\}$, and assume that $|N_2(v)|=3$
and $|N_j(v)|=2$ for $3\leq j\leq t$.
Then there must exist a vertex $x\in N_l(v)$
such that $c(ux)=c(vx)$, $3\leq l\leq t$.
Let $N_l(v)=\{x,y\}$.
Then there is a vertex $z\in N_k(v)$ such that $c(xz)=c(vz)$,
otherwise $d^c(x)<\frac{n-1}{2}$.
Hence, $c(zy)=c(vy)$,
otherwise $d^c(z)<\frac{n-1}{2}$.
Then $c(xz)\neq c(yz)$.
Therefore, $c(xy)\in \{c(vz),c(vx)\}$,
otherwise $xyzx$ is a rainbow triangle.
Then, $d^c(x)\leq \frac{n-2-1}{2}<\frac{n-1}{2}$,
a contradiction.
\end{proof}

By Claim \ref{c8},
$|N_i(v)|=2$ for all $1\leq i\leq t$.
Thus, $n$ is odd.
Since $\delta^c(G)\geq \frac{n-1}{2}$,
by Claim \ref{c7},
we have that for any vertex $u\in N_i(v)$,
$j\in C(u,N_j(v))$ for $1\leq j\neq i\leq t$,
that is $C(u, N_j(v))=\{c(vu),j\}$.
If $n\leq 5$,
it is easy to verify that
$C(N_i(v))\subset \{1,2\}$.
If $n\geq 7$,
then $C(N_j(v))=\{j\}$.
Otherwise, suppose that there is a set $N_k(v)=\{x,y\}$
such that $c(xy)\neq k$.
Then there is a vertex $z\in N_2\setminus N_k(v)$ such that
$xyzx$ is a rainbow triangle, a contradiction.
Therefore, let $A_0=\{v\}$ and $A_i=N_i(v)$ for $1\leq i\leq \frac{n-1}{2}$.
This completes the proof.
$\hfill\qedsymbol$

\section{Proofs of Theorems \ref{11} and \ref{14}}

At first we need the following lemmas.

\begin{lemma}\label{l1}
Let $G$ be an edge-colored complete graph of order $n\geq 8$.
If $\delta^c(G)\geq \frac{n+1}{2}$ and
there are two vertices $y,z$ such that $G'=G-\{y,z\}$
has no rainbow triangles,
then $G$ has two vertex-disjoint rainbow triangles containing $y$ and $z$,
respectively.
\end{lemma}

\begin{proof}
Since $\delta^c(G)\geq \frac{n+1}{2}$,
we have $\delta^c(G')\geq \delta^c(G)-2\geq \frac{|G'|-1}{2}$.
From Theorem \ref{10},
$d^c_{G'}(v)=\frac{|G'|-1}{2}$ for $v\in V(G')$ and
$G'$ has a partition $\{A_i,0\leq i\leq \frac{n-1}{2} \}$.
Assume that $A_0=\{v\}$ and $A_i=N_i(v)$ for $1\leq i\leq \frac{n-1}{2}$.
Since $\delta^c(G)\geq \frac{n+1}{2}$,
the edges from every vertex in $G'$ to $z$ and $y$
are assigned two new colors.
Let $N_i(v)=\{a_i,b_i\}$.
If there is a set $N_k(v)$ such that $c(za_k)\neq c(zb_k)$,
then $C(y,G'\setminus (\{v\}\cup N_k(v)))=\{c(vy)\}$.
If not, there is a vertex $u\in G'\setminus (\{v\}\cup N_k(v))$
such that $c(uy)\neq c(vy)$, and then $uvyu$ is a disjoint rainbow triangle from $xa_kb_kx$.
So, $d^c(y)\leq 4$, a contradiction.
Hence, for any set $N_i(v)$, $c(za_i)=c(zb_i)$ and $c(ya_i)=c(yb_i)$.
Since $d^c(z)\geq \frac{n+1}{2}$,
there are two sets $N_i(v)$ and $N_j(v)$, $i\neq j$,
such that $c(za_i)\neq c(za_j)$.
Then $za_ia_jz$ is a rainbow triangle.
Similarly, we can find another rainbow triangle $yb_kb_ly$,
a contradiction.
\end{proof}

\begin{lemma}\label{l2}
Let $G$ be an edge-colored graph of order $n\geq 7$.
If $\delta^c(G)\geq \frac{n+2}{2}$ and
there are two vertices $y,z$ such that $G'=G-\{y,z\}$
has no rainbow triangles,
then $G$ has two vertex-disjoint rainbow triangles containing $y$ and $z$,
respectively.
\end{lemma}

\begin{proof}
Since $\delta^c(G)\geq \frac{n+1}{2}$,
we have $\delta^c(G')\geq \delta^c(G)-2\geq \frac{|G'|-1}{2}$.
According to Theorem \ref{16},
we know that $G'$ is a properly colored balanced complete bipartite graph.
Since $\delta ^c(G)\geq \frac{n+2}{2}$,
we have that $vz$ and $zy$ are in $E(G)$ and $d^c(v)=\frac{n+2}{2}$ for every vertex $v\in V(G)$.
Thus, we can easily find two vertex-disjoint rainbow triangles containing $z$ and $y$, respectively,
a contradiction.
\end{proof}

\textbf{Proof of Theorem \ref{11}:}
Since $\delta^c(G)\geq \frac{n}{2}$,
according to Theorem \ref{8},
$G$ has a rainbow triangle $xyzx$.
Let $T(G)$ be the set of all rainbow triangles in $G$.
Suppose, to the contrary,
that $G$ has no vertex-disjoint rainbow triangles.
Then each rainbow triangle in $T(G)\setminus \{xyzx\}$
meets at least one of $\{x,y,z\}$.
Let $W_1 (W_2,W_3)$ denote the subset of vertices in $V(G)\setminus \{x,y,z\}$,
in which every vertex is contained in a rainbow triangle together with $x(y,z)$.
Now we proceed by proving the following claims.

\begin{claim}\label{c12}
$W_i\neq \emptyset$, for $i=1,2,3$.
\end{claim}

\begin{proof}
W.l.o.g., suppose $W_1=\emptyset$.
Then each rainbow triangle in $T(G)\setminus \{xyzx\}$
meets $y$ or $z$. From Lemma \ref{l1},
we can find two vertex-disjoint rainbow triangles in $G$,
a contradiction.
\end{proof}

\begin{claim}\label{c10}
For any set $W_i$,
there is a vertex in $W_i$ but not in $W_j$, $1\leq i\neq j \leq 3$.
\end{claim}

\begin{proof}
W.l.o.g., suppose, to the contrary,
that $W_1\subseteq W_2\cup W_3$.
Then there is no rainbow triangle in $G'=G-\{z,y\}$.
Therefore, from Lemma \ref{l1}
we can find two vertex-disjoint rainbow triangles in $G$,
a contradiction.
\end{proof}

\begin{claim}\label{c11}
There is a vertex $a_0$ such that
all rainbow triangles in $T(G)\setminus \{xyzx\}$
meet at $a_0$.
\end{claim}

\begin{proof}
By Claim \ref{c10},
let $a_i\in W_i\setminus (W_j\cup W_k)$, $1\leq i\neq j\neq k\leq 3$.
Then there is a vertex $a_0$ such that
$xa_1a_0x$, $ya_2a_0y$ and $za_3a_0z$ are rainbow triangles,
otherwise we can easily find two disjoint rainbow triangles.
Suppose that there is a rainbow triangle $uvwu$ in $T(G)\setminus \{xyzx\}$
such that $a_0\notin\{u,v,w\}$.
Then we can easily find two vertex-disjoint rainbow triangles, a contradiction.
\end{proof}

Let $G''=G-\{x,a_0\}$.
Then $\delta^c(G'')\geq \frac{|G''|-1}{2}$.
From Claim \ref{c11},
there is no rainbow triangle in $G''$.
Hence, from Lemma \ref{l1}
we can find two vertex-disjoint rainbow triangles in $G$ containing $x$ and $a_0$,
respectively,
a contradiction.
This completes the proof of Theorem \ref{11}.
$\hfill\qedsymbol$\\

\textbf{Proof of Theorem \ref{14}:}
Using Theorems \ref{15} and \ref{16} in \cite{LNXZ}, and
Lemma \ref{l2} as well as by an analogue of the proof of Theorem \ref{11},
we can get the result of Theorem \ref{14}.
$\hfill\qedsymbol$

redpajama_set_name: RedPajamaArXiv