text:
09 Fakultät für Raumplanung
Raumbezogene Informationsverarbeitung und Modellbildung
Authors: Nguyen, Huu Kiet
Title: Combination between land suitability evaluation and multi-objective optimization mathematics model to sustainable agricultural land use planning in the coastal zone of the Mekong Delta, Viet Nam
Abstract: Land evaluation is the primary content in the land-use planning process. There were many land evaluation methods which have been improved based on the FAO framework, but most of them have not been effectively assessed. The requirements of land characteristics and physical conditions supply a common view of land use types for land suitability. It is difficult in precise decision making for agricultural planning. Decision makers have to optimize productive agriculture and promote farmers' socio-economic conditions. The obstacle of the decision makers is the uncertainty because most criteria have interactive features in reality. The simulation of land-use options is essential to support decision makers. It helps to evaluate and adjust the effects of plans because the parameters in reality are always changing. It is an excellent solution to maximize land-use efficiency. Besides, combining modelling approaches in land use planning is necessary because every approach with its single effectiveness cannot entirely assess the different parameters of sustainable land-use planning. Considering these challenges and limitations in the last studies, this dissertation aims for the development of a methodology for the monitoring and analysis of the combination between land suitability evaluation and a multi-objective optimization mathematics model to support effective land use planning towards sustainable agricultural land use planning in the coastal zone of the Mekong Delta, Vietnam. The Mekong Delta (MD) in Vietnam has faced severe risks from the significant change of ecological systems. Especially, saltwater intrusion, sea level rise and the increasing hydroelectricity dams have sharply impacted land use. One of the significant modifications is the change from rice cultivation to shrimp cultivation where the fresh water zones are converted to brackish water zones. As an inevitable consequence, it leads to advantages and disadvantages as outcomes for the economy, society and environment which strongly affect the livelihood of farmers. So four coastal districts of Soc Trang province, the MD in Vietnam were chosen as the case study. By comparing four evaluation methods in the crisp environment (FAO-, MCE-Method) and the fuzzy environment (methods of MAX operator and LUKASIEWICZ operator), we could find that the method of LUKASIEWICZ operator is the best method for land suitability analysis. The fuzzification via membership functions for four linguistic terms of suitability classification was used. The results reflect the mathematical cardinality of the LUKASIEWICZ operator in the fuzzy environment because this operator integrates all characteristics. Therefore, this method is useful in the land evaluation. The LUKASIEWICZ operator in the fuzzy environment is applied in sustainable land evaluation. The objectives of the economy, society, environment and natural resources are considered for sustainable land evaluation. The LUKASIEWICZ operator coordinated the preferences of multi-objectives and continuously expressed the suitability classification in the fuzzy environment. By comparing three results of land suitability analysis: land physical suitability (by FAO method), economic suitability (by the method of LUKASIEWICZ operator) and land sustainable suitability (by the method of LUKASIEWICZ operator), we can confirm the effectiveness of sustainable land evaluation. As a necessity, it should be applied in advanced studies in sustainable land use planning. For this study area, it can be strongly recommended for agricultural land use planning during a ten year period as a master plan. The application of FAHP (Fuzzy Analytic Hierarchy Process) for multiple criteria decision-making is based on fuzzy pair-wise comparison matrices. The result illustrates that it incorporated the preferences of nine decision makers (DMs) by weights as a compromise index. FAHP proved a useful role in multiple criteria decision-making. It is an important tool for making decision by connecting and satisfying multiple criteria of land use planning . The FMOLP (Fuzzy Multi-Objective Linear Programming) is satisfied with the conflict of qualitative and quantitative interests of five objectives (Income, Benefit per Cost ratio, Employment, Land and Environment). We established eight scenarios to find a suitable result by the alternative priorities of five objectives. The result allocates spatial planning for 5 LUTs (Land Use Types) and handles the problem of optimization to support better agricultural land use planning. It creates a balance between the land use supply and demand for land use change. This study suggests changing land use planning by Scenario 2 (More priority for economic and environmental protection development) for the 2020-2025 period in this study area.
Subject Headings: Fuzzy multi-objective linear programming (FMOLP)
Land evaluation
Subject Headings (RSWK): Bodennutzung
Agrarplanung
Appears in Collections: Raumbezogene Informationsverarbeitung und Modellbildung
Dissertation_NguyenHuuKiet_04-06-2019-Final Correction.pdf DNB 3.66 MB Adobe PDF View/Open


text:
Bexar County could hit peak of COVID-19 crisis at end of April, mid-May
Helpers load food into cars as people in cars gather at Traders Village to get food from the San Antonio Food Bank on Thursday, April 9, 2020. The coronavirus pandemic has put enormous strain on households and their food budgets across the city. (Kin Man Hui/The San Antonio Express-News via AP)
Kin Man Hui, MBO / Associated PressShow MoreShow Less
Personnel pass one another at the Bexar County Sheriff's Office and Detention Center on April 14, 2020.
Tom Reel, San Antonio Express-News / Staff photographerShow MoreShow Less
Medical personnel leave after using hand sanitizer at the Bexar County Sheriff's Office and Detention Center on April 14, 2020.
Personnel leave the Bexar County Sheriff's Office and Detention Center on April 14, 2020.
Efforts to slow a coronavirus outbreak at the Bexar County Jail include isolating units where cases are identified, County Judge Nelson Wolff said.
Tom Reel /Staff photographerShow MoreShow Less
Efforts are underway to contain an outbreak at the Bexar County Jail, County Judge Nelson Wolff said Tuesday.
Computer modeling data that the city will begin posting on its website Wednesday predicts Bexar County may hit the peak of the COVID-19 pandemic at the end of the month.
The city is using two models from UTSA, another by international consulting firm Oliver Wyman and a fourth from the Institute for Health Metrics and Evaluation at the University of Washington.
"Some of the data that we're seeing from these models estimate the peak of the pandemic here in Bexar County to happen anywhere between late April and mid-May," Colleen Bridger, assistant city manager and former director of the San Antonio Metropolitan Health District, said at a daily city-county coronavirus briefing Tuesday night.
That peak is when health officials can expect the number of confirmed COVID-19 cases to reach its highest and when there will be "fewer and fewer positive cases."
The other key projection from the models, she said, is the estimated total number of cases. The four estimates range from 1,100 to more than 10,000, although Bridger said that gap in figures should get narrower as new data is fed into the models.
As of Tuesday, there were 815 confirmed cases — up 21 from Monday, officials said. The models will help local authorities make "data-driven decisions around how we respond to this pandemic," Bridger said. But she compared the models to hurricane tracking models used by meteorologists, cautioning that they could change.
"Just like when we're looking at hurricane maps, it may wobble a little bit to the east or a little bit to the west," she said.
Mayor Ron Nirenberg said the models give the city "a great new start" in preparing for the next steps in the pandemic. He and Bexar County Judge Nelson Wolff Judge have discussed forming a panel of experts to "make sure that we understand the rules of the road, the conditions and circumstances by which we can be opening back up again."
"Because we know that even as we pass through a peak of infection doesn't mean there aren't infections in our community," the mayor said, adding a note of caution that he doesn't want San Antonio "in this situation again six months from now."
Wolff said he supports using multiple models and added that they are largely consistent with statewide models for Texas.
"It does give us some kind of a range in which the mayor and I can start thinking about how we move forward," he said.
The number of deaths related to COVID-19 stands at 33, with no new deaths reported Tuesday. Mayor Ron Nirenberg said 89 people are hospitalized, 54 are in intensive care and 38 are using ventilators.
Officials had reported 58 new cases Saturday, 49 on Sunday and 22 Monday. But Bridger said it was too early to conclude, based on the dwindling number of new cases in recent days, that the city was seeing a trend that suggested it had nearly reached its peak caseload.
Even though about 11,000 people have been tested in Bexar County, with availability of tests "better" than in the past but "not as good as we'd like to see it," health officials now are targeting areas with fewer residents who have been tested, called the city's hotline or used its online screening tool. More door hangers will be placed in low-participation neighborhoods, and outreach teams will be assigned to engage underserved areas.
"We're going to be focusing on those ZIP codes that seem to have the lowest participation in what we're doing around COVID-19, to increase screening and testing in those areas," Bridger said.
In a related matter, Wolff outlined efforts under way at the Bexar County Jail to contain a coronavirus outbreak. The facility has had eight inmates test positive, along with 14 uniformed deputies and three civilians.
"So we're beginning to see the spread in the jail, and I don't think it's going to stop where it is," Wolff said. "So we're constantly stepping up to try to do more to stem this tide of COVID cases within the jail."
The efforts include isolating units where cases are identified; using contact-tracking investigations to find other possible cases; providing more personal protective equipment; and increasing testing capacity. By Thursday, the jail hopes to be able to test everyone in the facility who is symptomatic, Wolff said.
Other large jails have more inmates who have tested positive, including those in Dallas and Harris counties, he said.
"So while our number are low, we expect to continue to have some issues at the jail, and we're taking all the steps that we can reasonably take," Wolff added.
Bexar County is now in its fourth week under city and county stay-at-home orders. Anyone who is symptomatic is encouraged to call the San Antonio COVID-19 Testing Center at 210-233-5970 for information on how to get tested.
shuddleston@express-news.net Twitter: @shuddlestonSA

redpajama_set_name: RedPajamaCommonCrawl


While GOP House leader Tom DeLay, who faces his own legal and ethics problems, pontificated on saving Terri Schiavo and George W. lectured about a "culture of life," their actions spoke louder than their hollow words.
Bush put forward a $2.6 trillion budget that would cut as much as $20 billion from Medicaid, the primary federal health program for the poor, children and disabled people. The House narrowly passed it with DeLay's "Hammer" tactics.
These new cuts come on top of years of previous cuts, which have forced hundreds of thousands of people off the government program. States, facing severe fiscal crisis from the federal cuts, are throwing the most needy off their life-sustaining health care services. Last month this newspaper ran a front-page photo of an 8-year-old boy with cystic fibrosis who will lose the aid from a state health program that helps pay for his treatment, because of federal and state budget cuts. Some "culture of life"!
But in a noteworthy development, the Senate rejected the Bush Medicaid reduction by a 52-48 vote. Seven Republican senators joined all 44 Senate Democrats and one independent to block the cuts. Add that vote to the Republican discomfort Social Security privatization and you have what GOP big shots may call a rebellion in the ranks.
What better way to muffle a moderates' mutiny then to mobilize your extreme right flank? Get those "terror squads" operating, orders Karl Rove. Rev up the propaganda machines, he barks, get that Schiavo case front and center.
We need to strike fear into the heart of these mutineers. Our whole agenda may be on the line, Rove snarls.


Burgerio.com - This great name is for sale on Brandroot!
Get your burger on with this fantastic name that's ideal for restaurants and fast food services. Also well suited for catering and party planning, food delivery, or food truck companies.


