text:
SUPER-WELLESIAN to Play Chicago Fringe Festival, 9/4-7
After a successful run of SAMUEL BECKETT, ANDRE THE GIANT, AND THE CRICKETS, Hawkeye Plainview Productions reteams with multiple Jeff Award winning Oracle Productions' B*Sides program with SUPER-WELLESIAN at this year's Chicago Fringe Festival at the Early and Often Stage, 4751 N. Milwaukee for only three performances September 4 @ 10pm, September 6 @ 7pm, and September 7 @ 8:30pm . Directed by Christopher Marcum, who also stars as Orson Welles, the full original cast also includes David Coupe as Superman, Natalie DiCristofano as Lois Lane, Linsey Falls as original Superman announcer Jackson Beck, and Kevin Crispin as Martian actor Clark Marble. Tickets for SUPER-WELLESIAN are free at the door with a suggested donation and a one time purchase of a $5 Chicago Fringe button. Tickets can purchases in advance for $10.
Thoughtful and hilarious, SUPER-WELLESIAN is a pseudo-sequel to the story "Black Magic on Mars" appearing the DC comic book Superman #62, where the Man of Steel himself teams up with legendary actor and filmmaker Orson Welles to save the world from Fascist Martians. In this play, Welles and Superman reunite to record a radio dramatization of their intergalactic adventure. However, Mr. Welles discovers that Superman's real kryptonite may be naturalistic line deliveries.
The production team for SUPER-WELLESIAN includes: Rush Marler (scenic design), Chrystle Mormon and Natalie DiCristofano (costume design), Keith Gatchel (sound design), Kirk Jackson (assistant director/stage manager), Zack Meyer (fight choreographer), and James Errico (poster design).
Oracle B*Sides is an arts service initiative devoted to giving artists the opportunity to produce their work in Public Access Theatre. Groups of artists submit project proposals for consideration. Once accepted, Oracle provides space, production and fundraising mentorship, and technical resources at no cost to the visiting artists - on one condition: the piece is offered to the community for free through Public Access Theatre.
Hawkeye Plainview is a budding theater company devoted to dramatic explorations and mash ups of pre-existing characters, real or imaginary. "Hawkeye" refers to the lead character of THE LAST OF MOHICANS while "Plainview" refers to the surname of the explosive lead of THERE WILL BE BLOOD; both starring Daniel-Day Lewis. The name itself implies a sort of mash up of contradictory yet somehow linked characters. Other pre-existing characters that met up on the Hawkeye Plainview stage include: an Okapi and a Sasquatch; Samuel Beckett and Andre the Giant; Orson Welles and Superman.


text:
PRZOOM - /newswire/ -
Langenfeld, Germany, 2010/06/09 - Saltigo partner to agrochemical companies offering flexibility and reliability to meet customer needs - Berlin Exhibition Center, Hall 21, Stand E 1. FRA: DE Frankfurt: LXS
Saltigo GmbH, part of specialty chemicals group LANXESS, specializes in exclusive synthesis of chemical intermediates and active ingredients for the agrochemical and pharmaceutical industries and numerous sectors outside the life sciences field. Customers expect high levels of flexibility in production volumes and available capacity, particularly in custom manufacturing for companies in the agrochemical industry. Within the context of a successful market launch, demand for an active ingredient can quickly rise to 100 metric tons or more a year. In addition, the crop protection agent business is naturally subject to sharp seasonal fluctuations that producers also need to factor into the equation.
Wherever production planning can no longer meet customer demand for substances by using existing assets alone, intelligent, fast and cost-effective solutions are called for to ensure reliable supply. This was recently underlined by Dr. Uwe Brunk, head of the Agro & Specialty Chemicals business line at Saltigo, in his presentation Expanding capacity for agrochemicals at the second Strategic Production Management annual conference in Cologne.
Brunks case study included discussion of various options for expanding capacity in ongoing operations to achieve significant increases in capacity as soon and as cost-effectively as possible by using plant expansion projects in conjunction with process optimization. These kinds of capacity expansion can be achieved in various ways. As well as building new production facilities generally the most expensive and time-consuming alternative (modular) expansion or conversion of existing production areas is also a viable option. Temporary solutions are also possible, i.e. meeting an increase in demand of limited duration by integrating further, existing capacity.
The optimal strategy in many respects is often to expand ongoing operations, i.e. to increase existing production capacity. This provides a relatively fast and cost-effective means of creating the necessary capacity, frequently without having to go through complex approval processes. In addition, synergies can usually be harnessed with existing assets and infrastructures in areas such as facility management and logistics. On the other hand, this solution requires detailed planning, extensive experience and what is probably the most comprehensive degree of analysis. A balance always needs to be found between the shortest possible downtimes and the stability of the production process needed to ensure reliable supply at all times and to therefore minimize risks for customers. For this to work effectively, it is important to work with the customer in order to estimate the anticipated development in demand during the expansion project as accurately as possible. At the heart of all such projects is a continuous improvement process with defined milestones that can be used to ensure reliable control of all changes occurring during implementation of a project. This also includes the forward-looking development of alternative / fallback scenarios to ensure unforeseen events, too, do not lead to unforeseeable consequences. Professional project and resource management and the smallest number of interfaces, clearly defined, are key factors for success.
Saltigo has many years of experience with such projects and processes and leverages this experience to serve its customers from the agrochemical industry as part of a comprehensive range of services. As a premium supplier of a wide range of custom manufacturing services, the company focuses on the highest quality standards that go beyond the certification requirements of popular standards.
Saltigo GmbH (saltigo.com) is a leading supplier in the field of custom synthesis. The company of specialty chemicals group LANXESS belongs to the Advanced Intermediates segment, which achieved total sales in 2009 of EUR 1,104 million. Saltigo, headquartered in Langenfeld and with production facilities in Leverkusen and Dormagen, employs around 1,400 staff worldwide. LANXESS Corporation (lanxess.com) operates a site for Saltigo in Redmond (Washington, United States).
Agency / Source: LANXESS
Availability: All Regions (Including Int'l)
Traffic Booster: [/] Quick PRZOOM - Press & Newswire Visibility Checker
Distribution / Indexing: [+] / [Company listed above is a registered member of our network. Content made possible by PRZOOM / PRTODAY indexing services]

subset: commoncrawl


text:
The United States Supreme Court recently held that a trademark infringement plaintiff's broadly worded covenant not to sue, issued after its competitor brought an invalidity counterclaim, mooted the counterclaim under the voluntary cessation doctrine. The Court found that the covenant was so broad that neither the Court nor, apparently, the defendant, could conceive of a product that would infringe the trademark yet not fall within the covenant. It therefore affirmed the District Court's dismissal of the invalidity counterclaim.
In the case, Already, LLC dba YUMS v. Nike, Inc., 568 U.S. ____ (January 9, 2013), Nike filed a suit alleging that YUMS's athletic shoes violated Nike's Air Force 1 trademark. YUMS denied these allegations and filed a counterclaim challenging the validity of Nike's trademark. Eight months after filing suit, and four months after YUMS counterclaimed, Nike, stating that "[YUMS]'s actions . . . no longer infringe or dilute the NIKE Mark at a level sufficient to warrant the substantial time and expense of litigation," issued a very broadly worded "Covenant Not to Sue" covering YUMS's existing products or any future "colorable imitations." Nike then moved to dismiss its claims and the counterclaim on mootness grounds. The District Court dismissed Nike's claims, and, over YUMS's objection, the counterclaim as well. On appeal, the Second Circuit affirmed. The Supreme Court affirmed, holding that the case was moot under the voluntary cessation doctrine.
The Court's decision likely has broad application to all intellectual property cases. It means that an IP rights holder can sue one of its competitors for infringement, and thereby inflict the burden and expense of litigation on its adversary, but then moot the case if the adversary fights back by counterclaiming for invalidity. In order to pursue this strategy, however, the rights holder must risk weakening its IP by issuing an extremely broad covenant not to sue, and may expose itself to a potential claim for attorneys' fees.
After issuing the Covenant Not to Sue, Nike moved to dismiss on the ground that the covenant had extinguished the case or controversy. YUMS opposed dismissal of its counterclaim, arguing that Nike had not established that its voluntary cessation had mooted the case. In support, YUMS presented evidence that YUMS had plans to introduce new versions of its shoe lines into the market, that potential investors would not consider investing in YUMS until Nike's trademark was invalidated, and that Nike had intimidated retailers into refusing to carry YUMS's shoes. The District Court dismissed YUMS's counterclaim on the ground that YUMS had the burden of showing that the court had jurisdiction over its declaratory judgment counterclaim, and had presented no evidence that YUMS sought to develop any shoes not covered by the covenant. Therefore, there was no longer a "substantial controversy . . . of sufficient immediacy and reality to warrant the issuance of a declaratory judgment" within the meaning of the Declaratory Judgment Act, 28 U.S.C. § 2201 et seq.
The Second Circuit affirmed, finding that because the covenant covers "both past sales and future sales of both existing products and colorable imitations," it was hard to imagine a shoe that would infringe the Air Force 1 trademark yet not fall within the covenant. Because YUMS had not asserted any intention to market any such non-covered shoe, YUMS could not show any continuing injury. The Second Circuit held that no justiciable controversy remained.
The Supreme Court decided the case on the basis of Article III standing. Article III of the Constitution grants the federal judicial branch authority to adjudicate "Cases" and "Controversies." Litigants must demonstrate "a personal injury fairly traceable to the defendant's allegedly unlawful conduct and likely to be redressed by the requested relief," in order to establish standing to sue or maintain a claim in federal court. The Court has recognized "that a defendant cannot automatically moot a case simply by ending its unlawful conduct once sued," "[o]therwise, a defendant could . . . stop when sued to have the case declared moot, then pick up where he left off, repeating this cycle." Thus, a defendant claiming that its voluntary cessation moots the case must show that it is "absolutely clear the allegedly wrongful behavior could not reasonably be expected to recur."
The Court found that Nike's Covenant met the burden imposed by the voluntary cessation test because it: (a) was unconditional and irrevocable; (b) prohibited any claims or demands; (c) reached YUMS's distributors and customers; and (d) covered not just current or previous designs, but any "colorable imitations" produced or used in commerce after the effective date of the Covenant. The Court agreed with the Court of Appeals that it was hard to imagine a scenario that would potentially infringe Nike's trademark, yet not fall under the Covenant. "If such a shoe exists, the parties have not pointed it out, there is no evidence that [YUMS] has dreamt of it, and we cannot conceive of it." This, and YUMS's failure to assert an intent to design or market a shoe that would expose it to any possibility of infringement liability, convinced the Court that it was "absolutely clear" that the activity could not reasonably be expected to recur.
Once this level of clarity was reached, the Court found that the fact that some individuals – the potential investors, for example – might base their decisions on speculation did not give rise to a "concrete" and "actual" injury as required for Article III standing. Further, even if Nike were harassing YUMS's distributors or customers, YUMS failed to explain how invalidating Nike's trademark would redress this conduct. The Court also rejected YUMS's argument that it had standing as a competitor in the athletic shoe market to challenge Nike's trademark. YUMS asserted that allowing Nike to moot the case unilaterally would encourage large companies like Nike to register invalid trademarks and intimidate smaller competitors, "avoiding judicial review by issuing covenants in the rare case where the little guy fights back." The Court rejected this "boundless" theory of standing and pointed out that, although YUMS's theory might aid the smaller party, "lowering the gates for one party lowers the gates for all." Thus, YUMS's theory would have provided standing to larger companies to challenge the trademarks of their smaller competitors, simply because they are competitors in the same market.
The most important lesson from the case may be found in the concurrence by Justice Kennedy (joined by Justices Thomas, Alito, and Sotomayor). Justice Kennedy warned that covenants not to sue should not be seen as an automatic "out" for a trademark holder facing an invalidity counterclaim. The trademark holder has the "formidable burden" to prove that it is "absolutely clear" that the assertion of trademark infringement is "not reasonably likely to recur." Nike's covenant was so broad that it was "inconceivable" that any of YUMS's future products might fall outside the scope of the covenant. A covenant of this breadth will moot the case at issue, but, as the Court points out, only at the risk of weakening the trademark and exposing the holder to a possible claim for attorneys' fees under the exceptional case doctrine of 15 U.S.C. § 1117(a).
The Court's decision is available here.


text: Dear Vec, It would make sense that a number of us ISPs and hosting companies got together and helped on of these antivirus initiatives. While we have no choice but to use a commercial antivirus product on our Web Hosting and email servers, some of our clients, such as the school (which is why I am investigating this) and non-profits cannot afford to buy these expensive products. They don't have to be REALLY great... but at least detect the most common virus going around and block/rename them. I looked at Openantivirus... runs in Java.... I can see performance going down the drain because the school's mail server is only a 586 with 128M (or was it 64M) of ram...and they also run a small internal website for teachers on it. So it obviously isn't any beefy server. Jason http://www.zentek-international.com/ ----- Original Message ----- From: "Vector" <email@example.com> To: "Jason Lim" <email@example.com> Sent: Friday, June 14, 2002 4:22 AM Subject: Re: Antivirus setup? > openantivirus is coming along nicely but not quite there yet. There are > plans to integrate it with amavisd; in fact I think they just had some kind > of joint conference, at least that's what I saw on their site. I thnk that > is the most promising but other than that you'll probably be hard pressed to > find anything that is very good. I've been strugglying for something > similar. My ISP's users are constantly infecting themselves as well. > > vec > > ----- Original Message ----- > From: "Jason Lim" <email@example.com> > To: <firstname.lastname@example.com> > Sent: Thursday, June 13, 2002 3:37 AM > Subject: Antivirus setup? > > > > Hi all, > > > > I was wondering if you guys know of any "open source" anti virus solution. > > > > I know about the ones that cost money, but I wonder if there is a good, > > production-quality, open source solution. Perhaps something even we can > > contribute to, so the virus signature database is expanded, etc. (but that > > certainly isn't a requirement). > > > > Failing that, any free solutions (a small secondary school needs this > > because their students keep on infecting their computers... we let our > > business customers handle it themselves on the client-side)? > > > > TIA. > > > > Jas > > > > > > > > -- > > To UNSUBSCRIBE, email to firstname.lastname@example.com > > with a subject of "unsubscribe". Trouble? Contact > email@example.com > > > > -- To UNSUBSCRIBE, email to email@example.com with a subject of "unsubscribe". Trouble? Contact email@example.com


