text:
the first minute of a new day
FREDERICO MONTEZ
love summer / remember me
too young to start / red lips
going back to jesus / little boy
FRANKIE STEIN & GHOULS
weerdo the wolf / goon river
bacon fat (86) / just because of a kiss
TED TAYLOR
something strange is goin' on in my house / funky thing
CHUCK HIGGINS, WYNONIE HARRIS, LEON TARVER, AM
beautiful love + 3
SERGIO MENDES & BRASIL '66
mas que nada / the joker
BOYD BENNETT
the groovy age
simple sister / broken barricades
JOHNNY DAVIS
you got to crawl to me / the love i see now
STEAMHAMMER
TITO ALLEN
sun sun babae / voy a perder la cabeza
sweet home alabama / workin' for mca
SUKADEVA DAS / HARE KRISHNAS
every town & village
BOBBY RUSSELL
PHYLLIS HYMAN
you know how to love me / give a little more
i gotta keep my bluff in / natural man
DUKE ELLINGTON & JIMMY BLANTON
rockin' in the jungle / rock'n roll cha-cha
FIVE AMERICANS
zip code / the sound of love
MARCELS
don't cry for me this christmas / merry twist-mas
TERRY REID
ooh baby / mono
TOM ZE / GILBERTO GIL / MARIA BETHANIA / PIT
sao benedito / roda / viramundo / enredo
NEO-GOSPEL EXPERIENCE
lord, you are my music
FIVE BLIND BOYS
the tide of life / i got it within me
JIMMY WILLIAMS
big legged woman / early one morning
SONNY CRAVER
outside of memphis / still waters
NATHAN MCKINNEY & GROUP
oh how i love you / weep no more
DEREK MARTIN
that's what i'll do / how can i get away
MONTE STEPHENS
i'm glad he died for me / to see the need for thee
JIM BURGETT
dreamy eyes / innocence is to blame
SPACEMEN
also sprach zarathustra (2001) / bobn' ethyl
TONY ORLANDO
don't let go / bring it on home to me
DEE DEE SHARP
standing in the need of love / i really love you
mr. bump man, part 2 / somebody help the beggar man
DELACARDOS
i know i'm not much / you don't have to see me
divin
no more sorrows
southern journey 8, the eastern shores
RIGHT COMBINATION
i'm still in love with you / part 2
DARLENE PAYNE
copy cat / this melody
MICHAEL JULIUS
things have got to get better / part ii
ljud fran friberga
songs from the swinger
IKE NOBLE
shake it loose / instro
the dance at st. francis / lady fingers
is there such a world / long tall girl
ROCKIN' STOCKINGS
rockin'-lang-syne / yuleville, u.s.a.
nothing left to do but cry / usher boy
mwandishi
PAUL BALLENGER
seven times heaven / i still love you
DENNY EZBA
cindy / raining in my heart
a man will shed a few tears too
RICK GROSSMAN
hot romance
LARADOS
afterthoughts / big boss man
disco balady
RAY SUNSHINE
blue skies forever
papa will / i feel your love
look at the girl / that's a good idea
MIKE AULDRIDGE
JEAN RITCHIE
none but one
ODELL BROWN
think about it / the weight
someday at christmas
jail bait
zambia!! an introduction to shalawambe, amayenge and more
MOHAMMED EL-BAKKAR & ORIENTAL ENSEMBLE
music of the african arab vol. 3
GOLDEN HARMONAIRS
help me through this wicked land
COUNTRY GAZETTE
what a way to make a living!
three ragas
MARTIN DENNY
martin denny!
black sugar 2
BILL QUIST
piano solos of eric satie
BIG JAY MCNEELY
there is something on your mind
HARMONIZING FOUR
that old time religion
L.A. SHOUTING STARS
what would i do
never again / calling you
DAVE VAN RONK
in the tradition
CARLOS MONTOYA
flamenco a la montoya
i saw the light
EDDIE SNOW
ain't that right / bring your love back home
CAMILLE BOB
brother brown / 2 weeks, 2 days, too long
BOBBIE GENTRY
ode to billie joe
NEW GRASS REVIVAL
fly through the country
HERB ALPERT & TIJUANA BRASS
JERRY MCCAIN
steady / she's tough
CAL TJADER & EDDIE PALMIERI
el sonido nuevo
MARLENE PAULA
i wanna spend christmas with elvis / once more it's xmas
LORNE GREENE
ringo / bonanza
Dale Farr
EARL KING: Trick Bag
CARL PERKINS: Honey Don't
WARREN SMITH: Ubangi Stomp
DR ROSS: Boogie Disease
HOWLIN WOLF: I Asked For Water
OTIS RUSH: I Can't Quit You Baby
MUDDY WATERS: Long Distance Call
JIMMY REED: I Want To Be Loved
DREAMLOVERS: If I Should Lose You
SHERADES: My Love
JOHNNIE RAY: Cry
SOLOMON BURKE: Everybody Needs Somebody
TOMMY TUCKER: High Heel Sneakers
SHAWEES: No One To Love Me
HIDEAWAYS: Can't Help Loving That Girl Of Mine
CASTELLS: My Girl Awaits Me
JOE HINTON: Funny
LILLIAN LEACH & MELLOWS: My Darling
The Roots of Rock and Roll..38 Years of playing my own 45s,LP's, CD's every other Friday at 3:00 PST on KBOO radio and KBOO.FM streaming
KBOO.FM
Booker T. Washington "Bukka" White (November 12, 1909 – February 26, 1977) was an African-American Delta blues guitarist and singer. "Bukka" is a phonetic spelling of White's first name, placed on the labels of his early recordings. He preferred the proper spelling of his name, "Booker," as he was named after the well-known African-American educator and civil rights activist Booker T. Washington.
White was born south of Houston, Mississippi. He was a first cousin of B.B. King's mother (White's mother and King's grandmother were sisters). He is remembered as a player of National resonator guitars. He also played piano, but less adeptly. He typically played slide guitar, in an open tuning. He was one of the few, along with Skip James, to use a crossnote tuning in E minor, which he may have learned, as James did, from Henry Stuckey.
White started his career playing the fiddle at square dances. He claimed to have met Charlie Patton soon after, but some have doubted this recollection. Nonetheless, Patton was a strong influence on White.
He first recorded for Victor Records in 1930. His recordings for Victor, like those of many other bluesmen, included country blues and gospel music. Victor published his photograph in 1930. His gospel songs were done in the style of Blind Willie Johnson, with a female singer accentuating the last phrase of each line.
Nine years later, while serving time for assault, he recorded for the folklorist John Lomax. The few songs he recorded around this time became his most well known: "Shake 'Em On Down," and "Po' Boy." His 1937 version of the oft-recorded song "Shake 'Em on Down," is considered definitive; it became a hit while White was serving time in Parchman.
One of his most famous songs, "Parchman Farm Blues", about the Mississippi State Penitentiary (also known as Parchman Farm) in Sunflower County, Mississippi, was released on Harry Smith's fourth volume of the Anthology of American Folk Music, Vol. 4.
Bob Dylan covered his song "Fixin' to Die Blues", which aided a "rediscovery" of White in 1963 by guitarist John Fahey and Ed Denson, which propelled him into the folk revival of the 1960s. White had recorded the song simply because his other songs had not particularly impressed the Victor record producer. It was a studio composition of which White had thought little until it re-emerged thirty years later.
Fahey and Denson found White easily enough: Fahey wrote a letter to "Bukka White (Old Blues Singer), c/o General Delivery, Aberdeen, Mississippi." Fahey had assumed, given White's song "Aberdeen, Mississippi", that White still lived there or nearby. The postcard was forwarded to Memphis, Tennessee, where White worked in a tank factory. Fahey and Denson soon traveled to meet White, and White and Fahey remained friends through the remainder of White's life. He recorded a new album for Denson and Fahey's Takoma Records, whilst Denson became his manager. White was at one time also managed by experienced blues manager Arne Brogger.
Later in his life, White was friends with the musician Furry Lewis. The two recorded an album (mostly in Lewis's Memphis apartment), Furry Lewis, Bukka White & Friends: Party! At Home.
White died of cancer in February 1977, at the age of 67, in Memphis, Tennessee. In 1990 he was posthumously inducted into the Blues Hall of Fame (along with Blind Blake and Lonnie Johnson).
On November 21, 2011, the Recording Academy announced that "Fixin' to Die Blues" was to be added to its 2012 list of Grammy Hall of Fame Award recipients.
The Led Zeppelin song "Hats Off to (Roy) Harper", on the band's 1970 album Led Zeppelin III, was based in large part on White's "Shake 'Em on Down." "Custard Pie", a song on Led Zeppelin's 1975 album Physical Graffiti, also references "Shake 'Em on Down."
The 1963 recordings of White's song "Shake 'Em on Down" and spoken-word piece "Remembrance of Charlie Patton" were both sampled by electronic artist Recoil (mostly a one-man effort by Alan Wilder of Depeche Mode) for the track "Electro Blues for Bukka White" on the 1992 album Bloodline. The song was reworked and re-released on the 2000 EP Jezebel.
In 1995, White's "Aberdeen, Mississippi" was covered as "Aberdeen" by guitarist Kenny Wayne Shepherd on his debut album, Ledbetter Heights. It reached number 23 on the Billboard (North America) Mainstream Rock Tracks in 1996.
On January 26, 2010, Eric Bibb released Booker's Guitar (TEL 31756 02) through Telarc International Corporation after becoming inspired by the hidden stories Bibb felt through holding White's famous guitar.
White's song "Parchman Farm Blues" was recorded by Jeff Buckley, and was released posthumously on the bonus disc of Buckley's album Grace: Legacy Edition.
Article courtesy of www.wikipedia.org


text:
Home » Arrow Electronics Expands Definition of 'Distributor'
Arrow Electronics Expands Definition of 'Distributor'
Paul Katz
VP of Digital Supply-chain Solutions
Robert M. Hribernik is vice president-global supply chain with Baxter Healthcare Corporation, headquartered in Deerfield, Ill. In his current position, created by the company in April 2000, he is responsible for the entire supply-chain processes of Baxter's business divisions. He is also a member of the company's Operations Management Team, consisting of senior management. His previous positions include vice president of distribution and logistics with TechData Corp., vice president of logistics and supply chain at Bruno's Inc., and director of global logistics with Bausch & Lomb Inc.
Q. You joined Arrow two years ago as vice president of digital supply-chain solutions. Did this title denote a new strategic approach for Arrow?
A. Arrow has a long history of doing a lot of good things related to the supply chain, but right about 1999 there was a crystallization of thinking under Francis Scricco, who was a relatively new CEO, to begin to focus on supply-chain management as a business. So my becoming part of the Arrow team made sense at that time for all concerned. The organization that has evolved under me includes a group of people who work on developing or designing supply-chain solutions with our customers that draw on the various service capabilities that we have. These are fairly sophisticated people, usually 20-year veterans who have come out of both industry and consulting experience, who know how to go in and do a business needs analysis for the customer and in a number of cases they actually do a total cost of ownership analysis. This leads to dialog about activities where Arrow ultimately can play. Sometimes they come up with models where Arrow doesn't play, but it's all in the spirit of solving our customers' most significant needs and priorities relative to the supply chain.
Behind this forward-facing group is a group of people who maintain the actual value-added programs that we have today. We have, for example, in the commerce arena a tool called e-Compass which stands for Customer Originated Material Planning and Scheduling System. It grabs the customer's MRP [materials resource planning] and integrates it with our systems. Maintaining that product and others like automatic replenishment, or kitting and turnkey services are what this group does.
Q. It sounds like Arrow does a lot more than a typical distributor. What was the thinking that put the company on this path?
A. Yes, I think we here at Arrow struggle with the term distributor because it doesn't begin to describe what we do. There were two things, I believe, that moved Arrow in this direction and that were coming together over the period from the late '80s to the early '90s. This was a time when OEM companies began to realize they were far better off investing in R&D than in inventory and our customers were increasingly expressing a need for services around their supply-chain activities.
Arrow had always been working on building bulletproof, scaleable capabilities in terms of buying and selling parts, but customers were incrementally requesting different kinds of services. In the late '80s, Arrow was one of the first companies to have an in-plant store, where it literally took over running the warehouse and managing the materials for a customer on site.
Another thing we started doing is what we call programming, which is coding electronic components. These were things that were traditionally done inside an enterprise, but as companies de-verticalized they unbundled some of these things and said, 'Arrow, can you do this for me?' So we built up a whole laundry list of services out of that demand. Currently, we maintain a list of 43 services, which just kind of grew out of customers' progressive needs.
The other thing that happened in parallel was an increasing recognition that companies needed to be electronically linked. This happened in fairly small steps, but as people began to share portions of their bill of materials, we started moving toward a scheduled business. Arrow responded by enhancing its own internal technologies and putting in place EDI linkages with customers and suppliers.
I arrived on the scene at a point where much of the brick-and-mortar capability was in place and some of the electronic commerce was beginning to take shape, so the platform was there for an integrated supply-chain solution. We saw that we could solve the customer's most important supply-chain needs in terms of enhancing flexibility, improving time to market, reducing working capital, and containing or even reducing head count, so we focused on the objective of satisfying our customer's supply-chain needs. We now have a portfolio of value-added services that we have been building out very aggressively over the last couple of years, along with the e-commerce tool set to make it all work smoothly.
Q. What functions do the Arrow Digital Solutions enable and is that changing?
A. Because of where we are in the supply chain we developed this linked, and now interactive, relationship with our customers. We pass information back and forth with them, and we have information that comes from our suppliers as well, so our digital solutions draw on that. The solutions are always growing in terms of features and functionality, but those already available in the marketplace include Arrow Risk Manager, which provides key information about the procurement or the procurability of components. How available is this component? How many suppliers are there? Where is the component in its life cycle? What is the nature of customer usage? All the pieces of information that ultimately tell you whether this component has a high-risk profile or is one that would be easily manageable. This is very valuable information because parts evolve so fast in this industry. A component engineer, for example, could easily select a part that is about to go end-of-life and that is not healthy for anybody. So we help the customer right from the conceptualization phase to reduce the risk in the bill of materials. This is available as a tool that the customer can access whether they ever buy parts from Arrow or not.
Arrow Alert is a way of taking that same information and making it more dynamic and specific to the customer's activities. It interactively updates customers on what is changing in their bills of material, rather than have them find it out at the next buy point or the next RFQ. If some components are now no longer available or are at risk of not being available with high reliability, the customer is actually proactively notified of that. And configurability lets the customer decide what he wants to get notified on. There are some companies that want to know if anything changes, even though the change may only be the manufacturing site. Others only want to know about changes in the risk profile or about real, tangible changes like the footprint it will take on the board.
The third tool is Arrow Collaborator and what this does is marries information that we have about the customers' forecasts, their MRP, with the information we have about the availability of components. This tool was recently introduced and focuses on what we believe to be key touch points for the customer: where are the gaps in my supply chain, what are the things I really need to address today? This is valuable knowledge sharing. I know of no other tool that can have this marriage of collaboration and interaction of information with the kind of content that we have available. And, again, it can be configured in the way the customer wants, whether they are concerned about what is happening in the next two weeks or they're worried about six weeks out. So, first, it's what are the most acute problems I need to address, then what can I do about them? What are my options? When will these gaps either naturally close or what actions can I take to close them? And finally it looks at how did I get here? What happened in terms of engineering changes or parts that somehow dropped off the MRP communication, or what was wrong in the behavior of my forecast that led me to all of this? Because at the end of the day it isn't just about how Arrow or any supplier responds to the customer, it is also how well the customer has its process under control.
Q. What type of process failures do you commonly run into?
A. We have learned through hundreds of engagements that things happen with electronic transmissions, particularly duplications. The marketing department may throw in some new twist that wasn't intended to make its way through to the MRP, but it comes through anyway. It's amazing the things that happen. So we wanted to put in a sort of process control capability to help identify things that are bouncing around and that need attention, as well as a tracking methodology. We keep six months of history for the customer that shows if they are getting better in the quality of their forecast, or in the kind of spikes that raise havoc with forecasts. It's one thing to have a forecast that isn't quite what you purchased; it's another thing when you forecasted five pieces and you actually needed 5,000. Those are spikes that make it tough to respond. The tool is there to help identify those kinds of gaps and to close them, but closing them is also about process control and workflow. That is our mindset here - an approach that drives toward improving the process, because the information is there to help you do it and to track whether you are making progress.
Q. You have enumerated the benefits of your value-added services for customers. What are the benefits to Arrow?
A. Arrow's rapid growth certainly has been helped by the value-added programs that we offer. Today almost 70 percent of Arrow's business in North America and close to 55 percent globally is associated with some form of value-added service. And there is the fact that it has enabled us to build relationships with our customers and to really know their business.
As we move forward, we are focusing on more explicitly capturing the value of these services. Our total cost of ownership analyses show tremendous benefits to the customers and we are moving toward models where the service aspects of what we provide are broken out and placed on a fee-for-service basis.
Q. Do you think you might spin the services off as a separate company at some point?
A. Well, we are moving very aggressively to build out the capabilities. But in terms of a business model, there are pieces of what we do that are just so core to our business - the everyday aspects of getting closely in line with the customers needs, from the time they start the conceptual aspect of a product until it goes into full-scale production. So I think these supply-chain capabilities will always be there as an integral part of the core selling business of Arrow. In effect, the selling business of Arrow changes from being just distribution of parts to a provider of goods and services, right in the core business. And, as I said before, the way we get paid is beginning to change. The Arrow Digital Solutions are all sold separately and the revenue streams are separate, but I don't think we will form a separate company per se.
Q. What is your primary goal for the coming year?
A. We are trying to keep focused on getting full traction with the things that have already been introduced and making sure that refinements take place in terms of how they are implemented, and working smoothly. Nothing is every quite done. That is one of the things I have learned - there is always room for improvement in anything. And we are not that far from introducing new features and functions that will collectively become the next generation of tools. Our customers include OEMs and contract manufacturers so we are focusing on addressing needs that arise out of the outsourced manufacturing model -"what if" scenarios and how to more effectively deal with complexities like the triangulation and reconciliation of information that needs to occur.
Q. What do you consider the most significant learnings of your supply-chain career?
A. Even though I have talked a lot about technology solutions here, one is that the answer does not lie just in technology. You still really have to think through the network - how many warehouses and the flow of materials, the stuff we used to worry about 20 years ago. The most effective supply chains really work through this and through the issues of who is going to do what work. As this outsourcing trend becomes more prevalent, it is important to not get into an over-the-wall mentality, but to understand what the customer will do, what Arrow will do, what the contract manufacturer will do - really thinking that through and having it clearly established.
And finally, recognizing that the world works differently in different situations. The component for which there are 10 or 15 suppliers and thousands of customers is just a different animal than the component that is being used by three customers in the world.
Organic Foods Distributor Tree of Life Gains Control of Supplier Base With DSC Logistics
Building Materials Distributor Upgrades to Latest Version of Infor ERP SX.enterprise
Wholesale HVAC Distributor Uses Business Intelligence Software from Cutwater BI

redpajama_set_name: RedPajamaCommonCrawl


Wanted: An amazing human being to join our Soelberg's Stansbury Deli team! We are a homegrown, hometown business started long before the toggle light switch was invented.
Service and quality are key to us. You will be working with a fast-paced, upbeat crew whose primary focus is making sure our guests leave satisfied each time they visit. You must be 18 years or older for this part-time position, receive a food handler's permit, lift up to 50lbs and have a flexible schedule allowing for weekend and night shifts. Experience is a bonus but not necessary. A brief assessment is required when applying and you may attach a resume if you choose. We look forward to meeting you!


Frogs, and toads for that matter, are cherished inhabitants in my landscape. They feast on slugs lessening the damage to beloved hostas. They also eat insects, lots of them, including mosquitoes, flies and pests that harm vegetable and landscape plants.
Attract frogs to your landscape by supplying their needs: shelter and water.
A brush pile is an ideal shelter. It offers small, cool, sheltered places where frogs can hide from predators and hot sunlight. Insects are also attracted to brush piles providing frogs with delicious snacks.
A rock pile constructed with gaps between rocks would also work. Frogs even appreciate a shelter as simple as an overturned clay pot propped up to leave an opening for them to crawl inside.
Place your shelter in an out-of-the-way spot in the garden. If it can be located near a source of water, that's even better.
Frogs cannot live without water. I've read frogs require standing water, but they don't seem to mind the moving water from the waterfalls in my pond. Moving water supplies oxygen for fish and frogs, and it keeps mosquitoes from breeding.
Plants in the pond provide shade and supply oxygen. Algae is another food source.
Frogs hibernate in my pond deep under the water – amazing, isn't it?
A frog-friendly landscape is free of chemicals. Avoid the use of insecticides and fungicides and water treatments in ponds whenever possible. Never use treated lumber when making brush piles.
I enjoy the frogs in my landscape. They swim alongside me when I am gardening at the water's edge. They spring – with a splash – into the pond when I surprise them. It is always amazing to witness their tadpoles becoming frogs.
Invite some frogs into your landscape, reap the benefits of their pest control, and garden with me!
Previous Post Let go of catchweed!
Next Post Relax on a garden bench on National Garden Meditation Day.


text:
\section{A puzzle}

How many permutations of the first $n$ natural numbers can we find such that any two of them place
two consecutive natural numbers somewhere in the same position? This problem was introduced in
\cite{KM} where the authors conjectured that the maximum number of such permutations is exactly the middle binomial coefficient
${n \choose {\lceil {n \over 2} \rceil}}.$ The conjecture has been neither disproved nor confirmed so far. This combinatorial  puzzle is closely connected to Shannon's graph capacity concept and the rich and beautiful mathematics around it. In this paper we begin to explore its generalizations to directed graphs.

\section{Introduction for the information theorist}

In \cite{CK} the zero--error capacity of a discrete memoryless stationary channel was generalized by restricting the input sequences to "mimick" a fixed distribution. The resulting concept of {\it zero--error capacity within a given type}
allows to apply the method of types \cite{CsK} to several important problems in extremal combinatorics and the theory of combinatorial search. All such problems can be regarded as part of zero--error information theory. In \cite{KS} and the follow--up paper \cite{GKV} Shannon's graph capacity problem \cite{Sh} was generalized to directed graphs. The resulting concept of
Sperner capacity and the corresponding capacity within a given type gave the key to solve an intriguing problem of
R\'enyi in combinatorial search in \cite{GGKV}.
This direction of research started in \cite{CKS} where the problem of
zero--error capacity of the compound channel with uninformed encoder (but not decoder) was introduced as a unifying model for several problems in extremal combinatorics. Actually, in
\cite{GGKV} a formally information--theoretic analogue of this problem was solved for families of directed graphs. Much to our surprise this generalization gave
Nayak and Rose \cite{NR} the correct mathematical formulation and the technique of solution for the important problem of the zero--error capacity of the compound channel in case of uninformed encoder and decoder.

In this paper we introduce and study corresponding problems for infinite alphabet channels.
Formally, our problems are concerned with Sperner--type capacity of infinite directed graphs. To the analogy of the case of capacity within a given type we restrict the input sequences to be permutations. In case of undirected graphs these problems have been
introduced in \cite{KM} and further studied in the papers  \cite{KMS} and \cite{KSS}.

\section{Digraph--different permutations}

Let ${\mathbb N}$ denote the set of natural numbers and let $G$ be an arbitrary directed graph with vertex set ${\mathbb N}$. We will say that two permutations, $\pi$ and $\rho$ of the first $n$ natural numbers are
$G$--{\em different} if there is an $i \in [n]$ such that the ordered couple
of its images under these two permutations satisfies $(\pi(i), \rho(i)) \in E(G).$
We write $N(G, n)$ for the largest cardinality of a set of pairwise $G$--different permutations of $[n]$.
It is easy to see (cf. \cite{KMS} for the analogous statement for undirected graphs) that
$N(G, n)$ is supermultiplicative in $n$ for any fixed $G$, and thus
the expression $\frac{1}{n} \log N(G,n)$ has a limit, even though its value is not always finite.
We denote by $R(G)$ the always existing limit
$$R(G)=\lim_{n \rightarrow \infty} \frac{1}{n} \log N(G,n)$$
and call it the {\it permutation capacity} of $G.$
All this is in perfect analogy with the undirected case. In fact, our present concepts
are formal generalizations of what has been introduced in previous work, mainly
in \cite{KMS} and \cite{KSS}, for undirected graphs. As it is well--known and easily seen, any undirected graph $F$
can be formally identified with the {\it symmetrically directed graph} $G_F$ on the same vertex set for which $(a,b)\in E(G_F)$ if and only if $\{a,b\}\in E(F).$
Here and in the sequel all the logarithms are to the base 2.
We observe that
\begin{lem}\label{lem:chro}
$$R(G)\leq \log \chi(G)$$
where $\chi(G)$ is the chromatic number of the undirected graph underlying $G$.
\end{lem}

{\noindent \bf Proof. }

Clearly, if for two digraphs $G_1$ and $G_2$ on the same vertex set ${\mathbb N}$ we have
$E(G_1)\subseteq E(G_2)$ then $R(G_1)\leq R(G_2).$
This implies that $R(G)\leq R(G')$ where $G'$ is the digraph having two, oppositely
oriented edges for every edge of $G.$ We observe that, by definition,  $R(G')$ is equal to the permutation capacity of the undirected graph underlying  $G'.$ The rest follows by applying to this undirected graph (the fairly obvious) Proposition 4 from \cite{KSS}.
\hfill$\Box$

We will concentrate on the various digraphs whose underlying undirected graph is the infinite path $L.$ In this graph
every pair of consecutive integers is adjacent. By the foregoing, all the directed graphs
defined on $L$ have capacity at most 1.
(The classical Shannon capacity of an infinite graph is not usually defined even though it makes perfect sense and just as in the finite case is trivial to determine if the graph in question has, as in our present case, coinciding clique number and chromatic number.)
Obviously, the maximum of these capacities
is achieved by the {\it symmetric path} $L_{sym}$ whose edge set contains two oppositely oriented edges for every edge of $L.$ It was shown in \cite{KMS} that the
permutation capacity of this symmetric graph is at least $\log\sqrt[4]{10}.$ (This bound was further strengthened by Brightwell and Fairthorne \cite{BF}).
No non--trivial upper bound for $R(L_{sym})$ is known. In \cite{KM} the trivial upper bound 1 was conjectured to be tight.

New interesting questions arise if we concentrate on {\it oriented path}s in which every couple of vertices gives rise to at most one oriented edge. Let ${\cal L}$ denote the infinite family of all the oriented paths so obtained.
Our main result is the following inequality:
$$\frac{1}{2}< \inf_{G \in {\cal L}} R(G)$$

We are especially interested in
two simple oriented paths defined for $L.$ We will denote by $L_c$ the digraph in which every edge of $L$ is oriented from its smaller vertex to the larger one and call it the
{\it thrupath}. Similarly, we will denote by $L_a$ the {\it alternating path} in which every
edge is oriented from its odd vertex towards its even vertex.
We will prove in this paper that  $N(L_a, n)$ growths with $n$ as a standard Fibonacci sequence while $N(L_c, n)$ exhibits the same growth rate in an asymptotic sense.

\section{Diverse capacities}

The study of the Sperner capacity of digraphs was prompted by an interest in solving a famous problem of R\'enyi about the largest cardinality of a family of pairwise qualitatively independent $k$--partitions of an $n$--set.  For this purpose, Simonyi and the third author initially proposed to study a concept of
capacity for undirected graphs \cite{KS} that later turned out to be reducible to the subsequent more subtle concept of Sperner capacity, \cite{GGKV}, \cite{Cfive}. This concept seems however less tractable and more intriguing in case of the permutation capacity of infinite graphs.

\begin{defi}\label{defi:ks}
Let $G$ be an undirected graph with vertex set ${\mathbb N}$. We will say that the permutations $\pi$ and
$\rho$ of $[n]$ are {\it robustly $G$--different} if there are two elements $i\in [n]$ and $j \in [n]$
such that $(\pi(i), \rho(i))=(\rho(j), \pi(j))$ and $\{\pi(i), \rho(i)\} \in E(G).$

Let $NN(G, n)$ be the maximum cardinality of a set of pairwise robustly $G$--different permutations of
$[n].$ We call the limit
$$RR(G)=\lim_{n \rightarrow \infty} \frac{1}{n} \log NN(G,n)$$
the robust permutation capacity of $G.$
\end{defi}

It is interesting to relate this quantity to the infimum $R_{min}(L)$ of the
permutation capacities of all the digraphs obtained from $L.$ One might conjecture that, as in the case of the finite family of oriented versions of a finite simple graph, this
infimum equals the robust permutation capacity of $L.$
It is very easy to see (but we will return to this) that

$$RR(L)\geq \frac{1}{2}$$

We conjecture this lower bound to be tight.
If true, this conjecture, when compared to our Theorem \ref{thm:one} below,  would imply that the main theorem of \cite{GGKV} does not generalize to infinite families of graphs.

We consider analogous problems for other digraphs on ${\mathbb N}$ including infinite tournaments. In case the corresponding capacity is infinite, we ask more refined
questions about the rate of asymptotic growth of $N(G,n).$

\section{Constructions}

To begin, we will study the particularly simple case of the alternating path.
Consider the standard Fibonacci sequence $f(1)=1,$ $f(2)=2$, $f(n)=f(n-1)+f(n-2).$ We claim

\begin{prop}\label{prop:fib}
$$N(L_a, n)\geq f(n)$$
\end{prop}

{\noindent \bf Proof. }
Let $\sigma_i$ be the transposition $(i, i+1).$ Then for every set $F\subseteq [n-1]$ of natural numbers
not containing consecutive elements consider the following product of
transpositions
$$\sigma_F=:\prod_{i \in F} \sigma_i$$  (As all these transpositions commute, the product is well--defined.) We claim that as
$F$ runs over all the subsets of $[n-1]$ without consecutive elements, the permutations so obtained give the desired construction.

In what follows we will call a subset of ${\mathbb N}$ {\it loose} if it does not contain two consecutive integers.
Let $E$ and $F$ be two different loose subsets of $[n-1]$ and let $i$ be the smallest integer in  $[n]$
contained in exactly one of the two. Without loss of generality, suppose that $i \in E$, $i \not \in F.$
Then $i-1$ is not contained in any of the two sets.
This means that
$\sigma_F(i)=i$ while $\sigma_E(i)=i+1.$
Suppose for a moment that $i$ is odd.  This implies that
$$(\sigma_F(i), \sigma_E(i)) \in E(L_a).$$
In particular, note that in the two different linear orderings of $[n]$ the different permutations
$\sigma_F$ and $\sigma_E$ define, the subsets of $[n]$ determined by the positions of the even (odd) integers in $[n]$ are different.
This means that necessarily, for some other value $j \in [n]$ the previous relation has to be "reversed" at least in the sense that $\sigma_F(j)$ is even and $\sigma_E(j)$ is odd. On the other hand, since both of our permutations have the property that
$$|\sigma(i)-i|\leq 1$$
for every $i \in [n],$ we see that
$$|\sigma_F(j)-\sigma_E(j)|\leq 2.$$
Since we know that the two images of $j$ have different parity, we must conclude that
$$|\sigma_F(j)-\sigma_E(j)|=1$$
and thus
$$(\sigma_E(j), \sigma_F(j)) \in E(L_a).$$
This concludes the proof that our permutations differ in the required way under the hypothesis that the first position in which $E$ and $F$ differ is
odd. Clearly, if that position is even, the same proof can be applied exchanging odd and even in the above.

Finally, note that the number of loose subsets of $[n-1]$ (which is also the cardinality of our construction),  is exactly $f(n).$
\hfill$\Box$

We conjecture that the alternating path yields the maximum of the permutation capacities of the
digraphs in ${\cal L}.$
For the thrupath we have a similar construction, yielding a slightly weaker lower bound.
\begin{prop}\label{prop:thru}

Let $L_c$ denote the thrupath. Then
$$N(L_c,n)\geq \frac{f(n)}{n^3}$$
whence
$$R(L_c)\geq \log \frac{\sqrt{5}+1}{2}$$

\end{prop}

{\noindent \bf Proof. }

Let $L_c$ be the oriented graph obtained from the infinite path by orienting its edges from their smaller endpoint to the greater one. Fix an arbitrary natural number
$n \in {\mathbb N}.$ Our construction has the same starting point as the one in the previous proposition. For any loose subset $F$ of $[n-1]$ we will consider the permutation $\sigma_F$ defined there. To each of these permutations we will associate the couple of values of two functionals we define next.

Let $F:=\{f_1, f_2,\dots, f_k\}$ be an arbitrary loose subset of $[n-1]$ where $k=|F|.$
We define
$$\lambda(F):=|F| \quad
\hbox{and}
\quad \mu(F):=\sum_{i \in F}i.$$
These functionals have relatively small ranges as $F$ varies in $[n-1].$ In fact, $\lambda$ has at most $n$ different values, while the range of $\mu$ has less than $n^2$ elements.
Thus the couple of these functionals, considered as a single functional, has a range of less than $n^3$ elements.
Now let us look at the partition of the family of loose subsets of $[n-1]$ generated by the full inverse images of the various values of the last functional.
By the foregoing, this partition has at most $n^3$ different classes. Hence there exists at least one class ${\cal C}$
whose cardinality gives
$$|{\cal C}|\geq \frac{f(n)}{n^3}.$$
Note that every set $F \in {\cal C}$ has the same cardinality. Let $k$ be this common cardinality.

We claim that the permutations associated by our construction to the member sets of ${\cal C}$ are pairwise
$L_c$-different. In order to see this, let us consider two different sets, $E$ and $F$ from ${\cal C}$ and write
$$E:=\{e_1, e_2, \dots, e_k\} \quad \hbox{and} \quad F:=\{f_1, f_2,\dots, f_k\}.$$ Let $j$ be the first
index for which $e_j \not= f_j.$ Without loss of generality we can suppose that $e_j<f_j.$ This means for the corresponding permutations that
$\sigma_E(e_j)=e_j+1$ while $\sigma_F(e_j)=e_j,$ whence
$$(\sigma_F(e_j), \sigma_E(e_j))\in E(L_c).$$
Now, by our construction
$$\sum_{i=1}^ke_i=\sum_{i=1}^kf_i.$$
This implies that there is an index $i$ for which $e_i>f_i.$ Let $\l$ denote the first such index.
It is easy to see that we have
$\sigma_F(f_i)=f_i+1,$ while at the same time $\sigma_E(f_i)=f_i.$ The latter is implied by the
fact that $f_i-1 \not \in F$ (since $F$ is loose) and thus $f_i-1 \not \in E.$ This gives
$$(\sigma_E(f_i), \sigma_F(f_i))\in E(L_c).$$

\hfill$\Box$

To conclude this section, we will concentrate on the robust permutation capacity of $L.$

\begin{lem}\label{lem:rob}

For the infinite path $L$ we have
$$NN(L, n)\geq 2^{\lfloor {n \over 2} \rfloor}$$
implying
$$RR(L)\geq \frac{1}{2}$$
\end{lem}

{\noindent \bf Proof. }

Let ${\cal F}$ run through the subsets of the odd elements of $[n-1].$ Clearly
$|{\cal F}|=2^{\lfloor {n \over 2} \rfloor}.$
On the other hand, consider any two sets from ${\cal F}.$ Let these be $E$ and $F$ and let
$j$ be the first element contained in only one of them, say $j\in E-F.$ Then, as before,
we have for the corresponding permutations
$$\sigma_E(j)=j+1, \quad \sigma_E(j+1)=j \quad \hbox{while}
\quad \sigma_F(j)=j, \quad \sigma_F(j+1)=j+1.$$

\hfill$\Box$

It seems very interesting to establish whether this lower bound is tight, especially in the light
of our main result, concerning the infimum of the permutation capacities of the digraphs
from ${\cal L}.$

\begin{thm}\label{thm:one}
$$\inf_{G\in {\cal L}}R(G)\geq \frac{\log 3}{3}>\frac{1}{2}.$$
\end{thm}

{\noindent \bf Proof. }

We define the digraph  $B=\{V(G), E(G)\}$ as follows. The vertices of $B$ are
$V(B):=\{a,b, c\}$ and the edges are
$E(B):=\{(a,c), (c,a), (b,c), (c,b), (a,b)\}.$ In other words, $B$ is obtained from the symmmetric
clique on 3 vertices by omitting a single edge. We denote by $\omega_s(B^n)$
the cardinality of the largest symmetric clique in the $n$'th conormal power of $B^n.$
It is well-known and easily seen (cf. \cite{GKV}) that
\begin{equation}\label{eq:spe}
\omega_s(B^n)\geq \frac{3^n}{2n+1}
\end{equation}
for every $n \in {\mathbb N}.$

Let us now take a closer look at an arbitrary but fixed digraph $G \in {\cal L}.$
For this purpose, we consider, for every $n \in {\mathbb N}$ another digraph, $G_n$, whose vertex set is the set of permutations of $[n]$ and in which there is an edge  $(\rho, \sigma)$ pointing from the permutation
$\rho$ to $\sigma$ if there is a number $j \in [n]$ such that $(\rho(j), \sigma(j)) \in E(G).$
Clearly, we have
$$N(G,n)=\omega_s(G_n).$$
We would like to show that
\begin{equation}\label{eq:main}
\limsup_{n \rightarrow \infty} \frac{1}{n}\log\omega_s(G_n)\geq \frac{\log 3}{3}
\end{equation}
This, however, will immediately follow from (\ref{eq:spe}) if we show that
for every $n\in {\mathbb N}$ the graph $G_{3n}$ contains a subgraph isomorphic to $B^n.$
Here is how we achieve this objective. Consider first the vertices $\{1,2,3\}$ of our graph $G$
and identify the vertex set $V(B)$ of the digraph $B$ with permutations of
$[3]=\{1,2,3\}$ as follows:
$$c:=(1,2,3),$$
and
 $$\quad a:=(1,3,2), \quad b:=(2,1,3) \quad \hbox{if both}  \quad
(1,2) \in E(G)\quad \hbox{and} \quad (2,3) \in E(G)$$
while in the opposite case exchange the role of $a$ and $b$ by setting
$a:=(2,1,3)$ and $b:=(1,3,2).$
This procedure can be extended in the same way to any consecutive disjoint interval.
More precisely, let us consider the vertex set ${\mathbb N}$ of $G$ as the disjoint union of the
"intervals"
${\mathbb N}=\bigcup_{t=0}^{\infty}\{3t+1, 3t+2, 3t+3\}$ and for every $t$ let us define the graph
$B_t$ with vertex set
$$c_t:=(3t+1, 3t+2, 3t+3),$$
and
$$ a_t:=(3t+1, 3t+3, 3t+2), \quad b_t:=(3t+2, 3t+1, 3t+3)$$
if both
$$(3t+1, 3t+2) \in E(G) \quad \hbox{and} \quad  (3t+2, 3t+3) \in E(G),$$
while in the remaining cases we define
$$a_t:=(3t+2, 3t+1, 3t+3) \quad \hbox{and} \quad b_t:=(3t+1, 3t+3, 3t+2).$$
It is then clear that $B^n$ is isomorphic to the co--normal product of the graphs
$B_t$ whence
$$B^n\cong \bigotimes_{t=0}^{n-1}B_t\subseteq G_{3n}$$
and in virtue of (\ref{eq:spe}) this implies
$$\omega_s(G_{3n}) \geq \frac{3^n}{2n+1},$$
thereby completing our proof.

\hfill$\Box$

\par\noindent{\bf Remark}
\medskip

This statement is interesting because it cuts away the infimum of the permutation capacities for the family of graphs ${\cal L}$ from the conjectured robust capacity of the underlying path graph.Using our proof technique above, G\'abor Simonyi \cite{GS}
has improved our lower bound to $\frac{\log 5}{4}.$ It is unlikely that even this
new bound be tight. Simonyi's improvement is based on the observation that
if one uses permutations of $[4]=\{1,2,3,4\}$ instead of those of $[3]=\{1,2,3\}$ then we can define, in the role of $B,$ a digraph whose vertices are the 5 permutations from our corresponding Fibonacci construction in the proof of Proposition \ref{prop:fib}. It is easy to see that this graph contains a transitively oriented clique containing all of its vertices.
We leave the details of the proof to the reader.
\section{Tournaments}
We would like to comment briefly on the apparently much simpler case of the family of all oriented
versions of the infinite complete graph $K$ with vertex set ${\mathbb N}.$ Let us indeed  look at the family
${\cal K}$ of all the oriented graphs resulting from the different orientations of the edges of $K.$
In this case it is obvious that
$N(F,n)$ takes its maximum value in ${\cal K}$ on the digraph $F \in {\cal K}$ only in case  the digraph induced
by $F$ on $[n]$
is transitive. Surprisingly, it is considerably less obvious on which graph the minimum
value is taken. One might conjecture, however, that if $n$ is a power of 3, $n=3^t,$ say, then this graph is the $t'$s lexicographic power of the so--called cyclic triangle. More precisely, we call cyclic triangle  the graph $C$ whose vertices $\{1,2,3\}$ are oriented cyclically, from 1 to 2, from 2 to 3 and then from
3 to 1. Given a graph $C$, its $t$'th lexicographic power $C_{lexi}^{ t}$ is the graph with vertex set
$[V(C)]^t$ in which $({\bf v,  w}) \in E(C_{lexi}^{ t})$ if, denoting by $j$ the first coordinate in which the
strings ${\bf v}:=v_1, v_2, \dots, v_t$ and ${\bf w}:=w_1, w_2, \dots w_t$ differ, we have
$(v_j, w_j) \in E(C).$ It is well-known that this is the "most symmetric" tournament on $3^t$ vertices,
having the largest automorphism group among all the digraphs with the same set of vertices; (this is the celebrated Alspach-Dixon theorem,  \cite{A} and \cite{D}.)
At the same time, this graph has the maximum number of induced 3--element  subgraphs which are cyclic triangles. However, as it is well--known,
every tournament in which every vertex has the same out--degree and
in--degree, also has this same number of cyclic triangle subgraphs.

All the problems considered for simple graphs in \cite{KM}, \cite{KMS} and \cite{KSS} can be generalized
to directed graphs and we plan to return to the corresponding new questions in subsequent research. In particular, it seems especially interesting to investigate the functional corresponding to $\kappa$ from
\cite{KMS} in the case of finite digraphs.
\section{Acknowledgement}

We are grateful to  Blerina Sinaimeri and G\'abor Simonyi for sharing their ideas with us.

redpajama_set_name: RedPajamaArXiv


Please share this with everyone you know who recreates or vacations anywhere there are forests, water or watersheds -- i.e., to everyone you know!
South Dakotans, you'll want to read this one through -- trust me, please!
There are two very interesting maps on pages 30 and 31 of this 31-page .pdf file whose title is SOCIO-6: Forest-Based Outdoor Recreation.
The 1995 and 2000 Surveys on Recreation and the Environment (NSRE), conducted by the USDA Forest Service, have been used to paint a picture of "recreation demand pressure" that can and is being used to stop public access.
While these two particular surveys and the resultant maps "only" cover thirteen states, rest assured that other such surveys and maps exist for the other thirty-seven states.
The first carries the title of: Hotspots of recreation demand pressure on forests, 2000.
The second is dubbed: Hotspots of recreation demand pressure on water and watersheds, 2000.
The colors on the maps are identified by "recreation demand pressure" as being: Negligible, light, moderate, moderately heavy, and heavy.
These two maps are a "must" for all those who dare to exert "recreation demand pressure."
What activities constitute "recreation demand pressure," you ask? Better sit down -- I didn't make up this list. Your 'friendly' Forest Service did. There are 57 activities on it.
Gee, folks! What's left? I believe our 'friendly' Forest Service has just about covered all the bases under the heading, "Recreation Demand Pressure." Maybe we're really being targeted for cities and no fun activities outside, period. Not even photographing flowers, mind you! Not even "driving for pleasure" or "viewing" wildlife!
People are apparently being viewed as really ba-a-a-a-a-d for EVERYTHING.
On Page Two is this statement: "Recreation access to private land is increasingly limited to the owners themselves, their families or friends, or lessees. The number of ... private owners allowing the public to recreate on their land has been decreasing."
To my cynical mind, that is a direct slap in the face of private landowners, who have, by the way, every right to limit access to their private property.
This very issue is right now the cause of the SD (South Dakota) Lockout http://www.sdlockout.com and is being hotly debated/contested in the South Dakota Legislature -- as South Dakota Game, Fish & Parks http://www.sdgfp.info/Index.htm continues its assault on private property rights.
By use of the Open Fields Doctrine, SDGF&P continues to misinform the public.
Such statements as: " ... there still appears to be some confusing and erroneous information circulating about the Open Fields Doctrine and its relation to [SD GF&P] policy that places limits when their employees enter private lands to conduct compliance checks of hunters and anglers. The Open Fields Doctrine came about years ago through a series of decisions handed down by the United States Supreme Court. The Court upheld the principle that law enforcement officers, including Conservation Officers and other government agents, may enter privately owned open fields without permission, probable cause or a warrant in order to perform their duties as required by the law."
More information on the "Open Fields Doctrine:"
"What is the most important reason to get involved? Focus on benefits sought. More, faster, now seems to be the formula: all wanting more choice, more diversity, more value, more amenities, more enrichment…. and they want if faster! Used to be "man" versus "the mountain"…Now it is Mom, Dad, family, kids, friends, pets, etc. Everyone is going outdoors. 28% increase of people recreating outdoors monthly. Something for every generation: Healthy older adult population -- will flock to see you. The boomers are hitting prime travel years and expect the size of this population to increase and then drop. Look out those of you in the health care business -- this generation is self-absorbed!!! Gen X-Kids of boomers-appetite for extreme, Gen Y-replacing the greatest & matures, Gen Z-Most diverse generation ever. It is not about whom you look like -- it is about whom you don't look like. Each generation waiting for the other to retire so they can get promoted. Just wait for the future!"


We were not dissapointed either, race one was won by the Integra of Gareth Howell followed by Colin Turkington in the MG ZS. In race two it was the Integra of Gordon Shedden to take pole, with Gareth heading up the field in 6th place. The final race led to another win for Gareth Howell with Colin Turkington again finishing 2nd.
It was not enough to catch up with Matt Neal who took the championship with 289 points, however it was still a win for the Integra and although Jason Plato had a terrible time at Silverstone, he finished 2nd on 241 points. Gordon Shedden came 4th with 204 points and Gareth Howell ending up in 11th place overall after only entering in the 7th meeting with Team Dynamics 3rd Integra car.
Due to this being the last race it was packed, so getting into positions to take photos proved to be difficult, these were the best of a bad bunch.


text:
Read Next Can't Get to the Spa? These At-Home Back and Shoulder Massagers Deliver Rapid Relief
Home Music Music News
August 22, 2016 3:39PM ET
On the Charts: 'Suicide Squad' Reigns Again
Blockbuster's album joins exclusive club of post-2000 soundtracks to spend multiple weeks at Number One
Daniel Kreps
Daniel Kreps's Most Recent Stories
Duke Bootee, Rapper and Co-Writer of Hip-Hop Classic 'The Message,' Dead at 69
'Suicide Squad' remained atop both the box office and the Billboard 200 for a second straight week.
Clay Enos/DC Comics
Suicide Squad remained atop both the box office and the Billboard 200 for a second straight week as the antihero blockbuster's soundtrack – featuring new tracks by Twenty One Pilots, Grimes, Skrillex & Rick Ross, Lil Wayne, Wiz Khalifa & Imagine Dragons – sold an additional 92,000 total copies in its second week of release.
Like the film, which witnessed a huge decrease in ticket sales while maintaining its box office reign, the soundtrack also experienced a massive drop-off from its opening week of 182,000 copies. Of this week's 92,000 total, the soundtrack sold 50,000 traditional copies, with the remainder coming from streaming equivalent albums, or SEAs.
As Billboard notes, Suicide Squad is only the fourth motion picture soundtrack to spend multiple weeks at Number One since 2000, joining 2003's Bad Boys 2, 2013's Frozen and 2014's Guardians of the Galaxy. Still, Suicide Squad has a long way to go towards The Bodyguard's soundtrack record of 20 non-consecutive weeks in the top spot.
Drake's Views held strong at Number Two with 71,000 total copies, one spot ahead of his OVO Sound signees PartyNextDoor, whose PartyNextDoor 3 (P3) sold 50,000 to give that singer his best Billboard 200 debut. Country singer Justin Moore grabbed Number Four with his new LP Kinda Don't Care, which moved a total of 42,000 copies.
Only one more new release, Rae Sremmurd's Sremmlife 2, cracked the Top 10, with the young rappers taking Number Seven after selling 27,000 copies of their new LP. That's a significant drop from the album's 2015 predecessor, which debuted ay Number Five and sold 49,000 copies in its debut week.
Twenty One Pilots' Blurryface scored Number Five, DJ Khaled's Major Key slotted at Number Six, Adele's 25 hit Number Eight, Rihanna's Anti placed Number Nine and Now 59 closed out the Top 10.
Next week, Suicide Squad will have to fight off Frank Ocean's Blonde, which could technically grab Number One despite its Apple Music exclusivity.
In This Article: Rae Sremmurd,	Suicide Squad


Fire occurs every year in the wildlands surrounding our area. Learning to be firewise is important in preventing human caused wildfires. Learning about fire ecology teaches you about how fire is important to the forest landscape and how forest management influences fire ecology. This badge also includes campfire activities.


Bengaluru: Chief Minister H.D. Kumaraswamy announced waiver of all default crop loans benefiting farmers to the tune of Rs.34,000 crore in his Budget proposals presented in the Assembly this morning.
The size of the Budget is Rs. 2,13,734 crore and to balance the financial burden of the farm loan waiver, tariffs and taxes on petrol, diesel, electricity, liquor and private service vehicles have been increased.
The CM has proposed to increase the rate of tax on petrol from the present 30% to 32% and diesel from 19% to 21%. In effect, petrol price will be increased by Rs. 1.14 per litre and diesel by Rs. 1.12 per litre. Tax on liquor will go up by 4 percent and power tariff will be up by 20 paise per unit. There will be a 50% increase for private service vehicles based on square metre floor area the vehicle occupies.
Kumaraswamy said crop loans made up to December 31, 2017 would be waived off in the first stage. He said the loan amount would be restricted to Rs. 2 lakh. However, families of government officials and officials of the co-operative sector, farmers who have paid income tax for the past three years are ineligible for the farm loan waiver.
As an encouragement to non-defaulting farmers, the CM has decided to credit the repaid loan amount of Rs. 25,000 or whichever is less to each of the farmer's account.
Kumaraswamy presented the Budget at 11.30 am today, the date and time decided by his brother H.D. Revanna, who is a firm believer in astrology. This is the first budget of the newly formed Janata Dal (Secular) – Congress coalition government.
The Budget had been a topic of debate among the coalition members with former Chief Minister Siddharamaiah asking for a supplementary budget instead of a new one. Siddharamaiah had presented the budget in February this year.
Mandya Institute of Medical Sciences Hospital to be upgraded to 800-bed hospital.
Rs. 3 crore share capital to be provided to private companies who come forward to open 3-star hotels having 500 room facilities.
5 kg rice free of cost, 1/2 kg toor dal with subsidised rate and 1 kg palm oil, 1 kg iodine and iron content salt and 1kg sugar to each BPL card holder under Anna Bhagya.
Fearing a backlash for backing out of his pre poll audacity of a commitment to waive farmers loans worth a whopping 53000 crore Rupees Karnataka Chief Minister H.D.Kumaraswamy has hit the common people hard by hiking up fuel prices.Obviously he has eaten more grass than he can chew and is being guided more by the survival instinct to somehow retain the political power he has usurped colluding with the equally power hungry Congress party.


text:
Dairy Sector Current Affairs, GK & News
NCW Launches Training Program for Women in Dairy Farming
National Commission for Women (NCW) launched a nationwide training and capacity building programme for women in dairy farming. Key Facts To launch the training programme, NCW is collaborating with agricultural universities in India in order to identify and train women working in the field of dairy farming and allied activities in several like value addition, ..
Category: Economy & Banking Current Affairs - 2022 • Government Schemes Current Affairs
Topics: Dairy Farming • Dairy Industry • Dairy Sector • Financial Independence • National Commission for Women (NCW) • Women in Dairy Farming • women self-help groups (SHGs)
GoI launches Kisan Credit Card scheme for Dairy Farmers
On June 2, 2020, the Government of India launched Kisan Credit Card campaign to help dairy farmers. The Kisan Credit cards are to be provided to around 1.5 crore dairy farmers. Highlights Under the Scheme, the Government of India is to provide Kisan Credit Cards to farmers that are associated with milk producing companies. The ..
Topics: Atma Nirbhar Bharat Abhiyan • Cooperative Enterprise • COVID-19 • Dairy Sector • farmer welfare • Kisan Credit Card Scheme
Animal Protection Index: India ranks second
On March 12, 2020, Global Animal Protection Index 2020 was released by World Animal Protection, an international animal welfare charity. India was ranked second in the index. Highlights The Animal Protection Index ranks countries from A to G. India was ranked along with Spain, Mexico, France and New Zealand. In other words, these countries were ..
Category: Reports & Indexes Current Affairs
Topics: Animal husbandry • Animal protection • Animal welfare • Animal-free drug testing • Conservation • Dairy Sector • Prevention of Cruelty to Animals Act 1960
Milk Price Rise in India
On December 14, 2019, Gujarat Cooperative Milk Marketing Federation (Amul) and Mother Dairy (owned by National Diary Development Board) increased MRP (Maximum Retail Prices) of their pouched milk by Rs 2 per litre. Why the price rise? The two main reasons behind the price hike is partly structural and partly weather related. The months between ..
Month: Current Affairs - December, 2019
Category: Economy & Banking Current Affairs - 2022
Topics: Dairy Industry • Dairy Sector • Milk • milk production • National Dairy Development Board
Government launches Dairy Processing & Infrastructure Development Fund Scheme
Union Ministry of Agriculture & Farmers Welfare has launched Dairy Processing & Infrastructure Development Fund (DIDF) Scheme with an outlay of Rs. 10881 crore. Under this fund, first installment of Rs. 440 crore was given to National Dairy Development Board (NDDB). Dairy Processing & Infrastructure Development Fund (DIDF) Scheme This scheme was approved by Cabinet ..
Topics: Dairy Processing and Infrastructure Development Fund • Dairy Sector • Government Schemes • Ministry of Agriculture and Farmer's Welfare • National • National Dairy Development Board
NDDB wins special achievement in GIS Award
The Esri Special Achievement in GIS Award 2015 for exemplary work in Dairy Geographical Information System (GIS) has been awarded to the National Dairy Development Board (NDDB) at the annual Esri International User Conference held in San Diego. The NDDB was awarded for successful implementation of GIS applications in its dairy operations. NDDB has internet-based ..
Month: Current Affairs - August, 2015
Topics: Awards • Dairy Sector • GIS • NDDB


Few people can claim to have furnished a significant museum with more than 2,200 works of art from around the world. But then few people can trace their genes to Muncie's Ball family, whose philanthropic legacy gave birth to both the museum and the university where it's located.
David T. Owsley's diverse gifts to the David Owsley Museum of Art at Ball State University have included works representing the Americas, Europe, Africa, China, India, Japan, southeast Asia, and the Pacific islands. He recently gave the museum an important painting by American abstract expressionist Lee Krasner.
Owsley is the son of Alvin and Lucy Ball Owsley and the grandson of Frank C. Ball, one of the five New York brothers who moved their glass container business to Muncie and donated the land on which Ball State was founded in 1918. Frank Ball was instrumental in the construction of the David Owsley Museum of Art at Ball State University in the 1930s. Over the decades, the Ball family has given or loaned more than 4,500 works of art to the museum.
Owsley's contributions reflect his broad expertise in art collection, research, preservation, and education. He has been a curator at the Metropolitan Museum of Art in New York, Museum of Fine Arts in Boston, Victoria and Albert Museum in London, and Carnegie Institute Museum of Art in Pittsburgh.
Recognizing his generosity, Ball State dedicated the David T. Owsley Ethnographic Gallery in 1978 and awarded him the President's Medal of Distinction in 1989 and an honorary doctor of humanities in 2005.
David Owsley, 2018 from David Owsley Museum of Art.


Take a swim in one of our 4 dams and enjoy life the way we used to as kids, before modern times and technology. Bring out the Kid in you.
Experience nature first hand with Family, friends, colleagues or team mates on one of our nature trails. From easy to extreme, you will get the opportunity to experience and enjoy the panoramic views of the Waterberg mountain range and Alma plains.


Samsung Galaxy Nexus release date slips past the 21st of November in the UK and Europe?
There's a lot of anticipation for the release of the Samsung Galaxy Nexus and that is no small part because it will be the first smartphone to run Android 4.0 Ice Cream Sandwich — you might want check out our guide of what ICS has to offer.
Preorders are hotting up for this device – however distribution is stating delivery of this highly anticipated device has moved to week commencing 21st November. This will unfortunately effect all UK retailers.
07/11 Update: Having many questions regarding the release date and first batch allocation. As usual Handtec have a large backorder with Samsung and we expect to fulfill all backorders upon release. Some retailers may still be showing dates of 7th or 17th etc but the above information is directly from Samsung distribution.
We are not sure if this will also affect European distribution in general or if this a UK delay only. Mind you that Amazon UK now has a December 2 release date on its website.
For the US, there have been a number of rumors based on leaked Verizon roadmaps, with the launch date slipping from the 11th to 17th and now to the 21st for web orders only.
Samsung did make a note during their joint Google event that the Galaxy Nexus is set to ship to the UK and Europe first with the US following shortly after.
While you wait on any new official word, why not check out our comparison between the trio of Android big guns and the world's first quad-core smartphone that you'll be lusting after next year.
15-Nov UPDATE: Another UK smartphone retailer, Clove, has just announced on its blog that it's expecting first stock of the Galaxy Nexus on Wednesday 23rd of November.


easily on the Google New Accounts page.
Just be sure to remember your password and Gmail address.
tab on the lower right. Begin by reflecting on all the different counties in the world to which you can trace ties from your community. You will see the new title and description you wrote on the upper left of the map. or the middle mouse key) to scale the map so that you can see all the countries in the world to which your community is tied. 7) Now you are ready to start making your map. 4) Click on the upper left where it says "untitled map" and a new input box will appear. Once you have done this. A map showing some of the sites of Seattle that land-mark global ties) 6) Click on save and return to the map. . Creating your map 3) Now try creating a map of your own by clicking the 'Create a new map' button itself. Matt Sparke's Global Seattle) 5) Now also fill in the description box to give a more detailed description of your map (e. click on the map itself and use the scale tool (+/.g.g.B. Input a short catchy title that links your name with that of the community you want to map (e.
One way to identify some possibilities is to go back to a regular google maps display.C. zoom in on your community. just click on place marker icon in the bar: 10) Then for each place-marker write in: .  Then write down your list: For example… i) Pike Place Market – global tourist icon and commercial tie to global supply chains ii) Seattle Center – world's fair center turned 1999 base for global justice protesters iii) Gates Foundation HQ – center for global humanitarian projects iv) Amazon HQ – global management center for the corporation v) UW Department of Global Health – center for research and teaching on global health 9) Once you have your list of places to mark on your map you can start adding them back in google my maps. But you might also want to identify some local government and nongovernment agencies. and type the word 'global' into the search box in the upper left hand corner like this. The commercial connections of shops and restaurants are easy examples to pick. To do this. To do this. or institutions such as universities and colleges with non-market ties to global affairs. Adding and Editing Features to your Map Place markers 8) Now you need to add place markers to show the 5 sites in your community that seem to you to land-mark global ties in the most obvious ways. begin by creating a list of sites for selection.
click SAVE (you can always return and edit it later. just double click on the last circle in the line you have just drawn. To do this. and "More Icons". "Individual styles" will allow you to customize each map marker—Select "Individual Styles".a) A title for the place marker (that will also show up at the top of the menu of all the place-markers you create on the left side of the screen). you can start to add their global ties to your map. and then click the cancel button and trash-can icon. and URL links to other websites) c) Once you have entered a title and description. Select "More Icons" and either use one of the options available there or find an image of your own to use as an icon by simply doing an image search and getting the url to add. Click on the line icon and this will allow you to start adding lines to your map that depict key sourcing ties. If you want to delete a line altogether just click on it until you get into edit mode again (sometimes this is tricky if the scale of the map is too small). movies.g. To turn off line drawing. b) A description of the place and its global ties (into which you can include photos. You can also edit the width of each line which may be useful if you are scaled way out on the map. and any place markers you don't like can be deleted easily by clicking the garbage can icon instead of save) 11) For each place-marker you can also now edit the marker icon itself to add a customized icon from the menu or from a web url-accessed image file. 13) Now that you have located your local places. "Icon Shape". green lines for financial ties. Line colors can be changed in the same way that you changed the first icon in the box on the left. A drop-box will appear offering several different options for the icons you use. 12) From here. red lines for trade ties. blue lines for humanitarian ties and so on). just click on the paint-bucket icon in the list of place-markers on the left side of the map underneath the "Style" tab. you will have the option to select "Color". . Try to use different line colors for different sorts of tie (e. The icon description will change from "All Items to the title you gave the first marker. Hover your mouse over the name of the marker and click the paint icon that appears. Play around with this tool a little and you will see that you can easily create both straight lines and jagged lines.
you can return and edit the description. carbon footprints) that are both distance-based and politically significant. or line. Each line and description you add will become a clickable feature on the final map. add as many as you want to map all the crucial global ties that you have discovered in your research of your community. marker. title.g. if not. click on the camera icon: A very convenient feature is that you can search for images and videos to link to your map directly from the map engine. or. and any user that clicks the line will open up a box with the description and its embedded links and photos. click on "SELECT": . and color of the line anytime. With the editing option on (the pencil when you click on the marker). Again. These are useful for communicating details about how your local connected globally. you can delete it. places are Click SAVE when you are happy with the description box. it also re-saves the entire map Photo and Video Links 15) Remember you can also add images or video links to your icons and lines. This is a good feature to note or use if you are addressing 'food miles' or other similar sorts of supply chain metrics (e.Each line needs a title and description too. 14) Now that you know how to add lines that show global ties. After choosing a picture (note that you can scroll down for more options). Note that each time you save a title. The line description boxes also automatically calculate the physical distance of the line.
Once the line is editable. so you don't have to worry about your map getting too cluttered. select the line in the map or from the list on the side menu and edit (click the pencil icon). To fix this. click Save. scroll over end points of the line until you see a white square. click "SAVE" on the description Now when viewers click on the icon. you may find that their end points are not accurately located when you zoom into the neighborhood scale of a city or region. 16) After reviewing your lines with the editing off. the image will not show up unless the particular marker is selected. . You can also link videos.Once you box. You may have to play with the scale of the map a few times until you can move the lines' end points to the correct locations. then drag this square to a more accurate location. Once you are happy with all the lines. you return to the map page. appear. the image will Note that the image won't appear unless have the icon or line selected. Again.
take some screen shots to use as figures in your 'Globalization and Me' research essay. you can provide a title and description for any enclosed market regions you create this way. You will also need to change the privacy settings to at least "Anyone who has the link can view" so that your classmates and the instructor can view your map. If you so desire. . Just as with lines and place-markers. 20) To post your map to the class forums. you can create a line right around the local area. 19) Finally. 18) Once you are entirely happy with your map. Simply connect up all the points of a line together in a polygon and google sees it as a polygon which you can then color in. Using the shape tool. copy the link generated when you click on "Share". click on the "share" button near the top right of your map and use this to generate the URL you will use to share your map with the instructor and class. You can also edit their color and transparency. define and demarcate as a shape using the box on the left of the screen. you could also use this URL to embed the map in other websites including Facebook and/or any class site created for sharing the maps by your instructor. Then click Done.D) Finishing Up 17) A useful way to define finally the parameters of your local-but-global community is to use the shape tool to created a bounded polygon around the community on the map.
Your instructor may also suggest that you invite fellow classmates to collaborate on the mapping project. Now you are really done! Congratulations!!! . To do this at any point. just click the Collaborate button and add their emails.