To capture the most eligible bachelor in London...London, 1838The handsome Earl of Somersby may just be the most eligible bachelor in London, but has no interest in a wife. As a member of the Brotherhood, Bennett Haile is far more vested in his undercover duties for the crown and protecting the Queen from would-be assassins. For now he has the perfect tool with which to lure out the villains-a young woman with an uncanny likeness to the queen.The spirited Evelyn Marrington is about to live out every country girl's dream-becoming royalty overnight. Under the tutelage of the arrogant Earl of Somersby, she'll have to fool the entire court that she is, in fact, the queen. But as danger threatens from every side, Bennett realizes that his lovely little protegé isn't just placing her life in his hands... She's stealing his heart.
Undercover with the Earl (Entangled Scandalous) 4.3 out of 5 based on 0 ratings. 13 reviews.
The flow of the story and chemistry between the Earl and Evie is breathtaking. The ending might had given me a fluttering feeling but it was just short, left me hanging.
This is book 1 in the Brotherhood of the Sword series. The Earl of Summersby has been told what his next assignment will be, but he don't think it will work. Unwilling to lose his position, he goes forward with the government's plan to keep the Queen safe. Evelyn Marington has been living a quiet life in the country always shadowed by the beauty of her sisters when she is called to help protect the Queen. She is to impersonate the Queen and go to all of her functions until the Queen is well enough to take her place back in society. Can this girl from the country fool everyone into thinking she is the Queen or will she get much more than she bargained for? This was a pretty quick read (165 pgs). There was intrigue, bad guys and a romance. Not much else to ask for in a story!! This is a great start to a new series by DeHart!! Thanks go out to Entangled Publishing via NetGalley for a copy of the book in exchange of an honest review.
Her Majesty has been injured and Evelyn Marrington who bears a striking resemblance to Queen Victoria has been recruited to masquerade as the young Queen. Bennett Haile, the Earl of Somersby, was tasked to instruct Evie to act like the Queen. The intriguing premise drew me to this story and I read it in one go curious to see how it all unfolded. I was not disappointed. While the plot was pretty straightforward with no surprises, the authors' writing is vivid and engaging. She drew me in with her bold descriptions and the emotions (hope, insecurities, lust and love) the characters felt, and I was more than curious to see how it all ended. Evie was a spunky and sweet, and Bennett was the right kind of charming alpha. Undercover with the earl was a quick, sweet and enjoyable read, and I liked the flow of the overall story.
An author/spinster heroine who goes undercover with an earl in Victorian England? Yes, please! I really enjoyed reading Undercover with the Earl, and cannot wait for there to be more in this series. I'm a total sucker for spy/undercover stories, especially ones that bring in a person who's totally inexperienced and seems to not be the obvious choice. (I blame my first TV love, Scarecrow and Mrs. King .) Add in a romantic subplot (again, Scarecrow!), and I'm a goner! It doesn't hurt that I really liked both Bennett and Evelyn. She's pretty much given up on making a good match, especially since she doesn't want to settle for anything less than true love. She figures writing is going to be her first love anyway, so she might as well get herself a cottage and sit and write for the rest of her days. Now if only she could afford it... Bennett's been burned by love before. Engaged to be married, he thought he had the real thing only to find his bride-to-be in bed (his bed!) with another man. As she left him, she made sure to express her opinion that no one else would ever want such a large, brutish man--and the feeling has stuck. He feels an instant attraction to Evelyn, but knows that it will never be... But of course, it's a romance, so you know how it's going to end--instead, it's all about the journey. And though this one is fairly short (165 pages, and over a relatively short time period), there's a whole lot of intrigue and chemistry along for the ride. So...when will book two be out? ;) Rating: 4 stars / A- I received a complimentary copy in exchange for an honest review.
I really liked both Evelyn and Bennett. They both think that they are not looking for marriage. Evelyn because she doesn't think she is attractive or desireable, and Bennett because he doesn't believe in love or that he is loveable. As they work together to keep the Queen's secret, they help each other believe in a different future than what they had planned for themselves. My only complaints are that the story was too short to fully develop the covert mission and there was no resolution to the mystery behind who was behind the attacks. I'm hoping that the reason behind it is that storyline continues into the following books in the series. Overall and enjoyable read. I received an ARC via NetGalley for the purpose of an honest review. I was not compensated for this review, all conclusions are my own.
Originally posted on my blog: Tangled Up In Books I received a copy of this book, from the publisher, in exchange for an honest review. In no way did this sway either my review or my rating! Sigh. Is there anything better than historical swoons? There's just so much about it to get your pulse racing. The propriety, the scandals, the fact that something that we simply think of as "just a kiss" these days was something that a proper unmarried lady just did not do! It makes those stolen moments between two characters who have been doing their damnedest to fight the attractions they have to one another a taboo-like thrill. I love it! I love it all! In a time where women are considered delicate and weak and far more inferior than our manly counterparts, when their only job is to make an excellent match, regardless of age, attraction or feelings, in order to produce heirs and that's pretty much it. Nothing pleases me more than to have a main female character who is both very intelligent and has an independent streak. A woman who wants to be her own person without having to have a man to complete her life. Evelyn was exactly that kind of character. I absolutely adored her. She had dreams beyond being someone's wife and property. She wanted to write adventure novels, and maybe even have them, but mostly to write. Plus she was feisty and fearless and not in the least intimidated by Bennett. Speaking of handsome and hulking Earls...Bennett was just delicious! I loved how he wasn't just the average, run -of-the-mill aristocrat. He wasn't a guy who was going to be content with the idleness that titles and money usually afforded his counterparts among the peerage. He likes living a life of adventure of sorts and action, even a bit of danger. He protects the crown and that's all he ever wanted to do. I think his biggest fault is he doesn't have the slightest clue on how to communicate with a woman. I laugh as I type that because it seemed like, especially in the beginning, every time he attempted to tell Evie what they needed from her it would always come out wrong and they'd end up in an argument because without meaning to he'd end up insulting her somehow. It was quite comedic and fun. I love those kinds of relationships though. The kind where verbal sparring is basically a form of foreplay and stokes the fires of sexual tension that's building between two characters. I think her fire and spirit are what really endears her to him. He's not used to anyone standing up to him let alone a woman half his size who doesn't back down for an instant. When those sparks of anger turn into sparks of desire...boom! I was so pleased that there actually were moments of danger in this book. Not that I wanted Evie in danger of course, more that it added something dark and suspenseful to the story. I liked seeing the protective side come out of Cole. I have a hard time opening myself up to new Historical Romance authors which is something I'm trying very hard to break myself of. It's one of my favorite genres but I put myself in this box of just a few authors I will read from. After reading Undercover with the Earl, I feel safe in saying that my little list of approved HR authors has grown by one and I can't wait to see what else Robyn DeHart has to offer. Thanks goes to Entangled Publishing for the opportunity to read and review this book!
I loved this story. The combination of romance and intrigue made for a wonderful adventure. I live that the heroine wasn't your average Victorian miss, instead she was as headstrong as the queen herself, and the brooding hero was a perfect compliment to her.
Evelyn Marington (Evie) is the odd one out in her family. While her other 4 sisters are slim, graceful and the perfect epitome of ladylike beauty she's petite with a lush figure and head of vibrant but very red hair. Not to mention that she's intelligent, opinionated and doesn't care for simpering flirtations or heavens! to find a rich titled suitor and make a brilliant match. Evie only wishes to be able to afford her own cottage, settle in and be left alone to write. When the young Queen Victoria is injured and has to retire from the public eye to recuperate; to protect the Queen's reputation the Brotherhood of the Sword - the agency dedicated to protecting the Monarch - hit upon the idea to have Evie, who bears a resemblance, impersonate the Queen. Bennett Haile, the Earl of Summersby who is the Queen's cousin is tasked to tutor Evie, and to protect her. A quick and easy read with wonderful chemistry between Evie and Bennett. Both of them are insecure; Evie who has always thought herself plain and unattractive (in comparison to her lovely sisters) while Bennett similarly thinks that no woman could love him for himself after being scorned and cheated by his erstwhile fiancee. When Evie gives Bennett a little peck to "prove that she can't tempt a man" - the situation explodes quite deliciously! The sexual tension is nicely written as Bennett struggles with the protectiveness and possessiveness he soon comes to feel for Evie. Copy gifted in exchange for an honest review.
Fabulous, fast paced read. I highly recommend this book. I could not put it down. It has a very engaging storyline, personable heroine and hero, with mystery and love thrown in throughout each page. I felt like I was on the edge of my seat thru the entire book.
Our heroine, Evelyn Marington face looks like or similar to the Queen's face. Which makes her the perfect decoy to pretend to be the Queen. The hero, Earl of Summersby is a spy for the , Brotherhood, Bennett Haile. His job is to protect the Queen as it appears she is in danger. So with the help of Evelyn they have moved forward to save the Queen...and along the way fall in love.


text:
Embrace the season of giving
Keep in mind those in our midst needing assistance as Christmas approaches.
Frank Bucholtz
Dec. 19, 2012 12:00 p.m.
Christmas is a time of giving, and there are few places in the world where it is easier to give than in North America. Despite a host of challenges, some big and some infinitesimally small, most people here are blessed with enough to eat, a place to live, and access to services that do not exist in many other parts of the world.
Surrey, Delta and White Rock are no exception, although there are definitely needy people among us.
At this time of year (and indeed all year), it is very worthwhile to give to those in need and to organizations which do their best to ensure that everyone is taken care of. To name just a few of those organizations, there are the Surrey Food Bank, Surrey Christmas Bureau, Deltassist, Peace Arch Community Services, and The Salvation Army. There are many, many others.
We have it pretty good in this corner of the world as Christmas 2012 approaches. But it wasn't all that long ago when many Surrey residents were not very well off.
The time I refer to was the 1930s, what many people who grew up in that era call the "Hungry '30s." My father grew up then in South Surrey, and he and his contemporaries still remember it very well.
One Surrey resident who also remembers is retired fire chief Al Cleaver. He spent the early years of his life in East Vancouver before his family came out to Newton, to a five-acre property at 72 Avenue and 124 Street. They moved here about 1937.
He recalled a wonderful Christmas story of the 1930s for me last week that I would like to share with readers.
His family didn't have much money. However, they did dearly want to have a turkey to cook for Christmas dinner. But coming up with the cash was almost impossible. So every member of the family poked throughout the house to find any spare pennies, nickels and dimes. They did find a few of them – but not too many. Al was then sent down to Piggly Wiggly, a well-known grocery firm, which eventually became Safeway, to see if he could get a turkey.
He put his collection of coins on the counter and asked if it was enough to buy a turkey for Christmas dinner. The butcher looked at him, long and hard, and then went into a cooler.
He emerged with a scrawny little turkey – but it was still the real thing. Al proudly took it home. He told me, "Never did any turkey I've eaten taste as good as that one."
After his family moved to Surrey, they were able to grow a good portion of their food. There was always lots of fruit, and most people raised their own animals for meat, eggs and milk. Most people grew big gardens and it was easy to catch fish in the rivers.
Cash continued to be a problem for many Surrey families throughout the 1930s. Work was scarce, and many were on relief, assistance for families with no income. Many single men lived in relief camps, including one in South Surrey, and were paid a small sum for manual labour. That's how the King George Highway project was started.
There was no Employment Insurance, no pensions, and no health insurance. Surrey's lone doctor, F.D. Sinclair, treated many patients without any hope of payment.
But people were very grateful for small things – like scrawny turkeys. It's a good thing to think about during the season of giving.
United in the fight against tobacco
COLUMN: Violent video games need warning labels


