text stringlengths 8 5.77M |
|---|
Miniaturization and increased processing power has recently allowed great increases in the portability of electronics. Complex devices have been reduced to pocket size. Consumers are able to carry and use wherever they desire such devices as cellular telephones, music players, game players, still and motion digital cameras, and GPS locators. Still, the size and form factor of the devices is often limited by the optical display because most devices currently use an inflexible glass optical display. Such displays are bulky, fragile, and difficult to replace when damaged.
To obtain even greater portability and avoid the drawbacks of glass optical displays, rollable displays have been developed. FIG. 1 is a front view of an exemplary use of a rollable display as disclosed in International Publication Nos. WO 2004/001704 A1 and WO 2004/031927 A2 to Bas J. E. van Rens, both entitled “Apparatus with Display” and both incorporated herein by reference in their entirety. In this embodiment, a rollable display 3 is unrolled from a housing 4,5 into the usable position illustrated. The mobile telephone 1 provides the input to the rollable display 3. In an alternative embodiment, the electronics providing the input to the rollable display, such as the mobile telephone or other electronics, is enclosed in one of the housings.
FIG. 2 is a cross section view of a rollable display device. The rollable display device 10 includes an inner housing 12, such as an inner cylinder, housing the electronics 14, and an outer housing 16, such as an outer cylinder, disposed about the inner housing 12. The wall of the inner housing 12 forms an inner slot 13 and the wall of the outer housing 16 forms an outer slot 17. A rollable display 18 includes a connection portion 20, a bend portion 22, a rolled portion 24, and an external portion 26. The rollable display 18 is connected to the electronics 14 by the connection portion 20, passes through the inner slot 13 at the bend portion 22, wraps around the inner housing 12, and exits the outer housing 16 at the external portion 26. In operation, the rollable display 18 is deployed for use by extending the rolled portion 24 through the outer slot 17. The rolled portion 24 is extended and retracted manually or by motor power.
One problem with rollable display devices is that the repetitive strain of rolling and unrolling the rollable display for use damages the rollable display. The rolled portion 24 typically makes a gradual, large-radius curve around the inner housing 12, so the stress and resulting strain is limited below a design threshold, preventing damage. A radius greater than 7 millimeters for a 100 μeter thick rollable display typically holds strains in the electrically active region of the rollable display below a 1 percent limit. However, the sharp bending of the display 18 at the bend portion 22 exceeds the design threshold and damages the rollable display 18 over time from repetitive strain. Examples of display failures include broken circuits, layer delamination, cracking, and buckling. Such failures may prevent the rollable display from rolling and unrolling, may reduce the image quality of the rollable display, or may prevent the rollable display from functioning. Excessive strain in the bend portion 22 may also interfere with the connection of the rollable display 18 to the electronics 14 at the connection portion 20.
FIG. 3 is a cross section view of a portion of a rollable display. In the example shown, the rollable display 30 includes a first layer 32, a second layer 34, and a third layer 36. Typically, the layers are laminated together to form the rollable display 30. The first layer 32 is typically a substrate for supporting the much thinner second layer 34, which is typically a fragile electronics layer. The third layer 36 is typically an electronic ink layer responsive to electrical charge from the second layer 34 to display text or graphical information to the user. The rollable display 30 has a neutral line 38, which is free of stress when the rollable display 30 is bent, such as when bending the rolled portion around the inner housing or the bend portion through the inner slot. The location of the neutral line 38 depends on the thickness and modulus of elasticity of each layer making up the rollable display 30. When bent, the rollable display 30 is in tension on one side of the neutral line 38 and in compression on the other side. Repeated cycling of the rollable display 30 to a radius smaller than the minimum design radius can result in failure of the rollable display 30. |
Dr. Marco Abbondanza, during his thirty-year career, has been interviewed by Italy’s most influential television programs, newspapers and magazines. In this section, however, we show Dr. Abbondanza’s scientific studies, published by major international journals and cited as a reference for other scientific studies by a number of ophthalmologists and other MDs from around the world. Select a publication to read it. |
Dental appliances, such as orthodontic retainers, dental aligners (such as Invisalign®, ClearCorrect™, and other brands), dentures, sleep apnea appliances, sports mouth guards, etc., are often worn anywhere from 30 minutes to 23 hours a day or longer and accumulate food particles, saliva, dead gingiva (skin), and other detritus. Over time (ranging from minutes to hours), the dental appliance begins to smell bad and discolor. Currently, oral appliance cleaners are designed for use outside the mouth and require the appliance dentures, retainers, mouth guards, etc.—to be soaked in the cleaning solution and sometimes cleaned in a sonic or ultrasonic cleaning device. Within 20 minute of being returned to the mouth, however, the appliance becomes dirty or contaminated again with food debris and microorganisms. A need exists for an oral appliance cleaner that can be used on the go, throughout the day if necessary, without requiring the appliance wearer to keep the appliance out of his or her mouth during the cleaning, process. |
Phytic acid in wheat bran affects colon morphology, cell differentiation and apoptosis.
Wheat bran (WB) and its component phytic acid (PA) have both been shown to decrease early biomarkers of colon carcinogenesis, i.e. the PCNA labeling index of cell proliferation and certain aberrant crypt foci parameters. However, it is not known how WB and PA alter other biomarkers of colon cancer risk, such as rate of apoptosis and degree of differentiation, or how they affect colon morphology. Thus, the objectives of this study were to determine the effects of WB on these parameters, to see if PA contributes to these effects and whether there is a difference between endogenous and exogenously added PA. Five groups of azoxymethane-treated male Fischer 344 rats were fed a basal control diet (BD) or BD supplemented with either 25% wheat bran, 25% dephytinized wheat bran (DWB), 25% DWB plus 1.0% PA or 1.0% PA for 100 days. The WB, DWB and PA diets significantly increased the rate of apoptosis and cell differentiation in the whole crypt and the top 40% of the crypt. The WB, DWB and PA diets also significantly increased cell apoptosis in the bottom 60% of the crypt, while all the treatment groups significantly increased cell differentiation versus the BD group in the bottom 60% of the crypt. In addition, the WB, DWB and PA diets decreased the number of crypts per millimeter of colon, while the DWB and PA diets also decreased crypt height measured as number of cells. It is concluded that WB, partly due to its dietary fiber and endogenous PA, and exogenous PA when added to a low fiber diet can increase cell apoptosis and differentiation and favorably affect colon morphology. |
“The taco shells were used for training in March before we launched a new product, and were in process of being thrown out,” the statement says. “Our first question was, were the taco shells served to customers? In short, absolutely not. The taco shells were sent to restaurants for training purposes before the new product launch, so team members could use them to practice making the new product before it became available to the public. These shells were a part of that training, were never intended to be served to customers, and were discarded. This is standard operating procedure, and our franchisee confirmed this protocol.”
The statement added that the franchisor “immediately suspended the employee shown in the photo and is in the process of terminating his employment.”
Better than rats or urine
The incident is actually less disturbing than Taco Bell’s past health-related scandals.
In 2007, a video captured rats running wild inside a Taco Bell-KFC restaurant in the Greenwich Village section of New York City. And last summer, a Taco Bell employee in Indiana tweeted a photo that appeared to show him urinating on a plate of nachos. The employee was fired. |
703 F.2d 584
Cruzv.Office of Personnel Management
No. 6-82
United States Court of Appeals, Federal Circuit
11/16/82
1
Ct.Cl.
Affirmed
|
Police say man poses as ComEd worker in Rosemont
Surveillance images show the man who represented himself as a ComEd employee Tuesday as part of a scam in Rosemont, authorities said. Courtesy of Rosemont Public Safety Department
A man posing as a ComEd worker appeared to do electrical work at the Rosemont Health and Fitness Center Tuesday before convincing an employee to pay a bogus $80 service bill, authorities said Wednesday.
ComEd says the ruse has occurred at a number of locations. Officials advise that no one from the utility provider will ever ask for payment on the spot.
Rosemont's public safety department is searching for the suspect, identified as a black male, 6'2" and bald, wearing a white hard-hat, reflective vest, neon green shirt, portable radio, and two pieces of ComEd identification. He was last seen driving a dark-colored 2006 Ford utility station wagon.
Authorities say the man identified himself as a ComEd employee out to fix power outages in the area. |
Second Cup Of Coffee? Vindictive!
What it’s all about: Five Sentence Fiction is about packing a powerful punch in a tiny fist.
This week’s word: VINDICTIVE
My story follows the picture prompt. Other stories can be found by clicking on the blue frog at the end of this post.
Photo — Wikipedia
She will just add a few drops in his coffee every morning. It should take about a week according to her research. It will be easy enough to purchase from her lab at work. Headaches, confusion, severe diarrhea and drowsiness will be his well deserved symptoms. No more lovers for you dear husband. |
Get Back In The Sack Reviews Is This really Works Or Scam?
March 15, 2018November 14, 2018 by Alian
You feel like you’re getting old and weak, You’re tired all the time, your memory is slipping, you can’t concentrate, No matter how you eat or exercise, your belly keeps getting bigger, Maybe you wonder if you have low testosterone. The new Get back in the sack digital product will change your life……
PRODUCT NAME: GET BACK IN THE SACK
CASHBACK: 60 DAYS GUARANTED
BONUS: YES
About Get Back In The Sack:
I’m about to share the key Get back in the sack to swing the facility back to your erections, the restore within the room and people androgen levels wherever they ought to be. You’re about to find out how to lose your belly and build muscle…How to shrink your “man boobs”…How to have higher moods, higher focus, and a stronger memory…And how to possess additional energy and stamina, in and out of the room. Get back in the sack review you’ll begin to note a distinction in however you look and feel inside many days…AND you’ll begin to extend your T levels while not injections, significant exercise, or strict diets. In fact, when age thirty, your androgen levels area unit about to begin dropping by 2-4% each year.
Get Back In The Sack Overview:
Get back in the sack helps to lot of men. Therefore although your weight is that the same because it was years ago… abundant of your body’s muscle has disappeared and become fat… that lowers your androgen levels even additional. So, whether or not it’s through Low-T, stress, bad diet, poor exercise, or all 3, all of them contribute to creating you less of the person you’ll be. I’ll speak additional during a couple of minutes regarding however we’ve screwed up our body’s male secretion production… additional significantly, Get Back In The Sack I’ll share what you’ll be able to do to induce your levels wherever they ought to be at once.
And believe my Get back in the sack, once your androgen levels area unit ideal and you’re feeling work and healthy… the advantages go way on the far side a little abdomen and a giant erection. Most men expertise a gradual drop by androgen when age thirty some men get hit by it lots more durable, particularly if alternative conditions area unit an element. response diseases, liver/kidney/pituitary and respiratory organ diseases, infections, sort two disease, coronary failure, HIV/AIDS…… all will lower androgen or produce circulation issues which may cause male erectile dysfunction. In fact, circulation issues and poor vascular health is one in all the leading causes of male erectile dysfunction.
An injury to your testicles all will cause lower-than-normal T levels even IN younger men and boys. Get back in the sack reduces alcohol, smoking, therapy, steroids and diploids area unit usually a cause. Get back in the sack controls Stress, lack of sleep, dangerous diet and a scarcity of physical exertion conjointly play mayhem on your androgen and may cause male erectile dysfunction. Therefore Get back in the sack will avoid, that has become a virus for men within the America particularly. Yeah, your waist circumference might be touching your ability to induce it up!. Losing weight will usually get your T levels back not off course. However the dangerous news with most of the diets out there’s…Get back in the sack Book can dramatically LOWER your androgen levels…And kill your concupiscence within the method.
Get back in the sack diets reviews were designed for men, NOT for girls. There’s a distinction between men’s and women’s bodies; have you ever noticed? Doesn’t it be that men ought to eat differently? yea, we should… however sometimes we tend to don’t. A weird issue that happens to lots of men on “low fat” diets is their bodies begin changing androgen, our ”male” secretion, into steroid hormone, the most steroid hormone in ladies. Yeah, the approach you’re ingestion, Mister, can be telling your body that you’re a Mrs.! It’s a nasty, vicious, emasculating circle happening once you’re on a diet designed for a feminine. You’re attempting to be Bond whereas your body is complaining by turning you into Betty White. in all probability not the result you’re shooting for..
Get Back In The Sack Overview:
I am create this Get back in the sack approach additional correct, creating your dreams faster and quicker. They need terribly straightforward techniques and don’t need external instrumentality or chemicals. Get back in the sack Book wish your body and somewhat little bit of time. Come back to within the Sack Review Techniques Begin to grow phallus alone. The thanks to do that is by encouraging your body to start the natural production of the metabolism and therefore the development and unharnessed of blood. Get back in the sack reviews Once they’re created, you’ll certify you’ve got a phallus in chemistry. Do that and you’ll get huge victories? All people notice however vital it’s for all people to be in our body. In recently, the sensation of the body is incredibly vital. Girls have plenty of choices accessible with cosmetic surgery, and this material is totally open.
Girls will explore for breast augmentation, nausea, botulinum toxin A and different numerous techniques, like plenty of data accessible terribly fastidiously. Get back in the sack you’ll argue along with your friends, as a result of no have to be compelled to modification of a part of your body. Except for a person, come back to within the Sack Book it’s terribly troublesome. Get back in the sack would like for any product to use Natural growth comes complete data as a result of you’ll absolutely perceive all the facts as a result of it permits you to completely perceive a way to increase your phallus by four inches, The best reason I will provide you with some way to use a standard improvement is that it very works and you’ll feel the boldness of knowing that you just square measure a secure and lasting growth.
In a very recent study of ten,000 men, 8,000 individuals aforementioned it absolutely was best once it came to humans, it absolutely was eight out of 10!Their sexual, shallowness, authority, desire, and ultimately decision-making (beds) will cause fatal consequences. Recently, one in all my friends was reprove Maine and aforementioned, “He’s nothing sort of a mature, I want he owns 1/2 the left, once I’m not the right age.” Paul had been the middle of the bug throughout his life. The lady UN agency smiles together with her beau, the psychological impact of my friend, doesn’t break the guts, however it breaks the history. Get back in the sack Come back to within the Sack Ingredients once it involves massive sex, there square measure clear facts that apply to the majority couples.
Advantages of Get back in the sack:
Get back in the sack concentrate better and have improved memories
They have energy and they’re usually in a great mood
Their bodies burn more fat and lose more weight
They’re more attractive to women.
What you are Get from Get back in the sack?
Get back in the sack book will learn the foods to avoid that are killing your t levels.
And the foods to add to your diet that are ideal for you “manhood”.
Get back in the sacks helps to find out which herbs to take, and which ones to skip
Get back in the sack diet gives the best exercise to quickly shrink your belly…
And rapidly get your “manhood” standing up and ready for business.
We want to get the blood pumping where you’ll see strong, hard, long-lasting results!
Get back in the sack You’re about to learn a completely natural, safe approach to restoring your sexual health.
Conclusion:
Get Back in the Sack is life changing product. You’ve in all probability spent a whole bunch or perhaps thousands of greenbacks making an attempt to urge your instrumentation to work. Get back in the sack your dysfunction is getting ready to become a factor of the past, you’re through with all of that. You’ll save plenty of cash AND lots of embarrassment. Get back in the sack Once you will look out of your lady the approach she desires you to. This is life dynamic … for therefore far more than having the ability to “get it up.”
Get back in the sack reviews, Get back in the sack diet, Get back in the sack exercise, Get back in the sack workouts, Get back in the sack 2018 reviews |
// Copyright (c) .NET Foundation. All rights reserved.
// Licensed under the MIT License. See License.txt in the project root for license information.
using System;
using System.Collections.Generic;
using System.Text;
using System.Threading.Tasks;
using Microsoft.AspNetCore.Http;
using Microsoft.Azure.WebJobs.Script.Middleware;
using Microsoft.Azure.WebJobs.Script.WebHost.Middleware;
using Xunit;
namespace Microsoft.Azure.WebJobs.Script.Tests.HttpMiddleware
{
public class JobHostPipelineMiddlewareTests
{
[Fact]
public async Task Invoke_SetsRequestDelegate()
{
bool delegateInvoked = false;
RequestDelegate requestDelegate = c =>
{
delegateInvoked = true;
return Task.CompletedTask;
};
var middleware = new JobHostPipelineMiddleware(requestDelegate);
var context = new DefaultHttpContext();
var pipeline = new DefaultMiddlewarePipeline(new List<IJobHostHttpMiddleware>());
await middleware.Invoke(context, pipeline);
Assert.True(delegateInvoked);
}
}
}
|
Friday, March 31, 2017
World News Briefs -- March 31, 2017 (Evening Edition)
Ousted for misleading White House about discussions with Russian ambassador, ex-national security adviser may have offered to testify before FBI and Congress
Donald Trump’s former national security adviser, Michael Flynn, has all but confirmed that he offered to testify before the FBI and congressional committees about potential links between the Trump campaign and Russia in exchange for immunity.
About Me
I have been involved in numerous computer science projects since the 1980s, as well as developing numerous web projects since 1996.
These blogs are a summation of all the information that I read and catalog pertaining to the subjects that interest me. |
On July 29, 2014, Patrick Byrne, CEO of Overstock - one of the world*s largest online retailers - launched a wiki page where he invited open discussion about the best way for a public company to completely bypass entities like NASDAQ and the New York Stock Exchange and issue its securities on a decentralized platform similar to Bitcoin.
The timing could not have been more comical.
That same Tuesday, a number of Wall Street suits, including representatives of Visa, Citigroup and other financial institutions, gathered for the one-day Digital Currencies conference, organized by American Banker.
Just as the masters of money were struggling to wrap their heads around the cryptocurrency revolution, Byrne, was setting the wheels in motion on what seems to be an ambitious plan to pull the rug out from under their feet.
Reporting from the Digital Currencies conference, Bloomberg's Olga Kharif wrote:
The professionals there were by no means bitcoin faithful. Most bankers' views on the digital currency - or virtual commodity, depending on who you ask - ranged from puzzled to noncommittal. Lester Joseph, manager of the global financial crimes intelligence group at Wells Fargo, said the bank doesn't have a grand plan for bitcoin.
Planning to fail
The aloof attitude of the bankers in charge at Wall Street today would sound rather familiar to Steve J. Sasson. He was the Eastman Kodak engineer who invented the digital camera in 1975.
It's just a bit too bulky to take on holiday.
Talking about the experience, Sasson said:
"My prototype was big as a toaster, but the technical people loved it. But it was filmless photography, so management's reaction was, 'thats cute - but don't tell anyone about it.' "
We all know how digital cameras brought decentralization to photography and gave everyone the ability to produce and print their photos at home. More interesting is the parallel story of the demise of household-name film, paper and photographic chemical companies like Kodak.
Back in 1981, Kodak was already commissioning detailed research on how digital photography would impact their business. They would then ignore the result of those studies for years on end as their business went into decline.
When the company decided to roll up its sleeves and embrace the digital revolution, it was a classic case of too little, too late. Kodak filed for bankruptcy in 2012 and emerged in 2013, a shadow of its former self.
A monumental plan for Bitcoin
While the top Wall Street bankers hem and haw and drag their feet, others have seen the future and are already working hard to make it happen.
Back in January 2014, Overstock became the first major online retailer to accept bitcoin. Now, CEO Patrick Byrne looks like he might have his sights on another first. He is studying the feasibility of issuing securities on a decentralized trading platform such Counterparty, Mastercoin or NXT and is said to be in talks with developers as he considers these three and others among possible options.
Such distributed trading platforms allow anyone with an internet connection to securely create and trade digital tokens, which can represent anything, from gaming chips or a stake in a crowdfunding project, to actual company stock and other securities.
Ownership of these tokens is recorded in a blockchain ledger that is secured by strong cryptographic means, with copies distributed to a network of computers around the world. In the case of Counterparty and Mastercoin, the data is indeed stored on and secured by the Bitcoin blockchain, encoded into tiny bitcoin transactions, while other platforms like NXT use their own blockchain for this purpose.
One of the key innovations of these platforms, currently in various stages of development, is a decentralized peer-to-peer exchange, where the software itself controls and oversees the trading of tokens according to pre-agreed rules that are built into the protocol. This essentially eliminates the need for brokers or escrow services and cuts out the middleman, which is at the heart of what Byrne is trying to do.
Back at the Digital Currencies conference, Lester Joseph from Wells Fargo said during a panel called the Nexus Between Banking and Bitcoin Companies, "We dont really have a strategy. We just try to understand [Bitcoin] and try to manage the risk."
The biggest risk of all
Trying to manage risk and being smug about the whole Bitcoin affair could very well turn out to be a recipe for disaster. In fact, the biggest risk to Wall Street may be their own inaction and failure to embrace disruptive technology.
Looking for the real reason behind Kodak's downfall, John Kotter writes in Forbes:
The organization overflowed with complacency. I saw it, maybe in the late 1980s. Kodak was failing to keep up even before the digital revolution when Fuji started doing a better job with the old technology, the roll-film business. With the complacency so rock-solid, and no one at the top even devoting their priorities toward turning that problem into a huge urgency around a huge opportunity, of course they went nowhere. Of course strategy sessions with the BIG CEO went nowhere. Of course all the people buried in the hierarchy who saw the oncoming problems and had ideas for solutions made no progress. Their bosses and peers ignored them.
*This Italian ad from 1987 shows Kodak confident of its universal appeal.*
A similar scenario now seems to be playing out on Wall Street. There indeed is an interest in Bitcoin at some levels, with hedge funds trying to acquire bitcoin and launching Bitcoin investment funds, and venture capital is pouring in to finance a variety of bitcoin startups. However, so far, the reaction of those on top seems to be very much in line with Warren Buffett's call to "stay away".
Compared to Wall Street, Bitcoin is still but a drop in the ocean. Critics rightfully point at the lack of user-friendliness and the general immaturity of Bitcoin and the related technologies Patrick Byrne thinks will one day change the world. However, before they laugh too hard, they would do well to think back to Steven J. Sasson and his 8-pound digital camera that took 23 seconds to record its first 0.01 megapixel black-and-white photo to magnetic tape.
Who would ever go through all that trouble to look at a photo?
Overstock's CEO will likely face an uphill battle with regulators should he end up pushing full speed ahead with his apparent plan to issue securities on a peer-to-peer decentrlized exchange. But Patrick Byrne is a tough character who is not easily fased and who has taken on Wall Street against the odds in the past.
In any case, is relying on regulation to perpetually keep out the competition the best business strategy for Wall Street? It looks like we may be about to find out. One can only hope the bankers took a few selfies at the Digital Currencies conference, just in case they were having a Kodak moment.
They will not know before it is too late.
Photo credit: Eastman Kodak
DISCLOSURE: The author holds investments in Counterparty's cryptocurrency at the time of writing this article.
READ MORE CRYPTO FOR CHANGE ARTICLES
If you are new to Lets Talk Bitcoin!, you can say thanks for this article by creating an account using my referral link: http://letstalkbitcoin.com?ref=33e82b9f
Visit Lets Talk Bitcoin! while logged into your account to earn LTBcoin in all sorts of ways.
Views: 4,876 |
Steve Rannazzisi: Slow Pitch Softball
Steve Rannazzisi: Slow Pitch Softball
I joined a softball team, which I thought was a great idea... but the guys on my team are crazy. These guys show up to games -- slow pitch softball games -- with cleats, stirrups, the Barry Bonds arm guards on, the black crap under their eyes. I'm like, 'Fellas, the ball is this big. If you can't see it, you probably shouldn't have driven to the game today.' |
(a) This section applies to the Giant grouper (Epinephelus lanceolatus), also known as Ata’ata-uli or Vaolo.
(b) No person shall:
(1) Possess, deliver, carry, transport or ship by any means whatsoever Giant grouper or the body parts of any such species;
(2) Import, export, sell or offer for sale any such species or body parts of such species; or
(3) Take or kill any such species in American Samoa.
(c) If any Giant grouper is caught or captured, it shall be immediately released, whether dead or alive. If the Giant grouper is captured alive, it shall be released in a manner that affords it the greatest opportunity for survival.
(d) It is not a defense that the Giant grouper was caught or captured inadvertently, as bycatch, or from another fishery.
(e) For purposes of this section, there shall be a rebuttable presumption that any Giant grouper, or part of a Giant grouper, found in possession was possessed or transferred in violation of this section.
(f) Notwithstanding subsection (a), any person who holds a permit issued by the Department of Marine and Wildlife Resources to conduct scientific research shall not be subject to the penalties of this section. |
RAJGAD TO TORNA TREK
Description
Rajgad and Torna, both prominent forts of Swarajya, are connected by a 9 km long ridge.The aim is to reach to the top of Rajgad from gunjavane village and then trek to torna top and descend from there to velhe village in one go. The trek to these historical Fortresses of Rajgad and Torna is accompanied with overnight camping under the starry skies.Experience the thrill of waterfall crossings, jungle stay/camping, campfire and local food.
Itinerary
1st Day:-
06.30 am – Departure to Rajgad
08.00 am – Enroute Breakfast
09.30 am – Start Trek To Rajgad
11.30 am – Reach Rajgad
11.45 am – Start Exploring Padmavati and Suvela machi
01.00 pm – Lunch
03.00 pm –Rest
3.30. pm – Explore Balekilla
06.00 pm – Enjoy Sunset from Balekilla
10.07.00 pm – Return to Padmavati Temple
11.08.00 pm – Dinner
12.09.30 pm – Rest
Day 2
05.30 am – Wake up Call
06.00 am – Freshen Up, Tea
06.30 am – Start Trek Towards Torna
07.30 am – Cover Up Sanjivani Machi
08.30 am – Start Trek To Torana
11.30 am – Break fo 15 minutes .
12.30 pm – Start Towards Torana.
01.00 pm – Lunch
01.30 pm – Start Trek
10.02.00 pm – Ascending Torana Fort.
11.02.30 pm – Reach Torana Fort and Explore
12.04.30 pm – Refreshment
13.05.30 pm – Start Journey Towards Welhe.
14.06.30 pm – Return To Base Village
15.06.45 pm – Start Journey Towards Pune
16.09.00 pm – Reached Pune
Advisory
Pay heed to the trek leader or instructor in order to enjoy a safe and sound trekking experience. |
NANOS-3 and FBF proteins physically interact to control the sperm-oocyte switch in Caenorhabditis elegans.
The Caenorhabditis elegans FBF protein and its Drosophila relative, Pumilio, define a large family of eukaryotic RNA-binding proteins. By binding regulatory elements in the 3' untranslated regions (UTRs) of their cognate RNAs, FBF and Pumilio have key post-transcriptional roles in early developmental decisions. In C. elegans, FBF is required for repression of fem-3 mRNA to achieve the hermaphrodite switch from spermatogenesis to oogenesis. We report here that FBF and NANOS-3 (NOS-3), one of three C. elegans Nanos homologs, interact with each other in both yeast two-hybrid and in vitro assays. We have delineated the portions of each protein required for this interaction. Worms lacking nanos function were derived either by RNA-mediated interference (nos-1 and nos-2) or by use of a deletion mutant (nos-3). The roles of the three nos genes overlap during germ-line development. In certain nos-deficient animals, the hermaphrodite sperm-oocyte switch was defective, leading to the production of excess sperm and no oocytes. In other nos-deficient animals, the entire germ line died during larval development. This germ-line death did not require CED-3, a protease required for apoptosis. The data suggest that NOS-3 participates in the sperm-oocyte switch through its physical interaction with FBF, forming a regulatory complex that controls fem-3 mRNA. NOS-1 and NOS-2 also function in the switch, but do not interact directly with FBF. The three C. elegans nanos genes, like Drosophila nanos, are also critical for germ-line survival. We propose that this may have been the primitive function of nanos genes. |
Q:
MS Excel - How to drop the character between the concatenated cells
I need to concatenated cells and put a comma between them. But some cells in the concatenated columns are empty and the result shows the commas between them. How to drop the commas if a cell is empty?
Here's an image:
and here's the link to the above image spreadsheet.
A:
Solution by VBA function:
Function join_ignore_empty(Src As Range) As String
Dim OneCell As Range, tmp As String
For Each OneCell In Src
If Not CStr(OneCell.Value) = "" Then
tmp = tmp & "," & CStr(OneCell.Value)
End If
Next
If tmp <> "" Then
join_ignore_empty = Mid(tmp, 2)
End If
End Function
and
F1="This is the concatenated text: "&join_ignore_empty(A1:D1)
Solution by formula:
F1="This is the concatenated text: "&A1&IF(AND(A1<>"",B1&C1&D1<>""),",","")&B1&IF(AND(B1<>"",C1&D1<>""),",","")&C1&IF(AND(C1<>"",D1<>""),",","")&D1
Logic: comma needed when both previous cell value and at least one of next values (concatenated value checked) are not empty.
|
[NOT FOR PUBLICATION–NOT TO BE CITED AS PRECEDENT]
United States Court of Appeals
For the First Circuit
No. 00-1213
LISA TSARELKA,
Plaintiff, Appellant,
v.
KENNETH S. APFEL,
Defendant, Appellee.
APPEAL FROM THE UNITED STATES DISTRICT COURT
FOR THE DISTRICT OF MASSACHUSETTS
[Hon. Mark L. Wolf, U.S. District Judge]
Before
Torruella, Chief Judge,
Stahl and Lynch, Circuit Judges.
Lisa Tsarelka on brief pro se.
Donald K. Stern, United States Attorney, and Anita Johnson,
Assistant United States Attorney, on brief for appellee.
October 3, 2000
Per Curiam. Appellant Lisa Tsarelka appeals from
the dismissal of her complaint. The district court
dismissed the complaint, by endorsement, based on the
reasons set out in the motion to dismiss filed by appellee,
Kenneth S. Apfel, the Commissioner of Social Security.
There was no error in the action of the district court and
the court's judgment is affirmed for essentially the reasons
set out in the motion to dismiss.
We add only that despite appellant's arguments to
the contrary, she has submitted no evidence that she ever
had presented her claim regarding the termination of her
Supplemental Security Income (SSI) benefits to an
administrative law judge (ALJ) or the Appeals Council.
Neither the ALJ nor the Council ever addressed such a claim.
Further, the Appeals Council's reference to the amount of
appellant's resources was made in a particular, limited
context. That is, this reference was made to explain the
Council's opinion that, given the little money appellant had
at her disposal in May 1997, repayment of $3,378 would not
further the purpose of the SSI program. Significantly, the
-2-
Appeals Council did not make the comment in relation to the
question whether appellant qualified for SSI benefits.
Affirmed. See Local Rule 27(c).
-3-
|
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:tools="http://schemas.android.com/tools"
android:layout_width="match_parent"
android:layout_height="wrap_content"
android:minHeight="48dip"
android:orientation="horizontal"
android:gravity="center_vertical">
<LinearLayout
android:layout_width="0dip"
android:layout_height="wrap_content"
android:gravity="center_vertical"
android:orientation="vertical"
android:layout_weight="1">
<TextView
android:id="@android:id/title"
android:textColor="?android:attr/textColorSecondary"
android:textSize="18sp"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:paddingLeft="8dip"
android:singleLine="true"
android:ellipsize="end"
tools:text="Alice" />
<TextView
android:id="@android:id/text1"
android:textColor="?android:attr/textColorTertiary"
android:textSize="14sp"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:paddingLeft="16dip"
android:singleLine="true"
android:ellipsize="end"
android:layout_marginTop="-4dip"
tools:text="alice@example.com" />
<TextView
android:id="@android:id/text2"
android:textColor="?android:attr/textColorTertiary"
android:textSize="14sp"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:paddingLeft="16dip"
android:singleLine="true"
android:ellipsize="end"
android:layout_marginTop="-4dip"
tools:text="Creation 12.03.2015" />
</LinearLayout>
<ImageView
android:id="@+id/status_icon"
android:layout_width="wrap_content"
android:layout_height="wrap_content"
android:layout_gravity="center"
android:padding="16dp"
tools:src="@drawable/status_signature_revoked_cutout_24dp"
/>
</LinearLayout>
|
Tagged: inguinal hernia surgery
A hernia, simply put, is very much similar to trespassing. An organ crosses its defined boundaries in the body via a weakened tissue, muscle or the layer of fat surrounding it, which ultimately results... |
Noninvasive mechanical ventilation for post acute care.
The increasing use of NPPV in both acute and chronic settings has added to ventilator options in the post acute setting. Some patients start NPPV during their acute presentation and continue use during their post acute stay. Others are difficult to wean from invasive mechanical ventilation, and, if selected carefully, can be extubated and weaned using NPPV. Still others may initiate NPPV in the post acute setting with the anticipation of long-term use. In any care settings, principles of patient selection and management in monitoring practices overlap considerably. Noninvasive ventilation has been shown to reduce morbidity, mortality, and hospital stay in the acute setting for selected patients, and almost certainly prolongs survival for patients with restrictive thoracic disorders in the chronic setting. Although efficacy studies have not been performed in the post acute setting, it is reasonable to anticipate that appropriate use of NPPV will yield similar benefits. Accordingly, clinicians working in the post acute setting must acquire skill and experience in the proper application of NPPV to optimally manage the increasing number of patients treated with NPPV in this expanding arena. |
/*
* Copyright (C) 2010-2020 Fabio Cavallo (aka FHorse)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef REWIND_H_
#define REWIND_H_
#include "common.h"
enum rewind_options {
RWND_0_MINUTES,
RWND_2_MINUTES,
RWND_5_MINUTES,
RWND_15_MINUTES,
RWND_30_MINUTES,
RWND_60_MINUTES,
RWND_UNLIMITED_MINUTES,
};
enum rewind_directions {
RWND_BACKWARD,
RWND_FORWARD
};
enum rewind_action {
RWND_ACT_PLAY,
RWND_ACT_PAUSE,
RWND_ACT_STEP_BACKWARD,
RWND_ACT_FAST_BACKWARD,
RWND_ACT_STEP_FORWARD,
RWND_ACT_FAST_FORWARD
};
typedef struct _rewind {
BYTE active;
BYTE direction;
BYTE action;
BYTE action_before_pause;
struct _rewind_factor {
int backward;
int forward;
} factor;
} _rewind;
extern _rewind rwnd;
#if defined (__cplusplus)
#define EXTERNC extern "C"
#else
#define EXTERNC
#endif
EXTERNC BYTE rewind_init(void);
EXTERNC void rewind_quit(void);
EXTERNC void rewind_snapshoot(void);
EXTERNC void rewind_frames(int32_t frames_to_rewind);
EXTERNC void rewind_save_state_snap(BYTE mode);
EXTERNC void rewind_init_operation(void);
EXTERNC void rewind_close_operation(void);
EXTERNC BYTE rewind_is_first_snap(void);
EXTERNC BYTE rewind_is_last_snap(void);
EXTERNC int32_t rewind_max_buffered_snaps(void);
EXTERNC int32_t rewind_count_snaps(void);
EXTERNC int32_t rewind_snap_cursor(void);
EXTERNC int32_t rewind_calculate_snap_cursor(int factor, BYTE direction);
#undef EXTERNC
#endif /* REWIND_H_ */
|
Hi Hartmut,
JD Sofort is a Joom Donation payment method that is available in 8 European countries and highly popular in Germany.
SOFORT Banking is available to consumer holding an account in the following countries:
- Germany
- Austria
- Switzerland
- Poland
- Italy
- Spain
- Belgium
- The Netherlands
JD Sofort uses the SofortLib PHP to communicate via PHP with the SOFORT API.
To use JD Sofort, you should enter Configuration key, this key can be found on your SOFORT merchant in your SOFORT account.
You can spend time to read this documentation:
www.sofort.com/integrationCenter-eng-DE/content/view/full/3334/
to get more details about Sofort account.
Thanks
Dam
Newsletter
joomdonation.com is not affiliated with or endorsed by the Joomla! Project or Open Source Matters.
The Joomla! name and logo is used under a limited license granted by Open Source Matters the trademark holder in the United States and other countries. |
Q:
meaning of Nietzsche's sentence:
I would appreciate it if you give me a simple explanation of the Nietzsche citation in this following paragraph:
Nietzsche instead believed that we must look beyond hope. We must look beyond values. We must evolve into something “beyond good and evil.” For him, this morality of the future had to begin with something he called amor fati, or “love of one’s fate”:
“My formula for greatness in a human being,” he wrote, “is amor fati: [ed: my problem is with the following]
that one wants nothing to be different, not forward, not backward, not in all eternity. Not merely bear what is necessary, still less conceal it—all idealism is mendacity in the face of what is necessary—but love it.”
A:
That one wants nothing to be different, not forward, not backward, not in all eternity. Not merely bear what is necessary refers to Stoics. Therefore, Nietzsche says: Don’t just bear fate (like Stoics).
Still less conceal it— all idealism is mendacity in the face of what is necessary refers to Leibniz. Therefore, Nietzsche says: Don’t conceal it (like Leibniz)
Nietzsche says neither bear fate like Stoics nor conceal fate like Leibniz but love it!
Source: https://www.artofmanliness.com/2018/01/01/eternal-return-ultimate-new-years-resolution/,http://privatewww.essex.ac.uk/~beatrice/Nietzsche%20and%20Amor%20Fati.pdf
Hope, this helped :)
|
Make Renting Simple!
Make Renting Simple!
How to Rent a Research Satellite
When I was a child, I was beyond thrilled when I received a microscope for my birthday. “Finally,” I thought, “I can be the scientist I’ve always dreamed of being my entire seven years of existence.” Six months later, exit microscope, insert Cabbage Patch Kids.
I imagine today’s youth have similar interests when it comes to scientific experiments. The difference, however, is the plethora of choices they have for devices to add to their birthday wish list. Case in point, a quick search of “science and discovery” on ToysRUs.com returns a list of over 1100 items. I can’t say for certain how many items were available when I was a child, but I’m guessing it was less than 1100.
Launching a New Idea
If you are looking for a unique gift idea for your scientific squirt these days, I advise taking a look at shuttling down the rental path instead of purchasing something that may quickly lose its appeal. Sound like I’m off my axis? I’m not. Kickstarter company, NanoSatisfi, will soon be offering satellite rentals to anyone of most any age and for most any experimental purpose. Interested? Read more about renting a satellite in the full story on The Verge.
In the meantime, I’m going to perfect my comeback of, “Oh yeah? Well, back in my day, I had to walk barefoot 5 miles up a hill in the snow to get home from school just so I could spend my evening conducting fake scientific experiments with some store-bought microscope. Those were some rough times.” |
The Italian government has decided to donates to four research projects in Cyprus within the framework of its longstanding support to archaeological missions on the island.
An announcement on Friday from the Italian embassy of Italy said its government was continuing its longstanding tradition of supporting archaeological missions in Cyprus, “a country with a rich and unique historical heritage which has many common roots with Italy“.
One of the projects that will receive support is the excavations at Erimi-Laonin tou Paraokou, Limassol, directed by Professor Luca Bombardieri of the University of Turin.
The ancient site is been investigated since 2009 by an Italian research team which carries out the fieldwork with the scientific collaboration of the department of antiquities in Cyprus, and the Limassol Archaeological District Museum.
The project aims at achieving a greater understanding of the ideological and cultural aspects of the pre-urban society in prehistoric Cyprus, focusing on the emergence of major productive centres during the Middle Bronze Age, the birth of an urban society and the progressive integration of the island into the Mediterranean trading network during the second millennium BC. The research team is comprised archaeologists with a joint support of anthropologists, archaeobotanists, conservators and restorers.
The second project is the MPM Project: Survey, Excavation, GIS, archaeometric analysis and landscape archaeology in the Moni River Valley, directed by Prof. Oliva Menozzi of the University of Chieti.
This project, a study of the landscape in the area of Moni, Pyrgos, and Monagroulli in Limassol, which began in 2011 with a large team, including scholars and PhD/MPhil students from different institutions.
The research employs a suite of traditional methodologies for the study of landscape archaeology, GIS mapping, studies on typologies, distribution and statistics of pottery finds, in combination with high-end technologies such as remote sensing, satellite photos, analyses of finds and building materials, and non-invasive geophysical prospection.
The third project is the Ptolemaica Project, a study of the ties between Cyrene, Cyprus and Alexandria of Egypt in the Ptolemaic era, directed by Prof. Serenella Ensoli of the University of Napoli II.
The project aims to conduct research activities in Libya, Cyprus and the Middle East to acquire historical-archaeological data on the strong interrelations between Cyrene, Alexandria and Cyprus that existed in the Hellenistic age and beyond.
It seeks to highlight the role and influence of Cyprus within the cultural koiné of Hellenistic age, with particular reference to the relations of the island with Cyrene, and more generally with the main sites of the Eastern Mediterranean.
A strong focus of the project is on the Sanctuary of Apollo Hylates at Kourion. The buildings in the sanctuary have close affinity with those of the Sanctuary of Apollo at Cyrene and other sacred areas of the Eastern Mediterranean dating from the Greek and Roman era. Prof. Ensoli also seeks to create a digital database of relevant sculptures kept in the Museums of Nicosia and Kourion and to study the the “Fabrika Hill” site in Nea Paphos in relation to Apollo Hylates and Apollo sanctuary in Cyrene.
The fourth project concerns excavations in the Sanctuary of Apollo in Touballos, Nea Paphos directed by Prof. Filippo Giudice of the University of Catania.
This is the longest ongoing Italian archaeological mission in Cyprus, which dates back to 1988, and has been excavating and studying one-fourth of Nea Paphos, one of the most important cities in the Hellenistic-Roman Orient and a long-time capital of Cyprus.
This year a work will be published to celebrate its more than 25 years of research, highlighting its many findings which include a fragment of a marble inscription which supports the scriptures on Saint Paul’s links to Cyprus, a surgical instrument and various religious objects, as well as an ancient 72-metre length of road, a staircase, a very long corridor (dromos) and various chambers.
Professor Giudice has challenged the hypothesis that the quarter was a military camp – the site is widely referred to as Garrison’s Camp – arguing, based on many years of excavation and study, that it was actually an area of great hypogeal pagan sanctuaries, the scene of a great struggle between paganism and an upstart Christian religion.
|
Q:
In the J language, the verb `over` doesn't work
I'm following along this thing: J Dictionary
It tells me to issue the command d by d over d!/d where d is a list, but my jqt environment tells me value error: over. If the problem is that I'm supposed to import/install/activate a library, I don't see any instructions in the documentation about that. Anyone know what's going on here?
A:
From the documentation you linked:
The verbs over=:({.;}.)@":@, and by=:' '&;@,.@[,.] can be entered as utilities (for use rather than for immediate study)
It's telling you to define those verbs in order for the following code to work.
So they're not part of the standard library nor any other library - you're supposed to define them yourself.
|
Q:
Golang: file.Seek and file.WriteAt not working as expected
I am trying to make a program which writes at provided offsets in the file, like i can start writing from 20th offset etc.
here is one of sample code i was using as reference
package main
import (
"fmt"
"io/ioutil"
"os"
)
const (
filename = "sample.txt"
start_data = "12345"
)
func printContents() {
data, err := ioutil.ReadFile(filename)
if err != nil {
panic(err)
}
fmt.Println("CONTENTS:", string(data))
}
func main() {
err := ioutil.WriteFile(filename, []byte(start_data), 0644)
if err != nil {
panic(err)
}
printContents()
f, err := os.OpenFile(filename, os.O_RDWR, 0644)
if err != nil {
panic(err)
}
defer f.Close()
if _, err := f.Seek(20, 0); err != nil {
panic(err)
}
if _, err := f.WriteAt([]byte("A"), 15); err != nil {
panic(err)
}
printContents()
}
But i am always getting the same file content which is beginning from start like
12345A
I tried changing the seek values to (0,0) and (20,0) and (10,1) randomly which results in same output
Also i tried changing WriteAt offset to other offset like 10, 20 but this also resulted in same.
I want to get a solution so that i can write at any specified position in file, suggest me what is wrong in this code.
A:
It works as expected.
After running your code, your "sample.txt" file content is (16 bytes):
[49 50 51 52 53 0 0 0 0 0 0 0 0 0 0 65]
try:
package main
import (
"fmt"
"io/ioutil"
)
const (
filename = "sample.txt"
start_data = "12345"
)
func printContents() {
data, err := ioutil.ReadFile(filename)
if err != nil {
panic(err)
}
fmt.Println(data)
}
func main() {
printContents()
}
you need to write enough bytes first, the use WriteAt offset:
e.g. edit :
start_data = "1234567890123456789012345678901234567890"
then test your code:
package main
import (
"fmt"
"io/ioutil"
"os"
)
const (
filename = "sample.txt"
start_data = "1234567890123456789012345678901234567890"
)
func printContents() {
data, err := ioutil.ReadFile(filename)
if err != nil {
panic(err)
}
fmt.Println(string(data))
}
func main() {
err := ioutil.WriteFile(filename, []byte(start_data), 0644)
if err != nil {
panic(err)
}
printContents()
f, err := os.OpenFile(filename, os.O_RDWR, 0644)
if err != nil {
panic(err)
}
defer f.Close()
if _, err := f.Seek(20, 0); err != nil {
panic(err)
}
if _, err := f.WriteAt([]byte("A"), 15); err != nil {
panic(err)
}
printContents()
}
output:
1234567890123456789012345678901234567890
123456789012345A789012345678901234567890
|
The Italy Under-21s star has refused to sign a new AC Milan deal sparking a Europe-wide transfer battle and he looked less than impressed with what was thrown in his direction, which will probably only anger the fans more.
Germany , also strongly tipped to go far in Poland, dispatched Czech Republic 2-0 with former Arsenal star and new BayernMunich signing Serge Gnabry on the score sheet.
It was the former Gunner who had the first chance of the game as he fired wide of the mark just five minutes in.
An Englishman that is a coach and analyst within the youth academy of a Spanish club whilst studying Sports Coaching.
Obsessive over the tactical concepts of the European game, Alex regularly attends games in the La Liga, Bundesliga and Serie A. |
807 F.2d 330
42 Fair Empl.Prac.Cas. 836,41 Empl. Prac. Dec. P 36,701, 55 USLW 2355
COMMONWEALTH OF PENNSYLVANIA and Raymond Williams, WillieMcKay, Marion J. Eaddy, Randolph Hughes, Jr., Arel Brownlee,William Bostic, Kenneth Howard, Alpha Christmas, RonaldRichardson, Clarence Winder, Ronald Crawford and FrankGilchrist, on their own behalf and on behalf of all otherssimilarly situated, Plaintiffs,v.LOCAL UNION 542, INTERNATIONAL UNION OF OPERATING ENGINEERS;Operating Engineers Joint Apprenticeship and TrainingCommittee of Philadelphia, Eastern Pennsylvania, and TheState of Delaware; General Building ContractorsAssociation, Inc., Contractors Association of EasternPennsylvania, United Contractors Association, andPennsylvania Excavating Contractors Association, on theirown behalf, and on behalf of all others similarly situated,and Glasgow, Inc., on its own behalf and on behalf of allothers similarly situated, Defendants.Appeal of LOCAL 542, INTERNATIONAL UNION OF OPERATING ENGINEERS.
Nos. 85-1540, 85-1706.
United States Court of Appeals,Third Circuit.
Argued Sept. 17, 1986.Decided Dec. 5, 1986.
Robert M. Weinberg (argued), Jeremiah A. Collins, Bredhoff & Kaiser, Washington, D.C., Edward A. Foy, Jr., Liederbach, Rossi, Hahn, Casey & Foy, Richboro, Pa., for appellant.
Harold I. Goodman (argued), Community Legal Services, Inc., Philadelphia, Pa., for appellees.
Before ADAMS and STAPLETON, Circuit Judges and COWEN, District Judge*.
OPINION OF THE COURT
STAPLETON, Circuit Judge.
1
In these consolidated appeals, Local Union 542, International Union of Operating Engineers, ("Local 542" or "the Union") challenges the district court's extension of an injunctive decree first imposed on the Union in 1979, after a finding of intentional employment discrimination by the Union against minority workers. Specifically, the Union objects to the minority job referral levels that the extended decree requires. Because we do not believe that the district court abused its discretion in extending the decree, including its referral requirements, for two additional years, we affirm.
I.
2
The elaborate factual foundation for holding the Union liable in this case is recited at length in previous opinions that have emerged from this fourteen-year-old litigation. The Union here challenges only the extended injunction imposed after the district court determined that the initial decree's requirements had not been met. Because the factual background is set forth extensively in prior opinions, we can treat the long history of this case briefly. The most relevant facts for this appeal are the lower court's findings of continuing discrimination and the provisions of the extended decree.
3
The district court in 1978 found Local 542 liable for intentional, classwide discrimination against minority workers in violation of both Title VII and 42 U.S.C. Sec. 1981. Commonwealth of Pennsylvania v. Local Union 542, Int'l Union of Operating Engineers, 469 F.Supp. 329 (E.D.Pa.1978), aff'd, 648 F.2d 922 (3d Cir.1981) (en banc). The court found discrimination by the Union in entry into the Union as well as in job referrals from the Union's exclusive hiring hall. Id. The court then entered an injunctive decree, effective November 7, 1979, to remedy the Union's unlawful conduct. Commonwealth of Pennsylvania v. Local Union 542, Int'l Union of Operating Engineers, 502 F.Supp. 7 (E.D.Pa.1979) (the injunction), aff'd, 648 F.2d 922 (3rd Cir.1981); Commonwealth of Pennsylvania v. Local Union 542, Int'l Union of Operating Engineers, 488 F.Supp. 988 (E.D.Pa.1980) (opinion in support of the injunction), aff'd, 648 F.2d 922 (3rd Cir.1981). Contractors that relied on Local 542's hiring hall were initially found vicariously liable by the district court, but the Supreme Court reversed this holding, General Building Contractors v. Pennsylvania, 458 U.S. 375, 102 S.Ct. 3141, 73 L.Ed.2d 835 (1982), thus invalidating the part of the injunctive decree that applied to the class of contractors. After this decision the obligations of the Union remained unchanged, except for the decree modifications discussed below.
4
The injunctive decree's ultimate objective was to achieve, at the end of its life, a level of hours worked by minority Union members commensurate with the percentage of minority persons in the local workforce population. The decree established a different hours goal for each of five districts where the Union operated. The hours goals increased over the five-year period of the initial decree. To assure that the hours goals would be met, the district court imposed subsidiary obligations on the Union. One of the subsidiary obligations, the referral level (specified for each district), established the rate at which minority members were to be referred to jobs from the Union hiring hall. "Referrals" include dispatches from the hiring hall's out-of-work lists and recalls of preferred employees by employers.
5
The Union's collective bargaining agreements give employers the right to recall a preferred employee during a 90-day period after the employee is laid off by the employer. Thus during the recall period the employer can hire a Union member who is out of work but has worked previously for the employer, giving the employer some control over who is sent from the hiring hall. If the employer does not recall a particular worker, the Union dispatches a member from its out-of-work list.
6
At the outset, the referral levels of the injunction (i.e., the ratio of minority referrals to total referrals) were set at the same percentage as the yearly hours goals for each district (i.e., the ratio of minority hours worked to total hours worked), with a provision in the injunction that referral levels could later be increased if necessary to achieve the appropriate level of minority hours worked. To reach a desired level of minority work hours, referral levels must be set higher if the number of hours worked per referral is on the average higher for white workers. In this case, white Union members have consistently been referred to longer jobs. When the district court found that the initial referral levels resulted in a shortfall in minority hours worked, the court altered the referral obligations. Thus in 1983, the court set aside 22% of the referrals in District 1 for minority workers during the last two years of the initial decree, instead of 18%, the ultimate hours-worked goal for that district. In 1984, the court raised the referral level in District 1 to 40% for the remainder of the initial decree's life. Of the injunction's five districts, District 1 is the district with the greatest percentage of minorities, 18%, in its workforce population.
7
As the years of the initial decree passed, the Union met neither the referral nor the hours-worked specifications of the decree. The Union also did not comply with integrated membership and validation requirements. The Master, appointed by the district court to oversee implementation of the decree, conducted evidentiary hearings in early 1985 and issued a detailed report that recommended inter alia extending the time period of the decree. The Master's Report states,
8
The purpose of the Judgment and Decree was to assure the plaintiff class of adequate representation within the construction industry and more particularly in the endeavors of Operating Engineers.... This purpose has not been met. The Court found that the plaintiff class was entitled to this injunctive relief, and it is the finding of the Master after these years of experience, that the plaintiffs are still entitled to that relief and that the percentages mandated by the Court are reasonable goals.
9
App. at 31. On July 30, 1985, the district court heard argument on whether to accept the Master's recommendations. At the conclusion of this argument, the court issued an order dated August 1, 1985, extending the injunctive decree for two years, to August 31, 1987, subject to modifications to be made by the court. An order dated October 9, 1985, sets out the district court's findings and its modifications of the injunction. The Union appeals from the August 1 and October 9, 1985, orders.
10
The district court found "a serious shortfall" in the amount of work done by minorities during the last two years of the initial decree, the time period during which minorities were to achieve work levels commensurate with the number of minorities in the local workforce population. App. at 671. The court calculated that from September, 1983, to May, 1985, minority workers in District 1 and District 5 lost $4,101,727.00 in wages because of discrimination in the allocation of the Union's work. App. at 672. Furthermore, the court found that since it had ordered 40% minority referrals for District 1, the referral level "actually decreased to 26.5 percent in year 5 from 27.47 percent in year 4." App. at 673 (emphasis in original). The court concluded that the Union "has continued to use the hiring hall as a tool of discrimination." App. at 676. It also found that "Local 542, in blatant and confrontational contempt of the court mandates, has failed to do any of the validation work required of it." App. at 677 (emphasis in original). Finally, the court held the Union "in contempt for failing to satisfy court mandates respecting work levels for minorities, as well as its failure to do the validation work." App. at 677. Judge Bechtle reasoned,
11
The degree of improvement is patently and substantially out of proportion to the levels of compliance that could have been achieved with the resources and experience, and time allowed by the court to perform. The Union's efforts have been mediocre, lackluster and, in the Court's view, calculated to show the minimum of change at the least cost to the Union's continuous program of wearisome and intentional racial discrimination.
12
App. at 677-78 (emphasis in original).
13
The extended decree has as its ultimate goal, as did the initial decree, minority work hours that reflect the number of local minority workers. To assist the Union in complying with the decree and ending discrimination, the extended decree requires the appointment of a Hiring Hall Monitor. It also orders Felix Manual Lopez, Ph.D., to formulate a validation plan for non-discriminatory entry and promotion standards, at the Union's expense.
14
In addition, the extended decree maintains for two years the referral requirements established in 1984--40% minority referrals in District 1, for example, and 17% in District 5. Because Judge Bechtle found "that the employer recall provision in the collective bargaining agreement has had, and will continue to have, a material adverse impact on the Union's ability to meet the goals of the Decree," however, he ordered that the recall provision be altered to restrict recalls to within 30 days from previous employment with a particular employer. As noted earlier, the collective bargaining agreements as signed by the contractors and the Union give the employers the recall privilege for 90 days. In modifying the initial decree Judge Bechtle further provided,
15
The Hiring Hall Monitor will have the authority to approve of or disapprove of all referrals, including hiring hall dispatches and employer recalls. The Hiring Hall Monitor's authority to approve a recall request by an employer which extends beyond the thirty (30) day recall period set by this Decree, shall be limited to "truly extraordinary circumstances."
16
App. at 681.
17
The Union in these appeals challenges the extended referral requirements, arguing that the District 1 hiring hall must under the extended decree dispatch minority workers at a rate of 70%, that the referral requirements unjustifiably hurt white workers who may not have benefited unfairly from discrimination in the past, and that the employers, not the Union, are responsible for the minority work shortfall. The Union emphasizes the Master's finding with respect to the last years of the initial decree:
18
There were, in fact, enough minority operators available for work so that the 40 per cent referral could be met. In order to achieve that, in excess of 70 per cent of all dispatches would have to be to minority operators....
19
* * *
20
Certainly, the fact that it would require in excess of 70 per cent of all dispatches from the hiring hall to be given to minorities and that each one of those dispatches would have required a job of some 199 hours in length, is evidence of the difficulty the Union experiences in trying to comply. The plaintiffs point out, however, that such an effort on behalf of the Union was not even tried. There was at no time dispatches of minorities approaching 70 per cent even though the testimony indicates there were minorities available for work, many on the out-of-work list, that could have been dispatched in order to meet the quotas. It is also obvious to all parties involved and, essentially agreed to, that had the contractors been kept in the case, sharing the responsibility with the Union for meeting the hours and wages goal, that the effort would have been less onerous.
21
App. at 18, 26 (emphasis in original). The high dispatch level required to meet the decree's referral goals resulted from the employers' practice of more frequently recalling white workers. Because the practice of favoring whites for recalls continues, argues the Union, the extended decree imposes an unfair burden on Local 542 and on its white workers who are not recalled regularly. The Union presents itself as powerless to control the employers' right to recall:
22
The recall right is a contractual prerogative that is jealously guarded by the employers, and plaintiffs offer no evidence to suggest that the Union has ever been deemed to have the right to reject a recall that is requested within the period specified by the contract (originally 90 days, and now 30 days). Nor does anything in the Decree purport to authorize the Union to disregard the employers' contractual right to recall employees.
23
Appellant's Reply Brief at 13-14 (footnote omitted). Local 542 asks this court to vacate the extended decree's referral requirements and to instruct the district court to set such requirements no higher than the percentage of minority members in the Union membership of each district.
II.
24
Local 542 does not challenge the district court's power to modify and extend its injunction. See United States v. United Shoe Machinery Corp., 391 U.S. 244, 252, 88 S.Ct. 1496, 1501, 20 L.Ed.2d 562 (1968) (district court should modify decree if required result not achieved). Nor does the Union dispute the proposition that the Supreme Court has approved the use of affirmative, race-conscious remedies for persistent employment discrimination under some circumstances. See Local 28, Sheet Metal Workers v. EEOC, --- U.S. ----, 106 S.Ct. 3019, 92 L.Ed.2d 344 (1986) (holding that race-conscious goals are among tools available to judges devising remedies for Title VII violations, and citing Pennsylvania v. International Union of Op. Engineers, 770 F.2d 1068 (CA 3 1985) (this case), as example). Finally, the Union does not challenge the district court's findings of fact as clearly erroneous. The Union does assert, however, that Judge Bechtle abused his discretion when he extended the race-conscious referral goals for two years, based on the injunction's failure so far to achieve its goal of equal employment opportunity.
25
We review the district court orders for abuse of discretion. Franks v. Bowman Transportation Co., 424 U.S. 747, 770, 96 S.Ct. 1251, 1267, 47 L.Ed.2d 444 (1976) (fashioning employment discrimination remedy invokes equitable discretion of district court). Under the abuse of discretion standard, we may reverse the lower court only if the extended decree is arbitrary, capricious, or irrational, or it employs improper standards, criteria, or procedures. See Hoots v. Commonwealth of Pennsylvania, 703 F.2d 722, 725 (3d Cir.1983). As the plurality opinion in Local 28, Sheet Metal Workers emphasizes, the district court's discretion "should be guided by sound legal principles." 106 S.Ct. at 3050.
26
Justice Brennan's opinion and Justice Powell's opinion in Local 28, Sheet Metal Workers, together expressing the views of five members of the Court, focus on several factors to be considered in determining the propriety of race-conscious, prospective relief for Title VII violations. The affirmative race-conscious remedy in that case fit within Title VII's authorization because it (1) addressed persistent, egregious, or pervasive discrimination, (2) was flexible in application, (3) constituted a temporary measure, and (4) failed to trammel unnecessarily the interests of white workers. 106 S.Ct. at 3050-52 (Brennan, J., joined by Marshall, J., Blackmun, J., and Stevens, J.); see also 106 S.Ct. at 3054 (Powell, J., concurring in the judgment) ("in cases involving particularly egregious conduct a District Court may fairly conclude that [a negative] injunction alone is insufficient to remedy a proven violation of Title VII. This is such a case."). In addition, the plurality found that the remedy satisfied "even the most rigorous [equal protection] test--it is narrowly tailored to further the Government's compelling interest in remedying past discrimination." 106 S.Ct. at 3053 (Brennan, J., joined by Marshall, J., Blackmun, J., and Stevens, J.). The plurality explicitly declined to hold, however, that this most stringent test was in fact the proper test to be applied in analyzing the constitutionality of race-conscious remedial measures. 106 S.Ct. at 3052-53. In his determination that the remedy in Local 28, Sheet Metal Workers was narrowly tailored, Justice Powell relied on the lack of any other effective remedy, the temporary nature of the remedy, the direct relation between the goal and the percentage of minorities in the relevant workforce, the flexible application of the remedy, and its failure to disadvantage white workers. 106 S.Ct. at 3055-57.
27
We examine the remedy in this case to see that it meets Justice Brennan's four criteria for an appropriate remedy under Title VII and, as did the plurality, we assume that the Constitution requires a narrowly tailored remedy. Although the referral levels here seem at first blush to be a more drastic remedy than the 29% membership goal in Local 28, Sheet Metal Workers, careful examination of the circumstances shows that this remedy is not at variance with the analysis used by the Supreme Court to uphold the membership goal. In addition, the Union, focusing on injury to white workers and lack of fit between remedy and problem, has raised no consideration unanticipated by the Court in Local 28, Sheet Metal Workers.
28
Each factor that led to the affirmance in Local 28, Sheet Metal Workers is also present in the case before us. First, Judge Bechtle's memorandum in support of his orders makes clear that extending the decree addresses persistent discrimination. He found that the hiring hall still serves as a "tool of discrimination." App. at 676. The referral requirements have been extended by Judge Bechtle in an effort to end at last the Union's proven discriminatory ways. Therefore, they are not merely racial balancing measures, measures that the Court in Local 28, Sheet Metal Workers indicated would be inappropriate under Title VII. 106 S.Ct. at 3038 (Brennan, J., joined by Marshall, J., Blackmun, J., and Stevens, J.) (citing legislative history).
29
Second, Judge Bechtle treats the referral requirements as flexible goals rather than as strict quotas that can, in and of themselves, result in Union contempt citations. In its October order the district court held the Union in contempt for failure to achieve work levels that, given the actual circumstances, could have been achieved. Neither the failure to meet the minority hours goals nor the failure to meet the subsidiary referral goals mechanically triggered the contempt ruling. Rather, the court sanctioned the Union for efforts "calculated to show the minimum of change at the least cost to the Union's continuous program of wearisome and intentional racial discrimination." App. at 677-78. Furthermore, the court has been flexible in setting the Union's referral requirements and in aiding compliance with them. Because the court found that the recall privilege frustrated the Union's performance under the decree, it restricted this privilege in the course of extending the decree. The court also stated that it would reevaluate the recall privilege's impact after the 30-day time limit went into effect, and that it would make further adjustments if necessary. App. at 675. Referral levels have been repeatedly reexamined and have been set at the estimated level necessary for hours of minority work that match the percentage of minorities in the workforce population.1 The lower court uses the referral levels to gauge achievement of the ultimate goal, work levels consistent with overcoming the Union's past discrimination.
30
The court has shown its willingness to aid the Union in any way possible as Local 542 attempts to increase minority referrals and thus minority work, even to the point of doing away with the recall privilege altogether. An injunctive decree under Title VII can alter the Union's collective bargaining agreement if necessary to end discrimination. General Building Contractors Ass'n, Inc. v. Pennsylvania, 458 U.S. 375, 400, 102 S.Ct. 3141, 3155, 73 L.Ed.2d 835 (1982) (this case). During a January, 1986, conference, for example, the court and counsel for the Union had the following exchange:
31
The Court: I agree with you, and I am glad to hear that the union is unhappy with the recall, because I am and the plaintiffs are and it will be easy to get rid of it.
32
Mr. Collins: We are unhappy with being held accountable for it.
33
The Court: Well, you are. You are in charge of the employment, and it has a lot of features to it.
34
* * *
35
We will just have to take it a step at a time and remove every obstacle in the way of the Court's goal, and the Court will achieve it.
36
Supp.App. at 37. The Union has repeatedly asserted that the recall privilege must be preserved so that it can maintain its relations with employers. Local 542 argues that contractors will not enter into collective bargaining agreements that lack a recall provision. Judge Bechtle has weighed this consideration in determining the features of the extended decree. The recall right has been preserved for 30 days after an employer lays off a Union member, but if necessary to achieve adequate minority referrals the new Hiring Hall Monitor has been given the power to deny any recall request. These measures are indicative of the district court's flexibility and caution in prescribing the means by which the Union will remedy its prior conduct and of the court's concern that the Union not be made to endure unduly harsh measures because of any discriminatory actions by others.
37
Third, the court extended the decree as a temporary measure necessary to counteract continuing discrimination. If the Union acts to comply with the decree, it will finally achieve appropriate minority work levels by the summer of 1987. Since the decree expires on August 31, 1987, the court order in question will not serve to maintain a non-discriminatory situation. Once the imbalance in work levels created by intentional discrimination is corrected, judicial enforcement will end.
38
Fourth, the referral requirements do not interfere with the legitimate expectations of white workers. To begin with, the Union's 70% dispatch figure is misleading. It relies on statistics gathered before Judge Bechtle reduced the recall period. He reduced the recall period with the reasonable expectation that the change would decrease the number of jobs taken by recall (and thereby allow the Union to dispatch minority workers at a lower percentage rate and still meet the decree's goals). App. at 675. The Hiring Hall Monitor's new power should have the same effect of reducing the impact of white worker recalls. The decree specifies referrals, not dispatches, and the referral levels range from .9% to 40%. These are the percentages with which this Court must concern itself.
39
Courts have often set high referral or promotion levels in order to reach minority work levels commensurate with the proportion of minorities in the population. The decree upheld in United States v. Int'l Union of Elevator Constructors, Local Union No. 5, 538 F.2d 1012 (3d Cir.1976), for example, provided for a union membership goal of 23% as well as a referral level of 33.33%. As in the present case, modifications were made in the decree in Bolden v. Pennsylvania State Police, 73 F.R.D. 370 (E.D.Pa.1976), because the effects of prior discrimination were not being eradicated under the initial decree. The modified decree there set a goal of 9.2% minority corporals, sergeants, and lieutenants, with a promotion level set at 33.33% for minorities and a 50% rate of admitting minorities to each police academy class. As in prior cases, the decree here aims for minority work proportionate to minorities in the population; a 40% referral level in District 1 has become necessary to reach this goal.2
40
Most importantly, white workers dispatched more slowly than minority workers have no vested interest in the work hours that they are being denied. These workers could expect excess work in the past because of the Union's discriminatory behavior. The decree here does not interfere with a valid seniority system, as the remedy did do in a case heavily relied upon by the Union, Ford Motor Co. v. EEOC, 458 U.S. 219, 102 S.Ct. 3057, 73 L.Ed.2d 721 (1982), but instead aims to correct the specific practices upon which the Union's Title VII liability is based. This court rejected the legitimacy of the Union's past referral hierarchy in an earlier round of this litigation:
41
Here ... the referral system, which operates on seniority principles, was found by the district court to be not bona fide. Indeed, it was found to be the very mechanism of the intentional race discrimination. A seniority system which is created or maintained with discriminatory intent is by definition not bona fide.
42
App. at 658. Basic principles of equity do not allow lucky individuals to continue to benefit directly from unlawful behavior once the illegality has been proven in court. A temporary injunctive decree aimed at ridding the referral system of discrimination corrects injustices rather than imposing new ones, as the Union tries to suggest.
43
We agree wholeheartedly with the dissent that the impact on white workers must be considered here, but the dissent misconstrues "the burden imposed on innocent nonminorities." At 342. The most important concern for both white and minority Union members who rely on the hiring hall for their livelihood is the number of hours worked, not the number of dispatches or recalls received. By focusing on the delay in dispatching white workers that results from the decree, the dissent appears to lose sight of the fact that once on the job, white workers have been kept on the job for significantly longer periods of time, thereby earning considerably more take-home pay. The district court raised the referral goals because of this development. App. at 673 n. 6. Thus although minority workers may remain out of work for shorter periods, they are often out of work and they continue to receive less than their share of the important commodity--their hourly wage.
44
Furthermore, contrary to the suggestions of the dissent, the burden imposed by the decree on nonminority Union members is spread among all of these workers. The injunction speaks only of referrals, by any method, and of hours worked. The extended decree in no way determines that certain white workers will be recalled consistently, while others must "bat out of the hall." If this is indeed the case--and the record does not substantiate it--there is no reason to believe it results from anything other than bona fide competition in the market for operating engineers.
45
Finally, the referral requirements were narrowly tailored by the district court to counteract discrimination in the allocation of work obtained through Local 542's exclusive hiring hall. An unchallenged finding of fact declares that minority workers have been denied their fair share of the hours worked by Union members. In ordering the Union to refer minority workers at a rate that will give those discriminated against in the past an appropriate share of the work, the court is remedying this discrimination in the only way possible given the nature of the industry. When it first imposed the affirmative, race-conscious requirements of the initial injunction, the district court stated, "There is simply no other way, given the circumstances of this case, to effectively remedy the discrimination found here." 488 F.Supp. at 993. This conclusion was affirmed by this Court when the case was first here. The district court has expanded the decree only after it became clear that greater enforcement efforts were necessary to guarantee relief from the Union's illegal conduct.
46
We share a number of the concerns expressed in the dissent of Judge Cowen. We find ourselves in disagreement with the dissent, however, because we believe the efforts of the district judge equitably to reconcile the conflicting interests before him must be judged on the basis of the record and posture of this case when he was called upon to make the decision we here review. The issue, as we see it, is not whether it would be preferable to have a sufficient record to determine whether employer discrimination is currently taking place and, if so, whether it would be preferable for someone to join one or more employers. Rather, the issue is whether, given the record in this case, the district judge abused his discretion when he extended the decree for two years in an effort to secure for the plaintiffs the fair share of working hours which they previously had been found to deserve.
47
In 1961, the Union insisted upon and won a hiring hall system which forced the channeling of all employment opportunities with contractors in the industry through the hands of the Union. The record in this case shows that the Union has deliberately manipulated that system to the plaintiffs' detriment for over two decades during which period the white members of the Union have received far more than their fair share of working hours and wages. In 1979, the district court held that plaintiffs were entitled to a remedy that would result in their obtaining working hours proportionate to the minority representation in the workforce; that decision was affirmed by the Supreme Court.
48
It was in this context that the hearings were held which culminated in the extension of the decree. In those hearings the Union conceded that after five years of waiting the plaintiffs had not secured the relief to which they were entitled. Moreover, the plaintiffs' evidence demonstrated, as the court found, that the Union could have complied with the referral requirements and this would likely have provided plaintiffs with their fair share of working hours. When called upon to explain why it had not done so, the Union only pointed to the fact that, under the 90-day recall provision, the employers controlled 56% of the hours worked through recall and only 13%, rather than 18%, of the recalls went to minority workers. The Union did not tender evidence tending to show what phenomenon or phenomena are producing this statistical disparity. Judge Cowen posits four plausible candidates, three of which can be attributed to the Union and one of which cannot. The difficulty with the dissent's point is that on this record, one can only speculate as to there being any discrimination by anyone other than the Union. As the Master stressed in his report, when asked to explain why it had not given plaintiffs their due, the Union produced "no evidence" that recalls by any employer or employers had been the result of discrimination on the employer's part.
49
Despite the failure of the Union to produce any evidence of employer discrimination, the district court was sensitive to the problem that the 90-day recall provision created for the Union. It agreed to take steps to reduce the number of hours controlled by the employer and gave the Hiring Hall Monitor authority to deny any recall request. If the Union obtains information indicating that one or more employers are engaging in discrimination, it is free to seek further interim aid from the district court. Moreover, if it obtains such information, it will owe an affirmative duty to its minority members to take action against the offending employer or employers to enforce the non-discrimination provisions of its collective bargaining agreements. Goodman v. Lukens Steel Co., 777 F.2d 113 (3d Cir.1985). Contrary to the suggestion of the Union, there is nothing in the record to indicate that the extension of the decree worked a change by which the discriminating Union became the helpless victim of employer discrimination.
50
The extended decree issued by the district court mandates the type of affirmative, race-conscious relief contemplated by the Supreme Court in Local 28, Sheet Metal Workers.3 The referral requirements in this case violate neither Title VII nor the Constitution. They are part of a flexible, well-designed district court plan to end protracted discrimination. Local 542's allegations of inequity lack merit. Therefore, we conclude that the district court did not abuse its discretion in issuing the orders in question. Consequently, the extended decree will be affirmed.
COWEN, District Judge, dissenting:
51
Providing an effective remedy for racial discrimination remains one of the most important tasks of the federal courts. Nevertheless, when a federal court promulgates a decree that distinguishes between individuals on the basis of race, the decree must be narrowly tailored to the violations it seeks to correct and must respect the legitimate interests of all affected by it. Since the decree in this case is not narrowly tailored and fails to adequately respect the legitimate interests of nonminority members of Local 542, I respectfully dissent.
52
* In Local 28, Sheet Metal Workers v. EEOC, --- U.S. ----, 106 S.Ct. 3019, 92 L.Ed.2d 344 (1986) the Supreme Court held that affirmative, race-conscious remedies are sometimes appropriate even if individuals who are not identifiable victims of past discrimination benefit thereby.
53
A plurality of four Justices (Brennan, J., joined by Marshall, J., Blackmun, J., and Stevens, J.) specifically noted that they "do not mean to suggest that such relief is always proper." 106 S.Ct. at 3050. Instead, although acknowledging that the fashioning of appropriate remedies invokes the equitable discretion of the district court, the plurality
54
emphasize[d] that a court's judgment should be guided by sound legal principles. In particular, the court should exercise its discretion with an eye towards Congress' concern that race-conscious affirmative measures not be invoked simply to create a racially balanced work force.
Id. The plurality also noted that
55
a court should consider whether affirmative action is necessary to remedy past discrimination in a particular case before imposing such measures, and that the court should also take care to tailor its orders to fit the nature of the violation it seeks to correct.
56
Id.
57
Justice Powell, whose fifth vote was essential to the judgment of the court, agreed that a race-conscious remedy must be narrowly tailored. 106 S.Ct. at 3050 (Powell, J., concurring in part and concurring in the judgment).1 Unlike the plurality, which rested on general equitable principles for this conclusion, Justice Powell relied on equal protection doctrine. Id. Thus all five Justices who upheld the particular remedy at issue in Local 28 stated that a federal court may not impose a race-conscious remedy unless that remedy is tailored to fit the nature of the violation it seeks to correct.
58
To understand the problems with the remedy crafted by the district court in this case, three terms regarding the operation of the hiring hall must be explained:
59
Dispatch refers to the practice of an employer calling the hiring hall with a job to fill. The union is to send out the next qualified member on the applicable out-of-work list.
60
Recall refers to the practice of an employer calling back a particular union member who has recently worked for him.
61
Referral, as used in the court decrees, was interpreted in September of 1984 to include both dispatches and recalls.
62
See App. at 645.
63
The original decree in this case was scheduled to expire by its own terms on August 31, 1985. Plaintiffs sought an extension of the decree because, although the decree (after modifications in 1983 and 1984) required that they work 18% of the hours and receive 40% of the referrals, they were not receiving the required hours and referrals. (For convenience, all percentage references are to District 1, the district with the highest percentage of minorities.) It is undisputed that the union was giving 40% of its dispatches to minorities. However, only 13% of recalls by employers went to minorities. Minorities, therefore, did not receive the 40% referral rate required by the court. The district court specifically stated that "without the employer recall feature, the Union would have met the court mandated 40% minority referrals." App. at 674.
64
Assuming, as is likely, that racial discrimination is involved, there are four possible explanations for the shortfall in minority referrals despite the 40% minority dispatch rate:
65
1) the union continued to discriminate by manipulating the dispatches in order to give more desirable jobs (i.e. jobs with a greater likelihood of producing a recall) to nonminorities;
66
2) the union continued to discriminate by providing inadequate training to minorities and thereby rendering them less attractive to employers;
67
3) the effects of prior union discrimination were not dissipated because employers need time before they are sufficiently familiar with an employee's work that they are likely to recall him;
68
4) employers discriminated against minorities.
69
If union manipulation was the cause of the shortfall, then it is certainly appropriate to impose a remedy on the union. Indeed, Judge Higginbotham premised his finding of discrimination in part upon the failure of the union to adhere to its own rules governing referrals from the out-of-work lists. ("The union procedure in general constituted a motley fabric of arbitrary departures from the rules." 469 F.Supp. at 381). However, although the district court in extending the decree found that the union "has continued to use the hiring hall as a tool of discrimination," App. at 676, the court did not explain this statement or point to any evidence of manipulation. Rather, it appears that the district court based this conclusion on the fact of the referral shortfall itself.2 The majority makes precisely the same error in concluding that "[t]he referral requirements have been extended ... in an effort to end at last the Union's proven discriminatory ways." Majority at 335.
70
Similarly, if the cause of the shortfall is the inadequate training of minorities by the union, further remedial action by the union is necessary. However, if inadequate training is the cause, the remedy should be focused on training and not on dispatches.
71
If the referral shortfall is one of "the lingering effects of pervasive discrimination," further remedial requirements placed on the union may be appropriate. See Local 28, 106 S.Ct. at 3050 (plurality opinion).
72
On the other hand, if employer discrimination is the cause of the shortfall, then there is simply no justification on this record to hold the union responsible. It is clear that employers control the number of hours worked per referral and that they have kept white workers on the job longer. See Majority at 331. It is also clear that employers more frequently recall white workers. See Majority at 333. Certainly these facts suggest the possibility of employer discrimination.
73
The district court did not explore which of the foregoing possible causes actually caused the shortfall. In the absence of such an inquiry, the possibility is all too real that the union is being held responsible for remedying the employers' discrimination. The majority concludes that since the union did not prove employer discrimination, this possibility is of no concern. Yet the majority concedes that "one can only speculate" as to the cause of the shortfall. Majority at 338. Such a remedy cannot be considered narrowly tailored to fit the violation it seeks to correct.
II
74
Both the plurality and the concurrence in Local 28 stated plainly that a race-conscious remedy cannot be imposed which unnecessarily trammels the interests of nonminorities. 106 S.Ct. at 3052 (plurality); 106 S.Ct. at 3055 (Powell, J., concurring in part and concurring in the judgment); see also Wygant v. Jackson Board of Education, --- U.S. ----, 106 S.Ct. 1842, 90 L.Ed.2d 260 (1986). The majority declares that the interests of white workers are not legitimate and asserts that "[t]hese workers could expect excess work in the past because of the Union's discriminatory behavior." Majority at 336 (emphasis in original).3 There are two serious flaws in this reasoning.
75
First, the majority assumes, without any factual foundation, that the nonminority employees who rely on dispatches for work are the same individuals who received more than their fair share of dispatches in the past. Certainly the interests of an individual who did not receive such benefits from discrimination cannot be brushed aside as illegitimate.
76
Second, and perhaps more fundamental, the majority's analysis is apparently based upon a misunderstanding of the nature of the interest involved. Under the hiring hall procedures embodied in the collective bargaining agreement, a worker is to be dispatched based on the length of time he has been out of work: the longer he is out of work the sooner he can expect to be dispatched. This interest is entirely independent of any prior discrimination.4
77
It is true that in the past the union disregarded the rules of the dispatch system in a racially discriminatory manner. Absent a finding that such behavior continues, however, the interests created by the equitable system of "first laid off, first re-hired" must be considered legitimate.5
78
Nor can the majority rely on this court's prior opinion regarding the applicability of Firefighters Local Union No. 1784 v. Stotts, 467 U.S. 561, 104 S.Ct. 2576, 81 L.Ed.2d 483 (1984). See Majority at 335. In distinguishing Stotts from this case, the prior decision correctly noted that this case does not involve a bona fide seniority system. App. at 658-59. However, simply because the nonminority workers have no legitimate interests based on seniority does not mean that they have no legitimate interests at all; nor does it mean that they have no legitimate interests based on the length of time they have been out of work.
79
Once the interests of nonminority workers are recognized, at least in part, to be legitimate, it is necessary to determine whether those interests have been sufficiently respected by the decree. Two interrelated factors must be considered: the seriousness of the burden imposed and the diffuseness of that burden.
80
In Wygant v. Jackson Board of Education, --- U.S. ----, 106 S.Ct. 1842, 90 L.Ed.2d 260 (1986), the Supreme Court held that a race-conscious system of determining layoffs violated the Equal Protection Clause. Although no opinion commanded a majority of the Court,6 the plurality emphasized that being laid off from a job is far more burdensome than not being hired in the first place. A layoff can severely disrupt an individual's life while a hiring goal, like a school admissions goal, often forecloses only one of several possibilities. 106 S.Ct. at 1851-52. Similarly, the plurality emphasized that a layoff imposes the entire burden on the particular individuals laid off while a hiring goal diffuses that burden among all potential applicants. Because of the severe burden imposed on particular individuals, the plurality concluded that the layoffs violated the Equal Protection Clause. Id.
81
The decision in Wygant largely foreshadowed the decision on Local 28. Local 28 involved a membership goal rather than layoffs. The plurality noted that the membership goal "did not require any member of the union to be laid off, and did not discriminate against existing union members." 106 S.Ct. at 3053 (emphasis in original). Justice Powell analogized a membership goal to a hiring goal and specifically relied on the plurality opinion in Wygant for the proposition that a hiring goal typically imposes a less severe and more diffuse burden than a layoff. 106 S.Ct. at 3057.
Justice Powell also stated:
82
Of course, it is too simplistic to conclude from the combined holdings of Wygant and this case that hiring goals withstand constitutional muster whereas layoff goals ... do not. There may be cases, for example, where a hiring goal in a particularly specialized area of employment would have the same pernicious effect as the layoff goal in Wygant. The proper constitutional inquiry focuses on the effect, if any, and the diffuseness of the burden imposed on innocent nonminorities, not on the label applied to the particular employment plan at issue.
83
106 S.Ct. at 3057, n. 3.
84
In this case, the burden imposed on innocent nonminorities individuals is heavy: each nonminority worker is dispatched to work far less often than each minority worker. For a worker who must "bat out of the hall," relying on such dispatches to earn a living, the impact is clearly severe. The burden if far more analogous to a layoff than to a hiring since the impact is not simply on one option among many, but rather on all options for union work in his chosen trade in the geographical area. Indeed, the employment practice at issue is simply one aspect of a layoff: the decision as to who gets summoned back to work after a layoff. Certainly the defendant board of education in Wygant, after laying-off teachers without regard to race in compliance with the Supreme Court's decision, could not call those teachers back to work on a racial basis.
85
In addition, the burden is not diffused at all. It is not diffused among all potential applicants for jobs as operating engineers. It is not even diffused among all current operating engineers, since those operating engineers who have either long-term jobs with particular employing contractors or good relationships with contractors and therefore get recalls do not share in the burden. Instead the burden is placed squarely on the shoulders of those least able to bear it: those workers who do not have a good relationship with contractors and therefore must "bat out of the hall." The majority callously refers to these people as "lucky individuals [who] continue to benefit directly from unlawful behavior." Majority at 337. I suggest that these workers, far from being "lucky," are among the least fortunate of all operating engineers and yet are made to bear the entire burden of achieving the court's goal.
86
A member of the Local 542 legitimately expects that he will return to work after a layoff as soon as a job that he can do is available, provided he has been out of work longer than anyone else on his out-of-work list. This legitimate interest is unnecessarily trammelled by the court's decree since particular individuals are forced to bear a severe burden.
III
87
There is a more general problem with the approach taken by the district court since the case was remanded by the Supreme Court. The issues presented on this appeal all stem from this more general problem.
88
I agree with the majority that when Judge Higginbotham fashioned the original decree, the "ultimate objective was to achieve, at the end of [the decree's] life, a level of hours worked by minority Union members commensurate with the percentage of minority persons in the local workforce population." Majority at 331. Judge Higginbotham was acutely aware that what really mattered in the end was wages and hours. He wrote:
89
In the final analysis, the brilliant briefs of counsel, the flash of eloquent arguments, the citations in the future to their case as significant precedent, and even the drama of a packed courtroom will never be adequate mementos for the victims of discrimination who desire money and jobs now.
90
488 F.Supp. 988, 991 (emphasis in original).
91
I also agree that the referral levels, among other requirement, were subsidiary obligations designed to aid in achieving the hours goals. See Majority at 331. As the majority correctly notes, the decree also provided that referral levels could be increased if necessary to reach the appropriate levels of hours worked. See Majority at 331. Such a structure for the decree made eminent sense at the time since the decree imposed obligations on both the union and the contractors in order to achieve the ultimate goal.
92
However, the Supreme Court determined that no significant obligations could be imposed on the contractors since it had not been proven that they engaged in intentional discrimination. 458 U.S. 375, 102 S.Ct. 3141, 73 L.Ed.2d 835 (1982). On remand, the district court simply sought to achieve the same ultimate goal without the presence of the contractors. Taking advantage of the provision in the original decree for adjustment of referral goals, the district court gradually increased the referral goals in an attempt to reach the requisite hours. Along the way, the court defined referrals to include recalls. I believe that this approach was fundamentally misguided, based on a misinterpretation of the original decree, and failed to follow the path charted for the district court by the Supreme Court's decision.
93
The approach was fundamentally misguided because it insisted on achieving a goal which required the actions of both the union and the contractors even though the contractors were no longer bound.7 This flaw is highlighted by the difficulties the court has had with the recall provision in the collective bargaining agreement. There is no doubt that the recall provision is a major obstacle to achievement of the hours goals of the decree.8 Only 13% of the recalls by contractors are for minority workers, even though 40% of the dispatched workers which the contractors receive from the union are members of minority groups.
94
In order to deal with this problem, the district court reduced the recall period from 90 days to 30 days. The majority emphasizes that the district court "has shown its willingness to aid the Union ... even to the point of doing away with the recall provisions altogether." Majority at 335. But what would happen if the district court were to totally eliminate the recall provision? It is undisputed that the contractors only agreed to a hiring hall arrangement if they retained the right to recall. Indeed, a ten week strike was required to compel the contractors to accede to the hiring hall at all. See 458 U.S. at 378-89, 102 S.Ct. 3143-44. If recall were eliminated and the hiring hall arrangement discontinued, it seems obvious that the union, without the contractors' presence, could not achieve the hours goals. The district court is therefore caught in a balancing act: it uses the hiring hall to approach the hours goals despite the actions of the contractors, but cannot go too far lest it risk losing the only handle it has on achieving those goals.
95
The district court has also interpreted the term "referrals" to include recalls. I believe that this is a misinterpretation of the original decree. The use of the term "referrals" in the original decree itself suggests that it does not include recalls. Paragraph 14, which concerns referrals, only mentions out-of-work lists. See 502 F.Supp. at 10. Out-of-work lists are relevant only to dispatches.
96
Moreover, nowhere in Judge Higginbotham's discussion of the evidence of discrimination in referrals is there any suggestion that recalls are included. The entire discussion focuses on out-of-work lists, which, as noted above, are relevant only to dispatches. See 469 F.Supp. 355-57. Indeed, the only mention of the term "recall" which I have located in Judge Higginbotham's entire liability opinion (which occupies ninety-one pages in the Federal Supplement) indicates that his understanding of "referral" did not include dispatches. In describing the hiring hall system, he wrote:
97
Other restrictions pertaining to referral are the three refusal rule and the 90 day no-recall rule. An operating engineer who refuses without excuse an offer of employment three consecutive times is to be placed at the bottom of his out-of-work list. No employer is to recall outside the referral system after 90 days of separation.
98
469 F.Supp. at 340, n. 5. (emphasis added).
99
Lastly, the district court on remand failed to follow the path charted for it by the Supreme Court's decision. The Court specifically stated:
100
If the Union and the JATC [Joint Apprenticeship and Training Committee] comply with the decree by training and referring minority workers, we see no reason, absent supporting evidence, that the employers will not hire the minority workers referred pursuant to the collective bargaining agreement, and employ them at wages and hours commensurate with those of nonminority workers. If experience proves otherwise, the District Court will then have more than sufficient grounds for including the employers within the scope of the remedial decree.
101
458 U.S. at 400, 102 S.Ct. at 3155.
102
The union has complied with the original decree's referral requirements by its level of performance in dispatching minority workers. No issues concerning training obligations are currently before the court. It is incumbent upon the district court to determine whether it is the lack of adequate training by the union or the JATC, racial discrimination by the contractors, or some other cause, which is producing the shortfall. If the reason for the shortfall is failure of the union or the JATC to comply with the decree's training requirements, then strong measures are appropriate to compel compliance. If, however, the reason for the shortfall is contractor discrimination, then, as the Supreme Court foresaw, it is time to bring the contractors back into the case.
IV
103
For the reasons explained above, I would vacate the extended decree's referral requirements and remand for a determination of the cause of the disparity between the dispatch rate on the one hand and the recall rate and hours percentage on the other hand. I would also instruct the district court to respect the legitimate interests of nonminority workers in any new remedial decree.
*
Honorable Robert E. Cowen, United States District Judge for the District of New Jersey, sitting by designation
1
Thus both the referral levels and the hours-worked goals are "directly related to the percentage of nonwhites in the relevant workforce," an aspect of appropriate remedies emphasized by Justice Powell. 106 S.Ct. at 3056
2
The original referral goals, approved by this court in 1981, ranged from .7% to 18%. When the Union challenged the injunctive decree under Firefighters Local Union No. 1784 v. Stotts, 467 U.S. 561, 104 S.Ct. 2576, 81 L.Ed.2d 483 (1984), the decree as upheld by this court included the very same referral levels now directly challenged. Commonwealth of Pennsylvania v. Local Union 542, Int'l Union of Operating Engineers, 770 F.2d 1068 (3d Cir.1985) (table), cert. denied, --- U.S. ----, 106 S.Ct. 803, 88 L.Ed.2d 779 (1986)
3
Justice Brennan's opinion cites the recent Third Circuit Court of Appeals decision in this case upholding this injunction, including the current referral requirements, for the proposition that racial preferences are appropriate under certain circumstances. 106 S.Ct. at 3037 (Brennan, J., joined by Marshall, J., Blackmun, J., and Stevens, J.)
1
Justice Powell also stated that the percentages set should be "directly related to the percentage of nonwhites in the relevant workforce." 106 S.Ct. at 3056. In this case, the 40% referral rate in District 1 is double the approximately 20% of the relevant population who are members of the minority groups. The majority concludes that the "direct relationship" requirement is met because the 40% referral rate was set in order to achieve hours commensurate with the percentage of minorities in the relevant population. I question whether this is the sort of "direct relationship" which Justice Powell had in mind. Because I would rest on other grounds, I need not reach this issue. Further elucidation may be forthcoming from the Supreme Court in the near future. See U.S. v. Paradise, No. 85-999 (argued November 12, 1986)
2
Moreover, the union does not challenge on appeal the decision by the district court to appoint a monitor to run the hiring hall. A court-appointed monitor in the hiring hall can certainly prevent any manipulation by the union
3
The majority also states that "the impact on white workers must be considered." Majority at 337. I do not understand why the "impact" on those whose interests are deemed illegitimate must be considered
4
There may be some interests which nonminorities have in the dispatch system which can be considered illegitimate because they are based on prior discrimination. Separate out-of-work lists are maintained for different levels of experience. In addition, a worker without the specific skills an employer demands for a specific job can be bypassed on the applicable out-of-work list. To the extent that a nonminority worker has greater skills and experience because of prior discrimination, his interests can be discounted. This conclusion, however, does not undermine the legitimacy of his interests based solely on his length of time out of work
5
The majority's reasoning can also be read to suggest that once a procedure is tainted by discrimination, even a non-discriminatory use of that procedure is illegitimate. Such a conclusion is simply unsupportable
6
Justice Marshall, joined by Justices Brennan and Blackmun, commented: "I do not envy the District Court its task of sorting out what this Court has and has not held today." 106 S.Ct. at 1867
7
It is ironic that the majority quotes Judge Higginbotham's statement that "[t]here is simply no other way, given the circumstances of the case, to effectively remedy the discrimination found here." Majority at 337. That statement referred to a decree that included both the union and the contractors. It certainly does not support the proposition that the decree as originally crafted could properly be imposed on the union alone
8
It is not the only obstacle. Another significant obstacle is the contractors' control over how long a job lasts
|
Q:
Selecting dates from Pandas Panel without looping over items
I have panels full of stock data that are not aligned on trading days. You can use the code: dataFrame.ix[dateSet] to select dates from a pandas DataFrame but I want to do something similar with a panel and have resorted to looping over panels and rejoining them. So some kind of Panel.ix[daterange] would be useful.
def slicePanelOverTradingDates(panel = fpStockPanel, security = 'SPY'):
# get the trading dates of the S&P starting with the first date of the panel's adjusted close item
validSPXDates = DataReader('SPY','yahoo',panel['Adj Close'].index[0].date()).index
# take the dates that are valid in the stock panel that intersect with the S&P's dates and makes sure they're in order
panelDatesOnSPXDays = list(set(panel['Adj Close'].index).intersection(set(validSPXDates)))
panelDatesOnSPXDays.sort()
# remakes the panel sliced only over the correct dates
panelFrame = {}
for x in panel.items:
panelFrame[x] = panel[x].ix[panelDatesOnSPXDays]
finalPanel = pd.Panel(panelFrame)
return finalPanel
A:
.loc support multi-dimensional selections, see here; this applies to .ix and .iloc as well
In [18]: p = tm.makePanel()
In [19]: p
Out[19]:
<class 'pandas.core.panel.Panel'>
Dimensions: 3 (items) x 30 (major_axis) x 4 (minor_axis)
Items axis: ItemA to ItemC
Major_axis axis: 2000-01-03 00:00:00 to 2000-02-11 00:00:00
Minor_axis axis: A to D
In [20]: p.loc[:,'2000-1-4':'2000-1-31']
Out[20]:
<class 'pandas.core.panel.Panel'>
Dimensions: 3 (items) x 20 (major_axis) x 4 (minor_axis)
Items axis: ItemA to ItemC
Major_axis axis: 2000-01-04 00:00:00 to 2000-01-31 00:00:00
Minor_axis axis: A to D
|
Communication system networks are known to comprise a plurality of communication systems and a central controller. Each of the communication systems comprises a plurality of communication units, a limited number of communication resources that are transceived via a limited number of repeaters, and a communication resource allocator that allocates the communication resources among the plurality of communication units. The communication units, which may be mobile radios, portable radios, and/or portable radio/telephones, are typically arranged into communication groups and are generally located throughout the communication system network. Of the communication resources, which may be TDM slot locations, frequency carriers, pairs of frequency carriers, or any other RF transmission means, one is selected to function as a control channel. The control channel transceives operational information between the communication units and the central controller via the communication resource allocators.
As is known, a communication unit may establish a communication with other communication units within the communication system network by transmitting an inbound signalling word (ISW) to the central controller via the communication resource allocator of the communication system that the communication unit is located in. Upon receiving the request, the central controller processes it and, if the request is valid, the central controller allocates a communication resource in each of the communication systems that have a communication unit of the targeted talk group in it. The communication systems, which may also be communication sites, are coupled to and controlled by the central controller. If a communication system, or site, loses contact with the central controller, the communication system, or site, operates as an independent communication system but only for communication units that are located within its coverage area.
As is also known, when a communication is requested by a communication unit for its particular communication group (first communication group), the communication unit transmits an ISW requesting allocation of a communication resource for that group. Upon receipt of the requesting ISW, the central controller determines whether a communication resource is available in all the communication systems, or sites, for the first communication group. In more advanced communication systems networks, the central controller determines which communication systems have a communication unit of the first communication group registered in it and whether these communication systems have an available communication resource. In either network, the central controller will not place the call until all communication systems, or sites, have an available resource. Thus, the requesting call waits in a queue until all the communication systems have a resource available.
When the above mentioned call, the first call, is waiting for communication resources to become available, subsequent requests for communications may be received. If the subsequent request is for a second communication group and the second call does not overlap the first call, i.e. the second call will be placed in entirely different communication systems than the first call, the second call can be processed. However, if the second call has one communication system that overlaps the first call, the second call is placed in the queue and will not be placed until after the first call is processed. The second call is placed in the queue even if all of the communication systems that the second call will be placed in have an available communication resource. Therefore, a need exists for a method that will allow the central controller to efficiently process subsequently receive communication requests when other communication requests are pending. |
Metastatic Prostate Cancer With Restored Hormone-Response After Radioligand Therapy With 177Lu-PSMA-617.
An 80-year-old patient with castrate-resistant prostate cancer presented to our department for PSMA imaging because of a rising prostate-specific antigen (PSA) level. The tumor was diagnosed in 2004. GnRh analog was the only treatment the patient received. Two cycles of Lu-PSMA-617 were performed with a 2-month interval in between. Ten months after finishing with 2 cycles of Lu-PSMA therapy, we noticed a continuous falling PSA level and a decreasing tumor spread in the PET/CT imaging just under the hormone therapy. |
Tag: What if
The past week or so has been another tough one full of anxiety, worry, and doubt. I spent much of my time letting my thoughts spin out of control and got very little sleep in the process.
What was I spinning over? The usual culprits (money, career, etc) were certainly present, and they were accompanied by an overarching concern of not having “a plan” for my life.
I thought I had a plan once. I was going to progress in my career, buy a home, get married, etc, but then there was the realization that many parts of said plan weren’t mine. With this realization my current life path began.
As I unfold myself then let go of, add to, and realign parts of my life plan, there are moments were I feel quite exposed. These are the times where I haven’t yet filled the gaps left by letting go of parts of the old plan, and these times leave me feeling uber vulnerable… and scared.
When this fear and vulnerability arise (as they did this past week), I question everything and find myself only focusing on these reactions; hence the spinning. I think we all do this as we go through the process of rediscovering and realigning with our true selves, but knowing this doesn’t make it any less challenging.
One line of thinking that I brought to the surface this week was how I choose to see life as final and of two dimensions. I view circumstances as “If this, then that” as opposed to “if this, then maybe a whole lot of different things”. I think this two dimensional thinking is a thorn in my progress. Since it came to the surface I’ve been working to release it and extend my perspective.
The line of thinking came to the surface in two ways. First was a response to an email I sent a dear friend updating her on my current thinking on letting go of old friendships. She replied to said email with, “I’ve tolerated some people who were on their path and maybe not in a great space and you know what, I don’t know what to tell you, I was in the same place I think at your age, just be okay with it, you’re fine, people are fine, life is fine!”
Second, a friend was telling me about a similar discussion she had recently. Her response to the parties present, who were bringing up similar thoughts to the ones I was having, was “the friends you’re letting go for now may very well come back”. I know this idea seems obvious, but it’s something I’ve never considered. I never thought that all that I’m letting go could indeed return to me one day in a new, improved form (or in a old, unimproved form).
I believe it was having these insights, then targeting my two dimensional thinking, which allowed me to start to calm down enough to push past my fears and dig deeper. I mustered up the courage to share my story with yet another friend whom I was visiting in Connecticut.
He responded to my fears of not having a plan with the usual advice. I need to figure out myself first. I need to continue to question everything about what I like, what I don’t, and why. By doing this, by exposing my core, I can create a plan and walk a path that is true to me. Until then any plan I put together will be someone else’s plan, and following someone else’s plan will ultimately cause me angst and discontent.
I question why this message is so hard for me to keep in mind, but now I think I realize it’s because that journey of letting go, having gaps, and needing to fill them feels so scary and daunting.
What if we just let the gaps stick around for awhile? What if instead of rushing to fill the gaps, and focusing on the fear of never having the gaps filled, I focused on the possibilities of filling them? What if I choose the positive and not the negative?
I don’t know the answers to these questions, but given how much sleep I lose to the former, I think I’m finally ready to try the latter. Here’s hoping.
Currently In
Warsaw, Poland
August 29 – September 22
Sitting a Jack Russell named Jack while exploring a new city and country. |
Closing arguments: Contrasting version of death of Jordan Davis
Notice!
Would you like to continue watching?
WATCH LIVE: State of Florida vs. Michael Dunn
JACKSONVILLE, Fla. -
The seven women and five men charged with determining a verdict in a first-degree murder trial will return to the courtroom Thursday morning to see surveillance video inside the Gate convenience store the night Michael Dunn fired 10 shots at an SUV containing Jordan Davis and three other teens.
After nearly three hours of deliberations Wednesday evening, the jury said they would like to see all 20 minutes of the video and all six camera angles.
Judge Russell Healey determined the video should be shown in the courtroom at 10 a.m. Thursday, then a second day of deliberations would begin. Four alternate jurors were kept sequestered overnight, as well.
In closing arguments Wednesday, prosecutors say Dunn reacted viciously to an argument over loud music with teenagers parked next to him and fired into their vehicle, killing Davis, and then drove away as if nothing happened.
However, defense attorneys argued that the state failed to prove its case or show that Michael Dunn hadn’t acted in self-defense.
Dunn, who has pleaded not guilty, faces life in prison if convicted of that charge.
Besides first-degree murder, jurors could also consider the lesser crimes of second-degree murder or manslaughter, according to the jury instructions. Dunn also is charged with attempted murder for shots fired at Davis’ three friends.
Closing arguments: Contrasting versions of same event
Prosecutors made their closing argument Wednesday morning in the murder trial of Dunn, saying 17-year-old Jordan Davis' shooting death was a deliberate act -- not an act of self-defense.
During her 90-minute argument, Assistant State Attorney Erin Wolfson played audio of the gunshots and showed images of the bullet holes in the SUV in which four teenagers were sitting the day after Thanksgiving 2012. She said not only is there no evidence there was a shotgun in that car, the physical evidence shows Davis was shot sitting in the backseat of his friend's Dodge Durango, not outside the SUV threatening Dunn.
"Ten rounds, nine of them hitting that car -- hitting this defendant's target. Three of those shots hit directly the target Dunn was aiming for (Jordan Davis)," Wolfson said. "There was no gun or weapon ever found. And it wasn't because of shoddy police work, it was because there wasn't one. The boys didn't have a gun."
Blog/Tweets From Courthouse
"This defendant was disrespected by a 17-year-old teenager, and he lost it. He wasn't happy with Jordan Davis' attitude. What was his response? 'You're not going to talk to me like that,'" Wolfson said. "He took these actions because it was premeditated. It was not self-defense."
Wolfson ended her argument, saying: "Today is the day that you all as members of the jury can define what this defendant did on Nov. 23, 2012," Wolfson said. "He might have silenced Jordan Davis but cannot silence the truth."
After the jury's lunch break, defense attorney Cory Strolla began by reminding the jury that the burden of evidence is on the state to convict his client "beyond a reasonable doubt."
Strolla pointed out things he believes will instill such doubt, including remaining silent for three minutes to dramatize the amount of time the SUV was in the adjoining plaza before returning to the Gate parking lot -- which he said was plenty of time to get rid of a shotgun.
He also said detectives should have immediately gone to the area and searched, but waited five days.
Strolla argued that there were no signs Dunn was was in a bad mood, intoxicated or planning to do anything that night. He only asked the teens in the car to turn down the music, which they initially did, only to turn it back up again.
Strolla said Dunn only fired his gun when he saw Davis wielding a weapon from inside the Durango and felt threatened.
"He's had that gun for 20 years and never pulled it once," Strolla said. "He told you that nobody has ever scared him, no one has ever threatened him like that."
After Strolla's 75-minute closing, prosecutor John Guy used the state's rebuttal to tell the jury: "This case is not about self-defense, it's about self-denial."
"That defendant didn't shoot into a car full of kids to save his life. He shot into it to save his pride," Guy told the jury. "Jordan Davis didn't have a weapon, he had a big mouth."
The attorneys and judge stayed more than three hours Tuesday evening finalizing the exact wording of those jury instructions, including what lesser charges such as voluntary manslaughter the jury will be allowed to consider, and how to explain Florida's statutes regarding justifiable homicide.
Judge Healey began reading the instructions to the jury about 3:45 p.m. -- a process that took just over an hour. Then four members of the 16 people chosen as jurors were excused and the 12 remaining retreated to pick a foreperson. About 15 minutes later, they had made a decisions and their deliberations officially began.
With the jury out of the courtroom, Healey addressed the four alternates, asking them to "stick around" in case one of them needed to be used to replace one of the primary jurors.
In order to conclude that the killing was justifiable, jurors must believe it occurred while resisting an attempt to murder or commit a felony against Dunn, Circuit Judge Russell Healey told jurors.
Assistant State Attorney Erin Wolfson told jurors that the evidence clearly shows Davis was unarmed when Dunn fired 10 shots at a Dodge Durango where Davis was sitting. Wolfson said no witnesses saw any of the four teenagers in the vehicle with a weapon and police searches turned up none.
“This defendant was disrespected by a 17-year-old teenager, and he lost it. He wasn’t happy with Jordan Davis’ attitude. What was his response? ‘You’re not going to talk to me like that,’” Wolfson said. “He took these actions because it was premeditated. It was not self-defense.”
Dunn’s attorney Cory Strolla told jurors that the state had failed to prove its case or disprove Dunn’s assertion he acted in self-defense.
“Not one single witness said this man (Dunn) showed any signs of anger,” he said.
Strolla argued that there were no signs Dunn was planning to do anything that night and only asked the teens in the car to turn down the music. Strolla said they initially did, only to turn it back up again.
Strolla said Dunn only fired his gun when he saw Davis wielding a weapon from inside the Durango and felt threatened.
“He’s had that gun for 20 years and never pulled it once,” Strolla said. “He told you that nobody has ever scared him, no one has ever threatened him like that.”
Police didn’t find a weapon in the SUV, but Strolla contended that the teens got rid of it during the three minutes they were in an adjacent parking lot after fleeing the gunshots. He said detectives should have immediately gone to the area and searched, but didn’t.
In his testimony Tuesday, Dunn told jurors he was in Jacksonville with his fiancee, Rhonda Rouer, to attend his son’s wedding. Dunn said he and Rouer went to the convenience store for wine and chips. He said he pulled in next to an SUV playing loud music.
Dunn said he asked the teens turn down the music and they turned it off. “I said, ‘Thank you,’” Dunn said. But soon afterward, Dunn said he heard someone in the SUV shouting expletives and the word “cracker” at him. Dunn is white, and the teens in the SUV were black. Cracker is a derogatory term for white people.
The music was turned back on, and Dunn testified, “I wasn’t going to ask for favors anymore.”
Dunn said the men in the SUV had “menacing expressions,” and he asked the teens whether they were talking about him. He said he wanted to calm down the situation but saw a teen in the backseat reach down for something. Dunn said it looked as if the barrel of a shotgun was sticking out the window.
One of the teens stepped out of the SUV, Dunn said, and he felt “this was a clear and present danger.” He reached for his pistol in a glove box.
Dunn, who had a concealed weapons permit, fired nine shots into the car, according to an affidavit. Authorities say a 10th shot fired by Dunn missed the car. Once his fiancee returned to the car, he drove off out of fear of the SUV returning, he said.
Dunn said he told Rouer on the drive back to the hotel that he had shot in self-defense. But Rouer, called by prosecutors as a rebuttal witness, said Dunn never told her he thought Davis had a gun.
Dunn and Rouer drove back to their hotel and Dunn said he didn’t call the police because his focus was on the well-being of Rouer, whom he described as hysterical. The next morning, Dunn said, Rouer insisted she wanted to go home and they drove back to their home in Brevard County, 175 miles away. There, Dunn said he contacted a neighbor who is in law enforcement for advice on how to turn himself in.
In her closing argument, Wolfson said the actions Dunn took after the shooting are those of someone who thought he wouldn’t get caught.
“This defendant didn’t tell anyone because he thought he had gotten away with murder,” the prosecutor said.
Copyright 2014 by ClickOrlando.com. All rights reserved. This material may not be published, broadcast, rewritten or redistributed.
Comments
The views expressed are not those of clickorlando.com, WKMG or its affiliated companies. This is a community moderated forum (Please note the 'Flag' button). By posting your comments you agree to accept our Terms Of service |
To be edge-driven, individuals must be driven more by the outcomes they can secure for their clients than by any existing role definitions. Doing as much as possible for the client without jeopardising the sustainability of the organisation means engaging critically with existing understandings, developing a ‘nose’ for the dilemmas faced in creating value for clients, and learning that links the challenges their clients face to the challenges they themselves are prepared to face.
Social networks are known to disrupt existing institutional affiliations. The kinds of identification that they support are not based on shared ideals but on making common cause, in which there is a shared relationship to a situation marked by some particular challenge – a ‘something missing’. The challenge for the individual is how to place these affective networks within the context of the other forms of identification through which they take up their being, including such things as living in a loving relationship and holding down a job.
Historically, any anxiety that an individual might feel was something for them to manage personally, so that they were better able to engage with the challenges of their role(s). When individual’s roles bring them into relation with clients at the edges of an organisation, however, the affective networks that emerge around there being ‘something missing’ may contain the seeds of important learning for the organisation as well. The more dynamic and multi-sided are the demands in relation to which the organisation is seeking to create value, the more important this learning can become for the organisation. The challenge for the individual, therefore, is not to go off and ‘sort themselves out’ so that they can do their job better, but rather to use their valency for there being ‘something missing’ to investigate of what it might be a symptom.
Approached in this way, a ‘something missing’ becomes a value deficit; and in order to investigate of what it might be a symptom, it becomes necessary to distinguish the way in which what is going on (wigo) is being contained from whatever remains ‘beyond’ or ‘missing’, which we can refer to as what is Really going on (wiRgo). Not that it is ever possible to know what is Really going on, but wiRgo becomes a way of pointing towards a deficit that lies outside or beyond the existing ways of containing wigo, i.e. giving meaning to wigo, and thus beyond the container’s organising assumptions. It will be these organisation assumptions that will be determining norms of behavior within an organisation, so if these are to be challenged successfully, then investigation will involve looking more closely at how the container contains wigo.
When an individual speaks of a situation that they are experiencing, there will be the firstness of how s/he in particular feels about it, its secondness that will be what can be apparent to any observer, and the thirdness through which its meaning is contained. This thirdness frames the way meaning is made through the way it applies its organising assumptions. There are then different kinds of thirdness which form a cycle from which innovations may emerge: a frame may be accepted as right because it feels right (1st kind), because of who says it is right (2nd kind) or even because everyone agrees that it is right and ‘how could it not be right’ (3rd kind). Finally, there is the possibility of doubting the rightness of any of these first three kinds of thirdness (4th kind), this preparedness to include doubt being the necessary condition for pursuing any investigation. It is the roots of this doubt in the individual’s personal valency for feeling that there is a ‘something missing’ that enables that individual to take an investigation forward.
Thus are the conditions set for adapting to and taking up roles in networked collaborations: no-one can be assumed to know best, it cannot be assumed that there is one right way to frame the situation, and any investigative process must be open to including firstnesses and secondnesses that were previously considered not to be relevant. This gives rise to the need for a plus-one process in which any given situation is approached as presenting at least one dilemma, with the value deficit being what continues to fall between the horns of the dilemma. The work of approaching this dilemma (or these dilemmas) has to get past two crises, the first being to take the existing framing to the limits of its ability to provide effective answers to what’s ‘missing’, the second being to accept that the existing framing must ultimately be set aside if something new is to emerge. The second of these crises is the most difficult to overcome because it demands that the individual take personal responsibility for tackling what’s missing, not to leave it to others and not to expect this to cost them personally in some way.
These are very great challenges for an individual to face. Even though the penalty of not facing them will ultimately be toxic for the wider system in which the ‘something missing’ is arising, this is small comfort in the short term. The temptations of defenses against anxiety thus offer much greater immediate benefits than the challenges of overcoming the wider system’s defenses against innovation. Meeting these challenges means exercising leadership in a way that is tripartite, giving weight to the importance of addressing value deficits while not abandoning the vertical constraints to which any new kind of response must be subject if it is to be sustainable. It remains therefore for the individual to understand how the wider system will resist change while accepting that the arguments for change must be won both with respect to existing ways of framing and with respect to overcoming the personal costs of so doing.
I’ve just been listening to a press briefing being given by President Trump and his team yesterday… two things struck me as very interesting.
He was asked by a reporter what he had to say to those who are very afraid just now. His response was that it was a nasty question and the reporter was a bad reporter. He then explained that he was an optimist, that it was a matter of patriotic duty to be an optimist, and to promulgate narratives that were not optimistic was to promulgate fake news.
He also spoke in favor of using the anti-malarial drug, asking what people had to lose in trying it. Better to travel in hope than to criticise. When asked to comment, Dr Fauci did not disagree with the President, but pointed out that they were using different criteria. While the President’s words were optimistic, based on anecdotal evidence, Dr Fauci’s view, that we don’t yet know if it will work, was based on the current state of clinical evidence.
I wondered what was going on here. It appeared to me to be a collision between two quite different approaches to ‘truth’. The first of these emerged following the Reformation. People were no longer prepared to rely on priests to read the ‘truth’ on their behalf and there was an emancipation of reading, made possible by the Gutenberg and Caxton technologies. The Enlightenment emerged subsequently as a way in which individuals could learn how to read the right way. ‘Science’ as we have come to understand it was born, an ‘expert’ becoming someone who can say what is ‘true’ because they are recognised as knowing the right ways of reading. Except that there are many who would now say that so-called ‘experts’ are just the latest version of the pre-Reformation priests.
This is leading to the second approach to ‘truth’, made possible by social media and internet technology, for example by Google and Facebook. This is an emancipation of authorship in which individuals want to author their own ways of reading, i.e. their own ways of giving meaning to what is going on (wigo). It gives rise to people choosing to live in their own ‘bubble’, i.e. interacting with people who share the same authorial relationship to wigo, whether from a ‘left‘ or a ‘right‘ perspective. Historians refer to this ‘bubble’ effect as source bias in the way wigo is described (as distinct from the point-of-view of the observer doing the describing).
My hypothesis about what is going on, then, is that when President Trump refers to fake news, he is challenging the source bias of its authors. Those of us identified with the Enlightenment, on the other hand, are hearing what he is saying as challenging the factual basis of the news. Corroborating evidence here for my hypothesis is Zuckerberg’s defense of “primary source speech” last October, in which he equated it with giving voice to people. In practice, this meant Facebook not censoring politicians’ campaign material. In effect, President Trump is claiming the right to give voice to his views. We are questioning the factual basis of his views.
After the Reformation, society developed ‘science’ as a way of choosing between different ways of reading, institutionalised by universities. Are we now going to be seeing the institutionalisation of right ways of authoring? Is a dictatorship of a majority the way of determining which bubble we should be living in? What is to constitute ‘truth’ in an age of emancipated authorship? In an age of ‘critical studies’, in which it is as if each of us has at least one book in us, what, for example, makes a book worth writing? What would we say makes a primary source authentic?
The authenticity of feelings we have about something rests upon our personal valency for that way of feeling, ‘valency’ here meaning that which fits with our personal history. A bubble emerges through sharing aspects of our personal valency reflected in what we take to be ‘true’. To question our personal valency, therefore, is to question the authenticity of our speaking. What is in question here is not what we are saying so much as our ability to entertain doubt about the ‘truth’ of what we are saying.[1] I guess what distinguishes President Trump, then, is his wish that we not entertain doubt about what he is saying. How weird is that?
Notes
[1]. This invokes Peirce’s ‘irritation of doubt’, from his 1877 paper on “The Fixation of Belief” in Popular Science Monthly 12 (November), pages 1-15. This is the fourth in a series of ways of establishing ‘truth’ – (i) by common sense, (ii) by the method of authority, (iii) by a priori assumptions and (iv) by working through an ‘irritation of doubt’ raised by an existing ‘truth’. I consider the challenge presented by the fourth of these in Boxer, P. J. (2018). “Working with ‘the irritation of doubt’: the place of metaphor.” Socioanalysis 20: 27-50.
In describing the 3 asymmetries, Richard establishes a six-layer stratification relating underlying technologies to ultimate contexts-of-use. Thus in the case of orthotics, if we approach it from the point of view of a manufacturer of orthotic footwear, these layers look like increasingly general descriptions of the contexts within which the underlying technology will come to be used: technology=soles, product=footwear, business=footwear-to-order, solution=fitted footwear, customer demand=orthopedic patients, customer experience=difficulties in mobility. Is this therefore not just a hierarchy moving from the particular of the technology to the general of its uses?
If, as a supplier, we want to take a symmetric view of demand, then this is true – ‘orthopedic patients with difficulties in mobility’ is a general definition of the footwear manufacturer’s market.
But in distinguishing the third asymmetry we define the relationship to demand as being to a particular context-of-use that demands a particular form of orchestration and composition of services and products in order to satisfy it. Thus if we take up the perspective of the customer experience=the patient’s experience of living with their condition through its life, then the customer demand=that treatment for my condition that will have the greatest impact on my through-life experience at this time, and the solution=the treatment that is fitting for the current situation within its through-life context. Not surprising, then, that one of the major issues faced when insourcing clinicians employed by the manufacturers was how to reflect the through-life dimension of performance in the way the clinical service was contracted.
In finding the edge, we describe the particular form of orchestration and composition needed in response to asymmetric demand in terms of a wedge of services that needs its own four-colour model of how it is aligned to demand. Thus for our patient, the customer experience is in the black quadrant, the customer demand and its particular solution in the red quadrant, the business and its product(s) in the white quadrant, and the technology in the blue quadrant. East-West dominance means having a business agile enough to support the particular white-red organisation needed to sustain a relationship to the distinct forms of demand arising at its edges. But now the 6-layer stratification can no longer be thought of as a hierarchy, but rather as a particular structuring of the alignment between supply and demand – something more horizontal than vertical.
The way we understand the four-colour model is therefore central to the way this alignment is defined. In order to be able to construct it, three distinctions have to be made:
Internal//External: what is internal to the way we do business vs what is not. This distinguishes the provider of the insourced clinical service from the environment into which the service is being provided.
Viability//Identity: the way things work vs what determines the shape of the way things work. Clinicians learn about how orthoses are made and how they can be used on the musculo-skeletal system (the way things work), but the particular ways these are shaped depend on the patients’ characteristics and the way the manufacturer chooses to do business.
Addressed//Ignored: the domain of reality (later called the domain of relevance) being addressed vs not addressed. The domain defined from the point of view of the manufacturer is going to be much narrower than that defined from the point of view of the patient’s needs. The way the domain is defined is fundamental to governance-at-the-edge, and implicates the ‘I’ of the beholder. Thus when demand is assumed to be symmetric, the ‘I’ can be the view from the top/centre of the supplying business. But when it is assumed to be asymmetric, the ‘I’ must be defined collaboratively through the way the relationship at the edge is itself constructed.
The 3 asymmetries and their associated economies correspond to the relationships between the blue-white, white-red and red-black quadrants, accounting for the particular way the quadrants are held in relation to each other. By including the third asymmetry, the stratification can no longer take the form of a universal hierarchy, but instead must be particular to the relationship to demand. It is this which presents the business with its double challenge, and the necessity to shift from an object-oriented to a subject-oriented approach to modeling the relationship of the enterprise to the demands of its clients.
In his book Information and Organization, Boisot identifies four stages in the knowledge cycle, which he associates with four organizational cultures. These can be associated in turn with different strategies.
Knowledge
Diffused
Codified
Culture
Industry
Cycle
Typical
Strategy
Public
Yes
Yes
Market
Competition
Cost-Based (Sub-
Contract, Outsourcing)
Proprietary
No
Yes
Hierarchy
Monopoly
Product-Based
(Licensing, Hoarding)
Personal
No
No
Network
Start-Up
Problem-Based (Trading,
Intention Economy)
Common-sense
Yes
No
Clan
Oligopoly
Service-Based (Joint
Venture, Mashups)
Philip characterizes Microsoft as following a product-based strategy. I think this characterization is supported by the comments made by Bill Gates in his Mix06 keynote – for example, his idea that Microsoft customers benefit from the existence of other Microsoft customers because a large user base helps Microsoft to improve the product.
Meanwhile, companies like Google and Amazon are following a service-based strategy, and the evidence from the way they are used in mashups shows others are using their services to make the ‘jump’ to start new cycles (see interoperability landscapes). Can they also make this ‘jump’ – to start a new cycle at the next level up? Should they? How would such a strategy be accounted for commercially?
by Philip Boxer
In the chapter with Richard Veryard on Taking Governance to the Edge, I introduced a model of the WHAT, HOW, FOR WHOM and WHY of the relationship between a business and its environment:
The concept of a governance cycle was based on four different ways in which the supplying ‘inside’ could be related to demands on the ‘outside’, in which the movement around the cycle was driven by standardization or customization of supply and demand models. Thus in the move to ‘comparison’, demand is standardised, in moving to ‘cost’ supply is also standardised, and in taking up a ‘custom’ relation to demand, there is sufficient flexibility in standardised supply model to be able to customise its relation to demand in different contexts:
The names for two of these four ways came from research on shopping behaviour by Gary Davies in which he distinguished ‘cost’ convenience (choosing between similar standardised offerings) and ‘comparison’ behaviours (choosing between different solutions to the same demand). The other two separated out circumstances where there was a demand particular to the customer, distinguishing offerings in which there was only one place for the customer to go ( ‘destination’), or in which the supplier would adapt the offering to the customer’s requirement ( ‘custom’) within their context-of-use. The point being made, however, was that the ‘destination’ form of offering required asymmetric governance because of the need to hold power at the edge of the organisation. What distinguishes this position in the cycle?
If we think of the original development of pc-based spreadsheet programs in-house (destination), they soon became a limited number of alternative branded solutions (comparison) that in turn became dominated by the one offering all the others’ features in one package (cost). From here we have seen an increasing ability to customise the ways it can be used (custom) to the point where we are now looking at a new cycle of web-based solutions that we can build one-by-one (destination).
An answer can be found in Max Boisot’s book on Information and Organisations (HarperCollins 1994) in which he distinguishes two axes, one giving an account of the codification of a domain of knowledge, and the other an account of the diffusion of that knowledge across a population. Four different kinds of knowledge are described by him as a result:
Public knowledge, such as textbooks and newspapers, which is codified and diffused.
Proprietary knowledge, such as patents and official secrets, which is codified but not diffused. Here barriers to diffusion have to be set up.
Personal knowledge, such as biographical knowledge, which is neither codified nor diffused.
Common sense – i.e. what ‘everybody knows’, which is not codified but widely diffused.
With this comes a knowledge diffusion cycle, which we can approach in the same way as the cycle above, with the ‘solution’ being offered lying along the codification axis, and the customer’s ‘problem’ to which the supplier is offering a solution lying along the diffusion axis:
The result is a cycle showing the initial (problem-based) response as being a personal one to a particular demand in its particular context. A knowledge engineering process of codification can then transform this into a ‘product’, which can remain proprietary for as long as the codification can itself be protected (hoarded). Insofar as it cannot, it becomes public knowledge, so that competition is in terms of the cost of its provision. Finally, the process of embedding this public knowledge back into particular contexts through engineering use value takes us into the ‘custom’ quadrant. From here, the ‘jump’ is about starting a new cycle in relation to a new problem-based response.
It is easy to see in the ‘hoarding’ response a way of describing Microsoft’s defence of its market-leading position. In contrast, the Google approach has sought to accelerate the diffusion and embedding of its technology into others’ mashups to create competing ecosystems (and their associated landscapes) – a strategy of riding the cycle as a whole instead of seeking to hold position within it.1
We see now how it is the personal nature of this problem-based response that distinguishes taking power to the edge of the organisation. It used to be sufficient to rely on the ‘free’ market to incubate such innovations. All business then had to do was to buy the idea, and manage the rest of the governance cycle. The point we make in our paper, however, is that this is becoming more difficult not only because the rest of the cycle is speeding up, but also because demand itself is becoming increasing asymmetric: everyone wanting something different. So in the 21st Century the whole cycle is having to be managed, with the balance between the stages in the cycle changing. This presents those leading at the edge with a double challenge, but it also presents those at the centre with the leadership challenge of developing a capacity for asymmetric governance.
Notes
[1] An interesting example of this is to be found in on of the essays in Platform Economics, called “Two-Sided Markets” by David Evans. To quote from pp145-146:
Two-sided platforms coexist and compete with other business models to fulfill customer needs. Market definition must consider the diverse ways in which a two-sided platform may face rivalry, taking into account the market participants’ reactions to price changes. These reactions are more difficult to predict when the firms are following different business models.
First, a two-sided platform may face single-sided competition on one or both sides. For example, a shopping mall developer faces competition from single stores for the attention of shoppers, as well as from real-estate investors that rent single-store locations. The degree to which these single-sided alternatives constrain the two-sided mall’s conduct is an empirical question.
An example of this is the Microsoft Office Suite competing with the (originally) separately sold word-processing and spreadsheet packages. But now consider Evans’ second type of situation (he goes on further, but these two types serve my purposes here):
Second, a two-sided platform may compete with a three-sided platform. The three-sided rival produces another product which could, for example, have below-cost prices on both sides served by the two-sided platform. A two-sided platform is particularly vulnerable to competition by a three-sided platform that uses its third side to subsidize both of the other sides. This asymmetric competition is potentially lethal to a platform that does not provide the third side. A multi-sided platform can therefore use “envelopment” to challenge platforms that provide a subset of the services it provides. It adds another group of customers to the platform and uses revenues from
this group of customers to lower the price—possibly to zero—of the key profit-generating side of the other platform.
For example, Google gives away office productivity software that competes with Microsoft’s software to users and software developers.44 By doing so, Google attracts customers and profits by selling access to those customers to advertisers. Google can use its advertising revenue
to compete with Microsoft in software. Competition from this advertising-supported software model has led Microsoft to enter into advertising to ensure that it also has a stream of advertising revenue available.
The example here is of Google building targetable traffic by accelerating the diffusion and embedding of the (in this case) office productivity technologies, subsuming Microsoft’s pursuit of direct value by its own pursuit of indirect value. (For more on this distinction, see what distinguishes a platform strategy).
“It’s a serious book. The authors argue that the return of the network form of organization, while it has some economic logic sometimes, is often just a political solution that has become available, and that it is not necessarily more rational, but may benefit some interests, often at the expense of workers who are poorly treated, promoting an atmosphere of rootlessness that is no good for the more steady social system that is necessary for substantial innovation, rather than the rapid marginal effects of edge initiatives. So there’s lots of stuff about how edge work is different, and hard on the worker.”
He went on to ask whether this is a necessary consequence of ‘edge’ forms of working. I don’t think it has to be. Rather it needs to be seen as a consequence of misalignment between forms of organisation and the response to demand: a failure to meet a double challenge.
This double challenge can be understood in terms of the following double diamond, in which each side presents a challenge, to which is added the need to match the relationship being demanded on the right with a corresponding (mirror-image) basis of authority on the left. Thus increasing demands from the customer on the right for customisation and timely coupling with their individual context-of-use (an ‘edge’ relationship) are not matched by a correspondingly appropriate span of responsibility and accountability to the customer’s situation on the left:
So the double challenge involves not only responding to the customer’s demand, but also creating the organisational context that will sustain that response. It is this second part of the challenge that is not being taken up. Thus:
Historically, the assumption was that interoperability was endogenous to the enterprise silo, and so could be resolved hierarchically through processes of deconfliction (i.e. through accountability to hierarchy instead of to situation).
With the flattening of (vertical) hierarchies and growth of horizontal linkages between them, enterprise silos are being faced increasingly with interoperability that is exogenous to the enterprise silo (i.e. the span of complexity required exceeding the span of control).
Under stable conditions of demand, this flattening just amounts to using technology to take costs out of existing forms of organisation. But demand is not stable, and the big (‘21st century’) challenge is managing the risks arising from addressing new forms of demand within this new environment. The book is right in saying that this flattening can be very destructive. If it is just about taking out costs and not really addressing the change/development agendas, then it is very punishing on the people working within them because they are continually being expected to do more than their role is set up to do. The effect is that people are increasingly expected to work across a span of complexity that stretches beyond the hierarchies to which they are being held accountable, producing burnout, dependency on informal networks and long-term exhaustion.
So what is the solution?
The traditional way of managing interoperability is through establishing forms of vertical transparency consistent with the way in which the constituent activities have been deconflicted. The new forms of edge role require new forms of horizontal transparency that are consistent with the horizontal forms of linkage needed across enterprise silos to support them. Horizontal transparency enables different forms of accountability to be used that take power to the edge, but which in turn require asymmetric forms of governance. (see the paper on “Taking Governance to the Edge”). Asymmetric design is our name for a process that supports asymmetric forms of governance, establishing the horizontal forms of transparency needed to sustain new forms of response to demand at the edge.
by Philip Boxer
The Tavistock Institute of Human Relations recently published this paper on the challenge faced by leadership in the 21st Century in their pamphlet on learning (page 2).
The paper argues that this challenge is a double challenge: organisations are being presented increasingly with forms of demand that are asymmetric to their assumptions about demand. Even if customers don’t want more, they at least want what they are being offered in a way that relates particularly to them. This means that for leaders it is not sufficient to find new ways of addressing demand – it is also necessary to question the existing terms within which they themselves understand demand. Asymmetric demands require you to pay attention to what you don’t know.
The lesson to be learnt from the military about threats is that you can die if you ignore them. In creating a double challenge for leadership, the threat presented by asymmetric forms of demand is that they question the current basis of power and authority of the leadership itself. This is the 21st Century challenge to leadership – to find the basis of their authority in the value they create within their customers’ contexts-of-use.
The Tavistock Institute is an example of an organisation committed to taking up this double challenge in its work with its clients. |
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Mozilla Universal charset detector code.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 2001
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Shy Shalom <shooshX@gmail.com>
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#ifndef nsCharSetProber_h__
#define nsCharSetProber_h__
#include "nscore.h"
#define DEBUG_chardet // Uncomment this for debug dump.
typedef enum {
eDetecting = 0, //We are still detecting, no sure answer yet, but caller can ask for confidence.
eFoundIt = 1, //That's a positive answer
eNotMe = 2 //Negative answer
} nsProbingState;
#define SHORTCUT_THRESHOLD (float)0.95
class nsCharSetProber {
public:
virtual ~nsCharSetProber() {};
virtual const char* GetCharSetName() = 0;
virtual nsProbingState HandleData(const char* aBuf, PRUint32 aLen) = 0;
virtual nsProbingState GetState(void) = 0;
virtual void Reset(void) = 0;
virtual float GetConfidence(void) = 0;
virtual void SetOpion() = 0;
#ifdef DEBUG_chardet
virtual void DumpStatus() {};
#endif
// Helper functions used in the Latin1 and Group probers.
// both functions Allocate a new buffer for newBuf. This buffer should be
// freed by the caller using PR_FREEIF.
// Both functions return PR_FALSE in case of memory allocation failure.
static PRBool FilterWithoutEnglishLetters(const char* aBuf, PRUint32 aLen, char** newBuf, PRUint32& newLen);
static PRBool FilterWithEnglishLetters(const char* aBuf, PRUint32 aLen, char** newBuf, PRUint32& newLen);
};
#endif /* nsCharSetProber_h__ */
|
Load of challenge Marek's disease virus DNA in blood as a criterion for early diagnosis of Marek's disease tumors.
Outbreaks of Marek's disease (MD) in vaccinated flocks still occur sporadically and lead to economic losses. Unfortunately, adequate methods to predict MD outbreaks are lacking. In the present study, we have evaluated whether high load of challenge MD virus (MDV) DNA in peripheral blood could aid in the early diagnosis of MD and in monitoring efficacy of vaccines against MD. One experiment was conducted to simulate field conditions by combining various vaccines (turkey herpesvirus [HVT] and HVT + MDV serotype 2 [SB1]) and challenge viruses (GA, Md5, and 648A). Vaccine efficacy among our experimental groups ranged from 13.3% to 94.2%. Each chicken was sampled three times during the length of the experiment (3, 5, and 15 wk postchallenge [wpc]), and gross lesions were evaluated in chickens that died and at termination of the experiment. DNA was extracted from whole blood and buffy coats from each sample, and the load of challenge MDV DNA and HVT DNA were quantified by real-time polymerase chain reaction. Chickens that developed MD by the end of the experiment had higher load of challenge MDV DNA (threshold cycle [Ct] glyceraldehyde-3-phosphate dehydrogenase [GAPDH]/Ct glycoprotein B [gB] ratios of 1.0, 1.04, and 1.05 at 3, 5, and 15 wpc, respectively) than those that did not develop MD (Ct GAPDH/Ct gB ratios of 0.7, 0.69, and 0.46 at 3, 5, and 15 wpc, respectively). However, load of HVT DNA in blood was not correlated with the development of tumors (Ct GAPDH/Ct HVT ratios from 0.04 to 0.10 in both groups). Vaccinated groups with >75% protection had statistically significant less challenge DNA virus (Ct GAPDH/Ct gB ratios of 0.76, 0.70, and 0.45 at 3, 5, and 15 wpc, respectively) than less protected groups (Ct GAPDH/Ct gB ratios of 0.92, 0.97, and 0.85 at 3, 5, and 15 wpc, respectively). No differences in the load of HVT DNA could be found between protected and nonprotected groups at any time point of the study (Ct GAPDH/Ct HVT from 0.05 to 0.09 in both groups). Our results showed that load of challenge MDV DNA but not load of HVT DNA in blood can be used as criterion for early diagnosis of MD. |
The high-affinity IgE receptor (Fc epsilon RI): from physiology to pathology.
The high affinity receptor for immunoglobulin E (designated Fc epsilon RI) is the member of the antigen (Ag) receptor superfamily responsible for linking pathogen-or allergen-specific IgEs with cellular immunologic effector functions. This review provides background information on Fc epsilon RI function combined with more detailed summaries of recent progress in understanding specific aspects of Fc epsilon RI biology and biochemistry. Topics covered include the coordination and function of the large multiprotein signaling complexes that are assembled when Fc epsilon RI and other Ag receptors are engaged, new information on human receptor structures and tissue distribution, and the role of the FcR beta chain in signaling and its potential contribution to atopic phenotypes. |
Context-Aware Visual Policy Network for Fine-Grained Image Captioning.
With the maturity of visual detection techniques, we are more ambitious in describing visual content with open-vocabulary, fine-grained and free-form language, i.e., the task of image captioning. In particular, we are interested in generating longer, richer and more fine-grained sentences and paragraphs as image descriptions. Image captioning can be translated to the task of sequential language prediction given visual content, where the output sequence forms natural language description with plausible grammar. However, existing image captioning methods focus only on language policy while not visual policy, and thus fail to capture visual context that are crucial for compositional reasoning such as object relationships (e.g., "man riding horse") and visual comparisons (e.g., "small(er) cat"). This issue is especially severe when generating longer sequences such as a paragraph. To fill the gap, we propose a Context-Aware Visual Policy network (CAVP) for fine-grained image-to-language generation: image sentence captioning and image paragraph captioning. During captioning, CAVP explicitly considers the previous visual attentions as context, and decides whether the context is used for the current word/sentence generation given the current visual attention. Compared against traditional visual attention mechanism that only fixes a single visual region at each step, CAVP can attend to complex visual compositions over time. The whole image captioning model-CAVP and its subsequent language policy network - can be efficiently optimized end-to-end by using an actor-critic policy gradient method. We have demonstrated the effectiveness of CAVP by state-of-the-art performances on MS-COCO and Stanford captioning datasets, using various metrics and sensible visualizations of qualitative visual context. |
Gaming studio new website for Deity Productions
Deity are giving away the first two games built for the windows platform completely FREE. Simply register your details and you can download TRALAXY and IN RUIN. They have a forum and are actively encouraging users to download and play their games and give feedback as these games are all part of a bigger picture. The aim is to produce one large game, titled 'When Angels Fall' which is a project that is in pre-production as we speak.
Deity came to Vinehaus requiring a clean site that would enable users to register their interest in order to download the FREE games, this we have provided and wish them well in their new venture. |
Two children are dead after a freak jumping castle accident at a fair in China, with a dust devil flinging the inflatable structure around in the air before sending it crashing to the ground.
Key points: An unexpected dust devil hit a fair in China, causing havoc
An unexpected dust devil hit a fair in China, causing havoc People were picked up along with the jumping castle before falling back to the ground
People were picked up along with the jumping castle before falling back to the ground Two children died after hitting concrete, but others landed in trees
At least 22 people were also injured in the incident on Sunday afternoon (local time) at a pear orchard in Yucheng County, Henan province.
Video of the incident shows the dust devil approaching before the jumping castle is lifted up and spun around.
People can be seen bracing against the wind and ducking for cover as the wind hits and items are lifted off the ground.
One other child was left in a critical condition, according to a statement from the Shangqiu City Government.
Dust devils are not usually considered dangerous, but can sometimes become large enough to threaten people. ( Weibo: Subaoge )
"Twenty two people were injured, including two children who died after ineffective emergency treatment, and another child was severely injured and transferred to the intensive care unit," the statement read.
"The surgery for this child was completed successfully, while the [other] 19 people remain in a stable condition."
The dust devil struck when there were more than 400 people attending the fair, which is held every year when the local pear trees are in blossom.
Chines media reported the weather event only lasted a few minutes before it dissipated.
The children who died fell onto concrete according to the statement, while the others fell into tree branches and mud and escaped with less serious injuries.
The jumping castle is flung through the air during the incident. ( Weibo: Subaoge )
Dust devils are small whirlwinds caused by hot air near the surface rising rapidly through cooler air above.
Reports of injury and fatalities are uncommon. |
Actions of non-steroidal anti-inflammatory drugs on equine leucocyte movement in vitro.
The direct effects of four non-steroidal anti-inflammatory drugs (NSAIDs) on equine polymorphonuclear (PMN) and mononuclear (MN) leucocyte movement were investigated using two in vitro assay systems. The Boyden chamber microfilter technique measures both chemokinetic and chemotactic locomotion, and the agarose microdroplet assay measures solely chemokinesis. Zymosan-activated plasma (ZAP) and the synthetic peptide N-formyl-methionyl-leucyl-phenylalanine (FMLP) were used as standard chemoattractants for PMN and MN leucocytes, respectively. The actions of six concentrations of each NSAID, indomethacin (50 microM-10 mM), phenylbutazone (10 microM-1 mM), oxyphenbutazone (2.5 microM-500 microM) and flunixin (0.1 microM-50 microM), in suppressing cell movement induced by ZAP and FMLP were investigated. All four drugs exerted inhibitory effects on induced movement of both cell types in the Boyden chamber assay, usually in a concentration-dependent manner, although oxyphenbutazone action on PMN cells occurred only at the highest concentration tested. Significant inhibition of PMN and MN cell locomotion was produced by indomethacin, flunixin and oxyphenbutazone, and inhibition of PMN movement by phenylbutazone occurred in the agarose microdroplet assay. Flunixin was the most potent of the four drugs investigated in both assay systems. The findings may be of importance to the use of phenylbutazone and flunixin as NSAIDs in equine medicine, since the concentrations used were similar to concentrations of both drugs and the phenylbutazone metabolite oxyphenbutazone previously reported to occur in equine plasma and inflammatory exudate. |
After a 10-match winless league run, Omiya's hopes of avoiding the drop appeared slim but, under new boss Hiroki Shibuya, they won back-to-back top-flight matches to reinvigorate their survival fight.
However, Frontale, who are second in the table, headed to the NACK5 Stadium eager to put Saturday's 0-0 stalemate with Tokyo behind them and they did just that with a convincing 3-1 win.
Okubo proved the difference, opening the scoring in the 21st minute before doubling his tally five minutes after the break.
The 32-year-old then took his J.League goal total for the season to 15 by putting the game beyond doubt with 11 minutes left on the clock, before an own goal from Yusuke Tanaka in the close stages handed Omiya a consolation.
Frontale remain six points off top spot, though, as leaders Urawa Reds were 2-0 victors at mid-table Albirex Niigata, goals in each half from Shinzo Koroki and Ryota Moriwaki proving enough for three points.
The race for the third and final AFC Champions League spot continues to excite in the J.League and Kashima Antlers moved into third thanks to a 1-0 triumph at Vegalta Sendai, Shoma Doi's strike enough to consign the hosts to a fifth straight defeat - leaving them just two points above the drop zone.
Sagan Tosu had started Tuesday's play in third, but they fell to a 2-0 setback at Kashiwa Reysol thanks to two goals in the space of eight second-half minutes from Masato Kudo.
Gamba Osaka remain in the hunt for a position in continental competition as Kenta Hasegawa's men ran out comfortable 3-0 winners at Shimizu S-Pulse, who remain mired in relegation trouble.
Elsewhere, Tokyo routed rock-bottom Tokushima Vortis 4-0 at the Ajinomoto Stadium and Ventforet Kofu secured a precious three points in a 2-0 triumph over Vissel Kobe.
In other matches, Cerezo Osaka failed to escape the drop zone after losing 2-1 at home to Nagoya Grampus and Yokohama F Marinos defeated Sanfrecce Hiroshima 1-0. |
import React from 'react';
import Enzyme, { mount } from 'enzyme';
import Adapter from 'enzyme-adapter-react-16';
import assert from 'power-assert';
import SplitButton from '../../src/split-button/index';
import '../../src/split-button/style.js';
Enzyme.configure({ adapter: new Adapter() });
/* eslint-disable no-undef,react/jsx-filename-extension */
describe('SplitButton', () => {
const menu = ['a', 'b'].map(item => (
<SplitButton.Item key={item}>{item}</SplitButton.Item>
));
let wrapper;
afterEach(() => {
if (wrapper) {
wrapper.unmount();
wrapper = null;
}
});
describe('render', () => {
it('should render', () => {
const wrapper = mount(
<SplitButton label="hello world">{menu}</SplitButton>
);
assert(wrapper.find('div.next-split-btn').length === 1);
});
it('should controlled selectedkeys', () => {
const wrapper = mount(
<SplitButton
label="hello world"
visible
selectedKeys={['a']}
selectMode="single"
>
{menu}
</SplitButton>
);
wrapper.setProps({ selectedKeys: ['b'] });
assert(
wrapper
.find('li[title="b"][role="option"]')
.hasClass('next-selected')
);
});
it('should controlled popup visible', () => {
const wrapper = mount(
<SplitButton label="hello world">{menu}</SplitButton>
);
assert(wrapper.find('.next-menu').length === 0);
wrapper.setProps({ visible: true });
assert(wrapper.find('.next-menu').length === 1);
});
});
describe('action', () => {
it('should click trigger to open the popup', () => {
let visible;
const wrapper = mount(
<SplitButton
label="hello world"
onVisibleChange={vis => (visible = vis)}
>
{menu}
</SplitButton>
);
wrapper.find('button.next-split-btn-trigger').simulate('click');
assert(wrapper.find('.next-menu').length === 1);
assert(visible);
});
it('should select in uncontrolled mode', () => {
const wrapper = mount(
<SplitButton label="hello world" visible selectMode="single">
{menu}
</SplitButton>
);
wrapper.find('li[title="b"][role="option"]').simulate('click');
assert(
wrapper
.find('li[title="b"][role="option"]')
.hasClass('next-selected')
);
});
it('should select in controlled mode', () => {
const wrapper = mount(
<SplitButton
label="hello world"
visible
selectedKeys={['a']}
selectMode="single"
>
{menu}
</SplitButton>
);
wrapper.find('li[title="b"][role="option"]').simulate('click');
assert(
wrapper
.find('li[title="a"][role="option"]')
.hasClass('next-selected')
);
});
});
});
|
In the past, there has been proposed a manual disconnecting switch used for a circuit provided with a high-voltage battery (for example, see Japanese Patent Application Publication No. 2011-134698). This disconnecting switch includes: a contact part that is disposed in a closed vessel and that has a stationary contact and a movable contact configured to be brought into contact with and separate from the stationary contact freely; a shaft which is disposed so that a part thereof protrudes outward from the closed vessel; and a metal bellows for ensuring air tightness of the closed vessel. This disconnecting switch further includes: an open/close mechanism part configured to move the shaft back and forth freely between a closed contact position at which the movable contact is in contact with the stationary contact and an open contact position at which the movable contact is out of contact from the stationary contact; and a housing that houses above components. The open/close mechanism part is constituted by an operation lever which is disposed so that an operation portion thereof protrudes outward from the housing, and two rod-shaped arms which connect the operation lever and the shaft so as to move the shaft between the closed contact position and the open contact position according to an operation of the operation lever.
In this disconnecting switch, when the operation lever is positioned at an OFF position where the contact part is in an open contact state, the two arms are held in a state of forming a V-shape under an inner pressure of the closed vessel and a spring force of the metal bellows, and the contact part is thereby held in the open contact state. Further, when the operation lever is positioned at an ON position where the contact part is in a closed contact state, the two arms are held in a state of forming a reversed V-shape under the inner pressure of the closed vessel and the spring force of the metal bellows, and the contact part is thereby held in the closed contact state.
However, in the disconnecting switch shown in an above Patent Document 1, there has been a problem that the disconnecting switch has a large size because there needs a moving space for the two arms which connect the operation lever and the shaft and which are designed to rotate in opposite directions in conjunction with each other. |
Most E-Cigarette Vapour Poses No Risk to Heart According to New Study
Have you ever heard of cytotoxicity? Well, if you are like most people that is not a word you use every day of the week. Cytotoxicity refers to how toxic a substance is. It is the measure of a substances potential to kill or damage a cell. There are some substances that have a very high cytotoxicity, tobacco cigarette smoke is among these. This means that tobacco smoke kills cells at a very high rate. This does not come as a surprise to most people. There has been a lot of research done on the subject. But what about the cytotoxicity of electronic cigarettes?
Many people say that electronic cigarettes are healthier then tobacco cigarettes. If this is true then e-liquids would have a much lower incidence of cytotoxicity than tobacco smoke. Up until this point, there has been very little research conducted on the safety of electronic cigarette vapour, to determine its relative cytotoxicity. For this reason, Dr. Konstantinos Farsalinos and a team of researchers decided to test various electronic cigarette vapours to determine their relative cytotoxicity. In their study, twenty e-liquids were tested against the results of tobacco cigarette smoke.
Tobacco cigarette smoke is known to have a high cytotoxicity, in part because of the thousands of chemicals in it. A lot of these chemicals are produced when tobacco is burned. Since electronic cigarettes don’t contain tobacco, this chemical reaction that produces most of these chemicals, is not present in them. Because of this, it was theorised that electronic cigarette vapour would show a much lower level of cytotoxicity then tobacco cigarette smoke shows.
Let’s look at how the study was conducted. Twenty e-liquids were used in this study; all taken from varying distributors. Each e-liquid was tested on cultured heart cells, to determine the effect of the liquid on the cells. The testing was done in vitro, meaning in a lab, on cultured heart cells. For many reasons, it is not possible to do this testing in vivo, meaning in live subjects. To get the most accurate results, tobacco smoke was also used on cultured heart cells to determine its effect on the cells. These in vitro results from the tobacco smoke could be looked at in light of already collected evidence from in vivo data. This would help the researcher to understand how their findings, from a controlled lab environment, translated into real life applications.
All e-liquids were converted to a vapour before being tested on the heart cells. All electronic cigarettes were activated at 6.2 Watts, and then four random samples were also activated at 9.2 Watts. This study was the first to look how the use of high voltage effects e-liquid toxicity. To help keep the consistency in testing, all batteries were fully charged before each use and atomisers where replaced before each test. An experienced vaper also tested the e-cigs for what is called dry-puffs. This is when there is not enough liquid in a wick. The length of each puff was then corrected, if need, to account for this aspect of vaping.
Both the vapour and smoke from the tobacco cigarettes were tested on the cultured heart cells. A control group of cultured heart cells, which did not have either vapour or smoke exposure, was also studied. This allowed for rate of cell death ratios to be taken for each substance along with the control group. If more the 30 percent of the cell is killed, the substance considered to be cytotoxic.
As put forth in their theory, overall the e-liquid exhibited a much lower cytotoxicity than the tobacco smoke. The results were looked at in relation to the viability of each substance. Viability is the term that is used to describe the amount of cells that are able to live through the experiment. The lower the viability percentage the low the amount of living cells. The higher the viability percentage, the higher the amount of living cells. Not surprisingly, cigarette smoke at a concentration of over 12.5 percent always produced cytotoxicity. The pure extract produced a viability of 3.9 percent.
When testing the e-liquids, varying degrees of concentrations were tested. Extracts in pure form were also tested. Only four e-liquids reached cytotoxicity. One was the Cinnamon Cookie e-liquid which had a viability of around 65 percent. The other three were pure extracts that were produced by the House of Liquid and used actual tobacco leaves in the making of the e-liquid flavouring. The rest of the e-liquids had no cytotoxicity and a much higher viability.
There were then four samples that were tested randomly at high voltages. None of these showed cytotoxicity. Although their viability did drop slightly. This indicates that there can be a minimal health risk if using higher voltages. But none of these were effected enough to cause them to become cytotoxic. They also tested differing nicotine levels for cytotoxicity. The different levels did not cause any cytotoxicity, although there was a slight drop in viability depending on how pure the extract was. The Propylene glycol and vegetable glycerine never produced cytotoxicity or any noticeable drop in viability.
After analysing all the results, it is clear that according to this study the main thing that impacts the cytotoxicity of e-liquids in what is used to flavour the e-liquid. It is interesting to note that one of the e-liquids from the House of Liquid was even worse than the pure extract of tobacco cigarette smoke in regards to viability. While another e-liquid that was produced using the same technic was not cytotoxic at all. It is possible that impurities were able to seep through during the manufacturing process and possibly the use of different leaves also had an impact on the final products toxicity. More research is needed to understand the implications of this finding in regards to the use of actual tobacco leaves in the manufacturing of a flavour. Fortunately, this is not a common practice for most manufacturers.
Overall this research showed very positive results. Although there was a small risk associated with some e-liquids, this was related to the flavouring added or how that flavouring was manufactured. The nicotine, propylene glycol and vegetable glycerine, which are the main ingredients in e-liquids, did not cause any cytotoxicity as pointed out in the results. The worst results, from the e-liquid samples, came from an unusual manufacturing process and need more research to understand and help this procedure to be safer. The other e-liquid that showed slight cytotoxicity was the e-liquid which used cinnamon oil in the flavouring. This is understandable due to the known potential toxicity of cinnamon oil. It was noted that the other flavouring did not carry any risk of toxicity.
In conclusion, this research indicates that e-liquids, on a whole, do not produce the type of destruction and death to cells that tobacco cigarette smoke produces. There were minor risks associated with the use of cinnamon flavouring and the House of Liquids’ tobacco flavouring. This needs to be researched more to help make the process healthier. At this point, it might be safer to avoid such flavours. Overall the e-liquids did not show cytotoxicity. This research indicates that e-liquids are a much healthier option than tobacco smoke, due to the fact that they are much less likely to kill cells. |
The correlation between serum lipid levels and the percentage of human peripheral blood lymphocytes bearing some surface markers.
The correlations between serum HDL, total cholesterol, triglycerides or free fatty acids levels and the percentage of human peripheral blood lymphocytes bearing receptors for SRBC, MRBC, Con A or sIgG were sought in the aged people. The persons examined showed a marked heterogeneity in their serum lipid levels as well as in the results of lymphocyte surface receptor analysis. However, the only correlation found was that between the percentage of MRBC-rosette forming cells and the level of serum free fatty acids. The total cholesterol level, known as the modulator of some physical parameters of lymphocyte membrane, had, in our examination, no correlation with the changes of surface properties of lymphocytes. The possible physiological role of the phenomena observed is discussed. |
The legendary and prolific William Shatner joins Amoeba in celebrating the release of his new space-themed concept album, Seeking Major Tom (out October 11 on Cleopatra Records) with a signing at Amoeba Hollywood!
PURCHASE ONE OF THE FOLLOWING SHATNER ITEMS starting October 11 at Amoeba Hollywood:
– Seeking Major Tom (LP or CD),
– The Captains (DVD)
– Shatner Rules (Book)
And receive a ticket to attend the signing on 10/14.
Limit 2 (of the above) items and signing tickets per person.
Only these items will be signed by Mr. Shatner.
SIGNING IS LIMITED – first come, first served.
– No personal photos with Mr. Shatner (Amoeba will have staff photographer taking event/fan shots and we’ll post online after the event).
Seeking Major Tom info:
William Shatner returns to the final frontier of music recording with this space-themed concept album that boldly goes where no man has gone before – available on both 2-CD and 3-LP set!
The Captains info:
Since first soaring onto television screens in the 1960s, Star Trek has become one of the most beloved franchises of all time. Now, the original Captain Kirk, William Shatner, travels around the globe to interview the elite group of actors (Chris Pine, Patrick Stewart, Avery Brooks, Kate Mulgrew and Scott Bakula) who have portrayed the role of Starship Captain, giving fans an exclusive behind-the-scenes look at the pop culture phenomenon as well as the men and women who made it so.
Shatner Rules: Your Guide to Understanding the Shatnerverse and the World at Large info:
This collection of rules, illustrated with stories from Bill’s illustrious life and career, will show you how Bill became WILLIAM SHATNER, larger than life and bigger than any role he ever played. Shatner Rules is your guide to becoming William Shatner. Or more accurately, beautifully Shatneresque.
Because let’s face it… Shatner does rule, doesn’t he? |
Q:
WCF CustomBing exception - AddressingNone does not support adding WS-Addressing headers
I keep getting the following exception when I use my pragmatically created CustomBinding.
Addressing Version 'AddressingNone (http://schemas.microsoft.com/ws/2005/05/addressing/none)' does not support adding WS-Addressing headers.
Is there any way to resolve this issue?
private static CustomBinding CreateCustomBinding(bool useHttps)
{
BindingElement security;
BindingElement transport;
if (useHttps)
{
security = SecurityBindingElement.CreateSecureConversationBindingElement(
SecurityBindingElement.CreateUserNameOverTransportBindingElement());
transport = new HttpsTransportBindingElement
{
MaxBufferPoolSize = 2147483647,
MaxBufferSize = 2147483647,
MaxReceivedMessageSize = 2147483647,
};
}
else
{
security = SecurityBindingElement.CreateSecureConversationBindingElement(
SecurityBindingElement.CreateUserNameForSslBindingElement(true));
transport = new HttpTransportBindingElement
{
MaxBufferPoolSize = 2147483647,
MaxBufferSize = 2147483647,
MaxReceivedMessageSize = 2147483647,
};
}
var encoding = new MtomMessageEncodingBindingElement
{
MaxReadPoolSize = 64,
MaxWritePoolSize = 16,
MaxBufferSize = 2147483647,
MessageVersion = MessageVersion.Soap11,
WriteEncoding = System.Text.Encoding.UTF8
};
//var encoding = new TextMessageEncodingBindingElement();
var customBinding = new CustomBinding();
customBinding.Elements.Add(security);
customBinding.Elements.Add(encoding);
customBinding.Elements.Add(transport);
return customBinding;
}
A:
Just in case anyone is interested, below is my solution. I added an if for dealing with the text encoding section and also updated the SecurityBindingElement under if (useHttps):
private static CustomBinding CreateCustomBinding(bool useHttps, bool textEncoding)
{
BindingElement security;
BindingElement encoding;
BindingElement transport;
if (useHttps)
{
var seq = SecurityBindingElement.CreateUserNameOverTransportBindingElement();
seq.MessageSecurityVersion =
MessageSecurityVersion.
WSSecurity11WSTrustFebruary2005WSSecureConversationFebruary2005WSSecurityPolicy11BasicSecurityProfile10;
seq.SecurityHeaderLayout = SecurityHeaderLayout.Lax;
seq.DefaultAlgorithmSuite = SecurityAlgorithmSuite.Default;
security = seq;
transport = new HttpsTransportBindingElement
{
MaxBufferPoolSize = 2147483647,
MaxBufferSize = 2147483647,
MaxReceivedMessageSize = 2147483647,
};
}
else
{
security = SecurityBindingElement.CreateUserNameOverTransportBindingElement();
transport = new HttpTransportBindingElement
{
MaxBufferPoolSize = 2147483647,
MaxBufferSize = 2147483647,
MaxReceivedMessageSize = 2147483647,
};
}
if (textEncoding)
encoding = new TextMessageEncodingBindingElement
{
MaxReadPoolSize = 64,
MaxWritePoolSize = 16,
MessageVersion = MessageVersion.Soap11,
WriteEncoding = System.Text.Encoding.UTF8
};
else
encoding = new MtomMessageEncodingBindingElement
{
MaxReadPoolSize = 64,
MaxWritePoolSize = 16,
MaxBufferSize = 2147483647,
MessageVersion = MessageVersion.Soap11,
WriteEncoding = System.Text.Encoding.UTF8
};
var customBinding = new CustomBinding();
customBinding.Elements.Add(security);
customBinding.Elements.Add(encoding);
customBinding.Elements.Add(transport);
return customBinding;
}
|
Codon optimization enhances protein expression of Bombyx mori nucleopolyhedrovirus DNA polymerase in E. coli.
Bombyx mori nucleopolyhedrovirus (BmNPV) is a major viral agent that causes deadly grasserie disease in silkworms, while BmNPV DNA polymerase (BmNPV-pol), encoded by ORF53 gene, plays a central role in viral DNA replication. Efficacy studies of BmNPV-POL are limited because of poor heterologous protein expression in E. coli. Here, we redesigned the BmNPV-pol to preferentially match codon frequencies of E. coli without altering the amino acid sequence. Following de novo synthesis, codon-optimized BmNPV-pol (co-BmNPV-pol) gene was cloned into pET32a and pGEX-4T-2 vector. The expression of co-BmNPV-POL in E. coli was significantly increased when BmNPV-POL was fused with GST protein rather than a His-tag. The co-BmNPV-POL fusion proteins were isolated using GST affinity chromatography and Mono Q iron exchange chromatography. Protein purity and identity were confirmed by western blot and MALDI-TOF analyses. The biological activity of purified proteins was measured on a poly(dA)/oligo(dT) primer/template. The specific polymerasing activity of the recombinant BmNPV-POL was 6,329 units/mg at optimal conditions. Thus, a large amount of purified protein as a soluble form with high activity would provide many benefits for the functional research and application of BmNPV-POL. |
package structs
import (
"crypto/sha1"
"fmt"
"hash"
"io"
"net/url"
"reflect"
"regexp"
"sort"
"strconv"
"strings"
"time"
"github.com/hashicorp/consul/api"
multierror "github.com/hashicorp/go-multierror"
"github.com/hashicorp/nomad/helper"
"github.com/hashicorp/nomad/helper/args"
"github.com/mitchellh/copystructure"
)
const (
EnvoyBootstrapPath = "${NOMAD_SECRETS_DIR}/envoy_bootstrap.json"
ServiceCheckHTTP = "http"
ServiceCheckTCP = "tcp"
ServiceCheckScript = "script"
ServiceCheckGRPC = "grpc"
// minCheckInterval is the minimum check interval permitted. Consul
// currently has its MinInterval set to 1s. Mirror that here for
// consistency.
minCheckInterval = 1 * time.Second
// minCheckTimeout is the minimum check timeout permitted for Consul
// script TTL checks.
minCheckTimeout = 1 * time.Second
)
// ServiceCheck represents the Consul health check.
type ServiceCheck struct {
Name string // Name of the check, defaults to id
Type string // Type of the check - tcp, http, docker and script
Command string // Command is the command to run for script checks
Args []string // Args is a list of arguments for script checks
Path string // path of the health check url for http type check
Protocol string // Protocol to use if check is http, defaults to http
PortLabel string // The port to use for tcp/http checks
Expose bool // Whether to have Envoy expose the check path (connect-enabled group-services only)
AddressMode string // 'host' to use host ip:port or 'driver' to use driver's
Interval time.Duration // Interval of the check
Timeout time.Duration // Timeout of the response from the check before consul fails the check
InitialStatus string // Initial status of the check
TLSSkipVerify bool // Skip TLS verification when Protocol=https
Method string // HTTP Method to use (GET by default)
Header map[string][]string // HTTP Headers for Consul to set when making HTTP checks
CheckRestart *CheckRestart // If and when a task should be restarted based on checks
GRPCService string // Service for GRPC checks
GRPCUseTLS bool // Whether or not to use TLS for GRPC checks
TaskName string // What task to execute this check in
SuccessBeforePassing int // Number of consecutive successes required before considered healthy
FailuresBeforeCritical int // Number of consecutive failures required before considered unhealthy
}
// Copy the stanza recursively. Returns nil if nil.
func (sc *ServiceCheck) Copy() *ServiceCheck {
if sc == nil {
return nil
}
nsc := new(ServiceCheck)
*nsc = *sc
nsc.Args = helper.CopySliceString(sc.Args)
nsc.Header = helper.CopyMapStringSliceString(sc.Header)
nsc.CheckRestart = sc.CheckRestart.Copy()
return nsc
}
// Equals returns true if the structs are recursively equal.
func (sc *ServiceCheck) Equals(o *ServiceCheck) bool {
if sc == nil || o == nil {
return sc == o
}
if sc.Name != o.Name {
return false
}
if sc.AddressMode != o.AddressMode {
return false
}
if !helper.CompareSliceSetString(sc.Args, o.Args) {
return false
}
if !sc.CheckRestart.Equals(o.CheckRestart) {
return false
}
if sc.TaskName != o.TaskName {
return false
}
if sc.SuccessBeforePassing != o.SuccessBeforePassing {
return false
}
if sc.FailuresBeforeCritical != o.FailuresBeforeCritical {
return false
}
if sc.Command != o.Command {
return false
}
if sc.GRPCService != o.GRPCService {
return false
}
if sc.GRPCUseTLS != o.GRPCUseTLS {
return false
}
// Use DeepEqual here as order of slice values could matter
if !reflect.DeepEqual(sc.Header, o.Header) {
return false
}
if sc.InitialStatus != o.InitialStatus {
return false
}
if sc.Interval != o.Interval {
return false
}
if sc.Method != o.Method {
return false
}
if sc.Path != o.Path {
return false
}
if sc.PortLabel != o.Path {
return false
}
if sc.Expose != o.Expose {
return false
}
if sc.Protocol != o.Protocol {
return false
}
if sc.TLSSkipVerify != o.TLSSkipVerify {
return false
}
if sc.Timeout != o.Timeout {
return false
}
if sc.Type != o.Type {
return false
}
return true
}
func (sc *ServiceCheck) Canonicalize(serviceName string) {
// Ensure empty maps/slices are treated as null to avoid scheduling
// issues when using DeepEquals.
if len(sc.Args) == 0 {
sc.Args = nil
}
if len(sc.Header) == 0 {
sc.Header = nil
} else {
for k, v := range sc.Header {
if len(v) == 0 {
sc.Header[k] = nil
}
}
}
if sc.Name == "" {
sc.Name = fmt.Sprintf("service: %q check", serviceName)
}
}
// validate a Service's ServiceCheck
func (sc *ServiceCheck) validate() error {
// Validate Type
checkType := strings.ToLower(sc.Type)
switch checkType {
case ServiceCheckGRPC:
case ServiceCheckTCP:
case ServiceCheckHTTP:
if sc.Path == "" {
return fmt.Errorf("http type must have a valid http path")
}
checkPath, err := url.Parse(sc.Path)
if err != nil {
return fmt.Errorf("http type must have a valid http path")
}
if checkPath.IsAbs() {
return fmt.Errorf("http type must have a relative http path")
}
case ServiceCheckScript:
if sc.Command == "" {
return fmt.Errorf("script type must have a valid script path")
}
default:
return fmt.Errorf(`invalid type (%+q), must be one of "http", "tcp", or "script" type`, sc.Type)
}
// Validate interval and timeout
if sc.Interval == 0 {
return fmt.Errorf("missing required value interval. Interval cannot be less than %v", minCheckInterval)
} else if sc.Interval < minCheckInterval {
return fmt.Errorf("interval (%v) cannot be lower than %v", sc.Interval, minCheckInterval)
}
if sc.Timeout == 0 {
return fmt.Errorf("missing required value timeout. Timeout cannot be less than %v", minCheckInterval)
} else if sc.Timeout < minCheckTimeout {
return fmt.Errorf("timeout (%v) is lower than required minimum timeout %v", sc.Timeout, minCheckInterval)
}
// Validate InitialStatus
switch sc.InitialStatus {
case "":
case api.HealthPassing:
case api.HealthWarning:
case api.HealthCritical:
default:
return fmt.Errorf(`invalid initial check state (%s), must be one of %q, %q, %q or empty`, sc.InitialStatus, api.HealthPassing, api.HealthWarning, api.HealthCritical)
}
// Validate AddressMode
switch sc.AddressMode {
case "", AddressModeHost, AddressModeDriver:
// Ok
case AddressModeAuto:
return fmt.Errorf("invalid address_mode %q - %s only valid for services", sc.AddressMode, AddressModeAuto)
default:
return fmt.Errorf("invalid address_mode %q", sc.AddressMode)
}
// Note that we cannot completely validate the Expose field yet - we do not
// know whether this ServiceCheck belongs to a connect-enabled group-service.
// Instead, such validation will happen in a job admission controller.
if sc.Expose {
// We can however immediately ensure expose is configured only for HTTP
// and gRPC checks.
switch checkType {
case ServiceCheckGRPC, ServiceCheckHTTP: // ok
default:
return fmt.Errorf("expose may only be set on HTTP or gRPC checks")
}
}
// passFailCheckTypes are intersection of check types supported by both Consul
// and Nomad when using the pass/fail check threshold features.
passFailCheckTypes := []string{"tcp", "http", "grpc"}
if sc.SuccessBeforePassing < 0 {
return fmt.Errorf("success_before_passing must be non-negative")
} else if sc.SuccessBeforePassing > 0 && !helper.SliceStringContains(passFailCheckTypes, sc.Type) {
return fmt.Errorf("success_before_passing not supported for check of type %q", sc.Type)
}
if sc.FailuresBeforeCritical < 0 {
return fmt.Errorf("failures_before_critical must be non-negative")
} else if sc.FailuresBeforeCritical > 0 && !helper.SliceStringContains(passFailCheckTypes, sc.Type) {
return fmt.Errorf("failures_before_critical not supported for check of type %q", sc.Type)
}
return sc.CheckRestart.Validate()
}
// RequiresPort returns whether the service check requires the task has a port.
func (sc *ServiceCheck) RequiresPort() bool {
switch sc.Type {
case ServiceCheckGRPC, ServiceCheckHTTP, ServiceCheckTCP:
return true
default:
return false
}
}
// TriggersRestarts returns true if this check should be watched and trigger a restart
// on failure.
func (sc *ServiceCheck) TriggersRestarts() bool {
return sc.CheckRestart != nil && sc.CheckRestart.Limit > 0
}
// Hash all ServiceCheck fields and the check's corresponding service ID to
// create an identifier. The identifier is not guaranteed to be unique as if
// the PortLabel is blank, the Service's PortLabel will be used after Hash is
// called.
func (sc *ServiceCheck) Hash(serviceID string) string {
h := sha1.New()
hashString(h, serviceID)
hashString(h, sc.Name)
hashString(h, sc.Type)
hashString(h, sc.Command)
hashString(h, strings.Join(sc.Args, ""))
hashString(h, sc.Path)
hashString(h, sc.Protocol)
hashString(h, sc.PortLabel)
hashString(h, sc.Interval.String())
hashString(h, sc.Timeout.String())
hashString(h, sc.Method)
// use name "true" to maintain ID stability
hashBool(h, sc.TLSSkipVerify, "true")
// maintain artisanal map hashing to maintain ID stability
hashHeader(h, sc.Header)
// Only include AddressMode if set to maintain ID stability with Nomad <0.7.1
hashStringIfNonEmpty(h, sc.AddressMode)
// Only include gRPC if set to maintain ID stability with Nomad <0.8.4
hashStringIfNonEmpty(h, sc.GRPCService)
// use name "true" to maintain ID stability
hashBool(h, sc.GRPCUseTLS, "true")
// Only include pass/fail if non-zero to maintain ID stability with Nomad < 0.12
hashIntIfNonZero(h, "success", sc.SuccessBeforePassing)
hashIntIfNonZero(h, "failures", sc.FailuresBeforeCritical)
// Hash is used for diffing against the Consul check definition, which does
// not have an expose parameter. Instead we rely on implied changes to
// other fields if the Expose setting is changed in a nomad service.
// hashBool(h, sc.Expose, "Expose")
// maintain use of hex (i.e. not b32) to maintain ID stability
return fmt.Sprintf("%x", h.Sum(nil))
}
func hashStringIfNonEmpty(h hash.Hash, s string) {
if len(s) > 0 {
hashString(h, s)
}
}
func hashIntIfNonZero(h hash.Hash, name string, i int) {
if i != 0 {
hashString(h, fmt.Sprintf("%s:%d", name, i))
}
}
func hashHeader(h hash.Hash, m map[string][]string) {
// maintain backwards compatibility for ID stability
// using the %v formatter on a map with string keys produces consistent
// output, but our existing format here is incompatible
if len(m) > 0 {
headers := make([]string, 0, len(m))
for k, v := range m {
headers = append(headers, k+strings.Join(v, ""))
}
sort.Strings(headers)
hashString(h, strings.Join(headers, ""))
}
}
const (
AddressModeAuto = "auto"
AddressModeHost = "host"
AddressModeDriver = "driver"
)
// Service represents a Consul service definition
type Service struct {
// Name of the service registered with Consul. Consul defaults the
// Name to ServiceID if not specified. The Name if specified is used
// as one of the seed values when generating a Consul ServiceID.
Name string
// Name of the Task associated with this service.
//
// Currently only used to identify the implementing task of a Consul
// Connect Native enabled service.
TaskName string
// PortLabel is either the numeric port number or the `host:port`.
// To specify the port number using the host's Consul Advertise
// address, specify an empty host in the PortLabel (e.g. `:port`).
PortLabel string
// AddressMode specifies whether or not to use the host ip:port for
// this service.
AddressMode string
// EnableTagOverride will disable Consul's anti-entropy mechanism for the
// tags of this service. External updates to the service definition via
// Consul will not be corrected to match the service definition set in the
// Nomad job specification.
//
// https://www.consul.io/docs/agent/services.html#service-definition
EnableTagOverride bool
Tags []string // List of tags for the service
CanaryTags []string // List of tags for the service when it is a canary
Checks []*ServiceCheck // List of checks associated with the service
Connect *ConsulConnect // Consul Connect configuration
Meta map[string]string // Consul service meta
CanaryMeta map[string]string // Consul service meta when it is a canary
}
// Copy the stanza recursively. Returns nil if nil.
func (s *Service) Copy() *Service {
if s == nil {
return nil
}
ns := new(Service)
*ns = *s
ns.Tags = helper.CopySliceString(ns.Tags)
ns.CanaryTags = helper.CopySliceString(ns.CanaryTags)
if s.Checks != nil {
checks := make([]*ServiceCheck, len(ns.Checks))
for i, c := range ns.Checks {
checks[i] = c.Copy()
}
ns.Checks = checks
}
ns.Connect = s.Connect.Copy()
ns.Meta = helper.CopyMapStringString(s.Meta)
ns.CanaryMeta = helper.CopyMapStringString(s.CanaryMeta)
return ns
}
// Canonicalize interpolates values of Job, Task Group and Task in the Service
// Name. This also generates check names, service id and check ids.
func (s *Service) Canonicalize(job string, taskGroup string, task string) {
// Ensure empty lists are treated as null to avoid scheduler issues when
// using DeepEquals
if len(s.Tags) == 0 {
s.Tags = nil
}
if len(s.CanaryTags) == 0 {
s.CanaryTags = nil
}
if len(s.Checks) == 0 {
s.Checks = nil
}
s.Name = args.ReplaceEnv(s.Name, map[string]string{
"JOB": job,
"TASKGROUP": taskGroup,
"TASK": task,
"BASE": fmt.Sprintf("%s-%s-%s", job, taskGroup, task),
})
for _, check := range s.Checks {
check.Canonicalize(s.Name)
}
}
// Validate checks if the Service definition is valid
func (s *Service) Validate() error {
var mErr multierror.Error
// Ensure the service name is valid per the below RFCs but make an exception
// for our interpolation syntax by first stripping any environment variables from the name
serviceNameStripped := args.ReplaceEnvWithPlaceHolder(s.Name, "ENV-VAR")
if err := s.ValidateName(serviceNameStripped); err != nil {
mErr.Errors = append(mErr.Errors, fmt.Errorf("Service name must be valid per RFC 1123 and can contain only alphanumeric characters or dashes: %q", s.Name))
}
switch s.AddressMode {
case "", AddressModeAuto, AddressModeHost, AddressModeDriver:
// OK
default:
mErr.Errors = append(mErr.Errors, fmt.Errorf("Service address_mode must be %q, %q, or %q; not %q", AddressModeAuto, AddressModeHost, AddressModeDriver, s.AddressMode))
}
// check checks
for _, c := range s.Checks {
if s.PortLabel == "" && c.PortLabel == "" && c.RequiresPort() {
mErr.Errors = append(mErr.Errors, fmt.Errorf("Check %s invalid: check requires a port but neither check nor service %+q have a port", c.Name, s.Name))
continue
}
// TCP checks against a Consul Connect enabled service are not supported
// due to the service being bound to the loopback interface inside the
// network namespace
if c.Type == ServiceCheckTCP && s.Connect != nil && s.Connect.SidecarService != nil {
mErr.Errors = append(mErr.Errors, fmt.Errorf("Check %s invalid: tcp checks are not valid for Connect enabled services", c.Name))
continue
}
if err := c.validate(); err != nil {
mErr.Errors = append(mErr.Errors, fmt.Errorf("Check %s invalid: %v", c.Name, err))
}
}
// check connect
if s.Connect != nil {
if err := s.Connect.Validate(); err != nil {
mErr.Errors = append(mErr.Errors, err)
}
// if service is connect native, service task must be set (which may
// happen implicitly in a job mutation if there is only one task)
if s.Connect.IsNative() && len(s.TaskName) == 0 {
mErr.Errors = append(mErr.Errors, fmt.Errorf("Service %s is Connect Native and requires setting the task", s.Name))
}
}
return mErr.ErrorOrNil()
}
// ValidateName checks if the service Name is valid and should be called after
// the name has been interpolated
func (s *Service) ValidateName(name string) error {
// Ensure the service name is valid per RFC-952 §1
// (https://tools.ietf.org/html/rfc952), RFC-1123 §2.1
// (https://tools.ietf.org/html/rfc1123), and RFC-2782
// (https://tools.ietf.org/html/rfc2782).
re := regexp.MustCompile(`^(?i:[a-z0-9]|[a-z0-9][a-z0-9\-]{0,61}[a-z0-9])$`)
if !re.MatchString(name) {
return fmt.Errorf("Service name must be valid per RFC 1123 and can contain only alphanumeric characters or dashes and must be no longer than 63 characters: %q", name)
}
return nil
}
// Hash returns a base32 encoded hash of a Service's contents excluding checks
// as they're hashed independently.
func (s *Service) Hash(allocID, taskName string, canary bool) string {
h := sha1.New()
hashString(h, allocID)
hashString(h, taskName)
hashString(h, s.Name)
hashString(h, s.PortLabel)
hashString(h, s.AddressMode)
hashTags(h, s.Tags)
hashTags(h, s.CanaryTags)
hashBool(h, canary, "Canary")
hashBool(h, s.EnableTagOverride, "ETO")
hashMeta(h, s.Meta)
hashMeta(h, s.CanaryMeta)
hashConnect(h, s.Connect)
// Base32 is used for encoding the hash as sha1 hashes can always be
// encoded without padding, only 4 bytes larger than base64, and saves
// 8 bytes vs hex. Since these hashes are used in Consul URLs it's nice
// to have a reasonably compact URL-safe representation.
return b32.EncodeToString(h.Sum(nil))
}
func hashConnect(h hash.Hash, connect *ConsulConnect) {
if connect != nil && connect.SidecarService != nil {
hashString(h, connect.SidecarService.Port)
hashTags(h, connect.SidecarService.Tags)
if p := connect.SidecarService.Proxy; p != nil {
hashString(h, p.LocalServiceAddress)
hashString(h, strconv.Itoa(p.LocalServicePort))
hashConfig(h, p.Config)
for _, upstream := range p.Upstreams {
hashString(h, upstream.DestinationName)
hashString(h, strconv.Itoa(upstream.LocalBindPort))
}
}
}
}
func hashString(h hash.Hash, s string) {
_, _ = io.WriteString(h, s)
}
func hashBool(h hash.Hash, b bool, name string) {
if b {
hashString(h, name)
}
}
func hashTags(h hash.Hash, tags []string) {
for _, tag := range tags {
hashString(h, tag)
}
}
func hashMeta(h hash.Hash, m map[string]string) {
_, _ = fmt.Fprintf(h, "%v", m)
}
func hashConfig(h hash.Hash, c map[string]interface{}) {
_, _ = fmt.Fprintf(h, "%v", c)
}
// Equals returns true if the structs are recursively equal.
func (s *Service) Equals(o *Service) bool {
if s == nil || o == nil {
return s == o
}
if s.AddressMode != o.AddressMode {
return false
}
if !helper.CompareSliceSetString(s.CanaryTags, o.CanaryTags) {
return false
}
if len(s.Checks) != len(o.Checks) {
return false
}
OUTER:
for i := range s.Checks {
for ii := range o.Checks {
if s.Checks[i].Equals(o.Checks[ii]) {
// Found match; continue with next check
continue OUTER
}
}
// No match
return false
}
if !s.Connect.Equals(o.Connect) {
return false
}
if s.Name != o.Name {
return false
}
if s.PortLabel != o.PortLabel {
return false
}
if !reflect.DeepEqual(s.Meta, o.Meta) {
return false
}
if !reflect.DeepEqual(s.CanaryMeta, o.CanaryMeta) {
return false
}
if !helper.CompareSliceSetString(s.Tags, o.Tags) {
return false
}
if s.EnableTagOverride != o.EnableTagOverride {
return false
}
return true
}
// ConsulConnect represents a Consul Connect jobspec stanza.
type ConsulConnect struct {
// Native indicates whether the service is Consul Connect Native enabled.
Native bool
// SidecarService is non-nil if a service requires a sidecar.
SidecarService *ConsulSidecarService
// SidecarTask is non-nil if sidecar overrides are set
SidecarTask *SidecarTask
// Gateway is a Consul Connect Gateway Proxy.
Gateway *ConsulGateway
}
// Copy the stanza recursively. Returns nil if nil.
func (c *ConsulConnect) Copy() *ConsulConnect {
if c == nil {
return nil
}
return &ConsulConnect{
Native: c.Native,
SidecarService: c.SidecarService.Copy(),
SidecarTask: c.SidecarTask.Copy(),
Gateway: c.Gateway.Copy(),
}
}
// Equals returns true if the structs are recursively equal.
func (c *ConsulConnect) Equals(o *ConsulConnect) bool {
if c == nil || o == nil {
return c == o
}
if c.Native != o.Native {
return false
}
if !c.SidecarService.Equals(o.SidecarService) {
return false
}
// todo(shoenig) task has never been compared, should it be?
if !c.Gateway.Equals(o.Gateway) {
return false
}
return true
}
// HasSidecar checks if a sidecar task is configured.
func (c *ConsulConnect) HasSidecar() bool {
return c != nil && c.SidecarService != nil
}
// IsNative checks if the service is connect native.
func (c *ConsulConnect) IsNative() bool {
return c != nil && c.Native
}
func (c *ConsulConnect) IsGateway() bool {
return c != nil && c.Gateway != nil
}
// Validate that the Connect block represents exactly one of:
// - Connect non-native service sidecar proxy
// - Connect native service
// - Connect gateway (any type)
func (c *ConsulConnect) Validate() error {
if c == nil {
return nil
}
// Count the number of things actually configured. If that number is not 1,
// the config is not valid.
count := 0
if c.HasSidecar() {
count++
}
if c.IsNative() {
count++
}
if c.IsGateway() {
count++
}
if count != 1 {
return fmt.Errorf("Consul Connect must be exclusively native, make use of a sidecar, or represent a Gateway")
}
if c.IsGateway() {
if err := c.Gateway.Validate(); err != nil {
return err
}
}
// The Native and Sidecar cases are validated up at the service level.
return nil
}
// ConsulSidecarService represents a Consul Connect SidecarService jobspec
// stanza.
type ConsulSidecarService struct {
// Tags are optional service tags that get registered with the sidecar service
// in Consul. If unset, the sidecar service inherits the parent service tags.
Tags []string
// Port is the service's port that the sidecar will connect to. May be
// a port label or a literal port number.
Port string
// Proxy stanza defining the sidecar proxy configuration.
Proxy *ConsulProxy
}
// HasUpstreams checks if the sidecar service has any upstreams configured
func (s *ConsulSidecarService) HasUpstreams() bool {
return s != nil && s.Proxy != nil && len(s.Proxy.Upstreams) > 0
}
// Copy the stanza recursively. Returns nil if nil.
func (s *ConsulSidecarService) Copy() *ConsulSidecarService {
if s == nil {
return nil
}
return &ConsulSidecarService{
Tags: helper.CopySliceString(s.Tags),
Port: s.Port,
Proxy: s.Proxy.Copy(),
}
}
// Equals returns true if the structs are recursively equal.
func (s *ConsulSidecarService) Equals(o *ConsulSidecarService) bool {
if s == nil || o == nil {
return s == o
}
if s.Port != o.Port {
return false
}
if !helper.CompareSliceSetString(s.Tags, o.Tags) {
return false
}
return s.Proxy.Equals(o.Proxy)
}
// SidecarTask represents a subset of Task fields that are able to be overridden
// from the sidecar_task stanza
type SidecarTask struct {
// Name of the task
Name string
// Driver is used to control which driver is used
Driver string
// User is used to determine which user will run the task. It defaults to
// the same user the Nomad client is being run as.
User string
// Config is provided to the driver to initialize
Config map[string]interface{}
// Map of environment variables to be used by the driver
Env map[string]string
// Resources is the resources needed by this task
Resources *Resources
// Meta is used to associate arbitrary metadata with this
// task. This is opaque to Nomad.
Meta map[string]string
// KillTimeout is the time between signaling a task that it will be
// killed and killing it.
KillTimeout *time.Duration
// LogConfig provides configuration for log rotation
LogConfig *LogConfig
// ShutdownDelay is the duration of the delay between deregistering a
// task from Consul and sending it a signal to shutdown. See #2441
ShutdownDelay *time.Duration
// KillSignal is the kill signal to use for the task. This is an optional
// specification and defaults to SIGINT
KillSignal string
}
func (t *SidecarTask) Copy() *SidecarTask {
if t == nil {
return nil
}
nt := new(SidecarTask)
*nt = *t
nt.Env = helper.CopyMapStringString(nt.Env)
nt.Resources = nt.Resources.Copy()
nt.LogConfig = nt.LogConfig.Copy()
nt.Meta = helper.CopyMapStringString(nt.Meta)
if i, err := copystructure.Copy(nt.Config); err != nil {
panic(err.Error())
} else {
nt.Config = i.(map[string]interface{})
}
if t.KillTimeout != nil {
nt.KillTimeout = helper.TimeToPtr(*t.KillTimeout)
}
if t.ShutdownDelay != nil {
nt.ShutdownDelay = helper.TimeToPtr(*t.ShutdownDelay)
}
return nt
}
// MergeIntoTask merges the SidecarTask fields over the given task
func (t *SidecarTask) MergeIntoTask(task *Task) {
if t.Name != "" {
task.Name = t.Name
}
// If the driver changes then the driver config can be overwritten.
// Otherwise we'll merge the driver config together
if t.Driver != "" && t.Driver != task.Driver {
task.Driver = t.Driver
task.Config = t.Config
} else {
for k, v := range t.Config {
task.Config[k] = v
}
}
if t.User != "" {
task.User = t.User
}
if t.Env != nil {
if task.Env == nil {
task.Env = t.Env
} else {
for k, v := range t.Env {
task.Env[k] = v
}
}
}
if t.Resources != nil {
task.Resources.Merge(t.Resources)
}
if t.Meta != nil {
if task.Meta == nil {
task.Meta = t.Meta
} else {
for k, v := range t.Meta {
task.Meta[k] = v
}
}
}
if t.KillTimeout != nil {
task.KillTimeout = *t.KillTimeout
}
if t.LogConfig != nil {
if task.LogConfig == nil {
task.LogConfig = t.LogConfig
} else {
if t.LogConfig.MaxFiles > 0 {
task.LogConfig.MaxFiles = t.LogConfig.MaxFiles
}
if t.LogConfig.MaxFileSizeMB > 0 {
task.LogConfig.MaxFileSizeMB = t.LogConfig.MaxFileSizeMB
}
}
}
if t.ShutdownDelay != nil {
task.ShutdownDelay = *t.ShutdownDelay
}
if t.KillSignal != "" {
task.KillSignal = t.KillSignal
}
}
// ConsulProxy represents a Consul Connect sidecar proxy jobspec stanza.
type ConsulProxy struct {
// LocalServiceAddress is the address the local service binds to.
// Usually 127.0.0.1 it is useful to customize in clusters with mixed
// Connect and non-Connect services.
LocalServiceAddress string
// LocalServicePort is the port the local service binds to. Usually
// the same as the parent service's port, it is useful to customize
// in clusters with mixed Connect and non-Connect services
LocalServicePort int
// Upstreams configures the upstream services this service intends to
// connect to.
Upstreams []ConsulUpstream
// Expose configures the consul proxy.expose stanza to "open up" endpoints
// used by task-group level service checks using HTTP or gRPC protocols.
//
// Use json tag to match with field name in api/
Expose *ConsulExposeConfig `json:"ExposeConfig"`
// Config is a proxy configuration. It is opaque to Nomad and passed
// directly to Consul.
Config map[string]interface{}
}
// Copy the stanza recursively. Returns nil if nil.
func (p *ConsulProxy) Copy() *ConsulProxy {
if p == nil {
return nil
}
newP := &ConsulProxy{
LocalServiceAddress: p.LocalServiceAddress,
LocalServicePort: p.LocalServicePort,
Expose: p.Expose.Copy(),
}
if n := len(p.Upstreams); n > 0 {
newP.Upstreams = make([]ConsulUpstream, n)
for i := range p.Upstreams {
newP.Upstreams[i] = *p.Upstreams[i].Copy()
}
}
if n := len(p.Config); n > 0 {
newP.Config = make(map[string]interface{}, n)
for k, v := range p.Config {
newP.Config[k] = v
}
}
return newP
}
// opaqueMapsEqual compares map[string]interface{} commonly used for opaque
// config blocks. Interprets nil and {} as the same.
func opaqueMapsEqual(a, b map[string]interface{}) bool {
if len(a) == 0 && len(b) == 0 {
return true
}
return reflect.DeepEqual(a, b)
}
// Equals returns true if the structs are recursively equal.
func (p *ConsulProxy) Equals(o *ConsulProxy) bool {
if p == nil || o == nil {
return p == o
}
if p.LocalServiceAddress != o.LocalServiceAddress {
return false
}
if p.LocalServicePort != o.LocalServicePort {
return false
}
if !p.Expose.Equals(o.Expose) {
return false
}
if !upstreamsEquals(p.Upstreams, o.Upstreams) {
return false
}
if !opaqueMapsEqual(p.Config, o.Config) {
return false
}
return true
}
// ConsulUpstream represents a Consul Connect upstream jobspec stanza.
type ConsulUpstream struct {
// DestinationName is the name of the upstream service.
DestinationName string
// LocalBindPort is the port the proxy will receive connections for the
// upstream on.
LocalBindPort int
}
func upstreamsEquals(a, b []ConsulUpstream) bool {
if len(a) != len(b) {
return false
}
LOOP: // order does not matter
for _, upA := range a {
for _, upB := range b {
if upA.Equals(&upB) {
continue LOOP
}
}
return false
}
return true
}
// Copy the stanza recursively. Returns nil if u is nil.
func (u *ConsulUpstream) Copy() *ConsulUpstream {
if u == nil {
return nil
}
return &ConsulUpstream{
DestinationName: u.DestinationName,
LocalBindPort: u.LocalBindPort,
}
}
// Equals returns true if the structs are recursively equal.
func (u *ConsulUpstream) Equals(o *ConsulUpstream) bool {
if u == nil || o == nil {
return u == o
}
return (*u) == (*o)
}
// ExposeConfig represents a Consul Connect expose jobspec stanza.
type ConsulExposeConfig struct {
// Use json tag to match with field name in api/
Paths []ConsulExposePath `json:"Path"`
}
type ConsulExposePath struct {
Path string
Protocol string
LocalPathPort int
ListenerPort string
}
func exposePathsEqual(pathsA, pathsB []ConsulExposePath) bool {
if len(pathsA) != len(pathsB) {
return false
}
LOOP: // order does not matter
for _, pathA := range pathsA {
for _, pathB := range pathsB {
if pathA == pathB {
continue LOOP
}
}
return false
}
return true
}
// Copy the stanza. Returns nil if e is nil.
func (e *ConsulExposeConfig) Copy() *ConsulExposeConfig {
if e == nil {
return nil
}
paths := make([]ConsulExposePath, len(e.Paths))
for i := 0; i < len(e.Paths); i++ {
paths[i] = e.Paths[i]
}
return &ConsulExposeConfig{
Paths: paths,
}
}
// Equals returns true if the structs are recursively equal.
func (e *ConsulExposeConfig) Equals(o *ConsulExposeConfig) bool {
if e == nil || o == nil {
return e == o
}
return exposePathsEqual(e.Paths, o.Paths)
}
// ConsulGateway is used to configure one of the Consul Connect Gateway types.
type ConsulGateway struct {
// Proxy is used to configure the Envoy instance acting as the gateway.
Proxy *ConsulGatewayProxy
// Ingress represents the Consul Configuration Entry for an Ingress Gateway.
Ingress *ConsulIngressConfigEntry
// Terminating is not yet supported.
// Terminating *ConsulTerminatingConfigEntry
// Mesh is not yet supported.
// Mesh *ConsulMeshConfigEntry
}
func (g *ConsulGateway) Copy() *ConsulGateway {
if g == nil {
return nil
}
return &ConsulGateway{
Proxy: g.Proxy.Copy(),
Ingress: g.Ingress.Copy(),
}
}
func (g *ConsulGateway) Equals(o *ConsulGateway) bool {
if g == nil || o == nil {
return g == o
}
if !g.Proxy.Equals(o.Proxy) {
return false
}
if !g.Ingress.Equals(o.Ingress) {
return false
}
return true
}
func (g *ConsulGateway) Validate() error {
if g == nil {
return nil
}
if g.Proxy != nil {
if err := g.Proxy.Validate(); err != nil {
return err
}
}
// eventually one of: ingress, terminating, mesh
if g.Ingress != nil {
return g.Ingress.Validate()
}
return fmt.Errorf("Consul Gateway ingress Configuration Entry must be set")
}
// ConsulGatewayBindAddress is equivalent to Consul's api/catalog.go ServiceAddress
// struct, as this is used to encode values to pass along to Envoy (i.e. via
// JSON encoding).
type ConsulGatewayBindAddress struct {
Address string
Port int
}
func (a *ConsulGatewayBindAddress) Equals(o *ConsulGatewayBindAddress) bool {
if a == nil || o == nil {
return a == o
}
if a.Address != o.Address {
return false
}
if a.Port != o.Port {
return false
}
return true
}
func (a *ConsulGatewayBindAddress) Copy() *ConsulGatewayBindAddress {
if a == nil {
return nil
}
return &ConsulGatewayBindAddress{
Address: a.Address,
Port: a.Port,
}
}
func (a *ConsulGatewayBindAddress) Validate() error {
if a == nil {
return nil
}
if a.Address == "" {
return fmt.Errorf("Consul Gateway Bind Address must be set")
}
if a.Port <= 0 {
return fmt.Errorf("Consul Gateway Bind Address must set valid Port")
}
return nil
}
// ConsulGatewayProxy is used to tune parameters of the proxy instance acting as
// one of the forms of Connect gateways that Consul supports.
//
// https://www.consul.io/docs/connect/proxies/envoy#gateway-options
type ConsulGatewayProxy struct {
ConnectTimeout *time.Duration
EnvoyGatewayBindTaggedAddresses bool
EnvoyGatewayBindAddresses map[string]*ConsulGatewayBindAddress
EnvoyGatewayNoDefaultBind bool
Config map[string]interface{}
}
func (p *ConsulGatewayProxy) Copy() *ConsulGatewayProxy {
if p == nil {
return nil
}
bindAddresses := make(map[string]*ConsulGatewayBindAddress, len(p.EnvoyGatewayBindAddresses))
for k, v := range p.EnvoyGatewayBindAddresses {
bindAddresses[k] = v.Copy()
}
return &ConsulGatewayProxy{
ConnectTimeout: helper.TimeToPtr(*p.ConnectTimeout),
EnvoyGatewayBindTaggedAddresses: p.EnvoyGatewayBindTaggedAddresses,
EnvoyGatewayBindAddresses: bindAddresses,
EnvoyGatewayNoDefaultBind: p.EnvoyGatewayNoDefaultBind,
Config: helper.CopyMapStringInterface(p.Config),
}
}
func (p *ConsulGatewayProxy) equalBindAddresses(o map[string]*ConsulGatewayBindAddress) bool {
if len(p.EnvoyGatewayBindAddresses) != len(o) {
return false
}
for listener, addr := range p.EnvoyGatewayBindAddresses {
if !o[listener].Equals(addr) {
return false
}
}
return true
}
func (p *ConsulGatewayProxy) Equals(o *ConsulGatewayProxy) bool {
if p == nil || o == nil {
return p == o
}
if !helper.CompareTimePtrs(p.ConnectTimeout, o.ConnectTimeout) {
return false
}
if p.EnvoyGatewayBindTaggedAddresses != o.EnvoyGatewayBindTaggedAddresses {
return false
}
if !p.equalBindAddresses(o.EnvoyGatewayBindAddresses) {
return false
}
if p.EnvoyGatewayNoDefaultBind != o.EnvoyGatewayNoDefaultBind {
return false
}
if !opaqueMapsEqual(p.Config, o.Config) {
return false
}
return true
}
func (p *ConsulGatewayProxy) Validate() error {
if p == nil {
return nil
}
if p.ConnectTimeout == nil {
return fmt.Errorf("Consul Gateway Proxy connection_timeout must be set")
}
for _, bindAddr := range p.EnvoyGatewayBindAddresses {
if err := bindAddr.Validate(); err != nil {
return err
}
}
return nil
}
// ConsulGatewayTLSConfig is used to configure TLS for a gateway.
type ConsulGatewayTLSConfig struct {
Enabled bool
}
func (c *ConsulGatewayTLSConfig) Copy() *ConsulGatewayTLSConfig {
if c == nil {
return nil
}
return &ConsulGatewayTLSConfig{
Enabled: c.Enabled,
}
}
func (c *ConsulGatewayTLSConfig) Equals(o *ConsulGatewayTLSConfig) bool {
if c == nil || o == nil {
return c == o
}
return c.Enabled == o.Enabled
}
// ConsulIngressService is used to configure a service fronted by the ingress gateway.
type ConsulIngressService struct {
// Namespace is not yet supported.
// Namespace string
Name string
Hosts []string
}
func (s *ConsulIngressService) Copy() *ConsulIngressService {
if s == nil {
return nil
}
var hosts []string = nil
if n := len(s.Hosts); n > 0 {
hosts = make([]string, n)
copy(hosts, s.Hosts)
}
return &ConsulIngressService{
Name: s.Name,
Hosts: hosts,
}
}
func (s *ConsulIngressService) Equals(o *ConsulIngressService) bool {
if s == nil || o == nil {
return s == o
}
if s.Name != o.Name {
return false
}
return helper.CompareSliceSetString(s.Hosts, o.Hosts)
}
func (s *ConsulIngressService) Validate(isHTTP bool) error {
if s == nil {
return nil
}
if s.Name == "" {
return fmt.Errorf("Consul Ingress Service requires a name")
}
if isHTTP && len(s.Hosts) == 0 {
return fmt.Errorf("Consul Ingress Service requires one or more hosts when using HTTP protocol")
} else if !isHTTP && len(s.Hosts) > 0 {
return fmt.Errorf("Consul Ingress Service supports hosts only when using HTTP protocol")
}
return nil
}
// ConsulIngressListener is used to configure a listener on a Consul Ingress
// Gateway.
type ConsulIngressListener struct {
Port int
Protocol string
Services []*ConsulIngressService
}
func (l *ConsulIngressListener) Copy() *ConsulIngressListener {
if l == nil {
return nil
}
var services []*ConsulIngressService = nil
if n := len(l.Services); n > 0 {
services = make([]*ConsulIngressService, n)
for i := 0; i < n; i++ {
services[i] = l.Services[i].Copy()
}
}
return &ConsulIngressListener{
Port: l.Port,
Protocol: l.Protocol,
Services: services,
}
}
func (l *ConsulIngressListener) Equals(o *ConsulIngressListener) bool {
if l == nil || o == nil {
return l == o
}
if l.Port != o.Port {
return false
}
if l.Protocol != o.Protocol {
return false
}
return ingressServicesEqual(l.Services, o.Services)
}
func (l *ConsulIngressListener) Validate() error {
if l == nil {
return nil
}
if l.Port <= 0 {
return fmt.Errorf("Consul Ingress Listener requires valid Port")
}
protocols := []string{"http", "tcp"}
if !helper.SliceStringContains(protocols, l.Protocol) {
return fmt.Errorf(`Consul Ingress Listener requires protocol of "http" or "tcp", got %q`, l.Protocol)
}
if len(l.Services) == 0 {
return fmt.Errorf("Consul Ingress Listener requires one or more services")
}
for _, service := range l.Services {
if err := service.Validate(l.Protocol == "http"); err != nil {
return err
}
}
return nil
}
func ingressServicesEqual(servicesA, servicesB []*ConsulIngressService) bool {
if len(servicesA) != len(servicesB) {
return false
}
COMPARE: // order does not matter
for _, serviceA := range servicesA {
for _, serviceB := range servicesB {
if serviceA.Equals(serviceB) {
continue COMPARE
}
}
return false
}
return true
}
// ConsulIngressConfigEntry represents the Consul Configuration Entry type for
// an Ingress Gateway.
//
// https://www.consul.io/docs/agent/config-entries/ingress-gateway#available-fields
type ConsulIngressConfigEntry struct {
// Namespace is not yet supported.
// Namespace string
TLS *ConsulGatewayTLSConfig
Listeners []*ConsulIngressListener
}
func (e *ConsulIngressConfigEntry) Copy() *ConsulIngressConfigEntry {
if e == nil {
return nil
}
var listeners []*ConsulIngressListener = nil
if n := len(e.Listeners); n > 0 {
listeners = make([]*ConsulIngressListener, n)
for i := 0; i < n; i++ {
listeners[i] = e.Listeners[i].Copy()
}
}
return &ConsulIngressConfigEntry{
TLS: e.TLS.Copy(),
Listeners: listeners,
}
}
func (e *ConsulIngressConfigEntry) Equals(o *ConsulIngressConfigEntry) bool {
if e == nil || o == nil {
return e == o
}
if !e.TLS.Equals(o.TLS) {
return false
}
return ingressListenersEqual(e.Listeners, o.Listeners)
}
func (e *ConsulIngressConfigEntry) Validate() error {
if e == nil {
return nil
}
if len(e.Listeners) == 0 {
return fmt.Errorf("Consul Ingress Gateway requires at least one listener")
}
for _, listener := range e.Listeners {
if err := listener.Validate(); err != nil {
return err
}
}
return nil
}
func ingressListenersEqual(listenersA, listenersB []*ConsulIngressListener) bool {
if len(listenersA) != len(listenersB) {
return false
}
COMPARE: // order does not matter
for _, listenerA := range listenersA {
for _, listenerB := range listenersB {
if listenerA.Equals(listenerB) {
continue COMPARE
}
}
return false
}
return true
}
|
Language
which object is Plugins/API.dll attached to
I have a project that uses a API that is saved in Assets/Plugins/DataStreamer.dll. In the same project there is also AndroidJavaObject as a unity java plugin : Assets/Plugins/Android/libs/classes.jar (). This unity java plugin sends out data with a java method:
using com.unity3d.player.UnityPlayer ... UnityPlayer.UnitySendMessage("ObjectAReceivingScriptIsAttachedTo","methodName",Integer.toString(bytes)); So if I want to send data to the API DataStreamer.dll, I need to know ObjectAReceivingScriptIsAttachedTo.
The API itself isn't attached to any GameObject. If there are classes in the API, you can instantiate them in the normal way, with new, you don't use Unity's Instantiate() function, as well as call the exposed functions in it the normal way . Of course, you do need a script attached to a GameObject that will do these calls, or at least create a class that will do that, but that's a different question.
1 Reply
Duh. Found a solution: Gonna call some other function in an ordinary Unity script and create a bridge between JAvaAndroidPlugin and a API. Sry Was to quick to ask a question, before I really gave it a good thought. Aldo I am interested if someone knows the answer or another solution to a wrwpper function. |
Medical Laboratory Science
The Department of Medical Laboratory Science currently offers two degree programs: the Master of Science, Medical Laboratory Science program and the Clinical Laboratory Management program. In addition, a Specialist in Blood Bank Technology certificate program is offered online.
Medical Laboratory Science: Philosophy
Our philosophy is that medicine requires today’s medical laboratory scientist to be a highly qualified professional who is willing and able to expand and extend their theoretical knowledge and technical skills. The faculty of the Department of Medical Laboratory Science will provide students with the tools and resources necessary to attain the knowledge, skills and attitudes expected of laboratory professionals who work in a dynamic interprofessional environment. The medical laboratory scientist must maintain compassion and empathy and accept the patient’s welfare as the highest priority. |
INTERVIEW: From Soaps to Novelist, Louise Shaffer Part 2
In Part 1 of the We Love Soaps interview with longtime daytime actress Louise Shaffer, we talked about her childhood and career as an actress on soaps from the late 1960s to the mid 1980s.
In Part 2, we discuss which soap role was her favorite, her transition to soap writer in the late 1980s and her present career as a successful novelist.
We Love Soaps: You had a brief run as Goldie Kane on ALL MY CHILDREN after SEARCH, which was your sixth soap role. Out of all the roles you played, which would you say was your favorite?Louise Shaffer: For totally different reasons it would split between Serena/Josie and Rae.
We Love Soaps: Funny that you use the word "split" in referencing Serena/Josie.Louise Shaffer: It already was split [laughs]. That was just such an incredible experience acting wise. I did a lot of research on that kind of personality and the way those personalities change. It was a real huge challenge. There was a wonderful director there Allen [Fristoe], who was married to the actress who played Ruth on ALL MY CHILDREN. Kyra Sedgwick's father [John Sedgwick] was the other director. Allen was just incredible and let you have your head. Then reigned you in. What he knew about actors was just amazing.
I loved being on RYAN'S and I thought it was a classy show. Saying Mary Ryan Munisteri and Claire Labine's lines was just a joy because it was so well written, in the early days. Josie/Serena was one year and, for an actor, that's an interesting arc. Eventually if you play a character long enough it starts getting changed and watered down, and then you have a fresh set of challenges which is to keep it fresh and alive. So they were two very different experiences, but those two would certainly be my most favorite.
We Love Soaps: P&G launched a Classic Soaps channel a few years ago which ran on AOL until the end of last year. Your episodes of SEARCH from the mid 1980s were running. Did you ever think when you were acting on the soaps that the episodes would someday be available again, either in their entirety or as clips on a video content provider like YouTube?Louise Shaffer: I have to tell you, that's a little unnerving. There's a part of it that's a little bit weird. Part of the joy, for me, was that we were kind of under the radar. You weren't going to see your show in reruns. I took a lot more chances that I would have with my acting. It's kind of like, "Well, it's one day", so you try something and it doesn't quite come off, it's not going to be there for posterity. I don't know how people do it today.
When I started in the business they were just starting to tape stuff. And the actors who had been doing it live for 10 or 15 years before I walked onto the scene would say, "Jesus, we used to be so free, because we knew it wasn't going to be recorded, and it was like a theater thing, and you try stuff and it if didn't work, so what, we'd be back tomorrow".
We Love Soaps: I have always felt that daytime soaps could generate additional revenue by making some of these classic shows or episodes available to fans in some way, even if it's online for a small fee. The P&G online channel was one example. Do you have any thoughts on that?Louise Shaffer: Procter & Gamble is the worst. They had so much product they could have sold and packaged and put in into DVDs and stuff like that. I think you have to go back to the basic culture. This was never seen as product, it was always an arm of advertising. Back in the day all this stuff was produced out of the advertising offices. The casting directors were casting people who were working in their Benton & Bowles advertising. You would go to the advertising agency to audition, not the studio. It wasn't seen as an artistic or literary or even entertainment thing. It was about finding something that would make people watch their commercials.
We Love Soaps: Had you always written, how did you transition from actress to writer. Louise Shaffer: I always loved writing. And I had played around with it. I was someone who on a weekend instead of going out I would write little think peices and got a couple of things published, but I wanted to be an actor. That was my gig and I had trained for that, and I thought that was what I was going to do with my life. Then I got fired from RYAN's and then there was really no more work out there for women my age.
I started writing for RYAN'S because I called Claire and said, "Claire, the handwriting is on the wall here. I'm not about to get my face done, and even if I do I don't think I'll get any work. Can you you help me out and send me a few breakdowns, and give me some pointers, and then I'm going to try to peddle myself as a dialogue writer". So she gave me some outlines and I sent her a sample script and she said, "I don't have any pointers for you, I want to hire you." So I worked for her for a year, then we had the strike, which was bad, and then I worked for her until RYAN'S went off the air.
I have to tell you I think I was a lousy soap script writer because I really wanted to write my own characters. You can do it, and sometimes I think I pulled it off really well, but then I got tired of it.
We Love Soaps: Your first novel, "The Three Miss Margarets," was released in 2004. What lead you to write the book?Louise Shaffer: I had always had the idea for "The Three Miss Margarets" because we lived in Georgia for nine years, and it was a small town. A couple of things hit me. One was that incredible Southern love of local history and rootedness. The other thing was I have always been someone who didn't want to take a position on a morality, but you get yourself into a small town which is mostly Baptist and Methodist and people know what's right or wrong and really have strong opinions about it. And I came up with these three women who either righted a wrong or committed an act of vigilantism depending on your point of view.
I had this amazing agent who I had pitched the story to seven years earlier and he kept it alive. I wrote it and finished it two weeks before 9/11. He read it and it was four days after 9/11 and he said, "Louise, I think it's a good story and book, but the only thing people are writing about now is the apocalypse." We waited two weeks and then he sold it. And that was sort of the beginning of my novel career. I want to be a novelist. I like having my own stories to tell and I like having my own characters.
We Love Soaps: In 2006, your book "The Ladies of Garrison Gardens" came out and then "Family Acts" a year later. Are the books based on your experiences and influences?Louise Shaffer: There is no show business component in "The Three Miss Margarets." It's a real small town Southern story. Then "Ladies of Garrison Gardens" has a showbiz component and it is a sequel and then "Family Acts." These are my three Southern books. I don't know why I needed to write about the South first. It was far enough away from my own history and yet I was living down there and I'm married to a Southerner [Roger Crews] and I felt I had enough experience that I could write it. And for some reason I didn't want to write something closer to my own background. But my stories are all fiction and have nothing to do with anything in my life.
We Love Soaps: "Serendipity," your latest novel, is coming out March 24. I read the first chapter on your website, louiseshaffer.com, and really enjoyed it. Carrie is dealing with the loss of her mother. Did you draw from any real life experiences in writing Carrie or this story in general?Louise Shaffer: "Serendipity" is me writing about the Northeast which is where I grew up, and writing about an Italian-American family. On my mom's side I am Italian-American. And it's writing about show business and very specifically musical comedy which was a field I was in love with all of my life. I didn't do too many musicals, but loved everyone I did. And it's live theater in New York slightly before when I was working in live theater in New York. To that extent, it has some of my experiences in it, but it's all fiction.
We Love Soaps: What would you say if a producer approached you about turning one of your books into a movie?Louise Shaffer: Thank you, Jesus. I think I write very cinemagraphic books actually. We've had nibbles and offers and been under consideration and then they'd go into turnaround or whatever they do. But we're hoping.
We Love Soaps: Will you be doing any book signings for "Serendipity"?Louise Shaffer: Oh yes. The schedule will be on my website, louiseshaffer.com.
We Love Soaps: You've acted on daytime and primetime, done theater, written for soaps and now are writing your own books. Do you find writing these novels has been the most fulfilling experience for you as an artist?Louise Shaffer: That's a really good question. Writing is fulfilling in a way that I need it to be now. When I was younger, I needed attention and I liked having people watch me do what I do. I'm older now and I still like getting up in front of people and talking, and I enjoy when I do a reading, but I'm a lot less in love with that than I used to be. Maybe I grew up? This way I get to do the majority of my creative work in private and I kind of like that.
We Love Soaps: Can we expect more books in your future? Louise Shaffer: Well, now that depends on my well my books sell [laughs].
We Love Soaps: Thank you so much for your time, Louise. It was a real pleasure speaking with you. |
2006 Miami Valley Silverbacks season
The team began play in 2006 as the Miami Valley Silverbacks, an expansion member of the American Indoor Football League (AIFL). On Saturday, March 25, 2006, WR/DB Maurice Lee managed to set five AIFL wide receiver records, en route to his team's 57–54 Week 5 road victory over the Steubenville Stampede. He set the records for most catches (16), most reception yards (191), most receiving touchdowns (7), most points (42), and total touchdowns (7). The team finished 5-9 in their expansion season, earning a birth in the AIFL playoffs before losing in the first round. After the season four Silverbacks were named to the AIFL ProStar Team.
Schedule
Standings
Green indicates clinched playoff berth
Purple indicates division champion
Grey indicates best league record
During regular season, all teams played within their conference.
* = Filled in for games, due to Syracuse folding during the season. All three of these teams were outdoor amateur teams in the North American Football League.
** = Played remainder of Ghostriders road games, due to team folding during season.
References
Category:American Indoor Football League
Category:Dayton Sharks
Category:2006 in sports in Ohio |
Timberland Men's 6 Inch Premium Boot
It appears that you having some problems using our website because Javascript and/or Cookies are disabled in your web browser
You must have both Cookies and Javascript enabled in order to use our site.
To test if you have cookies enabled or learn how to enable javascript or cookies Click Here
Please note that we do not use Cookies to store any sensitive private information. They are required for items to be placed in our shopping cart as well as to use additional features on our website. They are only stored temporarily. Javascript is also used in many different functions of the site such as selecting and adding products. We respect your privacy and assure that it is safe to use both of these features when shopping at www.theshoemart.com.
For further details regarding our pricavy policies including the use of cookies please click here. For instructions on how to enable cookies please click here. If you need assistance one of our customer service representatives at 1-800-850-7463 would be glad to help.
Here it is - our original, the boot that helped start it all over thirty years ago. Crafted in premium, full-grain leather and constructed to be sturdy and waterproof, our 6 Inch Premium Boots are rugged and dependable. We like to think of them as the role model for all of the other boots we make today. Imported.
Premium, full-grain, waterproof leather for comfort, durability and abrasion resistanceDirect-attach, seam-sealed waterproof construction keep feet dry in any weatherIncludes a double-barreled padded system; a thin sheet of polyurethane foam is form-fitted inside the vamp and toe lining during lasting, then a 430 gram polyester insulation is in the quarter panel for all season comfortPadded collar for a comfortable fit around the ankle and help keep out debrisDurable laces with Taslanฎ fibers and rustproof hardware for long-lasting wearFootbed and shaft of the boot is lined with soft leather, the toe box and forefoot is lined with moisture-wicking, breathable fabricEmbossed Timberland tree logo on the sideRubber lug outsole for traction and durabilitySteel shank provides maximum supportWaterproof |
Melbourne coach Simon Goodwin threw a scare through the AFL club when he suddenly cut short his weekly media conference because of a dizzy spell. Goodwin immediately went to see a doctor and had the afternoon off, but the Demons were confident he would coach them in Sunday's match against GWS at the MCG. He was taking questions about Melbourne injuries from reporters at AAMI Park on Wednesday when his voice started wavering. Goodwin then looked over at Demons football boss Josh Mahoney and asked for some time out. Goodwin immediately left the room and a few minutes later, assistant Troy Chaplin stepped in to finish off the media conference. "He's catching up with the doctor now, he just said he was feeling a little bit light-headed," Chaplin said. "We expect him to coach this week ... it's a little bit of a shock. "Goody will be fine." The Demons later released a statement, saying Goodwin hydrated after the dizzy spell and then went for medical tests. They added he should be back at work on Thursday morning. "Simon has since seen our club doctor who reassured him that everything is okay, but as a precaution, we have sent him for tests this afternoon," Mahoney said. Before his dizzy spell, Goodwin had been upbeat as he spoke about the easing of the injuries that have plagued Melbourne so far this season. Defender Jake Lever will have at least another week in the VFL as he returns from his knee reconstruction. "Another week won't hurt him and make sure we really finish that rehabilitation off strongly," Goodwin said "I think Jake will end up indicating to us when he's ready to play ... he's getting very close." Goodwin also said the signs were good for Tim Smith, Alex Neal-Bullen and Christian Salem after they were concussed last weekend in the loss to West Coast. He said they all ran on Tuesday and remain in the mix for selection. "It's only early, but they're progressing well, so we're hopeful they'll play," he said. Goodwin added that Jordan Lewis, Sam Weideman, Charlie Spargo, Mitch Hannan and Jay Kennedy-Harris were also available after recovering from injuries. Australian Associated Press |
Q:
Validating a yum repository for dependencies
I am trying to create a custom rhel5.5 repository for my usage and I am having a hard time validating if I have all the dependencies for every package in my repository.
What I would want to do is do a yum install in dry run on every package in my repository to see if all the dependencies are available.
Is there an easy way to do that?
EDIT
I've found the answer.
Download yum-utils
yum install yum-utils
and do a repoclosure
repoclosure
It will find all missing dependencies of the repositories that you have set in your /etc/yum.repo.d/*
A:
yum install yum-utils
and do a repoclosure
repoclosure
It will find all missing dependencies of the repositories that you have set in your /etc/yum.repo.d/*
|
# Biological Attack UI
```
Biological Attack UI Ver. 1
Created by Raymond "Raeleus" Buckley
Visit ray3k.wordpress.com for games, tutorials, and much more!
Biological Attack UI can be used under the CC BY license.
http://creativecommons.org/licenses/by/4.0/
```
Features styles of most of **Scene2D** widgets. Ideal for your post-apocalyptic game. Can be recolored with JSON parameters.
### About
Created with [Skin Composer](https://github.com/raeleus/skin-composer) by [**Raeleus**](https://ray3k.wordpress.com/biological-attack-ui-skin-for-libgdx/).
### License
[CC BY 4.0](http://creativecommons.org/licenses/by/4.0/). Give credit to [***Raymond "Raeleus" Buckley***](https://ray3k.wordpress.com/software/skin-composer-for-libgdx/). Also, see the [font license](SourceSansPro.txt).
|
Gender representation in illustrations, text, and topic areas in sexuality education curricula.
A content analysis instrument was developed to examine differences in gender representation in sexuality education curricula. Fourteen middle school and high school curricula, published between 1985 and 1995, were examined. Variables included illustrations, noun/pronoun usage, and specific topics within the two categories of biological function and mutual interest. The study examined differences in gender representation in illustrations, photographs, cartoons, drawings, and text. Omission of sexuality topics related to gender also was examined. Little difference occurred within the text of the curricula in noun and pronoun usage. Illustrations were few in number, but showed greater female representation. Greater male representation occurred in topics related to drug use, sexual exploitation, sexual desire, and homosexuality. Topics with greater female representation included body image, diseases of the reproductive organs, and hygiene. |
Q:
How can I test what my readme.md file will look like before committing to github?
I am writing a readme for my github project in the .md format. Is there a way can I test what my readme.md file will look like before committing to github?
A:
Many ways: If you're on a Mac, use Mou.
If you want to test in a browser, you could try StackEdit, as pointed out by @Aaron or Dillinger since Notepag seems to be down now. Personally I use Dillinger since it just works and saves all my documents in my browser's local database.
A:
Atom works nicely out of the box - just open the Markdown file and hit Ctrl+Shift+M to toggle the Markdown preview panel next to it. It handles HTML and images also.
A:
This one has proven reliable for quite some time: http://tmpvar.com/markdown.html
|
Expression, maturation, and rhodamine-based fluorescence assay of human cathepsin K expressed in CHO cells.
Cathepsin K is a cysteine protease that degrades type I human collagen during bone resorption. We have expressed the recombinant human cathepsin K in Chinese hamster ovary (CHO) cells as a pre-proenzyme and demonstrated that it is processed intracellularly to an active enzyme form and that only the proenzyme form is secreted. Immunofluorescence detection of cathepsin K in CHO cells resulted in discrete punctate distribution consistent with a lysosomal localization of the enzyme. With both extract and cell preparations of CHO cells expressing cathepsin K, [Z-Leu-Arg](2)-rhodamine was the best substrate for analyzing cathepsin K activity over background proteases. We have established a cellular-based assay to analyze cell-permeable inhibitors of cathepsin K and validated the assay with detection of intracellular versus extracellular activity, fluorescence-assisted cell sorter (FACS) analysis, and a selective cathepsin K inhibitor. The intracellular activity of cathepsin K was monitored by FACS analysis using the rhodamine substrate, which demonstrated an increased fluorescence over mock-transfected cells that was also inhibitable by (2S,3S)-trans-epoxysuccinyl-L-leucylamido-3-methylbutane ethyl ester (E64d). A selective cathepsin K inhibitor, 1, 3-bis(CBZ-Leu-NH)-2-propanone, had an IC(50) of 134 nM in the CHO/Cat K cells, which is the same potency as that measured against a purified enzyme preparation of cathepsin K. Therefore, we have established a system to evaluate intracellular cathepsin K activity and inhibition by cell-permeable inhibitors of this thiol protease. |
Imagine a world where consumers buy their groceries directly from manufacturers, cutting grocery stores and supermarkets completely out of the equation. That’s a future that blockchain startup INS wants to enable. And the company has just raised roughly $43 million (60,000 Ether) in a public token sale to make it happen.
Basic Attention Token (BAT) has been in the news first because of its listing on Coinbase and second, because of the rather unexpected price fall following the listing. The cryptocurrency has taken the surprise even further by signing up with…
About
Here at Cryptonomics.News, we try to report and share with you all the latest news and developments within the cryptocurrency space. By aggregating news from around the web and providing in-house reporting.
Our mission is to educate, inform and spread the word to the world regarding everything and anything about Blockchain technology. |
The ESG is running a petition for a reliable and clean public transport system to be introduced in Gibraltar without further delay. The petition was launched on World Earth Day and circulated at the Spring Day Festival event at the botanical gardens where the ESG also took part. This petition will be handed in to the Minister for Transport, Mr Joe Holliday when they meet next week.
To date, the response from the public has been overwhelmingly in favour of the ESG proposition. As well as consensus on our pollution problems on our roads, the majority believe it will enhance our “tourist product” image; reduce congestion, enable the car-less to move around Gibraltar in comfort, and allow more walking and cycling to replace much of the current private car-use. We hope that in the time available, we shall be able to collect many more signatures to help emphasis our case at next weeks’ meeting.
Quite apart from the ESG main concerns of pollution and its effects on children, which is now well understood in respect of asthma and other respiratory complaints, an article in the Independent on Sunday has confirmed the need to see action taken by Govt. to address this serious problem on our roads today.
The report published this week in the European Heart Journal suggests that new evidence has emerged linking small daily increases in air pollution as a potential trigger of heart attacks in those with vulnerable arteries, making the case for urgent implementation of a new public transport system using clean technology.
We want to see an end to the careless enforcement of air emission control with regards to our local buses and many 2 stroke mopeds as well as incoming vehicles from outside Gibraltar. |
In the past year, we’ve seen a wide number of initiatives to further distribute governance into the hands of the community. Examples include but are not limited to:
Now that we’re starting to see some of these experiments pan out live, it’s time for us to band together and consider those which will make strong delegates in the coming months.
Key Delegate Considerations
As we scour the governance leaderboards and look for who to delegate to, here are some important topics to keep in mind:
Specialized Knowledge – Is this party well versed on the subject?
Experience – Does this party have a background that makes them well suited to make the right choices?
Intent – How does this party stand to benefit from being a delegate?
Direction – Where would this party like to see the project go? How will this influence their decisions?
Commitment – Will this party be active in its governance participation and due diligence?
More specifically, each protocol has a unique set of rules, features and design choices that will make given individuals (or parties) better suited to handle governance decisions.
Our Goal
In this article, we’ll be making a case for why DeFi Rate should be a leading DeFi governance delegate.
In the spirit of transparency, all DeFi Rate governance will be handled through our official governance wallet – defirate.eth.
We believe that the permissionless nature of allowing anyone to see how we’re voting, what tokens are being received and how those rewards are being spent are a crucial component to making a trusted delegate.
Furthermore, we plan on providing reports surrounding why different governance decisions were made, and actively invite our delegates to join the conversation via an official DeFi Rate channel to be announced in the near future.
With that, let’s touch on why someone might want to delegate to DeFi Rate.
Why DeFi Rate?
Extensive Coverage
Since July of 2019, we’ve been covering virtually every major story in DeFi that we find relevant and valuable to the wider community. This has given DeFi Rate a front-row seat to the growing trends within DeFi, specifically the emergence of governance frameworks.
What’s unique about this positioning is that DeFi Rate has strong ties with both emerging and established communities within DeFi, making us well equipped to garner feedback and perceptions from a diverse range of users.
The best way to synthesize this coverage is by checking out the various segments we offer on the site. The goal is to create a trusted resource for all things DeFi – specifically geared towards nontechnical users looking to keep up with the trends without being forced to do a deep dive.
Rounding this point out, we believe our due diligence on sector relevant news, trends and data has given us a strong oversight of community sentiment and feel that this sentiment will be directed in a value-added way towards DeFi protocol governance.
Community Contributions
Our team has worked with and been featured on notable outlets including but not limited to:
This Week in Ethereum
ETHHub
Bankless
The Defiant
Our Network
Alltop
Kyber Network
Set Protocol
POAP
Similarly, our team members have spent an extensive amount of time interfacing with rising DAOs like Moloch, MetaCartel and Raid Guild just to name a few.
This focus on social coordination makes us well suited to help stimulate off-chain discussions, meetings and forums regarding various protocol upgrades. Beyond the discussions themselves, we believe we have a strong grasp on the tools which enable governance to succeed, largely aiming to help protocols better optimize their frameworks through user-tests and surveys.
Passion for DeFi
Perhaps the most obvious trait for a good delegate is that of passion. While DeFi Rate is a relatively new brand, our team is highly motivated to help shape a bright future for DeFi as a whole.
While there may be other delegates with more experience in the legacy financial sector, we believe we are among the most well suited to be actively engaged in any and all votes that come to the table.
For the vast majority of our team, DeFi Rate is the pillar project we are building our future career off of, and believe that this opportunity is a fantastic way to better demonstrate the value of learning to survive and thrive in a decentralized world.
To us, delegation is a core foundation towards creating a trusted brand. By effectively voting and influencing protocols in what we believe to be a value-added fashion, we’re hopeful that our collective knowledge can show that DeFi Rate is more than just a blog.
At the end of the day, the value which is derived from governing the permissionless financial primitives of tomorrow is truly boundless, and we believe this opportunity will allow us to be even more inept to deliver compelling real-time trends to the broader DeFi community.
Who Are We?
Under the hood, DeFi Rate is led by a suite of crypto enthusiasts. Here’s some context.
Governance Team
Kendall Saville – FOUNDER –
Founder Bitcoinprice.com
Co-Founder Catena Media US (Acquired)
Angel Investor at Simple
Board Member JM Bullion
Black Labrador owner & Sriracha enthusiast
Cooper Turley – EDITOR –
Lucas Campbell – ANALYST –
Full Team
DeFi Dude – WRITER –
Community Growth of Kyber Network
Business Development at POAP
Kieran Oday – WRITER –
Former Analyst for Crush Crypto.
Founder University of Colorado Blockchain Club
Alejandro Miguel – WRITER –
5+ years of industry experience
Looking Ahead
This resource is meant to serve as an overview on why DeFi Rate is well suited to handle governance of any DeFi protocol.
For each new opportunity that arises, DeFi Rate will make unique proposals as to why we belive we would make a good delegate in that specific system.
If you or your team would like to delegate to us for any number of DeFi projects and are looking for more information on how to do so, please DM us on Twitter.
For more news on all things DeFi, check out our newsletter!
Sign up for This Week in DeFi Leave this field empty if you're human:
Disclaimer: DeFi Rate may earn rewards or fees from acting as a delegate on any given DeFi protocol. All rewards can be reviewed directly on the defirate.eth wallet address and we will aim to be as transparent as possible in any rewards earned from governance. |
Free Standard Shipping above $30
This panoramic image from the Hautman Brothersfeatures a collection of birds perched on a country fencecovered with morning glory flowers. The Hautman Brothers have established themselves as America's foremost family of wildlife artists. This 750-piece jigsaw puzzle measures 38" x 11" when completmore
Hautman Bros. Songbirds 750 Piece Panoramic Puzzle: This panoramic image from the Hautman Brothers features a collection of birds perched on a country fence covered with morning glory flowers. The Hautman Brothers have established themselves as America's foremost family of wildlife artists. This 750-piece jigsaw puzzle measures 38" x 11" when complete. Includes a bonus poster inside! 100% made in the USA. Ages 14+. UPC: 079346140244 |
Degradation of methionine hydroxy analog in the rumen of lactating cows.
Four lactating cows fitted with T-type cannulae in the proximal duodenum were utilized in a 4 X 4 Latin square design to study rumen microbial degradation of methionine hydroxy analog, a methionine supplement. A diet consisting of 55% concentrate and 45% corn silage was fed ad libitum four times daily. The four treatments were 1) control, no methionine hydroxy analog, 2) methionine hydroxy analog in the form of a calcium salt, 3) methionine hydroxy analog in the acid form, and 4) DL-methionine. The amino acids were incorporated into a grain mix, which was top-dressed. All diets were isonitrogenous. Twelve samples of duodenal digesta and fecal matter were collected during the last 3 d of each of the four 14-d periods. Samples were composited for analysis. Microbes either altered or degraded 99% of the methionine hydroxy analog in the rumen, since recovery of the analog in duodenal digesta was less than 1% of the amount fed for both the acid form and the calcium salt. |
Young version of my Mod character as a pokemon trainer with NekoHeart and Tiramisu Cream as the PokePonyFor the HQ version of this picture be in at least the $5 patreon slot before the month ends!--------------------------------------------If you like my artwork please consider supporting me at patreon! Your support is what keeps me creating! Thanks! ^^ |
The International Criminal Court issued arrest warrants Monday for Libyan strongman Moammar Kadafi, his son and his brother-in-law, alleging that they committed crimes against humanity in Kadafi’s campaign to hold on to power and crush the rebellion against his iron rule.
Judges at The Hague said there was sufficient evidence that Kadafi and his two relatives ordered the killing and imprisonment of hundreds of civilians during the first days of the uprising that broke out in February 2011.
Besides Kadafi, the warrants named his son Seif Islam and his brother-in-law Abdullah Sanoussi, Libya’s military intelligence chief. The two men are considered to be among Kadafi’s closest confidants.
INTERACTIVE TIMELINE: Rebellion in Libya
Officials from NATO countries engaged in the air campaign against Kadafi’s forces welcomed the announcement.
“The warrants further demonstrate why Kadafi has lost all legitimacy and why he should go immediately,” said British Foreign Secretary William Hague. “His forces continue to attack Libyans without mercy and this must stop.”
But the warrants could make any prospect of a political deal, in which Kadafi relinquishes power, more difficult. An agreement that would allow him to go into exile would run up against the now-official demand for his arrest.
Prosecutor Luis Moreno-Ocampo submitted his request for the warrants last month, citing what he said was overwhelming evidence against the three men. Moreno-Ocampo described Seif Islam as Kadafi’s “de factor prime minister” and Sanoussi as his “executioner.”
The prosecutor’s brief accused Kadafi of ordering his security forces to shoot civilians and destroy their property as punishment for opposing him. It said that the longtime Libyan leader issued the orders verbally in order to avoid a paper trail that could be used against him.
Among the incidents attributed to Kadafi’s direction were attacks by his troops on funeral processions around the cities of Benghazi and Misurata in February 2011. Forces loyal to Kadafi also took up strategic positions around mosques in Tripoli, the capital, from where they gunned down up to 100 civilians Feb. 25, the prosecutor’s brief alleged.
Even before the warrants were issued, the Kadafi regime dismissed the court’s authority.
“The ICC has no legitimacy whatsoever. We will deal with it,” Libyan government spokesman Moussa Ibrahim said Sunday. |
Q:
Global Functions In Aurelia
I'm trying to figure out how to store a "global" like function in Aurelia. I've followed this tutorial "http://blog.durandal.io/2015/04/24/aurelia-custom-elements-and-content-selectors/" to open a modal with a dynamic view modal, but I can't figure out where I should actually put this function so I can re-use it all my view routes.
I've created this function in my default view:
//open modal
setModal(modal) {
this.contentModal = modal;
$('.modal').modal();
}
with this markup inside that view template:
<a click.delegate="setModal('users')">Test</a> <a click.delegate="setModal('child-router')">Test 2</a>
<modal>
<modal-header title.bind="'View Person'"></modal-header>
<modal-body content.bind="contentModal"></modal-body>
<modal-footer buttons.bind="['Cancel']"></modal-footer>
</modal>
And I can call it via click.delegate="setModal('users') inside that view template, but I can't figure out how to actually make this available outside of this view template.
Sorry I'm very new to this framework!
A:
So it sounds like you have a default view + view-model, lets call them app.html and app.js.
In app.html you have the modal markup:
<modal>
<modal-header title.bind="'View Person'"></modal-header>
<modal-body content.bind="contentModal"></modal-body>
<modal-footer buttons.bind="['Cancel']"></modal-footer>
</modal>
And in app.js you have the function to display a modal:
//open modal
setModal(modal) {
this.contentModal = modal;
$('.modal').modal();
}
And your question is "how do I share the setModal function with other view-models?"
You could register the setModal function in the container. Then you will be able to inject it into other view-models that have a dependency on that function:
app.js
import {inject, Container} from 'aurelia-framework'; // or 'aurelia-dependency-injection'
@inject(Container)
export class App {
constructor(container) {
// register the setModal function in the container
// under the key "setModal".
container.registerInstance('setModal', this.setModal.bind(this));
}
//open modal
setModal(modal) {
this.contentModal = modal;
$('.modal').modal();
}
}
some-other-view-model.js
import {inject} from 'aurelia-framework'; // or 'aurelia-dependency-injection'
@inject('setModal') // inject the setModal function into this view-model
export class SomeOtherViewModel {
constructor(setModal) {
// create a setModal property for binding purposes
this.setModal = setModal;
}
}
It also might be worth taking a look at the aurelia-dialog plugin. You might also wrap this up in a custom attribute so that you don't have to import the setModal function into your view-models.
|
SOURCE: “Solzhenitsyn's One Day in the Life of Ivan Denisovich,” in The Explicator, Vol. 45, No. 1, Fall, 1986, pp. 53-5.
In the following essay, Yarup discusses the spiritual dimension of Denisovich's struggle in One Day in the Life of Ivan Denisovich, drawing comparison to the religious faith of Ivan and Alyoshka and correlations to The Gulag Archipelago.
In the very disciplined dramatic form of One Day in the Life of Ivan Denisovich, Solzhenitsyn devises a structural arrangement which illuminates the thematic meaning of Shukhov’s survival in the Soviet labor camp. He constructs a vital frame1 from the theologies of Saint Peter and Saint Paul based on Christian sacrifice of body and the consequential resurrection of soul:
But let none of you suffer as a murderer, or as a thief, or as an evildoer, or as a busybody in other men’s matters. Yet if any man suffer as a... |
Reviews
Here is what would want for a sequel: Bigger ships, more allies, and multiple weapons. Oh, and the ability to talk with subordinates on board your ship, while upgrading stuff like a med bay to deal with crew casualties, or having a hangar with fighters.
The thing that made this work was that it was again, pretty easy to follow. The gameplay was pretty clear even if the objectives were not. The best part was the little cannon on the head of the ship that could fire anywhere you wanted. This seemed to be well detail and had adequate graphics. My only problem is that it does seem like you are floating off into space too often. The map is pretty useful in helping you around.
The sounds are nice and I especially like the ones the cannon makes. This may be the first game where I went over a black hole and didn't get sucked in. The ship was a little hard to control at games, but boy, was it strong. You certainly had a lot of literal space to explore as you played this game. There were maybe too many oppurtunies to save it.
Cons:
You can still improve that quality
More guns?
A larger ship/more slots/A capital ship
I agree with the others, it's a total war so we should feel like it is a total war not just a one man fleet against the universe |
An Early Look At Mega Man Legends 3 In Screenshot Form
Since Capcom are developing Mega Man Legends 3 in collaboration with fans, they’re also giving them a peek at how the game looks at this early stage, which game publishers almost never do. The reveal comes courtesy of the game’s director, Masakazu Eguchi, over on the game’s development blog.
Before we go any further, we should preface this by stating that the images that follow are early screenshots. In some of the older screens, the polygonal models have nothing on them beyond the most basic textures, primitive lighting and no fancy shaders. That said, this is what Legends 3 looks like at the moment, Eguchi says:
Here are images of an older prototype from June 2010, where no assets for Legends 3 had been created, so Capcom borrowed assets from previous Mega Man titles to throw together a build of Teomo City. The design was still being worked on at this point.
And here are more screens of Teomo and some ruins, just a month later (August 2010):
Eguchi also points out the floating placeholder Bass model in the ruins screenshot.
Quote from the devblog entry: (in between the shots with classic Megaman) “The earliest stages of development. We used this background as a preliminary test. All we had at this point was a big ol’ island to be wandered around on by Mega Man. . . . Classic Mega Man?! At this stage, we still didn’t have the player character model, so we borrowed the data from a different Mega Man model. Then we plopped out a big land mass to represent Klickelan Island. That brown stuff on the green is supposed to represent Teomo City.”
Ah thanks man. Stopped reading the devblog a while ago (updates are few and generally uninteresting) but this explains it.
Yusaku_Matsuda70s
The Legends games were some of the best looking games on the PSOne (and they still look great) thanks to the clean, simplistic art style. This looks to be similar.
With great color comes great scenery. Err that’s not quite how it goes isn’t it… |
Awkwafina’s Logan Paul Tweets Make Her Feelings About The Offensive YouTuber Very Clear
When it comes to all things markedly not OK, Awkwafina certainly doesn't mince words. So, after YouTube superstar Logan Paul posted a video featuring images of what appeared to be a dead body hanging from a tree in a Japanese forest known for its high incidents of suicide, the rapper-comedian took to Twitter with her thoughts on the 22-year-old internet sensation. And, basically, Awkwafina's Logan Paul comments boil down to this: In a hypothetical world, she'd really like to drop kick him.
Amid the mixed bag of celebrity responses to Paul's video — which had already gleaned millions of views when he took it down — Awkwafina (whose given name is Nora Lum) penned a now-viral series of tweets on Jan. 3 expressing her overall distaste for Paul and his behaviors. Of course, to do that, she infused a bit of her characteristically spitfire rhetorical flair. (For those unfamiliar with the tongue-in-cheek verbal gymnastics that launched Awkwafina's career, the spunky rapper certainly has a way with words.)
"If I died and Logan Paul was the first person to find my body and video tape it out of a desperate attempt to stay relevant after Vine died w his career," Awkwafina wrote, kicking off the first installment of what evolved into a three-part tweet series, "I would ask God for a 15-minute day pass to come back [and] drop kick him in the throat."
Ad failed to load
The rapper quickly corrected herself in an addendum to her original tweet about an hour later. In the auxiliary edit, Awkwafina explained that, upon further research, she learned that Paul (who rose to fame in 2013 as a vlogger on the now-fallen social video app Vine) didn't actually kiss his career goodbye along with the video service that gave him his start.
The scope of Paul's massive digital reach is part of the reason why his World Wide Web-sized blunder was such a big deal to so many people. After publishing a video earlier this week that included grotesquely tactless footage of what seemed to be a deceased person's body hanging from a tree in the thick of Japan's infamously dense Aokigahara forest (more colloquially referred to as the Sea of Trees; and with good reason, given its sprawling square footage), situated along the northwestern border of Mount Fuji.
The forest has risen to notoriety as a site for eerily rampant instances of suicide — a harrowing pattern that has rendered it something of a spooky pop cultural specimen (see: its various cinematic renditions, including 2015's Sea of Trees and 2016's horror flick, The Forest) and earned Aokigahara its gaudy nickname "suicide forest." The ways in which an objective tragedy like suicide (especially in this uniquely horrifying, chronic type of iteration) could be warped and sensationalized in the name of westernized "entertainment value" was already considered offensive and disrespectful by many.
In the third and final installment of her pungent Twitter commentary, Awkwafina seems to have pretty adequately summed up what a lot of people probably wish they could say to Paul right now. "Don't enter a suicide forest in a foreign country with a camera, hoping that you'll find a dead body," she wrote. "Suicide is not monetized content."
Ad failed to load
Because, no matter which way you spin it, capitalizing off a far-away tragedy for entertainment's sake is really pretty heinous. And it probably shouldn't require a massive cyber-firestorm for a fully grown, 22-year-old man to know that.
If you or someone you know are experiencing suicidal thoughts, call 911, or call the National Suicide Prevention Hotline at 1-800-273-8255. |
What is "Begging the Question?"
"Begging the question" is a form of logical fallacy in which a statement or claim is assumed to be true without evidence other than the statement or claim itself. When one begs the question, the initial assumption of a statement is treated as already proven without any logic to show why the statement is true in the first place.
A simple example would be "My favorite author is always right because he says so in his latest book." The proof is merely a restatement of the premise. The sentence has begged the question.
What is it Not?
To beg the question does not mean "to raise the question." (e.g. "It begs the question, why is he so dumb?") This is a common error of usage made by those who mistake the word "question" in the phrase to refer to a literal question. Sadly, the error has grown more and more common with time, such that even journalists, advertisers, and major mass media entities have fallen prey to "BTQ Abuse."
While descriptivists and other such laissez-faire linguists are content to allow the misconception to fall into the vernacular, it cannot be denied that logic and philosophy stand to lose an important conceptual label should the meaning of BTQ become diluted to the point that we must constantly distinguish between the traditional usage and the erroneous "modern" usage. This is why we fight.
Any Questions?
Please see the Frequently Asked Questions.
Get Involved!
Print out BTQ cards and get BTQ shirts and other merchandise to spread the word. |
Rajasthani Jewellery – A Mingle of Tradition & Glamour
by Authindia ·
Published January 13, 2017
· Updated September 28, 2017
Rajasthan the city popular for its culture, artistic side and mouth melting flavors in food. Rajasthan is a state from where several royals and rulers brought their tradition which is still seen in their artistic taste of jewellery and clothes. Rajasthani jewelry is a combination of ongoing trend with authentic traditional designs. The design which no women can deny to wear and flaunt.
Popular Rajasthani Jewellery
Famous Indian actresses of Bollywood such as Vidya Balan, Rekha, Sonam Kapoor, Aishwarya Rai and Madhuri Dixit have joyfully flaunted Rajasthani Rajputi adornments at celebrity award event, red carpet and films. This could be one reason for the developing fans and admirers of Rajasthani adornments.
When we talk about bridal jewellery the first things comes to our mind is heavy and stylish Rajasthani Rajput jewellery. The precious stones studded into Meenakari, Thewa, Kundan necklaces, Bangles and other ornaments from head to toe that enhances the beauty of every bride to look astonishing. There are wide variety of designs and pattern from traditional to glamorous jewellery for modern age brides.
Kundan Jewellery
Kundan jewellery is popular for its perplexing designs among ladies. The manufacturing of Kundan jewellery needs very detailed work and time. Initially, these stones were determined to profoundly refined gold. Stones are determined to a gold sheet and afterward gold foils are squeezed in the holes around the stones. Layer after layer of gold foils are squeezed till the holes are filled. These days, the silver Kundan jewellery is also available in the markets that are accessible for everyone. Utilization of artificial stones in Kundan jewellery makes it less costly.
Thewa Jewellery
The traditional art of making Thewa jewellery is very old in Rajasthan. Thewa jewellery is the fusion of gold and glass together in which pure gold designs are created on a multi-colored glass. The bright colors and motifs are used for making the jewellery that incorporates the rich culture of Rajasthan.
Meenakari Jewellery
Meenakari jewellery originated from Jaipur, Rajasthan is exceptionally renowned for its designs and bright colors. In meenakari art, the jewellery is designed by engraving the outlines of blossoms, winged animals, and fish. Therefore, furrows are made to hold the colors. Later the color is poured into the sections. Every color on jewellery is fired exclusively. The warmth of fire softens the color and it spreads consistently in each section. When finished, the procedure is rehashed with another color; generally gold and silver are used as the base of Meenakari. Jaipur Meenakari adornments are in demand on account of the nature-based themes like blossoms and creatures (elephants, peacocks, parrots etc).
Polki Jewellery
Polki jewellery is a raw form of diamond that is not cut or polished. It is semi-polished and does not experience much chemical treatment that gives the jewellery a rustic appearance. These natural uncut diamonds are determined to 24 karat gold utilizing genuine gold foils or lac. The natural unique shape and sparkle of polka jewellery makes it exceptionally costly and it is later passed on from one to another new bride in the family in a form of legacy. Delightful neck-pieces, hoops, chokers and chand balis composed in polka are always the ones to go for.
Tribal Jewellery
The most commonly seen jewellery for every Rajasthani women in Silver. Tribal jewellery is very common and popular among the Rajasthani ladies and is in huge demand. These are made up of silver, with broad hollow bells worn by the Banjara tribal people of Rajasthan. Upper armlet, neck ring or hansuli and mandliya string neckband, along with a belt that is heavy and in layers. Single waist chain and toe rings in “Gajre” outlines are other tribal adornments that are exceptionally famous. Tokariya or antique tribal old silver hoops are likewise exceptionally well known among the tribal individuals in Rajasthan. These kind of tribal jewellery is mostly loved by locals & tourists both.
Lac Jewellery
The most beautiful and attractive lac jewellery is very popular ornaments in Rajasthan. The lac bangles are made in charming, vibrant colors (red, blue, gold) are the mostly used hues in the manufacturing of lac jewellery. Semi-precious stones are used and also known as common gold in Rajasthan and other states.
The various Rajasthani ornaments and few masterpieces are shown below:
Rakhdi
Rakdi commonly known as maang tikka. The accessory, which the bride wears on her forehead, comes in numerous designs and patterns.
Kundan Bhutti
Kundan bhutti is the pattern of jhumka; long and heavy studded with gems and stones both precious and semi-precious. The designs are unique and modern that gives the bride an astonishing look.
Choker & Raani Haar
Traditional Rajasthani jewellery in the form of Raani Haar studded with precious multi-colored gems. The neck piece is heavy covering the neck and Raani Haar is long kisses the navel. The jewellery is made up of gold and uncut diamonds give the impressive look.
Bajuband & Chooda
These ornaments are commonly worn by Marwari and Rajput brides. The astonishing design engraved on gold and set of bangles signifies the marital ecstasy. |
A power converter is a circuit having the dual functional task of changing a voltage level and providing a DC output voltage. This function entails the use of both a transformer to alter the voltage level from some input value and a rectifier to provide a DC output voltage. In instances of a step down converter where the level of the output voltage is reduced below the input voltage level, the output current exceeds the input current and hence the conductive losses on the secondary side of the transformer tend to dominate the overall dissipative loss of the entire converter. In fact the major portion of these conduction losses occur in the conductive path connecting the secondary winding of the transformer to the diodes of the rectifier. The fact that this connection carries a high AC current results in higher losses than that of a comparable DC current path. In addition to these dissipative losses the AC current path has stray inductance losses which further detracts from the desired performance of the converter.
Other factors in the performance of a converter are its density or space/footprint requirements on a circuit board and its thermal dissipation characteristics. The separateness of the transformer and rectifier require two distinct footprints and this requirement is spatially inefficient. |
comment
DARIEN, Conn. – Many of us take our mobility for granted. Kim Babcock does not.
Lack of mobility is not a personal hardship, but one she sees every day. Working with the elderly through
Right at Home
, a Darien-based business that provides services to keep the elderly safely at home, Babcock has seen how lack of independence can devastate an individual.
As a Girl Scout leader in Easton for 13 years as well as a school and church volunteer, Babcock has been involved in charity and volunteer work for a long time. When the corporate office of Right at Home introduced its national partnership with the organization
Free Wheelchair Mission
at an annual meeting, Babcock knew she had to get involved in the week-long mission to bring wheelchairs to those in need.
The Free Wheelchair Mission, a faith-based nonprofit that provides the disabled in developing countries with free wheelchairs, had already chosen Costa Rica when Babcock signed on.
“We were able to touch so many lives by giving recipients the gift of mobility,” said Babcock.
Right at Home, which she runs with her husband, David, delivered over 600 wheelchairs. Of those Babcock personally delivered between 30 to 35 directly to people’s homes in Costa Rica.
“We learned the story of each recipient and learned that so many of these people were not able to leave their homes,” she said.
“Many spent their days on the porch or on a chair in the house because it was too hard for family members to move them beyond that.”
One of the more memorable gifts, according to Babcock, was to Jose Leon, 80, of Corralellos de Filedelphia. Leon suffered a stroke five years ago, which left him with no control of his lower body. Weekly hospital visits were only possible because his 15-year-old grandson would carry him there. Now, with a wheelchair all that is easier for Leon and his family.
“Each and every recipient was so thankful,” said Babcock. “This was truly an incredible trip for me. I feel so blessed to have been part of it.” |
Q:
Dovecot pw generation mismatch
According to Dovecot's wiki, a SHA256 scheme is the sha256 sum of the password stored in base64.
$ doveadm pw -s SHA256 -p "test"
{SHA256}n4bQgYhMfWWaL+qgxVrQFaO/TxsrC4Is0V1sFbDwCgg=
but it does not match the output of this command :
$ echo -n "test" | sha256sum | awk '{ print $1 }' | base64
OWY4NmQwODE4ODRjN2Q2NTlhMmZlYWEwYzU1YWQwMTVhM2JmNGYxYjJiMGI4MjJjZDE1ZDZjMTVi
MGYwMGEwOAo=
Why is it different?
A:
I found the answer. The output of
$ echo -n "test" | sha256sum
is the hex representation of the hash. sha256sum does not have an option for raw (binary) output. This command works :
$ echo -n "test" | openssl dgst -binary -sha256 | base64
|
Ron Paul WILL participate in May 15 Fox News South Carolina Debate
I initially reported that Fox News might be attempting to apply certain criteria for participation in the May 15 GOP debate in South Carolina, but the channel has since announced (read that, relented) that all 10 GOP candidates will be present. Ron Paul’s participation now appears confirmed. It’s on his calendar and it’s in the SCGOP’s news release.
The South Carolina GOP debate will air May 15 at 9:00 p.m. Eastern time, 6:00 Pacific time, on the Fox News Channel. Unfortunately, I’ve seen nothing about streaming Internet coverage, but will update if that is announced. |
This means you've done it right - if you ended up with something like 12 = 18, you'd know you made a mistake.
The problem is NOT asking you to find numbers for x and y. The only thing you have to do when it says "solve for y" is to get y by itself and everything else on the other side. Your final answer is:
.
That's it!
Note that this does describe a relationship between x and y, and (0,3) does satisfy this relationship. However, note that there are an infinite number of combinations of x and y that work. If you put in, say, 6 for x, you get:
so you get the point (6, -2).
If you were to graph ALL the points (there are an infinite number of them) that satisfy your equation, you'd get a straight line. |
Highly recommend for bankruptcy.
Chris and his associate partnered with my wife and me to implement a very smooth and effective bankruptcy. He immediately put us at ease during this very challenging process and effectively represented our best interests.
Highly Recommended
Chris represented me on my bankruptcy this year. He made sure I understood every step I was going through, and prepared me for the worst. When my bankrupcy was final I couldn't have been more pleased with the results. The outcome of my bankruptcy far exceeded my expectations. I highly recommend this attorney and his associates. They are the best in my opinion.
Practice Areas
Attorney Endorsements
Jeffrey Miller Medical Malpractice Attorney September 10, 2014 3:37pmRelationship: Worked together on matter
I stronly endorse this lawyer's work. Chris Stuart is one the hardset working and smartest lawyers I know. He is very conscientious, thorough and diligent. He would be a great choice for any kind of litigation. |
Duale viciously attacks Baringo Senator Gideon Moi
The Jubilee Party now tells the independent party, Kenya African National Union (KANU), to brace for a tight contest in the August 8, 2017 elections.
Speaking in Kapseret on Monday, January 9, during the burial of former nominated Member of Parliament, Mark Too – famously known as Bwana Dawa, National Assembly Majority Leader, Aden Duale, said that the Jubilee administration will conduct free and fair nominations that will see it sweep all the seats in the vote-rich Rift Valley region.
In a well targeted attack on Baringo Senator, Gideon Moi, Duale told the Senator that KANU should start packing as it will not get anything elective seat in the 2017 elections.
“I know my friend Gideon you are praying that we bungle the nominations process so that you can get at least one seat. You can be sure this will not happen,” Duale told the young Moi.
“We will make sure our nomination process is free, fair and transparent and we will send KANU home.” |
Roland Hahn, the 18-month-old who was taken to Akron Children’s Hospital in Boardman in February 2017 for skull fractures and brain bleeding, is back in his father’s arms in Florida, and has recovered from his injuries. |
420 Recap
The Things We Hoped You Did On 420
To all the real soldiers out there you know what 420 is all about. If you haven’t missed a 420 since you have started you are a knight at the round table, cheers to you my friend. Yesterday was all about the munchies, positive vibes, and chiefing dank herb. Tell us how your 420 went down? We want to hear all about it, hopefully your activities you engaged in looked a little like this.
Circle Session with Your Best Buds: Seriously, the herb brings people together. There is a good chance that all your best mates came together this way. Never take your circle for granted these people are friends for life.
Munchies Mission: We hope you took a spin to your nearest dank fast food spot. You better have munched down on chicken and waffles. Or if you were able to cookout with your squad members that is always a good way to celebrate too.
If you decided that pizza was the best route for the tribe, then we hope you made it a gourmet one paired with some IPAs.
Epic Chill Spots: We hoped you made the trek down to your secret natural getaway spot and brought some treats and roll-ups to gaze for miles and miles.
The Dunes: OBX, NC
The Blue Ridge Mountains, VA
Movie/TV Trilogy Day: If you are a low-key type of toker we hoped you got to enjoy watching cinema yesterday. 420 is the perfect day to watch your favorite series, hopefully it is Lord of The Rings. The Shire life is where it’s at.
If you couldn’t find anything to do then, we hoped you just Blazed All Day Like Wiz Khalifa. |
.rate-number-up-down-btn-up {
display: block;
float: left;
background: url(add.png);
width: 16px;
height: 16px;
margin-top: 4px;
text-indent: 100px;
overflow: hidden;
}
.rate-number-up-down-btn-down {
display: block;
float: left;
background: url(minus.png);
width: 16px;
height: 16px;
margin-top: 4px;
text-indent: 100px;
overflow: hidden;
}
.rate-number-up-down-rating {
display: block;
float: left;
text-align: center;
padding: 0 5px;
}
.rate-number-up-down-rating-up {
display: block;
float: left;
width: 45px;
text-align: right;
padding-top: 3px;
}
.rate-number-up-down-rating-down {
display: block;
float: left;
width: 45px;
text-align: left;
padding-top: 3px;
}
|
Alright, after several more hours of work in fine positioning and kerning, here is a shot with "MAKER SPACE." I've made text on either side of the logo to span the same distance and balance out visually. I also re-added "MAKE SHARE LEARN" which I dropped in the last graphic. Hey, would it be considered too cheesy to print this out on clear laminate plastic or something for the door? The PDF of this is on an 11x17 sheet and the graphic is about 16.5" wide.
I'd like to see it on plastic on the door, that would look great until we get vinyl cut.
It wouldn't even have to be adhesive plastic, starbucks uses "clings" and they work great.
Can I get a copy of the raw file, I'm thinking I might want to t-shirt or animate that.
Very excellent, wammie.
Riley
Riley, the raw file is CorelDraw version 9. Do you want that or some other file format?
[EDIT: Here is A PDF VERSION an AN EPS VERSION. NOTE: Google Docs presents what appears to be half of a preview for the EPS version, but it's complete. Just choose File > Download original from the Google Docs page.]
I finally found a narrower V bit for my router so I was trying to cut this out this evening to test out the bit. I don't want to start any holy wars literally or figuratively, but due to the intertubes being down at the HF, I used an older version of the sign for my test, I repeat this is only a test.
It's about 36" wide, if I put the line around the outside back on. ( My machine can do roughly 24" so thus the two pieces", Jim's has a 4' x 4' envelope I believe)
I plan to not plunge so deep so the twin lines of the letters don't run together as they do on the smaller letters here. Anyway, it shows promise.
You should see the edges It's the scrap chip board / laminate from a "Zebra wood" armoire I junked. It's just what I had laying about, old screw holes and all. I was happy just to be making something, with house repairs and by-law wrangling it was nice to take a break and build something and use my CNC.
I'm interested in trying the bit in plex, per an idea of Jude's to make an edge light "Hack Factory" sign for under the chrome deco / moderne stripe above the front door. I'm a bit worried that the two sides of the letters won't get equal light, but we'll see.
BTW if anyone hase a 45 degree, or less than 60 degree router bit we can barrow / try that would be great.
Something I learned, the nice plastic cases that v-bits come in are really light, prone to be pulled into dust collection systems, and hard to catch even though you can see them progressing once inside said DC tubing. (If you've seen the newest Star Trek movie's "Scotty in the water tube" scene, you know exactly what it was like.)
otto_pjm wrote:I finally found a narrower V bit for my router so I was trying to cut this out this evening to test out the bit. I don't want to start any holy wars literally or figuratively, but due to the intertubes being down at the HF, I used an older version of the sign for my test, I repeat this is only a test.
It's about 36" wide, if I put the line around the outside back on. ( My machine can do roughly 24" so thus the two pieces", Jim's has a 4' x 4' envelope I believe)
I plan to not plunge so deep so the twin lines of the letters don't run together as they do on the smaller letters here. Anyway, it shows promise. |
# Copyright (c) 2012 Google Inc. All rights reserved.
# Use of this source code is governed by a BSD-style license that can be
# found in the LICENSE file.
{
'targets': [
{
'target_name': 'empty',
'type': 'shared_library',
'sources': [ 'empty.s' ],
},
],
}
|
My Devotion By : ALBERT / 6B. Bible Verse Kisah Para Rasul 16:25 They are being putted to the jail and at midnight, they are singing and praising the.
Similar presentations
Presentation on theme: "My Devotion By : ALBERT / 6B. Bible Verse Kisah Para Rasul 16:25 They are being putted to the jail and at midnight, they are singing and praising the."— Presentation transcript:
1
My Devotion By : ALBERT / 6B
2
Bible Verse Kisah Para Rasul 16:25 They are being putted to the jail and at midnight, they are singing and praising the lord even they are already get injured. They sing out loud until the other prisoners listen to them.
3
Reflection of the Bible Verse So we couldn’t hate Jesus like what Paul and Silas did that even we got hurt, we must know that Jesus feel something more hurt than what we feel.
4
Bible Verse prayer Dear Lord, please bless me to be as good as Paulus even before he really hate Jesus but because of your holiness, he became so kind and died because of telling all things about Bible and Jesus, in the name of Jesus I pray, Amen
5
My Devotion I sincely play game even I haven’t finish my job so now I will finish my job and practice for exam because I never practice even my parents had ask me for many time so now I want to practice so that I will not be sad for my result because I had try my best. |
Saturday Jun. 27, 2015 mcr@sandelman.ca
Summary for 1.7.4 libpcap release
Include fix for GitHub issue #424 -- out of tree builds.
Friday Apr. 10, 2015 guy@alum.mit.edu
Summary for 1.7.3 libpcap release
Work around a Linux bonding driver bug.
Thursday Feb. 12, 2015 guy@alum.mit.edu/mcr@sandelman.ca
Summary for 1.7.2 libpcap release
Support for filtering Geneve encapsulated packets.
Generalize encapsulation handling, fixing some bugs.
Don't add null addresses to address lists.
Add pcap_dump_open_append() to open for appending.
Fix the swapping of isochronous descriptors in Linux USB.
Attempt to handle TPACKET_V1 with 32-bit userland and 64-bit kernel.
Wednesday Nov. 12, 2014 guy@alum.mit.edu/mcr@sandelman.ca
Summary for 1.7.0 libpcap release
Fix handling of zones for BPF on Solaris
new DLT for ZWAVE
clarifications for read timeouts.
Use BPF extensions in compiled filters, fixing VLAN filters
some fixes to compilation without stdint.h
EBUSY can now be returned by SNFv3 code.
Fix the range checks in BPF loads
Various DAG fixes.
Various Linux fixes.
Monday Aug. 12, 2014 guy@alum.mit.edu
Summary for 1.6.2 libpcap release
Don't crash on filters testing a non-existent link-layer type
field.
Fix sending in non-blocking mode on Linux with memory-mapped
capture.
Fix timestamps when reading pcap-ng files on big-endian
machines.
Saturday Jul. 19, 2014 mcr@sandelman.ca
Summary for 1.6.1 libpcap release
some fixes for the any device
changes for how --enable-XXX (--enable-sniffing, --enable-can) works
Wednesday Jul. 2, 2014 mcr@sandelman.ca
Summary for 1.6.0 libpcap release
Don't support D-Bus sniffing on OS X
fixes for byte order issues with NFLOG captures
Handle using cooked mode for DLT_NETLINK in activate_new().
on platforms where you can not capture on down interfaces, do not list them
but: do list interfaces which are down, if you can capture on them!
Wednesday December 18, 2013 guy@alum.mit.edu
Summary for 1.5.3 libpcap release
Don't let packets that don't match the current filter get to the
application when TPACKET_V3 is used. (GitHub issue #331)
Fix handling of pcap_loop()/pcap_dispatch() with a packet count
of 0 on some platforms (including Linux with TPACKET_V3).
(GitHub issue #333)
Work around TPACKET_V3 deficiency that causes packets to be lost
when a timeout of 0 is specified. (GitHub issue #335)
Man page formatting fixes.
Wednesday December 4, 2013 guy@alum.mit.edu
Summary for 1.5.2 libpcap release
Fix libpcap to work when compiled with TPACKET_V3 support and
running on a kernel without TPACKET_V3 support. (GitHub
issue #329)
Wednesday November 20, 2013 guy@alum.mit.edu
Summary for 1.5.1 libpcap release
Report an error, rather than crashing, if an IPv6 address is
used for link-layer filtering. (Wireshark bug 9376)
Wednesday October 30, 2013 guy@alum.mit.edu
Summary for 1.5.0 libpcap release
TPACKET_V3 support added for Linux
Point users to the the-tcpdump-group repository on GitHub rather
than the mcr repository
Checks added for malloc()/realloc()/etc. failures
Fixed build on Solaris 11
Support filtering filtering E1 SS7 traffic on MTP2 layer Annex A
Use "ln -s" to link man pages by default
Add support for getting nanosecond-resolution time stamps when
capturing and reading capture files
Many changes to autoconf to deal better with non-GCC compilers
added many new DLT types
Saturday April 6, 2013 guy@alum.mit.edu
Summary for 1.4.0 libpcap release
Add netfilter/nfqueue interface.
If we don't have support for IPv6 address resolution, support,
in filter expressions, what IPv6 stuff we can.
Fix pcap-config to include -lpthread if canusb support is
present
Try to fix "pcap_parse not defined" problems when --without-flex
and --without-bison are used when you have Flex and Bison
Fix some issues with the pcap_loop man page.
Fix pcap_getnonblock() and pcap_setnonblock() to fill in the
supplied error message buffer
Fix typo that, it appeared, would cause pcap-libdlpi.c not to
compile (perhaps systems with libdlpi also have BPF and use
that instead)
Catch attempts to call pcap_compile() on a non-activated pcap_t
Fix crash on Linux with CAN-USB support without usbfs
Fix addition of VLAN tags for Linux cooked captures
Check for both EOPNOTSUPP and EINVAL after SIOCETHTOOL ioctl, so
that the driver can report either one if it doesn't support
SIOCETHTOOL
Add DLT_INFINIBAND and DLT_SCTP
Describe "proto XXX" and "protochain XXX" in the pcap-filter man
page
Handle either directories, or symlinks to directories, that
correspond to interfaces in /sys/class/net
Fix handling of VLAN tag insertion to check, on Linux 3.x
kernels, for VLAN tag valid flag
Clean up some man pages
Support libnl3 as well as libnl1 and libnl2 on Linux
Fix handling of Bluetooth devices on 3.x Linux kernels
Friday March 30, 2012. mcr@sandelman.ca
Summary for 1.3.0 libpcap release
Handle DLT_PFSYNC in {FreeBSD, other *BSD+Mac OS X, other}.
Linux: Don't fail if netfilter isn't enabled in the kernel.
Add new link-layer type for NFC Forum LLCP.
Put the CANUSB stuff into EXTRA_DIST, so it shows up in the release tarball.
Add LINKTYPE_NG40/DLT_NG40.
Add DLT_MPEG_2_TS/LINKTYPE_MPEG_2_TS for MPEG-2 transport streams.
[PATCH] Fix AIX-3.5 crash with read failure during stress
AIX fixes.
Introduce --disable-shared configure option.
Added initial support for canusb devices.
Include the pcap(3PCAP) additions as 1.2.1 changes.
many updates to documentation: pcap.3pcap.in
Improve 'inbound'/'outbound' capture filters under Linux.
Note the cleanup of handling of new DLT_/LINKTYPE_ values.
On Lion, don't build for PPC.
For mac80211 devices we need to clean up monitor mode on exit.
Friday December 9, 2011. guy@alum.mit.edu.
Summary for 1.2.1 libpcap release
Update README file.
Fix typoes in README.linux file.
Clean up some compiler warnings.
Fix Linux compile problems and tests for ethtool.h.
Treat Debian/kFreeBSD and GNU/Hurd as systems with GNU
toolchains.
Support 802.1 QinQ as a form of VLAN in filters.
Treat "carp" as equivalent to "vrrp" in filters.
Fix code generated for "ip6 protochain".
Add some new link-layer header types.
Support capturing NetFilter log messages on Linux.
Clean up some error messages.
Turn off monitor mode on exit for mac80211 interfaces on Linux.
Fix problems turning monitor mode on for non-mac80211 interfaces
on Linux.
Properly fail if /sys/class/net or /proc/net/dev exist but can't
be opened.
Fail if pcap_activate() is called on an already-activated
pcap_t, and add a test program for that.
Fix filtering in pcap-ng files.
Don't build for PowerPC on Mac OS X Lion.
Simplify handling of new DLT_/LINKTYPE_ values.
Expand pcap(3PCAP) man page.
Sunday July 24, 2011. mcr@sandelman.ca.
Summary for 1.2 libpcap release
All of the changes listed below for 1.1.1 and 1.1.2.
Changes to error handling for pcap_findalldevs().
Fix the calculation of the frame size in memory-mapped captures.
Add a link-layer header type for STANAG 5066 D_PDUs.
Add a link-layer type for a variant of 3GPP TS 27.010.
Noted real nature of LINKTYPE_ARCNET.
Add a link-layer type for DVB-CI.
Fix configure-script discovery of VLAN acceleration support.
see http://netoptimizer.blogspot.com/2010/09/tcpdump-vs-vlan-tags.html
Linux, HP-UX, AIX, NetBSD and OpenBSD compilation/conflict fixes.
Protect against including AIX 5.x's <net/bpf.h> having been included.
Add DLT_DBUS, for raw D-Bus messages.
Treat either EPERM or EACCES as "no soup for you".
Changes to permissions on DLPI systems.
Add DLT_IEEE802_15_4_NOFCS for 802.15.4 interfaces.
Fri. August 6, 2010. guy@alum.mit.edu.
Summary for 1.1.2 libpcap release
Return DLT_ values, not raw LINKTYPE_ values from
pcap_datalink() when reading pcap-ng files
Add support for "wlan ra" and "wlan ta", to check the RA and TA
of WLAN frames that have them
Don't crash if "wlan addr{1,2,3,4}" are used without 802.11
headers
Do filtering on USB and Bluetooth capturing
On FreeBSD/SPARC64, use -fPIC - it's apparently necessary
Check for valid port numbers (fit in a 16-bit unsigned field) in
"port" filters
Reject attempts to put savefiles into non-blocking mode
Check for "no such device" for the "get the media types" ioctl
in *BSD
Improve error messages from bpf_open(), and let it do the error
handling
Return more specific errors from pcap_can_set_rfmon(); fix
documentation
Update description fetching code for FreeBSD, fix code for
OpenBSD
Ignore /sys/net/dev files if we get ENODEV for them, not just
ENXIO; fixes handling of bonding devices on Linux
Fix check for a constant 0 argument to BPF_DIV
Use the right version of ar when cross-building
Free any filter set on a savefile when the savefile is closed
Include the CFLAGS setting when configure was run in the
compiler flags
Add support for 802.15.4 interfaces on Linux
Thu. April 1, 2010. guy@alum.mit.edu.
Summary for 1.1.1 libpcap release
Update CHANGES to reflect more of the changes in 1.1.0.
Fix build on RHEL5.
Fix shared library build on AIX.
Thu. March 11, 2010. ken@netfunctional.ca/guy@alum.mit.edu.
Summary for 1.1.0 libpcap release
Add SocketCAN capture support
Add Myricom SNF API support
Update Endace DAG and ERF support
Add support for shared libraries on Solaris, HP-UX, and AIX
Build, install, and un-install shared libraries by default;
don't build/install shared libraries on platforms we don't support
Fix building from a directory other than the source directory
Fix compiler warnings and builds on some platforms
Update config.guess and config.sub
Support monitor mode on mac80211 devices on Linux
Fix USB memory-mapped capturing on Linux; it requires a new DLT_
value
On Linux, scan /sys/class/net for devices if we have it; scan
it, or /proc/net/dev if we don't have /sys/class/net, even if
we have getifaddrs(), as it'll find interfaces with no
addresses
Add limited support for reading pcap-ng files
Fix BPF driver-loading error handling on AIX
Support getting the full-length interface description on FreeBSD
In the lexical analyzer, free up any addrinfo structure we got back
from getaddrinfo().
Add support for BPF and libdlpi in OpenSolaris (and SXCE)
Hyphenate "link-layer" everywhere
Add /sys/kernel/debug/usb/usbmon to the list of usbmon locations
In pcap_read_linux_mmap(), if there are no frames available, call
poll() even if we're in non-blocking mode, so we pick up
errors, and check for the errors in question.
Note that poll() works on BPF devices is Snow Leopard
If an ENXIO or ENETDOWN is received, it may mean the device has
gone away. Deal with it.
For BPF, raise the default capture buffer size to from 32k to 512k
Support ps_ifdrop on Linux
Added a bunch of #ifdef directives to make wpcap.dll (WinPcap) compile
under cygwin.
Changes to Linux mmapped captures.
Fix bug where create_ring would fail for particular snaplen and
buffer size combinations
Update pcap-config so that it handles libpcap requiring
additional libraries
Add workaround for threadsafeness on Windows
Add missing mapping for DLT_ENC <-> LINKTYPE_ENC
DLT: Add DLT_CAN_SOCKETCAN
DLT: Add Solaris ipnet
Don't check for DLT_IPNET if it's not defined
Add link-layer types for Fibre Channel FC-2
Add link-layer types for Wireless HART
Add link-layer types for AOS
Add link-layer types for DECT
Autoconf fixes (AIX, HP-UX, OSF/1, Tru64 cleanups)
Install headers unconditionally, and include vlan.h/bluetooth.h if
enabled
Autoconf fixes+cleanup
Support enabling/disabling bluetooth (--{en,dis}able-bluetooth)
Support disabling SITA support (--without-sita)
Return -1 on failure to create packet ring (if supported but
creation failed)
Fix handling of 'any' device, so that it can be opened, and no longer
attempt to open it in Monitor mode
Add support for snapshot length for USB Memory-Mapped Interface
Fix configure and build on recent Linux kernels
Fix memory-mapped Linux capture to support pcap_next() and
pcap_next_ex()
Fixes for Linux USB capture
DLT: Add DLT_LINUX_EVDEV
DLT: Add DLT_GSMTAP_UM
DLT: Add DLT_GSMTAP_ABIS
Mon. October 27, 2008. ken@netfunctional.ca. Summary for 1.0.0 libpcap release
Compile with IPv6 support by default
Compile with large file support on by default
Add pcap-config script, which deals with -I/-L flags for compiling
DLT: Add IPMB
DLT: Add LAPD
DLT: Add AX25 (AX.25 w/KISS header)
DLT: Add JUNIPER_ST
802.15.4 support
Variable length 802.11 header support
X2E data type support
SITA ACN Interface support - see README.sita
Support for memory-mapped capture on Linux
Support for zerocopy BPF on platforms that support it
Support for setting buffer size when opening devices
Support for setting monitor mode when opening 802.11 devices
Better support for dealing with VLAN tagging/stripping on Linux
Fix dynamic library support on OSX
Return PCAP_ERROR_IFACE_NOT_UP if the interface isn't 'UP', so applications
can print better diagnostic information
Return PCAP_ERROR_PERM_DENIED if we don't have permission to open a device, so
applications can tell the user they need to go play with permissions
On Linux, ignore ENETDOWN so we can continue to capture packets if the
interface goes down and comes back up again.
On Linux, support new tpacket frame headers (2.6.27+)
On Mac OS X, add scripts for changing permissions on /dev/bpf* and launchd plist
On Solaris, support 'passive mode' on systems that support it
Fixes to autoconf and general build environment
Man page reorganization + cleanup
Autogenerate VERSION numbers better
Mon. September 10, 2007. ken@xelerance.com. Summary for 0.9.8 libpcap release
Change build process to put public libpcap headers into pcap subir
DLT: Add value for IPMI IPMB packets
DLT: Add value for u10 Networks boards
Require <net/pfvar.h> for pf definitions - allows reading of pflog formatted
libpcap files on an OS other than where the file was generated
Wed. April 25, 2007. ken@xelerance.com. Summary for 0.9.6 libpcap release
Put the public libpcap headers into a pcap subdirectory in both the
source directory and the target include directory, and have include
files at the top-level directory to include those headers, for
backwards compatibility.
Add Bluetooth support
Add USB capturing support on Linux
Add support for the binary USB sniffing interface in Linux
Add support for new FreeBSD BIOCSDIRECTION ioctl
Add additional filter operations for 802.11 frame types
Add support for filtering on MTP2 frame types
Propagate some changes from the main branch, so the x.9 branch has
all the DLT_ and LINKTYPE_ values that the main branch does
Reserved a DLT_ and SAVEFILE_ value for PPI (Per Packet Info)
encapsulated packets
Add LINKTYPE_ for IEEE 802.15.4, with address fields padded as done
by Linux drivers
Add LINKTYPE_ value corresponding to DLT_IEEE802_16_MAC_CPS.
Add DLT for IEEE 802.16 (WiMAX) MAC Common Part Sublayer
Add DLT for Bluetooth HCI UART transport layer
When building a shared library, build with "-fPIC" on Linux to support x86_64
Link with "$(CC) -shared" rather than "ld -shared" when building a
".so" shared library
Add support for autoconf 2.60
Fixes to discard unread packets when changing filters
Changes to handle name changes in the DAG library resulting from
switching to libtool.
Add support for new DAG ERF types.
Add an explicit "-ldag" when building the shared library, so the DAG
library dependency is explicit.
Mac OSX fixes for dealing with "wlt" devices
Fixes in add_or_find_if() & pcap_findalldevs() to optimize generating
device lists
Fixed a bug in pcap_open_live(). The return value of PacketSetHwFilter
was not checked.
Tue. September 19, 2006. ken@xelerance.com. Summary for 0.9.5 libpcap release
Support for LAPD frames with vISDN
Support for ERF on channelized T1/E1 cards via DAG API
Fix capitalization that caused issues crossc compiling on Linux
Better failure detection on PacketGetAdapterNames()
Fixes for MPLS packet generation (link layer)
OP_PACKET now matches the beginning of the packet, instead of
beginning+link-layer
Add DLT/LINKTYPE for carrying FRF.16 Multi-link Frame Relay
Fix allocation of buffer for list of link-layer types
Added a new DLT and LINKTYPE value for ARINC 653 Interpartition Communcation Messages
Fixed a typo in a DLT value: it should start with DLT_ and not LINKTYPE_
Redefined DLT_CAN20B and LINKTYPE_CAN20B as #190 (as this is the right value for CAN).
Added definition for DLT_A429 and LINKTYPE_A429 as #184.
Added a new DLT and LINKTYPE value for CAN v2.0B frames.
Add support for DLT_JUNIPER_VP.
Don't double-count received packets on Linux systems that
support the PACKET_STATISTICS getsockopt() argument on
PF_PACKET sockets.
Add support for DLT_IEEE802_11 and DLT_IEEE802_11_RADIO link
layers in Windows
Add support to build libpcap.lib and wpcap.dll under Cygnus and
MingW32.
Mon. September 5, 2005. ken@xelerance.com. Summary for 0.9.4 libpcap release
Support for radiotap on Linux (Mike Kershaw)
Fixes for HP-UX
Support for additional Juniper link-layer types
Fixes for filters on MPLS-encapsulated packets
"vlan" filter fixed
"pppoed" and "pppoes" filters added; the latter modifies later
parts of the filter expression to look at the PPP headers and
headers in the PPP payload
Tue. July 5, 2005. ken@xelerance.com. Summary for 0.9.3 libpcap release
Fixes for compiling on nearly every platform,
including improved 64bit support
MSDOS Support
Add support for sending packets
OpenBSD pf format support
IrDA capture (Linux only)
Tue. March 30, 2004. mcr@sandelman.ottawa.on.ca. Summary for 3.8.3 release
Fixed minor problem in gencode.c that would appear on 64-bit
platforms.
Version number is now sane.
Mon. March 29, 2004. mcr@sandelman.ottawa.on.ca. Summary for 3.8.2 release
updates for autoconf 2.5
fixes for ppp interfaces for freebsd 4.1
pcap gencode can generate code for 802.11, IEEE1394, and pflog.
Wed. November 12, 2003. mcr@sandelman.ottawa.on.ca. Summary for 0.8 release
added pcap_findalldevs()
Win32 patches from NetGroup, Politecnico di Torino (Italy)
OpenBSD pf, DLT_PFLOG added
Many changes to ATM support.
lookup pcap_lookupnet()
Added DLT_ARCNET_LINUX, DLT_ENC, DLT_IEEE802_11_RADIO, DLT_SUNATM,
DLT_IP_OVER_FC, DLT_FRELAY, others.
Sigh. More AIX wonderfulness.
Document updates.
Changes to API: pcap_next_ex(), pcap_breakloop(), pcap_dump_flush(),
pcap_list_datalinks(), pcap_set_datalink(),
pcap_lib_version(), pcap_datalink_val_to_name(),
pcap_datalink_name_to_val(), new error returns.
Tuesday, February 25, 2003. fenner@research.att.com. 0.7.2 release
Support link types that use 802.2 always, never, and sometimes.
Don't decrease the size of the BPF buffer from the default.
Support frame relay.
Handle 32-bit timestamps in DLPI, and pass the right buffer size.
Handle Linux systems with modern kernel but without
SOL_PACKET in the userland headers.
Linux support for ARPHRD_RAWHDLC.
Handle 32-bit timestamps in snoop.
Support eg (Octane/O2xxx/O3xxx Gigabit) devices.
Add new reserved DLT types.
Monday October 23, 2001. mcr@sandelman.ottawa.on.ca. Summary for 0.7 release
Added pcap_findalldevs() call to get list of interfaces in a MI way.
pcap_stats() has been documented as to what its counters mean on
each platform.
Tuesday January 9, 2001. guy@alum.mit.edu. Summary for 0.6 release
New Linux libpcap implementation, which, in 2.2 and later
kernels, uses PF_PACKET sockets and supports kernel packet
filtering (if compiled into the kernel), and supports the "any"
device for capturing on all interfaces. Cleans up promiscuous
mode better on pre-2.2 kernels, and has various other fixes
(handles 2.4 ARPHRD_IEEE802_TR, handles ISDN devices better,
doesn't show duplicate packets on loopback interface, etc.).
Fixed HP-UX libpcap implementation to correctly get the PPA for
an interface, to allow interfaces to be opened by interface name.
libpcap savefiles have system-independent link-layer type values
in the header, rather than sometimes platform-dependent DLT_
values, to make it easier to exchange capture files between
different OSes.
Non-standard capture files produced by some Linux tcpdumps, e.g.
the one from Red Hat Linux 6.2 and later, can now be read.
Updated autoconf stock files.
Filter expressions can filter on VLAN IDs and various OSI
protocols, and work on Token Ring (with non-source-routed
packets).
"pcap_open_dead()" added to allow compiling filter expressions
to pcap code without opening a capture device or capture file.
Header files fixed to allow use in C++ programs.
Removed dependancy on native headers for packet layout.
Removed Linux specific headers that were shipped.
Security fixes: Strcpy replaced with strlcpy, sprintf replaced
with snprintf.
Fixed bug that could cause subsequent "pcap_compile()"s to fail
erroneously after one compile failed.
Assorted other bug fixes.
README.aix and README.linux files added to describe
platform-specific issues.
"getifaddrs()" rather than SIOCGIFCONF used, if available.
v0.5 Sat Jun 10 11:09:15 PDT 2000
itojun@iijlab.net
- Brought in KAME IPv6/IPsec bpf compiler.
- Fixes for NetBSD.
- Support added for OpenBSD DLT_LOOP and BSD/OS DLT_C_HDLC (Cisco HDLC),
and changes to work around different BSDs having different DLT_ types
with the same numeric value.
Assar Westerlund <assar@sics.se>
- Building outside the source code tree fixed.
- Changed to write out time stamps with 32-bit seconds and microseconds
fields, regardless of whether those fields are 32 bits or 64 bits in
the OS's native "struct timeval".
- Changed "pcap_lookupdev()" to dynamically grow the buffer into which
the list of interfaces is read as necessary in order to hold the
entire list.
Greg Troxel <gdt@ir.bbn.com>
- Added a new "pcap_compile_nopcap()", which lets you compile a filter
expression into a BPF program without having an open live capture or
capture file.
v0.4 Sat Jul 25 12:40:09 PDT 1998
- Fix endian problem with DLT_NULL devices. From FreeBSD via Bill
Fenner (fenner@parc.xerox.com)
- Fix alignment problem with FDDI under DLPI. This was causing core
dumps under Solaris.
- Added configure options to disable flex and bison. Resulted from a
bug report by barnett@grymoire.crd.ge.com (Bruce Barnett). Also added
options to disable gcc and to force a particular packet capture type.
- Added support for Fore ATM interfaces (qaa and fa) under IRIX. Thanks
to John Hawkinson (jhawk@mit.edu)
- Change Linux PPP and SLIP to use DLT_RAW since the kernel does not
supply any "link layer" data.
- Change Linux to use SIOCGIFHWADDR ioctl to determine link layer type.
Thanks to Thomas Sailer (sailer@ife.ee.ethz.ch)
- Change IRIX PPP to use DLT_RAW since the kernel does not supply any
"link layer" data.
- Modified to support the new BSD/OS 2.1 PPP and SLIP link layer header
formats.
- Added some new SGI snoop interface types. Thanks to Steve Alexander
(sca@refugee.engr.sgi.com)
- Fixes for HP-UX 10.20 (which is similar to HP-UX 9). Thanks to
Richard Allen (ra@hp.is) and Steinar Haug (sthaug@nethelp.no)
- Fddi supports broadcast as reported by Jeff Macdonald
(jeff@iacnet.com). Also correct ieee802 and arcnet.
- Determine Linux pcap buffer size at run time or else it might not be
big enough for some interface types (e.g. FDDI). Thanks to Jes
Sorensen (Jes.Sorensen@cern.ch)
- Fix some linux alignment problems.
- Document promisc argument to pcap_open_live(). Reported by Ian Marsh
(ianm@sics.se)
- Support Metricom radio packets under Linux. Thanks to Kevin Lai
(laik@gunpowder.stanford.edu)
- Bind to interface name under Linux to avoid packets from multiple
interfaces on multi-homed hosts. Thanks to Kevin Lai
(laik@gunpowder.stanford.edu)
- Change L_SET to SEEK_SET for HP-UX. Thanks to Roland Roberts
(rroberts@muller.com)
- Fixed an uninitialized memory reference found by Kent Vander Velden
(graphix@iastate.edu)
- Fixed lex pattern for IDs to allow leading digits. As reported by
Theo de Raadt (deraadt@cvs.openbsd.org)
- Fixed Linux include file problems when using GNU libc.
- Ifdef ARPHRD_FDDI since not all versions of the Linux kernel have it.
Reported reported by Eric Jacksch (jacksch@tenebris.ca)
- Fixed bug in pcap_dispatch() that kept it from returning on packet
timeouts.
- Changed ISLOOPBACK() macro when IFF_LOOPBACK isn't available to check
for "lo" followed by an eos or digit (newer versions of Linux
apparently call the loopback "lo" instead of "lo0").
- Fixed Linux networking include files to use ints instead of longs to
avoid problems with 64 bit longs on the alpha. Thanks to Cristian
Gafton (gafton@redhat.com)
v0.3 Sat Nov 30 20:56:27 PST 1996
- Added Linux support.
- Fixed savefile bugs.
- Solaris x86 fix from Tim Rylance (t.rylance@elsevier.nl)
- Add support for bpf kernel port filters.
- Remove duplicate atalk protocol table entry. Thanks to Christian
Hopps (chopps@water.emich.edu)
- Fixed pcap_lookupdev() to ignore nonexistent devices. This was
reported to happen under BSD/OS by David Vincenzetti
(vince@cryptonet.it)
- Avoid solaris compiler warnings. Thanks to Bruce Barnett
(barnett@grymoire.crd.ge.com)
v0.2.1 Sun Jul 14 03:02:26 PDT 1996
- Fixes for HP-UX 10. Thanks in part to to Thomas Wolfram
(wolf@prz.tu-berlin.de) and Rick Jones (raj@hpisrdq.cup.hp.com)
- Added support for SINIX. Thanks to Andrej Borsenkow
(borsenkow.msk@sni.de)
- Fixes for AIX (although this system is not yet supported). Thanks to
John Hawkinson (jhawk@mit.edu)
- Use autoconf's idea of the top level directory in install targets.
Thanks to John Hawkinson.
- Add missing autoconf packet capture result message. Thanks to Bill
Fenner (fenner@parc.xerox.com)
- Fixed padding problems in the pf module.
- Fixed some more alignment problems on the alpha.
- Added explicit netmask support. Thanks to Steve Nuchia
(steve@research.oknet.com)
- Fixed to handle raw ip addresses such as 0.0.0.1 without "left
justifing"
- Add "sca" keyword (for DEC cluster services) as suggested by Terry
Kennedy (terry@spcvxa.spc.edu)
- Add "atalk" keyword as suggested by John Hawkinson.
- Add "igrp" keyword.
- Fixed HID definition in grammar.y to be a string, not a value.
- Use $CC when checking gcc version. Thanks to Carl Lindberg
(carl_lindberg@blacksmith.com)
- Removed obsolete reference to pcap_immediate() from the man page.
Michael Stolarchuk (mts@terminator.rs.itd.umich.edu)
- DLT_NULL has a 4 byte family header. Thanks to Jeffrey Honig
(jch@bsdi.com)
v0.2 Sun Jun 23 02:28:42 PDT 1996
- Add support for HP-UX. Resulted from code contributed by Tom Murray
(tmurray@hpindck.cup.hp.com) and Philippe-Andri Prindeville
(philipp@res.enst.fr)
- Update INSTALL with a reminder to install include files. Thanks to
Mark Andrews (mandrews@aw.sgi.com)
- Fix bpf compiler alignment bug on the alpha.
- Use autoconf to detect architectures that can't handle misaligned
accesses.
- Added loopback support for snoop. Resulted from report Steve
Alexander (sca@engr.sgi.com)
v0.1 Fri Apr 28 18:11:03 PDT 1995
- Fixed compiler and optimizer bugs. The BPF filter engine uses unsigned
comparison operators, while the code generator and optimizer assumed
signed semantics in several places. Thanks to Charlie Slater
(cslater@imatek.com) for pointing this out.
- Removed FDDI ifdef's, they aren't really needed. Resulted from report
by Gary Veum (veum@boa.gsfc.nasa.gov).
- Add pcap-null.c which allows offline use of libpcap on systems that
don't support live package capture. This feature resulting from a
request from Jan van Oorschot (j.p.m.voorschot@et.tudelft.nl).
- Make bpf_compile() reentrant. Fix thanks to Pascal Hennequin
(Pascal.Hennequin@hugo.int-evry.fr).
- Port to GNU autoconf.
- Fix pcap-dlpi.c to work with isdn. Resulted from report by Flemming
Johansen (fsj@csd.cri.dk).
- Handle multi-digit interface unit numbers (aka ppa's) under dlpi.
Resulted from report by Daniel Ehrlich (ehrlich@cse.psu.edu).
- Fix pcap-dlpi.c to work in non-promiscuous mode. Resulted from report
by Jeff Murphy (jcmurphy@acsu.buffalo.edu).
- Add support for "long jumps". Thanks to Jeffrey Mogul
(mogul@pa.dec.com).
- Fix minor problems when compiling with BDEBUG as noticed by Scott
Bertilson (scott@unet.umn.edu).
- Declare sys_errlist "const char *const" to avoid problems under
FreeBSD. Resulted from report by jher@eden.com.
v0.0.6 Fri Apr 28 04:07:13 PDT 1995
- Add missing variable declaration missing from 0.0.6
v0.0.5 Fri Apr 28 00:22:21 PDT 1995
- Workaround for problems when pcap_read() returns 0 due to the timeout
expiring.
v0.0.4 Thu Apr 20 20:41:48 PDT 1995
- Change configuration to not use gcc v2 flags with gcc v1.
- Fixed a bug in pcap_next(); if pcap_dispatch() returns 0, pcap_next()
should also return 0. Thanks to Richard Stevens (rstevens@noao.edu).
- Fixed configure to test for snoop before dlpi to avoid problems under
IRIX 5. Thanks to J. Eric Townsend (jet@abulafia.genmagic.com).
- Hack around deficiency in Ultrix's make.
- Fix two bugs related to the Solaris pre-5.3.2 bufmod bug; handle
savefiles that have more than snapshot bytes of data in them (so we
can read old savefiles) and avoid writing such files.
- Added checkioctl which is used with gcc to check that the
"fixincludes" script has been run.
v0.0.3 Tue Oct 18 18:13:46 PDT 1994
- Fixed configure to test for snoop before dlpi to avoid problems under
IRIX 5. Thanks to J. Eric Townsend (jet@abulafia.genmagic.com).
v0.0.2 Wed Oct 12 20:56:37 PDT 1994
- Implement timeout in the dlpi pcap_open_live(). Thanks to Richard
Stevens.
- Determine pcap link type from dlpi media type. Resulted from report
by Mahesh Jethanandani (mahesh@npix.com).
v0.0.1 Fri Jun 24 14:50:57 PDT 1994
- Fixed bug in nit_setflags() in pcap-snit.c. The streams ioctl timeout
wasn't being initialized sometimes resulting in an "NIOCSFLAGS:
Invalid argument" error under OSF/1. Reported by Matt Day
(mday@artisoft.com) and Danny Mitzel (dmitzel@whitney.hitc.com).
- Turn on FDDI support by default.
v0.0 Mon Jun 20 19:20:16 PDT 1994
- Initial release.
- Fixed bug with greater/less keywords, reported by Mark Andrews
(mandrews@alias.com).
- Fix bug where '|' was defined as BPF_AND instead of BPF_OR, reported
by Elan Amir (elan@leeb.cs.berkeley.edu).
- Machines with little-endian byte ordering are supported thanks to
Jeff Mogul.
- Add hack for version 2.3 savefiles which don't have caplen and len
swapped thanks to Vern Paxson.
- Added "&&" and "||" aliases for "and" and "or" thanks to Vern Paxson.
- Added length, inbound and outbound keywords.
|
/***********************************************************************
** Etresoft
** John Daniel
** Copyright (c) 2014-2017. All rights reserved.
**********************************************************************/
#import "ThunderboltCollector.h"
#import "NSMutableAttributedString+Etresoft.h"
#import "Utilities.h"
#import "NSArray+Etresoft.h"
#import "SubProcess.h"
// Collect information about Thunderbolt devices.
@implementation ThunderboltCollector
// Constructor.
- (id) init
{
self = [super initWithName: @"thunderbolt"];
if(self != nil)
{
}
return self;
}
// Perform the collection.
- (void) performCollect
{
NSArray * args =
@[
@"-xml",
@"SPThunderboltDataType"
];
SubProcess * subProcess = [[SubProcess alloc] init];
//subProcess.debugStandardOutput =
// [NSData dataWithContentsOfFile: @"/tmp/SPThunderboltDataType.xml"];
bool dataFound = NO;
if([subProcess execute: @"/usr/sbin/system_profiler" arguments: args])
{
NSArray * plist =
[NSArray readPropertyListData: subProcess.standardOutput];
if(plist && [plist count])
{
NSDictionary * devices =
[[plist objectAtIndex: 0] objectForKey: @"_items"];
for(NSDictionary * device in devices)
dataFound =
[self
printThunderboltDevice: device
indent: @" "
dataFound: dataFound];
if(dataFound)
[self.result appendCR];
}
}
[subProcess release];
dataFound = [self collectSerialATA: dataFound];
[self collectNVMExpress: dataFound];
}
// Collect information about a single Thunderbolt device.
- (BOOL) printThunderboltDevice: (NSDictionary *) device
indent: (NSString *) indent dataFound: (BOOL) dataFound
{
NSString * name = [device objectForKey: @"_name"];
NSString * vendor_name = [device objectForKey: @"vendor_name_key"];
if(vendor_name)
{
if(!dataFound)
{
[self.result appendAttributedString: [self buildTitle]];
dataFound = YES;
}
[self.result
appendString:
[NSString
stringWithFormat:
@"%@%@ %@\n", indent, vendor_name, name]];
indent = [NSString stringWithFormat: @"%@ ", indent];
}
[self collectSMARTStatus: device indent: indent];
// There could be more devices.
dataFound =
[self printMoreDevices: device indent: indent dataFound: dataFound];
return dataFound;
}
// Print more devices.
- (BOOL) printMoreDevices: (NSDictionary *) device
indent: (NSString *) indent dataFound: (BOOL) dataFound
{
NSDictionary * devices = [device objectForKey: @"_items"];
if(!devices)
devices = [device objectForKey: @"units"];
if(devices)
for(NSDictionary * device in devices)
{
BOOL printed =
[self
printThunderboltDevice: device
indent: indent
dataFound: dataFound];
if(printed)
dataFound = YES;
}
return dataFound;
}
// Perform the collection for old Serial ATA controllers.
- (BOOL) collectSerialATA: (BOOL) dataFound
{
NSArray * args =
@[
@"-xml",
@"SPSerialATADataType"
];
SubProcess * subProcess = [[SubProcess alloc] init];
//subProcess.debugStandardOutput =
// [NSData
// dataWithContentsOfFile: @"/tmp/SPSerialATADataType.xml"];
if([subProcess execute: @"/usr/sbin/system_profiler" arguments: args])
{
NSArray * plist =
[NSArray readPropertyListData: subProcess.standardOutput];
if(plist && [plist count])
{
NSDictionary * controllers =
[[plist objectAtIndex: 0] objectForKey: @"_items"];
for(NSDictionary * controller in controllers)
if([self shouldPrintController: controller])
{
BOOL printed =
[self
printSerialATAController: controller dataFound: dataFound];
if(printed)
dataFound = YES;
}
}
}
[subProcess release];
return dataFound;
}
// Perform the collection for new NVM controllers.
- (BOOL) collectNVMExpress: (BOOL) dataFound
{
NSArray * args =
@[
@"-xml",
@"SPNVMeDataType"
];
SubProcess * subProcess = [[SubProcess alloc] init];
[subProcess autorelease];
if([subProcess execute: @"/usr/sbin/system_profiler" arguments: args])
{
NSArray * plist =
[NSArray readPropertyListData: subProcess.standardOutput];
if(plist && [plist count])
{
NSDictionary * controllers =
[[plist objectAtIndex: 0] objectForKey: @"_items"];
for(NSDictionary * controller in controllers)
if([self shouldPrintController: controller])
{
BOOL printed =
[self
printNVMExpressController: controller dataFound: dataFound];
if(printed)
dataFound = YES;
}
}
}
return dataFound;
}
// Should this controller be printed here?
- (BOOL) shouldPrintController: (NSDictionary *) controller
{
NSString * name = [controller objectForKey: @"_name"];
if([name hasPrefix: @"Thunderbolt"])
return YES;
return NO;
}
@end
|
Q:
Why does JWT issuer signing key validation always return valid?
I have a Google Pub/Sub push subscription that sends a JWT token to the endpoint. The endpoint needs to validate this token. From Google documentation, I need to check the issuer, the audience and the signature. This works fine, except for whatever I add to IssuerSigningKey(s), the token is valid. I expected this to break whenever I e.g. remove a part of the key.
I tried all kinds of different values for IssuerSigningKey and IssuerSigningKeys. No matter what, I get a valid response. Changing e.g. the domain or audience parameters does return a 401 Unauthorized.
public void ConfigureServices(IServiceCollection services)
{
string domain = "https://accounts.google.com";
string audience = "theaudience";
// Just to debug/test
string signingKey = "---- - BEGIN PRIVATE KEY-----\nMIIfujHGitJ\n---- - END PRIVATE KEY-----\n";
var certificates =
this.FetchGoogleCertificates().GetAwaiter().GetResult();
services.AddAuthentication(options =>
{
options.DefaultAuthenticateScheme = JwtBearerDefaults.AuthenticationScheme;
options.DefaultChallengeScheme = JwtBearerDefaults.AuthenticationScheme;
}).AddJwtBearer(options =>
{
options.Authority = domain;
options.Audience = audience;
options.TokenValidationParameters = new TokenValidationParameters
{
ClockSkew = TimeSpan.FromHours(48), // This is just for debugging. Maybe we do need a little clock skew if the clock in Google is not aligned with the VD system
ValidateAudience = true, // Validate the audience, this will change in production to the endpoint URL
ValidateIssuer = true, // Validate the issuer (Google). If this is wrong, we get a 500 error instead of 40x
ValidateIssuerSigningKey = true,
IssuerSigningKey = new SymmetricSecurityKey(Encoding.UTF8.GetBytes(signingKey)),
/* Stuff I also tried:
IssuerSigningKey = new RsaSecurityKey(new RSACryptoServiceProvider(2048))
IssuerSigningKeys = certificates.Values.Select(x => new X509SecurityKey(x)),
IssuerSigningKeyResolver = (token, securityToken, kid, validationParameters) =>
{
return certificates
.Where(x => x.Key.ToUpper() == kid.ToUpper())
.Select(x => new X509SecurityKey(x.Value));
}
*/
};
});
services.AddAuthorization();
services.AddMvc().SetCompatibilityVersion(CompatibilityVersion.Version_2_2);
}
What is happening here?
A:
From the ASP.NET blog post on JWT Validation:
First, the Authority property should not be set on the
JwtBearerOptions. If it’s set, the middleware assumes that it can go
to that URI to get token validation information.
You are leaving the Authority property set, in your code example, which causes the verification library to make a network request to accounts.google.com to get token validation information. If you leave the Authority property unset, it will be forced to use your TokenValidationParameters.
|
The present invention relates to signal transmission and receiving methods, and more particularly to modulation, demodulation and decoding methods optimized for integrated circuit (IC) implementation
Signal modulation is a common data transmission method. Low frequency information signals are transmitted through high frequency waves (called the carrier) by modulating different properties of the carrier such as amplitude modulation (AM), frequency modulation (FM), or pulse phase modulation (PPM). These modulation procedures result in narrow bandwidth waves (called the xe2x80x9cchannelxe2x80x9d) that can be transmitted with minimum interference from signals in other channels. To retrieve the data, a receiver generally has a mechanism to separate the carrier signals in the carrier channel, and another mechanism to extract the information signals from the carrier. Conventional demodulators usually use tuned amplifiers or band-pass filters to receive the carrier signal, and use low pass filters to extract the information. These filters often contain networks of capacitors, resistors, and inductors. For integrated circuit implementation, the design methodology is different from that of discrete circuits. IC technologies are optimized to build switching transistors; millions of transistors cart be manufactured in a small area with high yield and excellent uniformity. On the other hand, IC technologies are less effective in building passive components; resistors and inductors in IC occupy large area with relatively poor uniformity. It is therefore a common practice for IC designers to avoid using passive components whenever it is possible to use transistors. One well-known example is the xe2x80x9cswitching capacitorxe2x80x9d (SC) technique that replaces resistors and inductors by switching transistors and capacitors. Filters built by the SC technique is proven to be highly successful for IC implementations, but SC technique is only applicable for low frequency operations. Another approach is to use a phase-locked loop (PLL) to synchronize internal clock signals with the carrier signals; demodulation mechanisms are then executed by switching circuits controlled by internal clock signals PLL is proven to be highly successful for many IC implementations. Its major problem is stability. As a sensitive analog feedback circuit, stability problems such as phase jitters and noise sensitivity are inevitable for PLL circuits. There are many other inventions developed to improve modulation or demodulation circuits for IC implementation. In U.S. Pat. No. 4,501,002 Auchterlonie described a demodulator for quadriphase shift keying (QPSK) signals. This invention is useful only for digital signals carried in QPSK format; it is not useful for signals in other formats, and it does not have the accuracy to decode analog signals, In U.S. Pat, No. 5,477,199 Montreuil described another system that is able to demodulate digital data in both vestigial side bad and offset keyed quadriphase signals. Again, the invention is useful only for specially formatted signals, and it is only for digital data decoding. Components used in Montreuil patent are also not optimized for IC implementation. It is highly desirable to be able to manufacture general purpose signal transmission and receiving circuitry optimized for IC technologies. It is also desirable to avoid using passive components or sensitive circuits such as PLL.
The primary objective of this invention is, therefore, to provide practical data transmission and receiving circuits optimized for integrated circuit implementation. The other primary objective of this invention is to improve reliability and stability of data transmission circuits. Another objective of the present invention is to provide practical methods to reduce transmission errors caused by non-ideal conditions. Another objective of the present invention is to provide the capability to transmit modulated signals that are not detectable with conventional demodulation methods. Another objective of the present invention is to maximize data transmission rate by demodulating both AM and FM signals simultaneously. It is a further objective of the present invention to provide a method to transmit and receive AM, FM, and digital data from the same carrier signal.
These and other objectives are accomplished by novel asynchronous demodulation methods. The demodulation methods extract information from carrier signals by switching transistors controlled by internal control signals Using multiple control signals with different phases, the demodulation methods of the present invention does not need to synchronize the internal control signals with the input carrier signals. It is therefore possible to avoid using sensitive analog circuits such as PLL or mixers. Demodulators of the present invention comprise mostly switching transistors; there are no passive resistors and inductors It is therefore ready to take full advantage of existing IC technologies to achieve highest performance using smallest area. Reliability and stability are improved by avoiding sensitive linear circuits or unstable feedback circuits. Circuit stability is further improved by a mechanism in the internal reference control signals that significantly improves circuit tolerance on non-ideal operation conditions. The demodulation methods of the present invention have a special property called xe2x80x9cquadrant independencexe2x80x9d. When the phases of individual cycles of the carrier signal are shifted by an integral of 90 degrees, the demodulation results do not change. Utilizing this special property it is possible to transmit signals in a way that current art demodulators won""t be able to detect It is also possible to improve data transmission rate by transmitting and receiving AM, FM, and digital signals simultaneously.
While the novel features of the invention are set forth with particularly in the appended claims, the invention, both as to organization and content, will be better understood and appreciated, along with other objects and features thereof, from the following detailed description taken in conjunction with the drawings. |
Q:
non greedy Python regex from end of string
I need to search a string in Python 3 and I'm having troubles implementing a non greedy logic starting from the end.
I try to explain with an example:
Input can be one of the following
test1 = 'AB_x-y-z_XX1234567890_84481.xml'
test2 = 'x-y-z_XX1234567890_84481.xml'
test3 = 'XX1234567890_84481.xml'
I need to find the last part of the string ending with
somestring_otherstring.xml
In all the above cases the regex should return XX1234567890_84481.xml
My best try is:
result = re.search('(_.+)?\.xml$', test1, re.I).group()
print(result)
Here I used:
(_.+)? to match "_anystring" in a non greedy mode
\.xml$ to match ".xml" in the final part of the string
The output I get is not correct:
_x-y-z_XX1234567890_84481.xml
I found some SO questions (link) explaining the regex starts from the left even with non greedy qualifier.
Could anyone explain me how to implement a non greedy regex from the right?
A:
Your pattern (_.+)?\.xml$ captures in an optional group from the first underscore until it can match .xml at the end of the string and it does not take the number of underscores that should be between into account.
To only match the last part you can omit the capturing group. You could use a negated character class and use the anchor $ to assert the end of the line as it is the last part:
[^_]+_[^_]+\.xml$
Regex demo | Python demo
That will match
[^_]+ Match 1+ times not _
_ Match literally
[^_]+ Match 1+ times not _
\.xml$ Match .xml at the end of the string
For example:
import re
test1 = 'AB_x-y-z_XX1234567890_84481.xml'
result = re.search('[^_]+_[^_]+\.xml$', test1, re.I)
if result:
print(result.group())
|
Shipping & Returns
Product Information
Why We Love This
A set of three vintage rolling pins with original red, black, and green painted handles. Dimensions: smallest, 16"L; largest, 17.25"L.
As described by
Bubble & Squeak
About
Bubble & Squeak
Bubble & Squeak is the leading authority on cabin style. The company is the result of two passionate and focused designers, antiquarians, and art collectors whose goal is to offer high quality hand-selected items to furnish your dream retreat. Whether your cabin is a chateau in the south of France, an urban penthouse, or a charming cottage in the woods, Bubble & Squeak is sure to have something to please your taste. |
---
abstract: 'Using the natural extension for $\theta$-expansions, we give an infinite-order-chain representation of the sequence of the incomplete quotients of these expansions. Together with the ergodic behavior of a certain homogeneous random system with complete connections, this allows us to solve a variant of Gauss-Kuzmin problem for the above fraction expansion.'
author:
- |
Gabriela Ileana Sebe[^1]\
*Politehnica University of Bucharest, Faculty of Applied Sciences*,\
*Splaiul Independentei 313, 060042, Bucharest, Romania*\
and\
Dan Lascu[^2]\
*Mircea cel Batran Naval Academy, 1 Fulgerului, 900218 Constanta, Romania*\
title: 'A GAUSS-KUZMIN THEOREM AND RELATED QUESTIONS FOR $\theta$-EXPANSIONS'
---
[**Mathematics Subject Classifications (2010).**]{}\
[**Key words**]{}: continued fractions, $\theta$-expansions, Perron-Frobenius operator, random system with complete connections, Gauss-Kuzmin problem.
Introduction
============
During the last fifty years a large amount of research has been devoted to the study of various algorithms for the representation of real numbers by means of sequences of integers. Motivated by problems in random continued fraction expansions (see [@BG-2000]), Chakraborty and Rao [@CR-2003] have initiated a systematic study of the continued fraction expansion of a number in terms of an irrational $\theta \in (0,1)$. This new expansion of positive reals, different from the regular continued fraction expansion is called $\theta$*-expansion.*
The purpose of this paper is to solve a Gauss-Kuzmin problem for $\theta$-expansions. In order to solve the problem, we apply the theory of random systems with complete connections extensively studied by Iosifescu and Grigorescu [@IG-2009]. First we outline the historical framework of this problem. In Section 1.2, we present the current framework. In Section 1.3, we review known results.
Gauss’ Problem
--------------
One of the first and still one of the most important results in the metrical theory of continued fractions is the so-called Gauss-Kuzmin theorem. Any irrational $0<x<1$ can be written as the infinite regular continued fraction
$$x = \displaystyle \frac{1}{a_1+\displaystyle \frac{1}{a_2+\displaystyle \frac{1}{a_3+ \ddots}}} :=[a_1, a_2, a_3, \ldots], \label{1.1}$$
where $a_n \in \mathbb{N}_+ : = \left\{1, 2, 3, \ldots\right\}$ [@IK-2002]. Such integers $a_1, a_2, \ldots$ are called [*incomplete quotients*]{} (or [*continued fraction digits*]{}) of $x$. The metrical theory of continued fraction expansions started on 25th October 1800, with a note by Gauss in his mathematical diary [@Brez]. Define the *regular continued fraction* (or *Gauss*) *transformation* $\tau$ on the unit interval $I:=[0, 1]$ by $$\tau (x) = \left\{\begin{array}{lll}
\displaystyle \frac{1}{x}-\left\lfloor \displaystyle \frac{1}{x} \right\rfloor & \hbox{if} & x \neq 0, \\
\\
0 & \hbox{if} & x = 0,
\end{array} \right. \label{1.2}$$ where $\left\lfloor \cdot \right\rfloor$ denotes the floor (or entire) function. With respect to the asymptotic behavior of iterations $\tau^{n}=\tau\circ \cdots\circ \tau$ ($n$-times) of $\tau$, Gauss wrote (in modern notation) that $$\lim_{n \rightarrow \infty} \lambda \left(\tau^n \leq x\right) = \frac{\log (1+x)}{\log 2},
\quad x \in I, \label{1.3}$$ where $\lambda$ denotes the Lebesgue measure on $I$. In 1812, Gauss asked Laplace [@Brez] to estimate the [*$n$-th error term*]{} $e_n(x)$ defined by $$e_n(x) := \lambda (\tau^{-n}[0, x]) - \frac{\log (1+x)}{\log 2}, \quad n \geq 1, \ x\in I. \label{1.4}$$ This has been called *Gauss’ Problem*. It received first solution more than a century later, when R.O. Kuzmin [@Kuzmin-1928] showed in 1928 that $e_n(x) = \mathcal{O}(q^{\sqrt{n}})$ as $n \rightarrow \infty$, uniformly in $x$ with some (unspecified) $0 < q < 1$. This has been called the [*Gauss-Kuzmin theorem*]{} or the [*Kuzmin theorem*]{}.
One year later, using a different method, Paul Lévy [@Levy-1929] improved Kuzmin’s result by showing that $\left|e_n(x)\right| \leq q^n$ for $n \in \mathbb{N}_+$, $x \in I$, with $q = 3.5 - 2\sqrt{2} = 0.67157...$. For such historical reasons, the [*Gauss-Kuzmin-Lévy theorem*]{} is regarded as the first basic result in the rich metrical theory of continued fractions. An advantage of the Gauss-Kuzmin-Lévy theorem relative to the Gauss-Kuzmin theorem is the determination of the value of $q$.
To this day the Gauss transformation, on which metrical theory of regular continued fraction is based, has fascinated researchers from various branches of mathematics and science with many applications in computer science, cosmology and chaos theory [@C-1992]. In the last century, mathematicians broke new ground in this area. Apart from the regular continued fraction expansion, very many other continued fraction expansions were studied [@RS-1992; @Schweiger].
By such a development, generalizations of these problems for non-regular continued fractions are also called as the [*Gauss-Kuzmin problem*]{} and the [*Gauss-Kuzmin-Lévy problem*]{} [@IS-2006; @L-2013; @Sebe-2000; @Sebe-2001; @Sebe-2002].
$\theta$-expansions
-------------------
For a fixed $\theta \in (0,1)$, we start with a brief review of continued fraction expansion with respect to $\theta$, analogous to the regular continued fraction expansion which corresponds to the case $\theta=1$.
For $x \in (0,\infty)$ let $$a_0 := \max\{n \geq 0: n\theta \leq x \}.$$ If $x$ equals $a_0 \theta$, we write $$x := [a_0 \theta].$$ If not, define $r_1$ by $$x := a_0 \theta + \frac{1}{r_1}$$ where $0 < 1/r_1 < \theta$. Then $
r_1 > 1/\theta \geq \theta
$ and let $$a_1 := \max \{n \geq 0: n \theta \leq r_1\}.$$ If $r_1 = a_1 \theta$, then we write $$x := [a_0 \theta, a_1 \theta],$$ i.e., $$x = a_0 \theta + \frac{1}{a_1 \theta}.$$ If $a_1 \theta < r_1$, define $r_2$ by $$r_1 := a_1 \theta + \frac{1}{r_2}$$ where $0 < 1/r_2 < \theta$. So, $r_2 > 1/\theta \geq \theta$ and let $$a_2 := \max \{n \geq 0: n\theta \leq r_2\}.$$ In this way, either the process terminates after a finite number of steps or it continues indefinitely. Following standard notation, in the first case we write $$x := [a_0 \theta; a_1 \theta,\ldots, a_n \theta] \label{1.5'}$$ and we call this *the finite continued fraction expansion of* $x$ *with respect to* $\theta$ (*terminating at the* $n$*-stage*). In the second case, we write $$x := [a_0 \theta; a_1 \theta, a_2 \theta, \ldots] \label{1.5''}$$ and we call this *the infinite continued fraction expansion of* $x$ *with respect to* $\theta$.
When $0 < x < \theta$, we have $a_0 = 0$ and instead of writing $$x := [0; a_1 \theta, a_2 \theta, \ldots], \label{1.5'''}$$ we simply write $$x := [a_1 \theta, a_2 \theta, \ldots] \label{1.5''''}$$ which is the same in the usual notation $$x = \frac{1}{\displaystyle a_1\theta
+\frac{1}{\displaystyle a_2\theta
+ \frac{1}{\displaystyle a_3\theta + \ddots} }}. \label{1.5}$$ Such $a_n$’s are also called *incomplete quotients* (or *continued fraction digits*) of $x$ with respect to the expansion in $(\ref{1.5})$.
In general, the $\theta$-expansion of a number $x > 0$ is $$a_0 \theta + [0; a_1 \theta, a_2 \theta, \ldots] := [a_0 \theta; a_1 \theta, a_2 \theta, \ldots] \label{1.6}$$ where $a_0 = \left\lfloor x/ \theta\right\rfloor$.
For $x \in [0, \theta]$, the $\theta$-continued fraction expansion of $x$ in (\[1.5\]) leads to an analogous transformation of Gauss map $\tau$ in (\[1.2\]). A natural question is whether this new transformation admits an absolutely continuous invariant probability like the Gauss measure in the case $\theta = 1$. Until now, the invariant measure was identified only in the particular case $\theta^2 = 1/m$, $m$ a positive integer [@CR-2003].
Motivated by this argument, since the invariant measure is a crucial tool in our approach, in the sequel we will consider only the case $\theta^2 = 1/m$ with $m$ a positive integer. Then $[a_1\theta, a_2\theta, a_3\theta, \ldots]$ is the $\theta$-expansion of any $x \in [0, \theta]$ if and only if the following conditions hold:
1. $a_n \geq m$ for any $m \in \mathbb{N}_+$;
2. in case when $x$ has a finite expansion, i.e., $x = [a_1\theta, a_2\theta, a_3\theta, \ldots, a_n\theta]$, then $a_n \geq m+1$.
This continued fraction is treated as the following dynamical system.
\[def.1.1\] Let $\theta \in (0,1)$ and $m \in \mathbb{N}_+$ such that $\theta^2 = 1/m$.
1. The measure-theoretical dynamical system $([0,\theta],{\cal B}_{[0,\theta]}, T_{\theta})$ is defined as follows: $\mathcal{B}_{[0,\theta]}$ denotes the $\sigma$-algebra of all Borel subsets of $[0,\theta]$, and $T_{\theta}$ is the transformation $$T_{\theta}: [0,\theta] \to [0,\theta];\quad
T_{\theta}(x):=
\left\{
\begin{array}{ll}
{\displaystyle \frac{1}{x} - \theta \left \lfloor \frac{1}{x \theta} \right\rfloor} &
{\displaystyle \mbox{if } x \in (0, \theta],}\\
\\
0 & \mbox{if } x=0.
\end{array}
\right. \label{1.7}$$
2. In addition to (i), we write $([0,\theta], {\cal B}_{[0,\theta]}, \gamma_{\theta}, T_{\theta} )$ as $( [0,\theta],{\cal B}_{[0,\theta]},T_{\theta})$ with the following probability measure $\gamma_{\theta}$ on $( [0,\theta], {\cal B}_{[0,\theta]})$:
$$\gamma_{\theta} (A) :=
\frac{1}{\log \left(1+\theta^{2}\right)}
\int_{A} \frac{\theta dx}{1 + \theta x},
\quad A \in {\mathcal{B}}_{[0,\theta]}. \label{1.8}$$
By using $T_{\theta}$, the sequence $(a_n)_{n \in {\mathbb{N}}_+}$ in (\[1.5\]) is obtained as follows: $$a_n=a_n(x) = a_1\left(T_{\theta}^{n-1}(x)\right), \quad n \in {\mathbb{N}}_+, \label{1.9}$$ with $T_{\theta}^0 (x) = x$ and $$a_1=a_1(x) = \left\{\begin{array}{lll}
\lfloor \frac{1}{x \theta} \rfloor & \hbox{if} & x \neq 0, \\
\infty & \hbox{if} & x = 0.
\end{array} \right. \label{1.10}$$
In this way, $T_{\theta}$ gives the algorithm of $\theta$-expansion.
\[prop.1.2\] Let $([0,\theta],{\cal B}_{[0,\theta]},\gamma_{\theta},T_{\theta})$ be as in Definition \[def.1.1\](ii).
1. $([0,\theta],{\cal B}_{[0,\theta]},\gamma_{\theta},T_{\theta})$ is ergodic.
2. The measure $\gamma_{\theta}$ is invariant under $T_{\theta}$, that is, $\gamma_{\theta} (A) = \gamma_{\theta} (T^{-1}_{\theta}(A))$ for any $A \in {\mathcal{B}}_{[0, \theta]}$.
**Proof.** See Section 8 in [@CR-2003]. $\Box$\
By Proposition \[prop.1.2\](ii), $([0,\theta],{\cal B}_{[0,\theta]},\gamma_{\theta},T_{\theta})$ is a “dynamical system" in the sense of Definition 3.1.3 in [@BG].
Known results and applications
------------------------------
In this subsection we recall known results and their applications for $\theta$-expansions.
### Known results
Let $0 < \theta < 1$. Define the [*$n$-th order convergent*]{} $[a_1\theta, a_2 \theta, \ldots, a_n \theta]$ of $x \in [0, \theta]$ by truncating the $\theta$-expansion in (\[1.5\]). Thus, Chakraborty and Rao proved in [@CR-2003] that $$[a_1 \theta, a_2 \theta, \ldots, a_n \theta] \to x, \quad n\to \infty. \label{1.12}$$
In what follows the stated identities hold for all $n$ in case $x$ has an infinite $\theta$-expansion and they hold for $n \leq k$ in case $x$ has a finite $\theta$-expansion terminating at the $k$-th stage.
To this end, define real functions $p_n(x)$ and $q_n(x)$, for $n \in \mathbb{N}_+$, by $$\begin{aligned}
p_n(x) &:=& a_n(x) \theta p_{n-1}(x) + p_{n-2}(x), \quad \label{1.13} \\
q_n(x) &:=& a_n(x) \theta q_{n-1}(x) + q_{n-2}(x), \quad \label{1.14}\end{aligned}$$ with $p_{-1}(x) := 1$, $p_0(x) := 0$, $q_{-1}(x) := 0$ and $q_{0}(x) := 1$. By induction, we have $$p_{n-1}(x)q_{n}(x) - p_{n}(x)q_{n-1}(x) = (-1)^{n}, \quad n \in \mathbb{N} := \mathbb{N}_+ \cup \{0\}. \label{1.15}$$ By using (\[1.13\]) and (\[1.14\]), we can verify that $$x = \frac{p_n(x) + T^n_{\theta}(x)p_{n-1}(x)}
{q_n(x) + T^n_{\theta}(x)q_{n-1}(x)}, \quad n \geq 1. \label{1.16}$$ By taking $T^n_{\theta}(x)=0$ in (\[1.16\]), we obtain $ [a_1\theta, a_2\theta, \ldots, a_n\theta] = p_n(x)/q_n(x)$. Using (\[1.15\]) and (\[1.16\]) we obtain $$x - \frac{p_n(x)}{q_n(x)} = \frac{(-1)^{n+1} T^n_{\theta}(x)}{q_n(x)(q_n(x)+T^n_{\theta}(x)q_{n-1}(x))}, \quad n \geq 1. \label{1.17}$$ By applying $0 \leq T^n_{\theta} \leq \theta$ to (\[1.17\]), we can verify that $$\frac{1}{q_n(x)(q_{n+1}(x)+\theta q_n(x))} \leq \left|x - \frac{p_n(x)}{q_n(x)}\right| \leq \frac{1}{q_n(x)q_{n+1}(x)}. \label{1.18}$$ From (\[1.14\]), we have that $q_n(x) \geq \theta$, $n \in \mathbb{N}_+$. Further, also from (\[1.14\]) and by induction we have that $$q_n(x) \geq \left\lfloor \frac{n}{2}\right\rfloor \theta^2. \label{1.19}$$ Finally, (\[1.12\]) follows from (\[1.18\]) and (\[1.19\]).
### Application to ergodic theory
Similarly to classical results on regular continued fractions, using the ergodicity of $T_{\theta}$ and Birkhoff’s ergodic theorem [@DK-2002], a number of results were obtained. For $q_n$ in (\[1.14\]), its asymptotic growth rate $\beta$ is defined as $$\beta = \lim_{n \rightarrow \infty} \frac{1}{n} \log q_n. \label{1.20}$$ This is a Lévy result and Chakraborty and Rao [@CR-2003] obtained that $\beta$ is a finite number $$\beta = \frac{1}{1 + \theta^2} \int_{0}^{\theta} \frac{\theta \log x}{1 + x \theta}\mathrm{d}x. \label{beta}$$ They also give a Khintchin result, i.e., the asymptotic value of the arithmetic mean of $a_1, a_2, \ldots, a_n$ where $a_1$ and $a_n$ are given in (\[1.10\]) and (\[1.9\]). We have $$\lim_{n \rightarrow \infty} \frac{a_1 + a_2 + \ldots + a_n}{n} = \infty. \label{1.21}$$
It should be stressed that the ergodic theorem does not yield any information on the convergence rate in the Gauss problem that amounts to the asymptotic behavior of $\mu(T_{\theta}^{-n})$ as $n \rightarrow \infty $, where $\mu$ is an arbitrary probability measure on ${\cal B}_{[0,\theta]}$.
It is only very recently that there has been any investigation of the metrical properties of the $\theta$-expansions. Thus, the results obtained in this paper allow to a solution of a Gauss-Kuzmin type problem. We may emphasize that, to our knowledge, Theorem \[G-K-L\] is the first Gauss-Kuzmin result proved for $\theta$-expansions. Our solution presented here is based on the ergodic behavior of a certain random system with complete connections.
The paper is organized as follows. In Section 2, we show the probability structure of $(a_n)_{n \in {\mathbb{N}}_+}$ under the Lebesgue measure by using the Brodén-Borel-Lévy formula. In Section 3, we consider the so-called natural extension of $([0, \theta],{\cal B}_{[0, \theta]},\gamma_{\theta},T_{[0, \theta]})$ [@Nakada]. In Section 4, we derive its Perron-Frobenius operator under different probability measures on $([0, \theta],{\cal B}_{[0, \theta]})$. Especially, we derive the asymptotic behavior for the Perron-Frobenius operator of $(([0, \theta],{\cal B}_{[0, \theta]},\gamma_{\theta},T_{[0, \theta]})$. In Section 5, we study the ergodicity of the associated random system with complete connections (RSCC for short). In Section 6, we solve a variant of Gauss-Kuzmin problem for $\theta$-expansions. By using the ergodic behavior of the RSCC introduced in Section 5, we determine the limit of the sequence $(\,\mu (T_{\theta}^n < x)\,)_{n\geq 1}$ of distributions as $n \rightarrow \infty$.
Prerequisites
=============
Roughly speaking, the metrical theory of continued fraction expansions is about the sequence $(a_n)_{n \in {\mathbb{N}}_+}$ of incomplete quotients and related sequences [@IK-2002]. As remarked earlier in the introduction we will adopt a similar strategy to that used for regular continued fractions. We begin with a Brodén-Borel-Lévy formula for $\theta$-expansions. Then some consequences of it to be used in the sequel are also derived.
In this section let us fix $0 < \theta < 1$, $\theta^2 = 1/m$, $m \in \mathbb{N}_+$.
For $x \in [0, \theta]$ consider $a_n=a_n(x)$, $n \in \mathbb{N}_+$, as in (\[1.9\]) and (\[1.10\]). Putting $\mathbb{N}_m := \{m, m+1,\ldots\}$, $m \in \mathbb{N}_+$, the incomplete quotients $a_n$, $n \in \mathbb{N}_+$, take positive integer values in $\mathbb{N}_m$.
For any $n \in \mathbb{N}_+$ and $i^{(n)}=(i_1, \ldots, i_n) \in \mathbb{N}_m^n$, define the [*fundamental interval associated with*]{} $i^{(n)}$ by $$I (i^{(n)}) = \{x \in [0, \theta]: a_k(x) = i_k \mbox{ for } k=1, \ldots, n \}, \label{2.01}$$ where $I (i^{(0)}) = [0, \theta]$. For example, for any $i \in \mathbb{N}_m$ we have $$I\left(i\right) = \left\{x \in [0, \theta]: a_1(x) = i \right\} = \left( \frac{1}{(i+1)\theta}, \frac{1}{i \theta} \right). \label{2.02}$$
We will write $I(a_1, \ldots, a_n) = I\left(a^{(n)}\right)$, $n \in \mathbb{N}_+$. If $n \geq 1$ and $i_n \in \mathbb{N}_m$, then we have $$I(a_1, \ldots, a_n) = I\left(i^{(n)}\right). \label{2.03}$$
From the definition of $T_{\theta}$ and (\[1.16\]), we have $$I(a^{(n)}) = (u(a^{(n)}), v(a^{(n)})), \label{2.04}$$ where $u(a^{(n)})$ and $v(a^{(n)})$ are defined as $$u\left(a^{(n)}\right) := \left\{
\begin{array}{lll}
\displaystyle\frac{p_n+ \theta p_{n-1}}{q_n+ \theta q_{n-1}} & \quad \mbox{if $n$ is odd}, \\
\\
\displaystyle\frac{p_n}{q_n} & \quad \mbox{if $n$ is even}, \\
\end{array}
\right. \label{2.05}$$ and $$v\left(a^{(n)}\right) := \left\{
\begin{array}{lll}
\displaystyle\frac{p_n}{q_n} & \quad \mbox{if $n$ is odd}, \\
\\
\displaystyle\frac{p_n+ \theta p_{n-1}}{q_n+\theta q_{n-1}} & \quad \mbox{if $n$ is even},
\end{array}
\right. \label{2.06}$$ where $p_n:=p_n(x)$ and $q_n:=q_n(x)$ are defined in (\[1.13\]) and (\[1.14\]), respectively.
Let $\lambda_{\theta}$ denote a Lebesgue measure on $[0, \theta]$. Using (\[1.15\]) we get $$\begin{aligned}
\lambda_{\theta}\left(I\left(a^{(n)}\right)\right) &=& \frac{1}{\theta} \left| \frac{p_n}{q_n} - \frac{p_n+ \theta p_{n-1}}{q_n+\theta q_{n-1}} \right| \nonumber \\
&=& \frac{1}{q_n (q_n + \theta q_{n-1})}. \label{2.07}\end{aligned}$$
To derive the so-called Brodén-Borel-Lévy formula [@IG-2009; @IK-2002] for $\theta$-expansions, let us define $(s_n)_{n \in {\mathbb{N}}}$ by $$s_0 := 0,\quad
s_n := q_{n-1}/q_{n}, \, \quad n \geq 1. \label{2.14}$$ From (\[1.14\]), $s_n = 1/(a_n \theta + s_{n-1})$ for $n \geq 1$. Hence $$s_n = \frac{1}{\displaystyle a_n\theta
+\frac{1}{\displaystyle a_{n-1}\theta
+ \ddots + \frac{1}{a_1 \theta}}} := [a_n\theta, a_{n-1}\theta, \ldots, a_1\theta], \label{2.15}$$ for $n \geq 1$.
\[Brodén-Borel-Lévy-type formula\] \[prop.BBL\] Let $\lambda_{\theta}$ denote the Lebesgue measure on $[0, \theta]$. For any $n \in \mathbb{N}_+$, the conditional probability $\lambda_{\theta} (T^n_{\theta} < x |a_1,\ldots, a_n )$ is given as follows: $$\lambda_{\theta} (T^n_{\theta} < x |a_1,\ldots, a_n )
= \frac{(s_n \theta + 1)x}{\theta(s_n x+1)}, \quad x \in [0, \theta], \label{2.16}$$ where $s_n$ is defined in $(\ref{2.14})$ and $a_1, \ldots, a_n$ are as in $(\ref{1.9})$ and $(\ref{1.10})$.
**Proof.** By definition, we have $$\lambda_{\theta} (T^n_{\theta} < x |a_1,\ldots, a_n ) = \frac{\lambda_{\theta}\left(\left(T^n_{\theta} < x\right) \cap I(a_1,\ldots, a_n) \right)}{\lambda_{\theta}\left(I(a_1,\ldots, a_n)\right)} \label{2.17}$$ for any $n \in \mathbb{N}_+$ and $x \in [0, \theta]$. Using (\[1.16\]) and (\[2.04\]) we get $$\begin{aligned}
\lambda_{\theta}\left(\left(T^n_{\theta} < x \right) \cap I(a_1,\ldots, a_n)\right) &=& \frac{1}{\theta}\left|\frac{p_n}{q_n} - \frac{p_n+xp_{n-1}}{q_n+xq_{n-1}}\right| \nonumber \\
\nonumber \\
&=& \frac{x}{ q_n (q_n + x q_{n-1})\theta}. \nonumber\end{aligned}$$ From this and (\[2.07\]) it follows that $$\begin{aligned}
\lambda_{\theta}\left(T^n_{\theta} < x |a_1, \ldots, a_n \right) &=& \frac{\lambda_{\theta}\left(\left(T^n_{\theta} < x\right) \cap I(a_1,\ldots, a_n) \right)}{\lambda_{\theta}\left(I(a_1,\ldots, a_n)\right)} \nonumber \\
\nonumber \\
&=& \frac{x\left(q_n + \theta q_{n-1}\right)}{(q_n +x q_{n-1})\theta}= \frac{x(s_n \theta + 1)}{(s_n x+1)\theta}, \label{2.18}\end{aligned}$$ for any $n \in \mathbb{N}_+$ and $x \in [0, \theta]$. $\Box$
The Brodén-Borel-Lévy formula allows us to determine the probability structure of incomplete quotients $(a_n)_{n \in {\mathbb{N}}_+}$ under $\lambda_{\theta}$.
\[prop.2.3\] For any $i \in \mathbb{N}_m$ and $n \in \mathbb{N}_+$, we have $$\lambda_{\theta}(a_1 = i) = \frac{m}{i(i+1)}, \quad
\lambda_{\theta}\left(a_{n+1}=i |a_1,\ldots, a_n \right) = P_i(s_n), \label{2.19}$$ where $(s_n)_{n \in {\mathbb{N}}_+}$ is defined in (\[2.14\]), and $$P_i(x) := \frac{x \theta + 1}{(x + i\theta)(x + (i+1)\theta )}. \label{2.20}$$
**Proof.** From (\[2.02\]), the case $\lambda_{\theta}(a_1=i)$ holds. For $n \in \mathbb{N}_+$ and $x \in [0, \theta]$, we have $ T_{\theta}^n(x) = [a_{n+1} \theta, a_{n+2} \theta, \ldots]$. Using (\[2.16\]) we obtain $$\begin{aligned}
\lambda_{\theta}(\,a_{n+1}=i \,|\,a_1,\ldots, a_n\, )
& = & \lambda_{\theta}\left(\,T^n_{\theta} \in \left(\frac{1}{(i+1)\theta}, \frac{1}{i\theta}\right]\,
| \,a_1,\ldots, a_n \,\right). \nonumber \\
%
&=& \frac{(s_n \theta + 1)\frac{1}{i\theta}}{\theta(s_n \frac{1}{i\theta}+1)}
- \frac{(s_n \theta + 1)\frac{1}{(i+1)\theta}}{\theta(s_n \frac{1}{(i+1)\theta}+1)} \nonumber \\
\nonumber\\
&=& P_i(s_n). \label{2.21}\end{aligned}$$ $\Box$\
1. It is easy to check that $$\sum_{i=m}^{\infty}P_i(x)=1\quad \mbox{ for any } x \in [0, \theta]. \label{2.9}$$
2. Proposition \[prop.2.3\] is the starting point of an approach to the metrical theory of $\theta$-expansions via dependence with complete connections (see [@IG-2009], Section 5.2)
The sequence $(s_n)_{n \in {\mathbb{N}}_+}$ with $s_0=0$ is an $[0, \theta]$-Markov chain on $([0,\theta],{\cal B}_{[0,\theta]}, \lambda_{\theta})$ with the following transition mechanism: from state $s$ the possible transitions are to any state $1/(s + i \theta)$ with corresponding transition probability $P_i(s)$, $i \in \mathbb{N}_m$.
An infinite-order-chain representation
======================================
In this section we introduce the natural extension $\overline{T_{\theta}}$ of $T_{\theta}$ in (\[1.7\]) and define extended random variables according to Chap.1.3.3 of [@IK-2002]. Then we give an infinite-order-chain representation of the sequence of the incomplete quotients for $\theta$-expansions.
Natural extension
-----------------
Let $([0,\theta],{\cal B}_{[0,\theta]}, T_{\theta})$ be as in Definition 1.1(i). Let be $[0, \theta]^{2} := [0, \theta] \times [0, \theta]$ and the square space $([0, \theta]^2,{\cal B}^2_{[0, \theta]}) := ([0, \theta],{\cal B}_{[0, \theta]})\times ([0, \theta],{\cal B}_{[0, \theta]})$.
The natural extension [@Nakada] of $([0, \theta],{\cal B}_{[0, \theta]},T_{\theta})$ is $([0, \theta]^2,{\cal B}^2_{[0, \theta]},\overline{T_{\theta}})$ where the transformation $\overline{T_{\theta}}$ of $([0, \theta]^2,{\cal B}^2_{[0, \theta]})$ is defined by $$\overline{T_{\theta}}:[0, \theta]^2\to [0, \theta]^2; \quad
\overline{T_{\theta}}(x,y) := \left(T_{\theta}(x), \, \frac{1}{a_1(x)\theta + y}\right), \quad (x, y) \in [0, \theta]^2. \label{3.3}$$
This is a one-to-one transformation of $[0, \theta]^2$ with the inverse $$(\overline{T_{\theta}})^{-1}(x, y)
=
\left(\frac{1}{a_1(y)\theta + x}, \,
T_{\theta}(y)\right), \quad \,(x, y) \in [0, \theta]^{2}\,. \label{3.4}$$ Iterations of (\[3.3\]) and (\[3.4\]) are given as follows for each $n \geq 2$: $$\left(\overline{T_{\theta}}\right)^n(x, y) =
(\,T_{\theta}^n(x), \,[a_n(x) \theta, a_{n-1}(x) \theta, \ldots,
a_2(x) \theta,\, a_1(x) \theta + y ] \,), \label{3.5} \\$$ $$\left(\overline{T_{\theta}}\right)^{-n}(x, y) =
(\,[a_n(y)\theta, a_{n-1}(y)\theta, \ldots, a_2(y)\theta,
\,a_1(y)\theta + x ],\, T^{n}_{\theta}(y) \,).
\label{3.6}$$ For $\gamma_{\theta}$ in (\[1.8\]), define its [*extended measure*]{} $\overline{\gamma_{\theta}}$ on $([0, \theta]^2,{\mathcal{B}}^2_{[0, \theta]})$ as $$\overline{\gamma_{\theta}} (B) := \frac{1}{\log(1 + \theta^2)} \int\!\!\!\int_{B}
\frac{\mathrm{d}x\mathrm{d}y}{(1 + xy)^2},
\quad B \in {\mathcal{B}}^2_{[0, \theta]}. \label{3.7}$$ Then $$\overline{\gamma_{\theta}}(A \times [0, \theta])
= \overline{\gamma_{\theta}}([0, \theta] \times A) = \gamma_{\theta}(A) \label{3.7'}$$ for any $A \in {\mathcal{B}}_{[0, \theta]}$.
\[prop.3.2\] The measure $\overline{\gamma_{\theta}}$ is preserved by $\overline{T_{\theta}}$.
**Proof.** We show that $\overline{\gamma_{\theta}} ((\overline{T_{\theta}})^{-1}(B))
= \overline{\gamma_{\theta}} (B)$ for any $B \in {\mathcal{B}}^2_{[0, \theta]}$. Since $\overline{T_{\theta}}$ is invertible on $[0, \theta]^2$, the last equation is equivalent to $$\overline{\gamma_{\theta}} (\overline{T_{\theta}}(B)) = \overline{\gamma_{\theta}} (B)\quad
\mbox{for any } B \in {\mathcal{B}}^2_{[0, \theta]}. \label{3.51}$$ Recall fundamental interval in (\[2.01\]). Since the collection of Cartesian products $I\left(i^{(n)}\right) \times I\left(j^{(t)}\right)$, $i^{(n)} \in \mathbb{N}^n_m$, $j^{(t)} \in
\mathbb{N}^t_m$, $n, t \in \mathbb{N}$, generates the $\sigma$-algebra ${\mathcal{B}}^2_{[0, \theta]}$, it is enough to show that $$\overline{\gamma_{\theta}} \left(\overline{T_{\theta}}\left(I\left(i^{(n)}\right) \times I\left(j^{(t)}\right)\right)\right) =
\overline{\gamma_{\theta}} \left(I\left(i^{(n)}\right) \times I\left(j^{(t)}\right)\right) \label{3.8'}$$ for any $i^{(n)} \in \mathbb{N}^n_m$, $j^{(t)} \in \mathbb{N}^t_m$, $n, t \in \mathbb{N}$. It follows from (\[3.7’\]) and Proposition \[prop.1.2\](ii) that (\[3.8’\]) holds for $n = 0$ and $t \in \mathbb{N}$. If $n \in \mathbb{N}_+$, then it is easy to see that $$\overline{T_{\theta}}\left(I\left(i^{(n)}\right) \times I\left(j^{(t)}\right)\right) =
I(i_2, \ldots ,i_n) \times I(i_1, j_1, \ldots ,j_t), \quad t \in \mathbb{N}_+,$$ where $I(i_2, \ldots, i_n)$ equals $[0, \theta]$ for $n = 1$. Also, if $I\left(i^{(n)}\right) = (a, b) \subset [0, \theta]$ and $I\left(j^{(t)}\right) = (c,d) \subset [0, \theta]$, then $$I(i_2, \ldots, i_n) = \left(\frac{1}{b} - i_1 \theta, \frac{1}{a} - i_1 \theta\right)$$ and $$I(i_1, j_1, \ldots, j_t) = \left(\frac{1}{d+i_1 \theta}, \frac{1}{c+i_1\theta}\right). \nonumber$$ A simple computation yields $$\overline{\gamma_{\theta}} \left((a, b) \times (c,d)\right) = \frac{1}{\log(1+\theta^2)} \log \frac{(ac+1)(bd+1)}{(ad+1)(bc+1)}
%$$ and then $$\begin{aligned}
\overline{\gamma_{\theta}} \left(\left(\frac{1}{b} - i_1 \theta, \frac{1}{a} - i_1 \theta\right) \times \left(\frac{1}{d+i_1 \theta}, \frac{1}{c+i_1\theta}\right)\right) \qquad \qquad \qquad \qquad \qquad \nonumber \\
= \frac{1}{\log(1+\theta^2)} \log \frac{((1/b- i_1 \theta)/(d+i_1 \theta)+1)((1/a -i_1 \theta)/(c+i_1\theta)+1)}
{((1/b-i_1 \theta)/(c+i_1\theta)+1)((1/a-i_1\theta)/(d+i_1\theta)+1)} \nonumber \\
= \frac{1}{\log(1+\theta^2)} \log \frac{(ac+1)(bd+1)}{(ad+1)(bc+1)}, \qquad \qquad \qquad \qquad \qquad \qquad \qquad \qquad \end{aligned}$$ that is, (\[3.8’\]) holds. $\Box$
Extended random variables
-------------------------
With respect to $\overline{T_{\theta}}$ in (\[3.3\]), define [*extended incomplete quotients*]{} $\overline{a}_l(x,y)$, $l \in \mathbb{Z}:=\{\ldots, -2, -1, 0, 1, 2, \ldots\}$, $(x, y) \in [0, \theta]^2$ by $$\overline{a}_{l+1}(x, y)
:= \overline{a}_1((\overline{T_{\theta}})^{l} (x, y) \,),
\quad l \in \mathbb{Z}, \label{3.8}$$ with $$\overline{a}_1 (x, y) = a_1(x), \quad (x, y) \in [0, \theta]^2.$$
1. Since $\overline{T_{\theta}}$ is invertible it follows that $\overline{a}_{l}(x, y)$ in (\[3.8\]) is also well-defined for $l \leq 0$. By (\[3.5\]) and (\[3.6\]), we have $$\overline{a}_n(x, y) = a_n(x), \quad
\overline{a}_0(x, y) = a_1(y), \quad
\overline{a}_{-n}(x, y) = a_{n+1}(y) \label{3.9}$$ for any $n \in \mathbb{N}_+$ and $(x, y) \in [0, \theta]^2$.
2. From Proposition \[prop.3.2\], the doubly infinite sequence $(\overline{a}_l(x,y))_{l \in \mathbb{Z}}$ is strictly stationary (i.e., its distribution is invariant under a shift of the indices) under $\overline{\gamma}_{\theta}$.
The following theorem will play a key role in the sequel.
\[th.3.4\] For any $x \in [0, \theta]$ we have $$\overline{\gamma_{\theta}} ( [0, x] \times [0, \theta] \,|
\,\overline{a}_0, \overline{a}_{-1}, \ldots )
=\frac{(a \theta +1)x}{(ax + 1)\theta} \quad \overline{\gamma_{\theta}} \mbox{-}\mathrm{a.s.}, \label{3.10}$$ where $a:= [\overline{a}_0 \theta, \overline{a}_{-1} \theta, \ldots]$ (= the $\theta$-expansion with incomplete quotients $\overline{a}_0$, $\overline{a}_1$, $\ldots$).
**Proof.** Let $I_{n}$ denote the fundamental interval $I(\overline{a}_0, \overline{a}_{-1}, \ldots, \overline{a}_{-n})$ for $n \in \mathbb{N}$. We have $$\overline{\gamma_{\theta}} ( [0, x] \times [0, \theta] \left. \right| \overline{a}_0, \overline{a}_{-1}, \ldots ) = \lim_{n \rightarrow \infty} \overline{\gamma_{\theta}} ( [0, x] \times [0, \theta] \left. \right| \overline{a}_0, \ldots, \overline{a}_{-n} ) \quad \overline{\gamma}_{\theta} \mbox{-a.s.} \label{3.11}$$ and $$\begin{aligned}
\overline{\gamma_{\theta}} ( [0, x] \times [0, \theta] \left. \right| \overline{a}_0, \ldots, \overline{a}_{-n} )
&=&
\displaystyle{\frac{\overline{\gamma_{\theta}} ([0, x] \times I_{n})}{\overline{\gamma_{\theta}} ([0, \theta] \times I_{n})}} \nonumber \\
\nonumber \\
&=& \displaystyle{\frac{1}{\gamma_{\theta}(I_{n})}\frac{1}{\log(1+\theta^2)}\int_{I_{n}}\mathrm{d}y\displaystyle\int^x_0{\frac{\mathrm{d}u}{(uy+1)^2}}} \nonumber \\
\nonumber \\
&=& \displaystyle{\frac{1}{\gamma_{\theta}(I_{n})} \frac{1}{\theta} \int_{I_{n}} \frac{x(1+y \theta)}{1+xy}\, \mathrm{d}\gamma_{\theta}(y)} \nonumber \\
\nonumber \\
&=& \frac{x(y_n \theta +1)}{(xy_n+1)\theta}, \label{3.12}\end{aligned}$$ for some $y_n \in I_{n}$. Since $$\lim_{n \rightarrow \infty} y_n =[\overline{a}_0 \theta, \overline{a}_{-1} \theta, \ldots] = a, \label{3.13}$$ the proof is completed. $\Box$
The probability structure of $(\overline{a}_l)_{l \in \mathbb{Z}}$ under $\overline{\gamma_{\theta}}$ is given as follows.
\[cor.3.5\] For any $i \in \mathbb{N}_m$, we have $$\overline{\gamma_{\theta}} (\left.\overline{a}_1 = i\right| \overline{a}_0, \overline{a}_{-1}, \ldots) = P_{i}(a) \quad \overline{\gamma_{\theta}} \mbox{-}\mathrm{a.s.}, \label{3.14}$$ where $a = [\overline{a}_0 \theta, \overline{a}_{-1} \theta, \ldots]$ and the functions $P_{i}$, $i \in \mathbb{N}_m$, are defined by $(\ref{2.20})$.
**Proof.** Let $I_{n}$ be as in the proof of Theorem \[th.3.4\]. We have $$\overline{\gamma_{\theta}} (\left.\overline{a}_1 = i\,\right| \,
\overline{a}_0, \overline{a}_{-1}, \ldots) = \lim_{n \rightarrow \infty}
\overline{\gamma_{\theta}} (\left.\overline{a}_1 = i\,\right| \,I_{n}). \label{3.15}$$ We have $$(\overline{a}_1 = i) = \left(\frac{1}{(i+1)\theta}, \frac{1}{i \theta}\right] \times [0, \theta], \quad i \in \mathbb{N}_m. \label{3.16}$$ Now $$\begin{aligned}
\overline{\gamma_{\theta}} \left( \left. \left(\frac{1}{(i+1)\theta}, \frac{1}{i \theta}\right] \times [0, \theta] \right| I_{n}\right) &=&
\frac{\overline{\gamma_{\theta}} \left(\left(\frac{1}{(i+1)\theta}, \frac{1}{i \theta}\right] \times I_{n}\right) }
{\overline{\gamma_{\theta}} ([0, \theta] \times I_{n})} \nonumber \\
\nonumber \\
& = & \frac{1}{\gamma_{\theta} (I_{n})} \int_{I_{n}} P_{i}(y)\, \mathrm{d}\gamma_{\theta}(y) \nonumber \\
\nonumber \\
& = & P_{i}(y_n), \label{3.17}\end{aligned}$$ for some $y_n \in I_{n}$. From (\[3.13\]), the proof is completed. $\Box$
\[rem.3.6\] The strict stationarity of $\left(\overline{a}_l
\right)_{l \in \mathbb{Z}}$, under $\overline{\gamma_{\theta}}$ implies that $$\overline{\gamma_{\theta}}
(\left.\overline{a}_{l+1} = i\, \right|\, \overline{a}_l,
\overline{a}_{l-1}, \ldots)
= P_{i}(a) \quad \overline{\gamma}_{\theta}
\mbox{-}\mathrm{a.s.} \label{3.18}$$ for any $i \in \mathbb{N}_m$ and $l \in \mathbb{Z}$, where $a = [\overline{a}_l \theta, \overline{a}_{l-1} \theta, \ldots]$. The last equation emphasizes that $\left(\overline{a}_l\right)_{l \in \mathbb{Z}}$ is an infinite-order-chain in the theory of dependence with complete connections (see [@IG-2009], Section 5.5).
Define extended random variables $\left(\overline{s}_l\right)_{l \in \mathbb{Z}}$ as $\overline{s}_l := [\overline{a}_l \theta, \overline{a}_{l-1} \theta, \ldots]$, $l \in \mathbb{Z}$. Clearly, $\overline{s}_l = \overline{s}_{0} \circ (\overline{T_{\theta}})^l$, $l \in \mathbb{Z}$. It follows from Proposition \[prop.3.2\] and Corollary \[cor.3.5\] that $\left(\overline{s}_l\right)_{l \in \mathbb{Z}}$ is a strictly stationary $[0,\theta]$-valued Markov process on $([0, \theta]^2,{\mathcal{B}}^2_{[0, \theta]}, \overline{\gamma_{\theta}})$ with the following transition mechanism: from state $\overline{s} \in [0,\theta]$ the possible transitions are to any state $1/(\overline{s} + i \theta)$ with corresponding transition probability $P_i(\overline{s})$, $i \in \mathbb{N}_m$. Clearly, for any $l \in \mathbb{Z}$ we have $$\overline{\gamma_{\theta}}(\overline{s}_l < x ) = \overline{\gamma_{\theta}}( \overline{s}_0 < x)
= \overline{\gamma_{\theta}}([0,\theta] \times [0,x)) = \gamma_{\theta}([0,x)), \quad x \in [0, \theta].$$ Motivated by Theorem \[th.3.4\], we shall consider the one-parameter family $\{\gamma_{\theta, a}: a \in [0, \theta]\}$ of (conditional) probability measures on $([0, \theta],{\mathcal{B}}_{[0, \theta]})$ defined by their distribution functions $$\gamma_{\theta,a} ([0, x]) := \frac{(a \theta +1)x}{(ax + 1)\theta},
\quad
x, a \in [0, \theta]. \label{3.19}$$ Note that $\gamma_{\theta,0} = \lambda_{\theta}$.
For any $a \in [0, \theta]$ put $$s_{0,a} := a,\quad
s_{n,a} := \frac{1}{a_n \theta + s_{n-1,a}}, \quad n \in \mathbb{N}_+. \label{3.20}$$
It follows from the properties just described of the process $(\overline{s}_l)_{l \in \mathbb{Z}}$ that the sequence $(s_{n,a})_{n \in {\mathbb{N}}_+}$ is an $[0, \theta]$-valued Markov chain on $([0, \theta],{\cal B}_{[0,\theta]}, \gamma_{\theta,a})$ which starts at $s_{0,a} := a$ and has the following transition mechanism: from state $s \in [0, \theta]$ the possible transitions are to any state $1/(s+i\theta)$ with corresponding transition probability $P_i(s)$, $i \in \mathbb{N}_m$.
An operatorial treatment
========================
Let $([0, \theta],{\cal B}_{[0, \theta]},\gamma_{\theta}, T_{\theta})$ be as in Definition 1.1(ii). The Gauss-Kuzmin problem for the transformation $T_{\theta}$ can be approached in terms of the associated Perron-Frobenius operator.
Let $\mu$ be a probability measure on $([0, \theta], {\mathcal{B}}_{[0, \theta]})$ such that $\mu((T_{\theta})^{-1}(A)) = 0$ whenever $\mu(A) = 0$ for any $A \in {\mathcal{B}}_{[0, \theta]}$. For example, this condition is satisfied if $T_{\theta}$ is $\mu$-preserving, that is, $\mu (T_{\theta})^{-1} = \mu$. Let $$L^1_{\mu}:=\{f: [0, \theta] \rightarrow \mathbb{C} : \int^{\theta}_0 |f |\mathrm{d}\mu < \infty \}.$$ The [*Perron-Frobenius operator*]{} of $T_{\theta}$ under $\mu$ is defined as the bounded linear operator $U_{\mu}$ which takes the Banach space $L^1_{\mu}$ into itself and satisfies the equation $$\int_{A}U_{\mu}f \,\mathrm{d}\mu = \int_{(T_{\theta})^{-1}(A)}f\, \mathrm{d}\mu \quad
\mbox{ for all }
A \in {\mathcal{B}}_{[0, \theta]},\, f\in L^1_{\mu}. \label{4.1}$$
\[prop.4.1.\]
1. The Perron-Frobenius operator $U:=U_{\gamma_{\theta}}$ of $T_{\theta}$ under the invariant probability measure $\gamma_{\theta}$ is given a.e. in $[0, \theta]$ by the equation $$Uf(x) = \sum_{i \geq m}P_{i}(x)\,f(u_{i}(x)), \quad m \in \mathbb{N}_+, \,
f \in L^1_{\gamma_{\theta}}, \label{4.2}$$ where $P_{i}$, $i \geq m$, is as in (\[2.20\]) and $u_i$, $i \geq m$, is defined by $$u_i : [0, \theta] \rightarrow [0, \theta]; \quad u_i(x) := \frac{1}{x + i \theta}. \label{4.3}$$
2. Let $\mu$ be a probability measure on $([0, \theta],{\mathcal{B}}_{[0, \theta]})$ such that $\mu$ is absolutely continuous with respect to the Lebesgue measure $\lambda_{\theta}$ and let $h := d\mu / d \lambda_{\theta}$ a.e. in $[0, \theta]$. For any $n \in \mathbb{N}$ and $A \in {\mathcal{B}}_{[0, \theta]}$, we have $$\mu \left((T_{\theta})^{-n}(A)\right)
= \int_{A} U^nf(x) \mathrm{d} \gamma_{\theta}(x), \label{4.4}$$ where $f(x):= (\log(1+\theta^2)) \frac{x\theta+1}{\theta}h(x)$, $x \in [0, \theta]$.
**Proof.** (i) Let $T_{\theta,i}$ denote the restriction of $T_{\theta}$ to the subinterval $I(i) := \left(\frac{1}{(i+1)\theta}, \frac{1}{i \theta}\right]$, $i \geq m$, that is, $$T_{\theta,i}(x) = \frac{1}{x} - i \theta, \quad x \in I(i). \label{4.5}$$ Let $C(A):=(T_{\theta})^{-1}(A)$ and $C_{i}(A):=(T_{\theta,i})^{-1}(A)$ for any $A \in {\mathcal B}_{[0, \theta]}$. Since $C(A)=\bigcup_{i}C_i(A)$ and $C_i\cap C_j$ is a null set when $i \ne j$, we have $$\int_{C(A)} f \,\mathrm{d} \gamma_{\theta}
= \sum_{i \geq m} \int_{C_i(A)}f\, \mathrm{d} \gamma_{\theta},
\quad
f \in L^1_{\gamma_{\theta}},\,A \in {\mathcal{B}}_{[0, \theta]}.
\label{4.6}$$ For any $i \geq m$, by the change of variable $x = (T_{\theta,i})^{-1}(y) =u_{i}(y)$, we successively obtain $$\begin{aligned}
\int_{C_i(A)}f(x) \,\mathrm{d}\gamma_{\theta}(x) &=& \frac{\theta}{\log(1+\theta^2)} \int_{C_i(A)} \frac{f(x)}{1+x\theta}\,\mathrm{d}x \nonumber \\
\nonumber \\
&=& \frac{1}{\log(1+\theta^2)} \int_{A} \frac{f\left(u_{i}(y)\right)}{1+u_{i}(y) \theta} \frac{\theta \mathrm{d}y}{(y+i \theta)^2} \nonumber \\
\nonumber \\
&=& \int_{A} P_{i}(y)\, f\left(u_{i}(y)\right)\,\mathrm{d}\gamma_{\theta}(y).
\label{4.7}\end{aligned}$$ Now, (\[4.2\]) follows from (\[4.6\]) and (\[4.7\]).
\(ii) We will use mathematical induction. For $n=0$, the equation (\[4.5\]) holds by definitions of $f$ and $h$. Assume that (\[4.5\]) holds for some $n \in \mathbb{N}$. Then $$\begin{aligned}
\mu ((T_{\theta})^{-(n+1)}(A)) &=& \mu ((T_{\theta})^{-n}((T_{\theta})^{-1}(A))) \nonumber \\
\nonumber \\
&=& \int_{C(A)} U^n f(x) \,\mathrm{d} \gamma_{\theta}(x). \label{4.9}\end{aligned}$$ By the very definition of the Perron-Frobenius operator $U$ we have $$\int_{C(A)} U^n f(x) \,\mathrm{d}\gamma_{\theta}(x) = \int_{A} U^{n+1} f(x) \,\mathrm{d}\gamma_{\theta}(x). \label{4.10}$$ Therefore, $$\mu \left((T_{\theta})^{-(n+1)}(A)\right) = \int_{A} U^{n+1} f(x) \mathrm{d}\gamma_{\theta}(x) \label{4.11}$$ which ends the proof.
$\Box$
Let $B([0, \theta])$ denote the collection of all bounded measurable functions $f:[0, \theta] \rightarrow \mathbb{C}$. A different interpretation is available for the operator $U$ restricted to $B([0, \theta])$, which is a Banach space under the supremum norm.
\[prop.4.2\] The operator $U : B([0, \theta]) \rightarrow B([0, \theta])$ is the transition operator of both the Markov chain $(s_{n,a})_{n \in \mathbb{N}_+}$ on $([0, \theta], {\mathcal{B}}_{[0, \theta]}, \gamma_{\theta,a})$, for any $a \in [0, \theta]$, and the Markov chain $(\overline{s}_{l})_{l \in \mathbb{Z}}$ on $([0, \theta]^2, {\mathcal{B}}^2_{[0, \theta]}, \overline{\gamma_{\theta}})$.
**Proof.** The transition operator of $(s_{n,a})_{n \in \mathbb{N}_+}$ takes $f \in B([0, \theta])$ to the function defined by $$E_a\left( \left. f(s_{n+1,a})\right| s_{n,a} = s \right) = \sum_{i \geq m}P_{i}(s)f(u_{i}(s)) = U f(s) \quad \mbox{for any } s \in [0, \theta], \label{4.12}$$ where $E_a$ stands for the mean-value operator with respect to the probability measure $\gamma_{\theta,a}$, whatever $a \in [0, \theta]$.
$\Box$
A similar reasoning is valid for the case of the Markov chain $(\overline{s}_l)_{l \in \mathbb{Z}}$.
\[rem.4.3\] In hypothesis of Proposition \[prop.4.1.\](ii) it follows that $$\mu(T_{\theta}^{-n}(A)) - \gamma_{\theta}(A) = \int_{A}(U^{n}f(x)-1)\mathrm{d}\gamma_{\theta}(x),$$ for any $n \in \mathbb{N}$ and $A \in {\mathcal{B}}_{[0, \theta]}$, where $f(x):= (\log(1+\theta^2))\frac{x\theta+1}{\theta}h(x)$, $x \in [0, \theta]$. The last equation shows that the asymptotic behavior of $\mu(T_{\theta}^{-n}(A)) - \gamma_{\theta}(A)$ as $n \rightarrow \infty$ is given by the asymptotic behavior of the $n$-th power of the Perron-Frobenius $U$ on $L^1_{\gamma_{\theta}}$ or on smaller Banach spaces.
Ergodicity of the associated RSCC
=================================
The facts presented in the previous sections lead us to a certain random system with complete connections associated with the $\theta$-expansion. To study the ergodicity of this RSCC it becomes necessary to recall some definitions and results from [@IG-2009].
According to the general theory we have the following statement.
\[5.1\] An homogeneous RSCC is a quadruple $\left\{(W, {\mathcal W}), (X, {\mathcal X}), u, P\right\}$ where
1. $(W, {\mathcal W})$ and $(X, {\mathcal X})$ are arbitrary measurable spaces;
2. $u: W \times X \rightarrow W$ is a $({\mathcal W} \otimes {\mathcal X}, {\mathcal W})$-measurable map;
3. $P$ is a transition probability function from $(W, {\mathcal W})$ to $(X, {\mathcal X})$.
For any $n \in \mathbb{N}_+$, consider the maps $u^{(n)} : W \times X^{n} \rightarrow W$, defined by $$\left.
\begin{array}{lll}
u^{(1)}\left(w, x\right) &:=& u(w, x), \\
u^{(n+1)}\left(w, x^{(n+1)}\right) &:=&
u\left(u^{(n)}\left(w, x^{(n)}\right), x_{n+1}\right), \, n \geq 1,
\end{array} \right. \label{5.2}$$ where $x^{(n)} = (x_1, \ldots, x_n) \in X^{n}$. We will simply write $wx^{(n)}$ for $u^{(n)}(w,x^{(n)})$. For every $w \in W$, $r \in \mathbb{N}_+$ and $A \in {\mathcal X}^r$, define $$\left.
\begin{array}{lll}
P_1(w, A):=P(w, A), \\
P_r(w, A):=\displaystyle \int_{X}P(w, \mathrm{d}x_1) \displaystyle\int_{X}P(wx_1, \mathrm{d}x_2)\ldots \displaystyle\int_{X}P(wx^{(r-1)}, \mathrm{d}x_r) \chi_A(x^{(r)}), \, r \geq 2,
\end{array} \right. \label{5.1'}$$ where $\chi_A$ is the indicator function of the set $A$. Obviously, for $n \in \mathbb{N}_+$ fixed, $P_r$ is a transition probability function from $(W, {\mathcal W})$ to $(X^r, {\mathcal X}^r)$.
By virtue of the existence theorem ([@IG-2009], Theorem 1.1.2), for a given RSCC $\left\{(W, {\mathcal W}), (X, {\mathcal X}), u, P\right\}$ there exists an associated Markov chain with the transition operator $U$ defined by $$Uf(w) := \int_{X} P(w, \mathrm{d}x)f(wx), \quad f \in B(W, {\mathcal W}),$$ where $B(W, {\mathcal W})$ is the Banach space of all bounded ${\mathcal W}$-measurable complex-valued functions defined on $W$. Moreover, the transition probability function of the associated Markov chain is $$Q(w, B) := \int_{X} P(w, \mathrm{d}x) \chi_B(wx) = P(w, B_w),$$ where $B_w = \left\{ x \in X: wx \in B \right\}$, $w \in W$, $B \in {\mathcal W}$. The iterates of the operator $U$ are given by $$U^nf(w) = \int_{X^n} P_n(w, \mathrm{d}x^{(n)})f(wx^{(n)}), \quad f \in B(W, {\mathcal W}), n \in \mathbb{N}_+.$$ It follows that the $n$-step transition probability function is given by $$Q^n(w, B) = P_n(w, B^{(n)}_w), \quad w \in W, \, B \in {\mathcal W}, n \in \mathbb{N}_+,$$ where $B^{(n)}_w = \left\{ x^{(n)}: wx^{(n)} \in B \right\}$. Hence the transition operator associated with the Markov chain with state space $(W, {\mathcal W})$ and transition probability function $Q$ is defined by $$Uf(\cdot) := \int_{W} Q(\cdot, \mathrm{d}w)f(w), \quad f \in B(W, {\mathcal W}).$$ Its iterates are given by $$U^{n}f (\cdot) = \int_{W} Q^{n}(\cdot, \mathrm{d}w)f(w), \quad n \in \mathbb{N}_+,$$ where $Q^n$ is the $n$-step transition probability function. Putting $$Q_n(w, B) = \frac{1}{n} \sum_{k=1}^{n} Q^k(w, B)$$ for all $n \in \mathbb{N}_+$, $w \in W$ and $B \in {\mathcal W}$, it is clear that $Q_n$ is a transition probability function on $(W, {\mathcal W})$. Let $U_n$ be the Markov operator associated with $Q_n$. Let $(W, d)$ be a metric space and let $L(W)$ denote the Banach space of all complex-valued Lipschitz continuous functions on $W$ with the following norm: $$\left\| f \right\|_L := \|f\| + s(f), \label{5.3}$$ where $$\| f \|:= \sup_{w \in W} \left|f(w)\right|, \,
s(f) := \sup_{w'\neq w''} \frac{|f(w') - f(w'')|}{d(w', w'')}. \label{5.4}$$
1. The operator $U$ is said to be orderly with respect to $L(W)$ if and only if there exists a bounded linear operator $U^\infty$ on $L(W)$ such that $$\lim_{n \rightarrow \infty} \left\|U_n -U^\infty \right\|_L = 0.$$
2. The operator $U$ is said to be aperiodic with respect to $L(W)$ if and only if there exists a bounded linear operator $U^\infty$ on $L(W)$ such that $$\lim_{n \rightarrow \infty} \left\|U^n - U^\infty \right\|_L = 0.$$
3. The operator $U$ is said to be ergodic with respect to $L(W)$ if and only if it is orderly and the range $U^\infty(L(W))$ is one-dimensional.
4. The operator $U$ regular with respect to $L(W)$ if and only if it is ergodic and aperiodic.
The transition operator $U$ of a Markov chain with state space $W$ is said to be a Doeblin-Fortet operator if and only if $U$ takes $L(W)$ into $L(W)$ boundedly with respect to $\|\cdot\|_L$ and there exist $k \in \mathbb{N}_+$, $r \in [0, 1)$ and $R < \infty$ such that $$s(U^{k}f) \leq r s(f) + R \| f \|, \quad f \in L(W). \label{5.5}$$ Alternatively, the Markov chain itself is said to be a *Doeblin-Fortet chain*.
The definition below isolates a class of RSCCs, called *RSCCs with contraction*, for which the associated Markov chains are Doeblin-Fortet chains.
\[def.contraction\] An RSCC $\left\{\left(W, {\mathcal{W}}\right), \left(X, {\mathcal{X}}\right), u, P\right\}$ is said to be with contraction if and only if $(W, d)$ is a separable metric space, $r_1 < \infty$, $R_1 < \infty$ and there exists $j \in \mathbb{N}_+$ such that $r_j < 1$. Here $$r_j := \sup_{w' \neq w''} \int_{X^j} P_j(w', \mathrm{d}x^{(j)}) \frac{d(w'x^{(j)}, w''x^{(j)})}{d(w', w'')}$$ and $$R_j := \sup_{A \in {\mathcal{X}}^{j}} s(P_j (\cdot, A)), \quad j \in \mathbb{N}_+$$ where $P_j$ is a transition probability function from $\left(W, {\mathcal{W}}\right)$ to $\left(X^j, {\mathcal{X}}^{j}\right)$ defined in (\[5.1’\]).
We shall also need the following results.
\[th.DF\] The Markov chain associated with an RSCC with contraction is a Doeblin-Fortet chain.
Assume that the Markov operator $U$ is aperiodic with respect to $L(W)$. Put $T = U-U^{\infty}$. Then we have $U^{\infty}U^{\infty}=U^{\infty}$, $TU^{\infty}=U^{\infty}T=0$, $U^n=U^{\infty}+T^n$, $n \in \mathbb{N}_+$. Moreover, there exist positive constants $q<1$ and $K$ such that $$\left\|T^{n}\right\|_L \leq Kq^n, \quad n \in \mathbb{N}_+.$$
This immediately implies the validity of $$\left\|U^nf-U^{\infty}f\right\|_L \leq K q^n \left\|f\right\|_L, \quad f \in L(W), n \in \mathbb{N}_+. \label{5.13}$$
A Markov chain is said to be compact if and only if its state space is a compact metric space $(W, d)$ and its transition operator is a Doeblin-Fortet operator.
\[th.ordered\] A compact Markov chain is orderly with respect to $L(W)$ and there exists a transition probability function $Q^{\infty}$ on $(W,{\mathcal{W}})$ such that $$U^{\infty}f(\cdot)= \int_{W} Q^{\infty}(\cdot,\mathrm{d}w) f(w),\quad f \in L(W).$$ Moreover, $Q^{\infty}(\cdot,B) \in E(1)$ for any $B \in {\mathcal{W}}$ and for any $w \in W$, $Q^{\infty}(w, \cdot)$ is a stationary probability for the chain. (Here $E(1)$ is the set of the eigenvalues of modulus $1$ of the operator $U$).
A criterion of regularity for a compact Markov chain is expressed in Theorem \[th.5.9\] in terms of the supports $\sigma_n(w)$ of the transition probability functions $Q^{n}(w, \cdot)$, $n \in \mathbb{N}_+$.
\[th.5.9\] A compact Markov chain is regular with respect to $L(W)$ if and only if there exists a point $w^{*} \in W$ such that $$\lim_{n \rightarrow \infty} d\left(\sigma_n(w), w^{*}\right) = 0, \quad w \in W.$$
The application of this criterion is facilitated by the inter-relationship among the sets $\sigma_n(w)$, $n \in \mathbb{N}_+$, which is given in the next lemma.
\[lem.supp\] For all $m, n \in \mathbb{N}$ and $w \in W$, we have $$\sigma_{m+n}(w) = \overline{\bigcup_{w' \in \sigma_m(w)}\sigma_n(w')},$$ where the overline mean topological closure in $W$.
Now, we are able to study the following RSCC $$\left\{\left([0, \theta], {\mathcal{B}}_{[0, \theta]}\right), \left(\mathbb{N}_m, {\mathcal{P}}(\mathbb{N}_m)\right), u, P\right\}, \label{5.17}$$ where $u : [0, \theta] \times \mathbb{N}_m \rightarrow [0, \theta]$, $u(s,i)=u_i(s)$ is given in (\[4.3\]) and the function $P(s,i)=P_i(s)$ given in (\[2.20\]) defines a transition probability from $([0,\theta], {\mathcal{B}}_{[0, \theta]})$ to $(\mathbb{N}_m, \mathcal{P}\left((\mathbb{N}_m\right)))$. Here $\mathbb{N}_m = \{m, m+1, \ldots\}$, $m \in \mathbb{N}_+$ and $\mathcal{P} \left(\mathbb{N}_m\right)$ denotes the power set of $\mathbb{N}_m$.
Whatever $a \in [0,\theta]$ the Markov chain $(s_{n,a})_{n \in \mathbb{N}}$ associated with the RSCC (\[5.1\]) has the transition operator $U$, with the transition probability function $$Q(s,B) = \sum_{ \{ \left.i \geq m \right| u_i(s) \in B \} } P_i(s), \quad s \in [0,\theta], B \in {\mathcal{B}}_{[0, \theta]}.$$ Then $Q^{n}(\cdot, \cdot)$ will denote the $n$-step transition probability function of the same Markov chain.
RSCC (\[5.17\]) is regular with respect to $L([0,\theta])$. Moreover there exist a stationary probability measure $Q^{\infty} = \gamma_{\theta}$ and two positive constants $q<1$ and $K$ such that $$\left\|U^n f- \int_{0}^{\theta} f \mathrm{d}\gamma_{\theta} \right\|_L \leq K q^n \left\|f\right\|_L, \quad n \in \mathbb{N}_+, f \in L([0,\theta]),$$ where $$U^{n}f (\cdot):= \int_{0}^{\theta} Q^{n}(\cdot, \mathrm{d}s)f(s) \label{5.20}$$
**Proof.** Since $$\begin{aligned}
\frac{\mathrm{d}}{\mathrm{d}s} u_i(s) &=& \frac{-1}{(s+i \theta)^2}, \nonumber \\
\frac{\mathrm{d}}{\mathrm{d}s} P_i(s) &=& \frac{i \theta - 1/\theta}{(s+i \theta)^2} - \frac{(i+1) \theta - 1/\theta}{(s+(i+1) \theta)^2}, \nonumber \end{aligned}$$ for any $s \in [0, \theta]$ and $i \geq m$ it follows that $$\sup_{s \in [0, \theta]} \left| \frac{\mathrm{d}}{\mathrm{d}s} u_i(s) \right| = \frac{1}{(i \theta)^2}$$ and $$\sup_{s \in [0, \theta]} \left| \frac{\mathrm{d}}{\mathrm{d}s} P_i(s) \right| < \infty.$$ Hence the requirements of Definition \[def.contraction\] of an RSCC with contraction are met with $j=1$. By Theorem \[th.DF\] it follows that the Markov chain $(s_{n, a})_{n \in \mathbb{N}}$ associated with this RSCC with contraction is a Doeblin-Fortet chain and its transition operator $U$ is a Doeblin-Fortet operator. It remains to prove the regularity of $U$ with respect to $L([0, \theta])$. For this we have to prove the existence of a point $s^{*} \in [0, \theta]$ such that $\lim_{n \rightarrow \infty} \left| \sigma_n(s) - s^{*} \right| = 0$, for any $s \in [0, \theta]$, where $\sigma_n(s)$ is the support of measure $Q^{n}(s, \cdot)$, $n \in \mathbb{N}_+$.
Let $s \in [0, \theta]$ be an arbitrarily fixed number and define $$w_1 := s, \quad w_{n+1} := \frac{1}{w_n + m \theta}, \quad n \in \mathbb{N}_+. \label{5.11}$$ We have $w_n \in [0, \theta]$ and letting $n \rightarrow \infty$ in (\[5.11\]) we get $$w_n \rightarrow s^{*} := \frac{-1+\sqrt{1+4\theta^2}}{2\theta}.$$ Clearly, $w_{n+1} \in \sigma_1(w_n)$ and Lemma \[lem.supp\] and an induction argument show that $w_{n} \in \sigma_n(s)$, $n \in \mathbb{N}_+$. Thus $$d\left(\sigma_n(s), s^{*}\right) \leq \left|w_n - s^{*}\right| \rightarrow 0, \quad n \rightarrow \infty$$ where $d$ stands for the Euclidian distance on the line. Now, the regularity of $U$ with respect to $L([0,\theta])$ follows from Theorem \[th.5.9\].
From (\[5.13\]) and Theorem \[th.ordered\] there exist a stationary probability measure $Q^{\infty}$ and two constants $q<1$ and $K$ such that $$\left\| U^{n}f - U^{\infty}f \right\|_L \leq K q^n \left\|f\right\|_L, \quad n \in \mathbb{N}_+, \ f \in L([0, \theta]) \label{5.12}$$ where $U^{n}f$ is as in (\[5.20\]) and $$U^{\infty}f = \int_{0}^{\theta} f(x) Q^{\infty}(\mathrm{d}x). \label{5.200}$$ Here $Q^{\infty} = \gamma_{\theta}$ is the invariant probability measure of the transformation $T_{\theta}$ in (\[1.7\]), i.e., $Q^{\infty}$ has the density $\rho_{\theta} = 1/(x + m \theta)$, $x \in [0, \theta]$, with the normalizing factor $1/\log(1+\theta^2)$.
$\Box$\
Another way to put this is that $\rho_{\theta}$ is the eigenfunction of eigenvalue $1$ of the Perron-Frobenius operator $U$.
A Gauss-Kuzmin-type theorem
===========================
Now, we may determine the limit of the sequence $(\mu(T^n_{\theta}<x))_{n \in {\mathbb{N}}_+}$ as $n \rightarrow \infty$ and give the rate of this convergence.
[(A Gauss-Kuzmin-type theorem for $T_{\theta}$)]{} \[G-K-L\] Let $([0,\theta],{\cal B}_{[0,\theta]}, T_{\theta})$ be as in Definition 1.1(i).
1. For a probability measure $\mu$ on $([0,\theta],{\cal B}_{[0,\theta]})$, let the assumption (A) as follows: $$(A) \quad \mbox{ $\mu$ is non-atomic and has a Riemann-integrable density.}$$ Then for any probability measure $\mu$ which satisfies (A), the following holds:
$$\lim_{n \rightarrow \infty}\mu (T_{\theta}^n < x)
= \frac{1}{\log (1+\theta^2)}\log ((m\theta+x)\theta), \quad x \in [0, \theta].
\label{6.1}$$
2. In addition to assumption of $\mu$ in (i), if the density of $[0, \theta]\ni x\mapsto \mu([0,x])$ is Lipschitz continuous, then there exist two positive constants $q < 1$ and $K$ such that for any $x \in [0, \theta]$ and $n \in \mathbb{N}_+$, the following holds: $$\lim_{n \rightarrow \infty}\mu (T_{\theta}^n < x)=
\frac{1+\alpha q^n}{\log (1+\theta^2)}\log ((m\theta+x)\theta),
\label{6.2}$$ where $\alpha := \alpha(\mu, n, x)$ with $\left|\alpha\right| \leq K$.
As a consequence, the $n$-th error term $e_n(\theta,\mu;x)$ of the Gauss-Kuzmin problem is obtained as follows:
$$e_{n}(\theta,\mu;x)=
\frac{\alpha q^n}{\log (1+\theta^2)}\log ((m\theta+x)\theta). \label{6.3}$$
**Proof.**
Let $T_{\theta}$ be as in (\[1.7\]). By Proposition \[prop.4.1.\](ii), we have $$\mu \left((T_{\theta})^{-n}(A)\right)
= \int_{A} U^nf_0(x) \rho_{\theta}(x)\mathrm{d}x \quad \mbox{for any } n \in \mathbb{N}, A \in {\cal B}_{[0,\theta]} \label{6.3'}$$ where $f_0(x)= \frac{x\theta+1}{\theta}(d\mu / d\lambda_{\theta})(x)$ for $x \in [0, \theta]$. If $d\mu / d\lambda_{\theta} \in L([0, \theta])$, by (\[5.200\]) we have $$U^{\infty} f_0 = \int_{0}^{\theta} f_0(x)\,Q^{\infty}(\mathrm{d}x) = \int_{0}^{\theta} f_0(x)\,\gamma_{\theta}(\mathrm{d}x) =\frac{1}{\log(1+\theta^2)}. \label{6.4}$$
Taking into account (\[5.12\]), there exist two constants $q<1$ and $K$ such that $$\|U^n f_0 - U^{\infty} f_0\|_L \leq K q^n\left\|f_0\right\|_L, \quad n \in \mathbb{N}_+. \label{6.5}$$ Furthermore, consider the Banach space $C([0, \theta])$ of all real-valued continuous functions on $[0, \theta]$ with the norm $\|f\| := \sup_{x \in [0, \theta]}|f(x)|$. Since $L([0, \theta])$ is a dense subspace of $C([0, \theta])$ we have $$\lim_{n \rightarrow \infty} \|(U^n - U^{\infty})f\|
= 0 \quad \mbox{for all } f \in C([0, \theta]). \label{6.6}$$ Therefore, (\[6.6\]) is valid for a measurable function $f_0$ which is $Q^{\infty}$-almost surely continuous, that is, for a Riemann-integrable function $f_0$. Thus, we have $$\begin{aligned}
\lim_{n \rightarrow \infty} \mu \left(T^n_{\theta} < x\right)
&=& \lim_{n \rightarrow \infty} \int_{0}^{x} U^nf_0(u) \rho_{\theta}(u) \,\mathrm{d}u \\
&=& \frac{1}{\log(1+\theta^2)} \int_{0}^{x} \,\rho_{\theta}(u)\,\mathrm{d}u \\
&=& \frac{1}{\log(1+\theta^2)} \log ((m\theta+x)\theta). \end{aligned}$$ Hence (\[6.1\]) is proved. $\Box$\
Since the Lebesgue measure $\lambda$ satisfies assumptions in both (i) and (ii) of Theorem \[G-K-L\], (\[6.1\]) and (\[6.2\]) hold for the case $\mu=\lambda$. Hence Theorem \[G-K-L\] gives the solution of the Gauss-Kuzmin problem for the pair $(T_{\theta},\mu)$ instead of $(\tau,\lambda)$ in (\[1.3\]).
Until now, the estimate of the convergence rate remains an open question. To obtain a better estimate of the convergence rate involved, we may use a Wirsing-type approach as in [@Sebe-2005; @Sebe-2010; @W-1974].
[\[01\]]{}
Bhattacharya, R. and Goswami, A., *A class of random continued fractions with singular equillibria*, Perspectives in Statistical Sciences, eds A.K.Basu et al (2000), Oxford University Press. Boyarsky, A. and Góra, P., *Laws of Chaos: Invariant Measures and Dynamical Systems in One Dimension,* Birkhäuser, Boston, 1997. Brezinski, C., *History of Continued Fractions and Pad' e Approximants,* Springer Series in Computational Mathematics , Springer-Verlag, Berlin, 1991. Chakraborty, S. and Rao, B.V., *$\theta$-expansions and the generalized Gauss map*, In Athreya, K., Majumdar, M., Puri, M., and Waymire, E. (eds.), “Probability, Statistics, and Their Applications: Papers in Honor of Rabi Bhattacharya”, Institute of Mathematical Statistics, Lecture Notes-Monograph Series **41**(2003), 49-64. Corless, R.M., *Continued fractions and chaos*, Amer. Math. Monthly **99**(3) (1992), 203-215. Dajani, K. and Kraaikamp, C., *Ergodic Theory of Numbers*, The Carus Mathematical Monographs, Washington, 2002. Iosifescu, M. and Grigorescu, S., *Dependence With Complete Connections and its Applications*, Cambridge Tracts in Mathematics **96**, 1990. Cambridge Univ.Press, Cambridge. \[(2009): second printing slightly corrected\]. Iosifescu, M. and Kraaikamp, C., *Metrical Theory of Continued Fractions*, Kluwer Academic Publishers, Dordrecht, 2002. Iosifescu, M. and Sebe, G.I., *An exact convergence rate in a Gauss-Kuzmin-Lévy problem for some continued fraction expansion*, in vol. Mathematical Analysis and Applications, AIP Conf. Proc. [**835**]{} (2006), 90-109. Kuzmin, R.O., *On a problem of Gauss*, Dokl. Akad. Nauk SSSR Ser. A (1928) 375-380. \[Russian; French version in *Atti Congr. Internaz.Mat.* (*Bologna*, 1928), Tomo **VI** (1932) 83-89. Zanichelli, Bologna\]. Lascu, D., *On a Gauss-Kuzmin-type problem for a family of continued fraction expansions*, J. Number Theory **133**(7) (2013), 2153-2181. Lévy, P., *Sur les lois de probabilité dont dépendent les quotients complets et incomplets d’une fraction continue*, Bull. Soc. Math. France **57** (1929), 178-194. Rockett, A.M. and Szüsz, P., *Continued Fractions*, World Scientific, Singapore, 1992. Nakada, H., *Metrical theory for a class of continued fraction transformations and their natural extensions*, Tokyo J.Math. **4**(2) (1981), 399-426. Schweiger, F., *Ergodic theory of fibred systems and metric number theory,* Clarendon Press, Oxford, 1995. Sebe, G.I., *A two-dimensional Gauss-Kuzmin theorem for singular continued fractions*, Indag. Mathem.,N.S. **11**(4) (2000), 593-605 Sebe, G.I., *On convergence rate in the Gauss-Kuzmin problem for grotesque continued fractions*, Monatsh. Math. **133** (2001), 241-254. Sebe, G.I., *A Gauss-Kuzmin theorem for the Rosen fractions*, J.Théor.Nombres Bordx. **14** (2002), 667-682. Sebe, G.I., *A Wirsing-type approach to some continued fraction expansion*, Int. J. Math. Math. Sci. [**12**]{} (2005), 1943-1950. Sebe, G.I., *Convergence Rate for a continued fraction expansion related to Fibonacci type sequences*, Tokyo J. Math., **33**(2) (2010), 487-497. Wirsing, E., *On the theorem of Gauss-Kuzmin-Lévy and a Frobenius-type theorem for function spaces*, Acta Arithmetica **24** (1974), 506-528.
[^1]: e-mail: igsebe@yahoo.com.
[^2]: e-mail: lascudan@gmail.com.
|
Rants on Cycling and on Life:
Photos of people and bicycles that pass in front of my camera
5.24.2005
PT Today:
today at the close of my forever entertaining PT meetingmy PT said, "exercise that finger... you really only need the splint for times like... when you are riding your bike..."
RIDING MY BIKE?!?!?!
STOP!
HOLD THE PRESSES!
I thought I was told not to ride my bike!she tried to back it upshe tried to tell me that I am not supposed to ride my bikebut it was too lateI heard what she said... and I am going to start back up on the bike... with caution
No comments:
About Me
if you want to know about me all you need to do is check out my BLOG
it is not the same everyday or everyweek
the focus changes and alters with my moods and with the events of the day and the events of my life |
Germany is not convinced that US-based writer, political activist and former imam Fethullah Gulen was behind the failed July 15 coup in Turkey, the country's intelligence chief said Saturday.
"Turkey has tried on different levels to convince us of that fact, but they have not succeeded," Federal Intelligence Service (BND) President Bruno Kahl told Der Spiegel in an interview published March 18.
Kahl said that despite gathering information from a variety of sources, the BND could not find a direct link between what Turkey calls the Gülenist Terror Group (FETÖ) and the coup attempt, the Daily Sabah reported. He also called Gulen's organization merely a "civil association for religious and secular education." Turkey classifies the group as a terrorist organization.
(Gulen's supporters scoff at the "terrorist" name FETO and say their organization helps support schools, businesses and media and is simply called Hizmet, "service," in Turkish.)
Nearly 250 people died in the attempt to oust Turkish President Recep Tayyip Erdogan last summer, when some soldiers turned tanks and aircraft on government buildings in an attempt to take over. In its aftermath, the Turkish government launched a massive purge across all sectors of society, resulting in tens of thousands being arrested, nearly 100,000 detained and an equal number dismissed from media, military, judicial, civil service and educational positions. Media outlets have also been closed on a massive scale.
Kahl said that though the coup attempt was not initiated by the Turkish state, Erdogan has used it as "a welcome pretext" for exerting more control over the country, though he said he believed the crackdown would have happened either way.
"What we saw following the putsch would have happened regardless. Maybe not on the same scale and with such radicalism," Kahl said, according to AFP.
According to Kahl, the purge was already underway before July 15.
"That's why a part of the military thought they needed to quickly commit a coup before they were also affected," he said. "But it was too late and they too were also hit by the purges."
Gulen, a former supporter of Erdogan, has lived in the United States in self-imposed exile for nearly 20 years. He has always denied being involved in the coup attempt.
Germany and the Netherlands are currently at odds with the Turkish government after preventing Erdogan and Turkish ministers from campaigning in their countries in support of a referendum to give much more power to the Turkish presidency, held by Erdogan. The EU sees the changes as undemocratic, and the countries have said campaigning by a foreign power on their soil is inappropriate. Turkey is furious, and has called leaders of both nations "Nazis." |
// <auto-generated>
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License. See License.txt in the project root for
// license information.
//
// Code generated by Microsoft (R) AutoRest Code Generator.
// </auto-generated>
namespace Microsoft.Azure.Management.Network.Fluent.Models
{
using Microsoft.Azure.Management.ResourceManager;
using Microsoft.Azure.Management.ResourceManager.Fluent;
using Microsoft.Rest;
using Microsoft.Rest.Serialization;
using Newtonsoft.Json;
using System.Linq;
/// <summary>
/// Probe of the application gateway.
/// </summary>
[Rest.Serialization.JsonTransformation]
public partial class ApplicationGatewayProbeInner : Management.ResourceManager.Fluent.SubResource
{
/// <summary>
/// Initializes a new instance of the ApplicationGatewayProbeInner
/// class.
/// </summary>
public ApplicationGatewayProbeInner()
{
CustomInit();
}
/// <summary>
/// Initializes a new instance of the ApplicationGatewayProbeInner
/// class.
/// </summary>
/// <param name="protocol">The protocol used for the probe. Possible
/// values include: 'Http', 'Https'</param>
/// <param name="host">Host name to send the probe to.</param>
/// <param name="path">Relative path of probe. Valid path starts from
/// '/'. Probe is sent to
/// <Protocol>://<host>:<port><path>.</param>
/// <param name="interval">The probing interval in seconds. This is the
/// time interval between two consecutive probes. Acceptable values are
/// from 1 second to 86400 seconds.</param>
/// <param name="timeout">The probe timeout in seconds. Probe marked as
/// failed if valid response is not received with this timeout period.
/// Acceptable values are from 1 second to 86400 seconds.</param>
/// <param name="unhealthyThreshold">The probe retry count. Backend
/// server is marked down after consecutive probe failure count reaches
/// UnhealthyThreshold. Acceptable values are from 1 second to
/// 20.</param>
/// <param name="pickHostNameFromBackendHttpSettings">Whether the host
/// header should be picked from the backend http settings. Default
/// value is false.</param>
/// <param name="minServers">Minimum number of servers that are always
/// marked healthy. Default value is 0.</param>
/// <param name="match">Criterion for classifying a healthy probe
/// response.</param>
/// <param name="provisioningState">The provisioning state of the probe
/// resource. Possible values include: 'Succeeded', 'Updating',
/// 'Deleting', 'Failed'</param>
/// <param name="port">Custom port which will be used for probing the
/// backend servers. The valid value ranges from 1 to 65535. In case
/// not set, port from http settings will be used. This property is
/// valid for Standard_v2 and WAF_v2 only.</param>
/// <param name="name">Name of the probe that is unique within an
/// Application Gateway.</param>
/// <param name="etag">A unique read-only string that changes whenever
/// the resource is updated.</param>
/// <param name="type">Type of the resource.</param>
public ApplicationGatewayProbeInner(string id = default(string), ApplicationGatewayProtocol protocol = default(ApplicationGatewayProtocol), string host = default(string), string path = default(string), int? interval = default(int?), int? timeout = default(int?), int? unhealthyThreshold = default(int?), bool? pickHostNameFromBackendHttpSettings = default(bool?), int? minServers = default(int?), ApplicationGatewayProbeHealthResponseMatch match = default(ApplicationGatewayProbeHealthResponseMatch), ProvisioningState provisioningState = default(ProvisioningState), int? port = default(int?), string name = default(string), string etag = default(string), string type = default(string))
: base(id)
{
Protocol = protocol;
Host = host;
Path = path;
Interval = interval;
Timeout = timeout;
UnhealthyThreshold = unhealthyThreshold;
PickHostNameFromBackendHttpSettings = pickHostNameFromBackendHttpSettings;
MinServers = minServers;
Match = match;
ProvisioningState = provisioningState;
Port = port;
Name = name;
Etag = etag;
Type = type;
CustomInit();
}
/// <summary>
/// An initialization method that performs custom operations like setting defaults
/// </summary>
partial void CustomInit();
/// <summary>
/// Gets or sets the protocol used for the probe. Possible values
/// include: 'Http', 'Https'
/// </summary>
[JsonProperty(PropertyName = "properties.protocol")]
public ApplicationGatewayProtocol Protocol { get; set; }
/// <summary>
/// Gets or sets host name to send the probe to.
/// </summary>
[JsonProperty(PropertyName = "properties.host")]
public string Host { get; set; }
/// <summary>
/// Gets or sets relative path of probe. Valid path starts from '/'.
/// Probe is sent to
/// &lt;Protocol&gt;://&lt;host&gt;:&lt;port&gt;&lt;path&gt;.
/// </summary>
[JsonProperty(PropertyName = "properties.path")]
public string Path { get; set; }
/// <summary>
/// Gets or sets the probing interval in seconds. This is the time
/// interval between two consecutive probes. Acceptable values are from
/// 1 second to 86400 seconds.
/// </summary>
[JsonProperty(PropertyName = "properties.interval")]
public int? Interval { get; set; }
/// <summary>
/// Gets or sets the probe timeout in seconds. Probe marked as failed
/// if valid response is not received with this timeout period.
/// Acceptable values are from 1 second to 86400 seconds.
/// </summary>
[JsonProperty(PropertyName = "properties.timeout")]
public int? Timeout { get; set; }
/// <summary>
/// Gets or sets the probe retry count. Backend server is marked down
/// after consecutive probe failure count reaches UnhealthyThreshold.
/// Acceptable values are from 1 second to 20.
/// </summary>
[JsonProperty(PropertyName = "properties.unhealthyThreshold")]
public int? UnhealthyThreshold { get; set; }
/// <summary>
/// Gets or sets whether the host header should be picked from the
/// backend http settings. Default value is false.
/// </summary>
[JsonProperty(PropertyName = "properties.pickHostNameFromBackendHttpSettings")]
public bool? PickHostNameFromBackendHttpSettings { get; set; }
/// <summary>
/// Gets or sets minimum number of servers that are always marked
/// healthy. Default value is 0.
/// </summary>
[JsonProperty(PropertyName = "properties.minServers")]
public int? MinServers { get; set; }
/// <summary>
/// Gets or sets criterion for classifying a healthy probe response.
/// </summary>
[JsonProperty(PropertyName = "properties.match")]
public ApplicationGatewayProbeHealthResponseMatch Match { get; set; }
/// <summary>
/// Gets the provisioning state of the probe resource. Possible values
/// include: 'Succeeded', 'Updating', 'Deleting', 'Failed'
/// </summary>
[JsonProperty(PropertyName = "properties.provisioningState")]
public ProvisioningState ProvisioningState { get; private set; }
/// <summary>
/// Gets or sets custom port which will be used for probing the backend
/// servers. The valid value ranges from 1 to 65535. In case not set,
/// port from http settings will be used. This property is valid for
/// Standard_v2 and WAF_v2 only.
/// </summary>
[JsonProperty(PropertyName = "properties.port")]
public int? Port { get; set; }
/// <summary>
/// Gets or sets name of the probe that is unique within an Application
/// Gateway.
/// </summary>
[JsonProperty(PropertyName = "name")]
public string Name { get; set; }
/// <summary>
/// Gets a unique read-only string that changes whenever the resource
/// is updated.
/// </summary>
[JsonProperty(PropertyName = "etag")]
public string Etag { get; private set; }
/// <summary>
/// Gets type of the resource.
/// </summary>
[JsonProperty(PropertyName = "type")]
public string Type { get; private set; }
/// <summary>
/// Validate the object.
/// </summary>
/// <exception cref="ValidationException">
/// Thrown if validation fails
/// </exception>
public virtual void Validate()
{
if (Port > 65535)
{
throw new ValidationException(ValidationRules.InclusiveMaximum, "Port", 65535);
}
if (Port < 1)
{
throw new ValidationException(ValidationRules.InclusiveMinimum, "Port", 1);
}
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.