text:
Q: error 'env' is not recognized as an internal or external command? I am new to node.js i have installed node.js and checked its working fine using commend npm -v , I tried to test it build open source poject from
github https://github.com/quran/quran.com-frontend

the command to run the project was
  npm run dev

I got this error
    C:\Users\Acer\Desktop\quran.com-frontend-master\quran.com-frontend-master>npm run dev

    > quran@1.0.0 dev C:\Users\Acer\Desktop\quran.com-frontend-master\quran.com-frontend-master
    > env NODE_PATH='./src' PORT=8000 UV_THREADPOOL_SIZE=100 node ./webpack/webpack-dev-server.js & env NODE_PATH='./src' PORT=8000 node ./bin/server.js

    'env' is not recognized as an internal or external command,
    operable program or batch file.
    'env' is not recognized as an internal or external command,
    operable program or batch file.

    npm ERR! Windows_NT 10.0.14393
    npm ERR! argv "C:\\Program Files\\nodejs\\node.exe" "C:\\Program Files\\nodejs\\node_modules\\npm\\bin\\npm-cli.js" "run" "dev"
    npm ERR! node v6.9.2
    npm ERR! npm  v3.10.9
    npm ERR! code ELIFECYCLE
    npm ERR! quran@1.0.0 dev: `env NODE_PATH='./src' PORT=8000 UV_THREADPOOL_SIZE=100 node ./webpack/webpack-dev-server.js & env NODE_PATH='./src' PORT=8000 node ./bin/server.js`
    npm ERR! Exit status 1
    npm ERR!
    npm ERR! Failed at the quran@1.0.0 dev script 'env NODE_PATH='./src' PORT=8000 UV_THREADPOOL_SIZE=100 node ./webpack/webpack-dev-server.js & env NODE_PATH='./src' PORT=8000 node ./bin/server.js'.
    npm ERR! Make sure you have the latest version of node.js and npm installed.
    npm ERR! If you do, this is most likely a problem with the quran package,
    npm ERR! not with npm itself.
    npm ERR! Tell the author that this fails on your system:
    npm ERR!     env NODE_PATH='./src' PORT=8000 UV_THREADPOOL_SIZE=100 node ./webpack/webpack-dev-server.js & env NODE_PATH='./src' PORT=8000 node ./bin/server.js
    npm ERR! You can get information on how to open an issue for this project with:
    npm ERR!     npm bugs quran
    npm ERR! Or if that isn't available, you can get their info via:
    npm ERR!     npm owner ls quran
    npm ERR! There is likely additional logging output above.
    npm WARN Local package.json exists, but node_modules missing, did you mean to install?

    npm ERR! Please include the following file with any support request:
    npm ERR!     C:\Users\Acer\Desktop\quran.com-frontend-master\quran.com-frontend-master\npm-debug.log