text:
Bernard J. Wolfson, Kaiser Health News Bernard J. Wolfson, Kaiser Health News
https://www.pbs.org/newshour/health/why-parents-are-struggling-to-find-mental-health-care-for-their-children
Why parents are struggling to find mental health care for their children
Health May 7, 2019 8:42 AM EST
For several months last spring and summer, my teen daughter, Caroline, experienced near-daily bouts of depression and debilitating panic attacks. During those episodes, she became extremely agitated, sobbing uncontrollably and aggressively rebuffing my attempts to comfort or reason with her.
My daughter was in a dark place, and I was worried.
But I have excellent health insurance, and I thought that would help me find a good therapist.
I dutifully dialed everyone on my health plan's list. Some of them even called me back — only to say they weren't taking new patients, or couldn't see Caroline for three months, or didn't have the training to match her symptoms.
I ultimately found a great therapist who isn't in my health plan's network — and after many months of weekly sessions, Caroline is doing much better.
I'm luckier than most parents, because my health plan covers a significant portion of Caroline's out-of-network therapy. I pay only $45 per session, while some parents shell out north of $200 every week.
The U.S. faces a growing shortage of mental health professionals trained to work with young people.
Think about how perverse this is. Mental health professionals say that with children, early intervention is crucial to avoid more severe and costly problems later on. Yet even parents with good insurance struggle to find care for their children.
The U.S. faces a growing shortage of mental health professionals trained to work with young people — at a time when depression and anxiety are on the rise. Suicide was the No. 2 cause of death for children and young adults from age 10 to 24 in 2017, after accidents.
There is only one practicing child and adolescent psychiatrist in the U.S. for about every 1,800 children who need one, according to data from the American Academy of Child & Adolescent Psychiatry.
Not only is it hard to get appointments with psychiatrists and therapists, but the ones who are available often don't accept insurance.
"This country currently lacks the capacity to provide the mental health support that young people need," says Dr. Steven Adelsheim, director of the Stanford University psychiatry department's Center for Youth Mental Health and Wellbeing.
Alison Bloeser, a Seal Beach, Calif., mom, has struggled for nearly a decade to find effective care for her now 15-year old son's obsessive-compulsive disorder and attention deficit hyperactivity disorder, known as ADHD. In that time, Bloeser says, she has taken him to over 20 therapists and had him on medication — spending more than $20,000 along the way.
"We have a growing number of young people in this country crying out for help at a young age," Bloeser says. "Why are we not addressing that full force?"
There's no one-size-fits-all solution because people's financial and personal situations vary widely.
So let me begin with tips for all parents, even those with skimpy insurance or none at all. A good place to start is the pediatrician's office — whether it's a private practice or a low-cost community clinic.
"When your children reach adolescence, you should be asking their pediatricians to screen for both anxiety and depression," advises Dr. Bhavana Arora, chief medical officer of the Children's Hospital Los Angeles Health Network. A number of pediatricians in her program are becoming increasingly comfortable treating mild to moderate mental health problems in their offices, Arora says.
If your finances are constrained, try a community health clinic that offers mental health services regardless of a family's ability to pay.
For instance, Los Angeles-based AltaMed (www.altamed.org) has 12 clinics in L.A. and Orange counties where children and teens with mild to moderate mental health disorders can get short-term therapy. Medi-Cal picks up the tab for most of those kids. For kids not on Medi-Cal, the clinics charge on a sliding scale.
One way to find a community clinic near you is to search https://findahealthcenter.hrsa.gov/.
Your child's school is another place to seek help.
For many parents, the most productive thing is meeting others who are experiencing similar problems.
Caroline's high school has a mental health counselor whom she visits when she is anxious or feeling blue. She always feels better afterward. If your kid's school doesn't have a mental health counselor, nurses and regular school counselors will likely know of outside options. Talk to them.
Faith-based organizations are increasingly engaged in mental health care. Saddleback Church, with numerous locations around Southern California, offers support groups and counseling. Jewish Family Service agencies nationwide provide counseling on a sliding scale. Muslims can try the Khalil Center, which has branches in Chicago, L.A., the San Francisco Bay Area, New York and Toronto.
If you, like me, have insurance and find a good therapist who is not in your network, try to make it work — if you can possibly afford it.
Start by checking whether you have coverage for out-of-network providers. If not, or if it's not enough, ask if your health plan is willing to treat the therapist as an in-network provider just for your child — an arrangement known as a single-case agreement.
The therapist likely will have to agree to a lower payment.
"Grassroots support groups, finding other parents going through what they're going through, is the launch pad of everything," says Debra Ann Afarian, coordinator of the Orange County, Calif., chapter of Children and Adults With Attention-Deficit/Hyperactivity Disorder.
If you need help and peer support, check with the National Alliance on Mental Illness. It offers a six-week course, "NAMI Basics," which educates parents and puts them in touch with others in the same boat. Go to www.nami.org to find the chapter in your area.
Janis Thereault, of Santa Ana, Calif., whose adult son lives at home and has obsessive-compulsive disorder, searched the website of the International OCD Foundation (www.iocdf.org), which has affiliates around the country, and found local therapists specializing in the illness. They directed her to a support group.
After her son refused therapy for months, Thereault and her husband, Brian, followed the advice of one of the therapists: They told their son if he did not agree to counseling, they would evict him from the house. Members of the support group, some of whom had made similar decisions, offered them a sympathetic ear.
"It's not an easy thing for us to do as parents," Thereault says.
This KHN story first published on California Healthline, a service of the California Health Care Foundation. You can read the original article here.
Left: With adolescent anxiety and depression on the rise, many parents struggle to find mental health care for their children. Photo by Photographee.eu/via Adobe Stock
'Portraits of Resilience' destigmatize depression at one of the world's top universities
By Jeffrey Brown
Klobuchar releases $100 billion substance abuse, mental health plan
By Sara Burnett, Associated Press
The hidden risks of suicide and depression for seniors living in long-term care
By Cat Wise, Frank Carlson, Leah Nagy
What we know about the FDA's new postpartum depression drug
By Laura Santhanam
Read Michael Gerson's sermon sharing his struggle with depression
By Molly Finnegan


The Fire Prevention Officers section of the Marin County Fire Chiefs Association, formed in the 1960's. Full Story coming soon.
The July 15, 2015 General Meeting of the Marin County Fire Prevention Officers section of the Marin County Fire Chiefs Association, held at Skywalker Ranch. (l-r) Warren Glass, Warren Security; Robert Bastianon, Ross Valley; Ryan Boykin, Southern Marin; Rubin Martin, Ross Valley); Hans Henneberque, H & S Associates; Jamie Trotter, Skywalker Ranch; Tim Madura, H & S Associates.
December 3, 1997 - One of the annual planning meetings for the Marin County Fire Prevention Officers section of MCFCA. Warren Glass, owner and principal of Warren Security, hosted the meeting location with breakfast and lunch for participants for many years. (l-r back row) ______, Tom Elliott, Novato; Steve Metcho, Novato; Ron Barney, Tiburon; Matt Cobb, Larkspur; Warren Glass, Warren Security; ________ ; _______. (l-r kneeling) ________; Jim Galli, Kentfield; Jeff Davidson, Mill Valley; Johnny Young, Sausalito; Joel White, Marinwood. Photo by Tom Forster.
The annual planning meeting of the Marin County Fire Prevention Officers Section of the Marin County Fire Chiefs Association, held at Skywalker Ranch on December 3, 1992. (l-r standing) Kent Kirby, Sausalito; ______; ________; Joel White, Marinwood; _____; _____, Novato; John Lando, Kentfield; John Rentz, Novato, _______; Rosemary Bliss, Tiburon; Robert Fox, Corte Madera. (l-r kneeling) Brad Mark, San Rafael; Steve Metcho, Novato; Ken Dubuc, Skywalker Ranch. Photo by Tom Forster.


Supply Chain Management is the organization, planning, control and execution of a product from development and purchasing, through production, warehousing and distribution to the final customer in the most cost effective way possible.
Logistics management is the planning, implementation and coordination of the details of the supply chain.
Third Party Logistics (3PL) is the function by which the owner of goods (The Client Company) outsources various elements of the supply chain to one 3 PL company that can perform the management function of the clients inbound freight, warehousing, order fulfillment, distribution, and outbound freight to the clients customers.
The Allied Group is a 3PL provider to the Life Science industry. While we don't create the product we assist our customers with the logistics on the assembly, kitting, warehousing and distribution of medical devices to physicians and consumers. We are an outsourced Supply Chain Management solution.


text:
\section{Introduction}

Model based signal processing or signal analysis or signal representation
has a rather different point of view from the more traditional filtering
and algorithm based approaches.  However, in all of these, the names of Prony,
Pad\'e, and linear prediction come up.  This note examines these ideas
with the goal of showing they are all based on the same principles and all
can be extended and generalized.

Prony originally posed the problem of separating the individual
characteristics of gases from measurements made on a combination of them
 in 1795 \cite{prony-95}.
We pose this problem using modern terminology and notation as follows.
A signal is modeled as $y(n)$ which consists of equally spaced
samples of $x(t)$ which is a finite sum of $N$ exponentials,
\be
    x(t) = \sum_{k=1}^N \, K_k \, e^{\alpha_k t}.
\label{p0}\ee
The sampling is described by
\be
    y(n) = x(Tn) = \sum_{k=1}^N \, K_k \, e^{\alpha_k T n} =
        \sum_{k=1}^N \, K_k \, \lambda_k^n
\label{p1}\ee
where $\lambda_k = e^{\alpha_kT}$.
Prony's problem is to calculate the $2N$ parameters, $K_k$ and $\alpha_k$
(or $\lambda_k$), from the samples, $y(n)$.

Prony's original approach \cite{prony-95} to solving this problem
is straight-forward but awkward, requiring two different procedures for
even order and odd order systems.
A more flexible and general method can be derived using the z-transform of
Prony's formulation.

Pad\'e's method \cite{pade-1892} is a rational approximation of a polynomial.
It has been shown \cite{weiss-mcdonough-63} to be the z-transformed
version of Prony's method.
The z-transform of (\ref{p1}) can be written as an $N^{th}$ order rational
function of $z$
\be
    Y(z) = \frac{b_0 + b_1 z^{-1} + \cdots + b_M z^{-M}}
    {1 + a_1 z^{-1} + \cdots + a_N z^{-N}}
\label{p2}\ee with $M = N-1$.    The problem is to find the $2N$
parameters, $b_k$ and $a_k$, from the appropriate samples $y(n)$. This can
be expressed as a matrix convolution and solved \cite{bp2,pb}. The
equivalence of Prony's method and Pad\'e's method is discussed in
\cite{weiss-mcdonough-63}. Soewito made use of this equivalence
\cite{soewito} as did Vargas \cite{irlsvb}.

Linear prediction uses a model of the signal which assumes that a particular
value of the signal can be expressed as a weighted linear combination of
the $N$ previous values of the signal \cite{markel,cadzow}.  Finding those
weights turns out to be exactly the same problem as finding the
denominator coefficients in (\ref{p2}) and equivalent to finding the
$\alpha_k$ or $\lambda_k$ in (\ref{p1}).

