text:
CLAMOROUS VOICE
Dr Sophie Duncan: stage, spires, and Shakespeare
SHAKESPEARE'S WOMEN
SHAKESPEARE'S PROPS
[not really a REVIEW]: Julius Caesar, Harriet Walter and all-female Shakespeare
Previous post: [Lectures] Before Oscar 2013
Next post: David Tennant back at the Royal Shakespeare Company?
Posted 20 January, 2013 1 Comment by clamorousvoice
The cast of Julius Caesar. Copyright: Helen Maybanks.
Long-time readers will know that Harriet Walter is not irrelevant to my interests. I have purchased a certain number of theatre tickets in order to see her perform. I have a certain degree of familiarity with her first book, Other People's Shoes. She was central to Clamorous Voices, the book after which this blog was named, and she appears in my thesis more than is seemly or subtle for a work that's supposedly about the nineteenth century. I think she's the most perfect actress of her generation, I hope to God I'm never called upon to be articulate in her presence, and I have still not forgiven the Queen for making Helen Mirren a Dame first.
(c) Helen Maybanks
For these reasons, I knew I probably wouldn't be able to review Julius Caesar. Not in a balanced way, or even a way that manages to eschew capital letters and superlatives. Harriet Walter plays Brutus, which automatically precludes all chance of a review that doesn't devolve into my myriad feelings and/or an anecdote about the time my friend Charlie and I (both then aged sixteen) spent half an hour in a biting wind outside the old RST, so that Walter could sign our programmes for (I think) The Hollow Crown.*
Frances Barber plays Julius Caesar. This is also bad news for my sang-froid. Walter may have played Fanny Dashwood, Lady Macbeth, and Harriet Vane, but Barber played the Bolter and the first Shakespearean heroine I ever saw. She was an Edwardian Viola in the snowy Twelfth Night that may not be as good as I remember it, but the fact is that my six-year-old self fell simultaneously in love with her and Anton Lesser. As Feste, Lesser had ringlets and eyeliner; Barber had a waistcoat. I didn't know which one I more wanted to be.
So, then, when I found myself in the front row of Julius Caesar at the Donmar Warehouse, watching Barber, Walter, and a monstrous regiment of miraculous women turn Julius Caesar into a mashup of Shakespeare, Sarah Kane, Bad Girls, Chicago and Our Country's Good, I asked myself a question. Am I going to review this production in a careful, analytical, balanced manner, soberly locating the play in its aesthetic, historical and dramaturgical contexts? Shall I make solemn interrogation of the directorial choices, and cast a cool eye over the production's lasting influence, and longevity? If you should never meet your idols, you probably shouldn't review them, either.
This is not a production to be solemn or cautious about. This is a production which demands you enter its world; a women's prison wing, where the inmates are performing – and in some cases living – Shakespeare's Julius Caesar. Until now, Julius Caesar is a play I've actually preferred to read rather than see, which is a) anathema to everything else I feel about Shakespeare, and b) a direct result of the play having almost no women, and going on about war for too long.
This production's play-within-a-play conceit interrupts Shakespeare's action with the inevitabilities of the prison day. Med checks and lockdowns tear up the script, daring to put modern-day swearing next to Roman rhetoric. But deliberately breaking this suspension of disbelief only makes the Shakespeare more real, as the play becomes increasingly important to the prisoners, racing to complete their performance before they're returned to their cells.
Jenny Jules as Cassius. Copyright: Helen Maybanks.
At its quietest – as when Brutus, played with ravaged elegance by Walter, tells Jenny Jules (a highly flammable young Cassius, all-consuming as the military leader) of Portia's death – the Donmar production is tender, understated and mesmeric. In exhilarating contrast, the play's battles become a cross between a riot and a 90s video nasty, with chaotic sequences of lights, drums, and drugged-out dancing.
It's so rare to see a show that feels so dynamic and experimental, headed by actors who also speak verse with virtuosic ease. Walter and Barber are, as expected, marvellous. Barber, in particular, can slide from sublime poetry to sounding like the Missing Mitchell Sister without missing a single Shakespearian beat. Two of the supporting cast, Carrie Rock (Soothsayer) and Jen Joseph (Trebonius) are alumnae of Clean Break theatre company. Clean Break exists both to stage the experiences of imprisoned women (via award-winning plays), and empower women who are at risk of offending, or who already have experience of the criminal justice system, via theatre-based educational courses.
Frances Barber with Carrie Rock. Copyright: Helen Maybanks.
Both Rock and Joseph gave excellent performances; Rock's disturbed, too-knowing child has stayed in my mind ever since. Both Rock and Joseph speak blank verse as though it's not only instinctive, but imperative; that their characters cannot and must not be expressed in any other way. The total absence of anything unnatural – stagey hangups, theatrical tics – meant that they never seemed to be acting. Ironically, Joseph's overwhelmingly warm stage presence (tell me the name of Trebonius in any production you've ever seen) also meant that I assumed I was watching someone who was already very famous, as opposed to someone who merely deserved to be.
Cush Jumbo as Mark Antony. Copyright: Helen Maybanks.
The joy of single-sex Shakespeare lies in creating amazing and unanticipated combinations of actors and roles. Without cross-casting, Cush Jumbo's performance as Mark Antony would never have existed; Jen Joseph would have been no more likely to play Trebonius than Mark Rylance was to play Olivia.
But one of the most challenging and unsettling things about all-female Shakespeare is that it tips the audience into a world where femininity, not masculinity is the default setting. All-male Shakespeare has the simultaneous advantages of historical justification and novelty. Notions of authenticity and original practice legitimise all-male productions, offering us a glimpse of a history that's sufficiently distant to make the all-male theatrical event unusual. All-male Shakespeare is affirmed and celebrated where other aspects of "original" performance – the cavalier addition of togas to Elizabethan dress, for example – are largely discarded; nor has the modern Globe begun casting pre-pubescent Juliets. I'm not disparaging any of this; productions like Mark Rylance's Richard II make theatre far richer. Sometimes the consequences veer towards pantomime, as when the (sorely-missed) Peter Shorey's Duchess of York harangued Liam Brennan's Henry IV in the BBC's 2003 broadcast of Rylance's Globe show. But that merely shows how Shakespeare thrives on the broadest comedy – else why send Falstaff into a laundry basket, then change him to the Fat Woman of Brentford?
Copyright: Helen Maybanks.
The history of all-female Shakespeare, meanwhile, is the histories of girls' schools and women's colleges; organisations like the Mothers' Union and the Women's Institute; women's prisons, and private reading circles from the eighteenth- to the twenty-first century. These may not be traditional arenas for academic attention, but they are – I hope – attracting more and more work from scholars. I'd love to know about Shakespeare as read and performed by all kinds of female groups: Shakespeare by and for landgirls, Shakespeare by nuns (did he make it into convents, or only convent schools?), Shakespeare in nursing schools (back when nursing was a female profession). The final chapter of my thesis is about Shakespeare and the suffragettes – the chapter of my thesis that most excited me, and one which (happily) other people seem to find exciting as well – but I'd love to know more about different, all-female groups. Tangentially, I really regret not seeing the RSC's partially cross-cast King John last year, because it might have addressed my unease regarding partially cross-cast Shakespeares; I've yet to see one that seemed truly successful.
On Monday, the Donmar will release its last Barclays Front Row tickets for the run. While wary of schemes that force people to jump through hoops to get affordable tickets, Barclays Front Row is infinitely better than day-tickets, London-only tickets, or ostensibly benevolent schemes that use young theatregoers to fill unsellable seats. I hope everyone reading this gets a ticket. I hope I'm successful for a second time. If we're there together, say hello. I really loved this production; I hope you get a chance to do so.**
*Charlie and I could also give a deeply moving rendition of the final seconds of Greg Doran's The Taming of the Shrew, with both of us simultaneously playing both Alexandra Gilbreath and Jasper Britton at the moment of "My hand is ready; may it do him ease". I want you to really imagine two schoolgirls, each one of whom is trying to be two Shakespearean actors at once (while providing very loud commentary on how brilliant they were). Charlie is now a professional actress (in fact she's Charlie Ryall), but sticks to being one person at a time.
**Film version, anyone?
reviews THEATRE Uncategorized Donmar Warehouse feminism Frances Barber harriet walter Julius Caesar london shakespeare THEATRE William Shakespeare
clamorousvoice	View All →
Dr Sophie Duncan is Fellow in English at Christ Church, University of Oxford. She works regularly as a historical advisor and as a dramaturg for theatre, TV, radio and film. She likes theatre, detective fiction and cocktails.
1 Comment	Leave a comment ›
Pingback: [REVIEW] Bitch Boxer at the Soho Theatre | Clamorous Voice
Dr Sophie Duncan
As Fellow in English at Christ Church, University of Oxford, I teach and research literature and drama from the Renaissance to the present day. I like Shakespeare, immersive theatre, true crime podcasts, and sonnets.
Searching for Juliet
[Review] The Lying Life of Adults – Elena Ferrante
Coronavirus and help for A Level/GCSE English students
Equal As We Are
[REVIEW] Why Women Read Fiction
Occupation of the Rad Cam by Oxford students and allies
Come On Algernon (Lord Gerald Berners)
PRS to DPhil: the transfer viva
Advent 19: Mrs Dickens' Family Christmas
The Greatest Hamlet of Our Time
Sarah Daniels: Plays 1
Why Don't My Students Remember The 90s?