A: On windows, the 'env' command it is NOT recognized by default; there I've found two options:

*

*Use another command instead, for instance:

    set VARIABLE_NAME=custom name

*Install cygwin and set it's installation path to the windows environment variables. After installing you can use from command line:

    env VARIABLE_NAME=custom name

Here is the link with details for cygwin installation: https://www.howtogeek.com/howto/41382/how-to-use-linux-commands-in-windows-with-cygwin/

A: You can use a linux terminal in windows (like git bash). If you use this one you can configure script shell on npm:
// for git bash
$ npm config set script-shell "C:\Program Files\git\bin\bash.exe"
// or
$ npm config set script-shell "C:\Program Files\git\bin\sh.exe"

For any other:
$ npm config set script-shell <Your favorite shell>

A: Nodejs and npm are different. npm(node package manager) is used to install dependencies of nodejs. The required dependencies for a server will be listed in package.json file.
Looks like there is an issue with env module. Try installing the dotenv module using npm
npm install dotenv --save

Before installing this module, update your npm using the command
npm update

A: I faced this while installing hardhat.
This problem is basically the npm trying to run a bash command
you can directly run the following command to change the default shell for the script
$ npm config set script-shell "C:\Program Files\git\bin\bash.exe"

redpajama_set_name: RedPajamaStackExchange


