I happened across a video from Dove this morning called "Choose Beautiful". It's a simple concept 2 doors, one average and one beautiful and you can choose what to walk through. While this is a commentary on women's perception of themselves and the message society and media send on what is beautiful and an important message it's not what moved me. I'm also not really qualified to comment on the experience of women having never been one. This did cause me to have a deeper thought experience.
Humanity is capable of such great acts of beauty, kindness and love. And at the same time of destruction, indifference and hate. It can be Angels or it can be Demons, the choice lies with each of us.
I've recently (in the last 2 years) reconnected with my Catholic faith. What brought me back were 2 central things. One a Pontiff who espouses and lives the ideals I found best in my time as a student in a Jesuit school, the Jesuit ideal of "A man for others". He preaches and lives what we are all called to do. Live with love and compassion for all we are given and for all those around us. To love them for the imperfection they are, but struggling to be better. He's a living example of Christ's love for us and his teachings of our relationship with God and one another.
This isn't easy. We are often frustrated by ourselves, our perception of how others see us, our view on the outcome of situations or the motives of those we interact with. But you'll notice all those things begin with us. Our choice, our view. Love and the forgiveness that come with it allow us to rise above petty selfishness. I want to be better, so I must strive everyday to choose love. To let go of my hate, to pray for my enemies, to forgive those who hurt me. I must act and not wait for others to act.
This post is already filled with quotes, and I admit I love quotes. They help me remember, so please indulge me for just one more.
I've long believed in love and it's power to make us better individually and as a species. That choice starts with each of us. We have 2 doors everyday, one says Love, it does't really matter what the other one says. Which door will you choose?
Heroes, not the super kind, are often posted about. More often than not it's about military service, police, fire, EMS and the like. It occurs to me we're setting up an expectation of service that overlooks a great number of deserving people.
Service and heroism does not and should not require the carrying of a weapon or the risk of ones well being, or even a uniform for recognition. Plenty of heroes wear everyday clothes. We often show them disdain for one reason or another but civil service is still service it's an unsung part of our societies fabric. As are the clergy who often minister to the vulnerable and lost. They are heroes.
And even less recognized are all the people who give their time and energy to feed the hungry, cloth the homeless, comfort the sick and speak for those with no voice.if you give of any of your time to help others, you are a hero.
My own heroes are the men who showed up week in week out to give me a sports and scout program. Who sacrificed weekends in the wilderness with burnt food and grey weather so we could have role models. And the moms who took groups of cub scouts and taught them how to be men of character and compassion.
I'm not saying to stop thanking and caring for the "popular" heroes. But maybe you can thank the Peace Corps volunteer who goes out to show Americas' compassion, the lady at the DMV and civil servants in our courts who make our system of laws work day in and day out. The mom who gives her time at the soup kitchen and the dad who coaches a sport or scout unit. The minister who visits the sick not just for their faith but all who need a moment of compassionate listening. Anyone who cares for others and seeks no recognition and no reward other than the good feeling of honest service.
To all of you, thank you. Your service has not gone unnoticed nor unappreciated.
Your Turn Challenge: Day 5: What advice would you give for getting unstuck?
I had a good friend tell me once, if you don't know where to start, just pick a place and start. It has on many occasions turned out to be great advice. This is especially true when I just have a bunch of tasks that need to get done an the critically and time demands of the overall list are just equal. So picking a place to start is just another task that does not need to be added to the list. Just pick something, sometimes the easiest one and get moving. The inertia of movement will keep you going, and as you nock stuff off your list the little kicks of Dopamine will keep you moving to continue to get stuff of your list.
On the other hand if you have tasks that have priorities or deadlines you're gonna need a list. You don't have to start with the top of the list, find something near the top that you dread the least and just start doing it! You will get a pick-me-up, you will get addicted to getting things done and the next thing you know you're unstuck.
Meaning: When life knocks you down, stand back up / Keep trying.
So I failed twice, but I'm getting back up and to me that is what matters. Writing something everyday is more scary that I thought it might be. I'm getting better but I still need to make it a priority for myself. So I'm standing back up.
Teach us something that you do well.
As the title implies I have some little somethings I don't share often but that I think I am pretty good at.
I've been told, that I'm a good cook. I love to make all kinds of food, the process of the kitchen, the smells and the creativity are something that give me fulfillment. I also love the challenge of what we call "experimental food nights". This entails me going to the kitchen with no particular recipe in mind, just seeing what we have on hand and creating a meal. More often than not in my adult life I've been successful, there were a few teen age experiments that did not work out so well. It's a real treat to see what I can make and draw from experience and parts of recipes I know well. My friends seem to love it and tell me I should open a restaurant (not sure I'd go that far). I do get a great joy from a good meal and the enjoyment others get from the food I make.
It's also a great way to get to know people, we move so fast we often skip having a good meal and a conversation. It's made all the more interesting if you can make a dish and have that as an icebreaker. At the least you should go out and have coffee with a coworker and make a human connection.
Tell us about something that you think should be improved.
There are lots of things that can be improved, things, processes, governments. The list is likely endless and just as endless is the opinion on how to improve them and right after that is the list of alternatives that others advocate for how to improve it. At the end of it all though the only lasting improvement is to be introspective about what you can improve in yourself. The only thing you can actually have the power to change is you, and you have to want to do it. You are the ultimate consumer of you. Achieving your goals starts with you being honest about who you want to be, not for anyone else just for you.
Tell us about something that's important to you.
Ultimately the most important thing to me is being happy. That comes from lots of things.
Participating in work that is meaningful and has impact to others; in my case in computer security. I love computers, I love knowing how they work, I love tinkering with them and making them do things. I hate when they make it harder for people to be what they want to be and do what they want to do because others take advantage of things we as builders can prevent. The internet has a huge potential to connect us, empower our creativity, and make things better. But only if we can trust it and know things we're not ready to share won't be taken from us.
Contributing back to my community by being an active member. Three organizations had a huge impact on my as a youth. The Boy Scouts, instilled in me to "help other people at all times" not just when it's convenient for me. The Jesuits gave me faith that my gifts and status were things to be used to lift others up and not to look down on anyone, to be "A man for others". And the Order of the Arrow showed me that service was the way "He who serves his brothers is of all his brothers best". So I am active in my church where my children see me living what I say is important through service, not just on Sunday. I'm active in the Boy Scouts to give back to where I learned it, to give the next group the same foundation. And I offer my time to charities in my community to reach out a hand to help others up and not hold them down.
I just want to have a good life, with as little worry as possible surrounded by my loved ones and loving them back.
Why are you doing the Your Turn Challenge?
Short answer: It will be good for me.
I have lots of ideas, but I don't seem to complete many of them.I'm hoping that by writing something everyday that I can make a habit of at least sharing my ideas.
I have a fear that what I have to say isn't good enough, so by practicing here my craft of communication will get better.
I want to be known for shipping, what this challenge is about.
This whole thing sounds like fun, and if I can get past the first 2 points I think it honestly will be and I'll be better for it.


text:
Backstage with Matthew Blog
Backstage with Matthew: A House Built for the Ages
by Matthew Shilvock | The Marriage of Figaro, Backstage with Matthew
On October 11th we will raise the curtain on a brand-new production of Mozart's The Marriage of Figaro, beginning an exciting three-season journey through the operas Mozart wrote with the librettist Lorenzo Da Ponte. In a unique approach, The Marriage of Figaro, Così fan tutte and Don Giovanni will be produced on a shared set, but a set that evolves through time. A beautiful, grand Neo-Classical American house will take us from the 1780s through the 1930s and into a dystopian 2090s. The house becomes a metaphor for different forms of society; an evolving (although not always positively) arc of human interactions. In this Backstage with Matthew we're going to catch up with the final developments in our Burlingame Scene Shop as they bring this exciting new legacy production to life.
Set Designer Erhard Rom's concept for our Neo-Classical American manor house.
Directed by Michael Cavanagh with set designs by Erhard Rom, costumes by Constance Hoffman and lighting by Jane Cox, it was crucial that the production be flexible, accommodating Da Ponte's fast-paced plots which move quickly from room to room in the grand house, as well as to its surround grounds. In fact, the production has become so flexible that we even have changes of location that haven't been traditionally done in other productions, such as a brief move to the kitchen in Act 1!
The props crew preparing the kitchen sequence – real or fake?
In creating a flexible set, Erhard Rom developed a brilliant concept that contrasts two different looks for the walls of the manor house; some of the walls are as you would expect, fully completed three-dimensional examples of Neo-Classical architecture, but some walls appear as architectural drawings, still featuring the graph lines of the architect's rendering. The interaction of the two gives a sense of a house in constant flux and creation, but also lighten up the scenery, allowing grandeur without weight.
Erhard Rom's designs give a sense of how the three-dimensional set pieces (gray elements) interact with the architectural drawing set pieces (white elements).
In creating this complex scenery, our Scene Shop has made extensive use of a new tool that we've recently acquired: a computer aided router (or a CNC router). It takes a computer generated image and cuts it in three dimensions, allowing rapid and repetitive cutting of stock pieces needed to create architectural scenery. Dylan Maxson in our Scene Shop has overseen the integration of the new CNC router and tells me that it has been used in some capacity in every element of the set!
Dylan Maxson with the CNC router, cutting out some recurring pieces used to craft the Figaro set.
Dylan has been putting the router to the test, and even programmed it to produce sculptural artwork, like the busts of Mozart and Da Ponte that will adorn the top of the walls of the great rooms. Interestingly, there is no known bust or bas relief of Lorenzo Da Ponte, so Scenic Artist in Charge Steve McNally took a two-dimensional image and, using the same computer program he used to create the cherubs for Tosca, he created a three-dimensional rendering that has then been cut using the router.
A stylized 3D rendering of Da Ponte is carved out of wood on the CNC router, producing a rough cut, which is then finished by hand.
The CNC router was also very instrumental in creating the beautiful parquet wood flooring, which features a complex interleaved wooden pattern. To give a sense of depth, the flooring darkens in color as it heads towards the edges of the stage, so it's essential that each of these interlocking pieces be in the right place. The solution? Each piece is stamped with a unique reference code, invisible to the audience but easy to spot for the stage crew!
The shape of the parquet flooring panels, and the numbering system that will ensure their correct placement.
Finally, one of the more unanticipated uses for the router was to carve large, table-sized stencils that allowed the scenic artists to more quickly paint the graph-like lines onto the set walls that make them look like architectural drawings.
The table-sized stencil used to paint the graph lines onto the set was also created by the CNC router.
Scenic painting gives so much dimensionality to a set, and you'll see a number of examples in Figaro. I saw the grand column structures on multiple visits to the scene shop. The carpentry crew assembled the various pieces, and the scenic artists then gave them an elegant gray paint. But on a return visit they'd added a spatter texture to the columns that brings so much depth and character to the fluting. It's these subtle touches that allow a set to really read under stage lights, creating a sense of realism and beauty that reaches every seat in the house.
The impact of detailed paintwork: on the left are the columns with just a flat gray base, on the right spackled paintwork adds a realistic stone effect.
Although scenic painting is more obviously seen in the architectural drawings of the set, it's also there in unexpected ways in the three-dimensional scenery. Incorporated into the set are some very clever uses of trompe l'oeil painting with elements painted to look as though dimensional. Here you can see Scenic Artist Lauren Abrams adding beautiful molding details to our walls just through the use of paint.
Scenic artist Lauren Abrams creating trompe l'oeil effects.
Scenic painting is seen on a grand scale with the drops of the Mozart-Da Ponte Cycle, both the "show drop" which is taken from an architectural study by Thomas Jefferson, and then what we call the Garden Drop – a beautiful hand-painted rendering of a stylized view out onto the Potomac River, which will be used as a backdrop for the outdoor scenes in Figaro.
The show drop, based on sketches by Thomas Jefferson.
When I was last down at the Scene Shop, Scenic Artist in Charge Steve McNally was working with his team on creating the Garden Drop. They began with a 78-by-40-foot piece of muslin that will fill the entire stage and fills most of the Scene Shop! It is laid out, starched and then marked out in a grid pattern using black cotton (avoiding drawing any lines on the fabric). Steve took the photo-realistic design by Erhard Rom and created a simplified version, which was then set onto the grid. He then created a version that just showed the outlines of the trees, and these outlines were painted onto the fabric with a paint/sawdust mixture that gives a texture to the edges of the trees and stops them from being too hard-edged. The Opera's highly skilled scenic painters then replicate the design square-by-square. In just 5 days, a beautiful drop emerged, now hanging in the fly tower of the Opera House!
From photorealistic design to exquisitely hand-painted show drop, showing the stages of the process.
Returning to the physical scenery, there's a wonderful story that I wanted to share with you about one piece of the Figaro set. In this production, the entire house is still being finished and there's an air of construction that pervades the scenery and even the costumes. (Constance Hoffman has picked fabrics and colors for the Chorus that give the impression of being covered in construction dust!) In the first scene of the opera, Figaro and Susanna are measuring a bedroom for furniture that they will acquire after they are married, but the room is still under construction and is filled with a large wooden scaffold. The story behind the creation of this scaffold is a great example of the creativity and resourcefulness of our crew, as well as the unexpected generosity of a community member.
The design of the scaffold calls for stripped lumber – the kind of logs that you would see used in a wood cabin, with all the bark removed. Sounds pretty simple, right? But it turns out that you cannot buy stripped lumber commercially anymore and the Scene Shop was growing concerned about how to create this piece. It so happened that one of the stage crew knew a landowner up in the North Bay whose forest had been ravaged by fire last year. Out of a terrible tragedy came a surprising opportunity: he had a large acreage filled with fire-stripped lumber. He generously invited our crew to go up and select the logs that worked. So, give an extra special nod to the Figaro scaffold. To Susanna and Figaro this scaffold represents beginning a new life together, and to us at San Francisco Opera, it also stands as a tribute to those impacted by the recent natural fire disasters that have been devastating our Northern California communities.
The stripped lumber used in the Figaro scaffold, both in its untreated state and then its finished state. You can then see the constructed scaffolding backstage during technical rehearsals.
My last visit down to the Scene Shop was just before they transported the set up to the Opera House for the initial technical rehearsals. It was like a great Lego project! All of the architectural elements were being assembled onto the scenic flats to create the massive 28 feet high walls that will define the house structure: three-dimensional elements fusing with painted elements to create the great house of Mozart and Da Ponte.
Putting all the pieces together: the three-dimensional pieces and architectural drawings are attached before being transported up to the Opera House.
One of my favorite aspects of this new set is something you'll never see from the house. It's the stamps on the back of the scenery. First are the logos of the San Francisco Opera IATSE Local 16 stage crew and the Scenic Artists, IATSE Local 800, marks of great pride by some of the finest craftspeople in the world. Then there is an additional mark, one that will come to be seen quite regularly on our scenery, and one you won't see anywhere else: "Mozart Trilogy."
Scenic marks on the rear of the scenery close-up and in situ onstage.
The journey begins!
Backstage with Matthew: Emerging from the Depths
Backstage with Matthew: Backstage on the Road

redpajama_set_name: RedPajamaCommonCrawl


text:
Statistics for NBA 2K Highest Rated Players
This quiz has been taken 159,611 times
(21,743 since last reset)
The average score is 16 of 22
2020, 2021, 2022, 2023 LeBron James
2020, 2021, 2022, 2023 Stephen Curry
2020, 2021, 2022, 2023 G. Antetokounmpo
2020, 2021, 2022, 2023 Kevin Durant
2021, 2022, 2023 Luka Dončić
2020, 2021, 2022, 2023 Nikola Jokic
2020, 2021, 2022 James Harden
2020, 2022, 2023 Joel Embiid
2020, 2021, 2022, 2023 Anthony Davis
2020, 2021, 2022 Kyrie Irving
2020, 2021, 2022, 2023 Kawhi Leonard
2021, 2022, 2023 Jayson Tatum
2020 Russell Westbrook
2022, 2023 Devin Booker
2023 Ja Morant
2022, 2023 Chris Paul
2020, 2021, 2022 Damian Lillard
2020 Klay Thompson
2020 Paul George
2021, 2022, 2023 Jimmy Butler
2023 Trae Young
2020 Karl-Anthony Towns
You have not taken this quiz since the last reset
U.S. State Capitals Quiz
Countries that Start with U


An innovative programme to help female production workers climb the management ladder has been launched by insulation manufacturer Rockwool.
Staff at the Pencoed-based company have benefitted by signing up to an initiative called Agile Nation Ascent. The project, run by the women's economic development body, Chwarae Teg, aims to boost women's confidence, unlock their management talents and provide them with a recognised qualification.
Rockwool called in Chwarae Teg to help them ensure more women in the business achieved their full career potential. Since the initiative started, ten women from Rockwool have earned accredited Institute of Leadership and Management (ILM) qualifications to help them progress. A further two have been promoted.
Ascent is part of Chwarae Teg's £12.5m European Social Fund and Welsh Government-funded Agile Nation project that is supporting the progression of women in the workplace.
Bob Perry, production director at Rockwool, said: "Rockwool has a good history of tangible success with regards to breaking down barriers, for example the Bridgend factory had Rockwool group's first female factory manager in 1992.
"We've always had women in the offices or labs, but in 2007 we wanted to attract women into manufacturing, which is often seen as a man's environment, so we had a drive to recruit local women. Thank you to Chwarae Teg for their support and for providing the training opportunities for our female workforce."
Hayley Dunne, Agile Nation project manager, added: "When we set up Agile Nation our aim was to have a real impact on real lives and the achievements of these women is this aim realised. I thank the managers at Rockwool for identifying individuals whom they believed had great potential. Congratulations to all the women who have undertaken the Ascent programme and for proving your managers right."


Sheriff's deputies arrested a woman running from the law for a whole year, but the real story is what she did while she was on the run. Heather Grey, 32, stole from C.J. Cannon's restaurant in Vero Beach where she was formerly employed, and was arrested for that crime.
She broke her probation and fled, escaping three arrest warrants, and made ends meet by scamming her own friends and family. Using social media platforms, she told her loved ones she had cancer, or whichever other medical issues she thought might work, and used that to leverage them into sending her money. She used the money she scammed to pay for opioids and other drugs, as well as to use a room in a house. Deputies eventually learned which house she was living in – near 20th Avenue SW and 19th Place SW in Vero Beach – they got a warrant, and they arrested her.
Contact us today if you're on the fast track to a similar situation.
Deputies arrested a fugitive woman Monday afternoon for violating her probation.
But investigators say they're also seeking victims of another one of her alleged crimes — accused of scamming people fund her drug addiction.


Participants are challenged to come up with innovative business ideas related to use of open data. A submission may - but does not need to - use capabilities of fifth-generation (5G) networks like Edge Clouds.
The task is to identify a business opportunity which can be solved with one or more public data sources and develop a business model which utilizes data sources. The opportunity may - but does not need to - use capabilities of fifth-generation (5G) networks like Edge Clouds. A typical submission is expected to include an overview of technical implementation and business related analysis of the proposal. The inclusion of a demonstrator and/or detailed technical description would provide added value to the proposal.
Any relevant data sources used in the proposal are expected to be openly accessible, e.g., APIs of cities of Helsinki or Espoo, meteorological data, etc. The submission can also propose new open data sets which do not yet exist but would enable innovation. It is expected that the submission is innovative and novel and not a simple business case built on top of a single data set. Relevant techniques may involve, for example, multiple data set(s) or combining a data set with a model to create value-add, or employing other means of data augmentation to the same end. All new ideas for adding business value to open data sets are welcome.
As an inspiration, the MegaSense project of Bell Labs and University of Helsinki augments measurements from ubiquitous low-cost sensors with calibrated infrastructure to achieve dense coverage for air quality measurements at a low cost. Even though this is not a productized solution, it exemplifies the technological potential of innovative data manipulation.
Background for low-latency computing in MECs.
Short primer on business aspects of ML.


The leafy salad vegetables like our lettuce, oriental leaves, true spinach and pak choi all start to give up the ghost in October. The days are shortening and the soils begin to cool. For these crops it is a sign that the season is drawing to a close. For the true spinach mildew starts to take hold, while the rate of the growth of the lettuces slows to a point where the resulting heads are either too small or too strong-tasting for the boxes. We have now cut the last of our lettuce at River Nene Organic Farm. Karen and Alec at the Herbary will keep us going until late October and then we may slip in a few glasshouse grown oriental salad mixes in November.


Hi. I've added some more videos to my library at VIMEO.COM .
"Necklace Suture" for Trabeculectomy. Using a silk suture to string-up pledgets/sponges soaked in Mitomycin allows them to be placed more posteriorly without fear of losing them. This facilitates improved posterior drainage and is much safer than conventional methods of placing them under the conjunctiva and rely on visually finding them 3 minutes later. Presented at the World Glaucoma Congress, 2011, Paris.
Constrictor knot for tube surgery. A nautical knot allowing adjustment of tube ligation according to flow. Can be tightened or released once tied. VERY useful for baerveldt tube flow regulation to prevent early hypotony. Again, presented at World Glaucoma Congress, 2011.


text:
Intel Updates Scientists on McKinley, Lower Power
By Mark Hachman on February 4, 2002 at 2:43 am
Intel Corp. this week will present more details of the company's next-generation McKinley processor, as well as more arcane methods to continue eking out improvements in the company's other chips.
Intel is but one of a number of companies making presentations at this week's International Solid-State Circuits Conference in San Francisco, a heavily engineering-oriented conference on the minute details of improving semiconductor performance.
Intel's most high-profile presentations will be an update on the next-generation 64-bit McKinley chip, a discussion of ovonics memory, and several papers on lowering the heat produced by integrated circuits. Intel executives said last week that the company hoped to build upon the speech delivered last year by Pat Gelsinger, the company's chief technical officer, on the importance of thermal management.
Intel will also present a paper on ovonics memory, a non-volatile memory type often thought of as an alternative to flash memory.
Intel will have four papers on McKinley, its next-generation 64-bit chip. The chip started sampling for "pilot" systems last year, and is on track to begin production in mid-2002, according to John Crawford, an Intel fellow and director of McKinley architecture. The chip is slated to launch at 1-GHz and contain an integrated level-3 as well as level-2 cache. The die size is 464 sq. mm, a massive size for a semiconductor.
Intel is also presenting papers on several techniques for lowering power consumption, including "adaptive body bias", a technique where a voltage is applied to a chip substrate. Applying it in a forward direction reduces the active power by up to 23 percent, Intel will claim, according to Justin Rattner, a research fellow. Reverse body bias reduces the leakage current a chip produces by up to 3.5 times the power when the technique is not used. Using an adaptive body bias meshes the two techniques.
Intel will also present a paper on an arithmetic logic unit fabricated on 130-nm tech, running at 6.5-GHz –Intel has reached 10-GHz since then–and using 1.1V of operating voltage. A summary paper will combine the ALU and bias techniques, presenting how Intel could manufacture a 5-GHz integer execution core.
"I think this demonstrates through advanced circuit technology how we can begin to address the power wall that Pat began to address at the circuit conference last year," Rattner said.
Intel will also present a paper on ovonics memory, seen as a low-power future alternative to flash memory and licensed to the company by Energy Conversion Devices. ECD and Intel have formed Ovonyx, a joint venture to commercialize the technology. Intel will present a paper reporting data from a 4-Mbit test chip using an array; a commercialized version is still several years down the road.


Awesome shabby chic bedroom decorating ideas inspirations including curtains impressive for a are fantastic with charming shabby chic bedroom decorating ideas trends with secretary desk appealing decor for. These are some points and can nonetheless be an excellent solution.
6 listing of shabby chic bedroom decorating ideas here to can help your total the work with no trouble.


Some tips and tricks on starting a YouTube channel and creating videos. Pick topics to discuss and upload quality content regularly. Editing is important, as is an appropriate title, description, and keywords. But, one of the most important things is to interact with your viewers.
Hi everyone! This video is going to be about starting a YouTube channel and creating videos. If you are brand new to YouTube and have never done videos before or are just started out, I thought I'd give some tips from my experience on YouTube that can help you begin.
First and foremost, YouTube can be unpredictable. Even if you follow all the guidelines YouTube lays out, it cannot guarantee that your channel will become successful. Depending on the content you produce, or just you as a person, everyone will see what you have to offer differently. You don't really need to spend hours working on your videos in order for your channel to become successful. But, it certainly helps to have things organized and easy to follow. You should do the work, not your audience.
As a bit of personal background. I started my channel to be able to express myself. It's mine, I own it, and I can put up any content I like. It was to help myself get a better grasp of what I struggle with, help those that are in similar situations, to learn, to educate. A variety of things. I was not expecting for it to grow the way it has. And, I truly thank everyone that has supported me and I have been able to help. That really means a lot to me. Because it was all of you that have helped me as well.
Anyway, those were my goals for starting. So before I being, be sure to check the description for resources on how to better optimize your YouTube channel and videos. The YouTube Creator Playbook discusses practically all areas of ways you can optimize your channel and videos for maximum exposure. It does go into a lot more detail than I could possibly cover in this video.
The first thing before even starting is thinking about what you want your channel to be about. You can focus on one topic in particular, or multiple topics. But, you will need to pick something that you enjoy doing and talking about since you do not want it to become a chore and you never update again. Pick something you are passionate about and is fun for you to do.
The next is preparation for the video. All of my videos, with the exception of a select few, are scripted. I spend several days writing up and finalizing the script to my videos so I try to cover as much as possible and don't leave out any crucial points. It's entirely up to you if you wish to do this, if you even have to do this, depending on the content you will be putting out. Alternatively, the best thing to do is mentally review what you want to discuss in your video before beginning. Perhaps even make a checklist so you cover what you want. Or do it completely spontaneously. It's up to you. But, realize that a majority of people that will watch your content will not want to sit there and watch you try and think of what to say. It should organized and easy to follow.
Which brings us to our next crucial point, editing. You can be a pro at editing, or know absolutely nothing about it. Many computers come with a video editing program, and there are even some free ones out there. If you are on Windows, Windows Movie Maker may help you out. On a Mac, iMovie may help. You can even edit on an iPod / iPhone and upload directly to YouTube. It's quite remarkable what you can do now.
Furthermore, if you cannot do any of these, YouTube offers a video editor online. I don't think too many people know about this. I've never personally used this, but you can do quite a bit on it. You can trim and edit, add transitions between clips, and add text. It's amazing. The way you could go about doing this is upload your video privately, edit it, and then make the edited version public and it should be all good. If you need any advice on which video formats YouTube accepts, please check the description for the recommended encoding settings. Personally, for my video editing, I use Adobe Premiere Pro and remove the gaps and apply transitions and text. Everything is done there.
Next, in order for people to find your videos, you need an appropriate title, description, and keywords. In addition to a thumbnail. Of course, a custom thumbnail is not required, but it can helps. It should be something that represents the video and is not misleading. I generally put text on my video thumbnails and you can read it and instantly know what the video will be about. But, you will also need a title, description, and keywords. This is one area where I think a lot of people don't realize how it important it really is. If you video is about a specific topic, be sure to add that to these three so your video can be discovered for that topic. But, do not add irrelevant info as this may impede the process. Furthermore, do not add keywords to the description. These three are distinct separate values.
The 'Title' should be the name of the video. Someone should be able to read it and understand exactly what your video is about.
The 'Description' is a more detailed text of what your video is about.
'Keywords' are how people will find your video and all aspects of your video. So, for instance, if you have a makeup tutorial video, some keywords would be makeup, makeup tutorial, cosmetics, beauty, and other related things depending on the video. YouTube often suggests keywords to you based on the title and description of the video. So if you fill those out, you may see some recommended keywords that are appropriate for your video.
Lastly, another important factor is to engage your viewers. Reply to messages, comments, whatever you like. Most views and comments will come from your fans, audience, viewers, subscribers. Especially within the first few days of uploading a new video. Those that keep staying with you and the content you put out are your real, true fans. And, you should do as much as possible to interact with those loyal followers since they are the ones that will keep watching your videos. YouTube has a feature called 'Top Fans' that allows you to interact with those that have the most engagement on your channel so this may come in handy.
I personally do not like to reply to comments. I do on occasion but it's quite rare. It's just, I don't know, it just makes me too nervous to do it. However, I always try and reply to YouTube messages. Sometimes people get irritated when I am not able to reply to their comment or message. I'm not trying to ignore anyone, I'm just not able to read and reply to everyone's comments and messages. It's impossible. But regardless, I thank you so much for sending them.
Anyway, another way to engage your viewers and increase viewership is to be sure your information is consistent across all social media sites. What I mean is, if you have a YouTube channel and a Facebook page, put the links to your Facebook page on your YouTube channel so people can easily find it. Since YouTuber's now have a Google+ account, be sure to put your Facebook and other sites on there as well. On Facebook, be sure to link back to YouTube so people can easily find your content. Mention your YouTube content so people are more inclined to see it and follow you on multiple platforms. Remember, you should do all the work, not the viewers.
Which brings us to another tip to engage viewers, annotations. How many people dislike when someone talks about a video they did, yet doesn't link it anywhere and you have to search and find what that video is? I don't like that, so what I do is when I discuss something and I refer to another video I did, even if it's a future video, I create an annotation to link to that video. Additionally, I put that link in the description so people can find it. Annotations, when used correctly, do increase viewership. They can help you organize your content better and help those that are truly interested find what they are looking for easier.
Playlists are also very important. I put all my videos in a playlist that match what it is about. Additionally, a setting for the playlist, "Set as official series for this playlist," will help the next video in that playlist appear on the top of the suggested videos. This can really help people go from one to the next in that playlist.
A few miscellaneous tips and info. Quality over quantity. Make videos with a lot of content in them. The actual video and audio quality of your content is important as well. If people cannot see you or hear you, it's going to make them leave your video quicker. I'm not saying go out and buy tons of equipment, but if you have a phone that can record and upload to YouTube, the quality is going to be decent. But, above all that, it's about the content. Meaningful content that is informative, helpful, funny, whatever your channel is about. That is why people will come to your channel. To see something unique that they cannot find elsewhere.
Next, regularly upload videos. You don't need to have a specific schedule, but upload weekly or a few times a week, whatever you find that suits you. Because, less people will be inclined to follow you if you post content irregularly and haven't updated in weeks or months. So, be consistent.
Next, be prepared to lose subscribers with each new video. Sometimes it can be really upsetting when you have just started out and have very few subscribers, then you lose a few here and there. It will happen. People will dislike, leave negative comments, and unsubscribe, that's just how it is. Be prepared for that because this is the Internet, people say and do whatever they like. The overall goal though is to gain more subscribers than lose, and to have overall a positive set of videos versus negative.
Next, adding closed captions to your videos may help. Despite the fact that I have a script for almost all my videos, I do not add captions myself. I don't know why. Maybe I should. But, I don't. Regardless, this may help those that have a difficult time hearing you or speak a different language to understand you better. Doing your own closed captions offer a lot of benefits over the automated captions which can be very incorrect and quite amusing if you've ever looked at them before.
Lastly, respect copyright. Don't put up any copyrighted songs or videos as it could penalize you. It can be tempting, but avoiding it is for the best. Unless the song is royalty free and in the public domain, it's best to just not use it. YouTube actually offers an Audio Library for creators. You can use the songs and music for free. I'll have a link in the description.
So, hopefully this video could help anyone that is interested in doing YouTube videos or are just starting out. The most important thing to remember, especially if you are nervous, that it does get easier putting out videos. If you do it regularly and keep people up to date with what you do, the anxiety does lessen. It is hard at first, but you will get use to it. It was hard for me, but I knew I had to do it. And, despite all the negative, there has been more positive and support that outweighs the negative. So, that is how you have to look at it. So, thanks for watching!
After having quite a bit of success with my own YouTube channel, and knowing how things work and operate, as well as knowing some key strategies to creating a successful channel so viewers can find a user's videos, I decided to create this video to help others that are just starting out. It's funny how I said I don't reply to comments often, or add captions to my videos, when that's exactly what I starting doing shortly thereafter.


text:
DROP TABLE project_dependencies;

CREATE TABLE project_dependencies (
  source_organization  VARCHAR(39)  NOT NULL,
  source_repository   VARCHAR(100) NOT NULL,
  source_version VARCHAR NOT NULL,
  target_organization VARCHAR(39)  NOT NULL,
  target_repository   VARCHAR(100) NOT NULL,
  target_version VARCHAR NOT NULL,
  scope VARCHAR,
  PRIMARY KEY (source_organization, source_repository, source_version, target_organization, target_repository, target_version, scope)
);

redpajama_set_name: RedPajamaGithub


As we ease into the globalization of world economies, the human resources field — especially in the New York or New England area — could be a great spot to be in. Having a degree in human resources could have you not only finding a great job with good job security, but performing a role in which you get to help others and make some pretty decent wages in the process.
But before we get ahead of ourselves here, let's take a few moments to understand exactly what a human resources degree is, what you can do with such a degree, and why having a human resources degree can be so beneficial.
Considering a Human Resources Degree?
If you're considering getting a human resources degree in the New York area, you might want to know what sorts of classes or coursework can be involved in your degree work. Well, as the name denotes, a large part of a human resources degree will revolve around the human aspect of a work environment and how better to deal with the situations that arise in that environment as they relate to the individuals who work there.
Classes that focus on things like motivating, training, and teaching staff members, labor and employment laws, compensation and benefits, conflict resolution, leadership techniques, performance management, coaching and counseling, public speaking, interview techniques, staffing requirements, and all sorts of similar topics could be fitted into a human resources degree program's curriculum.
But how do you know, out of all the possible programs out there, which human resources program will be right for you? Well, it may take some time, but here on our site, we provide a number of tools to help you start to better define your needs and begin to make your selection. You can find schools based upon online or campus-based program, style of program, length of program, proximity of school, and similar criteria. You can also contact programs directly to find out more costs, timeframes, distance learning, and coursework. And you can begin to sort through more than 500 accredited schools and certification programs to find the one that is best for you and your particular needs.
As a parent or someone who is already in a job or career, you might find that an online program fits your situation best. If you're already in or near a campus environment, it might be easy enough to attend a brick-and-mortar school. This is why our site can be so beneficial; it can help you start to make these decisions without ever having to set foot outside your home. Read more about human resources certificate programs.
Are there Good Job in HR?
If you're looking for a job with good pay and availability then starting your job search in the New York area might be the way to go. Not only do you have other metropolitan areas such as Boston and New Jersey in the area, but according to the Bureau of Labor Statistics, New York ranked second in employment level for human resources managers by state in 2011 and had an annual mean wage of $116,850 for this employment field. For the category of "human resources, training, and labor relations specialists, all other" New York ranked third highest by state employment level and offered a mean annual wage at $66,280. Nationally, the mean annual wages for these occupational categories as provide by the BLS were $108,600 and $58,890 respectively.


text:
\section{Introduction}
Low-density parity-check codes (LDPC) are established in many modern communication applications, like fiber-optic, Ethernet, wireless or NAND flash systems.
Especially their capacity approaching error correction capabilities and the existence of iterative message-passing decoding algorithms with high parallelism make LDPC codes an excellent choice.
However, the constantly increasing demand for high data rates and energy-efficient systems requires continuous improvements.

To alleviate the complexity caused by the message transfers between variable and check nodes, finite alphabet decoders that maximize the preserved mutual information have been proposed. Excellent performance is achieved while using only a few bits for the exchanged messages\cite{kurkoski_noise_2008, lewandowsky_information-optimum_2018, meidlinger_quantized_2015, he_mutual_2019,stark_machine_2021, mohr_coarsely_2021,wang_rec_2022}.
Conventional algorithms, like the offset or normalized min-sum decoders\cite{jinghu_chen_reduced-complexity_2005}, work with higher resolutions to achieve similar performance.

On the other hand, the existing mutual information maximizing decoders use non-uniform operations in the node updates that can cause higher hardware complexity than in the conventional algorithms.
One option to perform mutual information maximizing node updates is the two-input lookup table decomposition technique\cite{lewandowsky_information-optimum_2018,kurkoski_noise_2008}. Each lookup table encodes a non-uniform compression mapping for any realization of the two extrinsic input messages, which maximizes the preserved mutual information between the output message and a relevant variable.
Although this avoids exponentially increasing table sizes,  the multiple compression steps in each node update introduce performance degradation\cite{he_mutual_2019, mohr_coarsely_2021}.
To reduce this loss, we decided to focus on the so-called computational domain approach\cite{he_mutual_2019,lee_memory-efficient_2005}. The technique is characterized by three steps: First, small single-input lookup tables translate the low-resolution messages to higher-resolution representation values. Secondly, arithmetic operations combine those values into one high-resolution extrinsic message.
Finally, the extrinsic message is compressed in a single step with non-uniform threshold quantization which enables optimal preservation of relevant information in the compressed output message.

However, as we will show, the non-uniform threshold quantization consumes large amounts of the hardware resources that are dedicated to the check and variable nodes.
In particular, those resources include multiple high-resolution comparison operations and memory for the threshold values.

In this paper, we propose to reduce the complexity further by restricting to symmetric uniform quantization with equally spaced thresholds.
With that restriction, the outputs of the translation tables can be scaled such that the uniform quantization consists only of a simple bit-shift operation.
In this way, no high-resolution comparators or memory for the thresholds are required.
Furthermore, the optimization complexity is potentially reduced since the design involves fewer degrees of freedom than the non-uniform quantization. We observe only a small loss in the preserved mutual information and minor performance degradation in terms of error rates. The main contributions are summarized as follows.
\begin{itemize}
    \item We replace the non-uniform quantization in the computational domain approach with uniform quantization for check and variable nodes. The proposed design eliminates the complexity caused by non-uniform quantization.
    \item We propose a variable node structure leading to symmetric distributions which reduces memory requirements by half and avoids translation tables when using the minimum approximation in the check node.
    \item The non-uniform and uniform solutions are compared in detail with respect to the threshold levels, effect on probability distributions and preserved mutual information. The discrete density evolution method confirms that uniform quantization introduces only a small loss in terms of mutual information.
    \item Error rates simulations reveal that uniform quantization achieves performance within 0.01 dB compared to optimal non-uniform quantization.
\end{itemize}

\section{Mutual Information Maximizing Decoders}
We assume a binary LDPC code with parity check matrix $\mymat{H}\in \{0,1\}^{N_c\times N}$ which can be represented by a Tanner graph with $N$ \glspl{vn} and $N_c$ \glspl{cn}. The encoder maps the information bits $\myvec{u}{\in}\{0,1\}^{K\times 1}$ to code bits $\myvec{b}{\in}\{0,1\}^{N\times 1}$ satisfying $\mymat{H}\myvec{b}{=}\myvec{0}$.
For the transmission, we consider binary phase-shift keying (BPSK) symbols which are disturbed by additive white Gaussian noise (AWGN) at the receiver.
A mutual information maximizing symmetric channel quantizer maps the received symbols to messages $\myvec{m}^{ch}{\in}\mysamplespace{M}^{N}$ with finite alphabet $\mysamplespace{M}$ of bit width $w$\cite{lewandowsky_information-optimum_2018}.
In the decoder, $w$-bit messages are exchanged over multiple decoding iterations between variable and check nodes. We apply a flooding schedule, where one decoding iteration consists of updating all check nodes and, subsequently, all variable nodes.
However, the proposed techniques can be applied apply also to other schedules\cite{mohr_coarsely_2021}. In the first iteration the channel messages are directly forwarded to the corresponding check nodes.

\subsection{Computational Domain Node Updates}\label{sec:comp_domain_updates}
\begin{figure}[t]
    \centering
    \includestandalone[mode=tex,width=0.8\linewidth,]{standalones/full_cnu_hardware/source}
    \vspace{-0.2cm}
    \caption{Full check node.}
    \label{fig:full_cnu_hardware}
\end{figure}
As explained in the introduction, in this work we focus on reducing the complexity of the computational domain approaches for check and variable nodes\cite{lee_memory-efficient_2005,he_mutual_2019}. In the following, we extend this framework by replacing the non-uniform with uniform quantization.
\subsubsection{Check Node}
A check node of degree $d_c$ receives the variable node messages $m^v_i\in \mysamplespace{M}$ with $i{\in }\mathcal{N}_c{=}\{1,\ldots,d_c\}$. Each message $m_i^v$ provides information about a code bit $x_i^c$ that participates in the parity check equation $x^c_{1}{\oplus}x^c_{2} {\oplus} \ldots {\oplus} x^c_{d_c}{=}0$.
The mutual information maximizing node update (derivation in appendix \ref{app:derivation_cn_operation}) yields\cite{he_mutual_2019}
\begin{align}
\begin{split}
m^c_j=Q^c\left(\prod_{i\in \mathcal{N}_c\setminus \{j\}}\operatorname{sgn}(\phi^v_i(m^v_i))\sum_{i\in \mathcal{N}_c\setminus \{j\}} |\phi^v_i(m^v_i)|\right).
\label{equ:cn_update}
\end{split}
\end{align}
In (\ref{equ:cn_update}), $\phi^{v}_i$ are small translation tables computed according to
 $\phi^{v}_i(m^v_i) = \operatorname{sgn}(L(x^c_i|m^v_i))(-\log|\tanh L(x^c_i|m^v_i)/2|)$ with the log-likelihood ratio (LLR) being $L(x|m)=p(x{=}0|m)/p(x{=}1|m)$.
The quantizer $Q^c$ is defined by a threshold set
and $\max_{Q^c} I(\myvar{X}^c_j;\myvar{M}_j^c)$ can be performed, e.g., using the sequential information bottleneck algorithm\cite{lewandowsky_information-optimum_2018}.
\subsubsection{Variable Node}
\begin{figure}[t]
    \centering
    \includestandalone[mode=tex]{standalones/full_vnu_hardware/source}
    \vspace{-0.2cm}
    \caption{Full variable node update.
    }
    \label{fig:full_vnu_hardware}
\end{figure}
\begin{figure}
     \vspace{-0.3cm}
    \begin{subfigure}[b]{0.47\linewidth}
        \includestandalone[width=\textwidth, mode=tex]{standalones/quant_nonuniform_hardware/source}
        \caption{Non-uniform}
        \label{fig:hardware_quant_nonuniform}
    \end{subfigure}
    \hfill
    \begin{subfigure}[b]{0.5\linewidth}
        \includestandalone[width=\textwidth, mode=tex]{standalones/quant_uniform_hardware/source}
        \caption{Uniform}
        \label{fig:hardware_quant_uniform}
    \end{subfigure}
    \caption{Hardware schematics for performing quantization with $w_y=9$ bit as the bit width of $y$ and $w=4$ bit for $t$.}
    \label{fig:hardware_quant}
\end{figure}
A variable node of degree $d_v$ receives the channel and check node messages, $m^{ch}\in \mysamplespace{M}$ and $m_i^c\in \mysamplespace{M}$ with $i{\in}\mathcal{N}^v{=}\{1,\ldots, d_v\}$. All messages provide information about the underlying code bit $x^v$. The mutual information maximizing variable node update yields\cite{he_mutual_2019, stark_machine_2021, mohr_coarsely_2021}:
\begin{align}
    m^v_j = Q^v\left(\phi^{ch}(m^{ch}) + \sum_{i\in \mathcal{N}_v\setminus \{j\}} \phi^c_i(m^c_i)\right),
    \label{equ:vn_update}
\end{align}
where $\phi^{ch}(m^{ch}){=}L(m^{ch}|x^v)$ and $\phi^c_i(m^c_i){=}L(m^c_i|x^v)$ represent small translation tables.
Similar to the check node, the quantizer $Q^v$ is optimized according to $\max_{Q^v} I(\myvar{X}^v;\myvar{M}^v_j)$.

\subsection{An Efficient Hardware Design with Uniform Quantization}\label{sec:hardware}
In practice, the internal resolution after translation is limited to $w_{\phi}$ bits. Computations in the check node update (\ref{equ:cn_update}) and variable node update (\ref{equ:vn_update}) are performed with integer instead of real valued numbers. Therefore, the translation lookup table $\phi{=}\phi^v, \phi^{ch}\text{ or }\phi^c$ is scaled to an integer range with
\begin{align}
    \phi_{\Delta}(m){=}\operatorname{sgn}(\phi(m)) \operatorname{min}\left(\left\lfloor\frac{1}{\Delta}|\phi(m)|{+}\frac{1}{2}\right\rfloor{,} 2^{w_{\phi}{-}1}{-}1\right)
\end{align}
where $\phi_{\Delta}(m)\approx \frac{1}{\Delta}\phi(m)$ and $\Delta\in \mathbb{R}^+$.

Fig.~\ref{fig:full_cnu_hardware} and Fig.~\ref{fig:full_vnu_hardware} depict possible hardware structures to perform the update for all outputs of the check node or variable node, respectively. For an efficient implementation we assume symmetric distributions of the input messages with $p(\myvar{X}{=}0, \myvar{M}{=}m)=p(\myvar{X}{=}1,\myvar{M}{=}{-}m)$ when using a sign-magnitude (SM) format with $m\in\mysamplespace{M}{=}\{{-}2^{w-1},\ldots,{-}1,{+}1,\ldots,{+}2^{w-1}\}$.
In this way, translation tables only require the message's magnitude bits to perform the mapping into the computational domain, which cuts the memory demand by half.
\subsubsection{Symmetry Preserving Variable Node Update}
In contrast to the check node, the variable node performs signed addition using the 2's complement format, such that the same hardware component can deal with addition and subtraction.
Therefore, after translation, one conversion step from SM to the 2's complement format is required, which can be implemented with a few logic gates. After summation, another conversion back to the SM format is done. Hence, only the magnitude part must be quantized. Note, that this can cause an asymmetric distribution $p(x^v,y)$: If the summation yields $y_{\text{2's}}{=}0$, conversion to the SM format leads to $y{=}{+}1$ and, therefore, $p(\myvar{Y}{=}{+}1)>p(\myvar{Y}{=}{-}1)$.
For canceling out asymmetric distributions in the design phase, we use two types of variable nodes: One adds up negative LLRs and inverts the sign at the output; the other requires no modifications. In this way, we enforce a symmetric distribution
\begin{align}
p(x^v,y){=}p(x^v,\myvar{Y}_\text{2's}{=}y){+}\begin{dcases}p(x^v,\myvar{Y}_\text{2's}{=}0)/2 & y{=}\pm 1\\
0 & y\neq \pm 1
\end{dcases}.
\end{align}
\subsubsection{Non-Uniform Quantization}
We perform the symmetric non-uniform quantization with $Q$ as $Q^v$ or $Q^c$ according to
\begin{align}
Q(y)=\operatorname{sgn}(y)\begin{dcases}
1 & |y|{<}\tau_{0}\\
i & \tau_{i}{<}|y|{<}\tau_{i+1}, 0{<}i{<}2^{w-1}{-}2\\
2^{w-1} & |y|{<}\tau_{2^{w-1}-2}
\end{dcases}.
\end{align}
The corresponding hardware implementation is depicted in Fig.~\ref{fig:hardware_quant_nonuniform}. The threshold quantization with a binary search technique involves $w{-}1$ high resolution comparisons. For the full update in total $d_v(w{-}1)$ comparisons are required, which can cause even more complexity than the addition operations. Furthermore, memory and logic are necessary to hold and select the appropriate thresholds $\{\tau_0,\ldots, \tau_{2^{w-1}-2}\}$.