text:
SUBSCRIBE TO OUR PODCAST VIA: iTunes | Stitcher | RSS
Film Review – Another Round
December 21st, 2020 | POSTED BY Allen Almachar
Four guy friends – all high school teachers – gather for dinner to celebrate the 40th birthday of one of their own. The night begins regularly, with each of them engaging in idle chit chat. Things take a turn when we learn that all four share the same concern: that their lives have turned stale and boring. One of them mentions a famed Danish psychiatrist who once theorized that maintaining a blood alcohol content of 0.05% can help boost energy and creativity. Soon the booze starts flowing and inhibitions relax. What started out as a cordial dinner ends with the four men wrestling outdoors in a drunken stupor.
So begins the Danish film, Another Round (2020). Directed by Thomas Vinterberg (who co-writes with Tobias Lindholm), the story has familiar elements: the ever-changing views of masculinity during a mid-life crisis, working a dead end job versus living in the moment, the beauty (and stupidity) of male companionship, etc. These are not new concepts. But Vinterberg crafts his narrative with a fresh perspective, opting for a tragicomedy that doesn't lean too far one way or the other. He doesn't depict the act of drinking merely as a pathway toward disaster, nor does he ignore the dangers of it.
The writing and direction are paired with the excellent work of Vinterberg's long-time collaborator, Mads Mikkelsen. Mikkelsen is the kind of actor who can be placed in just about any role and appear as though it were tailor made for him. He can be a hero or a villain, show vulnerability, intimidation, strength, weakness – there isn't much he can't do. As the central character of Martin, Mikkelsen exudes a quiet instability. Martin is a history teacher that has lost his motivation to inspire his students. At home he has become detached from his wife and kids. When the idea of drinking comes up, Martin is the first to adopt it.
Eventually, the other three friends – Tommy (Thomas Bo Larsen), Nikolaj (Magnus Millang), and Peter (Lars Ranthe) – join Martin in their self-made "experiment." They set certain parameters: they must maintain a 0.05% BAC, no drinking at night, and so on. Almost immediately, their lives improve. Martin engages with his class in a way that holds their attention, Peter brings out the best from his music students, Tommy becomes more involved with the school's soccer team, and Nikolaj learns to manage the stresses of his home life.
In a lesser film, this all could have easily fallen into slapstick, especially when the group starts to break their own rules. But Vinterberg grounds the narrative in realism. When Martin and the others slur their words or stumble around a room it isn't not played for laughs. The comedy comes in how they pretend to treat their drinking as though it were some scientific study. The only times the realism is broken is when Vinterberg flashes a title card indicating the groups BAC level. At first, seeing "0.04%" or "0.05%" comes off as funny, but the chuckles disappear as we watch the numbers rapidly escalate.
There are no big surprises, and most lucid viewers can probably guess where things go as the group starts to lose control. But the predictability doesn't dissipate how well the execution is. Vinterberg doesn't sugarcoat the darker elements – he doesn't allow the four main characters an escape when things start to fall apart. We see them at their highest moments as well as when they hit rock bottom. They are the makers of their own destinies, and Vinterberg forces them to confront the consequences of their actions, positive or negative.
Mikkelsen is so good here. He his funny, pathetic, intelligent, lost, and everything in between. He is also a shockingly agile physical performer. During a dance scene, Mikkelsen flips, spins and contorts his body in ways that would make Spider-Man jealous. And yet he never makes a false choice. As Martin, he is the centerpiece holding everything together. Martin is fully aware that the group is walking a tightrope and at any moment can slip off into the abyss but is incapable of doing anything about it. It's as though he can see himself from an outsider's perspective but can't stop from taking another shot of liquor. After years of malaise both at home and at work, Martin chooses to drink as a way to feel something, anything. Mikkelsen keeps us glued to the character's emotional rollercoaster while not seemingly having to do much at all. It's one of the year's best performances.
Another Round is dedicated to Vinterberg's daughter, Ida, who was supposed to be play a role but tragically died in a car crash soon after filming began. Knowing that adds a layer of melancholy to the film, but it doesn't make the viewing experience depressing. In fact, it plays as more life affirming than anything else. Our time here is limited, and one bad decision can make it all go away in an instant. In a way, Vinterberg is telling us to embrace the life we have, to love it, and to treat it with respect it deserves.
FINAL GRADE: A-
Another Round, Druk, Featured, Lars Ranthe, Mads Mikkelsen, Magnus Millang, Samuel Goldwyn Films, Thomas Bo Larsen, Thomas Vinterberg, Tobias Lindholm
About Allen Almachar
Allen is a moviegoer based out of Seattle, Washington. His hobbies include dancing, playing the guitar, and, of course, watching movies.
You can reach Allen via email or Twitter
View all posts by this author
CinemaCon Film Review – The Heat
You Make the Pick – Football Movies
Top 5 – Acts of Redemption
Film Review – The Host
Film Review – A Good Day to Die Hard
Edward Davidson
Allen Almachar
Benjamin Nason
Adelaide Blair
Cassidy Robinson
© 2009-2021 The MacGuffin | Privacy Policy

redpajama_set_name: RedPajamaCommonCrawl


text:
9 to 5: The Musical premieres at Weatherford College
11/16/15 —
Make sure to visit Weatherford College's Alkek Fine Arts Center this weekend and let the cast of 9 to 5: The Musical take you back in time to 1979.
Women may not have had equal rights in the workplace, but Doralee, Judy and Violet take matters into their own hands when an overbearing Franklin Hart, Jr. fails to see their true value.
Naomi Henley plays Mr. Hart's vivacious secretary Doralee Rhodes, Lana Robinson plays Violet Newstead, the long-time company employee who is continually passed over come promotion time, and Elizabeth Ramsey portrays Judy Bernly, a recently divorced woman thrust into the workforce with no experience.
Duncan Alexander is Franklin Hart, Jr., the boss everyone loves to hate. He spreads false rumors about having an affair with Doralee and takes credit for Violet's ideas. With Judy added to the mix, the three women band together and see their fantasies of doing away with their boss appear to become reality due to a few seriously silly misunderstandings.
"Nothing gets the juices flowing like a work place fantasy," said Director Nancy McVean. "From second class citizens they rise to the top of the company. It's hilarious, great music and just plain fun."
The stage production, with music and lyrics written by Dolly Parton, closely follows the plot line of the 1980 movie by the same name. 9 to 5 opened on Broadway in April 2009 and won 15 Drama Book awards and received four Tony nominations.
Production staff for the WC production includes music director Rob Laney, technical director Joe Nicikowski, choreographer Abi Abel, stage manager Salone Sasser, costumer Kristen Monroe and set design/painter Chelsea Cochran.
"The amazing college and community talent will have you believing you are on Broadway paying $100 a ticket to see this fabulous show," McVean said. "This is a bargain you can't refuse. Please, come support the talent in Parker County for an evening that will put a smile on your face and laughter in your heart."
9 to 5: The Musical runs Nov. 19 through Nov. 22. Show times are 7:30 p.m. Thursday, Friday and Saturday, and 2 p.m. on Sunday. Doors open a half hour prior to show time, and admission is free.


The modern way to grow fruit trees is to train them as vertical cordons. These space-saving columnar trees are attractive as well as fruitful and are perfect for smaller gardens. They can be spaced as close as 60-90cm (2-3ft) apart and are also ideal planted in containers on a sunny patio or balcony. Cordons should have their ultimate height restricted to 1.8-2.4m (6-8ft) and their fruiting laterals pruned during the summer months in order to retain their compact columnar shape. To ensure rapid establishment, cordon fruit trees are supplied bare-rooted and are approximately 1.2m (4ft) high on despatch.
Many of our fruit trees are self-fertile and will pollinate themselves satisfactorily. However, some varieties of apple, pear, plum and cherry are not self-fertile and will require a pollinator from the same species. To ensure adequate pollination choose two varieties from the same species that are in the same flowering group or one group apart.
A very heavy cropping dessert apple producing red striped fruits. Crisp and juicy with a refreshing fruity flavour. Easy to grow and ideal as a garden variety. Good resistance to late frosts. Season: Oct - Dec. Self-fertile.
An aromatic Cox-like apple which is sweeter, more disease resistant and ripens earlier than Cox. This is one of the easiest and most reliable of all apple varieties producing heavy crops of crisp, red flushed dessert apples. The tree is compact and an excellent choice for the garden. Suitable for the north.Season: Sept - Oct. Self-fertile.
An excellent pear often grown commercially and suitable for most locations. Raised from a cross between Doyenné du Comice and Conference, it has inherited the best attributes from both its parents. The medium-large pale green fruits have a smooth, juicy flesh with a sweet pleasant flavour. Suitable for dessert and culinary use. Crops heavily and reliably from an early age.Season: Oct - Jan. Self-fertile.
We can confidently say this is the 'new garden Cox' but unlike this classic vintage variety, Christmas Pippin is very easy to grow and produces reliable, heavy crops countrywide. The eating quality is exceptional, characterised by a sweet and aromatic flavour, lovely perfume and a very pleasant honey after-taste. The fruits are crisp and juicy with a melt in the mouth texture that makes each bite increasingly more pleasurable. Christmas Pippin is a 'foundling' having been spotted by a fruit expert by the side of a busy road. A natural seedling of rare and special qualities, most likely arising from a discarded apple core ... perhaps from the very fine Cox's Orange Pippin itself, with which we dare to compare this very special new introduction. Season: early Oct - Jan. Requires a pollinator (such as Herefordshire Russet).
An excellent new dessert apple combining the rich aromatic flavour of Cox with a golden russet skin. Consistently a favourite in taste trials. Heavy cropping. Can be grown successfully throughout the U.K.Season: Oct - Jan. Self-fertile.
A crisp, juicy red flushed dessert apple with a rich, aromatic Cox-like flavour. A very popular garden variety, less prone to disease than Cox and suitable for the north. Heavy cropping. Stores very well. Season: Oct -Jan. Partially self-fertile (pollinated by Red Windsor).
A crisp, juicy red flushed dessert apple with a rich, aromatic Cox-like flavour. A very popular garden variety, less prone to disease than Cox and suitable for the north. Heavy cropping. Stores very well. Season: Oct - Jan.
A popular traditional English dessert apple, over 100 years old. Bursting with juice, the brightly coloured fruits are crisp, sweet and aromatic. Can be relied upon to crop both heavily and regularly almost anywhere in the UK. A compact tree, ideal for small gardens. Season: late Sept - Nov.
This dual purpose dessert/culinary apple is an excellent choice for the garden. When cooked the fruits retain some of their shape and are soft, juicy and sweet. In late winter it can be used as a dessert apple. Heavy cropping and very resistant to mildew. Season: Sept - Nov.
A very heavy cropping dessert apple producing red striped fruits. Crisp and juicy with a refreshing fruity flavour. Easy to grow and ideal as a garden variety. Produces a compact tree. Good resistance to late frosts. Season: Oct - Dec. Self-fertile.
The U.K.'s best known plum, raised in 1840 and grown commercially. The fruits are pinkish red with sweet, yellow, juicy flesh. A very popular dessert variety but also excellent cooked, producing a lovely pink syrup and almond aroma. Heavy cropping. Blossom is frost resistant. Season: late Aug. Self-fertile.
Available for delivery: late November - early May.
This early bright red dessert apple is something very special. Named for its wonderful complexity of flavours, it has been described as sweet, rich and honeyed, aromatic, fragrant and fresh. An excellent garden variety, it is heavy cropping, has good disease resistance and the blossom is resistant to frost. Suitable for the north and wet areas. Season: Sept - Oct. Self-fertile.
The UK's best known plum, raised in 1840 and grown commercially. The fruits are pinkish red with sweet, yellow, juicy flesh. A very popular dessert variety but also excellent cooked, producing a lovely pink syrup and almond aroma. Heavy cropping. Blossom is frost resistant. Season: late Aug. Self-fertile.
This dark red dessert cherry is an excellent choice for the north and more exposed areas, cropping well even in poor summers. It is compact in growth and ideal for small gardens. The fruits are large and sweet with an excellent flavour. Season: late July. Self-fertile.
A very popular late dessert/culinary plum producing medium-large purple fruits with a very good sweet flavour. The fruit hangs well on the tree until the first autumn frosts. Heavy cropping. Very resistant to disease. Can be grown in the north. Season: late Sept. Self-fertile.
A very reliable dessert gage that can be grown in the north. Medium sized red-flushed yellow fruits with golden flesh and excellent sweet flavour. A heavy and reliable cropper.Season: late Aug. Self-fertile.
This old English dessert apple is thought to have originated from Norfolk around 200 years ago. It was one of the most popular varieties in Victorian times and remains a valued garden variety today. The distinctive 'pearmain' shaped fruits are crisp with a rich, aromatic, nutty flavour typical of many russets. An excellent keeper. The tree has good scab resistance so is a good choice for wetter areas. Very attractive blossom.
Raised in 1912, this is one of the best early cooking apples and a popular garden variety. Cooks to a well flavoured yellow puree requiring little added sugar. Also delicious baked. Heavy cropping. Resistant to scab. Suitable for the north and wet areas.
Pollination: Partially self-fertile. Group B.
This is a very special dual-purpose dessert/culinary apple, believed to be the only survivor of an orchard tended by monks on remote Bardsey Island (off the Welsh coast) 1000 years ago. Discovered only recently, the ancient mother tree is miraculously free from disease - a very unusual occurrence in north Wales. The fruits are striped pink and have a distinct scent of lemon. They will cook to a delicate light golden fluff and require no added sugar. Eaten as a dessert apple the fruits are crisp, sweet and juicy.
Originating from Somerset c1864 and grown commercially in Victorian times, this early ripening variety remains a popular dessert apple. The red flushed fruits are juicy with a distinctive sharp taste. It is best eaten straight from the tree as the fruits do not store well. Heavy cropping. Very resistant to scab. Suitable for the north and wet regions.
This dual purpose dessert/culinary apple is an excellent choice for the garden. When cooked the fruits retain some of their shape and are soft, juicy and sweet. In late winter it can be used as a dessert apple. Heavy cropping and very resistant to mildew.


