text:
Arts and Culture / News
'Bruce Almighty' director Tom Shadyac brings his personal documentary to DU
Posted January 21, 2011 at 5:15 pm
Back in November, the Internet was abuzz about a Los Angeles Times profile of Tom Shadyac, the director of Hollywood blockbusters such as Bruce Almighty and Liar, Liar, who had given away most of his Hollywood fortune and moved into a small trailer park in Malibu, Calif. Three years after a cycling accident that nearly claimed his life — and an ensuing bout of crippling post-concussion syndrome — Shadyac returned to filmmaking, albeit in a smaller, more personal way. His new documentary I Am, which Shadyac brings to DU on Jan. 25 for a special pre-release screening, features the director talking with a variety of thinkers and doers — including scientist David Suzuki, linguist Noam Chomsky, activist Howard Zinn and Archbishop Desmond Tutu — about what's wrong with the world and what can be done to fix it.
We caught up with Shadyac by phone to talk about the film and his journey making it.
You've been traveling since midsummer 2010 doing pre-release screenings. How have they been going?
We feel humbled by what we're experiencing. It seems to be striking a chord with people and inspiring them and opening them up. The most common comment that we get is that people thank us for making a movie that expresses what they've always felt in their heart. That means something is translating, and that has a power to it.
http://www.youtube.com/watch?v=PeqB8JwpdE4
Is it easy to explain what that is, or do you have to see the movie to understand it?
I think people know deep down that the way we're doing things is not necessarily the only way to do things. That there may be a deeper, richer, truer, more beautiful way to walk in the world. And the vision we have for our society — the way we teach our kids, the way we craft our businesses — is a way, but it's not a way that doesn't have alternatives that might enrich all of us. I think when you see what's going on in the environment — inarguably something is happening, whether you call it global warming or poisoning the natural world — and when you see what's going on in the economy, which doesn't seem to be fixable right now — nobody seems to have an answer, and that's because there may be a deeper problem with how we're doing our business with each other.
How and when did the idea for the movie begin?
About 15 or 20 years ago, I started on the journey of seeking. I always wanted to know what was true. And as more and more things came my way, as I walked in the way that I had been taught in the world and was a quote, "success" in that model, I began to question it because it didn't bear the fruits that I had been promised. Three years ago, when I faced my own death after a bike accident and I thought that I was going to die and I may have one more artistic chapter left, this is what emerged. I wanted to talk about what I had come to question and understand, and I wanted to offer that to others for their own knowledge or to invite a conversation.
After all the pain from the bike accident and the post-concussion syndrome you suffered as a result, was there any therapeutic value in making the documentary?
There was certainly an edifying, educational side. I got to sit with some great minds and spirits, people who have devoted their lives to research and work in opening up our thinking, opening up the way we do things and busting out of this cultural sack, if you will. Whether it's a historian like Howard Zinn or a mystic poet like Coleman Barks. I got to sit with them and just radiate in their light. These are people I would have longed to meet anyway, whether I was making a movie or not, just to go and say, "Please, can I sit with you? Tell me what you know." That was a great, great blessing for me.
There's been so much written about you now: that you're the guy who left Hollywood behind, gave away his money, moved to a trailer park — is that oversimplifying your story, or is that pretty accurate?
It's a little oversimplified. First of all, I haven't left Hollywood. There's this idea that I dropped out of Hollywood, and that's not true. I was sick for a very long time, and so I wasn't able to take on a feature film. I could take on a smaller film like this with a very limited scheduled and crew. But I believe in what Hollywood does. I believe in storytelling. I believe in the beauty of this kind of art. I simply do my business differently. I no longer want to support an economic system that I think doesn't help. I want to be a part of the healing as much as possible. So I've shifted my own way of doing things. And yes, I've simplified my life a great deal. I live in a mobile-home community that's beautiful; it's not about suffering. I didn't move away from a mansion, I moved to something beautiful and simple, and now I have more time, energy and resources to engage in work that needs to be done in the world. It's brought a light and a purpose and a meaning to my life that is tangible.
Shadyac appears with his new documentary, I Am, at 7 p.m. Jan. 25 in Davis Auditorium in Sturm Hall. Admission is free but an RSVP is required.
Tags: Events, student


text:
Q: why doesn't 0 0 * * 1 root hostname >> /tmp/hostname.txt work as a crontab? 0 0 * * 1 root hostname >> /tmp/hostname.txt

The above cron entry should run midnight on monday and create a file in /tmp called hostname.txt with the output of the hostname command. But it is just a blank file that is created.  Why?

A: When dealing with crontab entries it's important to make the distinction between a system level cron, typically in one of these locations:

*

*/etc/crontab