\subsubsection{Uniform Quantization}\label{sec:uniform_quantization}
We perform symmetric uniform quantization with $Q$ as $Q^v$ or $Q^c$ according to
\begin{align}
Q(y)=\operatorname{sgn}(y)\min\left(\lfloor |y|/2^R\rfloor+1,2^{w-1}\right).
\end{align}
An efficient hardware implementation is proposed in Fig.~\ref{fig:hardware_quant_uniform} with a right-shift operation by $R\in \mathcal{Z}^+$ positions and a subsequent clipping such that the desired resolution $w$ is obtained. By modifying $R$ and the scaling factor $\Delta$ for the translation tables, any uniform boundary spacing, $\Delta(\tau_{i+1}{-}\tau_i){=}\Delta 2^{R}$ w.r.t. the reconstructed LLRs $\Delta{\cdot} y\approx L(x|y)$, can be achieved.
The optimal uniform quantization is obtained with a grid based search aiming for $\max_{\Delta, R} I(X;T)$ where $T{\coloneqq} M^v_j$ ($M^c_j$) and $X{\coloneqq} X^v$ ($X^c_j$). Only $(w_y{-}w{-}R){+}(w{-}1)$ logic OR gates are required, which is negligible complexity compared to the hardware used for the non-uniform threshold quantization in Fig.~\ref{fig:hardware_quant_nonuniform}.
Note, that an offset $\kappa$ for the check node quantizer $Q^c(y')$ with $y'{=}\operatorname{sgn}(y)(|y|+\kappa)$, can improve the performance especially for higher iterations by moving the first boundary $\tau_0$ closer to the decision threshold.

\subsection{Check Node with Minimum Approximation}
Instead of (\ref{equ:cn_update}), another option is the check node update with minimum approximation from \cite{meidlinger_quantized_2015},
\begin{align}
\begin{split}
m^c_j=\prod_{i\in \mathcal{N}_c\setminus \{j\}}\operatorname{sgn}(\phi^v_i(m^v_i))\min_{i\in \mathcal{N}_c\setminus \{j\}} |m^v_i|,
\label{equ:cn_update_min}
\end{split}
\end{align}
where the symmetric design of section \ref{sec:hardware} is assumed. The number of comparisons required in hardware can be reduced to $d_c{+}\lceil \log_2 d_c \rceil-2$\cite{lee_low-complexity_2015}. Note, that the two-minima search additionally involves many multiplexers in hardware.

\subsection{Complexity Evaluation}
\begin{table}
    \centering
    \caption{Complexity of variable and check nodes.
    \label{table:complexity_vnu}
    \setlength{\tabcolsep}{3pt}
    \begin{tabular}{ccccc}
        &\multirow{2}{*}{\shortstack[c]{node\\variant}}& \multirow{2}{*}{\shortstack[c]{additions/\\comparisons}}  & \multirow{2}{*}{\shortstack[c]{$\phi$}} & \multirow{2}{*}{\shortstack[c]{memory requirements\\ { in [bit]}}} \\
        &&&&\\
        \hline
        \multirow{4}{*}{CN}
        &non-uniform &$(w{+}1)d_c{-}2$                   & $d_c$                 &$(w_\phi{+}w_s{-}1)2^{w-1}$\\
        &uniform &$2d_c{-}2$                         & $d_c$                 &$w_\phi2^{w-1}$          \\
        &min. approx.&$d_c{+}\lceil \log_2 d_c \rceil-2$                           &-                      &-               \\
        &OMSQ    &$d_c{+}\lceil \log_2 d_c \rceil$   &-                      &-               \\
        \hline
        \multirow{3}{*}{VN}
        &non-uniform &$(w{+}1)d_v{-}1$                   & $d_v{+}1$             &$(2w_\phi{+}w_s{-}3)2^{w-1}$\\
        &uniform &$2d_v{-}1$                         & $d_v{+}1$             &$(2w_\phi{-}2)2^{w{-}1}$\\
        &OMSQ    &$2d_v{-}1$                         &-                      &-\\
    \end{tabular}
    \vspace{-0.0cm}
\end{table}
In Table \ref{table:complexity_vnu}, the check and variable node complexity of the proposed decoders is compared to the offset min-sum (OMSQ) algorithm\cite{jinghu_chen_reduced-complexity_2005}. The non-uniform decoder has clearly the highest number of operations for check and variable nodes, due to the more expensive quantization. Also the memory requirements are highest to represent the translation tables and boundaries. In contrast, the uniform decoder can avoid comparisons and memory for boundaries. Further complexity reduction is achieved by using the minimum approximation in the check node, where only a first and second minimum search must be performed and no translation tables are required\cite{jinghu_chen_reduced-complexity_2005, meidlinger_quantized_2015}. The OMSQ check node has slightly higher complexity due to the offset operation.

\section{Performance Evaluation}
\subsection{Density Evolution Analysis of Different Quantizers}\label{sec:dde_analysis_different_quantizers}
\begin{figure}[t]
    \begin{subfigure}[b]{0.5\textwidth}
        \hspace{-1.0cm}
        \includestandaloneresized[width=0.95\linewidth, ratio=0.55]{standalones/cn_nonuniform/source}
        \vspace{-0.1cm}
        \caption{Non-uniform}
        \label{fig:cn_nonuniform}
    \end{subfigure}
    \hfill
    \begin{subfigure}[b]{0.5\textwidth}
        \vspace{-0.0cm}
        \hspace{-1.0cm}
        \includestandaloneresized[width=0.95\linewidth, ratio=0.55]{standalones/cn_uniform/source}
        \vspace{-0.1cm}
        \caption{Uniform}
        \label{fig:cn_uniform}
    \end{subfigure}
    \caption{Check node distributions and boundary placements.}
    \label{fig:cn_comparisons}
    \vspace{-0.0cm}
\end{figure}
\begin{figure}[t]
    \begin{subfigure}[b]{0.5\textwidth}
        \hspace{-1.0cm}
        \includestandaloneresized[width=0.95\linewidth, ratio=0.55]{standalones/vn_nonuniform/source}
        \vspace{-0.5cm}
        \caption{Non-uniform}
        \label{fig:vn_nonuniform}
    \end{subfigure}
    \begin{subfigure}[b]{0.5\textwidth}
        \vspace{-0.0cm}
        \hspace{-1.0cm}
        \includestandaloneresized[width=0.95\linewidth, ratio=0.55]{standalones/vn_uniform/source}
        \vspace{-0.5cm}
        \caption{Uniform}
        \label{fig:vn_uniform}
    \end{subfigure}
    \caption{Variable node distributions and boundary placements.}
    \vspace{-0.0cm}
    \label{fig:vn_comparisons}
\end{figure}
For the mutual information maximizing decoder design, discrete density evolution\cite{kurkoski_noise_2008} is used to track the distributions of messages with respect to relevant variables.

In Fig.~\ref{fig:cn_comparisons} and \ref{fig:vn_comparisons}, the optimization results and corresponding distributions are shown for check and variable node designs in the first iteration. The degree distribution corresponds to the code of section \ref{sec:scenario1} with $d_c{=}32$ and $d_v{=}6$. The design SNR is set to $E_b/N_0{=}3.3$ dB. The internal resolution is $w_\phi=8$\,bit.
In the following analysis we consider the quantizer operation of (\ref{equ:cn_update}) and (\ref{equ:vn_update}) as information bottleneck setups, where $\myvar{X}$, $\myvar{Y}$ and $\myvar{T}$ are defined as the relevant, observed and compressed variable, respectively\cite{lewandowsky_information-optimum_2018}.
For the check node $\myvar{X}{=}\myvar{X}^{c}_j$ and $\myvar{T}{=}\myvar{M}^c_j$. For the variable node $\myvar{X}{=}\myvar{X}^{v}$ and $\myvar{T}{=}\myvar{M}^v_j$. In both cases the observed variable $\myvar{Y}$ is the quantizer input.
Please note, that the horizontal axis shows only half of the sample space $\mathcal{Y}$ w.r.t. positive LLRs, since the other half is symmetric. Furthermore, the integers $y$ are scaled with $\Delta$ to facilitate comparisons of the boundary placements in Fig.~\ref{fig:cn_comparisons} and \ref{fig:vn_comparisons}.

\subsubsection{Check Node}
Looking at Fig.~\ref{fig:cn_nonuniform}, it can be seen that the boundaries are more dense in regions where $L(x|y)$ has steeper slope. This is reasonable, since the optimization procedure aims at minimizing the loss of relevant information
\begin{align}
\begin{split}
     &\min_{Q}\small I(X;Y){-}I(X;T)\\
    =&\min_{Q} \sum_y p(y)D_{\text{KL}}(p(x|y)||p(x|t{=}Q(y))),
    \label{equ:mi_diff}
\end{split}
\end{align}
where the Kullback Leibler divergence is given by $D_{\text{KL}}(p(x|y)||p(x|t))=\sum_x p(x|y)\log \frac{p(x|y)}{p(x|t)}$. From (\ref{equ:mi_diff}) we can conclude that the loss is increased more severely, if $D_{\text{KL}}$ (always non-negative) is large and if the event $y$ has high probability of occurrence $p(y)$. Consequently, the boundaries in Fig.~\ref{fig:cn_nonuniform} are more dense in regions where the meaning $L(x|y)$ changes rapidly, to combat large divergences.

In Fig.~\ref{fig:cn_uniform}, we observe that the uniform quantization mimics the behavior of the non-uniform solution. The mutual information difference of non-uniform and uniform check node ($0.0443{-}0.0441{=}0.0003$) is almost negligible, compared to the mutual information difference of non-uniform and minimum approximation check node ($0.0443{-}0.0407{=}0.0036$).  Also note, that $p(y)$ depends on the spacing $\Delta{=}0.02277$ (uniform) which is different from $\Delta{=}0.02814$ (non-uniform).
\subsubsection{Variable Node}
For the two variable node setups we use the same check node implementation (minimum approximation), to have a fair comparison in the first iteration.
For the non-uniform quantizer at the variable node in Fig.~\ref{fig:vn_nonuniform}, the rate of change in $L(x|y)$ is constant w.r.t. to $y$. Therefore, the boundary placement is determined primarily by the fact that $D_\text{KL}$ has less contribution for large $L(x|y)$, and, secondly, by $p(y)$. Especially the first effect causes the optimization to place the boundaries more densely close to $y=0$.

The uniform quantization at the variable node in Fig.~\ref{fig:vn_uniform} turns out to be very effective, too. Compared to Fig.~\ref{fig:vn_nonuniform} the difference in mutual information $0.9056-0.9053=0.0003$ is similar to the loss observed for the uniform check node.
\subsubsection{Summary}
Overall, we can conclude that the boundary placement depends mainly on three effects:
\begin{enumerate}
    \item Clustering of events that are close in meaning, e.g. merging $y_1$ and $y_2$ where $L(x|y_1)\approx L(x|y_2)$, causes relevant information loss in (\ref{equ:mi_diff}).
    \item Clustering in regions with low reliability, i.e., where $|L(x|y)|$ is small, leads to more information loss than clustering in regions with high reliability. This effect is less dominant than the first one, as we have seen when comparing the check node to the variable node results.
    \item Clustering in regions where $p(y)$ is small, has minor influence on the relevant information loss in (\ref{equ:mi_diff}) and, therefore, the boundaries are less dense in those regions.
\end{enumerate}

\subsection{Decoder Design and Error Rate Performance}
In this section we compare the performance in terms of mutual information and error rates. All scenarios use either 3 or 4 bits for the channel quantizer, variable node and check node messages. The internal resolution is $w_{\phi}=8$\,bit. Smaller resolutions like $w_{\phi}{=}6$\,bit introduced degradation of about 0.01\,dB. Table \ref{table:setups_vns} summarizes the node configurations used in this work. The first part of each decoder label specifies the check node and the second part the variable node. In the error rate simulations, the design $E_b/N_0$ is optimized for best frame or bit error rate performance.

\begin{figure}[t]
    \begin{subfigure}[b]{0.5\textwidth}
        \includestandaloneresized[width=0.9\textwidth, ratio=0.7]{standalones/dde_code3_mi_ctv[4]/source}
        \caption{4 bits, $E_b/N_0=3.3$ dB}
        \label{fig:mi_ctv_code2_4bit}
    \end{subfigure}
    \hfill
    \begin{subfigure}[b]{0.5\textwidth}
        \includestandaloneresized[width=0.9\textwidth, ratio=0.7]{standalones/dde_code3_mi_ctv[3]/source}
        \caption{3 bits, $E_b/N_0=3.4$ dB}
        \label{fig:mi_ctv_code2_3bit}
    \end{subfigure}
    \caption{Evolution of mutual information for scenario 1.}
    \label{fig:evolution_of_mi}
\end{figure}

\begin{table}[t]
    \centering
    \caption{Check and variable node variants.
    \label{table:setups_vns}
    \setlength{\tabcolsep}{3pt}
    \begin{tabular}{ccccc}
        node&label & description & equation & reference\\
        \hline
        \multirow{3}{*}{CN}&comp      &  non-uniform comp. domain & (\ref{equ:cn_update}) & \cite{he_mutual_2019}\\
        &comp(uni)         &  uniform comp. domain &(\ref{equ:cn_update}), \ref{sec:uniform_quantization} & proposed\\
        &min               &  minimum approximation & (\ref{equ:cn_update_min}) & \cite{meidlinger_quantized_2015}\\
        \hline
        \multirow{3}{*}{VN}&comp      &  non-uniform comp. domain&(\ref{equ:vn_update}) & \cite{he_mutual_2019}\\
        &comp(uni)         &  uniform comp. domain & (\ref{equ:vn_update}), \ref{sec:uniform_quantization} & proposed\\
        &lut              &  two-input lookup tables & - &\cite{lewandowsky_information-optimum_2018}
    \end{tabular}
    \vspace{-0.0cm}
\end{table}

\begin{figure}[t]
    \vspace{-0.3cm}
    \hspace*{-0.7cm}
    \includestandaloneresized[width=1.0\linewidth, ratio=0.9]{standalones/code3_10_ber/source}
    \vspace{-0.6cm}
    \caption{Frame error rates for scenario 1 (3 and 4 bits).}
    \label{fig:ber_code2_3_4bit}
\end{figure}

\subsubsection{Scenario 1}\label{sec:scenario1}
We analyze the performance for a rate $R{=}0.841$ code from \cite{noauthor_standard_2006} with $N{=}2048$, $d_c{=}32$ and $d_v{=}6$. First, the evolution of mutual information in Fig. \ref{fig:evolution_of_mi} is evaluated.

For the 4-bit decoding in Fig.~\ref{fig:mi_ctv_code2_4bit} the non-uniform quantization configuration in check and variable node converges fastest. Remarkably, only very small degradation occurs, when restricting to uniform quantization in check and/or variable node. Using the minimum approximation in the check node results in more significant mutual information loss.
The lookup table based variable node is significantly outperformed by the computational domain solutions.

Also for 3-bit decoding in Fig.~\ref{fig:mi_ctv_code2_3bit}, uniform quantization in check and variable node leads only to minor performance degradation. Further, we note that the loss from using concatenated lookup tables in the variable node is more severe for 3-bit decoding because of the internal quantization loss.

The frame error rate results for a maximum of 10 decoding iterations are depicted in Fig.~\ref{fig:ber_code2_3_4bit}. The mutual information performances differences translate to high frame error rates~${>}10^{-4}$. The performance loss from the uniform compared to the non-uniform configurations is less than~0.01\,dB.
However, for the region ${<}10^{-5}$ cycle effects start to dominate the performance, which are not taken into account in discrete density evolution. For low error rates the minimum approximation closes the performance gap to the computational domain approach, which indicates more robustness against cycle effects. This phenomenon was also observed in \cite{mohr_coarsely_2021}.
The 3-bit uniform decoders achieve similar performance as the 4-bit conventional offset-min-sum decoder (OMSQ).
\subsubsection{Scenario 2}
A medium-rate $R{=}0.5$ code with $N{=}8000$, $d_c{=}6$ and $d_v{=}3$ is considered, which was also studied in \cite{lewandowsky_information-optimum_2018} with label '8000.4000.465'.
As observed in scenario 1, the bit error rates in Fig.~\ref{fig:ber_code2_3_4bit} confirm that restriction to uniform quantization introduces only barely noticeable performance differences. Especially, for 3-bit decoding gains of 0.08\,dB of the computational domain decoder are achieved over the lookup table based configuration. The 3-bit decoder with minimum approximation in the check node looses only 0.04\,dB compared to the 4-bit OMSQ decoder.

\section{Conclusions}
This paper revealed significant complexity reduction potential with minor performance loss for mutual information maximizing decoding by replacing non-uniform with uniform quantization operations. The proposed hardware structure essentially eliminated most of the resources required for non-uniform quantization in the computational domain approach for check and variable nodes.
For the check node update, the minimum approximation still achieved the lowest complexity at the price of performance losses ranging from 0.015-0.025\,dB compared to uniform quantization.
Therefore, the most promising candidate was a 3-bit decoder using the variable node with uniform quantization and check node with minimum approximation, achieving performance close to 4-bit OMSQ decoding, with the potential to significantly save wiring and register complexity.

\section{Appendix}
\subsection{Computational Domain Check Node Update Derivation}\label{app:derivation_cn_operation}
This section uses results from \cite{he_mutual_2019, stark_machine_2021} to derive the check node update (\ref{equ:cn_update}). For simplicity, consider a check node of degree $d_c{=}3$. Bit $b_3$ can be obtained from the parity check equation with $b_3{=}b_1{\oplus}b_{2}$. Correspondingly, soft information can be computed from the probabilities $p(b_1)$ and $p(b_2)$ through circular convolution $p(b_3){=}\sum_{b_1}p(b_1)p(b_2{=}b_3{\ominus} b_1)$, which is equivalently performed in frequency domain using the DFT as $p(b_3){=}\mathcal{F}^{-1}\left\{\mathcal{F}\{p(b_1)\}\mathcal{F}\{p(b_2)\}\right\}$. Then, $p(b_3{=}0){=}\frac{1}{2}{+}\frac{1}{2}\left(p(b_1{=}0){-}p(b_1{=}1)\right)\left(p(b_2{=}0){-}p(b_2{=}1)\right)$. The result can be generalized for degree $d_c{>}3$, where $p(b_{d_c}{=}0){=}\frac{1}{2}{+}\frac{1}{2}\prod_{i{=}1}^{d_c-1}\left(p(b_i{=}0){-}p(b_i{=}1)\right)$. The corresponding LLR is given by
\begin{align}
\begin{split}
        L(b_{d_c})&=\log\left(\frac{\frac{1}{2}+\frac{1}{2}\prod_{i=1}^{d_c-1}\psi_i}{\frac{1}{2}-\frac{1}{2}\prod_{i=1}^{d_c-1}\psi_i}\right)
        =2\tanh^{-1}\prod_{i=1}^{d_c-1}\psi_i,
\end{split}
\end{align}
where $\psi_i{=} p(b_i=0)-p(b_i=1)=\tanh \frac{L(b_i)}{2}$. Performing the multiplication in log-domain, we get:
\begin{align}
\begin{split}
L(b_{d_c})&=\left(\prod_{i=1}^{d_c-1} \operatorname{sgn}\psi_i\right)2\tanh^{-1}\exp\left(\sum_{i=1}^{d_c-1}\log|\psi_i|\right).
\label{equ:llr_cn_output}
\end{split}
\end{align}
It is shown in \cite{kurkoski_quantization_2014}, that using a binary LLR as the input $y\coloneqq L(b_{d_c})$ of a threshold quantizer $t{=}Q(y)$, mutual information maximizing compression $\max_{Q} I(X;T)$ is achievable.
The monotonic increasing $\tanh^{-1}$-function has no effect on the order of input events to the quantizer. Furthermore, note that $\exp(-x)$ is a monotonic decreasing function of $x$ with $x=\sum_{i=1}^{d_c-1}(-\log|\psi_i|)$, which only inverts the order w.r.t. the magnitude of the input events. Thus, threshold quantization is equivalently performed with
\begin{align}
\begin{split}
y\coloneqq\left(\prod_{i=1}^{d_c-1} \operatorname{sgn}(\psi_i)\right)\sum_{i=1}^{d_c-1}(-\log|\psi_i|).
\end{split}
\end{align}

\begin{figure}[t]
    \hspace*{-0.7cm}
    \includestandaloneresized[width=1.0\linewidth, ratio=0.9]{standalones/code1_50_ber/source}
    \vspace{-0.6cm}
    \caption{Bit error rates for scenario 2 (3 and 4 bit).}
    \label{fig:ber_code1_3_4bit}
\end{figure}

redpajama_set_name: RedPajamaArXiv


Orlando Car Accident lawyer, personal injury and wrongful death attorney jeremiah jaspon has recovered MILLIONS for injured victims. $500,000 Car Accident Case Orlando, FL Car Accident Drunk Driving Case. $270,000 Vehicular Accident Case Confidential settlement.
Medical Malpractice Lawyer North Palm Beach, Fl – Find the best Medical Malpractice lawyer in West Palm Beach, FLFREE detailed reports on 172 medical malpractice attorneys in West Palm Beach, Florida including disciplinary sanctions, peer endorsements, and reviews. West Palm Beach, FL Medical malpractice lawyers (172 results).


Tarte Buffy Bamboo Face Powder Brush ~ $38.00 CAN.
If this brush looks familiar, it's because I just talked about it in My First Sephora Orders post - I bought this over 4 years ago and it is just as good as the day I bought it! Writing that post reminded me that there is probably only a handful of days in over 4 years that I haven't used this brush. It is a must-have for me! It is so fluffy and just applies any powder really nicely all over. Sadly, this is discontinued now, so this better last me years and years longer; because, I don't know what I will do when this is done!
Ooooh, I was lucky enough to get this is in a Topbox Circle and it is so good! It really does go on super precise, while still managing to look natural and fill in. The colour match is great for me and it's long wearing! Goes on easy so you don't have to press too hard or tug; but, it's not too creamy where it would go every where. So good!
Charlotte Tilbury Bar of Gold Highlighter ~ $75.00 CAN for palette of 3 (not sold individually anymore).
Charlotte Tilbury is on my list of brands I want to try more from; but, they are a little pricey. I have heard so many great things about this highlighter (and the new trio palette it comes in), so when I found a fellow CBB'er selling it on her instagram, I had to pick it up! This is a gorgeous highlighter - perfect for Fall. It's gold without being too yellow and just gives the perfect amount of sheen and glow on the highlights of the face. It has been my go-to all month long!
Vichy Aqualia Thermal Rehydrating Serum ~ $42.95 CAN. Aqualia Thermal skincare serum recharges dry & dehydrated skin with intense hydration, using 97% naturally-derived ingredients, including Hyaluronic Acid, fortifying Vichy mineralizing water, and plant sugar mannose. Skin is instantly dewy-fresh, feels comfortable, stays hydrated for up to 48 hours and are as reinforced even under climate variations, stress, or pollution.
I just posted a full review of this serum recently - you can check out my full thoughts here! I have used the Mineral 89 booster almost every day for well over a year and this is the only serum that is rivalling it for a spot in my morning routine. This has kept my skin hydrated and clear. It just works so well for my skin, absorbs quickly and isn't heavy at all!
Hard Candy Velvet Matte Mousse in Heather ~ $6.00 US/ $7.98 CAN. Just 1 swipe needed! Full coverage matte liquid lip color (with a vanilla frosting scent!) hydrates lips, offers comfortable wear and delivers bold long-lasting wear.
I just reviewed these lipsticks here - you can see my thoughts and try-on here! These are super long wearing and really comfortable! If I can wear this for hours, eat spicy pizza and then still have this on lips and looking good, it is a total winner for me! I haven't worn it a ton; but, it was so impressive when I did that it will become a Fall go-to with the formula. I know I could wear this everywhere and not be worried about it moving. Also, the little tin has a mirror in it for re-application if needed!


text:
Q: Django: Displaying formset errors correctly I have an inline formset for a model, which has a unique_together constraint. And so, when I input data, which doesn't fulfill this constraint, it displays:
__all__Please correct the duplicate values below.
The code, which does this is:
    {% for error in formset.errors %}
        {{ error }}

    {% endfor %}

I don't much like the __all__ at the beginning of the error and it is quite clearly the dictionary key, so I tried:
    {% for key, error in formset.errors %}
        {{ key }}: {{ error }}

    {% endfor %}

But then all I get is:
__all__:
{{ error }} won't display at all. So what's going on here? And how do I display the error correctly?

A: Here is a clarification for anyone encountering similar issues of errors not being rendered in template:
If you have and error regarding the formset as a whole, use:
{{ formset.non_form_errors }}

this basically returns errors in __all__ entry from formset.errors. It is documented as:
    """
    Returns an ErrorList of errors that aren't associated with a particular
    form -- i.e., from formset.clean(). Returns an empty ErrorList if there
    are none.
    """

However if you are rendering forms from formset and some errors are not being renderd, you are probably missing:
{% for form in formset.forms %}
    {# ... #}
    {{ form.non_field_errors }}
{% endfor %}

this returns errors in __all__ entry from form.errors. Those are, analogous to the non_form_errors, the errors that aren't associated with a particular field, but rather with the field relations. For example if you had a form with fields From and To, and you validate if From value is smaller then To value, the tag {{ form.non_field_errors }} could render the following error:
'The From value must be smaller than the To value'

A: Django 1.6 formsets have a new method, BaseFormSet.total_error_count. Using this in a template conditional ensures you only will output errors and markup if at least one error exists in the formset.
{% if formset.total_error_count %}

    {% for dict in formset.errors %}
        {% for error in dict.values %}

{{ error }}

        {% endfor %}
    {% endfor %}

{% endif %}

See the Django docs page for v1.6+.

A: I think the problem here is that formset.errors is a list of dictionaries, not a single dictionary.
From the Django docs page on formsets:
>>> formset.errors
[{}, {'pub_date': [u'This field is required.']}]

See if something like this fixes the problem: (Updated based on the askers comments)
{% for dict in formset.errors %}
    {% for error in dict.values %}
        {{ error }}
    {% endfor %}
{% endfor %}

If that fails, I'd try using manage.py shell, and try to reproduce your situation in the python shell... that way it will be easy to inspect the various values and figure out what you need to do.

A: The for loops are unnecessary, these errors should be correctly displayed with the following:
{{ formset.non_form_errors }}

redpajama_set_name: RedPajamaStackExchange


William Mooney, age 77 entered into rest August 2, 2014 at his Festus residence. He was retired from Taylor Excavating as a heavy equipment operator and was a U.S. Air Force veteran; he enjoyed fishing and hunting. Born November 7, 1936, in Kings Mountain, North Carolina, to the late Augustus and Hester (Cook) Mooney.
Survived by his loving family which includes daughters: Tammy (Edward) Holst of Bloomsdale, MO, Debbie (John) Barton of Festus, MO and Karen Betancourt of Bonne Terre, MO; son, Bill (Rena) Mooney of Imperial, MO; grandchildren: Travis, Chad, Dana, Shannon, Megan, Chuck, Heather and Matt; great grandchildren: Madison, Nolan, Gavin, Sophia, Chaz and Kane; nieces, nephews and friends. He was preceded in death by his wife, Carol Mooney, on January 10, 2014 as well as 5 brothers and 3 sisters.


Kingston Conservatives have been branded arrogant and out of touch for their 'ambitious growth' agenda. Kingston Futures is their Council planning quango to deliver this overdevelopment.
Now Kingston Conservatives have refused to allow public scrutiny of the £4 million Kingston Futures budget.
Residents have a right to know how this massive amount of THEIR money is being spent. We are determined that we will find out and publicly question how the £4 million is value for money.
If you want to be updated on this, please provide your details below.


text:
Home 1 › Eric Scerri: A Tale of Seven Scientists and a New Philosophy of Science 2
Eric Scerri: A Tale of Seven Scientists and a New Philosophy of Science
2016 hardcover
In his latest book, Eric Scerri presents a completely original account of the nature of scientific progress. It consists of a holistic and unified approach in which science is seen as a living and evolving single organism. Instead of scientific revolutions featuring exceptionally gifted individuals, Scerri argues that the "little people" contribute as much as the "heroes" of science. To do this he examines seven case studies of virtually unknown chemists and physicists in the early 20th century quest to discover the structure of the atom. They include the amateur scientist Anton van den Broek who pioneered the notion of atomic number as well as Edmund Stoner a then physics graduate student who provided the seed for Pauli's Exclusion Principle. Another case is the physicist John Nicholson who is virtually unknown and yet was the first to propose the notion of quantization of angular momentum that was soon put to good use by Niels Bohr.
Instead of focusing on the logic and rationality of science, Scerri elevates the role of trial and error and multiple discovery and moves beyond the notion of scientific developments being right or wrong. While criticizing Thomas Kuhn's notion of scientific revolutions he agrees with Kuhn that science is not drawn towards an external truth but is rather driven from within. The book will enliven the long-standing debate on the nature of science, which has increasingly shied away from the big question of "what is science?"
Condition: Used, no dust jacket.


This twelve storey building offers 34 units that range in size from 600 sq ft to 730 sq ft. Residents of 1145 Logan Ave will love the proximity to the restaurants and boutiques of Little India and East Chinatown along Gerrard St E. Also a short commute away is Riverdale Park, enjoy soccer, baseball and ultimate Frisbee fields as well as a swimming pool, tennis courts and an outdoor hockey rink. Lastly, entrances to the Don Valley Parkway are just around the corner, as are various streetcar stops.
Looking for 1145 Logan Ave floor plans?
Think you could 'Live Where You Love' at 1145 Logan Ave?
just contact us through the form below and ask for the 1145 Logan Ave Report.


text:
My Brother at 3 A.M.
Natalie Diaz
He sat cross-legged, weeping on the steps
when Mom unlocked and opened the front door.
O God, he said. O God.
He wants to kill me, Mom.
When Mom unlocked and opened the front door
at 3 a.m., she was in her nightgown, Dad was asleep.
He wants to kill me, he told her,
looking over his shoulder.
3 a.m. and in her nightgown, Dad asleep,
What's going on? she asked. Who wants to kill you?
He looked over his shoulder.
The devil does. Look at him, over there.
She asked, What are you on? Who wants to kill you?
The sky wasn't black or blue but the green of a dying night.
The devil, look at him, over there.
He pointed to the corner house.
The sky wasn't black or blue but the dying green of night.
Stars had closed their eyes or sheathed their knives.
My brother pointed to the corner house.
His lips flickered with sores.
O God, I can see the tail, he said. O God, look.
Mom winced at the sores on his lips.
It's sticking out from behind the house.
O God, see the tail, he said. Look at the goddamned tail.
He sat cross-legged, weeping on the front steps.
Mom finally saw it, a hellish vision, my brother.
O God, O God, she said.
Natalie Diaz, "My Brother at 3 A.M." from When My Brother Was an Aztec. Copyright © 2012 by Natalie Diaz. Reprinted by permission of Copper Canyon Press, https://www.coppercanyonpress.org/
Source: When My Brother Was an Aztec (Copper Canyon Press, 2012)
Dive in:
This poem is a pantoum: The second and fourth lines of each stanza are repeated as the first and third lines of the next stanza. The repeating lines seem to recreate while simultaneously deconstructing the scene. How do you think the repetition adds to the poem?
Who is the speaker in this poem? What is the purpose of having the speaker in a nonparticipatory role? What is the speaker revealing in this witnessing?
Note how in the third stanza the word choice in the repeating lines begin to vary. How does this modification to the pantoum form add, or detract, from the poem?
How does the form mirror such an emotional scene in the dead of night with the sleepy confusion of the characters?
The repeating lines spiral a calmness around the frantic energy of the brother. Try reciting the poem once calmly, and then in an agitated fashion. Which recitation suits your reading of the poem?
How do you read the shift in the poem when the mother sees the devil and it is her son?
Try writing your own pantoum. Consider how your repeating lines might change meaning throughout the poem. Make sure the lines are worth repeating. What do you want to explore in the echoing lines?
An interview with Natalie Diaz:
https://www.theguardian.com/books/2020/jul/02/natalie-diaz-postcolonial-love-poem-shortlisted-forward-prize-collection-interview
Dive In by:
Ashley-Elizabeth Best
Poets >
Natalie Diaz was born in the Fort Mojave Indian Village in Needles, California. She is Mojave and an enrolled member of the Gila River Indian community. She earned a BA from Old Dominion...
Contest Criteria
Grades 6-8 / Prim. 6 & Sec. 1 & 2
Grades 9-12 / Sec. 3-5 / CEGEP 1
25 Lines or Fewer
Recitations of this poem
Zara Smith, 2021
Nina Thach, 2019
Moods >
Moods: Afraid, Anxious, Apologetic, Astounded, Confused, Depressed, Despairing, Discouraged, Haunted, Helpless, Hurt, Intoxicated, Lonely, Torn, Tortured
Tags >
Isolation, Indigenous, Memory, Family, Faith, Death, Sickness, Spooky, Struggle, Torture, United States
Terms >
Allusion, Assonance, Elegy, Free Verse, Imagery, Metaphor, Pantoum, Personification, Refrain
Poem Roulette >
Spin the wheel, find the perfect poem
The Daily Poet >
Receive daily writing prompts from our anthology poets!


Maha Music Festival brings their local showcase to Bridge Beats this Friday night. The festival consistently books local bands to share the stage with national headline acts at their annual event; this year's honor goes to All Young Girls Are Machine Guns. Kait Berreckman and CJ Mills fill out the showcase lineup to bring a full night of free, live entertainment. And as an added incentive to attend, Maha will be giving away two tickets to the August 15 festival on Friday night!
All Young Girls Are Machine Guns is a seven piece Doo-Wop and Soul band from Omaha. Formed in 2009, AYGAMG has developed their sound from a mish-mash of pop, jazz, country and blues and fine-tuned it into a consistent soulful sound. AYGAMG are winners of four Omaha Entertainment and Arts Awards (Best New Band and Jazz-Easy Listening, 2010; and Best Singer-Songwriter, 2011 & 2012).
Kait Berreckman has developed a unique, engaging performance style of pop-coated, blues-infused alt-country that delights and surprises. With her strong, yet vulnerable voice and deft guitar work, Kait is the 2014 winner of the Omaha Entertainment and Arts Award for Best New Artist. CJ Mills has caught the attention of audiences locally with her powerful voice and clever lyrics that make for catchy R&B tunes. Her music is inspired by the soulful sounds of India Arie and the hip hop elements of Lauryn Hill.
Bridge Beats shows are every other Friday night beginning June 12, and ending September 18 at the base of the pedestrian bridge on the Nebraska riverfront. The family friendly concerts begin at 6:00pm and run until 9:30pm. Attendees are encouraged to bring a lawn chair, blanket and a picnic basket – or enjoy food for sale available by Voodoo Taco food truck and drinks from Harney Street Tavern.
"We enjoy partnering with organizations that make a positive impact on the Omaha community; we are looking forward to the Maha showcase and hearing these talented bands," said Brook Bench, Omaha Parks and Recreation Director.


text:
Home » Press Releases » DinoEdge AI Platform for Health & Safety Monitoring Solutions
DinoEdge AI Platform for Health & Safety Monitoring Solutions
July 30, 2020 DinoEdge AI
DinoEdge AI platform Leverages FlextyX, an FPGA AI Inference Accelerator based on Xilinx Alveo U50 and U280 cards. The FlextyX supports a large variety of AI models, such as convolutional neural networks (CNN), and recurrent neural networks (RNN), in particular long short-term memory (LSTM). It supports different AI applications, such as video analytics and speech recognition. The platform features an open full-stack for AI (OSA), including a powerful AI inference engine hardware, driver, API, compiler and optimization tools (AutoML, sparsity and low-bit quantization), support for open source frameworks.
The Health & Safety monitoring solution based on DinoEdge AI platform is integrated with Infrared Thermal Imaging Cameras, which are designed for contactless rapid body temperature measurement screening across multiple people. The screening efficiency is as high as 200 persons per minute with the accuracy of ±0.3℃ providing real-time temperature monitoring. The AI algorithm accurately locates human face to reduce false alarm. The Safety aspect of the solution, based on conventional camera, provides additional safety monitoring features like people counting, social distancing, intrusion detection, etc. The Health & Safety monitoring solution is scalable to support multiple cameras and different applications based on various AI algorithms.
"We are very proud to be releasing our Health & Safety Monitoring Solutions based on DinoEdge AI platform to the market. It is a comprehensive solution enables easy and rapid deployment to help the community's recovery from COVID-19 during the current environment where health and safety monitoring is very critical." said Jay Hu, founder and CEO of DinoPlusAI Inc.
For more information, visit www.dinoplus.ai.
Android Rugged Tablet for Workers On-The-Move
With unparalleled processing power from Qualcomm® Snapdragon™ 660 CPU and a user-friendly Android 9.0 inter...
MagnaChip Ranked No.1 in the Global OLED Smartphone DDIC Non-Captive Market
MagnaChip Semiconductor Corporation today announced that it has retained the top position in the global OLE...


Russell has lived most of his life in the Highlands of Scotland with over thirty years' experience gained in a diverse career. He is a director and chairman of various groups in Sutherland and is passionate about developing people and his community.
He is experienced in developing social enterprises and capacity building, finding innovative ways of creating a lasting impact.
As a lecturer and manager within the education sector, he is always intrigued in developing people. He has worked with wide range of learners within academia and as a corporate trainer using different teaching styles and always introducing an element of experiential learning.


Our sister company, Ridgeway Furniture, has just packed away from another exiciting few days exhibiting at LIW. With thousands of delegates from the leisure industry all assembled in Birmingham, we were proud to display a selection of some of our most popular changing room furniture.
LIW is always a great opportunity to meet potential new clients as well as forge strong relationships with our colleagues and fellow exhibitors from different sectors of the industry.