Thanks i was searching it a lot of time!!
Both cheat pkg's don't work. Both are useless. Fix them, please.
No infinite health? Besides, it works not yet; it goes not beyond the first screen of loading. PLEASE, FIX IT.
He doesn't make cheats he only make pkgs.
thanks for this cheat pkg.


text:
Charles Anthony Richard Hoare (Colombo (toenmalig Ceylon), 11 januari 1934) is een Brits informaticus wiens naam altijd verbonden zal blijven aan het door hem uitgevonden sorteeralgoritme quicksort. Hij is "James Martin Professor of Computing" aan de Universiteit van Oxford, met emeritaat. In 2000 werd Hoare geridderd en mag zich sindsdien Sir Tony Hoare noemen.

Hoare is ook bekend van de zogenaamde Hoaretriples. Dit is een notatie {P} S {Q}, waarin P en Q formeel-logische uitdrukkingen zijn, en S staat voor een algoritme of computerprogramma. Deze schrijfwijze betekent: Als aanvankelijk P waar is, en S wordt uitgevoerd, is daarna Q waar. Hierop kan logica toegepast worden, en deze wordt gebruikt om correctheid van computerprogramma's te bewijzen.

In 1980 ontving hij de Turing Award van de Association for Computing Machinery:

In 1985 ontving hij de Faraday Medal.
In 1998 hield hij in Den Haag de NWO-Huygens lezing; 'The science of computing and the engineering of software'.

Hij beschouwt zijn invoering van de null-referentie in ALGOL W in 1965 als zijn grootste fout: "I call it my billion-dollar mistake."

Referenties

Zie ook
Filosofenprobleem

Brits informaticus
Winnaar van de A.M. Turing Award

redpajama_set_name: RedPajamaWikipedia


Donald Trump speaks during a campaign event in Rock Hill, SC on Jan. 8, 2016.
A Muslim woman was removed from a Donald Trump rally on Friday after staging a silent protest in the crowd of supporters.
Rose Hamid, a 56-year-old flight attendant, seated herself behind Trump and stood during the Rock Hill, South Carolina event wearing a blue T-shirt that read, "Salam, I come in peace." After people around her began chanting "Trump" she was ejected along with fellow protesters, the Washington Post reports.
Trump has come under fire for remarks made about Muslims during the campaign, in particular his December demand that members of the religious group be banned from entering the United States.


The third edition of the GIF Annual Report highlights the main achievements of the Forum in 2009. In particular, the GIF Symposium, held in Paris, France, in September 2009 offered representatives from all GIF entities the opportunity to present the progress and main achievements of the different groups during the past ten years, as well as to present their priorities for the next five years to both the GIF community and other stakeholders. The OECD Nuclear Energy Agency acts as the Technical Secretariat for the GIF.
Following the approval of the NEA Strategic Plan, the NEA Committee for Nuclear Regulatory Activities (CNRA) and the NEA Committee on the Safety of Nuclear Installations (CSNI) approved the Joint CNRA/CSNI Strategic Plan in June 2010. Both committees will prepare operating plans to guide their working groups and projects in their activities in alignment with the newly established challenges and goals. As part of this process, the two committees will review and/or revise the mandates of their working groups and task groups as necessary. The CNRA and CSNI operating plans will be presented to their respective committees for approval in December.
This report identifies six nuclear reactor safety problems to be studied in greater detail where two-phase CFD may bring real benefit. The issues identified were: dry-out investigations, departure from nucleate boiling (DNB) investigations, pressurised thermal shock (PTS), pool heat exchanger, steam discharge in a pool and fire analysis. Two-phase CFD was applied to these issues, resulting in an updated state of the art approach to these specific technical issues. Gaps in the modelling were also identified. Available data for validation were reviewed while additional data requirements and verification tests were identified. Benchmarks were also proposed for future activity. Although two-phase CFD is not very mature, initial best practice guidelines (BPG) have been established and will be updated on an ongoing basis.
The NEA Forum on Stakeholder Confidence will celebrate its 10th anniversary with a colloquium entitled "Looking back, Looking Forward in Stakeholder Engagement". The colloquium will be held on Wednesday 15 September at the OECD Conference Centre in Paris. Attendees from NEA member countries will include Forum members, local community representatives, academics, local politicians, field sociologists and journalists. Presentations will be made on a decade of progress in addressing governance issues and social dimensions of radioactive waste management. Other themes will include relationship-building between host communities and facilities, as well as partnering arrangements in launching waste management projects. Find out more at: www.oecd-nea.org/fsc.
The NEA recently hosted a meeting on Uranium Recovery from Phosphoric Acid. Participants discussed possible drivers for recovering uranium from phosphoric acid, including meeting future fuel demand, improving environmental performance of phosphate plants and minimising potential long-term risk from uranium build-up in soil from phosphate fertilisers. Participants noted the decline in expertise in recovery technology and the need to capture knowledge and share best practices related to safety, security and safeguards. However, it was noted that market conditions are not, in themselves, sufficient to motivate a third wave of uranium production from phosphoric acid. Terms of Reference were developed for an Independent Expert Group to identify the benefits and hurdles in the agreed areas and to recommend options for advancing the case in each of the areas identified.
On 23 August 2010, the NEA and the University of Montpellier 1 in France celebrated the 10th anniversary of the International School of Nuclear Law (ISNL). The ISNL is a unique two-week academic programme which provides intensive teaching in all major aspects of international nuclear law. Since its inception, the ISNL has trained over 500 post-graduate students and professionals from both governmental and non-governmental institutions who come to Montpellier from around the world. On the occasion of the ISNL's 10th anniversary, a special publication has been issued by the NEA: International Nuclear Law: History, Evolution and Outlook. This book is a rich source of information comprising 18 scholarly papers on various aspects of international nuclear law. It is dedicated to ISNL alumni and is available free of charge on the NEA website. More on the ISNL 10th anniversary.
Registration is free; please use this link.


Throw a party in your garden or on the backyard on the weekend and we will tell easy ways on how to arrange it.
There are still couple more sunny days and warm evenings left. Use them to say "goodbye" to warm weather, arrange garden party with your friends.
Serve cold drinks in colorful plastic cups. And there is no need to keep bottles in a refrigerator bag, just fill a bucket or a pot with ice and fix a soap holder on the bucket's edge for cups. Now you have a mini bar.
Another mini bar can be installed on the garden table. Place the necessary dishes and drinks and decorate it with flowers or anything you can find.
Instead of a fabric tablecloth try a bamboo one, it will keep table clean and will allow you not to wash it afterwards. For table decorating use anything that you can find in the garden: leaves, tree branches, flowers and berries. Also you can replace napkins with leaves.
Colorful pillows can turn even boring plastic furniture into a cozy sitting area that invites to sit, sip drinks, relax and get involved into a friendly conversation. Put all pillows and ottomans that you have at home outside. Don't be afraid to mix colors, patterns, fabrics and textures. They will add just another doze of fun.
If your party lasts till late evening, don't forget about lighting. Put candles into the vases of different colors and put them everywhere in the yard. It will bring delight and intimate illumination and create a friendly, open and homely mood.
If the weather is a little windy, use fabric to protect yourself and guests from wind. It can be hung on the trees or a built frame put together with a couple of long sticks tired with rope.


text:
package fr.hgwood.todomvckafka.actions;

import com.fasterxml.jackson.annotation.JsonSubTypes;
import com.fasterxml.jackson.annotation.JsonTypeInfo;
import fr.hgwood.todomvckafka.actions.todoitem.AddTodo;
import fr.hgwood.todomvckafka.actions.todoitem.DeleteTodo;
import fr.hgwood.todomvckafka.facts.Fact;
import io.vavr.collection.Set;

import java.util.function.Supplier;

@JsonTypeInfo(use = JsonTypeInfo.Id.NAME, property = "type")
@JsonSubTypes({
    @JsonSubTypes.Type(name = "ADD_TODO", value = AddTodo.class),
    @JsonSubTypes.Type(name = "DELETE_TODO", value = DeleteTodo.class)
})
public interface Action {
    Set<Fact> deriveFacts(Supplier<String> entityIdSupplier);
}

redpajama_set_name: RedPajamaGithub


text:
Q: How to optimize double loops in a matrix while writing to a text file in python? I have a python script to extract desired values from a matrix as follows:
count = 56000
with open('matrix.txt','w') as output:
    for i in range(count):
        for j in range(i + 1, count):
            score = dist(tmp[i],tmp[j]) #don't consider this calculation. It is just an example.
            output.write(f'{i},{j},{score}\n')

The matrix is very large and has a size 56000x56000. I need to apply the looping parameters as specified in the script. I'm calculating a score based on another function (not specified here). And writing the value of "i,j,score" as a row into a text file in each matrix iteration. This is taking an infinite amount of time and I don't know how to optimize this to reduce execution time for a large matrix. Can anybody please help me?

A: If your matrix fits in memory, the best would be to compute and store it in a numpy ndarray and then use np.save() to save the matrix to a file (it is fast and use binary format, you can even use compression with np.savez_compressed).
If it does not fit in memory, I would advise to split it in N parts (by row for example) and use the same solution as above for each of the parts.
Here is some code as example for a matrix which fits in RAM :
import numpy as np

count = 56000
mat = np.zeros((count, count), dtype="float32")  # create a matrix of zeros, if this line succeeds hoora your matrix fits in memory
# mat will take 12.5 GB with float32 (56000^2 x 4 Bytes)

for i in range(count):
    for j in range(i + 1, count):
        mat[i, j] = compute_some_value(i, j)

np.save("matrix.txt", mat)

But to get faster computation speed try to avoid for loops and use numpy functions and vectorization has much as possible.

A: If the file format has some flexibility, then start a "line" with the starting i,j, then have the scores for the row.
This cuts back on the formatting and I/O, both of which cost a noticeable amount of time.
This may require changes to the reader, but those may be beneficial, too.
A minor optimization:
for i in range(count):
    tmpi = tmp[i]          # do the subscription only once per row
    for j in range(i + 1, count):
        score = dist(tmpi,tmp[j])  # this changed, too

Ditto for anything that can be pulled out from the score_function.

redpajama_set_name: RedPajamaStackExchange