These methods can all be extended from an interpolation problem to a least
equation error method by using more samples $y(n)$ than the number of
unknown coefficients, $a_n$ and $b_n$ or $K_k$ and $\alpha_k$.
This is discussed in \cite{bp2,pb}.  Iterative methods have been developed
which solve an iterative reweighted least equation error to achieve a
least solution error result \cite{steiglitz-mcbride-65,CKS,shaw}.  McClellan has
shown this to be equivalent to a well known adaptive filtering method
\cite{lee}.

The basic idea behind these three methods is based on the elimination or
minimization of the {\it equation error}, which is a linear problem, rather
than the usual minimization of the {\it solution error}, which is a
nonlinear problem. Some of these formulations also uncouple the calculation
of the numerator and the denominator coefficients \cite{shaw,bp2}

It is possible to pose the problem in the frequency domain and also
minimize the equation error \cite{levy,pb}.  One advantage to doing
that is better conditioning from the uniform sampling of the frequency
response between zero and $\pi$ rather than using the $K$ samples at the
beginning of an infinite time interval \cite{pb,kb,smith,csbfsi} and to deal
with the case where the design criteria are given in the frequency domain.

Prony's method (or Pad\'e's method or linear prediction) in both the time
and frequency domain is not only important for its own sake, but also as a
method to start  iterative methods or being the base of
iterative methods that minimize other error criteria.  There is much still
to be discovered about this important, interesting, and powerful set of
methods.

\subsection*{Literature on Prony's Method and Extensions}

Original \cite{prony-95,pade-1892}, Linear Algebra \cite{strang7}\\
Basic \cite{hildebrand-56,tuttle-71,weiss-mcdonough-63,bp2,handscomb-66,cuyt,burstein,
bultheel,cheneyp}\\
Related \cite{rnm,mcdonough-huggins-68,kikkawa-73,brophy-salazar-74,Jain-71}
\cite{schulz-68,miller-73,maria-fahmy-73,barrodale,blaricum,svensson-73}\\
Applications\cite{markel-72,shanks-67,bpw,brophy-salazar-73,mb3,kalman-58,blaricum-mittra-75,pb2,bpw}\\
Iteration \cite{yengst,steiglitz-mcbride-65,mcbride2,evans-fischl-73,chao-lu-73,lee,fan,stonick4}\\
\\
\section{The Exact Solution or the Interpolation Problem in the Time Domain (Classical Prony)}

The formulation of the time-domain IIR filter design problem and the
methods for its solution are a version of Prony's (actually Pad{\'e}'s)
method.

The z-transform transfer function for an IIR filter \cite{pb} is given by
\be
    H(z) = \frac{B(z)}{A(z)} = \frac{b_0 + b_1z^{-1} + \cdots + b_Mz^{-M}}
                    {1 + a_1z^{-1} + \cdots + a_Nz^{-N}}
        = h_0 + h_1z^{-1} + h_2z^{-2} + \cdots
\label{p3}\ee
In the time domain, this becomes a convolution
\be
    \sum^{N}_{n=0} a_n \ h_{i-n} = b_i
\label{p4}\ee
where $a_0=1$ and $i=0, 1, \cdots, M$
which can be expressed in matrix form by
\be
    \left[ \ba{c}
    b_0\\
    b_1\\
    \vdots\\
    b_M\\
    0\\
    \vdots\\
    0
    \ea \right]
    =
        \left[ \ba{ccccc}
        h_0 & 0 & 0 & \cdots & 0\\
        h_1 & h_0 & 0  &  & \\
        h_2 & h_1 & h_0 &  & \\
        \vdots & & & & \vdots \\
        h_L & & \cdots & & h_0
        \ea \right]
            \left[ \ba{c}
            1\\
            a_1\\
            \vdots\\
            a_N\\
            0\\
            \vdots\\
            0
        \ea \right]
\label{p5}\ee

Note that the $h_n$  in (\ref{p5}) are the infinitely enduring causal impulse response values of the IIR
filter, not the aliased version of it used in \cite{csbfsi} and (\ref{cc104}).
A more compact matrix notation is
\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H} \ea \right]
        \left[ \ba{c}
        {\bf a}\\
        {\bf 0}
        \ea \right]
\label{p6}\ee
where ${\bf H}$ is $(L+1)$ by $(L+1)$, ${\bf b}$ is length-$(M+1)$, and
${\bf a}$ is length-$(N+1)$.  Because the lower $L-N$ terms of the
right-hand vector of (\ref{p5}) are zero, the ${\bf H}$ matrix can be reduced by
deleting the right-most $L-N$ columns to give ${\bf H}_0$ which causes
(\ref{p6}) to become
\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H}_0 \ea \right]
        \left[ \ba{c}
        {\bf a}
        \ea \right]
\label{p7}\ee
Because the first element of ${\bf a}$ is unity, it is partitioned to remove the
unity term and the remaining length-$N$ vector is denoted  ${\bf a^*}$. The
simultaneous equations represented by (\ref{p7}) are uncoupled by further
partitioning of the ${\bf H}$ matrix as shown in
\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H}_1\\ {\bf h}_1 \ \ {\bf H}_2 \ea \right]
        \left[ \ba{c}
        1\\
        {\bf a^*}
        \ea \right]
\label{p8}\ee
where ${\bf H_1}$ is $(M+1)$ by $(N+1)$, ${\bf h}_1$ is length-$(L-M)$,
and ${\bf H}_2$ is $(L-M)$ by $N$. The lower $(L-M)$ equations are written
\be
    {\bf 0}  =  {\bf h}_1  +  {\bf H}_2 {\bf a}^*
\label{p9}\ee
or
\be
    {\bf h}_1  =  - {\bf H}_2 {\bf a}^*
\label{p10}\ee
which must be solved for ${\bf a}^*$. The upper $M+1$ equations of (\ref{p8}) are
written
\be
    {\bf b}   =   {\bf H}_1 {\bf a}
\label{p11}\ee
which allows the calculation of ${\bf b}$.

If $L = N + M$, ${\bf H}_2$ is square. If ${\bf H}_2$ is nonsingular, (\ref{p10})
can be solved exactly for the denominator coefficients in ${\bf a}^*$,
which are augmented by the unity term to give ${\bf a}$.  From (\ref{p11}), the
numerator coefficients in ${\bf b}$ are found.  If ${\bf H}_2$ is singular
\cite{ls} and there are multiple solutions, a lower order problem
can be posed.  If there are no solutions, the methods of the next section
can be used and/or the assumed order increased.

Note that {\it any} trade-off in the order of numerator and denominator can be prescribed.
If the filter is in fact an FIR filter, ${\bf a}$ is unity and ${\bf a}^*$ does
not exist. Under these conditions, (\ref{p11}) states that $b_n = h_n$, which is
one of the cases of FIR frequency sampling covered in Section 3.1 of
\cite{pb}.  Also note that there is no control over the stability of the
filter designed by this method.

The IIR digital filter implemented using the denominator coefficients found in
(\ref{p10}) and the numerator coefficients found in (\ref{p11}) will have an impulse response
$h(n)$ that exactly matches the desired values given in $h(n)$.  The designed filter will
have an impulse response that interpolates the first $L+1$ terms of the given $h(n)$ but
says nothing about the response after that.  This is true if the total number of unknown filter
coefficients, $a(k)$ and $b(k)$ are equal to the number of given values $h(n)$ of the
desired impulse response.

\section{An Approximate Solution: the Least Equation Error Problem in the Time Domain }

In order to obtain better practical filter designs or parameter identification, the interpolation
scheme of the previous section is extended to give an approximation design
method \cite{pb}. It should be noted at the outset that the method developed
in this section minimizes an equation-error measure and not the usual
solution or signal error measure.

The number of samples specified, $L+1$, will be made larger than
the number of filter coefficients, $M+N+1$. This means that ${\bf H}_2$ is
rectangular and, therefore, (\ref{p6}) cannot in general be satisfied. To
formulate an approximation problem, a length-$(L+1)$ error vector
${\bf \varepsilon}$ is introduced in (\ref{p6}) and (\ref{p7}) to give
\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H}_0 \ea \right]
        \left[ \ba{c}
        {\bf a}
        \ea \right] + \left[ {\bf \varepsilon} \right]
\label{p12}\ee
Equation (\ref{p10}) becomes
\be
    {\bf h}_1 - {\bf \varepsilon}  =  - {\bf H}_2 {\bf a}^*
\label{p12a}\ee
where now  ${\bf H}_2$  is rectangular with $(L-M) > N$. Using the same
methods as used to derive (\ref{p10}), the error ${\bf \varepsilon}$ is minimized in a
least-squared error sense by the solution of the normal equations \cite{ls,csbvs1} which occurs
when the error is orthogonal to the impulse response.
\be
    {\bf H}_2^T {\bf h}_1 = - {\bf H}_2^T {\bf H}_2 {\bf a}^*
\label{p13}\ee
Alternatively, this equation can also be derived by taking the gradient of the squared error
and setting it equal to zero (necessary condition for a minimum).

If the equations are not singular, the optimal solution is
\be
     {\bf a}^* = - [{\bf H}_2^T {\bf H}_2]^{-1} {\bf H}_2^T {\bf h}_1.
\label{p14}\ee
which uses the so-called pseudo-inverse \cite{ls,csbvs}.
If the normal equations are singular, the pseudo-inverse
can be used to obtain a minimum norm or reduced order solution.

The numerator coefficients are found by the same techniques as before in
(\ref{p11})
\be
    {\bf b}   =   {\bf H}_1 {\bf a}
\label{p15}\ee
which results in the upper $M+1$ terms in ${\bf \varepsilon}$ being zero
and the total squared equation error ($L_2$ norm) being minimum.

As is true for least-squared-error optimal design of FIR filters, (\ref{p13}) is can be numerically
ill-conditioned and (\ref{p14}) should not be used directly to solve for ${\bf a}^*$.
Special algorithms such as those used by Matlab and LINPACK
\cite{linpack} should be employed.

\section{General Optimal Design of Zeros of Transfer Function}

Given the pole locations designed by minimizing the equation error from (\ref{p11})
or from any other source, the zero locations (numerator coefficients) can be separately
designed to interpolate certain points, to further minimize the equation error,
or to minimize the the solution error.

Reformulate (\ref{p13}) to have the form
\be
    \left[ \ba{c}
    b_0\\
    b_1\\
    \vdots\\
    b_M\\
    0\\
    \vdots\\
    0
    \ea \right]
    + [ e ]
    =
        \left[ \ba{ccccc}
        a_0 & 0 & 0 & \cdots & 0\\
        a_1 & a_0 & 0  &  & \\
        a_2 & a_1 & a_0 &  & \\
        \vdots & & & & \vdots \\
        a_{N-1} & & &  \\
        0 & & & & 0\\
        0 & & \cdots & & a_0
        \ea \right]
            \left[ \ba{c}
            h_0\\
            h_1\\
            \vdots\\
            h_{K-1}\\
            0\\
            \vdots\\
            0
        \ea \right] = Ah
\label{p5a}\ee
where $A$ is a $K$ by $K$ lower triangular matrix which is therefore nonsingular.
The measure of the solution error is the difference between the actual and
desired impulse response:
\be
	e(n) = h_d(n) - h(n).