text:
namespace System.Runtime.InteropServices
{
    using System;
    using System.Security.Permissions;
    using System.Runtime.CompilerServices;
    using System.Threading;
    using System.Runtime.Versioning;
    using System.Diagnostics.Contracts;

    // These are the types of handles used by the EE.
    // IMPORTANT: These must match the definitions in ObjectHandle.h in the EE.
    // IMPORTANT: If new values are added to the enum the GCHandle::MaxHandleType
    //            constant must be updated.
    [Serializable]
    [System.Runtime.InteropServices.ComVisible(true)]
    public enum GCHandleType
    {
        Weak = 0,
        WeakTrackResurrection = 1,
        Normal = 2,
        Pinned = 3
    }

    // This class allows you to create an opaque, GC handle to any
    // COM+ object. A GC handle is used when an object reference must be
    // reachable from unmanaged memory.  There are 3 kinds of roots:
    // Normal - keeps the object from being collected.
    // Weak - allows object to be collected and handle contents will be zeroed.
    //          Weak references are zeroed before the finalizer runs, so if the
    //          object is resurrected in the finalizer the weak reference is
    //          still zeroed.
    // WeakTrackResurrection - Same as weak, but stays until after object is
    //          really gone.
    // Pinned - same as normal, but allows the address of the actual object
    //          to be taken.
    //

