text:
When I was legal director of PCG (Professional Contractors Group) back in the early days of the new millennium, a strange case crossed my desk. Apparently somebody in the Inland Revenue was trying to apply the settlements legislation to a couple of contractors, which meant that the higher earner would pay tax at over 45% on the lower earner's share of the business.
I didn't spend much time on it because I was tied up with the judicial review against IR35, and I figured it would be sorted quite quickly once PCG's investigation team got involved. As every contractor knew at the time - a company run by a married couple is probably a settlement, but there is an 'outright gift' exception for married couples. That then puts them on a par with unmarried couples and normal partnerships.
After some seven years the House of Lords finally agreed with the contractors. And then as soon as they won, the government decides it is going to change the law to stop what it calls 'income splitting'. Why they couldn't have done that in the first place rather than leading everybody a merry dance for seven years is something people ought to ponder the next time they are asked to put an X on a piece of paper.
That the government is going to introduce one of their wonderfully effective 'targeted' pieces of legislation is not new of course. Taxation experts and lawyers are already rubbing their hands with glee at the extra fees this thing will generate. What worries me is that the government is conveniently avoiding a couple of other issues.
If 'income splitting' is wrong and individuals should be taxed according to their contribution, then why is income based upon physical assets to be taxed differently.
For example if a couple have a Buy-to-Let business then income (and capital gain!) from that business can be split 50/50 and nobody seems to get upset - regardless of where the money came from to purchase the houses and regardless of the effort put into running the business.
Similarly if an individual pays into a spouse's ISA or a pension, or simply puts assets in the name of their spouse then the income from those assets is taxed as the spouse's income.
Why is income from physical assets so different from that from intellectual assets? It makes no sense.
And of course if you introduce the notion of 'income splitting' so that the exchequer can transfer money to the highest taxed individual on a whim, then surely it is only 'fair' (to use that appalling PR phrase the government is so fond of) to consider the opposite issue of 'income aggregation'.
Is it 'fair' that when an individual sacrifices their earning potential so that their spouse can earn a higher wage, that the spouse is taxed on *all* the income generated? Often at a punitive marginal rate of up to 45%.
Isn't it about time that unpaid carers and housekeepers and personal assistants received a wage for their efforts, and were taxed accordingly?
If 'income splitting' isn't fair, then 'income aggregation' is an outright scandal.


text:
The hottest new office perk is a quiet room
Amy X. Wang, Quartz: In a corner of Etsy's new 200,000 sq ft (18,581 sq m) headquarters in Brooklyn, New York, there is a room meant only for breathing.
Save for the lack of furniture, "A-901: Breathing Room" appears as an ordinary conference room. It sits squarely within the rest of the office, which buzzes with the steady meetings and conversations that characterize most corporate buildings. Soft mats, for sitting, are piled to one side of the room. Digital devices are not allowed.
A few times a week, dozens of employees gather in the …

subset: commoncrawl


text:
The (discrete) cumulative distribution function of the geometric distribution
MuPAD® notebooks are not recommended. Use MATLAB® live scripts instead.
MATLAB live scripts support most MuPAD functionality, though there are some differences. For more information, see Convert MuPAD Notebooks to MATLAB Live Scripts.
stats::geometricCDF(p) returns a procedure
representing the (discrete) cumulative distribution function
of the geometric distribution with 'probability parameter'
The procedure
f:=stats::geometricCDF(p) can
be called in the form
f(x) with an arithmetical
x. The return value of
f(x) is
either a number or a symbolic expression:
If x < 1 can
be decided, then
f(x) returns 0.
If x ≥ 1 can
be decided, then
f(x) returns the value .
If x is a floating-point number and p can be converted to a floating-point number, then these values are returned as floating-point numbers. Otherwise, symbolic expressions are returned.
The function
f reacts to properties of identifiers
set via
If x is
a symbolic expression with the property x <
1 or x ≥
1, the corresponding values are returned.
f(x) returns the symbolic call
stats::geometricCDF(p)(x) if
neither x < 1 nor x ≥
1 can be decided.
If p = 0 or p = 0.0, then f(x) returns 0 or 0.0, respectively, for any value of x.
Numerical values for
p are only accepted
if they satisfy 0 ≤ p ≤
x is a real floating-point number, f(x) produces
a floating number provided p is
a numerical value. If
x is an exact numerical value,
no internal floating-point conversion of the parameter p is
The function is sensitive to the environment variable
DIGITS which
determines the numerical working precision.
We evaluate the distribution function with at various points:
f := stats::geometricCDF(1/3): f(-PI) = f(float(-PI)), f(1) = f(1.0), f(103/10) = f(10.3)
delete f:
x is a symbolic object without properties,
then it cannot be decided whether x ≥
1 holds. A symbolic function call is returned:
f := stats::geometricCDF(p): f(x)
With suitable properties, it can be decided whether x ≥ 1 holds. An explicit expression is returned:
assume(1 <= x): f(x)
unassume(x): delete f:
We use symbolic arguments:
f := stats::geometricCDF(p): f(x)
x is a numerical value, symbolic expressions
p are returned:
f(-1), f(1), f(5/2), f(PI)
When numerical values are assigned to p, the function f starts to produce numbers if the argument is numerical:
p := 1/3: f(-1), f(1), f(5/2), f(PI)
delete f, p:
The 'probability parameter': an arithmetical expression representing a real number 0 ≤ p ≤ 1.
The geometric distribution describes the number of Bernoulli trials with success probability p up to and including the first success.


text:
Does violence occur in same-sex relationships?
Violence does occur in same-sex relationships. In fact, statistics show that same-sex relationship violence is as common as heterosexual relationship violence. The elements of abusive relationships are similar for heterosexual and homosexual couples, although same-sex victims may face additional barriers to ending the relationship.The Shelter LGBT brochure LGBT Power/Control Wheel Local Resources


text:
Company News
PRÆSIDIAD is a world market leader of force protection solutions,integrated perimeter security systems and industrial mesh production and fencing products. We engineer products that inspire confidence and trust; solutions that defend and protect military, commercial and domestic end-users. We defend critical infrastructure and protect public work sites and utilities. We mitigate risk and protect against terrorist actions. We defend homes and communities and protect those that protect us. Our brands are globally recognized for quality protective systems, integrated security solutions and outstanding service.