\label{p5b}\ee
This can be written as a $K$ by $1$ vector and becomes
\be
	e = h_d - h.
\label{p5c}\ee
giving
\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf A} \ea \right]
        \left[ \ba{c}
        {\bf h_d}
        \ea \right] + \left[ {\bf \varepsilon} \right]
\label{p5d}\ee
In terms of the two measures of error, we have
\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] + \left[ {\bf \varepsilon} \right] = \left[ \ba{c} {\bf A} \ea \right]
        \left[ \ba{c}
        {\bf h_d}
        \ea \right]
and
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf A} \ea \right]
        \left[ \ba{c}
        {\bf h_d} + {\bf e}
        \ea \right]
\label{p5e}\ee

If $a$ is found to minimize the equation error according to (\ref{p5}) or (\ref{p6}),
then a consistent $b$ can be found to minimize the equation error with (\ref{p7}).
However, one might want to mix the criteria and find the $b$ that minimizes
the solution error $||e||_2$.  From (\ref{p5e}) we have
\be
   h_d + e =
     A^{-1}\left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = D\left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right]
\label{p5f}\ee
where $D = A^{-1}$.  Partitioning $D$ gives
\be
	H_d + e =  [{\bf D}_1 {\bf D}_2]\left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = D_1 {\bf b}
\label{p5g}\ee
with $D_1$ being $KxM$.

The numerator coefficients that minimize the solution error norm is the solution
to the following normal equations
\be
	D_1^TD_1 b = D_1^T h_d.
\label{p5h}\ee

This formulation can be generalized \cite{bp2,pb} to allow equality constraints and
a variety of other specifications.

\section{Prony's Method in the Frequency Domain gives the Frequency-Sampling Design of IIR Filters}

     In this section a frequency-sampling design method is
developed such that the frequency response of the IIR filter will interpolate or
pass through the given samples of a desired response. This development is
parallel to that used for Prony's method in the time domain.
Since a causal IIR filter cannot have linear phase, the sampled response must
contain both magnitude and phase. The extension of the frequency-sampling
method to a LS-error approximation can be done as
for the FIR filter \cite{pb}. The method presented in this section uses a
criterion based on the equation error rather than the more common
error between the actual and desired frequency response.
Nevertheless, it is a useful noniterative design method. Finally,
a general discussion of iterative design methods for least-squares frequency
response error will be given.

     The method for calculating samples of the frequency response
of an IIR filter can be reversed to design
a filter much the same way it was for the FIR filter using frequency sampling \cite{pb}.
The z-transform transfer function for an IIR filter is given by

\be
    H(z) = \frac{B(z)}{A(z)} = \frac{b_0 + b_1z^{-1} + \cdots + b_Mz^{-M}}
                    {1 + a_1z^{-1} + \cdots + a_Nz^{-N}}.
\label{cc99}\ee
The frequency response of the filter is given by setting $z
=e^{-j\omega}$. Using the notation

\be
    H(\omega) = H(z)|_{z=e^{-j\omega}}.
\label{cc100}\ee
Equally-spaced samples of the frequency response are chosen so
that the number of samples is equal to the number of unknown
coefficients in (\ref{cc99}). These $L+1$ = $M+N+1$ samples of this
frequency response are given by

\be
    H_k = H(\omega_k) = H(\frac{2\pi k}{L+1})
\label{cc101}\ee
and can be calculated from the length-$(L+1)$) DFTs of the numerator
and denominator (padded with zeros to the proper length).

\be
    H_k = \frac{{\cal DFT}\{b_n\}}{{\cal DFT}\{a_n\}} =
        \frac{B_k}{A_k}
\label{cc102}\ee
where the indicated division is term-by-term division for each value
of $k$. Multiplication of both sides of (\ref{cc102}) by $A_k$ gives

\be
    B_k = H_k A_k
\label{cc103}\ee

If the length-$(L+1)$ inverse DFT of $H_k$ is denoted by the length-
$(L+1)$ sequence $h_n$, equation (\ref{cc103}) becomes cyclic convolution
which can be expressed in matrix form by

\be
    \left[ \ba{c}
    b_0\\
    b_1\\
    \vdots\\
    b_M\\
    0\\
    \vdots\\
    0
    \ea \right]
    =
        \left[ \ba{ccccc}
        h_0 & h_L & h_{L-1} & \cdots & h_1\\
        h_1 & h_0 & h_L    &  & \\
        h_2 & h_1 & h_0 &  & \\
        \vdots & & & & \vdots \\
        h_L & & \cdots & & h_0
        \ea \right]
            \left[ \ba{c}
            1\\
            a_1\\
            \vdots\\
            a_N\\
            0\\
            \vdots\\
            0
        \ea \right]
\label{cc104}\ee

Note that the  $h_n$  in (\ref{cc104}) are not the impulse response values
of the filter (they are an aliased version of it) as used in the FIR case or
in (\ref{p5}). Using the same approach as used for Prony's method in the time
domain, a more compact matrix notation is

\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H} \ea \right]
        \left[ \ba{c}
        {\bf a}\\
        {\bf 0}
        \ea \right]
\label{cc105}\ee
where ${\bf H}$ is $(L+1)$ by $(L+1)$, ${\bf b}$ is length-$(M+1)$,
and ${\bf a}$ is length-$(N+1)$.  Because the lower $L-N$ terms of
the right-hand vector of (\ref{cc104}) are zero, the ${\bf H}$ matrix can be
reduced by deleting the right-most $L-N$ columns to give ${\bf H}_0$
which causes (\ref{cc105}) to become

\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H}_0 \ea \right]
        \left[ \ba{c}
        {\bf a}
        \ea \right]
\label{cc106}\ee

Because the first element of ${\bf a}$ is unity, it is partitioned
to remove the unity term and the remaining length-$N$ vector is
denoted  ${\bf a^*}$. The simultaneous equations represented by (\ref{cc106})
are uncoupled by further partitioning of the ${\bf H}$ matrix as
shown in \be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H}_1\\ {\bf h}_1 \ \ {\bf H}_2 \ea \right]
        \left[ \ba{c}
        1\\
        {\bf a^*}
        \ea \right]
\label{cc107}\ee
where ${\bf H_1}$ is $(M+1)$ by $(N+1)$, ${\bf h}_1$ is
length-$(L-M)$, and ${\bf H}_2$ is $(L-M)$ by $N$. The lower $(L-M)$
equations are written

\be
    {\bf 0}  =  {\bf h}_1  +  {\bf H}_2 {\bf a}^*
\label{cc108}\ee
or
\be
    {\bf h}_1  =  - {\bf H}_2 {\bf a}^*
\label{cc109}\ee
which must be solved for ${\bf a}^*$. The upper $M+1$ equations of
(10) are written
\be
    {\bf b}   =   {\bf H}_1 {\bf a}
\label{cc110}\ee
which allows the calculation of ${\bf b}$.

If $L = N + M$, ${\bf H}_2$ is square. If ${\bf H}_2$ is
nonsingular, (\ref{cc109}) can be solved exactly for the denominator
coefficients in ${\bf a}^*$, which are augmented by the unity term
to give ${\bf a}$.  From (\ref{cc110}), the numerator coefficients in ${\bf
b}$ are found.  If ${\bf H}_2$ is singular \cite{ls,csbvs} and there
are multiple solutions, a lower order problem can be posed.  If
there are no solutions, the approximation methods must be
used and/or the assumed order increased.

Note that any order numerator and denominator can be prescribed. If
the filter is in fact an FIR filter, ${\bf a}$ is unity and ${\bf
a}^*$ does not exist. Under these conditions, (\ref{cc110}) states that $b_n
= h_n$, which is one of the cases of FIR frequency sampling covered
\cite{pb}.  Also note that when there is a non-trivial denominator, there is no control
over the stability of the filter designed by this method.

This approach uses of the DFT therefore does not allow the
possibility of unequally spaced frequency samples as was possible
for FIR filter design.

The frequency-sampling design of IIR filters is somewhat more
complicated than for FIR filters because of the requirement that
${\bf H}_2$ be nonsingular. As for the FIR filter, the samples of
the desired frequency response must satisfy the conditions to insure
that $h_n$ are real. The power of this method is its ability to
interpolate arbitrary magnitude and phase specification. In contrast
to most direct IIR design methods, this method does not require any
iterative optimization with the accompanying convergence problems.

As with the FIR version, because this design approach is an
interpolation method rather than an approximation method, the
results may be poor between the interpolation points. This usually
happens when the desired frequency-response samples are not
compatable  with what an IIR filter can achieve.  One solution to
this problem is the same as for the FIR case
\cite{pb}, the use of more frequency samples than the number of
filter coefficients and the definition of an approximation error
function that can be minimized. Another solution is choose another
desired frequency that is closer to what can be achieved.
There is also no simple restriction that
will guarantee stable filters.  If the frequency-response samples
are consistent with an unstable filter, that is what will be
designed.

A complication for the this approach to the design of IIR filters is the need to specify
both the magnitude and phase of the desired frequency response.
This is not a problem for the time-domain design of IIR filters or
for the frequency-domain design of linear phase FIR filters, but
for the frequency domain design of IIR filters, samples of the
desired frequency response are complex numbers which means
both the magnitude and the phase must be specified.

\section{Discrete Least-Squared Equation-Error IIR Filter Design in the Frequency Domain}

Using the same approach as used for the time-domain, the
interpolation scheme is extended to give an
approximation design method in the frequency domain \cite{pb,isccsp08}.
It should again be noted at the
outset that the method developed in this section minimizes an
equation-error measure and not the usual frequency-response error
measure.

The number of frequency samples specified, $L+1$, is made
larger than the number of filter coefficients, $M+N+1$. This means
that ${\bf H}_2$ is rectangular and, therefore, (\ref{cc109}) cannot in
general be satisfied. To formulate an approximation problem, a
length-$(L+1)$ error vector ${\bf \varepsilon}$ is introduced in (\ref{cc106})
and (\ref{cc107}) to give

\be
    \left[ \ba{c}
    {\bf b}\\
    {\bf 0}
    \ea \right] = \left[ \ba{c} {\bf H}_0 \ea \right]
        \left[ \ba{c}
        {\bf a}
        \ea \right] + \left[ {\bf \varepsilon} \right]
\label{cc111}\ee
Equation (\ref{cc109}) becomes \be
    {\bf h}_1 - {\bf \varepsilon}  =  - {\bf H}_2 {\bf a}^*
\label{cc112}\ee where now  ${\bf H}_2$  is rectangular with $(L-M) > N$. Using
the same methods as used to derive (\ref{cc109}), the error ${\bf
\varepsilon}$ is minimized in a least-squared error sense by the
solution of the normal equations \cite{ls} \be
    {\bf H}_2^T {\bf h}_1 = - {\bf H}_2^T {\bf H}_2 {\bf a}^*
\label{cc113}\ee

If the equations are not singular, the solution is \be
     {\bf a}^* = - [{\bf H}_2^T {\bf H}_2]^{-1} {\bf H}_2^T {\bf h}_1.
\label{cc114}\ee If the normal equations are singular, the pseudo-inverse
\cite{ls,csbvs} can be used to obtain a minimum norm or reduced
order solution.