text:
Most say culture is thriving, but also cite concerns
This is the first article in a series based on results from Gallup's Soul of the City survey in Moscow.
During Moscow winters, the nights are long and cold. And as recently as the early 1990s, the nightlife on streets of Moscow was just about as frosty. Since then, business development in the Russian capital has transformed these long, cold Moscow nights with the bright, glittering lights of movie theaters, opera houses, and other entertainment venues, not to mention fitness centers and retail, restaurant, and fast-food chains.
The city looks much nicer during the day, too. It's quite clean, and when the weather is suitable, lawns are green and neatly mown, and flowers and plants provide a handsome landscape for the city's more than 10 million residents.
Moscow Living: Past, Present, and Future
Perhaps some of these dramatic aesthetic changes, which happened quickly over the last decade and a half, were top of mind when Muscovites rated their satisfaction with their city in a recent Gallup Soul of the City poll*. Sixty-one percent of Muscovites say they are satisfied with the city as a place to live. A majority of Muscovites are satisfied, but they appear less fulfilled now than they were in 2003, when 79% reported being satisfied.
Twenty-eight percent of Muscovites say Moscow is the best possible city in which to live today. Nearly one in four Muscovites (23%) feel Moscow was the best possible city they could imagine living in five years ago. As is typically the case in ratings scales such as these, Muscovites are more optimistic about the future. A third (34%) report that Moscow will be the best possible city in which to live five years from now.
Quality of Life
Muscovites also rated specific elements of the city, giving some insights about why they rate Moscow highly as a place to live.
Moscow offers 156 dramatic theaters, 141 museums, 5 opera houses, 113 cinemas -- and the numbers are growing with the construction of multiplex cinemas. So it's no surprise that Muscovites are satisfied with the cultural opportunities their city provides, with nearly 9 in 10 people (88%) reporting cultural opportunities are good (with 58% saying "very good"). Muscovites' rating of the beauty or physical setting of Moscow is similarly high, as 86% rate the city's physical setting as good -- virtually unchanged since 2003. Culture and physical setting are attractive to tourists, and 80% of Muscovites rate their city as a good tourist destination.
While Moscow may have developed into a cultural epicenter, there are still problems. Safety is a concern of Muscovites -- only 22% feel the effectiveness of law enforcement is good, and despite the rise in entertainment opportunities, only 52% give a good rating to "having areas to go at night that are safe and fun."
Healthcare and air quality are also concerns. The numbers of Muscovites rating these two aspects of society as good are low: 22% for availability and accessibility of quality healthcare, and 16% for air quality. These numbers have also dropped since 2003, when 31% of Muscovites reported access to healthcare was good, and 22% reported air quality was good.
Although Muscovites' optimism about their city has endured since 2003, satisfaction has waned on several items. This could result from several factors. Days after two suicide bombers blew up two Russian airliners, terrorists bombed a Moscow subway station on Aug. 31, 2004, killing 10 and injuring scores of others. Although it took place far from Moscow, the Beslan hostage crisis began shortly thereafter, on Sept. 1. 2004. Hundreds of parents, teachers, and children were killed inside the school in Beslan, and the attack further heightened Russian concerns about safety. President Vladimir Putin has also recently initiated a number of unexpected political changes in Russia, creating a feeling of uncertainty among the citizenry.
But overall, Muscovites are proud of their city. More than three-quarters (77%) agree that they are proud to live in Moscow, including 59% who strongly agree.
Bottom Line
During the Cold War, Western media labeled Russia as an "evil empire" -- a name that paints a desolate, chilling picture. But with Moscow's beautified landscape, burgeoning business opportunities, and vast cultural offerings, Muscovites remain, for the most part, both proud and optimistic about their city.
*Results based on interviews with 1,008 Moscow residents, aged 18 and older, conducted in January and February 2005. For results based on this sample, one can say with 95% confidence that the margin of sampling error is ±3 percentage points.


text:
General aviation deliveries experienced an overall drop in the first quarter from the same period last year, according to numbers released last month by the General Aviation Manufacturers Association, but the decline was not as severe as that seen between 2008 and 2009, adding fuel to the speculation that the industry may have weathered the worst of the recent downturn. While overall deliveries were down 15 percent in the first three months of the year compared with the same period last year, industry billings rose more than 7 percent, from $4.33 billion to $4.64 billion, thanks largely to international deliveries of large-cabin, long-range jets. "These numbers are being released on the heels of the European Business Aviation Convention and Exhibition, where many of our manufacturers noted that the market seems to be stabilizing," said GAMA president and CEO Pete Bunce. "Reported flight activity from the FAA and Eurocontrol is on an upward trend and the used aircraft inventory is slowly decreasing. However, these first-quarter figures reveal that our industry is far from a recovery."
Manufacturers delivered 164 business jets in the first three months of the year–their lowest output since the first quarter of 2005–and a decline of approximately 14 percent over the same period last year. Yet despite the fall, deliveries were up for long-range aircraft such as Bombardier's Challenger 605 and Globals, Dassault's Falcon 7X and Hawker Beechcraft's Hawker 4000, while Gulfstream handed over only two fewer of its large-cabin jets. Both Airbus and Boeing delivered more bizliners this year than in the first quarter of last year, increasing their billings by $293 million and $52.5 million, respectively, year-over-year.
Overall, with the exception of Boeing, all the North American OEMs saw deliveries fall year-over-year, while Dassault–which more than doubled deliveries of its flagship 7X–saw its totals increase by nearly 55 percent over 1Q 2009 levels.
Embraer continued to ramp up production of its Phenom 100. Deliveries of the very light jet rose from six in the first quarter of 2009 to 16 in the same period this year, contributing to the manufacturer's 150-percent gain in deliveries.
The scales tilted in the opposite direction for Cessna, which delivered 21 Citation Mustangs in the first quarter of the year compared with 29 in the same period a year ago. The Textron subsidiary's earnings dropped from $557 million to $192.83 million. "All through the downturn everyone suffered to some extent, but it was the lighter business aircraft, the ones that are operated primarily by individual owner-operators, that really got hammered," said Raymond Jaworowski, senior aerospace analyst with Forecast International. "The economic recovery has been fairly sluggish so far; it's not surprising that the recovery in the business aviation market is also sluggish."
Bombardier posted modest increases in deliveries of its long-range aircraft in the first quarter, and its billings rose to $1.499 billion, an increase of $129 million over 2009's first-quarter total. While the Canadian manufacturer doubled deliveries of its Learjet 60XR from three to six in the first quarter of this year, it handed over only one Learjet 40/45XR compared with 14 in the first three months of 2009.
Hawker Beechcraft also saw a nearly 40-percent erosion in deliveries (jet and turboprop), handing over 27 aircraft in the first quarter of the year compared with 44 in the first three months of last year. King Air deliveries were slashed by more than half, retreating to 13 in the first three months of this year from 29 in the same period last year.
In total, pressurized turboprop deliveries fell by 47 percent to 35 aircraft from 66 in the first quarter of 2009. Piaggio, which delivered five Avanti IIs in the first quarter last year, handed over just one aircraft in the same time span this year. Single-engine turboprop producers Pilatus, Piper and Socata, which moved 32 aircraft in the first three months of last year, saw that total decrease to 21 through March of this year.
Piston aircraft continued their decline. In the first quarter last year 179 were delivered. The first quarter of this year saw a decline of 7.3 percent.