    [StructLayout(LayoutKind.Sequential)]
    [System.Runtime.InteropServices.ComVisible(true)]
    public struct GCHandle
    {
        // IMPORTANT: This must be kept in sync with the GCHandleType enum.
        private const GCHandleType MaxHandleType = GCHandleType.Pinned;

#if MDA_SUPPORTED
        [System.Security.SecuritySafeCritical]  // auto-generated
        static GCHandle()
        {
            s_probeIsActive = Mda.IsInvalidGCHandleCookieProbeEnabled();
            if (s_probeIsActive)
                s_cookieTable = new GCHandleCookieTable();
        }
#endif

        // Allocate a handle storing the object and the type.
        [System.Security.SecurityCritical]  // auto-generated
        internal GCHandle(Object value, GCHandleType type)
        {
            // Make sure the type parameter is within the valid range for the enum.
            if ((uint)type > (uint)MaxHandleType)
                throw new ArgumentOutOfRangeException(nameof(type), Environment.GetResourceString("ArgumentOutOfRange_Enum"));
            Contract.EndContractBlock();

            m_handle = InternalAlloc(value, type);

            // Record if the handle is pinned.
            if (type == GCHandleType.Pinned)
                SetIsPinned();
        }

        // Used in the conversion functions below.
        [System.Security.SecurityCritical]  // auto-generated
        internal GCHandle(IntPtr handle)
        {
            InternalCheckDomain(handle);
            m_handle = handle;
        }