The numerator coefficients are found by the same techniques as
before in (\ref{cc110}) \be
    {\bf b}   =   {\bf H}_1 {\bf a}
\label{cc115}\ee
which results in the upper $M+1$ terms in ${\bf \varepsilon}$
being zero and the total squared equation error being minimum.

As is true for the least squared error design of FIR filters, (\ref{cc113}) is often
numerically ill-conditioned and (\ref{cc114}) should not be used to solve for
${\bf a}^*$. Special algorithms such as those used by Matlab and
LINPACK \cite{ml,linpack} should be employed.

The error ${\bf \varepsilon}$ defined in (\ref{cc111}) can better be
understood by considering the frequency-domain formulation. Taking
the DFT of (\ref{cc111}) gives

\be
    B_k  =   H_k A_k   +  \varepsilon
\label{cc116}\ee
where $\varepsilon$ is the error in trying to satisfy (\ref{cc106}) when the
equations are over-specified.  This can be reformulated in terms of
${\cal E}$, the difference between the frequency response samples of
the designed filter and the desired response samples, by dividing
(\ref{cc106}) by $A_k$ to give

\be
    {\cal E}_k   =  \frac{B_k}{A_k} - H_k  = \frac{\varepsilon_k}{A_k}
\label{cc117}\ee
where ${\cal E}$ is the error in the solution of the approximation
problem, and $\varepsilon$ is the error in the equations defining
the problem. The usual statement of a frequency-domain approximation
problem is in terms of minimizing some measure of ${\cal E}$, but
that results in solving nonlinear equations. The design procedure
developed in this section minimizes the squared error $\varepsilon$,
thus only requiring the solution of linear equations.  There is an
important relation between these problems. Equation (\ref{cc117}) shows that
minimizing $\varepsilon$ is the same as minimizing ${\cal E}$
weighted by $A$.  However, $A$ is unknown until after the problem is
solved.

Although this is posed as a frequency-domain design method, the
method of solution for both the interpolation problem and the LS
equation-error problem is the same as the time-domain Prony's
method, discussed in Section 7.5 of reference \cite{pb}.

\section{General Optimal Design of Zeros of Transfer Function}

Given the pole locations designed by minimizing the equation error, the zero locations can be separately
designed to interpolate certain points, to further minimize the equation error, or to minimize the the
solution error. This is similar to what was said earlier for the time-domain formulation.

\section{Coupled and Uncoupled Formulation of IIR Filter Design}

The formulation of both the time-domain and frequency-domain design
problems in (\ref{p14}) and (\ref{cc109}) uncouple the calculation
of the denominator coefficients (poles) from the calculation of the
numerator coefficients (zeros) but it assumes an equal spacing of the
frequency domain samples (the DFT us used) and the psuedo inverse
allows no error weighting.  Soewito \cite{soewito} uses a different
formulation which allows arbitrary location of the frequency samples
and weights in the minimization of the squared equation error, but
it couples the calculation of the numerator and denominator coefficients.

\section{Comments}
Numerous modifications and extensions can be made to this method. If
the desired frequency response is close to what can be achieved by
an IIR filter, this method will give a design approximately the same
as that of a true least-squared solution-error method. It can be
shown that $\varepsilon = 0 \leftrightarrow {\cal E} = 0$. In some
cases, improved results can be obtained by estimating $A_k$ and
using that as a weight on $\varepsilon$ to approximate minimizing
${\cal E}$. There are iterative methods based on solving (\ref{cc114}) and
(\ref{cc115}) to obtain values for $A_k$.  These values are used as weights
on $\varepsilon$ to solve for a new set of $A_k$  used as a new set
of weights to solve again for $A_k$ \cite{pb}.  The solution of
(\ref{cc114}) and (\ref{cc115}) is sometimes used to obtain starting values for other
iterative optimization algorithms that need good starting values for
convergence.

To illustrate this design method a sixth-order lowpass filter was
designed with 41 frequency samples to approximate.  The magnitude of
those less than 0.2 Hz is one and of those greater than 0.2 is zero.
The phase was experimentally adjusted to result in a good magnitude
response.  The design was performed with Program 9 in the appendix
of \cite{pb} and the frequency response is shown in Figure 7-33 of
\cite{pb}.

 In this section an LS-error approximation method was posed to
design IIR filters. By using an equation-error rather than a
solution-error criterion, a problem resulted that required only the
solution of simultaneous linear equations.

Like the FIR filter version, the IIR frequency sampling design
method and the LS equation-error extension can be used for complex
approximation and, therefore, can design with both magnitude and
phase specifications.

As noted earlier, if the desired frequency-response samples are close to what an IIR
filter of the specified order can achieve, this method will produce
a filter very close to what a true least-squared error method would.
However, when the specifications are not consistent with what can be
achieved and the approximating error is large, the results can be
very poor and in some cases, unstable.  It is often difficult
to set realistic phase response specifications. With this method, it
is even more important to have a design environment that will allow
easy trial-and-error procedure.

Other works on this problem are
\cite{K&I:90,K&I,garcia,lee,kb}. Other references can
be found in \cite{pb,K&I:90}.  The Matlab command {\tt
invfreqz()} which is an inverse to the {\tt freqz()} command gives a
similar or, perhaps, the same result as the method described in this
note but uses a different formulation \cite{levy,smith}.
\cite{brophy,brophy2,evans} A particularly interesting new
Matlab program is $iirlpnorm.m$ which allows the design of {IIR}
filters with different degree numerator and denominators.  It also
allows use of an $L_p$ error minimization.  Unfortunately, it requires
both the zeros and poles to be inside the unit circle.  The poles of
the transfer function should be inside the unit circle to unsure
stability but allowing some zeros to be outside the unit circle (as
in the linear phase {FIR} filter) can improve the phase response.\cite{csbjt}
Soewito \cite{soewito} and Jackson\cite{jackson} formulate an
iterative algorithm where the magnitue and phase are separately
updated to give an optimal magnitue approximation.

\section{Alternative Frequency Domain Formulation}

The use of the {DFT} to reformulate the time domain statement of Prony's
method into the frequency domain uncouples the calculation of the $a_k$
and $b_k$ but requires equally spaced samples of the desired frequency
response.  An alternative formulation used by Soewito \cite{soewito}
requires the calculation of the $a_k$ and $b_k$ together but allows
somewhat arbitrary frequency sample spacing.

\section{Iterative Algorithms using Prony's Methods}

\cite{stonick4,SidAhmed,vb1,icassp01v, irlsvb,soewito}

\section{Other Optimal IIR Filter Design Methods}

Martinez/Parks design \cite{martinez}, Jackson's improvement \cite{lbj2},
others
\cite{saramaki,alkhairy2,RGH,limlee,mclang7,mclang8,lang11,K&I:90,K&I,J&L}
\cite{S&A,cain,graham,crosara,berchin,steiglitz5,deczky5,cadzow5,dudgeon2,soewito}

\section{Summary}

This note has developed a time-domain and a frequency-domain method to
design an IIR digital filter that interpolates desired samples or that
gives an optimal, least squared equation error approximation. These
methods are directly related to Prony, Pad\'e, and linear prediction. In
addition, they can be used to obtain good starting values for
iterative algorithms or iterated themselves to obtain optimal
approximations with other criteria
\cite{levy,CKS,steiglitz-mcbride-65,pb,lbj3}. \baselineskip 2.5ex

redpajama_set_name: RedPajamaArXiv


The top community for Gilmore Girls. Keeping Gilmore Girls alive and news on what the Gilmore cast is up to now. Daily updates since 2005.
GilmoreNews is the top Gilmore Girls fan community, since 2005! Sharing episode discussions, actor updates, and fan contributions.
New episodes of Gilmore Girls are coming to Netflix in 2016. Stay tuned for all your updates here!
Gilmore Girls will be coming back to Netflix for four episodes, 1.5 hours each. "Gilmore Girls: A Year in the Life" will cover one season per episode: Winter, Spring, Summer and Fall. Episodes were filmed from February 2-May 10, 2016.
Stay tuned to GilmoreNews for all the latest!
fitness gym workout on CONTEST: Which Gilmore Girls Character Are You?
Candra on CONTEST: Which Gilmore Girls Character Are You?
Jackie on Was the Young Lorelai a Good Fit?
plombier on CONTEST: Which Gilmore Girls Character Are You?
Tell Us About the DVD!
Want to know about a specific episode of Gilmore Girls? Read up on our past Gilmore Girls episode summaries.
Copyright © 2019 Gilmore News – Gilmore Girls Community. All rights reserved.


text:
All Markup News
JavaScript News
Joomla News
Drupal News
Responsive Calculator
PX to EM
Home » Archive: November 2015
WordPress 4.4 Release Candidate
The release candidate for WordPress 4.4 is now available. RC means we think we're done, but with millions of users and thousands of plugins and themes, it's possible we've missed something. We hope to ship WordPress 4.4 on Tuesday, December 8, but we need your help to get there. If you haven't tested 4.4 yet,…
CVE-2015-8027 Denial of Service Vulnerability / CVE-2015-6764 V8 Out-of-bounds Access Vulnerability
This announcement is for: CVE-2015-8027: a high-impact denial of service vulnerability CVE-2015-6764: a low-impact V8 out-of-bounds access vulnerability CVE-2015-8027 Denial of Service Vulnerability Description and CVSS Score A bug exists in Node.js, all versions of v0.12.x through to v5.x inclusive, whereby an external attacker can cause a denial of service. The severity of this issue…
Continuing to make it easier for Enterprise customers to upgrade to Internet Explorer 11 — and Windows 10
Helping our Enterprise customers stay up-to-date with the latest version of the browser is a top priority for Microsoft. This is particularly important for Windows 7 customers who should upgrade to Internet Explorer 11 by January 12, 2016 to continue receiving security updates and technical support. We understand many customers have web apps and services…
Grunt, Rebooted
Grunt is one of the best-known and most popular task runners in the web developer's toolkit. Now that this project has joined the jQuery Foundation, we're looking to get the project rolling again. Ben Alman, the creator of Grunt, is looking for contributors who can take over the reigns. The team could use some help…
Drupal 8.0.0 released
Today we released Drupal 8.0.0, the first fully supported release of Drupal 8! This is the biggest update ever to Drupal, our open source content management platform. Here are just a few of the hundreds of improvements in Drupal 8: In-context, what-you-see-is-what-you-get (WYSIWYG) editing and previews Comprehensive content modeling out of the box with entities,…
Progressive Web Apps Are the Future
The two-day Chrome Dev Summit at Google's headquarters in Mountain View is a wrap! Vadim and I had a great time attending the summit, and this year, I even had the pleasure to share the stage with Alex Russell (thank you!) to speak about Progressive Web Apps, and specifically web manifests, which we've recently shipped…
Protecting Microsoft Edge against binary injection
In May, we announced that Microsoft Edge was saying goodbye to binary extensibility models such as ActiveX and Browser Helper Objects. This change made browsing in Windows faster, more secure, and more stable than ever, while paving the way for better interoperability with other browsers and modern extension models. Those improvements are at risk, however,…
Introducing EdgeHTML 13, our first platform update for Microsoft Edge
Last week, the first major update for Windows 10 began rolling out to over 110 million devices, including improvements in all aspects of the platform and experience. This update brings Microsoft Edge's rendering engine to EdgeHTML 13, which Windows Insiders have been previewing for the last few months. When we first introduced Microsoft Edge as "Project…
Drupal.org Migrates Content and File Delivery to Fastly
We are so stoked to announce our partnership with Fastly. Fastly is now serving up all of our traffic from the *.drupal.org domain Drupal sites and related services. Drupal.org is big Drupal.org and its services handle over 1.5 billion requests per month; this is a massive amount of traffic for an open source project. Every…
WordPress 4.4 Beta 4
WordPress 4.4 Beta 4 is now available! This software is still in development, so we don't recommend you run it on a production site. Consider setting up a test site just to play with the new version. To test WordPress 4.4, try the WordPress Beta Tester plugin (you'll want "bleeding edge nightlies"). Or you can…
<!--Categories-->
Browser News (1,443)
CMS News (424)
Drupal News (530)
JavaScript News (465)
Joomla News (6,455)
W3C News (854)
Wordpress News (336)
<!--Last News-->
On Auto-Generated Atomic CSS January 15, 2021
Limiting Private API availability in Chromium January 15, 2021
Building an Ethereum app using Redwood.js and Fauna January 14, 2021
Happy 20th Birthday, Drupal January 14, 2021
Donate for All Markup News
Design by Markup Ua. 2008 - 2021.