Steve Wayne Coates, Loyd Whitehead, Chris Lacy and Carl Menzies to be recognized by peers.
Four West Texans – Steve Wayne Coates, Loyd Whitehead, Chris Lacy and Carl Menzies – are among ranchers being honored at upcoming annual organizational conventions for their lifetime dedication to the agriculture industry.
Coates, a third-generation Hereford breeder in Reagan County, graduated from Texas Tech University in 1969 with a degree in agricultural economics. He taught school for a year at Brackettville where he met Nan Davis. They were married November 28, 1970.
The Coates moved to Big Lake the same year and Steve worked at Big Lake State Bank and ranched in partnership with his father, P.H. Coates, Jr.
The Coates Ranch was established in 1905 by P. H. Coates Sr. and the registered Hereford herd was started in 1927.
Steve Wayne and Nan have two children: Dr. Stephen Coates, M.D. and Stephanie Nat Coates Panozzo.
Steve Wayne became president of the First National Bank of Mertzon in 1975, chairman of the board in 1987 and retired Dec. 31, 2014. These days, he spends his time back at the ranch overseeing the Herefords.
Loyd Whitehead, of San Angelo, purchased the Rocking Chair Ranch near Fort McKavett in Menard County in 1958 and added ranches in Schleicher and Tom Green County. Today he has six additional ranches where he devotes his time.
Loyd's grandfather, C.B. Whitehead of Brady, was in the Hereford business since 1903. Loyd entered the Hereford breeding program in 1963.
Loyd and wife, Carol, have two children: Brie Whitehead Perks (husband Wade), and their children Loyd and Jade; Gentry Whitehead Hudson (husband John Duke) and their son Kasen.
Chris Lacy is the manager and part owner of the "o6 Ranch" in the Davis Mountains between Alpine and Fort Davis. His mother, Mary Ann Kokernot Lacy, was the daughter of Herbert Kokernot, owner of the "o6 Ranch".
According to the Texas Hereford magazine, Chris became manager of the Kokernot ranch in 1973 after graduating from TCU in 1971.
Coates, Whitehead and Lacy will be honored at the Texas Hereford Association annual meeting on Jan. 27, at the Botanic Garden Center in Fort Worth.
Meanwhile, Carl Menzies of San Angelo and Menard will be recognized at the 2018 American Sheep Industry Association convention in San Antonio Feb. 1 for the Wool Excellence Award.
Menzies served as director of research at the Texas A&M Research and Extension Center in San Angelo from 1971 until his retirement in 1996. A longtime sheep producer, it was during his time at the San Angelo center that he made his mark in the wool industry.
Menzies graduated from Texas Tech University with a bachelor's degree and Kansas State University with a master's degree before pursuing his doctorate at the University of Kentucky. He worked as a county agriculture agent before spending 14 years teaching at Kansas State. He left KSU to head the animal science department at South Dakota State University.
Carl has authored more than three dozen publications on sheep nutrition, breeding and wool research. At 85 years old, he still raises Rambouillet ewes on land originally purchased by his grandfather.


Over 80 years of combined experience assures you will be in good hands!
No matter what your legal needs are, Oller and Breslin LLC, with offices conveniently located in both Sparta and Rockaway Township, New Jersey have the experience to ensure you complete legal representation. Whether you need help getting through a complicated divorce, assistance with estate litigation, municipal court representation, or real estate matters, we are here to help relieve your stress and answer any questions. There is no case too complex. We do it all.
Unlike larger legal firms, you will have no problem getting in direct contact with our partners. We make it our personal goal to make sure that you get the one on one attention that you deserve regarding your legal needs. With our extensive experience base and combined knowledge, you can rest assured that you are in good hands.
In order to get the results you desire, we believe in building a sturdy relationship with our clients and providing flexible hours to help work around your schedule. You will receive the personal attention you deserve while we are working on your case.
Oller & Breslin specialize in matters of civil and criminal litigation matters, municipal court and landlord tenant disputes.
Thank you so much for being so kind and caring and for taking my case on for barely anything at all. You are living proof that there are good people out there! If it weren't for you I may have never been able to get away from that nightmare! I will always appreciate you helping me out. Thanks a million!
I want to thank you for bringing a satisfactory conclusion to my lawsuit this summer. I was very happy that we didn't have to appear in court and could get compensation that at least covered my loss and your fees; the best of both possible worlds! I just wanted the company to own up and be responsible for the trouble, and they did.


Patriarch Kirill of Moscow and All Russia.
Patriarch Kirill of Moscow and All Russia will take a tour of countries in Latin America on February 11-22.
The patriarch is expected to visit Cuba, Paraguay and Brazil, Metropolitan of Volokolamsk Hilarion, the head of the synodal department of external church relations, said at a press conference in Moscow on Feb. 5.
The first point of the program will be the visit to Cuba at the invitation of Raul Castro, the head of Cuba's State Council.
The metropolitan recalled that Patriarch Kirill had visited Cuba back when he was a metropolitan, and had met with the Cuban administration. He supervised the construction of a Russian church in Havana and he sanctified that church.
In previous years, Raul Castro had invited Patriarch Kirill to visit Cuba many times, but the visit was delayed due to the patriarch's visits to the dioceses of the Russian church in the CIS countries and other Orthodox churches.
The visit to Cuba was timed to the 45th anniversary of the sanctification of the first church of the Moscow patriarchate in Havana. The Russian-speaking community of Cuba, which has 15,000 members, "is looking forward to the patriarch's visit," Metropolitan Hilarion said.
The patriarch has planned a meeting with Fidel Castro and Raul Castro, a visit to a children's rehabilitation center, and a liturgy in the church in honor of the Iron of Our Lady of Kazan in Havana.
Patriarch Kirill will also visit Paraguay at the invitation of the administration of the country.
The visit to Brazil is timed to the 95th anniversary of the arrival of 1,217 Russian refugees from Gallipoli in Rio de Janeiro and also the 70th anniversary of the creation of the Argentinean and South American dioceses of the Russian church. The patriarch will visit the capital, where he will meet with the country's president, and then he will visit Rio de Janeiro, where he will conduct a prayer service on Mount Corcovado, at the famous statute of Christ, will visit the Russian church and will meet with the local catholic cardinal.
He will also lead a liturgy in the St. Paul's Cathedral of the Antioch patriarchate.


There is a lot of confusion among consumers over annuities, and given the complexities involved in determining whether an annuity makes sense for any given person, the confusion is perfectly understandable. At U.S. Marketing, our associates strive to provide you the information you need to help your customers make the best decision for their unique circumstances.
The key to helping your clients decide on whether to include an annuity in their financial plan starts with helping them understand the different types of annuities. Basically, an annuity is a lump sum of cash that's invested in order to produce a stream of monthly income, either for a fixed period or for life. This income can start immediately (an "immediate annuity") or it can start at some point in the future (a "deferred annuity").
Annuities are commonly chosen by clients seeking to ensure a steady stream of income in retirement and to ensure a spouse (or other designated beneficiary) will be provided for. Most annuities include the option of a death benefit, but it's important to be sure the terms are agreeable with your client. This is where our support staff can be of immense assistance. Simply let us know what type of annuity your client is interested in and we'll narrow the options to those most relevant.
As with any other financial planning vehicle, annuities have their pros and cons. They are not for everyone, of course, but they can add a measure of security and peace-of-mind to many client's portfolios.
U.S. Marketing Corporation offers a variety of wholesale financial services to assist your clients at all stages of their lives. Included in these services are: Wholesale Life Insurance, Long-Term Care Insurance, and Disability Insurance.
Learn more about our wholesale annuity options now, and contact us to connect with a U.S. Marketing associate.


I know this has been discussed a bit, and that many users like it to be clear when a reference (especially a mutable one) to an object is passed to a function. But when the object supports Copy semantics?
See this example: a thin wrapper around a number which is used as a hash-map key and a function value. I don't see the utility of requiring &x to be explicitly referenced. If need be, the compiler can always create a copy and pass a reference to that.
I also don't see why the explicit dereference (take(*map...)) is required. Dereferencing is already automatic when calling a function on a referenced object, and it's unambiguous (whether the object is Copy or not).
I'm just slightly peeved because I've seen hundreds of these errors (expected Num, found &Num, or vice-versa) by now, and usually don't find it worth the bother of working out whether the object in question is already a reference.


The number of throws is not the same as the number of stages of compression. It is possible to have a two-stage, four-throw compressor. In this case there would be two sets of two cylinders working in parallel. Each set would have a common suction and discharge.
High-speed units are normally "separable." That is, the compressor frame and driver are separated by a coupling or gear box. This is opposed to an "integral" unit where power cylinders are mounted on the same frame as the compressor cylinders, and the power pistons are attached to the same drive shaft as the compressor cylinders.
high-speed compressor is a natural gas driven engine.
Figure 10-3 shows a high-speed engine-driven compressor package. The unit typically comes complete on one skid with driver, compressor, suction scrubbers and discharge coolers for each stage of compression and all necessary piping and controls. On large units (> 1,000 hp plus) the cooler may be shipped on a separate skid.
• Numerous sizes from 50 hp to 3000 hp.
• Can be skid mounted.
• Self-contained for easy installation and easily moved.
• Low cost compared to low-speed reciprocating units.
• Easily piped for multistage compression.
• Size suitable for field gathering offshore and onshore.
• High-speed engines are not as fuel efficient as integral engines (7,500 to 9,000 Btu/bhp-hr).
• Medium range compressor efficiency (higher than centrifugal; lower than low-speed).
• Short life compared to low-speed.
• Higher maintenance cost than low-speed or centrifugal.


I came across this gorgeous woman while shooting for Selfridges today and I couldn't stop snapping away. Her name is Gitte Lee, a former Danish model, and she was one of the most charming and elegant women I have ever met.
On another note, Maayan and I are having a great time reading all of your responses to our questions, so I thought I'd post it again below!
What is your favorite era of style?


Home » Tents For Cats > Over 33% OFF Pet Tents on SALE NOW!!
Home » Cat Supplies » Cat Tents and Carriers > Over 33% OFF Pet Tents on SALE NOW!!
Home » All our PET SUPPLIES » Tents, Cages and Houses » Cat Tents and Carriers > Over 33% OFF Pet Tents on SALE NOW!!


We have introduced improvements to help you and your clients operate the Construction Industry Scheme and make the process for obtaining a CIS repayment quicker and more streamlined.
We know from conversations and meetings we've had with agents that CIS has been an area of concern. Since 2011 we've been working with the professional bodies through our Joint Initiative on HMRC Service Delivery (JISD), and we've now put arrangements in place to improve the CIS repayment process. We have also recently published a Construction Industry Scheme Public Commitment statement which sets out HMRC's commitment to improving the service customers can expect when they request a CIS repayment, including dealing with CIS repayment claims within 25 days.
Our quick reference CIS Helpcard for those operating CIS is now available and provides useful information about what to consider before making a claim and how to claim a repayment.
We hope agents agree that these changes will make a real difference and, as always, we'd welcome your comments.


Categories > Let Me Introduce Myself... > 100 insightful + meaningful posts required?
TonyB, I was moved by your post. Even if you are new to magic, you have shown unusual wisdom and humility, attributes that are bound to serve you (and your audiences) well on your magical journey.
As someone new to this (for me) hobby, I'm actually okay with not having access to "secret" areas of the forum without having at least 100 posts. I have a lot more rudimentary techniques to learn and perfect before even considering the more advanced and intriquite tricks. I think limiting the amount of information given to someone who is new isn't a bad thing to do. There is too much information out there that when starting its very possible to become a jack of all tricks / master of nothing too quickly.
I'm glad that you're here TonyB and appreciate you're understanding. You're here for all the right reasons and I look forward to getting to know you better!