*/etc/cron.d/*

*/etc/cron.daily/*

*/etc/cron.weekly/*

*etc.

Or the user level variety, that are actually stored in this directory, /var/spool/cron:
$ sudo ls -l /var/spool/cron/
total 0
-rw------- 1 saml root 0 Jun  6 06:43 saml

You access these with the command crontab -e as a specific user. Even root can have these.
Your problem
The example you've included is the type of line you'd specify when making a system level type of cron. The only difference is the inclusion of the user with which the command should be run. This isn't necessary when creating a crontab -e type of entry since it's redundant, given the crontab entry is already designated to the user that created it.
So simply changing your line to this:
0 0 * * 1 hostname >> /tmp/hostname.txt

Fixes your issue.
How do the daily, weekly crons work?
You'll typically see an entry in your main /etc/crontab file like so:
01 * * * * root run-parts /etc/cron.hourly
02 4 * * * root run-parts /etc/cron.daily
22 4 * * 0 root run-parts /etc/cron.weekly
42 4 1 * * root run-parts /etc/cron.monthly

These govern when the scripts in the respective directories will get run. So the daily's are every morning at 4:20AM my local time.
So if you want to run the command hostname >> /tmp/hostname.txt daily, you'd put it in a script, make it executable, and put the script file in the cron.daily directory.
/etc/cron.daily/catchhostname.bash
#!/bin/bash

hostname >> /tmp/hostname.txt

cron.daily
# ls -l |grep catch
-rwxr-xr-x 1 root root  118 Feb 28  2013 catchhostname.bash

A: Assuming that what you have above is the actual line in root's crontab:
0 0 * * 1 root hostname >> /tmp/hostname.txt

This line will run a command called "root", and pass it the parameter "hostname". If there is no command name "root" in /bin or /usr/bin (the default path for cron), you will get an empty file output.

redpajama_set_name: RedPajamaStackExchange


Have your account code ready as you'll need it to complete the form.
You can check your account code here. If you need more help contact your Finance Officer.
Complete the Estates work request form.
As soon as your form has been received you'll be sent a unique reference number.


Today's program is an encore from March 6, 2015.
Yet pastor and author Michael Horton believes that our attempts to measure our spiritual growth by our experiences, constantly seeking after the next big breakthrough, have left many Christians disillusioned and disappointed. There's nothing wrong with an energetic faith; the danger is that we can burn ourselves out on restless anxieties and unrealistic expectations. What's needed is not another program or a fresh approach to spiritual growth; it's a renewed appreciation for the commonplace.
Far from a call to low expectations and passivity, Horton invites readers to recover their sense of joy in the ordinary. He provides a guide to a sustainable discipleship that happens over the long haul—not a quick fix that leaves readers empty with unfulfilled promises. Convicting and ultimately empowering, Ordinary is not a call to do less; it's an invitation to experience the elusive joy of the ordinary Christian life.
Find your copy on Amazon.com.
Thy Strong Word - Matthew 20: "Laborers in the Vineyard"
Sharper Iron & Heroes of Faith Alone: What Kind of Name is That?


More 1997 alumni from Gentry HS Gentry, AR have posted profiles on Classmates.com®. Click here to register for free at Classmates.com® and view other 1997 alumni.
The students that went to school at the Gentry high school called Gentry High School and graduated in '97 are on this page. Register to add your name to the class of 1997 graduates list.


Activities of daily living (ADL) are routine activities that people tend do every day without needing assistance. There are six basic ADLs: eating, bathing, dressing, toileting, transferring or walking and personal care.
A person's ability to perform ADLs is important for determining what type of long-term care may be required.
Toilet training is one of life's great milestones and it was one of Dylan achievements that he was fully toilet trained day and night by age 3. Dylan is able to recognise that he needs to go to the toilet and able to hold off until he gets there.
As with most kids he has always come into the ladies with me and it's never really been an issue. However now he is getting older going to the toilet alone is becoming a reality and a worrying one at that.
I didn't realise until recently that there is a whole etiquette of male toilet manners. There is a rule of which urinal to stand at.
If there is someone already standing at the urinal then there is an unwritten social rule that you don't stand next to them.
Also you don't look anywhere other than straight forward, you don't look at the person next to you, either at their face or anywhere else.
It is not acceptable to pull your trousers down at the urinal but to expose as little as possible to pass water.
Bare bottoms at the urinal is a big no-no.
The rules are complex and confusing, even more so to a young autistic male like Dylan. These are not social rules that you would like to misinterpret or get wrong.
Toilets are sensitive and vulnerable places.
However having frequented many a ladies toilets whilst growing up, Dylan is much more comfortable sitting on the toilet within the cubical.
Dylan has purchased a radar key which can be used universally to unlock the doors in Disabled toilets.
These toilets have more room and generally are well maintained. The only thing that we need to be aware of is the automatic hand dryer. Although these are hygienic due to the no touch technology, they are often too sensitive for a clumsy boy rushing to get to the toilet. Should he brush past it too closely and set it off absolute terror follows.
Due to past experimce Dylan is painfully aware of how unpredictable these driers can be and a great deal of his independence is hampered by his need for reassurance whilst in the presence of hand dryers.
I think it may be the pitch or volume of the noise, exacerbated by the wall and floor tiles within public toilets causing the sound to be intensified to a level where it appears that Dylan is frightened of the noise and it causes him intense discomfort.
This sound coupled with the unpredictability of it starting, be it from an oversensitive sensor or the other people in the toilets who are drying their hands. Dylan has no control over the noise so we often wear ear defenders when going to the toilet in a public place.
Although Dylan can still hear with these on any sound is dampened out enough for him not to feel so anxious.
Looking positively on Dylan's abilities and answering the question basically then – yes, Dylan doesn't wear nappies anymore.
However he does require supervision to clean himself afterwards, he needs assistance and support to follow social guidelines, constant reassurance because of the sensory overload and his coordination difficulties and then support to redress suitably afterwards.
Continence and toileting is so much more than being out of nappies and going to the toilet.


text:
A guide to the top
Riverside employers & careers
Research the top employers in Riverside & the rest of California with employer profiles, press releases, articles, interviews & career listings.
Featured Career
At UCLA Health, you can turn great aspirations into great outcomes—for our patients and yourself. You'll be challenged and empowered in an atmosphere of learning and support, working alongside world-class colleagues as you contribute to our reputation as an internationally-respected healthcare leader. Every day, you'll be able to make a significant difference for our patients, our community and your team members.
No matter where you work within our Southern California system, you'll experience an incomparable variety of lifestyle options. From the city to the suburbs, beaches to the mountains, and everything in-between, you'll discover an incredible diversity of locations offering unmatched choices for world-renowned culture, recreation, dining, shopping, schools and so much more.
Check out this exciting career with UCLA Health…
Clinical Trials Coordinator
UCLA Health | Los Angeles, CA
Under the direction of the Department Vice Chair and the Clinical Trials Manager, the Study Coordinator is responsible for the coordination of clinical tasks and conduct of administrative tasks required to successfully conduct clinical trials within the Department of Radiation Oncology.
Responsibilities include preparing and updating study orders based on an in-depth analysis of the protocol; planning and coordinating logistics and scheduling study visits with nursing and other clinical staff within the Department and extra-departmentally; identifying potential study subjects for recruitment; regular communication with and reporting to investigators, sponsors, monitors and subjects; reporting/recording serious adverse events and deviations to compliance committees; providing administrative, regulatory and data management support as needed. Exercise critical thinking and implement a dynamic, continuous and solution-oriented approach in the coordination of clinical trials.
LONG ISLAND – September 9, 2021 – Bank of America has named Marc Perez as President of Bank of America Long Island. Perez succeeds Bob Isaksen, who held the position for 17 years and will continue in his role as the region's business banking market executive and an active local leader. As Long Island President, […]
Next Gen VAM Delivers Single Global View, Flexibility and Full Integration into CashPro and FX Platforms CHARLOTTE, NC – September 9, 2021 – Following a multi-year investment, Bank of America has launched the next generation of its global Virtual Account Management (VAM) solution to address the growing complexities that treasurers face today when managing global […]
10 Northeast Ohio start-up and existing women-owned businesses will compete for $22,000 in awards CLEVELAND, Sept. 7, 2021 /PRNewswire/ — KeyBank's (NYSE: KEY) Key4Women program and SCORE Cleveland today announced 10 finalists have been selected to compete in a business pitch contest for women-owned businesses (WOBs) located in Northeast Ohio. Selected from a pool of […]
Leading Funder of Animal Welfare Activates Emergency Response Grants Supporting Designated Pet-Serving Agencies PHOENIX, Sept. 3, 2021 /PRNewswire/ — PetSmart Charities, the leading funder of animal welfare in North America, will commit up to $1 million in grants to support designated responding agencies working on the front lines to help pets and families in areas […]
SPOKANE, WA – September 1, 2021 – Washington State University Spokane's (WSU Spokane) Native American Health Sciences (NAHS) program will build what is believed to be the nation's first indigenous-developed and instructed clinical simulation space at the Center for Native American Health on campus. NAHS will construct 1,045 square feet of clinical space to include […]
Le Méridien Hotels & Resorts Lands in the Maldives with Signature Glamourous European Spirit
The Paris-born Brand Brings a Touch of Nostalgia to the Famed Archipelago, Inviting Guests to Linger Longer and Savour the Good Life MALDIVES, SEPTEMBER 1, 2021 — Le Méridien Hotels & Resorts, part of Marriott Bonvoy's portfolio of 30 extraordinary brands, along with Singaporean developer Chiu Teng Enterprises today announce the opening of Le Méridien Maldives […]
Support for veterans with PTSD continues with fourth annual "Service Dog Salute" campaign ST. LOUIS, Sept. 1, 2021 /PRNewswire/ — In honor of Service Dog Awareness Month this September and its fourth annual Service Dog Salute campaign, Dog Chow is releasing a new documentary short film titled "Even Heroes Need Heroes" to highlight the life-changing […]
Mangrove Beach Corendon Curaçao All-Inclusive Resort Marks Grand Opening with Celebratory Event
Resort officially joins Curio Collection by Hilton WILLEMSTAD, Curaçao, September 1, 2021 – Mangrove Beach Corendon Curaçao All-Inclusive Resort, Curio Collection by Hilton welcomed local dignitaries and VIPs, including resort owner Atilay Uslu along with his family, general manager Biray Öğüt, operations manager Mehmet Fersiz and other members of the hotel team to celebrate the […]
Support to help support economic empowerment of African Americans, low- and moderate-income communities BALTIMORE, Sept. 1, 2021 – The PNC Foundation locally has committed $300,000 to the Center for Urban Families (CFUF) and $300,000 to Coppin State University over a three-year period, as part of the financial institution's broader commitment to provide more than commit $1 […]
Read Davis, Renee Keen named to leadership positions with McGriff
CHARLOTTE, N.C., Sept. 1, 2021 /PRNewswire/ — Truist Insurance Holdings today announced the following two appointments to senior leadership roles at McGriff, its retail insurance business, effective immediately. Read Davis, currently president of McGriff's Georgia region, will become CEO, McGriff Specialty and Middle Market, while Renee Keen, the business' National Personal Lines & Small Business practice leader, will assume the position of CEO, […]
Aetna and ACES enhance relationship and create Aetna's first Institute of Quality for autism
Collaboration to immediately expand access to industry-leading autism care and services from ACES for Aetna members in 2021 WOONSOCKET, R.I. and IRVINE, Calif. – August 31, 2021 – Aetna®, a CVS Health® company (NYSE CVS), and ACES 2020, LLC ("ACES"), today announced an enhanced relationship to improve the quality of life for individuals and families […]
Marriott's "The Exchange – All for One" Brings Industry Leaders Together to Reignite Meetings and Events
Marriott Displays Connect with Confidence Protocols at Largest Customer Event Since Start of Pandemic BETHESDA, MD, AUGUST 31, 2021 — After a year of mostly virtual meetings, Marriott International hosted its largest in-person customer event since the start of the pandemic last week, showcasing health protocols and marking a positive sign for the recovery of […]
ST. LOUIS, August 31, 2021 – As Hurricane Ida hit the Gulf Coast as a Category 4 storm, bringing strong, sustained winds, a life-threatening storm surge and widespread flooding and power outages, Purina announced a $25,000 grant to Greater Good Charities (GGC) to support the organization's rescue and relief efforts. And while Ida has since […]
Public Lands, New Outdoor Store Concept from DICK'S Sporting Goods, Announces Support for Conservation of and Access to Public Lands and Outdoor Spaces Ahead of Grand Opening
PITTSBURGH, Aug. 31, 2021 /PRNewswire/ — Public Lands, the new outdoor specialty store concept from DICK'S Sporting Goods (NYSE: DKS), today announced the creation of The Public Lands Fund, designed to support local and national initiatives that protect new lands, improve existing lands, break down the barriers of access to outdoor experiences and improve inclusion and equity […]
Cambria Hotels Adds Second Location In World-Famous California Wine Country
Upscale Brand Debuts Fifth Hotel this Year with Napa Valley Entrance ROCKVILLE, Md., Aug. 30, 2021 /PRNewswire/ — Cambria Hotels, an upscale brand franchised by Choice Hotels International, Inc. (NYSE: CHH), continues its United States expansion with the opening of the Cambria Hotel Napa Valley Silverado Trail. The four-story, 90-room hotel is the brand's fourth […]
PNC Bank Announces Minimum Pay Rate Increase
Minimum Hourly Rate Jumps to $18.00 PITTSBURGH, Aug. 30, 2021 /PRNewswire/ — PNC Bank announced that it will bring its minimum pay rate from $15 to $18 per hour, beginning Nov. 22, 2021. This represents a 20% increase from the bank's current $15 minimum rate and is more than double the national minimum wage of […]

redpajama_set_name: RedPajamaCommonCrawl


text:
Elisabeth Aasen (9 February 1922 – 12 November 2009) was a Norwegian politician for the Socialist Electoral League.

She served as a deputy representative to the Parliament of Norway from Møre og Romsdal during the term 1973–1977. In total she met during 13 days of parliamentary session.

References

1922 births
2009 deaths
Deputy members of the Storting
Socialist Left Party (Norway) politicians
Møre og Romsdal politicians
Women members of the Storting
20th-century Norwegian women politicians
20th-century Norwegian politicians

redpajama_set_name: RedPajamaWikipedia


Kiwisoft designs, develops, and publishes application software and provides scalable network integrated solutions and support.
Kiwisoft was established in 1984 and is based in Auckland, New Zealand. The company has designed and developed sophisticated electronics boards, software packages, games, and innovative system solutions for the PC and Open Systems. Two technical partners, an American PhD (Harold Salive) and New Zealander (Kevin Slade) offer a combination of practical systems and network business skills and academic analytical and presentation skills.
Hooked & Hung Wall Hangings (2003) - Hooked original designs available as wall hangings.


Source: Dr Phillips Center for the performing Arts.
Il Volo, the critically acclaimed trio, announced their 35-date tour across the country. Kicking off at Kleinhans Music Hall in Buffalo, NY on February 5, shows will continue through an April 1st performance at Pechanga in Temecula, CA. The tour will also make stops in Miami, New York, and Los Angeles.
In anticipation to their upcoming tour, Il Volo is set to release their fifth studio album Grande Amore at the end of September via Sony Music.
Do you want the best seats to the show and to personally meet IL VOLO? Want to get a photograph with the young opera stars, ask questions and have exclusive autographed VIP pass, all in an IL VOLO branded "Operatic Pop" environment? Join the Grande Amore VIP event for the ultimate IL VOLO experience!
*You will receive a VIP itinerary approximately 3-5 days prior to the show with all of the information you will need for the Meet & Greet.
For questions about the Grande Amore VIP Meet & Greet Package, please call 877-606-9222 or email ilvolo@omgvip.com.
Do you want great seats to the show and exclusive merchandise personally autographed by Il Volo? Get the Grande Amore Merchandise Package!
For questions about the Grande Amore Merchandise Package, please call 877-606-9222 or email ilvolo@omgvip.com.


On a daily basis, infants and toddlers encounter a plethora of items ranging from animals to appliances their parents use. Despite their limited abilities to process information, even very young children are remarkably capable of learning the names of these objects. Ellen M. Markman conducted some of the pioneering research on the reasoning skills that infants and young children use to figure out the meanings of words. When someone points to an object and labels it, how do children conclude the label refers to the object itself, rather than its color, size, shape, texture, activity, attractiveness, and so on? Markman has postulated that by the time children begin to acquire their vocabulary, they have a set of default assumptions that together enable children to quickly zoom in on some hypotheses and rule out others. Through extensive experimental research, Markman has challenged the traditional theories of word learning and provided new insights into the nature of language acquisition.


Why is Local SEO important to my business and why should I care?
Because 46% of searches are local and 44% of searchers click the top 3 results in Maps while only 8% click through to see more local results. If you're in the top 3, you're going to get a lot of calls or walk-ins. If you're not, your competitors who have invested in local SEO are going to get them.
What does Google My Business (GMB) have to do with SEO for my website?
There are a few key differences between Organic SEO and Local Seo, the most important of which is Google Maps. Your GMB listing is the heart of your maps listing and whether or not local customers see it has to do with how well optimized it is, both on your site and in the GMB listing.
Do you guarantee you can get my business to the first position in search?
Nope. It's called Search Engine "Optimization" for a reason. We're constantly keeping up with the latest developments in search and SEO so we can optimize your business so, hopefully, search engines will rank it. We have some really cool tricks to make that happen but, ultimately, it's all up to the algorithms.
I'm already ranked on the first page of Google, why should I Invest in local SEO?
Things can, and do, change overnight. Algorithms are constantly being updated and your competitors are eager to get you out of that coveted spot. Depending on how competitive your industry is, chances are good the top three listings in maps are already using top-notch SEO companies.
Why do you have to do work on my website in order to make it rank in maps?
Believe it or not, about 70% of what it takes to get into the top 3 maps listings (aka "Snack Pack) happens on your site, not in your GMB listing. Even more important than that, you can drive all the traffic in the world to your website but if it's not optimized for users they'll click away and go to your competitor.
How does Google decide who gets into the top three spots in maps?
Well, nobody knows for certain because it's Google's secret sauce. But experience suggests there are three primary criteria: proximity, prominence and geolocal relevancy. In plain English, how trusted, how close and how relevant to your search term are the potential results decide who gets shown.
Opus Marketplace is a North Carolina marketing company. Whether you're looking for an Asheville SEO agency or a NC advertising agency, Opus can offer you local SEO (search engine optimization), organic SEO (search engine optimization) or PPC (Pay per Click) marketing, we're here for you. Contact us today to find out more.


In the past few years, cycling in Collingwood has absolutely exploded. A quick look at Grey Road 2, on just about any Sunday will prove that. The Collingwood Cycling Club is one of the largest clubs in the province and with races like the Centurion, the popularity continues to expand. And thankfully, there's an organization like Cycle Simcoe to help you hit the road or trail. Their new map features over 650 kilometres of perfect routes for getting on two wheels. It's also downloadable to your phone. Get it here.
Here's a brief look at what cycling in Collingwood is like.


Now, try clicking the Edit button to open up three more instances of a tune. Then carefully time all the windows to play at the same time, perhaps with different settings for the synth, strings, woodwind, piano. Amaze balls!


Two molded-in carrying handles allow for easy movement and placement.
4022000 Steel sign stand w/ telescoping legs $120.00 22 lbs.
4022300 Single Spring steel sign stand w/ telescoping legs $146.00 25 lbs.
4026000 Molded rubber base $108.00 38 lbs.
4026036-EV-HF  36" Vinyl Sign w/ ribs-Heavy Duty-Survey Crew $60.00 2 lbs.
4026048-EV-HF 48" Vinyl Sign w/ ribs-Heavy Duty-Survey Crew $70.00 5 lbs.
4026036-RW 36" Heavy Duty Vinyl Sign w/ ribs- Roadwork $60.00 2 lbs.
4026048-RW 48" Heavy Duty Vinyl Sign w/ ribs- Roadwork $70.00 5 lbs.
Reflective Cones 18" & 28"
Fluorescent Orange Solid Vinyl Sign with Survey Crew or Roadwork Ahead.
Note: Signs & Bases are interchangeable.
* Injection molded PVC, MUTCD Complaint.
* Rubber base for excellent stability and anti-skid performance.
* Flourescent orange color throughout for superior fade resistance.
* Reflective collar for MUTCD compliant nighttime performance.
* Ridges on the inner cone allow for easy stacking and deployment.
4018PVCS6CC(VSB)  18" Traffic Cone with 6" Collar $12.75 3 lbs.
4028PVC6CC4CC(VSB) 28" Traffic Cone with 6" & 4" Collar $22.75 7 lbs.


Modern advanced high performance renderer for 3ds Max, Cinema 4D, and other platforms.
Developed for the artists by the artists.
Thanks to our innovative pricing model, everyone can afford a modern renderer.
Bitmap Files - Relative Path Option?


text:
What are the key challenges facing software engineering?
asked Oct 5, 2021 in Software Engineering by (user.guest)
answered Oct 7, 2021 by (user.guest)
selected Oct 8, 2021 by (user.guest)
Like every other engineering categories software engineering have challenges such market factor, changing world trends and the likes, but some of the key challenges software engineering faces are;
Rapid technology advancement
Increased customer demand
Unrealistic Timeline
Communication problems between developers and end users
commented Oct 8, 2021 by (user.guest)
Thanks for sharing. Very useful.
Duplicate: Apart from the challenges of heterogeneity, business and social change, and trust and security, identify other problems and challenges that software engineering is likely to face in the 21st century
Apart from the challenges of heterogeneity, business and social change, and trust and security, suggest other problems and challenges that software engineering is likely to face in the 21st century.
The world is facing so much challenges and computers are set to resolve most of those challenges through various forms including artificial intelligence.
asked Sep 22, 2020 in Programming Languages & Algorithms by (user.guest)
What are the needs of software engineering?
What are some architectural styles in Software engineering
asked Oct 25, 2021 in Software Engineering by (user.guest)
What are legacy systems in software engineering?
What are software engineering ethics?
What are some applications of software engineering in real life?
Non-certified individuals are still allowed to practice software engineering. Discuss some of the possible drawbacks of this.
Explain why the fundamental software engineering principles of process, dependability, requirements management, and reuse are relevant to all types of software system.
What does the ACM/IEEE-CS Joint Task Force say on Software Engineering Ethics and Professional Practices?
Analyse the factors that affect maintainability of a software system, suggest ways of overcoming the challenges involved
asked Jul 28, 2021 in Software Engineering by anonymous
During data presentation there are three key issues to consider. Explain the relevance of each of these three issues stating an application for each in the engineering field.
asked Jul 28, 2020 in Maths & Statistics by anonymous
What are the key features of a Mental Health Care-Patient Management System (MHC-PMS)?
Duplicate: You are a software engineering manager and your team proposes that model-driven engineering should be used to develop a new system...
asked Feb 9, 2021 in Software Engineering by anonymous
You are a software engineering manager, and a senior member of your team proposes that model-driven engineering should be used to develop a new system...
What is unit testing in software engineering
What is Software Engineering all about
What is meant by pair programming in Software engineering
What is Software Engineering ?
What does a model in a software engineering can be defined as an abstraction of a system that has no longer exists, an existing system and future system to be built means?
Discuss the software engineering approach you would take in completing the atm system
Explain the concept of cost estimation in Software engineering
Explain the V model in Software engineering
Explain the prototyping model in Software engineering
Describe the class diagram in Software engineering
Discuss the purpose and objectives of prototyping in software engineering.
asked Apr 15, 2021 in Software Engineering by anonymous
Consider the seven software categories: system software, application software and so on. Do you think that the same approach to software engineering can be applied for each?
Briefly discuss why it is usually cheaper, in the long run, to use software engineering methods and techniques for software systems.
asked Jun 27, 2020 in Software Engineering by anonymous
1 answer 10.7k views
Explain why incremental development is the most effective approach for developing business software systems. Why is this model less appropriate for real-time systems engineering?
What are some of the aspects of usability considered when designing a software?
asked Jan 12 in Software Engineering by (user.guest)
What are the various software Myths?
What are the characteristics of a good software design?
What are the quality factors in software development?
What are the various characteristics of a good software?
What are the stages of Software development lifecycle to develop a software product.explain with the diagram ?
asked Aug 31, 2021 in Software Engineering by anonymous
What are the ethical issues associated with the reuse of software?
What are the four important attributes that all professional software should have? Suggest four other attributes that may sometimes be significant.
A software process that is based on high quality should produce high quality software products but to manage the quality of a system many problems are faced, what are these probable problems?
asked Apr 7, 2021 in Software Engineering by anonymous
Duplicate: What are the four important attributes that all professional software should have?
Duplicate: What are the four important attributes that all professional software should have? Suggest four other attributes that may sometimes be significant.
What are the advantages of providing static and dynamic views of the software process as in the Rational Unified Process?
Because of the COVID19, your company decided to let the staff to work from home. However, the senior manager who made this decision is unaware that software is being developed using Scrum. What problems are you likely to encounter using this approach
asked Jan 14, 2021 in Software Engineering by anonymous
What are the two perspectives of component based software development process
asked Aug 5, 2020 in Software Engineering by anonymous
Duplicate: What are the strategic options for legacy system evolution? When would you normally replace all or part of a system rather than continue maintenance of the software?
asked Jun 3, 2020 in Software Engineering by anonymous
What are the important differences between the agile approach and the process maturity approach to software process improvement?
Imagine a situation where 2 developers are simultaneously modifying 3 different software components. What difficulties might arise when they try to merge the changes that they have made?
What are the most important distinctions between services and software components?


text:
Q: request.body is not defined while sending json data from postman Basically what i am trying to do is creating a customer collection in mongodb using expressjs . while i am sending the data from postman it is showing req.body is undefined .
my customer.js looks like this
const express = require('express');
const router = express.Router();
const fs = require('fs');

const Customers = require('../models/customer');

router.post('/addcustomer',(res,req,next)=>{
    const customer = new Customers({
        name:req.body.name,
        address:req.body.address,
        products:req.body.products,
    });

    customer.save()
    .then(result=>{
        console.log(result);
        res.json({message:"killer"});
    }).catch(error=>{
        console.log(error);
        res.json({error:error})
    });

and my app.js looks like this
const express = require('express');
const app = express();
const mongoose = require('mongoose');
const bodyParser = require('body-parser');
const morgan = require('morgan');

// route files include here
const UserRoutes = require('./api/routes/users');
const CustomerRoutes = require('./api/routes/customer');

// mongoose connection string
mongoose.connect('mongodb://127.0.0.1:27017/bdrs',{useNewUrlParser:true,useUnifiedTopology: true});

app.use(morgan('dev'));
app.use(express.json());
//Cors policies
app.use((req,res,next)=>{
    res.header('Access-Control-Allow-Origin','*');
    res.header(
        'Access-Control-Allow-Header',
        'Origin,X-Requested-With,Content-Type,Accept,Authorization'
    );
    if(req.method == 'OPTIONS'){
        res.header(
            'Access-Control-Allow-Methods',
            'GET,POST,PATCH,DELETE,PUT'
        );
        return res.status(200).json({})
    }
    next();
});

//Routes for operations
app.use('/user',UserRoutes);
app.use('/customer',CustomerRoutes);

// error handling
app.use((res,req,next)=>{
    const error = new Error('Not Found');
    error.status = 404;
    next(error);
});

app.use((error,req,res,next)=>{
    res.status(error.status||500);
    res.json({
        error:{
            message:error.message
        }
    });
});

module.exports = app;

after that my postman request looks like this

i have done the similar code somewhere else and it is working fine. Dont know whats the issue here. Thanks in advance.

A: Your problem lies here
Change
router.post('/addcustomer',(res,req,next)=>{

To
router.post('/addcustomer',(req,res,next)=>{


text:
Musée protestant > The 20th century > Protestantism today
The most frequently asked questions.
Protestantism comprises a great variety of Churches which belong to five main trends :
Lutheran Churches,
Reformed Churches,
Evangelical Churches,
Anglican Churches,
Pentecostal Churches.
Each has a different ruling system.
How many Protestants are there in the world ?
Lutheran Churches : 65 million people
Reformed Churches : 50 million people
Evangelical Churches : 500 million people
Anglican Churches : 70 million people
Pentecostal Churches 200 million people
How many Protestants are there in France ?
Since they were persecuted, they have been a minority. They can mostly be found in Alsace and Languedoc regions.
Protestantism ranks third in France after Catholicism and Islam with over one million members, i.e. 2% of the French population, well-wishers excluded.
What is the French Protestant Federation (Fédération Protestante de France) ?
Since 1905 the Federation has regrouped most Protestant churches and associations in France. The Churches belong to various trends of Protestantism which appeared since the Reformation, namely Lutheran, Reformed, Evangelical and Pentecostal. As for associations they were mainly congregations, institutions, charities and groups working in various fields such as childhood, elderly people, healthcare and social care, leisure and holidays, education, communication, artistic creativeness, international relations and development, etc.
Which ceremonies are Protestant ?
Holy Communion at the Musée du Désert © Haussonville
The most important is worship to honour God :
worship in the Temple on Sunday mornings, with the whole community
family or individual worship.
Community worship is celebrated by a pastor or an appointed lay preacher.
What is worship like ?
It may vary from one church to another but in all churches there is a sermon on a text from the Bible, and the celebration of sacraments.
There are two sacraments :
Baptism, which can be of children or of adults who freely confess their faith.
The Lord's Supper or Holy Communion, which is generally not celebrated every Sunday.
Do the Protestants have priests ?
No there are no priests but pastors.
Among the most innovative principles of reformation is the universal ministry of the believers, which makes all baptised members equal. Pastors and lay people share the management of the Church.
Pastors have no specific status within the Church. They hold a specific function which they were trained for during their university studies in theology.
With unity in mind, they specifically perform preaching and sacraments, enliven the community they are in charge of as ministers, but also accompany, listen to and theologically train its members.
Are women allowed to be pastors ?
Yes, in most Protestant Churches, women may become pastors. In France 10% of pastors are women.
Who leads the Churches ?
Each local Church is autonomous. Joined in Federations, the Churches elect a president who represents them over a limited period.
Why are there so many Protestants in politics ?
The Reformers did away with monasteries and prompted believers to serve God in their daily lives, occupations and active roles in public life. The concern about public life is still present today.
What is the Protestants' attitude towards sexuality ?
Concerning ethics, each Protestant acts according to his conscience and only refers to God. It is the same with sexuality, a field in which Protestant Churches give few guidelines. They admit divorce and re-marriage of the divorced.
Do the Protestants believe in life after death ?
Referring to the Bible, the Protestants believe in the Resurrection after death. But little is said in the Bible about life after death.
Associated tours
Protestantism in the XXth century
The law of 9th December 1905 separating the Churches from the State guaranteed the freedom of public worship for the Reformed Church and a legal framework. Hardly surprisingly, most Protestants...
Protestantism in Alsace in 19th century
In Alsace the numerous Lutheran community, as well as the predominant reformed one in Mulhouse, were to be submitted to the same requirements as the reformed churches "inland". But the...
Protestantism around the world
Protestantism comprises a great variety of churches belonging to five main groups. Most have joined a Churches' Ecumenical Council trying to present a united message.
Protestant faith
There are common beliefs to all christians, expressed in the articles of faith of the early Church; however the protestants belonging to the Féderation protestante de France acknowledge six main...
The French Protestant Federation (FPF)
Since 1905, the Fédération protestante de France has included most Protestant Churches and Associations. Most branches of Protestantism which have grown up since the Reformation are represented.
Protestantism in France
With about one million members, the Protestant Church ranks third in France after Catholicism and Islam. But there is an uneven spread over the different geographical regions.


Rhoda of Southern Hospitality recently celebrated a 5th blogging birthday and in celebration hosted several giveaways. I was the lucky winner of a set of cards from Little Pearl Designs.
I recently received my cards and am thrilled with them. They are hand stamped on a very high quality paper with a heavy weight.
As an extra gift, I also received two adorable birds that can be used as gift tags.
I am positive that any friend who receives one of these cards will be thrilled.
If you need cards, check out Little Pearl Designs. The quality is great and I received my order days after I contacted Leona, the owner. I definitely plan to order from Leona for more pretty cards to keep in my stash. I much prefer to send a handcrafted card over a store bought one when I have the opportunity.
Celebrate and Enter to Win $165!
Although her style is different than mine, I'm so in the mood to start creating and designing my own cards, especially now that Spring is around the corner and Spring colors are so fun to paint. These birds are a sign of Spring! Beautiful!
What a lucky win! The cards are lovely.
Congrats to you! The cards are precious!!!
Congrats on winning such a great giveaway Paula. I love anything with little birdies on it.


text:
"You Can't Say That" - Non-Disparagement Clauses and the Anechoic Effect
Here is another example of why health care organizations' leaders are different from you and me, and why that may not be a good thing for health care. A few days ago, the San Jose (California) Mercury News reported on the upcoming departure of a local hospital CEO:
El Camino Hospital's handsomely-paid president and CEO Kenneth Graham is out of a job, the hospital announced Thursday afternoon.
Graham's contract will end June 30 'without cause, at the request of the hospital's Board of Directors,' according to a statement released to the media.
Until then, Graham will continue to fulfill his duties as the hospital's top administrator, according to the statement. Graham has been president and CEO of the hospital for 4½ years.
The brief statement did not explain why Graham has been ousted, focusing instead on his accomplishments. Graham earns an annual base salary of $632,640.
Not only was the CEO "handsomely paid," he will be handsomely paid to depart, as reported two days later by the same newspaper:
Former El Camino Hospital president and CEO Ken Graham may be out of a job, but he won't be hurting for a paycheck anytime soon.
Fired 'without cause' by the hospital's board of directors on Wednesday, Graham is now entitled to nearly $1 million in severance pay, according to his contract, which the hospital provided to The Daily News on Friday.
Specifically, the hospital will pay Graham a lump sum of 18 months' salary when he officially steps down June 30. Based on his annual salary of $632,640, he would receive $948,960.
The reporter could not get any clearer fix on the reason for his departure:
Hospital officials Friday were tight-lipped about their decision to drop Graham. Reached by phone, board Chairman Wesley Alles would only say it was 'without cause.'
'I guess as a generic (explanation) the only thing I can say is it's without cause, that (the board wants to take) some different directions, perhaps, as a generic (explanation),' Alles said.
El Camino Hospital spokeswoman Chris Ernst said she couldn't say more than what was written in a statement released to the media Thursday, which simply stated Graham's contract was ended 'without cause, at the request of the hospital's Board of Directors.'
'I know everyone wants to know if there's something really there, but it was clearly without cause,' Ernst said. 'It's not like you can point to one particular thing and say this is why this action was taken.'
Now wasn't that informative? It appears the CEO was let go "without cause." But reporter Diana Samuels did uncover why nobody was saying anything meaningful about this lucrative departure:
The contract also includes a 'non-disparagement' clause, which says the hospital and Graham cannot make any statements about each other that could cause 'any embarrassment or humiliation or otherwise reflect negatively on the other party(ies).'
I discussed the subject of executive contracts with one of our Health Care Renewal scouts who knows about such things. For high level executives in business, seemingly tidy severance packages are the rule. We have discussed the problem with excess executive compensation in health care here.
Furthermore, various confidentiality, non-compete, and non-disparagement clauses are often common.
However, whether or not these are common practices in the larger business world, these contract provisions, especially non-disparagement clauses, pose problems in health care. As we have discussed, there are lots of good reasons that the governance and leadership of health care ought to be maximally transparent.
Just to provide one example, consider the problem of medical errors, a subject which has received unending discussion since the report by Institute of Medicine entitled "To Err is Human." One widely espoused doctrine about medical error prevention is that such errors ought to be disclosed and discussed openly so that their root causes can be found, and methods to prevent them developed. Now suppose, for example, that the CEO of a hospital had discovered some medical errors, but made himself unpopular by pursuing them. Were he to have a bilateral non-disparagement clause in his contract, and were this unpopularity to cause him to lose his job, he could say nothing about these errors, possibly allowing them to recur, but more seriously. Of course, the example could be turned on its head. Suppose the CEO had introduced a new process that was thought to be the cause of such errors. Were he to lose his job because of this, hospital officials could say nothing about the problem, etc, etc. Similarly, other problems at the hospital either discovered by the CEO or possibly caused by the CEO could remain anechoic due to non-disparagement clauses in hospital executives' contracts.
Of course, in the current case, the CEO might have left due to simple personality differences, and his departure might have nothing to do with medical errors, etc, etc.
However, this case suggests that the sort of non-disparagement clauses that may appear in contracts for executives in various type of businesses have metastasized to contracts for hospital executives. These clauses, and their cousins, confidentiality clauses and non-compete clauses, may be major reasons for the anechoic effect, and the general lack of transparency of hospital leadership and governance.
However, up to now, such clauses seem to be, you guessed it, anechoic in discussions of health care policy and health care reform.
Thus, one step to true health care reform would be for there to be some open discussion of the reasons we cannot openly discuss many important issues in health care, particularly the likely increasing use of contractual clauses such as non-disparagement clauses. Likely an even more important step would be discrediting such contractual provisions that reduce transparency.
Labels: anechoic effect, confidentiality clause, El Camino Hospital, executive compensation, hospitals, non-disparagement clause, transparency
I think Kenneth Graham was on the board of directors of Sutter Health at www.sutterhealth.org. I don't think Sutter Health wants their name tarnished but here is a story about Ken Graham and his assocations to Sutter Health.
http://www.marinij.com/kentfieldrossgreenbrae/ci_7957295
I have to wonder if such clauses exist in the academic world as we seem to see high level administrators move from university to university with less than stellar results.
You conflate here a discussion of population data (error disclosure) and anecdotal data (why a CEO was fired). If I hear that one million children were diagnosed with autism because of inoculations, I can say with some certainty that there is evidence to say that is unlikely to the point of being impossible. If I hear that one child's autism was caused by an inoculation, I can doubt it but can't refute it -- maybe there is some specific issue in this case.
In the state of Florida, I have anecdotal evidence that committing fraud against the government gets you elected governor. Still, I think you'd find that, on average, the outcomes are worse. We need to remember to apply population statistics to populations, and understand that individuals may be outliers. This is why you'll see mutual non-disparagement clauses.
Scot M Silverstein MD said...
We need to remember to apply population statistics to populations, and understand that individuals may be outliers. This is why you'll see mutual non-disparagement clauses.
I disagree. Explanation is simple.
Hospital administration's become a closed country club.
One doesn't publicly disparage one's country club buddies. It prevents them from getting another equally lucrative job.
Doing so also invites litigation, even if the negative information is true.
Non-disclosure clauses in health IT contributes to patients being harmed. Same with healthcare leadership non-disparagement agreements.
Patients and the clinicians who take care of them under increasingly adverse circumstances ultimately pay.
Healthcare is needed everywhere. I found a book that has been amazing and has motivated me to try and help fix Healthcare .
The book is called, Uproot U.S. Healthcare: To Reform Healthcare by Deane Waldman a physician who has 35 years experience.
Working in healthcare, you see first hand a lot of the problems...It's now time to do something!
This sort of stuff is very very very common. Often though, when they don't reach an agreement ahead of time, the individual is let go for breaking some sort of unspecified personal misconduct.
Then, being left out on their own, they are more ameanable to a financial settlement which then includes a two sided non-disparagement clause. The financial settlement is contingent (forever) upon keeping the non-disparagement clause intact with treble damages threatened (e.g. the healthcare institution can ask fro 3 times the amount they gave you back should you break the clause since its a contract).
Of course if you don't sign (and take the offer) you are ruined for sure no matter what, often even if you are in the right side of the battle. Mud splashes everyone in the fight if there is one.
More Hospitals Settle, But Not for Much
Electronic Medical Records: Two Weeks, Two Reams
"Replace the RUC!"
Send Mercenaries, Guns, and Money? - Cerberus Tri...
MedInformaticsMD in WSJ again: No Patient Will Ev...
Three Years Later, A Congressional Investigation o...
Windows 7 Service Pack 1 "Glitches": Why Personal...
Wendell Potter's "Deadly Spin"
The face of postmodern medicine: lying
EHR as Molestation Candidate Selector: What was t...
Pharmacia, or Maybe Pfizer Settles, Only Eight Yea...
After Manufacturing Problems, Genzyme CEO's Golden...
Does EHR-Incited Upcoding (Also Known as "Fraud") ...
The University of Minnesota, Where Nothing Can Go ...
"You Can't Say That" - Non-Disparagement Clauses a...
Why Weren't Existing Laws About Hospital CEO Compe...
Passport to ... Fraud? - AmeriHealth Mercy Settles...
After Publicity About Losses from Corruption, Now ...
The New Steward Health Care: Will Superbowl Ads an...
Conflating Heavy Coffee Drinkers With Glue Sniffer...
Brief Comments on the President's Council of Advis...
David Blumenthal to Resign as Director of the Offi...
More Legal Theater: Actavis Convicted, CareSource ...
Health Care Corporate Disinformation Campaigns: We...
FDA to Scientific Protein Laboratories Manageremen...
BLOGSCAN - Electronic Health Records: Should Congr...
An Updated Reading List on Health IT


So we're in a fight now.
One Direction played BC Place in 2015. We didn't know then that it would be their last tour before the hiatus, and I spent a long time thinking about whether I wanted to go. I ended up finding floor seats for $100 in the last few weeks before the show, Elisabeth decided to fly out to come with me, and I'm so glad we went.
But BC Place is where our football and soccer teams play, and Rogers Arena is where our hockey team plays. I love Harry Styles because he's a weirdo aesthete, and I was really hoping I could see his solo tour in one of our interwar music halls, instead of a hollow arena.
Still, I love his music, his sparkly boots, and his commitment to trying something new, so that's where I'll be July 2018. Five years of being fascinated by Harry Styles, and he hasn't disappointed me yet.


From 1998 to 2005, he was Project Manager by "TEC ENERGIES" and "DGET"; In 2005, he has been engaged into an Engineering Office specialized in thermical diagnosis, energy savings, and utilities engineering in Industries. He designed refrigeration systems and Industrial Air Conditioning. He did as well pre-projects or GTD and tenders' analyses. He followed up the commissioning and works.
His competences are carried on high Industry Practice, on several process diagnosis, on energy diagnosis, and also onto measurements introduction and exploitation.


Joe Jonas has had to sign an NDA to promise to keep his lips sealed about the upcoming final season of Game Of Thrones.
The Jonas Brothers musician, who is engaged to Sophie Turner (who plays Sansa Stark in the fantasy show), had to sign a non-disclosure agreement after spending time on set.
Earlier this week it appeared that Maisie Williams, who portrays Arya Stark in the series, needed to stick to her own NDA.
In a brutal April Fool's Day prank aired on The Tonight Show Starring Jimmy Fallon, Williams pretended to let slip that her character perishes in the second episode of the final season.
Many fans were fooled by Williams' stunt which saw her turn on the waterworks and ask Fallon's team to edit out the 'spoiler'.
Meanwhile, three new teaser trailers for Game Of Thrones have been shared by HBO.
Read more: Which Game of Thrones house do you belong to?
The latest trailer, titled 'Aftermath', was released on April 2 and shows a seemingly abandoned Winterfell.
Shots pan over the snow-covered castle grounds with familiar artefacts dotted about. We see Bran Stark's wheelchair at the base of a tower as well as Jaime Lannister's gold hand on the ground, and Jon Snow's Longclaw. It suggests that everyone there has either died or has fled the scene.
For the latest rumours, theories, photos, and trailers, head to our Game Of Thrones Season 8 round-up blog.


The second coming of Ryzen.
AMD returned to relevance in the high-end processor space with its Zen architecture, and while first generation Ryzen parts didn't outright dethrone Intel, Zen gave AMD a solid foundation to build upon. We are going to see that soon with the release of second generation Ryzen parts, prices for which have leaked out.
Before we go any further, let's clear something up real quick. AMD's second generation Ryzen processors are not Zen 2. They're based on what AMD is calling Zen+ using a refined 12-nanometer manufacturing process, whereas first generation Ryzen (Zen) processors are built on a 14nm process. Zen 2, due out sometime next year, will be built on a 7nm process.
Okay, back to the leak. Spanish website El Chapuzas Informatico dumped a whole bunch of AMD slides detailing the company's upcoming Ryzen processors. If the slides are legit—and they certainly look like it—we now know what speeds and price points AMD's next batch of Ryzen processors will hit.
Each of those will ship with a different version of AMD's Wraith cooler, with the Wraith Prism going to the Ryzen 7 2700X, Wraith Spire (LED) going to the Ryzen 7 2700, Wraith Spire (non-LED) going to the Ryzen 5 2600X, and Wraith Stealth going to the Ryzen 5 2600.
The price points match up similarly to Intel's Core i7-8700K, Core i7-8700, Core i5-8600K, and Core i5-8600 processors. Just as important, however, one of the slides reiterates that all of AMD's Ryzen 2000 processors are compatible with existing socket AM4 300-series motherboards, with a BIOS update.
AMD will also be releasing new X470 and B450 chipsets to help make better use of its Precision Boost and eXtended Range Frequency (XFR) technologies. Assuming the clockspeeds are the primary change, performance should be up to 10 percent faster than the existing Ryzen parts. Expect to see all of this land at retail on or around April 19, at which time we'll also find out if there are any deeper architectural changes to improve performance..


text:
The Mystery of the Green Children of Woolpit
BY Caitlin Schneider
WIKIMEDIA COMMONS // PUBLIC DOMAIN
Sometime during the 12th century, two children appeared in the village of Woolpit in Suffolk, England, seemingly out of nowhere. These were no ordinary orphans: The boy and girl spoke in an unknown tongue, sported strange clothing, and only ate raw beans. Oh, and their skin was green.
The green children's story began when they emerged from one of the wolf-trapping pits for which the town is named. The pits—designed to lure and ensnare dangerous wolves—were likely at least twice as tall as the children and a couple hundred square feet in area. A reaper discovered the pair and took them into town, where Sir Richard de Calne gave them a home. In time, they lost their viridescent pallor and diversified their diets, though the boy became increasingly depressed and sickly before succumbing to illness and dying.
When the girl learned to speak English, she relayed the story of their underground homeland—St. Martin's Land—where everything was green and it was always twilight. According to the girl, the boy was her brother. In one version of the story, she said that the siblings had been herding their father's cattle when they heard a loud noise and suddenly found themselves at the bottom of a wolf pit. An alternate report states that the children had followed the herd into a cave and had become disoriented. The sound of bells led them out, but when they emerged from the cavern, they did so in Woolpit rather than St. Martin's Land.
Historians have stitched the Woolpit narrative together from the reports of Ralph of Coggeshall and William of Newburgh. Although neither man had firsthand experience with the Green Children, and their secondhand retellings differ in their details, the overall story is the same. Ralph was a sixth abbot of Coggeshall who lived in a nearby county and had repeatedly heard the story from Richard de Caine himself. He wrote of it in the Chronicon Anglicanum around 1189. Monk and historian William of Newburgh's Historia rerum Anglicarum also contains the story of the children, though he was more removed from the incident both physically and in time: His version was published circa 1220 and reportedly came from many "trustworthy sources."
Even if you prefer one account over the other, a larger question remains: is this story a folktale or some botched version of actual history?
If the story is based on actual events, there are a few plausible explanations for the green tint. One theory is that the children had arsenic poisoning. The story goes that their caretaker, an earl from Norfolk, left them to die in a forest near the Norfolk-Suffolk border. Another more likely (and less depressing) culprit is chlorosis, a type of iron-deficiency spawned from malnutrition that leads to a greenish complexion.
Yet another (and perhaps most likely) theory postulates that they were the children of Flemish immigrants who were persecuted and killed—possibly in the battle at Fornham in 1173. Fornham St. Martin was a nearby village, separated from Woolpit by a river and just a few miles from Bury St. Edmunds, where loud bells often chimed. It's possible that the children had been orphaned, suffered a poor diet while lost and on their own, and eventually made their way to Woolpit from Fornham St. Martin by following the clanging bells.
Whatever the children's origin, the sister eventually became integrated into English society. She was baptized and allegedly later married a man at King's Lynn, possibly an ambassador of Henry II, though conflicting reports say she became "rather loose and wanton in her conduct." She may have taken the name "Agnes Barre," though as with most things in the story of the Green Children, there's simply no definitive evidence.


What is DataContext in WPF? and How to Bind Objects to DataContext.
How DataContext helpful to WPF binding Techniques.
DataContext is the Dependency Property which holds the Data. Here Data can be any type, it can be an CLR Object, a DataSet, XMLDataProvider, Any Collection Object etc. Almost all controls in wpf user interfaces are derived from Dependency Object so either Panel controls or Content Controls can have this Property.
This Dependency Property has "Value Inheritance " feature means if you set Data Context as Data Object on Parent element then all of its descendent elements or children elements can reference to Data assigned to parent DataContext. i.e All the child elements are bind against to the Data Object of parent control DataContext unless if we specify to bind against to other Objects.
If DataContext is set on parent elements then no need to set binding source to children elements , we need to specify the path only for children elements. Let us see with example.
I have class called MobileShop with three properties.
Here is the XAML Code How the Window Looks like and How Child Elements access the DataContext of the Parent Control.
In the above lines i created an instance of MobileShop Class added data to properties and assigned that object as DataContext for Window Element. So for all the child elements we have to set the path only no need to set source again.
There is a situation where parent element is set to DataContext object and Child Element bind to Source of another Object then Child Element binds to Source Object Only. Here child element checks first if any Source or RelativeSource bind to any object, if set it will bind to that object, if Source or RelativeSource is not set then WPF Searches up in the element tree for DataContext of the Parent elements if it finds any non null Object then that objects used for Binding. This type of Binding use full when multiple properties are bind to Single Source.
Here is one example using same MobileShop class , where we will create two objects for this class and one object will bind to parent element as earlier, another bind to child element directly as source.
In this way DataContext Property is useful when setting multiple properties to Single Source.
If you are binding single property then it is better to set as source for the element because of easy debugging i.e all the binding information exist in one place rather than searching up in the element tree for nearest DataContext. This DataContext defined in FrameworkElement Class.
Don't forget to Comment and Share to our friends if you like this post. Thank You.


text:
\section{Introduction}
One of the famous problems in the field of combinatorics is the
degree/diameter problem~\cite{Erdos1980,Loz2008,Miller2013,Exoo2013}.
The degree/diameter problem\footnote{The Degree/Diameter Problem,
  CombinatoricsWiki,
  \url{http://combinatoricswiki.org/wiki/The_Degree/Diameter_Problem#Undirected_graphs}}
is the problem of finding the largest possible number $n(d, k)$ of
nodes in a graph of maximum degree $d$ and diameter $k$.  The maximum
degree of a graph is the maximum degree of its nodes.  The degree of a
node is the number of edges incident to the node.  The diameter $k$ of
a graph is the maximum distance between two nodes of the graph.

On the other hand, the problem of the graph golf 2015
competition~\cite{GG2015} is the order/degree problem.  The
order/degree problem is the problem of finding a graph that has
smallest diameter $k$ and average shortest path length (ASPL, $l$) for
a given order and degree.  Compared to the degree/diameter
problem, order is given and diameter is not given in the order/degree
problem.

As the organizer of the competition mentioned, the order/degree
problem has important role to design networks for high perfomance
computing.  Because, the number of nodes of the network is determined
based on design constraints such as cost, space, budget, and
applications.  Solutions of the degree/diameter problem can be used to
limited networks of particular number of nodes.  Currently, there is
no trivial way to increase or decrease the number of nodes from the
optimal graph of the degree/diameter problem, while keeping its
diameter close to the optimal graph.  For example, Besta and
Hoefler~\cite{Besta2014} have presented diameter-2 and -3 networks
with particular number of routers, and each endpoint is connected to a
router.  The number of endpoints can be changed in a range.  Matsutani
et al.~\cite{Matsutani2014} have reduced the communication latency of
3D NoCs, by adding randomized shortcut links.

We try to solve some order/degree problems.  There are two
contributions in this paper.  1) Showing heuristic algorithm to create
a graph for given order and degree (Sec.~\ref{sec:algorithm}).  Using
this algorithm, we have created two best-known graphs; one has order
$n = 4096$ and degree $d = 60$, the other has $n = 4096$ and $d = 64$.
After 2015 competition, we also have created other graph of order $n =
10000$ and degree $d = 60$.
2) Developing evaluation function of edges for 2-opt local search
(Sec.~\ref{sec:search}).  Local search starts with a graph that has
the given number of nodes and satisfies degree constraints.  Swapping
two edges is accepted, if swapped graph $G'$ is better than the
previous graph $G$ in terms of diameter and/or ASPL.  For example, if
two edges $a$-$b$ and $c$-$d$ are selected for swapping from graph
$G$, we try to swap two edges such that two edges $a$-$b$ and $c$-$d$
are removed from and two edges $a$-$c$ and $b$-$d$ are added to the
graph $G$.  If diameter and/or ASPL of swapped graph $G'$ is smaller
than $G$, this swap is accepted.  We call the evaluation function
``edge importance''.  Lower-importance edge pair is selected as the
candidate of swapping earlier than other pairs.  For the existence of
local minimum graph, we need to temporarily accept worse graphs in
searching graph of order $n = 256$ and degree $d = 16$.

\section{Observation of Small Order Graphs}
\label{sec:small}

The observation of small order graphs brings us the idea of the
heuristic algorithm shown in Sec.~\ref{sec:algorithm}.
At the beginning of the 2015 competition, we drew graphs with small
order and degree.  The first graph is order $n = 16$ and degree $d =
3$ as shown in Fig.~\ref{fig:n16d3zdd5}.  The second one is order $n =
16$ and degree $d = 4$ as shown in Fig.~\ref{fig:n16d4iida13}.

The diameters of these two graphs are three ($k = 3$).  Through
drawing these two graphs, we found that these graphs contain many
pentagons (5-node cycles), no or small number of squares (4-node
cycles), and no triangle (3-node cycle).  In Fig.~\ref{fig:n16d3zdd5},
there is no triangle and no square.  No triangle and four squares
exist in Fig.~\ref{fig:n16d4iida13}.  We think triangles and squares
cause diameter ASPL (average shortest path length) to be larger for
the case of $k = 3$.  Through this observation, we define increasing
the number of pentagons as our policy in Section \ref{sec:algorithm}.
In the degree/diameter problem, pentagons are appeared in the graphs
of diameter $k = 2$, e.g., Petersen graph (shown in
Fig.~\ref{fig:petersenGraph}) and Hoffman-Singleton graph ($n = 50$
and $d = 7$).

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.5]{figs/n16d3zdd5reorder.pdf}

    \footnotesize
    (a) ring layout

    \includegraphics[scale=.5]{figs/n16d3zdd5cycles.pdf}

    (b) pentagon (5-node cycle) layout
  \end{center}
  \caption{The best known graph with order $n = 16$ and degree $d = 4$}
  \label{fig:n16d3zdd5}
\end{figure}

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.5]{figs/n16d4iida13ring.pdf}
    \footnotesize

    (a) ring layout

    \includegraphics[scale=.5]{figs/n16d4iida13line.pdf}

    (b) pentagon (5-node cycle) layout

    \includegraphics[scale=.5]{figs/n16d4iida13fourCycles.pdf}

    (c) square (4-node cycle) layout

  \end{center}
  \caption{The best known graph with order $n = 10$ and degree $d = 3$}
  \label{fig:n16d4iida13}
\end{figure}

\section{Heuristic Algorithm}
\label{sec:algorithm}

\subsection{Policy and Outline of Heuristic Algorithm}

Based on the observation of small order graphs described in
Sec.~\ref{sec:small}, we determine the outline of our heuristic
algorithm as following two steps.  1) If target diameter is $k$, we
connect small order graphs such that their diameter is $k - 1$.  For
example, if the target diameter $k = 3$ and order $n = 10000$, the
$1000$ Petersen graphs (Fig.~\ref{fig:petersenGraph}, diameter $k =
2$) are connected.  2) We try to increase the number of $(2k-1)$-node
cycles, when edges are added.  For graphs of $k=3$, we try to increase
the number of pentagons (5-node cycles).

Outline of our heuristic algorithm is shown in Algorithm \ref{alg:gg}.
In the remaining of the paper, we discuss only $k=3$ graphs.  Our
algorithm generates a graph which diameter is almost 3, for given
order and degree.

\begin{algorithm}
  \caption{Outline of graph generation algorithm}\label{alg:gg}
  \begin{algorithmic}[1]
    \Procedure{GraphGenerater}{order $n$, degree $d$}
      \State Create a base graph $G_0$, such that order of $G_0$ is $n$
      \State Create a graph $G$, by greedily adding edges one by one to $G_0$
      \State Return the graph $G$
    \EndProcedure
  \end{algorithmic}
\end{algorithm}

\subsection{Create a Base Graph $G_0$}

A base graph $G_0 = (V, E_0)$ has $n$ nodes, i.e. $|V| = n$.  The
graph $G_0$ is a connected graph, but its degree is five.  Most nodes
have five edges.  Other nodes, i.e., some border and anomalous nodes
have four edges.

Graph $G_0$ contains multiple Petersen graphs.  The Petersen graph
$G_P$, which is shown in Fig.~\ref{fig:petersenGraph}, is one of
well-known Moore graphs~\cite{Miller2013}, and has ten nodes and
degree $d = 3$.  The diameter of Petersen graph is two.  When the
nodes are numbered in Fig.~\ref{fig:petersenGraph}, fifteen edges of
the Petersen graph are described as follows, for $i \in \{0, 1, 2, 3,
4\}$ and $j \in \{5, 6, 7, 8, 9\}$.

\def{\rm \;mod\; }{{\rm \;mod\; }}
\begin{eqnarray*}
  && (i, i + 1 {\rm \;mod\; } 5) \\
  && (i, (2 i {\rm \;mod\; } 5) + 5) \\
  && (j, (j + 1 {\rm \;mod\; } 5) + 5)
\end{eqnarray*}

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.5]{figs/petersenGraph.pdf}
  \end{center}
  \caption{The Petersen graph $(n=10, d=3)$}
  \label{fig:petersenGraph}
\end{figure}

If a given order $n$ is multiple of ten, we generate $(n / 10)$
Petersen graphs, $G_{Pk} \;(k = 1, 2, 3, \ldots, n / 10)$.  Adjacent
Petersen graphs, $G_{Pk}$ and $G_{P(k+1)}$, are connected as shown in
Fig.~\ref{fig:connectPetersenGraph} by {\sc Connect} procedure in
Algorithm~\ref{alg:baseGraph}.  Fig.~\ref{fig:connectPetersenGraph}
shows only edges crossing two Petersen graphs.  In the case of $n =
10000$, we generate 1000 Petersen graphs, and $k$-th graph are
connected with $(k-1)$-th and $(k+1)$-th graph for $1 < k < 1000$.

\begin{algorithm}
  \caption{Create a base graph $G_0$}
  \label{alg:baseGraph}

  \begin{algorithmic}[1]
    \Procedure{CreateBaseGraph}{$n$}
      \For{\textbf{each} $k \in \{1, \ldots, (n / 10)\}$}
        \State Create $k$-th petersen graphs
      \EndFor
      \For{\textbf{each} $k \in \{1, \ldots, (n / 10) - 1\}$}
        \State {\sc Connect}$(k)$
      \EndFor
    \EndProcedure
    \Procedure{Connect($k$)}{}
    \State Connect $k$-th and $(k+1)$-th Petersen graphs as shown in Fig.~\ref{fig:connectPetersenGraph}
    \EndProcedure
  \end{algorithmic}
\end{algorithm}

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.5]{figs/petersenGraphConnect}
  \end{center}
  \caption{Connecting two adjacent Petersen graphs}
  \label{fig:connectPetersenGraph}
\end{figure}

When there is a remainder $r > 0$ divided by ten, i.e., $n = 10 \cdot
\lfloor n / 10 \rfloor + r$, we replace $r$ Petersen graphs with $r$
11-node graphs.  The 11-node graph is the subgraph of
Fig.~\ref{fig:n16d4iida13}.  We heuristically select eleven nodes, $5,
6, 7, \ldots, 15$ from the graph of Fig.~\ref{fig:n16d4iida13}.  When
we connect a 11-node graph with adjacent Petersen graphs, we ignore
node 10 and other ten nodes are connected similar to
Fig.~\ref{fig:connectPetersenGraph}.  The eleven nodes graph is shown
in Fig.~\ref{fig:11nodesGraph}, nodes are renumbered, except for node
10.  Nodes $5, 6, 7, 8, 9, 11, 12, 13, 14, 15$ in
Fig.~\ref{fig:n16d4iida13} are renumbered to $2, 3, 4, 0, 1, 6, 7, 8,
9, 5$ in Fig.~\ref{fig:11nodesGraph}, respectively.

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.5]{figs/petersenGraphPlusOne.pdf}
  \end{center}
  \caption{The 11-node graph $(n=11, d=4)$ for base graphs}
  \label{fig:11nodesGraph}
\end{figure}

The base graph $G_0$ is generated by {\sc CreateBaseGraph} procedure
in Algorithm~\ref{alg:baseGraph}.  The base graph $G_0$ has $n$ nodes.
Each node of $G_0$ has five edges, except for nodes in the first and
the last Petersen graphs and node 10 of 11-node graphs.  These
exceptional nodes have just four edges.

\subsection{Greedily Add Edges One by One to $G_0$}

In this step, we greedily add edges one by one to the base graph
$G_0$.  Our policies to add edges are the followings.
\begin{enumerate}
\item Increase the number of pentagons in the graph, to create a graph
  such that its diameter becomes three and its ASPL is close to two.
\item Add an edge, which has the smallest degree node on one side.
\item No track back, i.e., never remove edges from the graph.
\end{enumerate}

Under the policy 1), our heuristic searches two nodes such that
distance of them is four, and adds an edge between these two nodes.
By adding the edge, the number of pentagons is increased.  Even if the
small-degree graph of $n = 16$ and $d = 4$ in
Fig.~\ref{fig:n16d4iida13}, there are many pentagons those include a
particular edge.  For example, an edge 1-2 is contained in eight
pentagons; 1-2-3-4-0, 1-2-6-7-0, 1-2-15-14-0, 1-2-3-8-9, 1-2-3-13-12,
1-2-6-5-9, 1-2-6-7-12, and 1-2-6-10-9.

The policy 2) is employed to uniformly increase the degree of nodes
and save computation time.  Our heuristic maintains the nodes that
have the smallest degree, and selects a node from them as one side of
a new edge.  A node of the other side is selected based on the policy
1).  Although we can select the new edge from all possible pair of
nodes, to save computation time, our heuristic limits search space by
fixing one side of new edge.

The policy 3) also saves computation time.  As another reason, we do
not find any effective evaluation function to track back.

Here, we explain this step in Algorithm~\ref{alg:addEdges}.  In each
loop iteration of lines~\ref{l:while1} to \ref{l:while1end}, two nodes
$i$ and $j$ are selected and add an edge $i$-$j$ to the graph.  Node
$i$ is chosen from the nodes of the smallest degree in $G$ at
line~\ref{l:selecti}, based on policy 2).  $d(i, j)$ denotes the
distance between two nodes $i$ and $j$.  In the loop of
lines~\ref{l:for1} to \ref{l:for1end}, candidates of node $j$ are
evaluated, based on policy 1).  After evaluation, node $j$ that
satisfies two following conditions (\ref{eqn:p1}) and (\ref{eqn:p2})
is selected in line~\ref{l:selectj}, and an edges $i$-$j$ is added to
graph $G$ in the next line.  $J'$ is the subset of $J$ such that each
node in $J'$ satisfies condition (\ref{eqn:p1}).  We have no
particular tie-breaking rule.
\begin{eqnarray}
  p_1(j) &=& \min_{j'\in J} p_1(j') \label{eqn:p1} \\
  p_2(j) &=& \max_{j'\in J'} p_2(j') \label{eqn:p2}
\end{eqnarray}

The {\sc CountPaths} function is used for the evaluation of $j \in J$.
{\sc CountPaths}$(i, j)$ roughly counts the number of paths between
two nodes $i$ and $j$, those distance are three.  $D_m(i)$ is the set
of nodes distant $m$ from node $i$, i.e., for every node $k \in
D_m(i)$, $k$ satisfies $d(i, k) = m$.  For example, every node $k \in
D_1(i) \cap D_2(j)$ satisfy $d(i, k) = 1$ and $d(k, j) = 2$.  $p$ in
line~\ref{l:countpathp} is close to the twice of the number of 4-node
paths.

\begin{algorithm}
  \caption{Greedily add edges, one by one to $G_0$}
  \label{alg:addEdges}
  \begin{algorithmic}[1]
    \Procedure{AddEdges}{$n, d, G_0$}
      \State $G \gets G_0$
      \While{edge can be added}\label{l:while1}
        \State\label{l:selecti} Select a node $i$ from the smallest degree nodes
        \State Compute node set $J$ such that $d(i, j) > 2$
        \For{\textbf{each} node $j \in J$}\label{l:for1}
          \State $p_1(j) = \mbox{\sc CountPaths}(i, j)$
          \State $p_2(j) = 0$
          \For{\textbf{each} $k \in j$'s neighbors}
            \If{$\mbox{\sc CountPaths}(i, k) > p_2(j)$}
              \State $p_2(j) = \mbox{\sc CountPaths}(i, k)$
            \EndIf
          \EndFor
        \EndFor\label{l:for1end}
        \State Select $j \in J$ that satisfies conditions (\ref{eqn:p1}) and (\ref{eqn:p2}) \label{l:selectj}
        \State Add an edge $i$-$j$ to graph $G$
      \EndWhile\label{l:while1end}
      \State If degree of several nodes are less than $d$, add several
      edges between them
    \EndProcedure

    \Function{CountPaths}{$i, j$}
      \State $p = | D_1(i) \cap D_2(j) | + | D_2(i) \cap D_1(j) |$
      \label{l:countpathp}
      \Comment Roughly count the number of paths with distance 3
      between node $i$ and $j$, for graph $G$
    \EndFunction
  \end{algorithmic}
\end{algorithm}

\subsection{Generated Graphs}

Diameter $k$ and ASPL $l$ of generated graphs are shown in
Table~\ref{tbl:heuristicResults}.  Fortunately, two graphs of $n =
4096$ are the new records in the competition.  The graph of $n = 256$
has the same diameter, but longer ASPL than the best record $l =
2.09262$ and two competitors' records.
For two graphs of $n = 10000$, our first implementation is too slow
and can not finish before the deadline of the 2015 competition.  After
the competition, we reimplement the program and get the results as
shown in Table~\ref{tbl:heuristicResults}.

\begin{table}
  \caption{Graphs generated by the heuristic algorithm}
  \label{tbl:heuristicResults}
  \centering
  \begin{tabular}{rr|rr|l}
    order $n$ & degree $d$ & diameter $k$ & ASPL $l$ & note \\
    \hline
    256 & 16 & 3 & 2.12757 & not submitted \\
    4096 & 60 & 3 & 2.295275 & *1\\
    4096 & 64 & 3 & 2.242228 & *1\\
    10000 & 60 & 3 & 2.648980 & *2 \\
    10000 & 64 & 3 & 2.611310 & *3 \\
    \\
    \multicolumn{5}{r}{\begin{minipage}{.7\linewidth}

        *1: None submits smaller graph in the competition.

        *2: A smaller-ASPL graph is created after competition.  The
        winner's graph of the competition has $l = 2.650157$.

        *3: The graph is created after competition.  However, the
        winner's graph of the competition ($l = 2.609927$) has smaller
        ASPL than this.
    \end{minipage}}
  \end{tabular}
\end{table}

\section{A Technique of 2-Opt Local Search}
\label{sec:search}

\subsection{Edge Importance Function}

After a graph is created by heuristic algorithm described in
Sec.~\ref{sec:algorithm} for a given order and degree, we start 2-opt
local search.  2-opt is the basic and widely used local search
heuristic~\cite{Englert2007}.  It is used for traveling salesperson
problem (TSP) and others.

In this section, we explain edge importance which is used to
prioritize edge combinations for 2-opt local search.  2-opt algorithm
slightly modifies a given graph recursively.  The modification of
2-opt is swapping two edges.  An example of swapping two edges $a$-$b$
and $c$-$d$ into $a$-$d$ and $b$-$c$ is shown in
Fig.~\ref{fig:swapExmaple}.  Diameter and ASPL of pre-swap graph $G =
(V, E)$ and post-swap graph $G' = (V, E')$ are compared with each
other.  If diameter and/or ASPL of $G'$ is smaller than $G$, this swap
is accepted.

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.5]{figs/2optFlip.pdf}
  \end{center}
  \caption{Swap two edges $a$-$b$ and $c$-$d$ into $a$-$d$ and
    $b$-$c$.  (We assume degree $d = 9$ and other nodes are not drawn.
    There is another swap into $a$-$c$ and $b$-$d$ for these edges)}
  \label{fig:swapExmaple}
\end{figure}

2-opt local search is time-consuming task.  There are many ways to
reduce computation time.  Even if we search a graph of order $n = 256$
and degree $d = 16$, there are 2048 edges in the graph.  The number of
edge pairs is about $2\times10^6$.  Generally, the number of edge
pairs is about $\frac{nd}{2}\cdot\frac{(n - 2)d}{2}\cdot\frac{1}{2} =
O(n^2d^2)$.  For each swapped graph, we need to calculate diameter and
ASPL.  We adopt two techniques to save computation time.  One is edge
importance, and the other is fast ASPL calculation for 2-opt.

Our edge importance (or edge impact) is a value given to each edge of
a graph.  As an intuitive explanation, less important edges probably
be removed from the graph with little increase of ASPL than other
edges.  Then, we give higher priority to less important edges, when we
select an edge pair for swap.

The edge importance of an edge $e = j$-$k$ is defined by the following
function.
\[
f(e) = f(j\mbox{-}k) = \sum_{i \in V} f_1(i, j\mbox{-}k),
\]
where $f_1(i, j\mbox{-}k)$ is the importance of edge $j$-$k$ for node
$i$.  The examples of $f_1(i, j\mbox{-}k)$ is shown in
Fig.~\ref{fig:edgeImportance}.  We assume $f_1(i, j\mbox{-}k) = f_1(i,
k\mbox{-}j)$ (symmetricity) and divide two cases of $f_1(i,
j\mbox{-}k)$ as follows.
\begin{itemize}
\item If two nodes $j$ and $k$ have the same distance from $i$, i.e.,
  $d(i, j) = d(i, k)$, then $f_1(i, j\mbox{-}k) = 0$.  (left of
  Fig.~\ref{fig:edgeImportance})
\item If two nodes $j$ and $k$ have the different distance from $i$,
  i.e., $d(i, j) + 1 = d(i, k)$, then $0 < f_1(i, j\mbox{-}k) \le 1$.
  We define node set $J$, each of which has an edge to $k$ and its
  distance from $i$ is equal to $d(i, j)$.
  \[
  J= \{ j' | j' \in V \mbox{ and } d(i, j') = d(i, j) \mbox{ and }
  d(j', k) = 1 \}
  \]
  Using $J$, $f_1(i, j\mbox{-}k)$ is defined as follows.
  \[
  f_1(i, j\mbox{-}k) = \frac{1}{|J|}
  \]
  The center of Fig.~\ref{fig:edgeImportance} shows a subcase of $|J|
  = 2$, and the right of it shows the other subcase of $|J| = 1$.
  Note that, this case includes the case of $i = j$.  If $i = j$, then
  $|J| = 1$ by the definition.
\end{itemize}

\begin{figure}[tb]
  \begin{center}
    \includegraphics[scale=.45]{figs/2optEdgeImportance.pdf}
  \end{center}
  \caption{Edge importance of an edge $j$-$k$ for node $i$}
  \label{fig:edgeImportance}
\end{figure}

\subsection{Order of Edges Pairs for Local Search}

Two lower-importance edges are the candidate of swapping for 2-opt
local search.  All edges are sorted by edge importance and denoted by
$e_0, e_1, \ldots, e_{|E| - 1}$.  The edge $e_0$ has the smallest
importance.

The 2-opt local search algorithm is shown in Algorithm~\ref{alg:2opt}
The loop of lines~\ref{alg2opt:repoeat1} to \ref{alg2opt:repoeat1end}
is the main loop of local search.  Line~\ref{alg2opt:selectEdgePair}
is the important point using edge importance.  We tries several orders
to select a pair, which are described in the next paragraph.  For pair
$e_i (= a$-$b)$ and $e_j (= c$-$d)$ selected in
line~\ref{alg2opt:selectEdgePair}, there are two
combinations\footnote{If graph $G$ already has one of edges $a$-$c$ or
  $b$-$d$ ($a$-$d$ or $b$-$c$), we skip the swap since the degree of
  two nodes are decreased by one.} of swapping, 1) $a$-$c$ and $b$-$d$
($G'$ of line~\ref{alg2opt:G'}) and 2) $a$-$d$ and $b$-$c$ ($G''$ of
line~\ref{alg2opt:G''}) .  Diameter and ASPL of both $G'$ and $G''$
are calculated.  The loop of lines~\ref{alg2opt:while1} to
\ref{alg2opt:while1end} implies that edge importance is reused for
swapped graphs.  In our experience, after fifty swaps, ordering still
valuable to find smaller ASPL graph.
\begin{algorithm}
  \caption{2-opt local search}
  \label{alg:2opt}
  \begin{algorithmic}[1]
    \Procedure{Multiple2opt}{$G$}
      \State Calculate edge importance of all edges in $G$
      \State Sort edges by edge importance
      \While{timeout}\label{alg2opt:while1}
        \Repeat\label{alg2opt:repoeat1}
          \State Select an edge pair $(e_i, e_j)$ in a particular order\label{alg2opt:selectEdgePair}
          \State Generate swapped graph $G'$\label{alg2opt:G'}
          \State Calculate diameter and ASPL of $G'$
          \State Generate another swapped graph $G''$\label{alg2opt:G''}
          \State Calculate diameter and ASPL of $G''$
        \Until{$G'$ or $G''$ has smaller diameter or ASPL than $G$}\label{alg2opt:repoeat1end}
        \State Copy $G'$ or $G''$ to $G$
      \EndWhile\label{alg2opt:while1end}
    \EndProcedure
  \end{algorithmic}
\end{algorithm}

We heuristically employ two searching orders of
line~\ref{alg2opt:selectEdgePair} in Algorithm~\ref{alg:2opt}.  Both
orders satisfy $(e_i, e_j) < (e_i, e_k) < (e_j, e_k)$ for $i < j < k$.
We think the order of the smallest first is better than it of
triangle, empirically.
\begin{itemize}
\item the smallest first: $(e_i, e_l) < (e_j, e_k)$ for $i < j < k < l$.

  $(e_0, e_1), (e_0, e_1), (e_0, e_2), \ldots, (e_0, e_{|E| - 1}),$ \\
  $(e_1, e_2), (e_1, e_3), (e_1, e_4), \ldots, (e_1, e_{|E| - 1}),$ \\
  $(e_2, e_3), (e_2, e_4), (e_2, e_5), \ldots, (e_2, e_{|E| - 1}),$ \\
  $\ldots, $\\
  $(e_i, e_{i+1}), (e_i, e_{i+2}), (e_i, e_{i+3}), \ldots, (e_i, e_{|E| - 1}),$\\
  $\ldots$
\item triangle: $(e_i, e_l) > (e_j, e_k)$ for $i < j < k < l$.

  $(e_0, e_1),$ \\
  $(e_0, e_2), (e_1, e_2),$ \\
  $(e_0, e_3), (e_1, e_3), (e_2, e_3),$\\
  $\ldots, $ \\
  $(e_0, e_i), (e_1, e_i), (e_2, e_i), \ldots, (e_{i - 1}, e_i),$ \\
  $\ldots$
\end{itemize}

Since ASPL calculation is time-consuming task, we additionally design
ASPL recalculation method for 2-opt local search.  The method stores
the distance matrix of graph $G$ and update the matrix for swapped
graph $G'$.  We can elimiate re-calculation of the distance between
nodes which the swap does not affect.

\subsection{Graph Instances}

We run local search program during the competition and after
competition.  We show the smallest graph that we found in
Table~\ref{tbl:2optResults}.  These graphs probably are the best-known
graphs for these four combinations of order and degree.  For graphs of
order $n = 4096$ and $n = 10000$, Algorithm~\ref{alg:2opt} is directly
applied.

\begin{table}
  \caption{Graphs by local searching after 2015 competition}
  \label{tbl:2optResults}
  \centering
  \begin{tabular}{rr|rr|r}
    order $n$ & degree $d$ & diameter $k$ & ASPL $l$ & $l$ of Table~\ref{tbl:heuristicResults} \\
    \hline
    256 & 16 & 3 & 2.09069 & 2.12757 \\
    4096 & 60 & 3 & 2.295216 & 2.295275 \\
    4096 & 64 & 3 & 2.242170 & 2.242228 \\
    10000 & 60 & 3 & 2.648977 & 2.648980 \\
    \\
    \multicolumn{5}{r}{\begin{minipage}{.7\linewidth}

        Note: all graphs may be the best-known graphs.  The winner's
        graph of the competition has larger ASPL than these.
    \end{minipage}}
  \end{tabular}
\end{table}

For the graph of order $n = 256$ and degree $d = 16$, our graphs fall
into local optimal many times.  To find graphs of smaller ASPL, we
accept worse post-graph $G'$ than pre-swap graph $G$ in 2-opt local
search.  Fig.~\ref{fig:localsearch-n256-d16} shows the search history
of the last 1000 graphs before reaching the best-known graph of $l =
2.09069$.  Many branches from each graph is omitted.  In this figure,
we show ASPL of each graph and order of edges that we swapped.  The
order of swapped edges is distributed from 0 to 620, i.e., swapped
edges are two of $e_0, e_1, e_2, \ldots, e_{620}$ in each graph.  To
reach the best-known graph, we need to run local search at least in
the range of edge pair $(e_i, e_j)$ for $0 \le i \le 153$ and $1 \le j
\le 620)$.  This range contains only 4 \% of all edge pairs.  So, the
edge importance seems to be valuable function to prioritize edges for
swapping.
We briefly explain the distribution of order of swapped edges.  Since
two edges are selected for each swap in
Fig.~\ref{fig:localsearch-n256-d16}, the total number of selected
edges are 2000 for 1000 swaps.  The half of these edges have the order
smaller than 8.  The order smaller than 108 contains 90\% of these
edges.

\begin{figure}[tb]
  \begin{center}
    \includegraphics[width=\linewidth]{graphs/n256d16-k3l2_090686274509804-t20t14-graphAnalyseP2-29490-003_trace-h1.pdf}

    \footnotesize
    (a) first half (ASPL: $2.09163 < l < 2.09277$)

    \includegraphics[width=\linewidth]{graphs/n256d16-k3l2_090686274509804-t20t14-graphAnalyseP2-29490-003_trace-h2.pdf}

    (b) last half (ASPL: $2.09068 < l < 2.09186$)
  \end{center}
  \caption{Local search history of 1000 graphs of order $n = 256$ and degree $d = 16$}
  \label{fig:localsearch-n256-d16}
\end{figure}

\section{Conclusion}

In this paper, we explained the heuristic algorithm that creates a
graph which has small average shortest path length (ASPL) for diameter
3 graphs.  The algorithm intends to increase the number of pentagons
(5-node cycles).  Through the observation of small order graphs which
has diameter 3, we focused on the number of pentagons.  The heuristic
algorithm can create two best-known graphs at the graph golf 2015
competition, and a best-known graph after the competition.  These
three graphs have order $n = 4096$ and degree $d=60$, $n = 4096$ and
$d=64$, and $n = 10000$ and $d=60$.

We also explained the technique of 2-opt local search to reduce ASPL
of a graph.  The technique is based on the evaluation function called
edge importance (or edge impact).  Edges which have smaller importance
compared to other edges are the good candidates for swap of 2-opt.  We
applied this technique to the graph of $n = 256$ and $d = 16$, and
find a best-known graph after competition.

As future work, we will try to find more elegant heuristic to create a
small ASPL graph, for not only diameter 3 graphs but also larger
diameter graphs.  Data structures for fast ASPL computation also
should be explored.

\section*{Acknowledgment}
This work was partially supported by JSPS KAKENHI Grant Number
26330107.

redpajama_set_name: RedPajamaArXiv


text:
Q: Integration, trigonometry, gamma/beta functions In a classical mechanics text, I saw an integration(as part of a math) that uses gamma function as follows:
$$\int_0^{\pi/2} (\cos^2 x-\cos^3 x)dx$$ $$=\frac{\Gamma(\frac{2+1}{2})\Gamma(\frac{0+1}{2})}{2\Gamma(\frac{2+0+2}{2})}-\frac{\Gamma(\frac{3+1}{2})\Gamma(\frac{0+1}{2})}{2\Gamma(\frac{3+0+2}{2})} $$
What is the exact formula that is used here?

A: They are using the Beta function and in particular its defining property:
$$\frac{\Gamma(x)\Gamma(y)}{\Gamma(x+y)}=B(x,y) =
  2\int_0^{\pi/2}(\sin\theta)^{2x-1}(\cos\theta)^{2y-1}\,\mathrm{d}\theta,
  \qquad \mathrm{Re}(x)>0,\ \mathrm{Re}(y)>0$$


"I'm really excited about taking on the role as Worldsensing's CTO. It's a fascinating time to be involved in the Industrial Internet of Things space, with new challenges and opportunities constantly emerging. Given how we work at Worldsensing, always focused on helping our customers solve problems end-to-end, this means having to continually evolve and adjust our technology strategy for both the device and software businesses, including security, data analysis, IT operations, communication protocols, amongst many others. Strategy is key to make sure we deliver the best possible experience to the end-users and partners. I feel very honored to lead Worldsensing's tech activities, even more so because the company is already a leader in the IIoT space", Albert states.
Prior to joining the IoT pioneer in Barcelona in 2017, Albert served as VP of Engineering at EVRYTHNG, an IoT software company. Based at their London office, Albert and the team designed and delivered an award-winning IoT platform used by companies such as Coca-Cola, DIAGEO, GE, Unilever, or LVMH, to name a few.
At Worldsensing, Albert is in charge of further developing both the company's solution and device businesses. With the software teams, he focuses on continuously extending the core technology the company uses to create custom-built solutions for the Smart Construction and Smart City industries. Applications powered by OneMind, the intelligent IoT solution builder, enable critical infrastructure operators, construction project managers and city operators to act based on a common, single source of truth and make decisions based on real-time data insights.
While the software solutions teams are involved in delivering projects around the globe, Albert is working with the engineers who are part of the device teams to further strengthen the market position of Worldsensing's wireless monitoring system, Loadsensing. With over 30,000 deployments across 50 countries, Loadsensing is the globally leading system used to monitor risks at critical infrastructures such as tunnel construction projects and mines. Loadsensing is used to digitize existing sensors in harsh and hard-to-access environments. Due to running on the IoT network LoRa, Loadsensing data nodes are able to capture and transmit sensor data to remote control centers over long distances of up to 9 miles / 15 km line of sight helping operators to keep their workforce and public safe and to comply with safety regulations.
"What we do at Worldsensing is challenging and exciting at the same time. The engineering teams are not only delivering both software and device technologies, but are also continuously trying to push further and include innovative approaches in the IIoT space. There is a reason why Loadsensing is setting the standards in wireless monitoring and why we see OneMind generating traction in markets where other IoT platforms haven't been able to find their feet yet.', Albert points out. 'It's extremely rewarding to be part of this environment, being able to work with and oversee a broad range of cutting-edge tech", he concludes.
As a company, Worldsensing is committed to developing talent internally and focused on creating an environment where employees can constantly innovate and grow their careers. We wish Albert the best of luck in his new role.
With over 15 years' experience, Albert has helped many companies transform their technology roadmap by combining his deep technical expertise with proven management skills. While currently leading the engineering teams at Worldsensing, he previously served as VP of Engineering at EVRYTHNG, where his team built an award-winning IoT platform used by companies such as Coca-Cola, DIAGEO,and GE. Albert holds a Master of Science in Telecommunications Engineering and a Bachelor of Science in Electrical Engineering.
OneMind is the intelligent IoT solution builder Worldsensing uses to build applications for Smart Construction and Smart City operations. Functioning as a system of systems, OneMind allows connecting all existing data sources to one single point of insight to provide real-time information on operational processes. Applications powered by OneMind provide construction site managers and directors of operations in cities with instant intelligence and response plans to make smart decisions and manage teams and processes more efficiently.
Worldsensing is a widely recognized global IoT pioneer. Founded in 2008, the Barcelona-based technology provider delivers Operational Intelligence to traditional industries and cities. With over 90 employees and offices in Barcelona, London and Los Angeles, Worldsensing is globally active and has customers in over 60 countries across all continents.