This stunning and comfortable blouse will complete your outfit. The arms are 3/4 longs, with one flounce at the the end, but in case you prefer a long arm blouse we will happily make it for for you with no additional charges! You can knot your new blouse at the back, it is really very comfortable!
Fabrics: lycra (80% polyesther, 20% elasthan) or stretch velvet (90% polyesther, 10% elasthan). These fabrics are stretch and perfectly adapt to the body. Please note, that in the color chart velvet is specified, otherwise the fabric is lycra.


text:
Season 1 of Project Runway Malaysia featured 15 designers from various parts of the country competing to be the best designer. Judges for the first season were Bernie Chan, Datuk Bernard Chandran, Asiah Mion (editor EH! Magazine), Seema Visamanathan (editor Female Magazine), Wirda Adnan (Chief Editor, Glam Magazine) and Aster Lim (Managing Editor, Female, Marie Claire, Men's Health and Seventeen magazines). There are also guest judges through the season.

The contestants

Challenge

 The designer won Project Runway Malaysia.
 The designer won that challenge.
 The designer was in the bottom two, but was not eliminated.
  The designer lost and was eliminated from the competition.

Episodes

Episode 1
Original airdate: 3 August 2007

The 15 contestants were given their first task: each was given only RM50 and 4m of fabric and also assigned with a model, as well as 1 hour to prepare the models with their respective designers' clothes for their first catwalk in the competition. At the elimination session, eight of the contestants were called out as they are either placed the very top or the very bottom by the judges. Anizam Yusof was the first to leave the competition.
Challenge won by: Nurita Harith
Eliminated: Anizam Yusof

Episode 2
Original airdate: 10 August 2007

The 14 remaining contestants were given their second task. Each designer was given RM70 and 30 minutes to search for usable items from a supermarket. The designers then had to use the items to create a fashion creation with the theme "Funky Street Wear". The winner of this task would receive immunity and be safe from elimination at the next judging. Felix won the task and immunity while Hanizam lost.
Challenge won by: Felix Chin
Eliminated: Hanizam Abd Wahab

Episode 3
Original airdate: 17 August 2007

Bernie told the remaining 13 contestants of their next task which was to come up with a dress that can be worn on the red carpet. In the workroom, Peter Lum introduced the designers to their "client", Nurul, a local celebrity. Nurul then told the designers her style and what materials and colours they may use. They were then given 30 minutes and RM250 to purchase their materials. Ultimately, Alexandrea won the challenge but was not given immunity while Jenny was declared out of the running.
Judges: Datuk Bernard Chandran, Seema Visamanathan, Nurul, Bernie Chan
Challenge won by: Alexandrea Yeo
Eliminated: Jenny Yap
Bottom two: Jenny, Mumtaz

Episode 4
Original airdate: 24 August 2007

The designers have to create a versatile dress that can be worn both during the day and night. Batik and traditional motifs become the main source of inspiration for the designers, among others.
Judges: Datuk Bernard Chandran, Faisol Abdullah, Wirda Adnan, Bernie Chan
Challenge won by: Danny Kok
Eliminated: Mohd Khairi
Bottom two: Khairi, Jezmine

Episode 5
Original airdate: 31 August 2007

The designers have to design the uniform for the National Service Malaysia. The designers visit PLKN Princess Haliza Camp, Sepang to have a physical test. Then the designers have to survey some of the trainees to see what's the problem of the uniform. The designers were given 20 minutes and RM50 to purchase fabric to create their uniforms.  The fabric colors they were allowed to choose from were blue, black and white. Fitri was rushed to the clinic for a medical check-up due to his asthmatic problem. Nurita's design wasn't complete and was noticed by the judges during the judging panel.
Judges: Edmundser, Wirda Adnan, Aster Lim, Bernie Chan
Challenge won by: Alwyn Chua
Eliminated: Nurita Harith
Bottom two: Nurita, Mumtaz

Episode 6
Original airdate: 7 September 2007

The designers have to design beach wear that is very commercial value for PARKSON KLCC. The designers were introduced to Rita Shum, Fashion Director of PARKSON KLCC. Then they were given RM70 to buy fabric for the design. During panel, the judges said that Danny's design is out of title and Mumtaz's design was not up-to-date.
Judges: Edmundser, Aster Lim, Rita Shum, Bernie Chan
Challenge won by: Felix Chin
Eliminated: Mumtaz Rahman
Bottom two: Mumtaz, Danny

Episode 7
Original airdate: 14 September 2007

The designers have to design an outfit for Malaysian singer, Jaclyn Victor for her next performance. First the designers have to show their design for her individually. This week, the designers have to work in group. Then, Jaclyn will choose 3 of the best as the leader, and the leaders have to handpicked their group members. The groups are:

Later, they were given RM100 and 30mins to shop for fabric. During panel, the judges think that Fitri's design is too simple and not suitable for performance. Jezmine was eliminated although it's not her design but because she wasn't independent enough.

Judges: Sonny San, Asiah Mion, Jaclyn Victor, Bernie Chan
Challenge won by: Hatta Dolmat
Eliminated: Jezmine Zaidan
Bottom two: Jezmine, Fitri

Episode 8
Original airdate: 21 September 2007

The theme of the week is to design a makeover for their fellow designers to transform who they are right now. The designers have to design for each other, 2 designers in a group. The groups are:

Unlike last week, they do not have a leader in the group. Later, they were given 15 minutes to sketch for their partners and was given RM60 and 30 minutes to buy fabric.

While they were working in the studio, Peter Lum came and brought them for dinner in a restaurant at Bangsar, Kuala Lumpur. When they reached there, the designers meet Bernie Chan and Maya Karin. She is a singer, actor and VJ. Karin is also the ambassador for L'Oréal Paris. After dinner, Bernie teaches the designers how to catwalk, as they are modeling for each other's design. The designers have to continue their work the next day for it is too late.

Before the fashion show begins, the designers meet Monica Lee, makeup artist of L'Oréal Paris. She gives the designers a makeover and makeup to suit their design.

During panel, the judges do not see any effort and transformation in Danny in Allison's design. And Fitri's design is a bad transformation in Zery, and it makes Zery looks older.

Judges: Redzuan Radzwill, Asiah Mion, Joe Spinelli, Bernie Chan
Challenge won by: Alwyn Chua
Eliminated: Allison Chong
Bottom two: Allison, Fitri

Episode 9
Original airdate: 28 September 2007

Challenge won by: Mohd Fitri Zainal Abidin
Eliminated: Danny Kok
Bottom two: Hatta, Danny

Episode 10
Original airdate: 5 October 2007

The contestants are told to create a "2050 fashion" theme collection as a group.

Challenge won by: Alexandrea Yeo
Eliminated: Zeri Zamry
Bottom two: None

Episode 11
Original airdate: 12 October 2007

The contestants are taken to the athletic gyms, and the task to create the outfit

Challenge won by: Mohd Fitri Zainal Abidin
Eliminated: Alwyn Chua
Bottom two: Alwyn, Felix

Episode 12
Original airdate: 19 October 2007

All four aspiring designers are brought to Datuk Bernard Chandran's boutique and later, 4 set of brand new Nokia Prism 7500 are given for their task. "Inspiration" was the theme for this week. The designers have to wander around KL and get some shots as the "inspiration" for their design.

Fitri came up with a KL Tower shot, Alexandra with Under construction building shot, Hatta with local newspapers headline shot while Felix came up with a pattern shot from an RM10 Ladies Nite Gown.

Judges: Datuk Bernard Chandran, Asiah Mion, Bernie Chan
Challenge won by: Alexandrea Yeo
Eliminated: Mohd Fitri Zainal Abidin
Bottom two: Mohd Fitri Zainal Abidin, Felix

References

2007 Malaysian television seasons
Season 01
2007 in Malaysia
2007 in fashion

redpajama_set_name: RedPajamaWikipedia


text:
Q: Retrieve BitLocker recovery password from AD during MDT deployment I have a very weird problem. I have a PowerShell script that runs during an MDT deployment task sequence. I'm using the following command to get the BitLocker recovery key so I can add it to my log
$result = Get-ADComputer $NewName -Credential $cred -Server $pdc
$BitLocker = Get-ADObject -Credential $cred -Server $pdc -SearchBase $result.DistinguishedName -Filter 'objectclass -eq "msFVE-RecoveryInformation"' -Properties msFVE-RecoveryPassword

This code works fine if I run it on a production machine using PowerShell ISE. If I look at the property values returned, I get this.
BitLocker.DistinguishedName      : CN=2022-01-24T10:25:24-08:00{7D23F401-9CA5-4CA2-9EC5-9463FDB32547},...
BitLocker.msFVE-RecoveryPassword : 626241-008492-619938-120065-533005-637615-269346-477114
BitLocker.Name                   : 2022-01-24T10:25:24-08:00{7D23F401-9CA5-4CA2-9EC5-9463FDB32547}
BitLocker.ObjectClass            : msFVE-RecoveryInformation
BitLocker.ObjectGUID             : 6d1e0e81-6b5e-44ca-abd2-a901ade8eb39

but when I run the same code during the task sequence I get back this
BitLocker.DistinguishedName      : CN=2022-01-24T10:25:24-08:00{7D23F401-9CA5-4CA2-9EC5-9463FDB32547},...
BitLocker.msFVE-RecoveryPassword :
BitLocker.Name                   : 2022-01-24T10:25:24-08:00{7D23F401-9CA5-4CA2-9EC5-9463FDB32547}
BitLocker.ObjectClass            : msFVE-RecoveryInformation
BitLocker.ObjectGUID             : 6d1e0e81-6b5e-44ca-abd2-a901ade8eb39

The recovery key is definitely in AD, I can see it when I look in ADUC but I can not seem to get it during the task sequence. Very bizarre. Anyone have any thoughts?

redpajama_set_name: RedPajamaStackExchange


text:
"Don't Cry, Joni" (or "Don't Cry Joni") is a song written by American country music artist Conway Twitty. He recorded it with his daughter Joni Lee and released it in August 1975 as the single from the album The High Priest of Country Music. The recording was a pop hit peaking at number 63 on the US Billboard Hot 100 chart and number 4 on the Billboard Country Singles chart.

Story of "Don't Cry Joni"
"Don't Cry Joni" is Twitty's duet with his then 16-year-old daughter, Joni Lee Jenkins. According to country music writer Tom Roland, Joni Lee had wanted — after years of resistance — to become an entertainer, and her father decided that allowing her to duet with him on the song (which he had written years earlier) might provide some encouragement.

"Don't Cry Joni" represented the only major hit by any of Twitty's children; two other children — Kathy (aka "Jessica James/Jesseca James") and Michael (aka "Charlie Tango") — failed to achieve notable success. In addition, the song was one of just two non-Loretta Lynn duets in which Twitty had major success (the other being a guest shot on Ronnie McDowell's 1988 cover of "It's Only Make Believe.")