text:
Xbox One Free Games With Gold For July 2018 Revealed
Here are your free Xbox games throughout July 2018.
By Chris Reed on June 29, 2018 at 1:00PM PDT
Now Playing: July 2018 Xbox One And 360 Free Games With Gold Announced
July is fast approaching, which means Xbox Live Gold subscribers will soon get a new batch of Xbox One and Xbox 360 games to download for free. Microsoft has pulled the curtain back on July's offerings. The titles that will be available at various times throughout the next month include the Xbox One games Assault Android Cactus and Death Squared and the Xbox 360 games Virtua Fighter 5: Final Showdown and Tom Clancy's Splinter Cell: Conviction. Thanks to backwards compatibility, those Xbox 360 titles are playable on Xbox One as well.
As for the Xbox One offerings, Assault Android Cactus is a fast-moving twin-stick shooter that's been well received as it's landed on various platforms since its initial release in 2015. It's available to download July 1-31. Death Squared is a colorful co-op puzzle game that can be played alone or with up to four players. You can download it between July 16 and August 15.
On the Xbox 360 side, Virtua Fighter 5: Final Showdown is a fighting game geared toward online competitive play. Thanks to a set of in-depth tutorials, it's more welcoming to newcomers than some other fighting games. It's available for free July 1-15. Tom Clancy's Splinter Cell: Conviction is a stealth-action game from 2010 that contains both a single-player campaign and a co-op campaign so you and a friend can sneak around and take down enemies together. You can grab it gratis July 16-31.
Before July 1 comes around, make sure to pick up June's offerings. Right now Xbox Live Gold members can grab Assassin's Creed Chronicles: Russia and Smite Gold Bundle for Xbox One, as well as Lego Indiana Jones 2: The Adventure Continues for Xbox 360.
July 2018 Games With Gold
Assault Android Cactus (July 1-31)
Death Squared (July 16-August 15)
Xbox 360 (playable on Xbox One)
Virtua Fighter 5: Final Showdown (July 1-15)
Tom Clancy's Splinter Cell: Conviction (July 16-31)
Some links to supporting retailers are automatically made into affiliate links, and GameSpot may receive a small share of those sales.


Duke's tenth president, Vincent Price, was introduced to a full Rotarian house on Monday November 7 by Dr. Phail Wynn Jr., Duke's V-P for Durham and Regional Affairs ("Doing good in the neighborhood"). Dr. Price comes to us from the University of Pennsylvania, where was Provost. Before going to Penn, Price was at the University of Michigan, where he headed up the Department of Communication Studies. His short 1992 book Public Opinion is a summary of the difficulties in tying down this tricky concept. He recently taught on the role of online communication and how the media frame political issues. He has advised the online teaching company Coursera.
Dr. Price explained how delighted he was to be at Duke at the end of a successful fund-raising campaign: Duke Forward, the largest campaign in Duke University history, has concluded by raising $3.85 billion over the past seven years.
Asked about future problems for Duke, Price emphasized the university's need for capital. He pointed to "start-up cost", the often substantial amount of capital needed to set up facilities for new science faculty before they can attract external funding. The cost for an individual faculty member can now run as high as a million dollars.
Intercollegiate sports are a continuing source of controversy, most recently – and locally – because of the "fake courses" favored by athletes at UNC, and airbrushed away by the NCAA. Despite the problems they pose, sports are a unique and valuable feature of US universities, said Dr. Price. Universities elsewhere, even in Europe, have nothing comparable. He believes that sports are an important element in the pre-eminence of US academic institutions.
Do we live in times of unprecedented divisiveness? he was asked. Dr. Price advised a historical perspective. Things have been this bad or worse in previous times. He feels that he has absorbed much wisdom from two famous twentieth-century figures: psychologist and educator John Dewey and journalistic icon Walter Lippman (who also wrote a book called Public Opinion).
After the program President Seth Jernigan presented an Honorary Membership and a Durham Rotary flag to Dr. Price. In the picture Rotarian and Duke Vice President for Durham and Regional Affairs, Phail Wynn, looks on. Dr. Wynn introduced Dr. Price.


Please visit the Schools HR website for all current vacancies at St Matthew's.
What do some of our staff say about working in our schools?
has been invaluable to my teaching."
"The team support ethos within the Trust has ensured my success as an NQT. "
"Career opportunities within the Trust have enabled me to further my career a lot faster than some of my university colleagues."
Our schools employ leaders who are approachable and adaptable. As a leadership team we are constantly listening to the needs of our teachers. At a time when education is very busy, we are proactive in reducing the burden of bureaucracy.
We believe that our staff should be happy and well-supported. We have strong Christian values in our schools which shapes relationships and support for each other.


text:
Q: return address of part of a circular array So i have a circular array of max size 2097152 and i want it to fill up to 524288 and return the address that holds that 524288 indices. Then fills up another 524288 and do the same. and keeps doing that since it's a circular array.
I am getting stream of data via TCP. This data comes in different sizes, but for now I'm just trying to fill up my array with numbers.
I'm not sure how to approach this.
I have this so far:
    #include <sys/socket.h>
    #include <sys/types.h>
    #include <netinet/in.h>
    #include <netdb.h>
    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    #include <unistd.h>
    #include <errno.h>
    #include <arpa/inet.h>
    #include <stdbool.h>

    typedef struct circular_buffer
    {
        void *buffer;     // data buffer
        void *buffer_end; // end of data buffer
        size_t capacity;  // maximum number of items in the buffer
        size_t count;     // number of items in the buffer
        size_t sz;        // size of each item in the buffer
        void *head;       // pointer to head
        void *tail;       // pointer to tail
    } circular_buffer;

    void cb_init(circular_buffer *cb, size_t capacity, size_t sz)
    {
        cb->buffer = malloc(capacity * sz);
        if(cb->buffer == NULL)
            {
            printf("myError: Buffer returned Null");
            }
        cb->buffer_end = (char *)cb->buffer + capacity * sz;
        cb->capacity = capacity;
        cb->count = 0;
        cb->sz = sz;
        cb->head = cb->buffer;
        cb->tail = cb->buffer;
    }

    void cb_free(circular_buffer *cb)
    {
        free(cb->buffer);
        // clear out other fields too, just to be safe
    }

    void cb_push_back(circular_buffer *cb, const void *item)
    {
        if(cb->count == cb->capacity)
            // handle error
        memcpy(cb->head, item, cb->sz);
        cb->head = (char*)cb->head + cb->sz;
        if(cb->head == cb->buffer_end)
            cb->head = cb->buffer;
        cb->count++;
    }

int main()
{
 int *arr = malloc (BUFFER_LEN * sizeof *arr);
int i;
for(i = 0; i <= BUFFER_LEN; i++) { arr[i] = i; }

   return(0);
}

A: You can return the start of your data with the address-of operator (&) and access this like an array. e.g.
char *fill_cb(circular_buffer *cb, char *buf, size_t sz)
{
    /* Assume there is room in the buffer: caller must check before calling this function */
    if(cb->tail + sz < cb->buffer_end) {
        memcpy(cb->tail, buf, sz);
        cb->tail += sz;
        cb->count += sz;
        return cb->tail - sz;
    } else {
        size_t tail_room = cb->buffer_end - cb->tail;
        memcpy(cb->tail, buf, tail_room);
        memcpy(cb->buffer, buf + tail_room, sz - tail_room);
        cb->tail = cb->buffer + sz - tail_room;
        return cb->buffer_end - tail_room;
    }
}

Now you can use this pointer and access the memory in the circular buffer much like an array
e.g.
my_data = fill_cb(cb, buf, 20);
do_stuff(my_data[10]);

However, this will only work when you didn't wrap!  The array access expects memory to be contiguous.  But we wrapped inside the circular buffer.  So returning a pointer to the start of the data inserted isn't useful to the using program.  You need to write access methods to get the data out of the circular buffer.  In C++ you might overload [] to make it look like an array.  In C you need to write functions for these.
Basically, you are hoping that there can be a memory region which is wrapped like your diagram, but memory is flat and if you return the address of the start of the data and access from there continuously then you will read past the end of the circular buffer (and in to undefined behaviour).

A: I've done a few of these circular buffer / ring queues before. Below is one of the versions I've used. The source code is complete and has a demo/diagnostic program. It should be buildable and runnable without [much :-)] change.
The central core of this, embodied in the .h file has been floating around my code base for 10-20 years, so it's got some mileage on it. Because of this, it has a few things that I've added based on my actual usage and experience with it.
There are a few differences from your version. Not necessarily better or worse--just different. Hopefully, this will give you some ideas for your own code.
For one, there is only one pointer to the start of the queue. The enqueue element [which you named cb_head] is an index rather than a pointer. Likewise for the dequeue [cb_tail]. From my experience, this makes the code a bit simpler, is on-par speedwise [and can sometimes be faster].
Although I have versions that use pointers to everything, they have pointers to a specific [struct] type, rather than void * pointers and a "sizeof" element. But, to do this in C, requires a lot of CPP macro [or metaprogramming] trickery, to get the effect of a C++ template.
One of the other reasons for using indexes vs. pointers is creating multithread/thread safe queues. This hasn't been designed into this particular version, but there is a cursory example with qrngnew_lck that would use a lock (e.g. pthread_mutex_lock/pthread_mutex_unlock).
Also, as an alternative to a mutex, it is possible to use primitives from stdatomic.h (e.g. atomic_compare_exchange*) to change the enqueue/dequeue values. It is much easier to use this if these values are int vs void *

When dealing with a lot of data (e.g. from recv), what's most useful is to know how many cells can be copied in a single chunk (i.e. memcpy), rather than doing individual pushes and pops [which is slow].
Also, maintaining a separate count of number of elements in queue isn't necessary as this is easily calculated from the enqueue and dequeue values.
Things of interest are:

*

*total number of free cells available to enqueue data

*number of contiguous free cells available for a single memcpy

*total number of filled cells pending to be dequeued

*number of contiguous filled cells pending that can extracted with a single memcpy

Anyway, the code is below. It is three files: qrng.h, qrng.c, and qrngdemo.c.
Sorry about the qrng*. It's a personal signature style (i.e. "quirk"). It could just as easily have been ring everywhere [but, because I have several different versions, I use this naming to avoid collisions in C's namespace]. It could also have been [say] cb everywhere :-)

qrng.h:
// ovrlib/qrng.h -- ring queue control

#ifndef _ovrlib_qrng_h_
#define _ovrlib_qrng_h_

#define QRNGMAGIC       0xDEAFDEAD

#define QRNGINLINE      static inline

#define _QRNGOFF(_itm) \
    ((long) _itm)
#define QRNGOFF(_qrng,_itm) \
    _QRNGOFF(_qrng->_itm)

#define QRNG_FMT \
    "deq=%ld enq=%ld pend=%ld/%ld avail=%ld/%ld qmax=%ld"

#define QRNG_PRT(_qrng) \
    QRNGOFF(_qrng,qrng_deq), \
    QRNGOFF(_qrng,qrng_enq), \
    _QRNGOFF(qrng_pend_buf(_qrng)), \
    _QRNGOFF(qrng_pend_tot(_qrng)), \
    _QRNGOFF(qrng_avail_buf(_qrng)), \
    _QRNGOFF(qrng_avail_tot(_qrng)), \
    QRNGOFF(_qrng,qrng_qmax)

// pointer to queue data item
// NOTES:
// (1) _always_ use void *
// (2) the way this is used, setting this to _anything_ else will _not_ work
typedef void *queitm_p;
typedef const void *queitm_pc;

// queue index
// NOTES:
// (1) _must_ be signed
// (2) for most queues, an int is sufficient
#ifdef QRNG_BIGIDX
typedef long qidx_t;
#else
typedef int qidx_t;
#endif
typedef long qlen_t;

typedef unsigned int u32;

typedef struct quering_struct quering_t;
typedef quering_t *quering_p;
typedef const quering_t *quering_pc;
struct quering_struct {
    u32 qrng_magic;                     // magic number
    u32 qrng_stat;                      // status

    int qrng_algn[2];                   // align to 64 byte boundary

    // WARNING:
    // (1) accesses to these via sysxchgl require them in
    //     _exactly_ this order -- do _not_ reorder these
    // (2) for 64b mode (cmpxchg16b), these must be aligned to a 16 byte
    //     boundary
    qidx_t qrng_deq;                    // dequeue pointer
    qidx_t qrng_enq;                    // enqueue pointer