text:
Since its debut in 2009, Modern Family has broken records and barriers. Not only has its witty writing and sharp acting received critical acclaim—the show has served as a feasible image of a new reality.
Modern Family revolves around the extended Pritchett clan, three interrelated families joined by one name and one strong spirit of unconditional love. In the show, the family patriarch (Ed O'Neill) fathers two grown children—a daughter (Julie Bowen) and a gay son (Jesse Tyler Ferguson)—and weds a younger Latina woman (Sofia Vergara); Ferguson's character raises a child (Aubrey Anderson-Emmons) with his husband (Eric Stonestreet).
Perhaps such a family would not draw much attention these days. But imagine this show airing in the 1950s: It has divorce. It has racially mixed families. It has a gay couple. That gay couple has a child. The show would have broken every social norm; the public would have advocated in force for its cancellation. But today, in 2016, Modern Family is entering its eighth season, with a loyal fan base and 21 Emmy awards in tow.
In one particularly memorable episode of the show, Mitchell discusses his coming out process—how he felt the need to tell his family his true identity once he reached college. That episode struck me when I first saw it six years ago. I resonated with Mitchell. I understood him. I was not out to my family yet, and I was still figuring out my identity for myself. But I recognized Mitchell's desire to share his thoughts with his family. It is only in retrospect that I can reflect that Mitchell, and Modern Family as a whole, helped me accept who I am.
When I matriculated at Harvard, I started to relate to Mitchell's process more and more. Near the beginning of college, when I would call my parents, I always hung up the phone feeling like I had offered them a false version of myself. And then one day, for some reason I still do not know, I decided that I was done living a lie. I felt empowered. I picked up my phone and dialed my mother's number. And it all spilled out very naturally. While Mitchell's father did not call him for weeks after Mitchell came out to him, I am fortunate that my relationship with my family has only become stronger in the months since.
But way back when Modern Family first hit the airwaves, I was just a confused middle schooler, sitting on a couch with my family, watching an episode that mattered more to me than they realized. I knew I was different, but I saw being gay as a disadvantage. I wanted to change myself somehow. This show altered my views. Every week, it broadcast into my living room proof that gay people can have families, happiness, acceptance, normality. That felt revolutionary to me.
As positive as my conversations with my parents have been, I have not shaken one thing my mother told me after I came out: She said she is scared.
She is not scared of homosexuality or of her friends' opinions. "Your life is just going to be so much harder," she said to me. She is not wrong: In June, Orlando's gay community was targeted in the deadliest mass shooting in the nation's history. In 2015, Daniel and Larry Lennox-Choate, the first gay couple to be married at West Point, were victims of an assault just weeks after the Supreme Court ruled in favor of marriage equality. Hate crimes still exist. People are still attacked or murdered because of their sexual identities. Republicans are still advocating for the repeal of marriage equality and other laws. A New York Times editorial called their 2016 platform "the most anti-LGBT Platform in the party's 162 year history." . We have a whole party—a whole group of people—fighting against the rights of fellow humans. My mother is right: That is scary.
But I'm not scared. And shows like Modern Family are the reasons why.
Ever since Modern Family's debut, LGBTQ+ characters have become more and more prevalent in entertainment. Grey's Anatomy brought Arizona Robbins, a lesbian pediatric surgeon, to the halls of Seattle Grace Mercy West Hospital. House of Cards revealed its protagonist Frank Underwood to be bisexual. Transparent showcased a father telling his children that she is transgender.
It is striking that the pop cultural climate and the political climate are sending two starkly different messages to the public. Television is promoting progressivity, while some corners of the government are advocating for the exact opposite. But that dichotomy—that contrast—is exactly why I am not scared. History has proven that the dialogue fostered by entertainment yields social change.
Take, for instance, The Mary Tyler Moore Show. When it premiered in 1970, it was the first show to feature an independent, single business woman as its central character. Before the show even aired, ABC executives were nervous about approving it. But now, 46 years later, the debate has changed. Our modern television landscape suggests that it is no longer taboo to see a successful, unmarried woman on our screens—Scandal, Grey's Anatomy, and Once Upon a Time all feature powerful, solo female characters who focus on their careers or communities.
Just as The Mary Tyler Moore Show contributed to the evolution of feminism, the television miniseries Roots had an important effect on the conversation surrounding civil rights. Premiering in 1977, Roots tells the story of author Alex Haley's ancestors, including their migration from Africa into slavery. By viewing slavery from the perspective of the actual slave, Roots showed that this heinous act is part of America's story, not just black America's story. The legacy of Roots lives on in programming like Blackish, How to Get Away With Murder, and Empire, which all feature African-American casts.
Modern Family is doing the same for gay rights. It has generated a dialogue and projected a message that LGBTQ+ individuals can be as loving parents, as happy, and as human as heterosexuals. When that idea is accepted as normal, our rights will no longer be a partisan issue; they will be a civil one.
So while the current political state may frighten my mother, I take solace in the lessons conveyed by television shows and other staples of pop culture. As more and more people are exposed to these lessons, being gay becomes less and less taboo. Modern Family showed that to me by furthering a dialogue that promotes acceptance of all. In the years since, I have accepted who I am, LGBTQ+ characters have appeared in entertainment with increasing frequency, and we have even seen the legalization of marriage equality. Social change is in progress. That is irrefutable. That is not scary. That is beautiful.


text:
I've talked a fair bit about business models for journalism, but Jeff Jarvis has thought about it a whole lot more than I have. Here is a video of Jarvis talking about the new ecosystem for news, and how to build successful, money-making news organisations:
Jeff Jarvis on New Business Models for News 2009 from CUNY Grad School of Journalism on Vimeo.
This is part of Jarvis' New Business Models for News project at the CUNY Graduate School of Journalism. I love their approach. I think that changing the business model is exactly the right approach to take. They include spreadsheets for all of the business models that they work on including hyperlocal approaches, a new metro news model, and non-profit ideas. This level of detail is essential to figuring out how to change an industry. These models may or may not ultimately be the ones that end up working, but this is the kind of approach to take towards business model innovation – which is the best response to a turbulent market.
On the other hand, here's an example of a pretty closed model that has worked reasonably well – I'm still trying to make up my mind on the Apple approach, more on that soon I think…


text:
Cappy's Tire & Auto Service
Review for Cappy's Tire & Auto Service
WALT-CAROL K. on 10/10/2013
"Another trip to Cappy's"
Yesterday I took our SUV to Cappy's for service and again I was greeted with smiling faces and queries if there was any outstanding problems with vehicle, to which I replied no and then set about doing the lube and oil change on my vehicle and getting me on my way in a timely manner. Kudus again to the team at Cappy's.
Vehicle: Ford Escape
Service Date: 10/09/2013
Review Created: 10/10/2013 08:10 AM


text:
We are Californians who get to Las Vegas once or twice a year. Before the foie gras ban went into effect, we had four amazing foie dinners, at Village Pub in Woodside, Pacific's Edge in Carmel, Martin's Gastropub in Redwood City and a private Dishcrawl event. We keep hoping that some restaurant in Las Vegas will offer a menu with four to seven foie dishes.
I would be willing to go to a high end restaurant with two or three preparations. But I am also looking for more casual places in the area if they only offer one. Barrymore and Bachi Burger seem like possibilities. Can anyone suggest other places that won't cost hundreds of dollars? My favorite place for foie in California was Bistro Elan (now Birch Street) in Palo Alto, if that gives anyone a better idea of what we have in mind.


text:
|Joy Meachum
|Appeared in
|Iron Fist
| Jessica Stroup
Aimee Laurence (teen)
Joy Meachum is the daughter of Harold Meachum, sister of Ward and the childhood friend of Danny Rand. She currently runs Rand Enterprises.
Iron Fist
"Snow Gives Way"
To be added
"Shadow Hawk Takes Flight"
To be added
"Rolling Thunder Cannon Punch"
To be added
"Eight Diagram Dragon Palm"
To be added
"Under Leaf Pluck Lotus"
To be added
"Immortal Emerges from Cave"
To be added
"Felling Tree with Roots"
To be added
"The Blessing of Many Fractures"
To be added
"The Mistress of All Agonies"
To be added
"Black Tiger Steals Heart"
To be added
"Lead Horse Back to Stable"
To be added
"Bar the Big Boss"
To be added
"Dragon Plays with Fire"
To be added
Character traits
To be added
- Harold Meachum - Father.
- Ward Meachum - Brother.
- Daniel Rand - Friend turned enemy.
- Marvel Cinematic Universe (1 TV Series)
- Iron Fist - Jessica Stroup and Ilan Eskenazi (teen)
- "Snow Gives Way" (First appearance)
- "Shadow Hawk Takes Flight"
- "Rolling Thunder Cannon Punch"
- "Eight Diagram Dragon Palm"
- "Under Leaf Pluck Lotus"
- "Immortal Emerges from Cave"
- "Felling Tree with Roots"
- "The Blessing of Many Fractures"
- "The Mistress of All Agonies"
- "Black Tiger Steals Heart"
- "Lead Horse Back to Stable"
- "Bar the Big Boss"
- "Dragon Plays with Fire"
- Iron Fist - Jessica Stroup and Ilan Eskenazi (teen)
Behind the scenes
To be added
- In the comics, Joy Meachum was a brilliant business woman who was set to take control of Rand-Meachum, Inc. one day.
- In the comics, Joy is Ward's niece but in the series, they are brother and sister.


text:
Search Results For "swipe to shine led flashlight thumb technology" (0)
We could not find any matches for your search. "swipe to shine led flashlight thumb technology"
Search Tips
- When searching for an item number, only enter the numbers before the dash (ex. 100130-5901)
- If you are shopping from a catalog try searching by keyword(s) in the product description or use our Quick Order.
- Make sure all words are spelled correctly.
- Try using fewer words.
- Try using more general keywords.
- Try different keywords.
Still can't find what you're looking for? Call 1-800-685-4845


text:
Berkeley balcony collapse: President Higgins to plant tree in California in memory of tragic students
President Michael D Higgins is to plant a tree in Berkeley in memory of the six students who tragically died following an apartment balcony collapse.
The poignant event will be part of an eight-day trip to the west coast of the United States.
Accompanied by his wife Sabina, President Higgins plans to travels to Seattle, and is set to deliver a keynote address at the University of Washington.
Read more: Victims of Berkeley tragedy honoured at UCD
The Presidential party will then depart for California where they will meet Governor Jerry Brown and speak at the University of California in Berkeley.
First responders, volunteers and all who helped following the balcony tragedy will be visited with President Higgins.
Online Editors
Promoted Links
Related Content
- Victims of Berkeley tragedy honoured at UCD
- 'Hello grandma' ... Aoife calls home for first time
- Aoife's godfather tells of Berkeley shock
- Sell-out fundraiser for Berkeley survivors a success
- Cousin of Berkeley balcony survivor Aoife describes her long road to recovery
- Berkeley vigil for balcony victims as US donations soar


text:
Miley and Billy Ray Cyrus have popularized country music. There's a country music CD/album coming you should pay attention to.
First, I'll say I'm not a big fan of country music. I wrote about and covered it at The Denver Post because no one else would do it. I traded; I had jazz first. Probably would have killed myself on the jazz beat
The CD you should watch out for is Gloriana.Two words why you should watch this CD – Cheyenne Kimball. Ever hear the Miley Cyrus song Four Walls? Kimball did it first on The Day Has Come.
For some reason she is more comfortable in Gloriana. The muse is a funny thing. I'm not one to tell her to stay solo. Let her pursue her happiness.
I can't understand why Kimball isn't up there with Miley Cyrus and all those other top sellers – like Daughtry (proof there is no hope for the world). She has one of the finest voices in the world.
I say the same thing about Aly & AJ, but their music marketing tactics have significantly hurt their musical careers. After seeing Bandslam, Alyson Michalka doesn't need to worry. She's on the yellow brick road to thespian Hollywood stardom. After seeing Bandslam, I bestow THE best voice ever award to Michalka. See the review below.
Gloriana isn't even country. They're more bluegrass. That didn't hurt someone I met in Colorado, Jerry Douglas. Taylor Swift recently put pictures of her home up on Twitter asking people to guess where it was. I looked and said, "That's right next to Jerry Douglas' property in Hendersonville (Tenn.)." So if Douglas is doing well enough with bluegrass, and touring with Elvis Costello, to afford living next to Taylor Swift, guess being bluegrass isn't that bad.


text:
RepairPal is your advocate for car care advice and guidance
Q: Poor Fuel Effiency on 1999 Toyota Tercel
I have Toyota Tercel 1999 1.3, autometis transmission, driving in Dubai, UAE. I am facing the problem from Fuel cunsumption that I am getting on 8KM/ L . Please Let me What should i do.
Are there any warning lights on? I don't know what that vehicle is equipped with, but here in the states we have an onboard computer that monitors the engine for problems like this, and when it detects an issue, it will store diagnostic trouble codes. Those codes need to be retrieved to make a diagnosis.
Didn't find what you were looking for?


text:
2007 TOPPS Co-Signers Moon Shot Buzz Aldrin Astronaut NASA Autographed Auto
Sold for:
Start Free Trial
or Sign In to see what it's worth.
- Sold Date:
- Source: eBay
How historic is this card? It features the hand signed autograph of the sixth of only 12 human beings in the entire history of mankind to set foot on a surface other than Earth. This Edgar Mitchell card is certified authentic by TOPPS corporation, known worldwide. I believe that it was the first astronaut certified authentic autograph released to the public from a trading card company. The release was 2007, so you know how quickly these dried up, as now they sit in peoples collections unwilling to release them. I have heard that there were 100 of the individual signed astronaut cards along with 100 of the dual signed cards released. This may be your only opportunity to add this to your collection. The card pictured is the one that you are buying. Thanks and please pay within 7 days. Thanks for looking.


text:
Family Dollar Store (est. 2004)
[42.387374, -82.97131] famili, dollar, store, pawn, shop, discount, varieti, groceri, laundri, deterg, tide, bodi, lotion, suav, toilet, paper, scott, product, parti, suppli, cereal, kellogg, hous, home, juic, veget, drink, hawaiian, punch, gain, depart
my family. my family dollar.
(313) 824-2146 4705b Conner St, Detroit, MI 48215 Sunday: 09:00 Am 09:00 Pm, Monday: 08:00 Am 09:00 Pm, Tuesday: 08:00 Am 09:00 Pm, Wednesday: 08:00 A Official site
Categories: Pawn Shops & Discount Stores, Variety Stores, Grocery Stores
The Details
We speak English Cash and Check gladly accepted
Nearby Related BusinessesCiti Trends
4907 Conner St, Detroit, MI 48215
11919 E Warren Ave, Detroit, MI 48214 Atlas Warehouse Equipment
11400 Shoemaker St, Detroit, MI 48213 Family Dollar Store
14305 Harper Ave, Detroit, MI 48213 More Results


text:
What is directly observed therapy (DOT)?
To increase the success of TB disease treatment and decrease the risk of drug resistance, a health care worker observes each dose of TB medication taken.
Most persons believe they are able to take their medication without help. But 6 - 9 months is a long time to take antibiotics, especially after you start to feel better. Health care workers who provide DOT offer encouragement to complete treatment. People are human and humans are sometimes forgetful. DOT health care providers help people remember to take their medicine. They also check for harmful side effects and make sure the medicines are working as expected.
Last modified on 01/12/2015


text:
bartzluke (14) Oklahoma | May 4, 2015
I was both surprised and impressed. BJ's had nearly a dozen different styles from across the spectrum, and from the few I tried, they were great for brewhouse beer. Their stout and brown ale, particularly, surprised me for the quality. Plus, both were only $6. The staff was friendly and helpful and the food tasty. All around a good experience. Much better than I expected from a chain establishment.
Bricktop86 (11) Moore, Oklahoma | April 20, 2012
Pretty good place I enjoy the food and their brews. I just wish it wasn't so busy all the time.
notmarr2000 (7) Lawton, Oklahoma | August 31, 2011
A very good place to drink a variety of good beers, both brewed on premise and Belgium ($12 for a large Chimay Blue). No hassle if you want to drink and order food later. Fantastic pizza!
triumphrider74 (11) Norman, Oklahoma | January 13, 2011
I've had two bad experiences at this restaurant. The service is sometimes horrible. I've spent up to 2 hours here, not by choice. The food is not good. When I recieved broccoli as a side that was uncooked, the waiter took it back to the kitchen and zapped it in the microwave, then told me that he did. The beer are mediocre at best and the bar has very limited knowledge.
msante79 (342) Mount Prospect, Illinois | May 25, 2010
Your average BJs. Pretty much the same beers that they had at the El Paso, TX location last September. Food was good as usual. Decent place to stop in brewery starved Oklahoma. Good place to have a beer and some food.
Lawsonciv (3) Norman, Oklahoma | November 10, 2009
A great place to eat and drink. A good selection of home brewed beers. Good food. Good Atmosphere. A=Great place to go.
greedycheater (4) Oklahoma | February 22, 2008
Trendy for sure. Solid menu items that don't disappoint. Brew is the main attraction, and worth the visit. At least 6 different brews from light to dark. You're palate will find one to the liking, no doubt.
troyc (147) Illinois | May 11, 2007
Just opened a couple of days ago. They have about 9 of their beers on tap, which is brewed elsewhere I am guessing. The Blonde and Pale ale are also available in 3.2% versions, along with full strength. The beer was good overall. The food was pretty good too. The service was reliable, but sometimes a little bit overly attentive. I think they have a couple of other beers on tap as well, including Lindemans.


text:
Network Designer
Arrange a company's computer network in the fastest possible setup.
Repairs and services electrical radioactivity-detecting instruments used to locate radioactive formations in oil- or gas-well boreholes, using special testing apparatus. Tests electronic, electrostatic, and electromagnetic elements and circuits of instruments with special laboratory testing apparatus to locate defective parts and to verify precise adjustments. Services special subsurface instruments containing radium or radioactive compounds.


text:
Skinny black gay thugs porn movies This video is a bit weird with the 2,777 views. Now Just look for underwear with a thin strip of cotton fabric in the crotch. Free Gay Latino Thug Porn Videos - Pornhub Most Relevant Page 2. Hot Ghetto Gay on Hardcore Anal Fuck 1,497 views Black Ghetto Gay Loves Extreme Hardcore Fuck. Horny teen needs to scratch her itchy pussy Super horny teen plays with her young pussy.
Free gay black young teen thug gangbang porn Chase Harding plays the 3,334 views. XVIDEOS Amazing Latin stud gets fucked by black thug 5 by RedHotLatin free. 5 Black Thugs Gangbang Local Boy In Abandoned Warehouse.
Our porn search engine Hot Blonde Shemale Fucks the Boy next door in the Kitchen. Gay sexy latino thugs fucks thug raw ass videos Powel was a beginner to 333 views.
I surprised my mom being fucked by our dog when she thought was alone at home, it was a very traumatic experience. Score is a sexploitation film directed by Radley Metzger that was one of the first films to. Watch Latino thug masturbating is relaxed on Redtube, home of free Gay porn videos online.


text:
Bijay Kant Dubey
Rye On The Ravines By D.H.Kabadi - Poem by Bijay Kant Dubey
Rye On The Ravines is a collection of short poems
Which saw the light of the day
In 1985,
A representative work of the poet
Based on the three-liners
Which he calls them flickers
Bu those are haikus indeed.
A poet of the under-dogs, the have-nots,
The downtrodden and the proletarians,
He tells in a humane way
The feeling of his heart
Without a complaint or bias
Or any ism,
Leftism or rightism,
Criticizing it all in a good spirit of his.
Strange words, strange situations
And the placement of the persona
Under these contexts
Take the centrespace of his
And he writing the things,
Regaling with his thoughts, ideas and images,
All about man and his predicament,
Cosmic wilderness,
The lamps of the sky,
Societal depravity and human hunger.
A poet stylistic and manneristic,
Linguistic and modern,
He is humane, liberal and thoughtful,
He regales and recreates
With his ideas, images and thoughts,
Even the serious things,
The bare and naked facts
And hard realities of life
He says them with a smile,
Laughing a hearty laugh.
Comments about Rye On The Ravines By D.H.Kabadi by Bijay Kant Dubey
Read this poem in other languages
This poem has not been translated into any other language yet.
I would like to translate this poem »
Bijay Kant Dubey's Other Poems
Famous Poems
Phenomenal Woman
Maya Angelou
Still I Rise
Maya Angelou
The Road Not Taken
Robert Frost
If You Forget Me
Pablo Neruda
Langston Hughes
Annabel Lee
Edgar Allan Poe
Caged Bird
Maya Angelou
Rudyard Kipling
Stopping By Woods On A Snowy Evening
Robert Frost
I Do Not Love You Except Because I Love You
Pablo Neruda


text:
The Association of Commercial Television in Europe (ACT) is a trade body for the commercial broadcasting sector in Europe. Formed in 1989, the ACT has 27 member companies active in 37 European countries, operating and distributing several thousand free-to-air and pay-tv channels and new media services.
ITV announces landmark Princess Diana film
ITV announces a unique, landmark documentary, which will celebrate the life and work of Diana, Princess of Wales, in the 20th year since her tragic death. The film will be built around contributions from The Duke of Cambridge and Prince Harry, both of whom talk openly about their mother and how her influence has shaped their lives.
Read more
MTG Sweden becomes media partner for Swedish Diabetes Association
MTG will donate airtime to the Swedish Diabetes Association on its broadcast TV and radio channels in Sweden, as well as on its free online streaming service Viafree. In addition, MTG will produce diabetes-related programming and broadcast an annual gala to raise funds for diabetes research.
RTL Group: One-stop offering
IP Deutschland is expanding its advertising sales portfolio with immediate effect to include licensing cooperations, as well as licensing products, music and live entertainment.
Sky launches in Ireland NOW TV, the 'no-strings' online streaming service
NOW TV, SKY's online streaming service offering millions the opportunity to stream unmissable shows, the biggest blockbuster movies and exclusive live sport, all without a contract, is now available in Ireland.
Viacom: In a Changing World, Modern Dads Are More Involved and Reaping the Rewards
Global dads are rejecting traditional gender stereotypes and taking a more active role in their children's lives, according to a newly released Viacom study.


text:
xConnectNW 101 - Flu Season
xConnect Northwest
We sit down with Dr. Dennis Garcia of WSU's Health & Wellness Services to talk about the flu season.
Each Monday at 2:30pm pacific you can tune into a brand new epsiode right here on NWPTV.org. To particpate in the conversation simply connect with us on Facebook, Twitter or Google+. Social media not your thing don't worry, e-mail us or live chat with our producers every Monday at 2:30pm pacific right here.
xConnectNW is a weekly interactive program streamed live. This show engages our viewers and makes YOU part of the show.
What makes baseball so popular in Latino communities.
E-mail our producer Kanale Rhoden


text:
Core Blogger Feature: Mandy Fitzgerald
By: DecoArt
April 6, 2017
Mandy Fitzgerald is an abstract & figurative artist based in Richmond, Virginia. Founder of the "Artists to Know" interview series, she enjoys sharing the stories of how creative entrepreneurs have made their unique careers successful ones. In her spare time she paints furniture, murals, decor... any object that will stay still long enough to allow a fresh coat of paint.
Mandy's favorite DecoArt Projects:
See the Core Blogger Team for 2017-18 here!
Great job Mandy! You're the best!
April 6, 2017


text:
Richard Shawn Oliphant
Founding Partner
R. Shawn Oliphant is a founding partner of the firm Fahrendorf, Viloria, Oliphant & Oster L.L.P., and is the head of the firm's Civil Litigation, Business Litigation, and Financial Institution groups.
Mr. Oliphant represents developers, land owners, contractors, engineers and architects in all aspects of real estate and construction law from property entitlements, contract formation, property disputes, to mechanic lien foreclosures. Mr. Oliphant regularly represents design professionals in complex multi-million dollar construction cases and serves as panel counsel for a large number of insurance companies for construction defect and professional negligence claims. Mr. Oliphant also represents Homeowner Associations in all aspects of common interest community matters and represents the largest HOA in Northern Nevada. Mr. Oliphant's leadership in development and construction is reflected in the firm's clients, which make up the who's who in Northern Nevada's real property development and design professional industry. Mr. Oliphant has served as a key note speaker and lecturer on a variety of construction law topics for the Builders Association of Northern Nevada, the American Institute of Architects, and the Nevada Association of Land Surveyors.
Mr. Oliphant leads the firm's business litigation group and routinely handles complex business litigation matters. Mr. Oliphant also helps his business clients with drafting contracts, collecting on unpaid accounts, and resolving disputes with other businesses. His efforts with his business clients make him a critical component to many successful businesses in Nevada.
Mr. Oliphant has vast experience in collection matters for contractors, subcontractors, and design professionals. He has put his experience in debt collection to work for his clients and has recovered millions of dollars in unpaid invoices and collection of judgments. The firm utilizes internal investigation and external bank account searches and private investigators to track down and collect unpaid invoices and judgements on behalf of his clients.
Mr. Oliphant has successfully represented community financial institutions through complex foreclosure and collection cases, often securing multi-million dollar deficiency judgements following foreclosure. Examples of claims Mr. Oliphant has represented financial institutions on include actions for breach of loan agreements, commercial collections, foreclosures, creditors' rights in bankruptcy, loan participation disputes, construction loan disputes, Uniform Commercial Code disputes, lenders liability claims, breach of contract and fiduciary duty claims, mechanic's liens and priority issues and loan workouts. Mr. Oliphant has also successfully represented community financial institutions in prosecuting claims against title insurance and escrow companies who have failed to perform their duties to the financial institution.
Mr. Oliphant is a native norther Nevadan and received his bachelor degree in Business Administration with distinction from the University of Nevada. Mr. Oliphant attended law school at the University of Arizona where he graduated Summa Cum Laude and Order of the Coif, and served on the Law Review Editorial Board. Mr. Oliphant's law review Note encouraging the legalization of gaming advertisements was published in the University of Arizona Law review and has been cited and followed in United States Supreme Court cases and law review articles.
- University of Arizona College of Law, Tucson, Arizona
- Honors: summa cum laude
- Honors: Order of the Coif
- University of Nevada
- Honors: With Distinction
Awards & Recognitions
Awards & Recognitions
- National Registry of Who's Who in America
- Order of the Coif
- Goldenkey National Honors Society
- Phi Beta Kappa National Business Honors Society
- Western Interstate Commission of Higher Education Award for Nevada, Army
Professional Memberships
Professional Memberships
Bar Admissions
- Nevada
- U.S. District Court District of Nevada
- U.S. Court of Appeals 9th Circuit
Professional Associations and Memberships
- American Bar Association, Member
- ABA Construction Industry Forum, Member
- Builders Association of Northern Nevada, Member


text:
Noida, India (PressExposure) July 02, 2013 -- SVKM's Narsee Monjee Institute of Management Studies (NMIMS) will conduct NMIMS Management Aptitude Test (NMAT) 2014 in almost one and a half month window beginning 5th October and ending 18th December 2013.
The registration for NMAT 2014 will open from 4th July for admissions in its School of Business Management for academic session 2014-16.
"The registration for NMAT-2014 opens from July 4, 2013. The registered applicants in NMAT 2014 shall be able to take online test in a window period of almost one and a half month from 05th October to 18th December 2013 with a choice of two more retakes after first attempt," the institute said. The last date of registration for NMAT 2014 is 24th September, 2013.
NMAT 2014 will be conducted at 18 centers located at Chandigarh, Delhi, Jaipur, Lucknow, Ahmedabad, Mumbai, Nagpur, Bangalore, Chennai, Cochin, Hyderabad, Bhillai, Bhopal, Indore, Bhubaneswar, Guwahati, Kolkata and Patna, NMIMS said.
The NMAT 2014 is the gateway for admission to NMIMS' 2-year full-time MBA, MBA(Banking), MBA (Capital Market), MBA(HR), & MBA(Pharmaceutical Management) at Mumbai campus and 2-year full-time PGDM at Bengaluru and Hyderabad campuses. About 69,000 candidates appeared for NMAT last year.
Students of foreign countries and Persons of Indian Origin (POI), however, need not necessarily appear for NMAT as they are allowed to apply to the NMIMS programmes with their valid GMAT scores.
In the cases of students availing retakes, the best of the scores would be considered for selection. Candidates can register online for NMAT 2014 on NMIMS University's website http://www.nmims.edu.
Announcing NMAT 2014, Dr. Rajan Saxena, Vice Chancellor, NMIMS said, "The resounding popularity of NMAT reflects the faith of a large pool of management aspirants in NMIMS Business School. The exemplary success of NMIMS in its journey of 32 years by now is based on its solid pillars of innovation, research, industry interface."
Narsee Monjee Institute of Management Studies (NMIMS) was established in 1981 to meet the growing demand for management education. In 2003, NMIMS was declared a deemed-to-be university. Presently, the institution boasts of more than 12000 students and 350 full time faculty members.
Stay tuned to MBAUniverse.com for more news and updates on NMAT 2014.


text:
Blood Functions: Distribution. Blood transports:Oxygen from the lungs and nutrients from the digestive tractMetabolic wastes from cells to the lungs and kidneys for eliminationHormones from endocrine glands to target organs. Blood Functions: Regulation. Blood maintains:Appropriate body temperature by absorbing and distributing heat to other parts of the bodyNormal pH in body tissues using buffer systemsAdequate fluid volume in the circulatory system.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


text:
Japan's exports rose in May at the fastest annual rate in more than two years with the help of a weak yen and a moderate pick-up in global demand, boding well for the government's efforts to steer the economy through market turbulence.
The faster-than-expected rise is welcome news for Prime Minister Shinzo Abe after recent a sell-off in stocks, volatility in bonds and a spike in the yen raised concerns about the outlook for his economic recipe of radical monetary easing, fiscal stimulus and pro-growth policies.
Calculated in yen, exports rose 10.1 percent in the year to May, compared with analysts' 6.5 percent forecast in a Reuters poll, rising for a third straight month and at the fastest pace since December 2010, finance ministry data showed.
The weaker yen also boosted the energy-heavy import bill, which rose 10 percent from a year earlier, leaving Japan with a 994 billion yen ($10.4 billion) trade deficit, but economists said the net effect of the yen's retreat remained positive.
They argue that higher export revenues translate into higher exporter earnings and consequently more investment and workers' bonuses, with indirect benefits for the broader economy even if costlier imports also affect businesses and consumers.
Given the blue-chip index in Japan's stock market is heavy on exporters, Abe's government also hopes that the export windfall will shore up general business and consumer confidence.
Keeping general sentiment buoyant is seen as crucial to spurring consumption and investment as policymakers aim to pull Japan out of its liquidity trap and end nearly two decades of economic stagnation and deflation.
"It is obvious (Abe's) policy mix played a big role in weakening the yen, which helped export value, earnings and the
stock market," said Takeshi Minami, chief economist at Norinchukin Research Institute.
Export Momentum to Pick Up
That is why analysts are not too concerned about the modest pace of recovery in export volumes, which remained 4.8 percent below year-ago levels, though the gap continued to narrow from a 5.3 percent drop in April and a 15.8 percent slump in February.
The yen lost over a fifth of its value against the dollar in the 12 months to the end of May and even after recent gains remains about 17 percent below year-ago rates at around 95 to the dollar, a level many Japanese companies say they feel comfortable with.
That and improved demand from Japan's top export markets make analysts optimistic that exports will continue to recover and the trade gap will narrow.
Exports to the United States rose 16.3 percent from a year earlier, the fastest pace since May 2012, while shipments to China rose 8.3 percent, the quickest pace since February 2011.
"We can certainly say that exports are headed in the right direction," said Shuji Tonouchi, senior fixed income strategist at Mitsubishi UFJ Morgan Stanley Securities.
"The breakdown shows that export volumes are still a little weak. Demand from the United States is doing well and Japan's trade deficit should eventually shrink."
The yen's retreat, combined with high costs of fuel Japan must import while its nuclear reactors remain idle since the
Fukushima disaster in March 2011, has kept Japan's trade in deficit for 11 straight months now.
At the same time, it has helped bolster Japan's hefty surplus on its overseas investment income, bringing its current account - the broad measure of trade flows and other transfers - back into the black.
Japanese financial markets have seen extreme volatility over the past few weeks on worries about reduced stimulus from the U.S. Federal Reserve, which caused the yen to bounce from a 4-1/2-year low against the dollar.
An underwhelming package of structural reforms unveiled by the Japanese government recently and concerns about slowing growth in China have also contributed to the tumult in markets.
With the heavy artillery of fiscal


text:
|Publication number
|Publication type
|Application number
|Publication date
|Feb 16, 1988
|Filing date
|May 28, 1987
|Priority date
|Feb 27, 1984
|Fee status
|Publication number
|Jo-Mei Chang, Nicholas F. Maxemchuk
|Original Assignee
|American Telephone And Telegraph Company, At&T Bell Laboratories
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (5), Non-Patent Citations (8), Referenced by (81), Classifications (4), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
This application is a continuation of application Ser. No. 584,100, filed Feb. 27, 1984, now abandoned.
This invention relates to communications arrangements and, more particularly, to multiple access digital communications systems, apparatus, and protocols for use therein.
In the early days of the telephone art, use of the telephone was often confined to communications among users within a local geographic area. As a result and over the years, the economies related to accessing a communications system have lead to telephones in a local area usually being interconnected through a central controller, often called a local central office in the art.
As digital computers came upon the scene, another local community of use was discernible. Hence, a central controller is commonly employed for interconnecting various user terminals. For example, U.S. Pat. No. 3,851,104; entitled "Digital Communications System" and issued Nov. 26, 1974; discloses a time division multiple access communications system which, under the control of a central terminal, provides communication links among a plurality of user terminals by way of a single communications signal path.
As the digital computer art advanced, parallel advances in the semiconductor art have lead to smaller, relatively inexpensive computers, commonly referred to as microprocessors. With the advent of such smaller computers, the technique of central control is being abandoned in favor of a distributed control technique which allows the distributed microprocessors to exercise more sophisticated communication control. Also, because of the usually bursty nature of digital information, the recent trend has also been toward communications systems having a capability for handling packets of digital information. One such distributed control communications system is disclosed in U.S. Pat. No. 4,063,220; entitled "Multipoint Data Communication System with Collision Detection" and issued Dec. 13, 1977. Indeed, U.S. Pat. No. 4,063,220 discloses a communications system in which, when a terminal is to start an intended transmission on a communications path, a phase decoder detects the presence of other transmissions on the path and, responsive thereto, delays the intended transmission until no other transmissions are sensed. Once a transmission has started, if an interference (or collision) therewith is detected, a random number generator is used to select an interval of time, at the completion of which a retransmission of the packet will again be attempted.
The single path of U.S. Pat. No. 4,063,220 is shared by all terminals (or stations or sites). Since all terminals share the single path, it is possible to transmit a message from one terminal to a plurality of terminals. Such a message is characteristically called a broadcast message. It should come as no surprise then that the art is looking for a reliable transmission protocol which can assure that all terminals, which are intended to receive a broadcast message, do indeed receive the broadcase message.
These and other problems are solved with the instant system, station apparatus and protocol which contemplate a primary receiver, also called a token site. The primary receiver is adapted to receive and store information messages transmitted from a source station to a broadcast group. The source would continue to retransmit the broadcast message until it receives an acknowledgment control message from the primary receiver. In the event some receiver(s) in the broadcast group do not receive the broadcast message, such receiver(s) could request a retransmission of the message. The primary receiver, not the source station, would retransmit the broadcast message, thereby assuring a reliable broadcast system. The token site function can be rotated among the various receivers in the broadcast group to reduce storage costs. The possible token sites are identified in a token list to which stations may be added or from which stations may be deleted. The token list is transmitted to all stations in the broadcast group to assure that no more than one token site exists at any instant of time.
The invention should become fully apparent when taken in connection with the following detailed description and accompanying drawing in which:
FIG. 1 illustrates an arrangement including a plurality of stations interconnected with a single communications path, which arrangement is useful in describing the principles of the invention;
FIG. 2 illustrates an information message packet format useful in describing the principles of the invention; and
FIG. 3 illustrates a control message packet format useful in describing the principles of the invention;
FIG. 4 illustrates in state form an interaction among a source, receiver, present token site and next token site and is useful in describing the principles of the invention.
FIG. 5 illustrates in state form a reformation aspect of the invention protocol and useful in describing the principles of the invention; and
FIG. 6 illustrates even further in state form a transition among sites according to the reformation aspect of the instant protocol.
Referring to the illustrative system structure shown in FIG. 1, which structure broadly parallels the structure disclosed in the aforecited U.S. Pat. No. 4,063,220, the teachings of which are herein incorporated by refrence, bidirectional communications signal path 10 is illustrated as extended between terminators 20 and 30 and through each of a plurality of cascaded transmission couplers such as passive coupler 40-i. Bidirectional path 10 may be, among other choices, a conventional high frequency coaxial or fiber optic cable. Each of terminators 20 and 30 may be a conventional impedance matching device for limiting reflections. Each of couplers 40-1 through 40-N may be a conventional T-connector which is insertable in path 10 so that each respective one of stations 30-1 through 30-N is coupled to the communications link thereby formed, the coupling being through the respective transmission coupler. In particular, on the one hand, coupler 40-i is for electrically coupling signals, representing, for example, information or control messages which signals are detected on communications path 10 and are to be coupled to, or received at, station 30-i. In that manner, station 30-i may read (or receive) signals on communications path 10. Thus the station is a " receiver". On the other hand, coupler 40-i is for coupling signals representing, for example, information or control messages, which signals are to be transmitted from station 30-i over communications path 10. In that manner, station 30-i may write (or transmit) messages on communications path 10. Thus the station is a "transmitter."
The structure illustrated in FIG. 1 need not include any electronics on path 10. Rather, the path could include only passive couplers. Thereby, the likelihood of the path becoming electrically opened is mitigated and its reliability increased.
Alternatively, electronic amplifiers and the like may be included on path 10 for amplifying and compensating the path signals, e.g., in a system, responsive to the detection of an electrical open or other failure, one or more stations may be adapted to insert electrical terminator(s) thereby forming two or more separate systems, each with a single path, to mitigate the deleterious effects of a failure.
Station 30-i may include transceiver 111 interface stage 115, and as a using device, station terminal equipment 127. In turn, terminal equipment 127 could include equipment such as a digital computer or a digital interface unit. The digital interface unit, for example, could be used for interconnecting path 10 with one or more other paths, some of the other paths perhaps being geographically distant from the instant path. It may be noted that the numeric designations for elements 111, 115, and 127 have correspondingly numbered elements in U.S. Pat. No. 4,063,220, incorporated above, and serve the same general function. In light of the availability of microprocessors, elements 111 and 115 are most advantageously implemented with such microprocessors to incorporate in transceiver 111 and interface unit 115 the control functions described below.
As an aside, it is common in the art that, when the stations are electrically relatively close to each other, e.g., within about two kilometers of each other, such an arrangement is referred to as, among other things, a local communications network or as a local digital loop or a local area network. Thus, in line with the structure illustrated in FIG. 1, a plurality of local networks may be interconnected for forming a still larger communications system.
As a further aside, itis well known that electrical signals, depending upon the electromagnetic transmission characteristics of the transmission medium, typically propagate on a communications path at a speed in the range 0.6 to 0.9 of the speed of light, which is estimated here to be about 186,000 miles per second. For ease of discussion, the estimated speed of light is here translated to an electromagnetic propagation speed of approximately one foot per nanosecond. Accordingly, it should be clear that path 10 may be busy at a station, e.g., at station 30-i, only while a packet is electrically being received or transmitted at the station; otherwise path 10 is not busy at least as to station 30-i. Thus, path 10 can be busy as to one station and not busy as to another station.
As will be made more clear shortly, the instant protocol contemplates two general types of packet, each general type contemplating one or more specific subtypes of packet. Here one general type is an information message and the other is a control message. For illustration, each packet is assumed to include a plurality of fields, each field including one or more bits. For example, referring to FIGS. 2 and 3, the two general types of packet may include a preamble field for timing and synchronizing, here shown as including eight bits, a destination station address field for identifying the called station, here shown as including eight bits, and a packet type field for identifying the general type of packet, here shown as including two bits.
As to the destination address field, it is contemplated that there will exist a plurality of terminals coupled to path 10, which terminals comprise a broadcast group. Further, there may exist a plurality of broadcast groups coupled to path 10 where each such broadcast group includes some predefined plurality of terminals. Each broadcast group has a unique destination address, which may also be called a broadcast address. The broadcast address is recognized by each terminal in the broadcast group so that each such terminal may adapt itself to receive information and control messages.
As to the packet type field, although other encodings are possible, the two bit field may be encoded with the following sense:
______________________________________Packet typeField Message Type______________________________________00 broadcast01 retransmission10 control11 None of the above______________________________________
An encoding of "11" could means for example a non-broadcast message, i.e. one intended for a single station. Indeed the field may use more than two bits to allow still other message types.
Now as to the other fields in a packet, FIG. 2 illustrates a first type of packet, i.e., an information message. Here we assume two subtypes of information message--one a broadcast message and the other a retransmitted message. Each information message further includes a source station address field for identifying the calling station, here shown as including eight bits, a source message sequence number for identifying within the source the specific message being transmitted, here shown as including eight bits, a data field for inserting the "information" to be transmitted, here shown as including a variable number of bits, and an error control field for checking the packet here shown as including eight bits. One error control field may include a well known cyclic redundancy code (CRC).
FIG. 3 illustrates a second type of packet, i.e. a control message. Each control message includes a control message type field for identifying a subtype of control message, here shown as including two bits.
As to the control message type field, although other encodings are possible, the two bit field may be encoded with the following sense:
______________________________________Control TypeField Message Type______________________________________00 Acknowledgment01 Retransmission request10 Confirmation11 Request for token list______________________________________
Indeed the field may use more than two bits to allow still other control types.
As to an acknowledgment control message, the control data field may include a source station address field for identifying the calling station, a source message sequence number for identifying within the source the specific message, a global timestamp for indentifying the specific message from among all messages in the system, the number of the present token site, the number of the present token list version, and the address of the next token site. For a more complete description of a global timestamp reference is made to L. Lampost, "Time Clocks, and the Ordering of Events in a Distributed System," Communications of the ACM, Vol. 21, No. 7 (July 1978) pp. 558-565. Also, a token can be embodied as an acknowledgment control message which does not acknowledge a broadcast message. In similar fashion, the communications related to out hereinafter described token reformation process can be embodied through similar encodings of an acknowledgment control message. The other fields will be made clearer hereinafter.
We are now getting closer to a more specific description of the instant protocol. However, on the one hand, consider a system with a plurality of sources, i.e. transmitters, and with a single receiver. The receiver can acknowledge each message received from each of the sources. Since there is only one receiver, the messages can be received in only one sequence. Therefore in such a system, a source could continue to transmit a message until the single receiver acknowledges that it has received the message. This system can be referred to as a positive acknowledgment system.
On the other hand, consider a system with a single source and with a plurality of receivers. The source can assign a unique source message sequence number to each message that it transmits. The source message sequence number then identifies within the source the specific message. As a result, each receiver can request message(s) which have not been successfully received by simply requesting that the source retransmit a message which is identified by its source message sequence number. The receiver can determine whether a message has not been successfully received by comparing the source message sequence numbers. For example, if a receiver has received message number 7 and message number 11 from some source, the receiver may readily be adapted to request a retransmission of message numbers 8, 9 and 10. In this system, a source does not have to retransmit a message unless and until the receiver requests the retransmission of the message. This system can be referred to as a negative acknowledgment system.
In a third system, the third system being in accord with the principles of our invention, a plurality of transmitters (i.e. stations) are intended to communicate among a plurality of receivers (i.e. stations).
In accord with one aspect of the principles of our invention, our system can be made to operate in such a manner that the resultant system looks like a system with a single transmitter. This can be accomplished by passing all messages through a primary receiver. The primary receiver function includes, among other steps, the step of assigning a special message sequence number, called a global timestamp, to each message. One result of this protocol is that all receivers are made to receive messages in the same sequence or order that messages are received at the primary receiver.
Recognizing that it may not be possible to verify that each receiver has received all messages, it may be necessary that broadcast messages be retained indefiniately for possible retransmission. Unfortunately such retention can lead to costly storage expense. Such deficiencies may be mitigated in accord to another aspect of the principles of our invention by rotating the primary receiver function among the different receivers in the respective broadcast group. Therefore, at one instant of time, there is one station in each broadcast group which acts as the primary receiver for the respective broadcast group.
The primary receiver function can be rotated, or passed or transferred, from one station to another station in either an explicitly defined way or in an implicitly presumed way. For example, a token may be passed from a present primary receiver to a next primary receiver. In such a case the primary receiver may also be referred to as the token site. Of course certain conditions precedent may be required before the primary receiver responsibility may be rotated. For example, it may be required that the next primary receiver have received all the globally timestamped messages before accepting the primary receiver function.
Now we get a bit more specific. Functions related to the instant system, station apparatus and protocol can be bifurcated as between a transmitter function and a receiver function.
As to a transmitter function within each station 30-i, the broadcast protocol is responsible for transmitting and retransmitting a message, i.e. an information message, until either the appropriate response message, i.e. control message, is received or it is concluded that the responding station is inoperable, e.g., at least, is not operating properly. On the one hand, when it is concluded that the responding station is inoperable, the transmitter initiates a token list reformation as is hereinafter described. On the other hand, the appropriate response messages include:
(a) On the one hand, when a broadcast message is transmitted, the transmitter expects an acknowledgment control message from the primary receiver, which primary receiver is also called the token site, after the token site receives the broadcast message. The broadcast message format may be in accord with FIG. 2 whereas the acknowledgment message format may be in accord with FIG. 3. On the other hand, the receivers in the broadcast group do not provide acknowledgment messages but rather function as in the aforedescribed negative acknowledgment system;
(b) When a receiver detects the event that it did not receive, or missed, a broadcast message, the station transmits a retransmission request message (FIG. 3). Upon the token site detecting the retransmission request, the missed broadcast message is retransmitted this time not from the original transmitting station but rather from the token site (FIG. 2); and
(c) When a token is passed from a present token site to a next token site, the present token site excepts a confirmation message from the next token site.
In addition to the foregoing functions and steps, our protocol contemplates the following functions and steps:
(a) If a transmitter receives an acknowledgment control message from a token site, the control message identifies a broadcast message by way of a global timestamp. If the global timestamp indicates that the broadcast message was transmitted subsequent to another broadcast message and an acknowledgment control message has not been received for the earlier message, it may be assumed that the earlier broacast message was not received at the token site and hence the transmitter may retransmit the broadcast message;
(b) If a transmitter expects a response control message from the token site but no response message is detected from the token site during some predefined time interval say T seconds, it may be assumed that the information message was not received at the token site and hence the transmitter may retransmit the message;
(c) If a transmitter expects a response control message from a token site but no response message is detected from the token site during some predefined number of retransmission attempts, say k attempts, it may be assumed that the token site is inoperable and that a token list reformation should be initiated as is hereinafter described; and
(d) If any message is detected from a token site, it may be assumed that the token site is operable.
So much for a more detailed description relating to the transmitter function within each station 30-i.
Turning now to a receiver function at each station 30-i, path 10 is monitored by the station so as to detect whether or not the station is or is not a destination station. On the one hand, if the destination address field of a packet indicates that the station is not an intended destination station, the message may be discarded. On the other hand, if the destination address field of a packet indicates that the station is an intended destination station, the message is read and placed into an input queue. Station 30-i is further adapted to process messages in the input queue and in the course thereof to move messages from the input queue to a respective one of three other queues:
(a) broadcast messages are placed in a broadcast queue, Qb ;
(b) control messages including acknowledgment messages, token confirmation messages, and retransmission request messages are placed in a control Qc ; and
(c) retransmitted messages destined for station 30-i as well as token list reformation messages are placed in a primary queue, Qp. Messages in the input queue are processed using the above steps before the same messages are processed within any of the other three queues.
On the one hand if any of the four queues into which a message is being placed is already full, that message is discarded. This discarding prevents the system from becoming deadlocked. For example, in the event that broadcast messages were allowed to fill both the input queue and the broadcast queue Qb, acknowledgment messages could not be received. In this event, the broadcast messages would not be removed from either of the queues. In parallel fashion, in the event that control messages were allowed to fill both the input queue and the control queue Qc, a retransmitted message, which might be required to process an acknowledgment message, might not be received.
On the other hand, when the input queue is empty, messages in the control queue Qc are processed if possible. After a message in the control queue Qc is processed, the input queue is examined to determine whether or not any new message has been received by station 30-i. If the input queue has a new message, the new message(s) is processed as aforesaid; else a next message in the control queue Qc is processed. Ultimately the control queue Qc becomes empty or becomes blocked. How the control queue may be blocked will soon be described. In the interim, the next message in the primary queue Qp is processed if there is such a message. Thereafter, the input queue is reexamined and the above steps are repeated.
As to the control queue Qc being blocked, blocking may occur, for example, when an earlier acknowledgment message is missing. A missing acknowledgment message means that a broadcast message must be retransmitted. Blocking may also occur when a new token list is being used. This latter point will be made more clear hereinafter.
In accord with the instant protocol as described, it becomes evident that the messages in the control queue Qc and the primary queue Qp are processed in the same order as those respective messages are received. Messages in the broadcast queue may be removed and processed within station 30-i concurrently with the processing of messages in the control queue Qc. This step enables an acknowledgment message to bypass a list of broadcast messages waiting to be acknowledged. This step also enables a retransmission message to bypass a list of acknowledgment messages.
Placing the acknowledgment messages, token confirmation messages, and retransmission request messages in the same control queue Qc results in the messages being ordered within the queue in the same order as they are received at station 30-i. As a result, the receiver function may readily determine which retransmission request messages should be responded to.
Also, placing retransmitted messages and token list reformation messages in the same primary queue Qp permits station 30-i to readily determine when a reformation has started. In such an event, the retransmission requests need not be processed, or replied to.
As mentioned, the messages in the control queue Qc are either token confirmation messages, acknowledgments, or requests for retransmission. We now described in more detail some aspects of the instant protocol with respect to these control messages.
A confirmation message is transmitted from the next token site to the present token site to signal, among other reasons, the present token site that the next token site is prepared to service retransmission requests. The "next" token site then becomes the "present" token site and processes, among other things, all retransmission request in its control queue Qc. That is, i.e. those transmission requests which are received between the transmitting of its configurmation message and the receiving of a next confirmation message from a still other next token site. The present token site services retransmission requests from the time it transmits a confirmation message until the next confirmation appears in its control queue Qc. If a token site misses a confirmation message, it is possible that more than one site may service retransmissions, however, this does not cause any confusion.
As is next described, acknowledgment messages are processed by all of the receivers. The acknowledgment messages are also used to assign timestamps to the broadcast messages, and to track the token site. A control message format is illustrated in FIG. 3. At a receiving site, each acknowledgement message is verified against local control information. The local control information includes a token list (which has the the token list version number, the present token site and list version number, the present token site and a list of operable sites in the broadcast group), a global timestamp of the last acknowledgment processed by the receiver site, and a list of source message sequence numbers correlated with the last timestamped message from each site.
The receiver is adapted to use the token site number and the token list version number from the acknowledgment message to determine if the acknowledgment is from the valid taken site. If the acknowledgment is not from the expected token site, either the acknowledging site or the receiving site is not using the correct token list. To solve this problem, our protocol contemplates that each time a new token list is formed, the token list version number is incremented. Therefore, by comparing the token list version number from the local control information with the token list version number field from the acknowledgment message, it can be determined whether the acknowledging site or the receiver has the most recent token list. Whichever site has an obsolete token list, requests and obtains a new token list before processing can continue. The next token site field tells the receiver the next site which will acknowledge a message. This next token site field may also be checked against the token list.
The acknolwedgment current being processed is called current acknowledgement. Since global timestamps increase incrementally, comparing the timestamp of the current acknowledgment with the timestamp of the last acknowledgment processed permits each receiver to readily identify missing acknowledgments. If the timestamp of the current acknowledgment is less than or equal to the last acknowledgment processed, it is a retransmitted version of a previously processed acknowledgment, and it is discarded. This type of acknowledgment can occur when a token site misses a confirmation message and trys to transfer the token again.
A broadcast message is not considered to be transmitted correctly until it is received and acknowledged by the token site. A source persists in transmitting a broadcast message until it receives an acknowledgment from the token site. Each time a source transmits a new broadcast message it increments its source message sequence number. Therefore the source message sequence number field of the acknowledgement message uniquely identifies the broadcast message to which the acknowledgment applies. Based upon the current acknowledgment, a receiver can adjust its broadcast message sequence. If a receiver missed a message that the token site acknowledged, the acknowledged broadcast message is not in the broadcast queue of the receiver. Hence, a request for the retransmission of this message is made. When the acknowledged message is in the broadcast queue of the receiver, the global timestamp of the acknowledgment is assigned to the message. Messages prior to it in the broadcast queue which have not been timestamped are discarded. The messages prior to the acknowledged message were missed by the token site and will have to be retransmitted by the source.
We now turn our attention even more specifically to the functioning of the token site. The token site is responsible for acknowledging broadcast messages and answering retransmission requests. It responds to a retransmission request by retransmitting the requested message. A broadcast message may be retransmitted, for example, because the transmitter missed the original acknowledgment. The broadcast messages in the broadcast queue Qb at the token site are sequentially acknowledged with an appropriate global timestamp. The token site can determine if a message is being retransmitted based on the source message sequence number of the last timestamp message from the source site. If a broadcast message in the broadcast queue Qb has previously been acknowledged, the token site retransmits the original acknowledgment. Broadcast messages, which have not been previously acknowledged, are acknowledged with an incrementally increasing global timestamp.
In one embodiment, the present token site transfers the token to the next token site as determined from the token list after acknowledging a predetermined number, say Kw, of broadcast messages. The present token site continues responding to retransmission requests until the confirmation message for the token transfer is received from the next token site. If the present token site misses the confirmation message, retransmission requests may be answered by more than one site. However, all sites which have accepted the token have the same set of messages, and the requesting site can simply discard the redundant answer.
A token site, among other steps, either processes acknowledgment messages as a normal receiving site or retransmits a confirmation message for the acknowledgment. If the acknowledgment is a new acknowledgment, the token site processes it as a normal receiving site. If the acknowledgment is a retransmitted acknowledgment, it indicates that a previous token site has missed the confirmation message for that acknowledgment. The appropriate confirmation message is retransmitted. A present token site, in this illustrative embodiment, acknowledges Kw messages before transferring the token to the next token site. Once the present token site trys to transfer the token, it does not acknowledge any more messages even if it does not receive a confirmation message from the next token site. Therefore, at most one token site will acknowledge any broadcast message.
FIG. 5 illustrates the aforedescribed interaction among the present site, the next token site, a receiver and a transmitter.
The token list is reformed when the set of operable sites in a broadcast group changes. However, in a loosely coupled, distributed system, linked by an unreliable communication channel, sites which have actually failed cannot be distinguished from sites which are too busy to answer communication messages or from sites which have missed the messages because of channel errors or buffer overflows. According to our protocol, a site is considered to be operable as long as other sites can communicate with it, and elicit a response. If a site is unable to obtain a response from another site after k attempts, that non-responding site is assumed to have become inoperable. Therefore, it is possible that a slow site may mistakenly be assumed to have failed. The value of k should be large enough that slow sites are not frequently assumed to be inoperable, but small enough to detect a failure in a responable amount of time.
Two types of token site failures are detected with our token passing protocol:
(a) A token site failure is detected when an acknowledgment cannot be elicited for a broadcast message or when retransmission of an earlier message cannot be obtained and
(b) A failure of a next token site is detected when a confirmation message for the token passing message cannot be obtained from the next token site.
When sites in the token list fail, the token list must be reorganized (or reformed) to remove any inoperable sites. The token list must be reformed when a previously inoperable site recovers and seeks to rejoin the token list.
Our protocol deals with the above-identified two types of token site failures and hence two types of token list reformation. Type I reformation occurs when the token site fails. The token is actually lost in this case. Type II reformation occurs when either the next token site is inoperable or a site seeks to rejoin the token list. The method for determining a new version of the token list differs for the two types of reformation. For Type I reformation, since the token is actually lost, a voting process must take place in order to form a new list. For Type II reformation, the new list is formed by adding a site to or deleting a site from the old list. After a new list is formed, it must be agreed upon and must be distributed to all operational sites. The design of our reformation protocol is complicated by the fact that during the token list reformation phase or reliable broadcast feature is not guaranteed and messages can be lost.
Broadly, the reformation protocol must tolerate any number of lost messages and must not be blocked by sites that fail after the reformation starts. To assure the correctness of the token scheme, it must also preserve two basic properties:
(a) Only one token can exist at a time and
(b) The global timestamps issued by the token site are unique and form an incrementally increasing sequence.
Our description of the reformation aspect of our protocol is conveniently organized in three phases:
Phase I: Form a new token list.
Phase II: Check the validity of the new list and obtain votes of agreement from members in the list.
Phase III: If a consensus is obtained, commit to the new token list and generate a new token.
The site which discovers a token site failure starts the reformation process and is called the originator. In Phase I, the originator forms a new token list. In a Type I reformation, the originator is the transmitter which detects the token site failure. The originator invites sites in the broadcast group to join its reformation group. In a Type II reformation, the originator is the token site. The token site forms a new token list by adding a site to or deleting a site from the old list.
In Phase II, the validity of the new list is checked. The validity check step guarantees that there exists only one valid list in the system at a time. This satisfies the requirement that only one token can exist at a time. The validity check step guarantees that the list has the information regarding the last assigned timestamp in the system. This satisfies the requirement that the timestamps issued by the token site are unique and form an incrementally increasing sequence. One valid list is guaranteed by requiring that a valid list have a combination of sites which only one list can obtain. For example, only one list can obtain a majority of the sites if each site can only join one list. The second requirement is satisfied by requiring that a valid list contain sites which are capable of determining the token information. The requirement for a valid group will be elaborated on in the next section.
If a valid group is not formed, the originator releases the sites in its reformation group. The reformation process will again be initiated by some, perhaps other, site. This is repeated until a new token site is in charge. If a valid group is formed the originator transmits a copy of the new token list to all of the sites in the broadcast group. Each site acknowledges the list. However, it is possible for a member in the group to reject the new list because it timed out before it received the list. To guarantee that the reformation process does not become blocked when the originator fails, a site can leave a reformation group after a timeout. The timeout occurs when no messages are received from the originator during some specified time period. Such a site is free to join another reformation group. Because of the timeout a site may join more than one group. Phase III is needed to prevent both groups from considering themselves valid because of an overlapping set of sites.
In Phase III, if a unanimous vote regarding the new list is obtained, the originator generates a new token and passes it to the new token site. On detecting this message, all of the sites commit to the new token list. If a unanimous vote is not obtained, the originator releases the members in the group and abort the new list.
FIG. 5 illustrates in summary form the three phase protocol for a reformation process.
FIG. 6 illustrates a corresponding state transition of a member site during the reformation protocol. Each site has four states: S0 (initial state), S1 (when X1 is received), S2 (when X2 is received), S3 (when X3 is received). At S0 the site has the old token list, at S1 the site joins a reformation group, at S2 the site is prepared to commit to new token list, and at S3 the site commits to the new token list. When broadcast release message Er is received in S1 or S2, the site aborts the new list. If no site failure or message loss occurs, all sites will commit or abort the new list unanimously. However, if an originator failure or lost messages causes a timeout, a member either commits or aborts the new list depending solely on its state.
if a site is in S1, it did not vote on the new list, therefore, the new list is not valid. The site abort the new list.
if a site is in S2, it is not able to determine whether the list is valid or not, but it will assume that it is valid and commit the list. The assumption prevents the situation where a group of such sites form another list from the old list when the new list is valid.
Note that different commit or abort decisions may be reached by different sites, however, a unanimous vote was not obtained in Phase II, hence a new token was not geneated. Since no site has the valid token, the reformation will be reinitiated. All sites eventually agree on one list. Since this does not violate the requirement that there exists only one valid token list and only one valid token when the reformation is complete, the different decisions reached by each site does not cause an error.
As a result of the aforedescribed protocol including the step related to the global timestamp, each and every receiver in the ssytem receives all broadcast messages in an identical sequence or order.
Although the invention has been described and illustrated in detail, it is to be understood that the above description is presented primarily for the purpose of illustration and example. For brevity, only some alternative modifications of the principles of the invention have been disclosed. Still other modifications of the principles of this invention will occur to those skilled in the art. Accordingly, the invention is not be be considered limited by the embodiments shown, but limited only to the appended claims.
|Cited Patent
|Filing date
|Publication date
|Jan 11, 1971
|Feb 6, 1973
|Dick Co Ab
|Address responsive controller for computer handling of peripheral equipment
|Jul 23, 1976
|Nov 15, 1977
|Fuji Electric Co., Ltd.
|Information transmission system
|Jul 17, 1978
|Apr 22, 1980
|Lowe Charles S Jr
|Hybrid control of time division multiplexing
|Aug 27, 1981
|Feb 7, 1984
|Burroughs Corporation
|Expandable and contractible local area network system
|Mar 9, 1981
|Jan 1, 1985
|Gould Inc.
|Multi-station token pass communication system
|Computer Communications, vol. 2, No. 5, Oct. 1979, "Survey of Computer Communications Loop Networks: Part 2", by B. K. Penny et al., pp. 224-241.
|Computer Communications, vol. 2, No. 5, Oct. 1979, Survey of Computer Communications Loop Networks: Part 2 , by B. K. Penny et al., pp. 224 241.
|David D. Clark et al., "An Introduction to Local Area Network", Proceedings of the IEEE, Nov. 1978, pp. 1497-1517.
|David D. Clark et al., An Introduction to Local Area Network , Proceedings of the IEEE, Nov. 1978, pp. 1497 1517.
|IEEE International Conference on Communications, Jun. 13, 1987, "Cablenet: A Local Area Network", by Isaac (Zak) Kong, pp. 6C2.1-6C2.5.
|IEEE International Conference on Communications, Jun. 13, 1987, Cablenet: A Local Area Network , by Isaac (Zak) Kong, pp. 6C2.1 6C2.5.
|IEEE Transactions on Communications, vol. Com 28, No. 4, Apr. 1980, Multiaccess Protocols in Packet Communication Systems , by Fouad A. Tobagi, pp. 468 488.
|IEEE Transactions on Communications, vol. Com-28, No. 4, Apr. 1980, "Multiaccess Protocols in Packet Communication Systems", by Fouad A. Tobagi, pp. 468-488.
|Citing Patent
|Filing date
|Publication date
|Aug 21, 1987
|Feb 21, 1989
|Naron Steven E
|Multicast data distribution system and method
|Jul 25, 1986
|Jul 4, 1989
|Systech Corporation
|Computer communications subsystem using an embedded token-passing network
|Aug 18, 1987
|Jan 30, 1990
|Allen-Bradley Company, Inc.
|Bit oriented communications network
|Jul 27, 1988
|Feb 13, 1990
|Hitachi, Ltd.
|A-point to multi-points communication system
|May 5, 1987
|May 15, 1990
|Ge Fanuc Automation North America, Inc.
|Multiple nodes broadcast communication method with receiver identification by bit position in transferred massage
|Jun 10, 1988
|Mar 5, 1991
|Irvine Halliday David
|Active star-configured local area network
|Nov 2, 1988
|Jul 30, 1991
|Tseung Lawrence C N
|Guaranteed reliable broadcast network
|Apr 11, 1990
|Aug 13, 1991
|Ncr Corporation
|Wireless information transmission system
|Nov 21, 1990
|Mar 17, 1992
|Concord Communications, Inc.
|Passive monitor for broadcast communication network
|Feb 27, 1990
|Apr 28, 1992
|Tseung Lawrence C N
|Guaranteed reliable broadcast network
|Aug 6, 1990
|Aug 4, 1992
|Digital Equipment Corporation
|Communications arrangement for digital data processing system employing heterogeneous multiple processing nodes
|May 22, 1990
|May 18, 1993
|Digital Equipment Corporation
|System and method for consistent timestamping in distributed computer databases
|May 23, 1990
|Jun 1, 1993
|The United States Of America As Represented By The Secretary Of The Air Force
|Reliable broadcast protocol
|Jan 30, 1990
|Jun 29, 1993
|Johnson Service Company
|Network control system and method
|May 7, 1991
|Sep 7, 1993
|Johnson Service Company
|Combined connectionless and connection-oriented network control system
|May 7, 1991
|Sep 28, 1993
|Johnson Service Company
|Network control system with improved reliability
|May 22, 1991
|Mar 8, 1994
|Kabushiki Kaisha Toshiba
|Method for adjusting curent clock counts in a distributed computer system
|Apr 2, 1993
|Aug 16, 1994
|Ncr Corporation
|Wireless local area network system
|Apr 15, 1994
|Nov 22, 1994
|Digital Equipment Corporation
|Boot system for distributed digital data processing system
|Dec 21, 1992
|Apr 4, 1995
|Motorola, Inc.
|Fault-tolerant method of communicating between processes in a multi processor system by keeping track of the current node location of messages
|Jan 6, 1993
|Jul 11, 1995
|British Telecommunications, Plc
|Data communication method and system
|May 31, 1995
|Dec 17, 1996
|Honda Giken Kogyo Kabushiki Kaisha
|Data transmission method and system therefor
|May 31, 1995
|Dec 9, 1997
|Honda Giken Kogyo Kabushiki Kaisha
|Data transmission method and system therefor
|May 31, 1995
|Jun 9, 1998
|Honda Giken Kogyo Kabushiki Kaisha
|Data transmission method and system therefor
|Jul 14, 1995
|Aug 11, 1998
|Microsoft Corporation
|Method and system for opportunistic broadcasting of data
|Jun 6, 1996
|Sep 22, 1998
|Software Ag
|System for allocating adaptor to server by determining from embedded foreign protocol commands in client request if the adapter service matches the foreign protocol
|Jun 7, 1995
|Jan 19, 1999
|Mci Communication Corporation
|Automated restoration of unrestored link and nodal failures
|Jul 1, 1996
|May 16, 2000
|Sun Microsystems, Inc.
|System for dynamic ordering support in a ringlet serial interconnect
|Jul 1, 1996
|May 16, 2000
|Sun Microsystems, Inc.
|System for maintaining strongly sequentially ordered packet flow in a ring network system with busy and failed nodes
|Jun 27, 1997
|Sep 5, 2000
|Sun Microsystems, Inc.
|Electro-optically connected multiprocessor and multiring configuration for dynamically allocating time
|Jun 19, 1998
|Nov 14, 2000
|Sun Microsystems, Inc.
|Hybrid queue and backoff computer resource lock featuring different spin speeds corresponding to multiple-states
|Dec 23, 1997
|Dec 12, 2000
|Unisys Corporation
|System for providing transaction indivisibility in a transaction processing system upon recovery from a host processor failure by monitoring source message sequencing
|Dec 11, 1998
|Jun 26, 2001
|Pittway Corporation
|Message repeating apparatus and method
|Apr 13, 1999
|Jul 31, 2001
|Glenayre Electronics, Inc.
|Method of multicast file distribution and synchronization
|Jul 24, 1997
|Dec 4, 2001
|Hewlett-Packard Company
|Ordered message reception in a distributed data processing system
|Apr 20, 2000
|May 7, 2002
|Sun Microsystems, Inc.
|Chain transaction transfers between ring computer systems coupled by bridge modules
|Apr 30, 1999
|Aug 20, 2002
|Microsoft Corporation
|Methods and protocol for simultaneous tuning of reliable and non-reliable channels of a single network communication link
|Jun 20, 2000
|Jun 10, 2003
|Sun Microsystems, Inc.
|System and method for accessing a shared computer resource using a lock featuring different spin speeds corresponding to multiple states
|Apr 30, 1999
|Jul 1, 2003
|Microsoft Corporation
|Network protocol and associated methods for optimizing use of available bandwidth
|Feb 25, 2000
|Jul 22, 2003
|Sun Microsystems, Inc.
|System for dynamic ordering support in a ringlet serial interconnect
|Feb 20, 2002
|Feb 22, 2005
|Sun Microsystems, Inc.
|Electro-optically connected multiprocessor configuration including a ring structured shift-register
|Jun 30, 1999
|May 3, 2005
|Nortel Networks Limited
|System, device, and method for address reporting in a distributed communication environment
|Jul 29, 2003
|Aug 9, 2005
|Eternal Systems, Inc.
|Consistent message ordering for semi-active and passive replication
|Jun 30, 1999
|Dec 27, 2005
|Nortel Networks Limited
|Decentralized management architecture for a modular communication system
|Oct 12, 2004
|Apr 10, 2007
|Nortel Networks Limited
|System, device, and method for address reporting in a distributed communication environment
|Aug 31, 2000
|Jun 10, 2008
|Sharp Laboratories Of America, Inc.
|Efficient and reliable transmission via a hybrid broadcast-point-to-point system
|Aug 4, 2000
|Dec 29, 2009
|Advanced Micro Devices, Inc.
|Implementing locks in a distributed processing system
|Dec 21, 2005
|Apr 26, 2011
|Trend Micro Incorporated
|Configuration of devices using layer 2 protocol
|Jul 9, 2009
|Nov 1, 2011
|Itt Manufacturing Enterprises, Inc.
|Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation
|Apr 20, 2007
|Oct 23, 2012
|Fujitsu Limited
|Method and apparatus for communicating data and program thereof
|Mar 31, 2009
|Oct 30, 2012
|Software Ag
|Systems and/or methods for standards-based messaging
|Dec 7, 2010
|Apr 14, 2015
|Alcatel Lucent
|Method and apparatus for improved multicast service
|May 6, 2013
|May 3, 2016
|Microsoft Technology Licensing, Llc
|Data stage-in for network nodes
|Oct 14, 2003
|May 24, 2016
|Amazon Technologies, Inc.
|Method and system for reliable distribution of messages
|Feb 20, 2002
|Jul 11, 2002
|Sun Microsystems, Inc.
|Electro-optically connected multiprocessor configuration
|Feb 13, 2002
|Oct 17, 2002
|Wen Tong
|Partial puncture retransmission
|Jun 30, 1999
|Mar 20, 2003
|Da-Hai Ding
|Decentralized management architecture for a modular communication system
|Jul 29, 2003
|May 27, 2004
|Eternal Systems, Inc.
|Consistent message ordering for semi-active and passive replication
|Aug 10, 2004
|Apr 28, 2005
|Walbeck Alan K.
|Method and apparatus for power line exchange protocol
|Jun 26, 2003
|Sep 1, 2005
|Golikeri Sandeep P.
|System, device, and method for address management in a distributed communication environment
|Mar 3, 2005
|Sep 8, 2005
|Samsung Electronics Co., Ltd
|Apparatus and method for transmitting and receiving a data frame processing result in an OFDMA mobile communication system
|Apr 20, 2007
|Apr 3, 2008
|Fujitsu Limited
|Method and apparatus for communicating data and program thereof
|Mar 31, 2009
|Sep 30, 2010
|Software Ag
|Systems and/or methods for standards-based messaging
|Jul 9, 2009
|Jan 13, 2011
|Itt Manufacturing Enterprises, Inc.
|Method and Apparatus for Controlling Packet Transmissions Within Wireless Networks to Enhance Network Formation
|Dec 7, 2010
|Jun 7, 2012
|Yigal Bejerano
|Method And Apparatus For Improved Multicast Service
|May 6, 2013
|Nov 6, 2014
|Microsoft Corporation
|Data stage-in for network nodes
|May 17, 2007
|Apr 13, 2011
|Method and apparatus for communicating data
|Jul 17, 1990
|Jan 23, 1991
|BRITISH TELECOMMUNICATIONS public limited company
|Data communication method and system with cyclic sequence of acknowledgements
|Mar 5, 1991
|Sep 25, 1991
|Lone Wolf, Inc.
|Communicating system
|Mar 5, 1991
|Jun 15, 1994
|Lone Wolf Inc
|Communicating system
|Apr 17, 1991
|Oct 21, 1992
|Siemens Nixdorf Informationssysteme Aktiengesellschaft
|Procedure for the transmission of data to a plurality of stations
|Mar 14, 1997
|Sep 17, 1997
|Kabushiki Kaisha Toshiba
|Packet transfer method and packet transfer apparatus
|Mar 14, 1997
|Aug 27, 2003
|Kabushiki Kaisha Toshiba
|Packet transfer method and packet transfer apparatus
|May 27, 1998
|Dec 2, 1998
|Yazaki Corporation
|Communication method and communication system
|May 27, 1998
|Oct 15, 2003
|Yazaki Corporation
|Communication method and communication system
|Dec 18, 2002
|Jun 24, 2009
|Samsung Electronics Co., Ltd.
|Improving connection rate in wireless communication
|Apr 30, 2007
|May 28, 2008
|Fujitsu Ltd.
|Method and apparatus for communicating data and program thereof
|Nov 1, 1989
|May 17, 1990
|Tseung Lawrence C N
|Guaranteed reliable broadcast network
|Sep 28, 1990
|Apr 18, 1991
|Peerlogic, Inc.
|Pipes logical network
|Feb 26, 1991
|Sep 5, 1991
|Tseung Lawrence C N
|Guaranteed reliable broadcast network
|Jul 29, 2003
|Apr 22, 2004
|Eternal Systems Inc
|Consistent message ordering for semi-active and passive replication
|U.S. Classification
|International Classification
|Cooperative Classification
|European Classification
|Jun 3, 1991
|Fee payment
Year of fee payment: 4
|Jun 30, 1995
|Fee payment
Year of fee payment: 8
|Oct 28, 1996
Owner name: NCR CORPORATION, OHIO
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:AT&T CORPORATION;REEL/FRAME:008194/0528
Effective date: 19960329
|Apr 2, 1999
|Fee payment
Year of fee payment: 12