text: In today's Record-Eagle column, I ran a recipe for Slow-Cooker Vanilla Bean Tapioca Pudding. (I'll link to the full column when I'm back from vacation, but in the meantime the recipe is posted below.) Slow-Cooker Vanilla Bean Tapioca This pudding takes the perennial favorite tapioca pudding and dresses it up. Served warm, it'll heat you up from the inside out on chilly fall days. Using a real vanilla bean gives the pudding a sumptuous velvet-like texture and flavor. If you don't have access to vanilla beans, I weep for you, but you can still make a delicious version of the recipe by substituting for the beans with 2 teaspoons of View Post


text:
Here, the earth with its own compositions: the wheep-wheep-wheeps of
the American avocet;mirror-waters flushed by red-eared turtles; wind humming the black willow woodwinds;trumpet creepers' sirensong. Here in the realm of the swamp where light is anything
but still and my father's mother warned himnever enter, each whisper of his machete
promises the city of conquistadorspaved with gold cobblestones, rivers of liquid ivory, Ponce de Leon
and his crew aged not a day. Here, Shreveport, Louisiana, 1958, where instead of glory
he finds the cottonmouth hung like tinselwith the violet blooms of sharp-winged monkey flower, warming
its blood by those few rays of sunthat finger through the willows, my father approaching with grand
sweeps of his blade. Imagine that moment for the serpent, its sudden wakened eye
black as a poppy seed, then that banded machinery of scales,the clap of its jaw unhinged to action. Gravity holds little dominion over the dedicated body and it's almost comical
the way my father mimes how it struck, reaching slow-motion with his left arm,two fingers transformed
into fangs, his eyes and mouth growing into large Os as he twists away from the strike,
right arm swinging downjust in time through the air that here, in our living room—
another Christmas Eve, another birthday—is nothing more than air but in that swamp became a flickering: the reels of his future spinning before himlike wartime clips of men dropped toward France, their parachutes iridescent jellyfish in the night. There, in the swamp, he saw Vietnam bird's-eye-view from the pages of an Atlas: serpentine coastline of the South China Sea;
a row of bodies lined up along a dirt road;draft card a declaration of flame in his grasp. There, between
my father and the snake: a dreamy image of the day my sister would boltout the back door and he'd
search the neighborhood for hours, fearful he's lost her; two years later to the
AM of my birth, body blue and red with meconium and blood, the screams of this childfor once welcome,
skull warped with labor, gauzy as a milkweed's seed pod. The swamp will show you things. Then the machete and cottonmouth met, and the snake split in half, the blood of it splayedin meticulous
streams of black, the flat medallion of the wound like a plastic model of the cell: a nucleus of bonesurrounded by tissue, nerves, and chaos. Here he stands. Still. Shocked he cannot reverse
what he's done. Stop! his mind had ordered. But herethe mind holds little over fate. Here, had he stepped miles back with his left foot rather than his rightas he entered the sway
of black willows, he'd be the one clutching at his struck face, virustunneling the
chambers of his mind, swamp waters rising, and it would be the cottonmouth seeking another
tree trunk settled in the waters, certain in the ever-chambersof its mind of what it's done,
certain as the gold domed cells of black willows,as the kuk-kuk-kuks of herring
gulls— my father thinking of his mother who'd only taught him the little she
knewas he turns to hack that snake into its smallest parts, the ink of it spreading across the water's
surface. Retreating, he matches each footstep that brought him here and when he emerges
from that waving,unbalanced world, the hard-packed earth of the non-swamp holds everything higher
so that when he looks skywardthe barn swallows dip lower, wings fluttering, catching some air, then
resting again. My father not yet my father. The earth's slow turning.


text:
Radio-frequency identification tags store and wirelessly transfer data. Often used as an alternative to traditional barcodes, RFID tags provide data storage and communication in various contexts, including retail and industry. RFID printers produce RFID tags. An RFID tag can communicate stored data using either an electromagnetic field or radio waves. Many industries use RFID printing to produce RFID tags for such purposes as identification and tracking. RFID printers engage in the dual processes of printing and encoding.
RFID Technology
RFID technology dates back to the first half of the 20th century. Initially used in aircraft, the technology was later adapted for use in manufacturing and other industries. A typical RFID setup involves a chip and antenna, via which data is stored and transmitted. In some cases, for example where the data is transmitted over longer distances, an RFID chip may use a power source such as a battery.
RFID tags can be passive or active. Passive tags can receive and read data. Active tags can both send and receive. The printing process for an RFID tag involves traditional printing, in the sense that visual information is printed for display, often including a barcode and readable characters. However, RFID printing also requires data to be written to the electronic chip within an RFID tag, as part of an encoding process. RFID tags offer certain advantages over barcodes. Unlike barcodes, RFID tags do not need to be scanned within a particular line of sight.
RFID printers both encode and print data to RFID tags. RFID printers are sometimes referred to as printer-encoders for this reason, as the printing aspect is only one part of the process. The encoder in an RFID printer writes an item of data to the RFID chip. Often this data will be an identifying number, such as an Electronic Product Code. In many cases, the RFID printer will also write information to the exterior of the tag, with a label representing the data stored on the tag visually. Essentially, an RFID printer prints and encodes tags in such a way that they can then receive and transmit this data as part of an RFID system.
RFID printers provide tag printing and encoding for a wide variety of uses. Stock management is among the most common applications, from retail to the manufacturing industry. Rather than manually scanning barcodes for each inventory item, businesses can remotely track items that have RFID tags embedded in them. Some countries include RFID tags in their passports and other identity cards, as do certain organizations. Animals such as pets and farm livestock sometimes also have RFID tags implanted in them for tracking purposes, which can be particularly useful when pets go missing. Experimental projects have also explored implanting RFID tags in humans, although this use is still controversial.


text:
R. Kelly's name has been buzzing as details of the veteran R&B star's life will be on glaring display in an upcoming Lifetime biopic on late former protege Aaliyah. With the recent coming out announcement of his 13-year-old child, as transgender, the Chicago native spoke with a local radio station briefly about the matter.
Kelly was on his hometown's WGCI station backstage after its weekend Summer Jam concert, sharing a bit of his career arc and gushing over the adoration he received from the fans. But things took a dicey turn when Tony Sculfield's Morning Riot co-host Nina Chantele asked Kelly about his son, Jay.
"You don't really want to open this up with saying my daughter is becoming my son," said Kelly to the host. When Chantele tried to clear up any confusion by saying she was just quoting the blogs, Kelly took the high road but dodged the matter seemingly.
"Always believe what you see,with your own eyes that is. That's the best way to go about this business I've heard a lot of things about a lot of people and it was never true," added Kelly.
Sculfield interjected before the conversation totally derailed, bringing up rumors that Kelly lost his home. Kelly said that because of his divorce he sold his large home, calling it a "money furnace" in his own words.
But what was curious is that while stating proudly he's saved money by selling the home so that he can save money and send his children to college, he used the phrase "no matter what they are, what they are, they're still your kids."
"Even when you see it with your own eyes, you gotta know that there's a backstory. It's a background, that's why you can't judge nobody," said regarding his child. "I don't address that though. That's the thing. Why do you think I've been here for 27 years and still relevant? Because I don't address [BLANK] that's dumb. I don't do it."
What do you make of R. Kelly's comments on Jay Kelly? Check out the video clip below. That portion of the story begins at the the 3:43 mark.
Photo: Instagram


text:
Top Linksmain detailsbiographyby votesphoto galleryquotes
Filmographiesby yearby typeby ratingsby votesby TV seriesby genreby keyword
Did You Know?photo galleryquotes
Bob Dalton (Character)
from The Last Day (1975) (TV)
|Photos (See all 25 | slideshow)
Alternate Names:
FilmographyEdit Credits
- Belle Starr (1980) (TV) Played by Jesse Vint
- The Last Ride of the Dalton Gang (1979) (TV) Played by Cliff Potts
- The Last Day (1975) (TV) Played by Robert Conrad
- "Death Valley Days"
... aka "Call of the West" - USA (syndication title)
... aka "The Pioneers" - USA (syndication title)
... aka "Trails West" - USA (syndication title)
... aka "Western Star Theater" - USA (syndication title)
- Three Minutes to Eternity (1963) TV episode, Played by Forrest Tucker
- "Outlaws"
- The Daltons Must Die: Part 2 (1961) TV episode, Played by Larry Pennell
- The Daltons Must Die: Part 1 (1961) TV episode, Played by Larry Pennell
- The Dalton That Got Away (1960) Played by Félix Moreno
- "Tales of Wells Fargo"
- The Daltons (1959) TV episode, Played by Don Kelly
- Jesse James vs. the Daltons (1954) Played by James Griffith
- "Stories of the Century"
... aka "Legends of the Old West" - USA (DVD title)
... aka "The Fast Guns" - USA (reissue title)
- The Dalton Gang (1954) TV episode, Played by Myron Healey
- Montana Belle (1952) Played by Scott Brady
- The Cimarron Kid (1952) Played by Noah Beery Jr.
- Return of the Bad Men (1948) Played by Walter Reed
... aka "Return of the Badmen" - International (English title)
- Badman's Territory (1946) Played by Steve Brodie
- The Daltons Ride Again (1945) Played by Kent Taylor
- When the Daltons Rode (1940) Played by Broderick Crawford
- Beyond the Law (1918) Played by Emmett Dalton
Additional Details
Plot Keywords:
Fun Stuff
Bob Dalton: [Referring to Sundance] Why don't you get rid of him?
Wild Bill Doolin: He's a good man as long as you keep him in front of you.
See more »
You may correct errors and omissions on this page directly. Clicking the 'Update' button will take you through a step-by-step process.