    qidx_t qrng_siz;                    // size of queitm_t

    queitm_p qrng_base;                 // base address of ring buffer
    qidx_t qrng_qmax;                   // number of queue elements
};

// equates to status
#define QRNGALLOC       (1u << 0)       // 1=qrng_base is allocated on heap

// qrng_len -- get byte offset/length from index/count
QRNGINLINE qlen_t
qrng_len(quering_p qrng,qidx_t idx)
{
    qlen_t len;

    len = idx;
    len *= qrng->qrng_siz;

    return len;
}

// qrng_ptr -- get flat pointer to queue element
QRNGINLINE queitm_p
qrng_ptr(quering_p qrng,qidx_t idx)
{
    queitm_p ptr;

    ptr = qrng->qrng_base;
    ptr += qrng_len(qrng,idx);

    return ptr;
}

// qrng_wrap_dec -- wrap queue index after decrement
QRNGINLINE qidx_t
qrng_wrap_dec(quering_p qrng,qidx_t qitm,qidx_t inc)
{

    qitm -= inc;

    if (qitm < 0)
        qitm += qrng->qrng_qmax;

    return qitm;
}

// qrng_wrap_inc -- wrap queue index after increment
QRNGINLINE qidx_t
qrng_wrap_inc(quering_p qrng,qidx_t qitm,qidx_t inc)
{
    qidx_t dif;

    qitm += inc;

    dif = qitm - qrng->qrng_qmax;
    if (dif >= 0)
        qitm = dif;

    return qitm;
}

// qrng_reset -- reset queue pointers
QRNGINLINE void
qrng_reset(quering_p qrng)
{

    qrng->qrng_enq = 0;
    qrng->qrng_deq = 0;
}

// qrng_full -- decide if qrng queue is full
// RETURNS: 1=full
QRNGINLINE int
qrng_full(quering_p qrng)
{
    qidx_t qenq;

    qenq = qrng_wrap_inc(qrng,qrng->qrng_enq,1);

    return (qenq == qrng->qrng_deq);
}

// _qrng_empty -- decide if qrng queue is empty
// RETURNS: 1=empty
QRNGINLINE int
_qrng_empty(quering_p qrng,qidx_t enq)
{

    return (qrng->qrng_deq == enq);
}

// qrng_empty -- decide if qrng queue is empty
// RETURNS: 1=empty
QRNGINLINE int
qrng_empty(quering_p qrng)
{

    return _qrng_empty(qrng,qrng->qrng_enq);
}

// qrng_avail_buf -- amount that can be added by single memcpy
QRNGINLINE qidx_t
qrng_avail_buf(quering_p qrng)
{
    qidx_t len;

    len = qrng->qrng_deq - qrng->qrng_enq;

    if (len <= 0) {
        len = qrng->qrng_qmax - qrng->qrng_enq;
        if (qrng->qrng_deq == 0)
            --len;
    }
    else
        --len;

    return len;
}

// qrng_avail_tot_ptr -- total amount that can be added
QRNGINLINE qidx_t
qrng_avail_tot_ptr(quering_p qrng,qidx_t deq,qidx_t enq)
{
    qidx_t len;

    len = deq - enq;

    if (len <= 0)
        len += qrng->qrng_qmax;

    --len;

    return len;
}

// qrng_avail_tot -- total amount that can be added
QRNGINLINE qidx_t
qrng_avail_tot(quering_p qrng)
{

    return qrng_avail_tot_ptr(qrng,qrng->qrng_deq,qrng->qrng_enq);
}

// qrng_pend_buf -- amount that may be dequeued by single memcpy
QRNGINLINE qidx_t
qrng_pend_buf(quering_p qrng)
{
    qidx_t len;

    len = qrng->qrng_enq - qrng->qrng_deq;

    if (len < 0)
        len = qrng->qrng_qmax - qrng->qrng_deq;

    return len;
}

// qrng_pend_tot -- total amount that may be dequeued
QRNGINLINE qidx_t
qrng_pend_tot(quering_p qrng)
{
    qidx_t len;

    len = qrng->qrng_enq - qrng->qrng_deq;

    if (len < 0)
        len += qrng->qrng_qmax;

    return len;
}

// qrng_deq_buf -- dequeue buffer from qrng queue
QRNGINLINE void
qrng_deq_buf(quering_p qrng,qidx_t inclen)
// inclen -- amount to increment
{

    qrng->qrng_deq = qrng_wrap_inc(qrng,qrng->qrng_deq,inclen);
}

// qrng_enq_buf -- enqueue buffer into qrng queue
QRNGINLINE void
qrng_enq_buf(quering_p qrng,qidx_t inclen)
// inclen -- amount to increment
{

    qrng->qrng_enq = qrng_wrap_inc(qrng,qrng->qrng_enq,inclen);
}

// /home/cae/OBJ/ovrgen/ovrlib/qrng.proto -- prototypes

// FILE: /home/cae/preserve/ovrstk/ovrlib/qrng.c
// ovrlib/qrng -- ring queue common control

    // _qrngnoalloc -- handle alloc failure
    void
    _qrngnoalloc(quering_p qrng,int sverr);

    // qrng_setup -- passive setup
    // RETURNS: 1=initialized
    int
    qrng_setup(quering_p qrng,queitm_p bp,qidx_t siz,qidx_t cnt);

    // qrng_alloc -- allocate ring queue
    queitm_p
    qrng_alloc(quering_p qrng,qidx_t cnt);

    // qrng_free -- free queue
    void
    qrng_free(quering_p qrng);

    // qrng_deq_sgl -- dequeue single element from qrng queue
    queitm_p
    qrng_deq_sgl(quering_p qrng);

    // qrng_enq_sgl -- enqueue single element into qrng queue
    queitm_p
    qrng_enq_sgl(quering_p qrng,queitm_p qitm);

    // qrngnew_lck -- enqueue multiple items into qrng queue (syslock)
    // RETURNS: pointer to items to store (or NULL)
    queitm_p
    qrngnew_lck(quering_p qrng,qidx_t cnt,quering_p rlsdeq);

    // _qrngnew_init -- do special type-specific initialization
    void
    _qrngnew_init(queitm_p qitm);

    // _qrngnew_onfull -- decide if capture is stopped because queue is full
    queitm_p
    _qrngnew_onfull(quering_p qrng,qidx_t rtn);

    // qrngcowbrk -- break copy-on-write
    void
    qrngcowbrk(quering_p qrng);

    // qrngfault -- output fault
    void
    qrngfault(quering_p qrng,const char *fmt,...) __attribute__((__format__(__printf__,2,3)));

#endif

qrng.c:
// ovrlib/qrng -- ring queue common control

#include <qrng.h>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <errno.h>

#if 0
#define zprt(_lvl,_fmt...)      fprintf(stderr,_fmt)
#else
#define zprt(_lvl,_fmt...)      /**/
#endif

// _qrngnoalloc -- handle alloc failure
void
_qrngnoalloc(quering_p qrng,int sverr)
{

    qrngfault(qrng,"_qrngnoalloc: unable to allocate buffer -- %s\n",
        strerror(sverr));
}

// qrng_setup -- passive setup
// RETURNS: 1=initialized
int
qrng_setup(quering_p qrng,queitm_p bp,qidx_t siz,qidx_t cnt)
{
    int initflg;

#ifdef CPLXCVTLNG
    if ((CPLXCVTLNG(qrng) % 16) != 0)
        qrngfault("qrngsetup: alignment fault -- qrng=%p\n",qrng);
#endif

    do {
        initflg = (qrng->qrng_magic != QRNGMAGIC);

        if (initflg)
            memset(qrng,0,sizeof(quering_t));

        qrng->qrng_magic = QRNGMAGIC;
        qrng->qrng_siz = siz;

        // allocate space for queue
        if (bp == NULL)
            bp = qrng_alloc(qrng,cnt);
        else
            qrng_free(qrng);

        qrng->qrng_base = bp;
        qrng->qrng_qmax = cnt;

        // break copy-on-write
        qrngcowbrk(qrng);
    } while (0);

    qrng_reset(qrng);

    return initflg;
}

// qrng_alloc -- allocate ring queue
queitm_p
qrng_alloc(quering_p qrng,qidx_t cnt)
{
    queitm_p qitm;
    int sverr;

    do {
        qitm = qrng->qrng_base;

        // don't realloc if old and new sizes match -- just reset the pointers
        if (qitm != NULL) {
            if (cnt == qrng->qrng_qmax) {
                break;
            }
        }

        // free the old queue
        qrng_free(qrng);

        // allocate the queue
        qitm = calloc(cnt,qrng->qrng_siz);
        sverr = errno;

        // fault on alloc failure
        if (qitm == NULL)
            _qrngnoalloc(qrng,sverr);

        qrng->qrng_stat |= QRNGALLOC;
    } while (0);

    qrng_reset(qrng);

    return qitm;
}

// qrng_free -- free queue
void
qrng_free(quering_p qrng)
{
    queitm_p qitm;

    do {
        qitm = qrng->qrng_base;

        if (qitm == NULL) {
            break;
        }

        if (qrng->qrng_stat & QRNGALLOC) {
            free(qitm);
        }
    } while (0);

    qrng->qrng_base = NULL;
    qrng->qrng_stat &= ~QRNGALLOC;

}

// qrng_deq_sgl -- dequeue single element from qrng queue
queitm_p
qrng_deq_sgl(quering_p qrng)
{
    qidx_t deq;
    queitm_p qrtn;

    do {
        if (qrng_empty(qrng)) {
            qrtn = NULL;
            break;
        }

        deq = qrng->qrng_deq;
        qrtn = qrng_ptr(qrng,deq);

        qrng->qrng_deq = qrng_wrap_inc(qrng,deq,1);
    } while (0);

    return qrtn;
}

// qrng_enq_sgl -- enqueue single element into qrng queue
queitm_p
qrng_enq_sgl(quering_p qrng,queitm_p qitm)
// qitm -- item to enqueue (if NULL, caller will do copy on return)
{
    qidx_t enq;
    queitm_p qrtn;

    do {
        if (qrng_full(qrng)) {
            qrtn = NULL;
            break;
        }

        enq = qrng->qrng_enq;

        qrtn = qrng_ptr(qrng,enq);

        // we give the caller the option of doing the copy manually or letting
        // us do it
        if (qitm != NULL)
            memcpy(qrtn,qitm,qrng->qrng_siz);

        qrng->qrng_enq = qrng_wrap_inc(qrng,enq,1);
    } while (0);

    return qrtn;
}