        // Creates a new GC handle for an object.
        //
        // value - The object that the GC handle is created for.
        // type - The type of GC handle to create.
        //
        // returns a new GC handle that protects the object.
        [System.Security.SecurityCritical]  // auto-generated_required
        public static GCHandle Alloc(Object value)
        {
            return new GCHandle(value, GCHandleType.Normal);
        }

        [System.Security.SecurityCritical]  // auto-generated_required
        public static GCHandle Alloc(Object value, GCHandleType type)
        {
            return new GCHandle(value, type);
        }

        // Frees a GC handle.
        [System.Security.SecurityCritical]  // auto-generated_required
        public void Free()
        {
            // Copy the handle instance member to a local variable. This is required to prevent
            // race conditions releasing the handle.
            IntPtr handle = m_handle;

            // Free the handle if it hasn't already been freed.
            if (handle != IntPtr.Zero && Interlocked.CompareExchange(ref m_handle, IntPtr.Zero, handle) == handle)
            {
#if MDA_SUPPORTED
                // If this handle was passed out to unmanaged code, we need to remove it
                // from the cookie table.
                // NOTE: the entry in the cookie table must be released before the
                // internal handle is freed to prevent a race with reusing GC handles.
                if (s_probeIsActive)
                    s_cookieTable.RemoveHandleIfPresent(handle);
#endif

#if BIT64
                InternalFree((IntPtr)(((long)handle) & ~1L));
#else // BIT64 (32)
                InternalFree((IntPtr)(((int)handle) & ~1));
#endif
            }
            else
            {
                throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_HandleIsNotInitialized"));
            }
        }