text:
|Publication number
|Publication type
|Application number
|Publication date
|Jul 3, 2007
|Filing date
|Jan 29, 2001
|Priority date
|Mar 16, 2000
|Fee status
|Publication number
|Hilarie K. Orman
|Original Assignee
|Novell, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (22), Non-Patent Citations (11), Referenced by (35), Classifications (12), Legal Events (7)
|External Links: USPTO, USPTO Assignment, Espacenet
The present application claims priority to, and incorporates by reference, commonly owned copending application Ser. No. 60/189,829 filed Mar. 16, 2000.
The present invention relates generally to secure computer network communications, and relates more particularly to methods, articles, signals, and systems for allowing members of a trusted computing group to share cryptographic information which allows access to a specific computer network endpoint connection.
More and more confidential information is being kept on networked computers, and at the same time computers are becoming more connected. Computer networks often include a well-protected internal network joined to an uncontrolled network such as the Internet. The world-wide computer access now available is both exhilarating, because of the increased availability of information, and sobering because of the security risks inherent in so open a system. Ensuring the privacy, integrity and authenticity of data in these days of interconnected systems becomes ever more important.
One way to ensure security is to make use of trusted groups. A trusted group is a group of entities that have made mutual recognition agreements with each other. Sometimes an authority separate from the group itself, such as a Certification Authority (CA), makes decisions about who is to be trusted. CA's are often organized into trusted groups known as certification hierarchies. Once an entity is a member of a trusted group, it may safely share information with other members of its trusted group.
When cryptographic connections are established between network communication endpoints, state information (e.g., a security association, cryptographic context, security context, cipher suite, and/or the like) is maintained by each endpoint. For instance, such cryptographic state information is maintained by each endpoint in a connection across a firewall.
When one member of a trusted group has the cryptographic information for a connection, the other members of the group do not automatically have access to that information. But there are times when another member of the trusted group should receive access to the connection because the original entity is not available, such as when a proxy server becomes unavailable and another proxy server would replace it online. Within some existing systems the original cryptographic connection is lost when the original entity goes offline, and the tedious process of making a new safe cryptographic connection must be repeated to bring up a new member of the trusted group. An unencrypted connection could theoretically be used, putting a new machine online immediately, but since unencrypted connection information is quite vulnerable to theft and misuse that could breach security, this is often inadvisable.
Thus, it would be an advancement in the art to provide improved ways to efficiently allow members of a trusted computing group to share cryptographic information. For instance, to permit one endpoint to transparently share multiple computing entities in such a way that the other endpoint cannot distinguish between the multiple entities, it would be beneficial for the multiple entities to share their cryptographic context information. Moreover, because the other members of the group are known to be trustworthy, it would be beneficial to skip checks which must be performed when dealing with less-well-known entities.
Such improvements are disclosed and claimed herein.
The present invention relates to methods, articles, signals, and systems for allowing members of a trusted computing group to share cryptographic information which allows access to a specific endpoint connection. Members of the trusted group share knowledge of a secret value K, which is unknown to those not in the trusted group. When an entity within the trusted group establishes cryptographic connections, it encodes its name along with the secret value K into an identifier. Using the secret value K, other members of the trusted group can decode the identifier and identify the specific endpoint connection to gain access to the necessary cryptographic information to use or replace the securely connected entity. The identifier can be freely published with no danger of other non-trusted entities using it to gain access to the endpoint connection.
When cryptographic connections are established between endpoints, information such as a security association, cryptographic context, security context, cipher suite, or the like is maintained by each endpoint. It is assumed that all connections have some public identifier S that is unique at the endpoints, and that each secure connection has a unique key negotiated by the two endpoints. The full connection sharing identifier is carried in the headers of the network packets, and might be based on more than one header element. For IPSec (Internet Protocol Security), for example, it may be based on the IP address and the ESP SPI (Security Parameter Index). The Security Parameter Index is a number which, together with an IP address and security protocol, uniquely identifies a particular security association. When using IKE (Internet Key Exchange) to establish the security associations, the SPI for each security association is a pseudo-randomly derived number. Without IKE, the SPI is manually specified for each security association.
The IP address and the ESP SPI are not contiguous elements, but together they form a unique identifier. However, a part of the identifier that is crucial for the invention is unconstrained. For IPSec this can be the SPI; if SSL (Secure Socket Layer) is being used over TCP, the unconstrained element can be the TCP port number and part of the TCP sequence number.
There are instances where one member of a trusted group has a cryptographic connection to an endpoint and another member of the trusted group must also make a cryptographic connection to the same endpoint. Using methods and systems of the invention, another endpoint in a trusted group can make a secure connection to the same cryptographic endpoint that a first endpoint in the trusted group is connected to, using the same secure channel. This is accomplished by encoding in a public identifier one or more values which can be used, when decoded, to locate the cryptographic state information that is needed to make and/or use the connection.
In the illustrated situation, E1 100 has established a secure connection to G1 108, and they share cryptographic information 104. For another member of the trusted group 106 to subsequently establish a second secure connection to E1 100, the other member must have access to the cryptographic information 104. If the other member can learn the name of the entity that has the secure connection (i.e., G1 108 in this example), then the other member can request and receive (from G1 or another trusted source) a session key and/or other cryptographic information 104 for the connection to E1.
The present invention establishes a method and system, illustrated in
Each connection into the group 200 has a public identifier S that is unique at the endpoint member of the group, and each secure connection also has a unique session key negotiated by the two endpoints (e.g., negotiated by E1 and G1). A connection sharing identifier 204 is generated using a secret key K 202 which is shared within the trusted group 200 and unknown outside the group 200. The identifier 204 is used at the endpoints G1, G2, G3 as an index or pointer into a database, list, table, or similar data structure; the data structure entry provides the cryptographic information needed to process data on the connection. The data structure may be stored on one or more of the trusted group members, or in another secure location. Examples of cryptographic context include the algorithm(s) used for encryption (such as triple DES or Rijndael according to a FIPS standard) and the session key, Ks. Note that the session key Ks between endpoints such as E1 and G1 plays a different role than the secret value K 202 that is shared by the members of the trusted group 200.
The invention provides a solution to the problem that occurs when a member of the trusted group 200 gets a message with the public identifier S, but the member does not have the cryptographic database information associated with S. The trusted group member must be able to get the cryptographic information from another member of the group that does have it. If the trusted group member cannot get the information, then it cannot communicate securely with the other endpoint over the connection in question. In some cases, only the group member that originated the connection will ordinarily have the cryptographic information 104, as shown in
The trusted group member that needs the cryptographic context information 104 associated with S needs to know how to address the trusted member that does have the information, e.g. by knowing the name or IP address of that group member in association with the connection. This identifying information is encoded in the connection sharing identifier 204, using the group secret value K 202. The value K 202 allows the group members 206, 208, 210 to securely communicate between themselves the fact that a given group member holds or controls the cryptographic information 104 for a given connection.
The secret value K is generally agreed upon by the group members as part of their startup procedures and is stored in random access memory. One way to implement this is to have public key certificates available for each group member, and to use a leader selection protocol to elect a group leader. The leader gets the list of group members from a directory or configuration list and uses public key based authentication and encryption to authenticate each group member and to send each one an encrypted version of the group session key K 202. The secret value K 202 may be changed from time to time by the group leader.
More generally, the invention allows secure connections to any of a group of entities trusted to act as one cryptographic entity. In particular embodiments, the invention includes: encoding the identity of the original connection endpoint in a connection sharing identifier, such that the endpoint identity can be known by the trusted entities but cannot be determined by other entities that may have access to the connection sharing identifier; using the connection sharing identifier in establishing a secure channel between a trusted entity that needs to know cryptographic information C and the holder(s) of the information C; keeping the connection sharing identifiers unique under almost all foreseeable circumstances; and making the cryptographic information C available when the original information holder is not available. Other features and advantages of the invention will become more fully apparent through the following description.
To illustrate the manner in which the advantages and features of the invention are obtained, a more particular description of the invention will be given with reference to the attached drawings. These drawings only illustrate selected aspects of the invention and thus do not limit the invention's scope. In the drawings:
The present invention provides methods, articles, signals, and systems for sharing cryptography information among individual members of a trusted group. Members of a trusted group share knowledge of a secret value K, which is unknown outside the trusted group. When an entity within the trusted group establishes a cryptographic connection, it then encodes its own name along with the secret value K into a connection identifier (also called herein a connection sharing identifier or a connection entity identifier). Using the secret value K, other members of the trusted group can decode the connection identifier and gain access to the specific endpoint connection. The connection identifier can be freely published with little or no danger of non-trusted entities using it to gain access to the endpoint connection.
Separate figures discussed herein illustrate various embodiments of the present invention, but the discussion of a given figure is not necessarily limited to a particular type of embodiment. For example, those of skill will appreciate that the inventive methods may also be used in configured storage media and/or computer system implementations according to the invention. To prevent unnecessary repetition, the discussion of methods thus applies to articles and systems, and vice versa, unless indicated otherwise. It will also be appreciated that method steps or system components may be renamed, regrouped, repeated, or omitted, and that method steps may be ordered differently and/or performed in overlapping execution, unless the claims as properly understood call for particular steps or components and/or require a particular order of execution.
For the reader's convenience, some pertinent information on related technologies such as firewalls and cryptography is provided below. The invention goes beyond previously known technologies, but it may utilize earlier advances in computing and networking and/or be used together with such earlier advances.
Network administrators generally do not allow just any information into their system. Rather, they use a "firewall" to protect the network from security threats. A firewall is a hardware and/or software device that screens incoming messages (often based on content, origin, or nature of request) and only allows to pass those that are deemed safe. Three main types of firewalls are screening routers (also called packet filters), proxy server circuit-level gateways, and proxy server application-level gateways. Screening routers can base decisions on external information about a network packet such as its domain name and IP address, so messages that come from acceptable domain names and IP addresses can be allowed through. Proxy server circuit-level gateways disguise information about an internal system when passing the information to an external system. The IP addresses of the internal computers are typically replaced with the IP address of the proxy. At this level, authentication can be required. Proxy server application-level gateways provide all of the features of screening routers and circuit level gateways while also allowing the contents of the packets themselves to be evaluated. Messages can be rejected for content as well as for security violations. Furthermore, level 4 switching can direct an incoming network packet to one or more members of a group inside an organization.
Two types of standard cryptography are generally used; public (asymmetric) key encryption and symmetric key encryption. Symmetric key encryption uses a single key to both encrypt and decrypt a message. This key can be relatively large (e.g., 128 bits) but it must be kept secret, so it must be delivered separately from the message. The same key is used both to encrypt and to decrypt the message. Decryption using symmetric keys can be computationally very fast.
Public key encryption uses keys that do not all need to be kept secret. One common method uses a public key to encrypt a message, and a separate private key to decrypt it. The public key used to encrypt the message can be freely passed around, as having the public key alone will not allow decryption. The actual creation and decryption of a message is computationally intense, and so is relatively slow.
To speed up encryption and decryption, a temporary 'session key' is often generated; the session key is much shorter than the original keys. This session key is encrypted with the public key, and then is sent and decrypted using the private key. Rather then decrypting the message using the slow public key method, the message is decrypted by first decrypting only the session key with a public key method; the message body is then decrypted using the session key and a faster, symmetric key algorithm.
Other methods have been developed, such as Diffie-Hellman key exchange and a Massey-Omura cryptosystem, which do not require a private key to be passed between parties. Instead, the parties choose private keys, transform them into public keys, exchange those public keys and then decrypt the message using their own private key and the public key received from the other party. This is roughly analogous to putting a lock on a crate, sending it to a friendly party which puts his own lock on the crate, sends it back to you, you unlock your lock, leaving his intact, and then send the crate back to the recipient, who unlocks his own lock and opens the crate.
The present invention does not limit itself to a specific type of cryptography; any known or future method could likely be used. However, embodiments of the invention generally assume that cryptographic information C can be used to start several secure connections, each with its own state. It may also be assumed that each entity is contacted by the originating entity with an identifier for cryptographic information C only at the start of a connection. Examples may be seen in sessions for SSL (Secure Socket Layer) over TCP (Transmission Control Protocol) and IPSec (Internet Protocol Security) over IP (Internet packet protocol) and using IKE (Internet Key Exchange). SSL is a security layer (also referred to as a program layer) that sits between an application such as a web browser and the TCP/IP layers. TCP is more commonly called TCP/IP (Transmission Control Protocol/Internet Protocol) and is the basic communication protocol of the Internet. IPSec is a security standard at the network packet processing layer; it refers to both the Encapsulating Security Protocol (ESP) and the IP Authentication Header Protocol (AH). The IKE protocol uses digital certificates, for authentication. Digital certificates are digital documents that substantiate a claim that a particular public key belongs to a particular entity. One format for digital certificates is defined by the ITU-T X.509 international standard.
Systems Generally
As shown in
The network 300 may include Novell Netware� network operating system software (NETWARE is a registered trademark of Novell, Inc.), NetWare Connect Services, VINES, Windows NT, Windows 95, Windows 98, Windows 2000, Windows Me, LAN Manager, or LANtastic network operating system software, UNIX, TCP/IP and NFS-based systems, Distributed Computing Environment software, SAA software (VINES is a trademark of Banyan Systems; NT, WINDOWS 95, WINDOWS 98, WINDOWS 2000, WINDOWS ME, and LAN MANAGER are trademarks of Microsoft Corporation; LANTASTIC is a trademark of Artisoft; SAA is a mark of IBM). The network may include a local area network which is connectable to other networks 302, 304, including other LANs or portions of the Internet or an intranet, through a gateway or similar mechanism.
One system according to the invention includes several servers 306 that are connected by network signal lines 308 to one or more network clients 310. The servers and network clients may be configured by those of skill in the art in a wide variety of ways to operate according to the present invention. The servers may be configured as Internet servers, as intranet servers, as directory service providers or name servers, as software component servers, as file servers, or as a combination of these and other functions. The servers may be uniprocessor or multiprocessor machines. The servers 306 and clients 310 each include an addressable storage medium such as random access memory and/or a non-volatile storage medium such as a magnetic or optical disk.
Suitable network clients 310 and individual computers include, without limitation, personal computers 314, laptops 312, workstations, and (in the case of network) dumb terminals. The signal lines 308 may include twisted pair, coaxial, or optical fiber cables, telephone lines, satellites, microwave relays, modulated AC power lines, and other data transmission "wires" known to those of skill in the art, including wireless connections. Signals according to the invention may be embodied in such "wires" and/or in the addressable storage media.
In addition to the network client computers, a printer, an array of disks, and/or other peripherals may be attached to a particular system. A given computer may function both as a client 310 and a server 306; this may occur, for instance, on computers running Microsoft Windows NT software. Although particular individual and network computer systems and components are mentioned, those of skill in the art will appreciate that the present invention also works with a variety of other networks and computers.
Suitable software and/or hardware implementations of the invention are readily provided by those of skill in the art using the teachings presented here and programming languages and tools such as Java, Pascal, C++, C, Perl, shell scripts, assembly, firmware, microcode, logic arrays, PALs, ASICs, PROMS, and/or other languages, circuits, or tools.
Configured Media Generally
The servers 306 and the network clients 310 and individual computers 310, 312, 314 are capable of using floppy drives, tape drives, optical drives, removable media drives such as Iomega Zip drives, and/or other means to read a storage medium. A suitable storage medium includes a magnetic, optical, or other computer-readable storage device having a specific physical substrate configuration. Suitable storage devices include floppy disks, hard disks, tape, CD-ROMs, PROMs, RAM and other computer system storage devices. The substrate configuration represents data and instructions which cause the computer system to operate in a specific and predefined manner as described herein. Thus, the medium tangibly embodies a program, functions, and/or instructions that are executable by the servers and/or network client computers and/or individual computers to perform cryptographic information locating and/or sharing steps of the present invention substantially as described herein.
A member of a trusted group first gains 400 a secure connection to an endpoint 100. With respect to
The cryptographic content information 104 includes, but is not limited to, the information necessary to obtain and/or maintain the secure network endpoint connection. The information 104 may itself be encrypted, or it may not be. The cryptographic information 104 may be stored as a database or other data structure entry; the public identifier S known at the endpoints 100, 206 may be used as an index into that data structure. Without the invention, the other members of the trusted group would not know how to access the cryptographic information, and may not even be able to determine which one of the members of the trusted group possesses the network endpoint 100 connection in question.
All members of the trusted group can see the secret value K 202, however, which is not shared with others outside the trusted group. A preferred method of storing the secret value 202 is for each trusted entity to place it into volatile memory such as random access memory, though other locations are also possible. The secret value K 202 is agreed upon by the group members as a part of their startup procedures; one method involves having a public key certificate available for each group member. A conventional leader selection protocol is used to elect a group leader. The leader gets the list of group members from a directory or a configuration list and uses public key-based authentication and encryption to authenticate each group member and to send each one an encrypted version of the group session key K. The value K may be changed from time to time by the group leader.
With reference to
The invention assumes that each trusted entity has a unique identifier known to all entities in the trust group, which is referred to here as "secret value K" 202. The secret value K 202 is encoded with a "randomly" chosen value 504 and the name 502 of the member of the trusted group 200 that holds the secure connection, thereby creating the connection entity identifier 500. Using this connection identifier 500 another entity in the trusted group can gain access to the cryptographic information 104 needed to gain access to the network endpoint 100. The connection identifier 500 is encoded 404 by one of a variety of methods, and so can be seen safely in its encoded form by entities other than those in the trusted group.
The connection identifier 500 can be created 402 using a hash function 406, or an encryption function 408, or another known encoding method 404. A hash function, also sometimes known as a message digest, a fingerprint, or a compression function, applies a formula to a text string to generate a separate, replicable, value. A cryptographic hash function used in this invention should be one-way and relatively collision free. One-way hashes are very difficult to "invert" or turn around; that is, it is computationally infeasible to generate the original values when given only the output of the hash function. A relatively collision-free hash function almost always produces a unique hash value output for any input. A perfectly collision-free hash is called a "perfect hash" and is not used in the preferred implementation, although a strongly collision free hash (one in which collisions are unlikely and computationally manageable) is preferred.
Hash functions are explained in greater detail, in at least the book "Applied Cryptography" by Bruce Schneier, published by John Wiley and Sons, inc., 1994 on pages 28, 270–272, and throughout. One preferred hash function is SHA-1, described in ANSI-X90 pt. 2 Standard. Other one-way hashes such as MD5 and HAVAL can also be used. A key-dependent one-way hash requires a key for its computation, and also requires the key to verify the hash. The invention can be implemented using key-dependent hashes such as Block Cipher Mac with the secret value K used as the key; the secret value K plus a salt value can be used as the hash key, or the hash key can be some other combination of the secret value K and other values.
In a preferred implementation of the hash function, the random number 504 is bitwise-concatenated 600 with the secret value K 202 and with the name 502 of the entity that currently holds the secure connection, producing an intermediate value 602. Bitwise concatenation consists of putting the bit values next to each other, e.g., the bitwise concatenation of 11111, 000, and 1010 is 111110001010. The intermediate value 602 (the bitwise concatenation) is then hashed 604. The result 606 of the hash function is then bitwise concatenated 608 with the random number 504, thereby producing the connection entity identifier 500. Notice that in this embodiment of the invention, the random number 504 is used twice as an input.
Another method of generating the connection identifier 402 uses encryption. Symmetric key encryption uses a single key to both encrypt and decrypt a message. This key can be very large (often 128 bits), but can also be quite small. Such keys must be kept secret, and so must be delivered separately from the message. The same key is used both to encrypt and to decrypt the message. A preferred method of the invention uses symmetric key encryption.
Public key encryption uses one key to encrypt a message, and another key to decrypt. The public key is used to encrypt the message, and can be freely passed around, as having the public key alone will not allow decryption. A separate, private key is used to decrypt the message. The actual creation and deciphering of the message is computationally intense, and so is slow.
To speed up encryption and decryption, a temporary 'session key' is often generated which is much shorter than the original keys. This session key is encrypted with the public key, and then is sent and decrypted using the private key. Rather then decrypting the entire message using the slow public key-factor method, the entire message is then decrypted using the public key and the decrypted session key. The invention may use any of these methods, or other methods known in the art, to encrypt and decrypt the connection identifier.
A preferred embodiment using encryption to create 402 the connection identifier 408 is shown in
After the connection identifier is created, the creation identifier may be passed 410 to another member of the trusted group 200 that desires to gain access to the network endpoint 100. Notice that receiving the connection identifier does not depend on the original connecting entity being available, since the data structure containing cryptographic information 104 may also be stored elsewhere. The subsequently-connecting entity now decodes 412 the connection ID by decrypting it 414, by "dehashing" it 416 according to the methods described herein, or by using another known or inventive method corresponding to the creation encoding 404 method used.
A dehash method is further illustrated in
If the connection entity id 500 was originally created 402 by using the preferred encryption method 408, then the connection id is decrypted 414 using the secret value K 202 as the key. Then the random number 504 and the trusted entity name 502 are deconcatenated.
Once the trusted entity name 502 is known, the cryptographic information 104 can be accessed 418, and then used to establish 420 a secure connection between the secure network endpoint and another member of the trusted group.
Steps according to the present invention may be performed in an order other than that shown, may be performed concurrently, may be repeated, may be omitted, and/or may be renamed or grouped differently than shown, provided they accomplish the claimed process. For example, the random number 504 may be omitted in certain implementations. The encryption step 408 may be omitted in certain implementations (using only the hash step 406), in others the hash step 406 may be performed differently than shown, e.g., the random number may be concatenated to appear at both the beginning and the end of the intermediate value 602 that is hashed.
The methods discussed above can be used or embodied in a variety of systems, including the particular system which is shown in
An encoder 912 encodes the name of the originally-connected entity 900 and the value K 202 into a Connection Entity Identifier 500 that can be freely passed between members of the trusted group 900, 906 (even as plaintext in protocol messages on an unsecured network) without fear of disclosing confidential data, as only members of the trusted group can decode it. Some embodiments use a random number "salt" 504. Methods of encoding 404 the Connection ID 500 may use a hasher 914, as discussed in connection with
A Connection ID passer 910 passes 410 the Connection ID 500 to another member of the trusted group that will store it for later use and/or use it to gain access to the connection endpoint 100. A decoder 918 transforms 412 the Connection ID 500, using the shared secret value K 202, into the name of the trusted entity that possesses the secure connection endpoint. Some embodiments involve using an optional recoder 922 to create new test ID's by sequentially plugging the names of each other trusted entity 906 and the secret value K 202 into the formula used to initially create the Connection ID 500. One embodiment of the recoder 922 is illustrated in
Those of skill in the art will appreciate that the system shown is only one of many possibilities that embody the invention in that the system may have repeated elements, omitted elements, and differently grouped or named elements, in different embodiments of the invention. For example, some embodiments may omit the recoder and the tester. Other systems may omit the hash element 914 or the encryption element 916 of the encoder 912, while others may use multiple encoders 912 to make connection IDs that are more complex than the specific examples discussed here.
Use of a Connection Identifier as Part of a Public Protocol
Assume that trusted entities such as G1, G2, G3, as part of establishing a connection with a non-trusted endpoint, have the ability to choose a parameter that the remote endpoint must include in every communication. For TCP, such a parameter may be specified as the 16-bit port number or alternatively as the 32-bit data sequence number; for SSL over TCP, it is the 16-bit TCP port number or alternatively the 32-bit data sequence number; for IPSec, it is the 32-bit SPI (Security Parameters Index); for IKE it is the 64-bit "cookie". These are examples; other protocols will have different public values chosen by one endpoint and communicated to the other endpoint. These parameters are the connection identifiers 500 that the trusted entities manipulate as part of connection establishment, and it is these identifiers that the trusted entities can understand, even when the originating trusted entity (such as G1) is not the recipient of the protocol messages from the remote endpoint (such as E1).
If the output of the cryptographic method (hash function as illustrated in
When the cryptographic method uses a hash function, as illustrated in
When the cryptographic method uses a cipher, as illustrated in
Consider the case where the cipher produces 2n bits of output and the connection identifier 500 has only n bits. The plaintext input to the cipher is prepared and encrypted using the key K as previously described. The output cipher is 2n bits. To reduce the output's length, a first step uses the cipher and the key K to encrypt the sequence number or IP address of the remote endpoint in output feedback mode (OFB) with an initialization vector (IV) of zero to produce 8n bits of ciphertext. Because each encryption produces 2n bits, four steps are used to produce 8n bits, which is called the cipherstream.
Any reasonably secure cipherstream algorithm can be used to encrypt the plaintext data. As an example, the following method can be used: The first n bits of cipherstream (the high order bits of the 2n bit output block) is XOR'd with the plaintext data (which is n bits or fewer and is extended in its high order bits with zeroes to obtain n bits of plaintext). This value is subjected to a bitwise rotation of 5 bit positions leftward. The result is added to the n bits of cipherstream (the low order n bits of the first cipherstream block). This pattern is repeated, using subsequent cipherstream blocks, until all 8n bits of cipherstream have been combined with the initial plaintext. The final n bits of the computation are used for the n bit connection identifier 500.
Decryption involves generating the cipherstream as in the encryption case. The steps of the computation above are reversed, using the cipherstream in reverse order, and using subtraction instead of addition.
The plaintext cannot exceed the size of the connection identifier for the protocol being used. For most bases, typical uses will probably involve no more than 8 bits of identifier for the trusted entity. The "salt" and other inputs are adjusted to the space remaining in the connection identifier space for the protocol.
The security and correctness of this method depends in part on the size of the connection identifier field and the number of trusted entities. When the number of trusted entities becomes comparable to the square root of the number of unique values of the connection identifier field, one may extend the connection identifier field with the sequence number field.
For SSL used over TCP, which has a small connection identifier field, the high order bits of the sequence number field can be concatenated with the connection identifier to form an extended connection identifier. The trusted entity will form a 24-bit connection identifier during connection establishment and will use the 16-bit port number and the high order 8-bits of the sequence number to represent it as part of the TCP connection establishment. The bits of the port number (i.e. connection identifier 500) are concatenated with the upper 8 bits of the sequence number by members of the trusted entity group in order to decrypt or "dehash" the connection information. In order to avoid "wraparound" on the high order bits of the sequence number, the initiating trusted entity must ensure that the low order 24 bits of the sequence number are zero, and that the connection is reset before the sequence number would alter the high order 8 bits.
The present invention uses encoding functions to allow a secure connection to be safely passed on a public network between different entities of a trusted group even if the originally-connecting entity is no longer available. A value, known as secret value K, is known only to entities of a trusted group; the secret value K is used to encode the name of the trusted group entity that possesses the secure connection. Suggested methods of encoding use a random number seed and either a hash function or an encryption algorithm. The encoded name can then be made available for any entity that needs to gain access to the secure connection. Using the secret value K the entity name is decoded, and the cryptographic information that allows access to the secure connection can be securely accessed.
Although particular methods, systems, and signal formats embodying the present invention are expressly described herein, it will be appreciated that storage media embodiments may also be formed according to the signals, methods, and systems of the present invention. Unless otherwise expressly indicated, the description herein of methods, signals, and systems of the present invention therefore extends to corresponding storage media.
As used herein, terms such as "a", and "the" and item designation such as "entity" are inclusive of one or more of the indicated item. In particular, in the claims a reference to an item means at least one such item is required. When exactly one item is untended, this document will state that requirement expressly.
The invention may be embodied in other specific forms without departing from its essential characteristics. The described embodiments are to be considered in all respects only as illustrative and not restrictive. Headings are for convenience only. The scope of the invention is, therefore, indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
|Cited Patent
|Filing date
|Publication date
|Mar 7, 1989
|Apr 2, 1991
|Fischer Addison M
|Public key/signature cryptosystem with enhanced digital signature certification
|Nov 3, 1992
|Sep 20, 1994
|Novell, Inc.
|Method and apparatus for authentication of client server communication
|Jun 3, 1992
|Nov 29, 1994
|International Business Machines Corporation
|Multi-party secure session/conference
|Dec 9, 1993
|Jan 2, 1996
|Gte Laboratories Incorporated
|Method and apparatus for entity authentication
|Oct 26, 1995
|Nov 11, 1997
|Novell, Inc.
|Certificate revocation performance optimization
|Oct 23, 1995
|Jul 28, 1998
|Novell, Inc.
|Method and apparatus for collaborative document control
|Mar 15, 1996
|Oct 6, 1998
|Novell, Inc.
|System and method for automically authenticating a user in a distributed network system
|Nov 25, 1996
|Jan 5, 1999
|Xerox Corporation
|Space efficient method of redeeming electronic payments
|Oct 23, 1996
|Apr 6, 1999
|Novell, Inc.
|User presence verification with single password across applications
|Nov 14, 1996
|Jun 15, 1999
|Novell, Inc.
|Method and apparatus for proxy authentication
|Mar 15, 1996
|Aug 3, 1999
|Novell, Inc
|Controlled modular cryptography apparatus and method
|Aug 1, 1997
|Nov 23, 1999
|Novell, Inc.
|User name authentication for gateway clients accessing a proxy cache server
|Jan 27, 1998
|Jun 20, 2000
|Vpnet Technologies, Inc.
|Method and apparatus for managing a virtual private network
|Mar 16, 1999
|Jun 27, 2000
|Novell, Inc.
|Secure intranet access
|Nov 29, 1996
|Jul 18, 2000
|Kabushiki Kaisha Toshiba
|Packet authentication and packet encryption/decryption scheme for security gateway
|Aug 1, 1997
|Jul 18, 2000
|Novell, Inc.
|Method and apparatus for providing a virtual private network
|Oct 1, 1997
|Sep 12, 2000
|Novell, Inc.
|Distributed dynamic security capabilities
|Feb 7, 2000
|Apr 10, 2001
|Cisco Technology, Inc.
|Group key distribution
|Apr 17, 1998
|May 1, 2001
|Vpnet Technologies, Inc.
|Method and apparatus for configuring a virtual private network
|Nov 17, 1998
|Oct 30, 2001
|M-Systems Flash Disk Pioneers Ltd.
|Biometric system and techniques suitable therefor
|Nov 9, 1998
|Mar 2, 2004
|Vpnet Technologies, Inc.
|Method and apparatus for processing communications in a virtual private network
|Aug 30, 1999
|May 25, 2004
|Fujitsu Limited
|Security method, security software and security system for electronic communications
|"All About . . . PKI", www.entrust.com web site, pp. 1-3, no later than May 15, 2000.
|"Asymmetric Key Encryption", www.pbg.mcgraw-hill.com web site, pp. 1-2, no later than May 12, 2000.
|"Cryptography FAQ (06/10: Public Key Cryptography)", www.faqs.org web site, pp. 1-5, Apr. 24, 2000.
|"IBM AIX VPNs", www-1.ibm.com web site, pp. 1-7, no later than Jan. 23, 2001.
|"IPSec", www.cisco.com web site, pp. 1-14, Apr. 3, 2000.
|"What are the advantages and disadvantages of public-key cryptography compared with secret-key cryptography", www.rsasecurity.com web site, pp. 1-2, no later than May 15, 2000.
|Bruce Schneier, Applied Cryptography, Second Edition , 1996.
|Bruce Schneier, Applied Cryptography, Second Edition, 1996.
|Data Encryption Standard (DES), Federal Information Processing Standards Publication No. FIPS Pub 46-3, pp. 1-15, Oct. 25, 1999.
|William Stallings, "SNMPv3: A Security Enhancement for SNMP", www.comsoc.org web site, pp. 1-22, copyright 1998.
|Yinan Yang et al., "Tokens of Trust: Different Certificates for Different Trust Models", pp. 1-17, no later than May 12, 2000.
|Citing Patent
|Filing date
|Publication date
|Mar 25, 2002
|Nov 18, 2008
|Microsoft Corporation
|Method and apparatus for fault tolerant TCP handshaking
|Mar 30, 2005
|Nov 17, 2009
|Rockwell Collins, Inc.
|Method and apparatus for ad hoc cryptographic key transfer
|Dec 3, 2004
|Apr 6, 2010
|Nokia Corporation
|Apparatus and method for traversing gateway device using a plurality of batons
|Mar 29, 2006
|Oct 5, 2010
|Novell, Inc
|Remote authorization for operations
|Nov 16, 2006
|Jan 11, 2011
|International Business Machines Corporation
|Method and system for secure packet communication
|May 30, 2007
|Mar 15, 2011
|International Business Machines Corporation
|Device, method and program for providing matching service
|Feb 14, 2008
|Jun 7, 2011
|Rockwell Collins, Inc.
|High-order knowledge sharing system to distribute secret data
|May 30, 2008
|Jun 14, 2011
|International Business Machines Corporation
|Device, method and program for providing matching service
|Oct 31, 2007
|May 29, 2012
|Apple Inc.
|Systems and methods for encrypting data
|Feb 9, 2007
|Jun 5, 2012
|Qualcomm Incorporated
|Signaling with opaque UE identities
|Dec 28, 2010
|Oct 30, 2012
|International Business Machines Corporation
|System for secure packet communication
|Aug 30, 2010
|Dec 4, 2012
|Novell, Inc.
|Remote authorization for operations
|Sep 9, 2009
|Aug 6, 2013
|Fujitsu Limited
|Hardware trust anchor
|May 31, 2006
|Oct 1, 2013
|Microsoft Corporation
|Establishing secure, mutually authenticated communication credentials
|Apr 27, 2012
|Oct 15, 2013
|Apple Inc.
|Systems and methods for encrypting data
|Jan 27, 2012
|May 6, 2014
|Intuit Inc.
|Secure peer discovery and authentication using a shared secret
|Feb 9, 2007
|Oct 6, 2015
|Qualcomm Incorporated
|Obscuring temporary user equipment identities
|Sep 4, 2013
|Oct 13, 2015
|Microsoft Technology Licensing, Llc
|Establishing secure, mutually authenticated communication credentials
|Oct 9, 2014
|Jul 18, 2017
|Fujitsu Limited
|Detection of unauthorized entities in communication systems
|Mar 25, 2002
|Oct 24, 2002
|Thomas Kroeger
|Method and apparatus for fault tolerant TCP handshaking
|Nov 10, 2004
|Dec 22, 2005
|Sun Microsystems, Inc.
|Systems and methods for performing secure communications between an authorized computing platform and a hardware component
|Dec 3, 2004
|Jun 8, 2006
|Williams Michael G
|Apparatus and method for traversing gateway device using a plurality of batons
|Nov 16, 2006
|May 24, 2007
|International Business Machines Corporation
|Method and system for secure packet communication
|Feb 9, 2007
|Sep 20, 2007
|Tenny Nathan E
|Obscuring temporary user equipment identities
|Feb 9, 2007
|Sep 27, 2007
|Tenny Nathan E
|Signaling with opaque ue identities
|Mar 29, 2006
|Oct 4, 2007
|Novell, Inc.
|Remote authorization for operations
|May 31, 2006
|Dec 6, 2007
|Microsoft Corporation
|Establishing secure, mutually authenticated communication credentials
|May 30, 2007
|Dec 20, 2007
|International Business Machines Corporation
|Device, method and program for providing matching service
|Nov 21, 2006
|May 22, 2008
|Sprint Communications Company L.P.
|Unique compressed call identifiers
|May 30, 2008
|Oct 2, 2008
|International Business Machines Corporation
|Device, method and program for providing matching service
|Oct 31, 2007
|Feb 5, 2009
|Arul Selvan Ramasamy
|Systems and methods for encrypting data
|Aug 30, 2010
|Dec 23, 2010
|Novell, Inc.
|Remote authorization for operations
|Sep 9, 2009
|Mar 10, 2011
|Zhexuan Song
|Hardware trust anchor
|Dec 28, 2010
|Jun 16, 2011
|International Business Machines Corporation
|System for secure packet communication
|Jul 28, 2010
|Mar 17, 2011
|Fujitsu Limited
|Hardware trust anchor
|U.S. Classification
|713/169, 380/255
|International Classification
|Cooperative Classification
|European Classification
|Jan 29, 2001
Owner name: NOVELL, INC., UTAH
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ORMAN, HILARIE K.;REEL/FRAME:011488/0745
Effective date: 20010126
|Jan 3, 2011
|Fee payment
Year of fee payment: 4
|May 23, 2012
Owner name: CREDIT SUISSE AG, AS COLLATERAL AGENT, NEW YORK
Free format text: GRANT OF PATENT SECURITY INTEREST FIRST LIEN;ASSIGNOR:NOVELL, INC.;REEL/FRAME:028252/0216
Effective date: 20120522
Owner name: CREDIT SUISSE AG, AS COLLATERAL AGENT, NEW YORK
Free format text: GRANT OF PATENT SECURITY INTEREST SECOND LIEN;ASSIGNOR:NOVELL, INC.;REEL/FRAME:028252/0316
Effective date: 20120522
|Aug 24, 2012
Owner name: CPTN HOLDINGS LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:NOVELL, INC.;REEL/FRAME:028841/0047
Effective date: 20110427
|Aug 27, 2012
Owner name: APPLE INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CPTN HOLDINGS LLC;REEL/FRAME:028856/0230
Effective date: 20120614
|Nov 24, 2014
Owner name: NOVELL, INC., UTAH
Free format text: RELEASE OF SECURITY INTEREST RECORDED AT REEL/FRAME 028252/0316;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:034469/0057
Effective date: 20141120
Owner name: NOVELL, INC., UTAH
Free format text: RELEASE OF SECURITY INTEREST RECORDED AT REEL/FRAME 028252/0216;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:034470/0680
Effective date: 20141120
|Dec 10, 2014
|Fee payment
Year of fee payment: 8


text:
15 Chester Street, Winnipeg, Manitoba, R2L, Canada
Sir Sam Steele Elementary SchoolOld Sir SamÉcole élémentaire Sir Sam SteeleVieux Sir SamSir Sam Steele School
1921/01/01 to 1921/12/31
Sir Sam Steele School, a one-storey brick and concrete structure built in 1921 and later expanded, occupies a spacious yard on the corner of a major thoroughfare in a mixed-use area of northeast Winnipeg. The City of Winnipeg designation applies to the building on its footprint.
Sir Sam Steele School, an attractive Collegiate Gothic building, is a rare remaining example of a series of bungalow-style facilities built by the Winnipeg School Division in 1918-21 to house a fast-growing student population. The elongated one-storey structure, based on a standardized plan by J.N. Semmens that was used with slight variations for three new elementary schools in 1921, combines excellence in design with economy in construction and operation. Subdued yet dignified and demonstrably safe for its young charges, the building features exterior walls of red brick with contrasting limestone details, elegant Gothic porches, large classroom windows, well-placed corridors and doorways, and a layout suited to future expansion (aesthetically compatible wings added in 1957). Named after an early Canadian police and military figure, the school is a fine local landmark that also buffers an area of older modest houses from adjacent commercial development.
Source: City of Winnipeg Standing Policy Committee on Property and Development Minutes, November 25, 1997
Key elements that define the heritage character of the Sir Sam Steele School site include:
- the corner location at northeast Nairn Avenue and Chester Street on the periphery of an older residential neighbourhood
- the building's orientation, facing a treed boulevard and houses (west) and an open grassy playing field
- the grassed front yard, with large trees and a flagpole, and the fenced playing field
Key exterior elements that define the school's functional Collegiate Gothic design include:
- the long, low single-storey rectangular form, symmetrically composed
- the relatively smooth walls of variegated red tapestry brick that climb from a concrete foundation to a stone-capped parapet and flat roof
- the abundant fenestration, including tall flat-headed groups of multi-paned classroom windows with transoms and white-painted wood casings, smaller cloakroom lights, panelled wood and glass doors etc.
- the stately Gothic porches, adorned at the front (west side) with stepped gables, buttresses and double doors recessed in pointed arches of finely sculpted stone and angled brick
- the restrained yet attractive detailing, including the smooth-cut limestone base, upper belt course, coping, buttress offsets, front shields with Latin crosses, the stylized brick and stone parapet finials, etc.
- the 1957 end additions (north gymnasium, south classrooms) of sympathetic scale, materials and design
Key elements that define the school's interior character include:
- the 1921 layout of six classrooms off a double-loaded corridor, with offices, a library and washrooms on the ends and entrance halls running across for easy exit
- the durable, economical finishes, including dark wood trim, terrazzo floors, etc.
City of Winnipeg
City of Winnipeg Act
Winnipeg Landmark Heritage Structure
1957/01/01 to 1957/12/31
J.N. Semmens
15-30 Fort Street Winnipeg MB
325 Talbot Avenue, Winnipeg, Manitoba
Firehall No. 8, a 2 1/2-storey brick structure with a prominent side tower, constructed in 1906,…
212 Rue Dumoulin, Winnipeg, Manitoba
St. Boniface Fire Hall No. 1, a large brick structure built in 1907 and later expanded, is situated…
119 Sutherland Avenue, Winnipeg, Manitoba
The All People's Sutherland Mission, constructed in 1908-09, is a two-storey brick and stone…
Administered by Parks Canada


text:
Memolink is a free online shopping rewards network that allows you to earn cash back, Amazon Gift Cards, and other rewards for your everyday Internet activities including shopping at popular merchants and completing surveys.
New Memolink members can Get an Instant $5 Bonus just for joining Memolink and confirming your email address, plus you can earn extra rewards for referring your friends.
About Memolink
The Memolink cash rewards network operates on a points system where you earn points for visiting websites, shopping online, filling out online surveys, sampling products, and other online actions.
The points that you earn through the Memolink online rewards network can be redeemed for cash bonuses, gift certificates to a variety of merchants and restaurants, or charitable donations.
Memolink also offers you access to online store coupons, promotional discounts, and special deals on merchandise, travel, entertainment, and more savings.
The Memolink online rewards program is absolutely free to join, and you'll earn 8,000 registration bonus points just for joining Memolink and activating your new account via email, which takes just seconds.
You can also earn an extra 250 bonus points when you complete your profile after joining.
The Memolink Refer A Friend program also allows you to earn 5 bonus points for each new Memolink user that you refer, plus you'll earn 10% of your referral's shopping points for an entire year.
Memolink $5 New Account Bonus
New members can get a $5 Memolink Sign-Up Bonus just by joining Memolink and confirming your email address.
You'll get 8,000 bonus points when you join Memolink, which has a value of $5 toward a cash reward or gift card.
However, it's important to note that there is a 16,000-point minimum redemption rate for a $10 cash reward or a $10 gift card from Amazon.com, JCPenney, or other merchants.
That means you'll have to earn an additional 8,000 points by shopping, completing surveys, or performing other activities, before you can reach the 16,000 minimum points required to get a $10 reward.
So you'll get 8,000 points or $5 for free when you join, buy you'll have to reach the 16,000 point level before you can redeem your points for $10 cash back or a $10 gift card.
Memolink Referral Program
Once you create a free Memolink account, you can refer your friends to earn additional points.
You'll earn 5 points for each friend that you refer who successfully joins Memolink.
Plus, you"ll earn 10% of your referral's shopping points for a year.
You can access your unique referral link within your Memolink account.
Additional Cash Rewards Networks
Sign up for the free Ebates $10 Bonus Offer to get a $10 cash reward when you join the Ebates cash rebate network.
Earn the InboxDollars $5 Sign-Up Bonus for joining the InboxDollars free cash rewards network.
Take advantage of the Memolink cash rebate network to get cash rewards for your everyday Internet activities.


text:
Taking Australian performance to China
Australian theatre producer Barry Plews has been taking Australian work to China for 25 years. He formed a company called Reckless Moments back in 1989 with his co-producer Hu He and together they have completed 37 projects.
What does it take to work with China and what kind of Australian acts make it there?
- Barry Plews
- Founder of Reckless Moments
Further Information
- Producer
- Suzanne Donisthorpe
- Presenter
- Michael Cathcart


text:
|Trad, 1 pitch, 60'
|YDS: 5.6 French: 4c Ewbanks: 14 UIAA: V ZA: 12 British: S 4b [details]
|Aaron Martinuzzi, Jesse Ramos 2009
|New Route:
|Faces South
|Page Views:
|Submitted By:
|Aaron Martinuzzi on Sep 30, 2009
|Comments on 2 Minutes? That's IT?
|Add Comment
|Show which comments —
By Aaron Martinuzzi
Sep 30, 2009
Given the prominence of this crack, especially when viewing Green Mountain Pinnacle from the south, I feel like there's a good chance this line has been done before; then again, given its apparent OW nature, absence from both the old Rossiter and new Haas guides to the Flatirons, and crumbly-ness, I was inclined to think/hope I might be treading on new ground when I climbed this route today (and ogled it all summer).
If anyone knows a story behind this line that I'm not aware of, I'll happily give credit where it is due, otherwise I'm keeping ALL the glory for myself.
As for the name, I had some high expectations for this climb. First of all, I think it would be totally awesome to do alpine, hardman-style FAs, and I was sure this climb would be my first tutorial in the unexpected difficulties encountered on first ascents. Secondly, I was really hoping to battle in an offwidth, and though the crack was wide, it doesn't necessitate OW technique, and the pitch was pretty uneventful and painless. So, much like many people's "first time," your dreams don't always manifest themselves in reality.
By Tony B
From: Around Boulder, CO
Oct 1, 2009
|Well, not many people head up that side, and Jason and I didn't do it when we first did Faith and Resurection, so I suspect you have one on your hands there. There are a lot more to be had- very few of them are stunning, but there is a lot of rock in The Flatirons and it certainly hasn't all been climbed.
By Aaron Martinuzzi
Oct 1, 2009
|Cool Tony, good to know - I figured if it had been done & recorded by someone it would have been by you guys with F&R.
By Rick Blair
From: Denver
May 18, 2011
|I love the route description and the comment above as well, good stuff! You sucked me in with the opening sentence. Congratulations for putting your name on an FA in one of the most famous climbing areas in the country! Did you fight over who would get to lead it?


text:
AMD 100-505861 FIREPRO V7900 2GD5 PCIE 2.1 X16Item#: UMD-102324632 | Model#: 100-505861
Currently Out Of Stock!
You May Consider This Alternative
Additional Resources
Product Details
Additional Resources: Product Manuals
Related Items
Manufactured by: AMD
Warranty provided by: AMD
UPC No: 840777063637
Mfg Part No: 100-505861
Box Size:
( Length:15, Width:9, Depth:3)
Shipping Weight: 3.5000 pound(s)
Click here for full warranty and support information
- AMD logos are registered trademarks of AMD. All others trademarks and copyrights mentioned herein are the property of their respective owners.


text: Overview By Mayo Clinic Staff Print Specific phobias are an overwhelming and unreasonable fear of objects or situations that pose little real danger but provoke anxiety and avoidance. Unlike the brief anxiety you may feel when giving a speech or taking a test, specific phobias are long lasting, cause intense physical and psychological reactions, and can affect your ability to function normally at work, at school or in social settings. Specific phobias are among the most common anxiety disorders, and not all phobias need treatment. But if a specific phobia affects your daily life, several therapies are available that can help you work through and overcome your fears — often permanently. Request an Appointment at Mayo Clinic Symptoms & causes Oct. 19, 2016 Print Share on: FacebookTwitter References Anxiety disorders. In: Diagnostic and Statistical Manual of Mental Disorders DSM-5. 5th ed. Arlington, Va.: American Psychiatric Association; 2013. http://www.psychiatryonline.org. Accessed Sept. 2, 2016. Specific phobias fact sheet. National Institute of Mental Illness. http://www2.nami.org/factsheets/specificphobias_factsheet.pdf. Accessed Sept. 2, 2016. Gabbard GO, ed. Specific phobia. In: Gabbard's Treatments of Psychiatric Disorders. 5th ed. Arlington, Va.: American Psychiatric Association; 2014. http://www.psychiatryonline.org. Accessed Sept. 2, 2016. Specific phobic disorders. Merck Manual Professional Version. http://www.merckmanuals.com/professional/psychiatric-disorders/anxiety-and-stressor-related-disorders/specific-phobic-disorders. Sept. 2, 2016. What are anxiety disorders? American Psychiatric Association. https://www.psychiatry.org/patients-families/anxiety-disorders/what-are-anxiety-disorders. Accessed Sept. 2, 2016. Augustyn M. Overview of fears and specific phobias in children and adolescents. http://www.uptodate.com/home. Accessed Sept. 2, 2016. Sawchuk CN (expert opinion). Mayo Clinic, Rochester, Minn. Sept. 26, 2016. RelatedFear of public speaking: How can I overcome it? Specific phobiasOverviewSymptoms & causesDiagnosis & treatmentDiagnosisTreatmentPreparing for your appointmentSelf-managementMore aboutIn-DepthExpert AnswersResources Advertisement Mayo Clinic does not endorse companies or products. Advertising revenue supports our not-for-profit mission. Advertising & Sponsorship Policy Opportunities Ad Choices Mayo Clinic Store Check out these best-sellers and special offers on books and newsletters from Mayo Clinic. The Last Diet You'll Ever NeedNEW! Mayo Clinic Guide to Integrative MedicineStop Osteoporosis in its TracksMayo Clinic Health LetterThe Mayo Clinic Diet Book Diagnosis & treatmentRequest an AppointmentDiagnosisTreatmentPreparing for your appointment CON-20228093 Patient Care & Health Information Diseases & Conditions Specific phobias