// qrngnew_lck -- enqueue multiple items into qrng queue (syslock)
// RETURNS: pointer to items to store (or NULL)
queitm_p
qrngnew_lck(quering_p qrng,qidx_t cnt,quering_p rlsdeq)
{
    qidx_t nenq;
    qidx_t ndeq;
    qidx_t odeq;
    qidx_t oenq;
    int stopflg;
    int wflg;
    int dflg;
    int ovflg;
    queitm_p optr;

    stopflg = 0;

    // lock it
    //SYSLOCKQ(&qrng->qrng_lock,0);

    do {
        // grab the old values
        odeq = qrng->qrng_deq;
        oenq = qrng->qrng_enq;

        do {
            // point to one beyond where we wish to store
            nenq = qrng_wrap_inc(qrng,oenq,cnt);

            // decide if we wrapped the enqueue pointer
            wflg = (nenq < oenq);

            // decide if dequeue increment is positive (non-negative)
            dflg = (nenq >= odeq);

            // decide on overflow
            // NOTE: there is an elaborate explanation for the overflow
            // logic in qrng.m5m
            if (oenq >= odeq)
                ovflg = wflg && dflg;
            else
                ovflg = (wflg != dflg);

            // [initial] filling of queue:
            // (1) enq was higher than deq and it did _not_ wrap
            // (2) enq was lower than deq and it did _not_ touch/go over
            if (! ovflg) {
                ndeq = odeq;
                break;
            }

            // advance the dequeue pointer to make room
            ndeq = qrng_wrap_inc(qrng,nenq,1);
        } while (0);

        // allow caller to "release" the dequeued nodes
        if (rlsdeq != NULL) {
            rlsdeq->qrng_deq = odeq;
            rlsdeq->qrng_enq = ndeq;
        }

        // lay down the new pointers
        qrng->qrng_enq = nenq;
        qrng->qrng_deq = ndeq;
    } while (0);

    // zap the type (ASAP)
    // NOTE: there is a slight (virtually non-existent) race condition here
    // which only occurs if we get held off too long and a dump begins
    do {
        if (stopflg) {
            optr = _qrngnew_onfull(qrng,oenq);
            break;
        }

        optr = qrng_ptr(qrng,oenq);
        _qrngnew_init(optr);
    } while (0);

    // unlock it
    //SYSUNLOCKQ(&qrng->qrng_lock);

    return optr;
}

// _qrngnew_init -- do special type-specific initialization
void
_qrngnew_init(queitm_p qitm)
{
    //ARGV_USED(qitm);
}

// _qrngnew_onfull -- decide if capture is stopped because queue is full
queitm_p
_qrngnew_onfull(quering_p qrng,qidx_t rtn)
{
    queitm_p ptr;

    qrngfault(qrng,"qrngnew: stop on full\n");

    ptr = NULL;

    return ptr;
}

// qrngcowbrk -- break copy-on-write
void
qrngcowbrk(quering_p qrng)
{
    qlen_t len;

    len = qrng_len(qrng,qrng->qrng_qmax);
    if (len > 0)
        memset(qrng->qrng_base,0,len);
}

// qrngfault -- output fault
void
qrngfault(quering_p qrng,const char *fmt,...)
{
    va_list ap;

    va_start(ap,fmt);
    vfprintf(stderr,fmt,ap);
    va_end(ap);

    exit(1);
}

qrngdemo.c:
// qrngdemo/qrngdemo -- test/demo program for qrng

#include <qrng.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int opt_v;
qidx_t opt_M;
int opt_T;

#define dbgprt(_fmt...) \
    do { \
        if (opt_v) \
            printf(_fmt); \
    } while (0)

#define fault(_fmt...) \
    do { \
        printf(_fmt); \
        exit(1); \
    } while (0)

quering_t sampque;

#ifndef MAXCNT
#if 0
#define MAXCNT      524288
#else
#define MAXCNT      337
#endif
#endif

typedef struct {
    unsigned int samp_pos;
    unsigned int samp_neg;
} sample_t;
typedef sample_t *sample_p;

unsigned int filloff;
unsigned int cmpoff;
sample_p temp;

// sampsetup -- do setup of sample queue
void
sampsetup(quering_p sampq)
{

    if (opt_M < 3)
        opt_M = 3;

    qrng_setup(sampq,NULL,sizeof(sample_t),opt_M);
    temp = calloc(opt_M + 10,sizeof(sample_t));
}

// randval -- get random count
qidx_t
randval(qidx_t max)
{
    qidx_t cnt;

    cnt = rand() % opt_M;
    if (cnt <= 0)
        cnt = 1;

    if (cnt > max)
        cnt = max;

    return cnt;
}

// fill -- fill queue
void
fill(quering_p sampq)
{
    sample_p samp;
    qidx_t addcnt;
    qidx_t maxcnt;
    qidx_t xcnt;
    qidx_t idx;

    maxcnt = qrng_avail_tot(sampq);
    addcnt = randval(maxcnt);

    dbgprt("fill: ENTER maxcnt=%ld addcnt=%ld\n",
        _QRNGOFF(maxcnt),_QRNGOFF(addcnt));

    // fill linear buffer
    for (idx = 0;  idx < addcnt;  ++idx) {
        samp = &temp[idx];
        samp->samp_pos = filloff;
        samp->samp_neg = ~filloff;
        filloff += 1;
    }

    dbgprt("fill: TEMP %8.8X/%8.8X\n",
        temp[0].samp_pos,temp[addcnt - 1].samp_pos);

    // copy linear buffer into ring queue
    for (idx = 0;  addcnt > 0;  idx += xcnt, addcnt -= xcnt) {
        xcnt = qrng_avail_buf(sampq);
        if (xcnt > addcnt)
            xcnt = addcnt;
        if (xcnt <= 0)
            break;

        dbgprt("fill: COPY %8.8X/%8.8X -- xcnt=%ld " QRNG_FMT "\n",
            temp[idx].samp_pos,temp[idx + xcnt - 1].samp_pos,
            _QRNGOFF(xcnt),
            QRNG_PRT(sampq));

        memcpy(qrng_ptr(sampq,sampq->qrng_enq),&temp[idx],qrng_len(sampq,xcnt));

        qrng_enq_buf(sampq,xcnt);
    }

    dbgprt("fill: EXIT " QRNG_FMT "\n",QRNG_PRT(sampq));
}

// cmp -- compare queue
void
cmp(quering_p sampq)
{
    sample_p samp;
    qidx_t cmpcnt;
    qidx_t maxcnt;
    qidx_t xcnt;
    qidx_t chkcnt;
    qidx_t idx;

    maxcnt = qrng_pend_tot(sampq);
    cmpcnt = randval(maxcnt);

    dbgprt("cmp: ENTER maxcnt=%ld cmpcnt=%ld\n",
        _QRNGOFF(maxcnt),_QRNGOFF(cmpcnt));

    // copy data from ring queue into linear buffer
    chkcnt = 0;
    for (idx = 0;  cmpcnt > 0;  idx += xcnt, cmpcnt -= xcnt) {
        xcnt = qrng_pend_buf(sampq);
        if (xcnt > cmpcnt)
            xcnt = cmpcnt;
        if (xcnt <= 0)
            break;
        chkcnt += xcnt;

        memcpy(&temp[idx],qrng_ptr(sampq,sampq->qrng_deq),qrng_len(sampq,xcnt));

        dbgprt("cmp: COPY %8.8X/%8.8X -- xcnt=%ld " QRNG_FMT "\n",
            temp[idx].samp_pos,temp[idx + xcnt - 1].samp_pos,
            _QRNGOFF(xcnt),
            QRNG_PRT(sampq));

        qrng_deq_buf(sampq,xcnt);
    }

    if (chkcnt > 0)
        dbgprt("cmp: TEMP %8.8X/%8.8X chkcnt=%ld\n",
            temp[0].samp_pos,temp[chkcnt - 1].samp_pos,_QRNGOFF(chkcnt));

    // check linear buffer
    for (idx = 0;  idx < chkcnt;  ++idx) {
        samp = &temp[idx];
        if ((samp->samp_pos != cmpoff) || (samp->samp_neg != ~cmpoff))
            fault("cmp: failure -- idx=%d samp_pos=%8.8X cmpoff=%8.8X\n",
                idx,samp->samp_pos,cmpoff);
        cmpoff += 1;
    }

    dbgprt("cmp: EXIT " QRNG_FMT "\n",QRNG_PRT(sampq));
}

// main -- main program
int
main(int argc,char **argv)
{
    char *cp;

    --argc;
    ++argv;

    opt_M = MAXCNT;
    opt_T = 10000000;

    for (;  argc > 0;  --argc, ++argv) {
        cp = *argv;
        if (*cp != '-')
            break;

        switch (cp[1]) {
        case 'M':
            opt_M = strtol(cp,&cp,10);
            break;

        case 'T':
            opt_T = strtol(cp,&cp,10);
            break;

        case 'v':
            opt_v = 1;
            break;
        }
    }

    sampsetup(&sampque);

    for (int iter = opt_T;  iter >= 0;  --iter) {
        fill(&sampque);
        cmp(&sampque);
    }

    qrng_free(&sampque);

    return 0;
}


Both dancing and drumming are valuable activities for brain fitness. Drumming has been shown to increase brain function and boost the immune system. So drum away!
The Community drum in the center is a place where you can drop images that inspire you, and have them display above the drum. It is part of the Galaxy Language project, which you can discover more about by visiting the Galaxy Language Drums.
Drumming can also be used to develop muscle and to increase relaxation. Here's how: While you watch yourself drumming, clap in rhythm to the drum patterns. If you can, move your feet and body as you clap, stepping to the right and left, forward and back. Tap on your body, using your chest as a drum. This can be quite exhilarating!
Or use the drumming patterns to tap on the acupressure points in the images below (follow which ever is clearest to you). Use two or three fingers of either hand to tap gently on each of these points 6 or 7 times before moving on to the next point. Start at the side of the eye and end at the top of the head.


Mini Needle felt sculptures individually made using beautiful British wool.
We have little Frida and soft brown baby hard, a dancing queen at a mere 8cm tall and made from Moorit Shetland.
Then there's Bruno the White, soft Shetland and perfect for a special soft, polar bear. Bruno is also 8cm high to the top of his nose.
And finally, Little Gwen, Gweny to her friend, sculpted in pure Black Welsh Mountain wool. And that's why she's so fluffy, so hairy. Gweny is just 6cm talk so definitely the baby of the bunch.