        // Target property - allows getting / updating of the handle's referent.
        public Object Target
        {
            [System.Security.SecurityCritical]  // auto-generated_required
            get
            {
                // Check if the handle was never initialized or was freed.
                if (m_handle == IntPtr.Zero)
                    throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_HandleIsNotInitialized"));

                return InternalGet(GetHandleValue());
            }

            [System.Security.SecurityCritical]  // auto-generated_required
            set
            {
                // Check if the handle was never initialized or was freed.
                if (m_handle == IntPtr.Zero)
                    throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_HandleIsNotInitialized"));

                InternalSet(GetHandleValue(), value, IsPinned());
            }
        }

        // Retrieve the address of an object in a Pinned handle.  This throws
        // an exception if the handle is any type other than Pinned.
        [System.Security.SecurityCritical]  // auto-generated_required
        public IntPtr AddrOfPinnedObject()
        {
            // Check if the handle was not a pinned handle.
            if (!IsPinned())
            {
                // Check if the handle was never initialized for was freed.
                if (m_handle == IntPtr.Zero)
                    throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_HandleIsNotInitialized"));

                // You can only get the address of pinned handles.
                throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_HandleIsNotPinned"));
            }

            // Get the address.
            return InternalAddrOfPinnedObject(GetHandleValue());
        }