This "B-side" single began achieving its popularity at the end of the summer of 1975, and eventually peaked at No. 4 that October. Its peak in popularity was unusual; Roland noted that the popularity of most other two-sided hits usually happened concurrently.

Plot
The song's plot is about a 15-year-old girl (Joni, sung by Joni Lee) who develops a crush on a 22-year-old neighbor of her family (Jimmy, of which part was sung by the elder Twitty). Despite Joni begging in a love letter to Jimmy to "please say you'll wait for me" so that they may someday get married, and pleading fidelity in the meantime ("Saving all my kisses just for you, signed with love forever true"), Jimmy goes over to Joni's house to explain their age differences and that he needs to find a suitable wife now. Joni is brought to tears with this realization.

Later in the song, Jimmy moves away and tries to find the woman of his dreams, but Joni's words ("Jimmy please say you'll wait for me, I'll grow up someday you'll see") are burned into his mind. Five years pass, and Jimmy realizes that Joni — although seven years his junior — may be the girl he was looking for all along. Jimmy decides to go back to his hometown, look up Joni and try to start a relationship ... only to realize his own heartbreak: Joni has married Jimmy's best friend, John.

Commercial performance
On the week of December 20, 1975, the original version by Conway Twitty and his daughter entered the US Billboard Hot 100 It spent seven weeks on the chart, reaching its peak position of number 63 on the week of January 31, 1976.

Composition, writing and recording
The song was written by Conway Twitty. The recording was produced by Owen Bradley.

Track listing
7" single MCA Records MCA-40407 (1975, US), MCA-60182 (re-issue, US), MCA MI-30293 (1975)
 A. "Don't Cry Joni" (4:21)
 (vocal accompaniment: Joni Twitty)
 B. "Touch the Hand" (3:29)

Promo 7" single MCA Records MCA-40407 (1975, US)
 A. "Don't Cry Joni" (Long Version) (4:21)
 (vocal accompaniment: Joni Twitty)
 B. "Don't Cry Joni" (Short Version) (3:05)

Cover versions
German singer Gunter Gabriel translated the song into German and released it (under the title "Tina, weine nicht") in 1980 in a duet with his daughter Yvonne.

The song was also covered by Irish country singer Daniel O'Donnell with his sister Margo.

Charts

References

External links
 Conway Twitty – "Don't Cry Joni" (single) on Discogs
 Conway Twitty – "Don't Cry Joni" (song) on AllMusic

1975 songs
1975 singles
Conway Twitty songs

MCA Records singles
Songs written by Conway Twitty
Song recordings produced by Owen Bradley


text:
No matter how you view it, Bush is on the nose
By Murray Goot - posted Tuesday, 9 October 2007 Sign Up for free e-mail updates!
What do Australians think of the US or of President George W. Bush? How malleable are their views on the wars in Iraq and Afghanistan?
And how many support the US-Australia alliance?
A new survey, commissioned by the US Studies Centre at the University of Sydney and conducted among 1,213 respondents nationally, shows that how researchers ask questions such as these, the order in which they ask them and the response options they provide often, though not always, affects the answers they get. Public opinion is often more complex, more malleable and more context-dependent than the answers to single questions suggest.
What do we think, for example, about the impact of US foreign policy on Australia? In the USSC survey, half the sample were asked about whether they were worried about the impact of US foreign policy and the other half were asked whether they were pleased about it. While 38 per cent said they were very worried (rather then somewhat worried or not at all worried), no fewer than 52 per cent said they were not at all pleased (rather than somewhat pleased or very pleased).
And the pattern of response - many fewer respondents very worried than not at all pleased - was reproduced in relation to every other aspect of American influence on Australia the survey addressed in this way, including: trade subsidies (30 per cent, 56 per cent), policies on climate change (31 per cent, 52 per cent), business practices (19 per cent, 39 per cent) and workplace practices (20 per cent, 39 per cent). Advisers asked to look at the questionnaire anticipated a difference in the way the two questions would be answered, but the pattern they anticipated was precisely the reverse.
Sometimes, however, different ways of asking a question make no difference. The questions about Bush in the USSC survey are a case in point. Regardless of whether respondents were simply asked their opinion of the President, asked their opinion after saying how they thought most Australians viewed the President (75 per cent said that the overall opinion of most Australians was unfavourable) or asked their opinion after being told that most Australians seem to have an unfavourable view of the US President, the pattern of response was remarkably similar: 63 per cent unfavourable, 68 per cent unfavourable and 66 per cent unfavourable, respectively.
Nor is there any evidence that respondents' views were affected by a sense that expressing hostility to Bush was politically correct. Respondents were less unfavourable to Bush (68 per cent) than they estimated most Australians to be (75 per cent).
Even where the wording of the questions is the same, the order in which questions are asked can affect responses. In the USSC survey, what respondents said about Iraq and Afghanistan partly depended on whether they were asked about these conflicts before or after being asked questions about the threat posed by al-Qaida or Islamic fundamentalism and whether Australia's decision to join the US government in the war on terror had made Australia more of a terrorist target.
Those who were asked about Australia's military presence in Iraq before being asked these questions were less likely (33 per cent) than those who were asked after (39 per cent) to support Australia's presence. Similarly, those who were asked about Australia's military presence in Afghanistan before being asked these questions were less likely (44 per cent) than those who were asked after (50 per cent) to support Australia's presence.
This suggests that the framing of these conflicts matters; more particularly, that the threat from al-Qaida or Islamic fundamentalism (about which respondents were divided) is a more powerful mobilising device than the idea that the war on terror has made Australia more of a terrorist target (notwithstanding that three-quarters of the respondents said it had).
The connection between the nature of the threat and attitudes to the wars is confirmed by looking at the process in reverse.
While those who were asked about the threat from al-Qaida or Islamic fundamentalism after being asked about the wars in Iraq and Afghanistan were less likely to say the threat has been exaggerated (40 per cent) than those who were asked before (46 per cent), views about whether Australia had become a greater terrorist target remained the same.
First published in The Australian on October 3, 2007.
Murray Goot, who directed the survey, is a visiting professor at the US Studies Centre, University of Sydney, and professor of politics and international relations at Macquarie University.


Wilson, S.S., Joseph, P.V., Mohanakumar, K. & Johannessen, O.M. Interannual and long term variability of low level jetstream of the Asian summer monsoon. Tellus. Series A, Dynamic meteorology and oceanography 70, (2018).
Chen, L., Fettweis, X., Knudsen, E.M. & Johannessen, O.M. Impact of cyclonic and anticyclonic activity on Greenland ice sheet surface mass balance variation during 1980–2013. International Journal of Climatology 36, (2016).
Chen, L., Knudsen, E.M. & Johannessen, O.M. Cyclone activities and associated accumulation/temperature changes over the Greenland Ice Sheet. Davos Atmosphere and Cryosphere Assembly (2013).
Johannessen, O.M., Miles, M.W. & Babiker, M. Unprecedented Retreat in a 50-Year Observational Record for Petermann Glacier, North Greenland. Atmospheric and Oceanic Science Letters 6, (2013).


text:
Other Games-Archive
Cossacks - should I buy it?
Carolus Rex
February 12, 2002, 06:54
A collegue showed it to me and it seems to be a great game. What do you think of it? It's RTS, does that make it uninteresting for old civ addicts like myself?
mactbone
It's a neat idea for a game, and has some great concepts, but I don't feel an addiction, and it just doesn't make me want to play it.
The economy really kind of bogs you down, and the scenarios are downright sadistic. For the Caribbean one, I had to play through it a ton of times, and figure out EXACTLY everything I had to do to succeed.
The best parts were, the artillery can be stolen if you have no units around it, the resources like Iron and Coal are used up whenever you shoot(unfortunately, it also goes down just for having gunpowder units), and the mercenaries, really are mercenaries and unique to the regular units.
I never know their names, But i smile just the same
New faces...Strange places,
Most everything i see, Becomes a blur to me
-Grandaddy, "The Final Push to the Sum"
DinoDoc
Age of Empires II would be the better choice.
I make no bones about my moral support for [terrorist] organizations. - chegitz guevara
For those who aspire to live in a high cost, high tax, big government place, our nation and the world offers plenty of options. Vermont, Canada and Venezuela all offer you the opportunity to live in the socialist, big government paradise you long for. –Senator Rubio
I wouldn't recommend AOK, except for multiplayer games. The single player isn't very fun.
If you haven't done so yet, I suggest you check out Eropa Universalis. It goes from 1419-1819. It's realtime, but it's based on a board game, so it feels like a turn-based game going really fast. You, can, and I do, pause it very often to set up orders.
C0ckney
Simply put: The single player sucks donkey balls, the multiplayer is ace.
"The Christian way has not been tried and found wanting, it has been found to be hard and left untried" - GK Chesterton.
"The most obvious predicition about the future is that it will be mostly like the past" - Alain de Botton
Paul Hanson
It takes far too long. You have to sit there for an hour on average building up a half-decent economy, before a couple of their mercenaries wander into your city and nick all your villagers.
"Paul Hanson, you should give Gibraltar back to the Spanish" - Paiktis, dramatically over-estimating my influence in diplomatic circles.
Eyewerks - you know you want to visit. No really, you do. Go on, click me.
Thanks for the replies, but could you please elaborate?
I once played a game that took a lot of time. Its name is Civ2... That doesn't sound as something negative to me, on the contrary. And if the other nations' units walk right in, I'd say it must have been because you were weak on defense. Could also happen a lot in Civ2 before I grasped even the basics of the game.
C0ckney,
Why is singleplayer bad; a lousy AI?
DinoDoc,
Why would you choose AoE2 instead?
I also checked some reviews on the net. Not too praising... Maybe when it comes down in price?
Alright, I got bored of the game, because it's Command and Conquer, but on valium. The economy slows the game to a craaaaawl. Then there is the incredible difficulty of the single player game. I would try and borrow it from someone first to make sure you like it, or wait until it's cheap.
Carl, yeah the AI stinks in places, the fact on random maps you can't set teams so all the AI players are all against you, it takes forever and a day, it isn't hard, its just tedious.
But the multiplayer makes up for it IMO.