text:
Podcast Player
Discover New Podcasts
Amplifying Voices in Sports: Female Athletes
Athletes are constantly pushing their boundaries, and women in sports are doing it more so than ever. As the struggle to break down gender barriers and discrimination in the world continues, amplifying women's voices is one of many ways to contribute to this fight for equality. And, what better place to start than with amplifying women's voices in sports?
Women in sports set the example that women can be just as powerful, strong, and capable as men, if not more. Take Serena Williams, for example. The 23-time grand slam singles champion proved that women can do anything when she secretly won a grand slam tournament while two months pregnant. On top of that, she returned to the court 8 months after giving birth to her beautiful baby girl. Women like Serena who continually push boundaries in sports not only empower other women and girls but also challenge discrimination and break down gender stereotypes.
So, grab a cup of tea, coffee, or your favorite beverage and listen to these 9 podcasts that feature incredible women in the sports industry:
Just Women's Sports
Kelley O'Hara, two-time FIFA Women's World Cup champion and Olympic medalist, picks the brain of some of the most successful women in sports. From blood, sweat, and tears to accomplishments, championships, and victories, Kelley covers it all. Being a professional female athlete is an incredible journey, and you can hear all about it from this podcast that aims at featuring women Olympians, MVPs, world champions in sports.
Listen to Just Women's Sports here to get up close and personal with some of the best female athletes in the world.
Learn how to share specific audio clips of podcasts using Backtracks.
Female Athlete Podcast
The female body is unique on its own. From menstruation to bone health to giving birth, a woman's body has additional challenges in the sports world that often gets swept under the rug. You don't hear much about the struggle female athletes have trying to win a championship while coping with menstrual symptoms or how you can reach your goal of being an Olympian gold medalist but also experience the miracle of birth. There are so many other facets to female physiology that affect their everyday lives and their athletic performance.
This podcast, hosted by three young women, dives deep into that exact conversation. Listen to the Female Athlete Podcast here to learn more about your body and how it can challenge your sports performance.
Hear Her Sports
It's not difficult to see the inequality women face in the sports industry. From female athletes to women's sports reporters, gender discrimination and inequality are still very much an issue, even in today's modern world. It's clear when you notice the difference in media coverage for women in sports vs. men in sports. How many channels do you have that mainly feature women? Probably significantly less than men.
This podcast discusses this very important issue including both challenges and successes. Listen to Hear Her Sports here to gain more insight into the female athlete experience in an industry where inequality is still prominent.
The Mina Kimes Show featuring Lenny (ESPN)
We know you've been wondering if a football podcast was going to make this list. And the answer is yes! The Mina Kimes Show is hosted by none other than Mina. She's fun, hilarious, and knowledgeable, which makes this podcast great for any football athlete or fan.
Through her humor, she discusses NFL storylines and all things football! And, every episode, she is joined by her lovely co-host, Lenny, who is her favorite football-loving furry companion.
Listen to The Mina Kimes Show here.
Playing A Round With Paige Renee (iHeartRadio)
Are you a golf lover? We certainly didn't forget about you! This fun and sexy podcast serves you some of the best golfing tips and advice from the infamous Paige Renee. As one of the most followed golfers in the world, she uses her knowledge, insight, and skills to help you improve your game. And if you're not really looking to improve your game, you can just simply come to her podcast just to have a good time. This podcast will keep you both entertained and educated on all things golf.
Listen to Playing A Round With Paige Renee here.
The Tennis Podcast
Calling all tennis pros and novices, this is the only tennis podcast you need. Featuring Catherine Whitaker as co-host, the Tennis Podcast highlights Grand Slam tournaments and includes big-name female guests like Serena Williams, Lindsay Davenport, and more.
Start listening to this downloadable tennis podcast here.
The Jump (ESPN)
Through The Jump podcast, Rachel Nichols takes on the challenge of covering everything in the basketball league. This female ESPN NBA Insiders and analysts cast member discusses anything from boycotts to playoffs to controversies to reactions and so much more. This podcast is the perfect place to stay up-to-date with all things basketball.
Listen to The Jump here to gain insight into anything surrounding the NBA and WNBA.
Tea with A & Phee
A'ja Wilson and Napheesa Collie are two very talented, young, and upcoming women in the WNBA. They co-host Tea with A & Phee. This WNBA podcast highlights many of the struggles and accomplishments both A'ja and Napheesa have faced in the basketball world. In addition to that, they also discuss the season and league to keep you in the know about what's happening in the WNBA.
Listen to Tea with A & Phee here to learn more about their personal lives and the basketball season.
Get The Pancake: A Podcast For Volleyball Coaches
If you're a volleyball coach, we have the perfect podcast for you. Get the Pancake is a podcast that covers everything volleyball. Whether you're wanting some tips and advice about coaching or wanting to learn from some of the biggest players and Olympians, this podcast has something for all volleyball coaches.
While this podcast gives you insight and knowledge, it also provides a lot of entertainment along the way. See all episodes for Get The Pancake here and start listening to this beginner-friendly podcast.
While these 9 podcasts are a great place to start when amplifying women's voices in sports, there are so many more podcasts available. Whether you love baseball, soccer, tennis, football, or any other sport, there is a podcast for you. If you're looking for more female-centered sports podcasts, search our charts pages to find the right podcast that suits your interests. And, make sure to share the podcast to take a step further, amplifying women's voices through awareness and exposure to females in the industry. Learn more about women in sports and get the conversation going with some of the best sports podcasts!
podcast recommendations
Amplifying Voices in Sports: Fantasy Sports
Football season is here and that means hoodie weather, leaves changing, and a full day of being glued…
Amplifying Voices in Sports: Athlete Voices
For die-hard sports fans, nothing is better than hearing from the professional athletes themselves. If you're searching for…
Amplifying Voices in Sports: Professional Sports Team Podcasts
Although the pandemic made the world of sports seem uncertain for a while, professional sports teams have found…
Amplifying Voices in Sports: Football Podcasts
With football season underway, fans want to consume as much gridiron content as possible. Whether you're looking for…
Amplifying Queer Voices in Podcasts: Trans Voices
As the fight for equality for transgender people coincides with a disturbingly steady rise in hate crimes against…
Amplifying Queer Voices in Podcasts: Black Voices
If there's one thing that's been abundantly clear these past couple of months, it's imperative that we amplify…
Sign Up for The Backtracks Newsletter
Get our latest articles
Backtracks
Top Podcast Rankings
Backtracks is the world's most advanced podcast analytics and hosting platform.
©2020 Backtracks, Inc. All Rights Reserved.


text:
Orange County Patent Law Association
What Is The Pirate Bay? Does It Violate Intellectual Property Laws?
On December 20, 2018	by Herminia Fleming	With	0 Comments	- Default
Not all of us have the respect for intellectual property we should, and that's in part because it's something many of us simply don't understand. Most of us have seen the litany of copyright or reproduction warning on VHS tapes, DVDs, and Blu-rays. They threaten huge fines and potential jail time for those who make illegal copies of protected works. That's because the art itself is copyrighted. Intellectual property, though, is less tangible creative work, but it falls under the far-reaching copyright umbrella.
"The Pirate Bay" is a website that provides would-be copyright or IP thieves with an online index of music, movies, ebooks, and software, from which to dutifully plunder. In addition to the files themselves, users have the option to use torrenting software to share these files online. The website is routinely taken down by authorities in whichever country currently houses its servers, but it always manages to stay alive.
Most notably, shows like Game of Thrones and The Walking Dead are among the most pirated, potentially costing HBO and AMC, respectively, millions of dollars in damages. The Pirate Bay's founders were eventually tried and found guilty for assisting in the infringement of copyright law worldwide. They were sentenced to a short prison term after the Swedish trial, but the website has continued to thrive. The website, and those who use it, are all in violation of the law. But does it matter?
From a moral perspective, it's up to the individual. From a legal perspective, it only matters if you're one of those who are "seeding" the content available for download on the website. These are the individuals who have the most to lose from copyright law, not because they're the only ones in violation, but because there are far fewer of them. They take enough precautions that they're more difficult to trace. One season finale of Game of Thrones was downloaded a billion times. Think you can put all those people in prison? Good luck!
The Copyright Alert System (or CAS) was implemented as a measure to combat piracy in 2013. It was meant as more of an "educational" program to limit piracy rather than a system for implementing penalty. Unfortunately CAS is so difficult to trigger that the six-step process is something few people have likely experienced in full, and it's still more of an inconvenience than anything else.
Copyright Orange County Patent Law Association


WATERLOO - Sylvia C. Benzer, 86, of Buffalo, Minn., formerly of Waterloo, died Sunday, June 26, at the Sunrise Cottage, Buffalo.
EShe was born Dec. 11, 1918, in Oelwein, daughter of Peter A. and Trena Ellefson Anderson. She married Robert Benzer on June 14, 1942, in Oelwein. He died March 23, 2005.
Survivors include two sons, Robert Jr. (Myra) of Dubuque and Thomas (Bernis) of Buffalo; a daughter, Karen (Loyd) Simmons of Waterloo; and several grandchildren and great-grandchildren.
Services: 10 a.m. Wednesday at Pilgrim Evangelical Lutheran Church, with burial in Garden of Memories Cemetery. Friends may call for an hour before services Wednesday at the church. Kearns, Huisman-Schumacher Chapel on Kimball is in charge of arrangements.
Memorials may be directed to Allina Hospice in St. Paul, Minn.


Sixt rent a car has a variety of SUV rental options available in Greenville. We offer premium rental SUVs that can be easily tailored with affordable extras to meet your exact needs. From compact crossovers, larger 8 seaters, and luxury SUVs our fleet has something to accommodate all kinds of travel. You'll find latest model SUV rental from top brands such as BMW, Mercedes-Benz, Cadillac and Audi in our well-maintained fleet. Child seats, GPS, additional driver coverage and insurance packages can be easily added to your Greenville SC reservation.
With an SUV rental you can easily tour around the vibrant city of Greenville or elsewhere in South Carolina. The ample passenger and cargo space provides a comfortable way for you to get around with friends and family. With a Sixt SUV rental at your disposal in Greenville you can access events at the Palmetto Expo Center or visit attractions like the CrossWinds Golf Course where each of the 18 holes has a different designer. Many of our SUVs come standard with 4WD drive making all kinds country or city adventures possible. We look forward to handing you over the keys!


text:
Supreme Court Upholds Church's Religious Liberty in Unanimous Decision
CP Politics | Wednesday, January 11, 2012
By Stephanie Samuel, Christian Post Reporter
The U.S. Supreme Court unanimously agreed Wednesday that the government should not interfere with religious groups' internal affairs in the case of a disgruntled former employee of a Lutheran school.
Chief Justice John Roberts wrote in the majority opinion for Hosanna-Tabor Evangelical Lutheran Church and School v. Equal Employment Opportunity Commission that allowing the EEOC's anti-discrimination lawsuit violated the Free Exercise clause of the First Amendment.
"Such action interferes with the internal governance of the church, depriving the church of control over the selection of those who will personify its beliefs," Roberts wrote. "By imposing an unwanted minister, the state infringes the Free Exercise Clause, which protects a religious group's right to shape its own faith and mission through its appointments."
The 9-0 ruling in favor of Hosanna-Tabor Evangelical Lutheran Church is a huge relief for religious freedom proponents.
"The message of today's opinion is clear: The government can't tell a church who should be teaching its religious message," Luke Goodrich, a deputy national litigation director at The Becket Fund for Religious Liberty, said in a statement.
"This is a huge victory for religious freedom and a rebuke to the government, which was trying to regulate how churches select their ministers."
Cheryl Perich, a former teacher at the Hosanna-Tabor Evangelical Lutheran Church and School, is the "minister" in question.
She was laid off after taking an extended leave for health reasons. The school made the decision, citing ministerial exception. Ministerial exception allows religious institutions the freedom to select their ministry employees without government intrusion.
The EEOC argued that Perich was a secular employee at the school who taught from secular books and was therefore eligible to seek correct action against the school.
The Americans With Disabilities Act of 1990 prohibits employers from discriminating against qualified individuals with disabilities.
Perich took her case to the EEOC and the government agency sued the school. The district court dismissed the suit, recognizing a ministerial exception to the Disabilities Act, which prevents interference from the courts when it comes to employment matters in a religious institution.
But the Sixth Circuit later reversed the decision, concluding that that ministerial exception does not apply to the former employee because she spent a majority of her time performing "secular" duties.
Americans United for Separation of Church and State Executive Director the Rev. Barry W. Lynn expressed disappointment in the ruling.
"Clergy who are fired for reasons unrelated to matters of theology – no matter how capricious or venal those reasons may be – have just had the courthouse door slammed in their faces," Lynn said in a statement.
While Perich did teach non-religious subjects, she also led prayer and devotion several times a day. Douglass Laycock, who argued the case for Hosanna-Tabor, told The Associated Press the ruling is a "huge win for religious liberty."
Laycock continued, "The court has unanimously confirmed the right of churches to select their own ministers and religious leaders."
Should Religious Institutions Follow Anti-Discrimination Laws? Supreme Court Decides
Supreme Court Hears Church Firing Case
America 'Losing Sense of Religious Liberty,' Says Archbishop
Utah bans sex-change surgeries on kids, creates new requirements to prescribe hormone drugs
Nat'l Prayer Breakfast to be 'smaller,' 'more intimate' in return to its origins; 'the Family' no longer hosting
Colorado appeals court rules against Jack Phillips, Masterpiece Cakeshop in trans cake case; baker to appeal
Kamala Harris omits 'right to life' when quoting Declaration of Independence on Roe's anniversary
Pro-life group warns Republicans not to seek 'middle ground' on abortion