        // Determine whether this handle has been allocated or not.
        public bool IsAllocated
        {
            get
            {
                return m_handle != IntPtr.Zero;
            }
        }

        // Used to create a GCHandle from an int.  This is intended to
        // be used with the reverse conversion.
        [System.Security.SecurityCritical]  // auto-generated_required
        public static explicit operator GCHandle(IntPtr value)
        {
            return FromIntPtr(value);
        }

        [System.Security.SecurityCritical]  // auto-generated_required
        public static GCHandle FromIntPtr(IntPtr value)
        {
            if (value == IntPtr.Zero)
                throw new InvalidOperationException(Environment.GetResourceString("InvalidOperation_HandleIsNotInitialized"));
            Contract.EndContractBlock();

            IntPtr handle = value;

#if MDA_SUPPORTED
            if (s_probeIsActive)
            {
                // Make sure this cookie matches up with a GCHandle we've passed out a cookie for.
                handle = s_cookieTable.GetHandle(value);
                if (IntPtr.Zero == handle)
                {
                    // Fire an MDA if we were unable to retrieve the GCHandle.
                    Mda.FireInvalidGCHandleCookieProbe(value);
                    return new GCHandle(IntPtr.Zero);
                }
            }
#endif

            return new GCHandle(handle);
        }

        // Used to get the internal integer representation of the handle out.
        public static explicit operator IntPtr(GCHandle value)
        {
            return ToIntPtr(value);
        }

        public static IntPtr ToIntPtr(GCHandle value)
        {
#if MDA_SUPPORTED
            if (s_probeIsActive)
            {
                // Remember that we passed this GCHandle out by storing the cookie we returned so we
                //  can later validate.
                return s_cookieTable.FindOrAddHandle(value.m_handle);
            }
#endif
            return value.m_handle;
        }

        public override int GetHashCode()
        {
            return m_handle.GetHashCode();
        }

        public override bool Equals(Object o)
        {
            GCHandle hnd;

            // Check that o is a GCHandle first
            if(o == null || !(o is GCHandle))
                return false;
            else
                hnd = (GCHandle) o;

            return m_handle == hnd.m_handle;
        }

        public static bool operator ==(GCHandle a, GCHandle b)
        {
            return a.m_handle == b.m_handle;
        }

        public static bool operator !=(GCHandle a, GCHandle b)
        {
            return a.m_handle != b.m_handle;
        }

        internal IntPtr GetHandleValue()
        {
#if BIT64
            return new IntPtr(((long)m_handle) & ~1L);
#else // !BIT64 (32)
            return new IntPtr(((int)m_handle) & ~1);
#endif
        }

        internal bool IsPinned()
        {
#if BIT64
            return (((long)m_handle) & 1) != 0;
#else // !BIT64 (32)
            return (((int)m_handle) & 1) != 0;
#endif
        }

        internal void SetIsPinned()
        {
#if BIT64
            m_handle = new IntPtr(((long)m_handle) | 1L);
#else // !BIT64 (32)
            m_handle = new IntPtr(((int)m_handle) | 1);
#endif
        }

        // Internal native calls that this implementation uses.
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern IntPtr InternalAlloc(Object value, GCHandleType type);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern void InternalFree(IntPtr handle);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern Object InternalGet(IntPtr handle);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern void InternalSet(IntPtr handle, Object value, bool isPinned);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern Object InternalCompareExchange(IntPtr handle, Object value, Object oldValue, bool isPinned);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern IntPtr InternalAddrOfPinnedObject(IntPtr handle);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern void InternalCheckDomain(IntPtr handle);
        [System.Security.SecurityCritical]  // auto-generated
        [MethodImplAttribute(MethodImplOptions.InternalCall)]
        internal static extern GCHandleType InternalGetHandleType(IntPtr handle);

        // The actual integer handle value that the EE uses internally.
        private IntPtr m_handle;

#if MDA_SUPPORTED
        // The GCHandle cookie table.
        static private volatile GCHandleCookieTable s_cookieTable = null;
        static private volatile bool s_probeIsActive = false;
#endif
    }
}

redpajama_set_name: RedPajamaGithub


Cognizant Technology Solutions will be conducting a Joint Campus Placement drive for recruitment of fresh Engineering Graduates/Post Graduates & MCA passout from 2012/2013 batch for the software development work in the company.
Posted in Apply online, Computer Science, Electrical and Electronics, Electronics and Communication, Electronics and Instrumentation, Electronics and Telecommunication, Freshers, IC, IT, Jobs after ME/ MTECH, Joint Campus Placement Drive, MCA, ME, Mtech, Off campus recruitment, Software Engineering, Without Experience. Tags: 6 February 2014, BE/Btech, chandigarh, Cognizant Joint Campus Drive, Cognizant Technology Solutions, MCA freshers, ME/MTech on January 24, 2014 by Lalit Joshi.


FORT KENT, Maine – GoldenOak, an emerging sound in New England folk music, will perform at the University of Maine at Fort Kent's Foundation fall event on Saturday, October 13, 2018 at 7 p.m. in the Fox Auditorium on the UMFK campus.
As GoldenOak evolves and pushes boundaries, they continue to sow seeds in a rich folk tradition.
In 2017, GoldenOak released "Foxgloves," a six- track EP that built on Zak and Lena's folk roots with a remarkable orchestral approach. The band kicked-off their Foxgloves release tour with a sold out show at Portland's One Longfellow Square, and in December, Foxgloves was voted "EP of the Year" by the Portland Music Awards.
Please join us for an evening of great music. Tickets to the performance are $10 per person. You may purchase tickets through the UMFK Development Office, located at the Madawaska House, at 834-7800, or at the door on the evening of the performance.
All proceeds at the UMFK Foundation will remain here at UMFK to support endowed scholarships, cultural events, and special projects.


This item has been shown 3049 times.
If there was one graphic which represented the spirit of the Revolutionary War it would have to be the ubiquitous segmented snake with the famous "Unite Or Die" caption. The engraving, a prominent device in the masthead of this newspaper, shows a snake cut into various pieces, each with a label of a colony with the implied message that only by each of the separate colonies uniting under a single cause could the country--the snake--hope to strike back & be successful in defeating the British.
Ben Franklin is credited with creating this device, considered the very first political cartoon when he used it in his Pennsylvania Gazette in 1754 to rally the colonies to unite during the advent of the French & Indian War. It would become a symbol of colonial freedom during the Revolutionary War. This engraving is found in most history books, but very rarely is such an edition of the Pennsylvania Journal found & offered to the collector market.
Over half of the first column is a very critical, yet supportive, letter: "To General Gage" which has much interesting content, a few bits including: "The whole of your proceedings are so repleat with folly...your late answer to the address of the Provincial Congress of Massachusetts Bay taught me that you are a more proper object for ridicule...you have apologised for constructing what has been unjustly called a fortress on the Boston Neck. The same factious spirit which leads the Bostonians to call submission to government Slavery--Kings, Tyrants--Ministers, Rascals--& Governors a compound of the whole...You have commenced no hostile steps against the province of Massachusetts Bay, you have only raised a creature like yourself, which 'unless annoyed will annoy nobody.' " with much more, & near the end: "...The liberties of America will be safe while you are held up as an epitome of the military spirit & generosity of the British nation. Resentment begins to subside in our bosoms--for the whole of your operations scarcely entitle you to contempt."
Content from America continues on pages 2 & 3 including a report noting in part: "...accounts from the westward...that on the 12th ult. an engagement happened at the mouth of Kanhawah between about 600 Virginians commanded by Col. Andrew Lewis & about 600 Indians of different nations...lasted, including the Indians firing on their retreat, until an hour before sunset. The Virginians took 18 scalps with the loss of 40 killed...The Indians only got one scalp..." with more (see). Page 2 also has a great letter which has near the beginning: "The province having been repeatedly alarmed at your Excellency's unusual & warlike preparations since your arrival...that you would desist from & demolish your fortifications on Boston neck..." with more comments which are in response to the letter on the front page (see above). The lengthy letter continues with much criticism of the work of General Gage & the presence of British troops in Boston, including: "It must be a matter of grief to every true Briton that the honour of British troops is sullied by the infamous errand on which they are sent to America, & whilst in the unjust cause in which you are engaged menaces, will never produce submission from the people of this province..." and much more. A terrific letter expressing anger towards the British that would lead to war. Much more content on page 3 including some details of the battle between the Virginians and the Indians at Kanhawa (see).
Four pages, a few discrete archival mends to the inside spine not touching any text, a bit of foxing to the ftpg. spine & fold, generally in very nice condition. An exceedingly rare opportunity for a most desirable, displayable, and rare newspaper.
We have been dealers in rare newspapers for over 41 years, serve as consultants to multiple museums, and are members of the American Antiquarian Society. offer with confidence knowing that every item we offer is guaranteed to be authentic.
If you would like to have either the Archival Storage Folder ($9.00, plus corresponding adjustment to the final S&H) or the Certificate of Authenticity ($3.00) included with the issue, please purchase these directly through using the links provided. These items are also available through our cross-promoted store offerings.


Surface parking is located in front of our suite. Patients can also park in the bank or Costco area. There are limited Memorial Hermann Reserved spaces in front of the clinic. There is additional garage parking with Memorial Hermann spaces on the west end of the 3rd floor or the garage. When parking in the garage you are not required to park in the Memorial Hermann spots. There is only a breezeway connection to the front of the center from the 3rd floor.
If parking in the garage you will walk through the breezeway next to Buffalo Wild Wings. There is an elevator on the Weslayan side to the north of the stairs. You may also take the stairs to the first floor. If you park on the lower level of the garage you will have to walk around the building to get to the entrance to our suite.